Peer Revenue Publish or profit

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Tuesday 31 March

Mathematical Physics · Cross-listed from cond-mat.soft

Retained-spin micropolar hydrodynamics from the Boltzmann–Curtiss equation

We derive a retained-spin micropolar hydrodynamic closure from the Boltzmann–Curtiss equation using a generalized Chapman–Enskog construction in which the local mean spin is retained as a quasi-slow variable. Starting from the one-particle kinetic balance identities and the corresponding exact coarse-grained finite-size balances for mass, linear momentum, and intrinsic angular momentum, we keep the collisional-transfer contribution to the antisymmetric stress explicit in the spin balance, decompose the first-order source into irreducible scalar, axial, and symmetric-traceless sectors, and show explicitly how the standard micropolar constitutive structure with coefficients $(\eta,\xi,\eta_r,\alpha,\beta,\gamma)$ emerges. This decomposition makes clear that the one-particle kinetic stress contributes only to the symmetric stress, whereas the rotational viscosity belongs to a collisional-transfer channel. For perfectly rough elastic hard spheres, we further obtain explicit dilute-gas estimates for the rotational viscosity $\eta_r$ from homogeneous spin relaxation and for the transverse spin-diffusion combination $\beta+\gamma$ from a transport-relaxation calculation. Targeted event-driven molecular-dynamics simulations are used as a posteriori checks: expanded homogeneous-spin density and roughness sweeps support the predicted $n^2$ and $K/(K+1)$ trends for $\eta_r$, while finite-$k$ transverse runs provide a qualitative diagnostic of the retained-spin response. The result is a self-contained derivation and coefficient-level estimate of retained-spin micropolar hydrodynamics that clarifies which parts of the closure are exact balance-law statements, which are first-order generalized Chapman–Enskog results, and which remain controlled rough-sphere estimates.
Read the full abstract

Numerical Analysis

Adaptive Fast-Slow Operator Splitting for Multiscale Biochemical Stochastic Dynamics

Stochastic reaction networks governed by Chemical Langevin Equations (CLE) exhibit pronounced multiscale dynamics spanning fast molecular reactions, intermediate transport, and slow cellular regulation, posing significant challenges for efficient and accurate simulation. Although operator splitting naturally decouples fast and slow subsystems, a rigorous error characterization for CLE splitting schemes has been lacking. We propose a modular operator-splitting framework with adaptive discretization that enables reliable and efficient simulation across fast-slow dynamics with explicit control of discretization error. Using stochastic logarithmic representations, we present a complete error analysis of the fast-slow Lie-Trotter splitting method, decomposing the one-step error into stochastic flow truncation error, commutator errors due to subsystem noncommutativity, and numerical discretization errors from fast and slow integrations. Guided by this analysis, we develop a proportional-integral (PI) adaptive controller that jointly selects macro time steps and fast microsteps, achieving substantial efficiency gains while maintaining accuracy.
Read the full abstract

Probability

Fluctuations for fully pushed stochastic fronts

We study the asymptotic behaviour, in the small noise limit, of stochastic travelling wave solutions to reaction-diffusion equations perturbed by Wright-Fisher noise. Such equations are predicted to display three distinct responses to noise in three parametric regimes: fully pushed, semi-pushed, and pulled. We prove, for the entire fully pushed regime, that solutions are asymptotically close to a stochastic shift of the deterministic travelling wave, and characterize the limiting shift process as a Brownian motion with drift. This gives the first full fluctuation theorem demonstrating fully pushed phenomenology for a non-linear stochastic reaction-diffusion equation and verifies a physical conjecture of Birzu, Hallatschek and Korolev [BHK18]. The proof uses an infinite-dimensional version of a method introduced by Katzenberger [Kat91], as pioneered by Funaki [Fun95]. This approach views the dynamics as a stochastic perturbation of a dynamical system (the PDE) with strong drift towards an invariant manifold, in our case the set of shifts of the travelling wave profile, and gives an expression for the stochastic motion "along" this manifold. Implementing this method in our setting requires many ingredients, including a close analysis of the dynamics of the corresponding PDE, integrability and regularity properties of solutions to the SPDE, and sharp control of the position of the right endpoint of the solution's support.
Read the full abstract

