Peer Revenue Play credits. Real papers.

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Thursday 23 April

Metric Geometry

Bounding the density of spherical polygon packings

We determine putative optimal packings of regular spherical polygons via optimization on smooth manifolds. For several cases, we establish maximality by extending the Lovász theta number to Cayley graphs on the special orthogonal group ${\rm SO}(3)$. To this end, we introduce an algebraic criterion characterizing when congruent regular spherical polygons have disjoint interiors, leading to a unified formulation of the packing constraints. Using harmonic analysis on ${\rm SO}(3)$, we reduce the theta number to a trigonometric sum-of-squares problem, which can be solved via semidefinite programming.
Read the full abstract

Numerical Analysis · Cross-listed from cond-mat.soft

Continuum granular flow model with restitution-derived viscoelastic damping

This work presents a unified viscoelastic-viscoplastic continuum framework for modeling rate-dependent granular flows across regimes. The formulation incorporates two distinct rate-dependent mechanisms, namely micro-inertia and viscoelastic dissipation, within a single continuum description. A central contribution is an explicit link between the coefficient of restitution and a continuum viscosity, derived from an analysis of wave attenuation in granular assemblies, thereby establishing a direct connection between particle-scale collision physics and macroscopic damping. This relation is introduced while retaining inertia-dependent plastic flow governed by the classical $\mu(I)$ rheology. The constitutive model is constructed by meticulously partitioning elastic and plastic responses within the model and corresponding stress-update routine, such that viscous dissipation governs wave propagation and collisional processes without altering the plastic flow rule. The framework is implemented within the material point method to simulate transient processes involving large deformations, material separation, and subsequent reconsolidation. A range of numerical examples, including steady, transient, vibrational, and impact-driven flows, demonstrates that the model captures wave propagation, diffusion, and rate-dependent granular behavior within a unified continuum setting.
Read the full abstract

Optimization and Control

Mini-Batch Stochastic Halpern Algorithm for Nonexpansive Fixed Point Problems

The Halpern algorithm is a powerful fixed point approximation method for finding the closest point in the fixed point set of a nonexpansive mapping to the initial point. However, in practice, it is not necessarily true that this algorithm can be applied to large-scale fixed point problems, since the computation of the nonexpansive mapping is expensive. In this paper, we present mini-batch stochastic Halpern algorithm to resolve the issue caused by the computational difficulty of the mapping. We preform a convergence analysis demonstrating that the algorithm with diminishing step sizes and increasing batch sizes converges in mean square to the closest point in the fixed point set to the initial point. We also perform a convergence rate analysis demonstrating that convergence speed of the algorithm depends on the settings of the diminishing step sizes. Furthermore, numerical experiments demonstrated the effectiveness of the proposed mini-batch stochastic Halpern algorithm.
Read the full abstract

Number Theory

Consecutive non-square non-primitive pairs in a finite field

Let $q$ be an odd prime power and write \[ \theta_q := \frac{\phi(q-1)}{q-1}. \] If $\theta_q < \tfrac{1}{3}$, or if $\theta_q = \tfrac{1}{3}$ and $q \notin \{7,13,19,25,37\}$, then the finite field $\F$ contains a pair of consecutive elements that are both non-square and non-primitive. This extends a result of Jarso and Trudgian for prime fields $\Fp$, where the same conclusion was obtained under the stronger condition $\theta_p \le \tfrac{1}{4}$. More generally, let $\ell$ be the least odd prime divisor of $q-1$. If $\theta_q \le \tfrac{1}{3}$, then $\F$ contains a pair of consecutive elements that are non-squares and $\ell$th powers, with the sole exceptions $q \in \{7,13,19,25,37,43\}$.
Read the full abstract

Algebraic Geometry

A lower bound for polynomial volume growth of automorphisms of zero entropy

