Tootfinder

"The precision of our analysis notwithstanding, the sad truth is that the future looks bleak and insurrectional, particularly for those in the USA. As these words hit the web, the SCOTUS has effectively abolished universal injunctions to presidential power, thereby kicking off the democracy overrule process we predicted exactly three years ago in this magazine–needless to say, a prediction we would have loved to get wrong."

The Best Way To Predict The Future
In a scene of the vastly underrated 2003 sequel film "The Matrix Reloaded", Neo, played by Keanu Reeves, meets "The Oracle", a sentient program interpreted by the late Gloria Foster. In that fragment, The Oracle offers Neo a piece of candy, and Neo asks whether she knows if he is going to accept it or not. The unfazed Oracle responds "Wouldn't be much of an Oracle if I didn't!"

Generalizing blocking semiovals in finite projective planes
Marilena Crupi, Antonino Ficarra
https://arxiv.org/abs/2507.05037 https://

Generalizing blocking semiovals in finite projective planes
Blocking semiovals and the determination of their (minimum) sizes constitute one of the central research topics in finite projective geometry. In this article we introduce the concept of blocking set with the $r_\infty$-property in a finite projective plane $\text{PG}(2,q)$, with $r_\infty$ a line of $\text{PG}(2,q)$ and $q$ a prime power. This notion greatly generalizes that of blocking semioval. We address the question of determining those integers $k$ for which there exists a blocking set of…

Largest zero-dimensional intersection of $r$ degree $d$ hypersurfaces
Deepesh Singhal, Yuxin Lin
https://arxiv.org/abs/2507.05732 https://

Largest zero-dimensional intersection of $r$ degree $d$ hypersurfaces
Suppose we have $r$ hypersurfaces in $\mathbb{P}^m$ of degree $d$, whose defining polynomials are linearly independent, and their intersection has dimension $0$. Then what is the largest possible intersection of the $r$ hypersurfaces? We conjecture an exact formula for this problem and prove it when $m=2$. We show that this can be used to compute the generalized hamming weights of the projective Reed-Muller code $\operatorname{PRM}_q(d,2)$ and hence settle a conjecture of Beelen, Datta and Ghor…

On-chip magnon polaritons in the ultrastrong coupling regime
Shugo Yoshii, Manuel M\"uller, Ryo Ohshima, Matthias Althammer, Yuichiro Ando, Hans Huebl, Masashi Shiraishi
https://arxiv.org/abs/2507.06065

On-chip magnon polaritons in the ultrastrong coupling regime
Light-matter interactions underpin the quantum technologies from quantum information processing to quantum sensing. When the coupling strength of light-matter interactions approaches the resonance frequencies of light and matter - the ultrastrong coupling regime - antiresonant (counter-rotating) processes, in which a photon and a matter excitation are simultaneously created or annihilated, induce non-negligible ground-state quantum entanglement between light and matter. Ultrastrong coupling thu…

An inexact inertial projective splitting algorithm with strong convergence
M. Marques Alves, J. E. Navarro Caballero, R. T. Marcavillaca
https://arxiv.org/abs/2507.05382

An inexact inertial projective splitting algorithm with strong convergence
We propose and study a strongly convergent inexact inertial projective splitting (PS) algorithm for finding zeros of composite monotone inclusion problems involving the sum of finitely many maximal monotone operators. Strong convergence of the iterates is ensured by projections onto the intersection of appropriately defined half-spaces, even in the absence of inertial effects. We also establish iteration-complexity results for the proposed PS method, which likewise hold without requiring inerti…

SHARP: Shared State Reduction for Efficient Matching of Sequential Patterns
Cong Yu, Tuo Shi, Matthias Weidlich, Bo Zhao
https://arxiv.org/abs/2507.04872 h…

SHARP: Shared State Reduction for Efficient Matching of Sequential Patterns
The detection of sequential patterns in data is a basic functionality of modern data processing systems for complex event processing (CEP), OLAP, and retrieval-augmented generation (RAG). In practice, pattern matching is challenging, since common applications rely on a large set of patterns that shall be evaluated with tight latency bounds. At the same time, matching needs to maintain state, i.e., intermediate results, that grows exponentially in the input size. Hence, systems turn to best-effo…

Learning Agile Tensile Perching for Aerial Robots from Demonstrations
Kangle Yuan, Atar Babgei, Luca Romanello, Hai-Nguyen Nguyen, Ronald Clark, Mirko Kovac, Sophie F. Armanini, Basaran Bahadir Kocer
https://arxiv.org/abs/2507.06172

Learning Agile Tensile Perching for Aerial Robots from Demonstrations
Perching on structures such as trees, beams, and ledges is essential for extending the endurance of aerial robots by enabling energy conservation in standby or observation modes. A tethered tensile perching mechanism offers a simple, adaptable solution that can be retrofitted to existing robots and accommodates a variety of structure sizes and shapes. However, tethered tensile perching introduces significant modelling challenges which require precise management of aerial robot dynamics, includi…

This looks very cool.
'OpenAIRE in collaboration with Area Science Park organizes a hands-on workshop titled “Where LEGO Meets FAIR Data,” designed to introduce the principles of FAIR data through a creative, interactive simulation using LEGO metaphors.'
https://www.

Torsors over moduli spaces of vector bundles over curves of fixed determinant
Indranil Biswas, Jacques Hurtubise
https://arxiv.org/abs/2507.05690 https://

Torsors over moduli spaces of vector bundles over curves of fixed determinant
Let ${\mathcal M}$ be a moduli space of stable vector bundles of rank $r$ and determinant $ξ$ on a compact Riemann surface $X$. Fix a semistable holomorphic vector bundle $F$ on $X$ such that $χ(E\otimes F)= 0$ for $E \in \mathcal M$. Then any $E\in \mathcal M$ with $H^0(X, E\otimes F) = 0 = H^1(X, E\otimes F)$ has a natural holomorphic projective connection. The moduli space of pairs $(E,\, \nabla)$, where $E\, \in\, \mathcal M$ and $\nabla$ is a holomorphic projective connection on $E$, is …

Witnessing and guiding sets of tangles
Annegret Seibt
https://arxiv.org/abs/2507.04394 https://arxiv.org/pdf/2507.04394

Witnessing and guiding sets of tangles
Tangles o er a way to indirectly but precisely capture cluster-like though possibly fuzzy substructures in discrete data. In this paper, we analyze witnessing and guiding sets of tangles that can help to find proper cluster candidates for given tangles. We show that every k-tangle has a witnessing set whose size is bounded in an exponential function in k which improves a result of Grohe and Schweizer. Further, we generalize a result of Diestel, Elbracht and Jacobs by providing a characterizatio…