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)

Friday 10 April

Dynamical Systems

Non-Autonomous Return Dynamics for Nested Convex Bodies:\\ Cubic Tangency, Summable Geometric Variation, and Critical Regimes

We study a non-autonomous geometric dynamics generated by successive normal transitions between nested convex boundaries sharing a common tangency point. For \(C_{k+1}\subset C_k\subset\mathbb{R}^2\), let \(\mathcal G_k:\partial C_k\to\partial C_{k+1}\) be the first intersection of the inward normal ray with the next boundary. In signed arclength coordinates, the induced scalar map \(G_k\) is tangent to the identity to second order. Writing the boundaries locally as graphs \(f_k\), we prove the uniform defect estimate \[ |G_k(s)-s|\leq C\|f_{k+1}-f_k\|_{C^2}|s|^3. \] The first nonlinear term is cubic: \[ G_k(s)=s+\beta_k s^3+O(s^4), \qquad \beta_k= \frac{(\kappa_{k+1}-\kappa_k)(\kappa_{k+1}-2\kappa_k)}{6}, \] where \(\kappa_k=-f_k''(0)\). Higher coefficients satisfy a diagonal-vanishing principle: they vanish when the corresponding boundary jets coincide. If the geometric variation is summable, \(\sum_{k\geq0}\|f_{k+1}-f_k\|_{C^2}<\infty\), then the full transition defect is summable. Every sufficiently small nonzero orbit has finite total drift and converges to a nonzero limit; hence the common tangency point is Lyapunov stable but not locally attractive. The non-autonomous composition defines a limiting displacement map tangent to the identity. We also study abstract parabolic recurrences with nonsummable nonlinear drift. A weighted comparison principle yields polynomial and logarithmic asymptotic laws, including critical quartic and quintic regimes: \[ s_k\sim(3c\log k)^{-1/3}, \qquad s_k\sim(4c\log k)^{-1/4}. \] These abstract regimes are kept separate from the geometric theory. The main open problem is to determine which critical parabolic behaviors can actually be realized by nested convex boundaries.
Read the full abstract

Category Theory

An Inductive Strategy Towards a Solution to the Generalized Homotopy Hypothesis

Using the theory of distributive series of monads, we construct an $(\infty,0)$-coherator called the inductive coherator. The category of models out of the inductive coherator serve as a model for $\infty$-groupoids that possess an underlying globular set. Once we establish the construction for the inductive coherator, we provide the framework for an inductive strategy to prove the Generalized Homotopy Hypothesis obtained by transferring model structure off of the category of $n$-groupoids onto the category of $(n+1)$-groupoids. Moreover, we provide a necessary and sufficient condition for the transfer of model structure to be successful. We conclude by showing if the transfer of model structure may be completed successively, then the Generalized Homotopy Hypothesis is true.
Read the full abstract

Analysis of PDEs

Parabolic–Elliptic Dynamics with Local–Nonlocal Coupled Operators

In this paper, we study two local–nonlocal settings for parabolic–elliptic evolution systems. In our problems we have a disjoint partition of the spacial domain $\Omega$ as $\Omega=A\cup B$ and we first consider a local parabolic equation posed in $A$ with a nonlocal elliptic balance equation acting in the complementary subdomain $B$. Next, we reverse the roles and take a local elliptic equation posed in $A$ coupled with a nonlocal parabolic equation acting in $B$. In both models, the interaction between the two regions is driven by a nonlocal transmission term given by a kernel that transfers mass across the interface, giving rise to a mixed local–nonlocal, elliptic–parabolic dynamics. We consider Neumann boundary conditions for both problems. To being our analysis we first establish the existence and uniqueness of solutions using a fixed point argument. Then, we provide a detailed analysis of their qualitative behavior. In particular, we show that the coupling structure induces a natural energy functional whose gradient flow governs the evolution, despite the elliptic–parabolic nature of the system. As it is expected in Neumann settings, we prove that the total mass in the whole domain $\Omega$ is preserved in time. We also analyze the long-time behaviour and obtain decay estimates for the parabolic component, which in turn drive the convergence of the elliptic part to a constant solution. Finally, we prove that the parabolic–elliptic problem under consideration is the limit of a purely parabolic problem when a parameter that controls the speed of the dynamic at which one component evolves goes to zero.
Read the full abstract

