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)

Saturday 16 May

Probability

Stochastic Euler Equations with Pseudo-differential Noise: Continuous and Discontinuous Perturbations in Compressible and Incompressible Flows

We study stochastic Euler equations in compressible and incompressible regimes, on the whole space and the torus, driven by mixed multiplicative noise: continuous Stratonovich/Itô components and a discontinuous Marcus component. The noise amplitudes are pseudo-differential operators including the transport operator. We develop a local-in-time theory of classical solutions, establishing existence, uniqueness, and a blow-up criterion. Discontinuous Marcus noise requires new analytical tools to control interactions between jump discontinuities and nonlocal operators. For compressible equations, we formulate a transformation-and-extension principle recovering the Makino variable and its symmetric quasilinear formulation. Using transformed variables, compatible nonlinear Sobolev estimates are developed to close high-order stochastic energy bounds. This accommodates broad physically relevant state equations, including piecewise $\gamma$-laws, Chaplygin laws, and the white dwarf pressure law. Many equations remain unexplored in multidimensional stochastic compressible settings, even under pure Itô forcing. For the incompressible damped case, we identify damping–noise regimes guaranteeing global existence, uniform bounds, and decay. To study statistical behavior, we establish a novel existence criterion for invariant probability measures tailored to Markov semigroups satisfying a restricted Feller property under mismatched metrics. Bypassing single-topology Feller continuity robustly extends the Krylov–Bogoliubov theory. We use this to construct invariant measures for singular stochastic evolution systems in Hilbert spaces. For mixed multiplicative noise and $d\ge 2$, we prove existence of invariant measures for stochastic damped Euler equations on $\mathbb{T}^d$ under moderate damping–noise, and uniqueness under strong damping–noise on $\mathbb{T}^d$ and $\mathbb{R}^d$.
Read the full abstract

Information Theory

Achieving $\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach

Clustered cell-free networking has emerged as a promising architecture to balance the high performance of cell-free massive MIMO and the scalability of traditional cellular systems. However, achieving fairness across subnetworks remains a critical yet largely unsolved challenge. This paper investigates the fairness problem in clustered cell-free networking and proposes a unified and tunable alpha-fairness scheme that effectively balances overall spectral efficiency and inter-subnetwork fairness. Using the closed-form deterministic equivalent of the ergodic sum capacity, we reformulate the combinatorial clustering problem as a continuous optimization problem. Leveraging the concavity/convexity properties of the alpha-fair objective, we classify the problem into four distinct cases according to the value of alpha. For each case, we establish the exact equivalence between the original integer program and its continuous relaxation, and develop efficient algorithms with guaranteed convergence. Extensive simulations show that the proposed scheme achieves up to 11% improvement in Jain's fairness index and 45% gain in minimum subnetwork capacity, with only a negligible 5% reduction in aggregate throughput.
Read the full abstract

All authors Chaowen Deng, Jie Fan, Boxiang Ren, Ziyuan Lyu, Jingchen Peng, Hao Wu, Junyuan Wang

Combinatorics

Monochromatic unit equilateral triangle on low-dimensional spheres

A result of Matoušek and Rödl in 1995 states that for every $\varepsilon>0$ and every triangle $T$ with circumradius $\rho(T)$, there exists a dimension $n=n(\varepsilon,T)$ such that every $2$-coloring of the $n$-dimensional sphere of radius $\rho(T)+\varepsilon$, namely $\mathbb{S}^{n}(\rho(T)+\varepsilon)$, contains a monochromatic congruent copy of $T$. In this paper, we determine the exact threshold dimension for the unit equilateral triangle on the sphere $\mathbb{S}^{n}(1/\sqrt{2})$: there exists a $2$-coloring of $\mathbb{S}^{2}(1/\sqrt{2})$ with no monochromatic unit equilateral triangle, whereas every $2$-coloring of $\mathbb{S}^{3}(1/\sqrt{2})$ contains one. Along the way, we also establish several further Euclidean Ramsey-type results on low-dimensional spheres, including asymmetric and isosceles variants.
Read the full abstract

Combinatorics

The Weighted Tower of Hanoi: Algebraic Structure, Phase Transitions, and Integer Sequences

