Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 29 April

Probability

Exact formula for the 2-marginal second moment function of the multidimensional symmetric Markov random flight

We consider the symmetric Markov random flight $\bold X(t), \; t>0,$ in the Euclidean space $\Bbb R^m, \; m\ge 3$, performed by a particle that moves in $\Bbb R^m$ with constant finite speed and changes its directions at Poisson-distributed random time instants by choosing the initial and each new direction at random according to the uniform distribution on the unit $(m-1)$-dimensional sphere. The 2-marginal second moment function $\mu_{(2,2,0,\dots,0)}(t), \; t>0,$ of $\bold X(t)$, corresponding to the multi-index $(2,2,0,\dots,0)$, is examined. An explicit formula for function $\mu_{(2,2,0,\dots,0)}(t)$ is obtained. This formula is also valid for all other 2-marginal second moment functions corresponding to any multi-indices of the form $(0,\dots,0,2,0,\dots,0,2,0,\dots,0)$. It is also shown that this moment function, under the standard Kac scaling condition, turns into the product of the variances of two coordinates of the $m$-dimensional homogeneous Brownian motion.
Read the full abstract

Number Theory

Solution to the Erdos problem on distinct residues of factorials

Paul Erdos posed the following question: Is there a prime number $p>5$ such that the residues of $2!$, $3!$,\ldots, $(p-1)!$ modulo $p$ all are distinct. In this paper, we give the negative answer on this question in a relatively simple way.

Optimization and Control

Accelerated Backward Forward Method for Convex Optimization

We analyze the convergence rate of an accelerated backward forward method for solving convex composite optimization problems. The method was developed by Taylor, Hendrickx and Glineur, and is different from the FISTA algorithm in its placement of the proximal operator. When the smooth part of the objective function is convex, we establish a fast convergence rate of $\mathcal{O}\left( \frac{1}{k^2} \right)$ for the function values, and prove the weak convergence of the iterates. When the smooth part is strongly convex, we propose a variant of the method, and establish an accelerated linear convergence rate for the function values.
Read the full abstract

Combinatorics

The Frobenius problem for a class of quotients of numerical semigroups

Given a numerical semigroup $S$ and a positive integer $p$, the quotient $\frac{S}{p}=\{x\in \mathbb{N} \mid px\in S\}$ also forms a numerical semigroup. In this paper, we first characterize the Apéry set for a class of quotients of numerical semigroups. Under certain conditions, we then derive half-closed form formulas for their Frobenius number and genus. Furthermore, for specific values of part parameters, we obtain explicit formulas for the Frobenius number of certain quotients of numerical semigroups.
Read the full abstract

Numerical Analysis

Energy stable auxiliary variable method for Cahn–Hilliard equations

In this paper, we propose a quadratic reformulation theory for rational-like functions. Based on this theory, we develop the Quadratic Conservation Elevation (QCE) method, which combines the Scalar Auxiliary Variable (SAV) method with the implicit midpoint rule. We apply this approach to the Cahn-Hilliard (CH) equation with rational-like free-energy terms, obtaining numerical discretizations that preserve the original energy dissipation law. We further derive the discrete dispersion relation and coarsening dynamics, confirming the efficiency and consistency of the method with the continuous counterpart. In addition, we use the proposed method to capture missing orientations for different anisotropic functions. Numerical simulations with various initial conditions illustrate phase separation and anisotropic evolution.
Read the full abstract

Differential Geometry

Gromov-Hausdorff limit of orthonormal frame bundles of non-collapsed manifolds with bounded Ricci curvature

Let $M_i$ be a sequence of non-collapsed $n$-manifolds with two-sidedly bounded Ricci curvature. We show that the Gromov-Haudorff limit space, $Y$, of the associated sequence of orthonormal frame bundles, $FM_i$, equipped with an almost canonical metric, shares similar properties as a Ricci limit space of non-collapsing sequence i.e., the singular set has codimension $\ge 4$ whose complement contains an open and dense $C^{1,\alpha}$-Riemannian manifold.
Read the full abstract

Information Theory

Existence and Constructions of Strict Function-Correcting Codes with Data Protection

