Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Friday 1 May

Combinatorics

Quantum fractional revival on zero-divisor graphs over $\mathbb{Z}_n$

In this paper, we characterize the existence of perfect state transfer (PST) and fractional revival in continuous-time quantum walks on the zero-divisor graph $\Gamma(\mathbb{Z}_n)$. By using the canonical equitable partition of $\Gamma(\mathbb{Z}_n)$ induced by the proper divisors of $n$, we derive a sufficient condition on $n$ for PST to occur between a pair of vertices. We show that fractional revival is restricted to cells of size $2$ within the equitable partition. Furthermore, assuming $-1$ is not an eigenvalue of the quotient spectrum, we establish that two vertices in $\Gamma(\mathbb{Z}_n)$ are strongly cospectral if and only if they form a cell of size $2$ within the equitable partition that is either a set of false twins or true twins. Finally, we provide a characterization of fractional revival on bipartite $\Gamma(\mathbb{Z}_n)$ and prove the non-existence of fractional revival on $\Gamma(\mathbb{Z}_{p^2q})$.
Read the full abstract

Combinatorics

On the action of Bender-Knuth generators of cactus group on the set of short semi-standard Young tableaux

In the article by Michael Chmutov, Max Glick and Pavel Pylyavskii \cite{Chmutov} the action of the cactus group $C_N$ on the set of semi-standard Young tableaux filled with the numbers from $1$ to $N$ was defined. Namely, they constructed the set of generators (we rightfully call them Bender-Knuth generators) of the cactus group and a group homomorphism from $C_N$ to Berenstein-Kirillov group $BK_N$ (cf. \cite{Berenstein_Kirillov}), which sends these generators to the Bender-Knuth involutions on the set of semi-standard Young tableaux. In \cite{Henriques_Kamnitzer} Andre Henriques and Joel Kamnitzer defined a natural action of cactus group $C_N$ on the tensor product of $N$ normal crystals via commutors. By applying their result I defined the action of cactus group $C_N$ on the set of short semi-standard Young tableaux filled with the numbers $1, 2, \ldots, N$ in \cite{Svyatnyy}. A semi-standard Young tableau is called short if the number of cells in the first two columns with the numbers $\leqslant N$ is less than or equal to $N$. The set of short semi-standard Young tableaux obviously forms a subset inside the set of semi-standard Young tableaux. The purpose of this paper is to explicitly compute the action of Bender-Knuth generators of cactus group $C_N$ on the set of short semi-standard Young tableaux defined in \cite{Svyatnyy} and compare it with their action on the set of semi-standard Young tableaux defined in \cite{Chmutov}.
Read the full abstract

Number Theory

Notes on Algebraic Properties and Non-Standard Analysis of the Ring of Integers Modulo Infinitely Large Primes

As applications of non-standard analysis to the study of transcendence in the ring $\mathscr{A}$ of integers modulo infinitely large primes, we extend transcendence criteria by Anzawa–Funakura and Matsusaka–Seki. Using the extension of the criterion by Anzawa–Funakura, we observe conditional relation between asymptotic behaviour of prime gaps and transcendence in $\mathscr{A}$. We also summarise known algebraic and model theoretic results on $\mathscr{A}$ for number theorists, and share topics in transcendental number theory with algebraists and model theorists.
Read the full abstract

Number Theory

Effective multi-equidistribution for translates of unipotent flows and Central limit theorems in inhomogeneous Diophantine approximation

In this paper, we prove a central limit theorem for inhomogeneous Diophantine approximation with a fixed shift, provided the shift is non-Liouville. This generalizes earlier work of Dolgopyat, Fayad, and Vinogradov~\cite{DFV}. This is achieved by translating the problem to one involving flows on homogeneous spaces. In this latter setting, we establish an effective multi-equidistribution result for diagonal translates of unipotent flows. This result is obtained by combining a recent result of Kim~\cite{Kim2024} with the height function construction of Shi~\cite{Shi20}. The central limit theorem is then deduced using the method of Björklund and Gorodnik~\cite{BG}.
Read the full abstract

Combinatorics

An exact small-$n$ computation of the minimum 2-coloring discrepancy of $K_n^{(3)}$

