Statistics Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Tuesday 24 February
This paper studies the means-testing problem under weakly correlated Normal setups. Although quite common in genomic applications, test procedures having exact FWER control under such dependence structures are nonexistent. We explore the asymptotic behaviors of the classical Bonferroni (when adjusted suitably) and the Sidak procedure; and show that both of these control FWER at the desired level exactly as the number of hypotheses approaches infinity. We derive analogous limiting results on the generalized family-wise error rate and power. Simulation studies depict the asymptotic exactness of the procedures empirically.
Analysis of PDEs
Attractor Continuity for Semilinear Parabolic Equations on Thin Domains with Degenerating Outward Peaks
In this work, we analyze the asymptotic behavior of the attractors associated with a semilinear parabolic equation subject to homogeneous Neumann boundary conditions and defined on a thin domain $R^\varepsilon \subset \mathbb{R}^{1+n}$. We assume that the thin domain exhibits a cusp, known as an outward peak, whose geometry is characterized by a nonnegative function that vanishes at a point on the boundary. Our objective is to rigorously establish the continuity of the attractors as $\varepsilon \to 0$ and to determine their rate of convergence.
Read the full abstract
Optimization and Control
An accelerated rearrangement method for two-phase composite optimization
We propose and analyze an Accelerated Rearrangement Method (ARM) for solving a class of nonconvex optimization problems involving two-phase composites. These problems include maximizing the (work) energy of a membrane governed by the Poisson equation and minimizing the principal eigenvalue of a weighted Dirichlet-Laplacian, both subject to material distribution constraints. Building on the classical rearrangement method, we introduce momentum-like acceleration by extrapolating the Fréchet derivative, leading to a provably convergent algorithm. We also introduce a restarted variant that guarantees monotonic improvement of the objective. In one dimension, we derive asymptotic convergence rates for ARM and prove that they improve upon the classical rearrangement method. Numerical experiments in both two and three dimensions confirm the accelerated convergence and demonstrate practical efficiency.
Read the full abstract
Analysis of PDEs
Global Strong Well-posedness of the heat-conducting, compressible primitive Equations
The full heat-conducting compressible primitive equations are considered, extending the compressible primitive-equation framework by coupling the temperature through the ideal gas law and the thermal energy balance in the presence of gravity. Global strong well-posedness is established for small perturbations of an equilibrium state, thereby providing a result beyond the isothermal regime. The proof relies on a structural representation of the density in terms of the temperature and on a new Lagrangian transformation.
Read the full abstract
Dynamical Systems
Horns in Billiards
We show that, like cusps, horns in billiards expel every trajectory after finitely many collisions. We further produce an adiabatic invariant.
Analysis of PDEs
Scattering map for the Vlasov–Poisson system with a repulsive harmonic potential
We consider the Vlasov–Poisson system with a repulsive harmonic potential and prove (modified) scattering of solutions for small initial data. Moreover, we construct (modified) wave operators for small final data. The main novelty of this work is to introduce the kinetic lens transform which enables us to relax the regularity assumption and the spatial decay assumption on the initial data compared to Bigorgne, Velozo Ruiz, and Velozo Ruiz (2025) and Velozo Ruiz, and Velozo Ruiz (2024)and to construct wave operators.
Read the full abstract
Category Theory
Classifying anima of condensed $\infty$-categories of points
We compare the classifying anima of two natural condensed $\infty$-categories associated to a coherent $\infty$-topos. One from our work with Barwick and Glasman on exit-path categories in algebraic geometry, and the other from Lurie's work on ultracategories. The key consequence of our comparison is a connection between algebraic geometry and model theory: up to a mild completion, the proétale fundamental group of a scheme and the Lascar group of a complete first-order theory are both special cases of the same construction.
Read the full abstract
Logic
Quantifier Elimination and Invariant Theory: Applications to Quaternions, Octonions, and Other Algebras
We build on our previous paper \cite{constructive} by using the general method introduced there in conjunction with invariant theory. This yields quantifier elimination results for the classical quaternions, octonions, as well as other classes of finite-dimensional algebras over real closed and algebraically closed fields. In particular, the first two examples answer an open question posed recently in \cite{savi}.
Read the full abstract
Mathematical Physics · Cross-listed from cond-mat.mes-hall
Time-dependent Magnetic Fields and the Quantum Hall Effect
Ermakov has shown how the solution to the classical harmonic oscillator in one spatial dimension with general time-dependent frequency can be reduced to the time-independent case and an associated nonlinear ordinary differential equation, an analysis which has been applied to the Schrödinger equation as well. We extend this analysis to the Landau problem of a charged particle in a uniform magnetic field in two dimensions and construct the generalized Laughlin wave functions for the case when the magnetic field is time-dependent. We also work out the dynamics of density fluctuations (the Girvin, MacDonald, Platzman or GMP mode) and argue that it is possible to tune the frequency of the magnetic field to obtain a compressible droplet of fermions. We also analyze the dynamics of the edge modes of the droplet for the integer Hall effect.
Read the full abstract
Optimization and Control · Cross-listed from cs.LG
Dynamic Symmetric Point Tracking: Tackling Non-ideal Reference in Analog In-memory Training
Analog in-memory computing (AIMC) performs computation directly within resistive crossbar arrays, offering an energy-efficient platform to scale large vision and language models. However, non-ideal analog device properties make the training on AIMC devices challenging. In particular, its update asymmetry can induce a systematic drift of weight updates towards a device-specific symmetric point (SP), which typically does not align with the optimum of the training objective. To mitigate this bias, most existing works assume the SP is known and pre-calibrate it to zero before training by setting the reference point as the SP. Nevertheless, calibrating AIMC devices requires costly pulse updates, and residual calibration error can directly degrade training performance. In this work, we present the first theoretical characterization of the pulse complexity of SP calibration and the resulting estimation error. We further propose a dynamic SP estimation method that tracks the SP during model training, and establishes its convergence guarantees. In addition, we develop an enhanced variant based on chopping and filtering techniques from digital signal processing. Numerical experiments demonstrate both the efficiency and effectiveness of the proposed method.
Read the full abstract
Combinatorics
Theta-Relations Among Degree-Based Tree Indices
In this paper, degree-based topological indices play a key role in the structural analysis of graphs in this paper and have significant uses in chemical graph theory. We investigate the connections between three such tree indices: the Albertson, Sombor, and Sigma indices. We show that the quadratic degree deviation, measured by the Sigma index, tightly controls the Sombor index of a tree by establishing sharp two-sided bounds. We demonstrate that the Sombor and Sigma indices are asymptotically equivalent up to constant factors as a direct result. A pure $\Theta$-relationship between the Sombor index and the Albertson index is derived by taking into account extremal trees with a fixed degree sequence. This finding demonstrates that, in extremal configurations, quadratic degree interactions and absolute degree disparities scale appropriately. Overall, our data suggest that the Sombor index functions as an intermediate descriptor, capturing both global degree dispersion and local edge irregularity. From a structural standpoint, these findings clarify the relationship between vertex-based and edge-based irregularity measurements in trees.
Read the full abstract
Probability
The Instability of all Backoff Protocols
In this paper we prove Aldous's conjecture from 1987 that there is no backoff protocol that is stable for any positive arrival rate. The setting is a communication channel for coordinating requests for a shared resource. Each user who wants to access the resource makes a request by sending a message to the channel. The users don't have any way to communicate with each other, except by sending messages to the channel. The operation of the channel proceeds in discrete time steps. If exactly one message is sent to the channel during a time step then this message succeeds (and leaves the system). If multiple messages are sent during a time step then these messages collide. Each of the users that sent these messages therefore waits a random amount of time before re-sending. A backoff protocol is a randomised algorithm for determining how long to wait – the waiting time is a function of how many collisions a message has had. Specifically, a backoff protocol is described by a send sequence $\overline{p} = (p_0,p_1,p_2,\ldots)$. If a message has had $k$ collisions before a time step then, with probability $p_k$, it sends during that time step, whereas with probability $1-p_k$ it is silent (waiting for later). The most famous backoff protocol is binary exponential backoff, where $p_k = 2^{-k}$. Under Kelly's model, in which the number of new messages that arrive in the system at each time step is given by a Poisson random variable with mean $\lambda$, Aldous proved that binary exponential backoff is unstable for any positive $\lambda$. He conjectured that the same is true for any backoff protocol. We prove this conjecture.
Read the full abstract
Functional Analysis
Continuous Selections, Function Spaces and Partitions of Unity
The famous Michael selection theorem deals with the characterisation of paracompact spaces by continuous selections of lower semi-continuous mappings in Banach spaces. In this paper, we will discuss several equivalent forms of this theorem, without explicitly mentioning paracompactness. This will be based on a previous result, also obtained by Michael, that a space $X$ is paracompact if and only if every open cover of $X$ has an index-subordinated partition of unity. Thus, we will show that the existence of such partitions of unity on a space $X$ is equivalent to the existence of continuous selections for special lower semi-continuous mappings from $X$ to the nonempty convex subsets of special function spaces.
Read the full abstract
Rings and Algebras
Ternary Idempotent $\Gamma$-Semirings, Non-Reducibility, and Higher-Order Path Algebras
Binary idempotent semirings govern classical path algebras. Their multiplicative structure is dyadic. We examine whether this restriction is structural or accidental. We define ternary idempotent $\Gamma$-semirings as higher-arity ordered algebraic systems admitting associative ternary composition compatible with idempotent addition. We prove that such structures strictly extend classical semiring path algebras. In particular, we construct a ternary associative operation which cannot be represented as an iterated associative binary operation. This establishes non-reducibility. We formulate a higher-order path problem in directed graphs with weights in a ternary idempotent $\Gamma$-semiring. The associated relaxation operator is shown to be monotone on a complete lattice and to admit a least fixed point. Convergence follows under a finite acyclicity condition. The combinatorial growth of interaction windows yields a distinct complexity class relative to binary path schemes. These results indicate that dyadic semiring frameworks do not exhaust algebraic path formalisms. Higher-arity composition introduces structural phenomena absent in binary systems.
Read the full abstract
Algebraic Geometry
A Čech–Stokes Pushout Groupoid: a Log/Kummer Betti Presenter for Stokes Torsors
We give an explicit Betti presentation of the Stokes torsors attached to meromorphic flat connections of prescribed irregular type along a simple normal crossings divisor, at fixed Kummer level. Our construction is strictly 1-categorical and cover-based: on a punctured logarithmic collar of the divisor, we define a small Cech–Stokes groupoid and prove that the boundary Stokes moduli is described by sections of a natural forgetful functor, rather than by representations of the decorated boundary groupoid itself. By gluing this boundary model to the ordinary Cech presenter of the complement through an explicit pushout construction, we obtain a groupoid presentation that computes the global Stokes objects. The resulting presentation is canonical up to Morita equivalence, compatible with Kummer descent along all normal crossings strata, and admits an explicit finite local description near corners in terms of nonabelian cocycles and relations.
Read the full abstract
Mathematical Physics · Cross-listed from cond-mat.str-el
Detecting Higher Berry Phase via Boundary Scattering
Higher Berry phase has recently been proposed to study the topology of the space of gapped many-body quantum systems. In this work, we develop a boundary-scattering approach to detect higher Berry phases in one-dimensional gapped free-fermion systems. By coupling a gapless lead to the gapped system, we demonstrate that the higher Berry invariant can be obtained by studying the higher winding number of the boundary reflection matrix. The resulting topological invariant is robust against perturbations such as disorder. Our approach establishes a connection between higher Berry invariants and transport properties, thereby providing a potentially experimentally accessible probe of parametrized topological phases.
Read the full abstract
Algebraic Topology
The 15 Puzzle and homological stability in the space direction
The ordered configuration space of $n$ open unit squares in the $w$ by $h$ rectangle exhibits homological stability in the space direction. That is, for fixed $n$ and fixed homological degree $k$, once the underlying rectangle is large enough, making it any larger does not change the $k$-th homology of the square configuration space. In this paper, we sharpen the stable range. Finding bounds for $w$ and $h$ in terms of $n$ and $k$, we prove that most rectangles can be almost entirely filled with squares and there still be an isomorphism between the $k$-th homology of the resulting square configuration space and the $k$-th homology of the ordered configuration space of $n$ points in the plane.
Read the full abstract
Probability
A Limit in Law for the Cover Time and Last Visited Vertex of Wired Planar Domains
We derive a scaling limit in law for the cover time of a simple random walk on a lattice version of a scaled-up planar domain with wired boundary conditions. The limiting distribution is that of a Gumbel Random Variable shifted randomly by an independent quantity which is equal to the full mass of a variant of the critical Liouville Quantum Gravity Measure on the same domain. We also derive a limit in law for the scaled location of the vertex visited last by the walk. Here the limit turns out to be precisely the critical Liouville Measure, normalized by its total mass. Both limits hold jointly with the limiting joint law explicitly described. These results resolve well known open problems in the field, in the case of wired boundary conditions. The proof is based on comparison with the extremal landscape of the discrete Gaussian Free Field, and in particular a version there-of obtained by conditioning the average value of the field to be zero.
Read the full abstract
Combinatorics
On infinite sets with no $3$ on a line
We give a construction of an infinite set of points $A$ in $\mathbb{R}^2$ such that any subset $P\subseteq A$ has a constant density subset $P'$ with no three points collinear and yet $A$ cannot be separated into finitely many subsets such that each subset has no three points collinear. This provides a new proof of a question of Erdős, Nešetřil, and Rödl. The construction was generated by an internal model at OpenAI.
Read the full abstract
Optimization and Control
Optimal extraction with an impact on diffusion-jump pricing
We study an optimal extraction problem where the agent's actions in the spot market exert an additive proportional negative impact on the commodity price. The commodity price dynamics, prior to any activity by the agent, are evolved by a drifted Brownian motion with jumps. The agent's primary aim is to identify an optimal extraction strategy that maximizes their expected net profits.
Read the full abstract
General Mathematics
Rigorous Geometric Obstructions for Fourier Curves Generated by Prime Numbers
We study planar curves defined by finite Fourier series of the form $F_n(t)=\sum_{p\le n} v_p(n!)\, e^{i p t}$, where the frequencies are the prime numbers and $v_p(n!)$ denotes the exponent of the prime $p$ in the factorization of $n!$. We establish several rigorous obstructions to uniform geometric regularity as $n\to\infty$. In particular, we prove that the curve lengths grow without bound, that neither the first nor the second derivatives remain uniformly bounded, and that the diameters grow at least on the order of $n\log\log n$. As a consequence, the covering numbers of the curves satisfy explicit quantitative lower bounds. These results provide a rigorous explanation for the complex geometric behavior observed in numerical investigations of this model.
Read the full abstract
Combinatorics · Cross-listed from cs.AI
A Dynamic Survey of Soft Set Theory and Its Extensions
Soft set theory provides a systematic framework for parameterized decision-making by associating each parameter with a subset of a given universe, thereby enabling structured representations of uncertainty [1, 2]. Over the past decades, the theory has evolved into a broad range of extensions, including hypersoft sets, superhypersoft sets, TreeSoft sets, bipolar soft sets, and dynamic soft sets, while also establishing connections with various mathematical disciplines, particularly topology and matroid theory. This book presents a comprehensive survey of soft set theory and its principal extensions, with particular emphasis on parameter spaces, value spaces, representative mathematical constructions, and the underlying assumptions necessary for rigorous comparisons among different frameworks. It carefully distinguishes established definitions from the literature from exploratory formulations and critically examines the limitations of selected claims concerning representation and reduction. Building upon the first edition, this second edition introduces additional concepts and illustrative examples, addresses previously identified mathematical inconsistencies and typographical errors, and refines the overall structure and presentation to enhance mathematical rigor, clarity, and readability.
Read the full abstract
Numerical Analysis
Variants of Raviart-Thomas mixed elements for curved domains using straight-edged tetrahedra
A numerical study of tetrahedral Raviart-Thomas mixed finite element methods is presented in the solution of model second order boundary value problems posed in a curved spatial domain. An emphasis is given to the case where normal fluxes are prescribed on a boundary portion. In this case the question on the best way to enforce known boundary degrees of freedom is raised. It seems intuitive that the normal component of the flux variable should preferably not take up corresponding prescribed values at nodes shifted to the boundary of the approximating polyhedron in the underlying normal direction. This is because an accuracy downgrade is to be expected, as shown in https://doi.org/10.1137/15M1045442 and https://doi.org/10.1051/m2an/2025028. In the former work accuracy improvement is achieved by means of a standard Galerkin formulation with parametric elements. The latter one in turn advocates the use of straight-edged triangles combined with a Petrov-Galerkin formulation, in which the aforementioned shift applies only to the test-flux space, while the shape-flux space consists of fields whose fluxes satisfy the prescribed conditions on the true boundary. The first purpose of this article is to show that the method studied in https://doi.org/10.1051/m2an/2025028 for two-dimensional problems can be extended quite naturally to the three-dimensional case. More particularly we illustrate this by carrying out numerical experimentation with such a version for the two lowest order methods of this family, as compared to the corresponding do-nothing strategy. In the case of the lowest order method this comparative study is enriched by assessing as well the performance of its Hermite analog introduced in https://doi.org/10.1016/j.cam.2012.08.027.
Read the full abstract
Combinatorics
The Universe Fan
The wavefunction of the universe, as studied in perturbative quantum field theory, is a rational function whose singularities and factorization properties encode a rich underlying combinatorial structure. We define and study a broad generalization of such wavefunctions that can be associated to any lattice. We obtain these wavefunctions as the Laplace transform of a polyhedral fan, the universe fan, whose cones are defined by positivity conditions reflecting a notion of causality in the lattice, and we describe its face lattice. In the matroid case, the universe fan projects to the nested set fan, and the wavefunctions we define recover the matroid amplitudes introduced by Lam as residues. Moreover, in the case relevant for physics, the positivity conditions give a novel way to study the wavefunction, and we show how it is related to the cosmological polytopes of Arkani-Hamed, Benincasa, Postnikov. Finally, we study refinements of the universe fan induced by piecewise linear (tropical) functions. The resulting subdivisions project to refinements of the nested set fan and correspond dually to blow-ups of matroid polytopes, generalizing the cosmohedron polytope.
Read the full abstract
Differential Geometry
Magnetic equations on the Heisenberg group: symmetries, solutions and the inverse problem of the calculus of variations
The Heisenberg Lie group $H_3$ is modeled on the differentiable structure of $\mathbb{R}^3$ but equipped with another non-commutative product operation. By fixing the usual metric on the Heisenberg Lie group, this work provides a comprehensive overview of the behavior of magnetic geodesics for any invariant Lorentz force. After writing the magnetic equations, we found symmetries that enable the explicit computation of the magnetic trajectories for any homogeneous exact and non-exact magnetic form. Finally we show that these magnetic trajectories are solutions of a variational problem: we present explicit examples of Lagrangians.
Read the full abstract
Category Theory
On Gluing Data, Finite Ringed Spaces and schemes
From descent theory to higher geometry, the idea of gluing has been embedded in many elegant and powerful techniques, proving instrumental for the solution of many problems. In this paper, we introduce a framework that allows to link important geometric objects, such as differentiable manifolds or schemes, to certain finite ringed spaces arising from sheaves on 2 dimensional semisimplicial sets, thus opening the door to their applications in fields such as discrete differential geometry.
Read the full abstract
Differential Geometry
Sheaves on Graphs and their Differential Calculi
In this paper we explore the link between the theory of sheaves on graphs and noncommutative geometry showing that many concepts and constructions in the latter can be generalized and enhanced using methods coming from the former. They include notions such as Laplacians and connections, important in the theory of discrete noncommutative geometry, that are here explored with sheaf theoretic methods and using the language of (semi)simplicial sets.
Read the full abstract
Information Theory
Hybrid Wireless-Fed Pinching-Antenna Systems with Residual Self-Interference-Aware Optimization
Pinching-antenna systems (PASS) have recently emerged as a promising solution for enhancing coverage in high-frequency wireless communications by guiding signals through dielectric waveguides and radiating them via position-adjustable antennas. However, their practical deployment is limited by waveguide attenuation and the need for physical line installation, which restrict flexibility and coverage extension. To address these challenges, this paper proposes a hybrid wireless-fed PASS architecture, where a base station equipped with an antenna array provides adaptive directional transmission to a full-duplex amplify-and-forward relay employing a horn antenna to feed the waveguide. This hybrid design balances beamforming flexibility and low-complexity directional waveguide interfacing. Residual self-interference (SI) at the full-duplex relay is explicitly modeled to capture practical system impairments. Under this framework, a total power minimization problem is formulated subject to a quality-of-service constraint at the user equipment, involving the joint optimization of the pinching-antenna position, the relay amplification gain, and the base station transmit power. By exploiting the structure of the end-to-end signal-to-noise ratio, the optimal pinching-antenna position is first obtained in closed form by balancing waveguide attenuation and free-space path loss. Closed-form expressions for the optimal relay gain and transmit power are then derived. Numerical results under the adopted system-level model demonstrate that the proposed scheme reduces total power consumption compared with conventional benchmark systems, while providing a more realistic and robust design by accounting for residual SI.
Read the full abstract
Mathematical Physics · Cross-listed from physics.flu-dyn
A Novel Explicit Filter for the Approximate Deconvolution in Large-Eddy Simulation on General Unstructured Grids: A posteriori tests on highly stretched grids
Explicit filters play a pivotal role in the scale separation and numerical stability of advanced Large Eddy Simulation (LES) closures, such as dynamic eddy-viscosity or Approximate Deconvolution (AD) methods. In the present study, it is demonstrated that the performance of commonly used explicit filters applicable to general unstructured grids highly depends on the grid configuration, specifically the cell aspect ratio, which can result in poor filter spectral properties, ultimately leading to large errors and even solution divergence. This study introduces a novel, efficient explicit filter for general unstructured grids, addressing this shortcoming through a combination of a face-averaging technique and recursive filtering. The filter parameters are then determined through a constrained multi-objective optimization, ensuring desirable spectral properties, including high-wavenumber attenuation, filter-width precision, filter stability and positivity, and minimized dispersion and commutation errors. The AD-LES of turbulent channel flow benchmarks using the new filter demonstrate a noticeable improvement in turbulent flow predictions on highly stretched boundary-layer-type grids, particularly in reducing the log-layer mean velocity profile mismatch, compared to simulations using conventional filters. The analyses show that this enhancement is mainly attributed to the sufficient level of attenuation near the Nyquist wavenumber achieved by the new filter in all spatial directions across various grid configurations, among others. The new filter was also successfully tested on unstructured prism grids for the 3D Taylor-Green vortex benchmark.
Read the full abstract
Analysis of PDEs
Weak global solvability of a doubly degenerate parabolic-elliptic nutrient taxis system
This work studies the following doubly degenerate parabolic-elliptic nutrient taxis system $$ \begin{cases} u_t = (uvu_x)_x -(u^2 vv_x)_x + uv, \\[1.5 ex] \hspace{0.2 cm}0 = v_{xx} - uv + f(x,t), \end{cases} $$ in a bounded interval $\Omega \subset \mathbb{R}$, under no-flux boundary conditions and nonnegative initial value $u(x,0) = u_0(x) \geq 0$, where $f(x,t) \geq 0$ is known external supply of the nutrient. It is shown that for any nonnegative $u_0 \in W^{1,\infty}(\Omega)$ and $f \in C^1\big(\bar{\Omega} \times [0,\infty) \big)$, $f \not \equiv 0$, a global weak solution of the problem can be constructed by means of a regularization approach. The core of the analysis lies on a Harnack-type inequality for the second that allows us to overcome the lack of uniform coercivity. Together with time regularity properties, we obtain relative compactness through a combination of the Arzelà-Ascoli theorem and the Aubin-Lions lemma.