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)

Sunday 3 May

Number Theory

Gaps in Multiplicative Sidon Sets

For a positive integer $n$, let $g(n)$ denote the infimum of all real numbers $L$ such that there exists a multiplicative Sidon set $A\subseteq\{1,2,\dots,n\}$ that intersects every interval $[x,x+L]\subseteq[1,n]$. Sárközy asked for estimates on $g(n)$, and he in particular asked whether one has $g(n)\le\sqrt n$ for every $n\in\mathbb{N}$. We first show that this estimate does indeed hold, with a proof that was autonomously discovered and formally verified in Lean by Aristotle. Next, we improve the upper bound further and, with $\rho = \frac{13-\sqrt{69}}{10} < 0.47$, prove that $g(n)\ll_{\varepsilon} n^{\rho+\varepsilon}$ for every $\varepsilon > 0$.
Read the full abstract

Analysis of PDEs

Quantitative Estimates for Mean-Field Limits and Correlation Functions through a Duality Framework

We investigate the mean-field limit for interacting particle systems through a duality-based framework and obtain quantitative estimates on the convergence of marginals as well as on correlation functions. The analysis applies to second-order Vlasov systems with pairwise interactions under a mean-field scaling and relies on a hierarchy of dual cumulants associated with the particle dynamics. In particular, for merely square–integrable interaction forces, we derive the natural fluctuation–scale rate $\mathcal{O}(N^{-1/2})$. By introducing an iterative argument on the hierarchy of dual cumulants, we leverage this bound to recover the optimal mean-field rate $\mathcal{O}(N^{-1})$ and to obtain robust estimates on the dual cumulants, at the expense of corresponding regularity assumptions on the interaction kernel. Finally, using the relation between dual and direct correlations, we transfer these bounds to direct cumulants, yielding refined information on correlations and deviations from chaos. The approach provides a unified framework for simultaneously controlling the mean-field limit and the higher-order correlation structure of the particle system.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Fault-tolerant quantum processing of physical experiments

Quantum computers may reveal features of Nature inaccessible to conventional experiments, but manipulating raw quantum data introduces noise that degrades inference even when the processor is fault-tolerant, creating a data-input bottleneck for robust quantum learning. Here we show that quantum fault tolerance can substantially improve the sample complexity of learning from noisy experiments. We encode unknown quantum states from physical experiments into protected quantum memory, enabling fault-tolerant implementations of quantum learning algorithms otherwise degraded by errors. Using this quantum uploading procedure, we prove that noisy randomized measurement and multi-copy learning tasks can be performed exponentially faster than by any adaptive strategy that does not immediately encode physical states into error-corrected memory. These separations are not simply due to a reduced effective noise rate: they hold even when uploading is substantially noisier than the bare experimental interface, rigorously establishing immediate encoding as the optimal approach to noise-robust learning. We numerically illustrate the speedups in astronomical imaging, where quantum processing of uploaded photons locates an exoplanet obscured by a bright star using orders of magnitude fewer shots than unencoded baselines. Our results establish a robust interface between quantum computers and natural systems, enabling powerful and practical quantum-enhanced experiments.
Read the full abstract

Differential Geometry

A Calabi-Yau Metric on the Kummer Surface

We prove the existence of a Ricci flat metric on the Kummer K3 surface. The proof follows the general strategy of Donaldson's gluing construction. However, we tackle the analysis without appealing to weighted norms or conformal transformations to model spaces, instead relying solely on compact elliptic theory on usual Hölder and Sobolev spaces. As the Eguchi-Hanson space plays a central role in the construction, we also present and compare different descriptions of this space, showing explicitly that it is isometric to a suitable Gibbons-Hawking ansatz.
Read the full abstract

Information Theory

Optimization of CV-QKD Under Practical Constraints

Using reinforcement learning, we optimize for practical hardware constraints, including limited FIR filter taps at the transmitter and receiver, mean photon number and finite DAC/ADC resolution. Under these realistic conditions, the proposed approach achieves significant performance improvements.
Read the full abstract

All authors Svitlana Matsenko, Amirhossein Ghazisaeidi, Marcin Jarzyna, Konrad Banaszek, Darko Zibar

Functional Analysis

Continuously Frame-Convertible Sequences