All authors Alison Etheridge, Raphaël Forien, Thomas Hughes, Sarah Penington

Representation Theory

BPS Lie algebras, perverse filtrations and shuffle algebras

We give an explicit description of the BPS Lie algebra of any quiver with zero potential, by relating the perverse filtration on the cohomological Hall algebra with certain limit conditions on polynomials. Our results also give a partial description of the perverse filtration for arbitrary potential, which we conjecture is complete in the case of tripled quivers with canonical cubic potential.
Read the full abstract

Logic

Imaginaries in perfect bounded pseudo algebraically closed fields with finitely many independent valuations

In this paper, we prove weak elimination of imaginaries for perfect bounded pseudo-algebraically closed fields equipped with finitely many independent valuations. Our approach combines an extension result for types to invariant types with an amalgamation theorem. As a special case, we obtain full elimination of imaginaries when the field is equipped with a single valuation.
Read the full abstract

Logic

Definable Functions to Quotients in Ordered Abelian Groups

In this paper we study definable families of functions from an ordered abelian group into various naturally arising definable quotients. We show that for an ordered abelian group $G$ and definable family of convex subgroups $\{D\}_{D\in\mathcal{D}}$, any definable family of functions $\{f_D\} _{D\in\mathcal{D}}$ with $f_D:G^d\rightarrow\frac{G}{D}$ is uniformly piecewise linear; for a prime $p$, integers $s,r\geq 1$, and groups $D^{[p^s]}$ defined later, if $f_D:G^d\rightarrow\frac{G}{D+p^rG}$ or $f_D:G^d\rightarrow\frac{G}{D^{[p^s]}+p^rG}$ we instead obtain that the definable family of functions is uniformly piecewise a boolean combination of linear functions to quotients by subgroups which are uniformly definable from $D$.
Read the full abstract

Numerical Analysis · Cross-listed from physics.plasm-ph

An explicit multiscale pseudo orbit-averaging time integration algorithm

We present an explicit multiscale algorithm for solving differential equations for problems with high-frequency modes that can be averaged over by separating and scaling the fast and slow dynamics within a single equation. We introduce a phased time integrator for cases where the boundaries of dynamical scales are known: one phase solves the unmodified equation, while the other freezes part of phase-space and slows down the evolution of the fast dynamics. This algorithm is applied to reduced kinetic models of plasmas in magnetic mirrors, which feature a distinct boundary between a region dominated by rapid particle transit and a region characterized by slow collisions. Two representative model problems are presented that decompose the dynamics of the magnetic mirror into a simpler, computationally inexpensive form. The model problems demonstrate a speedup by a factor of order $\omega / \nu_c$, where $\omega$ is the fast oscillation frequency and $\nu_c$ is the slow damping rate. This is a 30,000$\times$ speedup for a case of practical interest.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Contracting Neural Networks: Sharp LMI Conditions with Applications to Integral Control and Deep Learning

This paper studies contractivity of firing-rate and Hopfield recurrent neural networks. We derive sharp LMI conditions on the synaptic matrices that characterize contractivity of both architectures, for activation functions that are either non-expansive or monotone non-expansive, in both continuous and discrete time. We establish structural relationships among these conditions, including connections to Schur diagonal stability and the recovery of optimal contraction rates for symmetric synaptic matrices. We demonstrate the utility of these results through two applications. First, we develop an LMI-based design procedure for low-gain integral controllers enabling reference tracking in contracting firing rate networks. Second, we provide an exact parameterization of weight matrices that guarantee contraction and use it to improve the expressivity of Implicit Neural Networks, achieving competitive performance on image classification benchmarks with fewer parameters.
Read the full abstract