For an integer $r \ge 2$ and an order $n \equiv 1, 3 \pmod{6}$, write $\delta_r(n)$ for the minimum, over all $r$-colourings $\chi : \binom{[n]}{3} \to [r]$, of $\max_{\mathcal{S}} \mathrm{disc}(\mathcal{S}, \chi)$, where the maximum is over labelled Steiner triple systems $\mathcal{S}$ of order $n$ and $\mathrm{disc}(\mathcal{S}, \chi) = \max_c |\#\{T \in \mathcal{S} : \chi(T) = c\} - |\mathcal{S}|/r|$. Following Gishboliner, Glock, and Sgueglia \cite{GishbolinerGlockSgueglia2025}, the bulk of the recent work on this quantity has been on lower bounds for $r \ge 3$ (proving $\delta_r(n) = \Omega(n^2)$) and on structural characterisation of the low-discrepancy 2-colourings. We give three small computational contributions in the small-$n$ regime $n \in \{7, 9, 13, 15, 19, 21\}$: An exact value of $\delta_2(n)$ for each such $n$, matching the formula $\delta_2(n) = \min_{x \in [0, n] \cap \mathbb{Z}} |x(n-x)/2 - n(n-1)/12|$ obtained by optimising the GGS Example 1.1 family. Rigorous for $n \in \{7, 9\}$ via exhaustive search over labelled STSs ($30$ resp. $840$ systems) and over all $2$-colourings; computational for $n \in \{13, 15, 19, 21\}$ by simulated-annealing search; A wide near-optimal basin: at $n = 9$, every two-colour-flip neighbour of the optimal Example~1.1 colouring that maintains discrepancy $1.0$ exists; about $34\%$ of two-flip perturbations preserve optimality; Random-colouring statistics for $r \in \{2, 3, 4\}$: $\langle\max_{\mathcal{S}}\mathrm{disc}\rangle$ grows linearly in $n$, in agreement with a heuristic Gaussian estimate $n / \sqrt{6r} \cdot \sqrt{2 \log K}$ over $K$ sampled labellings; the typical-case discrepancy is far below the GGS worst-case $\Omega(n^2)$. We additionally state a conjectural exact formula for $\delta_2(n)$ that holds for every $n \equiv 1, 3 \pmod{6}$.
Read the full abstract

2605.00492 · 1 May · Theorem 1 is false. Pernegger and Hametner found a 2-colouring of the triples of [9] with discrepancy 0 on every Steiner triple system of order 9 (X={1,2}; a triple is blue iff it meets both X and its complement and avoids {1,3}), so delta_2(9)=0, not 1. The same construction also refutes n=13,19,21 and the conjecture; the true value is the parity floor. With thanks to the authors

Analysis of PDEs

Almost global large deviations principle for the KdV equation

We study extreme wave formation for the Korteweg-de Vries equation on the torus with random initial data of average size $\epsilon$. We establish a large deviations principle for the supremum of the solution over arbitrarily long polynomial timescales $t \leq \epsilon^{-n}$ for any fixed natural number $n$. This identifies the leading-order asymptotics of the probability of observing unusually large amplitudes. In this integrable setting, the dynamics evolves on invariant tori where Fourier moduli are almost conserved, ruling out mechanisms for extreme wave formation based on resonant energy exchange. As a result, large amplitudes can only arise through coherent structures or dispersive focusing, which corresponds to the quasi-synchronization of many phases. We show that the latter is dominant in the weakly nonlinear regime. Our approach combines a Birkhoff normal form analysis with probabilistic arguments, exploiting the stability of the integrable dynamics to control the probability of phase quasi-synchronization over long timescales.
Read the full abstract

Differential Geometry

Hamiltonian semisprays on Lie algebroids

