Peer Revenue Returns subject to peer review

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Thursday 26 March

General Mathematics

Directional Geometry and Anisotropy in the Partition Graph

We develop a directional formalism for the partition graph G_n based on several canonical reference sets: the main chain, the self-conjugate axis, the spine, and the boundary framework. For each such set S, the graph distance d_S induces a shell structure and a local trichotomy of edges into inward, outward, and level classes. Passing from edges to paths, we define directional corridors as monotone inward geodesics toward a chosen reference set and prove that every vertex admits at least one. We then prove a structural non-equivalence theorem: for connected G_n, two nonempty reference sets induce the same edgewise directional field if and only if the difference of their distance functions is constant; in particular, distinct reference sets induce distinct directional fields. This gives a first precise formalization of anisotropy in G_n. We also show that every bounded neighborhood of a reference set is accessible by a monotone inward corridor, which gives a directional interpretation to previously established controlled regions around the axis, the spine, and the framework. Finally, we complement the strict theory with a computational atlas illustrating edgewise directional statistics, directional mixing, local invariant drift, and corridor-based transport profiles.
Read the full abstract

Analysis of PDEs

From nonisothermal BGK to Euler Maxwellians via relative entropy

We study the hydrodynamic limit of the nonisothermal BGK model toward Euler Maxwellians. For a prescribed sufficiently smooth Euler solution, we use relative entropy to compare a BGK solution with the corresponding Euler Maxwellian. The result is conditional: for BGK solutions satisfying a uniform sixth velocity-moment bound and uniform $L^\infty$ bounds on their macroscopic velocity, temperature, and inverse temperature, we obtain a stability estimate uniform in time. The key new ingredient is the control of an additional velocity-cubic term in the relative entropy identity. For well-prepared initial data, this yields strong $L^1$ convergence of the BGK solution and its local Maxwellians to the target Euler Maxwellian, together with convergence of the associated macroscopic quantities.
Read the full abstract

Optimization and Control

Stochastic maximum principle for time-changed forward-backward stochastic control problem with Lévy noise

This paper establishes a stochastic maximum principle for optimal control problems governed by time-changed forward-backward stochastic differential equations with Lévy noise. The system incorporates a random, non-decreasing operational time (the inverse of an $\alpha$-stable subordinator) to model phenomena like trapping events and subdiffusion. Using a duality transformation and the convex variational method, we derive necessary and sufficient conditions for optimality, expressed through a novel set of adjoint equations. Finally, the theoretical results are applied to solve an explicit cash management problem under stochastic recursive utility.
Read the full abstract

Complex Variables

Hilbert-Schmidt Hankel operators with harmonic symbols on the Bergman space of strongly pseudoconvex domains in $\mathbb{C}^n$

We characterize Hilbert-Schmidt Hankel operators on the Bergman spaces of smooth bounded strongly pseudoconvex domains in $\mathbb{C}^n$ for $n \geq 2$. We consider harmonic symbols of class $C^3$ up to the closure of the domain and show $H_{\phi}$ is Hilbert-Schmidt if and only if $\phi$ is holomorphic on the domain.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Maximizing Qubit Throughput under Buffer Decoherence and Variability in Generation

Quantum communication networks require transmission of high-fidelity, uncoded qubits for applications such as entanglement distribution and quantum key distribution. However, current implementations are constrained by limited buffer capacity and qubit decoherence, which degrades qubit quality while waiting in the buffer. A key challenge arises from the stochastic nature of qubit generation, there exists a random delay (D) between the initiation of a generation request and the availability of the qubit. This induces a fundamental trade off early initiation increases buffer waiting time and hence decoherence, whereas delayed initiation leads to server idling and reduced throughput. We model this system as an admission control problem in a finite buffer queue, where the reward associated with each job is a decreasing function of its sojourn time. We derive analytical conditions under which a simple "no lag" policy where a new qubit is generated immediately upon the availability of buffer space is optimal. To address scenarios with unknown system parameters, we further develop a Bayesian learning framework that adaptively optimizes the admission policy. In addition to quantum communication systems, the proposed model is applicable to delay sensitive IoT sensing and service systems.
Read the full abstract

