Peer Revenue Play credits. Real papers.

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Thursday 9 April

Combinatorics

Equivalences of promise compactness principles

For a pair of finite relational structures $(\mathfrak{A},\mathfrak{B})$ such that $\mathfrak{A}$ homomorphically maps to $\mathfrak{B}$ we denote by $K_{(\mathfrak{A},\mathfrak{B})}$ the following statement: for all structures $\mathfrak{I}$ with the same signature as $\mathfrak{A}$ if all finite substructures of $\mathfrak{I}$ homomorphically maps to $\mathfrak{A}$ then $\mathfrak{I}$ homomorphically maps to $\mathfrak{B}$. In this article, we show that if $(\mathfrak{A},\mathfrak{B})$ has no Olšák polymorphism, then $K_{(\mathfrak{A},\mathfrak{B})}$ is equivalent to the ultrafilter principle over $\operatorname{ZF}$. This includes the statements $K_{(K_3,K_5)}$ and $K_{(H_2,H_c)}$ for all $c\geq 2$ where $K_n$ denotes the clique of size $n$ and $H_k$ denotes the ternary not-all-equal structure on a $k$-element set. This means, for example, that in any $\operatorname{ZF}$ model, if every finitely 3-colourable graph can be coloured by 5 colours then all these graphs can in fact be coloured by 3 colours.
Read the full abstract

Numerical Analysis

Meshfree GMsFEM-based exponential integration for multiscale 3D advection-diffusion problems

In this work, we extend the meshfree generalized multiscale exponential integration framework introduced in Nikiforov et al. (2025) to the simulation of three-dimensional advection–diffusion problems in heterogeneous and high-contrast media. The proposed approach combines meshfree generalized multiscale finite element methods (GMsFEM) for spatial discretization with exponential integration techniques for time advancement, enabling stable and efficient computations in the presence of stiffness induced by multiscale coefficients and transport effects. We introduce new constructions of multiscale basis functions that incorporate advection either at the snapshot level or within the local spectral problems, improving the approximation properties of the coarse space in advection-dominated regimes. The extension to three-dimensional settings poses additional computational and methodological challenges, including increased complexity in basis construction, higher-dimensional coarse representations, and stronger stiffness effects, which we address within the proposed framework. A series of numerical experiments in three-dimensional domains demonstrates the viability of the method, showing that it preserves accuracy while allowing for significantly larger time steps compared to standard time discretizations. The results highlight the robustness and efficiency of the proposed approach for large-scale multiscale simulations in complex heterogeneous media.
Read the full abstract

All authors Djulustan Nikiforov, Leonardo A. Poveda, Dmitry Ammosov, Yesy Sarmiento, Juan Galvis, Mohammed Al Kobaisi

Analysis of PDEs

Transfer of energy for pure-gravity water waves with constant vorticity

We consider two-dimensional periodic gravity water waves with constant nonzero vorticity $\gamma$, in infinite depth and with periodic boundary conditions. We prove that, if the characteristic wave number $\frac{\gamma^2}{g}$ is rational, the system admits smooth small-amplitude solutions whose high Sobolev norms grow arbitrarily large while lower-order norms remain arbitrarily small, thereby exhibiting a genuine transfer of energy toward high frequencies. This yields the first rigorous construction of weakly turbulent solutions for a quasilinear hydrodynamic wave system, in a regime where the flow remains smooth. Moreover, the growth occurs simultaneously in the free surface and in the vertical component of the velocity at the interface, showing that the instability involves the full hydrodynamic evolution. The proof relies on a new mechanism for generating energy cascades in quasilinear dispersive PDEs with sublinear dispersion and a nonlinear transport structure. A central ingredient is to exploit quasi-resonances from 2-wave interactions to produce a transport operator that drives energy to high modes and causes Sobolev norm growth. A virial-type argument then shows that the resulting instability affects both the free surface elevation and the velocity field.
Read the full abstract

