Tootfinder

A Minimal Substitution Basis for the Kalmar Elementary Functions
Mihai Prunescu, Lorenzo Sauras-Altuzarra, Joseph M. Shunia
https://arxiv.org/abs/2505.23787

A Minimal Substitution Basis for the Kalmar Elementary Functions
We show that the class of Kalmar elementary functions can be inductively generated from the addition, the integer remainder and the base-two exponentiation, hence improving previous results by Marchenkov and Mazzanti. In addition, we further prove that the substitution basis defined by these three operations is minimal.

A Computational Search for Minimal Obstruction Graphs for the Lov\'{a}sz--Schrijver SDP Hierarchy
Yu Hin Au, Levent Tun\c{c}el
https://arxiv.org/abs/2505.24735

A Computational Search for Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
We study the lift-and-project relaxations of the stable set polytope of graphs generated by $\text{LS}_+$, the SDP lift-and-project operator devised by Lovász and Schrijver. In particular, we focus on searching for $\ell$-minimal graphs, which are graphs on $3\ell$ vertices whose stable set polytope has rank $\ell$ with respect to $\text{LS}_+$. These are the graphs which are the most challenging for the $\text{LS}_+$ operator according to one of the main complexity measures (smallest graphs w…

Finitely Summable $K$-homology, the Index Pairing, and Cantor Minimal Systems
Levi Lorenzo
https://arxiv.org/abs/2505.24135 https://a…

Finitely Summable $K$-homology, the Index Pairing, and Cantor Minimal Systems
We study index pairings for crossed-product $C^*$-algebras arising from minimal actions on the Cantor set. We utilize Putnam's orbit-breaking AF-subalgebras and embeddings to show we can compute any index pairing for Cantor minimal system crossed products using Connes' trace formulas. In the case of odometers, we show that the associated algebras have uniformly finitely summable $K$-homology.

On the minimality of pancake decomposition of surface germs
Davi Lopes Medeiros, Euripedes Carvalho da Silva, Emanoel Souza
https://arxiv.org/abs/2505.23976

On the minimality of pancake decomposition of surface germs
The abnormal surfaces called snakes and circular snakes, defined in \cite{GabrielovSouza}, are special types of surface germs capturing the outer Lipschitz phenomena relevant to the outer classification problem. We provide algorithms to obtain a minimal pancake decomposition, i.e., where the number of pancakes is minimal, for snakes and circular snakes. We call a pancake decomposition obtained from our algorithm a greedy pancake decomposition. We also prove that greedy pancake decompositions of…

How to Favicon in 2025: Three files that fit most needs
It’s time to rethink how we cook a set of favicons for modern browsers and stop the icon generator madness. Frontend developers currently have to deal with 20 static PNG files just to display a tiny website logo in a browser tab or on a touchscreen. Read on to see how to take a smarter approach and adopt a minimal set of icons that fits most modern needs.
🖌️

How to Favicon in 2025: Three files that fit most needs—Martian Chronicles, Evil Martians’ team blog
Prefer SVG over PNG, trust browsers to downscale, drop obscure formats—the ultimate, exhaustive guide to favicons for modern web. Includes steps for static HTML and Webpack.

Anosov actions: minimality of foliations or suspension action
Rodrigo R. Lopes, Carlos Maquera, R\'egis Var\~ao
https://arxiv.org/abs/2505.24598 https:…

Anosov actions: minimality of foliations or suspension action
We prove that an Anosov action of $\mathbb{R}^k$ over a compact manifold $M$ transitive on regular sub-cones satisfies the dichotomy: each stable and unstable leaf is dense or the Anosov action is topologically conjugated to a suspension of a $\mathbb{Z}^k$-Anosov action. This represents an important progress toward addressing Verjovsky's extended conjecture for Anosov actions, as developed by Barbot and Maquera.

Seit wir #TheLastOfUs geschaut haben, bin ich dem #Zombie-Genre wieder etwas nähergekommen. Oder vielleicht eher dem postapokalyptischen Genre mit Zombies gewürzt.
Als ich bei #DTRPG „ZombHell: Minimal…

Entanglement Detection with Variational Quantum Interference: Theory and Experiment
Rui Zhang, Zhenhuan Liu, Chendi Yang, Yue-Yang Fei, Xu-Fei Yin, Yingqiu Mao, Li Li, Nai-Le Liu, Yu-Ao Chen, Jian-Wei Pan
https://arxiv.org/abs/2505.24764

Entanglement Detection with Variational Quantum Interference: Theory and Experiment
Entanglement detection serves as a fundamental task in quantum information science, playing a critical role in quantum benchmarking and foundational studies. As the number of controllable qubits continues to increase, there emerges a pressing demand for scalable and robust entanglement detection protocols that can maintain high detection capability while requiring minimal resources. By integrating the positive partial transposition criterion with variational quantum interference, we develop an …

This https://arxiv.org/abs/2504.15962 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csRO_…

Blimp-based Crime Scene Analysis
Crime is a critical problem -- which often takes place behind closed doors, posing additional difficulties for investigators. To bring hidden truths to light, evidence at indoor crime scenes must be documented before any contamination or degradation occurs. Here, we address this challenge from the perspective of artificial intelligence (AI), computer vision, and robotics: Specifically, we explore the use of a blimp as a "floating camera" to drift over and record evidence with minimal disturbanc…

Identifiability through special linear measurements
Fulvio Gesmundo, Alexandros Grosdos, Andr\'e Uschmajew
https://arxiv.org/abs/2505.24328 https://

Identifiability through special linear measurements
We show that one can always identify a point on an algebraic variety $X$ uniquely with $\dim X +1$ generic linear measurements taken themselves from a variety under minimal assumptions. As illustrated by several examples the result is sharp, that is, $\dim X$ measurements are in general not enough for unique identifiability.