Tootfinder

Unambiguous discrimination of the change point for quantum channels
Kenji Nakahira
https://arxiv.org/abs/2508.06785 https://arxiv.org/pdf/2508.06785…

Unambiguous discrimination of the change point for quantum channels
Identifying the precise moment when a quantum channel undergoes a change is a fundamental problem in quantum information theory. We study how accurately one can determine the time at which a channel transitions to another. We investigate the quantum limit of the average success probability in unambiguous discrimination, in which errors are completely avoided by allowing inconclusive results with a certain probability. This problem can be viewed as a quantum process discrimination task, where th…

On fibred products of toposes
L\'eo Bartoli, Olivia Caramello
https://arxiv.org/abs/2509.07719 https://arxiv.org/pdf/2509.07719

On fibred products of toposes
In the setting of relative topos theory, we show that the pullback of a relative presheaf topos on an arbitrary fibration is the relative presheaf topos on its inverse image. To this end, we develop and exploit a notion of extension with base change of a morphism of sites along the canonical functor. This provides a tool to compare the canonical relative site of the direct (resp. inverse) image with the direct (resp. inverse) image of the canonical relative site: although these operations do no…

Observables of boundary RG flows from string field theory
Jaroslav Scheinpflug, Martin Schnabl, Jakub Vo\v{s}mera
https://arxiv.org/abs/2510.07155 https://…

Observables of boundary RG flows from string field theory
We present simple explicit formulae for the change of the $g$-function, boundary state, boundary spectrum and structure constants between the endpoints of short boundary RG flows at next-to-leading order. The formulae are derived using open string field theory and tested on integrable RG flows between conformal boundary states in unitary Virasoro minimal models.

MOSAIC: Minimax-Optimal Sparsity-Adaptive Inference for Change Points in Dynamic Networks
Yingying Fan, Jingyuan Liu, Jinchi Lv, Ao Sun
https://arxiv.org/abs/2509.06303 https://…

MOSAIC: Minimax-Optimal Sparsity-Adaptive Inference for Change Points in Dynamic Networks
We propose a new inference framework, named MOSAIC, for change-point detection in dynamic networks with the simultaneous low-rank and sparse-change structure. We establish the minimax rate of detection boundary, which relies on the sparsity of changes. We then develop an eigen-decomposition-based test with screened signals that approaches the minimax rate in theory, with only a minor logarithmic loss. For practical implementation of MOSAIC, we adjust the theoretical test by a novel residual-bas…

Oruga: An Avatar of Representational Systems Theory
Daniel Raggi, Gem Stapleton, Mateja Jamnik, Aaron Stockdill, Grecia Garcia Garcia, Peter C-H. Cheng
https://arxiv.org/abs/2509.04041

Oruga: An Avatar of Representational Systems Theory
Humans use representations flexibly. We draw diagrams, change representations and exploit creative analogies across different domains. We want to harness this kind of power and endow machines with it to make them more compatible with human use. Previously we developed Representational Systems Theory (RST) to study the structure and transformations of representations. In this paper we present Oruga (caterpillar in Spanish; a symbol of transformation), an implementation of various aspects of RST.…

Quenched and annealed heat kernel estimates for Brox's diffusion
Xin Chen, Jian Wang
https://arxiv.org/abs/2509.08559 https://arxiv.org/pdf/2509.08559

Quenched and annealed heat kernel estimates for Brox's diffusion
Brox's diffusion is a typical one-dimensional singular diffusion, which was introduced by Brox (1986) as a continuous analogue of Sinai's random walk. In this paper, we will establish quenched heat kernel estimates for short time and annealed heat kernel estimates for large time of Brox's diffusion. The proofs are based on Brox's construction via the scale-transformation and the time-change arguments as well as the theory of resistance forms for symmetric strongly recurrent Markov processes. We…

Data-driven discovery of dynamical models in biology
Bartosz Prokop, Lendert Gelens
https://arxiv.org/abs/2509.06735 https://arxiv.org/pdf/2509.06735