All authors Beatrice Langella, Alberto Maspero, Federico Murgante, Shulamit Terracina

Dynamical Systems

Words and numbers: a dynamical systems perspective

Along with some known and less known results, we discuss new insights relating combinatorics of words and the ordering of the rationals from a dynamical systems point of view, somehow continuing along the path started in [BI]. We obtain in particular a set of results that structure and enrich the correspondence between the Stern-Brocot (SB) ordering of rational numbers and the corresponding ordering of Farey-Christoffel (FC) words, a class of words that, since their appearance in literature at the end of the 18th century, have revealed numerous relationships with other fields of mathematics. Among the results obtained here is the construction of substitution rules that act on the FC words in a parallel way to the maps on the positive reals that generate the permuted SB tree both vertically and horizontally. We further show that these rules naturally induce a map of the space of (infinite) Sturmian sequences into itself. Finally, a complete correspondence is obtained between the vertical and horizontal motions on the SB tree and the geodesic motions along scattering geodesics and the horocyclic motion along Ford circles in the upper half-plane, respectively.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Discrete symmetries of Feynman integrals

We perform a comprehensive study of a certain class of discrete symmetries of families of Feynman integrals, defined as affine changes of variables that map different sectors of the family into each other. We show that these transformations are always encoded into permutations of the Feynman parameters that relate the Lee-Pomeransky polynomials of the two sectors, irrespective of the integral representation used to define the Feynman integrals. We then construct an affine map in loop-momentum space that encodes such a permutation. We also show that these symmetries can be naturally embedded into the framework of twisted cohomology theories, and the period and intersection parings are invariant under the symmetry transformations. If we focus on symmetries within a fixed sector, we obtain a group acting on the twisted cohomology group, and we study the decomposition of this action into irreducible representations. One of our main mathematical results is that the character of this representation is proportional to the Euler characteristic of the corresponding fixed-point set. We then study the implications for Feynman integrals, in particular for the intersection matrix in a canonical basis. We also present a formula for the number of master integrals in a given sector in the presence of a non-trivial symmetry group in terms of the Euler characteristics of fixed-point sets. As an application, we obtain the numbers of master integrals for banana integrals with up to four loops for arbitrary configurations of non-zero masses. In order to achieve our results, we had to combine tools from various different areas of mathematics, including graph theory, group theory and algebraic topology.
Read the full abstract

All authors Claude Duhr, Sara Maggio, Cathrin Semper, Sven F. Stawinski

Category Theory

Metacat: a categorical framework for formal systems

We present a categorical framework for formal systems in which inference rules with $m$ metavariables over a category of syntax $\mathscr{S}$, taken to be a cartesian PROP, are represented by operations of arity $k \to n$ equipped with spans $k \leftarrow m \to n$ in $\mathscr{S}$, encoding the hypotheses and conclusions in a common metavariable context. Composition is by substitution of metavariables, which is the sole primitive operation, as in Metamath. Proofs in this setting form a symmetric monoidal category whose monoidal structure encodes the combination and reuse of hypotheses. This structure admits a proof-checking algorithm; we provide an open-source implementation together with a surface syntax for defining formal systems. As a demonstration, we encode the formulae and inference rules of first-order logic in Metacat, and give axioms and representative derivations as examples.
Read the full abstract

Information Theory · Cross-listed from eess.SP

Group-invariant moments under tomographic projections

Let $f:\mathbb{R}^n\to\mathbb{R}$ be an unknown object, and suppose the observations are tomographic projections of randomly rotated copies of $f$ of the form $Y = P(R\cdot f)$, where $R$ is Haar-uniform in $\mathrm{SO}(n)$ and $P$ is the projection onto an $m$-dimensional subspace, so that $Y:\mathbb{R}^m\to\mathbb{R}$. We prove that, whenever $d\le m$, the $d$-th order moment of the projected data determines the full $d$-th order Haar-orbit moment of $f$, independently of the ambient dimension $n$. We further provide an explicit algorithmic procedure for recovering the latter from the former. As a consequence, any identifiability result for the unprojected model based on the $d$-th order group-invariant moment extends directly to the tomographic setting at the same moment order. In particular, for $n=3$, $m=2$, and $d=2$, our result recovers a classical result in the cryo-EM literature: the covariance of the 2D projection images determines the second order rotationally invariant moment of the underlying 3D object.
Read the full abstract