Let $X$ be a normal projective variety of dimension $d$, and let $f$ be a zero-entropy automorphism of $X$. Denote by $k$ the first-degree growth rate of $f$, so that $\deg_1(f^n) \asymp n^{k}$. We prove the sharp lower bound for the polynomial volume growth $\mathrm{plov}(f)$ of $f$: \[ \mathrm{plov}(f) \ge d+\frac{k(k+2)}{4}, \] equivalently giving a sharp lower bound on the Gelfand–Kirillov dimension of the associated twisted homogeneous coordinate ring. This improves previous lower bounds of Keeler and of Lin–Oguiso–Zhang. In the proof, we introduce the notion of dynamical intersection polynomials and give a new characterization of $\mathrm{plov}(f)$ in terms of non-vanishing of intersection numbers. We also establish a gap principle for polynomial volume growth: for every fixed dimension $d\ge 4$, either $\mathrm{plov}(f)=d^2$, or $\mathrm{plov}(f)\le d(d-2) + 2\lfloor d/4 \rfloor$. This reveals a new rigidity phenomenon for zero-entropy automorphisms. As an application, in dimension $4$ we determine all possible values of $\mathrm{plov}$, thereby extending the results of Artin–Van den Bergh for surfaces and Lin–Oguiso–Zhang for threefolds.
Read the full abstract

Dynamical Systems

Unveiling universality, encloseness, and orthogonality in dynamics

Motivated by Sarnak's conjecture on Möbius orthogonality, we investigate the general problem of orthogonality for a bounded sequence to topological models of characteristic classes of measure-preserving automorphisms. Our main observation is that whenever a strong form of such orthogonality holds in a system $(X,T)$ then the orthogonality holds for all topological systems in which each ergodic measure yields an automorphism that is measure-theoretically isomorphic to one arising from an ergodic measure in $(X,T)$. This leads us to study two purely dynamical problems: the existence of universal topological models for characteristic classes of measure-preserving automorphisms and the existence of a common ergodic extension for a measurable family of ergodic automorphisms. We show that the class of automorphisms with relative discrete spectrum over the identity factor–as well as several related classes including the weakly mixing case–admit universal models. We also highlight potential applications to the orthogonality phenomena. Moreover, we show that if the set of all measure-theoretic eigenvalues of a zero entropy system $(X,T)$ is countable, then $(X,T)$ satisfies Sarnak's conjecture along a subsequence of full logarithmic density.
Read the full abstract

All authors J. Aaronson, A. I. Danilenko, J. Kułaga-Przymus, M. Lemańczyk

Probability

Existence and uniqueness for singular stochastic differential equations with piecewise well-behaved coefficients

We study existence and uniqueness for one-dimensional generalized stochastic differential equations with singular coefficients, including distributional drift and degenerate, possibly discontinuous, diffusion coefficients. Such singularities naturally encode changes in the dynamics at thresholds, including reflecting, skew, or sticky interface behavior. We develop two directions. We provide sufficient conditions for pathwise uniqueness, under weak existence and uniqueness in law, without assuming uniform ellipticity or continuity of the diffusion coefficient. We also investigate a pasting approach for generalized stochastic differential equations that transfers strong existence and pathwise uniqueness, as well as weak existence and uniqueness in law, from local component equations to a global solution. To the best of our knowledge, this provides the first explicit pasting theorem yielding pathwise uniqueness in the setting of generalized stochastic differential equations. As an application, we establish the first existence and uniqueness results for a class of skew sticky threshold Cox-Ingersoll-Ross-type diffusions, including the threshold Chan-Karolyi-Longstaff-Sanders process.
Read the full abstract

Mathematical Physics

The Geometry Underlying the Quantum Harmonic Oscillator

We consider two-dimensional harmonic oscillator in the complex Bargmann-Fock-Segal representation with $T^*{\mathbb R}^{2}={\mathbb C}^2$ as classical phase space. We show that the eigenfunctions $\psi_n$ of the quantum Hamiltonian correspond to complex radial coordinates in the reduced phase space ${\mathbb C}^2/{\mathbb Z}_n\subset{\mathbb C}^2$. They describe ${\mathbb Z}_n$-invariant motion of particle along a circle $S^1$ in lens space $S^3/{\mathbb Z}_n\subset{\mathbb C}^2/{\mathbb Z}_n$, where ${\mathbb Z}_n$ is the cyclic group of rotation by an angle $2\pi/n$ on the circle $S^1$, $n=1,2,...\,$. Thus the general solution of the Schrödinger equation carries information about an infinite number of admissible classical states $\psi_n$ that can be mapped to other states after lifting into the quantum bundle. We show that in the Kepler/hydrogen atom problem there is a similar correspondence between classical and quantum states.
Read the full abstract

