Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Monday 18 May

Probability

Limit Profiles for Separation Distance

This paper studies limit profiles for the separation distance. A limit profile records the limiting shape of the distance to stationarity inside the cutoff window, at times of the form $t_n+cw_n$. We start with two famous card shuffles, a general setup for inverse riffle shuffles and random transpositions, and we determine their separation distance limit profiles. We then develop a spectral comparison technique and study continuity properties in the style of [Nes24; Nes25], adapted to separation distance. The comparison method is illustrated through random transpositions, as well as random walks on product groups and the hypercube.
Read the full abstract

Number Theory

Fibonacci Numbers and Vieta Jumping for a Rational Diophantine Equation

We study the Diophantine equation $\displaystyle{\tfrac{a+1}{b} + \tfrac{b+1}{a} \ = \ k}$, where $k$ is an integer. Using Vieta jumping, we completely classify all positive integer pairs $(a, \, b)$. We prove that the associated integer value $k$ can only be $3$ or $4$. The corresponding solution pairs $(a,\,b)$ are related to the classical Fibonacci numbers. As a consequence, the quantity $\frac{a+b}{\gcd(a, \,b)^2}$ takes only the values $1, \, 2, \, 3$ and $5$. This reveals an unexpected connection between a simple rational Diophantine condition, Vieta jumping, and Fibonacci numbers.
Read the full abstract

2605.19083 · 18 May · Ver1.2, added expansion of: In addition to uncovering relationships of interest in their own right, a major purpose of this project is mentoring young mathematicians, showing the excitement of discovering new results and guiding in original research. These problems are thus also very amenable to analysis by AI; we ask readers interested in exploring these questions to keep the above in mind

Differential Geometry

Berezin-Toeplitz Quantization of non-compact manifolds

We develop Berezin-Toeplitz quantization in a non-compact complex geometric setting. Let $(X,\Theta)$ be a Hermitian manifold, $(L,h^L)$ a positive holomorphic line bundle, and $(E,h^E)$ a holomorphic Hermitian vector bundle. Assuming that the Kodaira Laplacian on $(0,1)$-forms with values in $L^p\!\otimes E$ has a spectral gap growing linearly in $p$, we prove that the Bergman projection onto the $L^2$-holomorphic space $H^0_{(2)}(X,L^p\!\otimes E)$ enjoys the usual off-diagonal decay and admits a full asymptotic expansion on compact subsets as $p\to\infty$. As a consequence, for every smooth symbol $f\in\mathcal{C}^\infty_{\mathrm{const}}(X,\operatorname{End}(E))$ (constant outside a compact set), the associated Toeplitz operators $T_{f,p}=P_p f P_p$ form a closed algebra and satisfy a complete composition expansion, yielding a star-product on $\mathcal C^\infty_{\mathrm{const}}(X,\operatorname{End}(E))$ and the expected semiclassical commutator formula. We also give intrinsic criteria characterizing Toeplitz families with compactly supported kernels. We then provide geometric conditions guaranteeing the spectral gap on large classes of non-compact manifolds, via fundamental $L^2$-estimates for $\bar\partial$ on complete Hermitian manifolds (including bounded-geometry complete Kähler manifolds, Kähler-Einstein manifolds, pseudoconvex/weakly $1$-complete, and quasi-projective manifolds). Finally, for compactly supported bounded symbols, we prove a Szegő-type theorem describing the eigenvalue distribution of the compact Toeplitz operators $T_{f,p}$ as $p\to\infty$.
Read the full abstract

All authors Louis Ioos, Wen Lu, Xiaonan Ma, George Marinescu

Metric Geometry

Reducing the upper bound for the Borsuk number in $\mathbb{R}^4$ to 8

