Peer Revenue Returns subject to peer review

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Friday 27 March

Statistics Theory

Quasi-Banach spaces of random variables and stochastic processes

This book develops the theory of quasi-Banach $K_\sigma$-spaces $\mathbf{F}_\psi(\Omega)$, $\mathbf{F}_\psi^*(\Omega)$, and $D_{V,W}(\Omega)$ of random variables and stochastic processes, extending the classical framework of Orlicz spaces, $Sub_\varphi(\Omega)$ and $V(\varphi,\psi)$ spaces. The book consists of eleven chapters. The first two chapters establish the foundational theory: stochastic processes from quasi-Banach $K_\sigma$-spaces are introduced, and the fundamental properties of $\mathbf{F}_\psi(\Omega)$ are studied in detail. The third chapter derives distribution estimates for suprema of processes from $\mathbf{F}_\psi^*(\Omega)$, and the fourth addresses approximation theory in $SF_\psi(\Omega)$. The fifth chapter examines Orlicz spaces and their connections to $\mathbf{F}_\psi(\Omega)$. Chapters six and seven treat the pre-Banach $K_\sigma$-spaces $D_{V,W}(\Omega)$, establishing their essential properties and evaluating reliability and accuracy of stochastic process models. The eighth chapter provides norm distribution estimates in $L_p(T)$ for processes from $\mathbf{F}_\psi(\Omega)$. The ninth chapter develops the Monte Carlo method for multiple integrals over $\mathbb{R}^n$ with prescribed reliability and accuracy. The final two chapters treat modeling of $Sub_\varphi(\Omega)$ processes - subclasses of $K_\sigma$-spaces - with given reliability and accuracy in $L_p(T)$ and $C(T)$ respectively. The results are substantially based on the authors' original work and that of their co-authors.
Read the full abstract

Classical Analysis and ODEs

Spectral synthesis with the complexity parameter

We study how the concentration of the Fourier transform changes the integrability threshold imposed by the size of its spectral support. Let $\mu$ be a positive Radon measure on $\mathbb{R}^n$ and let $0\ne f\in L^2(\mu)$ with $f\mu$ compactly supported. Suppose that $\operatorname{supp}(f\mu)$ can be covered by $O(r^{-\alpha})$ balls of radius $r$, where $0<\alpha<n$. If the normalized Fourier ratio of $f\mu$ has decay exponent $\kappa<\frac{\alpha}{2}$, then $\widehat{f\mu}\notin L^p(\mathbb{R}^n)$ for $$2\leq p<\frac{2(n-2\kappa)}{\alpha-2\kappa},$$ and at $\kappa=\frac{\alpha}{2}$ every finite $p$ is excluded. A uniform power bound for the Fourier ratio excludes the finite critical endpoint as well. We prove that the strict range is sharp for every admissible pair $(\alpha,\kappa)$ by convolving a Salem measure with a Cantor measure whose digits are consecutive and whose bases increase, and the resulting support has Hausdorff dimension exactly $\alpha$. We also obtain necessary conditions for Fourier extension estimates and compute the Fourier ratio exponent for smooth densities on hypersurfaces whose second fundamental form has constant rank.
Read the full abstract

Analysis of PDEs

Enhanced Dissipation and Global Well-Posedness for a Three-Dimensional Flame Propagation Model with Couette Flow

We study a three-dimensional gravity-induced flame front model under a Couette flow. By exploiting the enhanced dissipation induced by the Couette flow, we prove global-in-time well-posedness of the Cauchy problem in $\mathbb{R}^3$ and derive decay estimates for the solution and its spatial derivatives in $L^p$ norms for all $p \ge 1$. The analysis is based on a Green's function approach for the associated variable-coefficient linearized operator. Since an explicit representation of the Green's function is unavailable, we first establish decay estimates in the spectral domain and then transfer them to physical space. These results show that enhanced dissipation induced by the Couette flow is the key mechanism leading to global existence in the whole space, in the large initial data regime.
Read the full abstract

Number Theory

Uniform Diophantine approximation with restrictions via total density of collections of subspaces