Rings and Algebras

Why the Bethe Ansatz Works: A Structural Explanation via Interaction Propagation

The Bethe Ansatz provides exact solutions for certain interacting quantum many-body systems, yet its success is confined to narrow regimes and breaks down abruptly outside them. Despite extensive developments in integrable systems, a structural explanation of this phenomenon has remained elusive. In this paper we give a representation-independent account of both the existence and the failure of Bethe-type exact solvability. We identify a single governing mechanism: the behaviour of interaction propagation. For systems in which propagation terminates after finite depth without encountering structural boundaries, global interaction data factor through finitely many local components, forcing Bethe-type solvability. Conversely, once a structural boundary is encountered, irreducible interaction data arise that obstruct such finite factorization and preclude Bethe-type solutions. This yields a sharp structural dichotomy. Within this regime, exact solvability is not an analytic accident but a rigidity phenomenon, while its failure is governed by intrinsic boundary formation. In this way, the Bethe Ansatz is understood as a consequence of constrained interaction propagation rather than as a model-specific construction.
Read the full abstract

Number Theory

A formal proof of the Ramanujan–Nagell theorem in Lean 4

We present a complete formalization, in the Lean interactive theorem prover with the Mathlib library, of the Ramanujan–Nagell theorem: the only integer solutions to the Diophantine equation $x^2 + 7 = 2^n$ are $(n,x) \in \{(3,\pm1),(4,\pm3),(5,\pm5),(7,\pm11),(15,\pm181)\}$. The formalization includes all dependencies, notably the computation of the ring of integers of the quadratic field $\mathbb{Q}(\sqrt{-7})$, its class number, and unit group. We describe the proof strategy, the architecture of the formalization, and the challenges encountered in bridging the gap between textbook proofs and their machine-checked counterparts, with particular attention to the algebraic number theory infrastructure required.
Read the full abstract

Optimization and Control · Cross-listed from cs.DS

Algorithms for Standard-form ILP Problems via Komlós' Discrepancy Setting (Refined $2^{O(k)}$-analysis)

We study the standard-form ILP problem $\max\{ c^\top x \colon A x = b,\; x \in Z_{\geq 0}^n \}$, where $A\in Z^{k\times n}$ has full row rank. We obtain refined FPT algorithms parameterized by $k$ and $\Delta$, the maximum absolute value of a $k\times k$ minor of $A$. Our approach combines discrepancy-based dynamic programming with matrix $\ell_2$-discrepancy bounds in Komlós' setting. Up to polynomial factors in the input size, the optimization problem can be solved in time $2^{O(k)}\Delta^2$, and the corresponding feasibility problem in time $2^{O(k)}\Delta$. We would like to point out that the original version of this work, published in ESA 2026 proceedings, contains a slightly weaker result. More precisely, the earlier bounds were $O(\kappa_k)^{2k} \Delta^2$ for optimization and $O(\kappa_k)^{k} \Delta$ for feasibility, where $\kappa_k$ denotes the maximum $\ell_\infty$-discrepancy in Komlós' setting. However, following the advice of one of the anonymous reviewers – to whom we are very grateful – we replaced the $\ell_\infty$-discrepancy with the $\ell_2$-discrepancy in the analysis. This is what allowed us to replace dependencies of the form $\kappa_k^{O(k)}$ with $2^{O(k)}$.
Read the full abstract

All authors Dmitry Gribanov, Tagir Khayaleyev, Mikhail Cherniavskii, Maxim Klimenko, Dmitry Malyshev, Stanislav Moiseev

Differential Geometry

The index of cubic focal manifolds

