Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 6 May

Spectral Theory

Riesz property in the case of multiple eigenvalues

We analyze spectra and the Riesz property of spectral projections of non-symmetric perturbations of self-adjoint operators with eigenvalues having arbitrary multiplicities, including infinite ones. In particular, we establish the Riesz property for perturbations of the multi-dimensional harmonic oscillator, Landau Hamiltonian and Laplace-Beltrami operator on a sphere by complex-valued $L^r$-potentials if $d/2 < r < \infty$.
Read the full abstract

Analysis of PDEs

Recent progress in generalized Hamiltonian gradient flow: Singularities

This paper is a survey of the generalized Hamiltonian gradient flow (GHGF) framework for Hamilton-Jacobi equations, with an emphasis on the propagation of singularities and its connections to weak KAM theory, optimal transport and mean field control. In addition to reviewing the main ideas and known results, we present two new contributions. First, we provide a variational construction of generalized characteristics via a minimizing movement scheme; by taking the weak limit of approximate solutions and using Young measure compactness, we show that the limiting curve satisfies the generalized characteristic differential inclusion. Second, we lift the forward dynamics of strict singular characteristics to a semi-flow on the space of trajectories and study its invariant probability measures. We prove that the only invariant measures of the GHGF semi-flow that attain the critical value \(c[H]\) are precisely the projected Mather measures, thereby giving a new dynamical characterization of Mather's minimal measures as well as Mañé's critical value. Finally, we discuss a number of open problems that arise from the GHGF perspective, including questions on uniqueness of strict singular characteristics, rectifiability of cut loci, stability under perturbations, contact Hamiltonian systems, vanishing noise limits, and extensions to non-convex or low-regularity Hamiltonians. These problems highlight the deeper connections between singular dynamics, ergodic theory, optimal transport, and geometric analysis, and indicate directions for future research.
Read the full abstract

Group Theory

The geometry of wreath and semi-direct products

Coset geometries are incidence geometries constructed from a group $G$ and a system of subgroups $(G_i)_{i \in I}$ of subgroups of $G$. For any algebraic group operation, it is then natural to wonder whether it can be extended to the framework of coset geometries. This has been achieved in the case of the halving (\cite{halving}) and in the case of free (amalgamated) products, HNN-extensions, and semi-direct products (\cite{piedade2025group}). In this article, we explore more deeply two operations related to semi-direct products: the twisting and the wreath product. We show that these operations extend to coset geometries in such a way that they preserve key properties, such as flag-transitivity, residual-connectedness and being thin. In particular, we can apply twistings and wreath products to polytopes and hypertopes. Doing so, we show that there exists regular polytopes and hypertopes for almost-simple group with socle a sporadic simple group.
Read the full abstract

Numerical Analysis

Heat and mass transfer through fabric: a model for fabric drying with heated cylinders

Textile drying is a key operation in the textile production cycle as it represents one of the most energy-intensive stages and plays a critical role in determining both product quality and overall process efficiency. In this work we propose a mathematical model for the drying process of a generic textile material using heated cylinders, operating under low-pressure conditions. The model's parameters are estimated by nonlinear least squares regression. Given a specific fabric, the developed model allows to predict the drying time and the residual moisture content. The model is validated using real world data provided by a major Italian textile company.
Read the full abstract

All authors Stefania Bellavia, Nicolò Fiorini, Adriano Milazzo, Alessandra Papini

Rings and Algebras

Faithful linear and relational representations of diagram categories and monoids

We study representations of diagram categories by binary relations and matrices over rings and semirings. Our main result is a faithful involutive tensor representation of the partition category $P$ (and consequently of each partition monoid $P_n$) by zero-one matrices over an arbitrary (additively) idempotent semiring. The dimensions of the matrices involved are powers of $2$, and we show that these are minimal with respect to faithful involutive tensor representations by matrices over any semiring. Intriguingly, these matrices encode the number of floating components formed when composing partitions, and can therefore be used to construct faithful representations of ($d$-)twisted partition categories $P^\Phi$ and $P^{\Phi,d}$ (and the respective twisted partition monoids $P_n^\Phi$ and $P_n^{\Phi, d}$) over rings of appropriate characteristic. We also give lower-dimensional involutive representations of the Brauer and Temperley–Lieb categories $B$ and $TL$. In the case of $TL$, the dimensions are given by Fibonacci numbers.
Read the full abstract