We study the existence of Hamiltonian semisprays on Lie algebroids. This work is motivated by a problem studied by Vaisman for tangent bundles, and we extend this question to the setting of arbitrary Lie algebroids and provide a general solution. More precisely, given a Lie algebroid and a regular Lagrangian, we construct a family of Poisson brackets on the algebroid such that the Hamiltonian vector field associated with the corresponding energy function is a semispray. Our approach is based on the symplectic geometry of the prolongation of a Lie algebroid and a cohomological analysis of its vertical subbundle. The results provide a geometric framework for second-order Hamiltonian dynamics on Lie algebroids, extending some known facts in the classical tangent bundle case and revealing new interactions between Poisson geometry and algebroid structures.
Read the full abstract

Mathematical Physics

Strong-disorder expansion of the root-averaged density of states for the Anderson model on the Bethe lattice

We study the root-averaged density of states for the Anderson model on the Bethe lattice in the strong-disorder regime. Here the density of states means the root-averaged spectral measure, not a finite-volume eigenvalue counting limit. We assume that the single-site distribution has compact support and has a locally analytic density on an interval $I^\sharp$ containing a given interval $I$. Combining the random-walk expansion on the tree with a complex-analytic argument for the single-site Stieltjes transforms, we prove that the scaled averaged diagonal resolvent has a holomorphic continuation to a complex neighborhood of $I$ for all sufficiently large $\lambda$. By the Stieltjes inversion formula, the root-averaged density of states measure is absolutely continuous on the scaled energy window $\lambda I$, and its density is real analytic and has a finite-order strong-disorder expansion there. In the scaled form $E=\lambda\xi$, the leading coefficient is the local density of the single-site distribution. All odd coefficients vanish, and the higher coefficients are finite sums determined by occupation profiles of short closed walks on the tree. For the uniform single-site distribution, we compute the first nonzero correction term explicitly.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Near-optimal and Efficient First-Order Algorithm for Multi-Task Learning with Shared Linear Representation

Multi-task learning (MTL) has emerged as a pivotal paradigm in machine learning by leveraging shared structures across multiple related tasks. Despite its empirical success, the development of likelihood-based efficiently solvable algorithms–even for shared linear representations–remains largely underdeveloped, primarily due to the non-convex structure intrinsic to matrix factorization. This paper introduces a first-order algorithm that jointly learns a shared representation and task-specific parameters, with guaranteed efficiency. Notably, it converges in $\widetilde{\mathcal{O}}(1)$ iterations and attains a near-optimal estimation error of $\widetilde{\mathcal{O}}(dk/(TN))$, improving over existing likelihood-based methods by a factor of $k$, where $d$, $k$, $T$, $N$ denote input dimension, representation dimension, task count, and samples per task, respectively. Our results justify that likelihood-based first-order methods can efficiently solve the MTL problem.
Read the full abstract

Rings and Algebras

On ${\pi}$-systems of symmetrizable Kac-Moody algebras

Given a symmetrizable Kac-Moody algebra $\mathfrack{g}$, we study its $\pi$-systems, which are subsets of real roots, the pairwise differences of whose elements are not roots. Such systems arise as simple systems of regular subalgebras of $\mathfrack{g}$, and were originally studied by Dynkin, Morita and Naito. We show that the binary relation introduced by Morita defines a partial order on the set of $\mathfrack{g}$ of finite, untwisted affine or hyperbolic type. We also formulate general principles for constructing $\pi$-systems as well as for finding forbidden diagrams that cannot occur as Dynkin diagrams of $\pi$-systems of a given $\mathfrack{g}$. Among other applications, we use this to determine the set of maximal hyperbolic Dynkin diagrams in ranks $3$-$10$ relative to the Morita partial order.
Read the full abstract

Commutative Algebra

On Krull's Dimension Theorem for Certain Graded Rings and Its Applications

This paper explores the dimension theory of non-Noetherian graded rings by introducing the class of Hilbert–Serre rings. Motivated by Krull's dimension theorem and Smoke's dimension theorem, we establish the fundamental inequalities $\operatorname{dim_{gr}}(R) \leq \dim(R) \leq \operatorname{GKdim}_k(R) \leq d(R)$ for any Hilbert–Serre ring $R$, where $d(R)$ is the pole order of its Poincaré series at $t=1$. We then prove that all these dimensions, including the transcendence degree in the domain case, coincide for monomial algebras. As an application, let $S$ be a finitely generated homogeneous subalgebra of a polynomial ring over a field $k$, and let $\mathrm{in}_{<}(S)$ be its initial algebra with respect to a monomial order $<$. Even though $\mathrm{in}_{<}(S)$ need not be Noetherian, we prove that taking initial algebras preserves all the dimensions considered in this paper; in particular, $\dim(S)=\dim(\mathrm{in}_{<}(S))$. Finally, we provide explicit examples demonstrating that these inequalities can be strict in general, even for Hilbert–Serre domains.
Read the full abstract