The Borsuk number $b(n)$ of $n$-dimensional Euclidean space $\mathbb{R}^n$ is the smallest integer such that any set $F \subset \mathbb{R}^n$ of unit diameter can be partitioned into $b(n)$ subsets of strictly smaller diameter. For $n=4$, the best known upper bound $b(4) \leq 9$ follows from a construction by M. Lassak (1982). In the present paper, we construct partitions of several variants of the truncated Lassak cover into 8 parts of diameter less than 1, thereby showing that $b(4) \leq 8$.
Read the full abstract

Combinatorics · Cross-listed from cs.DM

Super-linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances

We say that an instance of a constraint satisfaction problem (CSP) is non-redundant if the satisfaction of each clause cannot be implied by the satisfaction of the other clauses in the instance. The non-redundancy (NRD) of a CSP is the maximal number of clauses a non-redundant instance can have for a given number of variables. NRD is closely tied to the behavior of CSPs in various computational models including their sparsification, kernelization, and streaming complexity. A primary open question in the study of non-redundancy is the identification of which CSP predicates have near-linear NRD. Recent works by Carbonnel [CP 2022], Khanna, Putterman and Sudan [STOC 2025], Brakensiek and Guruswami [STOC 2025] and Brakensiek, Guruswami, Jansen, Lagerkvist, and Wahlström [2025] have introduced various forms of gadget reductions between CSPs to relate their non-redundancy. The primary contribution of this work is to recontextualize many of these gadget reductions in a framework which we call hypergraph projections. By studying a quantity we call the shrinking factor of these hypergraph projections, we can more precisely predict when a gadget reduction between predicates can yield a super-linear NRD lower bound, greatly improving on the analysis of previous works. To illustrate the power of our framework, we identify some concrete CSP predicates whose non-redundancy is at the cusp of our understanding and show how our methods give lower bounds that could not have been achieved with previous methods. We also demonstrate how these gadget reductions can be automatically deduced using SAT solvers, thereby opening up novel computational avenues for discovering further relationships between the non-redundancy of various CSPs.
Read the full abstract

All authors Joshua Brakensiek, Venkatesan Guruswami, Bart M. P. Jansen, Victor Lagerkvist, Magnus Wahlström

Information Theory

Mode-Tensorized Canonical Polyadic Decomposition for MIMO Channel Estimation

This paper proposes a channel estimation method for Multiple-Input Multiple-Output (MIMO) systems based on Canonical Polyadic (CP) decomposition applied to a mode-factorized tensor representation of the channel. The proposed approach reshapes the original low-order channel tensor into a higher-order tensor by factorizing its modes into multiple virtual modes, thereby introducing additional dimensions. By exploiting the sparse structure of MIMO channels and the plane-wave propagation model in the far-field regime, the proposed mode tensorization enhances the separability of individual propagation paths. It is shown that increasing the number of tensor modes improves component separation and provides inherent denoising effects. Building on these properties, a mode-tensorized CP decomposition (MTCPD) algorithm is developed. In addition, a metric for analyzing the virtual factors obtained from MTCPD is proposed, enabling estimation of the canonical rank and selection of the most informative components contributing to overall system performance. Numerical results demonstrate that the proposed method improves channel estimation accuracy compared to conventional tensor-based approaches, particularly under low signal-to-noise ratio conditions.
Read the full abstract

Analysis of PDEs

Time-periodic solutions for viscous fluids interacting with nonlinear Koiter plates

We prove the existence of time-periodic weak solutions for a fluid-structure interaction system coupling the incompressible Navier-Stokes equations in a three-dimensional moving domain with a nonlinear Koiter plate equation on its upper boundary. The lateral boundary is space-periodic, a natural setting for flow in pipes and channels of periodic cross-section driven by a time-periodic pressure gradient, and the fluid satisfies a no-slip coupling condition at the moving interface. The elastic energy of the plate is governed by the nonlinear Koiter model, which yields an $H^2$-coercive operator and accounts for both membrane and bending effects. To the best of our knowledge, this is the first result on time-periodic weak solutions for a fluid-structure interaction system with a nonlinear elastic energy. The main novelty, compared to our earlier works on the linear case – a linear elastic plate and a linear Koiter shell respectively – is the replacement of a two-stage fixed-point procedure – a Leray-Schauder argument at the discrete level followed by a set-valued Kakutani-Glicksberg-Fan argument at the continuous level – by a single Leray-Schauder fixed point applied directly to the fully coupled Galerkin system. This reduction is not merely a simplification: the nonlinearity of the Koiter energy destroys the convexity of the solution map on which Kakutani-Fan relies, making the two-stage approach of~\cite{Claudiu22} unavailable and the single fixed point the only viable strategy.
Read the full abstract

