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)

Monday 6 April

Optimization and Control · Cross-listed from q-fin.PM

$\alpha$-robust utility maximization with intractable claims: A quantile optimization approach

This paper studies an $\alpha$-robust utility maximization problem where an investor faces an intractable claim – an exogenous contingent claim with known marginal distribution but unspecified dependence structure with financial market returns. The $\alpha$-robust criterion interpolates between worst-case ($\alpha=0$) and best-case ($\alpha=1$) evaluations, generalizing both extremes through a continuous ambiguity attitude parameter. For weighted exponential utilities, we establish via rearrangement inequalities and comonotonicity theory that the $\alpha$-robust risk measure is law-invariant, depending only on marginal distributions. This transforms the dynamic stochastic control problem into a concave static quantile optimization over a convex domain. We derive optimality conditions via calculus of variations and characterize the optimal quantile as the solution to a two-dimensional first-order ordinary differential equation system, which is a system of variational inequalities with mixed boundary conditions, enabling numerical solution. Our framework naturally accommodates additional risk constraints such as Value-at-Risk and Expected Shortfall. Numerical experiments reveal how ambiguity attitude, market conditions, and claim characteristics interact to shape optimal payoffs.
Read the full abstract

Numerical Analysis

Architecture-aware $h$-to-$p$ optimisation: spectral/$hp$ element operators for mixed-element meshes

We extend earlier international efforts to optimise hexahedral-based spectral element methods on GPUs and vectorised CPUs to mixed element meshes additionally involving prismatic, pyramidic, and tetrahedral shapes using tensorial expansions. We demonstrate that common finite element operators (such as the mass and Helmholtz matrices) benefit from alternative implementation strategies depending on the element shape, choice of polynomial order, and system architecture in order to achieve optimal performance. In addition, we introduce a new approach/interpretation to efficiently evaluate more complex operations involving inner products with the derivative of the expansions as part of the integrand such as the stiffness matrix. This approach seeks to maximise operations using the collocation properties of the nodal tensorial expansion associated with classical quadrature rules. Our GPU performance tests demonstrate that the throughput of the Helmholtz operator on tetrahedral elements is at most 2.5 times slower than on hexahedral elements, despite tetrahedra having a factor of six greater floating-point operations.
Read the full abstract

All authors Jacques Y. Xing, Boyang Xia, Diego Renner, Chris D. Cantwell, David Moxey, Robert M. Kirby, Spencer J. Sherwin

Optimization and Control

Dividend ratcheting and capital injection under the Cramér-Lundberg model: Strong solution and optimal strategy

We consider an optimal dividend payout problem for an insurance company whose surplus follows the classical Cramér-Lundberg model. The dividend rate is subject to a ratcheting constraint (i.e., it must be nondecreasing over time), and the company may inject capital at a proportional cost to avoid ruin. This problem gives rise to a stochastic control problem with a self-path-dependent control constraint, costly capital injections, and jump-diffusion dynamics. The associated Hamilton-Jacobi-Bellman (HJB) equation is a partial integro-differential variational inequality featuring both a nonlocal integral term and a gradient constraint. We develop a systematic probabilistic and PDE-based approach to solve this HJB equation. By discretizing the space of admissible dividend rates, we construct a sequence of approximating regime-switching systems of ordinary integro-differential equations. Through careful a priori estimates and a limiting argument, we prove the existence and uniqueness of a strong solution in a suitable space. This regularity result is fundamental: it allows us to characterize the optimal dividend policy via a switching free boundary and to construct an explicit optimal feedback control strategy. To the best of our knowledge, this is the first complete solution – comprising both the value function and an implementable optimal strategy – for a dividend ratcheting problem with capital injection under the Cramér-Lundberg model. Our work advances the mathematical theory of optimal stochastic control beyond the standard viscosity solution framework, providing a rigorous foundation for dividend policy design in economics.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

Almost Universal Metrics