We calculate the index and nullity of the three orientable focal manifolds of isoparametric hypersurfaces in spheres with three distinct principal curvatures. It turns out that the index is equal to the dimension of the ambient Euclidean space and the nullity is completely determined by the normal part of Killing vector fields of the ambient sphere. In that sense, the Veronese embeddings of the projective planes are as stable as possible for non totally geodesic submanifolds of the sphere.
Read the full abstract

Optimization and Control

ProxiCBO: A Provably Convergent Consensus-Based Method for Composite Optimization

This paper introduces an interacting-particle optimization method tailored to possibly non-convex composite optimization problems, which arise widely in signal processing. The proposed method, ProxiCBO, integrates consensus-based optimization (CBO) with proximal gradient techniques to handle challenging optimization landscapes and exploit the composite structure of the objective function. We establish global convergence guarantees for the continuous-time finite-particle dynamics and develop an alternating update scheme for efficient practical implementation. Simulation results for signal processing tasks, including signal recovery from one-bit quantized measurements and parameter estimation from single-photon lidar data, demonstrate that ProxiCBO outperforms existing proximal gradient methods and CBO methods in terms of both accuracy and particle-efficiency.
Read the full abstract

All authors Haoyu Zhang, Yanting Ma, Ruangrawee Kitichotkul, Joshua Rapp, Petros Boufounos

Combinatorics

Finite versus uncountable convex lattices from point configurations

We study the smallest convex lattice generated by a finite set of points. To analyze this structure, we introduce the notion of a point configuration, defined via the relative lattice. Under a suitable completeness condition, this lattice becomes a combinatorial counterpart of the convex lattice and is therefore easier to handle. We investigate the enumeration of these structures and prove that, while the number of relative lattices is always finite, the number of convex lattices is uncountable for $n \geq 6$.
Read the full abstract

Analysis of PDEs

A particular solution of a higher-order non-homogeneous Cauchy-Euler equation

In this paper we introduce a new concept of atoms on discrete sets to develop an advanced method to find a particular solution for higher-order non-homogeneous Cauchy-Euler equations. The proposed method provides also an approximate solution by using approximate roots for the characteristic polynomial of the Cauchy-Euler equation.
Read the full abstract

Information Theory

Robust Single- and Multi-Pinching Antenna Systems Under User Location Uncertainty

Pinching antenna (PA) systems have recently emerged as a promising architecture for reconfigurable wireless communications by enabling flexible antenna placement along a dielectric waveguide. However, existing works typically assume perfect knowledge of user locations, which is impractical in real systems where location estimation errors are inevitable. In this paper, we investigate robust power allocation and antenna placement for PA systems under user location uncertainty. We consider both single-antenna and multi-antenna configurations, where the true user locations are unknown but lie within bounded uncertainty regions. For the single-antenna case, we adopt a worst-case robust design and leverage the S-procedure to transform the joint power allocation and antenna placement problem into a convex semidefinite program (SDP), ensuring that quality-of-service (QoS) constraints are satisfied for all possible user locations. For the multi-antenna case, we address the additional challenges arising from the superposition of channel components from multiple antennas by developing an efficient numerical procedure to evaluate the worst-case channel gain. Then, we derive a closed-form solution for optimal power allocation and develop a block coordinate descent algorithm to optimize antenna placement. Simulation results show that the proposed framework provides robustness to location uncertainty while achieving power consumption close to that of outage-based benchmark schemes.
Read the full abstract

All authors Hao Feng, Ebrahim Bedeer, Ming Zeng, Xingwang Li, Wanming Hao, Dingzhu Wen

General Mathematics

Universal Inclusion of Prescribed Primes in 3x3 Magic Squares

