Rings and Algebras
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Wednesday 15 April
Numerical Analysis
A monotone iterative reconstruction method for an inverse drift problem in a two-dimensional parabolic equation
We study an inverse drift problem for a two-dimensional parabolic equation on the unit square with mixed boundary conditions, where the drift coefficient is recovered from terminal observation data $g=u(\cdot,T)$. A monotone operator is constructed whose fixed point coincides with the unknown drift, yielding uniqueness in an admissible class and a constructive iterative reconstruction scheme. Numerical experiments illustrate the monotone convergence and the effectiveness of the proposed method, and show that it remains effective for noisy terminal data under the denoising strategy.
Read the full abstract
Analysis of PDEs
Homogenization and integral representation of energy functionals in manifold valued Orlicz-Sobolev spaces
This paper aims to extend to Orlicz-Sobolev spaces some results of integral representation for the simultaneous homogenization and dimensional reduction of integral energies defined on fields taking values on a differentiable manifold. Since our functional framework goes beyond the classical Sobolev's spaces, we also prove, via $\Gamma$-convergence, a general integral representation results in the unconstrained Orlicz setting. Due to $\Delta_2$ and $\nabla_2$ conditions verified by the Young function $\Phi$ (which modulated the growth behaviour), we prove that the density of the $\Gamma$-limit is a tangential quasiconvex integrand represented by a cell formula.
Read the full abstract
Information Theory
Age of Information Optimization in Distributed Sensor Networks with Half-Duplex Channels
Motivated by cooperative distributed networks in which users dynamically alternate between transmit and receive modes under half-duplex constraints, this paper studies the Age of Information (AoI) in a distributed multi-user network using an ALOHA-based protocol. We derive closed-form expressions for the average AoI and formulate an optimization problem over transmission probabilities. After proving the convexity of the problem, we leverage the derived optimality conditions to characterize optimal policies for general network graphs, obtain closed-form solutions for $d$-regular topologies, and derive tractable optimality conditions for star topologies. Numerical results confirm that the proposed mechanism can effectively and adaptively determine user-specific optimal transmission probabilities across varying network topologies. These findings contribute to the design of adaptive and efficient distributed networks with enhanced information freshness.
Read the full abstract
Probability
Low-Degree Fourier Threshold for Random Boolean Functions
We study whether a uniformly random Boolean function $f : \{-1,1\}^p \to \{-1,1\}$ is determined by its Walsh–Fourier coefficients of degree at most $d$. We show that the threshold lies at $p/2$ up to an $O(\sqrt{p \log p})$ window: if \[ d \le \frac{p}{2} - \sqrt{\frac{p}{2}\bigl(\log p + \omega(1)\bigr)}, \] then with probability $1-o(1)$ there exists another Boolean function $g \ne f$ with the same degree-$\le d$ coefficients. Conversely, for every fixed $\eta \in (0,1)$, if \[ d \ge \frac{p}{2} + \sqrt{\frac{p}{2}\log\frac{6p}{\eta^2}}, \] then with probability at least $1-2^{-p}$, the function $f$ is uniquely determined by its degree-$\le d$ coefficients, even among all bounded functions $g : \{-1,1\}^p \to [-1,1]$. This resolves a question of Vershynin.
Read the full abstract
Optimization and Control
Broximal Alignment for Global Non-Convex Optimization
Most non-convex optimization theory is built around gradient dynamics, leaving global convergence largely unexplored. The dominant paradigm focuses on stationarity, certifying only that the gradient norm vanishes, which is often a weak proxy for actual optimization success. In practice, gradient norms can stagnate or even increase during training, and stationary points may be far from global solutions. In this work, we propose a new framework for global non-convex optimization that avoids gradient-based reasoning altogether. We revisit the Ball Proximal Point Method (BPM), a trust-region-style algorithm introduced by Gruntkowska et al. (2025), and propose a novel structural condition - Broximal Alignment - under which BPM provably converges to a global minimizer. Our condition requires no convexity, smoothness, or Lipschitz assumptions, and it permits multiple and disconnected global minima as well as non-optimal local minima. We show that this class generalizes standard non-convex frameworks such as quasiconvexity, star convexity, quasar convexity, and the aiming condition. Our results provide a new conceptual foundation for global non-convex optimization beyond stationarity.
Read the full abstract
Optimization and Control
Deepbullwhip: An Open-Source Simulation and Benchmarking for Multi-Echelon Bullwhip Analyses
The bullwhip effect remains operationally persistent despite decades of analytical research. Two computational deficiencies hinder progress: the absence of modular open-source simulation tools for multi-echelon inventory dynamics with asymmetric costs, and the lack of a standardized benchmarking protocol for comparing mitigation strategies across shared metrics and datasets. This paper introduces deepbullwhip, an open-source Python package that integrates a simulation engine for serial supply chains (with pluggable demand generators, ordering policies, and cost functions via abstract base classes, and a vectorized Monte Carlo engine achieving 50 to 90 times speedup) with a registry-based benchmarking framework shipping a curated catalog of ordering policies, forecasting methods, six bullwhip metrics, and demand datasets including WSTS semiconductor billings. Five sets of experiments on a four-echelon semiconductor chain demonstrate cumulative amplification of 427x (Monte Carlo mean across 1,000 paths), a stochastic filtering phenomenon at upstream tiers (CV = 0.01), super-exponential lead time sensitivity, and scalability to 20.8 million simulation cells in under 7 seconds. Benchmark experiments reveal a 155x disparity between synthetic AR(1) and real WSTS bullwhip severity under the Order-Up-To policy, and quantify the BWR-NSAmp tradeoff across ordering policies, demonstrating that no single metric captures policy quality.
Read the full abstract
Combinatorics
An Erdős-Ko-Rado theorem for binary codes
We study intersecting families of words from the Erdős-Ko-Rado perspective. When the alphabet size is $2$, a maximum intersecting family is not necessarily a star. However, we prove that every maximum $3$-wise intersecting family is a star. We also present a new proof of the known result for alphabets of size at least $3$: maximum intersecting families of words are exactly the stars.
Read the full abstract
Information Theory
Stability of the Shannon–McMillan–Breiman Theorem under Sublinear Parsings
We establish a stability result for the Shannon-McMillan-Breiman theorem on the one-sided finite shift space. For any shift-invariant probability measure P and any data-dependent parsing whose number of blocks is sublinear in N almost surely, we show that the normalized sum of the negative log-likelihoods of the parsing blocks converges almost surely and in L^1(P) to the entropy-rate function h_P. Equivalently, we obtain an approximate factorization of cylinder probabilities under arbitrary sublinear parsings. We further show that the stability result persists under subextensive perturbations of the parsing blocks, and that sublinearity of the block count is the sharp threshold for validity at this level of generality, via a direct counterexample.
Read the full abstract
Probability
Invariant and periodic measures in classical spin systems on infinite lattices with highly degenerate noise
In this paper, we consider the classical spin systems on unbounded lattices given by infinite-dimensional stochastic differential equations (SDEs). We assume that the stochastic forcing acts only on one particle. The other particles are not subject to stochastic forcing directly, but interact with their nearest neighbouring particles. Under the above highly degenerate noise setting, with some mild assumptions on the local interaction of each particle such as weak dissipation, we obtain the existence, uniqueness and the Markovian property of weak martingale solutions. We prove that the one-dimensional noise can propagate to any spin particle in the system in the sense that there exists a unique invariant/periodic measure and geometric ergodicity holds for the Markovian system when restricted to any finite volume. We then prove the finite-dimensional invariant measure and the average of lifted periodic measure are tight, and weak convergent subsequence gives an invariant and periodic measures of the infinite spin systems, respectively, in the time-homogeneous or time-periodic cases.
Read the full abstract
Analysis of PDEs
Higher Weak Differentiability to Mixed Local and Nonlocal Degenerate Elliptic Equations in the Heisenberg Group
In this paper, we investigate the higher weak differentiability of solutions to a class of mixed local and nonlocal degenerate elliptic equations in the Heisenberg group $\mathbb{H}^n$. Owing to the non-commutative property and two-step nilpotent Lie algebra structure of $\mathbb{H}^n$, we first employ an iterative scheme involving fractional difference quotients to establish the weak differentiability of solutions in the vertical direction. This is subsequently extended to the horizontal and vertical gradients. Then, by coupling a truncation argument with the difference quotient method, we prove the higher weak differentiability of the gradients of solutions.
Read the full abstract
Algebraic Topology
Small covers as pullbacks from the simplex
We introduce and study small covers that are pullbacks from the simplex, extending pullbacks from the linear model. Our main result gives several equivalent characterizations of this class, including torsion-freeness of odd-degree integral cohomology, vanishing of the first Steenrod square on even-degree mod $2$ cohomology, and relations among integral and mod $2$ Betti numbers.
Read the full abstract
Combinatorics
Vertex-minor Ramsey numbers: exact values and extremal structure
We determine the vertex-minor Ramsey number $\Rvm(4)=11$, where $\Rvm(k)$ is the smallest~$n$ such that every $n$-vertex graph contains the edgeless graph~$E_k$ as a vertex-minor. We prove this by an exhaustive classification of the graphs on~$10$ and~$11$ vertices under local complementation. At the extremal order $n=10$, exactly six non-isomorphic graphs avoid~$E_4$ as a vertex-minor; up to isomorphism, they represent five LC-equivalence classes, and each labeled LC orbit has cardinality~$8{,}712$. Thus $k=4$ is the first case in which the general upper bound $2^k-1$ is not attained. Using the extremal graphs as building blocks, we derive explicit lower bounds on~$\Rvm(k)$ that surpass the leading term of the asymptotic bound for all $k\leq 9$; in particular, $\Rvm(5)\geq 13$. We also describe structural properties of the six extremal graphs and formulate the next open problem, whether $\Rvm(5)=15$.
Read the full abstract
Numerical Analysis · Cross-listed from cs.DC
PackSELL: A Sparse Matrix Format for Precision-Agnostic High-Performance SpMV
We propose a new sparse matrix format, PackSELL, designed to support diverse data representations and enable efficient sparse matrix-vector multiplication (SpMV) on GPUs. Building on sliced ELLPACK (SELL), PackSELL incorporates delta encoding of column indices and a novel packing scheme that stores each index-delta-value pair in a single word, thereby reducing memory footprint and data movement. This design further enables fine-grained control over the bit allocation between deltas and values, allowing flexible data representations, including non-IEEE formats. Experimental results show that, when configured for half precision (FP16), the PackSELL-based SpMV kernel outperforms the cuSPARSE SELL-based kernel by up to $1.63\times$. Moreover, with configurations using customized formats, PackSELL achieves FP32-level accuracy while exceeding the performance of FP16 cuSPARSE. These benefits extend to sparse linear solvers; for example, a mixed-precision preconditioned conjugate gradient (PCG) solver using PackSELL achieves up to a $2.09\times$ speedup over the standard full-precision PCG.
Read the full abstract
Information Theory
Explicit Rank Extractors and Subspace Designs via Function Fields, with Applications to Strong Blocking Sets
We give new explicit constructions of several fundamental objects in linear-algebraic pseudorandomness and combinatorics, including lossless rank extractors, weak subspace designs, and strong $s$-blocking sets over finite fields. Our focus is on the small-field regime, where the field size depends only on a secondary parameter (such as the rank or codimension) and is independent of the ambient dimension. This regime is central to several applications, yet remains poorly understood from the perspective of explicit constructions. In this setting, we obtain the first explicit constructions of lossless rank extractors and weak subspace designs for $r\ll k$, where $r$ denotes the rank (or codimension), over finite fields $\mathbb{F}_q$ with $q \ge \mathrm{poly}(r)$ and $q$ non-prime, with near-optimal parameters. For other finite fields, including prime fields and small fields, we obtain weaker but still improved bounds. As a consequence, we construct explicit strong $s$-blocking sets in $\mathrm{PG}(k-1,q)$ of size $O(s(k-s)q^s)$ for all sufficiently large non-prime fields $q \ge \mathrm{poly}(s)$, matching the best known non-explicit bounds up to constant factors. This significantly improves the previous best bound $2^{O(s^2 \log s)} q^s k$ of Bishnoi and Tomon (Combinatorica, 2026), which requires $q \ge 2^{\Omega(s)}$. Our approach is primarily algebraic, combining techniques from function fields and polynomial identity testing. In addition, we develop a complementary Fourier-analytic framework based on $\varepsilon$-biased sets, which yields improved explicit constructions of strong $s$-blocking sets over small fields.
Read the full abstract
Differential Geometry
Infinite existence of equivariant minimal hypersurfaces
For a closed Riemannian manifold $M$ with a compact Lie group $G$ acting by isometries, we show that there are infinitely many $G$-invariant minimal hypersurfaces. Under the assumption that $M$ contains at most a finite number of minimal $G$-hypersurfaces admitting no $G$-invariant unit normal, we further show that each $G$-homology class of $M$ admits infinitely many distinct realizations by embedded minimal $G$-hypersurfaces. The proof relies on a new algorithm that employs multi-stage maximal cuttings. As part of this work, we also established an equivariant min-max theory in manifolds with cylindrical ends.
Read the full abstract
Complex Variables
Some variational problems for the complex Monge–Ampère operator
We consider the Dirichlet problem for the complex Monge–Ampère equation on strongly pseudoconvex Kähler manifolds when the right-hand side is decreasing in the solution. Using flow-based arguments, we establish existence of smooth solutions in a number of natural circumstances, following work of Chou-Wang.
Read the full abstract
Mathematical Physics · Cross-listed from physics.bio-ph
Membrane Tension Governs Particle Wrapping-Unwrapping Transitions and Stalling
Membrane wrapping controls nanoparticle uptake during endocytosis, whereas the reverse process of membrane unwrapping accompanies particle expulsion and membrane fusion events. Existing theoretical descriptions typically focus on adhesion and bending energies within the particle membrane contact region and often neglect the deformation energy of the membrane outside the contact zone. This approximation is valid only in the limit of vanishing membrane tension, where the non contact membrane assumes a catenoid like configuration with negligible bending energy. However, at finite tension the deformation of the non contact membrane becomes a dominant energetic contribution. Here we show that this tension dependent non contact energy governs the progression of particle wrapping. By analysing the variation of the total membrane energy with wrapping degree, we uncover a competition between particle adhesion, membrane tension and particle size that determines whether wrapping proceeds, stalls, or reverses into spontaneous unwrapping. This framework reveals a stalling boundary separating regimes of particle uptake and expulsion. To capture the non contact deformation efficiently, we derive a compact phenomenological approximation that accurately reproduces the full numerical solution of the membrane shape. The resulting energetic map provides a unified physical description of particle wrapping and unwrapping, with implications for endocytosis, membrane fusion, and nanoparticle design.
Read the full abstract
Classical Analysis and ODEs
Haar bases for multi-parameter twisted structures
Motivated by the Cauchy–Szegő projections on a broad class of Siegel domains and the geometric quotient structures of nilpotent Lie groups observed by Nagel, Ricci, and Stein, we develop a martingale and Haar wavelet framework for twisted multi-parameter geometries. We introduce twisted dyadic filtrations and construct adapted Haar bases on Euclidean spaces $\mathbb{R}^{2m}$. Each of the resulting dyadic systems forms a complete orthonormal basis of $L^2(\mathbb R^{2m})$, and their union yields a tight frame with frame bound $3$. We establish $L^p$-equivalences for the associated discrete twisted Littlewood–Paley square functions. Furthermore, we extend this discrete real-variable theory to the non-abelian setting of a nilpotent Lie group of step two, $\mathscr{N}$, which serves as the Shilov boundary of certain fundamental Siegel domains. By projecting product fractal tiles from a lifting group of Heisenberg products, we define twisted dyadic shards and construct twisted nilpotent Haar frames. More precisely, we first introduce raw projected shards that reflect the quotient geometry, and then pass to analytic dyadic shards which are exactly rectifiable and remain uniformly comparable to the raw quotient structure in the relevant scale regimes. This yields a discrete framework adapted to twisted quotient geometries in both the Euclidean and nilpotent settings, providing a basic dyadic infrastructure for further developments in twisted real-variable theory.
Read the full abstract
Dynamical Systems
A dynamical system approach to modeling neural network activity in Drosophila orientation
We introduce and analyze a class of neural network models motivated by the Drosophila central complex nervous system, designed to capture the emergence and dynamics of orientation-selective activity bumps. Starting from a biologically inspired ring-connectivity model, we derive a simplified reduced model of recurrent neural activity that supports stable, localized patterns encoding angular position during the fly's flight orientation. We first study the deterministic dynamics and identify parameter regimes ensuring existence and global stability of bump solutions. We then extend the framework to a stochastic setting, incorporating both additive Brownian noise and a Markovian switching mechanism representing time-varying external cues. The resulting system is a switching diffusion with piecewise linear drift, for which we establish well-posedness, characterize the infinitesimal generator, and prove the existence of an invariant measure. Numerical simulations in low and high dimensions illustrate the robustness of the bump attractor under noise and switching stimuli, as well as the convergence toward the predicted stationary states. These results provide a mathematically tractable framework for understanding how population activity in the insect central complex encodes heading direction in the presence of variability.
Read the full abstract
Combinatorics
Affine Subspace Statistics in the Hypercube
We study the intersection statistics of affine subspaces in the hypercube $\mathbb{F}_2^n$, motivated by recent work of Alon, Axenovich, and Goldwasser on the intersection statistics of axis-aligned subcubes of an $n$-dimensional cube. Let $d\ge 1$ and $0\le s\le 2^d$ be nonnegative integers. For a subset $A\subseteq \mathbb{F}_2^n$ where $n\ge d$, define $\lambda^*(n,d,s,A)$ to be the fraction of affine $d$-flats in $\mathbb{F}_2^n$ that intersect $A$ at exactly $s$ points. Let $\lambda^*(n,d,s) = \max_{A\subseteq \mathbb{F}_2^n}\lambda^*(n,d,s,A)$ and let $\lambda^*(d,s) = \lim_{n\to \infty}\lambda^*(n,d,s)$. We show that when $s = j\cdot 2^k$ with $j$ odd and $k\ge 1$, we have $\lambda^*(d,s)\to 1-\Theta(2^{-k})$ as $d\to \infty$. This implies that $\lambda^*(d,s)$ is controlled up to constant factors by the $2$-adic valuation of $s$ when $s$ is even. When $s$ is odd, we show that $\lambda^*(d,s)\le \frac{1}{2}$ in contrast to the behavior of axis-aligned subcube statistics. We also present several upper and lower bounds for certain specific values of $s$.
Read the full abstract
Dynamical Systems
Periodic data rigidity for cocycles and hyperbolic automorphisms
We study cohomology of Holder continuous linear cocycles over a hyperbolic dynamical system and regularity of conjugacy between Anosov systems. For cocycles $A$ and $B$ with conjugate periodic data, we establish Holder cohomology under various conditions: the periodic data of $B$ has narrow spectrum and the periodic data conjugacy $C(p)$ is Holder continuous at a periodic point; $B$ is constant and the cocycles are measurably cohomologous; $B$ is constant and diagonalizable over $\mathbb C$ and either its Lyapunov spaces are at most two-dimensional or $C(p)$ is in a bounded set. We also prove that a topological conjugacy between a weakly irreducible hyperbolic automorphism $L$ and an Anosov diffeomorphism $f$ of $\mathbb T^d$ is smooth if their derivative cocycles $L$ and $Df$ are conjugate. Using this and our results on cohomology of cocycles we obtain global periodic data rigidity results for weakly irreducible hyperbolic automorphisms. In the argument we also establish differentiability of stable holonomies in low regularity setting.
Read the full abstract
Optimization and Control
A short proof of near-linear convergence of adaptive gradient descent under fourth-order growth and convexity
Davis, Drusvyatskiy, and Jiang showed that gradient descent with an adaptive stepsize converges locally at a nearly-linear rate for smooth functions that grow at least quartically away from their minimizers. The argument is intricate, relying on monitoring the performance of the algorithm relative to a certain manifold of slow growth – called the ravine. In this work, we provide a direct Lyapunov-based argument that bypasses these difficulties when the objective is in addition convex and a has a unique minimizer. As a byproduct of the argument, we obtain a more adaptive variant than the original algorithm with encouraging numerical performance.
Read the full abstract
Optimization and Control
Convergence of the Iterates of the Stochastic Proximal Gradient Method
We propose a novel study of the stochastic proximal gradient method for minimizing the sum of two convex functions, one of which is smooth. Under suitable assumptions and without requiring any boundedness or control of the variance of the random variables, we derive the almost sure convergence and the convergence in the mean of the iterates to a solution of the minimization problem. The results are applied to classification and convex feasibility problems.
Read the full abstract
Probability
Multiradial Schramm-Loewner evolution: Infinite-time large deviations and transience
In previous work [AHP24], we proved a finite-time large deviation principle in the Hausdorff metric for multiradial Schramm-Loewner evolution, SLE$(\kappa)$, as $\kappa \to 0$, with good rate function being the multiradial Loewner energy. Here, we extend this result to infinite time in the topology of common-capacity-parameterized curves, and streamline the proof. A main step is to derive detailed escape probability estimates for multiradial SLE$(\kappa)$ curves in the common parameterization, which extend the single-curve estimates achieved in [AP26]. As a by-product, we also get that multiradial SLE$(\kappa)$ curves, with $\kappa \leq 8/3$, are transient at their common terminal point, generalizing [FL15, HL21]. As a corollary to the LDP result, we obtain explicit asymptotics of the Brownian loop measure interaction term for finite-energy radial multichords, which is linear in the capacity-time and coincides with a certain choice of a cocycle for the Virasoro algebra.
Read the full abstract
Optimization and Control
Revisiting the Constant Stepsize Stochastic Approximation with Decision-Dependent Markovian Noise
We revisit the convergence analysis of constant stepsize stochastic approximation (SA) with decision-dependent Markovian noise, with a focus on characterizing the stationary bias against the root of the mean-field equation. We first establish the finite-time $p$-th moment bounds for the SA iterates in a general decision-dependent setting, which serve as a stability foundation for the subsequent analysis. Building on this foundation, and leveraging a local regularity condition termed Poisson–Gateaux differentiability (WD$^\ast$) for the solution to Poisson equation induced by the decision-dependent Markov kernel, we show that the stationary bias is of the order $\mathcal{O}(\alpha)$ for a broad class of decision-dependent settings. Additionally, we establish geometric weak convergence of the joint SA process towards a unique stationary distribution, and a functional central limit theorem. Our relaxed regularity condition enables us to cover cases of non-smooth kernels such as acceptance–rejection mechanisms, projected Langevin dynamics, and clipped state dynamics.
Read the full abstract
Dynamical Systems
Integral representation of Lyapunov exponents
We introduce a new operator-theoretic construction of Lyapunov growth for Markov-driven systems. The construction is based on an abstract variational principle for asymptotic growth rates arising from a subadditive process generated by an intertwining pair of Markov operators on a measurable bundle with compact fibers: for each invariant base measure, the fiberwise-maximal growth rate equals the supremum of the fiber integral over invariant lifts, and this supremum is attained on an ergodic lift. For random linear bundle morphisms driven by Markovian place-dependent noise, this yields Lyapunov exponents defined intrinsically from the initial law on the state-phase space. We prove that these exponents coincide with the classical path-space skew-product Lyapunov spectrum, showing that the pointwise exponents depend only on the current noise state and initial position, not on the full noise realization. We also obtain new asymptotic formulas for the sums of Lyapunov exponents as conditional annealed growth rates along individual directions. As further consequences of this variational principle, we recover and extend to singular linear bundle morphisms the classical projective variational formulas.
Read the full abstract
Rings and Algebras
Growth in noncommutative algebras and entropy in derived categories
A noncommutative projective variety is defined, after Artin and Zhang, by a graded coherent algebra A, where the category of coherent sheaves is the quotient qgr(A) of the category of finitely presented graded modules by the subcategory of torsion modules. We consider the categorical and polynomial entropies of the Serre twist, that is, of the degree shift functor on the bounded derived category of qgr(A). These two types of entropy can be viewed as analogues of the dimension of the noncommutative variety. We relate these invariants with the growth of the algebra. For algebras of finite global dimension, the entropies are bounded above by the growth entropy and the Gelfand–Kirillov dimension of the algebra. Moreover, these equalities hold for regular algebras, as well as for coordinate rings of smooth projective varieties. However, the polynomial entropy is zero for monomial algebras of polynomial growth, so in this case the inequality is strict.
Read the full abstract
Number Theory
Representation of Ramanujan's tau function by twisted divisor functions
We present an infinite family of identities that represent Ramanujan's tau function in terms of convolution sums of twisted divisor functions. Our method involves explicitly constructing non-vanishing level $1$ cusp forms from modular forms of higher levels.
Tuesday 14 April
Rings and Algebras