A metric is called universal if every symmetric conserved rank-two tensor constructed locally from the metric, the curvature, and covariant derivatives of the curvature is proportional to the metric. Such a metric solves arbitrary metric-based higher-curvature field equations after, at most, a change in the effective cosmological constant. A metric is called almost universal if the same field equations reduce instead to a finite set of algebraic conditions and a single linear scalar equation for a profile function. Universal and almost universal metrics are useful because they keep higher-curvature gravity under analytic control. Plane waves are a well-known example of universal metrics, while the Kerr-Schild-Kundt class of metrics including the $pp$-waves is almost universal. Here, we add a new member to this class of metrics and show that nonzero constant curvature $pp$-wave metrics are also almost universal. They reduce the generic gravity field equations to those of cosmological Einstein-Maxwell theory with null dust. The background of the $pp$-waves has the topology $\mathbb{R}^{1,1}\times S^{2}$ and provides the missing partner to the Nariai metric with ${\rm dS}^{2}\times S^{2}$ and the Bertotti-Robinson metric with ${\rm AdS}^{2}\times S^{2}$ topologies. These quantum-protected metrics are of clear interest. We exemplify our results by using the quadratic and cubic gravity theories.
Read the full abstract

Statistics Theory

Joint Estimation in Potts Model

In this paper, we study estimation of parameters in a two-parameter Potts model with $q$ colors and coupling matrix $A_N$. We characterize concrete sufficient conditions for existence of the pseudo-likelihood estimator of the Potts model, in terms of the local magnetic fields, and give sufficient conditions for the validity of the above characterization. We then provide sufficient criteria for estimation of both parameters at the optimal rate $\sqrt{N}$. In particular, if $A_N$ is the scaled adjacency matrix of a graph $G_N$, then we show that joint estimation is possible if either $G_N$ has bounded degree or is irregular. In contrast, we give an example of a graph sequence $G_N$ which is approximately regular and dense, where no consistent estimator exists. We also show that one-parameter estimation at the optimal rate $\sqrt{N}$ holds under much milder conditions when the other parameter is known. Along the way, we develop a concentration result for mean-field Potts models using the framework of nonlinear large deviations. Compared to the Ising case, our results for the Potts case require a novel analysis across multiple colors.
Read the full abstract

Combinatorics

On the $(\leq p)$-inversion diameter of oriented graphs

In an oriented graph $\vec{G}$, the inversion of a subset $X$ of vertices consists in reversing the orientation of all arcs with both endvertices in $X$. The {\it $(\leq p)$-inversion graph} of a labelled graph $G$, denoted by ${\mathcal{I}}^{\leq p}(G)$, is the graph whose vertices are the labelled orientations of $G$ in which two labelled orientations $\vec{G}_1$ and $\vec{G}_2$ of $G$ are adjacent if and only if there is a set $X$ with $|X|\leq p$ whose inversion transforms $\vec{G}_1$ into $\vec{G}_2$. In this paper, we study the {\it $(\leq p)$-inversion diameter} of a graph, denoted by $\mathrm{id}^{\leq p}(G)$, which is the diameter of its $(\leq p)$-inversion graph. We show that there exists a smallest number $\Psi_p$ with $\frac{1}{4}p - \frac{3}{2} \leq \Psi_p \leq \frac{1}{2}p^2$ such that $\mathrm{id}^{\leq p}(G) \leq \left\lceil\frac{|E(G)|}{\lfloor p/2\rfloor}\right \rceil + \Psi_p$ for all graph $G$. We then establish better upper bounds for several families of graphs and in particular trees and planar graphs. Let us denote by $\mathrm{id}^{\leq p}_{\cal F}(n)$ (resp. $\mathrm{id}^{\leq p}_{\cal P}(n)$) the maximum $(\leq p)$-inversion diameter of a tree (resp. planar graph) of order $n$. For trees, we show $\mathrm{id}^{\leq 3}_{\cal F}(n) = \left\lceil \frac{n-1}{2}\right\rceil$, $\mathrm{id}^{\leq 4}_{\cal F}(n)=\frac{3}{8}n + \Theta(1)$, $\mathrm{id}^{\leq 5}_{\cal F}(n)= \frac{2}{7}n + \Theta(1)$, and $\mathrm{id}^{\leq p}_{\cal F}(n) \leq \frac{n-1}{p- c\sqrt{p}} + 2$ with $c = \sqrt{2 + \sqrt{2}}$ for all $p\geq 6$. For planar graphs, we prove $\mathrm{id}^{\leq 3}_{\cal P}(n) \leq \frac{11n}{6} - \frac{8}{3}$, $\mathrm{id}^{\leq 4}_{\cal P}(n) \leq \frac{4n}{3} + \frac{10}{3}$, and $\mathrm{id}^{\leq p}_{\cal P}(n) \leq \left\lceil\frac{3n-6}{\lfloor p/2\rfloor}\right \rceil + 8\lfloor p/2\rfloor - 8$ for all $p\geq 6$.
Read the full abstract