Combinatorics · Cross-listed from cs.MS

CombOL: a Library for Practical Enumeration and Boltzmann Sampling of Combinatorial Classes

We present CombOL (Combinatorial Objects Library), an open-source library for the enumeration and Boltzmann sampling of combinatorial classes. Classes can be specified by a concise string syntax, and may depend on an arbitrary number of parameters. CombOL automatically derives the associated generating functions, enabling the generation of counting sequences and the compilation of Boltzmann samplers. The library supports exact and approximate-size Boltzmann rejection sampling with automatic parameter tuning to target specific sizes. In addition to implementing established methods, CombOL contributes a novel early-rejection scheme, as well as guaranteed statistical correctness by dynamically increasing the numerical precision, eliminating bias due to floating-point rounding errors. Through the Python interface, sampled structures can be mapped to application-specific objects, enabling direct sampling of domain objects such as graphs, chemical structure representations, or other complex data types. CombOL is available from PyPI as 'combol' (pypi.org/project/combol). The source code is available at gitlab.com/casbjorn/combol.
Read the full abstract

Combinatorics

Determinantal formulae for a symmetric generating function of totally symmetric plane partitions

Ilse Fischer and the second author introduced in [Algebr. Comb. 7 (2024), no. 5, 1319-1345] a two parameter family of polynomials defined as sums over totally symmetric plane partitions and connected to alternating sign matrices and cyclically symmetric lozenge tilings of a hexagon with a triangular hole. In this paper we present several determinantal formulae leading to new lattice path models and a novel family of tableaux. The later illustrates that the polynomials of our interest can be thought of as generalisations of the three dual Littlewood identities.
Read the full abstract

Analysis of PDEs

Global well-posedness and decay rates for the three dimensional incompressible active liquid crystals

This paper investigates the global well-posedness and large-time behavior of 3D incompressible active liquid crystals under constant activity, modeled by a coupled system of forced incompressible Navier-Stokes equations for the velocity and a parabolic system for the $Q$-tensor order parameter. By employing refined commutator estimates, the existence and uniqueness of global strong solutions are proved for small initial data $(Q_0,u_0)\in H^{s+1}\times H^s$ $(s\geq 2)$ with activity $c>c_\star$, which improves a previous result in \cite{active-limit}. In addition, if the initial data further belong to $L^1$ and $s\geq 4$, we obtain a mixing decay estimate on $\|\partial^kQ(t)\|_{L^2}$ that combines both an extra exponential decay factor at a rate proportional to $(c-c_\star)\Gamma$ and the optimal algebraic decay rate that coincides with that of the heat kernel, where $k\leq s-1$. This result reveals that, in the high activity regime, active nematics become isotropic with an activity-dependent exponential convergence rate, and the estimate is stable in the infinite rotational viscosity limit, as $\Gamma\rightarrow 0$. Meanwhile, the sharp decay estimate on $\|\partial^ku(t)\|_{L^2}$ is also derived for $k\leq s-2$ with an additional initial assumption. The proof is established via a combination of the Green's function method and the time-weighted energy method. To the best of our knowledge, these results are the first reported for active/passive nematic liquid crystals within the Beris-Edwards framework, and the enhanced decay effect of the orientational field is essentially derived from the free energy. Furthermore, in the passive setting, our result implies the phase transition of thermotropic liquid crystals at high temperatures.
Read the full abstract

Information Theory

Constructions of locally repairable codes via concatenated codes