Frame theory provides a robust method for recovering vectors in a Hilbert space from inner product data, though the associated decomposition formula can be computationally demanding. We relax the frame condition by studying sequences that can be continuously mapped to Parseval frames, yielding a similar reconstruction formula. We characterize such sequences in terms of their analysis operators, without reference to any continuous mapping. We present examples, including sequences that are not complete and those containing no frame sequence. We also give norm-based criteria for when unconditional Schauder sequences and finite unions of bounded unconditional Schauder sequences admit this property. Finally, we classify finite Borel measures on the torus for which the standard exponential system has this property and forms a Riesz Fischer sequence.
Read the full abstract

Analysis of PDEs

Serrin's overdetermined theorem and weak Bernoulli laws without Alt–Caffarelli regularity

We study distributional Bernoulli-type conditions in geometrically irregular domains $\Omega$. Here the zero extension of $u$ to $\mathbb{R}^n$ satisfies $$ \Delta u \;=\; c\,\mathcal{H}^{n-1}\!\lfloor_{\partial^*\Omega}\;-\;f(u)\,\mathbf{1}_\Omega\,dx $$ in the distributional sense. This is a weak version of the one-phase Bernoulli free boundary condition, which avoids the uniform Lipschitz/density assumptions of classical Alt–Caffarelli theory. We prove that for every $n \ge 2$ and every $f \in C^2(\mathbb{R})$ with $f(0)>0$, there exist bounded, non-spherical, finite-perimeter domains $\Omega\subset \mathbb R^n$ satisfying this distributional Bernoulli law with $$ 0<\mathcal H^{n-1}(\partial^*\Omega)<\infty, \qquad \mathcal H^{n-1}(\partial\Omega\setminus\partial^*\Omega)=0, $$ yet $$ {\rm ess}\sup_{x\in\partial^*\Omega} \sup_{0<r<1} \frac{\mathcal H^{n-1}(B_r(x)\cap\partial^*\Omega)}{r^{n-1}} =\infty. $$ This shows the key constraint is not absence of a reduced boundary, but failure of uniform all-scale surface density bounds. For $f \equiv 1$, these results yield counterexamples to the weak Serrin-type overdetermined problems in all dimensions, proving the distributional Bernoulli law alone cannot replace the uniform growth/density conditions core to Alt–Caffarelli theory. On the other hand, we prove a planar rigidity result: Within the Smirnov class, the associated harmonic quadrature identity forces $\Omega$ to be a disk. Thus, for the constant-source Serrin/Bernoulli law, Smirnov regularity is the threshold for weak Bernoulli rigidity in $\mathbb R^2$, while uniform upper density bounds form the threshold for $n\ge 3$ according to [23].
Read the full abstract

Commutative Algebra

Quasi-Gorenstein morphisms of commutative local dg-algebras

We introduce quasi-Gorenstein morphisms of commutative local dg-algebras and use a Gorenstein version of the virtually small property to characterize them, a result which is new even for homomorphisms of local rings. In a different direction, we characterize exact sequences in a noetherian local ring, in the sense of Avramov, Henriques, and Şega, in terms of quasi-Gorenstein morphisms involving Koszul complexes.
Read the full abstract

Information Theory

Channel-coded Over-the-Air Computation

AirComp enables efficient wireless data aggregation, however, its computation accuracy is vulnerable to channel impairments. As a promising solution, the role of redundancy for AirComp has been largely unexplored, leaving a critical gap in reliable AirComp design. To address this, we propose a channel-coding scheme tailored for AirComp that preserves the aggregation structure while mitigating channel impairments through bandwidth expansion. We show that the computation error decreases with the coding rate and can vanish. Both theoretical and simulation results demonstrate that the proposed scheme significantly improves computation performance.
Read the full abstract

Probability

A revision of Litvak's conjecture on Gaussian minima and a volumetric zone conjecture