In 1926 Khintchine introduced a topological argument proving the existence of uncountably many nontrivial singular linear forms of $n \geq 2$ variables. Throughout the years, this argument has been extensively modified and generalized. Most recently, Kleinbock et al. (2025) introduced a general framework of Diophantine systems and showed that a certain topological property called total density implies a far-reaching generalization of Khintchine's result. We describe a way to establish total density for a variety of Diophantine systems, and thus prove that the sets of singular objects are uncountable and dense in a wide range of set-ups in Diophantine approximation. As a special case, we establish such a result for inhomogeneous approximation, proving the existence of uncountably many singular systems of affine forms with a fixed translation part. One can also consider approximation with prime denominators, or more generally, approximation under some strong restrictions on numerators and denominators.
Read the full abstract

Numerical Analysis

Properties of Nonlinear GMRES Applied to the Preconditioned Richardson Iteration

In this work, we propose new variants of Anderson acceleration and nonlinear GMRES for general fixed-point iterations, based on modified least-squares problems associated with the methods. To solve the underlying linear systems, we apply these new approaches to accelerate the preconditioned Richardson iteration. We establish connections between the proposed variants and both left- and right-preconditioned GMRES. In particular, we show that full NGMRES applied to the preconditioned Richardson iteration is equivalent to right-preconditioned GMRES, while full NGMRES equipped with the new least-squares formulation is equivalent to left-preconditioned GMRES. Furthermore, under certain conditions on the preconditioned coefficient matrix, an equivalence between windowed NGMRES with any depth and preconditioned GMRES. These theoretical results deepen our understanding of NGMRES for solving linear systems and clarify its relationship to classical preconditioned GMRES. Finally, we establish conditions for monotonicity of the various variants. Numerical results are presented to validate our theoretical findings.
Read the full abstract

Thursday 26 March

Rings and Algebras

Finite products in commutative monoids: well-definition, recursion on finite subsets, and why the empty product is $1$

The convention "empty product $=1$" is ubiquitous in mathematics, but often appears without an explicit structural justification. This note provides a self-contained reference to this fact in the context of commutative monoids. We construct the product of an indexed family by a finite set, prove its enumeration independence, and show that it is uniquely characterized by a recursion scheme in Fin$(I)$: value in the empty set and insertion rule of a new index. In particular, the value of the empty product is necessarily the neutral element $1$. We further record two complementary and independent justifications of this fact: one via the list-free monoid and another via distributive identities in semi-rings. Next, we formulate the same phenomenon in universal terms by means of the commutative multiset-free monoid of finite support. We also discuss partially commutative extensions, via trace monoids and heaps, and include brief applications in linear algebra, survival statistics, category theory, and analysis. The corresponding additive version recovers, by the same principle, the identity "empty sum $=0$".
Read the full abstract

Analysis of PDEs

The Kadomtsev-Petviashvili equation in conformal variables for waves over topography

The conformal mapping approach is a well established technique for solving the Euler equations for potential flows with one spatial dimension. In this work, we extend this framework to problems with a weakly transversal dependence and, by means of asymptotic expansions, obtain a Kadomtsev-Petviashvili type equation formulated in conformal variables as a model for weakly transversal surface waves propagating over topography. A key advantage of this formulation is that the topography, defined in the physical domain, does not need to be a smooth function, or even a function in the classical sense because, our asymptotic analysis relies on the effective depth, which comes through the Jacobian of the conformal map which is assumed to be a slowly varying function. The resulting equation provides a consistent extension of several well known weakly nonlinear dispersive wave models previously reported in the literature. Numerical simulations are performed to illustrate the newly derived equation.
Read the full abstract

Analysis of PDEs

Estimating an initial telomere length distribution from the Laplace transform of its senescence times distribution

This work follows from a previous study on the estimation of an initial distribution of telomere length from a senescence times distribution done in [10.1051/m2an/2026022, J. Olayé]. In this previous study, we have presented an estimation method based on the fact that our telomere shortening model can be approximated by a transport equation. This method has encouraging results, but fails to provide a good estimation when the variability of the initial telomere length distribution is too small. We improve here this method by approximating our model with an advection-diffusion equation, which allows us to better take into account the randomness of the shortening values. We show that under this approximation, there exists a simple link between the Laplace transform of the initial telomere length distribution and that of the senescence times distribution. Then, by using a numerical method for inverting Laplace transforms called Gaver-Stehfest algorithm, we exploit this link to construct a new estimator.
Read the full abstract

Dynamical Systems · Cross-listed from physics.soc-ph

Modularity, asymmetry, and polarization shape consensus speed in the voter model

