Peer Revenue Equity in science

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 25 February

Information Theory · Cross-listed from cs.CL

Speculative Decoding Scaling Laws (SDSL): Throughput Optimization Made Simple

Speculative decoding is a technique that uses multiple language models to accelerate infer- ence. Previous works have used an experi- mental approach to optimize the throughput of the inference pipeline, which involves LLM training and can be costly. This study of spec- ulative decoding proposes a theory that ana- lytically connects the key hyperparameters of pre-trained LLMs to the throughput efficiency of a downstream SD-based inference system. The theory allows the prediction of throughput- optimal hyperparameters for the components of an inference system before their pre-training.
Read the full abstract

Numerical Analysis · Cross-listed from physics.flu-dyn

Spatial symmetry invariance of solution of Kolmogorov flow

We prove a mathematical theorem that solution for all $t > 0$ of the two-dimensional (2D) Kolmogorov flow governed by Navier-Stokes (NS) equations with periodic boundary condition keeps the same spatial symmetry as its smooth initial condition. The proof of a similar theorem for the three-dimensional NS equations is given in the appendix. These mathematical theorems can be used to check the correctness and reliability of numerical simulations of NS turbulence. For example, they support the corresponding CNS (clean numerical simulation) results of the 2D and 3D turbulent Kolmogorov flows [1-3] that remain the same spatial symmetry in the whole time interval of simulation, but do not support the corresponding DNS (direct numerical simulation) results that lose the spatial symmetry quickly. In other words, these DNS results violate these mathematical theorems. Thus, these mathematical theorems rigorously confirm that the spatiotemporal trajectories of NS turbulence given by DNS are indeed quickly polluted by numerical noises badly. All of these indicate that CNS can indeed provide helpful enlightenments to deepen our understanding about turbulence and besides approach some mathematical truths about NS equations.
Read the full abstract

Number Theory

Meta-automatic Sequences

Nested (or meta-Fibonacci) recurrences, such as the recurrence used to define Hofstadter's Q-sequence, along with the digit-based recurrences that underlie automatic sequences are of interest from both number-theoretic and combinatorial points of view. In this direction, Allouche and Shallit showed how the frequency sequence of a variant of the $Q$-sequence is $2$-automatic. This inspires us to introduce what may be seen as a natural combination of the recurrences for meta-Fibonacci and automatic sequences, by introducing the concept of a meta-automatic sequence. We exhibit two binary meta-automatic sequences $M_1$ and $M_2$ whose defining recurrences do not satisfy the Allouche-Shallit automaticity criterion directly, and this is formalized in our paper. For each of these integer sequences $M_1$ and $M_2$, we prove explicit DFAO evaluations, together with $4$-uniform morphisms, and we also consider the factor complexities of these sequences.
Read the full abstract

Number Theory

Completeness of exponentially increasing sequences

For fixed positive reals $t$ and $\alpha$, consider the sequence $S_t(\alpha) = (s_1, s_2, \ldots, )$ with $s_n = \left \lfloor t\alpha^n \right \rfloor$. In 1964, Graham managed to characterize those pairs $(t, \alpha)$ with $0 < t < 1$ and $1 < \alpha < 2$ for which every large enough integer can be written as the sum of distinct elements of $S_t(\alpha)$. We show that his methods can be applied to deal with many other pairs of $(t, \alpha)$ as well.
Read the full abstract

Probability · Cross-listed from q-bio.PE

Beyond Diagonal Noise: A Better Predator-Prey Modeling Framework with Cross-Covariance