All authors Anand Gokhale, Anton V. Proskurnikov, Yu Kawano, Francesco Bullo

Representation Theory

Recollements of Cohen-Macaulay Auslander algebras for gentle algebras

We construct two recollements of module categories for the Cohen–Macaulay Auslander algebra $A^{\mathrm{CMA}}$ of a gentle algebra $A$. In this paper, we establish three equivalent characterizations for the quotient algebra $A^{\mathrm{CMA}}/A^{\mathrm{CMA}}(1-\epsilon_{\star}) A^{\mathrm{CMA}}$ of the CM–Auslander algebra of $A$ to be quasi-tilted, precisely, the following statements are equivalent: (1) $A^{\mathrm{CMA}}/A^{\mathrm{CMA}}(1-\epsilon_{\star}) A^{\mathrm{CMA}}$ is quasi-tilted; (2) $\mathrm{findim} A\leqslant 2$, and for each forbidden $A$-module $M$, $\mathrm{proj.dim}M+\mathrm{inj.dim}M\leqslant 2$; (3) for any homotopy string/band $\mathsf{h}$ none of whose arrows lie on any forbidden cycle, the cohomological width of the indecomposable object in $\mathsf{D}^b(A)$ corresponding to $\mathsf{h}$ is $\leqslant 2$. Moreover, we prove that the Krull–Gabriel dimension of $A$ is bounded by 2 if and only if the Krull–Gabriel dimension of $A^{\mathrm{CMA}}$ is bounded by 2 in the case where $A$ is gentle one-cycle.
Read the full abstract

All authors Jiacheng Xu, Yu-Zhe Liu, Xin Ma, Guiqi Shi

Algebraic Geometry

Heisenberg vertex algebras and abelian varieties

Here we construct spaces of coinvariants for Heisenberg vertex algebras on abelian varieties and show that these globalize to twisted $\mathscr{D}$-modules on the moduli space of abelian varieties. Remarkably, we recover the standard construction of these sheaves over the Torelli locus. As an example, in the case of commutative Heisenberg vertex algebras we show that the realization of coinvariants on curves as polynomial functions on one-forms extends to arbitrary abelian varieties.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Speeding Up Mixed-Integer Programming Solvers with Sparse Learning for Branching

Machine learning is increasingly used to improve decisions within branch-and-bound algorithms for mixed-integer programming. Many existing approaches rely on deep learning, which often requires very large training datasets and substantial computational resources for both training and deployment, typically with GPU parallelization. In this work, we take a different path by developing interpretable models that are simple but effective. We focus on approximating strong branching (SB) scores, a highly effective yet computationally expensive branching rule. Using sparse learning methods, we build models with fewer than 4% of the parameters of a state-of-the-art graph neural network (GNN) while achieving competitive accuracy. Relative to SCIP's built-in branching rules and the GNN-based model, our CPU-only models are faster than the default solver and the GPU-accelerated GNN. The models are simple to train and deploy, and they remain effective with small training sets, which makes them practical in low-resource settings. Extensive experiments across diverse problem classes demonstrate the efficiency of this approach.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Conclusive Identification Via Noisy Classical Channel: Superactivation and Quantum Advantage

