Combinatorics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Wednesday 15 April
In this article, we provide three formulas allowing to compute the minimum amount of initial chips leading to an infinite Chip-firing game, answering a question originally posed by Björner and Lovász in 1992. These formulas hold for strongly connected directed loop-free multigraphs and generalize what was already known in the Eulerian case. The various proofs heavily rely on a notion of dynamical bound, which allows to encode some specific sequences of chip configurations.
Optimization and Control
Optimal control of the coagulation-fragmentation equation
We formulate and analyse an optimal control problem for the coagulation-fragmentation equation, where a scalar, time-dependent control modulates the coagulation rate by multiplying the coagulation kernel. The objective functional consists of a quadratic penalisation of the control and a terminal cost depending on the final size distribution. In a weighted $L^1$ framework, we prove weak-to-weak continuity of the control-to-state map under perturbations of the coefficients and obtain existence of optimal controls by the direct method. We then establish $\Gamma$-convergence of the corresponding cost functionals, providing stability of optimal controls and justifying truncation of unbounded kernels in the optimisation setting. For bounded coagulation kernels we show differentiability of the dynamics, derive an adjoint equation, and obtain a Pontryagin-type minimum principle. Lipschitz continuity of the gradient with respect to the control yields, at the continuous level, convergence of a projected-gradient algorithm with Armijo backtracking. A proof-of-concept finite-volume implementation is then used in a numerical study targeting the number of particles within a prescribed size window, demonstrating that a single low-dimensional actuator can effectively reshape an infinite-dimensional particle-size distribution.
Read the full abstract
Numerical Analysis
A higher-order dual cell method for time-domain Maxwell equations
We present a higher-order extension of the dual cell method for the time-domain Maxwell equations in three spatial dimensions. The approach builds upon a variational reinterpretation of the Finite Integration Technique on dual meshes and generalises a previously developed two-dimensional high-order formulation. The electric and magnetic fields are discretised on mutually dual barycentric grids using curl-conforming polynomial spaces constructed via tensor-product Gauss–Radau interpolation. The resulting semi-discrete formulation yields block-diagonal mass matrices and sparse discrete curl operators, enabling explicit time integration while preserving a discrete energy identity. Special attention is devoted to the construction of compatible approximation spaces on the three-dimensional primal and dual meshes, the reference-to-physical element mappings, and the preservation of tangential continuity. We show that the method achieves arbitrary-order convergence, avoids spurious modes, and maintains optimal sparsity properties. Numerical experiments confirm spectral correctness, high-order accuracy, and computational efficiency on unstructured tetrahedral meshes.
Read the full abstract
Rings and Algebras
Commutativity of centralizers in a coproduct of a free algebra and a polynomial algebra
We show that the centralizer of a nonscalar element in the coproduct $k\langle X\rangle *k[Y]$ of a free associative algebra and a polynomial algebra over a given field is commutative. For $k\langle X \rangle$ this is part of Bergman's centralizer theorem. Our proof relies on a reduction given in Bergman's proof and is of combinatorial nature, employing a strict order structure of the coproduct monoid.
Read the full abstract
Optimization and Control
Anchored Spectral Estimator for Rigid Motion Synchronization
A rigid motion in $\mathbb{R}^d$ consists of a proper rotation and a translation, and it can be represented as a matrix in $\mathbb{R}^{(d+1)\times (d+1)}$. The problem of rigid motion synchronization aims to estimate a collection of rigid motions $G^*_1, \dots, G^*_n$ from noisy observations of their comparisons ${G^*_i}^{-1} G^*_j$. Such problems naturally arise in diverse applications across signal processing, robotics, and computer vision, and have thus attracted intense research attention in recent years. Motivated by geometric considerations, this paper develops a novel spectral approach for rigid motion synchronization, called the anchored spectral estimator (ASE). Theoretically, we establish uniform estimation error bounds for the estimators produced by ASE. Empirically, we show that ASE outperforms the widely used two-stage approach, which first estimates the rotations and then the translations. Further numerical experiments on the multiple point-set registration problem are presented to demonstrate the superiority of ASE over state-of-the-art methods.
Read the full abstract
Classical Analysis and ODEs
Hausdorff dimension of the graph of a random vector-valued Weierstrass function
Let $\{\theta_n,\lambda_n:n\geq0\}$ be mutually independent random variables, each uniformly distributed on $[0,1]$, and write $\Theta=(\theta_n)_{n\geq0}$ and $\Lambda=(\lambda_n)_{n\geq0}$. The random vector-valued Weierstrass function is given by $$f_{\Theta,\Lambda}(x)= \left( \sum_{n=0}^{\infty} a^n\cos\bigl(2\pi (b^n x+\theta_n)\bigr),\ \sum_{n=0}^{\infty} a^n\sin\bigl(2\pi (b^n x+\lambda_n)\bigr) \right), \; x\in[0,1],$$ where $0<a<1<b,\ ab> 1$. The Hausdorff dimension of the graph of this function is proved to be $$\dim_H G(f_{\Theta,\Lambda}) = \min\left\{-\frac{\log b}{\log a}, \, 3 +2\frac{\log a}{\log b}\right\} \quad \text{a.s}.$$
Read the full abstract
Analysis of PDEs
Scalar anomalous dissipation and optimal regularity via iterated homogenization
For any $\beta_0<1/3$ we construct divergence free vector fields in $ C_{x,t}^{\beta_0}$ and a sequence of diffusivities $\kappa_q \searrow 0$ such that, for an arbitrary initial datum from a low regularity class, the classical solution $\rho_q$ to the advection-diffusion equation exhibits anomalous dissipation along the sequence $\kappa_q$. At the same time $\rho_q$ remains uniformly bounded in $C_t^{0} C_x^{\alpha_0}$, where $\beta_0 + 2\alpha_0<1$. Our result confirms a conjecture of Armstrong and Vicol \cite{ArmstrongVicol} and shows sharpness of the Obukhov-Corrsin threshold within the context of iterated homogenization. Our construction confirms time-homogeneity of the dissipation anomaly, as required in turbulence theory, and as a consequence we also obtain better time regularity for the scalar $\rho_q$ than the classical prediction of Yaglom.
Read the full abstract
Commutative Algebra
A constructive proof of Orzech's theorem
Let $A$ be a commutative ring with unity, and $M$ a finitely generated $A$-module. In 1971, Morris Orzech showed that any surjective $A$-module homomorphism from a submodule of $M$ to $M$ must be an isomorphism. We give a constructive proof of this fact using the Cayley–Hamilton theorem.
Read the full abstract
Group Theory
Hyperbolic spaces with geometric and geometrically finite quasi-actions are symmetric
We prove that if a proper metric space is quasi-isometric to a finitely generated group and to a space with a horoball over a finitely generated group, then that space is quasi-isometric to a rank-one symmetric space or the real line.
Read the full abstract
Analysis of PDEs
Existence and Regularity in the Small-Mass Regime for a Hartree–Ohta-Kawasaki Shape Optimization Problem
We consider a shape optimization problem for a hybrid energy combining local confinement and nonlocal Coulomb repulsion. Specifically, for any open set $\Omega \subseteq \mathbb{R}^3$ of prescribed volume, we consider the ground state energy of an $L^2$-normalized function supported in $\Omega$, defined as a linear combination of its homogeneous $\dot{H}^1$ and $\dot{H}^{-1}$ seminorms. We show that in the small mass regime, volume-constrained minimizers of this geometric functional exist and are $C^{2,\alpha}$ perturbations of a ball. The proof relies on a combination of surgery techniques, $\Gamma$-convergence, elliptic PDE theory, and one-phase free boundary regularity. A key novelty of this paper lies in the treatment of the Coulombic repulsive term: unlike standard competitive models, the lack of (a priori) sign constraints on the optimal functions forces the nonlocal term to exhibit two natures: it acts both as a scattering and an homogenizing force.
Read the full abstract
Mathematical Physics · Cross-listed from quant-ph
Wandering range of robust quantum symmetries
This paper introduces the concept of the wandering range of a robust symmetry $S$ of a Hamiltonian $H$. This quantity measures how the perturbed time evolution $\mathrm{e}^{\mathrm{i}t(H+\varepsilon V)} S \mathrm{e}^{-\mathrm{i} t(H+\varepsilon V)}$ deviates from its unperturbed counterpart $\mathrm{e}^{\mathrm{i} tH} S\mathrm{e}^{-\mathrm{i} tH} = S$. Although the wandering range does not necessarily scale linearly with the perturbation strength $\varepsilon$, we identify conditions under which this linear behavior is recovered and we obtain explicit nonperturbative bounds.
Read the full abstract
Numerical Analysis
A Two-Level Additive Schwarz Method for Computing Interior Multiple and Clustered Eigenvalues of Symmetric Elliptic Operators
In this paper, we propose an efficient two-level additive Schwarz method for solving large-scale eigenvalue problems arising from the finite element discretization of symmetric elliptic operators, which may compute efficiently more interior multiple and clustered eigenvalues other than only the first several smallest eigenvalues. The proposed method is parallel in two ways: one is to solve the preconditioned Jacobi-Davidson correction equations by the two-level additive Schwarz preconditioner, the other is to solve different clusters of eigenvalues (see Figure 1 in Introduction) simultaneously. It only requires computing a series of parallel subproblems and solving a small-dimensional eigenvalue problem per iteration for a cluster of eigenvalues. Based on some new estimates and tools, we provide a rigorous theoretical analysis to prove that convergence factor of the proposed method is bounded by $\gamma=c(H)\rho(\frac{\delta}{H},d_{m}^{-},d_{M}^{+})$, where $H$ is the diameter of subdomains, $\delta$ is the overlapping size and $d_{m}^{-},d_{M}^{+}$ are the distances from both ends of the targeted eigenvalues to others (see Figure 2 in Introduction). The positive number $\rho(\frac{\delta}{H},d_{m}^{-},d_{M}^{+})<1$ is independent of the fine mesh size and the internal gaps among the targeted eigenvalues. The $H$-dependent constant $c(H)$ decreases monotonically to 1, as $H\to 0$, which means the more subdomains lead to the better convergence. Numerical results supporting our theory are given.
Read the full abstract
Combinatorics
Some remarks on the orbit dimension of transitive groups and on the metric dimension of Johnson graphs
The orbit dimension $\sigma(G)$ (also called the separation number or rigidity index) of a permutation group $G$ with domain $\Omega$ is the minimum cardinality of a subset $S \subseteq \Omega$ such that, for any two distinct elements $\omega,\omega'\in \Omega$, there exists $\alpha\in S$ for which $\omega$ and $\omega'$ lie in distinct orbits of the stabilizer $G_\alpha$. In this paper, we first observe that if $G$ is transitive, then $\sigma(G)\le |\Omega|-r+1$, where $r$ is the rank of $G$, and we obtain strong structural information on the groups for which equality holds. Next, we investigate the orbit dimension in the case where $G$ is the symmetric group of degree $n$, acting on the set of $k$-subsets of $\{1,\ldots,n\}$. In this case, this invariant equals the metric dimension of Johnson graphs.
Read the full abstract
K-Theory and Homology
An Euler Characteristic for Unbounded Chain Complexes
We propose a definition of an Euler characteristic for unbounded chain complexes by taking the (usual) Euler characteristics of successively longer parts of the complex, weighted inversely proportional to the length, and passing to the limit. This amounts to taking the limit of the sequence of ranks of homology modules with alternating signs in the sense of the Hölder summation method. We establish the structure of a category with cofibrations and weak equivalences on unbounded complexes for which the infinite Euler characteristic is defined, and show that its Grothendieck group is unusually large (viz., uncountable).
Read the full abstract
Optimization and Control
Gradient Descent's Last Iterate is Often (slightly) Suboptimal
We consider the well-studied setting of minimizing a convex Lipschitz function using either gradient descent (GD) or its stochastic variant (SGD), and examine the last iterate convergence. We prove that $\Theta(\sqrt{\log(T)/T})$ is the optimal anytime rate attainable with a fixed stepsize schedule (that does not depend on the total number of steps $T$). The upper bound holds already for SGD, and improves on the $\log(T)/\sqrt{T}$ rate of Shamir and Zhang [2013], as well as the $\sqrt{\log(T)/T}$ rate of Zamani and Glineur [2023] which was proven only for deterministic GD. The matching lower bound holds already for GD, and confirms the conjecture of Jain et al. [2019], namely that the optimal $1/\sqrt{T}$ rate for the last iterate cannot be obtained without prior knowledge of $T$.
Read the full abstract
Number Theory
Fourier Dimension in Inhomogeneous Duffin–Schaeffer Conjecture
Let \(Q \subseteq \mathbb{N}\) be a subset, and let \(\psi\colon \mathbb{N} \to [0, \tfrac{1}{2})\), \(\theta\colon \mathbb{N} \to \mathbb{R}\) be functions. Let \(\{A_q\}\) and \(\{B_q\}\) be sequences of integers such that \(\gcd(A_q, B_q) = 1\) and \(B_q > 0\) for all \(q\). Define \(W_Q^{\ast}(\psi,\theta)\) to be the set of \(x \in [0,1]\) for which \[ \left| x - \frac{p + \theta(q)}{q} \right| < \frac{\psi(q)}{q} \] holds for infinitely many \((p,q) \in \mathbb{Z} \times Q\) with \(\gcd(B_q p + A_q, q) = 1\). In this paper, we determine the Fourier dimension of \(W_Q^{\ast}(\psi,\theta)\). Our result not only recovers the classical theorems of Kaufman and Bluhm (concerning the homogeneous case \(\psi(q) = q^{-\tau}\) with \(\tau \ge 1\)) and the one-dimensional version of a result by Cai and Hambrook on the inhomogeneous approximable set, but also provides a complete inhomogeneous generalization. Moreover, it gives an affirmative answer to the coprime formulation of the Chen–Xiong conjecture.
Read the full abstract
Optimization and Control
Mamba Sequence Modeling meets Model Predictive Control
In this paper, we consider the design of Model Predictive Control (MPC) algorithms based on Mamba neural networks. Mamba is a neural network architecture capable of sub-quadratic computational scaling in sequence length with state-of-the-art modeling capabilities. We provide a consistent and complete mathematical description of the Mamba neural network is provided. Then, adjustments and optimizations are made to construct a decoder-only Mamba multi-step predictor for MPC and an input-output formulation is given for sequence-to-sequence modeling of dynamical systems. The performance of Mamba-MPC is evaluated on several numerical examples and compared to a Long-Short-Term-Memory based MPC (LSTM-MPC) equivalent. First, a Single-Input-Single-Output (SISO) Van der Pol oscillator is considered, where stability, reference tracking, and noise robustness are evaluated. Then, a MIMO Four Tank setup is introduced where Multiple-Input-Multiple-Output (MIMO) reference tracking is evaluated. Lastly, Mamba-MPC is implemented on a physical Quanser Aero2 setup for closed-loop reference tracking. The results demonstrate that Mamba-MPC is able to stabilize and track a reference for SISO and MIMO systems, both in simulation and on a physical setup. Moreover, Mamba-MPC consistently outperforms LSTM-MPC in predictive control and is significantly computationally faster.
Read the full abstract
Analysis of PDEs
Propagation of chaos for the Boltzmann equation with very soft potentials
We build solutions to Kac's particle system and show that their empirical measures converge to the solution of the space-homogeneous Boltzmann equation in the regime of very soft potentials. This proves propagation of chaos for the last class of kernels for which it was still open. The proof relies on new estimates on the dissipation of the Fisher information along the Boltzmann equation, which allow us to control the strong singularities of the system. These estimates are obtained thanks to a new inequality related to the fractional heat flow on the sphere, that might be of independent interest.
Read the full abstract
Number Theory
A proof of $p$-adic Gross–Zagier theorem via BDP formula
This paper provides a new proof of the $p$-adic Gross–Zagier formula for the $p$-adic $L$-function associated with the base change of a normalised cuspidal eigen-newform $f$ of weight $k \geq 2$ (and families of such) to an imaginary quadratic field $K$. Our results encompass both the classical $p$-ordinary cases and non-ordinary scenarios, including new cases where $k > 2$ and $\mathrm{ord}_p(a_p(f)) > 0$. Unlike the traditional approach of comparing geometric and analytic kernels, we employ a “wall-crossing” strategy centred on the BDP formula and the theory of Beilinson–Flach elements.
Read the full abstract
Mathematical Physics · Cross-listed from cond-mat.stat-mech
First Passage Times for Variable-Order Time-Fractional Diffusion
We derive the asymptotic first passage time (FPT) distribution for space-dependent variable-order time-fractional diffusion, where the fractional exponent $\alpha(x)$ varies with position. On a bounded interval with an absorbing and a reflecting boundary, we show that the survival probability decays as $\Psi(t)\sim C\,t^{-\alpha_*}/[\ln (t/\tau)]^{\nu}$, where $\alpha_*$ is the minimum value of the fractional exponent and $\nu$ is determined by the location and shape of the minimum. The exponent $\nu$ is fixed by the location and order of the minimum, taking the value $1/k$ at a $k$\textsuperscript{th}-order interior minimum, $1$ at the reflecting boundary and $2$ at the absorbing boundary. For a constant fractional exponent, $\nu=0$, so the logarithmic factor distinguishes a continuously varying order field from a homogeneous medium. We recover both exponents from simulated first passage times by a direct linear fit, with no amplitude or geometric input. We validate the theory against exact Laplace-space solutions and Monte Carlo simulations for linear and nonlinear profiles of $\alpha(x)$.
Read the full abstract
Combinatorics
New bounds for Ramsey numbers involving graphs with a center
Let $F_n$, $W_n$, and $\widehat{K}_n$ be the graphs obtained by joining a vertex to $n$ independent edges, a cycle and a path of order $n-1$, respectively. In this paper, we give new bounds for the Ramsey numbers $R(F_n,F_m)$ and $R(W_n,W_n)$, which improve those due to Chen, Yu, and Zhao [EJC, 2021] and Mao, Wang, Magnant, and Schiermeyer [G&C, 2022], respectively, and establish lower and upper bounds for $R(\widehat{K}_n,\widehat{K}_n)$. Moreover, we present a blow-up technique to establish some new lower bounds for the Ramsey numbers of wheels versus cliques.
Read the full abstract
Probability
Minkowski content construction of the CLE gasket measure
We show that the canonical conformally covariant measure on the conformal loop ensemble (CLE$_\kappa$) gasket/carpet, previously constructed indirectly by the first co-author and Schoug, can be realized as the limit of several natural approximation schemes. These include the Euclidean Minkowski content and its box-count variants, the properly renormalized number of dyadic squares that intersect the gasket, and the properly renormalized minimal number of balls of radius $\delta$ necessary to cover the gasket with respect to both its canonical geodesic and resistance metrics. This in particular allows us to identify the CLE$_6$ gasket measure with the conformally covariant measure constructed by Garban–Pete–Schramm as a scaling limit of the number of vertices in a macroscopic critical percolation cluster on the triangular lattice. Along the way, we show that the CLE gasket measure of every fixed compact set has finite moments of all orders; previously this was only known for first moments.
Read the full abstract
Mathematical Physics
On hyperbolic and rational solutions of the cubically nonlinear Schrödinger equation
In a previous article we have proved non-existence of certain "solutions" of the cubically nonlinear Schrödinger equation in the general case, and presented solutions in the non-generic case. – In the present article we describe a further family of solutions enlarging the set of non-generic solutions.
Read the full abstract
Analysis of PDEs
Gradient Catastrophe for Solutions to the Hyperbolic Navier-Stokes Equations
This paper studies local existence and the singularity formation of the solutions of the one-dimensional hyperbolic Navier-Stokes equations, in particular proving the gradient blow-up of the derivatives of the solutions. The underlying model introduces a relaxation mechanism that leads to hyperbolization, achieved both through a nonlinear Cattaneo law for heat conduction and through Maxwell-type constitutive relations for the stress tensor. Our main approach is to prove that the hyperbolic Navier-Stokes equations are indeed hyperbolic, and to prove that they possess two genuinely nonlinear eigenvalues, thereby establishing the blow-up of the gradient of the solution. In addition, we provide a derivation of the equation of state for the hyperbolic Navier-Stokes equations in the appendix.
Read the full abstract
Optimization and Control
Potential Games on Unimodular Random Graphs
We study potential games on unimodular random graphs of bounded degree, where players interact through the underlying network. Using the unimodular measure, we define a well-posed global potential that captures both finite- and infinite-player games. A key observation is that the mass-transport principle identifies the first variation of this potential with the first-order condition of a representative (root) player. Under suitable convexity assumptions, we prove that minimizers of the potential coincide with quenched Nash equilibria, and conversely. We also establish the thermodynamic limit of the potential along weakly convergent sequences of unimodular measures. Finally, we present examples with semi-explicit equilibrium descriptions. In linear-quadratic games on unimodular graphs, equilibria are expressed in terms of the Green kernel of the simple random walk operator, while in convex settings, equilibria are characterized by solutions to nonlinear Poisson equations.
Read the full abstract
Numerical Analysis
Randomized Neural Networks for Integro-Differential Equations with Application to Neutron Transport
Integro-differential equations arise in a wide range of applications, including transport, kinetic theory, radiative transfer, and multiphysics modeling, where nonlocal integral operators couple the solution across phase space. Such nonlocality often introduces dense coupling blocks in deterministic discretizations, leading to increased computational cost and memory usage, while physics-informed neural networks may suffer from expensive nonconvex training and sensitivity to hyperparameter choices. In this work, we present randomized neural networks (RaNNs) as a mesh-free collocation framework for linear integro-differential equations. Because the RaNN approximation is intrinsically dense through globally supported random features, the nonlocal integral operator does not introduce an additional loss of sparsity, while the approximate solution can still be represented with relatively few trainable degrees of freedom. By randomly fixing the hidden-layer parameters and solving only for the linear output weights, the training procedure reduces to a convex least-squares problem in the output coefficients, enabling stable and efficient optimization. As a representative application, we apply the proposed framework to the steady neutron transport equation, a high-dimensional linear integro-differential model featuring scattering integrals and diverse boundary conditions. Extensive numerical experiments demonstrate that, in the reported test settings, the RaNN approach achieves competitive accuracy while incurring substantially lower training cost than the selected neural and deterministic baselines, highlighting RaNNs as a robust and efficient alternative for the numerical simulation of nonlocal linear operators.
Read the full abstract
Complex Variables
Contractive analytic self-mappings of the disc
Analytic self-maps of the unit disc whose hyperbolic derivative is uniformly bounded by a constant smaller than one, are called contractive. We describe these maps in terms of their Aleksandrov-Clark measures and in terms of their inner-outer factorization. In addition, we show that contractive inner functions can be described in terms of a certain mixing property of its boundary values. We also present other results on the boundary behavior of contractive inner functions.
Read the full abstract
Algebraic Geometry
Mumford vanishing for threefolds in positive characteristic
Let $X$ be a projective klt threefold in characteristic $p>5$ and let $L$ be a nef Cartier divisor on $X$. We show that $H^1(X, -L)=0$ for the following two cases: (1) $K_X$ is not big and $L$ is big; (2) $-K_X$ is nef and $L$ is of numerical dimension two.
Probability
Convolution, cumulants and infinitesimal generators in the formal power series ring
We extend the notions of finite free convolution and finite free cumulants to the setting of formal power series by introducing their natural analogues, namely $t$-deformed convolution and $t$-deformed cumulants. In this framework, we establish $t$-deformed analogues of the law of large numbers and the central limit theorem, revealing structural parallels with classical, free, and finite free probability theories. We show that the case $t=-1$ recovers classical convolution at the level of moment generating functions, thereby connecting the theory directly to classical probability. We further investigate the infinitesimal generators associated with $\boxplus^t$-continuous semigroups, deriving explicit representation formulas that clarify how these generators describe the infinitesimal evolution of the semigroup. In the case $t = d$, our results yield explicit formulas for finite free infinitesimal generators. In the case $t = -1$, we relate these generators to those of one-dimensional Lévy processes by identifying the corresponding terms in their representations. This establishes a direct connection between $\boxplus^t$-convolution semigroups and classical Lévy-Khintchine-type generators.
Read the full abstract
Rings and Algebras
Symbolic computation in cubic Jordan matrix algebras and in related structures
We present CubicJordanMatrixAlg, a GAP package for symbolic computation in cubic Jordan matrix algebras and in related Lie-theoretic structures. As an application, we use it to compute certain (commutator) relations in $F_4$-graded groups that were constructed by De Medts and the author from cubic Jordan matrix algebras.