Optimization and Control

Nonsmooth Nonconvex-Concave Minimax Optimization: Convergence Criteria and Algorithms

This paper considers constrained stochastic nonsmooth minimax optimization problem of the form $\min_{\mathbf{x}\in\mathcal{X}}\max_{\mathbf{y}\in\mathcal{Y}}f\left(\mathbf{x},\mathbf{y}\right)=\mathbb{E}[F(\mathbf{x},\mathbf{y};\mathbf{\xi})]$, where the objective $f(\mathbf{x},\mathbf{y})$ is concave in $\mathbf{y}$ but possibly nonconvex in $\mathbf{x}$, the stochastic component $F(\mathbf{x},\mathbf{y};\mathbf{\xi})$ indexed by random variable $\mathbf{\xi}$ is mean-squared Lipschitz continuous, and the feasible sets $\mathcal X$ and $\mathcal Y$ are convex and compact. We introduce the notion of $(\eta_x,\eta_y,\delta,\epsilon)$-Goldstein saddle stationary point (GSSP) to characterize the convergence for solving constrained nonsmooth minimax problems. We then develop projected gradient-free descent ascent methods for finding $(\eta_x,\eta_y,\delta,\epsilon)$-GSSPs of the objective function $f(\mathbf{x},\mathbf{y})$ with non-asymptotic convergence rates. We further propose nested-loop projected gradient-free descent ascent methods to establish the non-asymptotic convergence for finding $(\eta,\delta,\epsilon)$-generalized Goldstein stationary points (GGSP) [Liu et al., 2024] of the primal function $\Phi(\mathbf{x})\triangleq\max_{\mathbf{y}\in\mathcal{Y}}{f}\left(\mathbf{x},\mathbf{y}\right)$. It is worth noting that our algorithm designs and theoretical analyses do not require additional assumptions such as the weak convexity used in prior works on nonsmooth minimax optimization [Lin et al., 2025, Boţ and Böhm, 2023].
Read the full abstract

Optimization and Control

Distributed Zeroth-Order Optimization with Rademacher Perturbations and Momentum Gradient Tracking

Zeroth-order (ZO) optimization is indispensable for complex non-convex tasks where explicit gradients are computationally prohibitive or strictly inaccessible. For deploying ZO methods over distributed heterogeneous networks, the gradient tracking technique is often employed to eliminate structural data biases. However, the inherent variance of derivative-free estimators is also amplified. To overcome this problem, we propose Zeroth-Order Momentum Gradient Tracking (ZO-MGT), which integrates momentum-based variance reduction with dynamic gradient tracking. Specifically, ZO-MGT that requires exactly two function queries per iteration can avoid costly batch sampling and prevent variance explosion, while eliminating structural biases. Moreover, by utilizing Rademacher perturbations, it preserves optimal query efficiency and enables bitwise hardware acceleration. We theoretically analyze the convergence of ZO-MGT and establish an $\mathcal{O}(1/T)$ convergence rate. Furthermore, we prove that a large momentum factor can aggressively suppress the heterogeneity-induced bias floor at a remarkable quadratic rate of $\mathcal{O}((1-\beta)^2)$. Numerical experiments under extreme data heterogeneity verify that ZO-MGT can effectively overcome traditional tracking failures with accelerated convergence guarantees, while achieving significantly tighter consensus.
Read the full abstract

Algebraic Geometry

A chain of $\mathbb{C}^{*}$-flips of the moduli spaces of $\mathcal{O}$-twisted rank 2 constrained framed Hitchin pairs on a smooth curve