Logic

On antichain numbers and the splitting ideal

In this article, we study combinatorial properties of a certain ideal on $\omega$, called the Splitting ideal. We calculate its cardinal invariants and its position in the Katětov order among other definable ideals. We also study the antichain numbers $\mathfrak{a}(\mathcal{J})$ of algebras $\mathcal{P}(\omega)/\mathcal{J}$ for various Borel ideals. We show that $\textrm{min}\{\mathfrak{b},\textrm{cov}^{+}_{h}(\mathcal{J})\}\leq\mathfrak{a}(\mathcal{J})$ holds for a wide class of ideals, including all $F_{\sigma}$-ideals, all analytic $P$-ideals and many other examples. We also show that $\mathfrak{b}\leq\mathfrak{a}(\mathcal{J})$ holds for convergent ideal and for Boring ideal. Finally, we will show the consistency of $\mathfrak{a}(\mathcal{J})<\mathfrak{b}$ for the Van der Waerden's ideal and the linear growth ideal
Read the full abstract

Numerical Analysis

Recovering Complex Unitary Eigenspaces from Real-Valued Embeddings

We consider the problem of recovering a unitary eigendecomposition of a complex unitary matrix from that of its embedded real-valued formulation. Such formulations arise naturally in scientific computing workflows that employ real-arithmetic solvers by representing complex matrices in term of their real and imaginary parts. While the reconstruction is trivial when the spectrum of the real-valued embedding is simple, degenerate and/or complex conjugated eigenvalues introduce ambiguities because each eigenspace may include contributions from both the unitary matrix and its complex conjugate. We prove that this ambiguity can always be resolved by applying a structured projection to the eigenspaces of the real-valued embedding, followed by a rank-revealing orthonormalization. The resulting procedure recovers the eigenvalues and an unitary eigenbasis for the original unitary matrix, with correct multiplicities of degenerate eigenvalues.
Read the full abstract

Numerical Analysis

A Priori Error Analysis of a High-Order Selective Discontinuous Galerkin Method for Elliptic Interface Problems

This paper develops a high-order selective discontinuous Galerkin (SDG) method for solving elliptic interface problems on interface-unfitted Cartesian meshes. This method applies the discontinuous Galerkin (DG) formulation on interface elements and the continuous Galerkin (CG) formulation elsewhere. Correspondingly, we construct a new, locally conforming, hybrid immersed finite element (HIFE) space based on the high-order Frenet IFE basis functions of [1]. Compared with the DG method, the computational cost of this SDG method is significantly reduced and remains comparable to that of the CG method. We prove that the new HIFE space achieves optimal approximation under $h$-refinement, and we establish the well-posedness of the SDG scheme. A priori error estimates are derived in the energy and $L^2$ norms. Numerical examples are provided to verify the theoretical analysis.
Read the full abstract

Numerical Analysis

DG = FEM + flat elements, Part I: Diffusion