The introduction of stochasticity into continuous ecological models frequently relies on phenomenological, diagonal diffusion terms that lack a rigorous microscopic basis. We demonstrate that this standard practice fundamentally misrepresents the geometry of demographic fluctuations. By deriving a stochastic Rosenzweig–MacArthur model directly from an integer-valued, Bernoulli-coupled continuous-time Markov chain, we isolate the exact diffusion covariance structure dictated by event stoichiometry. We mathematically prove that coupled predation–conversion events inherently generate a structurally negative predator–prey cross-covariance, exposing the severe mathematical and biological limitations of standard diagonal-noise approximations. Furthermore, we resolve a persistent ambiguity in stochastic population modeling by explicitly formalizing the bifurcation between open-domain formulations (for survival-conditioned interior dynamics) and absorbed formulations (for extinction-permitting dynamics). To rigorously support this distinction, we develop a tailored two-stage Lyapunov well-posedness architecture that separates non-explosion criteria from boundary-barrier positivity invariance. By bridging microscopic event stoichiometry with macroscopic boundary-degenerate diffusions, this work replaces ad hoc noise constructs with a definitive, mathematically exact template for covariance-consistent and boundary-aware ecological modeling.
Read the full abstract

Statistics Theory · Cross-listed from stat.ML

Flow Matching is Adaptive to Manifold Structures

Flow matching has emerged as a simulation-free alternative to diffusion-based generative modeling, producing samples by solving an ODE whose time-dependent velocity field is learned along an interpolation between a simple source distribution (e.g., a standard normal) and a target data distribution. Flow-based methods often exhibit greater training stability and have achieved strong empirical performance in high-dimensional settings where data concentrate near a low-dimensional manifold, such as text-to-image synthesis, video generation, and molecular structure generation. Despite this success, existing theoretical analyses of flow matching assume target distributions with smooth, full-dimensional densities, leaving its effectiveness in manifold-supported settings largely unexplained. To this end, we theoretically analyze flow matching with linear interpolation when the target distribution is supported on a smooth manifold. We establish a non-asymptotic convergence guarantee for the learned velocity field, and then propagate this estimation error through the ODE to obtain statistical consistency of the implicit density estimator induced by the flow-matching objective. The resulting convergence rate is near minimax-optimal, depends only on the intrinsic dimension, and reflects the smoothness of both the manifold and the target distribution. Together, these results provide a principled explanation for how flow matching adapts to intrinsic data geometry and circumvents the curse of dimensionality.
Read the full abstract

Information Theory

On the Computation Rate of All-Reduce

In the All-Reduce problem, each one of the K nodes holds an input and wishes to compute the sum of all K inputs through a communication network where each pair of nodes is connected by a parallel link with arbitrary bandwidth. The computation rate of All-Reduce is defined as the number of sum instances that can be computed over each network use. For the computation rate, we provide a cut-set upper bound and a linear programming lower bound based on time (bandwidth) sharing over all schemes that first perform Reduce (aggregating all inputs at one node) and then perform Broadcast (sending the sum from that node to all other nodes). Specializing the two general bounds gives us the optimal computation rate for a class of communication networks and the best-known rate bounds (where the upper bound is no more than twice of the lower bound) for cyclic, complete, and hypercube networks.
Read the full abstract

Number Theory

Analogue of the theta group $\Gamma_{\theta}$

In this paper, we introduce higher level versions of the theta group $\Gamma_{\theta}.$ In particular, we treat level 3 and 4 versions of the theta group, $\Gamma_{\theta,3}$ and $\Gamma_{\theta,4}$ and prove that $\displaystyle F(\tau)=\eta \left(\frac{\tau-1}{3} \right) \eta\left(\frac{\tau+1}{3} \right)$ and $\displaystyle G(\tau)=\eta \left(\frac{\tau-1}{4} \right) \eta\left(\frac{\tau+1}{4} \right)$ are modular forms on $\Gamma_{\theta,3}$ and $\Gamma_{\theta,4}$ respectively. Moreover we compute their multiplier systems, $\nu_{F}$ and $\nu_{G}$.
Read the full abstract

Analysis of PDEs

Weak Diffeomorphisms and Extremals for Scalar Conservation Laws