Optimization and Control

Finite-time Reachability for Constrained, Partially Uncontrolled Nonlinear Systems

This paper presents a technique to drive the state of a constrained nonlinear system to a specified target state in finite time, when the system suffers a partial loss in control authority. Our technique builds on a recent method to control constrained nonlinear systems by building a simple, linear driftless approximation at the initial state. We construct a partition of the finite time horizon into successively smaller intervals, and design controlled inputs based on the approximate dynamics in each partition. Under conditions that bound the length of the time horizon, we prove that these inputs result in bounded error from the target state in the original nonlinear system. As successive partitions of the time horizon become shorter, the error reduces to zero despite the effect of uncontrolled inputs. A simulation example on the model of a fighter jet demonstrates that the designed sequence of controlled inputs achieves the target state despite the system suffering a loss of control authority over one of its inputs.
Read the full abstract

Dynamical Systems

Neuromodulation supports robust rhythmic pattern transitions in degenerate central pattern generators with fixed connectivity

Many essential biological functions, such as breathing and locomotion, rely on the coordination of robust and adaptable rhythmic patterns, governed by specific network architectures known as connectomes. Rhythmic adaptation is often linked to slow structural modifications of the connectome through synaptic plasticity, but such mechanisms are too slow to support rapid, localized rhythmic transitions. Here, we propose a neuromodulation-based control architecture for dynamically reconfiguring rhythmic activity in networks with fixed connectivity. The key control challenge is to achieve reliable rhythm switching despite neuronal degeneracy, a form of structured variability where widely different parameter combinations produce similar functional output. Using equivariant bifurcation theory, we derive necessary symmetry conditions on the neuromodulatory projection topology for the existence of target gaits. We then show that an adaptive neuromodulation controller, operating in a low-dimensional feedback gain space, robustly enforces gait transitions in conductance-based neuron models despite large parametric variability. The framework is validated in simulation on a quadrupedal gait control problem, demonstrating reliable gallop-to-trot transitions across 200 degenerate networks with up to fivefold conductance variability.
Read the full abstract

All authors Arthur Fyon, Alessio Franci, Pierre Sacré, Guillaume Drion

Information Theory

On quadratic binomial vectorial functions with maximal bent components

Assume $n=2m\geq 2$ and let $F(x)=x^{d_1}+x^{d_2}$ be a binomial vectorial function over $\F_{2^n}$ possessing the maximal number (i.e. $2^n-2^m$) of bent components. Suppose the $2$-adic Hamming weights $\wt_2(d_1)$ and $\wt_2(d_2)$ are both at most $2$, we prove that $F(x)$ is affine equivalent to either $x^{2^m+1}$ or $x^{2^i}(x+x^{2^m})$, provided that \[ \ell(n):=\min_{\gamma:~\F_2(\gamma)=\F_{2^n}} \dim_{\F_2}\F_2[\sigma]\gamma >m, \] where $\sigma$ is the Frobenius $(x\mapsto x^2)$ on $\F_{2^n}$, and $\gcd(d_1,d_2,2^m-1)>1$. Under this condition, we also establish two bounds on the nonlinearity and the differential uniformity of $F$ by means of the cardinality of its image set.
Read the full abstract

Functional Analysis

Spectral decomposition of doubly power-bounded elements in Banach algebras