Geometric Topology

Left-orderability in Dehn fillings of pseudo-Anosov mapping tori

For pseudo-Anosov mapping tori with co-orientable invariant foliations and monodromies reversing their co-orientations, a family of taut foliations was constructed in previous work on Dehn fillings with all rational slopes outside a neighborhood of the degeneracy slope. In this paper, we prove that all such Dehn fillings have left-orderable fundamental groups. We present two approaches, both establishing left-orderability through the branching behavior of taut foliations. The first approach produces an $\mathbb{R}$-covered foliation arising from this family for each filling slope, and the second approach shows that, depending on the choice of a suitable system of arcs on $\Sigma$, the resulting foliation either has one-sided branching or is $\mathbb{R}$-covered. Consequently, the second approach associates to each Dehn filling a family of representations of its fundamental group into $\mathcal{G}_\infty$, the group of germs at infinity, whereas the first approach yields an explicit left-invariant order. As an application, combining our results with earlier work in the literature, we verify the L-space conjecture for all surgeries on the $(-2,3,2q+1)$-pretzel knot ($q \geqslant 3$) in $S^3$. From another perspective, $\mathbb{R}$-covered foliations can be produced systematically across a large family of Dehn fillings on cusped hyperbolic manifolds, and in some cusped manifolds they cover all fillings that admit co-orientable taut foliations. This expands the class of known $\mathbb{R}$-covered foliations.
Read the full abstract

Analysis of PDEs

A seminorm-only characterization of analytic Besov spaces on the disc

We introduce the space $\mathcal{W}^{s,p}(\mathbb{D})$ of analytic functions $u$ on the unit disc such that the radial restrictions $u_{r}(\xi):=u(r\xi)$ satisfy the Gagliardo seminorm-only bound \[ \sup_{0<r<1}[u_{r}]_{W^{s,p}(\mathbb{S}^{1})}<\infty, \] with no $\emph{a priori}$ control of $\sup_{r}\|u_{r}\|_{L^{p}(\mathbb{S}^{1})}$. Our main result shows that this assumption already forces $u\in H^{p}(\mathbb{D})$ and that the radial boundary trace $u^{*}$ belongs to $W^{s,p}(\mathbb{S}^{1})$, with $u_{r}\to u^{*}$ in $W^{s,p}(\mathbb{S}^{1})$ as $r\to1^{-}$. The key mechanism combines the mean-value property (which pins the constant mode at $u(0)$) with a fractional Poincar$\'e$ inequality on $\mathbb{S}^{1}$, recovering $L^{p}$ control from oscillation alone. As a consequence, the trace map $u\mapsto u^{*}$ is a surjective isomorphism $\mathcal{W}^{s,p}(\mathbb{D})\xrightarrow{\sim}B^{s}_{p,p,+}(\mathbb{S}^{1})$ with explicit norm equivalence.
Read the full abstract

Algebraic Topology

Borsuk-Ulam Type Theorems and Mountain Climbing Problem

In this paper, we present a new qualitative extension of the Hopf theorem (and a generalization of Borsuk-Ulam theorem), concerning continuous maps $f$ from a compact Riemannian manifold $M$ of dimension $n$ to $\mathbb{R}^n$. We remove the assumption of a Riemannian structure and instead consider closed triangulable manifolds $M$ equipped with a topological notion of 'distant' points. We show that for any continuous map $f \colon M \to \mathbb{R}^n$, there exists a connected component in the space of $f$-neighbors (where a pair of points $a, b$ are $f$-neighbors if $f(a) = f(b)$) that contains both a pair of 'distant' points and a pair of identical points. This result yields further consequences for Lusternik-Schnirelmann and Tucker-type theorems, as well as a multidimensional extension of the mountain-climbing lemma, which in the special case of the standard Euclidean $2$-sphere, may be stated informally as follows. For any continuous distribution of temperature and pressure on Earth (assumed time-independent), there exists a pair of antipodal points with identical values such that travelers starting from these points can move and meet while, at each moment of their journey, experiencing matching 'climatic conditions' up to an arbitrarily small constant.
Read the full abstract

Numerical Analysis

A Convergent Hybridizable Discontinuous Galerkin Method for Einstein–Scalar Equations