Let $X$ be a smooth complex projective curve. We prove that there exists a surjective commutative forgetful diagram from the chain of $\mathbb{C}^{*}$-flips of the moduli spaces of $\mathcal{O}_{X}$-twisted rank 2 constrained framed Hitchin pairs on $X$ to the chain of $\mathbb{C}^{*}$-flips of the moduli spaces of rank 2 framed modules on $X$.
Read the full abstract

Probability

Shadow and percolation III: chemical distance in continuous landscapes with correlations

We study some geometric properties of the excursion set of a slope field alpha associated to a smooth, planar, centered, Gaussian field f. That, is we consider the set of all points such that the value of alpha is at most l where l is a real parameter called the level. We restrict our attention to the levels l that are supercritical. We show that for almost such l, in the sense of the Lebesgue measure, then with high probability the chemical distance between two points connected in the excursion set at level l is comparable to the usual Euclidean distance between those two points. This result is in the spirit of the Antal Pisztora theorem for Bernoulli percolation. However, many new difficulties arise such as the fact that alpha is a continuous field (not differentiable everywhere) with long range correlations and whose law is still not well understood.
Read the full abstract

Algebraic Geometry

Ribbon graphs and meromorphic functions

Let Y be a compact Riemann surface, phi:Y -> CP^1 a meromorphic function, and Gamma in Y a ribbon graph avoiding the critical points of phi. Then phi(Gamma) is an immersed graph in CP^1. Conversely, given an immersion im:Theta to bCP^1 of an abstract multigraph Theta without vertices of valence 1 or 2, we describe a construction of a compact Riemann surface Y and a meromorphic function phi_{im}:Y in CP^1 such that phi_{im}(Gamma)=im(Theta). We investigate the relation between the topology of Y and the combinatorics of Gamma. In particular, for a surface of genus g we construct spanning ribbon graphs whose underlying abstract graphs have arbitrary prescribed graph genus g' smaller or equal g, including the planar case. As a consequence, the number of self-intersections of \phi(Gamma) cannot, in general, be controlled solely by the genus of Y. We establish general lower bounds for the number of self-intersections and formulate several open problems, with emphasis on planar ribbon graphs.
Read the full abstract

Complex Variables

$A^p_\alpha$ classes in the Dirichlet range: inner-outer factorization, Carleson measures and weak products