We present an integrated version of the global program proving that every prescribed prime \(q_0\ge 5\) occurs in some \(3\times 3\) magic square whose nine entries are distinct positive primes. The manuscript explicitly corrects the four points that had prevented the previous version from being regarded as closed: (i) the notation for the fixed prime \(q_0\) is now kept uniformly distinct from the notation for the sieve moduli \(d\); (ii) the weight convention is unified by working with the function \(\vt(n)=\log n\) on the primes and \(0\) off the primes, while \(\Lambda\) is used only inside the analytic estimates where it is the natural variable; (iii) the full residual notation \((W,a_W,b_W,S_1,A_d,g(d))\) has been incorporated throughout the manuscript; and (iv) the final closure is replaced by a residual-completion theorem on the common support of the core, thereby eliminating the logical gap produced by intersecting two independent theorems.
Read the full abstract

All authors David Salas, Eloy Timón, Pepa Montero, Miguel León Pérez, Rubén González Martínez

2604.09753 · 10 Apr · The final residual-completion step detects primality of the three binary residual cells from Type I (level-of-distribution) information plus switching, but this crosses Selberg's parity barrier; switching transfers no Type II information, and none is supplied. The main universal inclusion theorem therefore does not follow. Earlier structural steps remain correct

Analysis of PDEs

Clustered vortex helices with compactly supported cross-sectional vorticity in the 3D Euler equations

We consider the three-dimensional incompressible Euler equations for helical flows without swirl. By adapting gluing techniques, we construct the first smooth multi-vortex solution in the whole space $\mathbb{R}^3$ exhibiting a cluster of collapsing helical filaments, with the associated cross-sectional vorticity remaining compactly supported in $\mathbb{R}^2$ for all times. Our result generalises previous collapsing configurations in $\mathbb{R}^3$ with rapidly decaying vorticity cores, and extends related variational solutions obtained in infinite cylindrical domains.
Read the full abstract

Number Theory

Modular curves and bad reduction

We prove results that imply, under various hypotheses, that every elliptic curve over a number field $k$ corresponding to a point on a modular curve has bad reduction at a certain prime $p$ of $\mathcal{O}_k$. For example, every elliptic curve with a cyclic torsion subgroup of order 20 defined over $\mathbb{Q}(\sqrt{-11})$ or $\mathbb{Q}(\sqrt{17})$ has bad reduction at all primes lying over $3$. The proofs of these statements are quite different, since $3$ is split in $\mathbb{Q}(\sqrt{-11})$ and inert in $\mathbb{Q}(\sqrt{17})$.
Read the full abstract

Information Theory · Cross-listed from cs.DM

On Worst-Case Optimal Polynomial Intersection

The Optimal Polynomial Intersection (OPI) problem is the following: Given sets $S_1, \ldots, S_m \subseteq \mathbb{F}$ and evaluation points $a_1, \ldots, a_m \in \mathbb{F}$, find a polynomial $Q \in \mathbb{F}[x]$ of degree less than $n$ so that $Q(a_i) \in S_i$ for as many $i \in \{1, 2, \ldots, m\}$ as possible. Decoded Quantum Interferometry (DQI) is a quantum algorithm that efficiently returns good solutions to the problem, even on worst-case instances (Jordan et. al., 2025). The quality of the solutions returned follows a semicircle law, which outperforms known efficient classical algorithms. But does DQI obtain the best possible solutions? That is, are there solutions better than the semicircle law for worst-case OPI instances? Surprisingly, before this work, the best existential results coincide with (and follow from) the best algorithmic results. In this work, we show that there are better solutions for worst-case OPI instances over prime fields. In particular, DQI and the semicircle law are not optimal. For example, when the lists $S_i$ have size $\rho p$ for $\rho \sim 1/2$, our results imply the existence of a solution that asymptotically beats the semicircle law whenever $n/m \geq 0.6225$, and we show that an asymptotically perfect solution exists whenever $n/m \geq 0.7496$. Our results generalize to Max-LINSAT problems derived from any Maximum Distance Separable (MDS) code, and to any $\rho \in (0,1)$. The key insight to our improvement is a connection to local leakage resilience of secret sharing schemes. Along the way, we recover several re-proofs of the existence of solutions achieving the semicircle law.
Read the full abstract

Analysis of PDEs

Slow-moving pattern interfaces in general directions for a two-dimensional Swift-Hohenberg-type equation