Locally repairable codes (LRCs) have attracted considerable attention owing to their pivotal role in distributed storage systems. Since binary linear LRCs can significantly reduce the complexity of both encoding and decoding, the construction of binary LRCs has drawn extensive research interest. In this paper, we construct binary LRCs with locality $r=2$ and disjoint local repair groups via classical concatenation, where the outer codes are linear codes over $\mathbb{F}_4$ and the inner code is the binary $[3,2,2]$ linear code. We present a systematic approach for selecting outer codes to obtain LRCs attaining specified bounds, and show that the weight distributions of the resulting binary LRCs are determined by those of the selected outer codes. Under certain sufficient conditions, we construct several classes of optimal binary LRCs, including those attaining Griesmer-type bounds and binary perfect LRCs. Furthermore, we sharpen the Johnson-like bounds of Ma and Ge for binary LRCs with locality $r=2$ and disjoint local repair groups, and define nearly perfect binary LRCs and $k$-optimal binary LRCs with respect to the improved bounds. We show that nearly perfect binary LRCs can be constructed via concatenation when the outer codes are nearly perfect linear codes over $\mathbb{F}_4$. Finally, we present several examples of such nearly perfect and $k$-optimal binary LRCs.
Read the full abstract

Differential Geometry

Counting Minimal Lagrangians Via Mirzakhani Functions

We show that for $k>1$ the number of genus $k$ minimal Lagrangians with area at most $A$ in a product of hyperbolic surfaces grows on the order of $A^{6(k-1)}$, with an explicit leading constant given in terms of the Mirzakhani function, and we obtain a similar result for products of nonpositively curved surfaces. We also prove rigidity of the Lagrangian area spectrum, and obtain analogous counting results for products of a higher genus surface with a circle.
Read the full abstract

Optimization and Control

Computational acceleration strategies for large-scale energy system optimization: a comparative study of GPU-accelerated and distributed-memory solvers

Energy system optimization models are increasing in scope and resolution, yielding large and challenging linear programs. For a long time, the standard way to address such problems has relied on shared-memory interior-point methods (IPM), which combine robustness and accuracy but face scalability limits as model instance size grows. Recently, two promising directions for specialized solver architectures have emerged: (i) GPU-accelerated first-order methods (FOM); and (ii) distributed-memory IPM, which can exploit block structure that arises in many energy system models. This paper presents a computational study comparing these solver classes on a diverse test set of large-scale linear programs arising from energy system analysis, including scenario-based formulations derived from stochastic programming. The results illustrate that distributed-memory IPM can leverage problem structure to deliver substantial speed-ups on specific problems with block-angular structures. GPU-accelerated FOMs demonstrate strong scalability but may yield solutions with higher relative infeasibilities, which, depending on the use case and model uncertainty, can still be acceptable. Overall, our findings indicate that recent algorithmic and hardware advances substantially broaden the computational toolbox available to the energy system optimization community. Each solver class exhibits distinct advantages: shared-memory IPMs remain a powerful tool for reliably obtaining high-accuracy solutions; distributed-memory IPMs can extend scalability to hundreds of cores for certain structured models, enabling faster time-to-solution; and GPU-based FOM can deliver fast solutions when such lower accuracy levels are appropriate. Together, they help make high-resolution, multi-scenario energy system optimization models tractable across a broader range of problem sizes and computing environments.
Read the full abstract

All authors Janina Zittel, Annika Buchholz, Michael Bussieck, Frederik Fiand, Thorsten Koch, Lukas Mehl, Niels Lindner, Manuel Wetzel

Combinatorics

Nonexistence of Whirling-Knight Tours at Half Coil Count for $n \equiv 4, 6 \pmod 8$

A whirling knight's tour is a Hamiltonian cycle in the digraph of counter-clockwise knight steps about the centre of an $n \times n$ board; its coil count $c$ is the winding number around the centre. We prove that no such tour with $c = n/2$ exists when $n \equiv 4 \pmod 8$ ($n \ge 4$) or $n \equiv 6 \pmod 8$ ($n \ge 6$), settling a conjecture of Beluhov. For each residue class we exhibit a closed-form Farkas certificate for infeasibility of a cycle-cover LP relaxation; the two certificates are structurally distinct.
Read the full abstract

Rings and Algebras

Lie algebras with only inner derivations and applications to finite $p$-groups

