Statistics Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Thursday 7 May
In this paper, we investigate the supremum-norm generalization error and the uniform inference for a specific class of kernel regression methods, namely the kernel gradient flows. Under the widely adopted capacity-source condition framework in the kernel regression literature, we first establish convergence rates for the supremum norm generalization error of both continuous and discrete kernel gradient flows under the source condition $s>\alpha_0$, where $\alpha_0\in(0,1)$ denotes the embedding index of the kernel function. Moreover, we show that these rates match the minimax optimal rates. Building on this result, we then construct simultaneous confidence bands for both continuous and discrete kernel gradient flows. Notably, the widths of the proposed confidence bands are also optimal, in the sense that their shrinkage rates are greater than, while can be arbitrarily close to, the minimax optimal rates.
Number Theory
Rankin–Selberg coefficients in arithmetic progressions modulo prime powers
Let $\varepsilon>0$ be given. For prime power moduli $q=p^k$ with $k\geq 2$ and $p\neq 3$, and assuming the Ramanujan–Petersson conjecture for $\GL_2$ Maass forms, we prove that the Rankin–Selberg coefficients $\{\lambda_f(n)^2\}_{n\geq 1}$ have a level of distribution $\theta=2/5+3/305-\varepsilon$ in arithmetic progressions $n \equiv a \bmod q$.
Read the full abstract
Mathematical Physics · Cross-listed from quant-ph
Weighted Phase-Space Paths for Exact Wigner Dynamics
A quantum state can be written in phase space, but the resulting object is not generally the probability density of a positive stochastic process on ordinary phase space. We spell this out for Wigner dynamics. If a positive phase-space process is required only to reproduce the Born density after integrating over momentum, the requirement fixes only an integrated current; the local drift and diffusion remain underdetermined. If one instead requires all Weyl-ordered expectation values, the phase-space object is fixed to be the Wigner function. For non-quadratic potentials the Wigner–Moyal generator contains higher-order, signed momentum-transfer terms, so it is not the Fokker–Planck generator of a positive Brownian diffusion. The exact Wigner function must therefore be reconstructed, in a stochastic representation, as a weighted empirical measure \[ \FW(\z,t)=\E_{\Pp}[W_t\delta(\z-\z_t)], \qquad \z=(q,p), \] rather than the unweighted density of sampled carrier trajectories. With classical Hamiltonian flow as the carrier, all nonclassical correction beyond classical transport sits in the Moyal residual and can be represented by signed weights or branching events. The same split defines a residual diagnostic that vanishes for quadratic Hamiltonians and measures what classical carrier transport misses in anharmonic dynamics. The formulation also gives a forward–reverse relation for signed Wigner path measures. The ratio of forward and reversed contributions separates into a positive magnitude factor and a sign factor. This sign records the parity of the Wigner interference contribution; it is not a thermodynamic entropy production.
Read the full abstract
Representation Theory
Kernel of Scott modules and Brauer indecomposability
Let $k$ be an algebraically closed field of prime characteristic $p$. Let $G$ be a finite group. We investigate the Brauer indecomposability of Scott $kG$-modules in relation to the kernel of modules. We generalize a criterion for Brauer indecomposability. We also prove that, in certain cases, Brauer indecomposability of a Scott $kG$-module can be lifted from that of a Scott module over a $p$-local subgroup.
Read the full abstract
Statistics Theory · Cross-listed from stat.ME
A Stein Characterization-type Omnibus Tests for the Discrete Pareto Distribution
The discrete Pareto (or Zeta, Zipf) distribution, arises naturally in modeling rank-frequency data across diverse fields such as linguistics, demography, biology, and computer science. Despite its widespread applicability, goodness-of-fit testing for the discrete Pareto distribution remains underdeveloped, particularly in the presence of heavy tails and infinite support. This article introduces a novel goodness-of-fit test based on a new Stein-type characterization of the discrete Pareto distribution, formulated using its probability generating function. The proposed method is applicable even when the shape parameter is unknown and avoids binning or smoothing techniques. We study the asymptotic properties of the test and assess its empirical size and power through extensive simulation experiments. The results show that the proposed test either outperforms or matches the performance of existing method across various alternatives. Applications to real datasets are provided to demonstrate its practical relevance and robustness.
Read the full abstract
Analysis of PDEs
Global solvability to a two-dimensional chemotaxis-Euler system with Robin boundary conditions on oxygen
This paper is concerned with the global solvability of a chemotaxis-Euler system in bounded domains of $\mathbb{R}^2$. Completing the system with physical boundary conditions, we firstly prove local well-posedness of the corresponding initial-boundary value problem and then present some blow-up criteria. We also show that the local solutions can be extended globally in time under suitable smallness assumptions on initial and boundary data.
Read the full abstract
Optimization and Control · Cross-listed from cs.LG
WARP: A Benchmark for Primal-Dual Warm-Starting of Interior-Point Solvers
Solving AC Optimal Power Flow (AC-OPF) is of central importance in electricity market operations, where interior-point methods (IPMs) such as IPOPT are the standard solvers. A growing body of work uses machine learning to predict primal warm-start iterates, reporting iteration reductions of 30-46%. We show that these reported gains rest on an inappropriate evaluation baseline: prior methods benchmark against the flat start $V_m = 1, V_a = 0$, whereas the solver's actual default - the variable-bound midpoint $(l+u)/2$ - is near-optimal for log-barrier centrality. Against this corrected baseline, no primal-only warm-start method reduces solver iterations. We trace the failure to a geometric property of interior-point methods: primal prediction accuracy is anticorrelated with convergence speed, and providing the ground-truth optimal solution $x^*$ without dual variables causes the solver to diverge. Oracle experiments establish that the complete primal-dual-barrier state $(x^*, \lambda^*, z^*, \mu^*)$ reduces IPOPT iterations from 23 to 3 - an 85% reduction that is structurally inaccessible to primal-only methods. To enable rigorous evaluation of warm-start methods on this task, we release a benchmark suite comprising dual-labeled AC-OPF datasets with IPOPT-extracted solutions, a corrected evaluation protocol, and WARP - a topology-conditioned encode-process-decode interaction network that predicts the full interior-point state $(\hat{x}, \hat{\lambda}, \hat{z}, \hat{\mu})$ on the heterogeneous constraint graph. WARP achieves a 76% reduction in IPOPT iterations while natively accommodating N-1 contingency topology variations without retraining.
Read the full abstract
Numerical Analysis
Convex-Geometric Error Bounds for Positive-Weight Kernel Quadrature
Kernel quadrature can exploit RKHS spectral structure and outperform Monte Carlo on smooth integrands, but optimized quadrature weights are generally signed and may be numerically unstable. We study whether spectral acceleration remains possible when the weights are constrained to be positive, i.e., simplex weights. In the exact-target fixed-pool setting, an evaluated i.i.d. candidate pool of size $N$ is already available and the task is to reweight it so as to approximate the kernel mean embedding. We show that this positive reweighting problem is governed not by the equal-weight empirical average, but by the random convex hull generated by the pool. Our main geometric result shows that the mean of a bounded $d$-dimensional random vector can be approximated by a convex combination of $N$ i.i.d. samples at accuracy $O(d/N)$ with high probability, sharper than equal-weight averaging in the fixed-dimensional regime. We transfer this $d$-dimensional convex-hull approximation to full RKHS worst-case error through an augmented Mercer-truncation argument. The resulting positive-weight KQ bounds consist of a spectral tail term and a finite-sample convex-hull term, yielding Monte-Carlo-beating rates in favorable spectral regimes, including near-$O(1/N)$ rates up to logarithmic factors under exponential spectral decay. We also provide a constructive Frank–Wolfe algorithm that operates directly on the pool atoms, maintains simplex weights, and admits an explicit optimization-error bound.
Read the full abstract
Differential Geometry
A Ruh-Vilms theorem for hypersurfaces in Weitzenböck geometry
A well-known theorem by Ruh and Vilms states that the Laplacian of the Gauss map for a smooth immersion into Euclidean space is given by the covariant derivative of the mean curvature vector field. For hypersurfaces, this implies that the Gauss map is harmonic iff the mean curvature is constant. In this paper, we extend this result to hypersurfaces in Weitzenböck geometry. While Riemannian geometry corresponds to the curved geometry without torsion, Weitzenböck geometry is a flat geometry with torsion. They represent two opposite extremes of Riemann-Cartan geometry.
Read the full abstract
Combinatorics
Equivariant version of the characteristic quasi-polynomials of root systems
An equivariant characteristic quasi-polynomial is a quasi-polynomial in $q$ consisting of the permutation character on the mod $q$ complement of the corresponding Coxeter arrangement. This concept is a refinement of the conventional characteristic quasi-polynomials of root systems. In this paper, we will show equivariant-theoretic refinements of the some properties of characteristic quasi-polynomials of root systems. Furthermore, we will explicitly compute equivariant characteristic quasi-polynomials of all irreducible reduced root systems and discuss the relationship with root systems constructed by the folding of the extended Dynkin diagrams.
Read the full abstract
Combinatorics
Root systems constructed by folding of the extended Dynkin diagrams
The extended affine Weyl group of a root system is the semidirect product of the corresponding Weyl group by its coweight lattice. The stabilizer subgroup of the extended affine Weyl group with respect to the corresponding fundamental alcove induces a subgroup of automorphisms of the extended Dynkin diagram. In this paper, we construct a finite root system by folding by the elements of the subgroup.
Read the full abstract
Number Theory
Multiple modular L-functions and modular iterated integrals
The connection between multiple modular L-functions, as defined by Manin in [5], and modular iterated integrals was made explicit by Choie and Ihara [3] under the restrictive assumption that all modular forms involved have vanishing constant terms in their q-expansions. In this paper, we remove the assumption and establish the relationship between modular iterated integrals and multiple modular L-functions for general modular forms, including those with nonzero constant terms. We also provide a proof of a functional equation for modular iterated integrals, which is a specialization of a general result obtained by Brown [2]. This leads us to a generalization of the result of Choie-Ihara [3]. In the final part of the paper, we compute explicit examples of modular iterated integrals. These calculations essentially reproduce the explicit initial computations carried out by Brown [2], but they also serve to validate the broader framework developed in this work.
Read the full abstract
Analysis of PDEs
On the inhomogeneous discounted Hamilton-Jacobi equations
In this paper, we study the family of inhomogeneous discounted Hamilton-Jacobi equations \begin{equation}\label{hjs1} \lambda(x)u+h(x,d_x u)=c \quad \tag{$\ast$} \end{equation} on a closed manifold $M$ with a non-identically vanishing discount factor $\lambda(x)$. There is a critical value $c_0\in[-\infty,\infty)$ such that \eqref{hjs1} admits a viscosity solution if $c>c_0$ and no solution if $c<c_0$. Inspired by the recent development \cite{RWY} on the stability theory of viscosity solutions, we show that the equation admits an asymptotically stable solution if and only if $c>c_0$. In this case, we determine the basin of the stable solution and investigate the long-time behavior of the solution semigroup associated with \eqref{hjs1}. In particular, we obtain a formula relating the lowest convergence rate of the solution semigroup near a stable solution to a minimizing problem concerning the integral of $\lambda$ over Mather measures supporting on the $1$-graph of the stable solution. This formula has two direct consequences: 1) it yields a description of their asymptotic behavior as $c$ tends to infinity; 2) it helps to classify the ergodic Mather measures and locate their distribution in the phase space. The second consequence leads to a dynamical necessary condition for $c=c_0$.
Read the full abstract
Spectral Theory
Eigenvalues of one family of tridiagonal skew-self-adjoint Toeplitz matrices with complex perturbations on the corner
In this paper, we study the eigenvalues of the matrices $T_n(a)+\gamma E_{n,1,1}$ where $T_n(a)$ is the Toeplitz matrix with generating symbol $a(t)=t-t^{-1}$, $E_{n,1,1}$ is the $n\times n$ matrix whose upper left component is $1$ and the other components are zero, and $\gamma$ is a fixed complex number such that $0<|\gamma|<1$. As $n\to\infty$, the eigenvalues of these matrices are asymptotically distributed as the function $2 i \sin(x)$, $x\in[0,2\pi]$. Our main result is an asymptotic formula for every eigenvalue with a residue of the order $O(1/n^3)$.
Read the full abstract
Algebraic Geometry
Geography and Deformations of $\mathbb{Z}_2^s$-Covers of General Type Over Weighted Projective Threefolds
We study threefolds of general type constructed as $\mathbb{Z}_2^s$-covers of weighted projective spaces with a particular focus on their invariants, deformation theory, and the behavior of the $m$-canonical map. For the invariants, we write the ratios of the volume to the topological and holomorphic Euler characteristics as functions of the ratios of the degree of the branch divisors with respect to the total degree. From this expression, we obtain their asymptotic behavior, bounds, and a counterexample to a conjecture made by Bruce Hunt about the non-existence of smooth threefolds in a forbidden zone. From the perspective of deformation theory, we extend the criterion for such covers to be general in their moduli to the case when the weighted projective threefold has isolated singularities and the cover is non-flat, i.e., the pushforward of the structure sheaf splits as a direct sum of reflexive sheaves as opposed to line bundles. As an application, we present new numerical criteria for constructing components of the moduli spaces of stable threefolds and give concrete examples illustrating their application. Finally, we introduce techniques from Fourier transforms on finite groups to completely classify when a $\mathbb{Z}_2^s$-cover is a flat pluricanonical map. For $s \geq 2$, there are $32$ deformation types. We also show that there exist non-flat canonical and bicanonical $\mathbb{Z}_2^s$-covers for arbitrarily large values of $s$.
Read the full abstract
Optimization and Control · Cross-listed from cs.LG
From Dual Tracking to Clipping: Provably Faster Distributionally Robust Multi-Objective Optimization
Multi-objective optimization (MOO) has received growing attention in applications that require learning under multiple criteria. However, most existing MOO formulations do not explicitly account for distributional shifts in the data. We introduce distributionally robust multi-objective optimization (DR-MOO), which minimizes multiple objectives under their respective worst-case distributions. We propose Pareto-type solution concepts for DR-MOO and develop multi-gradient descent algorithms (MGDA) with provable guarantees. Leveraging a Lagrangian dual reformulation, we first design a double-loop MGDA that uses an inner loop to estimate dual variables and achieves a total sample complexity $\mathcal{O}(\epsilon^{-8})$ for reaching an $\epsilon$-Pareto-stationary point. To further improve convergence, we combine large-batch sampling with gradient clipping to accommodate generalized smoothness and control bias in stochastic preference updates, eliminating the need for double sampling. This yields a single-loop double-clip MGDA with substantially improved sample complexity $\mathcal{O}(\epsilon^{-4})$. Our theory applies to nonconvex problems without requiring uniformly bounded gradients of the dual objectives. Experiments demonstrate that our methods are competitive with state-of-the-art MGDA baselines.
Read the full abstract
History and Overview of Mathematics
Notes on Transversality and Statistical Degeneracies in Distributional Models
These notes provide a pedagogical introduction to the role of transversality theory in the analysis of statistical degeneracies within the framework of distributional statistical models. The classical question of when a statistical model is well-behaved - in the sense of being identifiable, having non-singular Fisher information, and admitting robust estimation - is reformulated as a question about the geometry of a kernel-induced feature map. Statistical pathologies correspond to geometric degeneracies of this map, and transversality theory provides a precise language for understanding when and why such degeneracies are non-generic. The exposition is organised in three parts. Part I surveys the statistical phenomena that motivate the geometric treatment: representation failure, non-identifiability, moment indeterminacy, singular information, nuisance parameters, and the Behrens-Fisher problem. Part II develops the necessary geometric toolkit - smooth maps, Sard's theorem, transversality, jets, stratifications, and the parametric transversality theorem - at a level accessible to students with a background in analysis and linear algebra but no prior exposure to differential topology. Part~III returns to the statistical problems of Part~I and shows how each one admits a unified geometric interpretation as a transversality condition on the feature map. These notes are a pedagogical companion to the research paper Labouriau (2026) "Transversality and Geometric Regularisation in Distributional Statistical Models" (arXiv:2605.04536 [math.ST]), expanding its arguments with motivating examples, geometric intuition, and exercises aimed at advanced Master's and PhD students with a background in mathematical statistics and measure theory. They are designed to support seminars or reading groups.
Read the full abstract
Analysis of PDEs
Commutator estimates and their applications to the transport-type equations
In this paper, we derive new commutator estimates in the Triebel-Lizorkin spaces by employing Bony's para-product decomposition, the Nikol'skij representation, and the Fefferman-Stein vector-valued maximal function. These estimates are then applied to develop a general theory for transport equations. Although analogous results are already available in the setting of Besov spaces, the methods developed there do not carry over directly to the Triebel-Lizorkin case. Our approach works for Triebel-Lizorkin spaces and, as a byproduct, also yields the corresponding results in Besov spaces. All proofs are presented in a unified manner that applies to both scales of function spaces, thereby extending and sharpening previous results on transport equations in these frameworks. Furthermore, the general theory we obtain is widely applicable to evolution equations, including incompressible and compressible ideal fluid flows, shallow water waves, and related models. As an illustration, we consider the two-component Euler-Poincaré system. Using the theoretical framework developed herein, we establish its local well-posedness and a blow-up criterion in both sub-critical and critical Triebel-Lizorkin spaces.
Read the full abstract
Analysis of PDEs
Liouville Theorems for Stationary Navier-Stokes Equations via the Radial Velocity Component
We study Liouville-type results for the stationary Navier–Stokes equations in $\mathbb{R}^3$. We prove that any $\dot{H}^1(\mathbb{R}^3)$ solution is trivial under an integrability condition imposed only on the radial component of the velocity, namely $u_\rho(x) \in L^p(\mathbb{R}^3)$ with $3/2 < p \leq 3$. We also establish a uniqueness result in a variable-exponent setting, where an $L^6$-type condition is required only on a bounded region, while the exponent approaches the critical value $3$ at infinity. Our analysis reveals that the rigidity of the stationary Navier–Stokes system can be driven by localized and radial integrability properties, rather than uniform global conditions.
Read the full abstract
Numerical Analysis
Long-time stability of implicit-explicit Runge-Kutta methods for two-dimensional incompressible flows
High-order adaptive time-stepping algorithms are of significant practical value and theoretical interest for accelerating long-time fluid-flow simulations and resolving complex dynamical behaviors. While several high-order implicit-explicit schemes have been proposed in the literature, their long-time stability properties remain largely unexplored. We develop a family of long-time stable implicit-explicit Runge-Kutta (IERK) methods, up to fourth-order temporal accuracy, for the two-dimensional incompressible Navier-Stokes equations in vorticity-stream function formulation. By combining a convolution-type Hölder inequality with a damping-type multistage Grönwall inequality, we establish a unified analytical framework that proves long-time stability in both the $L^2$ and $H^1$ norms. A key component of the analysis is a mathematical-induction argument that ensures stage-wise boundedness of the vorticity in the $H^\delta$ norm for some $\delta>0$. To the best of our knowledge, this is the first work to establish large-time stability results for high-order IERK algorithms for the two-dimensional incompressible Navier-Stokes equations. Our IERK schemes employ stiffly accurate diagonally implicit Runge-Kutta approximations for the linear diffusive term together with explicit Runge-Kutta approximations for the nonlinear advection term. By exploiting the specific structure of the Navier-Stokes model, we derive a reduced set of order conditions-requiring only 5 and 11 conditions for the third- and fourth-order methods, respectively, in contrast to the classical 6 and 18-allowing the construction of a parameterized family of efficient schemes. These IERK methods are particularly well suited for adaptive time-stepping, as they permit significantly enlarged step sizes in actual computations.
Read the full abstract
Algebraic Geometry
The minimal volume of stable surfaces of rank one
We determine the minimal volume of a stable surface of rank one, and show that the surface attaining this minimum is unique up to isomorphism. This resolves a conjecture of Alexeev and the second author. Of independent interest, the decisive step of the proof uses a plurigenus inequality re-derived by an AI chatbot and applied as a pluricanonical filter; we further apply this filter to rule out additional cases in the classification of small-volume threefolds of general type, and in Kollár's algebraic Montgomery–Yang problem. The underlying inequality has classical antecedents. To our knowledge this is the first paper in birational geometry to claim a C2-level human–AI collaboration in the sense of Feng et al., where the AI's contribution is the recognition that this inequality functions as the decisive pluricanonical filter in the basket analysis.
Read the full abstract
Numerical Analysis
New error estimates of the weighted $L^2$ projections
It is known that the weighted $L^2$ projection operator exhibits approximation properties different from those of the classical $L^2$ projection, in the sense that the $L^2$ error of the weighted $L^2$ projection of an $H^1$ function generally cannot be bounded by the $H^1$ semi-norm of the function. In this paper, we establish sharper $L^2$ error estimates for the weighted $L^2$ projection of an $H^1$ function under general weight distributions. These new estimates show that the $L^2$ errors of the weighted $L^2$ projection can be controlled by the $H^1$ semi-norm of the function, except when the weight distribution is highly irregular, such as those resembling a “checkerboard" pattern. These results can be applied to more refined analyses of domain decomposition methods and multigrid methods for certain partial differential equations with large jump coefficients.
Read the full abstract
Probability
Wandering Exponents and the Free Energy of the High-Dimensional Elastic Polymer
We study the behavior of the elastic polymer, a model of a directed polymer in a continuous Gaussian random environment that is independent in time and correlated in space, as the dimension of the environment is taken to infinity. We give an explicit asymptotic formula for the free energy, which is given in terms of the distribution of the inner product of two sampled configurations, which we also obtain an implicit formula for. From this, we provide an explicit characterization of both the low- and high-temperature phases of this model in terms of the spatial correlation function of the environment. We find asymptotics for the wandering exponent when the spatial correlation function is either an exponential or a power-law decay. Our results show that when the correlations are either suitably weak or short ranged, the model is asymptotically diffusive. On the other hand, for suitably strong long ranged correlations, the model is asymptotically superdiffusive. Moreover, we show that this transition coincides exactly with another transition where the model goes from being one-step replica symmetry breaking to full-step replica symmetry breaking. This rigorously confirms many of the findings of Mezard and Parisi [53] in the physics literature.
Read the full abstract
Numerical Analysis
A semi-generating function approach to the stability of implicit-explicit multistep methods for nonlinear parabolic equations
The rigorous stability analysis of high-order implicit-explicit linear multistep (IELM) methods for nonlinear parabolic equations by using discrete energy arguments is a long standing open issue due to their non-A-stability property. A novel semi-generating function approach combined with a global discrete energy analysis is suggested for the stability and convergence of general IELM methods in solving nonlinear parabolic equations. Inspired from the Grenander-Szegő theorem for Toeplitz matrices, the semi-generating function approach is used to handle the three groups of discrete coefficients via three complex polynomials on the unit circle. A unified theoretical framework is then presented to establish the unconditional stability of IELM methods if the minimum eigenvalue of composite convolution kernels for the implicit part is properly large and the spectral norm bound of composite convolution kernels for the explicit part is properly small. An indicator, called implicit-explicit controllability intensity, is then introduced to evaluate the degree of controllability of the implicit part over the explicit part. Some of the existing IELM methods, up to fifth-order time accuracy, are revisited and compared by computing the associated implicit-explicit controllability intensities such that one can choose an IELM method or proper parameter to maintain the unconditional stability for a specific nonlinear parabolic model. We also propose a new parameterized class of IELM methods, up to the ninth-order time accuracy, which satisfy the a priori settings of our theory and have a large value of the implicit-explicit controllability intensity by choosing a proper parameter so that they would be well suited for a wide class of nonlinear parabolic problems.
Read the full abstract
Combinatorics · Cross-listed from cs.DS
Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs
We study the algorithmic tractability of finding large independent sets in dense random hypergraphs. In the sparse regime, much of the natural algorithms can be formulated within either the local or the low-degree polynomial (LDP) framework, and a rich literature has subsequently identified nearly sharp algorithmic thresholds within these classes by exploiting their stability. In the dense setting, however, the algorithmic paradigms are fundamentally different: they are online and thus need not be stable. Perhaps more crucially, even for the classical Erdős-Rényi random graph $G(n,p)$, LDPs are conjectured to fail in the 'easy' regime accessible to online algorithms, thereby challenging their viability for dense models. Our focus is on two models: (i) finding large independent sets in dense $r$-uniform Erdős-Rényi hypergraphs, and (ii) the more challenging problem of finding large $\gamma$-balanced independent sets in dense $r$-uniform $r$-partite hypergraphs, where the $i$-th coordinate of $\gamma\in\mathbb{Q}^r$ specifies the proportion of vertices from $V_i$ in the independent set. For both models, we pinpoint the size of the largest independent set and design online algorithms that achieve a multiplicative approximation factor of $r^{1/(r-1)}$ in the uniform and $(\max_i \gamma_i)^{-1/(r-1)}$ in the $r$-partite model. Furthermore, we establish matching algorithmic lower bounds, showing that these computational gaps are sharp: no online algorithms can breach these gaps.
Read the full abstract
Information Theory
Infinite families of constacyclic codes supporting 3-designs and their applications in coding theory
Constacyclic codes over finite fields are of theoretical importance as they are closely related to a number of areas of mathematics such as algebra, algebraic geometry, graph theory, combinatorial designs and number theory. However, the study of constacyclic codes in this context remains limited compared to classical cyclic codes. This paper provides two infinite families of $\lambda$-constacyclic codes over $\mathbb{F}_{q^2}$ that support infinite families of 3-designs, which generalize the results in [IEEE Trans. Inf. Theory 69(4): 2341-2354, 2023]. The parameters and weight distributions are determined completely. Besides, we study their subfield subcodes and applications on constructing entanglement-assisted quantum error-correcting codes (EAQECCs) and locally recoverable codes (LRCs). It is worthy to mention that two classes of maximal entanglement EAQECCs with a negative or a high positive net rate are derived. Moreover, two classes of distance-optimal and dimension-optimal LRCs are also obtained.
Read the full abstract
Numerical Analysis
Vector field multiplier operators and matrix-valued kernel quasi-interpolation
We develop and analyze a class of matrix-valued spherical-convolution kernels stemming from scaled zonal functions on $\mathbb{S}^2,$ the unit sphere embedded in $\mathbb{R}^3$. The construct of these kernels utilizes the Legendre differential equation and requires less stringent regularity conditions on the original zonal kernels. The induced integral operators are simple Fourier-Legendre multipliers that not only deliver optimal Sobolev error estimates (in terms of the scaling parameter) but also yield natural Helmholtz-Hodge decompositions on the $L_2$-tangential vector fields on $\mathbb{S}^2$. Via discretization of the underlying convolution integrals, we harvest a family of vector-valued quasi-interpolants that accomplish our approximation goal in the divergence/curl-free vector field. The quasi-interpolation algorithm is robust against noisy data. The implementation process is adaptive to human-improvision, involving neither evaluating the convolution integrals nor solving systems of linear equations. The computational efficiency and executory robustness of the quasi-interpolation algorithm stand in sharp contrast to the existing kernel-based vector field interpolation method.
Read the full abstract
Probability · Cross-listed from stat.ML
Variational Smoothing and Inference for SDEs from Sparse Data with Dynamic Neural Flows
Stochastic differential equations (SDEs) provide a flexible framework for modeling temporal dynamics in partially observed systems. A central task is to calibrate such models from data, which requires inferring latent trajectories and parameters from sparse, noisy observations. Classical smoothing methods for this problem are often limited by path degeneracy and poor scalability. In this work, we developed a novel method based on characterization of the posterior SDE in terms of conditional backward-in-time score defined as the gradient of a function solving a Kolmogorov backward equation with multiplicative updates at observation times. We learn this conditional score using neural networks trained to satisfy both the governing PDE and the observation-induced jump conditions, thereby integrating continuous-time dynamics with discrete Bayesian updates. The resulting score induces a posterior SDE with the same diffusion coefficient but a modified drift, enabling efficient posterior trajectory sampling. We further derive a likelihood-based objective for learning the SDE parameters, yielding an evidence lower bound (ELBO) for joint state smoothing and parameter estimation. This leads to a variational EM-style procedure, where the neural conditional score is optimized to approximate the smoothing distribution, followed by a maximization step over the SDE parameters using samples from the induced posterior. Experiments on nonlinear systems demonstrate accurate and stable inference with a very few observations demonstrating significant improved scalability compared to classical MCMC methods.
Read the full abstract
Dynamical Systems
Mixed Global Dynamics of the Forced Vibro-Impact Oscillator with Coulomb Friction and its Symplectic Structure, KAM Tori, and Persistence
The forced vibro-impact oscillator with Amonton-Coulomb friction and elastic walls was shown by Gendelman et al. (2019) to exhibit a coexistence of Hamiltonian stability islands and dissipative attractors in a single phase space. We provide a complete mathematical analysis of this phenomenon. We prove global well-posedness of the associated Filippov flow and construct a global lift to a piecewise smooth Hamiltonian system on a covering manifold. On the maximal forward-invariant non-sticking set, we show that the time-$T$ stroboscopic map is exact symplectic, within the formalism of symplectic dynamics. We derive a closed-form existence equation for symmetric $T$-periodic orbits and establish a parameter-dependent saddle-center bifurcation at $f_{\rm sc}(F,\omega,R)$, correcting a universality claim in prior work. Using Moser's twist theorem, we prove the existence of invariant Cantor families (KAM tori) near elliptic non-sticking periodic orbits, while a Melnikov analysis yields hyperbolic dynamics conjugate to a Bernoulli shift near the associated saddle. We further show that any positive restitution defect or viscous damping destroys the conservative structure: elliptic periodic orbits persist but become asymptotically stable, replacing Hamiltonian islands by a single attracting basin. The approach extends to multi-particle systems with elastic collisions, where a symplectic structure and higher-dimensional KAM tori are obtained. A computer-assisted proof verifies the existence and ellipticity of a non-sticking periodic orbit at a specific parameter point.
Read the full abstract
Combinatorics
Twist polynomial interpolation for binary delta-matroids
Gross, Mansour and Tucker introduced the partial-dual polynomial of a ribbon graph and asked under what conditions such a polynomial is even-interpolating, odd-interpolating, or both. In this paper, we provide an answer to this open problem.Using the framework of delta-matroids, we prove that the twist polynomial of any binary delta-matroid is either an even polynomial, an odd polynomial, or both even-interpolating and odd-interpolating. Applying this to ribbon graphs, we deduce that the partial-dual polynomial of any ribbon graph satisfies the same conclusion.