Tootfinder

On Murmurations and Trace Formulas
David Lowry-Duda
https://arxiv.org/abs/2506.01640 https://arxiv.org/pdf/2506.01640

On Murmurations and Trace Formulas
In recent work with Bober, Booker, Lee, Seymour-Howell, and Zubrilina, we proved murmuration behavior for Maass forms in the eigenvalue aspect and for modular forms in the weight aspect. Both used an approach based on the Selberg trace formula. But different trace formulas, including those due to Kuznetsov or Petersson, offer different variations. We examine murmurations from the perspective of different trace formulas and outline several families of $L$-functions where one can likely prove add…

A Formula for Connected Bosonic \(n\)-Point Functions for the BKP Hierarchy
Xuhui Zhang, Jian Zhou
https://arxiv.org/abs/2506.00451 https://

A Formula for Connected Bosonic \(n\)-Point Functions for the BKP Hierarchy
We present a formula for the connected \(n\)-point functions of a tau-funtion of the BKP hierarchy by embedding BKP hierarchy into KP hierarchy. This formula is different from the one given by Wang and Yang. We prove that these two formulae are equivalent.

Strong hyperboloidal compactification for the spherical DF-GHG formulation of GR
Christian Peterson, David Hilditch
https://arxiv.org/abs/2506.03078 https:…

Strong hyperboloidal compactification for the spherical DF-GHG formulation of GR
The use of compactified hyperboloidal coordinates for metric formulations of the Einstein field Equations introduces formally singular terms in the equations of motion whose numerical treatment requires care. In this paper we study a particular choice of constraint addition, choice of gauge and reduction fields in order to minimize the number of these terms in a spherically symmetric reduction of the Dual-Foliation Generalized Harmonic Gauge formulation of General Relativity. We proceed to the …

Die Rhetorik der Freiheit des Kapitalismus ist für viele Menschen letztlich nicht real erlebbar, auch wenn sie als rechtlich gesichert kommuniziert wird. Hier haben wir mal wieder den Konflikt zwischen der juristischen Realität und der Welt:
"Aus der rein formalen Freiheit in arbeitsteilig organisierten Marktgesellschaften resultiert so der Widerspruch, de jure frei zu sein, aber de facto nicht über sich selbst bestimmen zu können."

Freiheit im Kapitalismus existiert für viele nur auf dem Papier - Weltenkreuzer
Die Rhetorik der Freiheit des Kapitalismus ist für viele Menschen letztlich nicht real erlebbar, auch wenn sie als rechtlich gesichert kommuniziert wird. Hier haben wir mal wieder den Konflikt zwischen der juristischen Realität und der Welt: Aus der rein formalen Freiheit in arbeitsteilig organisierten Marktgesellschaften resultiert so der Widerspruch, de jure frei zu sein, aber de facto nicht über sich selbst bestimmen zu können Assoziation Kapitalismus liefert bei seinem zentrale…

Computing Witnesses Using the SCAN Algorithm (Extended Preprint)
Fabian Achammer, Stefan Hetzl, Renate A. Schmidt
https://arxiv.org/abs/2506.00163 https://…

Computing Witnesses Using the SCAN Algorithm (Extended Preprint)
Second-order quantifier-elimination is the problem of finding, given a formula with second-order quantifiers, a logically equivalent first-order formula. While such formulas are not computable in general, there are practical algorithms and subclasses with applications throughout computational logic. One of the most prominent algorithms for second-order quantifier elimination is the SCAN algorithm which is based on saturation theorem proving. In this paper we show how the SCAN algorithm on claus…

Second-Order-Cone Formulations of Power Flow for Topology Optimization
Noah Rhodes, James Luedkte, Line Roald
https://arxiv.org/abs/2506.02234 https://

Second-Order-Cone Formulations of Power Flow for Topology Optimization
Optimization problems that involve topology optimization in scenarios with large scale outages, such as post-disaster restoration or public safety power shutoff planning, are very challenging to solve. Using simple power flow representations such as DC power flow or network flow models results in low quality solutions which requires significantly higher-than-predicted load shed to become AC feasible. Recent work has shown that formulations based on the Second Order Cone (SOC) power flow formula…

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

2-Category of Topological Quantum Computation
Unitary Ribbon Fusion Categories (URFC) formalize anyonic theories. It has been widely assumed that the same category formalizes a topological quantum computing model. However, in previous work, we addressed and resolved this confusion and demonstrated while the former could be any fusion category, the latter is always a subcategory of Hilb. In this paper, we argue that a categorical formalism that captures and unifies both anyonic theories (the Hardware of quantum computing) and a model of top…

More regular formal moduli spaces and arithmetic transfer conjectures: the ramified quadratic case
Yu Luo, Michael Rapoport, Wei Zhang
https://arxiv.org/abs/2507.01395

More regular formal moduli spaces and arithmetic transfer conjectures: the ramified quadratic case
For unitary groups associated to a ramified quadratic extension of a $p$-adic field, we define various regular formal moduli spaces of $p$-divisible groups with parahoric levels, characterize exceptional special divisors on them, and construct correspondences between them. We formulate arithmetic transfer conjectures, which are variants of the arithmetic fundamental lemma conjecture in this context. We prove the conjectures in the lowest dimensional cases.

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

A framework for computing upper bounds in passive learning settings
The task of inferring logical formulas from examples has garnered significant attention as a means to assist engineers in creating formal specifications used in the design, synthesis, and verification of computing systems. Among various approaches, enumeration algorithms have emerged as some of the most effective techniques for this task. These algorithms employ advanced strategies to systematically enumerate candidate formulas while minimizing redundancies by avoiding the generation of syntact…

Safety, Relative Tightness and the Probabilistic Frane Rule
Janez Ignacij Jereb, Alex Simpson
https://arxiv.org/abs/2506.01626 https://

Safety, Relative Tightness and the Probabilistic Frane Rule
Probabilistic separation logic offers an approach to reasoning about imperative probabilistic programs in which a separating conjunction is used as a mechanism for expressing independence properties. Crucial to the effectiveness of the formalism is the frame rule, which enables modular reasoning about independent probabilistic state. We explore a semantic formulation of probabilistic separation logic, in which the frame rule has the same simple formulation as in separation logic, without furthe…