This paper begins by studying Lie algebras of the form $\mathcal L=\mathcal S\ltimes\mathcal N$ with only inner derivations. We extend Sato's construction to infinite families of such Lie algebras and answer Carles's question by exhibiting a $19$-dimensional complete non-perfect Lie algebra with nilpotent radical. Applying our construction, we derive a family of finite $p$-groups $P$ with $|\Aut(G)|=|P|$ for any $p\geq7$. Moreover, we show that for arbitrarily small $\alpha>0$ and every prime $p\geq7$, there exists a finite $p$-group $P$ such that $|\Aut(P)|<\varphi(|P|)^\alpha$. This is a preliminary version of the manuscript, and some sections are still being revised.
Read the full abstract

2605.04602 · 6 May · 45 pages Substantially revised and expanded. This version presents a 19-dimensional complete non-perfect Lie algebra with nilpotent radical and adds applications to automorphism groups of finite p-groups, including a solution to Problem 16.63 of the Kourovka Notebook for every prime p >= 7

Mathematical Physics · Cross-listed from quant-ph

Two-site Bose-Hubbard hopping and Schrödinger cat states

The Bose-Hubbard Hamiltonian can be simplified to have only two lattice sites, in which case the system being described is referred to as a dimer. Due to its structure, the hopping term of the dimer Hamiltonian enjoys invariance in a family of subspaces indexed by a whole number $k$, each subspace corresponding to a system of only $k$ particles. We have invented an inductive argument using the bosonic canonical commutation relations to find the eigenvalues and eigenvectors of the dimer hopping Hamiltonian in its $k$-particle subspaces. In particular, this Hamiltonian, when restricted to one of the $k$-particle subspaces, is exactly the spin projection operator along the $x$-axis, where the number of particles $k$ in the dimer system yields the projection matrix for spin quantum number $s=k/2$. Thus, a new method for computing the eigenvalues and eigenvectors of the $x$-axis spin projector has been unearthed. We use the explicit construction to study the dynamics of coherent states induced by the square of the dimer hopping hamiltonian. We find that it generates Schrödinger cat states in the two-site setting.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

A Queueing-Theoretic Framework for Stability Analysis of LLM Inference with KV Cache Memory Constraints

The rapid adoption of large language models (LLMs) has created significant challenges for efficient inference at scale. Unlike traditional workloads, LLM inference is constrained by both computation and the memory overhead of key-value (KV) caching, which accelerates decoding but quickly exhausts GPU memory. In this paper, we introduce the first queueing-theoretic framework that explicitly incorporates both computation and GPU memory constraints into the analysis of LLM inference. Based on this framework, we derive rigorous stability and instability conditions that determine whether an LLM inference service can sustain incoming demand without unbounded queue growth. This result offers a powerful tool for system deployment, potentially addressing the core challenge of GPU provisioning. By combining an estimated request arrival rate with our derived stable service rate, operators can calculate the necessary cluster size to avoid both costly over-purchasing and performance-violating under-provisioning. We further validate our theoretical predictions through extensive experiments in real GPU production environments. Our results show that the predicted stability conditions are highly accurate, with deviations typically within 10%.
Read the full abstract

Statistics Theory · Cross-listed from stat.ML

Multiscale Euclidean Network Trajectories: Second-Moment Geometry, Attribution, and Change Points

Understanding a dynamic network requires more than locating when it changes: we also want to know the magnitude and structural direction of change and which nodes contribute. Unfolded spectral embedding places network snapshots in a joint representation, but the underlying rectangular latent factorization is invariant under general linear transformations. Such transformations preserve edge probabilities while potentially distorting Euclidean second moments. We introduce Multiscale Euclidean Network Trajectories (MENT), whose central estimands are pairwise second-moment operators of the dynamic latent positions. Under an isotropic normalization of the shared anchor latent positions, these operators are identifiable up to simultaneous orthogonal conjugation. They yield a global trace variation distance and, through an aggregated operator, shared orthogonal directions for mode-wise distances. The squared global distance decomposes exactly across these modes. Classical multidimensional scaling turns the distances into global and mode-wise trajectories of time. A modified unfolded spectral estimator consistently recovers the operators and induced trajectories, and we establish bounds connecting node attributions to trajectory displacements and trajectory estimation to change point localization. Synthetic experiments validate geometric recovery and show improved detection of mode-specific changes against baselines. Analyses of two real networks illustrate interpretable mode- and node-level descriptions of temporal evolution.
Read the full abstract