In populations with community structure, the formation of consensus requires both alignment within and diffusion of beliefs across groups, processes that evolve on distinct time scales. How do modularity, asymmetry, and polarization shape this process? We study a variant of the voter model in which a population is divided into two cliques of sizes $N_1$ and $N_2$. At each time step, a pair of nodes is selected; if their binary opinions differ, each agent adopts the opinion of the other with probability $p$. With probability $\alpha$, the pairing occurs with a single clique, and with probability $1-\alpha$, across cliques. We analyze how this coupling strength, population imbalance, and initial polarization jointly determine the time to consensus. Formation of consensus generally starts with inter-clique interactions rapidly synchronizing the two cliques' opinion fractions, after which consensus is reached through a slower diffusion along the synchronized manifold; this slow stage is largely insensitive to $\alpha$ except when the cliques are nearly disconnected. To analyze these dynamics, we derive stochastic differential equations and Fokker-Planck approximations in the large-population limit, and assess their accuracy against the discrete model. While $\alpha$ primarily affects the fast alignment stage, initially polarized and asymmetric populations exhibit nontrivial effects, including regimes in which an intermediate level coupling minimizes consensus time. A small-clique scaling analysis reveals that this optimum arises from a competition between fast alignment drift and noise amplification in the smaller group, and provides an approximate decomposition of consensus time into fast and slow contributions.
Read the full abstract

Combinatorics

Bicyclic graphs with the smallest and largest numbers of connected sets

For a graph $G$ with vertex set $V$, let N(G) denote the number of nonempty subsets of $V$ that induce a connected graph in $G$. In this paper, we focus on determining N(G) for $G$ in the family $\mathbb{B}_n$ of $n$-vertex bicyclic graphs. We find in $\mathbb{B}_n$ the structures of those graphs that possess the smallest, the largest, as well as the second-largest values of N(G). Moreover, we compute the extreme values of N(G) over $ \mathbb{B}_n$.
Read the full abstract

Dynamical Systems

Lagrangian chaos for the 2D Navier-Stokes equations driven by mildly degenerate noise

We consider the 2D incompressible Navier-Stokes equations driven by mildly degenerate noise that acts only on finitely many low Fourier modes, a setting that models large-scale stirring. For this system, we prove that the top Lyapunov exponent of the associated Lagrangian flow is strictly positive, thereby establishing Lagrangian chaos. This result is obtained within the framework of random dynamical systems, combining the multiplicative ergodic theorem with the refined Furstenberg criterion of [25]. Unlike the method in [25] for handling highly degenerate noise, this paper develops a unified analytical framework that combines low-mode control, finite-dimensional Malliavin calculus, and dissipation in the high modes. By constructing a finite-dimensional partial Malliavin matrix and proving its non-degeneracy, we avoid the technical complexity of performing Malliavin analysis on the full phase space and simultaneously overcome the degeneracy introduced by the manifold variables. Furthermore, the mildly degenerate forcing gives controllability in the low-frequency subsystem. In the manifold directions, only first-order Lie brackets are needed, which substantially simplifies the Lie-brackets computations.
Read the full abstract

Dynamical Systems

Lagrangian chaos for the 2D Boussinesq equations with a degenerate random forcing

We demonstrate that Lagrangian flow for the 2D Boussinesq equations under degenerate noise exhibit chaotic behavior characterized by the strict positivity of the top Lyapunov exponent, where the degenerate noise acts only on a few Fourier modes of the temperature equation. To achieve this, we overcome difficulties arising from the degeneracy of noise and its intricate interaction with the nonlinear terms. This is accomplished by introducing a solution-dependent manifold spanning condition to establish probabilistic spectral bound on a cone for the Malliavin matrix associated with the extended system. Additionally, the approximate controllability of the extended system is realized by constructing smooth controls based on shear and cellular flows.
Read the full abstract

Combinatorics

Growing Binary Trees

This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled structures and the analysis of polynomial iterates, we extend previous models of increasing trees with label repetitions by allowing growth branches to terminate. This mechanism enables a direct connection between dynamic evolutionary processes and classical unlabeled binary trees. We provide a combinatorial outlook for this model, linking our new approach to essential but traditionally complex parameters such as tree height, the maximum number of leaves at the deepest level (for a given tree size), and the overall tree profile. Our approach reveals structural links with Mandelbrot polynomials and coding theory. Furthermore, we leverage these structural insights to develop an efficient, iterative uniform random sampler for binary trees with a prescribed profile, achieving optimal complexity in both time and space and in random bit consumption.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Design-Based Anytime-Valid Inference for Randomized Experiments with Delayed Outcomes and Staggered Entry