We propose and analyze a hybridized discontinuous Galerkin (HDG) method for the spherically symmetric Einstein–scalar system in Bondi gauge. After rewriting the model as a local first-order PDE–ODE system by introducing suitable scaled variables, we construct a semidiscrete scheme in which the element unknowns are computed locally and the coupling is carried by traces on the mesh skeleton. In the present radial setting, these traces can be eliminated recursively, so that only the main evolution variable is advanced in time, while the metric variables are recovered from discrete constraint relations. We prove local semidiscrete well-posedness, derive a global \(L^2\)–stability estimate, establish an optimal order \(L^2\) error bound for the main evolution variable for polynomial degree \(k\ge 1\), and obtain reconstruction error estimates for the metric variables and the associated mass functional. Numerical experiments verify the predicted spatial convergence rate and illustrate qualitative features of the Einstein–scalar dynamics, including large-data collapse profiles and smooth-pulse evolution.
Read the full abstract

Dynamical Systems

On the Degeneracy of the Central Configuration Formed by a Regular n-Gon with a Central Mass

We investigate the degeneracy of the central configuration formed by a regular $n$-gon of equal masses together with an additional mass at the center. While degeneracy of such configurations has traditionally been studied through direct spectral computations, a systematic structural understanding of the origin and multiplicity of degeneracy values has remained incomplete. Exploiting the dihedral symmetry $D_n$, we develop a representation-theoretic framework that decomposes the Hessian of $\sqrt{IU}$ into invariant blocks associated with irreducible symmetry modes, reducing the degeneracy problem to a finite collection of low-dimensional determinants. In particular, this decomposition reveals a distinguished $3 \times 3$ block arising from the coupling between the central mass and the first Fourier mode. Within this framework, degeneracy is organized mode by mode: for each admissible Fourier mode $l \geq 2$, there exists at most one critical value of the central mass parameter at which degeneracy occurs, while the mode $l = 1$ exhibits a qualitatively different behavior. As a consequence, all degeneracy values can be determined explicitly, and their number increases with $n$, reflecting the growing number of independent symmetry modes. Our results provide a structural explanation for the multiplicity of degeneracy values and show that degeneracy is not an isolated phenomenon, but a consequence of the underlying symmetry. The approach also suggests a general framework for analyzing degeneracy in symmetric central configurations.
Read the full abstract

Analysis of PDEs

Nonlinear Schrödinger equations with critical Hardy potential and Choquard nonlinearity

We study the Cauchy problem for the nonlinear Schrödinger equation characterized by contrasting effects between the concentration at the origin of a critical Hardy potential and the intrinsic nonlocality of a Choquard nonlinearity. We prove the existence of a ground state solution through optimizers of an interpolation Hardy-Gagliardo-Nirenberg inequality and derive a non-existence result via Poho\v zaev identities. Using these results, we provide various criteria for the global existence and finite-time blow-up for the problem in the energy-subcritical regime. Finally, we establish a key compactness result, which enables us to obtain a characterization of finite-time blow-up solutions with minimal mass.
Read the full abstract

Combinatorics

Bootstrap percolation of extension hypergraphs

For $k$-graphs $F$ and $H_0$ the $F$-bootstrap percolation process (or $F$-process) starting with $H_0$ is a sequence $(H_i)_{i\geq0}$ of $k$-graphs such that $H_{i+1}$ is obtained from $H_i$ by adding all those $e\in V(H_0)^{(k)}\setminus E(H_i)$ as edges that complete a new copy of $F$. The running time of this $F$-process, denoted by $M_F(H_0)$, is the smallest $i$ with $H_i=H_{i+1}$. Bollobás proposed the problem of determining the maximum running time for $n\in\mathbb{N}$, i.e., $$M_F(n)=\max_{\vert V(H_0)\vert=n}M_F(H_0)\,.$$ Recently, Noel and Ranganathan initiated the study of this quantity for $k$-graphs. In this work, we determine the asymptotics of $M_F(n)$ for a large class of $k$-graphs. Given a graph $G=(V,E)$, the $k$-extension of $G$ is a $k$-graph $F^{(k)}(G)$ obtained from $G$ by enlarging each edge with a $(k-2)$-set of new vertices. We show that for every graph $G$ on $t$ vertices and every $k\geq 3$, $M_{F^{(k)}(G)}(n)\leq C_{k,t}$ for some constant $C_{k,t}$ depending only on $t$ and $k$.
Read the full abstract

Differential Geometry

The Crowley-Nordström invariants of $G_2$-Structures on Aloff–Wallach Spaces