We establish a simple, rigorous, and easy to implement connection between the classical continuous finite element method (FEM) and the discontinuous Galerkin (DG) method for Poisson's problem. The key idea is to insert a vanishing-thickness layer of "dummy" elements along cell interfaces. By modifying the diffusion coefficient on these elements to be proportional to their thickness, we prove the FEM formulation converges to Babuška-Zlámal DG with trapezoidal edge quadrature. The scheme is trivial to implement by (i) a mesh edit that introduces degenerate interface elements and (ii) a single Jacobian threshold in an otherwise unmodified FEM code to handle the degenerate elements via the tempered finite element (TFEM) framework. We provide a rigorous derivation of the resulting TFEM-DG scheme, prove optimal $H^1$ and $L^2$ error estimates, and present numerical experiments in 2D and 3D. The method allows for simple implementation of DG in a FEM code and even adaptive element-by-element switching between FEM and DG with minimal coding effort. The framework is readily extensible, as we will demonstrate in a companion paper dedicated to evolutionary nonlinear first-order hyperbolic systems.
Read the full abstract

All authors Jiří Szotkowski, Václav Kučera, Chi-Wang Shu, Antoine Quiriny, Jonathan Lambrechts, Nicolas Moës, Jean-François Remacle

Mathematical Physics · Cross-listed from quant-ph

Semiclassical periodic-orbit theory for quantum spectra

Gutzwiller's trace formula has a central place in quantum chaos because it provides semiclassical approximations for quantum energy levels in classically chaotic systems by linking them to classical periodic orbits. In this didactic article, we discuss a derivation of the trace formula starting from the Feynman path integral. We then describe how the trace formula is used to explain universal features in the distribution of the quantum energy levels that are described by random matrix theory, and we give an overview of related work.
Read the full abstract

Number Theory

Short Salem polynomials

We give a complete classification of all Salem polynomials of length 5. For length 6 we show that all but finitely many Salem polynomials lie in one of 12 infinite families, and subject to Lehmer's Conjecture we give a complete list of the 126 exceptions. We provide a table of short polynomials for all known Salem numbers below the smallest Pisot number.
Read the full abstract

Optimization and Control

Scalable iterative Gramian synthesis for control-affine systems

This article presents a scalable implementation of nonlinear Gramian-based control synthesis for control-affine systems, including a minimum energy control construction. These synthesis advances are achieved by addressing key computational bottlenecks inherent to iterative synthesis map formulations, yielding a computational scheme that exhibits rapid convergence and high-precision. The efficacy of this synthesis framework is demonstrated across five canonical nonlinear control systems and 100-dimensional recurrent neural network models, including underactuated systems. Empirical scaling results further indicate that convergence is primarily governed by intrinsic system properties, such as nonlinearity and controllability, rather than by state-space dimensionality. This work provides a practical, scalable computational pathway for translating rigorous nonlinear synthesis theory into high-dimensional control applications.
Read the full abstract

All authors Zongxi Yu, Cyprien Tamekue, Ruiqi Chen, ShiNung Ching

Dynamical Systems · Cross-listed from nlin.PS

Periodic and quasiperiodic traveling waves in nonlinear lattices with odd elasticity

Discrete nonlinear systems support a rich variety of localized and extended wave phenomena, with their dynamics sensitively dependent on the symmetries of the underlying interaction forces within the lattice. Odd elasticity, emerging in effective models of active materials, breaks the action-reaction symmetry of the local interactions and gives rise to new wave behavior. We investigate the existence and stability of traveling waves in a nonlinear lattice with odd elasticity, where the coupling force between adjacent units depends asymmetrically on the deformations of the coupled units (nonreciprocal elastic coupling). We demonstrate the existence of periodic and quasiperiodic traveling waves and analyze their spectral stability using the master stability framework. In particular, we identify the onset of Eckhaus instability based on the curvature of the associated master stability curve. This approach enables a quantitative analysis of size effects, specifically the bounds on lattice sizes for which a given traveling wave is stable. The stability analysis for quasiperiodic waves is based on an effective description of the envelope of the response through a rotating wave approximation, which agrees well with direct numerical simulations. Our findings establish a unified framework for understanding wave propagation characteristics in nonlinear lattices, for both periodic and quasiperiodic wave profiles. We highlight, qualitatively and quantitatively, the role of nonreciprocal stiffness on the existence and stability of nonlinear traveling waves in dissipative systems, and discuss how localization and stability depend on the interplay between nonlinearity, dissipation and odd elasticity.
Read the full abstract