Delayed outcomes are ubiquitous in online experimentation: treatment can affect whether an outcome occurs, when it occurs, and its realized value. To accommodate staggered entry while remaining robust to environmental nonstationarity and unit-level heterogeneity, we adopt a design-based perspective and target the sample cumulative reward in each arm as a function of calendar time. Our confidence sequences allow practitioners to continuously monitor the counterfactual incremental reward, such as revenue, that would have been realized by calendar time $t$ had all entered units been assigned to treatment rather than control. The main technical challenge is the choice of design-based filtration, complicated by the presence of asynchronous potential outcome times. We show that the IPW treatment-effect estimation error is not a martingale with respect to any filtration, while each arm-specific IPW estimation error is a martingale with respect to a carefully chosen arm-specific event-time filtration. We therefore construct a confidence sequence for the treatment effect by combining two arm-level confidence sequences with a union bound, and further demonstrate that this can outperform the traditional design-based variance upper bound. Finally, we characterize the class of augmentations for which the per-arm AIPW estimation error remains a martingale.
Read the full abstract

Complex Variables

Arc-analytic subanalytic functions on complex manifolds

We show that an arc-analytic subanalytic function on a complex manifold M, which is holomorphic near one point, is a holomorphic function on M. More generally, an arc-analytic subanalytic function on a real analytic CR-manifold M, which is CR on a nonempty open subset of M, is a CR-function on the whole M.
Read the full abstract

Probability

Besov-Orlicz moduli of Brownian motion and polygonal partial sum processes

The sample paths of Brownian motion are known to admit the exact Besov-type smoothness exponent 1/2 when measured in the sub-Gaussian Orlicz norm. We extend these regularity results by deriving the exact limit of the sub-Gaussian Orlicz modulus for Brownian motion in Banach spaces, and we provide a rate of convergence towards this limiting value. The central technique is a new chaining bound for the Orlicz modulus of a stochastic process. The latter also applies to polyogonal partial sum processes of functional random variables and allows us to strengthen Donsker's invariance principle to all function spaces on the Besov-Orlicz scale up to the exact modulus with exponent 1/2. For the critical case, we establish the thresholded weak convergence of the Besov-Orlicz seminorm of the partial sum process. The analytical results find application in a nonparametric statistical testing problem, where Besov-Orlicz statistics are shown to detect a broader range of alternatives compared to Hölderian multiscale statistics.
Read the full abstract

Number Theory

On a Möbius double sum

We study the double sum $S_\varepsilon(X)$$=$$\sum_{\substack{d,e\le X}}\frac{\mu(d)\mu(e)}{[d,e]^{1+\varepsilon}}$, which converges even in the case $\varepsilon=0$, where $\mu$ denotes the Möbius function and $[d,e]$ is the least common multiple of $d$ and $e$. Such expressions arise naturally in analytic number theory, notably as the diagonal contribution in certain squared mean values, and they play a significant role in zero-density estimates for the Riemann zeta function and related $L$-functions. We establish uniform upper bounds for $S_\varepsilon(X)$ across various ranges of $X$, with particular emphasis on the case $\varepsilon$ close to $0^+$.
Read the full abstract

Probability

Fractional Macroscopic Fluctuation Theory for a Superdiffusive Ginzburg-Landau dynamics

We investigate a boundary-driven Ginzburg-Landau dynamics with long-range interactions. In the hydrodynamic limit, the macroscopic evolution is governed by a fractional heat equation with Dirichlet boundary conditions, while the corresponding stationary profile is characterized by a fractional Laplace equation. We establish a dynamical large deviations principle for the empirical measure and derive the associated stationary large deviations principle for the non-equilibrium steady state, which can be computed semi-explicitly. We further show that the stationary rate function coincides with the quasi-potential associated with the dynamical large deviations functional.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Online Learning for Dynamic Constellation Topologies

