Representation Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Tuesday 5 May
We establish a novel connection between the minimal nilpotent orbit $\mathbb{O}_n$ in $\mathfrak{sl}_n$ and the minimal nilpotent orbit closure $\overline{\mathbf{O}}_n$ in $\mathfrak{so}_{2n+2}$, which differs from the shared-orbit paradigm of Brylinski and Kostant, where no direct type-A–type-D relation appears. More precisely, we show that the affine closure of the cotangent bundle $\overline{T^*\mathbb{O}_n}^{\mathrm{aff}}$ is isomorphic to a $\mathbb{C}^*$-Hamiltonian reduction of $\overline{\mathbf{O}}_n$. This provides a quasi-classical analogue of a quantum result of Levasseur and Stafford. A detailed study of the geometry of this Hamiltonian reduction reveals that $\overline{T^*\mathbb{O}_n}^{\mathrm{aff}}$ has no symplectic resolution.
Optimization and Control
A Proximal Augmented Lagrangian Method Based on Quadratic Approximations for Weakly Convex Optimization
This paper proposes QPALM, a proximal augmented Lagrangian method based on quadratic approximations, for solving nonlinear programming problems with weakly convex objective and constraint functions. The algorithm is constructed by incorporating quadratic approximations of both the objective and constraint functions into a proximal Lagrangian framework. We establish its non-asymptotic convergence rate in terms of the total number of subproblems solved. The convergence of QPALM is characterized by three metrics associated with the $\varepsilon$-KKT conditions: the squared norm of the gradient of the Moreau envelope of the Lagrangian, the average constraint violation, and the average complementarity violation. All three metrics are shown to converge at a rate of $O(T^{-1/3})$ after $T$ iterations. Preliminary numerical results demonstrate the practical efficiency of the proposed method. These results are established under two mild conditions: (i) weak convexity of all problem functions, and (ii) the existence of a strictly feasible point. The proposed QPALM is a sequentially strongly convex programming method that is readily implementable.
Read the full abstract
Category Theory
Crossed Burnside rings for groupoids
In this paper, we extend the classical theory of crossed $G$-sets and the crossed Burnside ring from a finite group $G$ to a finite groupoid $\mathcal{G}$. We introduce a natural monoidal structure on the category of crossed $\mathcal{G}$-sets over a $\mathcal{G}$-monoid and construct the corresponding crossed Burnside ring of a $\mathcal{G}$-monoid. Finally, we prove a decomposition theorem that expresses the crossed Burnside ring of a groupoid as a product of crossed Burnside rings of groups.
Read the full abstract
Optimization and Control
A Quadratic-Approximation-Based Stochastic Approximation Method for Weakly Convex Stochastic Programming
We propose a novel stochastic approximation algorithm, termed PMQSopt, for solving weakly convex stochastic optimization problems involving expectation-valued functions. The algorithm is constructed by integrating the proximal method of multipliers with quadratic approximations of the original stochastic problem. We analyze the sample complexity of PMQSopt in terms of the total number of stochastic gradient evaluations required. The convergence of the algorithm is characterized by three metrics associated with the $\epsilon$-KKT conditions: the average squared norm of the gradient of the Moreau envelope of the Lagrangian, the average constraint violation, and the average complementarity violation. For each of these metrics, we establish an expected convergence rate of $\mathcal{O}(T^{-1/4})$ after $T$ iterations. Furthermore, we show that with probability at least $1-1/T^{2/3}$, the gradient of the Lagrangian satisfies an $\mathcal{O}(T^{-1/8})$ bound; with probability at least $1-2/T^{2/3}$, the constraint violation achieves an $\mathcal{O}(T^{-1/4})$ bound; and with probability at least $1-3/T^{2/3}$, the complementarity violation attains an $\mathcal{O}(T^{-1/4})$ bound. All results are established under two mild conditions: (i) weak convexity of all problem functions, and (ii) the existence of a strictly feasible point. The proposed PMQSopt algorithm is a sequentially strongly convex programming method that is readily implementable. Numerical experiments illustrate its practical performance.
Read the full abstract
Number Theory
Monogenity of pure quintic fields: the power of sieving
We provide a simple algorithm for calculating all generators of power integral bases in pure quintic fields. This procedure involves the usual standard elements like Baker's method, LLL-reduction. The main purpose of the paper is to introduce a new idea to considerably diminish the number of small exponents to be considered after the reduction step. This new idea allows to test all remaining small exponents within a few minutes, using an appropriate sieve method, which turns out to be surprisingly fast. This idea will be applicable in many similar cases.
Read the full abstract
Probability
Quantum Loewner evolution in quantum natural time: phases and Markov properties
Quantum Loewner evolution (QLE)$(\gamma^2, \eta)$ is a family of growth processes in random environments, introduced by Miller and Sheffield (arXiv:1312.5745) as candidate scaling limits of growth processes (such as diffusion-limited aggregation) on random planar maps. The random environments are Liouville quantum gravity (LQG) surfaces with parameter $\gamma$, and the parameter $\eta$ plays a role analogous to that in dielectric breakdown models. Their construction applies to pairs $(\gamma^2, \eta)$ lying on a curve in parameter space, and the associated time parametrization is independent of the underlying LQG surface. In later work (arXiv:1507.00719), they defined a quantum natural time variant of QLE$(8/3, 0)$ whose time parametrization encodes a notion of distance in the LQG geometry, leading to the identification of $\sqrt{8/3}$-LQG with the Brownian map. In this paper we construct quantum natural time QLE$(\gamma^2, \eta)$ for a different but overlapping subset of the same parameter curve. Its time parametrization conjecturally corresponds to the scaling limit of time parametrizations of discrete growth processes on random planar maps. We prove that it exhibits three phases, mirroring those of Schramm-Loewner evolution (SLE); this answers a question of Miller and Sheffield for quantum natural time QLE. Moreover, we establish stationarity of the unexplored surface and, in the relevant phases, identify the random surfaces cut out or swallowed by the process as quantum disks. Our construction builds on recent radial LQG-SLE coupling results of Ang and Yu (arXiv:2309.05176, arXiv:2411.19810).
Read the full abstract
Analysis of PDEs · Cross-listed from quant-ph
Nonlinear semigroups with unbounded generators under Carleman linearization
We treat the convergence of Carleman linearization of nonlinear evolutionary equations through the approximation theory of strongly continuous semigroups, by Carleman embedding the underlying nonlinear semigroups as linear semigroups. Linear semigroup theory then lets one replace the norm constraint on the convergence of Carleman linearization in the form used by quantum algorithms for a class of semi-discretized evolution equations by a dissipativity constraint, simplifying arguments for convergence. Applying Trotter-Kato approximation theorem to the linearized semigroup realizes the semigroup as a limit finite dimensional operator exponentials, reducing the question of convergence rate of Carleman linearization to that of the Trotter-Kato approximation. We then examine convergence of the Carleman linearization as the operators become unbounded, treating the hyperviscuous Burger's equation as an example. Next we consider the perturbation theory of the Carleman semigroup and obtain conditions when polynomial nonlinearities correspond to the Carleman linearized semigroup being a $1$-integrated semigroup, so convergence is implied by variants of Trotter-Kato approximation for integrated semigroups.
Read the full abstract
Information Theory
Generalized Function-Correcting Partition Codes: Bounds and constructions
We introduce generalized function-correcting partition codes (GFCPCs) that simultaneously protect multiple partitions of the message space against different numbers of errors. Given partitions with respective distance requirements, a GFCPC is a systematic encoding that guarantees, for each partition, a specified minimum Hamming distance between codewords whose messages lie in different blocks. This framework unifies and generalizes both function-correcting partition codes, which protect multiple functions with a common error-correction level, and function-correcting codes with data protection, which assign different levels of protection to data and a single function. We define the distance requirement matrix $\mathcal{D}$ for GFCPCs and use it to characterize the optimal redundancy in terms of the shortest length of an associated $\mathcal{D}$-code. We derive general upper and lower bounds on the optimal redundancy, including an upper bound that considers the join of different combinations of the partitions. For two partitions of the message space over the binary field, we establish improved lower bounds on the optimal redundancy under specific neighborhood conditions on the partitions. We develop a linear programming bound on the optimal redundancy of GFCPCs. The bound specializes to function-correcting codes and function-correcting codes with data protection, for which, to the best of our knowledge, no such bound was previously known. We present a multi-step construction procedure for these codes and illustrate it with some examples. Through several examples, we demonstrate that the proposed framework can yield strictly smaller redundancy than both the sum of the individual FCPC redundancies and the redundancy of a single FCPC designed for the join partition with the highest distance (strongest protection required).
Read the full abstract
Commutative Algebra
Admissible subgraphs and the depth of symbolic powers of cover ideals of graphs
Let $G$ be a simple graph. We introduce the notion of $t$-admissible subgraphs of $G$ and show how to use them to compute the depth of the $t$-th symbolic powers of the cover ideal of $G$. As an application, we prove that \[ \depth\big(S/J(C_n)^{(t)}\big) = n - 1 - \left\lfloor \frac{tn}{2t+1} \right\rfloor \] for all $t \ge 2$ and $n \ge 3$, where $S = K[x_1,\ldots,x_n]$ and $J(C_n)$ is the cover ideal of the cycle on $n$ vertices.
Read the full abstract
Category Theory
Double coset for groupoids
We investigate the double cosets of a groupoid, focusing primarily on their enumeration, by means of two different approaches. The first approach extends the Cauchy-Frobenius lemma to groupoids and interprets it in terms of groupoid actions. The second approach is based on linear representations of a groupoid arising from its action on a set of functions.
Read the full abstract
Optimization and Control · Cross-listed from cs.LG
Population-Aware Imitation Learning in Mean-field Games with Common Noise
Mean Field Games (MFGs) provide a powerful framework for modeling the collective behavior of large populations of interacting agents. In this paper, we address the problem of Imitation Learning (IL) in MFGs subject to common noise, where the population distribution evolves stochastically. This stochasticity compels agents to adopt population-aware policies to respond to aggregate shocks. We formulate two distinct learning objectives: recovering a Nash equilibrium and maximizing performance against an expert population. We investigate two imitation proxies: Behavioral Cloning (BC) and Adversarial (ADV) divergence. We then establish finite-sample error bounds showing that minimizing these proxies effectively controls both the policy's exploitability and its performance gap relative to the expert. Furthermore, we propose a numerical framework using generalized Fictitious Play and Deep Learning to compute expert population-aware policies. Through experiments on three environments we demonstrate that standard population-unaware policies fail to capture the equilibrium dynamics. Our results highlight that learning population-aware policies is crucial to avoid being misled by the randomness inherent in common noise.
Read the full abstract
Numerical Analysis
Optimal error bounds on the exponential wave integrator for nonlinear Schrödinger equations with highly singular potential
We establish error estimates of the first-order exponential wave integrator (EWI) for the nonlinear Schrödinger equation (NLSE) with a highly singular potential in $\mathbb{R}^d$ with $1\leq d \leq 3$. Our results deal with singular potentials in $L^p_\text{loc}(\mathbb{R}^d)$ with $p>\frac{d}{2}$ and $p\geq 1$, which is (almost) the weakest regularity of the potential required by the well-posedness of the NLSE. First, for $L^p_\text{loc}$-potentials with $p>2$, we establish an optimal first-order $L^2$-norm convergence for the EWI, with the convergence order slightly reduced to $1^-$ when $p=2$. To the best of our knowledge, the optimal first-order convergence for the three-dimensional $L^2$-potential is for the first time in the literature. The optimality of such an error bound is two-fold: (i) the first-order $L^2$-norm convergence is optimal for the EWI (and its higher-order versions) under the given $L^2$-regularity assumption on the potential, and (ii) to achieve the first-order $L^2$-norm convergence for the EWI, such an assumption is optimally weak. For more singular potentials in $L^p_\text{loc}(\mathbb{R}^d)$ with $\frac{d}{2} < p < 2$ and $p\geq 1$, we prove that the $L^2$-norm convergence is (almost) of $(1-\alpha)$-order when $d=1,2$, and of $(1-\frac{3}{2}\alpha)$-order when $d=3$, where $\alpha:=d(1/p - 1/2)$ when $d =1,2,3$, $p>1$ and $\alpha:=\frac{1}{2}^+$ when $d=1$, $p=1$. Notably, this result pushes the error estimate to the threshold regularity of the potential that matches the threshold regularity for the well-posedness of the NLSE, which is also for the first time. Two main ingredients are adopted in the proof: (i) the use of discrete space-time Lebesgue spaces together with discrete Strichartz estimates to establish the stability of the numerical scheme, and (ii) the use of normal form transformation and frequency decompositions to obtain optimal error bounds.
Read the full abstract
Geometric Topology
Ropelength-Filtered Reidemeister Graphs
We prove relative smoothing with uniform reach control for one-parameter families of positive-reach $C^{1,1}$ knots and combine it with relative multijet transversality to obtain projection-generic regularization inside strict ropelength sublevels. Passing to a lifted Reidemeister multigraph reconstructs the admissible $\pi_0$ of every strict projection-framed ropelength sublevel, and the right-relaxed diagrammatic merge scale equals the geometric one. The normalised projection-framed sublevels are compact, so connected merge levels are attained. These degree-zero results are organized by a fibre cosheaf: a filtered relational cellular cosheaf of sets on the planar Reidemeister multigraph, whose stalks are strict fibre components and whose costalks are the relations realized by Reidemeister movies. The lifted multigraph is its Grothendieck construction, reconstruction is a descent statement, and the diagram image is its support. The diagram image computes merges exactly when no stalk is persistently separated, and a canonical flat coarsening is the coarsest diagram-indexed model that computes components. For amphichiral knots the spherical diagram image cannot detect mirror barriers, whereas the planar image can; no planar type of the standard diagrams of $4_1$ and $6_3$ is fixed by crossing switch. Symmetric hubs and finite certificates give upper bounds for mirror merges, and sign separators give lower bounds. For finite recognition we distinguish full rooted-ball occurrence, visibility in the monotone diagram-image filtration, and saturation. Every finite Reidemeister submultigraph becomes visible at a finite ropelength level, a visible saturated Barbensi-Celoria characteristic certificate determines the knot type up to mirroring, and a universal computable crossing-complexity bound controls visibility.
Read the full abstract
Number Theory
Sign changes of the Liouville function in arithmetic progressions
We show that for any $\varepsilon > 0$, prime $q$ sufficiently large with respect to $1 / \varepsilon$ and residue class $(a,q) = 1$, there exist two integers $m, n \leq q^{5/2 + \varepsilon}$ with $m \equiv n \equiv a \pmod{q}$ such that $\lambda(m) = -1$ and $\lambda(n) = + 1$, where $\lambda$ denotes the Liouville function. Our result is motivated by Heath-Brown's explicit exponent in Linnik's theorem, establishing the existence of primes $p \equiv a \pmod{q}$ with $p \ll q^{5.5}$.
Read the full abstract
Commutative Algebra
The depth function of powers of cover ideals of path graphs
Let $G=P_n$ be a path graph with cover ideal $J(P_n)$. By using Hochster's depth formula, we prove the explicit formulae to compute the depth functions of powers of cover ideals of paths.
Read the full abstract
Dynamical Systems · Cross-listed from cs.NE
Symmetry, Defects, and Diffusion in Continuous-memory Recurrent Networks
Continuous-memory recurrent networks must preserve phase, position, or orientation despite model imperfections and state noise. We develop a geometric framework that separates three questions: how many memory coordinates are neutrally transported, how deterministic perturbations alter their finite-horizon stability, and how ambient noise is decoded along them. Exact per-input equivariance transports analytical group tangents pathwise and, on a compact nondegenerate orbit stratum, yields at least $q=\dim(G/H)$ zero group-tangent Lyapunov exponents under stationary ergodic driving. For imperfect dynamics, a four-block tangent/normal decomposition gives local and finite-horizon bounds on tangent growth and subspace rotation, distinguishing first-order direct damage from second-order leakage through contracting normal directions. For noisy dynamics, a specified decoder maps ambient covariance $Q$ to coordinate covariance $ZQZ^\top$; under isotropic noise and fixed tangent energy, least-squares decoding and scaled-isometric action geometry minimize local diffusion. Local and finite-horizon evaluations include cases both within and outside the sufficient conditions. In a fresh twenty-seed $T^2$ replication, a decoder-covariance objective improves noisy horizon-256 memory in every pair while meeting a prespecified clean-error equivalence margin. Direct noise training also improves noisy memory but incurs a clean-error tradeoff. In coupled $T^4/T^8$ integrators, the advantage of anisotropic-covariance over isotropic regularization reverses when evaluation noise becomes isotropic. These results connect continuous symmetry to measurable limits and design choices for recurrent memory under explicit dynamical, decoder, and noise assumptions.
Read the full abstract
Analysis of PDEs
Approximation of harmonic functions on metric measure spaces of controlled geometry via discrete graphs
Given a complete doubling metric measure space $X$ that supports a $2$-Poincaré inequality, we approximate harmonic functions on a bounded domain $\Omega$ with a prescribed Newton-Sobolev boundary data. Our approach is based on the approximation of the underlying space $X$ by a family of graphs. This approximated harmonic function is realized as the weak limit of a sequence of functions obtained from the graph minimizers. We prove that such a function is a minimizer with respect to a nonlinear energy form on $N^{1,2}_0(\Omega)$, which is in turn, majorized by the upper gradient energy on $N^{1,2}(X)$. This energy form on $N^{1,2}_0(\Omega)$ is obtained as a $\Gamma$-limit of a sequence of induced energy forms projected from the discrete energy form on the approximating graphs.
Read the full abstract
History and Overview of Mathematics
Table-Based Encodings for Conway's Doomsday Algorithm: Vectorized Doomsdays and Doomyears
Conway's Doomsday Algorithm (1973) determines the day of the week for any date in the Gregorian calendar via three additive components: a century anchor, a year offset, and a month-day offset. The century anchor is a fixed four-entry table. The other two components require live arithmetic: the year offset demands computing $y + \lfloor y/4 \rfloor \pmod{7}$, and the month-day offset requires a subtraction that can produce negative intermediate values. We present two new encoding schemes that replace both arithmetic steps with structured table lookups. The first, vectorized doomsdays, re-encodes each month's doomsday date as a two-digit number whose tens and units digits represent the backward and forward gaps (respectively) from the nearest multiples-of-seven month anchors. A directional crossing rule (the "square knot rule") pairs the target date's gap with the opposite-direction digit, reducing the month-day offset to a single-digit addition. The second, Doomyears, encodes the year-offset function as a navigational lookup exploiting the 28-year periodicity of the Gregorian weekday cycle. Together with Conway's century anchor table, these form a unified system we call the Calamity Tables. We prove correctness, establish self-verification properties, analyse the internal structure of both encodings, and compare the cognitive complexity of the Calamity Table system against the standard arithmetic method.
Read the full abstract
Analysis of PDEs
Explosion versus decay for boundary derivatives of $p$-harmonic functions as $p$ tends to 1: nonlocality
We consider the Dirichlet problem for the $p$-Laplacian on a bounded Lipschitz domain $\Omega\subset\mathbb R^d$, with boundary data given by the indicator of a closed set. At a smooth boundary point where the data vanish, we study the upper and lower inward normal Dini derivatives as $p\downarrow1$. We give sufficient geometric conditions for these derivatives to be of order $(p-1)^{-1}$, and other conditions under which they decay exponentially in $1/(p-1)$. Whether explosion or decay occurs is not determined locally: on one fixed planar domain with real-analytic boundary, changing the data on a set of arbitrarily small total length, uniformly separated from the observation point, changes explosion into exponential decay. We also exhibit a critical example of a cylinder in $\mathbb R^{d+1}$ where the inward normal derivative is of order $\sqrt{d/(p-1)}$.
Read the full abstract
Statistics Theory
Smoothed estimation of Wasserstein barycenters
This paper studies the statistical estimation of exact Wasserstein barycenters. Existing non-asymptotic results for empirical barycenters exhibit a severe curse of dimensionality. Motivated by the semi-dual formulation of the barycenter problem and its associated Sobolev optimization geometry, we develop a smoothness-aware approach that combines density estimation with Sobolev geometric structure to estimate the population barycenter. We establish nonparametric convergence rates for estimating both the barycenter functional and its minimizer, demonstrating how smoothness can substantially improve statistical performance.
Read the full abstract
Statistics Theory · Cross-listed from stat.ML
Imbalanced Classification under Capacity Constraints
Detecting observations from a minority class under severe class imbalance is a central challenge in applications such as fraud detection, medical screening, and industrial quality control. In these settings, each positive prediction triggers a costly follow-up action, an MRI scan, a transaction audit, whose execution is subject to real operational constraints. This paper proposes a formal classification framework under capacity constraints: given a user-defined bound limit $b$ on the proportion of observations that can be labeled as belonging to the minority class, the goal is to find the classifier that maximizes sensitivity on that class. We characterize the optimal classifier under this constraint and establish its equivalence with the classical Bayes classifier under a reweighting of the prior probabilities. We also introduce a capacity-adjusted performance metric $M$ that accounts for the effective detection rate when the capacity constraint is binding. The framework is implemented on top of standard learning methods, k-NN, SVM, random forests, and neural networks, and statistical consistency is established for each. We further show that these methods reduce to post-hoc thresholding when no hyperparameters are oriented toward the capacity-constrained objective, and introduce a capacity-aware support vector machine that exploits the constraint during training and achieves the strongest empirical performance. Experiments on the Taiwanese credit card default dataset confirm that capacity-constrained classifiers substantially outperform both classical approaches and SMOTE under high imbalance regimes. The framework extends naturally to multiclass settings and online environments.
Read the full abstract
Statistics Theory
Causal Small Area Estimation with Survey-only Covariates
Area-specific causal inference is important in many policy and survey applications, where the goal is to evaluate treatment effects for small geographic or demographic domains. Existing causal small area estimation methods, however, typically rely on a strong data requirement that treatment status is observed for all units in the population. This assumption is often unrealistic in practical survey settings, where both treatment and outcome variables are observed only for sampled units, while auxiliary covariates are available for the full population. To address this limitation, we develop a new identification strategy for area-specific treatment effects under this more realistic data structure by combining survey-only covariates with population-level auxiliary information. Based on this result, we propose a doubly robust estimator that remains consistent when either the outcome regression model or the treatment and area assignment models are correctly specified. We further derive the semiparametric efficiency bound for the target parameter and show that the proposed estimator attains this bound under regularity conditions. Simulation studies demonstrate favorable finite-sample performance, particularly in settings with small sample sizes within areas, and an empirical application illustrates the practical relevance of the proposed framework.
Read the full abstract
Combinatorics
Characterizing Finite Groups via Subgroup Perfect Codes
A perfect code in a graph $\Gamma = (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A subgroup $H$ of a group $G$ is called a subgroup perfect code of $G$ if it is a perfect code in some Cayley graph of $G$. In this paper, we study the set $\Delta(G)$ of conjugacy classes of nontrivial subgroup perfect codes of $G$, with a focus on its relation to $|\pi(G)|$, the number of prime divisors of $|G|$. We prove that $|\Delta(G)| \ge |\pi(G)|$ with only three exceptional families, which leads to the natural question: when is this bound attained or nearly attained? We completely classify finite groups $G$ satisfying $|\Delta(G)| = |\pi(G)|$ and $|\Delta(G)| = |\pi(G)| + 1$, and we further characterize all insolvable groups with $|\Delta(G)| \le 6$. Our approach is based on the classification of primitive groups of odd degree, as well as the classification of primitive groups of square-free degree.
Read the full abstract
Combinatorics
Formalizing Singer Sidon Constructions and Sidon Set Infrastructure in Lean 4
Erdős Problem 30 asks for sharp asymptotics of the Sidon extremal function $h(N)$, and Singer's construction is the classical source of lower-bound examples matching the main term. We present a Lean 4 formalization of Singer's Sidon set construction, together with reusable Sidon-set infrastructure for additive combinatorics. For every prime power $q=p^k$, we prove the existence of a Sidon set modulo $q^2+q+1$ of cardinality $q+1$; the prime-field case $q=p$ is the base presentation. The proof proceeds through a non-trivial algebraic chain: construction of the base field and its degree-three extension, analysis of the trace kernel as a 2-dimensional subspace over the base field, a geometric argument via subspace intersections establishing the multiplicative Sidon property in the quotient group, and a transfer from quotient multiplication to modular integer addition. Around this central result, we develop a reusable Sidon set library. It comprises interval and modular Sidon sets, the extremal function $h(N)$, Lindström's cross-difference inequality, a Johnson-route shift-incidence upper bound of the form $h(N)\leq\sqrt{N}+N^{1/4}+O(1)$, representation-function identities, and unconditional two-sided $h(N)=\Theta(\sqrt{N})$ bounds with exact floor-rounded finite statements for $N\geq 5$. We further formalize a conditional reduction: subpolynomial prime gaps together with a full subpolynomial upper-error hypothesis for $h(N)$ imply the Erdős Problem 30 estimate $h(N)=\sqrt{N}+O_\epsilon(N^\epsilon)$ for every $\epsilon>0$. The Singer/Sidon modules and transfer lemmas comprise 7,541 lines of Lean 4 with zero active uses of sorry. We describe the mathematical lessons learned, focusing on how formalization clarifies the precise scope of classical arguments and forces explicit treatment of the passage from the field-theoretic construction to integer Sidon predicates.
Read the full abstract
Numerical Analysis
The consecutive lifting-projection flow as an approximation of Boltzmann and Landau flow
We introduce the consecutive lifting-projection (LP) flow as a novel approximation framework for the spatially homogeneous Boltzmann and Landau equations. The key idea is to lift the nonlinear collision operator to a higher dimensional linear Kac master equation on spheres, evolve this lifted equation in time, and project the solution back to the lower dimensional velocity space. The resulting LP flow is a tangent flow to the original kinetic dynamics and admits a clear semigroup structure. We show that the consecutive LP flow preserves mass, momentum, and energy, satisfies an entropy dissipation property, and converges to the correct Maxwellian equilibrium. In addition, the lifting removes the intrinsic nonlinearity of the collision operator and enables explicit analytical representations of the solution. For Maxwell molecules, we provide an error estimate quantifying the accuracy over finite time intervals. The framework provides a concise and general methodology for constructing reliable numerical solvers in kinetic theory. It unifies existing explicit discretizations, which helps understanding numerical stability and clarifying the trade-off between conservation and positivity. More importantly, it enables the development of new schemes. In particular, we propose the Green's function method, which is not only unconditionally stable, but also perfectly compatible with fast spectral discretizations.
Read the full abstract
Statistics Theory · Cross-listed from stat.ML
Intrinsic effective sample size for manifold-valued Markov chain Monte Carlo via kernel discrepancy
Effective sample size is a standard summary of Markov chain Monte Carlo output, but it is usually attached to scalar or Euclidean summaries chosen by the analyst. For manifold-valued samples this choice is not canonical: coordinate-wise effective sample sizes can change under rotations, chart changes, or alternative embeddings of the same underlying path. We propose an intrinsic effective sample size based on kernel discrepancy. The proposed quantity is the number of independent draws that would yield the same expected squared kernel discrepancy between the empirical distribution and the target distribution. This gives an exact finite-sample risk interpretation, an asymptotic integrated-autocorrelation representation, and a coordinate-free diagnostic whenever the kernel respects the geometry of the state space. We establish invariance under transported kernels, operator and principal-direction interpretations, and consistency of a lag-window estimator under boundedness and absolute-regularity conditions. We also discuss valid kernel constructions on manifolds, emphasizing that geodesic Gaussian kernels are not generally positive definite on curved spaces. Sphere experiments illustrate rotation invariance and calibration of the proposed diagnostic against empirical distributional error.
Read the full abstract
Optimization and Control
MultiLRSGA: A method for multi-player differentiable games
We propose MultiLRSGA, an $h$-player extension of LRSGA for the computation of stable Nash equilibria in differentiable games. The method originates from the decomposition of the game Jacobian into symmetric and antisymmetric components, which motivates symplectic corrections designed to attenuate the rotational part of the dynamics. In the two-player setting, LRSGA replaces mixed second-order blocks with low-rank secant approximations. The passage to the multi-player case, however, is not a mere blockwise reformulation: the antisymmetric correction is no longer determined by a single pair of cross-interactions, but by a block antisymmetric operator collecting all pairwise couplings among the players. On this basis, we formulate MultiLRSGA by constructing, for each player, a low-rank approximation of the Jacobian of the partial gradient and extracting from it the blocks required to define an approximate antisymmetric correction. Under standard local assumptions around a stable Nash equilibrium, we prove local linear convergence of the method. The key technical ingredient is a lemma controlling the distance between the exact antisymmetric correction and its secant approximation in the $h$-player setting, thereby extending to the multi-player framework the convergence mechanism previously available for LRSGA. The proposed formulation preserves the computational advantages of low-rank symplectic corrections and is naturally suited to numerical validation on differentiable games with explicit payoffs and more than two agents.
Read the full abstract
Algebraic Geometry
Spectral correspondence for cyclic Higgs bundles
In this paper, we describe the spectral correspondence for cyclic Higgs bundles from the viewpoint of quiver bundles. Under this framework, we establish a one-to-one correspondence between cyclic Higgs bundles on a curve and sheaves on a noncommutative surface whose noncommutative structure originates from the path algebra associated to the cyclic quiver. As applications, this correspondence generalizes the known spectral correspondence for $U(p,p)$-Higgs bundles and establish a connection between the spectral data for $U(p,q)$-Higgs bundles and modules over the sheaf of even Clifford algebras of a conic fibration.
Read the full abstract
Probability
Stochastic Itô Equations and Parabolic Second-Order Equations with singular Drift
The aim of the book is to present some recent results in the theory of stochastic Itô equations with singular deterministic part (drift) and its applications to second-order elliptic and parabolic equations with singular first-order coefficients. The singularity is characterized by means of Morrey spaces and this allows for much more singular coefficients than those from Lebesgue spaces. For instance, first-order coefficients having behavior like $1/|x|$ near the origin are allowed. In the first part of the book we are dealing with equations having just measurable coefficients and treat the Markov diffusion time-inhomogeneous processes $X$ corresponding to parabolic operators. In particular, mixed-norm parabolic Aleksandrov estimates, Harnack inequality and Hölder continuity of $X$-caloric functions are investigated. This produces the corresponding results in PDEs such as extended Aleksandrov maximum principle, Harnack inequality and Hölder continuity of PDE-caloric functions. In two remaining chapters we concentrate on weak and strong solutions of Itô equations which requires some regularity restrictions on the diffusion matrix (or second-order coefficients in the PDE language). We give the best to date conditions in terms of Morrey spaces for the existence and uniqueness of weak and strong solutions of Itô equations with singular drift. The majority of our main results are new even if the drift part is zero.
Read the full abstract
Monday 4 May
Combinatorics
Distribution of signless Laplacian eigenvalues and degree sequence
Let $G$ be a graph of order $n$ with degree sequence $d_1 \geq \cdots \geq d_{n}$. Let $m_{G}I$ be the number of signless Laplacian eigenvalues in an interval $I$. In this paper, we characterize the distribution of the signless Laplacian eigenvalues in terms of the degree sequence of a graph within specific subintervals of $[0, \, 2n-2].$ We determine all graphs $G$ such that $m_{G}[d_n, 2n-2] \leq 2, \; m_{G}[d_{n-1}, 2n-2] = 1, \; m_{G}[0, d_1] \le 2.$ We also prove that there is no graph such that $m_{G}[0, d_3]=1$. In addition, we obtain all disconnected graphs such that $m_{G}[0, d_1] = 3$. Finally, we propose two open problems for future research.