Number Theory

The generalized Montgomery-Hooley formula: A survey

This memoir is a survey of theorems and inequalities which have grown out of, and extended, the seminal estimate of Montgomery \cite{HM70} \begin{multline*} V(x,Q)=\sum_{q\le Q}\sum_{\substack{a=1\\ (a,q)=1}}^q \left| \psi(x;q,a) - \frac{x}{\phi(q)} \right|^2 \\ = Qx\log x + \textstyle O\big(Qx\log\frac{2x}{Q}\big) + O\big(x^2(\log x)^{-A}\big)., \end{multline*}
Read the full abstract

Geometric Topology

Planar multilinks and rational singularities

Fibered multilinks are a generalization of classical fibered knots and open books that arise in the study of surface singularities and Milnor fibrations. We prove that if the canonical contact structure on the link of a surface singularity is supported by a planar multilink open book, then the singularity must be rational, and that sandwiched singularities are characterized by admitting planar multilinks with a component of multiplicity 1. We also show that some topological properties of planar open books extend to planar multilinks: symplectic fillings are negative definite and cannot contain symplectic surfaces of positive genus, and the image of the Heegaard Floer contact invariant vanishes in $HF_{red}$. Our results for singularities are based on these topological considerations, partly using Min–Roy–Wang's work on fillings of planar spinal open books, as well as the combinatorics of lattice embeddings.
Read the full abstract

Algebraic Geometry

Outer Type Severi-Brauer Schemes

We introduce the notion of a lowered flag of $\mathcal{O}$–modules in order to define a sheaf of flags of ideals isomorphic to the sheaf of parabolic subgroups for the general linear group $\mathbf{GL}_{1,\mathcal{A}}$ of an Azumaya algebra over a general scheme $S$. This notion is extended to the outer type $A_n$ case and we define a suitable sheaf of flags of ideals isomorphic to the sheaf of parabolic subgroups for a unitary group over $S$. When the group is suitably split these are related to flags of submodules in a vector bundle or in a vector bundle with hermitian form, respectively. We also define a sheaf of tuples of idempotents in the associated algebra which is isomorphic to the sheaf of parabolic and Levi subgroup pairs. We show how the type morphism from parabolic subgroups to the Dynkin scheme can be defined in terms of these sheaves of flags. We review how the Severi-Brauer scheme associated to an Azumaya algebra $\mathcal{A}$ is isomorphic to a particular fiber of this type morphism and we generalize this idea to the outer case in order to define outer Severi-Brauer schemes. We provide a new approach to Quillen's construction which produces an Azumaya algebra from a Severi-Brauer scheme and we show that an outer version of Quillen's construction also exists for outer Severi-Brauer schemes which produces an algebra with unitary involution.
Read the full abstract

Commutative Algebra · Cross-listed from cs.SC

Computing Certificates in Archimedean Univariate Saturated Quadratic Modules

A new symbolic algorithm to compute sums of squares multipliers (certificates) to witness the membership of non-negative univariate polynomials in a saturated univariate quadratic module is presented. Certificates are first computed in terms of natural generators introduced by Kuhlmann and Marshall for an Archimedean saturated quadratic module; natural generators can be easily read-off from a semialgebraic set. In the univariate case, an Archimedean quadratic module is also a preordering since it is closed under multiplication; certificates have different representations when a polynomial is viewed as a member in a quadratic module versus in a preordering An algorithm is given to compute certificates of natural generators in terms of the original generators; it uses a construction introduced by Kuhlmann, Marshall, and Schwartz known as the “Basic Lemma”, which splits the non-negative factors of generators. To compute a quadratic module certificate, certificates of products of natural generators are computed using a detailed case analysis based on the types of natural generators. An implementation of the algorithms proposed in Maple is also discussed. The certificates obtained using this implementation are compared with those generated by RealCertify. We discuss examples where RealCertify is unable to find certificates while the proposed method is successful.
Read the full abstract