We develop a unified algebraic theory of the weighted Tower of Hanoi with arbitrary nonnegative symmetric move costs depending on both disc index and pegs. Starting from a general optimality recurrence with two competing strategies – one largest-disc move (one-LDM) and two largest-disc moves (two-LDM) – we derive complete matrix formulations for both regimes and obtain explicit closed forms for the minimal transfer cost. The one-LDM dynamics is governed by a nontrivial linear operator whose spectral decomposition reveals a fundamental connection with the Jacobsthal and Lichtenberg sequences, while the two-LDM dynamics exhibits pure exponential growth. This framework yields exact solutions for broad classes of weight models, including peg-symmetric, disc-symmetric, polynomial, geometric, arithmetic, and sequence-induced costs. In particular, choosing classical integer sequences (Fibonacci, Lucas, Jacobsthal, Pell, Euler, etc.) as disc weights produces new derived sequences with explicit formulas and recurrences, establishing the Tower of Hanoi as a sequence-generating transform. We further introduce and analyze models with forbidden moves and move-type-dependent weights, uncovering a phase transition phenomenon in which the optimal strategy switches from two-LDM behavior for small discs to one-LDM behavior beyond a finite threshold. Our results provide a comprehensive algebraic and combinatorial understanding of weighted Hanoi dynamics and expose deep connections between optimal solutions and classical integer sequences.
Read the full abstract

Numerical Analysis

Block Krylov subspaces and orthogonal matrix polynomials: a structural correspondence with applications to unitary matrices

We study the connection between block Krylov subspaces and matrix orthogonal functions. Under a no-deflation assumption, we show that polynomial block Krylov subspaces are isometrically isomorphic to spaces of matrix polynomials of bounded degree, providing a unified framework for the analysis and construction of orthonormal bases and recurrence relations. The same correspondence holds for rational block Krylov subspaces and matrix-valued rational functions, and in the extended Krylov setting this leads naturally to Laurent matrix polynomials. When the matrix $A$ is normal, we prove that the induced inner product admits a representation in terms of a discrete spectral matrix measure, extending a classical result for Hermitian matrices. In the unitary case, where the measure is supported on the unit circle, this connection allows us to transfer the Szegő recurrence for orthogonal matrix polynomials and the CMV framework for Laurent matrix polynomials to the block Krylov setting, yielding efficient procedures for the orthogonalization of polynomial and extended block Krylov subspaces.
Read the full abstract

Representation Theory

Quasi-Poisson Modules and Harish-Chandra AD-Modules

We introduce the notion of quasi-Poisson modules over Lie-Rinehart pairs and prove that for the Lie-Rinehart pair $(\dot A,\dot\fk)$ in which $\dot A=\bbbc[t_1^{\pm1},\ldots,t_m^{\pm1}]\ot\Lam_n$ and $\dot\fk={\rm Der}(\dot A)$, there is a one-to-one correspondence between simple cuspidal quasi-Poisson modules over $(\dot A,\dot\fk)$ and simple cuspidal Harish-Chndra $A\fk$-modules for $A:=\bbbc[t_0^{\pm1}]\ot \dot A$ and $\fk:={\rm Der}(A).$ We also classify simple cuspidal quasi-Poisson modules over the Lie-Rinehart pair $(\dot A,\dot\fk)$ and show that each such module is a tensor module $\dot A\ot \Omega$ for an admissible $\frak{gl}(m+1,n)$-module $\Omega$ via a prescribed action.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Examples of Invertible Gauging via Orbifold Data, Zesting, and Equivariantisation

We study the gauging of invertible symmetries, particularly in 3 dimensions, using equivariantisation, $G$-crossed braided zesting, and the generalised orbifold construction. We discuss how these methods are related and illustrate them in various examples. We cover all $\mathbb{Z}_2$-symmetries in Dijkgraaf–Witten $\mathbb{Z}_2$-gauge theory $\mathcal{D}(\mathbb{Z}_2)$, the $\mathbb{Z}_2$-symmetries described by Tambara–Yamagami categories, and obstructions to gauging the central symmetry in Chern–Simons $\mathrm{SU}(2)_k$-gauge theory. We introduce zested orbifold data for symmetries related by zesting and show that the two associated orbifold data are Morita-equivalent, i.e.\ they have the same underlying surface defect.
Read the full abstract

Analysis of PDEs

Continuity properties of the Laguerre operator and its propagator