Litvak (2018) conjectured that, for any $p > 0$, the quantity $\mathbb{E}[\min_{i = 1}^n |g_i|^p]$ where $g \sim \mathcal{N}(0, \Sigma)$ is a centered Gaussian random vector is minimized among $n \times n$ correlation matrices $\Sigma$ by the Gram matrix of the regular simplex in $\mathbb{R}^{n - 1}$. We disprove this conjecture: the matrix with entries $\Sigma^{\mathrm{cos}}_{ij}=\cos(\pi(i - j) / n)$ already achieves a smaller moment for $p = 2$ and $n = 4$. We propose that $\Sigma^{\mathrm{cos}}$ is in fact the correct minimizer of these moments for all $p > 0$ and $n \geq 1$. Towards proving this, we conjecture a volumetric extension of Fejes Tóth's zone conjecture (1973), whose covering version was proved by Jiang and Polyanskii (2017). Conditional on this conjecture, we show the stronger result that $\min_{i = 1}^n |g_i|$ for $g \sim \mathcal{N}(0, \Sigma^{\mathrm{cos}})$ is stochastically dominated by $\min_{i = 1}^n |h_i|$ for $h \sim \mathcal{N}(0, \Sigma)$ for any $n \times n$ correlation matrix $\Sigma$. Our counterexample $\Sigma^{\mathrm{cos}}$ was found by the AlphaEvolve AI-assisted optimization system, and we also include a brief discussion of its application to such problems.
Read the full abstract

Analysis of PDEs

Existence and multiplicity of solutions for a critical Grushin problem with a singular nonlinearity

We investigate the existence and multiplicity of positive solutions to the problem \begin{equation} \begin{cases} \begin{aligned} - \Delta_{\gamma} u &= \lambda u^{p} + u^{-\delta} &\quad \text{in } \Omega, \quad u &= 0 &\quad \text{on } \partial \Omega, \end{aligned} \end{cases} \end{equation} where $\Delta_{\gamma}$ denotes the Grushin operator defined by \begin{equation} \Delta_{\gamma} := \Delta_x + (1+\gamma)^2 |x|^{2\gamma}\Delta_y, \end{equation} with $\gamma>0$, $z=(x,y)\in \mathbb{R}^N$, $N=n+m$, $n \geq 1$, $m\geq 1$, $\Omega \subset \mathbb{R}^N$ a smooth bounded domain, $\lambda>0$, $1<p<\infty$, and $\delta>0$. The analysis depends on the exponent $p$, which may be subcritical, critical, or supercritical, that is, $p<2_\gamma^*-1$, $p=2_\gamma^*-1$, or $p>2_\gamma^*-1$, respectively, where $2_\gamma^*=\frac{2Q}{Q-2}$ is the critical Sobolev exponent associated with the Grushin operator, and $Q=m+(1+\gamma)n$ is the corresponding homogeneous dimension.
Read the full abstract

Optimization and Control

Multi-Agent Motion Planning for Simultaneous Arrival using Time-Reversed Search and Distributed Optimal Control

In this work we consider the multi-agent motion planning (MAMP) problem with the constraint that agents arrive at their respective goals at the same time. For the special case where all agents are initially at rest we propose a two-step method for finding optimized and kinematically feasible solutions. The first step finds an initial feasible solution by applying a state-of-the-art MAMP algorithm (conflict-based search and safe interval path planning with interval projection) backward. The algorithm is complete, and we provide necessary conditions for when it is also optimal. The second step is an improvement step where a receding-horizon optimal control problem (OCP) is posed and the solution found in the first step is used to warm-start the solver. To improve scalability we propose to solve the OCP in a distributed manner using the nonlinear alternating direction method of multipliers (NADMM). We evaluate the proposed framework in numerical experiments on a car-like vehicle. The results show that the backward planning algorithm successfully finds feasible and collision-free solutions, and that the improvement step further improves the quality of the solutions. Compared to solving the OCPs in a centralized manner, using nonlinear ADMM reduces the computation time.
Read the full abstract

Information Theory · Cross-listed from eess.SP

Benchmarking Wireless Representations: High-Dimensional vs. Compressed Embeddings for Efficiency and Robustness