We study homogeneous $G_2$-structures on the Aloff-Wallach spaces $N_{k,l}=SU(3)/S^1_{k,l},$ and compute the Crowley–Nordström invariants associated to these structures. In the case where the first Pontryagin class is rationally trivial, we derive a new intrinsic formula for the $\xi$ invariant. Using Goette's expressions for the $\eta$ invariants of homogeneous spaces, we obtain explicit formulas for the invariants of homogeneous $G_2$-structures on $N_{k,l}$. In particular, we prove that \[ \bar{\nu}(\varphi)=0, \qquad \xi(\varphi)=\frac{3}{2}kl(k+l). \] As a consequence, we obtain examples of manifolds carrying nearly-parallel $G_2$-structures that lie in distinct connected components of the moduli space of $G_2$-structures.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Stochastic Model Predictive Control with Online Risk Allocation and Feedback Gain Selection

Stochastic Model Predictive Control addresses uncertainties by incorporating chance constraints that provide probabilistic guarantees of constraint satisfaction. However, simultaneously optimizing over the risk allocation and the feedback policies leads to intractable nonconvex problems. This is due to (i) products of functions involving the feedback law and risk allocation in the deterministic counterpart of the chance constraints, and (ii) the presence of the nonconvex Gaussian quantile (probit) function. Existing methods rely on two-stage optimization, which is nonconvex. To address this, we derive disjunctive convex chance constraints and select the feedback law from a set of precomputed candidates. The inherited compositions of the probit function are replaced with power- and exponential-cone representable approximations. The main advantage is that the problem can be formulated as a mixed-integer conic optimization problem and efficiently solved with off-the-shelf software. Moreover, the proposed formulations apply to general chance constraints with products of exclusive disjunctive and Gaussian variables. The proposed approaches are validated with a path-planning application.
Read the full abstract

Operator Algebras

On split exact sequences and KK-equivalences of amplified graph C*-algebras

We give a general methodology for constructing split exact sequences of amplified graph C*-algebras with sinks. This in turn allows us to construct explicit KK-equivalences with $\mathbb{C}^N$ for a large class of C*-algebras, including the quantum Grassmannian $\mathrm{Gr}_q(2,4)$. We discuss compatibility with known (quantum) CW-constructions and give an explicit KK-equivalence between the classical and quantum projective spaces $\mathbb{C}P^1$ and $\mathbb{C}P_q^1$.
Read the full abstract

Functional Analysis

$W^{2,1}$ approximation of planar Sobolev homeomorphisms by smooth diffeomorphisms

The approximation of Sobolev homeomorphisms by smooth diffeomorphisms is well understood in first-order spaces $W^{1,p}$, but remains largely open in the second-order space $W^{2,1}$ due to a fundamental tension between curvature control and injectivity. In this paper we isolate and resolve the local analytical component of this problem. We construct explicit local regularisations both across flat interfaces and near multi-cell vertices, and prove convergence in $W^{2,1}$ together with quantitative preservation of the Jacobian. The resulting maps are $C^{1}$ on the whole domain and smooth inside each cell of the partition; in particular they are $C^{2}$ away from the interfaces. These local constructions are combined into a global smoothing theorem: any piecewise quadratic $C^{1}$-compatible planar homeomorphism satisfying a quantitative bi-Lipschitz condition can be approximated in $W^{2,1}$ by maps that are $C^{1}$, injective, and have positive Jacobian. As a consequence, we show that the general $W^{2,1}$ approximation problem reduces to a purely geometric question: the construction of piecewise quadratic approximations with quantitative injectivity and nondegeneracy.
Read the full abstract

Combinatorics

Biorthogonal eigenvectors of the Holte carry matrix and cascade-free enumeration