We study the well-posedness of a Cauchy problem associated with the general form of the Laguerre operator and relate it to the corresponding global problem for the harmonic oscillator. To this end, we carry out a detailed analysis of the continuity properties of the associated propagator. Furthermore, we establish connections between several integral transforms, including the fractional Fourier transform and the fractional Hankel transform. Our results highlight the role of Pilipović spaces on positive orthants when studying problems involving the Laguerre operator.
Read the full abstract

Operator Algebras · Cross-listed from quant-ph

Exact Entanglement-Depth Speed Frontier for Complete Quantum Charging

Complete quantum charging provides a sharp setting in which to ask how much multipartite entanglement is forced by speed itself. For a closed \(N\)-qubit battery evolving from \(\ket{\downarrow}^{\otimes N}\) to \(\ket{\uparrow}^{\otimes N}\) under a time-independent Hamiltonian, we exactly solve the pure-state depth-constrained speed problem. If the realized trajectory has entanglement depth at most \(k\), then the largest possible QSL-normalized rate \(\eta=\tau_{\rm QSL}/T\) is \(\eta_{\max}(k)=\lceil N/k\rceil^{-1/2}\). Conversely, an observed rate \(\eta\) certifies trajectory entanglement depth at least \(\bigl\lceil N/\lfloor \eta^{-2}\rfloor\bigr\rceil\). The mechanism is block orthogonalization: under a fixed product partition, complete charging forces all blocks to orthogonalize simultaneously, and the quantum speed limit converts this counting constraint into the speed bound. Balanced cluster-flip evolutions saturate the bound, establishing an exact integer staircase frontier. Thus fast complete charging cannot be explained by many small independently charging blocks; in particular, crossing the threshold \(\eta>1/\sqrt2\) certifies, for \(N>1\), the generation of genuine \(N\)-partite entanglement.
Read the full abstract

Numerical Analysis

Spectral Bounds for Tensors Derived from Trace Functionals and Wasserstein Distance in Tensor Spaces

This article introduces a trace-based metric on the space of positive semi-definite (PSD) tensors, offering a geometric perspective that connects their algebraic structure to their intrinsic geometric properties. It defines the Bures-Wasserstein distance on tensor spaces, establishing clear measurements between tensors. Moreover, the study derives trace-based eigenvalue bounds for PSD tensors and analyzes how these bounds depend on the PSD condition. The behavior of these bounds is further explored when the PSD requirement is relaxed, with illustrative examples provided to support the theoretical findings. In addition, a detailed complexity analysis is carried out for the methods proposed in this study.
Read the full abstract

Probability

${\mathrm{ASL}_n}(\mathbb Z)$ invariant random subsets of $\mathbb Z^n$

We classify measures on $\{0,1\}^{\mathbb{Z}^d}$, $d \geq 3$, the space of subsets of $\mathbb{Z}^d$, which are invariant under all affine special linear transformations. In other words, we classify simple point processes on $\mathbb{Z}^d$ whose law is invariant under affine special linear transformations. We show that every such process is built from a random equivariant polynomial together with independent random sampling, a higher-order generalisation of the cut-and-project method: a random polynomial map is drawn from a distribution invariant under a natural action of $\mathrm{SL}_d(\mathbb{Z})$, each site is then retained independently with a probability determined by a measurable function of the polynomial's value, and the classical cut-and-project construction is recovered in the degree-one case. As a corollary, when the underlying $\mathbb{Z}^d$-action is weakly mixing the measure must be a convex combination of Bernoulli shifts, in the spirit of de Finetti's theorem on exchangeable processes. Our theorem also makes precise how the Howe–Moore theorem fails for the pair $(\mathrm{ASL}_d(\mathbb{Z}), \mathrm{SL}_d(\mathbb{Z}))$. Motivated by this classification, we formulate a conjecture for $\mathrm{ASL}_d(\mathbb{R})$-invariant point processes on $\mathbb{R}^d$, predicting that any such set decomposes into a Poisson part and a quasicrystal part. The proofs rely on the interaction between the Host–Kra theory of characteristic factors, Zimmer's theory of dynamical cocycles of simple Lie groups, and the dynamics of $\mathrm{SL}_d(\mathbb{Z})$-actions on homogeneous spaces.
Read the full abstract

Probability · Cross-listed from stat.ML