Building on recent advances in representation learning for wireless channels, this work investigates the cost-benefit trade-offs of high-dimensional channel embeddings in practical systems. We benchmark multiple wireless representations: high-dimensional learned embeddings from a wireless foundation model, compact autoencoder-based representations with significantly lower dimensionality, and raw data baselines, evaluating their performance across diverse downstream tasks. We then systematically analyze data efficiency, noise robustness, and computational complexity, explicitly characterizing the resource overhead associated with high-dimensional embeddings. Beyond standard tasks such as line-of-sight/non-line-of-sight (LoS/NLoS) classification and beam selection, we introduce power allocation as a new downstream task. Our results reveal clear trade-offs: while high-dimensional embeddings can perform well in few-shot regimes for certain tasks, they incur substantial latency and parameter overhead. In contrast, compressed latent representations learned by autoencoders demonstrate improved noise robustness and more stable performance across tasks, while significantly reducing computational and transmission costs.
Read the full abstract

All authors Murilo Batista, Shirin Salehi, Saeed Mashdour, Paul Zheng, Rodrigo C. de Lamare, Anke Schmeink

Geometric Topology

Equivariantly Slice Knots in Symmetric 4-Manifolds

We study the equivariant 4-genus of strongly invertible knots in the $S^3$ boundary of 4-manifolds with involution. We provide techniques for constructing slice disks for knots in various symmetric 4-manifolds via an equivariant version of Marengon and Mihajlovic̀'s tubing construction. Using these techniques, we show that this equivariant 4-genus can differ from the standard 4-genus function of the 4-manifold as well as the equivariant 4-genus of $S^4$. As an example, we show that $S^2\times S^2$ admits an involution such that the figure $8$ knot is equivariantly slice with respect to one of its two strong inversions but not the other.
Read the full abstract

Probability

Glauber dynamics for random field Ising models on bounded degree graphs and MLSI

We study the ferromagnetic random field Ising model (RFIM) on a graph $G=(V,E)$ having maximal degree $\Delta$, where the external field at each vertex is an i.i.d. random variable. When the random field distribution is sufficiently anti-concentrated, we prove that with high probability over the quenched randomness of the external field, the Glauber dynamics of this RFIM mixes in polynomial time as a consequence of a Poincaré inequality. This model is relevant to the Griffiths phase where the correlations decay exponentially fast in expectation over the quenched random field, but contraction does not hold point-wise due to the existence of weak fields that lead to low-temperature behavior. Previously, fast mixing of Glauber dynamics under large disorder was only proven on the integer lattice, and for RFIM on general graphs, only a sampling algorithm based on self-avoiding walks was known. Under a further technical condition that the random fields are bounded, we prove a modified log-Sobolev inequality for the Glauber dynamics. When the random field is weaker but still satisfies weak spatial mixing (exponential decay of correlations from boundary to bulk) in expectation, and the graph has at most $\alpha$-stretched exponential growth for some $\alpha<1$, then we prove a weak Poincaré inequality holds, which gives rise to a polynomial time sampling algorithm based on Glauber dynamics with warm start. The latter result was previously proven for the integer lattice, and we extend its scope to graphs with only a volume growth condition without assuming a local geometry.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

Ergosphere Geometry and Thermodynamic Properties of Boosted Kerr-Taub-NUT Solutions in Kaluza-Klein Theory

We investigate rotating black holes obtained by applying a Kaluza-Klein boost to the Kerr-Taub-NUT spacetime and study the resulting four-dimensional geometry and thermodynamics after dimensional reduction. The boost along the compact direction generates an Einstein-Maxwell-Dilaton black hole in which the electric charge originates purely from higher-dimensional momentum rather than from an independent matter source. We demonstrate that the coordinate location of the stationary limit surface, defined by the condition $g_{tt}=0$ in the Einstein frame, is invariant under the Kaluza-Klein boost. Nevertheless, the boost induces a substantial enlargement of the physical ergoregion, as measured by the proper spatial volume on constant-time hypersurfaces, through its modification of the induced spatial metric. We further verify the first law of black-hole thermodynamics with both the electric and magnetic Kaluza-Klein work terms included – the latter being a genuinely dyonic feature generated by the interplay of the boost with the NUT charge – and carefully distinguish the seed mass parameter from the asymptotic ADM mass and from the horizon Komar mass. Our results establish a clear separation between boost-invariant horizon thermodynamics and boost-dependent global geometric properties. In particular, higher-dimensional momentum enhances the effective inertial-frame rotation measured by ZAMOs and ergoregion volume without altering the horizon radius, entropy, or temperature, providing a clean geometric signature of extra dimensions in rotating black hole spacetimes.
Read the full abstract