For $k$-summand base-$N$ addition, the carry process is a Markov chain on $\{0,\ldots,k-1\}$ whose transition matrix–the Holte matrix $T$–has eigenvalues $\{N^{-j}\}_{j=0}^{k-1}$, all simple and independent of $N$. We give the complete biorthogonal eigenvector system. The left eigenvectors factor as $\sum_i u_j[i] x^i = c_{k,j} (x-1)^j A_{k-j}(x)$, where $c_{k,j} = |s(k,k-j)|/k!$ involves unsigned Stirling numbers and $A_n(x)$ is the Eulerian polynomial. The right eigenvectors satisfy $\sum_i \binom{k-1}{i} v_j[i] x^i = (1+x)^{k-1-j} Q_j(x)$, where the quotient polynomials $Q_j$ have palindrome symmetry $x^j Q_j(1/x) = (-1)^j Q_j(x)$ and converge to $(1-x)^j$ as $k \to \infty$; for $j \le 3$, we give explicit closed forms in terms of $k$. The cascade-free avoidance count satisfies $a(L) = (\sqrt{d})^L U_L(x)$ (Chebyshev polynomial of the second kind) whenever the restricted transfer matrix has dimension $d \le 2$; we prove this is sharp: for $k$-summand addition, Chebyshev form holds for $k = 3$ and fails for $k \ge 4$. The proof uses oscillatory matrix theory to establish non-vanishing of all spectral residues. The characteristic polynomial of the restricted transfer matrix is determined in closed form by a Stirling-weighted Lagrange interpolation at the Holte eigenvalues. Two systems with binary carry state spaces are shadow-equivalent if and only if they share the pair $(N, d)$. The general classification for $k$-state systems reduces to the characteristic polynomial of $T$.
Read the full abstract

Information Theory · Cross-listed from stat.ML

Noisy Nonreciprocal Pairwise Comparisons: Scale Variation, Noise Calibration, and Admissible Ranking Regions

Pairwise comparisons are widely used in decision analysis, preference modeling, and evaluation problems. In many practical situations, the observed comparison matrix is not reciprocal. This lack of reciprocity is often treated as a defect to be corrected immediately. In this article, we adopt a different point of view: part of the nonreciprocity may reflect a genuine variation in the evaluation scale, while another part is due to random perturbations. We introduce an additive model in which the unknown underlying comparison matrix is consistent but not necessarily reciprocal. The reciprocal component carries the global ranking information, whereas the symmetric component describes possible scale variation. Around this structured matrix, we add a random perturbation and show how to estimate the noise level, assess whether the scale variation remains moderate, and assign probabilities to admissible ranking regions in the sense of strict ranking by pairwise comparisons. We also compare this approach with the brutal projection onto reciprocal matrices, which suppresses all symmetric information at once. The Gaussian perturbation model is used here not because human decisions are exactly Gaussian, but because observed judgment errors often result from the accumulation of many small effects. In such a context, the central limit principle provides a natural heuristic justification for Gaussian noise. This makes it possible to derive explicit estimators and probability assessments while keeping the model interpretable for decision problems.
Read the full abstract

Group Theory

Recognition by element orders for simple linear and unitary groups

For a finite group $G$, let $\omega(G)$ be the set of element orders of $G$ and let $h(G)$ be the number of pairwise nonisomorphic finite groups $H$ with $\omega(H)=\omega(G)$. We say that the recognition problem is solved for $G$ if the number $h(G)$ is known, and if $h(G)$ is finite, then all finite groups $H$ with $\omega(H)=\omega(G)$ are described. We complete the solution of the recognition problem for the finite simple linear and unitary groups.
Read the full abstract

Rings and Algebras

On the structure of approximate rings

By a [$K$-]approximate subring of a ring we mean an additively symmetric subset $X$ such that $X \cdot X \cup (X + X)$ is covered by finitely many [resp.\ $K$] additive translates of $X$. We prove a structure theorem for finite approximate subrings. Our aim is to develop a general framework for the sum-product phenomenon that applies uniformly across arbitrary rings. The main result identifies nilpotent quotients as the fundamental obstruction to growth under both addition and multiplication. Another application of the main structure theorem is a ring-theoretic counterpart of Gromov's theorem on groups of polynomial growth. The principal tool in the proof is the existence of definable locally compact models for arbitrary approximate subrings from [Kru24]. This existence theorem extends beyond the finite (and pseudofinite) setting. To illustrate the scope of the method, we also establish a structure theorem for uniformly discrete approximate subrings of semi-simple real algebras, generalizing a classical sum-product result of Meyer.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations

We formulate a global-position colored-permutation encoding for the capacitated vehicle routing problem. Each of the $K$ vehicles selects a disjoint partial permutation, and the sum of these $K$ color layers forms a full $n\times n$ permutation matrix that assigns every customer to exactly one visit position. This representation uses $n^2K$ binary decision variables arranged as $K$ color layers over a common permutation structure, while vehicle capacities are enforced by weighted sums over the entries of each color class, requiring no explicit load register and hence no extra logical qubits beyond the routing variables. In contrast, many prior quantum encodings introduce an explicit capacity or load representation with additional qubits. Our construction is designed to exploit the Constraint-Enhanced QAOA framework together with its encoded-manifold analyses. Building on a requirements-based view of quantum utility in CVRP, we develop a routing optimization formulation that directly targets one of the main near-term bottlenecks, namely the additional logical-qubit cost of vehicle labels and explicit capacity constraints. Our proposal shows strong algorithmic performance in addition to qubit efficiency. On a standard benchmark suite, our end-to-end pipeline recovers the independently verified optima. The feasibility oracle may also be of independent interest as a reusable polynomial-time decoding and certification primitive for quantum and quantum-inspired routing pipelines.
Read the full abstract