A Fourier perspective on the learning dynamics of neural networks: from sample complexities to mechanistic insights

Neural networks trained with gradient-based methods exhibit a strong simplicity bias: they learn simpler statistical features of their data before moving to more complex features. Previous analyses of this phenomenon have largely focused on settings with (quasi-)isotropic inputs. In this work, we study the simplicity bias from a Fourier perspective, which allows us to include two key features of natural images in the analysis: approximate translation-invariance and power-law spectra. We first show experimentally that simple neural networks trained on image classification tasks first rely on amplitude information – related to pair-wise correlations between pixels – before exploiting phase information, which encodes edges and higher-order correlations. In view of this, we introduce a synthetic data model for translation-invariant inputs that allows precise control over amplitudes and phases while remaining tractable. We rigorously establish that for isotropic and high-dimensional inputs, classification based on phase information alone is a genuinely hard task: online stochastic gradient descent (SGD) cannot distinguish the structured inputs from noise within $n \ll N^3$ steps, but needs at least $n \gg N^3 \log^2{N}$ steps. In contrast, we show both experimentally and theoretically that power-law spectra can dramatically accelerate the speed of learning phase information, even if the spectra do not help with classification. Simulations with two-layer networks trained on textures and with deep convolutional networks on ImageNet and CIFAR100 confirm this non-trivial interaction between amplitudes and phases, providing mechanistic insights into how deep neural networks can learn natural image distributions efficiently.
Read the full abstract

Algebraic Geometry

Tropical curves with parallel rays

In the previous works, the rational function semifields of abstract tropical curves were characterized. In this paper, we give a contravariant categorical equivalence between the category of abstract tropical curves with morphisms and the category of semifields over the tropical semifield $\boldsymbol{T}$ characterized above with $\boldsymbol{T}$-algebra homomorphisms. The characterization tells us that the traditional definition of abstract tropical curves has a fatal flaw such that we are never able to deal with parallel rays, unlike the traditional tropical curves, which generally admit them. To address this flaw, we introduce a new notion of abstract tropical curves with parallel rays. Then we define the rational function semifields of these curves and give a characterization of them, and a variant of the categorical equivalence between their categories with a suitable notion of morphisms between these curves. Under the categorical equivalences, we translate several geometric notions for traditional or abstract tropical curves (with parallel rays) into algebraic ones, including weights on edges and the balancing condition.
Read the full abstract

Statistics Theory

Differentially private hypothesis testing in survival analysis

Survival analysis is widely used in applications involving sensitive individual-level data, yet differentially private hypothesis testing for right-censored data remains largely undeveloped. We initiate a finite-sample theory of private hypothesis testing in survival analysis applications. For Cox regression coefficients, we develop private partial-likelihood-ratio and score-type tests, including a private calibration procedure for the rejection threshold. For cumulative hazard functions, we propose a private distributed two-sample test. Across these problems, we prove differential privacy and finite-sample testing guarantees, as well as minimax lower bounds. Our results identify when privacy is statistically negligible, when it dominates the testing rate, and where optimal private rates for testing in semiparametric survival models remain open. This theoretical analysis is accompanied by numerical experiments on simulated data.
Read the full abstract

Probability

Positive-rate PCA and IPS with stationary Bernoulli measures are rapidly forgetful

We prove that every probabilistic cellular automaton with strictly positive transition probabilities that admits a stationary Bernoulli measure is exponentially ergodic. Moreover, the mixing time of any finite region in such a system is logarithmic in the diameter of the region. A similar result holds in continuous time for positive-rate, finite-range interacting particle systems. The proofs use entropy, and rely on a representation of the system as a perturbation of another system with noise. The ergodic behaviour results from a competition between the accumulation of randomness due to noise and the diffusion of randomness due to local information exchange. We show that, in two and higher dimensions, the positive-rate probabilistic cellular automata that admit stationary Bernoulli measures are algorithmically indistinguishable from those that do not.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Splitting schemes and estimators for stochastic differential equations with Hölder multiplicative noise

