Combinatorics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Monday 27 April
The Ramsey number $r_k(s,n)$ is the smallest integer $N$ such that every $N$-vertex $k$-graph contains either a copy of $K_s^{(k)}$ or an independent set of size $n$. We prove that $r_4(5,n)\ge 2^{2^{cn^{1/7}}}$, where $c>0$ is an absolute constant. As a consequence, we determine the tower growth rate of $r_k(k+1,n)$, which completely solves the problem of establishing the tower growth rate for all classical off-diagonal hypergraph Ramsey numbers, first posed by Erdős and Hajnal in 1972.
Statistics Theory
A Geometric Witness Framework for Signed Multivariate Tail-Dependence Compatibility: Asymptotic Structure and Finite-Threshold Synthesis
We study multivariate tail-dependence compatibility for complete and partial signed tail families, treating lower-tail, upper-tail, and mixed configurations in one geometric witness representation indexed by active coordinate sets and sign patterns. For a complete signed tail family, witness generator weights w = (w_{I,sigma}) give a linear incidence parametrization and are recovered by explicit triangular inversion. Excluding the geometric scale p0, the complete case uses 3^d - 1 generator weights, matching the number of complete signed tail coefficients; for partial specifications, only selected target coefficients need be prescribed. At a fixed threshold p0 in (0, 1/2), the inversion identifies the normalized noncentral ternary cell masses of any realizing copula. Hence finite-threshold compatibility is characterized by nonnegative recovered generator weights, singleton normalization, and the residual central-mass constraint. This yields a complete Moebius-type synthesis within the witness framework. If the recovered increments are nonnegative and singleton normalization holds, then S(w) = sum(w) determines the admissible finite-scale range, and every admissible p0 gives an exact witness realization. In the canonical ray geometry, such a realization preserves the same complete signed tail family throughout 0 < p <= p0. Thus the primary object is the complete signed tail family lambda: it is realized at every admissible finite scale and can be carried along families of witness copulas with p0 decreasing to 0. Partial, noisy, or inconsistent specifications are treated through linear-feasibility and weighted-l1 recovery problems in the same parametrization. The representation separates the p0-free incidence/Moebius layer from finite-threshold realization and provides tools for realization, simulation, calibration, completion, repair, and scenario design.
Read the full abstract
Probability
Accelerating sampling via asymptotic relaxation enhancing flows
In this paper, we accelerate Langevin Monte Carlo sampling from Gibbs measures $\pi\propto \exp(-U)$ by adding a large drift that preserves the invariant measure. For warm-start initial data, we characterize the sharp asymptotic decay rate of the relative entropy and introduce asymptotic relaxation enhancing flows: sequences that achieve arbitrarily fast decay. We construct such flows on the torus by scaling cellular flows and pushing them forward via diffeomorphisms, and we extend the construction to the full space using a Lyapunov function method to control behavior at infinity without periodization, obtaining explicit finite energy flows that guarantee arbitrarily fast convergence under natural growth conditions on $U$.
Read the full abstract
Optimization and Control
SUDA-Muon: Structural Design Principles and Boundaries for Fully Decentralized Muon
Fully decentralized Muon is difficult because its nonlinear matrix-sign operator does not commute with linear gossip averaging. This makes decentralized Muon a structural design problem: in designing the algorithm, one must distinguish modular components from non-modular ones. We propose \sudamuon{}, which realizes this separation through a unified primal–dual communication template called SUDA; within this template, ED/D$^2$, EXTRA, and gradient tracking become modular backbone choices. We prove a topology-separated non-asymptotic convergence guarantee in the nuclear-norm geometry: the dominant term scales as $\mathcal{O}((1+\sigma/\sqrt{N})K^{-1/4})$ and does not explicitly involve graph quantities, identifying the communication backbone as the modular axis in the structure design. We then establish two complementary non-modular boundaries. Internally, tracking-before-polarization is necessary for this natural no-tracking variant to avoid non-stationary fixed points under heterogeneous objectives. Externally, in the absence of a central server, a fully decentralized method cannot perform the federated average-then-polarize update; we show that this non-modular local-polarize-then-average design is the essential reason why can fail to exhibit linear speedup. Experiments on CIFAR-100 and GPT-2 fine-tuning support the same picture: the unified template makes different communication algorithms directly comparable. In mild near-IID regimes, the resulting variants perform similarly, while in the more difficult long-horizon non-IID CIFAR-100 setting, \sudamuon{} achieves higher accuracy and lower loss than DeMuon.
Read the full abstract
Logic
Almost free algebras: from the word problem to elimination of quantifiers
Term algebras are important objects in computer science and are correspondingly well-studied. A natural generalization is to quotient these algebras by finitely many ground term equations, obtaining what we call almost free algebras. One of the earliest results on almost free algebras is that their word problem is polynomial time decidable. In this paper, we show that other natural problems: finding canonical representatives; computing the cardinality of a congruence class; checking if all congruence classes are infinite; checking if the algebra is finite; checking if two algebras are isomorphic, are all polynomial time decidable. Another famous result regarding term algebras is that they admit quantifier elimination in a suitably expanded language. Following this pattern, we also show that almost free algebras admit quantifier elimination by expanding the language with the standard tester predicates. While this is implied by existing results, we view our main contribution here as providing a different approach, which we posit can be easily extended to a larger class that is not covered by existing works. Finally, we provide an application to the quantifier elimination procedure, constructing examples of non-initial algebras over arbitrary signatures with a polynomial time word problem.
Read the full abstract
Geometric Topology
Flexible exponents of non-geometric 3-manifolds
A classical question in quantitative topology is to bound the mapping degree $\operatorname{deg}(f)$ in terms of its Lipchitz constant $\text{Lip}(f)$. For a closed, orientable, Riemannian manifold $M$, the flexible exponent $\alpha(M)$ is the infimum of $\alpha\geqslant 0$ such that $|\text{deg}(f)|\leqslant C\cdot (\text{Lip}(f))^\alpha$ holds for any Lipschitz map $f:M\to M$. For a geometric 3-manifold $M$ in the sense of Thurston, $\alpha(M)$ is determined in \cite{DLWWW}. In this paper, we determine $\alpha(M)$ for non-geometric 3-manifolds.
Read the full abstract
Combinatorics
$q$-Derivative Grammar
Context-free grammars, originating in computer science, are related to enumerative combinatorics through two distinct lines of development pioneered by Schützenberger and Chen, respectively. In the framework established by Schützenberger and Delest-Schützenberger-Viennot, unambiguous grammars are translated into functional equations for ordinary generating functions. Inspired by Rota's umbral calculus, Chen later developed a grammatical calculus by associating each context-free grammar with a formal derivative operator. Dumont further developed this method through numerous combinatorial interpretations of grammars with finite and infinite alphabets. Substantial progress in this direction has been achieved over the last decade. In this paper, we introduce a q-analogue of grammatical calculus, which we call the q-derivative grammar. We establish the basic framework of q-grammars and develop the q-grammatical calculus for computing q-exponential generating functions associated with q-grammars. Concrete q-grammars are constructed to study q-Eulerian, q-Roselle and q-André polynomials, including their generating functions and recurrences. This work extends the grammatical method to the q-setting and opens up new research directions.
Read the full abstract
Optimization and Control
Presolving for GPU-Accelerated First-Order LP Solvers
Recent research has focused on developing GPU-accelerated first-order solvers for linear programming (LP). This line of work, however, has largely overlooked the role of presolving, and thus prior results do not fully reflect the speedups achievable through GPU acceleration in a realistic end-to-end solver pipeline. At the same time, LP presolving has traditionally been developed for CPU-based solvers, where presolve time rarely dominates the total runtime and the emphasis has been on maximizing the reduction in problem size, even at the expense of costly presolve rules. Given the high performance of modern GPU-accelerated solvers and the inherently sequential nature of presolving, it is unclear whether this traditional approach to presolving remains appropriate. In this paper we revisit LP presolving from the perspective of GPU-accelerated first-order LP solvers. We identify a set of relatively simple presolve rules and show that a carefully engineered collection of these captures most of the reduction achieved by Gurobi's commercial state-of-the-art presolver, at a fraction of the cost. Moreover, we demonstrate that such lightweight presolving can yield substantial end-to-end speedups for the GPU-accelerated solver cuPDLPx, despite presolving sometimes constituting a significant fraction of the total runtime. These results suggest that lightweight presolving may remain beneficial as GPU performance continues to scale, while the sequential nature of presolving presumably does not. We accompany this paper with an open-source C implementation of an LP presolver, called PSLP (Presolver for Linear Programs). PSLP is battle-tested and has been adopted by the community, with integrations in cuPDLPx, cuOpt (NVIDIA's optimization library), and HPR-LP.
Read the full abstract
Differential Geometry
A note on Rigidity of Shrinking Gradient Ricci Solitons with Constant Scalar Curvature
Let $(M^n, g, f)$ be an $n$-dimensional complete noncompact gradient shrinking Ricci soliton with the equation $Ric+\nabla^2f= \frac{1}{2}g$. 1. If its scalar curvature is $\frac{k}{2}$, Ricci curvature is nonnegative and sectional curvature has upper bound $\frac{1}{2(k-1)}$, we prove that the Ricci shrinker is isometric to a finite quotient of $\mathbb{R}^{n-k}\times \mathbb{S}^k$. 2. If $M$ has constant scalar curvature $R=\frac{n-2}{2}$, and each level set of $f$ has vanishing Weyl curvature, we prove that it is a finite quotient of $\mathbb{R}^2\times \mathbb{S}^{n-2}$. This can be seen a generalization of Cheng-Zhou's four dimensional result \cite{Cheng-Zhou} to high dimension, since the level set of the potential function $f$ has vanishing Weyl curvature automatically when $n=4$.
Read the full abstract
Metric Geometry
Observable diameters with varying screens
In this paper, we obtain the limit formula of the observable diameter with non-Euclidean screen. In order to treat a sequence of observable diameters with varying screens, we define new types of observable diameters with errors.
Statistics Theory
Wasserstein convergence rates for empirical measures of point processes
In this paper, we establish upper and lower bounds on the convergence rate of empirical measures of point processes under the Wasserstein distance. To this end, we first introduce a new metric on the space of finite counting measures. Unlike many existing metrics in the literature, our proposed metric incorporates the spatial locations of unmatched points. Drawing on both this new metric and existing metrics from the literature, we identify a set of common structural properties and develop a general framework for Wasserstein distances between point-process distributions based on metrics satisfying these properties. We then use this framework to investigate the convergence rates of empirical measures, providing quantitative guarantees for approximating the distribution of the underlying point process, and further establish corresponding concentration inequalities. These theoretical results may provide ingredients for constructing oracle goodness-of-fit tests for a specified point-process distribution. We also apply our theory to the approximation of Campbell measures and discuss how the resulting bounds can help assess Wasserstein-based learning of generative point-process models.
Read the full abstract
Optimization and Control
Quasi-Quadratic Gradient: A New Direction for Accelerating the BFGS Method in Quasi-Newton Optimization
In this paper, we introduce the Quasi-Quadratic Gradient (QQG), a novel search direction designed to accelerate the BFGS method within the quasi-Newton framework. By defining the QQG as the product of the inverse Hessian approximation and the current gradient, we explicitly leverage local second-order curvature to rectify the search path. Theoretical analysis and empirical results demonstrate that our approach significantly outperforms vanilla BFGS in convergence speed while maintaining computational efficiency.
Read the full abstract
Analysis of PDEs
Survey on topological methods for Allen–Cahn equations and systems
We present a survey on multiplicity results for the Allen–Cahn equation and systems in the singular perturbation regime, emphasizing their geometric interpretation through $\Gamma$-convergence and isoperimetric theory. In the scalar case, the Allen–Cahn functional converges to perimeter, giving rise to minimal and constant-mean-curvature hypersurfaces, while vectorial Allen–Cahn systems lead to multi-phase isoperimetric clusters. The main methodological tool discussed is the photography method, a variational-topological approach based on localized approximate solutions and barycenter maps, which enables one to encode the topology of the ambient manifold into multiplicity results. We compare problems posed on closed manifolds with those on manifolds with boundary, describing the distinct geometric effects induced by Neumann and Dirichlet boundary conditions. The survey highlights both the effectiveness and the limitations of this framework, particularly in the vectorial case, where the lack of a full classification of isoperimetric clusters creates fundamental analytical challenges.
Read the full abstract
Number Theory
On the Gauss circle problem over smooth numbers
The Gauss circle problem concerns with the evaluation of $\sum_{n \leq x}r(n)$, where $r(n)$ denotes the number of representations of $n$ as sums of two squares and $x \geq 2$. Let $\Psi_G(x,y)$ denote the sum of $y$-smooth numbers below $x$ weighted by $r(n)$. In this paper, we evaluate $\Psi_G(x,y)$ asymptotically for certain ranges of $x \geq y \geq 2$.
Read the full abstract
Sunday 26 April
Optimization and Control
A Hybrid Matheuristic Framework for the Chinese Postman Problem with Load-Dependent Costs
The Chinese Postman Problem with load-dependent costs (CPP-LC) arises in real-world logistics and transportation systems where travel costs depend on vehicle load and energy consumption. In this work, we propose a hybrid optimization framework that integrates metaheuristic search with mathematical programming to efficiently solve CPP-LC. The proposed method combines local search procedures with reduced mixed-integer linear programming (MILP) models to balance exploration and intensification. In addition, we develop an Ant Colony Optimization (ACO) algorithm to enhance scalability on large instances. Extensive experiments on benchmark datasets demonstrate that the proposed framework consistently achieves high-quality solutions and outperforms existing approaches in solution quality, while maintaining competitive computational efficiency. These results highlight the effectiveness of hybrid optimization strategies for complex, load-dependent routing problems in practical applications. Our implementation is publicly available at https://github.com/HySonLab/MatCPP
Read the full abstract
Optimization and Control
SDE Guided Monte Carlo Reinforcement Learning: A Stochastic Maximum Principle Approach for Robust Decision Making in Noisy Environments
This work investigates whether the qualitative optimality conditions of the SMP can serve as guiding heuristics for designing robust tabular RL algorithms. We propose the SDE-MC-AC framework, which establishes a set of SMP-inspired correspondences: the potential field gradient is mapped to potential-based reward shaping, the diffusion coefficient to a softmax temperature, and the value function gradient magnitude to the episode-averaged absolute temporal-difference (TD) error. Crucially, we derive an SMP-motivated adaptive temperature schedule that scales exploration stochastically in response to local value uncertainty. The resulting Monte Carlo Actor-Critic agent integrates potential-shaped rewards, entropy regularization, and adaptive temperature control within episodic updates. We conduct a set of five principled experiments in a minimal, fixed maze testbed under three canonical noise regimes (perceptual, dynamic goal, action) to test five falsifiable hypotheses derived from the SMP. Our results provide evidence for (i) an inverted-U optimal stochasticity curve, (ii) the robust failure prevention of the adaptive schedule under non-stationary noise, (iii) convergence acceleration by potential field guidance, (iv) cross-noise generalization, and (v) the indispensability of the combined SDE components through systematic ablation. Trajectory visualizations reveal a characteristic “macroscopically deterministic, microscopically stochastic” navigation pattern consistent with the SDE model. The study demonstrates that even a heuristic transposition of the SMP into a discrete MDP can yield significant empirical gains, thereby opening a bridge between rigorous stochastic optimal control and practical robust reinforcement learning.
Read the full abstract
Number Theory
On Ramanujan's $q$-Continued Fractions of Order Thirty-Four and Sixty-Eight
We derived $q$-continued fractions $X_i(q)$ of order thirty-four and continued fractions $Y_i(q)$ of order sixty-eight from a general continued fraction identity of Ramanujan, where $i=1,2,3,4,5,6,7$ and $8$. We established some theta-function identities, and one has been proved for the continued fractions $X_i(q)$ and $Y_i(q)$. Furthermore, we obtained results on vanishing coefficients arising from these continued fractions and their reciprocals. As an application of the theta-function identities for $Y_i(q)$, we derived certain color partition identities.
Read the full abstract
Numerical Analysis · Cross-listed from cs.GR
Conformal tubular parameterization and toroidal bending of tube-like surfaces
Tube-like surfaces are widely encountered in geometry processing, engineering structures, and medical anatomy, yet their intrinsic longitudinal and circumferential topology is not well preserved by conventional planar annular or rectangular parameterization domains. In this work, we propose a new conformal parameterization framework for open tube-like surfaces with two boundary components. The proposed method first constructs a fixed-boundary tubular parameterization by cutting the input mesh, computing a disk-to-parallelogram conformal map, and lifting the result to a three-dimensional tubular domain. To reduce residual distortion introduced near the cut seam, we further introduce a localized quasi-conformal correction scheme formulated on an annular domain, which improves conformality while leaving regions away from the seam unchanged. To handle noisy or irregular input boundaries, we also develop a free-boundary variant based on boundary extension and cycle-Laplacian smoothing, allowing the prescribed boundary constraints to be imposed on artificial outer rings rather than directly on the original surface. Finally, we derive two conformal toroidal bending maps that transform the tubular parameterization into toroidal geometries while preserving the underlying tube topology. Experiments on synthetic tube meshes and real vascular surfaces demonstrate that the proposed framework produces low-distortion parameterizations, effectively mitigates seam-induced artifacts, improves robustness for boundary-noisy inputs, and provides flexible tubular and toroidal target domains for downstream surface processing tasks.
Read the full abstract
Numerical Analysis
Mode-realigned pointwise interpolation (MRPWI) for efficient POD-Galerkin parametric reduced-order models
As a cornerstone of reduced-order modeling, the POD-Galerkin framework has garnered widespread attention and remains one of the most widely adopted approaches. Constructing POD-Galerkin PROMs involves integrating this framework with advanced interpolation techniques to obtain POD modes at target (unseen) parameters. While Grassmann manifold interpolation (GMI) serves as an accurate baseline, mode-realigned pointwise interpolation (MRPWI) is proposed to develop highly efficient PROMs that maintain comparable accuracy. Notably, the MRPWI employs a two-step mode realignment procedure, consisting of sign alignment and rotation alignment, to effectively synchronize the POD modes. Demonstration and evaluation of the constructed POD-Galerkin PROMs are conducted by examining flow over a cylinder. These models exhibit high fidelity in comparison to direct numerical simulation and standard POD-Galerkin ROMs. PROMs constructed via MRPWI achieve accuracy comparable to those using GMI, while providing significantly higher computational efficiency.
Read the full abstract
History and Overview of Mathematics · Cross-listed from physics.class-ph
The Inverse Cube Force Law
Newton's Principia is famous for its investigations of the inverse square force law for gravity. But in this book Newton also did something that remained little-known until fairly recently. He figured out what kind of central force exerted upon a particle can rescale its angular velocity by a constant factor without affecting its radial motion. This turns out to be a force obeying an inverse cube law! Here we discuss this and some other interesting features of the inverse cube force law.
Read the full abstract
History and Overview of Mathematics · Cross-listed from cs.LO
The Network Structure of Mathlib
The ongoing development of Lean 4's Mathlib has produced a macroscopic structural complexity that interweaves logical, mathematical, and infrastructural dependencies. We present a network analysis of this library, extracting its dependency structure into a multilayer graph of 308,129 declarations, 8.4 million edges, and 7,563 modules. By introducing graph decompositions that isolate explicit edges from those synthesized by the compiler or driven by proofs, we quantify the structural properties of formalized mathematics. Our analysis reveals three findings. First, taxonomies designed by humans diverge from logical structures, exhibiting a 50.9% coupling across namespaces. Second, developers utilize a median of 1.6% of the imported scope. Third, formalization compresses semantic hierarchies, with network centrality capturing language infrastructure rather than mathematical relevance.
Read the full abstract
Dynamical Systems · Cross-listed from physics.flu-dyn
Improved global stability bounds for two-dimensional plane Poiseuille flow
This work provides new lower bounds on the global (nonlinear) stability limit of pressure-driven two-dimensional plane Poiseuille flow, improving on the energy stability limit, $Re_E$, originally computed by Orr in 1907. Using a computer we carefully construct quartic Lyapunov functionals of the velocity perturbations about the laminar profile, which certify the nonlinear stability of the flow to arbitrary perturbations. The formulation combines a decomposition of the velocity into finitely many energy eigenmodes, referred to as a 'mode set', and an infinite-dimensional 'tail', together with explicit bounds that recast the Lyapunov inequality conditions as semidefinite programs, whose feasibility is tested. Over the streamwise lengths considered, the certified stability limit exceeds the classical energy bound. In particular, at the critical energy-stable streamwise length, where $Re_E\approx 87.59$, the flow is found to be globally stable up to $Re \approx 106.8$ (representing a $22\%$ improvement). Various modestly-sized mode sets, capable of capturing sufficient features of the nonlinear dynamics of energy growth and subsequent decay, are proposed and found to be successful in producing improved bounds, with the simplest one involving only five modes.
Read the full abstract
Operator Algebras
Rapid decay and localizability for Fell bundles over etale Groupoids
We introduce a notion of the Rapid Decay Property (RDP) for Fell bundles over locally compact Hausdorff étale groupoids, extending earlier rapid decay theories for étale groupoids and twists. Our approach yields analytic control on convolution norms and leads to the existence of dense Schwartz-type $*$-subalgebras of the reduced cross-sectional $C^*$-algebra $C_r^*(E)$. As an application, we obtain approximation results showing that, under suitable hypotheses, sections of $C_r^*(E)$ with support contained in an open subset $U\subseteq G$ can be approximated in the reduced norm by compactly supported sections supported inside $U$. In this sense, the Rapid Decay Property provides an analytic mechanism leading to a form of localizability for Fell bundles. We also investigate the relationship between RDP, polynomial growth, and dynamical systems. We show that Fell bundles over groupoids with polynomial growth naturally satisfy the RDP. Furthermore, for a transformation groupoid $G=\Gamma\ltimes_\theta X$ associated with a partial action, we prove that RDP for a Fell bundle over $G$ is equivalent to RDP for a naturally associated Fell bundle over the discrete group $\Gamma$. Finally, we apply these tools to Deaconu-Renault groupoids. By realizing them as partial crossed products of free groups, we show that the presence of persistent branching forces exponential growth, completely obstructing the RDP. This provides a striking illustration of a system where the acting group has RDP, but the associated groupoid fails to inherit it, fully clarifying the boundary between the group and groupoid theories.
Read the full abstract
Combinatorics
Eleven, twelve, and thirteen lonely runners
Wills conjectured that, for any non-zero integers $u_1,\ldots,u_k$, there is a real number $t$ such that, for all $i=1,\ldots,k$, \[\lVert tu_i\rVert\geq\frac{1}{k+1},\] where $\lVert x\rVert$ is the distance from $x$ to the closest integer. This statement is known as the Lonely Runner Conjecture. A computational method developed by Rosenfeld and the second author verified the conjecture for $k\leq9$. We further refine this method with new sieving techniques and employ a polynomial method argument to show that any $(u_1,\ldots,u_k)\equiv(1,2,\ldots,k)\pmod{p}$ with $\gcd(u_1,\ldots,u_k)=1$ satisfies the conjecture when $k+1$ and $p > k^2+k$ are both odd primes. Ultimately, we provide a computer-assisted proof of the Lonely Runner Conjecture for $k\in\{10,11,12\}$.
Read the full abstract
Information Theory
Distributed Electromagnetic Neural Networks for Task-Oriented Semantic Communications
Semantic communications (SemCom) is a promising paradigm that prioritizes the transmission of task-relevant information, thereby enabling superior communication efficiency over traditional bit-centric systems. However, most existing SemCom systems face critical limitations in computational efficiency and spatial flexibility. To overcome these limitations, we propose a novel unmanned aerial vehicles (UAV)-enabled distributed electromagnetic neural network (EMNN) for a task-oriented SemCom system. Specifically, the proposed distributed EMNN is composed of multiple UAV-mounted stacked intelligent metasurfaces (SIM) and a ground receiving station (GRS), where multiple SIMs collaboratively encode image semantics in the wave domain, and the GRS performs decoding based on the received power distribution. Moreover, we employ a temperature-adaptive gradient optimization algorithm to train the distributed EMNN, which mitigates gradient vanishing and enhances learning stability. Finally, the numerical simulation results demonstrate the effectiveness of distributed EMNN in image recognition task-oriented SemCom, achieving an average $8\%$ accuracy improvement over the single-SIM baseline across multiple datasets.
Read the full abstract
Number Theory
Non-Vanishing of Cubic Twists of $GL_n(\mathbb{Q})$ $L$-functions
Let $\pi$ be an irreducible, cuspidal automorphic representation of $GL_n(\mathbb{A}_\mathbb{Q})$ ($n\geq 3$), which is tempered only for $n=3$. Let $s$ be a complex number such that $\Re(s)\notin \left[1/n, 1-1/n\right]$ if $n\neq 4$; $\Re(s)\notin\left[1/5, 4/5\right]$ if $n=4$, then we show that there are infinitely many primitive cubic Dirichlet characters $\chi$ such that $L(s,\pi\times \chi)\neq 0$. Similar results were previously known only for primitive Dirichlet characters without any restriction on the order and quadratic Dirichlet characters.
Read the full abstract
Optimization and Control
Isospectral Steering
We study the controllability of the differential Lyapunov equation under isospectral rotation of a linear gradient field. Specifically, control is effected by a symmetric time-varying gain-matrix constrained to have fixed eigenvalues; that is, by exclusively modulating the eigen-vectors of the state matrix and not its eigenvalues. Motivation for this problem stems from a certain type of control objectives (minimum shear/attention) aimed to reduce anisotropic deformation when ensembles are steered by a common law–optimality necessitates constancy of eigenvalues. In the paper we introduce and motivate this type of isospectral steering, and describe the reachable set of covariances for any specified terminal time and eigenvalues of the gain matrix. The theory we develop is intimately linked to multilinear algebra as well as to positive linear algebra and the Birkoff-von Neumann theorem for doubly stochastic matrices.
Read the full abstract
Mathematical Physics
Algebraic structure behind Odrzywołek's EML operator
The binary EML operator yields all (transcendental) elementary functions by recursive application, or a binary tree. The structure of the operator itself carries two distinct ingredients: that of an abelian group, and of functional inverse, which reveal a constructive path to many distinct functional families.
Read the full abstract
Probability
The Cutoff Profile for Random Transpositions on Repeated Cards in the Full Range of Parameters
The random transposition shuffle on repeated cards induces a Markov chain on the quotient space of arrangements with multiplicities, and is equivalent to the many-urn mean-field Bernoulli-Laplace model introduced by Scarabotti. Writing $n=ml$, where there are $m$ card types and each type appears $l$ times, we determine the limiting profile for the total variation distance to stationarity at times $t=\frac{n}{2}\left(\log n-\frac{1}{2}\log l+c\right)$, under the assumption $l=\omega(1)$. Scarabotti previously established that this process exhibits cutoff at time $\frac{n}{2}(\log n-\frac{1}{2}\log l)$; our result refines this by identifying the precise asymptotic shape of convergence inside the cutoff window. We show that the limiting profile is asymptotically Gaussian, with different explicit forms in the regimes $m$ fixed and $m=\omega(1)$. Together with our previous work on the fixed-$l$ regime, where the limiting profile is of Poisson type, this yields the cutoff profile for the random transposition shuffle on $n=ml$ repeated cards for the full range of parameters $m$ and $l$. Our argument has two main steps. First, we combine Scarabotti's Fourier-analytic framework for the many-urn Bernoulli-Laplace model with the approximation method of Jain-Sawhney (arXiv:2410.23944). More precisely, we compare the original shuffling measure with an explicitly tractable auxiliary measure directly on the repeated card quotient space, rather than passing through an intermediate comparison on the full symmetric group; this step relies in particular on our new estimates for Kostka numbers. Second, we reduce the limiting-profile problem to quotient fixed-point statistics and analyze them via Hoeffding-type combinatorial central limit theorems.
Read the full abstract
Optimization and Control
Learning to Control Stabilization in Column Generation
Column generation is a widely used decomposition technique for large-scale linear programs, but it often suffers from slow convergence due to poor initial dual estimates and dual oscillations. Stabilization techniques such as smoothing and penalization can mitigate these issues, but their effectiveness depends heavily on parameter selection, which requires careful tuning to avoid degrading performance. This paper presents a common framework for smoothing and penalization, showing that despite their different mechanisms, both are governed by two design choices: a reference point in the dual space and stabilization parameters that regulate how strongly that reference influences pricing. Within this framework, we derive parameter bounds that ensure progress, analyze predicted duals as reference points, and establish convergence guarantees for both methods. These results motivate and guide the design of RLSCG, a reinforcement learning-guided framework that adaptively selects stabilization parameters at each iteration. Computational experiments on the Cutting Stock Problem show that RLSCG substantially reduces iteration count and computation time on most synthetic and benchmark instances relative to traditional column generation, rule-based adaptive stabilization, and learning-based column selection, with the largest gains on large-scale instances.