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)

Tuesday 5 May

Combinatorics

Non-external Proofs of Lagrange Inversion Formula

The goal of the paper is to present two simple proofs of the Lagrange Inversion Formula for formal power series. Both proofs are non-external in the sense that they use concepts that do not go beyond the scope of basic tools of formal power series analysis.

Statistics Theory

The Threshold Breakdown Point

We introduce a novel approach to finite sample robustness that avoids the pessimism of traditional breakdown analyses. We define the threshold breakdown point, the smallest contamination fraction needed to induce a prescribed deviation, and the finite sample m-sensitivity, the worst-case deviation that an estimator can incur after m observations are contaminated. We derive these measures for commonly used M-estimators, their standard errors and related test statistics. This allows us to extend the decision breakdown point of Zhang (1996) to obtain general breakdown characterizations for hypothesis testing, and show how these notions correspond to finite sample counterparts of the power and level breakdown functions of He, Simpson and Portnoy (1990). We complement our work with an inferential framework for the threshold breakdown and m-sensitivity that yields consistency and asymptotic normality results, as well as a valid multiplier bootstrap for uncertainty quantification. We illustrate the practical utility of our methods in various numerical examples and an application to a two sample testing problem for a blood pressure dataset.
Read the full abstract

Analysis of PDEs

Blow-Up Criteria and Weak–Strong Uniqueness for Compressible Fluid–Viscoelastic Shell Interactions

Existence and uniqueness of strong solutions to a barotropic compressible fluid–viscoelastic shell interaction system have recently been established on a finite time interval. A natural question is whether such solutions can be continued globally. In this work, we derive a continuation criterion for this coupled system. Our analysis is based on an energy estimate at the level of material acceleration, derived under Serrin-type and Beale–Kato–Majda-type control assumptions. While in the incompressible setting, such control is sufficient to prevent finite-time blow-up, in the compressible regime it does not by itself ensure propagation of the full regularity required for strong solutions. To obtain a genuine continuation criterion, we impose a Beale–Kato–Majda Lipschitz-type control on the density and velocity gradients with stronger time integrability. In combination with the control framework underlying the acceleration estimate, we close a higher-order energy estimate and thereby prevent loss of strong-solution regularity. Consequently, the solution can be extended beyond a potential blow-up time, provided that the corresponding control norms remain finite. We further establish a weak-strong uniqueness principle for the system under the above conditional regularity criterion.
Read the full abstract

Representation Theory

Higher-level affine wreath product algebras

We define and study two new classes of algebras, called higher-level affine wreath product algebras and higher-level affine Frobenius Hecke algebras. They depend on a Frobenius superalgebra and are defined, respectively, as path algebras of the higher-level affine wreath product category and higher-level affine Frobenius Hecke category. Our constructions produce a broad range of new higher-level algebras under a unified framework. Special cases include higher-level analogues of the degenerate affine Hecke algebra and affine Sergeev algebras, both of which appear to be new.
Read the full abstract

Numerical Analysis

Rigid homotopies for sampling from algebraic varieties: a Waring structure complexity model

Polynomial system solving has seen major progress in both theory and practice over the past decade. A landmark achievement was addressing Smale's 17th problem, establishing average-case polynomial-time algorithms for computing approximate solutions of polynomial systems via homotopy continuation. Recent improvements in complexity bounds for these algorithms led to the development of rigid homotopy methods. In this article, we prove a new complexity result for rigid homotopies for polynomial systems with Waring representations of prescribed length. In addition, we provide the first computational experiments for rigid homotopies using a preliminary implementation.
Read the full abstract

Representation Theory

Super Krawtchouk Polynomials via Lie Superalgebras

Multivariate extensions of the Krawtchouk polynomials have been studied by numerous authors in recent decades by exploring new connections to probability, representation theory and quantum integrability. We develop a theory of multivariate super Krawtchouk polynomials using the representation theory of the general linear Lie superalgebra, extending results of the first author in the classical setting. Specifically, in the present work we generalize the classical Krawtchouk polynomials, prove their orthogonality, construct certain recurrence relations, and discuss their connections with zonal spherical functions arising from a fermionic Fock-space framework in quantum mechanics.
Read the full abstract

Statistics Theory

Thinned Quantile Shares are Universally Feasible