We introduce conclusive identification task for classical channels: a receiver identifies transmitted inputs without error when possible, and responds inconclusively when outputs are ambiguous. For a symmetric not-fully-corrupted channel $N : X \to X$, the single-shot conclusive identification index $\mathrm{ci}_\circ(N)$ counts the maximum number of conclusively identifiable inputs. We show $\mathrm{ci}_\circ(N)$ exhibits a striking superactivation phenomenon: a channel with $\mathrm{ci}_\circ(N) = 0$ achieves $\mathrm{ci}_\circ(N \otimes \mathrm{id}^c_\beta) = |X|$ when assisted by a perfect classical channel of dimension $\beta < |X|$. The minimum classical assistance required equals the chromatic number $\chi(\mathtt{S}_N)$ of the channel's support graph $\mathtt{S}_N$. We provide channel families where the superactivation gap $\mathrm{ci}_\circ(N \otimes \mathrm{id}^c_\beta) - \mathrm{ci}_\circ(\mathrm{id}^c_\beta)$ can be made arbitrarily large. A noiseless quantum channel of dimension equal to the orthogonal rank $\xi(\mathtt{S}_N)$ suffices, yielding a strict quantum advantage whenever $\xi(\mathtt{S}_N) < \chi(\mathtt{S}_N)$. This advantage is demonstrated through three explicit constructions motivated by combinatorial and algebraic state-independent, and state-dependent proofs of Kochen-Specker contextuality. Via the co-normal product of graphs, we analyze the scaling of the quantum advantage ratio $\chi_f(\mathtt{S}_N)/\xi(\mathtt{S}_N)$, and present a channel for which quantum assistance is exponentially more efficient than classical. Our results establish $\mathtt{S}_N$, rather than the confusability graph $\mathtt{G}_N$, as the natural combinatorial object for conclusive identification, revealing that channels deemed useless under Shannon's zero-error framework can exhibit rich superactivation and quantum advantage, with deep connections to quantum contextuality.
Read the full abstract

All authors Anushko Chattopadhyay, Ambuj, Rakesh Das, Smritikana Patra, Chitrak Roychowdhury, Manik Banik, Amit Mukherjee

Mathematical Physics

Exact Solution of Chandrasekhar's H Function For the Isotropic Case

This study provides an exact solution to Chandrasekhar's H function for isotropic scattering. The H function, which is governed by a nonlinear integral equation, plays a central role in radiative transfer theory. To facilitate the solution, the differential form of the integral equation is derived using classical integral techniques. The resulting differential equation is then solved to yield an exact expression for the H function. Numerical results obtained from the exact solution are compared with those reported by Chandrasekhar, and the differences are presented in tabular format.
Read the full abstract

Probability · Cross-listed from stat.ML

Forecast collapse of transformer-based models under squared loss in financial time series

We study trajectory forecasting under squared loss for time series with weak conditional structure, using highly expressive prediction models. Building on the classical characterization of squared-loss risk minimization, we emphasize regimes in which the conditional expectation of future trajectories is effectively degenerate, leading to trivial Bayes-optimal predictors (flat for prices and zero for returns in standard financial settings). In this regime, increased model expressivity does not improve predictive accuracy but instead introduces spurious trajectory fluctuations around the optimal predictor. These fluctuations arise from the reuse of noise and result in increased prediction variance without any reduction in bias. This provides a process-level explanation for the degradation of Transformerbased forecasts on financial time series. We complement these theoretical results with numerical experiments on high-frequency EUR/USD exchange rate data, analyzing the distribution of trajectory-level forecasting errors. The results show that Transformer-based models yield larger errors than a simple linear benchmark on a large majority of forecasting windows, consistent with the variance-driven mechanism identified by the theory.
Read the full abstract

Information Theory · Cross-listed from stat.ML

Scaled Gradient Descent for Ill-Conditioned Low-Rank Matrix Recovery with Optimal Sampling Complexity