We study parameter estimation for univariate stochastic differential equations with locally Lipschitz drift and Hölder continuous multiplicative diffusion, a class commonly arising in several applications. Existing inference methods typically rely on either the Euler-Maruyama discretisation, despite its lack of strong convergence and failure to preserve the state space, or on approximations, e.g. Gaussian approximation or truncation of Hermite's expansions, impacting on their stability and computational efficiency. We introduce the first explicit pseudo-likelihood estimators based on numerical splitting schemes that are both strong mean-square convergent and state space preserving for this class of SDEs. Our approach is based on a novel decomposition of the SDE that exploits reducibility and the Lamperti transform, leading to Lie-Trotter (LT) and Strang splitting schemes yielding explicit pseudo-likelihoods and maximum likelihood estimators based on them. We prove strong mean-square convergence, state space preservation, and improved robustness with respect to the discretisation step compared to Euler-Maruyama-based methods. We further establish consistency and asymptotic normality of the LT estimator. Because the proposed numerical scheme couples drift and diffusion parameters in the pseudo-likelihood, the asymptotic analysis requires new proof techniques. Extensive simulations demonstrate that the proposed estimators outperform existing methods in both accuracy and computational efficiency.
Read the full abstract

Functional Analysis

A multivariable mean equation arising from the spectral geometric mean

In the 1980s, Kubo and Ando introduced operator means on $\mathbb{P}$, the open convex cone of positive definite operators. One significant example is the weighted geometric mean $$ A \sharp_{t} B = A^{1/2} (A^{-1/2} B A^{-1/2})^{t} A^{1/2}, \qquad A,B \in \mathbb{P}. $$ The Karcher mean serves as a natural multivariable extension of this mean by minimizing the sum of squared Riemannian trace distances of positive definite matrices. It coincides a unique positive definite solution to the Karcher equation, which allows us to define the Karcher mean on $\mathbb{P}$. The weighted spectral geometric mean is defined as another geometric mean of two positive definite operators as follows: $$ A \natural_t B = (A^{-1} \sharp B)^{t} A (A^{-1} \sharp B)^{t}, $$ where $A \sharp B = A \sharp_{1/2} B$. In this paper, we make an initial attempt to formulate a multivariable spectral geometric mean through a nonlinear equation. In the two-variable case, the unique positive definite solution of this equation is precisely the spectral geometric mean. However, in the multi-variable case, the equation need not have a unique solution. We study properties of its solutions and compare them with other least squares means of positive definite matrices. Recently, a new theory of alternative means for positive definite operators has been developed, which includes the spectral geometric mean and the Wasserstein mean. We also consider multivariable equation arising from the alternative means.
Read the full abstract

Optimization and Control

Stochastic Optimization and Data Science

This paper aims to motivate stochastic optimization problems from a statistical perspective and a statistical learning perspective, where the goal is to maximize the log-likelihood or minimize the population risk. We briefly describe the two main approaches: offline (Monte Carlo / Sample Average Approximation) and online (Stochastic Approximation) approaches – to solve the expectation minimization problems.
Read the full abstract

All authors Arutyun Avetisyan, Darina Dvinskikh, Alexander Gasnikov, Vladimir Temlyakov, Nazarii Tupitsa, Denis Turdakov

Probability

Growing open Markovian Jackson networks: Fluid limit and infinite-dimensional Skorokhod problem

We study growing open Jackson networks where each station is a single-server queue that follows the first-come first-served discipline with Poisson arrivals and exponentially distributed service times, characterized by node-specific rates. In applying a fluid scaling to the queue-length process, we show that under certain conditions the queueing system can be approximated by an infinite-dimensional fluid limit with a kernel function in place of the transition matrix. This limiting process can be characterized by an infinite-dimensional Skorokhod problem, for which we develop a new theory by considering a broader class of reflection operators and general infinite-dimensional processes. We establish existence and uniqueness of a solution along with Lipschitz continuity provided the reflecting operator has a spectral radius less than 1.By introducing an intermediate process in which the compensated Poisson components are removed, and then lifting this to an infinite-dimensional process, we exploit the new Lipschitz property of the infinite-dimensional Skorokhod mapping to prove convergence of the intermediate process. We then prove the necessary estimates for the difference between the original and intermediate processes by using martingale properties. Finally, we consider the empirical measure of the queueing processes, for which we show convergence to the measure associated with the path of the infinite-dimensional fluid limit, extending to the convergence of specific performance-related functionals.
Read the full abstract

Combinatorics

Star-collision in random hypergraphs