Function-correcting codes with data protection simultaneously protect both the data and a function of the data at distinct error-correction levels. When the function receives strictly stronger protection than the data, such a code is called a strict function-correcting code with data protection. While prior work showed that perfect and MDS codes cannot serve as strict function-correcting codes, which codes can serve this role, and how to construct them, has remained open. In this paper, we address the existence and construction of strict function-correcting codes for linear codes through three main contributions. First, using the $\alpha$-distance graph framework from our prior work, we establish a graph-theoretic existence condition under which a code can serve as a strict function-correcting code. For linear codes, we prove this distance graph is isomorphic to a Cayley graph, which implies the connected components are cosets of the subcode generated by low-weight codewords. This transforms the existence problem into a subcode generation problem. Second, a classical result of Simonis shows any linear code can be transformed into one with the same parameters whose basis consists entirely of minimum-weight codewords. We develop a converse construction: under certain conditions on the weight distribution, a linear code can be transformed into a new code with the same parameters but fewer independent minimum-weight codewords, thereby producing codes suitable for use as strict function-correcting codes. As a source of codes satisfying these conditions, we introduce chain codes, an infinite family of linear codes generated by their minimum-weight codewords. Third, we present an independent construction of strict function-correcting codes from narrow-sense BCH codes with designed distance three, by proving the minimum-weight codewords of such codes are contained in a proper subcode.
Read the full abstract

All authors Charul Rajput, B. Sundar Rajan, Ragnar Freij-Hollanti, Camilla Hollanti

Probability

Limiting spectral distributions of large consistent rank correlation matrices

We study random matrices whose entries are obtained by applying consistent rank correlations, such as Hoeffding's $D$, pairwise to a high-dimensional random vector with mutually independent components. Prior work has shown that, in the proportional high-dimensional regime, the empirical spectral distributions of large Kendall's tau and Spearman's rho matrices converge weakly almost surely to the Marchenko–Pastur law. By contrast, we prove that for consistent rank correlations such as Hoeffding's $D$, the limiting spectral distribution is given by the semicircle law. Our result thus generalizes a recent work of Dong, Han, and Yao (2025), who considered the special case of Chatterjee's rank correlation and established the first semicircle law for a large correlation matrix in the proportional regime.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Imaginarity-generating power of unitaries: A resource-theoretic approach

Imaginarity, stemming from the complex structure of quantum mechanics, has recently emerged as a fundamental resource, yet its dynamical generation remains largely unexplored. In this work, we introduce the notion of imaginarity-generating power (IGP) of unitary dynamics, which quantifies the ability of unitary operations to produce imaginarity from initially real quantum states. To quantify imaginarity, we employ a measure based on the Hilbert–Schmidt norm, which we show to be monotone under real unital operations. Within the framework of dynamical resource theories, we derive an exact expression for the purity-constrained IGP in arbitrary dimensions and show that, for pure real input states, it depends solely on intrinsic and experimentally accessible properties of the unitary. We further analyze its average behavior over ensembles of states with varying purity under both uniform and Hilbert–Schmidt distributions. We prove that it satisfies the essential properties of a valid resource monotone within the dynamical resource theory of imaginarity. We also characterize the unitaries that maximize the IGP and determine the corresponding bounds. Moreover, for Haar-random unitaries, we show that the IGP concentrates near its maximal value in high dimensions with small fluctuations, indicating that typical high-dimensional quantum dynamics are highly effective at generating imaginarity.
Read the full abstract

All authors Akhil Kumar Awasthi, Mrinmoy Samanta, Sudipta Mondal, Ayan Patra, Aditi Sen De

Information Theory

Multi-Server Secure Aggregation with Arbitrary Collusion and Heterogeneous Security Constraints

We study the fundamental limits of multi-server secure aggregation over a two-hop network where multiple servers, each connected to a disjoint subset of users, jointly compute the sum of all users' inputs. The goal is to ensure that no server can infer any information about prescribed subsets of inputs beyond the desired aggregate, even when colluding with an arbitrary subset of users. Existing works largely focus on homogeneous security requirements, where all inputs are protected against colluding sets up to a given size. Such formulations are insufficient to capture more general scenarios in which different subsets of inputs may require protection against different collusion patterns. In this paper, we consider a general model with heterogeneous security requirements and arbitrary user collusion. We characterize the communication rates for all parameter regimes, and determine the minimum key rate required for secure aggregation in most regimes. In particular, we establish tight information-theoretic lower bounds and matching achievable schemes in a broad class of regimes. For the remaining regime, we derive a general lower bound together with an achievable scheme that attains it within a bounded gap. Our results reveal how the interplay between network topology and heterogeneous security constraints fundamentally determines the communication and key generation requirements, and generalize existing results on secure aggregation.
Read the full abstract

All authors Zhou Li, Xiang Zhang, Jiguang He, Giuseppe Caire