The low-rank matrix recovery problem seeks to reconstruct an unknown $n_1 \times n_2$ rank-$r$ matrix from $m$ linear measurements, where $m\ll n_1n_2$. This problem has been extensively studied over the past few decades, leading to a variety of algorithms with solid theoretical guarantees. Among these, gradient descent based non-convex methods have become particularly popular due to their computational efficiency. However, these methods typically suffer from two key limitations: a sub-optimal sample complexity of $O((n_1 + n_2)r^2)$ and an iteration complexity of $O(\kappa \log(1/\epsilon))$ to achieve $\epsilon$-accuracy, resulting in slow convergence when the target matrix is ill-conditioned. Here, $\kappa$ denotes the condition number of the unknown matrix. Recent studies show that a preconditioned variant of GD, known as scaled gradient descent (ScaledGD), can significantly reduce the iteration complexity to $O(\log(1/\epsilon))$. Nonetheless, its sample complexity remains sub-optimal at $O((n_1 + n_2)r^2)$. In contrast, a delicate virtual sequence technique demonstrates that the standard GD in the positive semidefinite (PSD) setting achieves the optimal sample complexity $O((n_1 + n_2)r)$, but converges more slowly with an iteration complexity $O(\kappa^2 \log(1/\epsilon))$. In this paper, through a more refined analysis, we show that ScaledGD achieves both the optimal sample complexity $O((n_1 + n_2)r)$ and the improved iteration complexity $O(\log(1/\epsilon))$. Notably, our results extend beyond the PSD setting to general low-rank matrix recovery problem. Numerical experiments further validate that ScaledGD accelerates convergence for ill-conditioned matrices with the optimal sampling complexity.
Read the full abstract

General Mathematics

The Collision Spectrum

For a prime base $b$ and primitive odd Dirichlet character $\chi$ modulo $b^2$, the collision transform coefficient $\hat{S}^{\circ}(\chi)$ admits an exact factorization: \[ \hat{S}^{\circ}(\chi) = -\frac{B_{1,\overline{\chi}} \cdot \overline{S_G(\chi)}}{\phi(b^2)}, \] where $B_{1,\overline{\chi}}$ is the generalized first Bernoulli number and $S_G(\chi)$ is the diagonal character sum. By the standard Bernoulli–$L$-value formula, $|B_1| = (b/\pi)\, |L(1, \chi)|$, so the collision invariant's Fourier spectrum encodes $L$-function special values. A Parseval identity gives an exact formula for the weighted second moment $\sum |L(1, \chi)|^2 \cdot |S_G(\chi)|^2$ in terms of the collision invariant's values on the finite group. The digit function computes this $L$-value moment exactly. Under a conditional zero-free hypothesis, the triangle inequality yields a separate bound connecting $L(1)$ to $L(s)$ for $s$ in the critical strip. At base~$5$, the factorization gives $|\hat{S}^{\circ}| \propto |L(1)|^2$ exactly. For quadratic characters in the family, the decomposition specializes to class-number data.
Read the full abstract

Differential Geometry

Sub-Riemannian structures and non-transitive Cartan geometries via Lie groupoids

In this paper we discuss how to associate a suitable non-transitive version of a Cartan connection to sub-Riemannian manifolds of corank 1 (including contact and quasi-contact sub-Riemannian manifolds) with non-necessarily constant sub-Riemannian symbols. In particular, we recast the variation of the sub-Riemannian symbols into a suitable "type" map, which is constant if and only if the symbols are constant. We then consider the (non-transitive) groupoid of sub-Riemannian symmetries and investigate its smoothness, properness, regularity, and other properties in relation with the type map. Last, we describe how to build a "non-transitive" analogue of a Cartan connection on top of such (Lie) groupoid, obtained as the sum of a tautological form with a multiplicative Ehresmann connection. We conclude by illustrating our results on concrete examples in dimension 5.
Read the full abstract

Functional Analysis

The Grothendieck Constant is Strictly Larger than Davie-Reeds' Bound

The Grothendieck constant $K_{G}$ is a fundamental quantity in functional analysis, with important connections to quantum information, combinatorial optimization, and the geometry of Banach spaces. Despite decades of study, the value of $K_{G}$ is unknown. The best known lower bound on $K_{G}$ was obtained independently by Davie and Reeds in the 1980s. In this paper we show that their bound is not optimal. We prove that $K_{G} \ge K_{DR} + 10^{-12}$, where $K_{DR}$ denotes the Davie-Reeds lower bound. Our argument is based on a perturbative analysis of the Davie-Reeds operator. We show that every near-extremizer for the Davie-Reeds problem has $\Omega(1)$ weight on its degree-3 Hermite coefficients, and therefore introducing a small cubic perturbation increases the integrality gap of the operator.
Read the full abstract

