Differential Geometry
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Tuesday 3 March
As part of his work on special Lagrangian (sLag) submanifolds with isolated conical singularities, Joyce proved a criterion for the existence of sLag smoothings, along a small variation of complex structure, for the union of two connected, compact, embedded sLags, with the same phase, intersecting transversely. Here we construct infinitely many examples of pairs of non-compact, embedded sLags, of the same phase and with arbitrary dimension, intersecting only at infinity in a non-transverse way, which satisfy Joyce's criterion: along a small variation of complex structure, a sLag smoothing of their union exists on the stable locus where a slope inequality for periods of the holomorphic volume form holds. At least under a natural symmetry assumption, this slope inequality is also necessary for the existence of such smoothing. Our approach uses the Leung-Yau-Zaslow transform and the analysis of deformed Hermitian Yang-Mills connections with Calabi ansatz, due to Jacob and Sheu. In the unstable case, we prove that if a family of Lagrangian smoothings evolving under the natural Calabi-symmetric version of the mean curvature flow (due to Chan and Jacob) admits a limit, then this must be the union of the original sLags. As an application we show that in our examples, in dimension two, the condition for the existence of the sLag smoothing is in fact equivalent to the stability of the corresponding object in the Fukaya-Seidel category, with respect to a known Bridgeland stability condition imported from algebraic geometry, and in the unstable case the limit of the Calabi-symmetric mean curvature flow in our result coincides with the Harder-Narasimhan decomposition, consistently with a general conjecture of Joyce. A similar (although weaker) result also holds in dimension three.
Information Theory
Enhancing User Throughput in Multi-panel mmWave Radio Access Networks for Beam-based MU-MIMO Using a DRL Method
Millimeter-wave (mmWave) communication systems, particularly those leveraging multi-user multiple-input and multiple-output (MU-MIMO) with hybrid beamforming, face challenges in optimizing user throughput and minimizing latency due to the high complexity of dynamic beam selection and management. This paper introduces a deep reinforcement learning (DRL) approach for enhancing user throughput in multi-panel mmWave radio access networks in a practical network setup. Our DRL-based formulation utilizes an adaptive beam management strategy that models the interaction between the communication agent and its environment as a Markov decision process (MDP), optimizing beam selection based on real-time observations. The proposed framework exploits spatial domain (SD) characteristics by incorporating the cross-correlation between the beams in different antenna panels, the measured reference signal received power (RSRP), and the beam usage statistics to dynamically adjust beamforming decisions. As a result, the spectral efficiency is improved and end-to-end latency is reduced. The numerical results demonstrate an increase in throughput of up to 16% and a reduction in latency by factors 3-7x compared to baseline (legacy beam management).
Read the full abstract
Algebraic Geometry
Complexity of quantum cohomology
Circuit complexity for two-dimensional topological quantum field theories (2D TQFT) was defined by Couch, Fan, and Shashi in [12]. In this paper, we study complexity for the 2D TQFT given by quantum cohomology of compact symplectic manifolds. We will estimate the number of states with finite approximate complexity of arbitrarily small tolerance for Fano complete intersections and (co)minuscule homogeneous varieties. We will give an upper bound for the dimension of the space spanned by states with finite complexity. In the case of Gr(2, n), this bound is sharp and we also obtain a precise description for this subspace. For (co)minuscule homogeneous varieties, we prove a positivity result for the eigenvalues of quantum multiplication by the handle element (also called the quantum Euler class) divided by the class of a point.
Read the full abstract
Optimization and Control · Cross-listed from cs.LG
The power of small initialization in noisy low-tubal-rank tensor recovery
We study the problem of recovering a low-tubal-rank tensor $\mathcal{X}\_\star\in \mathbb{R}^{n \times n \times k}$ from noisy linear measurements under the t-product framework. A widely adopted strategy involves factorizing the optimization variable as $\mathcal{U} * \mathcal{U}^\top$, where $\mathcal{U} \in \mathbb{R}^{n \times R \times k}$, followed by applying factorized gradient descent (FGD) to solve the resulting optimization problem. Since the tubal-rank $r$ of the underlying tensor $\mathcal{X}_\star$ is typically unknown, this method often assumes $r < R \le n$, a regime known as over-parameterization. However, when the measurements are corrupted by some dense noise (e.g., Gaussian noise), FGD with the commonly used spectral initialization yields a recovery error that grows linearly with the over-estimated tubal-rank $R$. To address this issue, we show that using a small initialization enables FGD to achieve a nearly minimax optimal recovery error, even when the tubal-rank $R$ is significantly overestimated. Using a four-stage analytic framework, we analyze this phenomenon and establish the sharpest known error bound to date, which is independent of the overestimated tubal-rank $R$. Furthermore, we provide a theoretical guarantee showing that an easy-to-use early stopping strategy can achieve the best known result in practice. All these theoretical findings are validated through a series of simulations and real-data experiments.
Read the full abstract
Number Theory
A log prismatic-crystalline comparison theorem
We show a comparison theorem between log prismatic cohomology and log crystalline cohomology for a $p$-adic formal scheme with semistable reduction. Combined with the prismatic-étale comparison theorem recently proved by Tian, this implies the $C_{\mathrm{st}}$-conjecture in the semistable case with coefficients given by semistable local systems.
Read the full abstract
Probability
Gaussian Width of Convex Sets via Integral Decompositions, Projections, and the Distribution of Intrinsic Volumes
We revisit the problem of bounding the expected supremum of a canonical Gaussian process indexed by a convex set $T \subset \mathbf{R}^d$. We develop two decompositions for the Gaussian width, based on the geometry of the index set. The first decomposition involves metric projections of Gaussians onto rescaled copies of $T$. The second involves fixed points arising from a quadratically penalized variant of the local width. Neither decomposition directly invokes generic chaining constructions. Our results make use of recent work in geometric analysis and Gaussian processes. The work of Chatterjee [Ann. Statist., 2014] characterizes the behavior of the metric projection of a Gaussian random vector onto rescaled copies of $T$ with a variational problem involving localized Gaussian widths. We use these bounds to develop decompositions of the Gaussian width using the local metric structure of $T$. Second, we leverage the work of Vitale [Ann. Probab., 1996] to form a connection between the Wills functional (and hence the intrinsic volumes of $T$) and the first terms that appear in our decompositions. Finally, invoking recent work by Mourtada [J. Eur. Math. Soc., 2025] on the logarithm of the Wills functional, we show that the width is controlled by a single, ”peak index” of the intrinsic volumes. In the worst case, our bound recovers a local form of the classical Dudley integral.
Read the full abstract
Representation Theory
Asai Gamma Factors and Distinction in families
Let $F$ be a finite extension of $\mathbb{Q}_p$ and let $E$ be a quadratic extension of $F$. A representation $(\pi,V)$ of ${\rm GL}_n(E)$ is said to be ${\rm GL}_n(F)$-distinguished if there exists a non-zero linear functional $\phi$ on $V$ such that $\phi(\pi(h)v) = \phi(v)$ for all $h \in {\rm GL}_n(F)$ and $v \in V$. In this article, we study the notion of ${\rm GL}_n(F)$-distinguished representations for $R[{\rm GL}_n(E)]$ modules of Whittaker type, where $R$ is a Noetherian algebra over the ring of Witt vectors of $\overline{\mathbb{F}}_\ell$ with $\ell \ne p$. We first derive a functional equation, which gives the existence of the Asai $\gamma$-factors associated with $R[{\rm GL}_n(E)]$ modules of Whittaker type. We then provide a necessary condition for cuspidal $R[{\rm GL}_n(E)]$ modules of Whittaker type to be Whittaker ${\rm GL}_n(F)$-distinguished, expressed in terms of their Asai $\gamma$-factors.
Read the full abstract
Combinatorics
Subspace variations of the weighted skew Bollobás theorem
Let $V$ be a finite-dimensional real vector space. A collection $\mathcal{P} = \{(A_i,B_i)\}_{i=1}^m$ of pairs of subspaces of $V$ is called a skew Bollobás system if $\dim(A_i\cap B_i)=0$ for each $i\in [m]$ and $\dim(A_i\cap B_j)>0$ for all $1\leq i<j \leq m$. Assume that $V = V^{(1)}\oplus \cdots \oplus V^{(r)}$ and $\mathcal{P}= \{(A_i,B_i)\}_{i=1}^m$ is a skew Bollobás system of subspaces of $V$ satisfying $ A_i = \bigoplus_{k=1}^r (A_i \cap V^{(k)})$ and $ B_i = \bigoplus_{k=1}^r (B_i \cap V^{(k)})$ for each $i\in [m]$. Denote $a_{i,k} = \dim(A_i \cap V^{(k)})$ and $b_{i,k} = \dim(B_i \cap V^{(k)})$. Suppose that $a_{1,k} \le \cdots \le a_{m,k}$ and $b_{1,k} \ge \cdots \ge b_{m,k}$ for each $k\in [r]$. Using the exterior algebraic method developed by Lovász and Scott–Wilmer, we prove that $$ \sum_{i=1}^{m} \frac{1}{\prod_{k=1}^{r} \binom{a_{i,k}+b_{i,k}}{a_{i,k}}} \le 1 . $$ This generalizes the results of Alon (JCTA, 1985) and Scott–Wilmer (JLMS, 2021) to multipart weighted setting. Secondly, we solve a conjecture of Hegedüs (AJC, 2015) concerning projective subspaces, showing that any skew Bollobás system of projective subspaces in an $n$-dimensional projective space contains at most $2^{n+1} - 2$ pairs. Thirdly, we prove that if $\mathcal{P}= \{(A_i,B_i)\}_{i=1}^m$ is a skew Bollobás system of subspaces of $V$ with $a_i=\dim (A_i)$ and $b_i=\dim (B_i)$, then $$ \sum_{i=1}^m \frac{1}{(a_i+ b_i+1)\binom{a_i+b_i}{a_i}} \le 1. $$ This gives an extension to the subspace setting of the results of Hegedüs–Frankl (EUJC, 2024) and Yue (DM, 2026). Finally, we extend the above inequality to systems of $d$-tuples of subspaces, giving a unified bound that implies the corresponding results for $d$-tuples of subsets.
Read the full abstract
Information Theory
Large Language Model Empowered CSI Feedback in Massive MIMO Systems
Despite the success of large language models (LLMs) across domains, their potential for efficient channel state information (CSI) compression and feedback in frequency division duplex (FDD) massive multiple-input multiple-output (mMIMO) systems remains largely unexplored yet increasingly important. In this paper, we propose a novel LLM-based framework for CSI feedback to exploit the potential of LLMs. We first reformulate the CSI compression feedback task as a masked token prediction task that aligns more closely with the functionality of LLMs. Subsequently, we design an information-theoretic mask selection strategy based on self-information, identifying and selecting CSI elements with the highest self-information at the user equipment (UE) for feedback. This ensures that masked tokens correspond to elements with lower self-information, while visible tokens correspond to elements with higher self-information, thus maximizing the accuracy of LLM predictions.
Read the full abstract
Optimization and Control
$\ell_{1\text{-}2}$ Regularization for Sparse Optimization: Consistency and Global Convergence
The $\ell_{1\text{-}2}$ regularization method has a strong sparsity promoting capability in approaching sparse solutions of linear inverse problems and gained successful applications in various mathematics and applied science fields. This paper aims to investigate the consistency theory and global convergent algorithms for the $\ell_{1\text{-}2}$ regularization problem. In the theoretical aspect, we introduce a notion of restricted eigenvalue condition relative to the $\ell_{1\text{-}2}$ penalty, and employ it to establish an oracle property and a recovery bound for the global solution of the $\ell_{1\text{-}2}$ regularization problem. In the algorithmic aspect, we propose two types of iterative thresholding algorithms with the truncation technique and the continuation technique, respectively, to solve the $\ell_{1\text{-}2}$ regularization problem. Moreover, under the assumption of the well-known restricted isometry property, we establish the convergence of the proposed algorithms to the ground true sparse solution within a tolerance relevant to the noise level and the recovery bound. Preliminary numerical results show that our proposed algorithms can approach the ground true sparse solution and significantly enhance the sparsity recovery capability, compared with the popular sparse optimization algorithms in the literature.
Read the full abstract
Analysis of PDEs
Global Solutions of Coupled Nonlocal Parabolic Systems Arising from Reversible Chemical Reactions
A class of coupled time-space fractional reaction-diffusion systems derived from reversible chemical reactions over a bounded domain is investigated. Employing mainly an appropriate Lyapunov functional and an improved maximum principle, we demonstrate the global-in-time existence of strong solutions under some assumptions on the systems parameters.
Read the full abstract
Algebraic Topology
On Projective and Flat Persistence Modules
In recent years, persistence modules have been viewed as graded modules with gradation over a preordered set serving as the indexing set. We provide sufficient criteria for a projective module over a PID to be free when the indexing set is a lattice. With a lattice as the indexing set, we obtain criteria ensuring that a given persistence module is not projective. When the indexing set is a preordered set, we establish the flatness of a well-known family of persistence modules. We end the article with two algorithms to compute a basis of free persistence modules with indexing sets $\mathbb{Z}$ and $\mathbb{Z}^2$.
Read the full abstract
Representation Theory · Cross-listed from quant-ph
Qudit Designs and Where to Find Them
Unitary t-designs are some of the most versatile tools in quantum information theory. Their applications range from randomized benchmarking and shadow tomography, to more fundamental ones such as emulating quantum chaos and establishing exponential separations between classical and quantum query complexity. While unitary designs originating from a group structure, such as the Clifford group, have proven to be incredibly useful for qubit systems, unfortunately, this is no longer true for qudits. In fact, the classification of finite-group representations rules out the existence of unitary 2-designs for arbitrary qudit dimensions. This severely limits the applicability of standard quantum information primitives when it comes to qudit systems. We overcome these limitations with a three-fold contribution. First, we introduce a general technique to construct families of weighted state t-designs in arbitrary qudit dimensions. These weighted state-designs generalize classical shadow tomography protocol from qubits to qudits. Second, we introduce a Clifford character RB that allows us to benchmark the qudit Clifford group in any dimension, including non-prime-power dimensions. And third, we establish bounds on the quantum circuit complexity of generating approximate unitary-designs from native gates in existing quantum hardware such as high-spin and cavity-QED qudits. Our work further highlights the analogy between spin and optical coherent states by proving that spin-GKP codewords form a state 2-design while spin coherent states do not; in direct analogy with the optical case. This work is structured as a pedagogical and self-contained introduction to unitary designs and their applications to qudit systems.
Read the full abstract
Optimization and Control · Cross-listed from cs.LG
HomeAdam: Adam and AdamW Algorithms Sometimes Go Home to Obtain Better Provable Generalization
Adam and AdamW are a class of default optimizers for training deep learning models in machine learning. These adaptive algorithms converge faster but generalize worse compared to SGD. In fact, their proved generalization error $O(\frac{1}{\sqrt{N}})$ also is larger than $O(\frac{1}{N})$ of SGD, where $N$ denotes training sample size. Recently, although some variants of Adam have been proposed to improve its generalization, their improved generalizations are still unexplored in theory. To fill this gap, in the paper, we restudy generalization of Adam and AdamW via algorithmic stability, and first prove that Adam and AdamW without square-root (i.e., Adam(W)-srf) have a generalization error $O(\frac{\hat{\rho}^{-2T}}{N})$, where $T$ denotes iteration number and $\hat{\rho}>0$ denotes the smallest element of second-order momentum plus a small positive number. To improve generalization, we propose a class of efficient clever Adam (i.e., HomeAdam(W)) algorithms via sometimes returning momentum-based SGD. Moreover, we prove that our HomeAdam(W) have a smaller generalization error $O(\frac{1}{N})$ than $O(\frac{\hat{\rho}^{-2T}}{N})$ of Adam(W)-srf, since $\hat{\rho}$ is generally very small. In particular, it is also smaller than the existing $O(\frac{1}{\sqrt{N}})$ of Adam(W). Meanwhile, we prove our HomeAdam(W) have a faster convergence rate of $O(\frac{1}{T^{1/4}})$ than $O(\frac{\breve{\rho}^{-1}}{T^{1/4}})$ of the Adam(W)-srf, where $\breve{\rho}\leq\hat{\rho}$ also is very small. Extensive numerical experiments demonstrate efficiency of our HomeAdam(W) algorithms.
Read the full abstract
Optimization and Control
Convex and Non-convex Federated Learning with Stale Stochastic Gradients: Diminishing Step Size is All You Need
We propose a general framework for distributed stochastic optimization under delayed gradient models. In this setting, $n$ local agents leverage their own data and computation to assist a central server in minimizing a global objective composed of agents' local cost functions. Each agent is allowed to transmit stochastic-potentially biased and delayed-estimates of its local gradient. While a prior work has advocated delay-adaptive step sizes for stochastic gradient descent (SGD) in the presence of delays, we demonstrate that a pre-chosen diminishing step size is sufficient and matches the performance of the adaptive scheme. Moreover, our analysis establishes that diminishing step sizes recover the optimal SGD rates for nonconvex and strongly convex objectives.
Read the full abstract
Dynamical Systems · Cross-listed from q-bio.MN
Topological bounds on the dynamical growth rate of chemical reaction networks
Growth and decay are system-level properties of chemical reaction networks (CRNs) relevant from prebiotic chemistry to cellular metabolism. Their properties are typically analyzed through the kinetics of particular models, which requires specification of the full set of kinetic laws and parameters. In this work, assuming a steady balanced-growth regime, we derive stoichiometry-based constraints on the growth (or shrinkage) rate. The resulting bounds are controlled by a topological quantity, the maximum amplification factor, defined via a von Neumann max-min problem over feasible fluxes as illustrated by numerical tests on random-network ensembles of CRNs. We argue for the relevance of our results in the context of origins of life studies and the design of synthetic chemical reaction networks.
Read the full abstract
Combinatorics
An Upper Bound for the Double Domination Number in Maximal Outerplanar Graphs
In a graph $G$, a vertex dominates itself and its neighbors. A subset $S$ of vertices of $G$ is a double dominating set of $G$ if every vertex is dominated by at least two vertices in $S$. The double domination number $\gamma_{\times 2}(G)$ of $G$ is the minimum cardinality of a double dominating set of $G$. In this paper, we prove that, for a maximal outerplanar graph $G$, the double domination number $\gamma_{\times 2}(G)$ is at most $(n+k)/2$, where $k$ is the number of pairs of consecutive vertices on the outer cycle but at distance at least 3. Although this bound was previously proposed by Abd Aziz, Rad and Kamarulhaili (A note on the double domination number in maximal outerplanar and planar graphs, RAIRO Operations Research, 56 (2022) 3367–3371), their proof was found to be incomplete. In this paper we establish the validity of this result by providing a complete proof.
Read the full abstract
Algebraic Geometry
Brauer group of moduli of stable parabolic $\text{SL}(r,\mathbb{C})$ and $\text{PGL}(r,\mathbb{C})$-connections and Higgs bundles over a curve
Let $X$ be a compact Riemann surface of genus at least $3$. We compute the Brauer groups of the moduli spaces of stable parabolic $\text{SL}(r,\mathbb{C})$-connections and stable strongly parabolic $\text{SL}(r,\mathbb{C})$-Higgs bundles over $X$. We also establish an equality of the Brauer group of the moduli stack of stable parabolic $\text{PGL}(r,\mathbb{C})$-connections and the smooth locus of its coarse moduli space.
Read the full abstract
Optimization and Control · Cross-listed from stat.ML
Combinatorial Sparse PCA Beyond the Spiked Identity Model
Sparse PCA is one of the most well-studied problems in high-dimensional statistics. In this problem, we are given samples from a distribution with covariance $\Sigma$, whose top eigenvector $v \in R^d$ is $s$-sparse. Existing sparse PCA algorithms can be broadly categorized into (1) combinatorial algorithms (e.g., diagonal or elementwise covariance thresholding) and (2) SDP-based algorithms. While combinatorial algorithms are much simpler, they are typically only analyzed under the spiked identity model (where $\Sigma = I_d + \gamma vv^\top$ for some $\gamma > 0$), whereas SDP-based algorithms require no additional assumptions on $\Sigma$. We demonstrate explicit counterexample covariances $\Sigma$ against the success of standard combinatorial algorithms for sparse PCA, when moving beyond the spiked identity model. In light of this discrepancy, we give the first combinatorial method for sparse PCA that provably succeeds for general $\Sigma$ using $s^2 \cdot \mathrm{polylog}(d)$ samples and $d^2 \cdot \mathrm{poly}(s, \log(d))$ time, by providing a global convergence guarantee on a variant of the truncated power method of Yuan and Zhang (2013). We provide a natural generalization of our method to recovering a vector in a sparse leading eigenspace. Finally, we evaluate our method on synthetic and real-world sparse PCA datasets.
Read the full abstract
Algebraic Geometry
Galois Orbit Bounds for Surface Degenerations
Given a smooth proper family $g : X \to S$ of surfaces over a number field $K \subset \mathbb{C}$, with $S$ an irreducible curve and $\eta \in S$ its generic point, we consider the general problem of constraining the locus $\textrm{NL}(S)$ in $S(\overline{K})$ of points $s$ where the Picard rank of $X_{s}$ is larger than the generic Picard rank. Assuming that the local system $\mathbb{V} = R^{2} g_{*} \mathbb{Z}$ admits a non-trivial monodromy logarithm $N$ at infinity, we give a general condition under which certain points of $\textrm{NL}(S)$ of unexpectedly large Picard rank satisfy a “Galois-orbit” height bound. This leads to the following result of Zilber-Pink type: Let $g : X \to S$ be a one-parameter family of polarized K3 surfaces admitting a non-trivial limit mixed Hodge structure and such that $S(\mathbb{C})$ contains a Hodge-generic point. Then the locus in $S(\mathbb{C})$ where the Picard rank jumps by $3$ or more is finite. Our arguments include a new technique for “spreading out” formal geometry, a study of the rigid geometry of equicharacteristic zero semistable surface degenerations, and use the model-free Hyodo-Kato theory of Colmez-Nizioł.
Read the full abstract
Logic
$m$-Rigidity and Finite-One Degrees Inside Typical Many-One Degrees
In recent work, the notion of $m$-rigidity was introduced as a sufficient condition for the existence of infinite antichains of $1$-degrees inside many-one degrees. Motivated by a recent preprint of Richter, Stephan, and Zhang on finite-one degrees inside many-one degrees, we study the finite-one structure of the many-one degree of an $m$-rigid set. First, combining bi-immunity of $m$-rigid sets with a theorem of Richter, Stephan, and Zhang, we show that for Lebesgue-almost every set $A$, and for a comeager class of sets $A$, the many-one degree $\deg_m(A)$ contains a least finite-one degree. Second, we prove that if $A$ is $m$-rigid, then $\deg_m(A)$ contains infinitely many pairwise incomparable finite-one degrees. More precisely, we construct representatives $B_S \equiv_m A$, indexed by computable sets $S$, such that $T \setminus S$ infinite implies $B_T \not\leq_{fin} B_S$. Third, inside a single finite-one degree we build a strict ascending chain \[ A_{(1)} <_1 A_{(2)} <_1 \cdots \] of $1$-degrees. These results yield almost-sure and comeager partial answers to the first two open problems posed by Richter, Stephan, and Zhang.
Read the full abstract
Algebraic Geometry
$IT_0$ sheaves on compactified Jacobian
In this paper we construct stable $IT_{0}$ trosion free sheaves on compactified Jacobian of an integral nodal curve. Our construction is functorial in nature and it provides an uniform method which works for both smooth and nodal curve.
Analysis of PDEs
Well-posedness and existence of an invariant measure for the linearly-damped KdV equations driven by a jump noise
In this paper, we investigate the linearly damped KdV equation on the one-dimensional torus $\mathbb{T}$, perturbed by a multiplicative Lévy noise. For any damping coefficient $\gamma > 0$, we establish the existence and uniqueness of a pathwise weak solution with values in $H^2(\mathbb{T})$. In the second part of the paper, we analyze the long-time behavior of these solutions. This study is particularly subtle as the presence of jumps in time can significantly influence the asymptotics. We show, using the techniques of Maslowski and Seidler, that, provided the frictional damping coefficient $\gamma > 0$ is sufficiently large, the system influenced by square-integrable jumps admits an invariant measure in $H^2(\mathbb{T})$.
Read the full abstract
Category Theory
Dinaturality for Double Categories
In this paper we extend the concept of dinaturality to the setting of double categories. We introduce the dinatural versions of double categorical transformations and modifications, and show that ordinary natural transformations and modifications correspond to dinatural ones between dummy functors. We prove the double categorical generalizations of some classical theorems about dinatural transformations for 1-categories, and extend the surface diagram calculus for the locally cubical Gray category of small double categories to include dinatural constructions. In our motivating example of dinatural constructions we reconstruct the double categorical formulation of mates in terms of dinatural transformations and characterize extranaturality for 1-categories using dinaturality for double categories.
Read the full abstract
Combinatorics
SIP classes and four-parameter partition identities
The four-parameter weight of partitions played an important role in the theory of integer partitions, for its connection with various statistics, including the alternating sum and the BG-rank. In 2022, Andrews introduced the SIP classes, by which he reviewed a number of classic partition identities and provided new combinatorial insights. In this work, we extend the SIP classes and provide a unified method to study the four-parameter weight of partitions. By treating partitions with position parity as examples, we provide four-parameter partition identities related to these partition sets. And as corollary, we also present the generating functions that keep track of the BG-rank and the joint distribution of the number of odd parts and the alternating sum, respectively.
Read the full abstract
Statistics Theory
Graph Disjointness with Applications to Reversible Markov Chains
The correspondence between weighted undirected graphs and reversible Markov chains via vertex random walks is simple and well known. Leveraging this correspondence and ideas from the theory of dynamical systems, we study the structural discordance of graphs and Markov chains by means of graph joinings. Informally, a joining of graphs $G$ and $H$ is a graph on the product of their vertex sets giving rise to a coupling of their random walks. Graphs $G$ and $H$ are strongly disjoint if their only joining is the tensor product, and they are weakly disjoint if the degree function of every joining is equal to the degree function of the tensor product. We establish close connections between graph joinings, disjointness, and graph factors. Our first principal result characterizes weak disjointness of graphs in terms of the spectral overlap of their Markov transition matrices. The second establishes that two graphs without self loops are strongly disjoint if and only if they are weakly disjoint and exactly one of the graphs is a tree. The third shows that the strong or weak disjointness of graphs is essentially determined by their vertex and edge sets, without regard to edge weights. Translating these results into the language of Markov chains yields new insights into the rigidity and structure of reversible couplings of reversible Markov chains.
Read the full abstract
Number Theory
Distribution of square-free palindromes
An exponent of distribution 1/16 is established for square-free palindromes. The main input is an upper bound for the number of palindromes, in arithmetic progressions to large moduli, divisible by large squares. Our argument combines a simplifying reformulation with exponential-sum estimates, recent work on 6-almost-prime palindromes, and the large sieve with square moduli of Baier-Zhao.
Read the full abstract
Combinatorics
Chiral Polyhedra from AGL(1,q)
We present a construction of chiral and regular polyhedra from subgroups of the general affine group AGL(1,q) for odd prime powers q. In particular, we show that the full group AGL(1,q) occurs as the automorphism group of a chiral polyhedron of type {q-1, q-1} when q=1 mod 4, or types {q-1,(q-1)/2} or {(q-1)/2, q-1} when q=3 mod 4, and we compute the genus in each case. We also establish that subgroups of AGL(1,q) cannot serve as full automorphism groups of regular polytopes of rank 3 or higher, nor of chiral polytopes of rank 4 or higher, demonstrating that our construction captures all polytopes that can arise from this class of affine groups.
Read the full abstract
Information Theory
Semantic Forwarding and Codebook-Enhanced Model Division Multiple Access for Satellite-Terrestrial Networks
Satellite-terrestrial communications are severely constrained by high path loss, limited spectrum resources, and time-varying channel conditions, rendering conventional bit-level transmission schemes inefficient and fragile, particularly in low signal-to-noise ratio (SNR) regimes. Semantic communication has emerged as a promising paradigm to address these challenges by prioritizing task-relevant information over exact bit recovery. In this paper, we propose a semantic forwarding-based semantic communication (SFSC) framework optimized for satellite-terrestrial networks. Specifically, we develop a vector-quantized joint semantic coding and modulation scheme, in which the semantic encoder and semantic codebook are jointly optimized to shape the constellation symbol distribution, improving channel adaptability and semantic compression efficiency. To mitigate noise accumulation and reduce on-board computational burden, we introduce a satellite semantic forwarding mechanism, enabling relay satellites to forward signals directly at the semantic level without full decoding and re-encoding. Furthermore, we design a channel-aware semantic reconstruction scheme based on feature-wise linear modulation (FiLM) to fuse the received SNR with semantic features, enhancing robustness under dynamic channel conditions. To support multi-user access, we further propose a codebook split-enhanced model division multiple access (CS-MDMA) method to improve spectral efficiency. Simulation results show that the proposed SFSC framework achieves a peak signal-to-noise ratio (PSNR) gain of approximately 7.9 dB over existing benchmarks in the low-SNR regime, demonstrating its effectiveness for robust and spectrum-efficient semantic transmission in satellite-terrestrial networks.
Read the full abstract
Information Theory
Functional Properties of the Focal-Entropy
The focal-loss has become a widely used alternative to cross-entropy in class-imbalanced classification problems, particularly in computer vision. Despite its empirical success, a systematic information-theoretic study of the focal-loss remains incomplete. In this work, we adopt a distributional viewpoint and study the focal-entropy, a focal-loss analogue of the cross-entropy. Our analysis establishes conditions for finiteness, convexity, and continuity of the focal-entropy, and provides various asymptotic characterizations. We prove the existence and uniqueness of the focal-entropy minimizer, describe its structure, and show that it can depart significantly from the data distribution. In particular, we rigorously show that the focal-loss amplifies mid-range probabilities, suppresses high-probability outcomes, and, under extreme class imbalance, induces an over-suppression regime in which very small probabilities are further diminished. These results, which are also experimentally validated, offer a theoretical foundation for understanding the focal-loss and clarify the trade-offs that it introduces when applied to imbalanced learning tasks.