Numerical Analysis

Deep-Picard Iteration for Space-time Fractional Diffusion PDEs

We propose a Deep-Picard iteration framework for high-dimensional nonlinear space-time fractional diffusion equations.The method is based on a nonlinear fractional Feynman–Kac fixed-point formulation, which replaces direct discretization of the Caputo memory term and the nonlocal fractional Laplacian by Monte Carlo simulation of the associated fractional dynamics. Each Picard update is approximated by stochastic label generation and realized through supervised neural-network regression, thereby avoiding residual minimization involving fractional differential operators. The fractional trajectories are generated by coupling a discretized beta-stable subordinator with a walk-on-spheres-type simulation of the rotationally symmetric alpha-stable Lévy process. Numerical experiments on two-dimensional and high-dimensional test problems ddemonstrate stable Picard convergence and accurate approximation, with tests reported up to dimension d=100.
Read the full abstract

All authors Zhijun Zeng, Zhitong Chen, Ling Qin, Yi Zhu

Statistics Theory · Cross-listed from stat.ME

Concentration and Calibration in Predictive Bayesian Inference

Predictive Bayesian inference (PBI) represents a model-and prior-agnostic approach to standard Bayesian inference which allows users to quantify uncertainty for a functional of interest only by specifying a forward predictive model for future unobserved data. The flexibility and generality of this framework have led to a host of novel algorithms for implementing this approach, and many empirical applications, yet the reliability of the resulting inferences for the underlying statistical functional of interest remains unclear. Herein, we demonstrate that when using PBI for a population functional of interest, the resulting posterior concentrates onto a well-defined quantity that explicitly depends on the forward predictive model used to implement the predictive recursion underlying the method. Furthermore, the forward predictive model entirely determines the uncertainty quantification produced in PBI. Consequently, our results show that if the predictive model does not capture all relevant features of the data, and, even in very simple examples, the coverage of predictive Bayes credible sets for the population value of the functional of interest can be arbitrarily close to zero. We carefully explain why this occurs, and show that this behavior is directly tied to the inaccuracy of the forward predictive model used to produce future observations within the PBI framework. As a consequence, our results imply that in order for PBI to deliver calibrated posterior inferences, the resulting predictive engine used to generate posterior samples must contain, in a well-defined sense, the true DGP, else inferences generated under this framework will not be calibrated.
Read the full abstract

Combinatorics

From Graph Laplacians to String Partition Functions: A Rigorous Pathway from Discrete Spectra to Emergent Geometry

This work establishes rigorous mathematical foundations connecting spectral graph theory, algebraic geometry, and string theory. We construct a canonical mapping whereby any finite graph \(G\) defines a compact Riemann surface \(X_{G}\) (the spectral curve) whose period matrix \(\Omega_{G}\) encodes the graph's coarse-grained spectral information. We demonstrate that in the continuum limit of graph sequences converging to Riemannian manifolds, these spectral curves converge in the Deligne-Mumford compactification sense to the classical stable curves associated with the manifold. We establish connections to the topological recursion framework of Eynard-Orantin, showing that under appropriate conditions the spectral curve satisfies the loop equations of multi-cut matrix models. The spectral memory field \(\Phi_{G}(u)\) is introduced and shown to provide a discrete regularization of minimal string partition functions. We construct quantum scattering operators on spectral curves and prove that their unitarity is equivalent to a positivity condition on the spectral memory field. Furthermore, we apply this framework to resolve spacelike singularities in general relativity, proving that the Belinski-Khalatnikov-Lifshitz (BKL) chaotic regime is isospectral to a critical random graph ensemble. The classical singularity is replaced by an infinite nodal chain of rational curves, and the Bekenstein-Hawking entropy emerges from the automorphism group of the spectral curve. This work provides rigorous mathematical underpinnings for discrete approaches to quantum gravity and establishes new connections between graph theory, algebraic geometry, and theoretical physics.
Read the full abstract