We study properties of $A^p_\alpha$ spaces in the Dirichlet range, recently defined by Brevig, Kulikov, Seip and Zlotnikov as the set of all holomorphic functions on the unit disc $\mathbb{D}$ such that \[ \int_{\mathbb{D}} |f(z)|^{p-2} |f'(z)|^2 (1 - |z|^2)^{\alpha} \, dA(z) < \infty, \] when $0<\alpha < 1$ and $p > 0$. We answer in the negative two questions posed by Brevig et al. by showing that, if $p\ne2$ and $p > \frac{1}{2}$, $A^p_\alpha$ is not a vector space and that the norm is in general not increasing in $p$. This is achieved by means of an equivalent description for $A^p_\alpha$ which is given in terms of the Poisson integral of the boundary function of its inhabitants. Such norm also leads to a description of $A^p_\alpha$ functions in the Dirichlet range given in terms of their inner and outer factors. As a corollary, we show that $A^1_\alpha$ is contained in the weak product of a Dirichlet-type space.
Read the full abstract

Probability · Cross-listed from cond-mat.stat-mech

Fractals of Simple Random Walks in Two Dimensions: A Monte Carlo Study

We present a Monte Carlo study of the fractal geometry of clusters formed by discrete-time simple random walks (sRW) of $L^2$ steps on a periodic square $L\times L$ lattice. We verify with high precision that the asymptotic behavior of the cluster mass follows $M/L^2 \simeq (\ln L)^{-1} [\frac{\pi}{2}+b (\ln L)^{-2}]$, with $b\approx -(\pi/2)^{-2}$, demonstrating marginal “logarithmic fractals". We further determine the fractal dimension of the hull to be $d_{\rm hull}=1.333\,29(14)=4/3$, in excellent agreement with the prediction of Schramm-Loewner evolution ($\rm SLE_{8/3}$) for the Brownian frontier universality class. More importantly, we analyze the chemical distance $S$ spanning the cluster and obtain strong evidence that it asymptotically scales as $S\sim L(\ln L)^{1/4}$, lying exactly on the theoretical upper bound for the chemical distance for level-set percolation clusters on the two-dimensional Gaussian free field. Our numerical results show that the sRW cluster exhibits a conformally invariant external frontier and contains highly efficient asymptotically linear connective paths.
Read the full abstract

Numerical Analysis

Spherical Cap $L_2$ Discrepancy – Blessing of Dimensionality and a Distance-Kernel Variant

We prove a dimension-explicit upper bound for the information-complexity (also called the inverse of the discrepancy) of the classical spherical cap $L_2$ discrepancy on the $d$-dimensional sphere $\mathbb{S}^d$. For every fixed $\varepsilon\in(0,1)$, this bound implies that a single point suffices in all sufficiently large dimensions, which shows a “blessing of dimensionality” for the associated numerical integration problem. We then introduce a one-parameter family of distance reproducing kernels for the Sobolev space $H^{(d+1)/2}(\mathbb{S}^d)$. For the balanced kernel $K(\boldsymbol{x},\boldsymbol{y})=1-\tfrac{1}{\sqrt{2}}\|\boldsymbol{x}-\boldsymbol{y}\|$, a lower bound together with a random-point upper bound shows that the normalized information-complexity is $\Theta_\varepsilon(d)$ for every fixed $\varepsilon\in(0,1)$. Thus its dependence on $d$ is determined up to constants depending only on $\varepsilon$. Finally, we study the one-sided spherical cap discrepancy obtained by restricting the height parameter to $[0,1]$. We derive its kernel and Stolarsky's invariance principle explicitly. A sharp mean-distance inequality, attained by regular simplices, determines its normalized information-complexity exactly in all sufficiently large dimensions and proves strong polynomial tractability with optimal $\varepsilon$-exponent two.
Read the full abstract

Analysis of PDEs

Three-dimensional time-periodic problem on the Boltzmann equation with external force

The time-periodic problem for the Boltzmann equation with a prescribed time-periodic external force in the three-dimensional whole space has remained open since it was first treated in [15], where the result was restricted to spatial dimensions not less than five. This paper gives an affirmative answer when the force is sufficiently small in $\mathcal{C}(\mathbb{R};\dot{B}^{-3/2}_{2,\infty}\cap\dot{H}^N)$ with $N\geq 4$. The proof follows Serrin's method, through the global stability of the Cauchy problem for a time-periodic force. As a direct consequence, the same argument yields the existence and stability of stationary solutions in three dimensions for a time-independent force, which is not required to be a gradient and may therefore be rotational.
Read the full abstract

Optimization and Control

Generalized String-Stability Criteria for Consensus Protocols

This paper presents a unified string-stability framework for leader-follower multi-agent systems governed by first-, second-, and m-th order consensus protocols operating under an r-predecessor directed communication topology. While string stability has been extensively studied for specific vehicle models and individual consensus protocols, existing results remain fragmented across protocol orders and do not identify the fundamental factors governing disturbance amplification or attenuation. This work shows that, for all consensus orders, string stability is dictated solely by the communication richness r, while the protocol order m influences only the mid-frequency transient behavior. In particular, the low-frequency gain of the disturbance propagation coefficient is inversely proportional to r for every m, implying that higher-order consensus cannot overcome the structural limitation imposed by insufficient communication and that, under the adopted H-infinity-based string-stability definition and the present framework, string stability is achievable if and only if r >= 2. This establishes a structural-dynamic separation principle that unifies and generalizes classical platoon results, providing new insight into the interplay between topology and controller design in cooperative driving and multi-agent coordination. The framework is developed under idealized identical-agent and fixed-topology assumptions, providing a baseline for future robust extensions. Numerical simulations corroborate the analysis and illustrate how m and r jointly shape disturbance propagation along the formation.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

Gravitational Collapse of a Chiellini Integrable Scalar Field

We study the gravitational collapse of a non-interacting mix of perfect fluid and a spatially homogeneous scalar field within a Chiellini-integrable framework. We choose an extended Higgs-type self-interaction potential and reduce the Klein-Gordon equation into a generalized damped Milne-Pinney class of differential equation. We derive a closed-form analytical solution for the scalar field, the scale factor and explore the collapsing branch of the same. We find that it exhibits an asymptotic collapse in which the proper volume decreases monotonically but never reaches zero at finite time. We analyze the energy conditions for the constituent elements of the collapsing sphere. While the scalar field remains canonical in nature, we find that the perfect fluid can violated the Null Energy Condition. We also study the formation of apparent horizon condition and find multiple possibilities depending on the parameter space : either no trapped surface or the formation of multiple apparent horizons. We match the interior homogeneous solution to a generalized Vaidya exterior via the Israel-Darmois junction conditions, yielding the corresponding boundary mass function, ensuring a smooth collapse scenario.
Read the full abstract

Numerical Analysis

On a Boundary-Initial Value Problem for Fractional Differential Equation with Sequential Caputo derivatives

In this paper, we investigate a fractional differential equation involving sequential Caputo derivatives, motivated by recent research on fractional models with multiple memory effects. Using techniques inspired by earlier works on sequential fractional operators, we derive the exact analytic solution of the problem in terms of the bivariate Mittag-Leffler function. Additionally, several useful properties of the bivariate Mittag-Leffler function are formulated to support the solution construction. Furthermore, we develop a numerical scheme using a sequential reformulation and the L1-finite element method.
Read the full abstract

Geometric Topology

Smooth structures on definite four-manifolds with infinite fundamental group

For each odd integer $p > 1$, we construct infinitely many pairwise non-diffeomorphic irreducible smooth structures on a definite 4-manifold with infinite fundamental group whose abelianization is $\Z/2p\Z\times \Z/2\Z$.

Information Theory

LLM-Steered Power Allocation for Parallel QPSK-AWGN Channels

Large language models (LLMs) are increasingly being explored as high-level decision modules in closed-loop systems, but their stochastic nature makes safe integration challenging. In this paper, we propose LLM-Steered Power Allocation, a dual-process architecture for parallel QPSK channels inspired by Kahneman's System 1/System 2 framework. A fast numerical optimizer (System 1) continuously performs projected gradient ascent on a weighted mutual-information objective, while an LLM navigator (System 2) periodically interprets natural-language policies and updates only the channel weights and the operational power budget. The LLM never manipulates the power-allocation variables directly, and constraint satisfaction is enforced structurally by the optimizer. To mitigate LLM unreliability, we further incorporate multi-layer guardrails including normalization, exponential moving-average smoothing, and fallback mechanisms. Numerical experiments on an 8-channel system show that, with a fixed optimization core and unchanged system prompt, different natural-language policies induce qualitatively different operating points, including throughput-oriented allocation, channel prioritization, power-aware operation, and channel shutdown. In addition, under an abrupt channel-gain reversal, the proposed system autonomously reconfigures its steering signals and reduces the final mutual-information spread by 60% compared with the optimizer alone. These results suggest that LLMs can serve as policy interpreters for safe, flexible reconfiguration of communication-system optimizers without controller reimplementation.
Read the full abstract

Analysis of PDEs

Inhomogeneous parabolic equations with Hardy potential and memory on the Heisenberg group

We study a class of inhomogeneous parabolic equations on the Heisenberg group $\mathbbm{H}^N$ with Hardy-type singular potentials, nonlocal memory terms, and a space-time forcing term: \begin{align} \partial_tu-\Delta_{H}u=\lambda \frac{\psi u}{\|\cdot\|^{2}_{H}}+\frac{1}{\Gamma(\gamma)}\int_0^t(t-\tau)^{\gamma-1}|u(\tau)|^{p}d\tau+t^\alpha f \text{ in } \,\mathbbm{H}^N\times (0,T). \end{align} Here, $\gamma\in [0,1),$ $\alpha\in (-1,\infty),$ $p>1,$ $\lambda>0,$ and $\psi(\cdot)=|\nabla_{H}\|\cdot\|_{H}|^2,$ where $\nabla_H$ is the horizontal gradient associated to $\Delta_H.$ Also, $\|\cdot\|_{H}$ and $\Delta_{H}$ denote the Korányi norm and sub-Laplacian associated with the sub-Riemannian geometry of $\mathbbm{H}^N,$ respectively. The combination of a singular Hardy potential and a memory kernel introduces significant analytical challenges. Using a Harnack-type inequality adapted to the Heisenberg group setting, we obtain quantitative positivity estimates that enable a detailed blow-up analysis. We identify parameter regimes depending on $p,\gamma,\alpha$ leading to finite-time blow-up or instantaneous blow-up, and establish local well-posedness in the absence of the Hardy potential. These results reveal an interplay between the spatial singularity, temporal nonlocality and a time-dependent forcing term. Finally, under a suitable lower bound on the forcing term $f,$ we derive an explicit lifespan estimate for local-in-time solutions.
Read the full abstract

Algebraic Geometry

Birational Geometry of Quot Schemes on smooth projective curves via Stable Pairs

Let $C$ be a smooth projective curve of genus $g \geq 2$ over $\mathbb C$, and let $E^0$ be a vector bundle on $C$. We investigate the birational geometry of the Quot scheme ${\rm Quot}_C(E^0, k, n)$, which parametrizes quotients of $E^0$ of rank $k$ and degree $n$, and its fiber $\mathcal Q_L$ over ${\rm Pic}^n(C)$ for $n \gg 0$. Our main tool is the moduli space of stable pairs, which yields small $\mathbb Q$-factorial modifications (SQMs) of ${\rm Quot}_C(E^0, k, n)$ and $\mathcal Q_L$. We explicitly describe the nef, movable, and effective cones of each SQM. Consequently, we prove that $\mathcal Q_L$ is a Mori dream space and that the determinant morphism ${\rm Quot}_C(E^0, k, n) \to {\rm Pic}^n(C)$ is a Mori dream morphism.
Read the full abstract

Analysis of PDEs

On the blowup rate of vorticity for the Euler equations in a bounded domain

Given that a solution to the 3D incompressible Euler equations on a bounded domain blows up at a time $T_\ast$ and that $T_\ast$ is the first such time, we provide pointwise-in-time lower bounds on $\|D^k\omega\|_{L^\infty(\Omega)}$ for $k \geq 1$. We also show that the Gronwall-type inequality satisfied by $\|\omega(t)\|_{L^\infty}$, in the cases that $\Omega = \mathbb{R}^3$, $\mathbb{T}^3$, or a bounded domain, exhibits wildly oscillating solutions.
Read the full abstract

Combinatorics

Large values in time series and additive combinatorics

It is well-known in industrial data science that large values of real-life time series tend to be structured and often follow concrete and visible patterns. In this paper, we use ideas from additive combinatorics and discrete Fourier analysis to give this heuristic a mathematical foundation. Our main tool is the Fourier ratio, a complexity measure previously used in compressed sensing, combined with a generalized version of Chang's lemma from additive combinatorics. Together, these yield a precise prediction: when the Fourier ratio of a time series is small, the set of its largest values can be additively generated by a very small set using only $\{-1,0,1\}$ coefficients. We test this prediction on US inflation data and Delhi climate data, both in their original form and after mean-centering. The numerical results confirm the predicted structure: a generating set of size $4$–$7$ suffices to span large spectra containing dozens of points, even when the Fourier ratio is large enough that our theoretical bounds become loose. These findings provide a rigorous explanation for why extreme values in real-world data are information-rich and structurally significant.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Random Access Codes: Explicit Constructions, Optimality, and Classical-Quantum Gaps

A random access code (RAC) encodes an $L$-bit string into a $k$-bit message, $L>k$, so that any requested bit can be recovered with high probability; a quantum RAC (QRAC) uses $k$ qubits instead. We give a geometric characterization of optimal classical $(L,k)$-RACs under average and worst-case decoding criteria. The average criterion is reduced to choosing $2^k$ representatives in $\{0,1\}^L$, while the worst-case criterion is reduced to a minimax problem over $2^k$ points in $[0,1]^L$ with a distance-like objective. This framework proves optimality for several parameter families, with many optimal constructions arising from standard infinite families of binary linear codes. It also yields two explicit classical–quantum separations. First, for every $L>1$, we construct a $(L,1)$-QRAC whose average decoding success probability strictly exceeds the optimal classical value. Second, for the family $(2^k-1,k)$, we prove worst-case optimality of a classical RAC and construct a QRAC with strictly larger worst-case success probability. For the family $(L,L-1)$, the framework identifies a classical RAC that is average-case optimal and, under a stated conjecture, also worst-case optimal. The same viewpoint further recovers explicit $(L,L-1)$-QRACs attaining a previously conjectured upper-bound value.
Read the full abstract

All authors Ruho Kondo, Yuki Sato, Hiroshi Yano, Yota Maeda, Kosuke Ito, Naoki Yamamoto

Differential Geometry

On The Ellipticity of Generalised Monge-Ampère Equations on Vector Bundles

In this paper, we study the ellipticity of the vector bundle versions of the Monge-Ampère, $J$, dHYM and $\sigma_{k}$-equations at a point. These are nonlinear geometric partial differential equations defined on a holomorphic vector bundle over a compact Kähler manifold. We show that when both the dimension of the manifold and the rank of the bundle are greater than or equal to three, these equations do not preserve ellipticity along continuity paths in the connected component of the trivial solution. However, the $\sigma_{2}$-equation does preserve ellipticity along continuity paths.
Read the full abstract

Information Theory

Non-Asymptotic Performance Guarantees for MLE under a Gumbel-Softmax Index Model with Phaseless Measurements

This paper studies the recovery of a complex-valued signal from index-only observations generated by a phaseless Gumbel-Softmax model. The model is motivated by limited-feedback frequency-division duplex massive MIMO systems, where it provides a smooth probabilistic surrogate for the deterministic hard-PMI selection rule. We consider a constrained maximum likelihood estimator and establish non-asymptotic statistical guarantees for its recovery performance. Under a bounded-design condition, we first derive a global excess-risk bound of order $\sqrt{d/T}$, which does not explicitly depend on the number of candidate indices. A quantitative local identifiability condition is then introduced to characterize the regime in which sharper local guarantees are available. Under this condition, the excess risk and squared parameter error both scale as $d/T$. The condition is further verified with high probability for a Haar–Stiefel random design, and a local minimax lower bound is established that matches the upper bound in its dependence on the sample size, signal dimension, temperature parameter, and signal norm, up to design-dependent factors. Numerical experiments on FDD downlink channel estimation demonstrate that the proposed likelihood-based approach can overall achieve superior reconstruction performance, supporting the effectiveness of the Gumbel-Softmax model as a surrogate for hard PMI feedback.
Read the full abstract

All authors Jinchi Chen, Mingxi Hu, Peigang Jiang, Xin Meng, Ke Wei, Xianyin Zhang

Optimization and Control · Cross-listed from stat.ML

CLT-Optimal Parameter Error Bounds for Linear System Identification

There has been remarkable progress over the past decade in establishing finite-sample, non-asymptotic bounds on recovering unknown system parameters from observed system behavior. Surprisingly, however, we show that the current state-of-the-art bounds do not accurately capture the statistical complexity of system identification, even in the most fundamental setting of estimating a discrete-time linear dynamical system (LDS) via ordinary least-squares regression (OLS). Specifically, we utilize asymptotic normality to identify classes of problem instances for which current bounds overstate the squared parameter error, in both spectral and Frobenius norm, by a factor of the state-dimension of the system. Informed by this discrepancy, we then sharpen the OLS parameter error bounds via a novel second-order decomposition of the parameter error, where crucially the lower-order term is a matrix-valued martingale that we show correctly captures the CLT scaling. From our analysis we obtain finite-sample bounds for both (i) stable systems and (ii) the many-trajectories setting that match the instance-specific optimal rates up to constant factors in Frobenius norm, and polylogarithmic state-dimension factors in spectral norm.
Read the full abstract