Combinatorics

Reciprocal binomial sums via Beta integrals

We develop a systematic and fully explicit approach to the evaluation of binomial sums involving reciprocals of binomial coefficients based on Beta integral techniques. Starting from a simple integral representation, we provide a derivation of classical identities, including Frisch's formula, with all intermediate transformations rigorously justified. This framework naturally extends to parametric sums, yielding integral representations that lead to closed forms in terms of hypergeometric functions. In particular, we establish connections with terminating ${}_2F_1$ and generalized ${}_3F_2$ series, thereby linking discrete combinatorial sums with the analytic theory of special functions. We further derive explicit finite expansions suitable for symbolic and numerical computation, as well as higher-order extensions involving Pochhammer symbols. In addition, we present new families of identities, including shifted reciprocal sums and weighted sums involving powers of the summation index, which admit unified hypergeometric representations. Overall, the Beta integral method provides a versatile and unifying framework bridging combinatorial identities, integral representations, and hypergeometric analysis, and opens the way to further generalizations in combinatorics and special function theory.
Read the full abstract

Mathematical Physics

From BV-BFV Quantization to Reshetikhin-Turaev Invariants

We propose a program for bridging the gap between the perturbative BV-BFV quantization of Chern-Simons theory and the non-perturbative Reshetikhin-Turaev (RT) invariants of 3-manifolds, passing through factorization homology of $\mathbb{E}_n$-algebras and the derived algebraic geometry of character stacks. We conjecture that the modular tensor category underlying the RT construction arises as the $\mathbb{E}_2$-category from BV-BFV quantization of Chern-Simons theory on the disk, with the derived character stack $\mathrm{Loc}_{G_\mathbb{C}}(\Sigma)$ of the complexified group and its shifted symplectic structure mediating the proposed identification. A recurring theme is the mismatch between the compact gauge group of Chern-Simons theory and the reductive algebraic group of derived algebraic geometry: we work throughout with $G_\mathbb{C}$ and indicate where a Riemann-Hilbert type comparison is needed to return to the compact theory. We formulate a main conjecture asserting natural equivalence of the BV-BFV and RT constructions as 3-2-1-extended topological quantum field theories, together with several auxiliary conjectures and two questions, develop a proof strategy via deformation quantization of shifted symplectic stacks, and clarify the role of $\mathbb{E}_n$-Koszul duality, which relates the perturbative expansion around a flat connection to the local geometry of the character stack. We relate the perturbative expansions to the sheaf of vanishing cycles on the character stack of a $3$-manifold, propose that a stratification of the character stack by stabilizer type organizes the trans-series decomposition, and propose that the Stokes data of the perturbative expansion should be read as a stability datum in the sense of Kontsevich-Soibelman, with the Chern-Simons functional playing the role of the central charge.
Read the full abstract

Combinatorics

On the minimum number of monochromatic solutions to the strict Schur inequality in 2-colored integer intervals with negative left endpoint

Kosek, Robertson, Sabo, and Schaal studied the minimum number \(M_k(n)\) of monochromatic solutions to the strict Schur inequality system $x_1\le x_2\le x_3$ and $x_1+x_2<x_3$ in \(2\)-colorings of \([k+1,k+n]\). They proved that for every fixed \(k\ge 0\), $M_k(n)= \frac{n^3}{12(1+2\sqrt2)^2}(1+o_k(1)),$ and left open the case \(k\le -2\). In this paper, we resolve that remaining range.
Read the full abstract

All authors Gang Yang, Jinxia Liang, Yaping Mao, Chenxu Yang, Ayun Zhang

Optimization and Control

A Near-Optimal Total Complexity for the Inexact Accelerated Proximal Gradient Method via Quadratic Growth

