Mathematical Physics · Cross-listed from hep-lat
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Wednesday 1 April
Reliable approximations for correlation functions at intermediate and strong coupling remain hard to obtain for general quantum field theories. Perturbative expansions are often asymptotic or have a finite radius of convergence, which limits their applicability beyond weak coupling. Here we combine weak- and strong-coupling expansions and propose to use two-point Padé schemes to construct approximants. For lattice $\phi^4$ theory, we show that this two-point interpolation strategy yields accurate global approximations to the two-point correlation function across broad coupling regimes and compares favorably with standard one-point resummation methods. We also provide heuristic explanations for the observed convergence behavior and discuss the practical range of validity of the approach.
Optimization and Control
Polynomial Stability for Weakly Coupled System with Partial Controls
We study the stability of general weakly coupled systems subject to a reduced number of local or boundary controls. We show that, under Kalman's rank condition, the exponential stability of the underlying scalar equation implies polynomial stability of the full coupled system. Moreover, the decay rate remains unchanged regardless of the number of equations in the system. The proof relies on resolvent estimates and a clever exploitation of Kalman's rank condition to ensure effective transmission of damping across the coupled equations. The abstract result is applied to several concrete models, including systems of wave equations with local viscous, local viscoelastic, or boundary damping; systems of plate equations with internal damping; and thermoelastic systems of type III. Moreover, the optimality of the decay rate is established via spectral analysis.
Read the full abstract
Combinatorics
Maximum spectral sum of graphs
For a graph $G$ of order $n$, the spectral sum of $G$ is defined to be the sum $\lambda_1(G) + \lambda_2(G)$, where $\lambda_1(G)$ (resp. $\lambda_2(G)$) is the largest (resp. second largest) adjacency eigenvalue of $G$. Ebrahimi, Mohar, Nikiforov and Ahmady (2008) conjectured that the spectral sum \[ \lambda_1(G) + \lambda_2(G)\le \frac{8}{7}n \] for any graph $G$. We prove this conjecture by combining tools from the theory of graph limits, convex geometry, exterior algebra and convex optimization. The techniques developed are of independent interest.
Read the full abstract
Algebraic Geometry
The semiregularity theorem for equivariant noncommutative varieties
We generalize the classical semiregularity theorem of Buchweitz and Flenner to the setting of noncommutative algebraic geometry, with group actions. This applies in particular to twisted derived categories, in which case it answers a question of Markman and streamlines part of his proof of the Hodge conjecture for abelian fourfolds. Along the way, we prove that for many finite group actions on derived categories of varieties, the invariant category is of geometric origin.
Read the full abstract
Analysis of PDEs
Fundamental solution and diffusion limits for the heat equation in a half-space with a diffusive dynamical boundary condition
We derive an explicit representation of the fundamental solution to the heat equation in a half-space of ${\mathbb R}^N$ with a diffusive dynamical boundary condition, and establish sharp pointwise upper and lower bounds. We also investigate qualitative properties of the associated solutions, including precise decay estimates. Furthermore, we analyze the diffusion limits of solutions to the initial–boundary value problem, and reveal the role of the diffusive dynamical boundary condition in the behavior of solutions.
Read the full abstract
Combinatorics
On Expansion of Random Regular Graphs: Improved Lower Bounds for Small Even Degrees
We show that a simple scoring-based tie-breaking can help improve lower bounds for the expansion (aka isoperimetric number) of random regular graphs with small even degrees. Specifically, for degrees 4, 6 and 8, we show that, with high probability, the expansions are at least 0.489, 1.120 and 1.813 respectively.
Read the full abstract
Probability
Trap behaviors for Brownian motions
This paper investigates the relationship between the geometric properties of a domain and the diffusion dynamics of Brownian motion, with a specific focus on the phenomenon of "trapping" in terms of the behavior of stochastic processes.
Dynamical Systems · Cross-listed from cs.LG
Phase space integrity in neural network models of Hamiltonian dynamics: A Lagrangian descriptor approach
We propose Lagrangian Descriptors (LDs) as a diagnostic framework for evaluating neural network models of Hamiltonian systems beyond conventional trajectory-based metrics. Standard error measures quantify short-term predictive accuracy but provide little insight into global geometric structures such as orbits and separatrices. Existing evaluation tools in dissipative systems are inadequate for Hamiltonian dynamics due to fundamental differences in the systems. By constructing probability density functions weighted by LD values, we embed geometric information into a statistical framework suitable for information-theoretic comparison. We benchmark physically constrained architectures (SympNet, HénonNet, Generalized Hamiltonian Neural Networks) against data-driven Reservoir Computing across two canonical systems. For the Duffing oscillator, all models recover the homoclinic orbit geometry with modest data requirements, though their accuracy near critical structures varies. For the three-mode nonlinear Schrödinger equation, however, clear differences emerge: symplectic architectures preserve energy but distort phase-space topology, while Reservoir Computing, despite lacking explicit physical constraints, reproduces the homoclinic structure with high fidelity. These results demonstrate the value of LD-based diagnostics for assessing not only predictive performance but also the global dynamical integrity of learned Hamiltonian models.
Read the full abstract
Group Theory
Convex cocompact groups with three-dimensional limit sets
We provide a general construction of convex cocompact hyperbolic reflection groups with three-dimensional limit sets. More precisely, our construction takes as input an arbitrary simplicial complex L of dimension 3 on n vertices, and outputs a convex cocompact right-angled reflection group acting on real hyperbolic n-space whose nerve is precisely the Przytycki-Świątkowski subdivision of L. Moreover, the output reflection group is a thin subgroup of an n-dimensional cocompact arithmetic hyperbolic lattice. This answers affirmatively a question of M. Kapovich concerning the existence of a convex cocompact group acting on some real hyperbolic space with limit set a Čech cohomology sphere other than the standard sphere.
Read the full abstract
Geometric Topology
Extending Quotients of Knot Groups over Surfaces in $B^4$
Let $K\subseteq S^3$ be a knot with exterior $E_K$, and denote by $\rho\colon \pi_1(E_K)\twoheadrightarrow G$ a quotient of its group. We give a sharp obstruction to the existence of a connected, oriented, smooth surface $F\subseteq B^4$ with $\partial F = K$ over whose exterior $\rho$ extends surjectively. Equivalently, we determine whether the cover of $S^3$ branched over $K$ and induced by $\rho$ bounds a connected cover of $B^4$ branched along such a surface. When $G$ is a dihedral group, we show the obstruction can be computed by evaluating the Seifert form of $K$ on a single curve, a so-called characteristic knot associated to $\rho$. When the dihedral obstruction vanishes, we construct the surface $F$ explicitly.
Read the full abstract
Rings and Algebras
Point modules over the universal enveloping algebras of color Lie algebras
Let $k$ be an algebraically closed field with characteristic zero. In this paper, we define the notion of a $q'$-Heisenberg normal element of a $\mathbb{Z}$-graded $k$-algebra. This $q'$-Heisenberg normal element gives the structure of some sets of modules related to point modules. We also determine the set of point modules over an Artin–Schelter regular algebra obtained as the universal enveloping algebra of a color Lie algebra. Moreover, we give a concrete integer such that the inverse system of its truncated point schemes is constant. This is a quantitative answer to a question raised by Artin–Tate–Van den Bergh, in our setting.
Read the full abstract
Geometric Topology
Morse diagrams, Murasugi sums, and the mapping class group
A combinatorial Morse structure encodes a mapping class for a surface with boundary, and the data may be efficiently represented via a Morse diagram. This diagram determines an open book decomposition of a 3-manifold, and hence, a contact structure on that 3-manifold. We examine how combinatorial Morse structures behave under the connect sum of open books, with particular attention paid to the case of negative stabilisation. This leads to a diagrammatic criterion for detecting overtwisted contact structures. Finally, in the case of open books with one-holed torus pages, we classify all the Morse diagrams associated to a fixed open book decomposition.
Read the full abstract
History and Overview of Mathematics
The $\infty$-Oreo$^{^\circledR}$
What happens when a food product contains a version of itself? The Oreo Loaded – a cookie whose filling contains real Oreo cookie crumbs – can be viewed as the result of mixing a Mega Stuf Oreo into a Mega Stuf Oreo. Iterating this process yields a sequence of increasingly self-referential cookies; taking the limit gives the $\infty$-Oreo. We model the iteration as an affine recurrence on the creme fraction of the filling, prove convergence, and compute the limit exactly: the stuf of the $\infty$-Oreo is approximately $95.8\%$~creme and $4.2\%$~wafer. We then extend the framework to pairs of foods that reference each other, deriving a coupled recursion whose fixed point defines a \emph{bi-$\infty$ food}, and illustrate the construction with M&M Cookies and Crunchy Cookie M&M's. Finally, we classify $\infty$-foods by the number of foods in the recursion and introduce homological foods, whose recursive structure is governed by cycles in a directed graph of commercially available products. We close with a conjecture. All products used in this paper can be purchased at a supermarket.
Read the full abstract
Probability · Cross-listed from stat.ML
Denoising distances beyond the volumetric barrier
We study the problem of reconstructing the latent geometry of a $d$-dimensional Riemannian manifold from a random geometric graph. While recent works have made significant progress in manifold recovery from random geometric graphs, and more generally from noisy distances, the precision of pairwise distance estimation has been fundamentally constrained by the volumetric barrier, namely the natural sample-spacing scale $n^{-1/d}$ coming from the fact that a generic point of the manifold typically lies at distance of order $n^{-1/d}$ from the nearest sampled point. In this paper, we introduce a novel approach, Orthogonal Ring Distance Estimation Routine (ORDER), which achieves a pointwise distance estimation precision of order $n^{-2/(d+5)}$ up to polylogarithmic factors in $n$ in polynomial time. This strictly beats the volumetric barrier for dimensions $d > 5$. As a consequence of obtaining pointwise precision better than $n^{-1/d}$, we prove that the Gromov–Wasserstein distance between the reconstructed metric measure space and the true latent manifold is of order $n^{-1/d}$. This matches the Wasserstein convergence rate of empirical measures, demonstrating that our reconstructed graph metric is asymptotically as good as having access to the full pairwise distance matrix of the sampled points. Our results are proven in a very general setting which includes general models of noisy pairwise distances, sparse random geometric graphs, and unknown connection probability functions.
Read the full abstract
Dynamical Systems
Time-bandwidth Study of Non-classically Damped, Linear, Time-invariant Coupled Oscillators with Closely Spaced Modes
In dynamics and vibrations, the concept of bandwidth for linear time-invariant systems is widely recognized as a measure of the dispersion of frequency content around resonance. Similarly, the time constant is associated with the rate of energy decay in the time domain. Notably, the time-bandwidth limit for such systems is unity, indicating that achieving sharp frequency localization while simultaneously maintaining a slow energy decay is not feasible, nor is it possible to achieve a broad frequency spread while preserving a rapid energy decay. However, the time-bandwidth concept does not have a well-defined application to multi-degree of freedom systems characterized by strong modal interactions. This research aims to develop a comprehensive time and bandwidth concept for a linear two-DOF system with significant modal interactions. We focus on a non-classically damped system, which facilitates complex mode interactions, and we investigate how the definition of bandwidth and time constant can be applied to account for the slow dynamics observed in energy decay. By examining this system under various parameters, we gain insights into the energy decay behavior at specific time-bandwidth product regimes. Our analytical results are validated through experiments. Our findings elucidate the implications of the time-bandwidth product for a linear multi-DOF system's response and provide valuable insights into the influence of modal interactions on energy decay.
Read the full abstract
Combinatorics
Set systems containing no singleton intersection and the Delsarte number
We prove that the maximum size of a family of $k$-element subsets of the set $[n] = \{1, 2, \ldots, n\}$ which contains no singleton intersection is $\binom{n-2}{k-2}$ when $3k-3 \le n \le k^2-k+1$. This improves upon a recent result of Cherkashin. Our proof uses Schrijver's variant of the Lovász number and furnishes an infinite family of graphs where the Schrijver variant of the Lovász number is strictly smaller than the Lovász number. As a consequence of our result and a recent result of Keller and Lifshitz, it follows that for $k$ sufficiently large, the maximum size of a $k$-uniform family on $[n]$ containing no singleton intersection is $\binom{n-2}{k-2}$ for all $n\ge 3k-3$, which is the best possible threshold.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
Dynamic Weight Optimization for Double Linear Policy: A Stochastic Model Predictive Control Approach
The Double Linear Policy (DLP) framework guarantees a Robust Positive Expectation (RPE) under optimized constant-weight designs or admissible prespecified time-varying policies. However, the sequential optimization of these time-varying weights remains an open challenge. To address this gap, we propose a Stochastic Model Predictive Control (SMPC) framework. We formulate weight selection as a receding-horizon optimal control problem that explicitly maximizes risk-adjusted returns while enforcing survivability and predicted positive expectation constraints. Notably, an analytical gradient is derived for the non-convex objective function, enabling efficient optimization via the L-BFGS-B algorithm. Empirical results demonstrate that this dynamic, closed-loop approach improves risk-adjusted performance and drawdown control relative to constant-weight and prescribed time-varying DLP baselines.
Read the full abstract
Information Theory · Cross-listed from cs.CR
Efficient DPF-based Error-Detecting Information-Theoretic Private Information Retrieval Over Rings
Authenticated private information retrieval (APIR) is the state-of-the-art error-detecting private information retrieval (ED-PIR), using Distributed Point Functions (DPFs) for subpolynomial complexity and privacy. However, its finite field structure restricts it to prime-order DPFs, leading to prohibitively large key sizes under information-theoretic settings, while its dual-DPF-key design introduces unnecessary communication overhead, limiting its practicality for large-scale deployments. This paper proposes a novel ring-based information-theoretic ED-PIR (itED-PIR) scheme that overcomes these limitations by leveraging prime-power-order information-theoretic DPFs (itDPFs). Built over a prime-power ring, the proposed scheme breaks APIR's field-induced constraint to enable more efficient DPF utilization, significantly reducing key size growth and rendering the scheme feasible for high-security scenarios. Additionally, a single-itDPF-key design halves query-side communication overhead by eliminating APIR's redundant dual-key setup, without compromising privacy or verifiability. Beyond immediate efficiency gains, this work establishes a lightweight, flexible framework for constructing DPF-based malicious-resilient private information retrieval, opening new avenues for privacy-preserving data retrieval in distributed storage systems and post-quantum privacy protocols.
Read the full abstract
Optimization and Control
A Musielak-Orlicz approach for modeling uncertainties in long-memory processes
This paper proposes a novel mathematical framework for modeling uncertainties in supOU processes, a common model for long-memory phenomena. We address uncertainties as distortions in reversion and Levy measures, evaluating them simultaneously via state-dependent divergence functions on Musielak-Orlicz spaces. The core of our approach involves solving optimization problems to determine the upper- and lower-bounds of cumulants under a prescribed uncertainty set. Notably, we demonstrate that while classical measures like Kullback-Leibler divergence fail in this context, Musielak-Orlicz spaces effectively resolve these issues. Along with providing sufficient conditions for the well-posedness of these optimizations, we demonstrate the framework's practical utility through a water environmental application, modeling streamflow discharge. This work offers both a theoretical advancement and a robust tool for long-memory process analysis.
Read the full abstract
Algebraic Topology
Loop Space Splittings of Sphere Bundles over Highly Connected Poincaré Complexes
Let $m > n \ge 2$, and let $N$ be an $(n-1)$-connected $2n$-Poincaré complex. In this paper, we establish sufficient conditions under which the loop space of the total space $M$ of the sphere bundle $S^{m-1} \to M \to N$ (associated to a rank-$m$ real vector bundle over $N$) splits as a product of the loop spaces of $N$ and $S^{m-1}$.
Read the full abstract
Analysis of PDEs
Symmetric hyperbolic Schrödinger equations on tori
In this paper, we study the symmetric hyperbolic Schrödinger equations in the periodic setting. First, we prove full range Strichartz estimates on general tori by adapting Bourgain's major arc method. The result is sharp for rational tori. Second, on two-dimensional rational tori, we establish optimal local well-posedness for two hyperbolic nonlinear Schrödinger (HNLS) equations: the septic HNLS and the hyperbolic-elliptic Davey-Stewartson system.
Read the full abstract
Differential Geometry
Minimal total absolute curvature for equiaffine immersions
Koike (2001) defined the Lipschitz–Killing curvature and established a Chern–Lashof type inequality for equiaffine immersions of arbitrary codimensions. In this paper, we study the equality case. We prove that the total absolute curvature of an $n$-dimensional equiaffine immersion is equal to $2$ if and only if the image is a convex hypersurface embedded in an $(n+1)$-dimensional affine subspace.
Read the full abstract
Analysis of PDEs
On a Keller–Segel System with Density-Suppressed Motility, Indirect Signal Production, and External Sources
This paper investigates an initial-Neumann boundary value problem for a Keller–Segel system with parabolic-parabolic-ODE coupling. The model incorporates a signal-dependent, non-increasing motility function that, through indirect signal production, captures a self-trapping effect suppressing cellular movement at high densities. We establish the global existence of classical solutions in arbitrary spatial dimensions for a broad class of non-increasing motility functions, both with and without external source terms. Furthermore, we demonstrate that any external damping source exhibiting superlinear growth ensures uniform-in-time boundedness. Conversely, in the absence of such damping, solutions may become unbounded as time tends to infinity. More precisely, in the two-dimensional homogeneous case with the exponentially decaying motility function $\gamma(v) = e^{-v}$, a critical mass phenomenon emerges: classical solutions remain uniformly bounded for subcritical initial mass, while supercritical initial masses can lead to infinite-time blow-up. Our analysis relies on the construction of carefully designed auxiliary functions along with refined comparison methods and iteration arguments.
Read the full abstract
Analysis of PDEs
Sharp existence conditions and geometric inheritance for overdetermined free boundary problems of Laplacian and bi-Laplacian type
This paper provides necessary and sufficient conditions for the existence of free boundaries in overdetermined problems for the Laplacian, and sufficient conditions for the bi-Laplacian, when the overdetermined boundary condition is non-constant. Using classical integral inequalities (Cauchy-Schwarz, Hölder, Hardy, eigenvalue bounds, Pohozaev and Reilly identities), we derive existence results for a broad class of free boundary problems arising in potential theory, plate theory, electromagnetism, and shape optimization. A regularity result for minimizers in the $C$-GNP class is established using the thickness function and the Wiener criterion, based on the geometric description of cusp points given in \cite{Barkatou2002}. We provide a new, self-contained geometric result: for almost every $t$, the level sets of the solution inherit the $C$-GNP property. This inheritance theorem justifies the variational framework and guarantees that the entire foliation generated by the state function remains within the admissible class. New results include refined estimates via interpolation inequalities, stability under perturbations, and connections with isoperimetric inequalities. The physical interpretation of the bi-Laplacian problem $\mathcal{B}(f,g)$ in the Kirchhoff-Love theory of thin plates is emphasized.
Read the full abstract
Metric Geometry
From discrete to dense: explorations in the moduli space of triangles
The moduli space of triangles is a two-dimensional space that records triangle shapes in the plane, considered up to similarity. We study the subset corresponding to lattice triangles, which are triangles whose vertices have integer coordinates. We prove that this subset is dense, that is, every triangle shape can be approximated arbitrarily well by lattice triangles. However, when one restricts to lattice triangles in the square $[-N,N]^2$, their shapes do not become uniformly distributed in the moduli space as $N$ grows. Along the way, we encounter connections with geometry, number theory, analysis, and probability.
Read the full abstract
Optimization and Control
Revisiting the Constant-Rank Constraint Qualification for Second-Order Cone Programs
The constant rank constraint qualification (CRCQ) for second-order cone programs, introduced by Andreani et al. in [Math. Program. 202 (2023), 473 - 513], shares some desirable properties with its classical nonlinear programming counterpart; specifically, it guarantees strong second-order necessary conditions for optimality, and is independent of the Robinson constraint qualification. However, unlike the classical version, this new CRCQ can fail in the linear case, and it is unclear whether CRCQ implies the metric subregularity constraint qualification (MSCQ). The aim of this paper is to examine the CRCQ for second-order cone programs in the linear setting. First, we show that the facial constant rank property, which is a key requirement for the validity of CRCQ, does not always hold in this context. Then, we derive a necessary and sufficient condition for a feasible point to satisfy this property. After that, we establish an easily verifiable characterization of CRCQ. Finally, utilizing this characterization, we prove that CRCQ and MSCQ are equivalent.
Read the full abstract
Optimization and Control
Implicit Primal-Dual Interior-Point Methods for Quadratic Programming
This paper introduces a new method for solving quadratic programs using primal-dual interior-point methods. Instead of handling complementarity as an explicit equation in the Karush-Kuhn-Tucker (KKT) conditions, we ensure that complementarity is implicitly satisfied by construction. This is achieved by introducing an auxiliary variable and relating it to the duals and slacks via a retraction map. Specifically, we prove that the softplus function has favorable numerical properties compared to the commonly used exponential map. The resulting KKT system is guaranteed to be spectrally bounded, thereby eliminating the most pressing limitation of primal-dual methods: ill-conditioning near the solution. These attributes facilitate the solution of the underlying linear system, either by removing the need to compute factorizations at every iteration, enabling factorization-free approaches like indirect solvers, or allowing the solver to achieve high accuracy in low-precision arithmetic. Consequently, this novel perspective opens new opportunities for interior-point methods, especially for solving large-scale problems to high precision.
Read the full abstract
Combinatorics
Adjacent vertices of small degree in minimal matching covered graphs
A connected graph $G$ with at least two vertices is matching covered if each of its edges lies in a perfect matching. A matching covered graph is minimal if the removal of any edge results in a graph that is no longer matching covered. An edge is called a $k$-line if both of its end vertices are of degree $k$. Lovász and Plummer [J. Combin. Theory, Ser. B 23 (1977) 127–138] proved that a minimal matching covered bipartite graph different from $K_2$ has minimum degree 2 and contains at least $[(|V(G)|+15)/6]$ 2-lines by ear decompositions. He et al. [J. Graph Theory 111 (2026) 5–16] showed that the minimum degree of a minimal matching covered graph different from $K_2$ is either 2 or 3. In this paper, we prove that every minimal matching covered graph with at least 4 vertices contains at least two nonadjacent edges, each of which is either a 2-line or a 3-line. Consequently, we show that every minimal matching covered graph with at least 4 vertices and minimum degree 3 contains at least 4 vertices of degree 3. Furthermore, the lower bounds for both the number of 3-lines and the number of cubic vertices are sharp.
Read the full abstract
Complex Variables
Any six points on the Riemann sphere can be split into three pairs by a triple of disjoint discs
We prove that for any six points on the Riemann sphere there exist three disjoint closed (or open) discs, each of which contains exactly two of the six distinguished points. This statement shows that recently proposed method to numerically evaluate Kleinian hyperelliptic functions of genus 2 is applicable to any complex curve of genus 2.
Read the full abstract
Mathematical Physics · Cross-listed from cond-mat.str-el
Lieb-Schultz-Mattis Anomalies and Anomaly Matching
Lieb-Schultz-Mattis (LSM) anomalies are powerful symmetry-based constraints on the correlation, entanglement and dynamics of quantum many-body systems. In this review, we discuss various LSM anomalies and anomaly matching. We start with a pedagogical introduction to these subjects in quantum spin chains, and then generalize the discussion to higher dimensions and other systems. Besides covering the topics related to the standard LSM anomalies, we also review LSM anomalies in disordered systems where the lattice symmetries are only preserved on average, fermionic systems, and systems where the symmetric short-range entangled states are possible but must be nontrivial symmetry-protected topological phases.