Tootfinder

Assumption-lean Inference for Network-linked Data
Wei Li, Nilanjan Chakraborty, Robert Lunde
https://arxiv.org/abs/2510.00287 https://arxiv.org/pdf/2510.00…

Assumption-lean Inference for Network-linked Data
We consider statistical inference for network-linked regression problems, where covariates may include network summary statistics computed for each node. In settings involving network data, it is often natural to posit that latent variables govern connection probabilities in the graph. Since the presence of these latent features makes classical regression assumptions even less tenable, we propose an assumption-lean framework for linear regression with jointly exchangeable regression arrays. We …

Generalized Quantum Stein's Lemma and Reversibility of Quantum Resource Theories for Classical-Quantum Channels
Bjarne Bergh, Nilanjana Datta, Anirudh Khaitan
https://arxiv.org/abs/2509.13280

Generalized Quantum Stein's Lemma and Reversibility of Quantum Resource Theories for Classical-Quantum Channels
We extend the recent proof of the Generalized Quantum Stein's Lemma by Hayashi and Yamasaki [arXiv:2408.02722] to classical-quantum (c-q) channels. We analyze the composite hypothesis testing problem of testing a c-q channel $\mathcal{E}^{\otimes n}$ against a sequence of sets of c-q channels $(\mathcal{S}_n)_n$ (satisfying certain natural assumptions), under parallel strategies. We prove that the optimal asymptotic asymmetric error exponent is given by the regularization of Umegaki channel div…

Replaced article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- The Glider Equation for Asymptotic Lenia
Hiroki Kojima, Ivan Yevenko, Takashi Ikegami

The Hidden Cost of Readability: How Code Formatting Silently Consumes Your LLM Budget
Dangfeng Pan, Zhensu Sun, Cenyuan Zhang, David Lo, Xiaoning Du
https://arxiv.org/abs/2508.13666

The Hidden Cost of Readability: How Code Formatting Silently Consumes Your LLM Budget
Source code is usually formatted with elements like indentation and newlines to improve readability for human developers. However, these visual aids do not seem to be beneficial for large language models (LLMs) in the same way since the code is processed as a linear sequence of tokens. Furthermore, these additional tokens can lead to increased computational costs and longer response times for LLMs. If such formatting elements are non-essential to LLMs, we can reduce such costs by removing them …

The Glider Equation for Asymptotic Lenia
Hiroki Kojima, Ivan Yevenko, Takashi Ikegami
https://arxiv.org/abs/2508.04167 https://arxiv.org/pdf/2508.04167

A generalization of the beam problem: Connection to multi-component Camassa-Holm dynamics
Richard Beals, Jacek Szmigielski
https://arxiv.org/abs/2509.14639 https://

A generalization of the beam problem: Connection to multi-component Camassa-Holm dynamics
We extend the Euler-Bernoulli beam problem, formulated as a matrix string equation with a matrix-valued density, to a setting where the density takes values in a Clifford algebra, and we analyze its isospectral deformations. For discrete densities, we prove that the associated matrix Weyl function admits a Stieltjes-type continued fraction expansion with Clifford-valued coefficients. By mapping the problem from the finite interval to the real line, we uncover a direct link to a multi-component …

Recurrence Patterns Correlation
Gabriel Marghoti, Matheus Palmero Silva, Thiago de Lima Prado, Sergio Roberto Lopes, J\"urgen Kurths, Norbert Marwan
https://arxiv.org/abs/2508.11367

On the geometry of WDVV equations and their Hamiltonian formalism in arbitrary dimension
S. Opanasenko, R. Vitolo
https://arxiv.org/abs/2509.13757 https://…

On the geometry of WDVV equations and their Hamiltonian formalism in arbitrary dimension
It is known that in low dimensions WDVV equations can be rewritten as commuting quasilinear bi-Hamiltonian systems. We extend some of these results to arbitrary dimension $N$ and arbitrary scalar product $η$. In particular, we show that WDVV equations can be interpreted as a set of linear line congruences in suitable Plücker embeddings. This form leads to their representation as Hamiltonian systems of conservation laws. Moreover, we show that in low dimensions and for an arbitrary…

Replaced article(s) found for nlin.SI. https://arxiv.org/list/nlin.SI/new
[1/1]:
- The direct linearization scheme with the Lam\'e function: The KP equation and reductions
Xing Li, Ying-ying Sun, Da-jun Zhang

On a matrix constrained CKP hierarchy
Song Li, Kelei Tian, Zhiwei Wu
https://arxiv.org/abs/2510.09054 https://arxiv.org/pdf/2510.09054

On a matrix constrained CKP hierarchy
The algebraic structures of integrable hierarchies play an important role in the study of soliton equations. In this paper, we use splitting theory to give a matrix representation of a constrained CKP hierarchy, which can be considered as a generalization of the $\hat{A}_{2n}^{(2)}$-KdV hierarchy and the constrained KP hierarchy. An equivalent construction in terms of the pseudo-differential operator is discussed. Darboux transformations, scaling transformation and tau functions $\ln τ_f$ for …