Information Theory

Soft Graph Diffusion Transformer for MIMO Detection

Learning-based MIMO detection has shown strong empirical performance, yet existing methods typically rely on fixed-depth architectures without explicitly modeling the progressive refinement of symbol estimates. In this paper, we revisit MIMO detection from a flow matching perspective and propose the Soft Graph Diffusion Transformer (SGDiT), which reformulates detection as a noise-level-conditioned denoising process that progressively transforms a Gaussian initialization toward the posterior conditioned on channel observations. An adaptive layer normalization (AdaLN)-conditioned soft graph transformer is employed to parameterize the denoising dynamics, enabling stage-aware information integration between observation and symbol domains. To better align with the discrete nature of symbol detection, we further adopt a cross-entropy-based training objective that directly models bit-wise posterior probabilities, providing a more suitable inductive bias than conventional regression-based formulations. Experimental results across various MIMO system configurations demonstrate that SGDiT achieves competitive bit error rate (BER) performance compared with representative baselines. Furthermore, the proposed model exhibits good generalization capability across different channel conditions. Overall, the SGDiT framework provides an effective and practical approach for neural MIMO detection.
Read the full abstract

All authors Nan Jiang, Jiadong Hong, Lei Liu, Xinyu Bian, Wenjie Wang, Zhaoyang Zhang

Dynamical Systems

Dynamical analysis of r-Chialvo neuron map with cosine memristive

In this work, we construct a novel two-dimensional discrete neuron map by incorporating a cosine-based memristor into the reduced Chialvo neuron map to examine the dynamical analysis of electromagnetic modulation. The nonlinear current-voltage characteristics of the memristor enrich the neuron map's behavior, leading to diverse firing regimes, stability behaviors, and chaotic attractors. This study begins to establish the equilibrium points using both analytical and numerical methods. Additionally, we determine the conditions on parameters under which the proposed map exhibits a Neimark-Sacker bifurcation. Further, the numerical study reveals the antimonotonicity structure through the forward and backward bifurcation diagrams. The model exhibits a wide range of codimension-one and codimension-two bifurcation patterns, including Neimark-Sacker, period-doubling, saddle-node, generalized period-doubling, cusp-point, fold-flip, and various resonance structures (1:1, 1:2, 1:3, and 1:4). We also observe that the coexistence of multistable attractors including a stable limit cycle, a period-five attractor, and a chaotic attractor, along with their respective basins of attraction. Furthermore, we extend this analysis to the network of neurons under the ring-star configuration and discuss several spatiotemporal patterns. This network investigation reveals complex collective patterns, including imperfect synchronization, clustered patterns, and multi-chimera state phenomena, which have not been previously observed in existing Chialvo-based studies. These results highlight the potential of the discrete memristor-based neuron map for advancing theoretical neurodynamics and offer a robust framework for investigating low-dimensional yet dynamically rich neuron systems.
Read the full abstract

Analysis of PDEs

Existence and uniqueness of weak solutions to quasilinear PDEs with critical data

We establish existence and uniqueness of global, bounded weak solutions to quasilinear PDEs with bounded, uniformly continuous initial data and investigate their properties. Moreover, we establish existence of bounded weak solutions when the initial data is merely bounded.

Commutative Algebra

Trace ideals of exterior powers of the module of differentials

For each $i \geq 0$, we study the trace ideal of the $i$-th exterior power of the module of differentials. In characteristic zero, we show that these ideals characterize the polynomial rank of graded rings and the formal power series rank of complete local rings with finite residue-field extension, namely the maximal number of variables for a polynomial or formal power series extension over a subring. Moreover, we introduce the top differential trace and prove that it precisely defines the singular locus of reduced equidimensional local or graded rings. Motivated by this, we introduce and investigate nearly regular rings, which are rings whose top differential trace contains the maximal ideal.
Read the full abstract

Numerical Analysis