Statistics Theory · Cross-listed from cs.AI

Retraining as Approximate Bayesian Inference

Model retraining is usually treated as an ongoing maintenance task. But as Harrison Katz now argues, retraining can be better understood as approximate Bayesian inference under computational constraints. The gap between a continuously updated belief state and your frozen deployed model is "learning debt," and the retraining decision is a cost minimization problem with a threshold that falls out of your loss function. In this article Katz provides a decision-theoretic framework for retraining policies. The result is evidence-based triggers that replace calendar schedules and make governance auditable. For readers less familiar with the Bayesian and decision-theoretic language, key terms are defined in a glossary at the end of the article.
Read the full abstract

Probability

Modified log-Sobolev inequalities, concentration bounds and uniqueness of Gibbs measures

We prove that there is only one translation-invariant Gibbsian point process w.r.t. to a chosen interaction if any of them satisfies a certain bound related to concentration-of-measure. This concentration-of-measure bound is e.g. fulfilled if a corresponding modified logarithmic Sobolev inequality holds. In particular, for natural examples with non-uniqueness regimes, a modified logarithmic Sobolev inequality cannot be satisfied. Therefore, in these situations, the free-energy dissipation in related continuous-time birth-and-death dynamics in $\mathbb{R}^d$ is not exponentially fast.
Read the full abstract

Algebraic Geometry

Exceptional loci in algebraic surfaces

We study the algebraic exceptional set for surfaces (S,B) of log general type, when B has at least three irreducible components; we prove that in most cases it is finite or empty.

Representation Theory

Local coherence for representations of amalgams

In all forms of the local Langlands program the abelian category of smooth representations of p-adic groups G in vector spaces over a field k plays a central role. Of particular interest are its finiteness properties. If the field k has characteristic zero then, by work of Bernstein, this category is most of the time locally noetherian. But if the field has characteristic p then this remains the case only for very special groups. The basic idea of this paper is that if G is an amalgam, i.e., a colimit of certain subgroups then this is reflected by Mod(G) being the limit of the corresponding categories for these subgroups. This allows to deduce finiteness properties of Mod(G) from finite properties of the categories in the limit diagram.
Read the full abstract

Statistics Theory · Cross-listed from stat.ML

Residual-as-Teacher: Mitigating Bias Propagation in Student–Teacher Estimation

We study statistical estimation in a student–teacher setting, where predictions from a pre-trained teacher are used to guide a student model. A standard approach is to train the student to directly match the teacher's outputs, which we refer to as student soft matching (SM). This approach directly propagates any systematic bias or mis-specification present in the teacher, thereby degrading the student's predictions. We propose and analyze an alternative scheme, known as residual-as-teacher (RaT), in which the teacher is used to estimate residuals in the student's predictions. Our analysis shows how the student can thereby emulate a proximal gradient scheme for solving an oracle optimization problem, and this provably reduces the effect of teacher bias. For general student–teacher pairs, we establish non-asymptotic excess risk bounds for any RaT fixed point, along with convergence guarantees for the student-teacher iterative scheme. For kernel-based student–teacher pairs, we prove a sharp separation: the RaT method achieves the minimax-optimal rate, while the SM method incurs constant prediction error for any sample size. Experiments on both synthetic data and ImageNette classification under covariate shift corroborate our theoretical findings.
Read the full abstract

Probability

Cramér-type moderate deviation for double index permutation statistics

We establish a Cramér-type moderate deviation theorem for double-index permutation statistics (DIPS). To the best of our knowledge, previous results only provided Berry-Esseen type bounds for DIPS, which cannot yield moderate deviation results and are insufficient to capture the optimal convergence rates for some relatively sparse DIPS. Our result overcome these limitations: it not only recover the optimal convergence rates for classical DIPS, such as the Mann-Whitney-Wilcoxon statistic, but also extend to sparse statistics, including the number of descents in permutations and Chatterjee's rank correlation coefficient, for which previous approaches do not apply. To prove this result, we establish a Cramér-type moderate deviation of normal approximation for bounded exchangeable pairs. Compared with existing results, our theorem requires more easily verifiable conditions.
Read the full abstract