Information Theory · Cross-listed from quant-ph

4D and 5D Layer Codes through Color Routing

We introduce and explicit Calderbank-Shor-Steane (CSS) code construction that generalizes the Layer codes to $D=4,5$ dimensions. Much like its predecessor, the present construction is based on embedding quantum low-density parity check (qLDPC) codes; from an $[[n,k,d]]$ code with energy barrier $\Delta$, we obtain a $D=4,5$ dimensional Layer code with parameters $[[\Theta(n^{D/(D-2)}), k, \Theta(dn^{1/(D-2)})]]$ and energy barrier $\Omega(\Delta)$. Using good qLDPC codes as input, our construction saturates the $D=4,5$ dimensional BPT bounds exactly. The higher dimensional Layer Codes are modular, and thus well suited to architectures composed of modular network patches, despite our physical limitation to three dimensions. We overcome the hurdles encountered by previous generalization attempts through the use of color routing, allowing us to resolve the structure of the check layers and line defects.
Read the full abstract

Probability · Cross-listed from stat.ML

Bayesian Latent Space Models for Graphs Are Misspecified: Toward Robust Inference via Generalized Posteriors

Bayesian latent space models offer a principled approach to network representation, but rely on correct specification of both geometry and link function. Real-world networks often violate these assumptions, exhibiting geometric mismatch and structural anomalies that break standard metric properties. We show that such misspecification pushes the data-generating distribution outside the model class, causing Bayesian inference to become overconfident and poorly calibrated. To address this, we propose a generalized posterior framework for random geometric graphs. We introduce Link-Sequential R-SafeBayes, a method that exploits dyadic conditional independence to estimate prequential risk and adaptively tune posterior regularization. Experiments on synthetic and real-world networks demonstrate improved calibration, better link prediction performance, and a reliable criterion for selecting latent geometries across Euclidean, spherical, and hyperbolic spaces.
Read the full abstract

Logic

Remarks on Primitive Regulation

We prove, and mechanize in Rocq, an obstruction to closure-level Excluded Middle for primitive regulators $C : \mathsf{Form} \to \mathsf{Prop}$ over the closed implication-falsity fragment $A,B ::= \bot \mid A \to B$. Write $\mathsf{LEM}(C)$ for the demand that $C(A)\lor C(\lnot A)$ hold for every formula $A$. If $C$ is closed under Modus Ponens, is consistent, and admits a formula $B$ satisfying $B\simeq_C\lnot B$, where $A \simeq_C B$ abbreviates $C(A \to B) \land C(B \to A)$, then $\mathsf{LEM}(C)$ is impossible. In fact, consistency excludes both $C(B)$ and $C(\lnot B)$, so the global conclusion uses only the excluded-middle instance at $B$.
Read the full abstract

2605.18924 · 18 May · 14 pages. No consistent regulator can combine Modus Ponens, a closure-equivalence negation fixed point, and closure-level Excluded Middle. Version 3 aligns the exposition with the streamlined Rocq developments: collapse holds for any target formula, each branch uses only the required implication and detachment steps, and consistency excludes both sides at the fixed point

Probability

Kernel Characterisations of Stochastic Orders Within Parametric Density Families

We develop kernel criteria for the likelihood-ratio, hazard-rate, usual stochastic, and relative log-concavity orders in parametric families of univariate probability laws with densities. The score is the derivative of the log density with respect to the parameter, and a kernel equals the score up to an additive term depending only on the parameter. Kernel monotonicity gives likelihood-ratio order, kernel concavity gives relative log-concavity, and two tail-conditional mean inequalities give the hazard-rate and usual stochastic orders. The same construction applies along joint-parameter paths and to comparisons between two laws whose densities admit parameter-dependent factors, where the log-factor ratio is used as the kernel. For compound sums with a random number of i.i.d. terms, the induced kernel is the posterior mean of the kernel of the summand count. The applications recover standard one-parameter orderings, give likelihood-ratio comparisons for compound laws, and handle nonmonotone examples through the tail-conditional criteria.
Read the full abstract