We establish a characterization of doubly power-bounded elements with finite spectrum in Banach algebras. In particular, we present a spectral decomposition for such elements, extending a classical theorem of Gelfand concerning doubly power-bounded elements with singleton spectrum. Furthermore, we generalize a theorem of Koehler and Rosenthal for doubly power-bounded elements to the setting of Banach algebras. In the final section, we are initiating a study to investigate whether the properties of doubly power-bounded elements can offer insight into the commutativity of Banach algebras.
Read the full abstract

Combinatorics

Error analysis of quantization combined with Hadamard transforms

In this paper, we consider an image coding process consisting of the following four steps: a direct transformation, a direct quantization, an inverse quantization, and an inverse transformation, where Hadamard transforms are used for the transformation steps and a dead-zone quantizer is used for the quantization. The aim of this paper is to provide a theoretical tool for analyzing this process. We discuss error bounds for this process and bounds on the largest absolute value that the components of the result can attain. In order to obtain these bounds, we use methods of linear algebra and properties of Hadamard matrices. The obtained formulae depend on the size of the matrices, the parameters of the quantizer and the dequantizer, and a bound on the source values. Knowing the error bounds helps control the trade-off between compression efficiency and output quality. Knowing the bounds on the largest absolute value helps decide how many bits are needed to store the result. In addition, we demonstrate a connection between the norm $\|\mathbf{H}\|_{\infty, 1}$ of a Hadamard matrix $\mathbf{H}$ and the maximal excess $\sigma([\mathbf{H}])$ of the equivalence class containing $\mathbf{H}$.
Read the full abstract

Differential Geometry

Lie-Poisson reduction in principal bundles by a subgroup of the structure group

We study Hamiltonian field theories on the multisymplectic bundle of a principal G-bundle with Hamiltonian densities invariant under a subgroup $H\subset G$. Using the covariant bracket formulation, we reduce the polysymplectic space and derive the corresponding reduced observables, brackets, and equations of motion, yielding a Lie–Poisson reduction by a subgroup for field theories. We also address the reconstruction problem, characterizing reconstruction in terms of the flatness of an associated connection. Several examples, including the heavy top, molecular strands with broken symmetry, and affine principal bundles, illustrate the general framework.
Read the full abstract

Differential Geometry

Topology of 3-manifolds with nonnegative scalar curvature and positive harmonic functions

We study complete $3$-manifolds with nonnegative scalar curvature under additional regularity assumptions. We prove that a contractible such manifold is diffeomorphic to $\mathbb{R}^3$, and that an open handlebody admitting such a metric must have genus at most $1$. The proof uses exhaustions by level sets of harmonic functions and refined average gradient estimates.
Read the full abstract

Analysis of PDEs

A convergence rate for the entropic JKO scheme

The so-called JKO scheme, named after Jordan, Kinderlehrer and Otto, provides a variational way to construct discrete time approximations of certain partial differential equations (PDEs) appearing as gradient flows in the space of probability measures equipped with the Wasserstein metric. The method consists of an implicit Euler scheme, which can be implemented numerically. Yet, in practice, evaluating the Wasserstein distance can be numerically expensive. To address this problem, a common strategy introduced by Peyré in 2015 and which has been shown to produce faster computations, is to replace the Wasserstein distance with its entropic regularization, also known as the Schrödinger cost. In 2026, the first author, Hraivoronska and Santambrogio, proved that if the regularization parameter $\varepsilon$ is proportional to the time step $\tau$, that is, $\varepsilon = \alpha \tau$ for some $\alpha > 0$, then as $\tau \to 0$, this change results in adding to the limiting PDE the additional linear diffusion term $\frac{\alpha}{2} \Delta \rho$. Our goal in this article is to provide a convergence rate under convexity assumptions between the entropic JKO scheme and the solution of the initial PDE as both $\alpha$ and $\tau$ tend to zero. This will appear as a consequence of a new bound between the classical and entropic JKO schemes.
Read the full abstract

Operator Algebras