Scalar conservation laws in one space variable allow a Lagrangian (particle path) formulation. The Lagrangian trajectory in the infinite-dimensional group of diffeomorphisms on the physical space can be written as a system of conservation laws. The relation between solutions of the Cauchy problem for the conservation law and solutions of the corresponding Cauchy problem on the diffeomorphism group extends to weak solutions of the coresponding problems. The correspondence between particle paths and transport equations is analogous to that between a Lie group and the corresponding Lie algebra. This paper establishes that for scalar conservation laws the particle paths are extremals of an action functional on the space of diffeomorphisms; that is, they are geodesics in some metric. In some examples of systems of conservation laws, including the physical example of isentropic gas dynamics in one space dimension, diffeomorphism representations also exist and may be interpreted as extremals of action functionals.
Read the full abstract

Optimization and Control

Model Predictive Control for output tracking with prescribed performance

Model Predictive Control (MPC) offers a versatile framework for constraint handling and multi-objective optimisation, yet practical application faces challenges regarding initial and recursive feasibility, robustness against model mismatches, and sampled-data constraints. This thesis develops a novel MPC framework for a class of non-linear continuous-time systems governed by functional differential equations. It targets output tracking within prescribed error bounds while systematically overcoming these challenges. First, we introduce funnel MPC, an algorithm eliminating reliance on terminal conditions or restrictive long prediction horizons. Utilising funnel penalty functions – state costs penalising tracking error deviations from time-varying boundaries – this framework ensures feasibility while rigorously enforcing tracking performance guarantees. Next, we unify funnel MPC with model-free funnel feedback into a hybrid architecture. This synergises model-based optimisation with adaptive feedback compensation, achieving prescribed tracking performance despite structural model-plant mismatches, unmodelled dynamics, and unknown disturbances. To further enhance predictive accuracy, we integrate a data-driven learning framework that iteratively refines the model using system measurements, improving long-term performance without compromising robustness. Finally, we formalise the transition to sampled-data implementations. We derive explicit bounds on sampling rates and control effort to guarantee stability under piecewise constant control signals, a critical step for digital hardware deployment. By addressing feasibility, robustness, learning, and sampling, this thesis establishes a cohesive framework for output tracking within prescribed bounds, paving the way for future advances in learning-enhanced and robust MPC.
Read the full abstract

Number Theory

Computing Invariants of Artin-Schreier Curves

We present an algorithmic framework for computing generators for the ring of invariants of an Artin-Schreier curve. We give explicit invariants for almost all Artin-Schreier curves of genus up to~8 in standard form, and for a handful of curves of higher genus.
Read the full abstract

All authors Juanita Duque-Rosero, Elisa Lorenzo García, Beth Malmskog, Renate Scheidler

Optimization and Control

Huge-Scale Assortment Optimization with Customer Choice: A Parallel Primal-Dual Approach

We study huge-scale assortment optimization problems to maximize expected revenue under customer choice, addressing a fundamental challenge in industries such as transportation, retail, and healthcare. The choice-based linear programming (CBLP) formulation provides a powerful framework for optimizing sales allocations across customer segments, yet traditional approaches often fail to solve CBLPs of huge scale (involving millions of customer choices) due to the lack of algorithmic designs that exploit problem structure. To overcome this computational bottleneck, we propose a first-order primal-dual method, SPFOM, which requires only a small computational cost per iteration, achieves a provably near-optimal convergence rate, and can be readily extended to parallel computing environments. Computational experiments demonstrate the computational and practical superiority of SPFOM over state-of-the-art solvers for large-scale linear programs. The framework is extended to a multi-period assortment optimization setting with inventory constraints, where SPFOM estimates global shadow prices that enhance classical bid-price control policies compared with benchmark methods such as market segment decomposition. Numerical experiments and a case study using real-world data from the ZOZOTOWN platform validate the practical effectiveness of SPFOM, highlighting its advantages in improving revenue performance while maintaining balanced inventory levels.
Read the full abstract

All authors Donghao Zhu, Hanzhang Qin, Ching-pei Lee, Yuki Saito, Takahiro Kawashima, Kenji Fukumizu

Number Theory

Simultaneous Approximation for Lattice-Based Cryptography