Functional Analysis

Multiplicative spectral functions on some Banach function algebras

In this paper, we study multiplicative functions $\varphi \colon A \to \Bbb C$ on a natural Banach function algebra $A$ on a compact Hausdorff space $X$, such that $\varphi(f)\in \sigma(f)$ for all $f\in A$. It is shown that for certain natural Banach function algebras $A$, either $\ker(\varphi)$ is a maximal ideal of $A$ or $1\in {\rm span}({\rm ker}(\varphi))$ (that is $1=f_1+f_2+\cdots f_n$ for some $f_1,..., f_n \in {\rm ker}(\varphi)$). Then we investigate for the linearity of $\varphi$ in either of cases that $\varphi$ is continuous or $1\notin {\rm span}({\rm ker}(\varphi)$. We show that, for some natural Banach function algebras $A$, in either of these cases, there exists a point $x_0\in X$ such that $\varphi(f)=f(x_0)$ for some family of functions $f\in A$ (including those functions $f\in A$ that $\overline{f}\in A$). In particular, such a multiplicative spectral function on some Banach algebras including $C(X)$, Lipschitz algebras, Banach algebras of absolutely continuous functions on $[0,1]$ and $C^1([0,1])$ is linear and hence it is a character.
Read the full abstract

Numerical Analysis

Mixed Finite Elements for Geometrically Exact Beams using Discontinuous Rotations and Discrete Curvature

We propose a novel mixed finite-element formulation for geometrically exact (Simo–Reissner) beams that introduces the moment vector as additional independent field. The specific mixed form allows for an element-local, discontinuous approximation of rotations, which is key to a simple and efficient discretization framework. The concept of discrete curvature provides a mathematically consistent treatment of rotation discontinuities. For linear constitutive laws, the mixed form is derived via a Legendre transform of the curvature-related strain energy. Objectivity is retained at the discrete level by interpolating relative rotations through a multiplicative split of the rotation field; path-independence is inherent to the total Lagrangian setting and verified numerically. Several benchmarks demonstrate optimal rates of convergence and accuracy, irrespective of the beam's slenderness and order of approximation. Notably, the lowest-order element entirely avoids rotation interpolation by employing element-constant rotations only.
Read the full abstract

Combinatorics

Centralizers in finite groups and Domination number of their commuting graphs

The proper commuting graph $\mathcal{C}^{**}(G)$ of a finite group $G$ is the simple graph whose vertices are the noncentral elements of $G$ and two distinct vertices are adjacent if they commute. In this paper, we study the domination number and total domination number of proper commuting graphs of finite groups. We first obtain general bounds for the domination number of proper commuting graphs. For finite nilpotent groups, we exploit a strong product decomposition of commuting graphs to derive exact formulas for the domination number. We further determine the exact domination number and total domination number for proper commuting graphs of several well-known families of finite groups, connecting with the centralizers of those groups.
Read the full abstract

Optimization and Control

IRON: Implicit Resolvent Optimization under Noise

We study stochastic optimization from a joint continuous-discrete point of view. Starting from a second-order stochastic differential equation interpreted as a noisy accelerated gradient flow, we discretize the dynamics by a fully implicit Backward-Euler scheme. This leads to a resolvent, or proximal-type, update, computed in practice through Levenberg-Marquardt, Newton, or trust-region-type inner solves. The resulting method, denoted by $\text{IRON}_{\text{FI}}$, admits a Lyapunov mean-square recursion. The main conclusion is that increasing the implicit stepsize $\alpha$ improves the contraction factor and decreases the stationary mean-square error bound. Under sufficiently accurate inner solves, this bound scales as $O(1/\alpha)$; in particular, for large enough $\alpha$, the recursion is contractive and the stationary error bound vanishes as $\alpha\to\infty$. We establish the theory for smooth strongly convex objectives and provide a sharper quadratic analysis with an explicit stationary constant. The numerical experiments support the theory in the strongly convex case and illustrate the same qualitative behavior in nonconvex and learning settings. To the best of our knowledge, this fully implicit inertial-resolvent discretization, where the noise acts as an additive perturbation of the resolvent center and yields an $O(1/\alpha)$ stationary-MSE law, has not been isolated in this form before. The broader message is that discretization is not only an implementation choice: in stochastic optimization, the numerical integration rule can directly affect the long-time stability of the iterates under noise.
Read the full abstract

Number Theory

A Ceiling Continued Fraction Approach to the Erdős-Straus Conjecture: Heuristic finiteness of counterexamples

We introduce the Ceiling Continued Fractions (FCT) framework for constructing three-term Egyptian fraction representations in the Erdős–Straus conjecture from divisors of the shifted integers \(p+i\). A probabilistic model for their arithmetic structure leads to an asymptotic upper-bound heuristic for cumulative failure. The resulting bound is summable, and the first Borel–Cantelli lemma assigns probability zero to the event that infinitely many primes survive the full FCT block. Computational tests on \(10^9\) Mordell-type primes at each of the scales \(10^{17}\), \(10^{52}\), and \(10^{131}\) found no counterexamples.
Read the full abstract

2605.04551 · 6 May · 17 pages. v3: The failure model now uses the distinct prime-factor count omega_3(p+i) for q=3 mod 4, replacing the earlier tau(p+i)-based model. The theoretical exponent therefore changes from log p to log log p. The cumulative heuristic and comparisons were updated; computational results are unchanged

Numerical Analysis

Neural-Guided Domain Restriction to Accelerate Pseudospectra Computation for Structured Non-normal Banded Matrices

Computing pseudospectra of non-normal matrices is essential for understanding the stability and transient behavior of dynamical systems. Such analysis is critical in applications including fluid dynamics, control systems, and differential operators, where non-normality can lead to significant transient amplification and sensitivity to perturbations that are not captured by eigenvalue analysis alone. At large scales, commonly used numerical approaches for pseudospectra computation can become computationally demanding, as they require repeated auxiliary computations to identify spectrally sensitive regions in the complex plane. We present a neural network-based approach that predicts sensitive regions directly from matrix features, thereby avoiding exhaustive pseudospectra evaluation across the entire complex plane. We calibrate the prediction threshold on validation data to ensure reliable coverage of sensitive regions. The trained neural network guides the selection of grid points requiring full computation, enabling focused computation only where necessary. The approach provides a practical preprocessing strategy for efficient pseudospectra computation. Numerical experiments on non-normal banded matrices demonstrate substantial speedup compared to full grid-based numerical evaluation while maintaining high accuracy in identifying sensitive regions.
Read the full abstract

Information Theory

Z-Opt: A Near-Optimal Reduced-Complexity Two-Dimensional Grassmannian Constellation

Grassmannian constellations achieve the capacity of noncoherent communications over Rayleigh fading channels at high SNR, yet their efficient construction remains challenging. In this paper, we present two construction methods for Grassmannian constellations on G(2,1), termed S-Opt and Z-Opt, and propose two low-complexity detectors. Both construction and detection are performed on the unit sphere, known as the Bloch sphere in quantum computing. Exploiting the proportionality between the chordal distance on the Grassmann manifold and the Euclidean distance on the Bloch sphere, we derive a theoretical upper bound on the minimum chordal distance from the Fejes-Toth bound. The S-Opt constellation is constructed from sphere-packing solutions and achieves the theoretical limit corresponding to the considered optimal Bloch-sphere packings. The S-Opt detector applies to arbitrary constellations on G(2,1) and requires a number of complex multiplications scaling linearly with the number of receive antennas and logarithmically with the constellation size, and a number of numerical comparisons scaling logarithmically with the constellation size, while achieving the same performance as the GLRT detector. Based on the insight from the S-Opt construction, we further propose the Z-Opt constellation, constructed by stacking regular polygons on the Bloch sphere, whose minimum chordal distance approaches the derived upper bound over the evaluated constellation sizes. The Z-Opt detector requires a number of complex multiplications scaling linearly with the number of receive antennas and a number of numerical comparisons scaling logarithmically with the square root of the constellation size, while achieving the same performance as the GLRT detector for the Z-Opt constellation.
Read the full abstract

All authors Kotaro Shigenaga, Hiroki Iimori, Yuto Hama, Chandan Pradhan, Szabolcs Malomsoky, Naoki Ishikawa

Statistics Theory

Transversality and Geometric Regularisation in Distributional Statistical Models

The distributional statistical framework replaces classical probability densities by distribution-kernel pairs $(T, \varphi)$, where $T$ is a tempered distribution and $\varphi$ is a rapidly decaying kernel. We develop the thesis that the kernel acts as a geometric regulariser, placing parametric statistical models in generic (transversal) position relative to degeneracy loci encoding non-identifiability, singular information, moment indeterminacy, and representation failure. Using the transversality theorems of Whitney, Thom, and Mather, we prove a finite-dimensional weak transversality theorem: for a generic kernel in any sufficiently rich family, the kernel-induced feature map avoids degeneracy strata of sufficiently high codimension. We establish verifiable conditions – formulated as rank conditions on the Jacobian of the joint feature map – under which the transversality hypothesis can be checked, and verify them for location families, the log-normal, Stein discrepancies, and graphical models. The present results apply to parametric models; extensions to semiparametric and nonparametric settings are discussed. The degeneracy classification includes representation degeneracy (Type 0) for models without closed-form densities and higher-order instabilities (Type IV) in non-chordal graphical models. Identifiability, robustness, moment determinacy, Fisher information regularity, Stein discrepancy, inferential separation, and the Behrens-Fisher problem all admit a unified geometric interpretation as transversality conditions on the feature map. This paper serves as a geometric companion to a series of papers developing the distributional framework.
Read the full abstract

2605.04536 · 6 May · 29 pages, no figures no tables. In the second version some sketches were replaced by proofs, an example of M-determinancy was added. In the third version the model representation becomes a tempered distribution instead of a pari tempered distribution and a Swartz kernel. In the fourth version the example oinvolving the Cauchy distribution was corrected

Numerical Analysis · Cross-listed from cs.LG

From Video-to-PDE: Data-Driven Discovery of Nonlinear Dye Plume Dynamics

Inferring continuum models directly from video is hampered by two facts: the recorded field is uncalibrated image intensity rather than a physical state, and direct numerical differentiation of noisy frames is unstable. We develop a video-to-PDE pipeline that converts grayscale recordings of an ink plume into a normalised scalar field $u(x,y,t)$, isolates a bulk drift $\mathbf{v}(t)$ from intrinsic spreading via the intensity-weighted centroid, and identifies an effective transport law by weak-form sparse regression. Conditioning, threshold-sweep and random-centre diagnostics show that overcomplete libraries are strongly collinear; the search is therefore restricted to compact gradient-based libraries. Coefficients are refined by an inverse physics-informed network and recalibrated against forward rollouts, with a chronological block bootstrap quantifying uncertainty. The selected reduced model $u_t+\mathbf v(t)\!\cdot\!\nabla u = 9.005\,|\nabla u|^{2}+0.666\,\Delta u$ outperforms advection–diffusion baselines on held-out frames, retains a positive Laplacian coefficient, and admits a Cole–Hopf reduction to a linear advection–diffusion equation. The framework demonstrates that uncalibrated visual data can yield compact, predictive and structurally interpretable continuum models when discovery, calibration and uncertainty are treated as distinct stages.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Online Riemannian Gradient Descent for Quantum State Tomography with Matrix Product Operators

Matrix product operators (MPOs) provide a scalable approach for quantum state tomography (QST) by offering a compact representation of many-body mixed states with limited entanglement, using only a number of parameters that scales polynomially with the system size. In this paper, we study QST for quantum density matrices that can be represented by MPOs. We first derive an equivalent characterization of Hermiticity in terms of the MPO core tensors and show that the coefficient tensor of an MPO under the Pauli or generalized Gell-Mann basis admits a real-valued low tensor-train (TT) rank structure. This establishes an explicit connection between MPO-based QST and noisy low-rank tensor completion. Motivated by this formulation, we develop an online Riemannian gradient descent (oRGD) algorithm that sequentially incorporates measurement data during the reconstruction process. With a proper initialization, we prove that oRGD converges linearly to the target MPO and succeeds with a number of distinct measurement settings that scales quadratically with the system size. As a byproduct, our analysis also yields a significantly improved sample complexity bound for the low TT rank tensor completion task. Furthermore, we propose a tailored spectral initialization method and establish its theoretical guarantee. Numerical experiments on several classes of quantum states validate the effectiveness and scalability of the proposed method.
Read the full abstract

All authors Jian-Feng Cai, Jingyang Li, Xiaoqun Zhang, Yuanwei Zhang

Algebraic Geometry

Stability conditions and infinitesimal deformation of curves

Let $\mathcal X$ be an infinitesimal deformation of a smooth projective curve $X_0$ over a field. We study stability conditions under such deformations and show that the derived push-forward functor associated with the inclusion $X_0 \to \mathcal X$ induces an isomorphism between the space of stability conditions on $\mathcal X$ and that on $X_0$. This yields a direct comparison between the deformed and undeformed settings. As an application, we prove that the autoequivalence group $\mathrm{Aut}{\mathbf D^b(\mathcal X)}$ naturally acts on $\mathbf D^b(X_0)$, providing a link between derived symmetries and the deformation structure.
Read the full abstract

Analysis of PDEs

Source-Driven Transitions in Axisymmetric Euler Flow

We study a finite-time source-driven transition in axisymmetric Euler flow with swirl. For an explicit smooth compact datum, we prove exact source, moment-return, fixed-label transport, and response identities. For the same frozen finite reference, interval arithmetic gives continuum derivative bounds and a terminal scalar-trace enclosure. Under the remaining global comparison hypotheses, these estimates imply contraction of two fixed material labels and a finite-radius outgoing level set. We state separately the unresolved steps: global defect enclosure, sufficient next-block admission, cylindrical whole-space realization, and repeated regeneration from one datum. No whole-space Euler singularity is claimed
Read the full abstract

Category Theory

Enhanced $2$-categories of models of sketches as enhanced $2$-categories of algebras over monads

We establish the equivalence between models of enhanced $2$-sketches and algebras over monads, including the (co)lax morphisms. More precisely, for any enhanced limit $2$-sketch $\mathbb{T}$ with tight cones, the enhanced $2$-category $\mathbb{M}\mathrm{od}_{s, w}(\mathbb{T}, \mathbb{K})$ of models of $\mathbb{T}$ in a locally presentable enhanced $2$-category $\mathbb{K}$, in which the tight and the loose morphisms are the $\mathscr{F}$-natural transformations and the loose $w$-natural transformations, respectively, is equivalent to the enhanced $2$-category ${\mathrm{T}\text{-}\mathbb{A}\mathrm{lg}}_{s, w}$ of algebras over an enhanced $2$-monad $T$ on the models $\mathbb{M}\mathrm{od}(\mathcal{T}_\tau, \mathbb{K})$ restricted to the tights with strict $T$-morphisms and $w$-$T$-morphisms. As a consequence, we explore the limits in the enhanced $2$-category $\mathbb{M}\mathrm{od}_{s, w}(\mathbb{T}, \mathbb{K})$ of models with loose $w$-natural transformations, and conclude that $\mathbb{M}\mathrm{od}_{s, w}(\mathbb{T}, \mathbb{K})$ inherits all $w$-rigged limits. Along the way, we establish an enriched analogue of the Orthogonal Sub-category Theorem, and generalise results on the reflectivity and the monadicity of models of enriched limit sketches in the base of enrichment to any arbitrary locally presentable enriched category.
Read the full abstract

Representation Theory

Zeros of characters and orders of elements in finite groups

We investigate a beautiful conjecture of T. Wilde on character values and element orders of finite groups. We reduce it to a statement on nearly simple groups that can be checked “prime by prime". For these groups, we show that a strong form of Wilde's conjecture holds in many important cases, and for primes $p>5$ we are able to show the required statement for most classes of nearly simple groups. The few remaining cases, however, seem to require information on extensions of irreducible characters that are not available at the present time.
Read the full abstract