Kohn–Nirenberg quantization of the affine group and related examples

We show how to construct unitary dual $2$-cocycles for a class of semidirect products that exhibit many similarities with the affine group ${\rm Aff}(V)=\GL(V)\ltimes V$ of a finite dimensional vector space over a local skew field. The primary source of examples comes from Lie groups whose Lie algebras are Frobenius seaweeds. The construction builds on our earlier results and relies heavily on representation theory and an associated quantization procedure of Kohn–Nirenberg type. On the technical side, the key point is the observation that any semidirect product $G=H\ltimes V$ in our class can be presented as a double crossed product $G=P\bowtie N$ with respect to which the unique square-integrable irreducible representation of $G$ takes a particularly nice form. The Kohn–Nirenberg quantization that we construct is intimately related to a scalar Fourier transform $\CF\colon L^2(N)\to L^2(P)$ intertwining the left regular representations of $P$ and $N$ with representations defined by the dressing transformations.
Read the full abstract

All authors Pierre Bieliavsky, Victor Gayral, Sergey Neshveyev, Lars Tuset

Optimization and Control · Cross-listed from eess.SY

Bandwidth reduction methods for packetized MPC over lossy networks

We study the design of an offloaded model predictive control (MPC) operating over a lossy communication channel. We introduce a controller design that utilizes two complementary bandwidth-reduction methods. The first method is a multi-horizon MPC formulation that decreases the number of optimization variables, and therefore the size of transmitted input trajectories. The second method is a communication-rate reduction mechanism that lowers the frequency of packet transmissions. We derive theoretical guarantees on recursive feasibility and constraint satisfaction under minimal assumptions on packet loss, and we establish reference-tracking performance for the rate-reduction strategy. The proposed methods are validated using a hardware-in-the-loop setup with a real 5G network, demonstrating simultaneous improvements in bandwidth efficiency and computational load.
Read the full abstract

All authors Alberto Mingoia, Matthias Pezzutto, Fernando S Barbosa, David Umsonst

Logic

Coexact completion of profinite Heyting algebras and uniform interpolation

This paper shows that the sheaf representation of finitely generated free Heyting algebras constructed by Ghilardi and Zawadowski can be factored as the profinite completion of Heyting algebras, followed by identifying the dual category of profinite Heyting algebras as a full subcategory of a sheaf topos. We show that the dual category of profinite Heyting algebras is an infinitary extensive regular category, and its ex/reg-completion is exactly the aforementioned sheaf topos, which we refer to as the K-topos. We show how certain properties of uniform interpolation can be generalised to the context of arbitrary profinite Heyting algebras, and that they are consequences of the internal logic of the K-topos. Along the way we also establish various topos-theoretic properties of the K-topos.
Read the full abstract

Functional Analysis

Local Lie Theory in Quasi-Banach Lie Algebras: Convergence of the BCH Series and Geometric Implications

We develop a local Lie theory for Lie algebras equipped with a quasi-norm, i.e., complete topological vector spaces satisfying a relaxed triangle inequality $\|x+y\|\le \Ctri(\|x\|+\|y\|)$ with $\Ctri\ge 1$. We prove that the Baker–Campbell–Hausdorff (BCH) series converges in a neighborhood of the origin, provided the quasi-norm admits a continuous Lie bracket with finite continuity constant $\Cbracket$. The proof relies on the Aoki–Rolewicz theorem to construct an equivalent $p$-norm satisfying $p$-subadditivity, enabling rigorous Cauchy-sequence arguments in the complete quasi-metric space $(E, d_p)$. This yields a well-defined local Lie group structure via the exponential map. We analyze the geometric deformation induced by the quasi-norm exponent $p\in(0,1]$, showing that it modifies metric properties while preserving the underlying Lie algebraic structure. Numerical estimates of BCH coefficients up to degree $20$, with coefficients defined precisely via Hall–Lyndon basis projection, demonstrate that classical combinatorial bounds are conservative in the presence of algebraic cancellations, allowing significantly larger practical convergence radii in structured algebras. Applications include weak Schatten ideals $\mathcal{L}_{p,\infty}(H)$ for $0<p<1$ and certain Hardy-space operator algebras. \smallskip\noindentRemark on the convergence radius. The Catalan-majorant method yields convergence for $\|x\|+\|y\| < 1/(4\Cbracket)$; the additional factor $\Ctri$ appearing in the combined constant $\Ctotal = \Ctri\Cbracket$ is an artefact of switching to the $p$-norm to establish Cauchyness of partial sums. When the quasi-norm itself is directly a $p$-norm ($\Ctri=1$), no such penalty arises and the radius reduces to $1/(4\Cbracket)$.
Read the full abstract