Optimization and Control · Cross-listed from cs.RO

Optimized and kinematically feasible multi-agent motion planning

Multi-agent motion planning (MAMP) is an important problem for autonomous systems with multiple agents. In this work we propose a two-step method for finding optimized and kinematically feasible solutions to MAMP problems. The first step finds an initial feasible solution using state-of-the-art methods such as conflict-based search (CBS) or priority-based search (PBS), and the second step is an improvement step which improves the solution by solving a multi-phase optimal control problem (OCP) where the initial solution is used to warm-start the solver. We also propose a method for generating motion primitives in an optimized way under the constraint that the primitive durations are all multiples of the same sample time. We evaluate our proposed framework on a MAMP problem for tractor-trailer systems. We extend the safe interval path planning with interval projections (SIPP-IP) algorithm so it can handle more general cost functions and larger agents, but our results show that for the tractor-trailer system a simple lattice-based planner performs better due to less conservative collision checks. Our experiments also indicate that CBS performs better than PBS for this system as it achieves a higher success rate in environments with obstacles and had a lower average runtime, although both planners achieve solutions of similar quality after the improvement step.
Read the full abstract

Information Theory

Real-Time Text Transmission via LLM-Based Entropy Coding over Fixed-Rate Channels

Learning, prediction, and compression are intimately connected: a model that accurately predicts the next symbol in a sequence can be coupled with a source coder to compress that sequence near its information-theoretic limit. When tokenized characters arriving at a fixed reading pace are encoded into variable-length codewords and streamed over a fixed-rate channel, a queue forms whose per-token delay depends on the mean and variance of the bit lengths and on the coder's algorithmic latency. This paper investigates the compression–delay tradeoff that arises when a causal language model serves as the sequential predictor within a predict-then-code architecture for real-time text transmission. Several coding schemes are compared: Shannon (ideal), Huffman, arithmetic coding, rANS at various block sizes, and gzip. The analysis separates algorithmic delay, inherent to the coder, from computational delay, which shrinks as hardware improves. Huffman is the practical choice for over-provisioned channels, with zero algorithmic delay and modest compression overhead. Arithmetic coding achieves near-optimal compression at the cost of decodability delay. Findings are validated across two scales: GPT-2 (124M) and Llama~3.2 (3B), a twenty-five-fold parameter range. This scaling yields an approximately 38% reduction in bits per character, effectively over-provisioning the channel and thereby changing which coder is optimal.
Read the full abstract

All authors Vishnu Teja Kunde, Jean-Francois Chamberland, Krishna R. Narayanan, Jamison Ebert

Algebraic Geometry

Flat Cohomological Purity for Syntomic Schemes over Valuation Rings

Grothendieck's cohomological purity predicts that the cohomology of a scheme is insensitive to removing a closed subscheme of sufficiently high codimension. In this article, we establish a form of flat cohomological purity over arbitrary (possibly infinite-rank) mixed-characteristic valuation rings $V$, thereby extending the theorem of Česnavičius–Scholze to the non-noetherian setting. More precisely, for a flat finite-type scheme over $V$ with local complete intersection fibres, we prove that the cohomology with coefficients in a commutative finite locally free group scheme remains unchanged after removing a closed subscheme satisfying a suitable fibrewise codimension condition; in particular, we obtain vanishing in low degrees and injectivity in the critical degree. As applications, we deduce purity results for local cohomology, for torsion in the Picard group, and for the Brauer group. In higher rank, our results yield sharper bounds than those previously obtained by Bhatt–Lurie and Madapusi–Mondal. The argument rests on recent advances in the structure theory of valuation rings.
Read the full abstract

Mathematical Physics

A constructive approach to generalized principal connections