Data-driven discovery of dynamical models in biology
Dynamical systems theory describes how interacting quantities change over time and space, from molecular oscillators to large-scale biological patterns. Such systems often involve nonlinear feedbacks, delays, and interactions across scales. Classical modeling derives explicit governing equations, often systems of differential equations, by combining mechanistic assumptions, experimental observations, and known physical laws. The growing complexity of biological processes has, however, motivated…

A Conceptual Introduction To Signature Change Through a Natural Extension of Kaluza-Klein Theory
Vincent Moncrief, Nathalie E. Rieger
https://arxiv.org/abs/2510.02492 https://…

A Conceptual Introduction To Signature Change Through a Natural Extension of Kaluza-Klein Theory
We propose an extension of basic Kaluza-Klein theory in which the higher-dimensional Lorentzian manifold develops a Cauchy horizon rather than remaining globally hyperbolic as in the conventional framework. In this setting, the $U(1)$-generating Killing field, assumed to exist in Kaluza-Klein theory, undergoes a transition in its causal character, from spacelike in the globally hyperbolic region to timelike in an acausal extension through a horizon. This yields a (lower-dimensional) quotient ma…

Time for another "review". This one's hard. While the book was quite interesting, it required me to be quite open-minded. Still, I think it's worth mentioning:
Robert Wright — Nonzero: The Logic of Human Destiny
The book basically focused on a thesis that both biological evolution and cultural evolution are a thing, they are directional and this directionality can be explained together using game theory — as eventually leading to more non-zero sum games.
It consists of three chapters. The first one is is focused on the history of civilization. It features many examples from different parts of the world, which makes it quite interesting. The author argues that the culture inevitably is evolving as information processing techniques improve — from writing to the Internet.
The second chapter is focused on biological evolution. Now, the argument is that it's not quite random, but actually directed towards greater complexity — eventually leading to the development of highly intelligent species, and a civilization.
The third chapter is quite speculative and metaphysical, and I'm just going to skip it.
The book is full of optimism. Capitalism creates freedom — because people are more productive when they're working for their own gain, so the free market eliminates slavery. Globalisation creates networks of interdependence that make wars uneconomic. Increased contacts between different cultures makes people more tolerant. And eventually, the humanity may be able to unite facing a common "external" enemy — the climate change.
What can I say? The examples are quite interesting, the whole theory seems self-consistent. Still, I repeatedly looked at the publication date (it's 1999), and wondered if author would write the same thing today (yes, I know I can search for his current opinions).
#books #bookstodon @…

On the propagation of mountain waves: linear theory
Adrian Constantin, J\"org Weber
https://arxiv.org/abs/2509.26125 https://arxiv.org/pdf/2509.26125

On the propagation of mountain waves: linear theory
We derive and establish a solution concept for the linear mountain wave problem in two dimensions. After linearizing the governing equations and a change of variables, the problem can be stated as a Dirichlet boundary value problem for a Helmholtz equation in terms of the vertical wind profile in the upper half-plane, with altitude-dependent potential (the Scorer parameter). To single out the correct solution, we have to make use of a radiation condition which is, due to the different physical …

Analysis and Design of a Reconfigurable Metasurface based on Chalcogenide Phase-Change Material for Operation in the Near and Mid Infrared
Alexandros Pitilakis, Alexandros Katsios, Alexandros-Apostolos A. Boulogeorgos
https://arxiv.org/abs/2510.00950

Analysis and Design of a Reconfigurable Metasurface based on Chalcogenide Phase-Change Material for Operation in the Near and Mid Infrared
We analyze, design and assess the performance of a reflective reconfigurable metasurface (MS) architecture for optical wireless communications. The device is based on the Ge-Sb-Te (GST225) phase-change material (PCM) alloy, thermally toggled between highly distinct amorphous and crystalline phase-states. We employ simple conductive MS patterns to tune its resonance frequency, while allowing the unit cell response to be analytically predicted using transmission line theory and equivalent circuit…

Magnetic Helicity, Magnetic Monopoles, and Higgs Winding
Hajime Fukuda, Yuta Hamada, Kohei Kamada, Kyohei Mukaida, Fumio Uchida
https://arxiv.org/abs/2509.25734 https://

Magnetic Helicity, Magnetic Monopoles, and Higgs Winding
Changes in magnetic helicity are often discussed across a variety of fields, from condensed matter physics to early universe cosmology. It is frequently stated that the helicity change is given by the integral of the gauge field strength tensor and its dual over spacetime, $\int F \wedge F$. However, this is incorrect when magnetic monopoles once exist in the spacetime. In this paper, we show the correct formula of the helicity change in such a case for the Maxwell theory with the magnetic …

LLM coding is the opposite of DRY
An important principle in software engineering is DRY: Don't Repeat Yourself. We recognize that having the same code copied in more than one place is bad for several reasons:
1. It makes the entire codebase harder to read.
2. It increases maintenance burden, since any problems in the duplicated code need to be solved in more than one place.
3. Because it becomes possible for the copies to drift apart if changes to one aren't transferred to the other (maybe the person making the change has forgotten there was a copy) it makes the code more error-prone and harder to debug.
All modern programming languages make it almost entirely unnecessary to repeat code: we can move the repeated code into a "function" or "module" and then reference it from all the different places it's needed. At a larger scale, someone might write an open-source "library" of such functions or modules and instead of re-implementing that functionality ourselves, we can use their code, with an acknowledgement. Using another person's library this way is complicated, because now you're dependent on them: if they stop maintaining it or introduce bugs, you've inherited a problem, but still, you could always copy their project and maintain your own version, and it would be not much more work than if you had implemented stuff yourself from the start. It's a little more complicated than this, but the basic principle holds, and it's a foundational one for software development in general and the open-source movement in particular. The network of "citations" as open-source software builds on other open-source software and people contribute patches to each others' projects is a lot of what makes the movement into a community, and it can lead to collaborations that drive further development. So the DRY principle is important at both small and large scales.
Unfortunately, the current crop of hyped-up LLM coding systems from the big players are antithetical to DRY at all scales:
- At the library scale, they train on open source software but then (with some unknown frequency) replicate parts of it line-for-line *without* any citation [1]. The person who was using the LLM has no way of knowing that this happened, or even any way to check for it. In theory the LLM company could build a system for this, but it's not likely to be profitable unless the courts actually start punishing these license violations, which doesn't seem likely based on results so far and the difficulty of finding out that the violations are happening. By creating these copies (and also mash-ups, along with lots of less-problematic stuff), the LLM users (enabled and encouraged by the LLM-peddlers) are directly undermining the DRY principle. If we see what the big AI companies claim to want, which is a massive shift towards machine-authored code, DRY at the library scale will effectively be dead, with each new project simply re-implementing the functionality it needs instead of every using a library. This might seem to have some upside, since dependency hell is a thing, but the downside in terms of comprehensibility and therefore maintainability, correctness, and security will be massive. The eventual lack of new high-quality DRY-respecting code to train the models on will only make this problem worse.
- At the module & function level, AI is probably prone to re-writing rather than re-using the functions or needs, especially with a workflow where a human prompts it for many independent completions. This part I don't have direct evidence for, since I don't use LLM coding models myself except in very specific circumstances because it's not generally ethical to do so. I do know that when it tries to call existing functions, it often guesses incorrectly about the parameters they need, which I'm sure is a headache and source of bugs for the vibe coders out there. An AI could be designed to take more context into account and use existing lookup tools to get accurate function signatures and use them when generating function calls, but even though that would probably significantly improve output quality, I suspect it's the kind of thing that would be seen as too-baroque and thus not a priority. Would love to hear I'm wrong about any of this, but I suspect the consequences are that any medium-or-larger sized codebase written with LLM tools will have significant bloat from duplicate functionality, and will have places where better use of existing libraries would have made the code simpler. At a fundamental level, a principle like DRY is not something that current LLM training techniques are able to learn, and while they can imitate it from their training sets to some degree when asked for large amounts of code, when prompted for many smaller chunks, they're asymptotically likely to violate it.
I think this is an important critique in part because it cuts against the argument that "LLMs are the modern compliers, if you reject them you're just like the people who wanted to keep hand-writing assembly code, and you'll be just as obsolete." Compilers actually represented a great win for abstraction, encapsulation, and DRY in general, and they supported and are integral to open source development, whereas LLMs are set to do the opposite.
[1] to see what this looks like in action in prose, see the example on page 30 of the NYTimes copyright complaint against OpenAI (#AI #GenAI #LLMs #VibeCoding

Unified theory of attractive and repulsive polarons in one-dimensional Bose gas
Nikolay Yegovtsev, T. Alper Yo\u{g}urt, Matthew T. Eiles, Victor Gurarie
https://arxiv.org/abs/2510.01046

Unified theory of attractive and repulsive polarons in one-dimensional Bose gas
We present a unified description of attractive and repulsive polarons, formed in a one-dimensional Bose gas hosting an impurity particle, by obtaining all ground and excited state solutions to the Gross-Pitaevskii equation. Modeling the impurity with an attractive square-well potential, we characterize the excited-state energy branches as a function of interaction strength. As the impurity-bath coupling increases, the excited states change from distinct soliton configurations to hybridized soli…

Improved Vehicle Maneuver Prediction using Game Theoretic Priors
Nishant Doshi
https://arxiv.org/abs/2509.21873 https://arxiv.org/pdf/2509.21873

Improved Vehicle Maneuver Prediction using Game Theoretic Priors
Conventional maneuver prediction methods use some sort of classification model on temporal trajectory data to predict behavior of agents over a set time horizon. Despite of having the best precision and recall, these models cannot predict a lane change accurately unless they incorporate information about the entire scene. Level-k game theory can leverage the human-like hierarchical reasoning to come up with the most rational decisions each agent can make in a group. This can be leveraged to mod…

Computing $c$- and $a$-functions from entanglement
Konstantinos Boutivas, Dimitrios Katsinis, Georgios Pastras, Nikolaos Tetradis
https://arxiv.org/abs/2509.03259 https://

Computing $c$- and $a$-functions from entanglement
We confirm the direct connection between entanglement entropy and the notion of irreversibility in the renormalization-group flow in the context of a simple theory for which a calculation from first principles is feasible. The change of the entanglement entropy for a spherical entangling surface as its radius grows from zero to infinity corresponds to the flow from the UV to the IR. Through analytical and numerical means, we compute the entanglement entropy for a free massive scalar theory, mak…

"In a broader sense, however, today’s ruling is of a piece with this Court’s recent tendencies. “[R]ight when the Judiciary should be hunkering down to do all it can to preserve the law’s constraints,” the Court opts instead to make vindicating the rule of law and preventing manifestly injurious Government action as difficult as possible….. This is Calvinball jurisprudence with a twist. Calvinball has only one rule: There are no fixed rules. We seem to have two: that one, and this Admin…

Justice Jackson Correctly Defines The John Roberts Supreme Court As The Calvinball Court
In theory, the nice thing about having a Supreme Court is that it provides some level of legal certainty. You know how the system works: lower courts make decisions based on law and precedent, part…

A Probabilistic Inference Scaling Theory for LLM Self-Correction
Zhe Yang, Yichang Zhang, Yudong Wang, Ziyao Xu, Junyang Lin, Zhifang Sui
https://arxiv.org/abs/2508.16456 https:…

A Probabilistic Inference Scaling Theory for LLM Self-Correction
Large Language Models (LLMs) have demonstrated the capability to refine their generated answers through self-correction, enabling continuous performance improvement over multiple rounds. However, the mechanisms underlying how and why accuracy evolves during this iterative process remain unexplored. To fill this gap, we propose a probabilistic theory to model the dynamics of accuracy change and explain the performance improvements observed in multi-round self-correction. Through mathematical der…

Interplay of Rashba and valley-Zeeman splittings in weak localization of spin-orbit coupled graphene
L. E. Golub
https://arxiv.org/abs/2509.18332 https://a…

The relationship between the structural transitions of DMPG membranes and the melting process, and their interaction with water
Thomas Heimburg, Holger Ebel, Peter Grabitz, Julia Preu, Yue Wang
https://arxiv.org/abs/2509.22457

The relationship between the structural transitions of DMPG membranes and the melting process, and their interaction with water
During the melting transition of dimyristoyl phosphatidylglycerol (DMPG), the order of the lipid chains and the three-dimensional, vesicular structural arrangement change simultaneously. These changes result in peculiar heat capacity profiles extended over a broad temperature range with seven $c_p$-maxima. Here, we present calorimetric, viscosity, and volume expansion coefficient data at various ionic strengths and charges. We propose a simple theory that explains the calorimetric data in terms…

Unified theory of testing relevant hypothesis in functional time series
Leheng Cai, Qirui Hu
https://arxiv.org/abs/2508.18624 https://arxiv.org/pdf/2508.18…

Unified theory of testing relevant hypothesis in functional time series
In this paper, we present a general framework for testing relevant hypotheses in functional time series. Our unified approach covers one-sample, two-sample, and change point problems under contaminated observations with arbitrary sampling schemes. By employing B-spline estimators and the self-normalization technique, we propose nuisance-parameter-free testing procedures, obviating the need for additional procedures such as estimating long-run covariance or measurement-error variance functions. …

Enriched model categories and the Dold-Kan correspondence
Martin Frankland, Arnaud Ngopnang Ngomp\'e
https://arxiv.org/abs/2508.14291 https://arxiv.org…

Enriched model categories and the Dold-Kan correspondence
The monoidal properties of the Dold-Kan correspondence have been studied in homotopy theory, notably by Schwede and Shipley. Changing the enrichment of an enriched, tensored, and cotensored category along the Dold-Kan correspondence does not preserve the tensoring nor the cotensoring. More generally, what happens to an enriched model category if we change the enrichment along a weak monoidal Quillen pair? We prove a change of base theorem that describes which properties are preserved and which …

Normalized Indexing for Ramification Subgroups
Stephen DeBacker, David Schwein, Cheng-Chiang Tsai
https://arxiv.org/abs/2509.14881 https://arxiv.org/pdf/25…

Normalized Indexing for Ramification Subgroups
This expository note introduces a normalization of the indexing of the lower and upper numbering ramification subgroups of local class field theory. We then look at how this normalization interacts with base change for Langlands parameters.

Index theory for non-compact quantum graphs
Daniele Garrisi, Alessandro Portaluri, Li Wu
https://arxiv.org/abs/2509.09749 https://arxiv.org/pdf/2509.09749

Index theory for non-compact quantum graphs
We develop an index theory for variational problems on noncompact quantum graphs. The main results are a spectral flow formula, relating the net change of eigenvalues to the Maslov index of boundary data, and a Morse index theorem, equating the negative directions of the Lagrangian action with the total multiplicity of conjugate instants along the edges. These results extend classical tools in global analysis and symplectic geometry to graph based models, with applications to nonlinear wave e…

Pseudogap-induced change in the nature of the Lifshitz transition in the two-dimensional Hubbard model
Maria C. O. Aguiar, Helena Bragan\c{c}a, Indranil Paul, Marcello Civelli
https://arxiv.org/abs/2509.09783

Pseudogap-induced change in the nature of the Lifshitz transition in the two-dimensional Hubbard model
We study the behavior of the density of states and the $B_{1g}$ nematic susceptibility extracted from Raman response data across the doping-driven Lifshitz transition comparing the weak and strong interaction cases. Our results were obtained using cluster dynamical mean field theory for the two-dimensional Hubbard model. In the weakly correlated Fermi liquid regime, both quantities are approximately symmetric around the Lifshitz transition doping $p_{LT}$. In the strongly correlated regime, the…

Operator Algebras and Third Quantization
Yidong Chen, Marius Junge, Nima Lashkari
https://arxiv.org/abs/2509.02293 https://arxiv.org/pdf/2509.02293

Operator Algebras and Third Quantization
In quantum gravity, the gravitational path integral involves a sum over topologies, representing the joining and splitting of multiple universes. To account for topology change, one is led to allow the creation and annihilation of closed and open universes in a framework often called third quantization or universe field theory. We argue that since topology change in gravity is a rare event, its contribution to exponentially late-time physics is universally described by a Poisson process. This u…

Theory-informed neural networks for particle physics
Barry M. Dillon, Michael Spannowsky
https://arxiv.org/abs/2507.13447 https://arx…

Theory-informed neural networks for particle physics
We present a theory-informed reinforcement-learning framework that recasts the combinatorial assignment of final-state particles in hadron collider events as a Markov decision process. A transformer-based Deep Q-Network, rewarded at each step by the logarithmic change in the tree-level matrix element, learns to map final-state particles to partons. Because the reward derives solely from first-principles theory, the resulting policy is label-free and fully interpretable, allowing every reconstru…

It\^o formula for reduced rough paths
Nannan Li, Xing Gao
https://arxiv.org/abs/2509.17342 https://arxiv.org/pdf/2509.17342

Itô formula for reduced rough paths
The Itô formula, also known as the change-of-variables formula, is a cornerstone of Itô stochastic calculus. Over time, this formula has been extended to apply to random processes for which classical calculus is insufficient. Since every random process exhibits some degree of regularity, rough path theory provides a natural framework for treating them uniformly. In this paper, we extend the Itô formula for reduced rough paths, broadening the range of roughness from the previously known case …

Generalizing thermodynamic efficiency of interactions: inferential, information-geometric and computational perspectives
Qianyang Chen, Nihat Ay, Mikhail Prokopenko
https://arxiv.org/abs/2509.10102

Generalizing thermodynamic efficiency of interactions: inferential, information-geometric and computational perspectives
Self-organizing systems consume energy to generate internal order. The concept of thermodynamic efficiency, drawing from statistical physics and information theory, has previously been proposed to characterize a change in control parameter by relating the resulting predictability gain to the required amount of work. However, previous studies have taken a system-centric perspective and considered only single control parameters. Here, we generalize thermodynamic efficiency to multi-parameter sett…

Steady states of FitzHugh-Nagumo-type systems with sign-changing coefficients
Jo\~ao Marcos do \'O, Evelina Shamarova, Victor V. Silva
https://arxiv.org/abs/2508.14854 https…

Steady states of FitzHugh-Nagumo-type systems with sign-changing coefficients
We establish existence and multiplicity results for steady-state solutions of spatially heterogeneous FitzHugh-Nagumo-type systems, extending the existing theory from constant to variable coefficients that may change sign. Specifically, we study the system Specifically, we study the system $-Δu + a(x)v = f(x,u)$ in $\mathbb{R}^N$, $-Δv + b(x)v = c(x)u$ in $\mathbb{R}^N$, where $N \geqslant 3$, the coefficients $a,b,c : \mathbb{R}^N \to \mathbb{R}$ are $L^\infty_{\mathrm{loc}}$-functions…

Detector-based measurement-induced state updates in AdS/CFT
Vijay Balasubramanian, Esko Keski-Vakkuri, Nicola Pranzini
https://arxiv.org/abs/2509.13457 https://

Detector-based measurement-induced state updates in AdS/CFT
Conventional understandings of quantum theory hold that measurements change the state of an observed system following the Lüders update rule. Textbooks describe the application of this idea to non-relativistic systems, but extensions to relativistic and gravitating systems encounter subtleties. One consistent approach is via detector-based measurements. We study the effects of such measurements in a CFT with a holographic dual. We work out the boundary space-time regions associated to a Lüder…