We rigorously prove the bifurcation of slow-moving pattern interfaces with general direction in a two-dimensional Swift-Hohenberg-type model close to a Turing instability for a large class of nonlinearities. These interfaces describe the invasion of stripe and hexagonal patterns into the spatially homogeneous state and model a possible mechanism for pattern formation, as observed in a wide range of real-world applications. For this, we develop a rigorous framework to establish the existence of such solutions using spatial dynamics and non-standard centre manifold theory. Our approach exploits geometric and algebraic structures generic to $\mathrm{O}(2)$-symmetric pattern-forming systems near a Turing instability, and addresses fundamental technical challenges due to a non-uniform spectral gap around the imaginary axis, quadratic resonances induced by the hexagonal structure, and the high-dimensional phase space of the reduced equations.
Read the full abstract

Information Theory

Semantic Rate-Distortion for Bounded Multi-Agent Communication: Capacity-Derived Semantic Spaces and the Communication Cost of Alignment

When two agents of different computational capacities interact with the same environment, they need not compress a common semantic alphabet differently; they can induce different semantic alphabets altogether. We show that the quotient POMDP $Q_{m,T}(M)$ - the unique coarsest abstraction consistent with an agent's capacity - serves as a capacity-derived semantic space for any bounded agent, and that communication between heterogeneous agents exhibits a sharp structural phase transition. Below a critical rate $R_{\text{crit}}$ determined by the quotient mismatch, intent-preserving communication is structurally impossible. In the supported one-way memoryless regime, classical side-information coding then yields exponential decay above the induced benchmark. Classical coding theorems tell you the rate once the source alphabet is fixed; our contribution is to derive that alphabet from bounded interaction itself. Concretely, we prove: (1) a fixed-$\varepsilon$ structural phase-transition theorem whose lower bound is fully general on the common-history quotient comparison; (2) a one-way Wyner-Ziv benchmark identification on quotient alphabets, with exact converse, exact operational equality for memoryless quotient sources, and an ergodic long-run bridge via explicit mixing bounds; (3) an asymptotic one-way converse in the shrinking-distortion regime $\varepsilon = O(1/T)$, proved from the message stream and decoder side information; and (4) alignment traversal bounds enabling compositional communication through intermediate capacity levels. Experiments on eight POMDP environments (including RockSample(4,4)) illustrate the phase transition, a structured-policy benchmark shows the one-way rate can drop by up to $19\times$ relative to the counting bound, and a shrinking-distortion sweep matches the regime of the asymptotic converse.
Read the full abstract

Combinatorics

Random 0/1-polytopes expand rapidly

A 0/1-polytope is the convex hull of a subset $V\subseteq \{0,1\}^n$. A celebrated conjecture of Mihail and Vazirani asserts that the graph of every 0/1-polytope has edge-expansion at least 1. In this paper, we show that typical 0/1-polytopes have significantly stronger expansion. Specifically, if $V$ is formed by sampling each vertex of $\{0,1\}^n$ independently with constant probability $p$, then with high probability the edge-expansion is $\Theta(n)$ for $p \in (1/2, 1)$, and $n^{\Theta(\log \log n)}$ for $p \in (0, 1/2)$. This improves the previously best known bound $\Omega(1)$ due to Ferber, Krivelevich, Sales and Samotij.
Read the full abstract

Statistics Theory

Harmonic Map Regression: Rate-Optimal Nonparametric Estimation on Manifolds with Topological Recovery

