Combinatorics
Topologizing infinite quivers and their mutations
Benjamin Grant
We define several topological spaces whose points are quivers with a given infinite vertex set $X$. In the special case when $X$ is countably infinite, we show that two of the spaces of interest are homeomorphic to the Baire space $\mathbb{N}^\mathbb{N}$. We study properties of countably infinite quivers as subspaces of these topological spaces and prove a “meta-
theorem” about hereditary properties of quivers. Furthermore, we approach the question of convergence for infinite mutation sequences in these spaces, providing a complete characterization of the (non-)density of the domains of convergence and divergence of infinite mutation sequences in one of these spaces and a partial characterization in the other. We then draw
attention to a very special infinite quiver which we call the Fraïssé quiver that draws a clear contrast between the behavior of finite and infinite mutation sequences. Finally, we reproduce (a very mild modification of) a previously-constructed topological space due to Ervin and Jackson as a subquotient of one of the spaces of interest.
Read the full abstract ▾
Functional Analysis
Continuous transformations of probability measures and their transport representations
Hugo Lavenant and Giuseppe Savaré
Given a function $F$ transforming a probability measure $\mu$ into another one $F(\mu)$, we study the existence and regularity of a transport representation of it. That is, we ask whether we can represent the image $F(\mu)$ of the input probability measure $\mu$ as the push-forward of $\mu$ by a map $f(\cdot,\mu)$ which may depend on $\mu$; and furthermore, how regular $f$ can be chosen depending on $F$. Even if $F$ is continuous and a transport representative exists, it cannot necessarily be chosen in a continuous way; however, if $F$ is Lipschitz continuous with respect to the Wasserstein distance, then $f$ can be chosen continuous. We provide several examples to illustrate the sharpness of our assumptions. This question is motivated by approximation results for transformations of probability distributions with
transformers.
Read the full abstract ▾
Statistics Theory · Cross-listed from stat.ME
Strang splitting estimator for nonlinear multivariate stochastic differential equations with Pearson-type multiplicative noise
Predrag Pilipović, Adeline Samson and Susanne Ditlevsen
Multivariate Pearson
diffusions are characterized by a linear drift and a
diffusion matrix that is quadratic in the state variables. We derive closed-form expressions for the mean and covariance
matrix of this class using
matrix exponential integrals, and extend this framework to a broader class of nonlinear
diffusions with Pearson-type multiplicative noise. The main contribution is a new parameter
estimator for these nonlinear multiplicative models based on Strang splitting, which decomposes the
stochastic system into a deterministic nonlinear ordinary differential equation and a multivariate Pearson
diffusion. The
estimator is constructed by composing their respective flows and applying a Gaussian transition approximation with exact moments from the Pearson component. We prove that the
estimator is consistent and asymptotically efficient. We also introduce a new model within this class, the Student Kramers oscillator, and prove existence and uniqueness of the strong solution and of an invariant measure. We evaluate the
estimator through simulation studies on this oscillator and on the multivariate Wright-Fisher
diffusion from population genetics, where it outperforms the Euler-Maruyama, Gaussian approximation, and local linearization
estimators. We conclude with an application to Greenland ice core data using the Student Kramers oscillator.
Read the full abstract ▾
Mathematical Physics · Cross-listed from gr-qc
Hidden symmetry group for particle orbits (timelike geodesics) in Schwarzschild spacetime
Stephen C. Anco and Mahdieh Gol Bashmani Moghadam
For the timelike geodesic equations in Schwarzschild spacetime, three hidden conserved quantities were found recently, which are analogues of dynamical quantities related to the well-known Laplace–Runge–Lenz (LRL) vector in Newtonian
gravity. In particular, the geodesic equations possess an LRL angle, an LRL Killing-vector time and an LRL proper time, each of which is a (piecewise) conserved quantity for all timelike geodesics. The present work provides a natural
symmetry interpretation for these three quantities by applying Noether's
theorem in reverse to the geodesic Lagrangian. This yields three new (hidden) LRL
symmetry transformations. Unlike the Killing
symmetries, which constitute point transformations on the geodesic configuration variables and close without the use of the geodesic equations, the new
symmetries are dynamical transformations which essentially involve the geodesic momenta variables and close only on solutions of the geodesic equations. The commutator structure of the LRL
symmetries is shown to depend on whether a geodesic is bounded or not, and horizon-crossing or not, while their physical meaning is connected to their action on the geodesic energy and angular momentum. Together with the Killing
symmetries and re-parameterization
symmetries of the geodesics Lagrangian, they generate the complete Noether
symmetry group of the timelike geodesic equations.
Read the full abstract ▾
Information Theory
Beyond Covariance: Generative Spatial Correlation Modeling and Channel Interpolation for Fluid Antenna Systems
Zhentian Zhang, Hao Jiang, Kai-Kit Wong et al. (+2 more)
Fluid
antenna systems (FAS) enable unprecedented spatial diversity within a compact form factor by flexibly switching among high-density
antenna ports. To activate this capability, channel state information (CSI) over the ports is required, which implies high estimation overhead because the number of ports is usually very large. Conventional estimation schemes tend to first estimate the CSI for a small number of ports and then infer the CSI for the remaining
antenna ports by interpolation exploiting correlation characteristics. However, existing correlation-based techniques lack generalization ability, and the fundamental limits of interpolating the CSI from sparse observations remain poorly understood. This paper adopts a generative modeling framework for characterizing the channel correlation among the FAS ports that departs fundamentally from covariance-descriptive models. Specifically, we represent the spatially sampled channel as a $p$th-order autoregressive (AR) Gauss-Markov process, which provides a principled and tunable tradeoff between model complexity and approximation accuracy via the AR order. In so doing, we can characterize the limits of channel interpolation by deriving the globally optimal minimum mean-square error (MMSE)
estimator and establishing a tight lower bound on the minimum number of observations required to meet a prescribed reconstruction error. To reduce the complexity of MMSE estimation, we then exploit the state-space structure due to the ${\rm AR}(p)$ model and develop a Kalman filtering/smoothing-based interpolation
algorithm. The resulting method attains the optimal MMSE performance with strictly linear complexity $\mathcal{O}(N)$ with $N$ denoting the number of ports, resulting in a scalable, efficient, and theoretically grounded framework for practical FAS channel reconstruction.
Read the full abstract ▾
All authors Zhentian Zhang, Hao Jiang, Kai-Kit Wong, Hyundong Shin, Ross Murch
Information Theory
Quantized Zero-Energy RIS: Residual Phase Modeling and Outage Analysis
Dimitrios Tyrovolas, Sotiris A. Tegos, Kunrui Cao et al. (+6 more)
Zero-energy reconfigurable intelligent surfaces (zeRISs) have recently emerged as a promising solution for enabling energy-efficient and scalable programmable wireless environments (PWEs) by harvesting their operational energy from impinging
radio-frequency signals. However, the operation of zeRIS-assisted systems is inherently constrained by the coupling between energy harvesting and signal reflection, a dependency that becomes more intricate under practical hardware limitations such as finite-resolution phase control. In this paper, we develop a comprehensive analytical framework for zeRIS-assisted communication systems operating under quantized phase shifts and harvest-and-reflect (HaR) schemes. Specifically, we analyze the joint energy-data rate outage probability and the energy efficiency under time switching and element splitting schemes, considering both transmitter-side and user-side deployment scenarios. By explicitly modeling the residual phase error induced by quantization and incorporating its statistical properties into the analysis, we show that quantization jointly affects energy harvesting and signal reflection, thereby inducing non-trivial trade-offs. As a result, the presented framework enables accurate performance evaluation and reveals critical design trade-offs for the selection of the phase resolution, and the applied HaR scheme in zeRIS-assisted wireless networks.
Read the full abstract ▾
All authors Dimitrios Tyrovolas, Sotiris A. Tegos, Kunrui Cao, Yue Xiao, Panagiotis D. Diamantoulakis, Nikos C. Sagias, Stylianos D. Asimonis, Christos K. Liaskos, George K. Karagiannidis
Rings and Algebras
Hochschild cohomology and lifts of endomorphisms
Niels Lauritzen and Jesper Funch Thomsen
We study when
algebra endomorphisms can be lifted to first-order flat lifts. To a first-order flat lift of an
algebra and an endomorphism, we associate a canonical class in Hochschild
cohomology with coefficients in a naturally twisted bimodule. The
cohomology class vanishes exactly when the endomorphism admits a multiplicative lift. For an Azumaya
algebra of constant rank over a formally smooth center, we prove that an endomorphism lifts if and only if the induced endomorphism of the center preserves the Poisson structure given by the lift of the
algebra.
Read the full abstract ▾
Geometric Topology
The Penrose-Kauffman Polynomial
Louis H. Kauffman, Daniel S. Silver and Susan G. Williams
For any cubic graph in a closed orientable surface and a perfect matching, the Penrose-Kauffman
polynomial is a sum of chromatic
polynomials of a collection of associated graphs. A
knot-theoretic perspective affords elementary proofs of old and new results about the
polynomial. The Four Color
Theorem is shown to be equivalent to a statement about 3-coloring alternating link diagrams in the plane that are reduced and have no bigon regions.
Read the full abstract ▾
Mathematical Physics
Quantum Reference Frames and Correlation Geometry
Claudio F. Paganini
The aim of this paper is to provide a largely self-contained, compact and comprehensible introduction to the basic ideas behind correlation geometry, which underlies the theory of causal
fermion system (CFS). A key focus here is on the manner in which the framework deals with gauge transformations, including diffeomorphisms via the principle of
unitary equivalence. We will argue that, conceptually, the fundamental description of a physical system in terms of its correlation geometry is much closer to thermodynamics than
quantum theory.
Read the full abstract ▾
Numerical Analysis
Low-Memory Numerical Certification
Paul Breiding, Taylor Brysiewicz and David K. Johnson
We introduce a low-
memory framework for certifying numerical solutions to
polynomial systems which uses solution iterators and spatial partitioning trees to reduce
memory requirements. We provide a prototypical
algorithm, analyze its complexity, and demonstrate the
memory reduction on a large example.
Read the full abstract ▾
Optimization and Control · Cross-listed from cs.LG
Lower Bounds and Proximally Anchored SGD for Non-Convex Minimization Under Unbounded Variance
Arda Fazla, Ege C. Kaya, Antesh Upadhyay et al. (+1 more)
Analysis of
Stochastic Gradient Descent (SGD) and its variants typically relies on the assumption of uniformly bounded variance, a condition that frequently fails in practical non-convex settings, such as neural network training, as well as in several elementary optimization settings. While several relaxations are explored in the literature, the Blum-Gladyshev (BG-0) condition, which permits the variance to grow quadratically with distance has recently been shown to be the weakest condition. However, the study of the oracle complexity of
stochastic first-order non-convex optimization under BG-0 has remained underexplored. In this paper, we address this gap and establish information-theoretic lower bounds, proving that finding an $\epsilon$-stationary point requires $\Omega(\epsilon^{-6})$
stochastic BG-0 oracle queries for smooth functions and $\Omega(\epsilon^{-4})$ queries under mean-square smoothness. These limits demonstrate an unavoidable degradation from classical bounded-variance complexities, i.e., $\Omega(\epsilon^{-4})$ and $\Omega(\epsilon^{-3})$ for smooth and mean-square smooth cases, respectively. To match these lower bounds, we consider Proximally Anchored
STochastic Approximation (PASTA), a unified algorithmic framework that couples Halpern anchoring with Tikhonov regularization to dynamically mitigate the extra variance explosion term permitted by the BG-0 oracle. We prove that PASTA achieves minimax optimal complexities across numerous non-convex regimes, including standard smooth, mean-square smooth, weakly convex,
star-convex, and Polyak-Lojasiewicz functions, entirely under an unbounded domain and unbounded
stochastic gradients.
Read the full abstract ▾
All authors Arda Fazla, Ege C. Kaya, Antesh Upadhyay, Abolfazl Hashemi
Metric Geometry
A Lipschitz curve in a Carnot group that is purely unrectifiable by smooth horizontal curves
Gareth Speight and Scott Zimmerman
We construct a Lipschitz curve in the free Carnot group of step 3 with 2 generators that meets every $C^{1}$ horizontal curve in a set of measure zero. This shows that the $C^{1}_{H}$-Lusin property fails in a strong sense in this group, and we deduce that such a curve must be purely $C^1_H$ 1-unrectifiable. Hence 1-rectifiability in Carnot groups is wildly different to its counterpart in Euclidean spaces, wherein the Whitney Extension
Theorem guarantees that Lipschitz rectifiability and $C^1$ rectifiability are equivalent.
Read the full abstract ▾
Differential Geometry
On the Possible Orders of Harmonic Maps into Euclidean Buildings
Christine Breiner and Ben K. Dees
We prove a discreteness result for the possible orders of harmonic maps from surfaces to Euclidean buildings; in particular for a building of type $W$ the order is of the form $\frac mk$ where $k$ divides $|W|$. This generalizes, in the case where the domain has dimension $2$, the "order gap" of Gromov and Schoen. This result follows by directly analyzing the behavior of homogeneous maps into Euclidean buildings, and then studying a related spherical billiards problem.
Read the full abstract ▾
Category Theory
The Operadic Spectrum and Obstructions to Spectral Base Change
Shih-Yu Chang
We introduce an operadic notion of spectrum for
algebras over colored operads in a symmetric monoidal category. The construction is defined via a canonical Hochschild-type object together with an operadic residue, which together encode spectral information in a manner compatible with operadic composition. A central result of this work is that classical spectral invariants do not, in general, admit a natural base change in the operadic setting. More precisely, we show that there is no functorial procedure that transports spectra along strong monoidal functors while preserving their expected structural properties. This establishes a fundamental obstruction to spectral base change. To address this issue, we construct a universal operadic residue object and show that it induces a well-defined and functorial notion of operadic spectrum. We further prove that this construction is canonical and reduces to the classical spectrum in the case of the trivial operad. These results provide a conceptual foundation for spectral theory in operadic and higher algebraic contexts, and clarify the limitations of extending classical spectral invariants beyond the linear setting.
Read the full abstract ▾
Combinatorics
Shuffling the Deck: Invariant Theory and the Graph Reconstruction Conjecture
Emilie Dufresne, Gabriela Jeronimo, Jenny Kenkel et al. (+2 more)
The graph reconstruction
conjecture asserts that every simple graph on at least three vertices is uniquely determined by its deck of vertex-deleted subgraphs. In this expository article we survey the
conjecture and present an invariant-theoretic approach to studying it. The aim is to be able to show that
polynomials that distinguish between decks also distinguish between original graphs, thus translating a graph-theoretic problem into an algebraic one.
Read the full abstract ▾
All authors Emilie Dufresne, Gabriela Jeronimo, Jenny Kenkel, Haydee Lindo, Nelly Villamizar
Algebraic Geometry
Valuatively independent bases for the Fermat family of cubic curves
Jakob Hultgren and Sohaib Khalid
Let $\pi:(X,L)\rightarrow \mathbb D^*$ be the Fermat family of cubic curves in $\mathbb P^2$. For each $k\geq 1$, we construct an explicit valuatively independent basis for $H^0(X,L^k)$ in terms of restrictions of sections in $H^0(\mathbb P^2,\mathcal O_\mathbb P^2(l))$. As a consequence, we get an explicit formula for the canonical tropical theta functions and the canonical cost function defined by any valuatively independent bases of $H^0(X,L^k)$. We show that the canonical tropical theta functions can be described as fundamental solutions to a real Monge-Ampère operator and the canonical cost function can be described intrinsically in terms of the monodromy of a Hessian structure on the essential skeleton. Notably, the canonical tropical theta functions differ from the ones induced by a monomial basis and the canonical cost function differs from the one induced by the ambient projective space.
Read the full abstract ▾
Dynamical Systems
Global dynamics and regime shifts in a resource-consumer model with facilitation and habitat loss
Teodoro Mayayo, Josep Sardanyés and Joan Torregrosa
Modelling how populations respond to habitat loss is crucial for understanding ecosystem stability, especially when positive interactions among resource species, such as plant-plant facilitation, play a key role. Habitat loss not only reduces available organic nutrients and space for primary producers but also disrupts the positive feedbacks that sustain resource populations, thereby affecting consumer persistence and the overall system's stability. We analyse a cubic planar model describing resource-consumer dynamics with facilitation under progressive habitat loss. Our study characterizes the parameter space and enumerates all the phase portraits within the Poincaré disk under ecologically relevant conditions. We show that the system has a unique stable limit cycle and characterize analytically the heteroclinic bifurcation curve involving the collapse of the resource and the consumer, enabling us to determine how the parameter region sustaining coexistence oscillations narrows under habitat destruction. To further explore these dynamics, we construct a piecewise-linear (PWL) approximation that preserves the system's qualitative behaviour, allowing us to obtain an explicit expression for the heteroclinic bifurcation. Finally, we investigate how extrinsic noise affecting the resource species impacts the overall dynamics, showing that stochasticity can anticipate the onset of the heteroclinic bifurcation causing earlier co-extinctions.
Read the full abstract ▾
Geometric Topology
Bounded cohomology classes from differential forms
Gian Maria Dall'Ara, Roberto Frigerio and Ervin Hadziosmanovic
Let $M$ be a complete
hyperbolic $n$-
manifold, $n\geq 2$. Via integration over geodesic simplices, any closed bounded differential 2-form on $M$ defines a bounded
cohomology class in $H^2_b(M)$. It was proved by Barge and Ghys (for $n=2$) and by Battista et al. (for $n>2$) that, if $M$ is closed, then this procedure defines an injective
embedding of the (infinite-dimensional) space of closed differential $2$-forms on $M$ into $H^2_b(M)$. We extend this result to the case when the fundamental group of $M$ is of the first kind, i.e. its limit set is equal to the whole boundary at infinity of
hyperbolic space (this holds, for example, when $M$ has finite volume). Our argument is different from Barge and Ghys' original one, and relies on the following fact of independent interest: an $L^\infty$ function on the
hyperbolic plane is determined by its integrals over all ideal triangles. We prove this fact by way of
Fourier analysis on the
hyperbolic plane.
Read the full abstract ▾
Analysis of PDEs
Phase transitions in Doi-Onsager, Noisy Transformer, and other multimodal models
Kyunghoo Mun and Matthew Rosenzweig
We study phase transitions for repulsive-attractive mean-field free energies on the circle. For a $\frac{1}{n+1}$-periodic interaction whose
Fourier coefficients satisfy a certain decay condition, we prove that the critical coupling strength $K_c$ coincides with the linear stability threshold $K_\#$ of the uniform distribution and that the phase transition is continuous, in the sense that the uniform distribution is the unique global minimizer at criticality. The proof is based on a sharp coercivity estimate for the free energy obtained from the constrained Lebedev–Milin inequality. We apply this result to three motivating models for which the exact value of the phase transition and its (dis)continuity in terms of the model parameters was not fully known. For the two-dimensional Doi–Onsager model $W(\theta)=-|\sin(2\pi\theta)|$, we prove that the phase transition is continuous at $K_c=K_\#=3\pi/4$. For the noisy
transformer model $W_\beta(\theta)=(e^{\beta\cos(2\pi\theta)}-1)/\beta$, we identify the sharp threshold $\beta_*$ such that $K_c(\beta) = K_\#(\beta)$ and the phase transition is continuous for $\beta \leq \beta_*$, while $K_c(\beta)<K_\#(\beta)$ and the phase transition is discontinuous for $\beta > \beta_*$. We also obtain the corresponding sharp dichotomy for the noisy Hegselmann–Krause model $W_{R}(\theta) = (R-2\pi|\theta|)_{+}^2$ .
Read the full abstract ▾
Mathematical Physics · Cross-listed from quant-ph
How to unitarily map between any two pure states with a single closed-form exponential
Peter T. J. Bradshaw, Marcus Gouveia and Jonte R. Hance
It is well-known that any two pure
quantum states (in the same
Hilbert space) can be mapped to any other using
unitary transformations. However, previous approaches to this problem required two explicit bases for the
Hilbert space, one each for the initial and target states, and thus their complexity necessarily scales with the dimension of the
Hilbert space. In this Letter, we show how to utilize novel algebraic methods to construct a closed-form exponential
unitary transformation which achieves this in general, using only a single
unitary generator. This construction is independent of any bases and agnostic to the dimension of the
Hilbert space. We highlight the usefulness of this tool for studying relationships between systems of pure states in
quantum information theory, as well in elementary analyses of
quantum circuits and
unitary operators.
Read the full abstract ▾
Dynamical Systems · Cross-listed from cs.LG
Geometric regularization of autoencoders via observed stochastic dynamics
Sean Hill and Felix X.-F. Ye
Stochastic dynamical systems with slow or metastable behavior evolve, on long time scales, on an unknown low-dimensional
manifold in high-dimensional ambient space. Building a reduced simulator from short-burst ambient ensembles is a long-standing problem: local-chart methods like ATLAS suffer from exponential landmark scaling and per-step reprojection, while autoencoder alternatives leave tangent-bundle geometry poorly constrained, and the errors propagate into the learned drift and
diffusion. We observe that the ambient covariance~$\Lambda$ already encodes coordinate-invariant tangent-space information, its range spanning the tangent bundle. Using this, we construct a tangent-bundle penalty and an inverse-consistency penalty for a three-stage pipeline (chart learning, latent drift, latent
diffusion) that learns a single nonlinear chart and the latent SDE. The penalties induce a function-space metric, the $\rho$-metric, strictly weaker than the Sobolev $H^1$ norm yet achieving the same chart-quality generalization rate up to logarithmic factors. For the drift, we derive an encoder-pullback target via Itô's formula on the learned encoder and prove a bias decomposition showing the standard decoder-side formula carries systematic error for any imperfect chart. Under a $W^{2,\infty}$ chart-convergence assumption, chart-level error propagates controllably to weak convergence of the ambient dynamics and to convergence of radial mean first-passage times. Experiments on four surfaces embedded in up to $201$ ambient dimensions reduce radial MFPT error by $50$–$70\%$ under rotation dynamics and achieve the lowest inter-well MFPT error on most surface–transition pairs under metastable Müller–Brown Langevin dynamics, while reducing end-to-end ambient coefficient errors by up to an order of magnitude relative to an unregularized autoencoder.
Read the full abstract ▾
Algebraic Geometry
All Quiet on the Exceptional Locus
Ari Krishna
We study admissible subcategories of the bounded derived category of a smooth projective surface that are supported on the exceptional locus of a birational morphism. We prove that if $f:X\to Y$ is a birational morphism of smooth projective surfaces, then every admissible subcategory of $D^b(X)$ supported on $\operatorname{Exc}(f)$ is generated by a finite exceptional collection. Moreover, if $K_Y$ is nef, then the same conclusion holds for every admissible subcategory of $D^b(X)$ supported on a proper closed subset of $X$. As a consequence, no nonzero phantom or quasi-phantom subcategory on such a surface can have proper support. The proof combines a splitting lemma for admissible subcategories inside a semiorthogonal decomposition with a single exceptional block, Orlov's blow-up formula, and Pirozhkov's support
theorem.
Read the full abstract ▾
Combinatorics · Cross-listed from cs.DS
Parallelizing the branch-and-bound with isomorphism pruning algorithm for classifying orthogonal arrays
Dursun Bulutoglu
We provide a method for parallelizing the branch-and-bound with isomorphism
pruning algorithm developed by Margot [Symmetric ILP: Coloring and small integers, Discrete Optimization (4) (2007), 40-62]. We apply our method to classify orthogonal arrays. For classifying all non-OD- equivalent OA(128, 9, 2, 4) and OA(144, 9, 2, 4) our method results in linear speedups. Finally, our method enables classifying all non-OD-equivalent OA(192, k, 2, 4) for k = 9, 10, 11 for the first time.
Read the full abstract ▾
Combinatorics
Multisymmetric functions on eventually constant cyclic graphs
Radford Green, Cornell Holmes and Mee Seong Im
The study of spanning trees and related structures is central in graph theory, closely connected to understanding functions between finite sets. This paper generalizes the established relationship between rooted trees and eventually constant endomorphisms to a wider context including $k$-tuples of functions among $k$ disjoint vertex sets. We derive a weighted count of eventually constant $k$-tuples, which are characterized by their stabilization to constancy upon iterated composition. This construction is the set-theoretic analogue of the nilpotent cone and offers new insight into the combinatorial structure of cyclic digraphs. By identifying these $k$-tuples with their induced digraphs, we construct explicit formulas for their generating
polynomials and analyze the cardinality of the set of eventually constant $k$-tuples. These
polynomials are multisymmetric in $k$ sets of variables and can be re-expressed as the character of a representation of the product of general linear groups. We extend the ideas to the more general structures of eventually $N$-cyclic and $\lambda$-cyclic $k$-tuples, which we define and provide similar
theorems for their generating functions and cardinality.
Read the full abstract ▾
Mathematical Physics
Universal dualities for Wilson loops in lattice Yang-Mills
Thibaut Lemoine
We identify a universal finite-$N$ structure underlying Wilson loop expectations in
lattice Yang–Mills, in any dimension $d\geq 2$, for gauge group $\mathrm{U}(N)$, and for arbitrary smooth central plaquette actions. The starting point is a state-sum expansion in plaquette labels by irreducible representations, in which each term factorizes into an action-dependent spectral weight and an action-independent topological coefficient. We then analyze these coefficients in three exact ways: as a gauge/string expansion over decorated spanning surfaces, as a local
spin-foam/channel model on the dual incidence graph, and as a universal finite-$N$ master loop equation that closes on the coefficient side. As a consequence, several recent Wilson-action results are recovered as specializations of our broader action-agnostic framework. In a companion work, this framework is used to construct the higher-dimensional heat-kernel master field at strong coupling and to prove an area-law bound.
Read the full abstract ▾
Analysis of PDEs
Jet-Density of Finite-Gap Solutions for Classes of BKM Systems
Manuel Quaschner and Wijnand Steneker
We show that jets of initial data can be approximated up to arbitrary order by finite-gap solutions for classes of so-called BKM systems of PDEs introduced by Bolsinov–Konyaev–Matveev, which include classical PDEs such as KdV, Kaup–Boussinesq and Camassa–Holm. Finite-gap solutions are obtained via a finite-reduction map, defined algebraically, which sends solutions of a Stäckel system to solutions of the BKM PDE. For the classes containing KdV and Kaup–Boussinesq we obtain full jet-surjectivity via a triangular structure, whereas for the class containing Camassa–Holm we establish jet-surjectivity on an open set of initial data over $\mathbb{R}$ and a Zariski-open (dense) set over $\mathbb{C}$.
Read the full abstract ▾
Mathematical Physics · Cross-listed from hep-th
Batalin-Vilkovisky quantization with an angular twist
Djordje Bogdanović, Marija Dimitrijević Ćirić and Richard J. Szabo
We construct cubic scalar field theory on $\lambda$-Minkowski space by combining the Batalin-Vilkovisky formalism with harmonic analysis, and produce two inequivalent noncommutative
quantum field theories. The braided theory is based on a braided $L_\infty$-
algebra whereby covariance dictates a spectral decomposition into cylindrical Bessel functions that diagonalise the angular Drinfel'd twist; in this theory we find the usual logarithmic ultraviolet divergences and confirm the absence of UV/IR mixing. The standard noncommutative theory is based on a classical $L_\infty$-
algebra; in this theory we relate the spectral decompositions into plane wave and cylindrical harmonic eigenmodes of the Klein-Gordan operator, we verify the planar equivalence
theorem, and we demonstrate a periodic form of UV/IR mixing in which non-planar correlators are generically ultraviolet finite but become non-analytic on an infinite
lattice of exceptional momenta.
Read the full abstract ▾
Statistics Theory
Simultaneous Inference for Covariance and Precision Matrices of Long-Range Dependent Time Series
Percy S. Zhai, Mladen Kolar and Wei Biao Wu
For time series with long-range temporal dependence, inference for covariance and precision
matrices is non-trivial. We propose a Berry-Esseen type Gaussian approximation result that gives a finite-sample bound for the Kolmogorov distance between the infinity norms of the estimation error of sample covariance
matrix and the corresponding Gaussian approximation. The method utilizes martingale and m-dependent approximation and relies on constructing triadic blocks. We also establish a bootstrapping result with block sampling method, which preserves validity despite strong temporal dependence. Our results on covariance allow ultra-high-dimensional settings where the dimension of time series can grow sub-exponentially with sample size. Similar results can be built for precision
matrix under low-dimensional settings. No assumption is required on the structure of covariance and precision
matrices.
Read the full abstract ▾
Algebraic Geometry
Log-Conformal Projective Manifolds
Maurício Corrêa and Alex Massarenti
Let $(X,\Delta)$ be a smooth complex projective simple normal crossing pair of dimension $n\ge 3$ endowed with an everywhere nondegenerate logarithmic conformal tensor. If $K_X+\Delta$ is not nef, then exactly one of the following occurs: $\Delta=\varnothing$ and $X\simeq Q^n$; $X\simeq\mathbb{P}^n$ and $\Delta$ is a hyperplane; or $n=2m$ and $(X,\Delta)$ admits a $(K_X+\Delta)$-negative elementary contraction $\phi:X\to Y$ generated by minimal rational curves of conformal degree one. In the third case, if $\dim Y>0$, then for some $1\le s\le m$ one has $\dim Y=m-s+1$ and the
geometric generic fiber is $(\mathbb{P}^{m+s-1},H_1+\cdots+H_s)$, where the $H_i$ are hyperplanes in general position; over a dense open subset, $\phi$ is a projective bundle and the horizontal boundary is the sum of $s$ relative hyperplanes. The case $s=1$ yields a rational maximal isotropic fibration with generic fiber $(\mathbb{P}^m,H)$; if $\dim Y=0$, then $\rho(X)=1$ and $-(K_X+\Delta)$ is ample. If $K_X+\Delta\equiv0$, then, under a Bochner extension principle, a restricted-holonomy condition, and trivial monodromy of the induced flat connection on $X\setminus\Delta$, a logarithmic conformal tensor with trivial conformal line bundle forces $X\setminus\Delta$ to be semi-abelian and $(X,\Delta)$ to be its toroidal compactification.
Read the full abstract ▾
Information Theory · Cross-listed from quant-ph
Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays
Chen Zhao, Casey Duckering, Andi Gu et al. (+2 more)
Quantum error correction is widely believed to be essential for large-scale
quantum computation, but the required
qubit overhead remains a central challenge.
Quantum low-density parity-check codes can substantially reduce this overhead through high-rate encodings, yet finite-size instances with practical logical error rates often achieve encoding rates only around or below $1/10$. Here, building on a recent ultra-high-rate construction by Kasai, we identify new structural conditions on the underlying affine permutation
matrices that make encoding rates exceeding $1/2$ compatible with efficient implementation on reconfigurable neutral atom arrays. These conditions define a co-designed family of ultra-high-rate
quantum codes that supports efficient syndrome extraction and atom rearrangement under realistic parallel control constraints. Using a hierarchical decoder with high accuracy and good throughput, we study the performance under a
circuit-level noise model with $p=0.1\%$, achieving per-logical-per-round error rates of $1.3_{-0.9}^{+3.0} \times 10^{-13}$ with a $[[2304,1156,\leq 14]]$ code and $2.9_{-1.5}^{+3.1} \times 10^{-11}$ with a $[[1152,580,\leq 12]]$ code. We compare these codes against a heuristic Pareto frontier for finite-blocklength codes relating block length, encoding rate, and logical error rates, and find that our codes lie near the frontier. These results approach the teraquop regime, highlighting the promise of this code family for practical ultra-high-rate
quantum error correction.
Read the full abstract ▾
All authors Chen Zhao, Casey Duckering, Andi Gu, Nishad Maskara, Hengyun Zhou