Algebraic Geometry

Nodal degeneration of chiral algebras I: Global structure and gluing formula

We define a natural extension of a universal factorization algebra $\mathcal{A}$ to families of stable punctured curves, by integrating over all semistable modifications. We prove that the resulting sheaf of factorization homology satisfies a natural gluing formula, by tensoring over a certain derived associative algebra $\mathfrak{Z}_{\mathcal{A}}^0$, generalizing the Verlinde formula for gluing of conformal blocks.
Read the full abstract

Symplectic Geometry

Canonical frames in contact 3-manifolds and applications

We study contact 3-manifolds $Y$ with a special global frame inspired by Cartan's structure equations. This frame is dual to a generalized Finsler structure defined by Bryant. We present some examples and rigidity results on the class of manifolds whose frame satisfies certain natural conditions on a scalar function $K\colon Y\to \mathbb{R}$, related to the frame. This function realizes the curvature when $Y$ is the unit tangent bundle with respect to a metric on a surface. As applications, we obtain sharp estimates for the action of a Reeb orbit in terms of this scalar function, under the assumption that the frame satisfies specific conditions. In particular, we recover a classical upper bound on the systole of positively curved metrics on $S^2$ due to Toponogov.
Read the full abstract

Analysis of PDEs

Symmetry and Qualitative & Quantitative Stability for a Class of Overdetermined Problems in C-GNP Domains with Source Supported in the Core

We introduce a unified geometric framework for domains satisfying a geometric normal property (C-GNP) relative to a strictly convex set \(C\). Under the fundamental assumption that the source \(f\) is supported within the core \(C\), we establish the stability of superlevel sets for elliptic equations and prove a rigid symmetry result for a classical Serrin-type problem via a method that avoids moving planes, relying instead on geometric monotonicity and the Hopf boundary lemma. We then extend this analysis to a coupled biharmonic overdetermined problem \(\mathrm{P}(\kappa)\) with source supported in the core. Using the compactness properties of the C-GNP class and the stability of thickness functions under Hausdorff convergence, we prove a qualitative stability theorem: if the overdetermined condition is approximately satisfied in \(L^2\) norm, the domain converges in the Hausdorff sense to the unique ball solution. Furthermore, we establish a quantitative stability estimate: there exists a constant \(C\) such that \[ \rho_e - \rho_i \le C \big\| |\nabla u| |\nabla v| - \kappa \big\|_{L^2(\partial \Omega)}^{\tau_N}, \] with \(\tau_2 = 1\), \(\tau_3\) arbitrarily close to 1, and \(\tau_N = 2/(N-1)\) for \(N \ge 4\) in the general case. For convex domains, we improve the exponent to \(\tau_N = 4/(N+1)\) via a weighted Reilly identity. The proof relies on Reilly-type integral identities adapted to the coupled system and Hardy-Poincaré inequalities tailored to the geometry.
Read the full abstract

Information Theory · Cross-listed from quant-ph

LO-Free Phase and Amplitude Recovery of an RF Signal with a DC-Stark-Enabled Rydberg Receiver