We address the recently introduced notions of generalized principal bundle and generalized principal connection by keeping track of global geometric properties through local coordinate transformation laws. This approach leads us to introduce generalized principal bundle coordinates and to find their transformation laws. Besides, we show that any Lie group fiber bundle (and hence, in particular, any vector bundle) is a generalized principal bundle and we give a proof of the fact that any Lie group fiber bundle with connected typical fiber is an associated bundle to a suitable principal bundle. Moreover, we present a direct way to characterize Lie group fiber bundle connections and generalized principal connections in terms of horizontal lifts and of local conditions. Finally, we recover in our setting some already known results, including that generalized principal connections are associated only to Lie group fiber bundle connections and that they reduce to usual principal connections on standard principal bundles. Our results are needed in order to understand how generalized principal connections might fit in the fiber bundle treatment of classical field theories, aiming towards a notion of generalized gauge theory.
Read the full abstract

Analysis of PDEs

Sets of finite perimeter on Riemannian manifolds and stochastic completeness

We prove a heat semigroup characterization of the total variation for compactly supported ${\rm BV}$ on arbitrary smooth complete weighted Riemannian manifolds, extending the main result in \cite{GP15}. We then provide an example of a weighted manifold where such equivalence does not hold for a large class of sets of finite perimeter.
Read the full abstract

Geometric Topology

A constructive solution to the equivalence problem for knot projectivizations

The problem of whether different projectivizations of the same affine knot $K\subset\mathbb{S}^3$ are equivalent in $\mathbb{R}\mathbb{P}^3$ can be found in [11] and has also been posed as an open question in [15]. In this note we provide a constructive solution to the problem. In particular, we adapt an idea due to A. Hatcher developed in the realm of embedding spaces and we describe an algorithm that produces an explicit isotopy between any two given projectivizations of the same affine knot. More generally, we introduce the notion of lensification of a knot in any lens space $L(p,q)$ and describe an algorithm that works in that more general setting, of which $\mathbb{R}\mathbb{P}^3\simeq L(2,1)$ is a particular instance. Finally, we apply this algorithm to several pairs of knots from the literature for which the equivalence problem was raised as an open question, finding explicit isotopies.
Read the full abstract

Complex Variables

Invariant metrics of model domains near pseudoconcave points

We give precise estimates of some holomorphically invariant infinitesimal metrics near a pseudoconcave points in a wide family of “model” domains for that situation in $\mathbb C^2$. This extends to metrics (rather distances) the authors' previous results from arXiv:2503.19754 and also takes into account defining functions more general than just power functions.
Read the full abstract

Probability

High-dimensional limits for reflected Brownian motion in the orthant

We study interacting Brownian particles on the half-line whose interaction occurs through boundary local times at the origin. The particle system is given by \[ X_i^n(t)=X^n_{0,i}+W_i^n(t)+L_i^n(t) +\frac{1}{n-1}\sum_{j\ne i}\rho^n_{ij}L_j^n(t), \qquad i\in[n],\ t\ge0, \] where the initial conditions are exchangeable, the driving Brownian motions $W_i^n$ are i.i.d., and $L_i^n$ denotes the boundary local time of $X_i^n$ at zero. For each fixed coefficient array $\{\rho^n_{ij}\}$, the system can be viewed as a semimartingale reflected Brownian motion in the orthant. We first consider the homogeneous case $\rho^n_{ij}=a$. In this case, global well-posedness holds under the completely-$\mathcal S$ condition $a>-1$. We prove propagation of chaos under this condition; the subregime $a\in(-1,0]$, in the homogeneous setting, was previously covered as part of the results of \cite{baker2025particle}. The limiting process is the nonlinear reflected Brownian motion \[ \bar X(t)=\bar X_0+\bar W(t)+\bar L(t)+a\mathbb E[\bar L(t)], \qquad t\ge0. \] We also treat heterogeneous random coefficients $\rho^n_{ij}$, assumed to have mean $a$, support in a compact subset of $(-1,1)$, and to be independent across $j$ for each $i$. In both the quenched and annealed settings, the particle system converges to the same McKean–Vlasov limit as in the homogeneous case. The model is motivated by large Jackson networks in heavy traffic.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

Yvonne Choquet-Bruhat 1923-2025

This is a memorial article for Yvonne Choquet-Bruhat, who was one of the great pioneers of mathematical general relativity and of partial differential equations. Starting with her 1952 result on local existence of solutions of the vacuum Einstein field equations, she obtained many results on the Einstein evolution equations, the Einstein constraint equations, and the equations of supergravity. Her methods have also been important for numerical relativity. She also wrote several textbooks and a memoir. An abridged version of this article has been submitted to AMS Notices.
Read the full abstract

