Probability
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Wednesday 18 March
In this work, recent results on the moments of balanced Pólya urns are generalized to unbalanced urns, with the condition that the expected change in total activity at each step is constant. We also provide applications of our results to the degree distributions of random trees grown by uniform attachment with freezing and to the degree distribution of hooking networks; in both cases we prove a normal limit law with convergence of all moments.
Combinatorics
Algorithms for the Generation of Snarks
The essential requirement for a cubic graph to be called a snark is that it can not be edge-coloured with three colours. To avoid trivial cases, varying restrictions on the connectivity are imposed. Snarks are not only interesting in themselves, but also a valuable test field for conjectures about graphs that are not snarks and sometimes not even cubic. For many important open problems in graph theory it is proven that minimal counterexamples would be snarks. We give two new algorithms for the generation of snarks and results of computer programs implementing these algorithms. One algorithm is for snarks with girth exactly 4 and is used for generating complete lists of girth 4 snarks on up to 40 vertices. The second algorithm lists snarks with girth at least 5 and is used for generating complete lists of such snarks on up to 38 vertices. We also give complete lists of strong snarks (in the terminology of Jaeger) on up to 40 vertices.
Read the full abstract
Optimization and Control
A Dual Certificate Approach to Sparsity in Infinite-Width Shallow Neural Networks
In this paper, we study total variation (TV)-regularized training of infinite-width shallow ReLU neural networks, formulated as a convex optimization problem over measures on the unit sphere. Our approach leverages the duality theory of TV-regularized optimization problems to establish rigorous guarantees on the sparsity of the solutions to the training problem. Our analysis further characterizes how and when this sparsity persists in a low noise regime and for small regularization parameter. The key observation that motivates our analysis is that, for ReLU activations, the associated dual certificate is piecewise linear in the weight space. Its linearity regions, which we name dual regions, are determined by the activation patterns of the data via the induced hyperplane arrangement. Taking advantage of this structure, we prove that, on each dual region, the dual certificate admits at most one extreme value. As a consequence, the support of any minimizer is finite, and its cardinality can be bounded from above by a constant depending only on the geometry of the data-induced hyperplane arrangement. Then, we further investigate sufficient conditions ensuring uniqueness of such sparse solution. Finally, under a suitable non-degeneracy condition on the dual certificate along the boundaries of the dual regions, we prove that in the presence of low label noise and for small regularization parameter, solutions to the training problem remain sparse with the same number of Dirac deltas. Additionally, their location and the amplitudes converge, and, in case the locations lie in the interior of a dual region, the convergence happens with a rate that depends linearly on the noise and the regularization parameter.
Read the full abstract
Commutative Algebra
Explicit Betti Numbers for Skeletons of Chordal Clique Complexes and Their Alexander Duals
Let $\Delta_{\mathbf r}=\Delta_{\mathbf r}(n_1,\ldots,n_e)$ be the clique complex of a chordal graph with maximal cliques $S_1,\ldots,S_e$ in a leaf order, where $n_m=|S_m|$, $r_m=|S_{m+1}\cap(S_1\cup\cdots\cup S_m)|$, $\mathbf r=(r_1,\ldots,r_{e-1})$, and $N_{\mathbf r}$ is the number of vertices. We determine the graded Betti numbers $\beta_{i,j}\bigl(\mathbb K[(\Delta_{\mathbf r})_{(k)}]\bigr)$ of every skeleton and derive explicit formulas for its regularity, projective dimension, depth, multiplicity, Cohen-Macaulayness, and initially Cohen-Macaulayness. We also compute its extremal Betti numbers and describe its integral homology and homotopy type. For the Alexander dual $\Delta_{\mathbf r}^{\vee}$, we construct an explicit minimal multigraded resolution whose shifts are determined by $N_{\mathbf r}-n_m$ and $N_{\mathbf r}-r_m$, and obtain its graded and multigraded Betti numbers, canonical module, Cohen-Macaulay type, $a$-invariant, and Gorenstein criterion. We further show that every proper skeleton $(\Delta_{\mathbf r}^{\vee})_{(k)}$ is Cohen-Macaulay and level, determine its Betti numbers and type, and characterize its Gorenstein cases. Finally, we show that the graded Betti table of $\mathbb K[\Delta_{\mathbf r}^{\vee}]$ determines the multisets ${n_m}$ and ${r_m}$ up to a common shift.
Read the full abstract
Algebraic Geometry
Affineness of the maximal étale locus
In this paper we will prove a strong version of the celebrated purity of the ramification locus theorem in algebraic geometry. Our key input is a Tor-independence result for global sections of étale schemes over excellent regular local rings, which we will prove by tilting to perfect rings.
Read the full abstract
Combinatorics
Tangle structure trees II: trees of tangles and tangle-tree duality
Tangle structure trees, introduced in [3], offer a unified data structure that displays all the tangles of a graph or data set together with certificates for the non-existence of any other tangles, either locally or overall. In this paper we apply tangle structure trees to derive new versions of the two fundamental tangle theorems: the tree-of-tangles theorem, and the tangle-tree duality theorem. We extend the tree-of-tangles theorem to $\mathcal F$-tangles that need not be profiles. When $\mathcal F$ consists of stars of separations, as it does in classical tangle-tree duality theorems, we show how to convert tangle structure trees that certify the non-existence of $\mathcal F$-tangles into tree-decompositions that certify this in the way known from graph tangles, as $S$-trees over~$\mathcal F$.
Read the full abstract
Combinatorics
The asymptotic version of the Erdős-Sós conjecture and beyond
Klimošová, Piguet, and Rozhoň conjectured that any graph with minimum degree $k/2$ and sufficiently many vertices of degree $k$ should contain all trees with $k$ edges. We prove an asymptotic version of this conjecture for dense host graphs. We obtain interesting corollaries: the first is an asymptotic version of the Erdős–Sós conjecture for dense host graphs, which works without any bounded-degree restriction on the guest trees. Secondly, by leveraging recent results by Pokrovsky, we can translate our results to sparse host graphs in the case of bounded-degree guest trees.
Read the full abstract
Analysis of PDEs
A heterogeneous nonlocal advection–diffusion system
We present a self-contained investigation of the local and global well-posedness of a system of nonlocal advection–diffusion equations for a heterogeneous population over $\mathbb{R}^d$, $d \in \mathbb{N}$. Each convolution kernel $K_{ij}$, which describes the nonlocal advection of species $i$ according to the distribution of species $j$, is assumed to have its own regularity $\nabla K_{ij} \in L^{q_{ij}}(\mathbb{R}^d)$, $1 < q_{ij} < \infty$. Local well-posedness of the mild solution and its regularity is obtained using semigroup theory and contraction mapping arguments. For kernels that satisfy a given interaction cycle condition, global existence is established using a Nash-type inequality to show an a priori energy bound. For a class of kernels that need not satisfy the interaction cycle condition, a dynamical property satisfied by a normalised \(L^p\) norm of each species is used to obtain a uniform-in-time bound under a smallness condition on the initial data. An example family of kernels with varying regularities, supplemented by numerical simulations, is then considered to illustrate the theory developed in this work and how it may be generalised.
Read the full abstract
Analysis of PDEs
Rigorous derivation of an effective model for periodic Schrödinger equations with linear band crossing of Dirac type
In this paper we consider a family of time-dependent 1-dimensional cubic Schrödinger equation (NLS) with periodic potential. Exploiting semiclassical scaling and multiscale analysis, we derive an effective nonlinear Dirac equation, which describes the dynamics of solutions to NLS spectrally localized around Dirac points.
Read the full abstract
Analysis of PDEs
Global Uniqueness of Subsonic Flows for the Steady Euler-Poisson System
We prove the global uniqueness of multidimensional subsonic flows for the steady Euler–Poisson system in a bounded nozzle in the sense that uniqueness holds without restricting solutions to be small perturbations of a background state. The proof is based on a convexity property of the set of subsonic states and energy estimates.
Read the full abstract
Differential Geometry
The p-widths of the Hemisphere
We compute the p-widths, $\{\omega_p\}$, for the hemisphere with the standard round metric. This provides the first example of a manifold with boundary for which the $p$-widths are known for all $p$.
Number Theory
Diophantine approximation with integers having no large prime factors
Given any irrational number $\alpha$, we show that for any $0<\theta<6/17$, there are infinitely many $y$-smooth (friable) numbers $n$ such that $$\|n\alpha\| < n^{-\theta},$$ where $(\log n)^C\leq y\leq n$ for some large constant $C>0$. This improves the previous work of Baker, who obtained the exponent $1/3-2/(3C)+o(1)$ in the case of $y\geq (\log n)^C$, and that of Yau, who obtained the exponent $1/3$ when $y=n^{o(1)}$. Our proof is based on the dispersion method together with arithmetic inputs coming from the average bounds for Kloosterman sums over smooth numbers.
Read the full abstract
Combinatorics
Fractional coloring via entropy
In recent work, Martinsson and Steiner proved that triangle-free $d$-degenerate graphs have fractional chromatic number $\chi_f(G) = O\left(\frac{d}{\log d}\right)$. Here, we introduce an alternate proof of the bound rooted in the analysis of the entropy of certain random variables. Beyond simplifying the original argument, our technique naturally generalizes to broader settings. In this paper, we focus on two extensions of the result. First, we consider locally $r$-colorable graphs $G$, where $\chi(G[N(v)]) \le r$ for every vertex $v$. We show that $d$-degenerate locally $r$-colorable graphs satisfy $\chi_f(G) = O\left(\frac{d\log (2r)}{\log d}\right)$, strengthening a result of Alon (1996) on the independence number of such graphs. Second, we extend Martinsson and Steiner's result to $r$-uniform $d$-degenerate hypergraphs $H$ with girth at least $4$, showing that $\chi_f(H) \le c_r\left(\frac{d}{\log d}\right)^{\frac{1}{r-1}}$ for a constant $c_r > 0$. This yields a strict generalization of a seminal result of Ajtai, Komlós, Pintz, Spencer, and Szemerédi (1982) on the independence number of uncrowded hypergraphs. Via random sampling as introduced by Duke, Lefmann, and Rödl (1995), we obtain an improved bound on the independence number of linear hypergraphs, establishing a recent conjecture of Verstraëte and Wilson (2026). Our arguments generalize to the setting of fractional colorings with local demands, introduced by Kelly and Postle (2024). This yields previously unknown degree-sequence lower bounds on the independence number across each setting considered. Furthermore, our approach is constructive, yielding efficient randomized algorithms for sampling independent sets in these contexts.
Read the full abstract
Differential Geometry
Bernstein-type Theorems for constant mean curvature surfaces in the three-dimensional light cone
We establish Bernstein-type theorems for entire constant mean curvature graphs in the three-dimensional light cone $\mathbb{Q}^3_+$ over the horosphere under the assumption that the Gaussian curvature $K$ is bounded below, by showing that such graphs are horospheres or spheres of $\mathbb{Q}^3_+$.
Read the full abstract
Analysis of PDEs
Quantitative Stability for Minkowski's problem
We derive quantitative stability results for Minkowski bodies, as well as their counterparts, the $L_p$-Minkowski bodies in the range $1 \le p \neq n$. We prove that, for every pair of probability measures $\mu,\nu$ satisfying a quantitative form of the classical dispersion assumptions yielding existence of such bodies, we have a control of the form \[ \inf_{x\in \mathbb{R}^n}\mathrm{d_H}(E_\mu, x + E_\nu) \le C \mathrm{d_C}(\mu,\nu)^{\frac{1}{n-1}}, \quad \alpha(E_\mu, E_\nu)^2 \le C \mathrm{d_C}(\mu,\nu)^{1 + \frac{1}{n-1}}, \] where $\mathrm{d_H}$ denotes the Hausdorff distance, $\alpha$ denotes the Fraenkel asymmetry and $\mathrm{d_C}$ is the dual-convex distance of probability measures on the sphere. Our arguments are based on a variational problem whose optimizers are Minkowski bodies, for which we can obtain strong-concavity properties with the quantitative Brunn-Minkowski and isoperimetric inequalities. While the exponent in the Hausdorff distance is sharp, the exponent in the Fraenkel asymmetry is optimal in dimension $2$.
Read the full abstract
Logic
More on modal logics and deduction
We study the relation between additivity and deduction theorems in the algebraic semantics of congruential modal logic. Additivity of the modal operator is well-known to imply the local deduction-detachment theorem. Our main theme is that deduction properties of modal logic persist far beyond the additive setting. We introduce the notion of a strongly non-additive variety, and then we prove that there are continuum many strongly non-additive minimal discriminator varieties of Boolean frames; equivalently, continuum many strongly non-additive maximal congruential modal logics with deduction-detachment theorem. Moreover, every normal modal logic can be transformed, in an injective way, into a strongly non-additive one while preserving the (local) deduction theorem. Finally, we show that neither the class of congruential modal logics with the local deduction theorem nor its complement is elementary.
Read the full abstract
Analysis of PDEs
Limiting behavior of principal eigenvalues for a class of mixed boundary value problems as the measure of the support domain goes to zero
In this paper we characterize the limiting behavior of the principal eigenvalue, $\s_1[-\D,\b,\O]$, of the boundary value problem \eqref{1.1} as the Lebesgue measure of the underlying domain, $\O$, tends to zero. Naturally, the domains $\O$ are assumed to be included on a fixed open set $D$ such that $\b\in\mc{C}(D)$, and they satisfy $\bar\O\subset D$. Our main result establishes that, in the classical case when $\inf_{D}\b >0$, $$ \lim_{|\O|\da 0}\s_1[-\D,\b,\O] =+\infty, $$ whereas $$ \lim_{|\O|\da 0}\s_1[-\D,\b,\O] =-\infty\;\;\hbox{if}\;\; \sup_{D}\b <0, $$ which is a surprising result at the light of the classical existing theorems for Dirichlet boundary conditions. Furthermore, in the special case when $\b>0$ is a constant, we can prove that $$ \lim_{R\da 0}\left( R \s_1[-\D,\b,B_R]\right)=\b \frac{\mathrm{Area}(\p B_1)}{|B_1|}, $$ where, we are denoting $B_\varrho:=\{x\in\R^N\;:\;|x|<\varrho\}$ for all $\varrho>0$.
Read the full abstract
Quantum Algebra · Cross-listed from hep-th
Rational points in the 6d supergravity landscape and simple current extensions
We investigate a recently identified class of six-dimensional supergravities without tensor multiplets whose primitive BPS strings are described by a rational superconformal field theory. Rationality imposes severe constraints on the supersymmetric spectrum of their BPS strings and provides an effective way to study this class of models, despite the absence of a conventional geometric realization within F-theory. We find that, in each model, the rationality constraints are nontrivially satisfied and uniquely determine the elliptic genus of the strings, providing a new consistency criterion satisfied by this exotic class of candidate quantum gravity theories. In all cases, the left-moving Kac-Moody-Virasoro algebra on the string worldsheet is extended by higher-spin currents, corresponding to discrete symmetries of the 2d SCFT. This allows us to determine the global form of the six-dimensional gauge group for all the members of this class of models.
Read the full abstract
Number Theory
Fields with no everywhere good abelian varieties
We extend methods of Fontaine, Abrashkin and Schoof to obtain criteria determining number fields K over which no non-zero abelian variety with everywhere good reduction exists. As an application, under the GRH, we find 26847 such fields of various degrees up to 16.
Information Theory · Cross-listed from quant-ph
Independent Trivariate Bicycle Codes
We introduce six independent trivariate bicycle (ITB) codes, which extend the bivariate bicycle framework of Bravyi et al.\ to three cyclic dimensions. Using asymmetric polynomial pairs on three-dimensional tori, we construct four codes including a $[[140,6,14]]$ code with $kd^2/n = 8.40$. In the code-capacity setting, the $[[140,6,14]]$ code achieves a pseudothreshold of $8.0\%$ and $kd^2/n = 8.40$, exceeding the best multivariate bicycle code of Voss et al.\ ($7.9\%$, $kd^2/n = 2.67$). With circuit-level depolarizing noise, pseudothresholds reach $0.59\%$ for $[[140,6,14]]$ and $0.53\%$ for $[[84,6,10]]$. On the SI1000 superconducting noise model, the $[[140,6,14]]$ code achieves a per-round per-observable rate of $5.6 \times 10^{-5}$ at $p = 0.20\%$. We additionally present two self-dual codes with weight-8 stabilizers: $[[54,14,5]]$ ($kd^2/n = 6.48$) and $[[128,20,8]]$ ($kd^2/n = 10.0$). These results expand the design space of algebraic quantum LDPC codes and demonstrate that the third cyclic dimension yields competitive candidates for practical fault-tolerant implementations.
Read the full abstract
Information Theory
Cache-enabled Generative Joint Source-Channel Coding for Evolving Semantic Communications
Learning-based semantic communication (SemCom) has recently emerged as a promising paradigm for improving the transmission efficiency of wireless networks. However, existing methods typically rely on extensive end-to-end training, which is both inflexible and computationally expensive in dynamic wireless environments. Moreover, they fail to exploit redundancy across multiple transmissions of semantically similar content, limiting overall efficiency. To overcome these limitations, we propose a channel-aware generative adversarial network (GAN) inversion-based joint source-channel coding (CAGI-JSCC) framework that enables training-free SemCom by leveraging a pre-trained SemanticStyleGAN model. By explicitly incorporating wireless channel characteristics into the GAN inversion process, CAGI-JSCC adapts to varying channel conditions without additional training. Furthermore, we introduce a cache-enabled dynamic codebook (CDC) that caches disentangled semantic components at both the transmitter and receiver, allowing the system to reuse previously transmitted content. This semantic-level caching can continuously reduce redundant transmissions as experience accumulates. Extensive experiments on image transmission demonstrate the effectiveness of the proposed framework. In particular, our system achieves comparable perceptual quality with an average bandwidth compression ratio (BCR) of 1/224, and as low as 1/1024 for a single image, significantly outperforming baselines with a BCR of 1/128.
Read the full abstract
Optimization and Control
Stochastic set-valued optimization and its application to robust learning
In this paper, we develop a stochastic set-valued optimization (SVO) framework tailored for robust machine learning. In the SVO setting, each decision variable is mapped to a set of objective values, and optimality is defined via set relations. We focus on SVO problems with hyperbox sets, which can be reformulated as multi-objective optimization (MOO) problems with finitely many objectives and serve as a foundation for representing or approximating more general mapped sets. Two special cases of hyperbox-valued optimization (HVO) are interval-valued (IVO) and rectangle-valued (RVO) optimization. We construct stochastic IVO/RVO formulations that incorporate subquantiles and superquantiles into the objective functions of the MOO reformulations, providing a new characterization for subquantiles. These formulations provide interpretable trade-offs by capturing both lower- and upper-tail behaviors of loss distributions, thereby going beyond standard empirical risk minimization and classical robust models. To solve the resulting multi-objective problems, we adopt stochastic multi-gradient algorithms and select a Pareto knee solution. In numerical experiments, the proposed algorithms with this selection strategy exhibit improved robustness and reduced variability across test replications under distributional shift compared with empirical risk minimization, while maintaining competitive accuracy.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
On maximal positive invariant set computation for rank-deficient linear systems
The maximal positively invariant (MPI) set is obtained through a backward reachability procedure involving the iterative computation and intersection of predecessor sets under state and input constraints. However, standard static feedback synthesis may place some of the closed-loop eigenvalues at zero, leading to rank-deficient dynamics. This affects the MPI computation by inducing projections onto lower-dimensional subspaces during intermediate steps. By exploiting the Schur decomposition, we explicitly address this singular case and propose a robust algorithm that computes the MPI set in both polyhedral and constrained-zonotope representations.
Read the full abstract
Number Theory
Linear truncation for conditioned prime-factor fibres
In previous joint work with Tenenbaum, the truncation step $f \mapsto f_R$ in the conditional effective Erdos-Wintner theorem on the fibre $\omega(n)=k$ yields, in the continuous case for real strongly additive $f$, a remainder of size $\eta_f(R)^{r/(r+1)}$, where $R$ is the truncation level and $r=k/\log\log x$. We prove an effective linear truncation lemma showing that, in the central window $\kappa \le r \le 1/\kappa$, this bound improves to the natural linear scale $r\eta_f(R)$ under an effective Sathe-Selberg-type ratio estimate for the fibre. This yields a direct effective sharpening of the truncation step in the previous joint work. The same truncation upgrade also applies to prime-set restrictions, $\Omega$-fibres, and weighted fibres whenever the corresponding ratio estimate is available.
Read the full abstract
Number Theory
Murmurations, Mestre–Nagao sums, and Convolutional Neural Networks for elliptic curves
We apply one-dimensional convolutional neural networks to the Frobenius traces of elliptic curves over $\mathbb{Q}$ and evaluate and interpret their predictive capacity. In keeping with similar experiments by Kazalicki–Vlah, Bujanović–Kazalicki–Novak, and Pozdnyakov, we observe high accuracy predictions for the analytic rank across a range of conductors. We interpret the prediction using saliency curves and explore the interesting interplay between saliency, murmurations and Mestre–Nagao sums.
Read the full abstract
Information Theory
Physical Layer Security in Finite Blocklength Massive IoT with Randomly Located Eavesdroppers
This paper analyzes the physical layer security performance of massive uplink Internet of Things (IoT) networks operating under the finite blocklength (FBL) regime. IoT devices and base stations (BS) are modeled using a stochastic geometry approach, while an eavesdropper is placed at a random location around the transmitting device. This system model captures security risks common in dense IoT deployments. Analytical expressions for the secure success probability, secrecy outage probability and secrecy throughput are derived to characterize how stochastic interference, fading and eavesdropper spatial uncertainty interact with FBL constraints in short packet uplink transmissions. Numerical results illustrate key system behavior under different network and channel conditions.
Read the full abstract
Algebraic Geometry
Semi-finite vector bundles on complex tori
We study finite and semi-finite vector bundles on complex tori. We give an explicit decomposition of such bundles in terms of torsion and unipotent factors. As a consequence, we prove that the extended Nori fundamental group scheme of a complex torus decomposes as the product of its etale fundamental group scheme and its unipotent fundamental group scheme.
Read the full abstract
Algebraic Topology
Heights of Stiefel–Whitney classes and zero-divisor cup-length of some Grassmann manifolds
We calculate the heights of Stiefel–Whitney classes of the canonical vector bundle over the oriented Grassmannians $\widetilde G_{n,4}\cong SO(n)/(SO(4)\times SO(n-4))$ in the cases $n\in\{2^t-2,2^t-1,2^t,2^t+1\}$, $t\ge4$. Using some additional computations in modulo $2$ cohomology of $\widetilde G_{n,4}$ and the well-known connection between topological complexity and zero-divisor cup-length, we obtain lower bounds for topological complexity of these Grassmannians. We also extend recent results of Rusin, who computed the modulo $2$ cup-length of $\widetilde G_{n,4}$ for $n\in\{2^t-2,2^t-1,2^t\}$, to the case $n=2^t+1$, $t\ge3$.
Read the full abstract
Differential Geometry
Bi-symphonic maps between Riemannian manifolds
This note introduces an extension to the definition of symphonic maps, denoted as $\varphi:(M,g)\longrightarrow(N,h)$, by exploring variations in the bi-energy functional associated with the pullback metric $\varphi^*h$ between two Riemannian manifolds.
Rings and Algebras
Homogeneous Freudenthal algebras and the first Tits construction
Freudenthal algebras over a field are basically the same as Jordan algebras of degree $3$ remaining simple under all base field extensions. These algebras are intimately linked, via their automorphism groups and structure groups, to simple algebraic groups over arbitrary fields. Our main concern here will be the question of when these algebras are homogeneous in the sense that all their Jordan isotopes are isomorphic. We answer this question by presenting various necessary and sufficient conditions for homogeneity and by connecting it with the first Tits construction of cubic Jordan algebras, most notably through investigating Freudenthal division algebras over complete fields under a discrete valuation. We also study the first Tits construction in its own right by producing a local version of it, deriving a local-global principle, and by connecting it with the embeddibility of certain rank-$2$-tori into the automorphism group scheme of an Albert division algebra.