Tootfinder

Atomreaktor für US-Armee: BWXT arbeitet an 1,5-MW-Minireaktor als Demonstrator
Ein transportabler Minireaktor soll die Stromversorgung militärischer US-Stützpunkte sicherstellen. BWXT arbeitet mit Rolls-Royce an einem Prototypen.

Crystals and quantum twist automorphisms
Woo-Seok Jung, Euiyong Park
https://arxiv.org/abs/2507.01306 https://arxiv.org/pdf/2507.0130…

Crystals and quantum twist automorphisms
Let $η_w$ be the quantum twist automorphism for the quantum unipotent coordinate ring $\mathrm{A}_q(\mathfrak{n}(w))$ introduced by Kimura and Oya. In this paper, we study the quantum twist automorphism $η_w$ in the viewpoint of the crystal bases theory and provide a crystal-theoretic description of $η_w$. In the case of the $*$-twisted minuscule crystals of classical finite types, we provide a combinatorial description of $η_w$ in terms of (shifted) Young diagrams. We further investigate t…

Aspects of 4d $\mathcal{N}=1$ $ADE$ gauge theories from M-theory: decomposition, automorphisms, and generalised symmetries
Osama Khlaif, Marwan Najjar
https://arxiv.org/abs/2508.00564

Aspects of 4d $\mathcal{N}=1$ $ADE$ gauge theories from M-theory: decomposition, automorphisms, and generalised symmetries
We study the decomposition of 4d $\mathcal{N}=1$ gauge theories with Lie algebras of type $\mathfrak{su}(N)$, $\mathfrak{so}(2N)$, and $\mathfrak{e}_{6}$, realized via M-theory geometric engineering. These theories, together with their novel decomposition structure, arise from quotienting the Bryant--Salamon spin bundle over the 3-sphere by special finite subgroups acting simultaneously on both the fiber and base. We show that these gauge theories admit both inner and outer automorphisms, enabl…

This https://arxiv.org/abs/2208.00676 has been replaced.
link: https://scholar.google.com/scholar?q=a

A Pansiot-type subword complexity theorem for automorphisms of free groups
Inspired by Pansiot's work on substitutions, we prove a similar theorem for automorphisms of a free group F of finite rank: if a right-infinite word X represents an attracting fixed point of an automorphism of F, the subword complexity of X is equivalent to n, n log log n, n log n, or n^2. The proof uses combinatorial arguments analogue to Pansiot's as well as train tracks. We also define the recurrence complexity of X, and we apply it to laminations. In particular, we show that attracting lami…

Trump erhöht durch Entsendung von Atom-U-Booten Spannungen mit Russland
Atomares Säbelrasseln: Mit der Entsendung von zwei Atom-U-Booten hat US-Präsident Donald Trump die Spannungen mit Russland wegen des Ukraine-Kriegs weiter angeheizt.
Trump begründete die Verlegung der U-Boote mit "hoch provokativen Äußerungen" des früheren russischen Präsidenten Dmitri Medwedew, der zuvor eine Anspielung auf das russische Atomwaffenarsen…
📑

Ukraine-Liveblog: ++ Selenskyj kündigt Austausch von 1.200 Kriegsgefangenen an ++
Der ukrainische Präsident Selenskyj hat den Austausch weiterer Kriegsgefangener angekündigt. In der russischen Stadt Sotschi ist durch herabgestürzte Teile einer abgeschossenen Drohne ein Öllager in Brand geraten.

Die Polizei versucht wohl grade mit einem Kran die Boxen vom #Adenauer #SRP des #ZPS @…

Austausch über Atemrhythmen

Settle–Carlisle line! ❤️ Did it in 2023, stopped at Ribblehed to go and admire the viaduct more closely.
https://www.youtube.com/watch?v=DGbtl3i5WBI

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

On Distinguishing Graphs and Cost Number using Automorphism Representations
A \textit{distinguishing coloring} of a graph is a vertex coloring such that only the identity automorphism of the graph preserves the coloring. A \textit{2-distinguishable graph} is a graph which can be distinguished using 2 colors. The \textit{cost} $ρ(G)$ of a 2-distinguishable graph is the smallest size of a color set of a distinguishing coloring of $G$. The \textit{determining number} of a graph, $Det(G)$, is the minimum number of nodes, which if fixed by a coloring, would ensure that the…