Algebraic Geometry

Hodge rigidity of Chern classes

In this paper, we study the homogeneous components of the Chern–Schwartz–MacPherson (CSM) classes of Schubert cells. We prove that, under suitable conditions, each such component is represented by an irreducible subvariety. In particular, our result extends Huh's result \cite{Huh} by relaxing the regularity assumption on log resolutions. As a consequence, the conclusion holds for all cominuscule Schubert cells of classical type and for a large family of exceptional cases. We also obtain analogous results for certain Schubert varieties in symplectic Grassmannians and flag varieties.
Read the full abstract

Algebraic Geometry

Landau Analysis in the Grassmannian

Momentum twistors for scattering amplitudes in particle physics are lines in three-space. We develop Landau analysis for Feynman integrals in this setting. The resulting discriminants and resultants are identified with Hurwitz and Chow forms of incidence varieties in products of Grassmannians. We study their degrees and factorizations, and the kinematic regimes in which the fibers of the Landau map are rational or real. Identifying this map with the amplituhedron map on positroid varieties, and the associated recursions with promotion maps, yields a geometric mechanism for the emergence of positivity and cluster structures in planar N=4 super Yang-Mills theory.
Read the full abstract

All authors Benjamin Hollering, Elia Mazzucchelli, Matteo Parisi, Bernd Sturmfels

Combinatorics

Ramsey size linear and generalization

More than thirty years ago, Erdős, Faudree, Rousseau, and Schelp posed a fundamental question in extremal graph theory: What is the optimal constant $c_k$ such that $r(C_{2k+1}, G) \le c_k m$ for any graph $G$ with $m$ edges and no isolated vertices? In this paper, we make a significant step towards answering this question by proving that $r(C_{2k+1}, G) \le (2 + o(1)) m + p,$ where $p$ denotes the number of vertices in $G$. Additionally, we extend the work of Goddard and Kleitman and independently Sidorenko, who proved that $r(K_3, G) \le 2m + 1$ for any graph $G$ with $m$ edges and no isolated vertices. We generalize their findings to the clique version, establishing that $r(K_r, G) \le c_r m^{(r-1)/2}$, and to the multicolor setting, showing that $r_{k+1}(K_3; G) \le c_k m^{(k+1)/2}.$
Read the full abstract

2603.25453 · 26 Mar · After submitting our paper on January 8, 2026, we just discovered that Stijn Cambie, Andrea Freschi, Patryk Morawski, Kalina Petrova, Alexey Pokrovskiy in https://doi.org/10.48550/arXiv.2601.10238 also proved c_k= 2 for sufficiently large m,

Probability

New approach to optimal control of delayed stochastic Volterra integral equations

We address the optimal control of stochastic Volterra integral equations with delay through the lens of Hida-Malliavin calculus. We show that the corresponding adjoint processes satisfy an anticipated backward stochastic Volterra integral equation (ABSVIE), and, exploiting this structure, we establish both necessary and sufficient stochastic maximum principles. Our results provide a comprehensive and rigorous framework for characterizing optimal controls in delayed stochastic systems.
Read the full abstract

Analysis of PDEs

Sharp bounds and geometric properties of the first non trivial Steklov Neumann Eigenvalue

In this article, we study the mixed Steklov–Neumann eigenvalue problem on doubly connected domains. First, we show that among all doubly connected domains in $\mathbb{R}^n$ of the form $B_{R_2}\setminus \overline{B_{R_1}}$, where $B_{R_1}$ and $B_{R_2}$ are open balls of fixed radii satisfying $\overline{B_{R_1}} \subset B_{R_2}$, the first non-zero Steklov–Neumann eigenvalue attains its maximal value when the balls are concentric. Next, we establish bounds for the first non-zero Steklov–Neumann eigenvalue on a doubly connected star-shaped domain contained in a hypersurface equipped with a revolution-type metric. We also derive the asymptotic behavior of the first non-zero Steklov–Neumann eigenvalue on a bounded domain with a spherical hole in $\mathbb{R}^n$ as the radius of the hole approaches zero. Finally, we study the number of nodal domains of the eigenfunction corresponding to the first non zero Steklov–Neumann eigenvalue on a bounded domain in $\mathbb{R}^n$ having a spherical hole.
Read the full abstract