We present a theoretical framework for recovering the amplitude and carrier phase of a single received RF field with a Rydberg-atom receiver, without injecting an RF local oscillator (LO) into the atoms. The key enabling mechanism is a static DC bias applied to the vapor cell: by Stark-mixing a near-degenerate Rydberg pair, the bias activates an otherwise absent upper optical pathway and closes a phase-sensitive loop within a receiver driven only by the standard probe/coupling pair and the received RF field. For a spatially uniform bias, we derive an effective four-level rotating-frame Hamiltonian of Floquet form and show that the periodic steady state obeys an exact harmonic phase law, so that the $n$th probe harmonic carries the factor $e^{in\Phi_S}$. This yields direct estimators for the signal phase and amplitude from a demodulated probe harmonic, with amplitude recovery obtained by inverting an injective harmonic response map. In the high-SNR regime, we derive explicit RMSE laws and use them to identify distinct phase-optimal and amplitude-optimal bias-controlled mixing angles, together with a weighted joint-design criterion and a balanced compromise angle that equalizes the fractional phase and amplitude penalties. We then extend the analysis to nonuniform DC bias through quasistatic spatial averaging and show that bias inhomogeneity reduces coherent gain for phase readout while also reshaping the amplitude-response slope. Numerical examples validate the phase law, illustrate response-map inversion and mixing-angle trade-offs, and quantify the penalties induced by bias nonuniformity. The results establish a minimal route to coherent Rydberg reception of a single RF signal without an auxiliary RF LO in the atoms.
Read the full abstract

Optimization and Control

A McKean-Pontrygin maximum principle for entropic-regularized optimal transport

This note outlines a mean-field approach to dynamic optimal transport problems based on the recently proposed McKean-Pontryagin maximum principle. Key aspects of the proposed methodology include i) avoidance of sampling over stochastic paths, ii) a fully variational approach leading to constrained Hamiltonian equations of motion, and iii) a unified treatment of deterministic and stochastic optimal transport problems. We also discuss connections to well-known dynamic formulations in terms of forward-backward stochastic differential equations and extensions beyond classical entropic-regularized transport problems.
Read the full abstract

Probability

Counting partial Hadamard matrices in the cubic regime

We give a precise asymptotic formula for the number of $n\times 4t$ partial Hadamard matrices in the regimes $t/n^3\to\infty$ and $t/n^3\to\Theta$ for sufficiently large fixed $\Theta$. This strengthens earlier results of de~Launey and Levin, who obtained the asymptotic for $t/n^{12}\to\infty$, and of Canfield, who extended this to $t/n^4\to\infty$.
Read the full abstract

Dynamical Systems

Asymptotic stability of heteroclinic cycles of type Y

We investigate stability of a new class of heteroclinic cycles that we call heteroclinic cycles of type Y. The cycles can be regarded as a generalisation of heteroclinic cycles of type Z introduced in [Podvigina, Nonlinearity 25, 2012]. The type Y cycles differ from the cycles of type Z in the following: The trajectories comprising a cycle of type Y belong to flow-invariant subspaces that can be of different dimensions. Unlike in the most studies of the stability of heteroclinic cycles, we do not require that the eigenvalues of the linearisations of the dynamical system near the equilibria are distinct. Instead of the common assumption that the cycles are robust, we prescribe flow-invariance of certain subspaces. Similarly to type Z cycles, asymptotic stability and fragmentary asymptotic stability of type Y cycles is determined by the eigenvalues and eigenvectors of transition matrices. The matrices are products of basic transition matrices that depend on the eigenvalues of linearisations and the dimensions of the contracting subspaces.
Read the full abstract

Dynamical Systems

Geometry, Dynamics, and Topology of the Thickness Landscape: A Morse-Theoretic Analysis of the Return Map in the Class $\mathcal{O}_C$

