Tootfinder

Ukrainischer Militär: Russland bereitet größere Offensiven vor
Laut einem hochrangigen ukrainischen Armeevertreter bereitet Russland nach jüngsten ukrainischen Geheimdienst-Erkenntnissen größere Offensiven vor. Teilweise reichten die Planungen bis ins kommende Jahr. Die geplanten Vorstöße zielten unter anderem darauf ab, der Ukraine den Zugang zum Schwarzen Meer abzuschneiden, sagte der Vize-Präsidialamtsleiter und Oberst Paw…
📑

Ukraine-Liveblog: ++ Ukraine meldet Tote nach russischen Angriffen ++
Bei russischen Drohnenangriffen im Norden der Ukraine sind nach Behördenangaben mindestens fünf Menschen getötet worden. Die russische Besatzung im Süden der Ukraine meldet Stromausfälle nach ukrainischen Angriffen.

Im Jahr 2024 wurden mehr als zwei Drittel aller neuen #Wohngebäude in #Deutschland primär mit #Wärmepumpen beheizt.
Ihr Anteil hat sich in zehn Jahren mehr als verdoppelt. Tr…

Mehr als zwei Drittel der im Jahr 2024 errichteten Wohngebäude heizen mit Wärmepumpen
In immer mehr neuen Wohngebäuden in Deutschland werden Wärmepumpen zum Heizen genutzt. Mehr als zwei Drittel (69,4 %) der knapp 76 100 im Jahr 2024 fertiggestellten Wohngebäude nutzen Wärmepumpen zur primären, also überwiegend für das Heizen eingesetzten Energie. Gegenüber 2023 stieg der Anteil um rund 5 Prozentpunkte, gegenüber 2014 (31,8 %) hat er sich mehr als verdoppelt, wie das Statistische Bundesamt (Destatis) mitteilt. Wärmepumpen kommen vor allem in Ein- und Zweifamilienhä…

The #QEMU contribution policy is being updated to make it clear we don't currently accept #llm generated code: https://

On Independence Number of Comaximal Subgroup Graph
Angsuman Das, Arnab Mandal
https://arxiv.org/abs/2506.03848 https://arxiv.org/pdf/…

On Independence Number of Comaximal Subgroup Graph
In this paper, we establish sharp thresholds on the independence number of the comaximal subgroup graph $Γ(G)$ that guarantee solvability, supersolvability, and nilpotency of the underlying group $G$. Specifically: \begin{itemize} \item For solvability, we prove that any group $G$ with independence number $α(Γ(G))\leq 51$ must be solvable, and show that the alternating group $A_5$ is uniquely determined by its graph. \item For supersolvability, we show that $α(Γ(G))\leq 14$ implies $G$…

Better Late than Never: the Complexity of Arrangements of Polyhedra
Boris Aronov, Sang Won Bae, Sergio Cabello, Otfried Cheong, David Eppstein, Christian Knauer, Raimund Seidel
https://arxiv.org/abs/2506.03960

Better Late than Never: the Complexity of Arrangements of Polyhedra
Let $\mathcal{A}$ be the subdivision of $\mathbb{R}^d$ induced by $m$ convex polyhedra having $n$ facets in total. We prove that $\mathcal{A}$ has combinatorial complexity $O(m^{\lceil d/2 \rceil} n^{\lfloor d/2 \rfloor})$ and that this bound is tight. The bound is mentioned several times in the literature, but no proof for arbitrary dimension has been published before.

A Hybrid Approach to Indoor Social Navigation: Integrating Reactive Local Planning and Proactive Global Planning
Arnab Debnath, Gregory J. Stein, Jana Kosecka
https://arxiv.org/abs/2506.02593

A Hybrid Approach to Indoor Social Navigation: Integrating Reactive Local Planning and Proactive Global Planning
We consider the problem of indoor building-scale social navigation, where the robot must reach a point goal as quickly as possible without colliding with humans who are freely moving around. Factors such as varying crowd densities, unpredictable human behavior, and the constraints of indoor spaces add significant complexity to the navigation task, necessitating a more advanced approach. We propose a modular navigation framework that leverages the strengths of both classical methods and deep rei…

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

Spin parallel transport and holonomy on a spherical two-dimensional electron gas
The quantum conductance of circuits built on flat (Euclidean) two-dimensional electron gases in known to show a symmetric response to the inversion of Rashba spin-orbit coupling fields in Aharonov-Casher interference patterns. Here, we show that this symmetry breaks down in curved (non-Euclidean) circuits defined on a spherical two-dimensional electron gas. We demonstrate that this is a consequence of parallel spin transport and holonomy on the surface of the sphere, and that a symmetric respon…

The random $k$-SAT Gibbs uniqueness threshold revisited
Arnab Chatterjee, Amin Coja-Oghlan, Catherine Greenhill, Vincent Pfenninger, Maurice Rolvien, Pavel Zakharov, Kostas Zampetakis
https://arxiv.org/abs/2506.01359

The random $k$-SAT Gibbs uniqueness threshold revisited
We prove that for any $k\geq3$ for clause/variable ratios up to the Gibbs uniqueness threshold of the corresponding Galton-Watson tree, the number of satisfying assignments of random $k$-SAT formulas is given by the `replica symmetric solution' predicted by physics methods [Monasson, Zecchina: Phys. Rev. Lett. (1996)]. Furthermore, while the Gibbs uniqueness threshold is still not known precisely for any $k\geq3$, we derive new lower bounds on this threshold that improve over prior work [Montan…

Learning collective variables that preserve transition rates
Shashank Sule, Arnav Mehta, Maria K. Cameron
https://arxiv.org/abs/2506.01222 https://

Learning collective variables that preserve transition rates
Collective variables (CVs) play a crucial role in capturing rare events in high-dimensional systems, motivating the continual search for principled approaches to their design. In this work, we revisit the framework of quantitative coarse graining and identify the orthogonality condition from Legoll and Lelievre (2010) as a key criterion for constructing CVs that accurately preserve the statistical properties of the original process. We establish that satisfaction of the orthogonality condition …

Dhvani: A Weakly-supervised Phonemic Error Detection and Personalized Feedback System for Hindi
Arnav Rustagi, Satvik Bajpai, Nimrat Kaur, Siddharth Siddharth
https://arxiv.org/abs/2506.02166

Dhvani: A Weakly-supervised Phonemic Error Detection and Personalized Feedback System for Hindi
Computer-Assisted Pronunciation Training (CAPT) has been extensively studied for English. However, there remains a critical gap in its application to Indian languages with a base of 1.5 billion speakers. Pronunciation tools tailored to Indian languages are strikingly lacking despite the fact that millions learn them every year. With over 600 million speakers and being the fourth most-spoken language worldwide, improving Hindi pronunciation is a vital first step toward addressing this gap. This …