Representation Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Sunday 19 April
In [4], we use the root categories to realize Chevalley groups. Lusztig's theory of total positivity for reductive groups can be naturally applied to Chevalley groups. In this paper, we explicitly determine regions of $\mathbb{R}_{>0}^t$ for describing the size of monoids of totally positive elements, with respect to the root subgroups corresponding to the indecomposable objects in the root category.
Probability
Ergodic properties of the harmonic process
In this paper we study detailed fluctuation results for a class of non-equilibrium steady states. The main example is the boundary driven harmonic model \cite{frassek2022exact}. In this model, the non-equilibrium steady state (NESS) is a mixture of products of geometric distributions, of which the local parameters are in turn distributed as uniform order statistics. For such a NESS, we prove law of large numbers, central limit theorem and large deviation results for fields of a general local functions (generalizing the density field). We also obtain quantitative results on the deviation from local equilibrium.
Read the full abstract
Number Theory
Resolutions of spaces of crystalline representations and modularity
We introduce a new partial resolution of crystalline spaces of Galois representations when the gaps in Hodge–Tate weights are smaller than $p$, with no bound on ramification. Furthermore, when $n =3$ in the case of minimal regular weight, we are able to show that the resolution is normal (assuming the ramification index is divisible by 3). Employing base change techniques and further analysis of the resolution, we are able to show that all the components of the crystalline deformation rings are potentially diagonalizable. As a consequence, we deduce automorphy lifting, the weight part of Serre's conjecture, and the Breuil-Mézard conjecture in dimension three for minimal regular weight.
Read the full abstract
Group Theory
Complete Isocategorical Classification of Groups of Order 64 via GAP
The classification of finite groups under monoidal equivalence is a fundamental topic in the study of finite quantum groups. While a complete classification has been established for all groups of order strictly less than 64, the case for order 64 has remained limited to the construction of specific examples. In this study, we achieve the complete classification for groups of order 64 by developing an original computational approach using GAP. We describe our methodology and demonstrate that there exist exactly two pairs of non-isomorphic isocategorical groups of this order.
Read the full abstract
Optimization and Control
Beyond the Bellman Fixed Point: Geometry and Fast Policy Identification in Value Iteration
Q-value iteration (Q-VI) is usually analyzed through the \(\gamma\)-contraction of the Bellman operator. This argument proves convergence to \(Q^*\), but it gives only a coarse account of when the induced greedy policy becomes optimal. We study discounted Q-VI as a switching system and focus on the practically optimal solution set (POSS), the set of \(Q\)-functions whose tie-broken greedy policies are optimal. The main result shows that Q-VI reaches the optimal action class in finite time by entering an invariant tube around \(\mathcal X_1=Q^*+\operatorname{span}(\mathbf 1)\), which is contained in the POSS. For every \(\varepsilon>0\), the distance to \(\mathcal X_1\) satisfies an exponential bound with rate \((\bar\rho+\varepsilon)^k\), where \(\bar\rho\) is the joint spectral radius of the projected switching family restricted to directions transverse to \(\mathcal X_1\). When \(\bar\rho<\gamma\), this transverse convergence is faster than the classical contraction rate. The analysis separates fast policy identification from the subsequent convergence to \(Q^*\), which may still be governed by the all-ones mode. We also give spectral and graph-theoretic conditions under which the strict inequality \(\bar\rho<\gamma\) holds or fails.
Read the full abstract
Geometric Topology · Cross-listed from hep-th
Refined 3D index
We introduce a refined version of the 3D index for 3-manifolds, building on the construction of the 3D $\mathcal{N}=2$ gauge theory $T[M]$ by Dimofte-Gaiotto-Gukov and Gang-Yonekura. The refined index is a superconformal index of $T[M]$ equipped with additional gradings that capture enhanced flavor symmetries of the effective theory. Our construction is based on a Dehn surgery presentation of $M$ in terms of an ideally triangulated link complement $N$. We derive an explicit infinite-sum formula for the refined index and provide nontrivial checks in representative examples, supporting its invariance under changes of triangulation, Dehn surgery presentation, and other auxiliary data. As a strictly stronger invariant, the refined index enables finer distinctions among 3-manifolds and among distinct IR phases of the associated gauge theories. We also introduce a computational tool, Refined Index Calculator, for its explicit evaluation.
Read the full abstract
Group Theory
Quandles from gauge transformations
In this paper, we investigate a quandle structure induced by an augmented rack arising from a gauge transformation group. We construct a quandle from a principal bundle and its discrete generalization. When we see a group as a (discrete) principal bundle over a point, this quandle becomes equivalent to the generalized Alexander quandle for its inner automorphism. Moreover, we construct a Lie and Noether quandle structure from a smooth gauge transformation.
Read the full abstract
Number Theory
Orderings of Generalized k-Markov Numbers
A $k$-Markov number is a positive integer that appears in a positive integral solution to the Diophantine equation $x^2 + y^2 + z^2 + k(xy + xz + yz) = (3+3k)xyz$. This equation was introduced by Gyoda and Matsushita. When $k =0$, this definition recovers that of ordinary Markov numbers. The set of $k$-Markov numbers can be indexed by pairs of coprime positive integers. There is a consistent way to label non-coprime pairs with positive integers as well, yielding a larger set of “generalized $k$-Markov numbers.” In this paper, we classify lines along which the generalized $k$-Markov numbers grow monotonically, extending work in the ordinary case by Lee-Li-Rabideau-Schiffler and by the second author. We find that, as $k$ grows, the $k$-Markov numbers are more likely to be monotonic along a random line. This gives evidence that a $k$-version of Frobenius' uniqueness conjecture, which has been proposed by Gyoda and Maruyama, could be true.
Read the full abstract
Information Theory
About Optimal Prefix Codes over Countably Infinite Alphabets: Probabilistic Intervals for the Codeword Lengths Assignment
For the discrete memoryless sources with a countably infinite alphabet, we prove that for any positive integer $k$, there exists a corresponding probability interval such that if the largest symbol probability $p_{1}$ falls in this interval, the optimal code length for the symbol equals $k$. Furthermore, for infinite sources, we provide a criterion to determine probability distributions whose optimal code length assignment follows the pattern $l^{best}_{i}=i$, for $i\ge 1$. Compared with the existing conclusion for anti-uniform sources, the proposed criterion requires less information for verification.
Read the full abstract
Representation Theory
Graded characters, demazure multiplicities, and chebyshev polynomials
In this paper, we study numerical multiplicities of Demazure modules in the excellent filtration of $\mathfrak{sl}_2[t]$-modules $V(\xi)$, where $V(\xi)$ denotes the fusion product associated to a partition $\xi$. We express generating functions for the numerical multiplicities of level $m$ Demazure modules in excellent filtrations of $V(\xi)$ in terms of quotients of Chebyshev polynomials, thereby generalizing earlier results for fat hook partitions. We also revisit the graded multiplicities of irreducible $\mathfrak{sl}_2$-modules in $V(\xi)$ and provide a new and self-contained proof of their description in terms of cocharge Kostka–Foulkes polynomials. While this connection has been established in earlier works, our approach is elementary and relies only on recursive structures arising from short exact sequences of fusion products. As a consequence, we obtain a direct and self-contained derivation of the graded characters of $V(\xi)$ in terms of Hall–Littlewood polynomials with coefficients given by cocharge Kostka–Foulkes polynomials.
Read the full abstract
Functional Analysis
The Adams trace theorem for product Morrey spaces
By using a Hedberg-type inequality, the Adams trace inequality is extended from Lebesgue spaces to product Morrey spaces.
Read the full abstract
Information Theory
CSI Compression for Massive MIMO-OFDM: Mismatch-Aware Rate-Distortion Trade-offs
We study channel state information (CSI) compression for wideband frequency division duplex massive multiple-input multiple-output (MIMO) when the base station (BS) reconstructs CSI using an imperfect covariance model. Under matched second-order statistics, remote rate–distortion theory yields transform coding with reverse water-filling (RWF) over covariance eigenmodes. With decoder-side covariance mismatch, however, this allocation is no longer end-to-end optimal. We derive an achievable mismatched Gaussian rate–distortion characterization based on a Gaussian test channel and a mismatched minimum mean square error (MMSE) reconstruction rule. In a shared-eigenvector regime (common eigenbasis, mismatched eigenvalues), the problem decouples across modes and leads to a robust reverse water-filling (RRWF) allocation computable via bisection and per-mode root finding. Simulations using wideband massive MIMO covariance models show that RRWF consistently improves reconstruction distortion and end-to-end mean square error relative to conventional RWF under mismatch.
Read the full abstract
Combinatorics
Elementary symmetric polynomials and a potentially injective family of maps on partitions
In this article, we provide an infinite family of examples to disprove a recent conjecture due to Ballantine and her collaborators on the injectivity of a class of maps, namely pre_k, defined on integer partitions. These maps arise from applying the sequence of elementary symmetric polynomials to integer partitions, where pre_k is associated with the kth polynomial. Subsequently, we state a modified version of their conjecture. Throwing fresh light on these class of maps, we study the inter-relationships between them, deviating from the approaches so far, which study these maps one at a time. Though one case of the conjecture (k=2) has now been settled independently by the work of Ballantine and collaborators, and Li, we provide alternate proofs of three subcases corresponding to this settled case. We also discuss lower bounds for the number of partitions of n which are in the image of the map pre_2.
Read the full abstract
Statistics Theory
Algorithmic Contiguity from Low-Degree Heuristic II: Predicting Detection-Recovery Gaps
The low-degree polynomial framework has emerged as a powerful tool for providing evidence of statistical-computational gaps in high-dimensional inference. For detection problems, the standard approach bounds the low-degree advantage through an explicit orthonormal basis. However, this method does not extend naturally to estimation tasks, and thus fails to capture the detection-recovery gap phenomenon that arises in many high-dimensional problems. Although several important advances have been made to overcome this limitation \cite{SW22, SW25, CGGV25+}, the existing approaches often rely on delicate, model-specific combinatorial arguments. In this work, we develop a general approach for obtaining conditional computational lower bounds for recovery problems from mild bounds on low-degree testing advantage. Our method combines the notion of algorithmic contiguity in \cite{Li25} with a cross-validation reduction in \cite{DHSS25} that converts successful recovery into a hypothesis test with lopsided success probabilities. In contrast to prior unconditional lower bounds, our argument is conceptually simple, flexible, and largely model-independent. We apply this framework to several canonical inference problems, including planted submatrix, planted dense subgraph, stochastic block model, multi-frequency angular synchronization, orthogonal group synchronization, and multi-layer stochastic block model. In the first three settings, our method recovers existing low-degree lower bounds for recovery in \cite{SW22, SW25} via a substantially simpler argument. In the latter three, it gives new evidence for conjectured computational thresholds including the persistence of detection-recovery gaps. Together, these results suggest that mild control of low-degree advantage is often sufficient to explain computational barriers for recovery in high-dimensional statistical models.
Read the full abstract
Number Theory
Markov fractions and Cohn matrices
We show that the Markov fractions introduced recently by Springborn coincide with the index of the Cohn matrices defined by Aigner. This provides a simple concatenation rule for the corresponding continued fractions on the Conway topograph. We also discuss the $q$-deformation of Markov fractions in the sense of Morier-Genoud and Ovsienko, as well as their “metallic" version motivated by the work of Spalding and the author.
Read the full abstract
Algebraic Topology · Cross-listed from cs.AI
Phase-Scheduled Multi-Agent Systems for Token-Efficient Coordination
Multi-agent systems (MAS) powered by large language models suffer from severe token inefficiency arising from two compounding sources: (i) unstructured parallel execution, where all agents activate simultaneously irrespective of input readiness; and (ii) unrestricted context sharing, where every agent receives the full accumulated context regardless of relevance. Existing mitigation strategies - static pruning, hierarchical decomposition, and learned routing - treat coordination as a structural allocation problem and fundamentally ignore its temporal dimension. We propose Phase-Scheduled Multi-Agent Systems (PSMAS), a framework that reconceptualizes agent activation as continuous control over a shared attention space modeled on a circular manifold. Each agent i is assigned a fixed angular phase theta_i in the range [0, 2*pi], derived from the task dependency topology; a global sweep signal phi(t) rotates at velocity omega, activating only agents within an angular window epsilon. Idle agents receive compressed context summaries, reducing per-step token consumption. We implement PSMAS on LangGraph, evaluate on four structured benchmarks (HotPotQA-MAS, HumanEval-MAS, ALFWorld-Multi, WebArena-Coord) and two unstructured conversational settings, and prove stability, convergence, and optimality results for the sweep dynamics. PSMAS achieves a mean token reduction of 27.3 percent (range 21.4-34.8 percent) while maintaining task performance within 2.1 percentage points of a fully activated baseline (p < 0.01, n = 500 per configuration), and outperforms the strongest learned routing baseline by 5.6 percentage points in token reduction with 2.0 percentage points less performance drop. Crucially, we show that scheduling and compression are independent sources of gain: scheduling alone accounts for 18-20 percentage points of reduction, robust to compression degradation up to alpha = 0.40.
Read the full abstract
Algebraic Topology · Cross-listed from stat.ME
A Null Model for Mapper Subtype Claims
The Mapper algorithm from topological data analysis constructs a graph summarizing the shape of a high-dimensional dataset, and groups of data points identified within this graph are widely interpreted as evidence of distinct subtypes. However, the covariance structure of the data alone can make such groups appear differentiated, even when no subtypes are present. Existing validation approaches do not account for this effect and thus cannot distinguish covariance artifacts from genuine subtypes. We propose a Gaussian null model that generates reference data matching the sample covariance matrix. We pair it with a test statistic that measures mean-level differentiation between communities. In an idealized setting, we prove that covariance geometry alone causes Mapper communities to differ in their average feature profiles, and we show that a simpler label-permutation baseline cannot detect this effect. Simulations confirm well-controlled Type I error under Gaussian data. We apply the framework to four published Mapper analyses spanning breast cancer gene expression, Congressional voting, NBA player performance, and lower-grade glioma genomics. In every case, once outlier singleton communities are accounted for, the observed differentiation does not exceed what the null produces at the {\alpha} = 0.05 level. This result does not rule out subtypes in these datasets, but it does indicate that the observed structure is consistent with what covariance geometry alone can produce. Stronger evidence would be needed to support a subtype claim.
Read the full abstract
Commutative Algebra
A criterion for log regularity via log Frobenius-Witt differentials
T. Saito introduced FW-derivations and the modules of FW-differentials. He gave a regularity criterion in terms of the modules of FW-differentials. In this paper, we introduce logarithmic analogues of FW-derivations and the modules of FW-differentials. We study basic properties of them and give a logarithmic regularity criterion in terms of the modules of logarithmic FW-differentials.
Read the full abstract
Combinatorics
The inversion number statistic for inversion sequences
Inversion sequences, also known as subexcedant sequences, form a fundamental class of objects in enumerative combinatorics. In this paper, we study the joint distribution of five statistics on inversion sequences. While several statistics on inversion sequences have been extensively investigated, our contribution is to introduce the inversion number statistic, originally defined for permutations, into the context of inversion sequences. As special cases, we recover classical permutation statistics, including the Stirling, Mahonian and Eulerian distributions, as well as the Catalan and Narayana numbers. Somewhat unexpectedly, our specializations also include the number of involutions in the symmetric group. Our study arises from a $q$-analog of Comtet's expansion formula obtained by substituting the classical derivative operator $D$ with the $q$-derivative operator $D_q$.
Read the full abstract
Information Theory
MAGRPO: Accelerated MARL Training for Fluid Antenna-Assisted Wireless Network Optimization
Fluid antenna systems (FASs) improve wireless links by repositioning antenna elements to exploit favorable spatial channel variations. Jointly optimizing fluid antenna (FA) positions, beamforming, and transmit power in a multi-cell network is challenging because the problem is non-convex and each base station has only local information during decentralized execution. However, the representative multi-agent reinforcement learning (MARL) algorithms, namely the on-policy multi-agent proximal policy optimization (MAPPO) and the off-policy multi-agent twin delayed deep deterministic policy gradient (MATD3), suffer from excessively long training times. To address this challenge, we formulate the problem as a decentralized partially observable Markov decision process (Dec-POMDP) and propose multi-agent group relative policy optimization (MAGRPO) under centralized training with decentralized execution. MAGRPO constructs relative advantages from groups of joint trajectories, thereby eliminating the centralized critic and generalized advantage estimation used by MAPPO; under parameter sharing, this critic-free design reduces the per-step computational complexity by approximately half. Simulations show that joint FA optimization provides several-fold sum-rate gains over fixed-position configurations. Across the evaluated antenna settings, MAGRPO achieves test sum rates higher than those of MATD3 and comparable to or slightly higher than those of MAPPO. Meanwhile, it reduces the training time by 20%-23% compared with MAPPO and by about 35% compared with MATD3.
Read the full abstract
Logic
The generalized continuous model theory, Borel complexity and stability
Given Polish space $\mathcal{Y}$ and a continuous language $L$ we study the corresponding logic $\mathsf{Iso}(\mathcal{Y})$-space $\mathcal{Y}_L$. We build a framework of generalized model theory towards analysis of Borel complexity of families of subsets of Effros spaces $\mathcal{F}(\mathcal{Y})^k_L\times \mathcal{F}(\mathsf{Iso} (\mathcal{Y}))^l$ corresponding to standard model-theoretic properties. In this paper we mainly apply this approach to stability.
Read the full abstract
Information Theory · Cross-listed from quant-ph
Quantum channel tomography: optimal bounds and a Heisenberg-to-classical phase transition
How many black-box queries to a quantum channel are needed to learn its full classical description? This question lies at the heart of quantum channel tomography (also known as quantum process tomography), a fundamental task in the characterization and validation of quantum hardware. Despite extensive prior work, the optimal query complexity for quantum channel tomography is far from fully understood. In this paper, we study tomography of an unknown quantum channel with input dimension $d_1$, output dimension $d_2$, and Kraus rank at most $r$, to within error $\varepsilon$. We identify the dilation rate $\tau = r d_2 / d_1$ (which always satisfies $\tau\geq 1$ due to the trace preservation of quantum channels) as a key parameter, and establish that the optimal query complexity of channel tomography exhibits distinct scaling laws across three regimes of $\tau$. - In the boundary regime ($\tau = 1$): we show that the query complexity is $\Theta(r d_1 d_2/\varepsilon)$ for Choi trace norm error $\varepsilon$, and is upper bounded by $O(\min\{r d_1^{1.5} d_2/\varepsilon, r d_1 d_2/\varepsilon^2\})$ and lower bounded by $\Omega(r d_1 d_2/\varepsilon)$ for diamond norm error $\varepsilon$. - In the away-from-boundary regime ($\tau \geq 1+\Omega(1)$): we show that the query complexity is $\Theta(r d_1 d_2/\varepsilon^2)$ for both Choi trace norm and diamond norm errors $\varepsilon$. Our results uncover a sharp Heisenberg-to-classical phase transition in the query complexity of quantum channel tomography: at $\tau=1$, the optimal query complexity exhibits Heisenberg scaling $1/\varepsilon$, whereas for $\tau\geq 1+\Omega(1)$, it exhibits classical scaling $1/\varepsilon^2$. In addition, we show that in the near-boundary regime ($1< \tau < 1+o(1)$), the query complexity exhibits a mixture of Heisenberg and classical scaling behaviors.
Read the full abstract
Differential Geometry
Weighted volume comparison and monotonicity for $L^p$-bound of Bakry-Émery Ricci curvature
We establish a Petersen-Wei type relative volume comparison theorem for weighted Riemannian manifolds under both $L^p$-bounds of the Bakry-Émery Ricci curvature and the gradient of potential function. As an application, we give a modified proof for a volume comparison and monotonicity of Kähler-Ricci flow established in a recent work of Tian-Zhang-Zhang-Zhu-Zhu with improved estimate for error term.
Read the full abstract
Analysis of PDEs
Ground States of One-Dimensional Fermionic Schrödinger Systems Near a Critical Exponent
We study ground states of the fermionic nonlinear Schrödinger system $J_2(p)$ in $\R$, where $p>1$ denotes a polynomial exponent of the nonlinear term. It is known that the system $J_2(p)$ admits ground states for any $1<p<2$, while there is no ground state for $J_2(2)$. We prove that there is no ground state of $J_2(p)$ as $p\searrow 2$, which addresses the special case of Conjecture 5 in [D. Gontier, M. Lewin and F. Q. Nazar, ARMA, 2021]. The refined limiting profile of ground states for $J_2(p)$ is also analyzed as $p\nearrow 2$, which shows that the corresponding density admits exactly two bumps whose distance goes up to infinity as $p\nearrow 2$.
Read the full abstract
Combinatorics
Ramsey-finiteness for graph pairs: A complete solution to the Burr-Erdős-Faudree-Schelp conjectures
For finite graphs $G$ and $H$, let $\RR(G,H)$ denote the isomorphism classes of Ramsey-minimal graphs for $(G,H)$. We prove two 1981 conjectures of Burr, Erdős, Faudree, Rousseau, and Schelp: Ramsey-finiteness is preserved by adjoining disjoint matchings, and $(G,H)$ is Ramsey-infinite unless both graphs are odd stars or one graph has a $K_2$ component. We also replace Burr's stronger 1979 survey characterization by the correct necessary-and-sufficient form: apart from the matching case and the odd-star-with-matchings case, the only additional finite pairs are Faudree's star-forest family.
Read the full abstract
Mathematical Physics
Soliton-like solutions of the Camassa–Holm equation with variable coefficients and a small dispersion
The paper deals with the Camassa–Holm equation with variable coefficients (vcCH equation) that is a direct generalization of the well known Camassa–Holm equation. We focus on the mathematical description of particular solutions of the vcCH equation with a small dispersion that exhibit properties analogous to those of classical soliton and peakon solutions, and consider the construction of soliton- and peakon-like solutions in the form of asymptotic expansions, including both one-phase and two-phase cases. The solution is expressed as the sum of a regular background common to all soliton- and peakon-like solutions and a singular component that captures their distinctive features, with the precise definition of the main singular term playing a central role. In the one-phase case, this term is determined, and the solvability of higher-order singular corrections is established in suitable functional spaces, enabling the construction of asymptotic solutions to arbitrary accuracy in a small parameter. The study also addresses the construction of two-phase soliton- and peakon-like solutions. Theorems on the asymptotic accuracy of the constructed asymptotic solutions have been proved. Each of the considered cases is illustrated by nontrivial examples for which, in accordance with the obtained general results, approximate solutions are derived in explicit form and their graphs are presented.
Read the full abstract
Analysis of PDEs
Stability of Inflow Problem for Hyperbolic Systems
Inflow BC plays a critical role in the study of hyperbolic PDE in a bounded domain. We establish $W^{1,\infty}$ stability for 1D hyperbolic conservation laws with inflow data in a bounded interval, and $W^{2,3+}$ stability of a large class of shear flows for the 3D incompressible Euler system with inflow BC in finite square or circular pipes.
Read the full abstract
Probability · Cross-listed from cs.CE
On Drift Induced by Local Transition Asymmetry in Combinatorial State Spaces
We study stochastic processes on combinatorial state spaces with local transition constraints, as arise in local search algorithms. We show that asymmetry in local transitions induces a systematic drift in a distance process relative to a reference configuration. This drift results from the imbalance between inward and outward transitions, translating combinatorial multiplicities into directional bias. Analyzing the random walk on the Johnson graph, we derive explicit expressions for the drift and expected hitting times. We also show that locality constraints lead to trajectory-level differences that can hinder search trajectories from reaching the target, even under identical stationary distributions.
Read the full abstract
Numerical Analysis
Evaluation of Gauss-Legendre curves
We present new representations of Gauss–Legendre polynomials and their derivatives in the shifted power basis and in bases related to symmetric orthogonal Jacobi polynomials. Using these representations and certain recurrence relations, we propose $O(n^2+dn)$ methods for evaluating a Gauss–Legendre curve of degree $n$ in $\mathbb E^d$. We also propose algorithms for multipoint evaluation with computational complexity $O(Mdn+dn^2)$, where $M$ is the number of evaluation points. Numerical tests show that the approach using the shifted power basis is very fast, but it works well only for small $n$ (approximately up to 20), whereas the method employing Jacobi polynomials gives good numerical results even for large $n$ (around 100).
Read the full abstract
Optimization and Control
Crouzeix-Raviart Finite Element Approximation of Dirichlet Boundary Control Problems with Piecewise Constant Controls
This article examines the Dirichlet boundary control problem governed by the Poisson equation, where the control variables are square integrable functions defined on the boundary of a two-dimensional bounded, convex, polygonal domain. It employs an ultra-weak formulation and utilizes Crouzeix-Raviart finite elements to discretize the state variable, while employing piecewise constants for the control variable discretization. Furthermore, it establishes an optimal order a priori error estimate for the control variable.