Numerical Analysis · Cross-listed from stat.ML

SURGE: Approximation and Training Free Particle Filter for Diffusion Surrogate

Data assimilation (DA) addresses the problem of sequentially estimating the state of a dynamical system from noisy and incomplete observations. In this work, we employ a diffusion model as a world model to simulate and predict the system's dynamics. Recently, score-based diffusion models have learned global diffusion priors that effectively model (stochastic) dynamics, revealing strong potential for data assimilation. In this paper, we investigate how information from noisy observations can be incorporated to enable continuous correction and refinement of the predicted system state when using a diffusion prior. Motivated by particle filtering methods, we represent the posterior distribution using a set of particles. After receiving noisy observations, the diffusion model is guided using the observation likelihood to steer the generation process toward observation-consistent states. Nevertheless, such guidance does not guarantee sampling from the true posterior. We therefore employ a Sequential Monte Carlo approach over the diffusion trajectory, viewed as a path measure, to reweight and resample particles, thereby correcting the generation process and ensuring convergence toward the desired posterior distribution. This leads to an unbiased particle filtering method that rigorously fuses observational data with diffusion model simulations.
Read the full abstract

All authors Lifu Wei, Yinuo Ren, Naichen Shi, Yiping Lu

Probability

Lattice random-field Widom–Rowlinson models

We consider the Widom–Rowlinson model on $\mathbb{Z}^d$ subject to a symmetric i.i.d.\ random field. We prove that for dimensions $d\le 2$ any non-trivial random field leads to an absence of a phase transition. In contrast, in dimensions $d\ge 3$ and for Gaussian random fields, phase-transition behavior of the model is maintained for sufficiently large densities of occupied sites. This extends the general picture known from the classical random-field Ising model to the random-field Widom–Rowlinson model. Following the general proof route of Aizenman–Wehr as well as Ding–Zhuang, our main contribution rests on adequate notions of contours and their associated generalized spin-flip operation to deal with hard-core repulsions.
Read the full abstract

Rings and Algebras

The Classification of the 2-generated Primitive Axial Algebras of Monster Type

Axial algebras of Monster type are a class of commutative algebras generated by special idempotents called axes. Some motivating examples of these algebras are the Griess algebra and the Norton-Sakuma algebras, relating to the Monster simple group. A long standing open problem is to classify the 2-generated axial algebras of Monster type. A huge milestone was accomplished by Yabe leading, with additional cases completed by Franchi, Mainardis, and McInroy, to the classification in the symmetric case. In this paper, we complete the classification. To do so, we split the proof into multiple cases: dealing with certain parameters, subalgebras, axets, and axial dimensions. Furthermore, we provide a basis, multiplication and information of the algebras in the classification; consolidating existing results on these algebras into one place.
Read the full abstract

All authors Clara Franchi, Mario Mainardis, Justin McInroy, Michael Turner

Analysis of PDEs · Cross-listed from gr-qc

The spacetime Penrose inequality under a quasi final state hypothesis

Penrose's original heuristic for his eponymous spacetime inequality – a conjectured lower bound on the ADM mass in terms of the area of a horizon cross-section – relies on the black hole final state conjecture. In this paper we isolate a substantially weaker but precise late-time condition, which we call the quasi final state hypothesis and prove the spacetime Penrose inequality under this hypothesis. More precisely, for an asymptotically flat globally hyperbolic spacetime with a black-hole-type apparent horizon tube ${H}_{{app}}$ satisfying the dominant energy condition and the quasi final state hypothesis, we show that every asymptotically flat initial data set whose boundary is a MOTS cross-section of ${H}_{{app}}$ satisfies the spacetime Penrose inequality. The quasi final state hypothesis requires only a late-time decay condition on the normal component of the shift and the ratio of timelike to spacelike mean curvature, together with convergence of the cross-sectional areas of ${H}_{{app}}$ to a finite limit. Our approach is new and formulated directly in spacetime. The main geometric object is what we call a tangentially maximal hypersurface, carrying a foliation by spacelike spheres whose timelike mean curvature vanishes. We show that these hypersurfaces are governed by a quasilinear inward-parabolic PDE, and we develop the corresponding a priori theory and prove global existence. On these hypersurfaces, the spacetime Hawking mass reduces to the Riemannian Hawking mass, and the dominant energy condition gives nonnegative scalar curvature. The Riemannian Penrose inequality, combined with the area laws for dynamical and isolated horizons, then yields the result.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Quantum Shannon theory made robust: a tale of three protocols for almost i.i.d. sources