We study star-based symmetries in uniform hypergraphs and their consequences for matrices whose entries depend only on vertex stars. Such matrices admit a deterministic decomposition into a global component and a local component supported on equivalence classes of vertices with identical stars, known as units. While nontrivial units may exist at finite size in hypergraphs of uniformity greater than two, their persistence in random settings has remained unclear. We analyze star collisions in random $k$-uniform hypergraphs and show that, in some particular regimes, nontrivial units disappear with high probability as the number of vertices grows. As a consequence, star-dependent matrices exhibit asymptotically trivial local structure, and their spectral behavior, invariant subspaces, and associated linear dynamics are governed by a reduced quotient object obtained by contracting vertex stars. These results identify star collisions as a finite-size phenomenon in random hypergraphs and clarify the asymptotic irrelevance of star-based symmetries for operator behavior in large random systems in particular regimes.
Read the full abstract

Rings and Algebras

Are cluster automorphism groups finitely generated?

This paper investigates the finite generation of cluster automorphism groups. By applying the pseudo $\mathbb{N}$-grading introduced in our previous work, we establish a sufficient condition for a cluster automorphism group to be finitely generated. As applications, we re-establish the finite generation of the automorphism groups for all finite mutation type cluster algebras, and verify the acyclic cases. Furthermore, we illustrate through examples that our approach significantly simplifies the computation of presentations for these groups in certain cases.
Read the full abstract

Combinatorics

Span capacities of graphs

The $d$-capacity of a graph $G$ is introduced as the maximum number of players that can simultaneously traverse $G$ such that each player visits all vertices while maintaining a distance of at least $d$ under various movement rules. We determine their values for paths and cycles and provide bounds for bipartite graphs. Furthermore, we characterize topfull graphs, where the 1-capacities reach their theoretical maximum, establishing a connection to graph factorizations and connectivity.
Read the full abstract

All authors Mateja Grašič, Christopher Mouron, Aljoša Šubašić, Andrej Taranenko, Tanja Vojković

Complex Variables

Weighted $\alpha$-subharmonic measure

In this paper, we introduce and study the weighted $\alpha$-subharmonic measure associated with a weight function $\psi$, extending the usual $\alpha$-subharmonic measure and reducing to it when $\psi \equiv -1$. Furthermore, we study the relationship between the weighted $\alpha$-subharmonic measure and $\alpha$-regular compact sets. We also obtain a characterization of $(\alpha,\psi)$-regularity in terms of the continuity of the corresponding weighted $\alpha$-subharmonic measure. Finally, we prove that if the weighted $\alpha$-subharmonic measure of the compact set $K$ is Hölder continuous with respect to $K$, then it is Hölder continuous everywhere.
Read the full abstract

Analysis of PDEs

Equivariant nonlinear partial differential operators on constant curvature spaces

Motivated by PDE-learning, we give a classifying space for nonlinear partial differential operators equivariant under the action of isometries. This classifying space is for operators defined on Riemannian model spaces. The nonlinear operators we are considering are those that can be written as a polynomial in linear operators. We show that the classifying space for such operators can be realized as the vector space spanned by equivalence-classes of multigraphs. We also illustrate how this realization can help us discover non-trivial linear dependence relations between nonlinear differential operators relative to the dimension of the manifold. Finally, we give some comments on operators equivariant under the identity component of the isometry group and under isometry groups of sub-Riemannian model spaces.
Read the full abstract

Combinatorics

On $t$-edge-balanced graphs

A graph $G$ on $n$ vertices with $k$ edges is $t$-edge-balanced if every graph on $n$ vertices with $t$ edges is contained in exactly the same number of subgraphs of $K_n$ isomorphic to $G$. Despite the existence of infinite families of $2$-edge-balanced graphs, no $t$-edge-balanced graphs were known for $t \ge 3$. This paper resolves the existence question for $t \ge 3$ in two directions. For $t = 3$, we derive necessary arithmetic conditions on the parameters $(n,k)$ and use a simulated annealing search to find the first known examples of $3$-edge-balanced graphs. For $t \ge 4$, we prove that no nontrivial $t$-edge-balanced graphs exist.
Read the full abstract

Combinatorics

A Ridge-Saturation Characterization of $\alpha$-Critical $\mathbf {W}_p$ Graphs