All authors Lydia Bieri, Jean-Pierre Bourguignon, David Garfinkle, James Isenberg

Combinatorics · Cross-listed from quant-ph

Schur States and Many-Body Quantum Walks on Line Graphs

Let $H$ be a finite simple graph. A one-particle continuous-time quantum walk on its line graph $\ell H$ has one mode for each edge of $H$. This paper is a corrected and reorganized account of that setting. We first record the matrix encoding of an edge-amplitude vector, its Schur state. The encoding is necessarily complex symmetric if it is to be complex linear and to retain the global phase, and it is normalized by $1/\sqrt{2}$. It is unitary for the Frobenius inner product and is closed under a canonical tensor lift to the categorical product of graphs. The tensor lift also pins down the convention. Among all unimodular phase variants the symmetric choice is the only one that survives, and every relaxed variant reduces to a sign. We then replace the labelled tensor-power description by the bosonic and fermionic Fock spaces over $\ell^2(EH)$, and assemble the standard free-particle apparatus in the form used afterwards. This covers the occupation-number basis, the second-quantized line-graph Hamiltonian, permanent and determinant formulae for many-particle transition amplitudes, and the one-particle reduced density matrix. The one graph-theoretic input is the even-Eulerian criterion, which is the zero-sum $2$-flow criterion of Wang and Hu, recalled here with a short proof to fix conventions. Its translation through the incidence identity gives a real equimodular full-support $-2$ eigenmode of $A(\ell H)$, and hence bosonic condensates of energy $-2N$ that are uniform over the edges of $H$. The fermionic case is stated separately so that the Pauli constraint is explicit.
Read the full abstract

Combinatorics

An Algebraic Approach to the Arithmetic of Square Tilings

It is a classical result dating back to Dehn (1903) that squares tiling a rectangle must have rational side lengths. However, bounding the arithmetic complexity of these tilings, specifically the growth of their denominators, is an active area of research. Recent contributions have tackled these arithmetic constraints through the complexity of planar multigraphs and Diophantine approximations. In this paper, we offer an algebraic perspective of this problem by encoding the tiling's geometry into a block matrix. This approach allows us to reduce geometric constraints to a finite set of additive relations. By exploiting the total unimodularity of interval matrices (Ghouila-Houri, 1962), we provide a self-contained proof that the least common multiple of the denominators is bounded by $2^n$ in two dimensions, where $n$ is the order of the tiling. Furthermore, because we can naturally generalizes this matrix to represent $d$-dimensional hypercube tilings, yielding a bound of $d^n$. We demonstrate the utility of this framework by providing a brief proof of Richard Kenyon's 1996 theorem regarding the minimum number of squares required to tile an integer rectangle.
Read the full abstract

Information Theory

Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes

Quantum low-density parity-check (QLDPC) codes offer a promising route to scalable fault-tolerant quantum computation, but their performance under iterative decoding is strongly influenced by short-cycle structure and other harmful subgraphs in the associated Tanner graphs. This paper develops an algebraic framework for constructing and analyzing (Q)LDPC codes from dyadic and quasi-dyadic matrices-translation-invariant $2^\ell \times 2^\ell$ binary matrices specified compactly by a signature row and forming a commutative ring with recursive block structure. Leveraging this structure, we relate cycles in lifted Tanner graphs to tailless backtrackless closed walks in the protograph and derive efficient, implementable methods to enumerate and control short cycles (notably $4$-, $6$-, and $8$-cycles). We introduce dyadic-aware PEG-style construction algorithms that use forbidden sets of shifts to maximize attainable girth when possible and otherwise minimize the multiplicity of the shortest cycles at the target girth. Motivated by error-floor phenomena, we further characterize and explicitly enumerate absorbing sets in key dyadic layout boundary cases, identifying configurations that induce abundant $(a,0)$-absorbing sets. Finally, we propose CSS-oriented dyadic constructions that satisfy commutation constraints by design and demonstrate via belief-propagation simulations that reducing short-cycle multiplicity can yield substantial decoding gains even when girth cannot be increased.
Read the full abstract

All authors Anthony Gómez-Fonseca, Gretchen L. Matthews, Kirsten D. Morris, Tefjol Pllaha

