Mathematical Physics
Quantum Relative Entropy and the Mean-Field Limit
Gaoyue Guo, Hao Liang and Zhenfu Wang
We develop a
quantum relative
entropy method for the mean-field limit of
quantum many-body systems. For closed systems governed by the von Neumann equation, we prove a quantitative stability estimate between the $N$-body density
matrix and the tensorized solution of the Hartree equation. The argument is based on an
entropy production identity, a cancellation mechanism for the centered two-body fluctuation, and a combinatorial estimate controlling the remaining mixed moments. As a consequence, we obtain propagation of chaos in trace norm for fixed marginals. We further combine the
entropy estimate with known semiclassical Wasserstein bounds to derive a convergence estimate that is uniform in the Planck constant in an appropriate joint mean-field and semiclassical regime. Finally, we extend the method to finite-dimensional open
quantum systems governed by Lindblad dynamics. In this setting, we establish an analogous relative
entropy estimate for general bounded two-body interactions, where the mean-field potential is defined through partial trace. This shows that the
entropy method does not rely on any special tensor-product decomposition of the interaction.
Read the full abstract ▾
Representation Theory
Semisimplicity Criteria for algebras with a Jones Basic Construction
Frederick M. Goodman and Hans Wenzl
We prove a semisimplicity criterion for a large class of
algebras by a new method. This can be applied to Brauer, BMW, and $q$-Brauer
algebras.
Information Theory
On Codes with Support-Constrained Parity Checks
Barron Han, Hikmet Yildiz and Babak Hassibi
We study linear codes that maximize minimum distance subject to arbitrary support constraints on the parity-check
matrix. Such constraints arise naturally in the design of LDPC codes, locally repairable codes, and hardware-constrained systems where each parity check must involve only a limited number of code symbols. They are also essential in
quantum error correction, where sparse stabilizers reduce measurement noise and respect the connectivity constraints of physical
qubit architectures. We derive the optimal minimum distance possible given support constraints on the parity-check
matrix and show it is achievable over sufficiently large fields. When this maximum distance coincides with the Singleton bound for unconstrained parity check
matrices, the dual GM-MDS construction yields generalized Reed–Solomon codes obeying the mask. In the generator-
matrix setting, the GM-MDS
theorem guarantees that the optimal distance can always be achieved by a subcode of a generalized Reed–Solomon code while satisfying arbitrary support constraints. We show that this is not true for the parity-check setting. We exhibit a set of support constraints, derived from the vertex-edge incidence of $K_{6,6}$, for which the optimal minimum distance cannot be realized by any subcode of a generalized Reed–Solomon code over any field. We also analyze structured constraint families – regular, balanced, and cyclic masks – through numerical optimization, providing design guidance for practical code constructions.
Read the full abstract ▾
Dynamical Systems
Invariant measure for double base expansions
Wenduo Huang, Vilmos Komorni and Yuru Zou
Given a pair $Q=(q_0,q_1)\in(1,\infty)^2$ with $q_0+q_1\ge q_0q_1$, a sequence $(c_i)\in\set{0,1}^\infty$ is called a $Q$-expansion of $x$ if<br/>\begin{equation*}<br/>x=\sum_{i=1}^{\infty}\frac{c_i}{q_{c_1}\cdots q_{c_i}}.<br/>\end{equation*}<br/>We primarily study the dynamical properties of the greedy and lazy maps, which are the piecewise-linear maps on the interval $I_Q=[0,\,1/(q_1-1)]$ defined by the corresponding
algorithms for $Q$-expansions. <br/>We show that the greedy and lazy maps each of which has a unique absolutely continuous invariant probability measure, equivalent to the Lebesgue measure on the intervals<br/>\begin{equation*}<br/>\left[0,\frac{q_0}{q_1}\right)\qtq{and}\left(\frac{q_1}{q_0(q_1-1)}-1,\frac{1}{q_1-1}\right],<br/>\end{equation*}<br/>respectively. <br/>Furthermore, the corresponding dynamical systems are exact on $I_Q$. <br/>As a dynamical consequence, under the stronger condition $q_0+q_1>q_0q_1$ the set of points having unique $Q$-expansions has Lebesgue measure zero, and almost every $x\in I_{Q}$ admits a continuum of $Q$-expansions.
Read the full abstract ▾
Numerical Analysis
Decoupling scales via localized subspace iteration and temporal splitting for multiscale parabolic equations
Eric T. Chung, Lijian Jiang, Mengnan Li et al. (+1 more)
Simulating
diffusion in heterogeneous media presents a significant computational challenge, as resolving microscopic physical scales traditionally demands excessively fine computational grids. To overcome this barrier, we extend the Localized Subspace Iteration (LSI) framework to multiscale
parabolic equations. The proposed method constructs optimal, low-dimensional trial spaces by iteratively approximating the dominant eigenspaces of local inverse operators via Localized Standard Subspace Iteration (LSSI) or Localized Krylov Subspace Iteration (LKSI). Because these LSI basis functions are inherently tailored to capture the slow-decaying, low-frequency modes of the
parabolic solution, they naturally suppress error accumulation over long-term integration. To further improve computational efficiency, we decouple the basis construction into an offline phase and implement a contrast-independent, partially explicit temporal splitting scheme for online time-stepping. By explicitly advancing the dominant macroscopic modes while implicitly treating high-frequency microscopic corrections, this scheme guarantees stability without imposing restrictive time-step constraints. We establish rigorous a priori error estimates in both the energy and $L^2$ norms. Numerical experiments illustrate the accuracy and efficiency of the LSI framework, particularly highlighting the LKSI method's advantages in handling high-contrast, complex multiscale media.
Read the full abstract ▾
All authors Eric T. Chung, Lijian Jiang, Mengnan Li, Yajun Wang
Probability
Moderate deviations for the Maki–Thompson rumour model
Shaochen Wang and Guangyu Yang
We consider the classical Maki–Thompson rumour model with $n$ initially ignorant individuals and one initial spreader. The final number of ignorants, divided by $n$, is known to satisfy the law of large numbers, the central limit
theorem and the large deviation principle. We establish a moderate deviation principle for fluctuations of this proportion of order $b_n/\sqrt n$, where $b_n\to\infty$ and $b_n^2=o(\log n)$. The proof rests on the exact final-size distribution, sharp asymptotics for the associated automata numbers, and a uniform point probability expansion at the moderate deviation scale. Numerical comparisons of both tails illustrate the intermediate scale and the effect of early extinction on upper tail probabilities.
Read the full abstract ▾
Probability
On the sum-of-digits measures and Cusick's conjecture via stopped random walks
Dawid Tarłowski
Let $s(n)$ denote the number of ones in the binary expansion of a natural number $n\in\mathbb{N}$. For any $t\in\mathbb{N}$ and $d\in\mathbb{Z}$, let $\mu_t(d)$ denote the asymptotic density of the set of those natural numbers $n$ for which $s(n+t)-s(n)=d$. The $\mu_t$ are properly defined probability measures on $\Z$, and the Cusick
conjecture states that $\mu_t(\mathbb{N})>\frac{1}{2}$ for any $t\in\mathbb{N}$. We investigate the properties of the family $\{\mu_t\}_{t\in\N}$ by reindexing the odd integers via a suitable partial order. This construction leads to a nonautonomous dynamics on pairs of probability measures on $\Z$, which represents the process of growing a tree. The associated stopped random walk allows a transparent structural description of those measures, including their support,
symmetries, variance, and an asymptotic dichotomy between the central limit
theorem and the almost sure convergence. Next, we focus on the median-preserving property of this process, and show that the Cusick
conjecture is a special case of a more general claim about the asymmetric
evolution of the associated binary trees, which we support numerically.
Read the full abstract ▾
Information Theory · Cross-listed from cs.AI
Generalization Bounds of Emergent Communications for Agentic AI Networking
Yong Xiao, Jingxuan Chai, Guangming Shi et al. (+1 more)
The
evolution of 6G networking toward agentic AI networking (AgentNet) systems requires a shift from traditional data pipelines to task-aware, agentic AI-native communication solutions. Emergent communication, a novel communication paradigm in which autonomous
agents learn their own signaling protocols through interaction, is increasingly viewed as a promising solution to address the challenges posed by existing rigid, predefined protocol-based networking architecture. However, most existing emergent communication frameworks fail to account for physical networking constraints, such as bandwidth and computational complexity, and often lack a rigorous information-theoretical foundation. To address these challenges, this paper introduces a novel emergent communication framework that facilitates collaborative task-solving among heterogeneous
agents through an information-theoretic lens. We propose a novel joint loss function that unifies the optimization of decision-making functions and the learning of communication signaling. Our proposed solution is grounded on the multi-
agent and multi-task distributed information bottleneck (DIB) theory, which allows the quantification of the fundamental trade-off between task-relevant information representation and computational complexity. We further provide theoretical generalization bounds of the emergent communication protocol during decentralized inference across unseen environmental states. Experimental validation on a real-world hardware prototype confirms that our proposed framework significantly improves generalization performance, compared to the state-of-the-art solutions.
Read the full abstract ▾
All authors Yong Xiao, Jingxuan Chai, Guangming Shi, Ping Zhang
Information Theory
Fluid Antennas Assisted RIS-NOMA Communication Networks
Xinwei Yue, He Geng, Jingjing Zhao et al. (+3 more)
This paper introduces a fluid
antenna system (FAS) into reconfigurable intelligent surface (RIS) assisted non-orthogonal multiple access (NOMA) communication networks, where the non-orthogonal users are equipped with planar fluid
antennas. Specifically, we formulate a sum rate maximization problem for FAS-RIS-NOMA networks, which jointly optimizes the fluid ports, the RIS deployment, and the phase shift
matrix. To solve the resulting non-convex optimization problem involving highly coupled variables, an iterative
algorithm based on alternating optimization is employed to decompose the original problem into three subproblems. Exhaustive search is employed for optimizing the fluid ports, particle swarm optimization is used for the RIS deployment, and semidefinite relaxation with successive convex approximation is adopted for optimizing the phase shift
matrix. Finally, the simulation results show that: 1) compared with traditional
antenna systems and orthogonal multiple access, the FAS-RIS-NOMA networks achieve higher system throughput under high signal-to-noise ratio conditions; and 2) by increasing the number of RIS elements and enlarging the FAS size, the sum rate of FAS-RIS-NOMA networks can be significantly enhanced.
Read the full abstract ▾
All authors Xinwei Yue, He Geng, Jingjing Zhao, Xianli Gong, Aryan Kaushik, Arumugam Nallanathan
Category Theory · Cross-listed from cs.LO
Sheaves as a Means of Maintaining Consistency in Model-based Systems Engineering
Josh Gibson
We propose that the sheaf condition on a presheaf of design spaces provides a mathematical model for multi-view consistency in the architecture of cyber-physical systems (CPS). In model-based systems engineering, multiple engineering views – electrical, thermal, mechanical, and software – must be kept mutually consistent, yet current practice relies on informal procedures without a precise semantic account of global consistency. We construct an architectural site: a topological space whose points are pairwise interfaces between engineering domains and whose open sets represent engineering views. A design presheaf assigns to each view its local design space and to each inclusion the corresponding restriction map. We show that the sheaf condition on this presheaf is equivalent to compatibility on pairwise overlaps, yielding a local criterion for global multi-view consistency. The equivalence and a concrete three-view worked example are machine-verified in Lean 4 using Mathlib. The formalization establishes that the design presheaf is a sheaf, that the sheaf condition is equivalent to pairwise overlap compatibility, and that compatible local design families glue to unique global designs. Global consistency of an arbitrary number of views can be certified by checking only pairwise interface compatibility; compatible local designs determine a unique global design; derived properties computed by limit-preserving functors inherit the same consistency guarantee; and the entire verification chain admits machine-checkable proofs in Lean.
Read the full abstract ▾
Group Theory
On finite groups containing an element whose Engel sink is small
Evgeny Khukhro and Pavel Shumyatsky
For an element $g$ of a group $G$, a right Engel sink of $g$ is a subset of $G$ containing all sufficiently long commutators $[...[[g ,x],x],\dots ,x]$ for all $x\in G$. A left Engel sink of $g$ is a subset of $G$ containing all sufficiently long commutators $[...[[x ,g ],g ],\dots ,g]$ for all $x\in G$. Using the classification of finite simple groups we prove that if a finite group $G$ has an element $g$ such that $G=[G,g]$, then the order of $G$ is bounded in terms of a right Engel sink of $g$, as well as in terms of a left Engel sink of $g$. Earlier Guralnick and Tracey proved this in the case where $g$ is an involution without using the classification.
Read the full abstract ▾
Combinatorics
Intersecting families with covering number three II
Peter Frankl and Jian Wang
A family $\mathcal{F}\subset \binom{[n]}{k}$ is called intersecting if $F\cap F'\neq \emptyset$ for all $F,F'\in \mathcal{F}$. The covering number of a family $\mathcal{F}$ is defined as the minimum size of $T\subset [n]$ such that $T\cap F\neq \emptyset$ for all $F\in \mathcal{F}$. In 1980, the first author proved that for sufficiently large $n$, any intersecting $k$-graph $\mathcal{F}$ with covering number at least three, satisfies $|\mathcal{F}|\leq \binom{n-1}{k-1}-\binom{n-k}{k-1}-\binom{n-k-1}{k-1}+\binom{n-2k}{k-1}+\binom{n-k-2}{k-3}+3$. There was very little progress during more than forty years but recently (cf. \cite{FW25}) with a completely different approach we proved the same result for the full range $n\geq 2k$ and $k\geq 7$. In this short paper we prove the same inequality for all the remaining cases.
Read the full abstract ▾
Representation Theory
Young tableau descriptions for the polyhedral realizations of crystal bases in type $A_n$
Shaolong Han
By utilizing the combinatorial properties of various tableau models, we establish an explicit correspondence between the polyhedral realizations of the
crystal bases $\mathcal B(\lambda)$ (resp. $\mathcal B(\infty)$) of type $A_n$ and the reverse semi-standard Young tableaux (resp. reverse marginally large tableaux), thereby providing a combinatorial description of the corresponding polyhedral realizations. Furthermore, a
crystal structure on the set of Gelfand-Tsetlin patterns is obtained via the correspondence between the polyhedral realization of $\mathcal{B}(\lambda)$ and the reverse tableaux. As applications of our framework, we present concrete combinatorial realizations of the
crystal embedding of $\mathcal B(\lambda)$ into $\mathcal B(\infty)$ and the set of Lusztig data.
Read the full abstract ▾
Algebraic Geometry
Kodaira dimension of algebraic fiber spaces over threefolds : Part 1
Houari Benammar Ammar
We study the behavior of the Kodaira dimension of algebraic fiber spaces over threefolds. We prove some cases of the Iitaka
Conjecture $C_{n,3}$, including certain situations where the base variety is a Calabi–Yau threefold.
Group Theory
Length parameters of finite groups and their Hall subgroups
Evgeny Khukhro and Pavel Shumyatsky
Let $\pi$ be a set of
primes containing $2$ and an odd
prime $p$. It is proved that if a finite group $G$ has a
Hall $\pi$-subgroup $H$, then the non-$p$-soluble length of $G$ is bounded above by the generalized Fitting height of $H$. The proof uses the fact, obtained in [4] using the classification of finite simple groups, that a finite simple group of order divisible by $p$ cannot have a nilpotent
Hall $\{2,p\}$-subgroup. As a corollary, it is proved that if in addition $H$ is soluble, then the non-$p$-soluble length of $G$ is bounded above by $2l_2(H)+1$, where $l_2(H)$ is the $2$-length of $H$.
Read the full abstract ▾
Information Theory · Cross-listed from cs.AR
FLARE: One-Shot PE-Level Fault Localization in Systolic Arrays via Algebraic Test Vectors
Logashree Venkatasubramanian, Zishen Wan and Viveck Cadambe
Systolic arrays are the dominant compute fabric for neural network inference. Prior work has addressed column-level fault detection efficiently with uniform test patterns, but row-level (PE-level) fault localization within a faulty column remains open without resorting to hardware redundancy. The fundamental obstacle is that uniform test inputs destroy per-row signatures: any test that activates every row equally cannot distinguish which row is the source of an observed deviation. In this paper, we propose a lightweight, purely algorithmic remedy based on coprime test vectors. By assigning pairwise coprime integers as test-input entries, a permanent weight-register fault produces a deviation whose divisibility signature uniquely identifies the faulty row. Under a general bounded error model, a single test pass localizes the faulty row with high probability. This error model covers a broader class of faults than what prior dataflow-aware testing work has primarily emphasized. When one round is insufficient, a second pass using a ratio computation achieves exact localization; for the special case of single-bit errors, odd coprime entries guarantee exact localization in one round. For INT16 arithmetic, a single test pass covers array sizes up to $256{\times}256$ with localization probability above $0.98$, at a test cost under $1\%$ of one inference GEMM tile.
Read the full abstract ▾
Optimization and Control
Optimal Acceleration for Proximal Minimization of the Sum of Convex and Strongly Convex Functions
Govind M. Chari, Uijeong Jang, Ernest K. Ryu et al. (+1 more)
When minimizing the sum of a convex and a strongly convex function, or when finding the zero of the sum of a monotone operator and a strongly monotone operator, Chambolle and Pock (2010) and Davis and Yin (2015) proposed accelerated mechanisms that achieve an $\mathcal{O}(1/N^2)$ convergence rate for the squared distance to the solution, but the optimality of this rate was not established. In this work, we present Fast Douglas–Rachford Splitting (FDR), an accelerated method that improves the constants established in the prior works, and provide a complexity lower bound establishing that both the $\mathcal{O}(1/N^2)$ convergence rate and the leading-order constant of FDR's rate are optimal.
Read the full abstract ▾
All authors Govind M. Chari, Uijeong Jang, Ernest K. Ryu, Behçet Aç{\i}kmeşe
Commutative Algebra
Cohen-Macaulayness of formal fibers and dimension of local cohomology modules
Tran Do Minh Chau
Let $(R, \mathfrak{m} )$ be a Noetherian local ring, $M$ a finitely generated $R$-module of dimension $d$. Set $\mathfrak{a}(M):=\mathfrak{a}_0(M)\cdots \mathfrak{a}_{d-1}(M)$, where $\mathfrak{a}_i(M):={\rm Ann}_RH^i_{\mathfrak{m}}(M)$ for $i\geq 0$. In this paper, we study the Cohen-Macaulayness of formal fibers of $R$ in the relation with the dimension ${\rm dim} (R/\mathfrak{a}(M)).$ We prove that ${\rm dim} (R/\mathfrak{a}(M))<d$ if and only if $R/\mathfrak{p}$ is unmixed and the generic formal fiber of $R/\mathfrak{p}$ is Cohen-Macaulay for all $\mathfrak{p}\in{\rm Supp}_R(M)$ with ${\rm dim} (R/\mathfrak{p})=d.$ In general, $R/\mathfrak{p}$ is unmixed and the generic formal fiber of $R/\mathfrak{p}$ is Cohen-Macaulay for all $\mathfrak{p}\in{\rm Supp}_R(M)$ with ${\rm dim} (R/\mathfrak{p})>{\rm dim} (R/\mathfrak{a}(M)).$ As applications, we explore the structure of local rings and the dimension, the closedness of non Cohen-Macaulay locus of finitely generated modules.
Read the full abstract ▾
Analysis of PDEs
On the Existence of Boundary Layer Separation for Incompressible Fluid Flow in the Half-Space
Tongkeun Chang and Kyungkeun Kang
We consider the Stokes system in the half-space with localized boundary data. We prove that a boundary layer separation point exists provided that a certain singular integral determined by the boundary data is negative. On the other hand, if this integral is strictly positive, then boundary layer separation does not occur. When boundary layer separation occurs, we also investigate the dynamics of the separation point and the sign of the pressure gradient. Furthermore, by a perturbation argument, we construct solutions to the Navier–Stokes equations in the half-space that exhibit the same qualitative behavior as in the Stokes case.
Read the full abstract ▾