All authors Sagar Basak, Gloria Paoli, Rossano Sannipoli, Sheela Verma

Spectral Theory

A class of nonselfadjoint spectral differential operators of interest in physics

It is shown that the nonselfadjoint (and non-normal) linear ordinary differential operators of a certain class are spectral operators of scalar type in the sense of Dunford and Bade. Operators of this kind appear in physical problems such as the scattering of spin waves by magnetic solitons.
Read the full abstract

Number Theory

A note on gamma factors for pairs

In this short note we observe that the gamma factor defined by Gelfand and Kazhdan coincides with the Rankin-Selberg root number defined by Jacquet, Piatetskii-Shapiro and Shalika.

Analysis of PDEs

Wave-Current-Bathymetry Interaction Revisited: Modeling, Analysis and Asymptotics

Starting from the free surface Euler equations, we derive a leading-order system in terms of surface variables, depending on the surface current and on the bathymetry through the depth-dependent Dirichlet-to-Neumann (DN) operator. The resulting system is shown to be well-posed using the theory of hyperbolic systems of pseudo-differential operators. We then consider wave propagation in slowly varying environments. As an explicit approximation to the DN operator, the semiclassical Weyl quantization of the symbol $g_b(X,\xi)=|\xi|\tanh(b(X)|\xi|)$ is shown to be both asymptotically accurate and consistent with the self-adjoint structure of the true operator, and to provide the natural framework for asymptotic analysis of the wave system. A central consequence of the resulting framework is that classical asymptotic models - including the wave action equation, the mild-slope equation, the Schrödinger equation, and the action balance equation - emerge systematically from a single formulation. By deriving these equations, we show how the simple leading order system with the Weyl quantization of the DN operator provides a unified and mathematically consistent framework for the asymptotic linear theory of wave-current-bathymetry interaction, hence providing a transparent, rigorous and accessible route from the primitive Euler equations to the mentioned asymptotic models. Throughout, numerical experiments are included to illustrate the analysis.
Read the full abstract

Mathematical Physics

The Maxwell class exact solutions to the Schrödinger equation and continuum mechanics models

By applying the nonlinear Legendre transform to the continuity equation, this paper derives exact solutions to the Schrödinger equation and the equations of continuum mechanics. A generalized Maxwell distribution has been used as the momentum density function. Explicit expressions for the vector fields of time independent flows, density distributions, quantum and classical potentials have been found, and a detailed mathematical and physical analysis of the results obtained has been carried out.
Read the full abstract

All authors E.E. Perepelkin, B.I. Sadovnikov, N.G. Inozemtseva, A.S. Medvedev

Category Theory

Introducing pixelation with applications

Motivated by the desire for a new kind of approximation, we define a type of localization called pixelation. We present how pixelation manifests in representation theory and in the study of sites and sheaves. A path category is constructed from a set, a collection of "paths" into the set, and an equivalence relation on the paths. A screen is a partition of the set that respects the paths and equivalence relation. For a commutative ring, we also enrich the path category over its modules (=linearize the category with respect to the ring) and quotient by an ideal generated by paths (possibly 0). The pixelation is the localization of a path category, or the enriched quotient, with respect to a screen. The localization has useful properties and serves as an approximation of the original category. As applications, we use pixelations to provide a new point of view of the Zariski topology of localized ring spectra, provide a parallel story to a ringed space and sheaves of modules, and construct a categorical generalization of higher Auslander algebras of type $A$.
Read the full abstract

Combinatorics

Characterizing globally linked pairs in graphs