The asymptotic rates of information-theoretic protocols - including error exponents, data-compression rates, and channel capacities - are traditionally derived under the idealised assumption that the underlying resources are independent and identically distributed (i.i.d.). Somewhat surprisingly, even slight departures from the exact i.i.d. structure can drastically alter the asymptotic behaviour predicted by the i.i.d. theory. If the precise nature of the perturbation is known, for instance in the case of a pointwise defect, one can design a bespoke protocol that compensates for it, e.g. by discarding the corrupted subsystem. In realistic physical settings, however, exact i.i.d. behaviour cannot be guaranteed, and deviations from the ideal regime cannot generally be identified precisely. This raises a fundamental question: which notions of almost i.i.d. structure are sufficiently robust to preserve the asymptotic predictions of quantum Shannon theory? We investigate this question for three central information-theoretic tasks: asymmetric hypothesis testing, classical and quantum data compression, and classical communication through quantum channels. Rather than designing protocols tailored to specific defects, we seek robust protocols that remain asymptotically optimal and that are universal within a broad class of almost i.i.d. resources whose precise deviations from the ideal regime are unknown. To this end, we study three inequivalent notions of almost i.i.d. structure, and determine which of them preserve the asymptotic rates and error exponents predicted by the i.i.d. theory. Along the way, we introduce the notion of an almost i.i.d. process and a new distance measure between quantum channels - the club distance - designed to capture stability under local perturbations. These notions may be of independent interest.
Read the full abstract

All authors Filippo Girardi, Nilanjana Datta, Giacomo De Palma, Ludovico Lami

Mathematical Physics

Pseudo-Traveling Waves and Bumps in Quantum and Classical Hierarchical Cellular Neural Networks

We study the existence of pseudo-traveling waves and bump solutions for two classes of hierarchical cellular neural networks (CNNs) defined over the ring of $p$-adic integers $\mathbb{Z}_{p}$. The first type is a $p$-adic CNN described by a reaction-diffusion equation, while the second type is its quantum analog obtained via Wick rotation. The $p$-adic CNNs are hierarchical versions of the classical Chua-Yang CNNs; these networks have a tree-like hierarchical architecture with infinitely many cells and hidden layers. The states are governed by integro-differential equations on $% \mathbb{Z}_{p}$. The $p$-adic traveling waves behave fundamentally differently from their Archimedean counterparts. A traveling wave restricted to a $p$-adic sphere yields a countably infinite collection of independent patterns. We introduce the notion of pseudo-traveling waves as finite truncations of this structure and prove their existence for both the classical and quantum networks. We further establish the existence of time-independent solutions (bumps) for both models. Our theoretical results are complemented by numerical simulations that approximate pseudo-traveling-wave solutions for quantum CNNs.
Read the full abstract

Functional Analysis

Dimension dependence and dimension-free $\ell^2$ estimates for variation seminorms of spherical means on the hypercube

We prove that the $\ell^2 \to \ell^2$ norm of the $r$-variation seminorm of spherical means on the hypercube admits no dimension-free bounds for any $r \in [1, \infty)$ when the variation is taken over all possible radii. Furthermore, we establish that if the radii are restricted to a fixed parity, dimension-free estimates hold for all $r \in (2, \infty)$.
Read the full abstract