Information Theory

Rank Distribution and Dynamics of Gram Matrices from Binary m-Sequences with Applications to LCD Codes

The Gram matrix is a classical object formed from the pairwise inner products of a collection of vectors, with fundamental roles in functional analysis, statistics, combinatorics, and coding theory. In the realm of sequence design, maximum-length sequences (m-sequences) are among the most fundamental classes of sequences, traditionally characterized by their span, decimation, shift-and-add, balance, run, and ideal autocorrelation properties. In this paper, we bridge the two foundational concepts by uncovering novel structural features of m-sequences through the lens of a family of Gram matrices. Specifically, for each $1 \le t \le 2^n - 1$, we extract $n$ consecutive subsequences of length $t$ from an m-sequence of period $2^n - 1$, construct their corresponding $n \times n$ Gram matrix, and investigate its rank, denoted by $r_n(t)$. Utilizing semilinear representation of Galois groups and Bézoutian of polynomials, we derive an explicit formula for $r_n(t)$ for all $t$, thereby establishing the complete rank distribution of these Gram matrices. Notably, we prove that full rank is attained for approximately half of the admissible values of $t$. We further uncover the intricate dynamics of $r_n(t)$: rank-deficient states are strictly unstable (i.e., $r_n(t) < n$ implies $r_n(t+1) \ne r_n(t)$), whereas the full-rank state exhibits strong persistence, remaining at $n$ over a nontrivial interval of consecutive values of $t$. Altogether, our results fully characterize both the global rank distribution and the local dynamics of rank function, as invariant of m-sequences. As an application, our findings completely determine the hull distribution of the family of punctured cyclic simplex codes.
Read the full abstract

All authors Hengfeng Liu, Chunming Tang, Cuiling Fan, Zhengchun Zhou

Combinatorics

On a conjecture of distance spectral extremal problems

Brualdi and Hoffman proposed a well-known problem of determining the graph with maximum adjacency spectral radius among all graphs with given size $m$. Early work by Friedland and Stanley addressed some specific cases. This problem was later completely solved by Rowlinson and recently revisited by Cheng and Weng. Pioneering work on the distance matrix was carried out by Graham and Pollak, as well as by Graham and Lovász. The distance spectral radius $\rho (G)$ of a connected graph $G$ is the largest eigenvalue of its distance matrix. In this paper, we completely solve the problem of characterizing the connected graph with minimum distance spectral radius among all graphs with size $m$. Let $\mathcal{G}(m)$ be the class of connected graphs with $m$ edges. For every $m \ge 3$, let $n$ be the unique integer satisfying $\binom{n-1}{2} < m \le \binom{n}{2}$, and we write $m = \binom{n-1}{2} + s$ with $1 \le s \le n-1$. Recently, Lin and Zhou [Adv. in Appl. Math. 173 (2026)] investigated the graph in $\mathcal{G}(m)$ that minimizes $\rho(G)$ in the range $s \ge \max\{ \frac{n-6}{2}, 1\}$. However, the problem is much more difficult in the remaining range $1 \le s \le \frac{n-7}{2}$, and they conjectured that the unique minimizer is $\overline{P_{n,s+1}}$, the complement of a balanced disjoint union of paths. Using novel matrix analysis, we solve this conjecture in the affirmative. Moreover, we provide a new unified proof for the entire range $1 \le s \le n-1$. The key ingredients in our proof argument include an innovative comparison principle for the distance spectral radius, an increment analysis of $\Phi$-functions on paths and cycles, an argument for balancing path lengths, and a walk enumeration technique via the Neumann series.
Read the full abstract

Numerical Analysis

Drift-Free Conservative Dynamics from Quantized Interaction Rules

Conservation laws are conventionally discretized through floating-point flux evaluation, with invariants obtained by cancellation of approximate interface contributions and admissible weak solutions selected by reconstruction and Riemann solvers. Here we introduce an operator-level formulation in which conservative dynamics is realized as an exact discrete interaction rule on a quantized state space. The update is defined by an antisymmetric integer-transfer operator, which enforces conservation exactly at the arithmetic level and eliminates round-off drift from the primitive evolution. For scalar laws, monotone order-preserving transfers select admissible shock structures within the primitive update, rather than through flux reconstruction. Numerical experiments show that the interaction rule preserves high-frequency transport near the Nyquist limit and maintains sharply localized discontinuities in Burgers dynamics. The same construction extends to multidimensional problems and systems of conservation laws through oriented, vector-valued integer transfers. The results show that exact integer-transfer dynamics can suppress cumulative transport drift while preserving entropy-shock localization in nonlinear conservative evolution.
Read the full abstract