A pair $\{u,v\}$ of vertices is said to be globally linked in a $d$-dimensional framework $(G,p)$ if there exists no other framework $(G,q)$ with the same edge lengths, in which the distance between the points corresponding to $u$ and $v$ is different from that in $(G,p)$. We say that $\{u,v\}$ is globally linked in $G$ in $\R^d$ if $\{u,v\}$ is globally linked in every generic $d$-dimensional framework $(G,p)$. We give a complete combinatorial characterization of globally linked vertex pairs in graphs in $\R^2$, solving a conjecture of Jackson, Jordán and Szabadka from 2006 in the affirmative. Our result provides a refinement of the characterization of globally rigid graphs in $\R^2$ as well as an efficient algorithm for finding the globally linked pairs in a graph. We can also deduce that globally linked pairs in $\R^2$, globally linked pairs in ${\mathbb C}^2$, and stress-linked pairs in ${\mathbb R}^2$ are all the same, settling conjectures of Jackson and Owen, and Garamvölgyi, respectively. In higher dimensions we determine the globally linked pairs in body-bar graphs in $\R^d$, for all $d\geq 1$, verifying a conjecture of Connelly, Jordán and Whiteley.
Read the full abstract

Analysis of PDEs

Evolution of the radius of analyticity for mKdV-type equations

In this paper, we obtain new lower bounds for the evolution of the radius of analyticity of solutions to two initial value problems (IVPs) with initial data belonging to the class of analytic functions $H^{\sigma,s}(\mathbb{R})$ defined via a hyperbolic cosine weight. First, we consider the IVP for the modified Korteweg-de Vries (mKdV) equation. For this problem, we prove that the evolution of the radius of analyticity $\sigma(T)$ of the solution admits an algebraic lower bound $cT^{-\frac 12}$ for some $c>0$ and given arbitrarily large $T>0$. Next, we analyze the IVP for the mKdV equation with generalized dispersion (mKdVm) and a damping term. For this problem, we guarantee the local well-posedness in $H^{\sigma,s}(\mathbb{R})$ and demonstrate that the local solution can be extended globally in time and admits constant lower bounds for the radius of analyticity $\sigma(t)$ as time goes to infinity. The outcome of this paper concerning the mKdV equation represents an improvement on that achieved by the authors' previous work in [R. O. Figueira and M. Panthee, New lower bounds for the radius of analyticity for the mKdV equation and a system of mKdV-type equations, J. Evol. Equ. 24 No. 42 (2024)]. As far as we know, the results for the mKdVm with damping are new.
Read the full abstract

Mathematical Physics

On the integrability structure of the deformed rule-54 reversible cellular automaton

We study quantum and stochastic deformations of the rule-54 reversible cellular automaton (RCA54) on a 1+1-dimensional spatiotemporal lattice, focusing on their integrability structures in two distinct settings. First, for the quantum deformation, which turns the model into an interaction-round-a-face brickwork quantum circuit (either on an infinite lattice or with periodic boundary conditions), we show that the shortest-range nontrivial conserved charge commuting with the discrete-time evolution operator has a density supported on six consecutive sites. By constructing the corresponding range-6 Lax operator, we prove that this charge belongs to an infinite tower of mutually commuting conserved charges generated by higher-order logarithmic derivatives of the transfer matrix. With the aid of an intertwining operator, we further prove that the transfer matrix commutes with the discrete-time evolution operator. Second, for the stochastic deformation, which renders the model into a Markov-chain circuit, we investigate open boundary conditions that couple the system at its edges to stochastic reservoirs. In this setting, we explicitly construct the non-equilibrium steady state (NESS) by means of a staggered patch matrix ansatz, a hybrid construction combining the previously used commutative patch-state ansatz for the undeformed RCA54 with the matrix-product ansatz. Finally, we propose a simple empirical criterion for detecting integrability or exact solvability in a given model setup, introducing the notion of digit complexity.
Read the full abstract

Mathematical Physics · Cross-listed from physics.soc-ph

Homogeneous Boltzmann-type equations on graphs: A framework for modelling networked social interactions