We study harmonic map regression, a nonparametric estimator for manifold-valued responses, that penalizes the empirical Fréchet risk by the Dirichlet energy. By connecting penalized regression to the theory of harmonic maps, the estimator acquires a structural theory that parallels the classical Euclidean smoothing spline. The Euler-Lagrange equation characterizes the solution as a piecewise-geodesic spline, an equivalent kernel controls pointwise risk at the rate $n^{-2/3}$, and the infinite-dimensional variational problem reduces exactly to a finite-dimensional optimization. Such newly established connection reveals a topological phenomenon that has no analogue in Euclidean nonparametric regression and, to our knowledge, has not been studied in the manifold regression literature. On manifolds whose regression curves can wrap around in topologically distinct ways, maps in distinct homotopy classes are separated by energy barriers intrinsic to the geometry of the target, and the Dirichlet penalty makes the estimator sensitive to this structure, recovering the correct topological class with probability tending to one, a phase transition we call topological recovery. A curvature-dependent oracle inequality yields the minimax rate $n^{-2s/(2s+1)}$ for Sobolev order $s$, matching the Euclidean constant on non-positively curved targets, while five geometric obstructions show that the full structural theory is unique to the Dirichlet energy ($s=1$). Simulations on $S^2$, $\mathbb{H}^2$, $SO(3)$, $\mathrm{Sym}^+(2)$, and $T^2$ corroborate the theory, and an application to wind-direction data on $S^1$ illustrates practical advantages.
Read the full abstract

Probability

An Improved Bipartition Cover Bound for the Multispecies Coalescent Model

Bipartition cover probabilities quantify whether a collection of gene trees contains every bipartition of the underlying species tree, a condition that underlies finite-sample guarantees for summary methods such as ASTRAL. We study this problem under the multispecies coalescent (MSC) model and derive topology-free upper bounds on the number of loci required to obtain a bipartition cover with prescribed confidence, improving upon the existing bounds of Uricchio et al. (2016). Practically, our bounds remain below biologically realistic numbers of loci across a substantially broader range of parameter settings, expanding their usefulness for empirical datasets. Theoretically, our analysis sharpens our understanding of coalescence under the MSC model and develops new asymptotics for these bounds and absorption times under Kingman's coalescent in the natural short branch regime. We further compare our new bounds with existing work using simulations under a variety of different species-tree topologies.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Classification of 2D Fermionic Systems with a $\mathbb Z_2$ Flavor Symmetry

We classify superfusion categories describing two-dimensional fermionic systems equipped with the universal fermion-parity symmetry, implemented by a topological defect line (TDL) $Z$, and an additional $\mathbb{Z}_2$ flavor symmetry generated by a $W$ TDL. Depending on whether $W$ is m-type or q-type, its fusion rules lead to three distinct classes, and solving the super-pentagon equations yields 16 consistent superfusion categories. These are labeled by invariants $(\nu_W,\nu_Z,\nu_{WZ})$, which determine the $\mathbb{Z}_8$ anomaly classes of the symmetries generated by $W$, $Z$, and $WZ$. We also provide explicit realizations using multiple Majorana fermions and comment on implications for fermionic CFTs and gapped phases.
Read the full abstract

Numerical Analysis

New Scheme Adaption Strategy for Hyperbolic Conservation Laws

We introduce a new scheme adaption strategy for one- and two-dimensional hyperbolic systems of conservation laws. The proposed approach builds upon the adaptive framework introduced in [S. Chu, A. Kurganov, and I. Menshov, Appl. Numer. Math., 209 (2025), pp.155–170], where we first employed the smoothness indicator from [R. Lohner, Comput. Methods. Appl. Mech. Eng., 61 (1987), pp.323–338] to automatically detect “rough” and smooth parts of the computed solution, and then used different limiters in the detected regions. This adaptive strategy was based on a threshold needed to sharply separate “rough” and smooth regions. In this paper, we propose a different adaption strategy. We use SBM-type limiters and vary one of the limiting parameters continuously to allow a smooth transition between the “rough” and smooth areas. This way, compressive and overcompressive limiters are activated in the shock and contact wave vicinities only, while we gradually switch to dissipative limiters in the smooth regions. A series of one- and two-dimensional numerical tests for the Euler equations of gas dynamics demonstrates that the new scheme adaption strategy leads to a higher resolution and reduced numerical dissipation.
Read the full abstract

Analysis of PDEs

A nonlocal curve evolution for an immersed elastic filament: global existence and convergence to resistive force theory