Algebraic Topology · Cross-listed from cs.CV

Topology-Aware Representation Alignment for Semi-Supervised Vision-Language Learning

Vision-language models have shown strong performance, but they often generalize poorly to specialized domains. While semi-supervised vision-language learning mitigates this limitation by leveraging a small set of labeled image-text pairs together with abundant unlabeled images, existing methods remain fundamentally pairwise and fail to model the global structure of multimodal representation manifolds. Most existing topology-based alignment methods rely on persistence diagram matching, which neither guarantees geometric alignment nor uses the image-text pairing information central to vision-language learning. We propose Topology-Aware Representation Alignment for Semi-Supervised Vision-Language Learning (ToMA), a framework that uses persistent homology to decompose pairwise relations into $H_0$-death and $H_1$-birth relations and aligns them across modalities through available cross-modal correspondences. This lightweight decomposition captures both connectivity and cycle-closing structure without constructing 2-simplices. Experiments show clear improvements on remote sensing, while fashion results reveal strong gains in classification and particularly strong retrieval improvements for difficult queries. Additional analysis shows that ToMA provides more consistent gains than alternative topology-based objectives and that lightweight $H_1$-birth edges provide useful higher-order structural signals.
Read the full abstract

All authors Junwon You, Mihyun Jang, Sangwoo Mo, Jae-Hun Jung

Geometric Topology

Reidemeister and movie moves for involutive links

An involutive link is a link which is invariant under the standard rotation by 180 degrees in $S^3$. We establish an equivariant analogue of the work of Carter and Saito aimed at studying equivariant cobordisms between involutive links. This gives a set of $39$ equivariant movie moves that suffice to go between any two movie presentations of a pair of equivariantly isotopic cobordisms. Along the way, we give a singularity-theoretic proof of the equivariant Reidemeister theorem and study loops of equivariant Reidemeister moves. Our approach proceeds by analyzing codimension $2$ singularities of equivariant maps from $S^1$ to $\mathbb{R}^2$, as well as utilizing embedded equivariant Morse theory.
Read the full abstract

All authors Maciej Borodzik, Irving Dai, Abhishek Mallick, Matthew Stoffregen

Category Theory · Cross-listed from cond-mat.soft

A Category-Theoretic Framework from Biological Mechanics to Engineered Stimulus-Response Systems

Natural materials achieve adaptive behavior through hierarchical organization and coupled mechanisms across scales. Their translation into engineering, however, remains largely heuristic. What is missing is a formal translation framework that carries biological design logic into engineered realization while preserving physical consistency across levels of abstraction. Here we present a category theoretic compositional framework for verified nature-derived design. The framework defines a category of stimulus response dynamical systems with natural and artificial subcategories. It introduces a structure preserving implementation functor from biological mechanics to engineered systems. It also formalizes a machine agnostic specification layer that links behavioral intent to executable fabrication programs. We instantiate the framework on the hygromorphic pinecone hierarchy as a representative biological case. We implement the full pipeline in Grasshopper, where formal specifications are translated into modular parametric scripts that preserve the compositional structure of the model. The resulting designs are fabricated by fused filament fabrication, evaluated experimentally, and tested against model predictions derived from the pipeline. The current implementation generates four actuator classes spanning two stimulus types and two kinematic responses. One actuator arises purely through composition from previously validated components, without additional manual derivation. The results show that compositionality can function not just as a descriptive language, but as a generative and system level verifiable method for mechanical material design. More broadly, the work provides a concrete route for embedding formal multiscale reasoning within increasingly computational, generative, and physics-driven design workflows.
Read the full abstract

All authors Lee Marom, Skylar Tibbits, Gioele Zardini, Markus J. Buehler

Algebraic Geometry

Multiplicative convolution and double shuffle relations

We develop a geometric approach to the regularized double shuffle relations for multiple zeta values, based on convolution of perverse sheaves on $\mathbb{C}^*$ and inspired by the approach of Deligne and Terasoma. We introduce semi-holonomy isomorphisms associated with pro-unipotent paths and show that their compatibility with multiplicative convolution is equivalent to a condition on the pro-unipotent fundamental group, the homological pentagon equation. We prove that this condition is equivalent to the regularized double shuffle relations, yielding a geometric proof that the pentagon equation implies these relations. The approach is purely topological and avoids Hodge-theoretic and Tannakian methods.
Read the full abstract