Quantile shares, introduced by Babichenko, Feldman, Holzman, and Narayan [STOC 2024], offer an ordinal, self-maximizing, and interpretable benchmark for fair division of indivisible goods, but their universal feasibility is known only conditional on the rainbow Erdős matching conjecture (EMC). Specifically, Babichenko et al. showed that assuming the rainbow EMC in the near-perfect matching regime, the $(1/2e)$-quantile share is universally feasible. In contrast, a simple argument shows that the $q$-quantile share can be infeasible for any $q > 1/e$. We introduce a one-parameter refinement of quantile shares, the $c$-thinned quantile share, obtained by thinning the inclusion probability in the random benchmark bundle by a factor of $c$ for a fixed constant $c\in(0,1]$. Our main result is that there exists a universal constant $c >0$ for which the $c$-thinned $e^{-c}$-quantile share is unconditionally universally feasible; this is best possible in the sense that for any $c \in (0,1]$, the $c$-thinned $q$-quantile share can be infeasible for any $q > e^{-c}$. Prior to this work, the only nontrivial share known to be universally feasible was Feige's residual maximin share. The thinning viewpoint also lets us remove the factor-two loss in the conditional result for the original quantile share: assuming the rainbow EMC, the $(1/e)$-quantile share is universally feasible.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Dynamic Quantum-Assisted Co-Design of Controller and Lyapunov Candidate Parameters for Nonlinear Systems