We consider a nonlocal curve evolution belonging to a hierarchy of models for the dynamics of an inextensible elastic filament in a 3D Stokes fluid. This model captures the principal part of a full free boundary problem for an elastic filament in Stokes flow. The fluid effects on the filament evolution are encoded in a pseudodifferential force-to-velocity operator which may be regarded as an interpolation between resistive force theory at low wavenumbers and a Stokes boundary value problem at high wavenumbers. Here the curve is considered to be the centerline of a 3D filament with constant cross sectional radius $\epsilon>0$. We show global well-posedness for the curve evolution in the natural energy space. This loosely suggests that the full evolution may be globally well-posed if the large-scale geometry is controlled. Furthermore, we prove convergence to resistive force theory dynamics as $\epsilon\to 0$, which illustrates how resistive force theory emerges from more detailed models.
Read the full abstract

Combinatorics

Graph Energy Maximisation for Integral Circulant Graphs of Order $n = p^2q^3$

The energy of a graph is the sum of the absolute values of its adjacency eigenvalues. For integral circulant graphs $\ICG(n,\mathcal{D})$ of order $n=p^2q^3$, where $p$ and $q$ are distinct odd primes, we prove that the adjacency eigenvalues of $\ICG(p^2q^3,\Dstar)$, for the divisor set $\Dstar=\{1,p^2,pq,q^2,p^2q^2,pq^3\}$, admit an exact Kronecker factorisation in the prime exponents: they separate completely into a factor depending only on $p$ and a factor depending only on~$q$. This factorisation holds unconditionally for all pairs of distinct odd primes and constitutes the structural core of the paper. From it we derive, unconditionally, the first closed-form polynomial formula for the energy of a two-prime-order integral circulant graph evaluated at $\Dstar$. Exhaustive computation over prime pairs $(p,q)$ confirms that $\Dstar$ is the unique energy maximiser in every tested case; we conjecture that this universality holds for all pairs of distinct odd primes.
Read the full abstract

Numerical Analysis

Asymptotic-preserving deterministic particle methods for collisional plasma models

We develop novel asymptotic-preserving (AP) deterministic particle methods for collisional plasma models, including both Landau–Fokker–Planck and Dougherty collision operators, under hydrodynamic scaling. Our schemes treat the non-stiff transport part explicitly and the stiff collision operators fully implicitly through the energy-conserving Jordan–Kinderlehrer–Otto (JKO) schemes by exploiting their gradient flow structures. This approach extends our previous work on the space-homogeneous Landau equation [arXiv:2409.12296] and introduces a new treatment of the Dougherty operator via a projected gradient flow formulation. We identify the crucial role of Jacobian log-determinant evaluation in stiff regimes and introduce an inner-time quadrature strategy that improves both accuracy and efficiency. Furthermore, we uncover intriguing connections with score-based transport modeling, showing that both explicit and implicit score matching arise as special cases of our unified variational framework and exhibit limitations in the stiff regime. We also develop practical large-scale implementations via neural network parameterization and efficient training strategies. Various numerical examples demonstrate the structure-preserving and AP properties of our schemes for general initial data.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Quantum Randomized Subspace Iteration

Resolving degenerate quantum eigenspaces - including topologically ordered ground states and frustrated magnets - requires preparing high-fidelity states that span every direction of the target manifold. Existing variational and projective algorithms do not naturally cover a multi-dimensional degenerate subspace without sequential orthogonality constraints. We introduce the quantum randomized subspace iteration (QRSI), a fully parallel construction that conjugates the Hamiltonian by independent random unitaries across as many branches as the degeneracy g, then invokes any chosen eigenstate-preparation primitive on each branch. The target subspace is identified from the resulting ensemble via standard subspace estimation, either classically through the coefficient matrix or on hardware through Gram-matrix measurements. We prove that the construction spans the full eigenspace almost surely and preserves the spectral gap exactly on every branch. For practical use, we show that these guarantees hold whenever the random rotations satisfy an anti-concentration condition over the degenerate manifold, substantially weaker than full Haar randomness. We demonstrate QRSI on the toric code, recovering all four topological ground states, and on random Hamiltonians with planted degeneracies.
Read the full abstract

