Tootfinder

BWT for string collections
Davide Cenzato, Zsuzsanna Lipt\'ak, Nadia Pisanti, Giovanna Rosone, Marinella Sciortino
https://arxiv.org/abs/2506.01092 htt…

BWT for string collections
We survey the different methods used for extending the BWT to collections of strings, following largely [Cenzato and Lipták, CPM 2022, Bioinformatics 2024]. We analyze the specific aspects and combinatorial properties of the resulting BWT variants and give a categorization of publicly available tools for computing the BWT of string collections. We show how the specific method used impacts on the resulting transform, including the number of runs, and on the dynamicity of the transform with resp…

On a Ramsey--Tur\'{a}n variant of Roth's theorem
Matija Buci\'c, Micha Christoph, Jaehoon Kim, Hyunwoo Lee, Varun Sivashankar
https://arxiv.org/abs/2507.22831 https:…

On a Ramsey--Turán variant of Roth's theorem
A classical theorem of Roth states that the maximum size of a solution-free set of a homogeneous linear equation $\mathcal{L}$ in $\mathbb{F}_p$ is $o(p)$ if and only if the sum of the coefficients of $\mathcal{L}$ is $0$. In this paper, we prove a Ramsey--Turán variant of Roth's theorem, with respect to a natural notion of ``structured'' sets introduced by Erdős and Sárközy in the 1970's. Namely, we show that the following statements are equivalent: $(a)$ Every solution-free set $A$ of $…

Rethinking Layer-wise Model Merging through Chain of Merges
Pietro Buzzega, Riccardo Salami, Angelo Porrello, Simone Calderara
https://arxiv.org/abs/2508.21421 https://

Rethinking Layer-wise Model Merging through Chain of Merges
Fine-tuning pretrained models has become a standard pathway to achieve state-of-the-art performance across a wide range of domains, leading to a proliferation of task-specific model variants. As the number of such specialized modules in-creases, merging them into a unified model without retraining has become a critical challenge. Existing merging techniques often rely on interference heuristics,importance weighting, or activation matching while treating each layer independently, thereby failing…

Wenn Scheuer, Spahn oder Klöckner Fehler machen, bleiben Konsequenzen aus. #Verantwortung? Fehlanzeige. Genau das fördert #Politikverdrossenheit und stärkt die #NoAfD. Ein Blick auf de…

Fehlende Rücktritte, fehlende Gespräche: Verantwortungslosigkeit trifft Sprachlosigkeit zwischen den Generationen
Politische Verantwortung bedeutet, Fehler einzugestehen und Konsequenzen zu ziehen. Doch viele Politiker tun genau das Gegenteil – und untergraben damit das Vertrauen in die Demokratie. Außerdem in…

Sichere Akkus: Lithium-Metall-Batterien mit integriertem Flammschutzmittel
Lithium-Metall-Batterien sind energiereich, können jedoch bei Überhitzung schnell in Brand geraten. Ein Polymer soll das verhindern.

Kiedy piszesz bibliotekę w #RustLang, bo chcesz bezpiecznego kodu, a zamiast tego dostajesz jakiś paskudny #heisenbug z przekłamaniem danych.
https://…

A combinatorial characterization of Kim's lemma for pairs of bi-invariant types
James E. Hanson
https://arxiv.org/abs/2507.21366 https://arxiv.org/pdf/…

A combinatorial characterization of Kim's lemma for pairs of bi-invariant types
We give a combinatorial consistency-inconsistency configuration that is equivalent to the failure of the following form of Kim's lemma for a given $k$: $(\star)$ For any set of parameters $A$, formula $φ(x,b)$, and $A$-bi-invariant types $p$ and $q$ extending $\mathrm{tp}(b/A)$, if $φ(x,b)$ $k$-divides along $p$, then it divides along $q$. We then give an equivalent technical variant of $(\star)$ that is non-trivial over arbitrary invariance bases. We also show that the failure of weaker ve…

Evidence for single variant in altermagnetic RuO2(101) thin films
Cong He, Zhenchao Wen, Jun Okabayashi, Yoshio Miura, Tianyi Ma, Tadakatsu Ohkubo, Takeshi Seki, Hiroaki Sukegawa, Seiji Mitani
https://arxiv.org/abs/2508.13720

Evidence for single variant in altermagnetic RuO2(101) thin films
Altermagnetism presents intriguing possibilities for spintronic devices due to its unique combination of strong spin-splitting and zero net magnetization. However, realizing its full potential hinges on fabricating single-variant altermagnetic thin films. In this work, we present definitive evidence for the formation of single-variant altermagnetic RuO2(101) thin films with fully epitaxial growth on Al2O3(1-102) r-plane substrates, confirmed through rigorous structural analyses using X-ray diff…

Simpler is Faster: Practical Distance Reporting by Sorting Along a Space-Filling Curve
Sarita de Berg, Ivor van der Hoog, Eva Rotenberg, Emil Toftegaard G{\ae}de
https://arxiv.org/abs/2508.19891

Simpler is Faster: Practical Distance Reporting by Sorting Along a Space-Filling Curve
Range reporting is a classical problem in computational geometry. A (rectangular) reporting data structure stores a point set $P$ of $n$ points, such that, given a (rectangular) query region $Δ$, it returns all points in $P \cap Δ$. A variety of data structures support such queries with differing asymptotic guarantees such as $k$-d trees, range trees, $R$-trees, and quadtrees. A common variant of range queries are distance reporting queries, where the input is a query point $q$ and a radius $…

Flow-weighted Layered Metric Euclidean Capacitated Steiner Tree Problem
Thomas Bl\"asius, Henrik Cs\"ore, Max G\"ottlicher, Elly Schmidt, Wendy Yi
https://arxiv.org/abs/2508.20041

Flow-weighted Layered Metric Euclidean Capacitated Steiner Tree Problem
Motivated by hierarchical networks, we introduce the Flow-weighted Layered Metric Euclidean Capacitated Steiner Tree (FLaMECaST) problem, a variant of the Euclidean Steiner tree with layered structure and capacity constraints per layer. The goal is to construct a cost-optimal Steiner forest connecting a set of sources to a set of sinks under load-dependent edge costs. We prove that FLaMECaST is NP-hard to approximate, even in restricted cases where all sources lie on a circle. However, assuming…