Mathematical Physics

On enumeration of $b$-angulations of surfaces from an integrability perspective

In this paper, we study generating series enumerating polygonal angulations of closed oriented surfaces of fixed genus, focusing on $b$-angulations with $b = 3$ or $b = 2\nu$, $\nu \geq 2$. Based on Toda integrability, we establish new structural results in the cases $b = 3$ and $b = 4$. Furthermore, via the Hodge–GUE correspondence, we derive a fine structure in the $b = 2\nu$ case, which implies a conjectural statement of Gharakhloo–Latimer.
Read the full abstract

All authors Elba Garcia-Failde, Jianghao Xu, Di Yang, Don Zagier

Operator Algebras

Crossed product functors associated to $\ell^p$-pseudofunctions

We show that the $\ell^p$-pseudofunctions, which were recently shown to lead to exotic completions of group $C^*$-algebras by Wiersma and the second named author, can be used to construct well-behaved crossed product functors in the sense of Buss, Echterhoff and Willett. The construction proceeds via introducing certain Banach algebras, related to operators acting on Hilbert valued $\ell^p$-spaces, which a priori depend on the choice of a Hilbert space representation of the underlying C*-algebra. We prove that, in fact, the resulting algebras are isomorphic (with the isomorphism constant depending only on $p$), and hence their C*-envelopes are isometrically isomorphic. This, in particular, means that the construction genuinely generalises the one studied earlier in the group case. The tools we develop allow us to show that for certain non-amenable actions, the resulting crossed product completions must indeed be exotic.
Read the full abstract

All authors Jacek Krajczok, Ebrahim Samei, Timo Siebenand, Adam Skalski

Information Theory

On the Capacity of Hierarchical Secure Aggregation with Groupwise Keys

We study the hierarchical secure aggregation problem with groupwise keys. The problem consists of an aggregation server, $U$ relays, and $UV$ users, where each relay serves $V$ disjoint users, and each subset of $G$ users shares an independent groupwise key. Two security requirements are imposed: relay security and server security. Specifically, each relay must not learn any information about the users' inputs, and the server must not learn any additional information beyond the recovered sum of all inputs. We first show that the problem is infeasible when $G = 1$. For the feasible regime $1 < G \le UV$, we fully characterize the optimal rate region. In particular, we prove that both each user and each relay must transmit at least one symbol per input symbol. Furthermore, we characterize the minimum required groupwise key rate as $\max\left\{\frac{V}{\binom{UV}{G} - \binom{(U-1)V}{G}},\; \frac{U - 1}{\binom{UV}{G} - U \binom{V}{G}}\right\},$ where the two terms correspond to the constraints imposed by relay security and server security, respectively. For achievability, we propose an explicit linear coding scheme based on structured precoding matrices, and show that it satisfies both correctness and security requirements. The construction avoids permutation-based symmetrization by leveraging sufficiently generic matrix designs over large fields. Finally, we establish a matching converse, thereby characterizing the optimal rate region.
Read the full abstract

All authors Minyang Lu, Zhou Li, Haiqiang Chen, Min Xie

Numerical Analysis

A Second-Order Maximum-Principle-Preserving Crouzeix-Raviart Finite Element Method for Time-dependent Transport Equation

In this paper, we construct an explicit, second-order, and maximum-principle-preserving Crouzeix-Raviart (CR) finite element method for two-dimensional time-dependent transport equation. The key observation is that the mass matrix of the CR element is with diagonal structure, which allows us to avoid the need to solve a large linear system for each time step and help to construct a low-order scheme that preserves the maximum principle in a simple way. We first introduce low-order schemes based on minimum and bilinear viscosities, and then recover second-order accuracy by means of greedy and flux-corrected transport viscosities. For inflow boundary conditions, we further design a modified FCT limiter. In addition, we propose a simple reconstruction based on Wachspress coordinates to obtain a continuous piecewise linear approximation on the $\frac{h}2$-mesh that satisfies the maximum principle on the whole domain. Under divergence-free velocity fields, the proposed schemes are conservative. Numerical experiments on both smooth and discontinuous test cases, with both solenoidal and non-solenoidal velocity fields, confirm the accuracy and robustness of the proposed schemes.
Read the full abstract

Algebraic Geometry

Approximating Periodic Orbits with Algebraic Curves and Related Minimal Problems