This paper proposes a dynamic quantum-assisted co-design framework for nonlinear closed-loop systems in which controller parameters and Lyapunov candidate parameters are redesigned jointly at successive decision epochs. Unlike conventional nonlinear control designs that typically tune controller gains offline and perform stability analysis separately, the proposed method embeds performance improvement and sample-based Lyapunov verification within a unified online optimization loop. The main novelty is a two-step computational structure that first contracts the continuous admissible search region around the current operating condition using a Black-Hole calibration procedure and then constructs a finite binary representation only over this calibrated region. The encoded objective is obtained from sampled nonlinear closed-loop evaluations and approximated by a local quadratic pseudo-Boolean surrogate, enabling an Ising-type Hamiltonian representation suitable for quantum-assisted optimization. Quantum imaginary time evolution is then used to explore the encoded Hamiltonian, and the resulting candidate bitstrings are decoded into continuous controller and Lyapunov parameters. To reduce dependence on the surrogate model, the decoded candidates are re-evaluated using the original nonlinear closed-loop cost and Lyapunov penalties before the final update is applied. The framework can accommodate sampled forms of different Lyapunov decay specifications by modifying the corresponding penalty and is numerically evaluated on first-order nonlinear consensus, second-order nonlinear consensus, and induction motor drive control examples. The implementation code used to generate the reported results is available at \href{https://github.com/LSU-RAISE-LAB/DQCLS-NS}{GitHub}.
Read the full abstract

Optimization and Control

Stochastic Optimal Linear Quadratic Controls with A Recursive Cost Functional in Infinite Horizon

This paper is concerned with a stochastic linear quadratic (LQ, for short) control problem with a recursive cost functional in an infinite horizon. A main difficult is well-posedness of the BSDE in $L^1$ and in infinite horizon. A notion of weighted $L^2$-stabilizability is introduced and characterized, which will lead to an equivalence of the optimal control problem having recursive cost functional with a classical LQ problem. Then all the results of classical problems for open-loop and closed-loop solvability of such an LQ problem can be translated, in terms of the solvability of a forward-backward stochastic differential equation and that of algebraic Riccati equation. Finally, the nonhomogeneous is discussed.
Read the full abstract

Differential Geometry

Volume of maximal representations into $\mathrm{SO}_0(2,3)$

We study the volume of maximal representations from a surface group into $\mathrm{SO}_0(2,3)$. We show that it is bounded from above, uniformly in the genus of the surface. We also prove that on the Gothen components, it is bounded from below by a strictly positive constant.

Information Theory · Cross-listed from quant-ph

Quantum Compression for Distributed Entanglement

We study compression strategies for multipartite entanglement distribution under uncertainty in the partitioning of the quantum state. When the partition is not known at the time of state preparation, we show that a joint design of the resource state and a family of compression schemes can increase the entanglement across partitions under a fixed transmission budget. We formulate this as a source coding problem and derive non-asymptotic upper and lower bounds on the achievable average entanglement subject to an average coding rate. We furthermore design an efficient method for jointly optimizing states and lossless compression maps by exploiting the inherent symmetry of weighted Dicke states. In the bipartite case, we propose practical constructions that closely approach the derived upper bound, and more generally we provide practical constructions for multipartite settings.
Read the full abstract

All authors Jan Østergaard, Shashi Raj Pandey, Christophe Biscio, Torben Bach Pedersen, Petar Popovski

Optimization and Control · Cross-listed from cs.LG

QUIVER: Cost-Aware Adaptive Preference Querying in Surrogate-Assisted Evolutionary Multi-Objective Optimization

Interactive multi-objective optimization systems face a budget allocation dilemma: one can spend resources on expensive objective evaluations or on eliciting decision-maker preferences that identify the relevant region of the Pareto set. Moreover, preference elicitation itself spans modalities with different information content and cognitive burden, ranging from cheap, noisy pairwise preference statements (PS) to richer but costlier indifference adjustments (IA). We study cost-aware optimization under an unknown scalarization and introduce QUIVER (Query-Informed Value Estimation for Regret), a surrogate-assisted evolutionary multi-objective optimizer that adaptively chooses between objective evaluations and heterogeneous preference queries. At each step, QUIVER selects the next action by maximizing the expected decision-quality improvement per unit total cost. Across DTLZ and WFG benchmarks under synthetic decision-maker models, QUIVER achieves the lowest final utility regret on challenging WFG problems (utility regret of 2.14 on WFG4, 2.82 on WFG9: a 25% improvement over baselines), outperforming all single-modality baselines. We analyze how the optimal mix of PS and IA adapts to problem difficulty: on easy problems (DTLZ2), QUIVER selects 80% PS queries; on hard problems (WFG9), it shifts to 35% IA queries. This adaptive modality selection demonstrates cost-aware preference learning in action.
Read the full abstract

Algebraic Geometry

Tropical resolutions of configuration hypersurfaces

Configuration polynomials generalize the Kirchhoff polynomial of a graph, as well as the Symanzik polynomials that appear in the denominators of Feynman integrands. The configuration hypersurfaces cut out by such polynomials are typically highly singular, which poses a challenge for the evaluation of Feynman integrals even in simplified settings. In this paper, we provide a two-step recipe for a resolution of singularities of any irreducible configuration hypersurface. We first consider the normalization of the Nash blow-up, which we identify with an incidence variety introduced by Bloch. This variety is typically still not smooth, but it is the closure of a smooth subvariety of a torus. The latter then a smooth, tropical compactification, using work of Tevelev. We construct explicitly such a compactification and a morphism to the normalized Nash blow-up for every configuration, described in terms of bipermutohedral matroid combinatorics introduced by Ardila, Denham and Huh. Along the way, we find that the normalized Nash blow-up of the configuration hypersurface has strongly $F$-regular singularities in positive characteristic. We deduce this by certifying $F$-rationality of its biprojective cone, and infer from it that the normalized Nash blow-up has rational singularities over the complex numbers.
Read the full abstract

All authors Daniel Bath, Graham Denham, Mathias Schulze, Uli Walther

Optimization and Control

Globally Solving Unbalanced Optimal Transport and Density Control for Gaussian Distributions

In this article, we study unbalanced optimal transport (UOT) and establish a control-theoretic dynamical extension, which we call the unbalanced density control (UDC), for a class of Gaussian reference measures. In the static setting, we consider UOT with quadratic transport cost and Kullback–Leibler penalties on the marginals relative to prescribed Gaussian measures. We show that the infinite-dimensional variational problem admits an exact Gaussian reduction, yielding a finite-dimensional optimization over masses, means, and covariances, together with a closed-form expression for the optimal transported mass. We then formulate UDC for discrete-time linear systems, where the initial and terminal state measures are imposed softly through KL penalties and the intermediate evolution is governed by controlled linear dynamics with quadratic control cost. For this problem, we prove that any feasible solution can be replaced, without loss of optimality, by a Gaussian initial measure and an affine-Gaussian control policy. This leads to an exact finite-dimensional reformulation and, after a standard covariance-steering lifting, to an SDP-based optimization for fixed mass, again coupled with a closed-form mass update. We further establish existence of optimal solutions and identify a sufficient condition under which the affine-Gaussian UDC policy is deterministic. These results provide globally optimal solution methods for both Gaussian UOT and Gaussian UDC. Finally, we illustrate our results with several numerical examples.
Read the full abstract

Analysis of PDEs

Fractional Vector Calculus and the Fractional Maxwell's Equations

We consider a fractional variant of Maxwell's equations, where the electric and magnetic fields are modeled as two-point fields. To formulate the system, we introduce a fractional curl operator that is compatible with the fractional divergence operator, ensuring the divergence-free condition. A key ingredient is a projection map $\Pi$ that reduces two-point fields to one-point fields. We also define a new fractional Sobolev space whose elements enjoy a fractional Helmholtz decomposition and observe that the projection $\Pi$ is a bijection in this space, which allows us to reformulate the problem entirely in terms of one-point fields. We then prove the well-posedness of the equations in one-point fields in weighted fractional Sobolev spaces, and deduce a corresponding well-posedness result for the two-points fractional Maxwell system. This constitutes a first necessary step towards the resolution of a scattering inverse problem for the fractional Maxwell's equations, which will be the topic of future work.
Read the full abstract

General Topology

On the Transitive Binary $G$-Spaces

Distributive subsets of the group of all invertible continuous binary operations on a topological space are considered, and it is proved that the subgroups generated by them are also distributive. A criterion for the distributivity of a binary action of a topological group $G$ on a space $X$ is obtained. The concept of transitive binary $G$-space is introduced, and a classification of transitive distributive binary $G$-spaces is given in the case of a compact group $G$.
Read the full abstract

Combinatorics

Conflict-Aware Seat Assignment in Classroom Environments

Classroom dynamics depend on various elements that influence teaching performance and learning activities. A key challenge is to determine the most effective seating plan, where students will seat in a specific classroom setting to achieve the best learning environment. This paper introduces the Student Seat Allocation Problem (SSAP) for strategically organizing student seating in traditional classrooms to minimize interpersonal conflicts. We propose a mathematical model and an Iterated Local Search (ILS) heuristic to solve the SSAP. Computational experiments demonstrated that ILS outperformed in more complex scenarios when compared to the results obtained by a commercial solver on the introduced mathematical model. ILS was particularly efficient in real and artificial instances that exhibited a higher number of conflicts.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LO

Probabilistic Floating-Point Round-Off Analysis via Concentration Inequalities

Floating-point round-off errors are ubiquitous in numerically intensive programs arising in fields such as scientific computing and optimization. As floating-point errors potentially lead to unexpected and catastrophic program failures, one must derive guaranteed round-off thresholds to ensure the correctness of these programs. However, deterministic round-off thresholds tend to be too conservative to be usable in practice, since they often involve large round-off errors that occur with small probability. Probabilistic thresholds relax deterministic ones by specifying that the probability of the round-off error exceeding a threshold is below a given confidence. In this work, we propose a novel approach to probabilistic round-off analysis, by applying concentration inequalities over the Taylor expansion from FPTaylor (TOPLAS 2018). A major obstacle in applying concentration inequalities is that the Taylor expansion involves absolute value operators that make the calculation of the expected values of the first order partial differential terms difficult. Our first step to overcome this obstacle is a sound over-approximation that removes the absolute value operators in polynomial expressions. Then, we show how to handle fractional expressions by a transformation into polynomial case. Finally, we show how to improve our approach with range partitioning. Our approach is scalable since the key computational part is the calculation of expected values of polynomial expressions with independent variables, for which the linear and independence properties of expectation boost the computation. Experimental results show that our approach is orders of magnitude more time efficient, while producing thresholds with comparable precision against the state of the art.
Read the full abstract

All authors Yichen Tao, Hongfei Fu, Jiawei Chen, Jean-Baptiste Jeannin

Geometric Topology

On the biggest purely non-free conformal actions on compact Riemann surfaces and their asymptotic properties

A continuous action of a finite group $G$ on a closed orientable surface $X$ is said to be gpnf (Gilman purely non-free) if every element of $G$ has a fixed point on $X$. We prove that the biggest order {$\mu(g)$}, of a gpnf-action on a surface of even genus $g \geq 2$, is bounded below by $8g$ and that this bound is sharp for infinitely many even $g$ as well. This provides, for even genera, a gpnf-action analog of the celebrated Accola-Maclachlan bound $8g+8$ for arbitrary finite continuous actions. We also describe the asymptotic behavior of $\mu$. We define $\mathcal{M}$ as the set of values of the form $$\widetilde{\mu}(g)=\frac{\mu(g)}{g+1},$$ and its subsets $\mathcal{M}_+$ and $\mathcal{M}_-$ corresponding to even and odd genera $g$. We show that the set $\mathcal{M}_+^d$, of accumulation points of $\mathcal{M}_+$, consists of a single number $8$. If $g$ is odd, then we prove that $4g \leq \mu(g)<8g$. We conjecture that this lower bound is sharp for infinitely many odd $g$. Finally, we prove that this conjecture implies that $4$ is the only element of $\mathcal{M}_-^d$, leading to $\mathcal{M}^d=\{4,8\}.$
Read the full abstract

Geometric Topology

Cyclic-Schottky strata of Schottky space

Schottky space ${\mathcal S}_{g}$, where $g \geq 2$ is an integer, is a connected complex orbifold of dimension $3(g-1)$; it provides a parametrization of the ${\rm PSL}_{2}({\mathbb C})$-conjugacy classes of Schottky groups $\Gamma$ of rank $g$. The branch locus ${\mathcal B}_{g} \subset {\mathcal S}_{g}$, consisting of those conjugacy classes of Schottky groups being a finite index proper normal subgroup of some Kleinian group, is known to be connected. If $[\Gamma] \in {\mathcal B}_{g}$, then there is a Kleinian group $K$ containing $\Gamma$ as a normal subgroup of index some prime integer $p \geq 2$. The structural description, in terms of Klein-Maskit Combination Theorems, of such a group $K$ is completely determined by a triple $(t,r,s)$, where $t,r,s \geq 0$ are integers such that $g=p(t+r+s-1)+1-r$. For each such a tuple $(g,p;t,r,s)$ there is a corresponding cyclic-Schottky stratum $F(g,p;t,r,s) \subset {\mathcal B}_{g}$. It is known that $F(g,2;t,r,s)$ is connected.In this paper, for $p \geq 3$, we study the connectivity of these $F(g,p;t,r,s)$.
Read the full abstract

Dynamical Systems

Calculating Domain of Attraction Boundary of Power Systems Based on the Gentlest Ascent Dynamics

The power system, a fundamental public utility, is increasingly important due to growing global electricity demand. Recent large-scale blackouts (e.g., Iberian Peninsula, UK) have raised concerns about transient stability under impact faults. Transient stability is determined by post-disturbance synchronizing capability of synchronous generators, formulated as identifying the domain of attraction (DOA) boundary of the asymptotically stable equilibrium. Using a benchmark model of synchronous-generator-dominated power systems, this report employs a gentlest ascent dynamics (GAD) method for 1-saddle points, an adjoint operator method for periodic orbits, and stable manifold algorithms to compute the DOA boundary. These algorithms transform DOA boundary determination into constructing unstable critical elements (saddle points and periodic orbits) and their stable manifolds. Theoretically, under certain assumptions we prove that the DOA boundary is the closure of the union of stable manifolds of index-1 critical elements, and establish a stability theory for a perturbed GAD system. Numerical experiments on two-machine and three-machine systems (with only saddle points or with periodic orbits) validate the effectiveness and accuracy. Results show the algorithms accurately capture the geometric structure of the DOA boundary, providing a new numerical tool for transient stability analysis.
Read the full abstract

All authors Sixu Wu, Chenmin Zhang, Aiqing Zhu, Yang Liu, Jianxi Lin, Yifa Tang

Number Theory

A new perspective on the rank of Mazur's Eisenstein Hecke algebra

Let $N, p \geq 5$ be primes such that $N \equiv 1 \bmod p$. We study the rank $r$ of the Hecke algebra that parametrizes modular forms of weight 2 and level $N$ that are Eisenstein modulo $p$. When $r$ is $2$ or $3$, we prove that $r-1$ equals the order of vanishing of the mod-$p$ reduction of a zeta element that interpolates Dirichlet $L$-values at $-1$, thereby recovering results of Merel and Lecouturier. This equality can fail in some cases when $r \geq 4$, and we provide a heuristic explanation of this failure. Our approach handles all of these cases uniformly by studying the analogous Hecke algebra in level $N^2$. When exactly one of $r-1$ or the order of vanishing equals $3$, we provide precise information about Galois orbits of cuspidal newforms in level $N^2$ that are Eisenstein modulo $p$.
Read the full abstract

Dynamical Systems

Smooth linearization of nonautonomous dynamics under general dichotomic behaviour

The main purpose of this paper is to formulate new conditions for smooth linearization of nonautonomous systems with discrete and continuous time. Our results assume that the linear part admits a very general form of dichotomy known as $\mu$-dichotomy and that the associated $\mu$-dichotomy spectrum exhibits appropriate spectral gap and spectral band conditions. We observe that our notion of $\mu$-dichotomy encompasses the classical notions of exponential, polynomial and logarithmic dichotomies as very particular cases. In particular, our result is in sharp contrast to most of the previous results in the literature which assumed that the linear part admits an exponential dichotomy. Our techniques exploit the relationship between $\mu$-dichotomy and exponential dichotomy via a suitable reparametrization of time.
Read the full abstract

Metric Geometry · Cross-listed from cs.DS

Optimal Zonotope Containment via Adaptive Gaussian Sampling

We investigate the convex-body containment problem $\max\{s >0 : s Z \subseteq Q\}$, where the outer body $Q \subseteq \mathbb{R}^d$ is described by a membership oracle and the inner body $Z \subseteq \mathbb{R}^d$ is a zonotope. Our main result is a sampling-based $O(\sqrt{d/\log d})$-approximation algorithm for this problem that matches the lower bound of $\Omega(\sqrt{d/\log d})$ by Khot and Naor in the oracle model. Starting from approximate Lewis position, the algorithm samples Gaussian directions and adaptively shortens and repositions the generators. Its analysis combines preservation of the support in a fixed direction with contraction of the corresponding functional after renormalization. Crucially, the algorithm works directly with the input generators and does not use zonotope sparsification. We complement this result with a universal $\Omega(\sqrt{d/\log d})$ lower bound holding for all full-dimensional zonotopes when the number of oracle queries is polynomial in $d$. Finally, we consider containment problems $\max\{s >0 : s K \subseteq Q\}$, for general convex bodies $K \subseteq \mathbb{R}^d$. A result of Naszódi on approximating $K \subseteq \mathbb{R}^d$ by a polytope implies a $\Theta(d/\log d)$ approximation algorithm in polynomial time when the centroid of $K$ is the origin. We show the tightness of this approximation factor in the oracle model via a reduction to the circumradius computation. Our lower bound holds for centrally symmetric convex sets, implying that Barvinok's optimal $O(\sqrt{d})$-approximation of a centrally symmetric convex body by a polytope with a polynomial number of vertices cannot be computed in polynomial time.
Read the full abstract

All authors Friedrich Eisenbrand, Thomas Rothvoss, Matteo Russo, Ruben Skorupinski

Algebraic Geometry

Étale Extensions of Unipotent Torsors

In this paper we study extension problems for torsors in positive characteristic. Let $F$ be a field of characteristic $p>0$ and $U/F$ be a unipotent algebraic group. As our first main result, we prove that every $U$-torsor defined over the generic point of a discrete valuation ring $\mathcal{O}_{K}$, containing a field $F$, extends to the normalization of $\mathcal{O}_{K}$ in some finite separable extension of its fraction field. We then globalize this result and prove that for $X/F$ a normal integral curve over an algebraically closed field $F$, every $U$-torsor over an open set $X^{\circ}\subseteq X$ extends to some ramified cover of $X$ which is étale over $X^{\circ}$. As an application, we are able to find isomorphisms between certain unipotent variants of Nori's fundamental group scheme for curves.
Read the full abstract

Analysis of PDEs

Boundary Hyperbolic Packets in Axisymmetric Euler Flow

We study hyperbolic side-wall packets for the axisymmetric Euler equations with swirl in a periodic cylinder. In the exact odd class, $\Gamma=ru^\theta$ and $G=\omega^\theta/r$ satisfy $D_t\Gamma=0$ and $D_tG=r^{-4}\partial_z(\Gamma^2)$, and the symmetry fixes the boundary point at which the relevant swirl and vorticity gradients are measured. We derive the five-dimensional side-wall Green-kernel expansion, its leading signed hyperbolic kernel, packet–core coupling, off-diagonal shear estimates, anisotropy and source-curvature identities, and a maximal conic-score formulation. Under a common admissible packet bootstrap these estimates imply the Dini system $D^+\mathfrak M\ge cB^2$, $B'\ge c\mathfrak M B$, and hence finite-time blow-up of the comparison amplitudes. The result is a conditional amplification criterion: it does not prove that one smooth Euler trajectory preserves all packet-dominance, tail, shear, anisotropy, and validity hypotheses until the comparison blow-up time. Establishing or refuting that persistence is the remaining problem for this mechanism.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

A Provably Convergent and Practical Algorithm for Gromov–Wasserstein Optimal Transport

Gromov–Wasserstein optimal transport (GWOT) aligns metric measure spaces by matching their within-domain relational structures, but large-scale GWOT remains challenging because its objective is nonconvex and projection onto the transport polytope is often solved only approximately in practice. This leads to a gap between practical projected-gradient implementations and convergence theory, which typically assumes exact projections. For squared-loss GWOT, we propose an inexact projected-gradient framework with a verifiable feasibility-residual-based inexact condition for the projection subproblem. This condition is directly computable and avoids unknown quantities such as the exact projection point. Under this implementable condition, we prove subsequential convergence to stationary points and, with a mild tolerance-decay condition, convergence of the whole sequence. The resulting method retains the simplicity and sparsity of projected-gradient schemes while providing rigorous convergence guarantees, turning projected-gradient methods into a principled and scalable approach for GWOT with provable reliability.
Read the full abstract

Probability

Error analysis for learning fractional stochastic differential equations with applications in neural approximations

This paper develops a framework for the error analysis in nonparametric model fitting of fractional stochastic differential equations based on discrete observations. We identify and quantify the main error sources – time discretization, coefficient approximation, and model fitting error – within a unified framework. Through Sobolev-type norms, we derive convergence rates that incorporate the regularity of trajectories, thereby capturing the interaction of these error components. To demonstrate the applicability of the theory, we introduce a training scheme for coefficient function estimation based on shallow neural networks and a recurrent architecture. Numerical experiments validate the theoretical findings and illustrate the effectiveness of the approach.
Read the full abstract

Dynamical Systems

Nonlinearizable embeddings of elliptic curves in rational surfaces

We show that for any smooth cubic in $\mathbb{P}^2$, there exists a dense $G_\delta$ set of configurations of 9 distinct points such that blowing up $\mathbb{P}^2$ at these 9 points, the strict transform of the cubic is not linearizable and has nontorsion normal bundle. This answers a problem raised by Ogus in 1975.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Topological subsystem bivariate bicycle codes with four-qubit check operators

High-rate bivariate bicycle (BB) codes are promising low-overhead quantum memories, but their stabilizer checks typically have weight $6$ or higher, making syndrome extraction challenging. We introduce subsystem bivariate bicycle (SBB) codes, a translation-invariant CSS subsystem construction that realizes BB-code logical structure using local weight-$4$ gauge measurements. Their stabilizer syndromes are inferred by multiplying the corresponding gauge outcomes. We further show that nonlocal stabilizers in translation-invariant CSS subsystem codes can be detected using a determinantal-ideal criterion based on the gauge-operator commutation matrix. When this criterion excludes nonlocal stabilizers, a finite-depth Clifford circuit decouples gauge qubits and identifies the protected subsystem with a corresponding BB stabilizer code. An SBB code is topological, meaning that it has no nontrivial local logical operators, if and only if the corresponding BB code is topological. A finite search yields low-overhead examples including $[[27,6,3]]$, $[[75,10,5]]$, and $[[108,12,6]]$; the latter encodes six times more logical qubits than a subsystem surface code at the same block length and distance. These results show how gauge degrees of freedom can make high-rate BB logical structure compatible with local weight-$4$ syndrome extraction.
Read the full abstract