The use of satellite networks has increased significantly in recent years due to their advantages over purely terrestrial systems, such as higher availability and coverage. However, to effectively provide these services, satellite networks must cope with the continuous orbital movement and maneuvering of their nodes and the impact on the network's topology. In this work, we address the problem of (dynamic) network topology configuration under the online learning framework. As a byproduct, our approach does not assume structure about the network, such as known orbital planes (that could be violated by maneuvering satellites). We empirically demonstrate that our problem formulation matches the performance of state-of-the-art offline methods. Importantly, we demonstrate that our approach is amenable to constrained online learning, exhibiting a trade-off between computational complexity per iteration and convergence to a final strategy.
Read the full abstract

Algebraic Geometry

Geometric classification of primes modulo a (bend) congruence

In this paper we continue the program to develop the algebraic foundations of tropical (algebraic) geometry. We give strong characterizations of prime congruences containing a given congruence on a toric semiring. We give four applications of this result. (1) We prove an analogue of the strong Nullstellensatz for congruences with finite tropical basis. This extends the existing result of Joó-Mincheva to cases, such as the bend congruence of a tropical(ized) ideal, where the congruence is not finitely generated. (2) We show that, if $I$ is the ideal of an affine variety not contained in the coordinate hyperplanes, then $\mathbb{T}[x_1, \dots, x_n]/\sqrt{\operatorname{Bend}(\operatorname{trop} I)}$ is cancellative. This result has applications to the integral closure (as per Tolliver) of $\mathbb{T}[x_1, \dots, x_n]/\operatorname{Bend}(\operatorname{trop} I)$ which we explore in a forthcoming paper. (3) We show that $\mathbb{T}[x_1, \dots, x_n]/\sqrt{\operatorname{Bend}(\operatorname{trop} I)}$ is the tropical function semiring on $\operatorname{trop} V(I)$, which creates a bridge between the algebraic approach to non-embedded tropicalization in the work of J. Song and the bend congruence approach of Giansiracusa-Giansiracusa and Maclagan-Rincón. (4) As a consequence of one of our lemmas, we describe the closure of a polyhedron in a tropical toric variety even when the polyhedron is not compatible with the fan defining the tropical toric variety.
Read the full abstract

Logic

A One-Step Cascade Symmetric Model: Rank-$1$ Packets, Binary Shielding, and the Even Exact-Cardinality Profile

We introduce a one-step cascade symmetric system whose local symmetry geometry is organized by finite $\rho$-closed windows and one-step stars rather than by rowwise-independent toggles. The resulting symmetric model isolates a new $ZF + DC + \neg \mathrm{BPI}$ geometry in which rank-$1$ hereditarily symmetric reals admit a packet normalization theorem over countable $\rho$-closed supports. The technical center of the paper is the finite star-span lemma and the associated rank-$1$ packet calculus. From this we obtain a normalization theorem and a two-layer coding consequence for rank-$1$ reals (in the metatheory, via a well-orderable base of packets). We then apply the same binary fresh-support shielding pattern to prove $\neg C_2$, hence $\neg AC_{\mathrm{fin}}$, and therefore the failure of every even $C_n$ (where $C_n$ denotes the principle that every family of nonempty $n$-element sets admits a choice function). On the odd side, the present bounded packet calculus remains dyadic: support-fixed local actions factor through finite $2$-groups, bounded support-equivariant quotients of finite local orbits have power-of-two size, and trace-separated bounded rigid ternary families admit canonical selectors within a fixed finite trace window. Accordingly, the odd exact-cardinality profile remains open beyond the current local binary machinery.
Read the full abstract

Optimization and Control

Globalized Adversarial Regret Optimization: Robust Decisions with Uncalibrated Predictions

Optimization problems routinely depend on uncertain parameters that must be predicted before a decision is made. Classical robust and regret formulations are designed to handle erroneous predictions and can provide statistical error bounds in simple settings. However, when predictions lack rigorous error bounds (as is typical of modern machine learning methods) classical robust models often yield vacuous guarantees, while regret formulations can paradoxically produce decisions that are more optimistic than even a nominal solution. We introduce Globalized Adversarial Regret Optimization (GARO), a decision framework that controls adversarial regret, defined as the gap between the worst-case cost and the oracle robust cost, uniformly across all possible uncertainty set sizes. By design, GARO delivers absolute or relative performance guarantees against an oracle with full knowledge of the prediction error, without requiring any probabilistic calibration of the uncertainty set. We show that GARO equipped with a relative rate function generalizes the classical adaptation method of Lepski to downstream decision problems. We derive exact tractable reformulations for problems with affine worst-case cost functions and polyhedral norm uncertainty sets, and provide a discretization and a constraint-generation algorithm with convergence guarantees for general settings. Finally, experiments demonstrate that GARO yields solutions with a more favorable trade-off between worst-case and mean out-of-sample performance, as well as stronger global performance guarantees.
Read the full abstract