All authors Nassim Athmouni, Mohsen Ben Abdallah, Mondher Damak, Marwa Ennaceur, Amel Jadlaoui, Lotfi Souden

Dynamical Systems

A Survey of Baker Wandering Domains

Let $f:\mathbb C\to \widehat{\mathbb C}=\mathbb C \cup\{\infty\}$ be a transcendental meromorphic function (possibly without any pole) with a single essential singularity, and that is chosen to be at $\infty$. The set of points $z\in\mathbb{{\widehat{C}}}$ such that the family of iterates $\{f^n\}_{n\geq 0}$ is defined and forms a normal family in a neighborhood of $z$ is known as the Fatou set of $f$. For a Fatou component $W$, let $W_j$ denote the Fatou component containing $f^j(W)$. A Fatou component $W$ is called wandering if $W_m\bigcap W_n=\emptyset$ for all $m \neq n$. A wandering domain $W$ of $f$ is called a Baker wandering domain, if each $W_n$ is bounded, multiply connected, and $W_n$ surrounds $0$ for all large $n$ and, dist$(W_n,0)\to\infty$ as $n\to\infty$. This paper surveys the current state of knowledge on Baker wandering domains. We revisit the first example of the Baker wandering domain followed by other examples. The influence of Baker wandering domain on the singular values and dynamics of the function is presented. We also discuss some classes of functions that do not possess any Baker wandering domain. Several problems are proposed throughout the article at relevant places.
Read the full abstract

Dynamical Systems

Marked magnetic action rigidity

An exact magnetic system over a closed manifold $M$ consists of a pair $(g,\alpha)$, where $g$ is a Riemannian metric and $\alpha$ is a 1-form encoding a magnetic field. In this context, we consider a generalization of the marked length rigidity conjecture: does the marked magnetic action spectrum of magnetic systems with Anosov magnetic flow determine the metric and the 1-form, up to a natural obstruction? In this article we answer this question in two settings: 1) locally for systems with close metrics and 1-forms and 2) for metrics in the same conformal class.
Read the full abstract

Dynamical Systems

Generalized Lotka-Volterra Model with Species Turnover in a Variable-Basis State Space

The state space is a fundamental concept for describing the trajectory of a dynamic system. Depending on its form, it can highlight certain changes over time while ignoring others. This is particularly the case for the spaces associated with theoretical ecology models, notably the generalized Lotka-Volterra (gLV) model, which allows the modeling of interacting populations. The fixed-dimension state space classically used in gLV models does not account for the effective renewal of species through addition, removal, or mutation. To address this limitation, we propose a new variable-base state space, introduced in a previous study. This framework leads to a reformulation of the gLV model within the context of hybrid dynamical systems. To illustrate the approach, we apply the proposed model to the gut microbiota, particularly in the context of bacteriotherapy following antibiotic treatment.
Read the full abstract

All authors Arthur Doliveira, Christophe Roman, Guillaume Graton, Mustapha Ouladsine

Numerical Analysis

Local discontinuous Galerkin FEM for convex minimization

