Tootfinder

Replaced article(s) found for physics.atom-ph. https://arxiv.org/list/physics.atom-ph/new
[1/1]:
- Perturbation-assisted Observation of the Lowest Vibrational Level of the $\mathrm{b}^{3}\Pi_{0}$ ...
Yang, Nie, Yu, Liu, Avalos, He, Klos, Kotochigova, Dieckmann
https://arxiv.org/abs/2510.17166 https://mastoxiv.page/@arXiv_physicsatomph_bot/115411364513995859
- Direct Measurement of the $5s5p\,{}^1P_1 \to 5s4d\,{}^1D_2$ Decay Rate in Strontium
Naohiro Okamoto, Takatoshi Aoki, Yoshio Torii
https://arxiv.org/abs/2510.22184 https://mastoxiv.page/@arXiv_physicsatomph_bot/115450966319591523
- Turbulence and far-from-equilibrium equation of state of Bogoliubov waves in Bose-Einstein Conden...
Ying Zhu, Giorgio Krstulovic, Sergey Nazarenko
https://arxiv.org/abs/2408.15163 https://mastoxiv.page/@arXiv_condmatquantgas_bot/113038670682163852
- Observation of quantum free fall and the consistency with the equivalence principle
Or Dobkowski, et al.
https://arxiv.org/abs/2502.14535 https://mastoxiv.page/@arXiv_quantph_bot/114040790353608831
- Microwave-field quantum metrology with inherent robustness against detection losses enabled by Ry...
Kurzyna, Niewelt, Mazelanik, Wasilewski, Demkowicz-Dobrza\'nski, Parniak
https://arxiv.org/abs/2505.01506 https://mastoxiv.page/@arXiv_quantph_bot/114459737137154531
toXiv_bot_toot

I appreciate AOC cleaving apart the false “both sides are the same” equivalence of the word “populism” here. https://mastodon.online/@mastodonmigration/116082081470440947

Rewriting Systems on Arbitrary Monoids
Eduardo Magalh\~aes
https://arxiv.org/abs/2601.10564 https://arxiv.org/pdf/2601.10564 https://arxiv.org/html/2601.10564
arXiv:2601.10564v1 Announce Type: new
Abstract: In this paper, we introduce monoidal rewriting systems (MRS), an abstraction of string rewriting in which reductions are defined over an arbitrary ambient monoid rather than a free monoid of words. This shift is partly motivated by logic: the class of free monoids is not first-order axiomatizable, so "working in the free setting" cannot be treated internally when applying first-order methods to rewriting presentations.
To analyze these systems categorically, we define $\mathbf{NCRS_2}$ as the 2-category of Noetherian Confluent MRS. We then prove the existence of a canonical biadjunction between $\mathbf{NCRS_2}$ and $\mathbf{Mon}$.
Finally, we classify all Noetherian Confluent MRS that present a given fixed monoid. For this, we introduce Generalized Elementary Tietze Transformations (GETTs) and prove that any two presentations of a monoid are connected by a (possibly infinite) sequence of these transformations, yielding a complete characterization of generating systems up to GETT-equivalence.
toXiv_bot_toot

'Disgraceful statement' — Ukraine condemns International Red Cross over 'moral equivalence' on energy strikes: https://benborges.xyz/2026/01/15/175128.html

Fanciful Figurines flip Free Flood-It -- Polynomial-Time Miniature Painting on Co-gem-free Graphs
Christian Rosenke, Mark Scheibner
https://arxiv.org/abs/2602.00690 https://arxiv.org/pdf/2602.00690 https://arxiv.org/html/2602.00690
arXiv:2602.00690v1 Announce Type: new
Abstract: Inspired by the eponymous hobby, we introduce Miniature Painting as the computational problem to paint a given graph $G=(V,E)$ according to a prescribed template $t \colon V \rightarrow C$, which assigns colors $C$ to the vertices of $G$. In this setting, the goal is to realize the template using a shortest possible sequence of brush strokes, where each stroke overwrites a connected vertex subset with a color in $C$. We show that this problem is equivalent to a reversal of the well-studied Free Flood-It game, in which a colored graph is decolored into a single color using as few moves as possible. This equivalence allows known complexity results for Free Flood-It to be transferred directly to Miniature Painting, including NP-hardness under severe structural restrictions, such as when $G$ is a grid, a tree, or a split graph. Our main contribution is a polynomial-time algorithm for Miniature Painting on graphs that are free of induced co-gems, a graph class that strictly generalizes cographs. As a direct consequence, Free Flood-It is also polynomial-time solvable on co-gem-free graphs, independent of the initial coloring.
toXiv_bot_toot

Crosslisted article(s) found for math.DG. https://arxiv.org/list/math.DG/new
[1/1]:
- Smooth Fractal Trees: Analytic Generators and Discrete Equivalence
Henk Mulder