We define two new problems called SIAP and CAP related to solving SIVP and CVP in a subset of lattices called Simultaneous Approximation (SA) lattices. We give dimension- and gap-preserving, deterministic polynomial-time and space reductions from SVP$_\gamma$, SIVP$_\gamma$, and CVP$_\gamma$ to their corresponding problems in SA lattices. These reductions show that instances of these problems in SA lattices are just as hard as general instances and thus are interesting new problems to consider for use in cryptography. We also show that the reductions are optimal in regards to integer inflation.
Read the full abstract

Information Theory · Cross-listed from cs.LG

A Learning-Based Hybrid Decision Framework for Matching Systems with User Departure Detection

In matching markets such as kidney exchanges and freight exchanges, delayed matching has been shown to improve overall market efficiency. The benefits of delay are highly sensitive to participants' sojourn times and departure behavior, and delaying matches can impose significant costs, including longer waiting times and increased market congestion. These competing effects make fixed matching policies inherently inflexible in dynamic environments. We propose a learning-based Hybrid framework that adaptively combines immediate and delayed matching. The framework continuously collects data on user departures over time, estimates the underlying departure distribution via regression, and determines whether to delay matching in the subsequent period based on a decision threshold that governs the system's tolerance for matching efficiency loss. The proposed framework can substantially reduce waiting times and congestion while sacrificing only a limited amount of matching efficiency. By dynamically adjusting its matching strategy, the Hybrid framework enables system performance to flexibly interpolate between purely greedy and purely patient policies, offering a robust and adaptive alternative to static matching mechanisms.
Read the full abstract

Functional Analysis

Maximal functions and multipliers for subkernels of Toeplitz operators

We study the relations between maximal functions in a Toeplitz kernel and those in a subkernel of the same Toeplitz operator, as well as the question of how multipliers between Toeplitz kernels act on subkernels. We use those relations to obtain model space representations, in particular isometric model space representations and Hayashi's representation, for some important classes of Toeplitz kernels.
Read the full abstract

Logic

A Complete Bounded Theory with Unbounded Types

One measure of the complexity of a first-order theory, and similarly a type, is the complexity of the formulas required to axiomatize it. We say a theory is bounded if there is an axiomatization involving only $\forall_n$-formulas for some finite $n$, and unbounded otherwise. One might expect bounded theories to have only bounded types. In fact, an analogue holds in infinitary logic, where the complexity of a Scott sentence roughly agrees with the complexity of the most complicated automorphism orbit. Our main result, however, shows this is not the case in the first-order setting: Namely, there can be a bounded theory, in fact $\forall_1$-axiomatizable, which has unbounded types.
Read the full abstract

Geometric Topology

Hatcher-Thurston complex for surfaces with non-planar ends

In this paper, for each $k\in \mathbb{N}$, we define a complex $\Gamma_k(S)$ for an infinite-type surface $S$ with non-planar ends, which serves as an analog of the Hatcher-Thurston complex for the infinite-type setting. We show that $\Gamma_k(S)$ is connected, simply connected, and that the automorphism group of $\Gamma_k(S)$ is isomorphic to the extended mapping class group.
Read the full abstract

Numerical Analysis

A Reduced Order Model for First-Principles Atomistic Simulations

To leverage the redundancy between the electronic structure computed for various model parameters such as varying atomic positions, we present a data-driven modeling framework for Kohn-Sham Density Functional Theory that bypasses the explicit optimization of electronic wavefunctions. We sample a priori representative atomic configurations and construct a low-dimensional basis that efficiently approximates the electronic structure subspace. Subsequently, we employ this reduced basis in an iterative solver for the electronic single particle density matrix, thereby enabling the efficient determination of ground state without iterative wavefunction optimization. We demonstrate the accuracy of our approach in a Born-Oppenheimer molecular dynamics of a water molecule, showing that the resulting simulations accurately reproduce key structural properties, such as bond lengths and bond angle, obtained from full first-principles molecular dynamics. This work highlights the potential of data-driven approaches to develop low-dimensional electronic structure representations for first-principles simulations.
Read the full abstract

All authors Siu Wun Cheung, Youngsoo Choi, Jonas Kaufman, Daniel Osei-Kuffuor, Jean-Luc Fattebert

Geometric Topology