Information Theory

Enormous Fluid Antenna Systems (E-FAS) under Correlated Surface-Wave Leakage: Physical Layer Security

Enormous fluid antenna systems (E-FAS) have recently emerged as a surface-wave (SW)-enabled architecture that can induce controllable large-scale channel gains through guided electromagnetic routing. This paper develops a secrecy analysis framework for E-FAS-assisted downlink transmission with practical pilot-based channel estimation. We consider a multiple-input single-output (MISO) wiretap setting in which the base station (BS) performs minimum mean-square-error (MMSE) channel estimation and adopts maximum-ratio transmission (MRT) with artificial noise (AN). To capture the leakage of SW routing in EFAS, we introduce a correlated SW-leakage model that accounts for statistical coupling between the legitimate and eavesdropper channels caused by partially overlapping SW propagation paths. Exploiting the two-timescale nature-with slowly varying routing gain and small-scale block fading, we then derive a closed-form conditional expression for the secrecy outage probability (SOP) and a tractable characterization of the ergodic secrecy rate (ESR) in the presence of correlated quadratic forms. Our analysis yields three key insights: (i) secrecy collapses at high transmit power if and only if AN is not present, whereas any strictly positive AN can prevent asymptotic collapse; (ii) the optimal data-AN power split is achieved by a strictly interior solution; and (iii) routing gain improves both the received signal strength and the channelestimation quality, creating a nonlinear coupling that raises the signal-to-interference plus noise ratio (SINR) ceiling in the high signal-to-noise ratio (SNR) regime, and disperses secrecy across routing states. Numerical results indicate that E-FAS markedly enlarges the secure operating region significantly when compared with conventional space-wave transmission.
Read the full abstract

All authors Farshad Rostami Ghadi, Kai-Kit Wong, Masoud Kaveh, Mohammad Javad Ahmadi, Kin-Fai Tong, Hyundong Shin

Numerical Analysis

Towards a new PGD strategy for the simulation of slender structures

Effective models for slender structures derived from well-known plate (or shell) theories are justified within the limit of a small thickness, and may therefore prove limited for intermediate slenderness. On the other hand, direct 3D simulation of such structures is sub-optimal because it does not take advantage of the presence of small dimensions in some directions and is sometimes too costly and ill-conditioned. In this context, the Proper Generalized Decomposition (PGD) method, a model order reduction method based on a modal representation of the solution with separation of variables, makes it possible to obtain a 3D solution with 2D resolution complexity. In this work, an analysis of the links between the PGD reduced order model and the solution provided by plate theory is carried out using asymptotic expansion. It is shown that, in the limit of large slenderness, the first mode of the PGD exhibits Kirchhoff-Love type kinematics, but only corresponds to the asymptotic solution in very special cases of loading and boundary conditions. To capture the asymptotic solution, a new PGD strategy is introduced consisting of computing the first two modes simultaneously. We also demonstrate that the PGD is subject to shear locking, and we show how to deal with it. Numerical experiments are provided, demonstrating the interest of this approach and confirming the theoretical analysis.
Read the full abstract

All authors Jean Ruel, Frédéric Legoll, Arthur Lebée, Ludovic Chamoin

Functional Analysis

Three short tales on the parity operator

In this paper, we discuss three short topics related to the parity operator and his role in quantum harmonic analysis. We derive results for the Fredholm index of even and odd operators, discuss operators on which the modulation action acts continuous in operator norm and show that the parity operator plays a natural role in the operator-to-operator Fourier transform of quantum harmonic analysis.
Read the full abstract

Statistics Theory

Sharp Concentration Inequalities: Phase Transition and Mixing of Orlicz Tails with Variance