All authors Stefano Scali, Brian Coyle, Giuseppe Buonaiuto, Michal Krompiec

Analysis of PDEs

The Hamiltonian formulation of continuum Calogero-Moser models

Recent well-posedness results have identified the Hardy space $L^2_+$ as the natural phase space for continuum Calogero-Moser models, both focusing and defocusing, on the line and on the torus. In this paper, we introduce a symplectic form on this phase space and so are able to realize these models as Hamiltonian systems. Moreover, we demonstrate that previously identified conserved quantities are mutually commuting, reinforcing the notion that these models are completely integrable. We further illustrate the utility of these structures by using them to give a new proof of global well-posedness in the critical space $L^2_+$, under the necessary mass restriction in the focusing case. Our work also brings to light several unforeseen connections: (i) the threshold for well-posedness coincides with that for the nondegeneracy of the symplectic form; (ii) this threshold is connected through Carleman's inequality to the isoperimetric problem in the plane; (iii) the transition from the line to the torus gives rise to a modified dynamical equation.
Read the full abstract

Information Theory

Robust Spectral Recovery for Dynamical Sampling

We study the spectral recovery problem for dynamical sampling on a finite cyclic grid. Given time snapshots obtained from a fixed uniform spatial subsampling of the orbit $x_{\ell}=A^{\ell}f$, we aim to recover the spectrum of the unknown circular convolution operator $A$. However, in the presence of outliers, even in only a few snapshots, existing approaches often struggle to recover the spectrum. We address this challenge by proposing a novel robust spectral recovery model in the presence of time-sparse corruptions. We propose a robust pipeline that lifts the problem to a sequence of robust low-rank Hankel recovery and completion tasks, followed by Prony-type spectral estimation. Numerical experiments confirm the accurate spectral recovery of the proposed approach and exhibit its superior robustness against state-of-the-art under various settings.
Read the full abstract

All authors HanQin Cai, Longxiu Huang, Tianming Wang, Juntao You

K-Theory and Homology

Improved injective stability for relative $\mathrm{K_1Sp}$-groups

We prove a relative version of Vorst's theorem concerning the equality of the group of all invertible matrices and the group of all elementary matrices over $R[X]$ with respect to an ideal $I \subset R$ such that $R/I$ is regular, where $R$ is a regular $k$-spot. We then introduce a relative version of the symplectic elementary Witt group and show that it fits into a relative version of the Karoubi periodicity sequence. Combining these results, we improve the existing injective stability bounds for relative linear and symplectic $\mathrm{K_1}$-groups of smooth affine algebras over various base fields. As an application, we give a necessary and sufficient condition for the freeness of stably free modules over smooth real $4$-folds with empty real locus.
Read the full abstract

Quantum Algebra

Fundamental fields in the deformed $W$-algebras

Let $\mathfrak{g}$ be a simple Lie algebra. Frenkel and Reshetikhin introduced the deformed $W$-algebra $\mathbf{W}_{qt}(\mathfrak{g})$. In this work, we propose a formal reformulation of this definition in a different context. In this framework, we reformulate and prove the well-definedness of an algorithm (arxiv:2103.15247, arxiv:2205.08312) inspired by the Frenkel-Mukhin algorithm (arXiv:math/9911112) which, starting from a given dominant monomial $m$ satisfying some degree conditions, produces elements of the deformed $W$-algebra. Then, we apply this algorithm to construct explicitly some specific elements of $\mathbf{W}_{q,t}(\mathfrak{g})$. In particular, we apply this to prove a conjecture of Frenkel and Reshetikhin in arXiv:q-alg/9708006 in types $B_\ell$, $C_\ell$, and for some nodes in other types. This framework opens up new possibilities for studying explicitly fields in the deformed $W$-algebra $\mathbf{W}_{q,t}(\mathfrak{g})$.
Read the full abstract