Volumes of ideal hyperbolic drums

Milnor computed the volumes of ideal hyperbolic prisms as part of an effort to construct 3-manifolds whose volumes are finite rational sums of the Lobachevsky function evaluated at rational multiples of pi. Motivated by these results and with an eye to related applications, we prove a volume formula for arbitrary ideal hyperbolic antiprisms, also called drums.
Read the full abstract

All authors Eric Chesebro, Justin Lanier, Emma N. McQuire, James Morgan, Jessica S. Purcell, Henry Segerman

Differential Geometry

A Boothby-Wang construction in generalized contact geometry

We establish a generalized analogue of the Boothby-Wang theorem in generalized contact geometry, along with related results. We present a general method for constructing examples of generalized contact structures that are not of Poon-Wade type, and even examples that fail to be generalized contact structures. Using Courant reduction methods, we construct a generalized complex structure on a smooth leaf space and equip the generalized contact manifold with a principal bundle structure whose connection is defined by the generalized contact data. Under mild assumptions, we show that the curvature induces a symplectic foliation on the leaf space. Several examples are provided.
Read the full abstract

Category Theory

Layered Monoidal Theories II: Fibrational Semantics

Layered monoidal theories provide a categorical framework for studying scientific theories at different levels of abstraction, via string diagrammatic algebra. We introduce models for three closely related classes of layered monoidal theories: fibrational, opfibrational and deflational theories. We prove soundness and completeness of these theories for the respective models. Our work reveals connections between layered monoidal theories and well-known categorical structures such as Grothendieck fibrations and displayed categories.
Read the full abstract

Numerical Analysis · Cross-listed from cs.SC

Quadratization of Autonomous Partial Differential Equations: Algorithmic Solutions

Quadratization for partial differential equations (PDEs) is a process that formally transforms a PDE with a nonquadratic right-hand side into a quadratic form by introducing auxiliary variables. Even though the existence and uniqueness of the solution of this quadratic form are, as of yet, unknown in the general case, this symbolic transformation has been used in diverse fields to simplify the analysis, simulation, and control of PDE models. This paper presents a rigorous definition of PDE quadratization, a sample case study on the solutions of quadratic representations, and theoretical contributions for the PDE quadratization problem of spatially one-dimensional PDEs, including results on existence and complexity. Its main focus, however, is introducing and analyzing QuPDE, an algorithm based on symbolic computation and discrete optimization that outputs a quadratization for any spatially one-dimensional polynomial or rational PDE. This algorithm is the first computational tool to find quadratizations for PDEs to date. We demonstrate QuPDE's performance by applying it to fourteen nonquadratic PDEs in diverse areas such as fluid mechanics, space physics, chemical engineering, and biological processes. QuPDE delivers a low-order quadratization in each case, uncovering quadratic transformations with fewer auxiliary variables than those previously discovered in the literature for some examples, and finding quadratizations for systems that had not been transformed to quadratic form before.
Read the full abstract

Statistics Theory

Sampling from Constrained Gibbs Measures: with Applications to High-Dimensional Bayesian Inference

This paper considers a non-standard problem of generating samples from a low-temperature Gibbs distribution with constrained support, when some of the coordinates of the mode lie on the boundary. These coordinates are referred to as the non-regular part of the model. We show that in a “pre-asymptotic” regime in which the limiting Laplace approximation is not yet valid, the low-temperature Gibbs distribution concentrates on a neighborhood of its mode. Within this region, the distribution is a bounded perturbation of a product measure: a strongly log-concave distribution in the regular part and a one-dimensional exponential-type distribution in each coordinate of the non-regular part. Leveraging this structure, we provide a non-asymptotic sampling guarantee by analyzing the spectral gap of Langevin dynamics. Key examples of low-temperature Gibbs distributions include Bayesian posteriors, and we demonstrate our results on three canonical examples: a high-dimensional logistic regression model, a Poisson linear model, and a Gaussian mixture model.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

Learning geometry-dependent lead-field operators for forward ECG modeling