We study the geometry, dynamics, and topology of the thickness landscape associated with the geometric return map in the class $\mathcal O_C$. For a convex core $C$ and an admissible outer domain $\Omega$, the fixed points of the return map $F:\partial C\to\partial C$ coincide with the critical points of the thickness function $d$. At any such critical point $c_*$, the exact linearization reads \[ DF(c_*)=I+B_*H_*, \] where $H_*=\operatorname{Hess}_{\partial C}d(c_*)$ and $B_*=d_*(I-d_*S_*)^{-1}$ is positive definite. We show that the self-adjoint preconditioned Hessian $K_*=B_*^{1/2}H_*B_*^{1/2}$ admits an exact representation via the shape operators of the core and outer boundaries, implying that curvature modulates the return spectrum while preserving the inertia of $H_*$. In the strict thickness-ascent regime, every negative eigenvalue $\mu$ of $K_*$ satisfies $\mu \in (-2,0)$, yielding the stable/unstable dimension identities for any Morse equilibrium $c_Config$: \[ \dim E^s(c_*)=\operatorname{ind}_M(c_*), \qquad \dim E^u(c_*)=m-\operatorname{ind}_M(c_*). \] Since $\partial C\cong\mathbb S^m$, Morse inequalities act as equilibrium-counting laws for the return dynamics, implying an even number of equilibria. We compute the local fixed-point index $\operatorname{ind}_{\mathrm{fix}}(F,c_*)=(-1)^{m+\operatorname{ind}_M(c_*)}$, establish the global Euler balance with $\deg(F)=1$, and identify this index with the Euler-characteristic jump in the forward-invariant superlevel filtration. Finally, we discuss invariant manifolds, a conditional Morse–Smale structure, geometric examples, and the spectral extension to Morse–Bott manifolds, unifying boundary curvature, thickness geometry, discrete dynamics, and Morse topology.
Read the full abstract

Combinatorics

Construction of additively graceful signed graphs-I

In this paper, we construct additively graceful signed graphs S from a given graph G that may be additively graceful or not be additively graceful. We also show the construction of additively graceful signed graphs from additively graceful signed graphs. We find the values of m, n in non-divisible sum graph, denoted as G(m, n), that admit additively graceful labeling.
Read the full abstract

Mathematical Physics

Functional models and self-modeling property of minimal Dirac operators on the half-line

We prove that minimal Dirac operators on the half-line are self-modeling, which means that such an operator is determined by its arbitrary unitary copy uniquely up to a transformation (shape equivalence) which changes its potential by a constant factor of modulus one. This result is obtained using the wave functional model of the minimal matrix Schrödinger operator on the half-line.
Read the full abstract

Number Theory

Some geometric series for Euler's constant

We provide representations of Euler's constant $\gamma=0.577...$ as series which converge geometrically fast (but use a certain sequence whose computation induces a quadratic cost). The asymptotic oscillations of these coefficients are determined to all orders. A result of independent interest, about sufficient conditions for the validity, in the case of unbounded parameters, for the Tricomi-Erdélyi asymptotic expansion of the ratio of two Gamma functions, is established for that purpose.
Read the full abstract

2603.29998 · 31 Mar · 32 pages, 2 figures. v2 incorporated advances from arXiv:2602.19727 and arXiv:2604.24754, v3 and v4 addressed the fact that the e_m's appeared decades ago in theoretical computer science and v5 provided their asymptotics to all orders; arXiv:2602.05511 has now been rewritten to use the tools from v5. v6 simply updates references

Number Theory

A counterexample to a conjecture of Sárközy on sums and products modulo a prime

Let $p$ be a prime and, for $A\subseteq \mathbb F_p$, define $A^\ast=(A+A)\cup(AA)$. Sárközy conjectured that there exist constants $c>0$ and $p_0$ such that, for every prime $p>p_0$, every set $A\subseteq \mathbb F_p$ with $|A|>\left(\frac12-c\right)p$ satisfies $\mathbb F_p^\times\subseteq A^\ast$. We disprove this conjecture: for every odd prime $p\ge 5$, there exists a set $A\subseteq \mathbb F_p$ with $|A|=\frac{p-1}{2}$ such that $1\notin A^\ast$. Thus no positive constant $c$ can satisfy Sárközy's conjecture. Conversely, if $|A|>\frac{p}{2}$, then $A+A=\mathbb F_p$. Therefore the sharp threshold is exactly $\frac12$.
Read the full abstract