A variational approach to estimating the state of a magma reservoir from observed displacement

We propose a numerical procedure to solve an inverse problem that estimates the state of a magma reservoir from observed surface displacement of a volcano. Our variational approach aims to find the minimizer of a cost function consisting of a norm concerning both data and derivative, which evaluates the misfit between the estimated and observed displacement. The extremal of the cost function leads to a linear system, to find the stress distribution on the reservoir surface, has very high condition number, but it is feasible to get appropriate solution by using high precision arithmetic without applying common regularization technique.
Read the full abstract

Analysis of PDEs

Gradient blowup of smooth vacuum solutions to 1D compressible Euler equations

We consider the isentropic compressible Euler equations in the half-line which govern the motion of gaseous fluids in contact with stationary vacuum boundary. We construct a large class of solutions that are initially smooth and square-integrable, and which, in finite time, transition to $C^{1-\mu}$ regularity for $\mu \in [1/2,1)$ near the boundary, leading to the gradient blowup at the boundary. It is based on stability analysis of self-similar waiting time solutions \cite{JLN2025} recently constructed by the authors.
Read the full abstract

Mathematical Physics

Generalized Fourier Transforms for Momentum-Space Construction on Riemannian Manifolds

We extend Fourier analysis to curved spaces by defining a Generalized Fourier Transform (GFT) on any Riemannian manifold $\Sigma$ via spectral decomposition. Under minimal requirements that the transform is an isometric isomorphism and has a kernel diagonalizing the Laplace-Beltrami operator, we prove that the GFT satisfies a generalized Parseval-Plancherel theorem. To resolve the spectral degeneracy that obscures "momentum space" in such settings, we require the degenerate sector to be resolved by a local, symmetry-adapted maximal Abelian commuting set (a fiberwise MASA), constructed from geometric differential operators, most notably from Killing data when such symmetries are available. We provide a constructive algorithm for generating these commuting operators and show that the resulting momentum label spaces $\mathcal{F}$ (discrete, continuous, or mixed) reflect geometric symmetry constraints. We introduce a dual classification: (i) by MASA completeness and Stackel separability, and (ii) by the topology of $\mathcal{F}$. Finally, we distinguish unitary changes induced by true isometries (which preserve the GFT structure) from changes of coordinate-adapted degeneracy resolution/separation schemes, which may induce inequivalent $k$-space labelings (e.g. Cartesian vs spherical constructions in $\mathbb{R}^{3}$) while remaining unitarily equivalent on $\mathcal{L}^{2}\left[\Sigma\right]$. This symmetry-adapted harmonic analysis is intended as a foundation for curved-space mode decompositions; dynamical applications are developed in the subsequent work.
Read the full abstract

Optimization and Control

Riemannian Optimization over Symmetric Positive Definite Matrices with the Alpha-Procrustes Geometry

In Riemannian optimization, it is well known that the condition number of the Riemannian Hessian at an optimum strongly influences the asymptotic convergence behavior of optimization algorithms. On the manifold of symmetric positive definite (SPD) matrices, several commonly used metrics for optimization, such as the Affine-Invariant (AI) and Bures–Wasserstein (BW) metrics, tend to become ill-conditioned as the underlying SPD matrix becomes ill-conditioned. As a result, even when the Euclidean Hessian remains uniformly well-conditioned on the SPD manifold, optimization may still become difficult near an optimum associated with an ill-conditioned SPD matrix. In this paper, we address this issue through the Alpha-Procrustes (AP) geometry on the SPD manifold. This geometry generalizes several well-known metrics, including the Log-Euclidean (LE) metric for \(\alpha=0\) and the BW metric for \(\alpha=1/2\). We first show that, when \(\alpha=1\), all eigenvalues of the Riemannian metric operator induced by the AP geometry are uniformly bounded independently of the underlying SPD matrix. Therefore, under the assumption that the Euclidean Hessian satisfies the uniform spectral bounds, all the eigenvalues of the corresponding Riemannian Hessian are uniformly bounded independently of the underlying SPD matrix. Consequently, the case \(\alpha=1\) provides a robust geometric framework for several Riemannian optimization problems involving ill-conditioned SPD matrices. Finally, we validate our theoretical findings through extensive numerical experiments across a range of applications.
Read the full abstract