Analysis of PDEs

A sharp hypocoercive entropy decay estimate for underdamped Langevin dynamics

We study the underdamped Langevin dynamics with invariant measure $\mu(\,\mathrm{d}x\,\mathrm{d}v)\propto \mathrm{e}^{-U(x)-\lvert v\rvert^2/2}\,\mathrm{d}x\,\mathrm{d}v$. Assume that the position marginal $\mu_x(\,\mathrm{d}x)\propto \mathrm{e}^{-U(x)}\,\mathrm{d}x$ satisfies a logarithmic Sobolev inequality with constant $\rho>0$, and that $U$ is convex on $\mathbb{R}^d$ and satisfies some growth conditions. We introduce a modified entropy approach with a Wasserstein entropy-current corrector \begin{equation*} \mathcal H_\epsilon(g)=\operatorname{Ent}_\mu(g) +\epsilon\int \Pi_v(v\,g)\cdot\bigl(x-T_q(x)\bigr)\,\mu_x(\mathrm{d}x), \end{equation*} where $\Pi_v$ denotes averaging over the velocity variable against the standard Gaussian $\kappa(\mathrm{d}v)=(2\pi)^{-d/2}\mathrm{e}^{-\lvert v\rvert^2/2}\,\mathrm{d}v$, $q=\Pi_v g$ is the position marginal density of $g$, and $T_q$ is the Brenier optimal transport map from $q\mu_x$ to $\mu_x$. For friction $\gamma=\Gamma\sqrt\rho$ with $\Gamma>0$, and for any initial law $p_0$ with finite relative entropy, if $p_t$ denotes the law of underdamped Langevin dynamics at time $t$, we establish the explicit entropy decay \begin{equation*} \operatorname{Ent}(p_t\mid\mu) \leq \frac{1+\theta}{1-\theta}\,\mathrm{e}^{-\Lambda t}\,\operatorname{Ent}(p_0\mid\mu), \qquad t\ge0, \end{equation*} with rate \begin{equation*} \Lambda=\frac{\theta}{2(1+\theta)}\sqrt\rho, \qquad \theta=\min\Bigl\{\tfrac{\Gamma}{12},\tfrac{1}{4\Gamma}\Bigr\}. \end{equation*} In particular, the entropy convergence rate has optimal $\sqrt\rho$ order.
Read the full abstract

Information Theory

SwiftChannel: Algorithm-Hardware Co-Design for Deep Learning-Based 5G Channel Estimation

Channel estimation is crucial in 5G communication networks for optimizing transmission parameters and ensuring reliable, high-speed communication. However, the use of multiple-input and multiple-output (MIMO) and millimeter-wave (mmWave) in 5G networks presents challenges in achieving accurate estimation under strict latency requirements on resource-limited hardware platforms. To address these challenges, we propose SwiftChannel, an algorithm-hardware co-design framework that integrates a hardware-friendly deep learning-based channel estimator with a dedicated accelerator. Our approach employs a convolutional neural network enhanced with a parameter-free attention mechanism, which effectively reconstructs full-resolution spatial-frequency domain channel matrices from low-resolution least squares (LS) estimates. We further develop a multi-stage model compression pipeline combining knowledge distillation, convolution re-parameterization, and quantization-aware training, resulting in substantial model size reduction with negligible accuracy loss. The hardware accelerator, implementing the compressed model and the LS estimator on FPGA platforms using High-level Synthesis (HLS), features a fine-grained pipeline architecture and optimized dataflow strategies. Tested on a Zynq UltraScale+ RFSoC, the accelerator achieves sub-millisecond latency, providing up to 24x speed-up and over 33x improvement in energy efficiency compared to GPU-based solutions. Extensive evaluations demonstrate that the proposed design generalizes not only across various noise levels and user mobilities, but also to a variety of unseen channel profiles, outperforming state-of-the-art baselines. By unifying algorithmic innovation with hardware-aware design, our work presents a future-proof channel estimation solution for 5G MIMO systems.
Read the full abstract

All authors Shengzhe Lyu, Yuhan She, Di Duan, Tao Ni, Yu Hin Chan, Chengwen Luo, Ray C. C. Cheung, Weitao Xu