Modern forward electrocardiogram (ECG) computational models rely on an accurate representation of the torso domain. The lead-field method enables fast ECG simulations while preserving full geometric fidelity. Achieving high anatomical accuracy in torso representation is, however, challenging in clinical practice, as imaging protocols are typically focused on the heart and often do not include the entire torso. In addition, the computational cost of the lead-field method scales linearly with the number of electrodes, limiting its applicability in high-density recording settings. To date, no existing approach simultaneously achieves high anatomical fidelity, low data requirements and computational efficiency. In this work, we propose a shape-informed surrogate model of the lead-field operator that serves as a drop-in replacement for the full-order model in forward ECG simulations. The proposed framework consists of two components: a geometry-encoding module that maps anatomical shapes into a low-dimensional latent space, and a geometry-conditioned neural surrogate that predicts lead-field gradients from spatial coordinates, electrode positions and latent codes. The proposed method achieves high accuracy in approximating lead fields both within the torso (mean angular error 5{\deg}) and inside the heart, resulting in highly accurate ECG simulations (relative mean squared error <2.5%. The surrogate consistently outperforms the widely used pseudo lead-field approximation while preserving negligible inference cost. Owing to its compact latent representation, the method does not require a fully detailed torso segmentation and can therefore be deployed in data-limited settings while preserving high-fidelity ECG simulations.
Read the full abstract

All authors Arsenii Dokuchaev, Francesca Bonizzoni, Stefano Pagani, Francesco Regazzoni, Simone Pezzuto

Dynamical Systems

Ramanujan subshifts

A finite, connected, $(d+1)$-regular graph $G$ is called Ramanujan if every its eigenvalue $\lambda$ satisfies either $\lambda=\pm (d+1)$ or $|\lambda|\leq 2\sqrt{d}$. The Ramanujan condition corresponds to the optimal rate of decay of correlations for the associated non-backtracking edge subshift. We consider a higher-dimensional generalization of this observation. We introduce the notion of a $d$-regular $\mathbb{Z}^{\delta}$-subshift of finite type, and we define a Ramanujan subshift as a $d$-regular $\mathbb{Z}^{\delta}$-subshift with an optimal rate of decay of correlations. We show that for every odd prime power $q\geq 3$ and dimension $\delta<q$, there exists a $q$-regular Ramanujan $\mathbb{Z}^{\delta}$-subshift. The construction is based on the quaternionic lattices over $\mathbb{F}_q(t)$ introduced by Rungtanapirom-Stix-Vdovina (2019). Each of our $q$-regular Ramanujan subshifts gives rise to a family of non-bipartite $(q+1)$-regular Ramanujan graphs. These graphs are very explicit and local in the strong sense: the neighbors of any vertex can be computed by an explicit Mealy automaton associated with the subshift. As a byproduct, for every odd prime power $q$, we get a single lifting rule that can be iterated to produce an infinite family of $(q+1)$-regular Ramanujan graphs.
Read the full abstract

Algebraic Geometry

Non-trivial and Non-tautological Cohomology of Strata of Differentials

In this paper we construct various non-trivial and non-tautological cohomology classes on compactified and uncompactified strata of curves with a differential, by using the geometry of the boundary stratification of the moduli space of multi-scale differentials.
Read the full abstract

All authors Dawei Chen, Prabhat Devkota, Samuel Grushevsky, Martin Möller

Numerical Analysis · Cross-listed from quant-ph

Numerical Experiments with Parameter Setting of Trotterized Quantum Phase Estimation for Quantum Hamiltonian Ground State Computation

We numerically investigate quantum circuit elementary-gate level instantiations of the standard Quantum Phase Estimation (QPE) algorithm for the task of computing the ground-state energy of a quantum magnet; the disordered fully-connected quantum Heisenberg spin glass model. We consider (classical simulations of) QPE circuit computations on relatively small quantum Hamiltonians ($3$ qubits) with up to $10$ phase bits of precision, using up to Trotter order $10$. We systematically study the inputs of QPE, specifically time evolution, Trotter order, Trotter steps, and initial state, and illustrate how these inputs practically determine how QPE operates. From this we outline a coherent set of quantum algorithm input and tuning guidelines. One of the notable properties we characterize is that QPE sampling of the optimal digitized phase converges to a fixed rate. This results in strong diminishing returns of optimal phase sampling rates which can occur when the Trotter error is surprisingly high.
Read the full abstract

Probability

IDS for subordinate Brownian motions in Poisson random environment on nested fractals

We establish the Lifshitz singularity of the integrated density of states (IDS) for random Schrödinger operators \[ H^{\omega} = \phi(-\mathcal{L}) + V^{\omega} \] on planar unbounded nested fractals with the Good Labeling Property. Here, $\mathcal{L}$ is the Laplacian on the fractal, $\phi$ is an operator monotone function with mild regularity, and $V^{\omega}$ is a Poissonian random potential with a sufficiently regular profile. The main novelty of our work lies in showing that the study of $V^{\omega}$ can be effectively reduced to the analysis of certain alloy-type potential, where the sites are no longer lattice points as in the classical $\mathbb{Z}^d$ case, but fractal complexes. This observation enables us to apply an approach, new in the setting of Poissonian random fields, which allows us to treat a broad class of Bernstein functions $\phi$. In particular, it covers the case $\phi(\lambda)=(\lambda+m^{d_w/\vartheta})^{\vartheta/d_w}-m$, $\vartheta \in (0,d_w)$, $m>0$, corresponding to relativistic models, which were previously unattainable on fractals by known methods.
Read the full abstract

All authors Hubert Balsam, Kamil Kaleta, Mariusz Olszewski, Katarzyna Pietruska-Pałuba

Probability

Sum of Gaussian vectors and large sets

We prove that the convexity problem of M. Talagrand is equivalent to the subgaussian vector problem: can any centered $1$-subgaussian random vector in $\mathbb{R}^n$ be realized as the sum of a universal number of standard Gaussian vectors? We introduce methods to study this problem and, using elementary arguments, we settle it for $1$-subgaussian random variables and random vectors with good norm and covariance bounds. These results already confirm the permutation invariant case of the convexity problem, and give optimal estimates on the largest ellipsoid contained in a sum of large sets in Gaussian spaces. We also propose a Riemannian version of the convexity problem for spaces with nonnegative Ricci curvature.
Read the full abstract

2602.22342 · 25 Feb · v2: Updated to take into account the subsequent paper by D. Hua, S. Tudose and myself arXiv:2605.10908, which solves some of the main questions following the approach of this paper. Added comments explaining what is (not) subsumed by arXiv:2605.10908. Proposed a Riemannian version of the convexity problem of M. Talagrand

Mathematical Physics · Cross-listed from hep-th

Resurgence in the Virasoro Minimal String and 3d Gravity

We compute non-perturbative, resurgent contributions to the Virasoro minimal string and 3d gravity using techniques from hermitian matrix models. In particular, we construct a fully non-perturbative partition function for the Virasoro minimal string in terms of a Zak transform. In this context, negative tension D-branes appear naturally, which in the matrix model correspond to anti-eigenvalues, or instantons on the involuted sheet of the spectral curve. We further extend this analysis to resolvents and observe resurgent wall crossing phenomena between ZZ- and FZZT-branes. Using recent results that relate the Virasoro minimal string to 3d gravity with end-of-the-world branes we proceed to study the resurgent consequences of summing over the genus in 3d gravity, where we find non-perturbative contributions of doubly exponential type. These statements are then tested using resurgent large-order asymptotics. Lastly, we compute the non-perturbative eigenvalue density for generic hermitian matrix models and identify the change of asymptotic behavior at the edge of the eigenvalue distribution with a Stokes transition. This allows us to identify oscillations in the eigenvalue density with anti-Stokes behavior of FZZT-branes. In the case of 3d gravity with end-of-the-world branes we comment how this Stokes transition coincides with the onset of black hole behaviour and compute the non-perturbative primary density. Furthermore, we apply these techniques to the eigenvalue density of JT gravity to compute higher genus corrections.
Read the full abstract