The Circular Restricted Three-Body Problem (CR3BP) models the motion of a massless body under the gravitational influence of two primaries. We present a method for approximating a given family of periodic orbits by low-degree implicit algebraic curves, producing one-parameter families of algebraic orbit models. These models enable the construction of minimal problems motivated by liaison navigation, where spacecraft states are inferred from inter-spacecraft measurements. Relevant applications include initial orbit determination and spacecraft positioning. Each minimal problem defines a parameterized family of instances; for generic parameters, the number of solutions equals the degree of the associated branched covering map. We compute these degrees using both symbolic and numerical methods, and we outline a homotopy-continuation-based solver construction that can be practical for low-degree cases.
Read the full abstract

Algebraic Geometry

Locally rigid implies globally rigid in Kahler geometry

In this paper, we study the rigidity properties of compact Kahler manifolds. Given a smooth family of compact Kahler manifolds X over the unit disk, we show that all the fibers are mutually isomorphic if the family is locally trivial at a point t_1 and the fiber X_{t_1} is non-uniruled. This proves that the locally rigid implies the global rigid in Kahler. It also can be used to prove the so called global non-deformability for non-uniruled Kahler manifolds under Kahler morphisms.
Read the full abstract

Mathematical Physics

Combinatorics and asymptotic behavior for double Hurwitz numbers

Polynomial-in-time algorithms for computing classical Hurwitz numbers were given in [4] based on the Pandharipande equation. The paritition function of double Hurwitz numbers was proved [21] to satisfy the 2-Toda hierarchy. In this paper, similar to [21] we derive Pandharipande-type equations for double Hurwitz numbers from 2-Toda hierarchy. Based on these equations and a method from [4], we study large genus as well as large degree asymptotics of double Hurwitz numbers.
Read the full abstract

Mathematical Physics

Rigged Liouville space formulation for quasi-Hermitian Liouville operators

We discuss a super bra-ket formalism for quasi-Hermitian Liouvillian operators within the framework of rigged Hilbert spaces (RHS). An RHS in terms of the Liouville space, referred to as a rigged Liouville space (RLS), is reconstructed by exploiting the mathematical fact that the space of Hilbert-Schmidt operators is unitarily equivalent to the tensor product of Hilbert spaces. The obtained RLS endows a rigorous foundation of the construction for the super bra-ket and for the spectral decompositions of both Hermitian and quasi-Hermitian Liouville operators, which are characterized by the generalized eigenvectors in the dual spaces. Furthermore, within this framework, the non-Hermitian Liouvillian operator and its adjoint can be constructed symmetrically, with their symmetric structure preserved. As an application of our RLS methodology, we examine the Liouville operators corresponding to Hermitian and non-Hermitian harmonic oscillators and elucidate the differences between their spectral decomposition forms.
Read the full abstract

Probability

Smallest distances between zeros of Gaussian analytic functions

In this article, we study the smallest distances between the zeros of Gaussian analytic functions over compact Riemann surfaces. Our main result is that, after appropriate rescaling, the point process of the smallest distances converge to a Poisson point process with a universal rate. Furthermore, the locations where these smallest distances occur tend to follow a uniform measure with respect to the volume form. As a consequence, the limiting density of the $k$-th rescaled smallest distance is proportional to $x^{4k-1}e^{-x^4}$ for any $k\geq 1$. Analogous results hold for the classical Gaussian Entire Functions.
Read the full abstract

Spectral Theory

Flexibility of eigenvalues for graph Laplacians arising from genus 3 surfaces

It is known that the small eigenvalues of the Laplacian of a Riemann surface close to the boundary of the modular space can be well approximated by the eigenvalues of the discrete Laplacian on a certain graph coming from the pair of pants decomposition of the surface. In this paper, we provide a complete description of the sets of eigenvalues of the weighted graph Laplacian for all graphs on four vertices that correspond to a valid pair of pants decomposition of a surface of genus 3.
Read the full abstract

Probability

Optimization-Free Concentrated Matrix-Exponentials

Near-deterministic positive delays require highly concentrated distributions, but phase-type models are constrained by the Erlang variance limit. While matrix-exponential distributions can empirically bypass this barrier, prior low-variance constructions relied entirely on numerical optimization. We propose an explicit family of concentrated matrix-exponential densities for the unit delay, obtained by raising the trigonometric Fejér kernel to logarithmic power. With exact moments and closed-form parameters, this gives the first analytical proof of a matrix-exponential class that asymptotically surpasses the Erlang bound.
Read the full abstract