We characterize the graphs which are simultaneously $\alpha$-critical and members of the class $\mathbf W_p$. The characterization is stated in three equivalent languages. In the graph itself, such a graph is a well-covered graph whose codimension-one localization fibers all have size at least $p$ and whose edges are exactly covered by the cliques induced by those fibers. In the independence complex, it is a pure flag complex in which every ridge has degree at least $p$ and every missing edge is generated by the link of a ridge. In the complement, it is a $K_{r+1}$-saturated graph, where $r=\alpha(G)$, all maximal cliques have size $r$, and the minimum $(r-1)$-clique-codegree is at least $p$. This gives an exact formula for the largest $p$ for which a well-covered graph belongs to $\mathbf W_p$. We make this complement correspondence explicit, record saturation-theoretic consequences including dense-complement rigidity and $p$-sensitive edge and order bounds, and give a family of sharp examples showing that the local sufficient condition from the recent work of Hoang, Levit and Mandrescu is not necessary outside the locally triangle-free setting, for all $p\ge2$.
Read the full abstract

All authors Do Trong Hoang, Vadim E. Levit, Eugen Mandrescu, Kevin Pereyra

Number Theory

Explicit Formulas for the Casimir Eigenvalues of $SL(n,\mathbb{Z})$-Maass Forms

Maass forms for $SL(n,\mathbb{Z})$ are defined to be eigenfunctions of the Casimir operators $\mathcal{D}_{m,n}$ of orders $1 \leq m \leq n$ for $GL(n,\mathbb{R})$. For any $1 \leq m \leq n$ and Maass form $\phi$ for $SL(n,\mathbb{Z})$, we provide a formula for the eigenvalue of $\mathcal{D}_{m,n}$ associated with $\phi$ in terms of the Langlands parameters of $\phi$. In the case $m=2$, we recover the formula for the Laplace eigenvalue of a Maass form due to Terras, the Casimir differential operator of order $2$ being the Laplacian. Our proof takes a graph-theoretic approach, relating the action of every elementary differential operator of order $m$ for $GL(n,\mathbb{R})$ to the partitions of a directed, edge-ordered graph with $m$ edges and at most $m$ vertices.
Read the full abstract

Analysis of PDEs

Strong well-posedness of a singular SDE for signed Coulomb particles

We consider an SDE system for signed Coulomb particles moving in $\mathbb R^2$. Due to the singular Coulomb interaction force, collisions between particles of opposite sign will happen in finite time. Upon collision, the colliding particles are removed from the system. Our main results are the existence and uniqueness of strong global solutions and the characterization of all possible collisions. The challenge of the proofs is to deal with the singularity of the interactions. We overcome this by using scaling invariance of the process and by putting together several tools from [FT25] developed for the similar Keller–Segel particle system.
Read the full abstract

Optimization and Control

A Diagnostic Framework for Implementation Risk in Bilevel Decision Problems: The Ambiguity Premium and the Robustness–Efficiency Frontier

Hierarchical decision problems are often modeled as bilevel programs in which a leader commits to a policy and a follower responds optimally. When the follower's optimal response is nonunique, or when only near-optimal follower behavior can be verified, the same leader decision may induce a range of upper-level outcomes. This paper develops a diagnostic framework for quantifying that exposure. For a leader decision $x$, we evaluate the optimistic and pessimistic upper-level values over the $\epsilon$-optimal follower response set $S_\epsilon(x)$ and use their difference, \[ \Delta_\epsilon(x):=\psi_\epsilon^p(x)-\psi_\epsilon^o(x), \] as an ambiguity premium. The premium itself is classical in the optimistic–pessimistic bilevel distinction; the contribution here is to make it operational as an implementation-risk diagnostic. We establish a diameter bound $\Delta_\epsilon(x)\le L_F(x)\,\mathrm{diam}(S_\epsilon(x))$ and an $\mathcal{O}(\sqrt{\epsilon})$ estimate under quadratic lower-level growth. We then organize existing bilevel–GNEP reformulations by their computational roles and propose a screening workflow that reports, for each candidate policy, nominal value, ambiguity exposure, and a first-order residual. Two stylized case studies – a parallel-link Stackelberg pricing problem and a convex generation-planning model with diversification constraints – show how the resulting robustness–efficiency frontier can identify policies that are nominally attractive but sensitive to near-optimal follower responses.
Read the full abstract