Optimization and Control

Controlling the Swarm: Sparse Actuation and Collision Avoidance under Stochastic Delay

Classical flocking models demonstrate how local interactions generate emergent order, but real-world multi-agent deployments are bound by severe constraints: limited actuator availability, heterogeneous communication latencies, and environmental noise. In this talk, we present a unified finite-N framework that tackles the interplay of these exact mechanisms. We study a delayed stochastic leader-follower particle system featuring topological communication, singular repulsion, and bounded sparse leader actuation. A central challenge in such systems is mathematical well-posedness, as discontinuous communication laws and singular repulsions clash with standard strong Ito frameworks. We resolve this by introducing an augmented Lyapunov functional that simultaneously enforces a strict collision barrier and closes a uniform Gronwall estimate. Building on this rigorous foundation, we formulate a free-terminal-time, chance-constrained optimal control problem. We show that temporally sparse, bang-off-bang leader actuation not only drastically reduces control effort compared to continuous baselines, but also reveals non-monotone sensitivities to leader density. Ultimately, we demonstrate that in delayed stochastic swarms, adding more direct actuation is not strictly optimal – highlighting a highly non-trivial resource allocation paradox in cooperative control.
Read the full abstract

Optimization and Control

First-Order Optimality Conditions for Mathematical Programming with Equilibrium Constraints

We present a systematic introduction to first-order optimality conditions for mathematical programs with equilibrium constraints (MPECs), emphasizing the limitations of classical nonlinear programming techniques. The goal is twofold. First, we explain why a direct application of standard optimality conditions – based on reformulating MPECs via KKT systems or differentiable exact penalty functions – is often inadequate, as such approaches typically require strong and restrictive assumptions, including nondegeneracy and smoothness conditions. Second, we develop a first-principles framework for analyzing MPECs by focusing on the geometric structure of the feasible region. In particular, we study stationarity concepts and provide a detailed characterization of the tangent cone at feasible points, which leads to appropriate constraint qualifications tailored to MPECs. These results form the foundation for rigorous first-order analysis and clarify the relationship between the original MPEC formulation and its KKT-based representation, offering practical guidance for handling these inherently challenging optimization problems.
Read the full abstract

Optimization and Control

Introduction to Exact Penalization for Mathematical Programming with Equilibrium Constraints

We present a focused introduction to exact penalty methods for nonlinear programs and mathematical programs with equilibrium constraints (MPECs), emphasizing their connection to modern error bound theory. The goal is twofold. First, we explain how classical optimality conditions can be interpreted through exact penalization, and why such results typically rely on constraint regularity conditions that can be understood as error bounds on perturbations of feasible sets. We then highlight how recent developments based on subanalytic geometry and Lojasiewicz-type inequalities extend this framework beyond classical regularity assumptions, enabling exact penalization under broader analytic conditions. Second, we demonstrate how this theory can be applied in practice to MPECs by reformulating them via KKT systems and constructing exact penalty functions based on residual mappings. Particular attention is given to fractional-order penalties arising from Lojasiewicz error bounds, as well as to improved formulations for special problem classes where sharper exponents can be obtained. These developments provide both theoretical insight and practical guidance for analyzing and solving challenging constrained optimization problems.
Read the full abstract

Optimization and Control

Introduction to Mathematical Programming with Equilibrium Constraints (MPECs) and Bilevel Optimization

Our aim is to explain mathematical programs with equilibrium constraints (MPECs), motivate them through applications, present the main equivalent formulations of equilibrium constraints, and summarize the basic existence theory for optimal solutions. The central message is that an MPEC is an optimization problem whose feasible set is partly defined by another optimization, variational inequality, complementarity system, or equilibrium model.
Read the full abstract

Combinatorics

Explicit marginal distributions for permutations with prescribed Robinson-Schensted shape