The heart of the a priori and a posteriori error control in convex minimization problems is the sharp control of the differences of discrete and exact minimal energy. Conforming finite element discretizations for p-Laplace type minimization problems provide upper bounds of the energy difference with optimal convergence rates. Even for smooth solutions, known convergence rates for higher-order non-conforming finite element discretizations for the same problem class with $2 < p < \infty$, however, are exclusively suboptimal. Thus the popular a posteriori error control within the two-energy principle, that generalize hyper-circle identities, appears unbalanced. The innovative point of departure in a refined analysis of two discontinuous Galerkin (dG) schemes exploits duality relations between a discrete primal and a semi-discrete dual problem. The infinite-dimensional dual problem leads to a tiny duality gap that even vanishes for polynomial low-order terms. For a class of degenerated convex minimization problems with two-sided $p$ growth, the novel duality provides improved a priori convergence rates for the error in the minimal energies. This closes the misfit of convergence rates for the conforming and nonconforming schemes at least for the local discontinuous Galerkin schemes at hand. The motivating two-energy principle and some post-processing for a Raviart-Thomas dual variable provides an a posteriori error control, that also may drive adaptive mesh-refining. Computational benchmarks provide numerical evidence for improved convergence rates of the adaptive beyond uniform mesh-refining.
Read the full abstract

Optimization and Control

Improved Convergence for Decentralized Stochastic Optimization with Biased Gradients

Decentralized stochastic optimization has emerged as a fundamental paradigm for large-scale machine learning. However, practical implementations often rely on biased gradient estimators arising from communication compression or inexact local oracles, which severely degrade convergence in the presence of data heterogeneity. To address the challenge, we propose Decentralized Momentum Tracking with Biased Gradients (Biased-DMT), a novel decentralized algorithm designed to operate reliably under biased gradient information. We establish a comprehensive convergence theory for Biased-DMT in nonconvex settings and show that it achieves linear speedup with respect to the number of agents. The theoretical analysis shows that Biased-DMT decouples the effects of network topology from data heterogeneity, enabling robust performance even in sparse communication networks. Notably, when the gradient oracle introduces only absolute bias, the proposed method eliminates the structural heterogeneity error and converges to the exact physical error floor. For the case of relative bias, we further characterize the convergence limit and show that the remaining error is an unavoidable physical consequence of locally injected noise. Extensive numerical experiments corroborate our theoretical analysis and demonstrate the practical effectiveness of Biased-DMT across a range of decentralized learning scenarios.
Read the full abstract

All authors Qing Xu, Yiwei Liao, Wenqi Fan, Xingxing You, Songyi Dian

Information Theory

On the Capacity of Sequences of Coloring Channels

A single coloring channel is defined by a subset of letters it allows to pass through, while deleting all others. A sequence of coloring channels provides multiple views of the same transmitted letter sequence, forming a type of sequence-reconstruction problem useful for protein identification and information storage at the molecular level. We provide exact capacities of several sequences of coloring channels: uniform sunflowers, two arbitrary intersecting sets, and paths. We also show how this capacity depends solely on a related graph we define, called the pairs graph. Using this equivalence, we prove lower and upper bounds on the capacity, and a tailored bound for a coloring-channel sequence forming a cycle. In particular, for an alphabet of size $4$, these results give the exact capacity of all coloring-channel sequences except for a cycle of length $4$, for which we only provide bounds.
Read the full abstract

Numerical Analysis

Five-Structures Preserving Algorithm for charge dynamics model