In this work, we investigate how to develop sharp concentration inequalities for sub-Weibull random variables, including sub-Gaussian and sub-exponential distributions. Although the random variables may not be sub-Guassian, the tail probability around the origin behaves as if they were sub-Gaussian, and the tail probability decays align with the Orlicz $\Psi_\alpha$-tail elsewhere. Specifically, for independent and identically distributed (i.i.d.) $\{X_i\}_{i=1}^n$ with finite Orlicz norm $\|X\|_{\Psi_\alpha}$, our theory unveils that there is an interesting phase transition at $\alpha = 2$ in that $\PP\l(\l|\sum_{i=1}^n X_i \r| \geq t\r)$ with $t > 0$ is upper bounded by $2\exp\l(-C\max\l\{\frac{t^2}{n\|X\|_{\Psi_{\alpha}}^2},\frac{t^{\alpha}}{ n^{\alpha-1} \|X\|_{\Psi_{\alpha}}^{\alpha}}\r\}\r)$ for $\alpha\geq 2$, and by $2\exp\l(-C\min\l\{\frac{t^2}{n\|X\|_{\Psi_{\alpha}}^2},\frac{t^{\alpha}}{ n^{\alpha-1} \|X\|_{\Psi_{\alpha}}^{\alpha}}\r\}\r)$ for $1\leq \alpha\leq 2$ with some positive constant $C$. In many scenarios, it is often necessary to distinguish the standard deviation from the Orlicz norm when the latter can exceed the former greatly. To accommodate this, we build a new theoretical analysis framework, and our sharp, flexible concentration inequalities involve the variance and a mixing of Orlicz $\Psi_\alpha$-tails through the min and max functions. Our theory yields new, improved concentration inequalities even for the cases of sub-Gaussian and sub-exponential distributions with $\alpha = 2$ and $1$, respectively. We further demonstrate our theory on martingales, random vectors, random matrices, and covariance matrix estimation. These sharp concentration inequalities can empower more precise non-asymptotic analyses across different statistical and machine learning applications.
Read the full abstract

Differential Geometry

Uniqueness of capillary disks in three-dimensional domains

We prove uniqueness results for capillary disks in three-dimensional domains that are modeled by an elliptic PDE, under the assumption that the domain admits a family of surfaces with suitable properties. Our main theorem generalizes Nitsche's result for capillary constant mean curvature disks in the Euclidean ball and is inspired by the extension of Hopf's uniqueness theorem for constant mean curvature spheres in Euclidean space due to Gálvez and Mira.
Read the full abstract

Information Theory

Measurement Campaigns, Datasets, and Curve Fitting Officially Used by 3GPP in Release 19 for Channel Modeling in TR 38.901 for 7-24 GHz

This document provides comprehensive details of the Measurement Campaigns, Datasets, and Curve Fitting Officially Used by 3GPP in Release 19 for Channel Modeling in TR 38.901 for 7-24 GHz
Read the full abstract

All authors Hitesh Poddar, Jianhua Zhang, Ximan Liu, Mansoor Shafi

Combinatorics

Van der Waerden's theorem on arithmetic progressions – a survey of some historical and modern developments

Van der Waerden's theorem, published in Nieuw. Arch. Wisk. 15 (1927), acted as a catalyst for major further developments in Ramsey theory. In this survey, we delve into the legacy of this mathematical gem, tracing its historical origin, exploring its wide-ranging connections across research areas, and highlighting some of the important results it has inspired.
Read the full abstract

General Mathematics

Morphogenesis Across n: Overlays, Emergence Thresholds, and Weak Self-Similarity in the Partition Graph

We study the partition graphs $G_n$ as a growing family of discrete geometric objects and introduce a formal framework for comparing their structures across different levels. The main tool is a family of Ferrers-translation maps \[ T_\tau:G_n\to G_{n+k},\qquad (T_\tau(\lambda))'=\lambda'+\tau', \] defined for fixed partitions $\tau\vdash k$. We prove that these maps are induced graph embeddings, giving a rigorous notion of translation overlay: an induced copy of $G_n$ inside $G_{n+k}$. As a consequence, every finite rooted induced motif persists to all higher levels under translation overlays, and every overlay-monotone finitely witnessed property has a stable emergence threshold. We apply this framework to obtain monotonicity for the extremal local invariants $\Delta_n$, $\Omega_n$, and $S_n$, and to establish strict threshold statements for a canonical family of theorem-safe motifs drawn from boundary, axial, and rear morphology. This yields a conservative structural language for discussing growth across $n$ while keeping exact transport separate from stronger typed or visual interpretations. We also record a compact atlas framework for first appearances, repeated patterns, and comparative growth profiles. In this way the paper isolates a theorem-level core for persistence and thresholds, and complements it with a weaker notion of self-similarity based on recurring finite motifs and repeated local fragments.
Read the full abstract