Peer Revenue Returns subject to peer review

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Thursday 26 March

Number Theory

Surviving Eratosthenes sieve I: quadratic density and Legendre's conjecture

We have been studying Eratosthenes sieve as a discrete dynamic system, obtaining exact models for the relative populations for small gaps (currently gaps $g \le 82$) in the cycle of gaps ${\mathcal G}(p^\#)$ at each stage of the sieve. The gaps in the interval $\Delta H(p_k)=[p_k^2, p_{k+1}^2]$ are fixed in ${\mathcal G}(p^\#)$ and survive all subsequent stages of the sieve to be confirmed as gaps between primes. We have shown that samples of gaps between primes over these intervals of survival $\Delta H(p_k)$ have population distributions that reflect the relative population models $w_g(p_k^\#)$. This paper advances our study of the estimates of survival across stages of the sieve. Inspired by Legendre's conjecture, we introduce the concept of quadratic density $\eta_s(p_k)$, which is the expected population of the constellation $s$ in the intervals $[n^2, (n+1)^2]$ for $p_k \le n < p_{k+1}$. We show that once a gap occurs in ${\mathcal G}(p^\#)$, its expected quadratic density increases across all subsequent stages of the sieve. Regarding Legendre's conjecture, beyond postulating one prime in the interval $[n^2,(n+1)^2]$, the quadratic density predicts the populations of several prime gaps within this interval.
Read the full abstract

Information Theory · Cross-listed from cs.CC

An $\Omega((\log n/\log\log n)^2)$ Cell-Probe Lower Bound for Dynamic Boolean Data Structures

We resolve the long-standing open problem of Boolean dynamic data structure hardness, proving an unconditional lower bound of $\Omega((\log n/\log\log n)^2)$ for the Multiphase Problem of Patrascu [STOC 2010] (instantiated with Inner Product over $\mathbb{F}_2$). This matches the $\tilde{\Omega}(\log^2 n)$ bound that Larsen [STOC 2012] established for weighted problems, where each query returns $\Omega(\log n)$ bits, and closes the gap left by the $\tilde{\Omega}(\log^{1.5} n)$ Boolean bound of Larsen, Weinstein, and Yu [STOC 2018]. It also answers, up to a $(\log\log n)^2$ factor, Open Question 15.24 in Viola's textbook "Mathematics of the Impossible" [Cambridge 2026]. The previous barrier was methodological: all prior works relied on "one-way" communication games, where the inability to verify query simulations necessitated complex machinery (such as the Peak-to-Average Lemma) that hit a hard ceiling at $\log^{1.5} n$. Our key contribution is conceptual: we introduce a 2.5-round Multiphase Communication Game that augments the standard one-way model with a verification round, where Bob confirms the consistency of Alice's simulation against the actual memory. This simple, qualitative change removes the obstruction and yields the full bound directly. As a consequence, our analysis naturally extends to other hard Boolean functions – those of small discrepancy under product distributions with large min-entropy – offering a general recipe for translating discrepancy lower bounds into $\Omega((\log n/\log\log n)^2)$ dynamic Boolean data structure lower bounds. We also argue that this result likely represents the structural ceiling of the Chronogram framework initiated by Fredman and Saks [STOC 1989]: any $\omega(\log^2 n)$ lower bound would require either fundamentally new techniques or major circuit complexity breakthroughs.
Read the full abstract

Combinatorics

Summation Formulae for Binomial Moments

By combining the telescoping method with an algebraic relation, four classes of binomial moments are examined. Several explicit summation formulae are established.

Statistics Theory

Finite-Time Observability of Oscillatory Instabilities in Synchronous p-bit Dynamics

Synchronous update schemes in p-bit annealing offer a natural route to massive parallelism, but they can also induce period-2 oscillations that degrade optimization performance. In practical solvers, such oscillations matter only if they become observable within the finite runtime of the device or simulation, yet most existing analyses are formulated in terms of asymptotic stability. As a result, they do not directly address the experimentally relevant question of when oscillatory modes actually appear during finite-duration annealing. Here we develop a finite-time observability framework for synchronous tick-random p-bit dynamics. Starting from a linearized mean-field description, we derive a graph-dependent criterion that predicts whether unstable modes amplify enough within a finite observation window to produce visible signatures in quantities such as the one-step autocorrelation and the energy trace. This shifts the analysis from asymptotic instability to practical detectability and yields a principled estimate of the minimum reduction in synchrony required to suppress oscillations. We validate the framework on G-set benchmark graphs and illustrative graph families. The predicted thresholds capture both the graph dependence of oscillation onset and the finite-time conditions under which oscillations become practically observable. These results provide a graph-aware basis for selecting the update probability in synchronous p-bit annealers without relying on exhaustive instance-by-instance parameter sweeps.
Read the full abstract

Algebraic Geometry

Conics Quadrics Mapping & Cones

An efficient way to get implicit equations of conics on five points and quadrics on nine, using pencils of conics and quadrics, is revealed. Parallel axis right cones intersect on a conic. An example, to show how to place five coplanar points on a cone, using kinematic mapping with dual quaternions is presented. A second congruent cone is found as a translation of the first. Cone symmetry helps to explain how mapping produces eight real solutions, apparently all different, belong to a unique cone pair intersection. Future extension of this, pertaining to a nine point quadric, can be contrived if a way to map planar points to parallel axis cones is formulated.
Read the full abstract

Number Theory

Examples of Quadratic Polynomials over $\mathbb{Q}$ with Surjective Arboreal Galois Representations

We explore families of pairs of quadratic polynomials $f(x)=x^2+c\in \mathbb{Q}$ and $a\in \mathbb{Q}$ with $a$ being a strictly preperiodic point of $f$ to provide infinitely many new examples for which the associated arboreal Galois representations are surjective.
Read the full abstract

All authors Luck Henderson, Jamie Juul, Brenner Lattin, Enrique Mercado, Mia Schaefer

Number Theory

On nonconvex constellations among primes I

Extending our work on the $k$-tuple conjecture, we apply those methods to the Engelsma counterexamples (narrow constellations) of length $J=459$ and span $|s|=3242$. We track the evolution of these $58$ counterexamples from inadmissible driving terms starting in the cycle of gaps ${\mathcal G}(11^\#)$ up through their first appearance in ${\mathcal G}(113^\#)$. We continue developing primorial coordinates for each admissible instance through a breadth-first exhaustive search through ${\mathcal G}(211^\#)$, at which point we need to develop strategies for depth-first searches for an instance that would survive Eratosthenes sieve. Our calculations show that none of the $(459,3242)$-counterexamples occur before $9.7\,E73$. For each of the $58$ Engelsma $(459,3242)$-counterexamples we calculate its asymptotic relative population, among other constellations of length $J=459$, and we study how these counterexamples work. In this version (9 April) we have completed the calculations in Table 6 to include all of the terms in primorial expansion for the smallest initial generator and corrected a typographical error on page 6.
Read the full abstract

Group Theory

Nilpotent groups have polynomially bounded homological filling invariants

Gromov claimed, with a sketch of proof, that simply connected nilpotent Lie groups have polynomially bounded filling invariants. The literature establishes this, often with a stronger conclusion where the exponent of polynomiality is computed or estimated, for some classes of nilpotent groups, or ranges of filling degrees. We provide a proof, in part based on Gromov's hints, yielding at once (non-optimal) polynomial upper bounds on the homological filling invariants in every degree for all finitely generated nilpotent groups, or equivalently, for all simply connected nilpotent Lie groups having lattices.
Read the full abstract

Analysis of PDEs

Some Unexplored Topics in The Reconstruction of Scalar Parameters of Subdiffusion

In the paper, we discuss the reconstruction of scalar parameters in a linear diffusion equation with fractional in time differential operators and with additional nonlocal (convolution) terms, which incorporate memory effects in models. Although, under suitable assumptions on the data, inverse problems associated with recovery of these parameters are nowadays well understood, several important questions related with numerical reconstructions of these parameters via a nonlocal observation in a small time interval have not yet been analyzed. This paper aims to provide some answers.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Modular Theory and the Bell-CHSH inequality in relativistic scalar Quantum Field Theory

The Tomita-Takesaki modular theory is employed to discuss the Bell-CHSH inequality in wedge regions. By using the Bisognano-Wichmann results, the construction of a set of wedge localized vectors in the one-particle Hilbert space of a relativistic massive scalar field in $1+1$ dimensions is devised to establish whether violations of the Bell-CHSH inequality might occur for different choices of Bell's operators. In particular, the construction of the wedge localized vectors employed in the seminal work by Summers-Werner is scrutinized and applied to Weyl and other operators. We also outline a possible path towards the saturation of Tsirelson's bound.
Read the full abstract

All authors J. G. A. Caribé, M. S. Guimaraes, I. Roditi, S. P. Sorella

Probability

Scaling limits of Smoluchowski particles

We prove a law of large numbers and a functional central limit theorem for the empirical density of a Marcus-Lushnikov model. The limiting density turns out to be the solution of a Smoluchowski equation, and the fluctuations around this limit are shown to be described by an Ornstein-Uhlenbeck process with drift term given by the linearization of the Smoluchowski operator.
Read the full abstract

Mathematical Physics

The Hirota Identity for Hyperpfaffian $\tau$-Functions in Charge-$L$ Ensembles

We study log-gas ensembles with inverse temperature $\beta = L^2$ using a confluent Vandermonde representation that admits a formulation in the exterior algebra of a finite-dimensional vector space. By interpreting the system as consisting of finitely many particles with integer charge $L$, partition functions can be expressed exactly as hyperpfaffians. In this formulation, the system is governed by a natural momentum grading arising from the confluent Vandermonde structure, and its statistical observables are determined entirely by the corresponding bigraded commutative subalgebra. The geometric identity that a particle's $L$-blade wedges with itself to zero produces momentum Plücker relations within this algebra. These relations generate momentum transport identities between sectors of different particle number. Upon introducing dynamic time variables, the partition functions become $\tau$-functions, and these transport identities are transformed into Hirota bilinear equations. This provides an explicit algebraic origin for the integrable hierarchy structure of the $\beta = L^2$ ensembles, which may be viewed as a finite-dimensional analogue of the Sato Grassmannian formulation of integrable systems.
Read the full abstract

Numerical Analysis

Spatial-Temporal Nonlocal Traffic Dynamics: Analytical Properties, Adaptive Kernel Formulation, and Empirical Validation

This paper presents a new spatial-temporal nonlocal traffic flow model formulated to overcome the boundedness limitations inherent in classical local formulations. The model introduces an adaptive kernel that captures both spatial and temporal nonlocal interactions, allowing the velocity at a given point to depend on aggregated downstream traffic conditions over a finite time horizon. This structure provides a more realistic representation of driver anticipation and reaction behavior. In addition to developing the model, we establish several key analytical properties that clarify the theoretical foundations of the proposed nonlocal framework. To assess its practical relevance, we conduct a detailed empirical validation using high-resolution NGSIM trajectory data. The results demonstrate that the spatial-temporal nonlocal model significantly improves the reconstruction of traffic density fields compared with traditional local macroscopic models, particularly in regimes where anticipation effects dominate. These findings highlight the potential of spatial-temporal nonlocal traffic dynamics as a robust theoretical and data-driven framework for capturing complex traffic behavior.
Read the full abstract

All authors Animesh Biswas, Archie Huang, Shaurya Agarwal, Christopher Housholder

Functional Analysis

Discrete reversed Hardy inequalities and Hölder estimates in Lorentz sequence spaces

We prove sharp reversed Hardy-type inequalities on the cone of decreasing sequences in weighted $\ell^p$-spaces with power weights, applying them to estimate standard norms in Lorentz sequence spaces. We prove that the discrete structure of these spaces yields optimal constants that are different from those in the continuous setting.
Read the full abstract

Metric Geometry

On the center of distances of finite ultrametric spaces

The center of distances of a metric space $(X,d)$ is the set $C(X)$ of all $t\in \mathbb R^+$ for which the equation $d(x,p)=t$ has a solution for each $p\in X$. We prove the inequality $|C(X)| \le 1 + \lfloor \log_2 n \rfloor$ for all finite ultrametric spaces $(X,d)$ which have exactly $n$ points. It is also shown that for every integer $n \geq 1$ there exists a finite ultrametric space $(Y,\rho)$ such that $|Y| = n$ and $|C(Y)| = 1 + \log_2 \lfloor n \rfloor. $
Read the full abstract

Numerical Analysis

A Neural Score-Based Particle Method for the Vlasov-Maxwell-Landau System

Plasma modeling is central to the design of nuclear fusion reactors, yet simulating collisional plasma kinetics from first principles remains a formidable computational challenge: the Vlasov-Maxwell-Landau (VML) system describes six-dimensional phase-space transport under self-consistent electromagnetic fields together with the nonlinear, nonlocal Landau collision operator. A recent deterministic particle method for the full VML system estimates the velocity score function via the blob method, a kernel-based approximation with $O(n^2)$ cost. In this work, we replace the blob score estimator with score-based transport modeling (SBTM), in which a neural network is trained on-the-fly via implicit score matching at $O(n)$ cost. We prove that the approximated collision operator preserves momentum and kinetic energy, and dissipates an estimated entropy. We also characterize the unique global steady state of the VML system and its electrostatic reduction, providing the ground truth for numerical validation. On three canonical benchmarks – Landau damping, two-stream instability, and Weibel instability – SBTM is more accurate than the blob method, achieves correct long-time relaxation to Maxwellian equilibrium where the blob method fails, and delivers $50\%$ faster runtime with $4\times$ lower peak memory.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Theory of (Co)homological Invariants on Quantum LDPC Codes

We establish a systematic mathematical framework for constructing and computing (co)homological invariants that induce logical gates on quantum low-density parity-check (qLDPC) codes. By synthesizing tools from graph theory, algebraic topology, and number theory, we study constructions ranging from hypergraph product (HGP) codes to sheaf codes. Using commutative algebra, we generalize the notion of canonical logical representatives from HGP codes to the sheaf code setting, resolving a longstanding challenge in explicitly characterizing sheaf codewords. Building on this foundation, we present the first comprehensive computation of cup products within the intricate framework of sheaf codes. Given Artin's primitive root conjecture which holds under the generalized Riemann hypothesis, {we establish a nearly linear family of independent cup product cochains on almost-good qLDPC codes. Under a separate nonvanishing pairing condition, they are expected to yield parallel logical multi-controlled-Z gates. Moreover, by interpreting sheaf codes as covering spaces of HGP codes, we construct interlaced families through odd-degree lifts that preserve compatible invariant pairings, allowing nontrivial, constant-depth logical gates throughout an infinite family to be certified on a constant-size HGP seed. Treating local code constructions and expansion bounds as external inputs, our framework identifies the compatibility conditions for combining large dimension and distance, local testability, and constant-depth non-Clifford gates, thereby provides a mathematical foundation for separate constructions that realize these properties simultaneously.
Read the full abstract

All authors Zimu Li, Yuguo Shao, Fuchuan Wei, Yiming Li, Zi-Wen Liu

Information Theory

Exploiting the Degrees of Freedom: Multi-Dimensional Spatially-Coupled Codes Based on Gradient Descent

Spatially-coupled (SC) codes are a class of low-density parity-check (LDPC) codes that is gaining increasing attention. Multi-dimensional (MD) SC codes are constructed by connecting copies of an SC code via relocations in order to mitigate various sources of non-uniformity and improve performance in many storage and transmission systems. As the number of degrees of freedom in the MD-SC code design increases, appropriately exploiting them becomes more difficult because of the complexity growth of the design process. In this paper, we propose a probabilistic framework for the MD-SC code design, based on the gradient-descent (GD) algorithm, to design high performance MD codes where this challenge is addressed. In particular, we express the expected number of detrimental objects, which we seek to minimize, in the graph representation of the code in terms of entries of a probability-distribution matrix that characterizes the MD-SC code design. We then find a locally-optimal probability distribution, which serves as the starting point of the finite-length (FL) algorithmic optimizer that produces the final MD-SC code. We adopt a recently-introduced Markov chain Monte Carlo (MCMC) FL algorithmic optimizer that is guided by the proposed GD algorithm. We apply our framework to various objects of interest. We start from simple short cycles, and then we develop the framework to address more sophisticated cycle concatenations, aiming at finer-grained optimization. We offer the theoretical analysis as well as the design algorithms. Next, we present experimental results demonstrating that our MD codes, conveniently called GD-MD codes, have notably lower numbers of targeted detrimental objects compared with the available state-of-the-art. Moreover, we show that our GD-MD codes exhibit significant improvements in error-rate performance compared with MD-SC codes obtained by a uniform distribution.
Read the full abstract

Optimization and Control

On incremental and semi-global exponential stability of gradient flows satisfying generalized Łojasiewicz inequalities

The Łojasiewicz inequality characterizes objective-value convergence along gradient flows and, in special cases, yields exponential decay of the cost. However, such results do not directly give rates of convergence in the state. In this paper, we use contraction theory to derive state-space guarantees for gradient systems satisfying generalized Łojasiewicz inequalities. We first show that, when the objective has a unique strongly convex minimizer, the generalized Łojasiewicz inequality implies semi-global exponential stability; on arbitrary compact subsets, this yields exponential stability. We then give two curvature-based sufficient conditions, together with constraints on the Łojasiewicz rate, under which the nonconvex gradient flow is globally incrementally exponentially stable.
Read the full abstract

All authors Andreas Oliveira, Arthur C. B. de Oliveira, Mario Sznaier, Eduardo Sontag

Functional Analysis · Cross-listed from eess.SY

Time-Varying Reach-Avoid Control Certificates for Stochastic Systems

Reach-avoid analysis is fundamental to reasoning about the safety and goal-reaching behavior of dynamical systems, and serves as a foundation for specifying and verifying more complex control objectives. This paper introduces a reach-avoid certificate framework for discrete-time, continuous-space stochastic systems over both finite- and infinite-horizon settings. We propose two formulations: time-varying and time-invariant certificates. We also show how these certificates can be synthesized using sum-of-squares (SOS) optimization, providing a convex formulation for verifying a given controller. Furthermore, we present an SOS-based method for the joint synthesis of an optimal feedback controller and its corresponding reach-avoid certificate, enabling the maximization of the probability of reaching the target set while avoiding unsafe regions. Case studies and benchmark results demonstrate the efficacy of the proposed framework in certifying and controlling stochastic systems with continuous state and action spaces.
Read the full abstract

Optimization and Control

Exact Penalty Method for Variationally Coherent Stochastic Programming Problems

The paper concerns optimization problems with general equality and inequality constraints and with constraints expressed by a convex set. In order to solve these problems, the general constraints are treated by an exact penalty functions while the others by mirror descent approach. The paper introduces a constraint qualification condition under which the solution of the optimization problem with an exact penalty function and constraints defined by the convex set is a solution of the original problem with constraints. The paper extends results on exact penalty functions to the case when together with general equality and inequality constraints additional constraints defined by a convex set are present. In order to solve the optimization problems with exact penalty functions, a mirror descent algorithm is proposed. It is assumed that instead of using gradients of functions defining constrained optimization problems, their stochastic approximations can be applied. The paper establishes global convergence of the proposed method under the assumption that applied exact penalty functions lead to variationally coherent optimization problems. Since exact penalty functions are not differentiable, the concept of variationally coherent problems is extended to the problems defined by functions exhibiting Clarke's generalized gradients. The behavior of the proposed method is illustrated by some numerical examples.
Read the full abstract

Number Theory

On bilinear sums with modular square roots and applications III

We continue our investigations of bilinear sums with modular square roots and the large sieve for square moduli in our recent article "On bilinear sums with modular square roots and applications II", arXiv:2603.00768. In the present article, we focus on the case of prime square moduli for which our previous method in the said article did not yield any improvement. Now we modify this method to make progress for these moduli. The key idea is to restrict certain quadratic Gauss sums to reduced residue classes, which results in significant cancellations in certain cases.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Context Tree Prior Distributions based on Node Weighting with exact Bayes Factors

Variable-length Markov chains (VLMCs) are a flexible class of higher-order Markov models that admit a natural representation as context trees. Existing Bayesian methods for specifying prior distributions on trees rely on branching processes, but these suffer from a fundamental limitation: the connection between node-branching probabilities and the structural properties of the induced tree distribution is not straightforward, making it difficult to encode specific structural beliefs. We address this issue by introducing a novel representation of prior distributions on tree spaces, characterized by assigning weights to individual contexts through a function on nodes. In this way, our approach provides an intuitive mechanism for incorporating structural hypotheses into the prior while preserving computational tractability, allowing marginal likelihoods and posterior mode trees to be computed exactly via generalizations of the Context Tree Weighting (CTW) and Context Tree Maximizing (CTM) algorithms. By enabling exact Bayes factor calculations, our methodology provides a principled framework for model comparison over structural priors. We demonstrate the flexibility and effectiveness of our approach by comparing different prior specifications through simulation studies and an application to financial markets.
Read the full abstract

Geometric Topology

Transverse knots determined by their cyclic branched covers

Harvey-Kawamuro-Plamenevskaya demonstrated the existence of (transversely) non-isotopic transverse knots such that for every $n>1$ their $n$-fold cyclic branched covers are contactomorphic. In this short note, we construct other examples of non-isotopic transverse knots that have contactomorphic cyclic branched covers. Conversely, we prove that the transverse isotopy classes of many transverse knots are actually determined by the contactomorphism type of their cyclic branched covers.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Dark energy from string theory: an introductory review

Dark energy, the main constituent in our expanding universe, responsible for its acceleration, is currently being observed with unprecedented precision through various experiments. While several cosmological models can fit this latest data, deriving some of them from string theory would provide a valuable theoretical prior, with information on the nature of dark energy. This article reviews the efforts towards such a derivation, namely the options from string theory to get a cosmological constant (a de Sitter solution) or a dynamical dark energy (via a quintessence model). After providing a brief historical perspective, we first review proven or conjectured constraints on obtaining dark energy from string theory, in classical or asymptotic regimes. Circumventing such obstructions, by changing regime or ansatz, one can try to construct a de Sitter solution: we present a long list of such attempts, and the difficulties encountered. Among them, we discuss in detail efforts towards classical de Sitter solutions. Then, we review quintessence from string theory, focusing on single-field exponential models. Related topics are discussed, including the coupling to matter, the comparison to observational data, and the absence of a cosmological event horizon.
Read the full abstract

Statistics Theory · Cross-listed from stat.ML

Beyond identifiability: Learning causal representations with few environments and finite samples

We provide explicit, finite-sample guarantees for learning causal representations from data with a sublinear number of environments. Causal representation learning seeks to provide a rigourous foundation for the general representation learning problem by bridging causal models with latent factor models in order to learn interpretable representations with causal semantics. Despite a blossoming theory of identifiability in causal representation learning, estimation and finite-sample bounds are less well understood. We show that causal representations can be learned with only a logarithmic number of unknown, multi-node interventions, and that the intervention targets need not be carefully designed in advance. Through a careful perturbation analysis, we provide a new analysis of this problem that guarantees consistent recovery of (a) the latent causal graph, (b) the mixing matrix and representations, and (c) unknown intervention targets.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Negative energies and the breakdown of bulk geometry

One central question in quantum gravity is to understand how and why predictions from semiclassical gravity can break down in regimes with low spacetime curvature. One diagnostic of such a breakdown is that states which are orthonormal at the semiclassical level can receive large corrections to their inner products from quantum fluctuations. We study this effect by examining inner products in pure 2D JT gravity. Previous work showed that black hole states with long interiors exhibit a breakdown at length scales of order $e^{S_0}$, where $S_0$ is a parameter analogous to $1/G_N$ in higher dimensions. This breakdown is caused by the discreteness of the spectrum of the dual boundary random matrix theory. We show that the full sum over quantum fluctuations indicates a more dramatic breakdown at parametrically shorter lengths of order $e^{S_0/3}$. In the dual boundary description, these corrections arise from negative energy states appearing in rare members of the random matrix ensemble. These results demonstrate that non-perturbative effects can invalidate the semiclassical description at much smaller length scales than previously expected, providing a new mechanism for the breakdown of effective gravitational theories.
Read the full abstract

Number Theory

Iterated beta integrals

We introduce iterated beta integrals, a new class of iterated integrals on the universal abelian covering of the punctured projective line that unifies hyperlogarithms and classical beta integrals while preserving their fundamental properties. We establish various analytic properties of these integrals with respect to both the exponent parameters and the main variables. Their key feature is invariance under simultaneous translation of the exponent parameters, which generates relations between integrals over possibly different coverings. This mechanism recovers notable identities for multiple zeta values and variants – including Zagier's 2-3-2 formula, Murakami's $t$-value analogue, Charlton's $t$-value analogue, Zhao's $2$-$1$ formula, and Ohno's relation – and also yields new relations, such as a proof of a Galois descent phenomenon for multiple omega values.
Read the full abstract

Mathematical Physics

Critical curve of two-matrix models $ABBA$, $A\{B,A\}B$ and $ABAB$, Part I: Monte Carlo

For a family of two-matrix models \[ \frac{1}{2} \operatorname{Tr}(A^2+B^2) - \frac{g}{4} \operatorname{Tr}(A^4+B^4) - \begin{cases} \frac{h}{2} \operatorname{Tr}( A BA B) \\ \frac{h}{4} \operatorname{Tr}( A BA B+ ABBA ) \\ \frac{h}{2} \operatorname{Tr}( A B BA ) \end{cases} \] with hermitian $A$ and $B$, we provide, in each case, a Monte Carlo estimate of the boundary of the maximal convergence domain in the $(h,g)$-plane. The results are discussed comparing with exact solutions (in agreement with the only analytically solved case) and phase diagrams obtained by means of the functional renormalization group.
Read the full abstract

Dynamical Systems

Spectrum of SL(2,R)-characters: the once-punctured torus case

Consider a topological surface $\Sigma$. We introduce the spectrum of a representation from the fundamental group of $\Sigma$ to SL(2,R), which is a subset of projective measured lamination on the surface, which captures the directions along which the representation fails to be Fuchsian, and which characterizes the action of the mapping class group on this representation. In the case of the once-punctured torus, we show that the spectrum of a generic representation is a Cantor set, and that it completely describes the dynamics of the familly of locally constant cocycles above interval exchange transformations associated to the representation.
Read the full abstract