This paper develops a family of fast, structure-preserving numerical algorithms for the nonlinear Maxwell-Ampere Nernst-Planck equations. For the first-order scheme, the Slotboom transformation rewrites the Nernst-Planck equation to enable positivity preservation. The backward Euler method and centered finite differences discretize the transformed system. Two correction strategies are introduced: one enforces Gauss's law via a displacement correction, and the other preserves Faraday's law through potential reconstruction. The fully discrete scheme exactly satisfies mass conservation, concentration positivity, energy dissipation, Gauss's law, and Faraday's law, with established error estimates. The second-order scheme adopts BDF2 time discretization while retaining the same structure-preserving strategies, exactly conserving mass, Gauss's law, and Faraday's law. Numerical experiments validate both schemes using analytical solutions, confirming convergence orders and positivity preservation. Simulations of ion transport with fixed charges demonstrate exact preservation of Gauss's and Faraday's laws over long-time evolution, reproducing electrostatic attraction, ion accumulation, and electric field screening. The results fully support the theoretical analysis and the schemes' stability and superior performance.
Read the full abstract

Optimization and Control

Free-Energy Minimizing Policies Under Generative Model Ambiguity

We present a variational free-energy formulation for distributionally robust decision-making with ambiguity in the generative model. The formulation, related to a broad range of learning and control frameworks, yields a minimax optimal control problem where maximization is over an uncertainty set that represents ambiguities. We prove that computing the optimal policy requires solving a non-convex minimization problem and propose an algorithm with convergence guarantees to find the solution. The effectiveness of our results is illustrated via simulations on a pendulum swing-up problem.
Read the full abstract

Optimization and Control

Stochastic Momentum Tracking Push-Pull for Decentralized Optimization over Directed Graphs

Decentralized optimization over directed networks is frequently challenged by asymmetric communication and the inherent high variance of stochastic gradients, which collectively cause severe oscillations and hinder algorithmic convergence. To address these challenges, we propose the Stochastic Momentum Tracking Push-Pull (SMTPP) algorithm, which tracks the momentum term rather than raw stochastic gradients within the Push-Pull architecture. This design successfully decouples the variance reduction capacity from the algebraic connectivity of the graph.Although the inherent topology mismatch of directed graphs precludes exact convergence under persistent stochastic noise, SMTPP rigorously compresses this unavoidable steady-state error floor into a minimal neighborhood determined by network connectivity and gradient variance. Furthermore, SMTPP guarantees convergence on any strongly connected directed graph. Extensive experiments on non-convex logistic regression demonstrate that the algorithm is highly robust to network connectivity. By effectively dampening topology-induced oscillations, SMTPP achieves convergence rates and overall performance that closely match those of centralized baselines, regardless of whether the network is sparse or dense.
Read the full abstract

All authors Wenqi Fan, Yiwei Liao, Qing Xu, Bin Guo, Songyi Dian

Combinatorics

Ramsey numbers for regular induced subgraphs

A problem proposed by Erdős, Fajtlowicz and Staton asks for the smallest $n$ for which every graph on $n$ vertices contains a regular induced subgraph of order at least $k$. A variation is to ask for a regular induced subgraph of order exactly $k$. In this paper we provide exact values for $k\le 5$ and lower bounds for $k=6$ and $k=7$. We also improve the general lower bound of Alon, Krivelevich and Sudakov [SIAM J. Disc. Math, 2008].
Read the full abstract

Information Theory

Quantum Integrated Communication and Computing Over Multiple-Access Bosonic Channel

We investigate a quantum integrated communication and computation (QICC) scheme for a single-mode bosonic multiple-access channel (MAC) with coherent-state signalling. By exploiting the natural superposition property of the quantum MAC, a common receiver simultaneously performs over-the-air computation (OAC) on the analogue symbols transmitted by one set of devices and decodes multiple-access data from another. The joint design of the transmit power control and the receive coefficient leads to a non-convex optimization problem that maximizes computation accuracy under a prescribed sum-rate communication constraint. To address this challenge, we develop a low-complexity alternating-optimization framework that incorporates: (i) closed-form linear minimum-mean square error updates for the receive coefficient, (ii) monotonicity properties of the quantum sum-rate constraint, and (iii) projected-gradient refinements for the communication powers. The proposed QICC scheme achieves an effective computation-communication trade-off with fast convergence and low computational complexity.
Read the full abstract