Homogeneous Boltzmann-type equations are an established tool for modelling interacting multi-agent systems in sociophysics by means of the principles of statistical mechanics and kinetic theory. A customary implicit assumption is that interactions are "all-to-all", meaning that every pair of randomly sampled agents may potentially interact. However, this legacy of classical kinetic theory, developed for collisions among gas molecules, may not be equally applicable to social interactions, which are often influenced by preferential connections between agents. In this paper, we discuss ongoing research on incorporating graph structures into homogeneous Boltzmann-type equations, thereby accounting for the "some-to-some" nature of social interactions.
Read the full abstract

Group Theory

Groups with a conjugacy class that is the difference of two normal subgroups

We consider finite groups having a conjugacy class that is the difference of two normal subgroups. That is, suppose $G$ is a group and $M$ and $N$ are normal subgroups so that $N < M$, and suppose that there is an element $g \in G$ so that the conjugacy class of $g$ is $M \setminus N$. We find a character-theoretic characterization of this condition, and we determine some structural properties of groups with such a conjugacy class. If we add the condition that $M/N$ is the unique minimal normal subgroup of $G/N$, then we obtain a generalization of a result by S.M. Gagola.
Read the full abstract

All authors Mark L. Lewis, Lucia Morotti, Emanuele Pacifici, Lucia Sanus, Hung P. Tong-Viet

Geometric Topology

B-type coefficient polynomial

An A-type coefficient polynomial introduced by Kawauchi recovers the HOMFLY-PT polynomial as a formal power series within skein theory. A notable feature of this construction is that each coefficient defines a link invariant, yielding an infinite sequence of invariants, while the low-degree coefficients are relatively easy to compute. In this paper, we extend this viewpoint to the B-type setting. Unlike the A-type case, the B-type setting requires a genuinely new inductive scheme due to the four-term skein relation. More precisely, we introduce coefficient polynomials associated with the B-type skein relation and show that their generating series recovers the Kauffman polynomial. We further prove that these coefficient polynomials are well-defined and that the resulting generating series is invariant under the corresponding Reidemeister moves.
Read the full abstract

Optimization and Control

High-Resolution Inertial Dynamics with Time-Rescaled Gradients for Nonsmooth Convex Optimization

We study nonsmooth convex minimization through a continuous-time dynamical system that can be seen as a high-resolution ODE of Nesterov Accelerated Gradient (NAG) adapted to the nonsmooth case. We apply a time-varying Moreau envelope smoothing to a proper convex lower semicontinuous objective function and introduce a controlled time-rescaling of the gradient, coupled with a Hessian-driven damping term, leading to our proposed inertial dynamic. We provide a well-posedness result for this dynamical system, and construct a Lyapunov energy function capturing the combined effects of inertia, damping, and smoothing. For an appropriate scaling, the energy dissipates and yields fast decay of the objective function and gradient, stabilization of velocities, and weak convergence of trajectories to minimizers under mild assumptions. Conceptually, the system is a nonsmooth high-resolution model of Nesterov's method that clarifies how time-varying smoothing and time rescaling jointly govern acceleration and stability. We further extend the framework to the setting of maximally monotone operators, for which we propose and analyze a corresponding dynamical system and establish analogous convergence results. We also present numerical experiments illustrating the effect of the main parameters and comparing the proposed system with several benchmark dynamics.
Read the full abstract

Probability

One-arm probabilities for the two-dimensional metric-graph and discrete Gaussian free field

We study the one-arm probability in the level-set percolation of the discrete and metric-graph Gaussian free field (GFF) defined on a box with Dirichlet boundary conditions. For the metric-graph case, we establish asymptotic estimates on two one-arm probabilities of interest. For the discrete case, we show up-to-constants bounds on the point-to-bulk probability and demonstrate its difference from the metric-graph case.
Read the full abstract

Optimization and Control

Optimization on Weak Riemannian Manifolds

Riemannian structures on infinite-dimensional manifolds arise naturally in shape analysis and shape optimization. These applications lead to optimization problems on manifolds which are not modeled on Banach spaces. The present article develops the basic framework for optimization via gradient descent on weak Riemannian manifolds leading to the notion of a Hesse manifold. Further, foundational properties for optimization are established for several classes of weak Riemannian manifolds connected to shape analysis and shape optimization.
Read the full abstract