Given a permutation $\sigma$, the Robinson-Schensted correspondence determines a certain partition called the shape of $\sigma$. Famously, the shape measures the longest unions of increasing and decreasing subsequences, thus giving global information about $\sigma$. In this paper, by contrast, we ask how prescribing a shape collectively controls local behavior: namely, if $\sigma$ is a random permutation of shape $\lambda$, then what is $P^\lambda_{ij} :=$ the probability that $\sigma(i) = j$? Using tableau-theoretic methods, we derive explicit formulas for $P^\lambda_{ij}$ when $\lambda$ is a hook, two-row, or rectangular shape. We use these formulas to depict and analyze the intricate diffraction-like patterns in the matrices $(P^\lambda_{ij})$. As a surprising application, we show that for both hook and two-row shapes, as the largest part of $\lambda$ tends to infinity with the remaining parts fixed (summing to $m$), the expected proportion of fixed points in $\sigma$ approaches the Wallis integral $\int_0^{\pi/2} \sin^{2m+1} x \: dx = (2m)!! / (2m+1)!!$.
Read the full abstract

Information Theory

Decoding Algorithms for Symbol-Error Correction in MDS Array Codes via Superregular Matrices

Maximum distance separable (MDS) array codes constitute an important class of error-correcting codes due to their optimal distance properties and their relevance in distributed storage systems. In this paper, we investigate the construction and decoding of MDS array codes over $\mathbb{F}_q^b$ based on superregular matrices, with emphasis on superregular Vandermonde and Cauchy matrices. We propose decoding algorithms for [n,k,d] MDS array codes, where n=m+k and d=m+1, capable of correcting symbol errors without prior knowledge of their locations. Unlike existing approaches restricted to specific parameter settings, the proposed algorithms apply to general configurations and rely on algebraic relations that do not follow from straightforward extensions of previous methods. Specifically, these algorithms correct one symbol error for $m \geq 2$ and two symbol errors for $m \geq 4$. For the two-error case, the decoding procedure admits a simplified form when Vandermonde superregular matrices are employed, reducing computational complexity. We analyze the algebraic structure of the three-symbol-error case, focusing on the most involved configuration in which all errors occur in information symbols, and we discuss how the method may be extended to the general case. These algorithms are computationally efficient for moderate parameter sizes, as they rely on structured algebraic operations over $\mathbb{F}_q^b$ and the solution of small linear systems, making them suitable for distributed storage applications. From an application perspective, the proposed approach provides a flexible alternative to RAID~6 schemes. Unlike RAID~6, which is limited to two parity disks and often requires prior knowledge of error locations, our construction supports general configurations and enables the correction of multiple symbol errors without location information, at the cost of increased algebraic complexity
Read the full abstract

All authors Débora Beatriz Claro Zanitti, Isabella Silva Teixeira, Carina Alves, Ivan Aritz Aldaya Garde, Cintya Wink de Oliveira Benedito

Functional Analysis

Stability of the $k$-Plane Transform on Measures and Hölder-Type Comparisons of Wasserstein Metrics

We establish stability estimates for the $k$-plane transform on finite positive Radon measures, with emphasis on Fourier and Wasserstein metrics. We first introduce a metric on $k$-plane transform data and prove a bi-Lipschitz stability estimate showing that this metric is equivalent to a generalized Fourier metric obtained by augmenting the Fourier distance between centered normalized measures with separate barycenter and total mass difference terms. Building on a Hölder-type comparison between Fourier and Wasserstein metrics due to Carrillo and Toscani, we extend this comparison to positive Radon measures under uniform bounds on centered moments of order slightly larger than $2$. This yields Hölder-type stability for the $k$-plane transform in a generalized $2$-Wasserstein metric and, in particular, a $W_2$-stability estimate for centered probability measures. We also compare the $2$-Wasserstein distance with its max-sliced analogue. For centered probability measures with uniformly bounded moments of order slightly larger than $2$, we prove a two-sided Hölder-type comparison between these distances. We then extend the result to positive Radon measures by applying it to centered normalized measures and adding separate barycenter and mass terms. Finally, for absolutely continuous compactly supported probability measures with bounded densities, we prove a strong equivalence between the $2$-Wasserstein distance of the measures and the $(k/2-1)$-order Sobolev norm of the $k$-plane transform data of the difference of their densities.
Read the full abstract