We consider the optimization problem $\min_{x\in \mathbb R^n}{F(x):=f(x)+\omega(Ax)}$, where $f$ is an $L$-Lipschitz smooth function, and $\omega$ is a proper, lower semicontinuous, and convex function. We prove in this paper that when $\omega$ is a conic polyhedral function, the inexact accelerated proximal gradient method (IAPG), employed in a double-loop structure, achieves a total complexity of $\mathcal O(\ln(1/\varepsilon)/\sqrt{\varepsilon})$ measured by the total number of calls to the proximal operator of the convex conjugate $\omega^\star$ and the gradient of $f$ to achieve $\varepsilon$-optimality in function value. To the best of our knowledge, this improves upon the best-known complexity for IAPG. The key theoretical ingredient is a quadratic growth condition on the dual of the inexact proximal problem, which arises from the conic polyhedral structure of $\omega$ and implies linear convergence of the inner proximal gradient loop. To validate these findings, we conduct numerical experiments on a robust TV-$\ell_2$ signal recovery problem, demonstrating fast convergence.
Read the full abstract

Combinatorics

Matroid analogues of Gal's conjecture

Well-known conjectures of Charney–Davis, Gal, and Nevo–Petersen predict increasingly strong positivity phenomena for the $h$-vectors of flag simplicial spheres. In this paper, we formulate and prove matroid analogues of these conjectures in the setting of Chow polynomials of matroids with building sets. We introduce a new class of matroids with building sets, called complete built matroids, encompassing many prominent families of built matroids such as arbitrary matroids with maximal building sets and braid matroids with minimal building sets. For complete built matroids, we prove $\gamma$-positivity as an analogue of Gal's conjecture, via a combinatorial formula for the $\gamma$-coefficients. We further realize the $\gamma$-vector as the $f$-vector of a simplicial complex, as an analogue of the Nevo–Petersen conjecture. As an application, we obtain a new formula for the $\gamma$-polynomial of the Poincaré polynomial of $\overline{\mathcal{M}}_{0,n}$, together with new coefficient inequalities. We also study flag built matroids, and prove $\gamma$-positivity of their Chow polynomials, extending several known results. Our proofs crucially use toric geometry and tropical intersection theory. Finally, we construct an infinite family of flag chordal nestohedra whose $h$-polynomials are not real-rooted, invalidating a natural strengthening of our result at this level of generality.
Read the full abstract

Group Theory

Homological Isoperimetric Inequalities for Kernels of Free Extensions of Type $FP_2$

We define homological area-radius pairs with surface diagrams. Using these, we adapt a proof of Gersten and Short \cite{gersten2002} to obtain a homological isoperimetric inequality for subgroups of type $FP_2$ which appear as kernels of free extensions.

Combinatorics

An algorithmic Polynomial Freiman-Ruzsa theorem

We provide algorithmic versions of the Polynomial Freiman-Ruzsa theorem of Gowers, Green, Manners, and Tao (Ann. of Math., 2025). In particular, we give a polynomial-time algorithm that, given a set $A \subseteq \mathbb{F}_2^n$ with doubling constant $K$, returns a subspace $V \subseteq \mathbb{F}_2^n$ of size $|V| \leq |A|$ such that $A$ can be covered by $2K^C$ translates of $V$, for a universal constant $C>1$. We also provide efficient algorithms for several "equivalent" formulations of the Polynomial Freiman-Ruzsa theorem, such as the polynomial Gowers inverse theorem, the classification of approximate Freiman homomorphisms, and quadratic structure-vs-randomness decompositions. Our algorithmic framework is based on a new and optimal version of the Quadratic Goldreich-Levin algorithm, which we obtain using ideas from quantum learning theory. This framework fundamentally relies on a connection between quadratic Fourier analysis and symplectic geometry, first speculated by Green and Tao (Proc. of Edinb. Math. Soc., 2008) and which we make explicit in this paper.
Read the full abstract

All authors Davi Castro-Silva, Jop Briët, Srinivasan Arunachalam, Arkopal Dutt, Tom Gur

Combinatorics

Signless Laplacian spectral radius of simplicial complexes without $r$-dimensional wheels

An $r$-dimensional wheel is defined as the join of an $(r-2)$-simplex and a cycle. In this paper, we study the maximum signless Laplacian spectral radius of $n$-vertex $r$-dimensional pure simplicial complexes that contain no $r$-dimensional wheels. For sufficiently large $n$, we determine the extremal complexes that attain this maximum. Our result generalizes the corresponding extremal results of signless Laplacian on graphs and provides a spectral anlogue of a theorem of Brown, Erdős and Sós on the maximum number of facets of simplicial complexes in the case $r=2$.
Read the full abstract