Skip to main content
archive Search
Submit Donate Log in

Press Enter to search · Advanced search

Mathematics

  • New submissions
  • Cross-lists
  • Replacements

See recent articles

Showing new listings for Monday, 16 November 2026

Total of 554 entries
Showing up to 2000 entries per page: fewer | more | all

New submissions (showing 265 of 265 entries)

[1] arXiv:2611.17352 [pdf, html, other]
Title: Resurgence without the Borel Plane: Mellin-Barnes Summation and Analytic Stokes Reconstruction
Roberto Ricci (ENEA, Nuclear Department NUC-DTT, Frascati Research Center, Frascati, RM, Italy)
Comments: 35 pages
Subjects: Mathematical Physics (math-ph); High Energy Physics - Theory (hep-th)

We develop a route to resurgence without the Borel plane: sums of divergent perturbative series and their encoded nonperturbative monodromy are constructed directly in complex perturbative order. In the Analytic Umbral Framework (AUF), an analytic coefficient clock produces the sum through a Mellin-Barnes integral and its monodromy through a bare inverse Mellin transform. Neither a Borel transform nor continuation of a Borel germ is required for this construction. For Watson-admissible Gevrey clocks, the completion agrees with the canonical Borel-Laplace sum in the guaranteed directions. When the admissible aperture exceeds $2\pi$, the clockwise difference of adjacent logarithmic determinations is given by $2\pi i$ times the inverse-Mellin carrier. This carrier is also the AUF completion of a null clock and is flat on the overlap. The sum and its aggregate monodromy are thus obtained ''in one shot'', before resolving individual actions and fluctuation series.
Euler's equation, zero-dimensional quartic models, the scaled Gamma function and a solvable $O(4)$ toy model exemplify the procedure, and show how further analysis recovers directional Stokes variations. The lognormal benchmark extends the construction beyond every finite Gevrey order: no finite-order Borel transform gives a convergent germ, yet explicit clock-selection conditions yield an AUF completion and a nonzero ordinary flat carrier. Distributed relaxation supplies a physical realization of this growth class. AUF therefore both reconstructs familiar resurgent information without Borel-plane continuation and extends completion beyond finite-order Borel-Laplace summation.

[2] arXiv:2611.17357 [pdf, html, other]
Title: Log-concavity of rank and crank statistics for integer partitions
Jianxi Mao, Wenle Shi
Comments: 74 pages
Subjects: Combinatorics (math.CO)

Let $M(m,n)$ and $N(m,n)$ denote the numbers of partitions of $n$ with crank $m$ and rank $m$, respectively. Ji and Zang [Adv. Math. 2021] conjectured that $M(m,n)$ is log-concave in $m$ for $n\ge72$ and $|m|\le n-72$, and that $N(m,n)$ is log-concave in $m$ for $n\ge73$ and $|m|\le n-73$. In this paper, we prove these two conjectures.

[3] arXiv:2611.17358 [pdf, html, other]
Title: Automatic $n$-dimensional recurrences over finite $p$-groups with negative predecessor coordinates
Bogdan Dumitru, Mihai Prunescu
Subjects: Combinatorics (math.CO)

We study $n$-dimensional recurrences on $\mathbb{N}^n$ over finite $p$-groups. The rules are ordered products of group endomorphisms, with a $p$-automatic additional sequence and compatible $p$-automatic boundary data. For finite, nonempty, lexicographically positive predecessor sets, we prove automaticity whenever at most one coordinate contains entries of both signs. This covers all such systems for $n=1$ and $n=2$. For $n\ge3$, lexicographic positivity alone is insufficient: a fixed three-dimensional recurrence with a single nonzero boundary value is nonautomatic in base $p$ for every prime $p$. For nonnegative predecessors, we give a direct automaton construction and explicit state bounds in the abelian case. Negative coordinates are treated using algebraic power-series division, lifting modulo prime powers, central subgroups and boundary-preserving coordinate changes. A two-parameter family with a specified rule and a single boundary seed admits an exact automaticity criterion modulo prime powers. We also give nonabelian examples and finite computational certificates, including a proof of a previously proposed formula counting nonzero Delannoy residues modulo $27$.

[4] arXiv:2611.17360 [pdf, other]
Title: Positive Dual Certificates for Real Separated Subset Sums: Chamber Optimality of the Conway-Guy and Bohman Sets, and Exact Values up to Eight
Esther Notik
Comments: 14 pages. Certificate data and checking programs: this https URL
Subjects: Combinatorics (math.CO)

Let $f_R(n)$ be the least possible largest element of a set of $n$ positive reals whose $2^n$ subset sums are pairwise at least 1 apart, and let $f_Z(n) \ge f_R(n)$ be the corresponding integer quantity of the Erdős distinct subset sums problem. Fixing the signs of all signed relations $\varepsilon\cdot x$, $\varepsilon \in \{-1,0,1\}^n$, decomposes the real problem into polyhedral chambers, on each of which it is a linear program. We prove that for every $n$ the Conway-Guy set is the unique optimum of its chamber. The proof is an explicit positive dual certificate consisting of $n$ signed relations that are tight at the Conway-Guy set and unit lower triangular in gap coordinates; the relations are described by blocks of consecutive coordinates together with the positions $n - k(k+1)/2$, and tightness reduces to an identity of the Conway-Guy sequence proved by induction. We then show, by a branch-and-bound over chambers in which every leaf carries an exact rational certificate, that $f_R(n) = f_Z(n)$ for all $n \le 8$; in particular $f_R(7) = 44$ and $f_R(8) = 84$. We then prove the same for both of Bohman's families, which first improve on Conway-Guy at $n = 12$ ($1159 < 1164$): every Bohman set is the unique optimum of its chamber, with a block-triangular certificate given by explicit formulas. Finally we exhibit chambers whose optimal vertex is not an integer point.

[5] arXiv:2611.17370 [pdf, html, other]
Title: Algebra-Valued Yang-Mills-Type Theories: Polynomial Obstructions and Holonomy Reductions
Yuri Ximenes Lecca, Willian Goulart Gomes Velasco
Subjects: Mathematical Physics (math-ph); High Energy Physics - Theory (hep-th); Differential Geometry (math.DG); Rings and Algebras (math.RA)

We study algebra-valued Yang-Mills-type ($A$-YMT) theories on a smooth $n$-manifold $M$, where connections take values in an $\mathfrak{m}$-graded algebra $(A, *)$ and descend to an associated bundle $E_A = P \times_\rho A \to M$. We derive the field equations, gauge transformations, and generalized Bianchi identities, showing that affine Ehresmann compatibility forces the vertical image of $\mathfrak{g}$ into the Lie nucleus $\mathcal{N}_{\mathrm{Lie}}(A)$ of $[x,y]_* = x*y - y*x$, and that gauge covariance and the Bianchi identity are obstructed precisely by the Jacobiator $\mathrm{Jac}_{[\cdot,\cdot]_*}$ (leaving principal $G$-gauge symmetries anomaly-free). We then prove obstructions in three settings. First, internal-product Chern-Weil and self-dual $A$-YMT functionals vanish in weak $(2,s)$-solvable algebras, invariant under $(Q,S)$-splitting extensions. Second, in reductive Cartan-Yang-Mills theories on $A = \mathbb{R}^k \oplus \mathfrak{h}$, quartic-block parenthesization yields a strict cutoff at $n \ge 8$, while binary-tree halving yields an exact Jacobsthal-number cutoff ($n - 4 \notin \bigcup_{r \ge 3}\{2 J_r, J_{r+1}\}$, plus rank vanishing for $n \ge k + 5$). We catalog Berger holonomy reductions for $4 \le n \le 7$, proving an on-shell vanishing (torsion-free) vs. off-shell survival (torsionful) dichotomy in 4D for $U(2)$ and $SU(2)$ connections---via $e \curlywedge_\rtimes (e \curlywedge_\rtimes \Omega_\omega) = \frac{1}{2}(e \curlywedge_\rtimes e) \curlywedge_\rtimes \Omega_\omega$---and in 7D for $G_2$-connections. Third, we prove an associator-quotient collapse and Jacobiator vertex dichotomy for odd-dimensional internal $A$-Chern-Simons theories, with applications to $A$-$BF$ theories, octonionic and reductive Higgs Proca mass spectra, and reductive dualities.

[6] arXiv:2611.17371 [pdf, html, other]
Title: Counting Second-Order Schreier Sets with Minimum 2
Dongho Kim
Comments: 16 pages
Subjects: General Mathematics (math.GM)

A finite nonempty set $X \subset \mathbb{Z}_{>0}$ is (first-order) Schreier if $|X| \leq \min X$. These Schreier sets can be generalized recursively to higher-order Schreier sets, and we specifically investigate the second-order Schreier sets. We show that the count of second-order Schreier sets with minimum element $2$ and maximum element $n+4$ is one more than the $n^\text{th}$ term of the convolution of the Fibonacci numbers $F_1, F_2, \ldots$ with $F_2, F_3, \ldots$ (given by Sequence A023610 in the OEIS).

[7] arXiv:2611.17372 [pdf, html, other]
Title: Calculation of Stiefel fractions via Riemann thetas
Andrei Bogatyrev, Timur Garaev
Comments: 13 pages, 6 figures
Subjects: Complex Variables (math.CV)

Stiefel fraction is a deformation of Zolotarev one which allows to solve certain three band extentions of Zolotarev approximation problem. We propose an efficient computational approach for Stiefel's solution based on genus two Riemann theta functions. This allows us to visualise the domain in the space of three band problems corresponding to Stiefel's solutions.

[8] arXiv:2611.17373 [pdf, html, other]
Title: Smale's mean value constant (1981) equals 4
Dave Goel
Comments: 11 pages, 3 figures. A Lean 4 proof of the main theorem: this https URL . An expanded version, with further results: this https URL
Subjects: Complex Variables (math.CV)

For a complex polynomial $p$ of degree $d\ge 2$ with $p(0)=0$ and $p'(0)\ne 0$, let $S(p)$ be the minimum of $|p(c)/(c\,p'(0))|$ over the critical points $c$ of $p$, and let $K(d)$ be the supremum of $S(p)$ over all such $p$ of degree $d$. In 1981 Smale proved that $K(d)\le 4$ for every $d$, and asked whether $4$ can be replaced by $1$. We prove that Smale's mean value constant $\sup_dK(d)$ equals $4$ and that $K(d)\to4$ as $d\to\infty$, combining a reduction due to Jatar and Ng with an explicit construction. In particular, $4$ cannot be replaced by any smaller constant. Each $K(d)$ is known to be below $4$, so the supremum is not attained. The main result has also been formalized in the Lean 4 proof assistant.

[9] arXiv:2611.17375 [pdf, html, other]
Title: The four-dimensional Borsuk number is five or six
Logan R. Chalmers
Comments: The main theorem is formalised in Lean 4 using only the standard axioms of propositional extensionality, classical choice, and quotient soundness. Available at doi:https://doi.org/10.5281/zenodo.23966881
Subjects: Metric Geometry (math.MG)

Can every set of diameter one in four dimensions be split into at most five parts of smaller diameter? Three parts suffice in the plane and four in three-dimensional space. In four dimensions five parts are sometimes necessary. We prove that six always suffice, improving the previous upper bound of seven. For small circumradius we use six cones. For large circumradius five balls meet every diametral pair of a compact set. At intermediate radii we bound the diameter of each part by the diameter of a rational polytope. The theorem is formalised in Lean.

[10] arXiv:2611.17378 [pdf, html, other]
Title: A $19/5$ lower bound for the four-dimensional Erdős box problem
Dean Matthew Menezes
Comments: 5 pages
Subjects: Combinatorics (math.CO)

For every power $q\ge2$ of~$2$, we construct a box-free subset of $[q^5]^4$ with $q^{19}$ points, improving the lower-bound exponent in the four-dimensional Erdős box problem from $15/4$ to $19/5$. In fact, $[q^5]^4$ partitions into $q$ isomorphic box-free sets. The proof uses a finite-field rectangle lemma and orthogonality in a four-dimensional bilinear space. We also deduce a uniform bound $f_4(n)\ge2^{-19/20}n^{19/5}$ and a lower bound for grid-coloring numbers.

[11] arXiv:2611.17379 [pdf, html, other]
Title: Region Coloring of Spatial Graphs using Knot-theoretic Ternary Quasigroups
Mitsuru Kuramoto
Subjects: Geometric Topology (math.GT)

We construct coloring conditions around vertices for region colorings of unoriented spatial graph diagrams by knot-theoretic ternary quasigroups. These conditions require cyclic products of left and right operators around each vertex to be the identity. We prove that the resulting coloring sets are preserved under the generalized Reidemeister moves and relate our construction to the palette framework. We show that the vertex coloring conditions are automatic for Dehn tribrackets and determine the associated palettes for unoriented Alexander tribrackets. We also introduce an additional restriction on vertex colorings that is preserved under the fifth Reidemeister move for every unoriented knot-theoretic ternary quasigroup. This restriction gives rise to further coloring invariants for Dehn tribrackets and unoriented Alexander tribrackets.

[12] arXiv:2611.17380 [pdf, html, other]
Title: Toward a Holographic Representation Theory of the Bosonic de Sitter Discrete Series
Maryam Bajalan, Jean-Pierre Gazeau, Hamed Pejhan
Comments: 27 pages. Contribution to the proceedings of the 36th International Colloquium on Group Theoretical Methods in Physics (Group36), Valladolid, Spain, 2026
Subjects: Mathematical Physics (math-ph); High Energy Physics - Theory (hep-th); Representation Theory (math.RT)

We propose a program toward a holographic representation theory of the non-scalar bosonic discrete series $\Pi^\pm_{p,q}$, $p,q\in\mathbb{N}$, $1\leqslant q\leqslant p$, of the de Sitter ($\mathrm{dS}_{4}$) group $G=\mathrm{SO}_0(1,4)$. The proposal exploits two complementary realizations of the same unitary irreducible representation (UIR): a bounded-domain realization on an open ball $\mathbb{B}$ modeling the hyperbolic space $G/\mathrm{SO}(4)$, with $\partial\mathbb{B}\simeq\mathbb{S}^{3}$, and a covariant spacetime realization on $\mathrm{dS}_{4}$, with conformal boundaries $\mathscr{I}^{\pm}\simeq\mathbb{S}^{3}$, in which the physical UIR is obtained through the corresponding gauge reduction. This leads to two boundary constructions and an explicit compatibility problem,
\begin{align*}
\mathbb{B}
\;\overset{?\mathrm{hol}}{\longleftrightarrow}\;
\partial\mathbb{B}\simeq\mathbb{S}^{3}
\quad\overset{?}{\simeq}\quad
\mathscr{I}^{\pm}\simeq\mathbb{S}^{3}
\;\overset{?\mathrm{hol}}{\longleftrightarrow}\;
\mathrm{dS}_{4} \,.
\end{align*}
The two outer problems seek explicit intertwiners between the bulk and boundary realizations, with their invariant norms, constraints, and physical quotients properly identified. The middle problem asks how to construct and normalize a unitary intertwiner between the two boundary realizations once both have been shown to carry the same UIR. The bounded picture exposes the unitary and harmonic structure of the representation, while the spacetime picture makes its covariant and gauge-theoretic structure manifest, allowing the two constructions to constrain and illuminate one another. The established scalar family $\Pi_{p,0}$, $p\in\mathbb{N}$, with its spherical realization on $\mathbb{S}^{3}$, provides the guiding prototype. Particular attention is given to ...

[13] arXiv:2611.17382 [pdf, html, other]
Title: Erratum to Power boundedness and related properties for weighted composition operators on $\mathscr{S}(\mathbb{R}^{d})$, Journal of Functional Analysis 288 (2025), 110745
Vicente Asensio, Enrique Jordá, Thomas Kalmes
Comments: 6 pages; comments welcome. Erratum to arXiv:2405.01018
Subjects: Functional Analysis (math.FA)

As was kindly pointed out to us by S. Li, the proofs of Theorem 2.11 and Lemma 3.1 in our original paper contain errors that require modifications of the corresponding statements. We also correct a gap in the proof of Lemma 2.1, whose statement remains valid. Furthermore, we explain the consequences for several subsequent results and provide the necessary corrections to their statements and proofs.

[14] arXiv:2611.17383 [pdf, html, other]
Title: Remarks on Souriau's Geometric Thermodynamics for Weak Two-Dimensional Euler Flows
Jean-Pierre Magnot
Subjects: Mathematical Physics (math-ph); Fluid Dynamics (physics.flu-dyn)

We examine infinitesimal symmetries of relative entropy on low-regularity vorticity spaces and compare them with symmetries of stationary laws of weak two-dimensional Euler trajectories. Relative-entropy invariance under sample-space transformations is equivalent to preservation of the reference law; the corresponding weak infinitesimal condition is a vanishing reference-divergence identity. White-noise vorticity has an infinite-dimensional family of such symmetries, generated by smooth area-preserving transport. At the level of path laws, however, marginal entropy symmetries need not preserve temporal correlations. We first give a continuous Gaussian counterexample, including its infinitesimal form. We then establish a counterexample directly for stationary white-noise weak Euler path laws: explicit non-isometric area-preserving shears preserve the white-noise marginal but cannot preserve an Euler path law satisfying the standard symmetrized weak vorticity equation. We also examine the reduction of guaranteed entropy symmetries under conditioning by renormalized energy. These observations distinguish thermodynamic symmetry, Hamiltonian covariance, and statistical path dynamics without asserting a selection principle for nonunique weak solutions.

[15] arXiv:2611.17392 [pdf, other]
Title: Composition operators on weighted Beurling--Sobolev spaces
Stéphane Charpentier (I2M), Rachid Zarouf (ADEF)
Subjects: Functional Analysis (math.FA)

Given a function $\varphi:\D\to \D$ holomorphic in a neighborhood of the closed unit disk $\overline{\D}$, we study the matrix \[ A_\varphi = \big(\widehat{\varphi^n}(k)\big)_{n,k\geq 0}. \] We obtain a complete characterization of those $\varphi$ for which $A_\varphi$ acts boundedly from $\ell^p$ to $\ell^q$, $p,q\in [1,\infty]$. These results can be reformulated in terms of composition operators, providing a complete description of the symbols $\varphi$ holomorphic in a neighbourhood of $\overline{\D}$ that induce a bounded composition operator $C_\varphi:f\mapsto f\circ \varphi$ between two possibly different Beurling--Sobolev spaces. In particular, we prove that $C_\varphi$ is bounded on $\ell_a^p$ for some $p\neq 2$ if and only if it is bounded on every $\ell_a^p$, $p\in [1,\infty]$, if and only if $\varphi$ satisfies an analytic condition at the points of $\overline{\D}$ where it touches the unit circle. Extensions to weighted Beurling--Sobolev spaces are also provided.

[16] arXiv:2611.17399 [pdf, html, other]
Title: Depth-0 supercuspidal L-packets of tame covers
Nhat Hoang Le, Yifei Zhao
Comments: 138 pages, comments welcome!
Subjects: Representation Theory (math.RT); Number Theory (math.NT)

We generalize DeBacker and Reeder's construction (or rather, its refinement by Kaletha) of depth-0 supercuspidal L-packets to tame covers of unramified reductive groups defined by étale levels. These include, in particular, all tame covers associated to Brylinski-Deligne data. We prove that our L-packets satisfy invariance of formal degrees and an appropriate notion of stability.

[17] arXiv:2611.17419 [pdf, html, other]
Title: Sasakian Hodge Numbers of Calabi-Yau Links
Edward Hirst, Henrique N. Sá Earp, Tomás S. R. Silva
Comments: 44 pages, 3 figures
Subjects: Algebraic Geometry (math.AG); High Energy Physics - Theory (hep-th); Differential Geometry (math.DG)

The link of an isolated weighted homogeneous hypersurface singularity whose degree equals the sum of its weights is a Sasakian manifold that admits a contact Calabi-Yau structure, and its Sasakian Hodge numbers are dimensions of graded pieces of the Milnor algebra of the defining polynomial. In earlier work these numbers were computed with Gröbner bases for the $7$-dimensional links of $7549$ of the $7555$ weighted Calabi-Yau threefold links, and two conjectures were raised from the data. The first asserts that polynomials with the same weights have Milnor algebras whose relevant graded pieces have equal dimensions; the second asserts that the Sasakian Hodge number $h^{2,1}_S$ of the link is bounded above by the Hodge number $h^{2,1}$ of the base Calabi-Yau threefold. Both conjectures are proved here. The first holds for every polynomial with an isolated singularity, because its partial derivatives form a regular sequence; an independent derivation of the Sasakian Hodge numbers by sheaf cohomology on the leaf-space orbifold is also given. For the second, the stringy Hodge numbers of the Calabi-Yau orbifold are shown to bound the middle Sasakian Hodge numbers in every dimension $n\ge2$, and for $n\ge3$ the gap in $h^{n-1,1}$ is shown to be a sum of geometric genera of loci of orbifold points; for threefolds the bound is attained exactly when all curves of orbifold points are rational. The resulting closed formulae give the Sasakian Hodge numbers of the six $7$-dimensional links left open in the earlier work and complete datasets for all $95$ five-dimensional K3 links and all $1\,100\,055$ nine-dimensional Calabi-Yau fourfold links; for the K3 links they recover the previously known second Betti numbers.

[18] arXiv:2611.17426 [pdf, html, other]
Title: Hierarchical hyperbolicity of Coxeter groups
Christopher H. Cashen, Michelle Chu, Jing Tao
Comments: 28 pages
Subjects: Group Theory (math.GR)

We show that for every finite rank Coxeter system, the Coxeter group is hierarchically hyperbolic relative to its nonhyperoctahedral irreducible higher rank affine parabolic subgroups. This is sharp---the Coxeter group admits a hierarchically hyperbolic group structure if and only if it has no such parabolic subgroups, and we give a complete diagrammatic characterization of when this is true. Moreover, this condition is equivalent to the existence of a coarsely equivariant coarse median on the Coxeter group.
We also show that the Coxeter group is virtually a colorable hierarchically hyperbolic group. This is achieved by passing to a congruence subgroup of the Tits representation.
As consequences, the Davis complex is a hierarchically hyperbolic space and the group admits a coarse median of rank equal to its algebraic rank. Furthermore, the Coxeter group is quasimedian quasiisometric to a finite dimensional CAT(0) cube complex and is virtually coarsely injective.
Two appendices prove results of independent interest that are not Coxeter-specific. The first promotes a relative HHS structure with HHS peripheral coordinate spaces to an HHS structure. The second shows that a virtually Abelian group admits a coarsely equivariant coarse median precisely when it is hyperoctahedral.

[19] arXiv:2611.17436 [pdf, html, other]
Title: A BMO Extension of Oskolkov's Criterion for Rectangular Trigonometric Fourier Sums
Ushangi Goginava
Subjects: Classical Analysis and ODEs (math.CA)

We give a sufficient condition in terms of sectional BMO for almost everywhere Pringsheim convergence of rectangular trigonometric Fourier sums. For continuous functions, the condition includes Oskolkov's criterion, and an example shows that the inclusion is strict.

[20] arXiv:2611.17443 [pdf, html, other]
Title: $A_1^{(1)}$-Grounded partitions at levels $1$ and $2$, Part II: affine crystal structure
Benedek Dombos, Jihyeug Jang
Comments: This is the second part of a revised version of the previous manuscript: arXiv:2508.02664
Subjects: Combinatorics (math.CO); Representation Theory (math.RT)

Grounded partitions are coloured partitions with difference conditions, introduced by Dousse and Konan, that are in bijection with the paths of the Kyoto path model of Kang, Kashiwara, Misra, Miwa, Nakashima and Nakayashiki. We describe the affine crystal structure on the grounded partitions arising from the level $1$ and level $2$ perfect crystals of type $A_1^{(1)}$. At level $1$, grounded partitions are naturally identified with $2$-restricted partitions, and the affine crystal structure is given by Kleshchev's modular branching rule for symmetric groups in characteristic $2$. At level $2$, we give explicit bracketing rules which make grounded partitions into affine crystal graphs of highest weights $2\Lambda_0$, $\Lambda_0+\Lambda_1$, and $2\Lambda_1$. We prove this by constructing explicit graph isomorphisms with the asymptotic model of Ariki and Mathas, whose vertices are Kleshchev multipartitions arising from Ariki-Koike algebras. Finally, we erase the $0$-arrows, which leaves the crystal graphs of the restrictions to the Levi subalgebra, and decompose them into finite strings. This decomposition gives new $q$-series identities at levels $1$ and $2$.

[21] arXiv:2611.17444 [pdf, html, other]
Title: Dispersive decay for the modified Benjamin-Ono equation with small data
Allison Byars
Comments: 41 pages
Subjects: Analysis of PDEs (math.AP)

We study the modified Benjamin-Ono equation for small, localized initial data where no solitons arise, and prove a dispersive estimate. Unlike the standard Benjamin-Ono equation, the modified version is not known to be completely integrable, so we cannot rely on integrable systems tools. First, to manage the nonlocal Hilbert transform in the linear part of the equation, we project the equation to positive and negative frequencies. We then combine wave packet testing of Ifrim-Tataru, the Klainerman-Sobolev vector field method, and a bootstrap argument.

[22] arXiv:2611.17445 [pdf, html, other]
Title: A Cut Finite Element Method with Boundary Value Correction for Robin, Neumann and Interface Conditions
Erik Burman, Peter Hansbo, Mats G. Larson
Subjects: Numerical Analysis (math.NA)

We extend the cut finite element method with boundary value correction of Burman, Hansbo and Larson [Math.\ Comp.\ 87 (2018) 633--657] to Robin and Neumann conditions and to interface problems with imperfect bonding. The formulation retains a piecewise affine boundary for all integration, while using the exact geometry only at boundary quadrature points.
The correction uses Taylor expansions of the solution and its gradient along the discrete normal, with the exact normal used to evaluate the transported flux. At an interface, a further correction to the normal flux jump accounts for the difference between these two normals. Under the stated trace and Poincaré bounds, the corrected form is an $O(h^{1/2})$ perturbation of a symmetric form, whose matrix can therefore be used as a preconditioner.
For a fixed finite Robin coefficient, we obtain the energy error bound $C_\beta(h^p+\delta_h^{m+1})$, whereas the bound uniform in the Robin coefficient is $C(h^p+h^{-1/2}\delta_h^{m+1})$, provided the Poincaré constant is uniform. With $\delta_h=O(h^2)$, the sufficient Taylor orders are therefore $2m+2\ge p$ and $2m+\frac32\ge p$, respectively. Numerical examples for $p=1,2,3$ illustrate these rates and the effect of the flux-jump correction in the interface problem.

[23] arXiv:2611.17446 [pdf, html, other]
Title: Effectively nuclear C*-algebras
Christopher J. Eagle, Isaac Goldbring, Timothy H. McNicholl, Russell Miller
Comments: 30 pages. Comments welcome!
Subjects: Operator Algebras (math.OA); Logic (math.LO)

We study the computable content of nuclearity for $C^*$-algebras. We show that nuclearity effectivizes automatically: a presentation of a $C^*$-algebra is effectively nuclear, in the sense that the completely positive approximations witnessing nuclearity can be computed uniformly from the data they approximate, if and only if it is a computable presentation of a nuclear $C^*$-algebra, and likewise for the effectivization of the Choi--Effros form of nuclearity. The main tool is an effective version of the Arveson extension theorem: we prove that the $n$-th matrix numerical range of a tuple from a computable presentation is computably compact, uniformly in all of its data, and deduce an algorithm which converts an approximately attainable tuple of matrices into a computable unital completely positive map attaining it. A byproduct is that the computable states of any computable presentation of a unital $C^*$-algebra are weak$^*$-dense in its state space.
We also prove that the Cuntz algebras $\mathcal{O}_n$ are computably categorical and obtain an effective form of Kirchberg--Phillips absorption. By contrast with the conditions above, we do not know whether every computable presentation of a nuclear $C^*$-algebra admits a computable embedding into $\mathcal{O}_2$ with a computable conditional expectation; we answer this affirmatively for commutative $C^*$-algebras, for AF algebras, and, by a dynamical argument using invariant states, for the group $C^*$-algebras of a class of amenable groups including all finitely presented residually finite ones. Finally, we show that the set of indices of computable presentations of nuclear $C^*$-algebras is $\Pi^0_2$, and that the corresponding set for c.e. presentations is $\Pi^0_2$-hard; the latter rests on a result of independent interest, namely that amenability of computable groups is $\Pi^0_2$-complete within the class of computable groups.

[24] arXiv:2611.17447 [pdf, html, other]
Title: Distributionally Robust Risk Evaluation with Low-Rank Perturbations
Linglingzhi Zhu, Dongze Wu, Yao Xie
Subjects: Optimization and Control (math.OC); Machine Learning (stat.ML)

We study distributionally robust risk under perturbations restricted to low-rank matrices whose row and column spaces are shared across observations, focusing on how much worst-case risk this restriction sacrifices and how to compute the restricted worst case. Under moment or Wasserstein budgets, we derive quantitative bounds on the gap between the unrestricted and low-rank worst-case risks, characterize when the gap vanishes, and identify the smallest lossless row and column dimensions. To generate worst-case perturbations, we apply projected gradient ascent to a curvature-corrected concave problem and derive computable risk certificates. We establish global sublinear convergence for the corrected objective and linear convergence to a worst-case distribution when the budget constraint is sufficiently active.

[25] arXiv:2611.17457 [pdf, html, other]
Title: Polynomial integrals and Poisson structures of the Pais-Uhlenbeck oscillator
Ilmar Gahramanov, Gulmammad Mammadov
Comments: 8 pages
Subjects: Mathematical Physics (math-ph)

We classify the autonomous polynomial integrals of the nondegenerate fourth-order Pais-Uhlenbeck oscillator. For a rational frequency ratio $m:n$ in lowest terms, the two sector energies together with the real and imaginary parts of a single ladder product generate all polynomial integrals, subject to one defining relation. The smallest total degree of an integral not expressible through the sector energies is $m+n$, and this bound is attained. For an irrational ratio only polynomials in the sector energies are conserved. In normal-mode variables the commensurate case is the negative oscillator resonance, and the classification realizes its invariant theory in the original higher-derivative variables. Two compatible Poisson structures generate the same dynamics with an indefinite and a positive-definite Hamiltonian. They induce different brackets on the same physical generators. We show that diagonal rescalings of the generators identifying the two abstract Poisson algebras exist only when $m$ or $n$ is even, and that none of them preserves the physical domain of nonnegative sector energies. Finally, we express the generators in terms of the original coordinate and its first three derivatives. The classical multiplier identity gives their variational characteristics in closed form and shows that the additional resonant integrals cannot arise from point variational symmetries.

[26] arXiv:2611.17465 [pdf, html, other]
Title: Dimension bounds for higher Bruhat orders
Daria Poliakova
Comments: 13 pages, 3 figures
Subjects: Combinatorics (math.CO)

We study the Dushnik-Miller dimension of higher Bruhat orders. For the inclusion order $B_{\mathrm{inc}}(n,k)$, with $k$ fixed, we prove that the order of dimension growth is $n^k$, by exhibiting standard examples for the lower bound and explicit systems of coordinates for the upper bound. A recent Turán-system construction of Gao, Kuang, Pikhurko and Wang gives an upper coefficient within a factor smaller than $4$ of the lower coefficient. For the genuine higher Bruhat order $B(n,k)$, we construct for every fixed $k\ge3$ a standard example of order $n^{2k+1}$. We leave it open whether a polynomial upper bound on this dimension exists.

[27] arXiv:2611.17473 [pdf, html, other]
Title: CAT(0) Coxeter cell complexes, Bipodality and the Parallel Wall Property
Carl Kristof-Tessier
Comments: 16 pages, 8 figures
Subjects: Group Theory (math.GR)

Coxeter cell complexes are a simultaneous generalization to cube complexes and the Davis complex of a Coxeter group. We show that 1-skeleta of CAT(0) Coxeter cell complexes isometrically embed into a CAT(0) cube complex. When the resulting cube complex is finite dimensional, we show that the condition of bipodality (satisfied by both CAT(0) cube complexes and Davis complexes of Coxeter groups) implies local finiteness of the cubulation. To this end, we show a Parallel Wall Theorem for bipodal CAT(0) Coxeter cell complexes satisfying a uniform bound on the size of a collection of pairwise intersecting walls. In particular, our methods give a new, purely geometric proof of the Parallel Wall Theorem for Coxeter groups.

[28] arXiv:2611.17475 [pdf, html, other]
Title: Forcing global $Π^2_n$ uniformization with or without projective determinacy
Stefan Hoffelner
Subjects: Logic (math.LO)

We construct a set-forcing extension of $L$ which has the same reals as $L$ and satisfies the $\Pi^2_n$-uniformization property for every $n\geq1$. Assuming $\omega$ Woodin cardinals and a measurable cardinal above them, we also obtain a forcing extension of $L(\mathbb R)^{M_\omega}$ which has the same reals and satisfies projective determinacy together with the $\Pi^2_n$-uniformization property for every $n\geq1$.

[29] arXiv:2611.17476 [pdf, html, other]
Title: Ozone groups and fixed rings of double Ore extensions
Andrés Rubiano
Comments: 24 pages
Subjects: Quantum Algebra (math.QA)

We determine centers of two families of four-dimensional double Ore extensions without torsion assumptions, restricting to $f\ne0$ in $\mathcal O$. On the PI locus of $\mathcal K$, we classify the ozone groups and obtain normal commutative fixed rings of generic degree two over the center, including a nonmonogenic example. For an odd-torsion subfamily of $\mathcal O$, independent odd orders $n\geq1,m>1$ yield ozone group $C_n^2\times C_2^2$, PI degree $2nm$ and fixed-algebra PI degree $m$, with unchanged center. A PI specialization of $\mathcal G$ has trivial ozone group.

[30] arXiv:2611.17477 [pdf, html, other]
Title: First-order characterizations of strong quasiconvexity with the exact modulus
John Matos Ascona, Jackeline C. Huaccha Neyra, Lizet Santa Cruz Calderón, Heraclio López-Lázaro
Comments: 21 pages, 1 figure, 1 table
Subjects: Optimization and Control (math.OC)

In this paper, we study first-order characterizations of strong quasiconvexity for functions defined on convex subsets of real normed spaces. For functions that are continuous along segments, an inequality involving the lower Dini derivative is a known necessary condition for strong quasiconvexity with a given modulus, whereas the established converse guarantees only half of that modulus. By means of a one-dimensional lemma, we prove that this inequality, and even its weaker version with the upper Dini derivative, ensures strong quasiconvexity with the same modulus, without requiring the domain to be open; this answers a question raised in the recent literature. The main result leads to a characterization with the same modulus in terms of the Clarke subdifferential for locally Lipschitz functions on Banach spaces, which answers another open question, and to a formula for the exact modulus of radial functions defined on Hilbert spaces. We also present some consequences in optimization, such as an optimality condition without Clarke regularity, an error bound with optimal constant and, for the projected subgradient method, the same convergence rate as in the strongly convex case, together with the exponential convergence of the associated flow. Finally, we show that the converse of a relation between proximal points and strong subdifferentials fails in general, but holds for a truncation of the function.

[31] arXiv:2611.17483 [pdf, html, other]
Title: On discrete harmonic functions with non-negativity on a large portion of $\mathbb{Z}^2$
José Gaitan Montejo, Carlos Garzón, José Madrid
Comments: 35 pages
Subjects: Classical Analysis and ODEs (math.CA)

An improvement of Liouville's theorem for discrete harmonic functions on $\mathbb{Z}^2$ was obtained by Buhovsky, Logunov, Malinnikova, and Sodin. Namely, they proved that if a discrete harmonic function is bounded on a large portion of $\mathbb{Z}^2$, then the function is constant. In this paper, we study the corresponding problem if we replace the boundedness assumption with non-negativity. We establish this non-negativity result in some classes of discrete harmonic functions (polynomial growth and finite-translation-rank). Moreover, we prove that if a discrete harmonic function is non-negative on a large portion of $\mathbb{Z}^2$, then it has at most exponential growth.

[32] arXiv:2611.17485 [pdf, html, other]
Title: Quantum Fundamental Groups of Spaces with Finite-Sheeted Universal Covers
Shuzhou Wang, Zhenhua Wang, Matthew Zediker
Subjects: Quantum Algebra (math.QA); Mathematical Physics (math-ph); Operator Algebras (math.OA)

Discrete quantum groups have attracted much interest, but there was a lack of natural examples until Voigt constructed quantum permutations of finite and infinite sets in arXiv:2208.01310. In this paper, we construct the quantum fundamental groups that contain the classical fundamental groups as subgroups. This is a new class of natural examples of discrete quantum groups arising from symmetries of covering spaces in topology. We characterize quantum fundamental groups for a wide class of examples, including $\mathbb{RP}^2$. We show that these quantum fundamental groups are genuinely quantum for spaces with finite fundamental groups that are either non-abelian or of non prime order.

[33] arXiv:2611.17488 [pdf, html, other]
Title: Convergence Properties of PF-Exec: Homogeneous Structure, Anchored Closed Form, and Gain Dynamics
Hanzhang Jia, Liheng Zeng, Yiran Li, Yi Gao, Bo Ma
Subjects: Optimization and Control (math.OC); Machine Learning (cs.LG); Signal Processing (eess.SP)

This paper establishes a layered mathematical char acterisation of PF-Exec, the algorithm of the companion system paper. Demand-proportional bandwidth allocation yields an exact first-order homogeneous decomposition, from which the equal-load bandwidth target and its feasibility bound follow in closed form. The logarithmic knee view preserves strict load order and shares its global optimum with the Jain fairness index, while the demand-weighted centroid minimises the position potential. The damped softmax association block possesses a fixed point on the product of simplices. The truncated one-dimensional gain iteration admits a complete characterisation, with geomet ric convergence below the critical gain, initial-value-dependent bounded oscillation at it, and a family of bounded two-state cycles above it. A global invariant error ball and an explicit tracking recursion complete the execution guarantee. A numerical audit confirms the structural identities on every measured state and quantifies the local amplification of the coupled association and resource dynamics. Together, the results explain how closed form recovery directions and bounded adaptive gains provide stable execution without requiring a global Euclidean contraction assumption.

[34] arXiv:2611.17489 [pdf, html, other]
Title: Isolation of $k$-cliques in uniform hypergraphs
Mattea Baluci, Peter Borg
Comments: 13 pages
Subjects: Combinatorics (math.CO); Discrete Mathematics (cs.DM)

A copy of a hypergraph $F$ is called an $F$-copy. For any integers $k$ and $r$ with $2 \leq r \leq k$, let $K_k^r$ denote the complete $r$-uniform hypergraph whose vertex set is $[k] = \{1, 2, \dots, k\}$ (that is, the edges of $K_k^r$ are the $r$-element subsets of $[k]$). Given an $r$-uniform $m$-edge hypergraph $H$, the $K_k^r$-isolation number of $H$, denoted by $\iota(H, K_k^r)$, is the size of a smallest subset $D$ of the vertex set of $H$ such that the closed neighbourhood $N[D]$ of $D$ intersects the vertex sets of the $K_k^r$-copies contained by $H$ (equivalently, $H-N[D]$ contains no $K_k^r$-copy). We prove that if $H$ is connected and not a $K_k^r$-copy, then $$\iota(H, K^r_k) \le \left \lfloor \frac{(r-1)m + 1}{(r-1)(\binom{k}{r}+1) + 1} \right \rfloor.$$ The bound is best possible. This is a solution to a problem of Li, Zhang and Ye. We also provide an alternative proof for $r < k$. Both proofs introduce new ideas for establishing bounds on isolation parameters.

[35] arXiv:2611.17491 [pdf, html, other]
Title: A graph discretization of the Steklov and Neumann problems on domains in complete Riemannian manifolds
Samuel Audet-Beaumont
Subjects: Spectral Theory (math.SP); Numerical Analysis (math.NA)

We establish quantitative spectral convergence for graph discretizations of the Steklov and Neumann problems for bounded domains in complete Riemannian manifolds. Our construction uses weighted proximity graphs built from maximal $\epsilon$-separated sets, with a correction to the discrete energy accounting for the geometry near the boundary. We consider two discrete Steklov problems: one defined using an averaged boundary trace, and the other using restriction to boundary vertices. Both approximate the continuum Steklov spectrum, but under different conditions on the discretization parameters. The additional scale condition required for the restriction-based problem is also necessary for spectral convergence. As a byproduct, we obtain quantitative convergence of the Neumann spectrum. The estimates are uniform under suitable geometric bounds.

[36] arXiv:2611.17493 [pdf, html, other]
Title: Noncommutative Rational Positivstellensätze with Operator Coefficients
Abhay Jindal, Igor Klep, Jurij Volčič
Subjects: Functional Analysis (math.FA); Rings and Algebras (math.RA)

We establish a convex Positivstellensatz for noncommutative rational functions with bounded operator coefficients. A hermitian operator-valued rational function that is positive semidefinite on a matrix convex set described by a linear pencil admits a positivity certificate consisting of rational hermitian squares and a completely positive term involving the defining linear pencil. The certificate comes with an explicit complexity bound independent of the dimension of the coefficient Hilbert space. As a consequence, we solve the operator-valued noncommutative rational analog of Hilbert's 17th problem: every positive semidefinite operator-valued noncommutative rational function is a sum of hermitian squares, and even a single hermitian square when the coefficient Hilbert space is infinite-dimensional. In contrast, the corresponding commutative statement fails for infinite-dimensional operator coefficients.

[37] arXiv:2611.17494 [pdf, html, other]
Title: New Congruences for Simultaneously $l$-Regular and $t$-Distinct Partition in $k$-Colors
Anjelin Mariya Johnson, S. N. Fathima
Comments: 16 pages
Subjects: Combinatorics (math.CO); Number Theory (math.NT)

Let $RD_{\ell,t}^k(n)$ enumerates the number of $k$-colored simultaneously $l$-regular and $t$-distinct partitions. In this article, we establish some new infinite families of congruences modulo prime $p$, $p\geq5$ and modulo powers of 5 for $RD_{\ell,t}^k(n)$. For instance, for each $n\geq0$, $0\leq\alpha\leq{2k-2}$ and $k\geq1$,
\begin{align*}
\sum_{n=0}^{\infty}RD_{(5^{2k-1},5^{2k-1})}^2\big(5^{2k+\alpha-1}n+\frac{9\cdot5^{2k+\alpha-1}-2\cdot5^{2k-1}+1}{12}\big)q^n\equiv& 0\pmod{5^{k+\left[\frac{\alpha}{2}\right]}}
\end{align*}

[38] arXiv:2611.17496 [pdf, html, other]
Title: Wasserstein geometry of analytic cycle spaces
Fabio Cavalletti, Lorenzo Cecchi, Antonio Lerario
Subjects: Differential Geometry (math.DG); Algebraic Geometry (math.AG); Metric Geometry (math.MG)

We use optimal transport to define an intrinsic distance on connected components of the Barlet space of analytic cycles on a compact Kähler manifold, by associating to each cycle its normalized volume measure. We prove that any two cycles in the same connected component can be joined by a deformation of finite Wasserstein length, and that the resulting metric is complete and geodesic. On the locus of smooth reduced cycles at regular parameter points, Wasserstein lengths and energies coincide with those of the normalized Weil--Petersson metric. The construction thus gives a transport interpretation of Weil--Petersson geometry and extends beyond it to components containing no smooth reduced cycles.

[39] arXiv:2611.17506 [pdf, html, other]
Title: Correlation distribution for a class of Niho exponents via self-conjugate-reciprocal polynomials and Kloosterman sums
Yongbo Xia, Chunlei Li, Xiangyong Zeng, Tor Helleseth
Comments: 43 pages
Subjects: Information Theory (cs.IT); Number Theory (math.NT)

Let $q=2^m$ for an even $m\geq 6$ and let $d=s(q-1)+1$ with $4s\equiv5\pmod{q+1}$. In this paper, the correlation distribution between a binary m-sequence of period $q^2-1$ and its $d$-decimation is considered. The cross-correlation function takes seven values $q(i-1)-1$ for $0\leq i\leq 6$, and we determine their frequencies based on the study of low-degree self-conjugate-reciprocal polynomials and three mixed Kloosterman sums, which are finally expressed in terms of $K_m(1)$ and $K_m(\omega)$, where $K_m(\cdot)$ is the Kloomsterman sum on the finite field $\mathbb{F}_q$ and $\omega$ is a primitive element of $\mathbb{F}_4$.

[40] arXiv:2611.17510 [pdf, html, other]
Title: Cartan Dynamics and Limit Sets on Flag Manifolds
Ángel Cano, Marlon M. López-Flores, José Seade, Andrew Shaw
Comments: Monograph
Subjects: Dynamical Systems (math.DS)

The classical convergence principle describes the collapse of the Riemann sphere under divergent sequences of Möbius transformations. We develop its counterpart for arbitrary real semisimple Lie groups acting on flag manifolds, and use it to study limit sets and domains of discontinuity of discrete subgroups. The key is to let the source move: the destination of $x$ under $(g_m)$ is the set of all limits of $g_mx_m$ with $x_m\to x$. Our destination formula computes it as the closure of a unipotent orbit, determined by the Cartan data and a bounded Levi factor. The stratified convergence principle organises these destinations into families of translated Schubert varieties attached to boundary points of a compactification of the group. Over the complex numbers, the destination relation is the support of Brion's limiting graphs in the wonderful compactification, providing scheme structures, multidegrees and diagonal intersections.
For discrete groups, the union of destination relations determines proper discontinuity and whether a largest domain exists. It relates Quint's flag limit set, Conze--Guivarc'h, Kulkarni and Myrberg sets to the recurrent set, while balanced choices of cells yield domains for every discrete subgroup, without Anosov hypotheses. For symmetric-power actions of non-elementary Kleinian groups on $\mathbb{CP}^N$, we compute the largest domain by a multiplicity bound at points of the classical limit set; for $N\ge3$ it strictly contains the Kulkarni domain, which equals the equicontinuity region. We also obtain nonempty largest domains for Zariski-dense cusped Hitchin groups with unipotent elements, and examples of strongly irreducible groups with no largest domain.

[41] arXiv:2611.17525 [pdf, html, other]
Title: Generalized Power Graph of a Group
Danilo Silveira, Yerko Contreras-Rojas
Comments: 15 pages, 5 figures
Subjects: Group Theory (math.GR); Combinatorics (math.CO)

In this paper, we introduce a new class of graphs, called generalized power graphs, and investigate some of their key properties, such as completeness, connectivity, and planarity.

[42] arXiv:2611.17531 [pdf, html, other]
Title: Sampling recovery for intersections of Lipschitz classes in the low-smoothness regime
Yurii Kolomoitsev
Subjects: Classical Analysis and ODEs (math.CA)

We study sampling recovery in $L_p(\mathbb T^d)$ for intersections of Lipschitz classes defined by smoothness conditions in two different metrics $L_p$ and $L_q$, where $1\le p<q\le\infty$. Our focus is on the low-smoothness range, where the $L_p$-smoothness does not exceed the classical continuity threshold $d/p$. We determine the exact orders of the sampling numbers for both linear and general recovery algorithms, including critical smoothness cases in which logarithmic factors appear or uniform convergence fails. To analyze sampling approximation in the low-smoothness range, we establish new inequalities for averaged moduli of smoothness with different integrability parameters and derive sharp estimates for these moduli and the corresponding semi-discrete measures of smoothness. These estimates provide error bounds for linear sampling operators acting on functions whose smoothness may lie below the classical continuity threshold. Finally, we determine the Kolmogorov widths of the intersection classes and quantify the gap between optimal sampling recovery and approximation by finite-dimensional subspaces.

[43] arXiv:2611.17533 [pdf, html, other]
Title: Extrinsic Representation of the Partial Ricci Flow
Vladimir Rovenski, Sergey Liflandsky
Subjects: Differential Geometry (math.DG)

The partial Ricci flow (PRF) modifies the Riemannian metric on a foliation on a distribution orthogonal to the leaves. In this work we develop extrinsic representations of PRF on geodesic foliations (twisted/warped products, weak K-contact and weak \b{eta}-Kenmotsu manifolds) and analyze model cases where PRF admits closed-form solutions. Using the convergence of PRF on model cases, we construct its extrinsic representations initialized by rotational hypersurfaces in Euclidean space as well as parallel curved surfaces and ellipsoids. The extrinsic viewpoint for PRF provides new tools for studying curvature-driven dynamics on foliations, with potential applications to calculus of moving surfaces and mathematical physics.

[44] arXiv:2611.17536 [pdf, html, other]
Title: A new tautological relation on $\overline{\mathcal{M}}_{2,14}$ in cohomology
Samir Canning, Bochao Kong, Rahul Pandharipande, Dan Petersen, Aaron Pixton, Johannes Schmitt
Comments: 55 pages, comments welcome!
Subjects: Algebraic Geometry (math.AG)

We construct a relation $\mathsf{Q}$ in the cohomological tautological ring $\mathsf{RH}^*(\overline{\mathcal{M}}_{2,14})$ which lies outside the space of $3$-spin relations. $\mathsf{Q}$ is a simple linear combination of pure boundary strata classes of codimension 9 supported on the divisor $\Delta_0 \subset \overline{\mathcal{M}}_{2,14}$ of irreducible nodal curves, and transforms according to the irreducible representation of $\Sigma_{14}$ associated to the partition $(2^7)$. The result shows that the set of $3$-spin relations cannot be complete in cohomology. Motivic conjectures relating algebraic cycles to special values of $L$-functions suggest that $\mathsf{Q}$ is nonzero in Chow. More precisely, we prove that the Chow nonvanishing of $\mathsf{Q}$ follows from a conjecture of Harder concerning the failure of the Manin--Drinfeld principle in genus 2.
We prove that $\mathsf{Q}$ vanishes in cohomology by pairing with generators of the tautological ring. To prove $\mathsf{Q}$ is not in the set of $3$-spin relations requires an argument involving the $\Sigma_{14}$-representation-theoretic properties of the $3$-spin relations and the cohomology of local systems on $\mathcal{A}_2$ and $\mathcal{M}_2$. Parallel constructions for other moduli spaces $\overline{\mathcal{M}}_{g,n}$ are discussed in the paper. There are many open questions.

[45] arXiv:2611.17540 [pdf, html, other]
Title: Gusto: a toolkit for compatible finite element dynamical cores
Jemma Shipton, Thomas M. Bendall, Colin J. Cotter, David M. Acreman, Timothy C. Andrews, Jack Betteridge, Alex Brown, Thomas H. Gibson, Nell Hartney, David A. Ham, Joshua Hope-Collins, Jeremy A. Pike, Connor J. Ward, Dan Witt
Subjects: Numerical Analysis (math.NA)

Gusto is a tool for rapid prototyping of new algorithms based on compatible finite element methods for discretising the fluid equations in the dynamical core of weather and climate models. In this context, the development of new algorithms typically follows a path that involves testing on a hierarchy of simpler equation sets sharing important features of the mathematical structure of the equation set solved by the dynamical core. Gusto provides compatible finite element spatial discretisations of the hierarchy of equation sets, along with a range of timestepping schemes. The code is modular so that different spatial and temporal discretisations can be combined and the same schemes can be applied to any of the equation sets. This facilitates fair comparison of the schemes and makes the extension of any algorithmic developments to the more complex equation sets more straightforward. In this paper we present Gusto to the community by describing the algorithms implemented in Gusto and showcasing their performance through a variety of test problems commonly used in numerical weather prediction.

[46] arXiv:2611.17542 [pdf, html, other]
Title: On the Hofer-Zehnder conjecture for Reeb flows without symmetry
Erman Cineli, Viktor L. Ginzburg, Basak Z. Gurel
Comments: 32 pages, 1 figure
Subjects: Symplectic Geometry (math.SG); Dynamical Systems (math.DS)

This paper continues our investigation of the Hofer-Zehnder conjecture for dynamically convex, non-degenerate Reeb pseudo-rotations of $S^{2n-1}$. The main result of the paper is that, for $n\geq 3$, such a flow has at most $n-3$ alternating prime closed orbits and hence at most $2n-3$ prime closed orbits in total. In particular, the flow on $S^5$ has exactly three prime closed orbits, all of which are non-alternating and elliptic. In addition, we prove that a dynamically convex Reeb pseudo-rotation on a sphere has at least two non-degenerate, irrationally elliptic orbits.

[47] arXiv:2611.17543 [pdf, html, other]
Title: The Triangular Abrikosov Constant and the Thomas--Fermi $Γ$-Limit of Rotating Bose--Einstein Condensates
Giovanni Di Fratta, Valeriy V. Slastikov
Comments: 47 pages, 3 Figures
Subjects: Analysis of PDEs (math.AP); Quantum Gases (cond-mat.quant-gas); Mathematical Physics (math-ph); Functional Analysis (math.FA); Pattern Formation and Solitons (nlin.PS)

We resolve the Abrikosov coefficient conjecture for rapidly rotating two-dimensional Bose--Einstein condensates within the variational framework of $\Gamma$-convergence. For a harmonic trap, we establish the $\Gamma$-convergence of the rescaled Gross--Pitaevskii energy functionals in the fast-rotation regime, through weak $L^2$ convergence of the rescaled densities, and identify the effective interaction coefficient $\beta_*$ with $b_\triangle$, the Abrikosov ratio associated with the triangular vortex lattice. The limiting Thomas--Fermi functional determines the first correction to the minimum energy and the macroscopic density of almost minimizers. For the auxiliary rescaled model and its lowest-Landau-level restriction, we also compute a strictly positive limiting $L^2$ distance between minimizing densities and the Thomas--Fermi profile.
The identification of the effective interaction coefficient $\beta_*$ with the triangular Abrikosov ratio $b_\triangle$ relies on the sharp Gaussian-minorant theorem established in a recent OpenAI preprint~\cite[Theorem~1.2]{Atomic}. A Fourier representation of the quartic energy and a weighted Poisson identity yield a lower bound for arbitrary magnetic-periodic lowest-Landau-level states. The sign conditions on the minorant and its Fourier transform give the bound, while the lattice contact conditions identify its coefficient with $b_\triangle$. Cutoff and magnetic projection transfer this estimate to local holomorphic states without boundary conditions or periodicity assumptions. Consequently, the free-cell coefficients converge to $b_\triangle$ with error $O(L^{-1/5})$ on squares of side length $L$.

[48] arXiv:2611.17544 [pdf, html, other]
Title: Riemannian geodesic motions and null foliations
Souheib Allout, Alaa Mohamed Boukholkhal, Lamine Messaci, Abdelghani Zeghib
Subjects: Differential Geometry (math.DG)

We study the non-collision problem: given a unit vector field $V$ on a complete Riemannian manifold $(M,g)$, under what conditions on $V$ are the maps $F_t(p)=\exp_p(tV(p))$ injective for all $t\in\mathbb{R}$? If such a vector field exists, we call it a geodesic motion on $M$. This occurs, for instance, when $V$ defines a geodesic foliation of $M$, in which case, the geodesic motion is called stationary. We show that geodesic motions on the Euclidean plane are necessarily stationary, that generic geodesic motions on round spheres are non-stationary, and that compact hyperbolic $3$-manifolds admit no geodesic motions. The non-collision problem has a Lorentzian interpretation: geodesic motions on $M$ correspond to one-dimensional null geodesic foliations of the spacetime $(M\times\mathbb{R},g-dt^2)$. In the second part of the paper, we focus on codimension-one lightlike geodesic foliations of anti-de Sitter space $\operatorname{AdS}^{1,n}$. We give a complete characterization of such foliations by means of causal curves in the Einstein universe and prove rigidity in the projective anti-de Sitter case. The last part of the paper is dedicated to the study of one-dimensional geodesic foliations of $\operatorname{AdS}^{1,2}$. We give a complete characterization when the foliation contains at least one timelike leaf.

[49] arXiv:2611.17546 [pdf, html, other]
Title: Weak Generators in Stable Module Categories
Christian Lomp
Comments: comments are welcome
Subjects: Rings and Algebras (math.RA); Logic (math.LO)

The aim of this note is to show that the existence of weak generators in the stable module category of a ring, or equivalently, of $p$-indigent modules in the terminology of Holston et al., depends on the underlying model of set theory.

[50] arXiv:2611.17553 [pdf, other]
Title: End-line Fourier restriction for hyperbolic surfaces in three dimensions
Sam Craig, Betsy Stovall
Comments: 42 pages. Comments are welcome!
Subjects: Classical Analysis and ODEs (math.CA)

We prove new bilinear adjoint Fourier restriction estimates for pairs of separated rectangles associated to a hyperbolic surface in $\mathbb{R}^3$. We then employ these bilinear estimates to prove Fourier extension inequalities along the (sharp) parabolic scaling line for any smooth hyperbolic 2-surface that is either the graph of a polynomial or that obeys a mild finite type condition.

[51] arXiv:2611.17557 [pdf, html, other]
Title: Freeness of crossed modules, augmented quandles, and augmented racks
Toshiyuki Akita, Sota Takase
Subjects: Geometric Topology (math.GT); Algebraic Topology (math.AT); Group Theory (math.GR)

We study freeness of crossed modules, augmented quandles, and augmented racks. We show that the associated quandle functor and the associated crossed module functor are left adjoint to the natural forgetful functors. For a map $f\colon S\to G$, we define the free augmented rack $R_f\to G$ and the free augmented quandle $Q_f\to G$. If $C_f\to G$ denotes the free crossed module determined by $f$, then the associated crossed modules of $R_f$ and $Q_f$ are both isomorphic to $C_f\to G$. We also characterize free augmented quandles in terms of stabilizers. As applications, we prove that the canonical inner augmentation of every generalized Alexander quandle is free and that the canonical inner augmentation of a classical knot quandle is free if and only if the knot is a torus knot, whereas for every $n$-knot with $n\geq2$ it is free.

[52] arXiv:2611.17567 [pdf, html, other]
Title: A proof of the Jamneshan-Tao conjecture by embedding nilspaces in nilmanifolds
Pablo Candela, Diego González-Sánchez, Balázs Szegedy
Comments: 26 pages
Subjects: Group Theory (math.GR); Combinatorics (math.CO); Dynamical Systems (math.DS)

We prove that every compact finite-rank nilspace admits a continuous injective morphism into a toral nilspace of the same step, and hence into a connected filtered nilmanifold. Combining this embedding theorem with the general nilspace inverse theorem, we establish the Jamneshan-Tao conjecture and extend its conclusion to second-countable compact abelian groups. This yields an inverse theorem for Gowers norms on all such groups, in which the correlating functions factor through morphisms into nilmanifolds. The proof relies on substantial foundations developed in nilspace theory over the past decade, particularly the general nilspace inverse theorem and the representation of compact finite-rank nilspaces as quotients of free nilspaces.

[53] arXiv:2611.17568 [pdf, html, other]
Title: Commuting pairs in lattices of reductive Lie algebras
Caihua Luo, Xu Song, Yilin Zeng
Subjects: Number Theory (math.NT)

We count ordered commuting pairs in a full lattice \(\Lambda\) in a reductive Lie algebra \(\g\) over \(\Q\). For a fixed convex body \(B\) containing the origin in its interior, the count in \(HB\) is \(C_{\Lambda,B}H^{\dim\g+\dim Z(\g)}\) with a power-saving error. The leading term comes from pairs whose projections to each simple ideal are linearly dependent over its centroid. Their slopes index an absolutely convergent sum of section volumes for \(C_{\Lambda,B}\). Subtracting the contribution of dependent pairs from the finite-field Fourier sums gives cancellation at generic dependent frequencies. For independent frequencies, we bound the dimension of the locus where the corresponding hyperplane contains an irreducible component of a nonzero bracket fibre. For \(n\ge3\), the number of ordered commuting pairs in \(M_n(\Z)\) with entries of absolute value at most \(H\) is \[
\frac{2(n+3)\zeta(n^2-2)}{(n+1)\zeta(n^2-1)}
(2\lfloor H\rfloor+1)^{n^2+1}
+O_n\!\left(H^{n^2+1-1/(n+1)}\right), \] confirming the exponent \(n^2+1\) predicted by Browning, Sawin and Wang~\cite{BSW}.

[54] arXiv:2611.17570 [pdf, html, other]
Title: Annihilation versus anchoring of a topologically charged pair on a perforated two-dimensional surface
Patrick Romanescu
Subjects: Probability (math.PR); Statistical Mechanics (cond-mat.stat-mech); Mathematical Physics (math-ph)

Two independent random walks of opposite topological charge move on the discrete torus $(\mathbb{Z}/n\mathbb{Z})^2$, which contains $k$ well-separated holes. The walks annihilate when they come within a core distance of each other, and each walk is anchored when it first touches a hole. We prove that the probability of annihilation before anchoring converges to $w_0/(w_0+\sum_j w_j)$, where the weights are explicit and depend only logarithmically on the sizes of the core and of the holes; for point-like core and holes, the limit is $1/(1+k)$. We then prove a fate theorem: the pair either terminates or ends as two opposite charges anchored on two different holes, with probability $(k-1)/(k+1)$ in the point-like case, and the hosting pair $\{j,l\}$ is chosen with probability proportional to $w_jw_l$. The proof combines an abstract competition lemma for rare sets in reversible Markov chains with sharp two-dimensional Green's function estimates.

[55] arXiv:2611.17584 [pdf, html, other]
Title: The Ulam sequence grows subexponentially
Noah Kravitz
Subjects: Combinatorics (math.CO); Number Theory (math.NT)

We prove that the $n$-th element of the Ulam sequence, a somewhat mysterious recursively-defined sequence of positive integers, has size $e^{O(\sqrt{n})}$; previous upper bounds were exponential in $n$. Our argument uses an additive-combinatorial lemma, possibly of independent interest, about covering finite difference sets with multiplicatively short intervals. The proofs are due to ChatGPT.

[56] arXiv:2611.17593 [pdf, html, other]
Title: Scattering for cubic and Yukawa--Hartree Dirac equations wiith polynomially decaying spacetime metrics
Yonggeun Cho
Subjects: Analysis of PDEs (math.AP)

We study massive Dirac equations in three space dimensions with small, time-dependent perturbations of the principal coefficients and decaying zeroth-order matrix terms. The principal perturbation and its spatial derivatives decay polynomially at rate $\rho>7/2$, and its first time derivative has one additional inverse spatial power. We prove small-data global well-posedness and scattering for local cubic nonlinearities in $H^s$, $s>1+5/(2(\rho-1))$, and for Yukawa--Hartree nonlinearities in $H^s$, $s>1/2+5/(2(\rho-1))$. The argument retains the coupling between the metric-adapted positive and negative branches. Its main ingredients are a time-independent modified energy, a weighted estimate controlling the full massive low-frequency component, and frequency-dependent spatial cutoffs. The operator class contains the geometric Dirac Hamiltonian of a synchronous spacetime metric with its full spin connection. No second time derivative, temporal integrability, or asymptotic stationarity is assumed. Scattering is formulated relative to the exact nonautonomous linear evolution.

[57] arXiv:2611.17594 [pdf, other]
Title: Homotopy type of equivariant embeddings
Pranav Chakravarthy, River Chiang, Liat Kessler, Martin Pinsonnault
Comments: Initial submission. 77 pages. Comments welcome
Subjects: Symplectic Geometry (math.SG)

We study spaces of symplectic embeddings of a closed four-ball into a closed symplectic four-manifold that are equivariant under a compact group action and centred on a component of the fixed point set. Adapting McDuff's argument, we reduce the path-connectedness of these spaces, and the uniqueness of equivariant blow-ups up to isotopy, to an equivariant deformation-to-isotopy statement on the blow-up. For compact abelian groups, we identify the stabilizer of a ball with the group of equivariant symplectomorphisms of the blow-up that preserve the exceptional divisor. For Hamiltonian circle actions on $\mathbb{C}P^2$, $S^2\times S^2$ and $\mathbb{C}P^2\#\overline{\mathbb{C}P^2}$, we obtain the invariant curves needed for inflation from toric extensions of the blown-up action, and we prove that the embedding spaces are path-connected. When the ball is centred at an isolated fixed point of $S^2\times S^2$ or $\mathbb{C}P^2\#\overline{\mathbb{C}P^2}$, the space of unparametrized balls is contractible or homotopy equivalent to $\Omega S^3\times S^1$, according to the numbers of toric actions that extend the circle action and its blow-up. On $\mathbb{C}P^2$, it is homotopy equivalent to the fixed component. Along the way, we compute the centralizers of Hamiltonian circle actions on the one-point blow-up of $S^2\times S^2$, whose homotopy type depends only on the number of toric extensions.

[58] arXiv:2611.17595 [pdf, html, other]
Title: The retarded interaction and non-scattering for 3D Maxwell--Dirac system
Yonggeun Cho, Kiyeon Lee
Comments: 16 pages
Subjects: Analysis of PDEs (math.AP)

We prove an a priori obstruction to linear scattering for the massive Maxwell--Dirac system in three space dimensions. A global solution with nonzero charge cannot scatter linearly in $L^2$ if its full and homogeneous potentials are $O(t^{-1})$, and the homogeneous potential is $o(t^{-1})$ in compact timelike cones. No nonlinear asymptotic expansion is assumed in this non-scattering theorem. We also identify the exact leading interaction when the nonlinear current approaches a free Dirac current in $L^1$. Its coefficient is a positive quadratic form in the velocity density and is bounded below by the square of the charge divided by $4\pi$. The proof uses free Dirac asymptotics and an estimate for retarded source errors after pairing with a smooth free current. The main arguments, including the oscillatory retarded interaction, are proved here. Global existence and the required nonlinear decay remain separate inputs; a small-data application to existing theory is stated explicitly as such.

[59] arXiv:2611.17597 [pdf, html, other]
Title: Relabeling symmetry and conservation laws in hydrostatic and nonhydrostatic upper-ocean models
F.J. Beron-Vera
Comments: Submitted to Journal of Nonlinear Science. Comments welcome!
Subjects: Mathematical Physics (math-ph)

We explicitly identify conserved integrals of hydrostatic and nonhydrostatic reduced-gravity upper-ocean models, both vertically unrestricted and columnar, with Noether quantities associated with particle relabeling. The columnar velocity reduction preserves the Lie-algebra structure, providing a common Euler--Poincaré framework for both families. Within this framework, we introduce nonhydrostatic columnar models with polynomial vertical buoyancy structure, extending the hydrostatic stratified hierarchy. Retaining the temporal endpoint pairing, we construct transported relabeling generators and evaluate their vorticity-dependent conserved integrals, assuming that spatial boundary terms vanish. For stratified columnar models, preservation of the effective buoyancy entering the Lagrangian suffices for symmetry even when individual buoyancy coefficients change, yielding conserved quantities that generally are not Casimirs of the full Lie--Poisson bracket. Where the Legendre transform is regular, we state the corresponding brackets and identify their Casimir families. The hydrostatic parent is treated directly through the Euler--Poincaré principle because its Legendre transform is degenerate. Integrals following directly from advection are distinguished from those obtained through the Noether pairing.

[60] arXiv:2611.17606 [pdf, html, other]
Title: Counterexamples to the clamped-plate eigenvalue ratio conjecture
Guowei Dai, Yingxin Sun, Yong Zhang
Subjects: Analysis of PDEs (math.AP)

Ashbaugh in 1999 conjectures that the ball maximizes the ratio of the second to the first eigenvalue for the vibrating clamped-plate problem. We disprove this conjecture by constructing smooth connected domains in every dimension $d\ge2$. The construction starts with an interior sphere on which the displacement is required to vanish. The first two eigenvalues have the same relative increase at first order, but the second increases more at second order. This gives a strict increase of their ratio, which survives approximation of the sphere by finitely many codimension-two supports and their replacement by smooth holes. We identify the limiting Sobolev spaces through trace estimates and logarithmic cutoffs, and use the geometric construction for the buckling problem to obtain connected perforated domains.

[61] arXiv:2611.17611 [pdf, html, other]
Title: Pseudo-profiles for vectorial Allen-Cahn systems
Fabrice Bethuel, Dongheng Liu, Ramon Oliver Bonafoux
Comments: 70 pages
Subjects: Analysis of PDEs (math.AP)

The purpose of the present paper is to present a new type of solutions to the elliptic vectorial Allen-Cahn system of equations. Its main feature is that in the classical rescaling its asymptotics do not follow the rule of balance of energies, which is crucial in the analysis of the asymptotics for the scalar problem.

[62] arXiv:2611.17613 [pdf, other]
Title: Innovative Integrated Congestion Management Market: Synergizing Operational Flexibility of Transmission System Operators with Aggregator-Driven Resources
Arash Beiranvand
Subjects: Optimization and Control (math.OC)

This paper introduces an innovative congestion management market that seeks to integrate and harness the operational flexibility available to Transmission System Operators (TSO) in conjunction with the flexibility offered by aggregators. In the context of operational flexibility, this study investigates Network Topology Optimization (NTO) as a pivotal strategy for to address the transmission network congestion, specifically through the strategic switching of certain buses. To achieve this, an N-1 secured NTO is formulated using a Mixed Integer Linear Programming (MILP) methodology. Concurrently, acknowledging the crucial and growing importance of aggregator-provided flexibility in congestion management, the paper presents a novel integrated congestion management market. In this framework, aggregators submit bids, and the TSO, taking into account these bids alongside the potential for the NTO, clears the market with the goal of minimizing the overall cost of congestion management. The proposed integrated market is constructed using a linear optimization model, ensuring its practical applicability in real world scenarios. The effectiveness and efficiency of the proposed market design are assessed using the standard IEEE 39-bus system, with results indicating promising potential and applicability

[63] arXiv:2611.17624 [pdf, html, other]
Title: The Gaps Between the $Δ$-Unknotting Number and Its Lower Bounds
Kazumichi Nakamura
Comments: 15 pages, 6 figures, 4 tables
Subjects: Geometric Topology (math.GT)

Let $u^{\Delta}(K)$ denote the $\Delta$-unknotting number of a knot $K$, and let $a_2(K)$ denote the second coefficient of the Conway polynomial. It is known that $u^{\Delta}(K)\geq |a_2(K)|$. We define the $\Delta$-gap of $K$ by $G^{\Delta}(K):=u^{\Delta}(K)-|a_2(K)|$. In this paper, we investigate the behavior of this invariant for various families of knots. For example, we prove that the $\Delta$-gap of the pretzel knot $K=P(2s, 4s-1,4s+1)$, where $s$ is a positive integer, satisfies $G^{\Delta}(K) \geq 4s$. Consequently, the $\Delta$-gap is unbounded. To further investigate the structure of the $\Delta$-gap, we distinguish between $\Delta$-moves that increase $a_2(K)$ and those that decrease it, since each $\Delta$-move changes $a_2(K)$ by $\pm1$. We analyze how these two types of moves contribute to the $\Delta$-gap. We also investigate the gaps between $u^{\Delta}(K)$ and other knot invariants that provide lower bounds for it. In particular, we establish explicit formulas and lower bounds for these gaps for certain families of pretzel knots, torus knots, two-bridge knots, and Montesinos knots. Our results show that these gaps can be arbitrarily large. In addition, we identify prime positive knots with $u^{\Delta}(K)=2$ or $3$, and propose a conjecture on a lower bound for $u^{\Delta}(K)$ for prime positive knots.

[64] arXiv:2611.17625 [pdf, html, other]
Title: Finite speed Ornstein-Uhlenbeck-Kac processes and their applications in generative modeling
Richard Duong, Janis Auffenberg, Gabriele Steidl
Subjects: Probability (math.PR); Machine Learning (cs.LG); Analysis of PDEs (math.AP)

We study the Ornstein-Uhlenbeck-Kac (OU-K) process, where instead of a Brownian motion, a finite-speed Kac process defines the driving process. The OU-K process can be analyzed through a rescaled, time-inhomogeneous Kac process, characterized by a switching rate from the Kac part, and a convergence rate from the Ornstein-Uhlenbeck (OU) part. The law of this inhomogeneous Kac process describes the solution of a wave equation, the Euler-Poisson-Darboux (EPD) equation. For Kac switching rates being multiples of the OU convergence rate, we can explicitly derive this EPD solution via the sum of (the derivative of) two Legendre polynomials, restricted between two Dirac points representing the wave fronts. Using the framework of piecewise-deterministic Markov processes (PDMP), we describe the conditional velocity fields of the OU-K process via our polynomial-law-formula. This allows us to apply the OU-K process in a generative flow model. Since the OU-K velocity fields prove to be bounded by the finite Kac speed, the usual time truncations of diffusion models become unnecessary. We demonstrate advantages over diffusion and flow matching models in terms of generation sharpness on singular data sets, while achieving competitive results on CIFAR-10 image generation.

[65] arXiv:2611.17633 [pdf, html, other]
Title: Complete Center Classification of a Quintic $\mathbb Z_2$-Equivariant System via Rational Descent and Ramification
Feng Li, Meilan Cai, Chaochao Sun
Subjects: Dynamical Systems (math.DS)

We develop a new structural method to completely classify the elementary centers of a ten-parameter quintic $\mathbb Z_2$-equivariant system. The method overcomes the computational bottleneck of direct focus-quantity elimination by combining a Liénard reduction, a necessary-and-sufficient analytic involution criterion, and rational descent with residue and ramification analysis. We obtain forty-two explicit original-parameter conditions covering the entire center locus, including all degenerate and boundary cases. Sufficiency is established constructively through integrating factors, first integrals and explicit reversible realizations.

[66] arXiv:2611.17635 [pdf, html, other]
Title: Dynamics of a single 3D vortex ring
Ping Zhang, Yibin Zhang
Subjects: Analysis of PDEs (math.AP)

We study the axisymmetric Navier--Stokes flow without swirl originating from a circular vortex ring. For each fixed $s\in(0,1)$ and sufficiently large circulation Reynolds number $\Gamma/\nu$, we prove that, on the time scale $t\lesssim T_{\rm adv}(\Gamma/\nu)^{s}$, the vorticity $\omega_\theta$ is approximated by a traveling wave solution featuring a Gaussian-type core with scale $O(\sqrt{\nu t})$, whose off-axis distance remains constant and which continuously translates along the axial direction. In particular, the leading-order axial translation velocity is given by the Kelvin-Saffman formula. The proof relies on the approximation and Arnold energy framework of Gallay and Šverák \cite{GS2024}. We modify the weight used in \cite{GS2024} and estimate the relative-vorticity error to obtain favorable boundary dissipation at the symmetry axis and close the energy estimate.

[67] arXiv:2611.17636 [pdf, html, other]
Title: A counterexample to Arveson's finiteness question for subdiagonal algebras
Guoxing Ji
Comments: 5pages
Subjects: Operator Algebras (math.OA); Functional Analysis (math.FA)

We construct a unital \(\sigma\)-weakly closed subalgebra \(\mathfrak A\) of a von Neumann factor \(\mathcal M\) of type \(\mathrm{II}_1\), whose diagonal is \(\mathfrak D=\mathfrak A\cap\mathfrak A^*=\mathbb CI\). We show that there exist uncountably many faithful normal conditional expectations from \(\mathcal M\) onto \(\mathfrak D\) with respect to each of which \(\mathfrak A\) is a maximal subdiagonal algebra. Let \(\tau\) denote the unique normalized faithful normal trace on \(\mathcal M\). The conditional expectation associated with \(\tau\) preserves this trace, whereas none of the other conditional expectations is preserved by any nonzero finite trace on \(\mathcal M\). This gives a negative answer to Arveson's finiteness question for subdiagonal algebras in \emph{Amer. J. Math.} \textbf{89}(1967), 578--642.

[68] arXiv:2611.17640 [pdf, html, other]
Title: Brunn-Minkowski inequality for Riesz capacity in one dimension
Carrie Clark, Richard S. Laugesen
Comments: 9 pages, 1 figure; ancillary file: mathematical audit (4 pages)
Subjects: Analysis of PDEs (math.AP); Classical Analysis and ODEs (math.CA)

The Brunn-Minkowski inequality for Riesz $p$-capacity is proved on the line for every $p<1$ and all compact sets, including disconnected sets. For $-1<p<1$, equality holds exactly for a singleton summand or else two intervals, provided at least one capacity is positive. The proof couples equilibrium measures in increasing order.

[69] arXiv:2611.17643 [pdf, html, other]
Title: A large ultrafilter number at $\aleph_ω$
Fanxin Wu
Subjects: Logic (math.LO)

Gitik constructed a model where $\aleph_\omega$ is strong limit, $2^{\aleph_\omega}=\aleph_{\omega+2}$ and every strongly uniform ultrafilter on $\aleph_\omega$ has character $\aleph_{\omega+2}$. We show that in fact every uniform ultrafilter on $\aleph_\omega$ has character $\aleph_{\omega+2}$ in that model.

[70] arXiv:2611.17647 [pdf, html, other]
Title: Vector bundles on spin Kähler surfaces and the multi-spinor Seiberg-Witten equations
Minh Lam Nguyen, Ollie Thakar
Comments: 24 pages
Subjects: Algebraic Geometry (math.AG); Differential Geometry (math.DG); Geometric Topology (math.GT)

We compute new lower bounds on the second Chern class of a vector bundle $\mathscr{E}$ on a spin Kähler surface $X$ that satisfies $c_1(\mathscr{E}) = 0$ and $H^2(\text{End}_0\mathscr{E}) = 0.$ When $X$ is a regular elliptic surface and $\mathscr{E}$ has rank 2, our bound is sharp. Our technique is to use Furuta's finite-dimensional approximation on the multi-spinor Seiberg-Witten equations, together with their algebro-geometric interpretation by the second named author. We also use these techniques to prove an existence theorem for singular Fueter sections and multi-spinor Seiberg-Witten solutions that holds for every Riemannian metric on a large class of 4-manifolds.

[71] arXiv:2611.17653 [pdf, html, other]
Title: Geometric Partial Differential Equations of Hydrodynamic Type for Maps into F$_\text{man}$-Lie Groups
Santiago Castañeda-Montoya, Alexander Torres-Gomez
Comments: 22 pages, comments and questions are very welcome
Subjects: Differential Geometry (math.DG); Analysis of PDEs (math.AP)

We develop a geometric framework for partial differential equations of hydrodynamic type on maps from a two-dimensional manifold into an F$_\text{man}$-Lie group. Using the left-invariant structure and the Maurer-Cartan form, we reduce these equations to non-linear evolution systems on the underlying F$_\text{man}$-algebra, governed by its Lie bracket and commutative associative product. We investigate the role of Poisson subalgebras, establishing that flatness of the canonical connection forces two-step nilpotency and yields a linearized evolution equation upon quotienting by the center. Furthermore, we introduce the notion of a Poisson splitting and derive the corresponding tangential and transversal evolution equations. Under suitable reductivity assumptions, we show that their non-linear coupling is governed by the curvature of the canonical principal connection on the homogeneous space $G/H$. These results reveal the interplay between the algebraic structure of F$_\text{man}$-Lie groups and the geometric dynamics of hydrodynamic-type equations.

[72] arXiv:2611.17656 [pdf, html, other]
Title: Optimal Dividend Problem for a Threshold Dependent Surplus Process with Bounded Dividend Rate
Zhongqin Gao, Panyu Wu, Xiaowen Zhou
Comments: 25 pages, 6 figures
Subjects: Optimization and Control (math.OC); Probability (math.PR)

We study optimal bounded-rate dividend payments for a diffusion surplus process whose drift and volatility change at a fixed surplus threshold. Optimal strategies admit an exhaustive classification into zero-threshold, positive single-threshold, two-boundary, and three-boundary configurations. The latter two configurations have separated dividend regions, which arise because the interface can reverse the monotonicity of the derivative of the value function with respect to the initial surplus. Multiband optimality requires an upward change in drift. Without prescribing a strategy in advance, we construct the unique bounded classical solution of the Hamilton-Jacobi-Bellman transmission problem by varying the derivative at zero surplus and selecting the unique value for which the resulting solution agrees in both value and derivative with a bounded solution at a fixed sufficiently large surplus level. Verification identifies this solution with the value function and determines the optimal feedback strategy. For each configuration, we derive necessary and sufficient optimality conditions and characterize the switching boundaries through explicit formulas or equations in one unknown obtained by matching the value function and its derivative. The analysis also shows how changes in the drift and volatility of the upper regime affect the optimal value and dividend strategy. Numerical analysis illustrates how model parameters affect the optimal dividend regions.

[73] arXiv:2611.17657 [pdf, html, other]
Title: Schreier Sets And the Product of Fibonacci And Catalan Numbers
Kevin Beanland, Hung Viet Chu, Carrie E. Finch-Smith
Comments: 9 pages
Subjects: Combinatorics (math.CO)

First, we introduce strictly super-Schreier sets, which provide a new combinatorial interpretation of products of Fibonacci and Catalan numbers. Second, we show that the numbers of sets in higher-order Schreier families do not satisfy any linear recurrence relation, thus answering a question in the existing literature.

[74] arXiv:2611.17664 [pdf, html, other]
Title: The elephant random walk with proportionally growing recent memory
Zhishui Hu, Shuwen Xue
Subjects: Probability (math.PR)

In this work, we study an elephant random walk with recent restricted memory, where at step $n$ the elephant remembers only the last $m_n=\max\{\lfloor cn\rfloor,1\}$ steps for $c\in(0,1)$. We show that the random walk undergoes a phase transition at the critical point $p_c=(3+\sqrt{1-c})/4$, which depends on the memory proportion $c$. For $0<p<p_c$, $S_n/\sqrt{n}$ is asymptotically normal; for $p=p_c$, $S_n/\sqrt{n\log n}$ is asymptotically normal; and for $p_c<p<1$, $S_n/n^{\rho}$ converges almost surely and in $L^2$ to a random variable for some constant $\rho\in (1/2, 1)$. This phase transition differs from that of the classical elephant random walk and its remote-memory counterpart, both of which have the same fixed critical point $3/4$.

[75] arXiv:2611.17668 [pdf, html, other]
Title: Strong solutions to the Cahn--Hilliard--Darcy--Forchheimer system for incompressible two-phase flows with a soluble surfactant
Maurizio Grasselli, Bohan Ouyang, Hao Wu
Subjects: Analysis of PDEs (math.AP)

We study a diffuse-interface model for incompressible viscous two-phase flows with a soluble surfactant in a bounded porous medium in two or three dimensions. The resulting system consists of a Darcy--Forchheimer equation for the seepage velocity $\bm{u}$ coupled with two Cahn--Hilliard equations, one for the difference in volume fractions of the two fluids denoted by $\phi$, and the other for the local concentration of the surfactant $\psi$. In the general scenario of non-constant coefficients and mobilities, we establish the existence of a local (resp. global) strong solution in three (resp. two) dimensions to the corresponding initial-boundary value problem with the no-flux boundary conditions for the phase-field variables and chemical potentials and a no-penetration condition for the velocity. In the case of constant coefficients in the Darcy--Forchheimer equation and constant mobilities in the Cahn--Hilliard equations, with a suitably large Forchheimer exponent, we establish the existence of a global strong solution in three dimensions. Furthermore, using the Łojasiewicz--Simon approach, we prove the global existence of a unique strong solution when the initial data are sufficiently close to a local energy minimizer of the free energy.

[76] arXiv:2611.17677 [pdf, html, other]
Title: Folding of cluster algebras
Woo-Seok Jung, Se-jin Oh
Comments: 116 pages, with background material, detailed explanations, and many examples to help readers understand the results
Subjects: Representation Theory (math.RT); Quantum Algebra (math.QA)

We develop a general framework for folding cluster algebras from simply-laced Cartan data equipped with admissible finite-group actions. For arbitrary finite sequences, we establish folding of root data, compatible pairs, $\bfi$-box seeds, and their individual cluster variables, without reducedness, finite-type, or acyclicity assumptions. In the reduced case, the folding is realized through quantum unipotent coordinate algebras and is compatible with dual PBW generators. It sends cluster monomials associated with canonical lifted $\bfi$-box seeds to elements of the classical dual canonical basis for the quotient Cartan datum. For arbitrary positive braids in finite Cartan type, the folding is realized through quantum virtual Grothendieck rings and, after specialization at $q=1$, is induced by a single ambient Grothendieck-ring homomorphism. Finally, for arbitrary symmetrizable Cartan data and arbitrary positive braids, we prove that the Laurent homomorphism identifying corresponding seed variables restricts to a surjective algebra homomorphism between the corresponding cluster algebras. We also extend the Kimura--Oya quantum twist automorphisms to arbitrary positive braids after localization at the frozen variables, and prove that their commutative specializations commute with the folding homomorphisms.

[77] arXiv:2611.17678 [pdf, html, other]
Title: Nonexistence of a quasi-symmetric $2$-$(33,15,35)$ design
Masaaki Harada
Subjects: Combinatorics (math.CO); Information Theory (cs.IT)

It is shown that there exists no quasi-symmetric $2$-$(33,15,35)$ design with intersection numbers $6$ and $9$. This is proved by considering the ternary code generated by the incidence vectors of the blocks and its dual code.

[78] arXiv:2611.17682 [pdf, html, other]
Title: Agent-written heuristics versus commercial solvers on unsolved job-shop benchmark instances
Andre Albrecht, Enzo Morosini Frazzon, Leandro C. Coelho, Bruno Vieira
Comments: 27 pages, 4 figures, 14 tables. Submitted to International Transactions in Operational Research. Data, schedules, checkers and code: this https URL
Subjects: Optimization and Control (math.OC); Artificial Intelligence (cs.AI)

Commercial solvers are the standard tool for difficult scheduling problems. We study whether a frontier large language model, used as a coding agent with open-source tools only, can match them in quality and speed. We report every run, and independent checkers verify every schedule. On the 100,000-operation job shop tai_100_1000_1, an agent-written solver reached 525,515, below OptalCP, Hexaly, and CP Optimizer. Unchanged, it improved all ten instances of the family and closed two. With equal budgets on the same workstation, it ended 0.0-1.8% above the lower bound, against 2.6-5.8% for CP Optimizer and 2.4-4.4% for Hexaly. On the Behnke-Geiger flexible job shops, an agent-written tabu search improved 11 of 32 open instances. With two transport robots, an agent-written solver improved seven of ten MKT instances. New lower bounds show that four published MKT values cannot be attained on the distributed instance files. Agent-run improvement campaigns closed eight further instances.

[79] arXiv:2611.17683 [pdf, html, other]
Title: delta-Derivations of Finite-Dimensional Simple Lie Algebras with Values in Arbitrary Modules
Lulu Jiang, Dong Liu, Yufeng Pei
Comments: Latex, 21 pages
Subjects: Rings and Algebras (math.RA); Mathematical Physics (math-ph); Representation Theory (math.RT)

We determine the spaces of \(\delta\)-derivations of finite-dimensional complex simple Lie algebras with values in arbitrary modules for \(\delta\ne0,1\). In rank at least two, these derivations vanish unless \(\delta=\frac{1}{2}\), in which case they are precisely the module homomorphisms from the adjoint module. For \(\mathfrak{sl}_2\), we characterize the derivation spaces in terms of Casimir eigenspaces and determine when they are nonzero. When the coefficient module is simple, every nonzero derivation module is simple except possibly at \(\delta=2\), where it has a simple essential socle with a finite-dimensional semisimple quotient. We describe these modules via translation functors and give explicit formulas for the derivations.

[80] arXiv:2611.17685 [pdf, html, other]
Title: Semistable 1-Motives: Monodromy, Explicit Periods, and Local Duality
Mohammadreza Mohajer
Subjects: Number Theory (math.NT); Algebraic Geometry (math.AG)

Let $K/\mathbf Q_p$ be unramified, with $p>2$. For a $1$-motive with constant lattice, split torus, and good abelian quotient, we compute the semistable extension complex from toric valuations and formal-group logarithms. A canonical monodromy boundary exists for every semistable representation; it detects splitting over crystalline periods and the increase in monodromy rank. For the stated $1$-motives, this boundary and the unramified quotient recover the restricted local Tate pairing, with exponential radicals. Nonsplit elliptic examples, Raynaud uniformization, and a height-one positive-period bound explain the geometric range. For toric motives we construct actual periods, convergent Robba bases, and integral action matrices. A toric basis family has perfect projective/trace-zero matrix duality, including its exact integral defect. An explicit residue-zero solution operator constructs every dual Herr class. Applied componentwise, the same operator gives relative full dual lifts for general constant-lattice $1$-motives once their coefficient sequence is specified. Finally, finite-base coefficient traces realize division-tower Iwasawa cohomology for any Tate lattice, and the period cup pairing equals the arithmetic group-ring pairing.

[81] arXiv:2611.17687 [pdf, html, other]
Title: Co-rotating and traveling asymmetric vortex sheets for the planar Euler equation
Edison Cuba
Comments: 42 pages
Subjects: Analysis of PDEs (math.AP)

The aim of this paper is to construct co-rotating and traveling vortex sheet pairs with asymmetric configurations for the two-dimensional incompressible Euler equation. The vorticity of these solutions is concentrated on two small closed curves of different sizes, which carry vortex sheets of different circulations and either rotate uniformly about their centroid or translate with constant speed. The proof relies on the Birkhoff--Rott formulation of the problem and on the implicit function theorem at the point vortex pairs.

[82] arXiv:2611.17694 [pdf, html, other]
Title: Admissible Yang--Baxter equation for Nijenhuis perm superalgebras
Imed Basdouri, Bouzid Mosbahi, Yuanyuan Zhang
Comments: Comments are welcome!
Subjects: Rings and Algebras (math.RA); Representation Theory (math.RT)

We develop a superization of the theory of admissible Yang--Baxter equations for Nijenhuis perm algebras initiated by Ma and Song. We introduce Nijenhuis perm superalgebras, their representations, and the dual representation, with Koszul signs chosen so that the contraction of the Yang--Baxter tensor matches the $\mathcal O$-operator equation exactly. We define Nijenhuis perm superbialgebras and characterise them by matched pairs. In the coboundary case, we show that every even supersymmetric solution of the $S$-admissible perm Yang--Baxter equation gives rise to a Nijenhuis perm superbialgebra, and we give sufficient conditions for a perm superalgebra to admit a Nijenhuis operator constructed from such a solution. Examples with purely odd components illustrate the role of the grading.

[83] arXiv:2611.17697 [pdf, html, other]
Title: Numerical verification for harmonic maps: Counterexamples to Eells' conjecture
Edward Hirst, Daniel Platt, Henrique N. Sá Earp, Jakob Stein
Subjects: Differential Geometry (math.DG)

This paper develops a framework to construct harmonic maps $S^3 \rightarrow S^2$ numerically, which is used to construct approximate harmonic maps in homotopy classes with Hopf invariant $2,3,4,5,6$. By using a rigorous fixed-point argument, it is shown that there exist genuine harmonic maps with the same Hopf invariant close to these approximate solutions, thus producing a family of counterexamples to Eells' conjecture, and the related Ding's conjecture.

[84] arXiv:2611.17700 [pdf, html, other]
Title: A Unified Framework for First- and Second-Order Energy-Stable Parametric Finite Element Methods for Planar Willmore Flow
Xiaoli Li, Yujing Yan
Subjects: Numerical Analysis (math.NA)

The construction of structure-preserving schemes for planar Willmore flow that are second-order accurate in time and avoid large coupled nonlinear solves remains challenging. In this work, we develop a unified framework for first- and second-order fully discrete energy-stable parametric finite element schemes for planar Willmore flow with a length-penalization term. The framework is based on a new equivalent reformulation involving a global auxiliary variable. The main novelty lies in the second-order construction, which combines midpoint curvature quantities weighted by elementwise arc-length Jacobian ratios with a compatible discrete tangent to obtain exact discrete chain rules for the bending energy and curve length. A further contribution is to show that both schemes satisfy discrete modified energy dissipation laws that yield the same type of a priori bounds on the discrete solution as the original energy law. They also retain Barrett--Garcke--N{ü}rnberg tangential motion to promote favorable mesh distribution. Each stage reduces to two linear solves with exactly the same coefficient matrix and one scalar nonlinear solve. We rigorously prove unique solvability of the linear subproblems under suitable assumptions and derive computable sufficient conditions for local existence and uniqueness of the scalar solution near unity. Numerical experiments demonstrate the expected temporal accuracy, energy dissipation, good mesh quality and computational efficiency.

[85] arXiv:2611.17702 [pdf, html, other]
Title: General linear groups in tangent categories
Marcello Lanfranchi
Subjects: Category Theory (math.CT)

General linear groups are well-studied Lie groups that encode the linear symmetries of a finitely-dimensional linear space. In differential geometry, they are an important ingredient of various constructions, including fibre bundles and the frame bundle of a principal bundle. They also appear in algebraic geometry as affine group schemes. Their Lie algebra, known as the general linear Lie algebra, is isomorphic to the Lie algebra of square matrices, whose Lie bracket is given by the commutator. Building on previous work on Lie groups, in this paper we introduce general linear group objects in the context of tangent categories. We define the general linear group of a differential object as a classifier of the Kleisli parametrized linear automorphisms of the differential object, a class of maps that generalize linear automorphisms in a suitable sense. We prove that such a group can be entirely constructed via a tangent triple equalizer and use this characterization to prove that the Lie algebra of general linear group objects is isomorphic to the Lie algebra of linear endomorphisms.

[86] arXiv:2611.17706 [pdf, html, other]
Title: Refined random matrix conjectures for zeros of $p$-adic $L$-functions
Heiko Knospe, Jiahe Shen, Roger Van Peski
Comments: 68 pages, 12 figures. Supplementary file this http URL contains all averages plotted on these figures. Code used for p-adic L-function computations is available at this https URL
Subjects: Number Theory (math.NT); Probability (math.PR)

We make and test the conjecture that for $p$-adic $L$-functions associated to quadratic Dirichlet characters and their Teichmüller twists, all local statistics of zeros in the unit disk match those of $p$-adic random matrix eigenvalues. This generalizes the case of the number of zeros in the unit disk previously conjectured by Ellenberg-Jain-Venkatesh, which was well-supported by numerics, as well as the case of the discriminant, where their numerics were more ambiguous.
Using recent random matrix results on local statistics of eigenvalues, we make the random matrix prediction explicit for many statistics, analogous to local densities and pair-correlations in the complex setting. To test these, we compute data on $p$-adic $L$-functions for characters of conductor up to $10^7$, and for certain statistics in windows above $10^{10}$. We find good agreement with the new random matrix predictions for these statistics, as well as for the discriminant.

[87] arXiv:2611.17714 [pdf, html, other]
Title: Online Carbon-Aware Power Flexibility Quantification of Distributed Data Centers
Xiaowei Wang, Yue Chen
Comments: 12 pages, 12 figures
Subjects: Optimization and Control (math.OC)

Geographically distributed data centers (DCs) can provide spatio-temporal power flexibility to electric grids through the coordinated management of computing resources and energy. Beyond their energy consumption, the carbon footprints of DCs are non-negligible, which constrain the power flexibility that DCs can offer to the power grid. To address this challenge, this paper proposes a carbon-aware power flexibility quantification framework for DCs. We first develop an optimization model that characterizes DC power flexibility in a grid-usable form, namely the Cartesian product of adjustable power demand intervals across time slots. An online algorithm based on Lyapunov optimization is then designed to solve the flexibility quantification model in real time under uncertain workload arrivals and fluctuating grid carbon intensity. Furthermore, an integrated disaggregation and feedback mechanism is devised to translate the power system operator's dispatch commands into real-time DC operating decisions and to capture their impact on future DC flexibility. Several desirable properties of the proposed model and method are proven, including disaggregation feasibility, bounded workload processing delays, and a bounded suboptimality gap. Numerical simulations demonstrate that our approach effectively unlocks DC power flexibility while satisfying carbon emission constraints, outperforming baseline algorithms.

[88] arXiv:2611.17716 [pdf, html, other]
Title: Cubic local observability of Gaussian-blind sources in thermal $ϕ^4_2$ fields
Rubin Zhang, Ning Zhang
Subjects: Probability (math.PR); Mathematical Physics (math-ph)

We study external sources that are invisible to a spatially local observation in a massive Gaussian thermal field on a circle. A quadratic-reference calibration removes the first-order thermal mass-shift signal. For the resulting quartic model we prove a cutoff-independent, source-uniform $C^1$ expansion of local Wick cubic means. Its leading operator has the time-integrated cube of the thermal covariance as its kernel. A positive bilateral Laplace representation proves injectivity on the entire external source space, while analyticity gives exponential singular-value upper bounds. The expansion yields local Araki relative-entropy lower bounds on every fixed finite-dimensional source space, and a uniform separation theorem at every prescribed Sobolev resolution. Under an additional interval-length condition, a reflection-positivity identity yields an explicit, nonoptimal double-logarithmic conditional stability bound for this specific thermal kernel. Continuum probability estimates and the integrability assumptions of the Feynman--Kac--Nelson construction are verified in Section~3.

[89] arXiv:2611.17719 [pdf, html, other]
Title: The non-stationary $\widehat{\mathfrak{gl}}_N$ affine Laumon function and its difference equation
Philippe Di Francesco, Rinat Kedem
Comments: 39 pages, 3 figures
Subjects: Mathematical Physics (math-ph); Quantum Algebra (math.QA); Representation Theory (math.RT)

We present an explicit $q$-Givental type formula for the $\widehat{\mathfrak{gl}}_N$ non-stationary affine relativistic Toda or affine Laumon function introduced by Shiraishi. We prove the conjecture of [J. Shiraishi, Affine screening operators, affine Laumon spaces and conjectures concerning non-stationary Ruijsenaars functions. J. of Int. Systems, 4 (2019)], that this function obeys a non-stationary difference equation involving an operator $\widehat{\mathcal T}$, which represents a quiver automorphism (Dehn twist) of the quantum cluster algebra of the affine $A_{N-1}^{(1)}$ Q-system.

[90] arXiv:2611.17727 [pdf, html, other]
Title: Proximal Adam algorithm for nonsmooth composite optimization and linear convergence under proximal PL geometry
Xiaopeng Zhu, Zhongyi Huang
Comments: 27 pages,3figures
Subjects: Optimization and Control (math.OC); Numerical Analysis (math.NA)

We analyze Adam-type methods for nonsmooth composite optimization problems $\min_x\Phi(x)=f(x)+h(x)$, where $f$ is smooth and $h$ is convex, proper, and lower semicontinuous. The nonsmooth term is treated by a metric-weighted proximal map, while the smooth term is preconditioned by the Adam second-moment matrix. We prove a composite descent lemma whose constants depend explicitly on the spectral bounds of the adaptive metric and a residual--step equivalence that converts proximal step decay into subgradient stationarity. These yield an $O(1/N)$ bound on the minimum proximal stationarity residual for the deterministic proximal normalized gradient method without convexity of $f$, and the same $O(1/N)$ rate for proximal Adam under quantitative momentum-alignment and residual-coherence conditions together with a metric-compatibility condition. By estimating the momentum error directly, the same $O(1/N)$ rate is also obtained without the momentum-alignment and residual-coherence assumptions. When the composite objective satisfies a proximal Polyak--Łojasiewicz inequality, both algorithms and the relaxed proximal Adam scheme converge linearly with explicit contraction factors. Numerical experiments on a diagonal Lasso problem, two-dimensional image TV denoising, and two-dimensional elastic parameter identification illustrate the predicted stationarity and linear rates.

[91] arXiv:2611.17732 [pdf, other]
Title: Rigidity for pivotal braided r-categories of moderate growth and applications to vertex operator algebras
Robert McRae
Comments: 29 pages
Subjects: Quantum Algebra (math.QA); Mathematical Physics (math-ph); Category Theory (math.CT); Representation Theory (math.RT)

Let $\mathcal{C}$ be an abelian pivotal braided r-category with simple unit object $\mathbf{1}$ over any field. We present a ChatGPT-generated proof, prompted by Bin Gui, that any object $X$ in $\mathcal{C}$ of moderate growth, in the sense that $\dim\mathrm{End}(X^{\otimes n})<n!$ for some $n\in\mathbb{Z}_{\geq 1}$, is rigid. The proof crucially uses ideas from the recent proof of Etingof and Penneys that $X$ is rigid if it is also non-negligible, that is, $X\otimes Y$ contains $\mathbf{1}$ as a direct summand for some object $Y$. In the present paper, the non-negligible assumption is removed using a rigidity criterion developed previously by the author for use in non-semisimple categories. We also present a variant result (found without further AI assistance) that $X$ is also rigid if $\dim\mathrm{Hom}((DX)^{\otimes n}\otimes X^{\otimes n},\mathbf{1})<n!$ for some $n\in\mathbb{Z}_{\geq 1}$, where $D$ is the Grothendieck-Verdier duality functor of $\mathcal{C}$. Using this variant, we show that if $V$ is a simple self-contragredient vertex operator algebra such that the category $\mathcal{C}^1_V$ of $C_1$-cofinite grading-restricted generalized $V$-modules is closed under contragredient modules, then $\mathcal{C}^1_V$ is a locally finite $\mathbb{C}$-linear abelian rigid braided ribbon category. We also show that if $V$ is a simple $\mathbb{Z}_{\geq 0}$-graded self-contragredient $C_2$-cofinite vertex operator algebra, then the category of all grading-restricted generalized $V$-modules is a (not necessarily semisimple) modular tensor category.

[92] arXiv:2611.17734 [pdf, html, other]
Title: Global generation of coinvariant vector bundles on $\overline{\mathrm{M}}_{0,n}$
Avik Chakravarty, Jianqi Liu
Subjects: Algebraic Geometry (math.AG); Quantum Algebra (math.QA)

Using fusion closed-ness and strong generation properties, we identify collections of modules over vertex operator algebras (VOAs) whose induced vector bundles of coinvariants on the moduli space $\overline{\mathrm M}_{0,n}$ of stable $n$-pointed curves of genus zero are globally generated. These results specialize to \cite{Fak12} for affine VOAs at positive integer levels, and of \cite{DG23} for strongly rational VOAs that are generated in degree 1. To illustrate the results, and to show that fusion-closedness is essential, we give numerous examples, including Lattice VOAs, Simple Current Extensions of Affine VOAs, and various tensor products.

[93] arXiv:2611.17736 [pdf, html, other]
Title: High-probability convergence of adaptive, proximal, and clipped Adam-type methods for nonconvex stochastic optimization
Xiaopeng Zhu, Zhongyi Huang
Comments: 30 pages, 7 figures
Subjects: Optimization and Control (math.OC); Numerical Analysis (math.NA)

This paper develops a unified high-probability analysis of adaptive, proximal, and clipped first-order methods for nonconvex stochastic optimization. For a smooth objective whose stochastic gradient error has sub-Gaussian norm, the normalized adaptive gradient method attains the standard stochastic nonconvex complexity of the square root of the number of iterations, with an additional logarithmic dependence on the inverse confidence level that is inversely proportional to the number of iterations. The proof uses an adaptive descent decomposition together with Freedman and Bernstein concentration inequalities. The same guarantee is established for the full adaptive moment method under an explicit momentum-alignment condition. The analysis is extended to projected and proximal updates through a stationarity measure based on the subdifferential distance, to objectives satisfying the Polyak-Lojasiewicz condition, and to heavy-tailed noise through truncation. The framework is applied to stochastic inverse problems in elasticity, and numerical experiments illustrate the theoretical scaling and the practical behavior of the methods.

[94] arXiv:2611.17744 [pdf, html, other]
Title: Minimaxity in Robust Nonparametric Regression: from Heavy-Tailed to Sub-Gaussian Assumptions
Yikun Li, Matey Neykov
Comments: 50 pages
Subjects: Statistics Theory (math.ST)

We study nonparametric regression over star-shaped function classes under strong adversarial contamination. The clean (original) observations $(\tilde{X} _{i},\tilde{Y} _{i})_{i=1} ^{n}$ are i.i.d. and satisfy $\tilde{Y} _{i}=f ^{*}(\tilde{X} _{i})+\xi _{i}$, where $f ^{*}\in \mathcal{F}$, $\tilde{X}$ is distributed as $\mathbb{P} _{X}$, and the noise is conditionally centered. An adversary may inspect the clean sample and replace at most $\lfloor \epsilon n\rfloor$ observation pairs. We assume that $\mathcal{F}\subset L _{2}(\mathbb{P} _{X})$ is star-shaped with finite diameter $d$.
Under a Bernstein-type moment condition on function increments and a bounded conditional second moment for the noise, we establish the matching lower and upper bounds of order $\left((\eta ^{*}) ^{2} \vee \epsilon \right)\wedge d ^{2}$, uniformly over admissible star-shaped function classes, therefore characterizing the minimax rate of estimation error, where \begin{equation*}
\eta ^{*}:=\sup\left\{\eta >0: n\eta^2\leq\log \mathcal M _{\mathcal{F}}^{\text{loc}}(\eta,c)\right\}. \end{equation*} Here $\log \mathcal{M} _{\mathcal{F}} ^{\text{loc}}(\eta,c)$ denotes the local metric entropy of $\mathcal{F}$ in $L _2(\mathbb{P} _{X})$, and $c$ is a sufficiently large constant. Under a uniform relative sub-Gaussian condition on function increments and noise, the lower bound is adjusted to $\left((\eta ^{*})^{2}\vee \epsilon ^{2}\right)\wedge d ^{2}$ while the upper bound improves to $\left((\eta ^{*})^{2}\vee \epsilon ^{2}\log ^{2}\left(\frac{e}{\epsilon }\right)\right)\wedge d ^{2}$, yielding minimax optimality up to logarithmic factors.

[95] arXiv:2611.17745 [pdf, html, other]
Title: The Polyak-Łojasiewicz Paper: A 10-Year Retrospective
Hamed Karimi, Julie Nutini, Mark Schmidt
Comments: 20 pages, 6 figures
Subjects: Optimization and Control (math.OC); Machine Learning (cs.LG); Machine Learning (stat.ML)

In 2016, we wrote a paper introducing the phrase "Polyak-Lojasiewicz (PL) condition" for an old idea, unsure of how readers would react. The paper ultimately had a larger impact than we expected, and we are surprised and honoured to receive the 2026 PKDD ECML Test of Time Award. With 10 years of hindsight, this note offers an informal and candid retrospective on the PL condition. We take a look back at the origins of the paper, give an AI-assisted refined version of the main theorem, review criticisms of the work, and discuss a variety of related ideas and extensions.

[96] arXiv:2611.17748 [pdf, html, other]
Title: Exponential Double and Multiple Riordan Arrays as Fiber Products
Tian-Xiao He
Subjects: Combinatorics (math.CO)

A double Riordan array has nonzero entries only in positions $(n,k)$ with $n+k$ even, and its even and odd parts are Riordan arrays with the same multiplier function. We develop this observation systematically, with the emphasis on exponential double and exponential multiple Riordan arrays. Using generalized Riordan arrays with respect to a sequence $(c_n)$, we show that the double Riordan group, the exponential double Riordan group, the multiple Riordan group, and the exponential multiple Riordan group are fiber products of (generalized) Riordan groups over the Lagrange group. For exponential double and exponential multiple Riordan arrays this yields product and inverse formulas without square or $\ell$th roots, valid over any field of characteristic zero; an abelian normal subgroup with quotient the Lagrange group and a corresponding splitting; subgroups isomorphic to the Riordan group; an iterated split-extension description of the multiple groups; and a characterization of elements of finite order, including the fact that over ${\mathbb R}$ every element of finite order is an involution. We show that the $\ell$th power of the production matrix is the direct sum of the production matrices of the compressions, give an explicit formula for it in terms of partial Bell polynomials, and characterize these arrays by a shared $A$-sequence. Finally, we reverse the construction. Two Riordan arrays with a common multiplier can always be interleaved into a unique double Riordan array, and into an ordinary Riordan array exactly when their first functions satisfy one more condition. Examples include Pascal-, Catalan-, Morgan--Voyce-, and ballot-type arrays.

[97] arXiv:2611.17750 [pdf, html, other]
Title: One-bubble stability, reduced coefficients, and threshold compactness for the Escobar functional
Mayukh Mukherjee, Utsab Sarkar
Comments: 57 pages. Split from arXiv:2601.22665v2 (Part 2/3). Final part forthcoming. Comments welcome!
Subjects: Differential Geometry (math.DG); Analysis of PDEs (math.AP); Classical Analysis and ODEs (math.CA)

Let $(M^n,g)$ be a smooth compact manifold with nonempty boundary and coercive conformal energy. For $n\ge5$, in a conformal representative with $H_g=0$, we prove quantitative stability near a concentrating boundary bubble whose center stays away from the umbilic locus. The norm of the constrained gradient controls the distance to the standard bubble family with sharp exponent $1/2$, and the distance to the Lyapunov--Schmidt corrected family linearly. In the same one-bubble neighborhood, at energies at least the sharp hemisphere value $S_\ast$, the distance to the standard family is also controlled linearly. These estimates follow from the exact reduced quadratic coefficient and the scale-derivative expansion of the reduced functional. The same scale equation shows that sequences of critical points at $S_\ast$ can concentrate only at umbilic points. For $n\ge3$, a profile decomposition without a sign assumption gives Palais--Smale compactness between $S_\ast$ and the first mixed level $(S_\ast^{n-1}+Y^{n-1})^{1/(n-1)}$, where $Y=C^*_{\text{Esc}}(M,g)$, and this endpoint is sharp. Between $S_\ast$ and the two-bubble level, we characterize noncompact levels by the lower critical values. For $n\ge7$, we obtain the fourth-order reduced expansion at umbilic centers. Under local total umbilicity, we evaluate the correction exactly, determine the conformal weight of the reduced coefficient, and obtain the optimal algebraic comparison with the squared ambient Weyl norm.

[98] arXiv:2611.17759 [pdf, html, other]
Title: Convergence analysis of physics-informed neural networks for subdiffusion
Bangti Jin, Qiqi Rao, Zhi Zhou
Subjects: Numerical Analysis (math.NA)

Physics-informed neural networks have emerged as mesh-free solvers for partial differential equations, yet their rigorous convergence theory for time-fractional problems remains limited. We present a convergence analysis of PINNs for linear subdiffusion equations and for the associated backward problem of recovering the initial data from terminal observations. To address the nonlocality and weakly singular kernels of fractional derivatives, we introduce a discretization-based PINN framework built on some popular time-stepping schemes satisfying discrete maximal regularity, including backward Euler, BDF2, L1, and fractional CN schemes. This approach avoids the exact evaluation of fractional derivatives at training points while preserving the stability structure needed for convergence analysis. For the forward problem, we prove that, under the natural fractional maximal-regularity condition $u\in W^{\alpha,p}(0,T;L^2(\Omega))\cap L^p(0,T;H^2(\Omega)\cap H_0^1(\Omega))$, the piecewise linear temporal reconstructions of PINN-loss minimizers converge to the exact solution. This result avoids the higher-order regularity assumptions on the exact solution that are often imposed in existing PINN convergence analyses. We also verify the required discrete maximal regularity and consistency properties for the aforementioned popular time discretizations. We then extend the analysis to the backward subdiffusion problem and establish convergence of the regularized recovery of the initial data from terminal observations, despite its ill-posedness. Numerical experiments for both forward and backward problems support the theoretical results, demonstrate the necessity of regularization, and show that $L^2$-type losses alone are generally insufficient. These results establish a rigorous theoretical basis for discretization-based PINNs for time-fractional diffusion problems.

[99] arXiv:2611.17764 [pdf, html, other]
Title: Rational lines on pairs of quadrics and cubic hypersurfaces
Tim Browning, Stephanie Chan, Nick Rome
Comments: 12 pages
Subjects: Number Theory (math.NT); Algebraic Geometry (math.AG)

We study rational lines on smooth intersections of two quadrics and on smooth cubic hypersurfaces over number fields. For an intersection of two quadrics in $n$ variables, we prove the Hasse principle and weak approximation for the variety of lines when $n\geq 11$, and more generally for the variety of $r$-planes when $n\geq 3r+8$. In this range an $r$-plane exists over the ground field if and only if one exists over every real completion. For the variety of lines, we also prove the Hasse principle and weak approximation when $n\geq 8$, conditional on the finiteness of certain Tate-Shafarevich groups. For a smooth cubic hypersurface in $n$ variables, we prove that a line exists over the ground field when $n\geq 23$.

[100] arXiv:2611.17765 [pdf, html, other]
Title: Toward the Minimal Set of Information Inequalities in Regenerating Codes: An Algebraic Approach
Rui-Juan Jing, Laigang Guo, Yan-Feng Xie, Chun-Ming Yuan
Subjects: Information Theory (cs.IT)

Information-theoretic outer bounds for exact-repair regenerating codes can be formulated as linear programs, but the associated Shannon-type systems contain many implicit equalities and redundant inequalities. We directly specify a reduced system for the $(n,n-1,n-1)$ exact-repair model using the closure structure induced by its repair dependencies. Nonempty closed sets index the reduced joint-entropy coordinates, and inseparable edges determine the defining inequalities. We prove equivalence with the initial system by characterizing its implicit equalities and establishing sufficient redundancy criteria. We also give an algorithm that constructs the directly defined system for any $n$, count its entropy coordinates, and derive an explicitly computable upper bound on its number of inequalities. For every $n\ge2$, we prove that the reduced system has no implicit equalities and that each distinct defining inequality is nonredundant and defines a facet in the nonempty closed-set coordinate space. Exact enumerations for $n\in\{2,3,4,5\}$ verify the reported system sizes.

[101] arXiv:2611.17773 [pdf, html, other]
Title: Compatible by Construction: Bottom-Up Nonlinear Model Reduction without Interface Bases
Youngkyu Kim, Youngsoo Choi
Subjects: Numerical Analysis (math.NA)

Nonlinear manifolds can provide compact representations of solutions to partial differential equations (PDEs), but generating training data and learning these representations on large domains remain costly. We present a bottom-up framework that reuses local nonlinear representations learned on a small training domain to solve larger PDE systems. A shared nonlinear decoder represents the full set of degrees of freedom owned by each subdomain, without separate interior and interface models. Each global degree of freedom has a unique owner, and local residuals directly use decoded state values from the corresponding neighboring subdomains. The resulting discrete state is single-valued by construction, eliminating the need for independent interface copies and additional interface compatibility constraints. Physical coupling is retained through the original time-discrete PDE residual. With the decoder held fixed, the subdomain-specific reduced coordinates are determined jointly by minimizing this residual, and the Gauss--Newton system is assembled from local contributions. Experiments on parameterized viscous Burgers and incompressible Navier--Stokes problems demonstrate reuse on larger domains without retraining. Comparisons with local proper orthogonal decomposition models under the same coupling construction show favorable accuracy--efficiency trade-offs in the tested regimes.

[102] arXiv:2611.17782 [pdf, html, other]
Title: Exceptional sequences of line bundles on $\mathrm{Fl}(1,\ell;\ell+1)$
Likai Yang
Comments: 20 pages
Subjects: Algebraic Geometry (math.AG)

Let $X_\ell=\mathrm{Fl}(1,\ell;\ell+1)\subset\mathbb{P}^\ell\times(\mathbb{P}^\ell)^\vee$ be the incidence variety of points and hyperplanes in $\mathbb{P}^\ell$. We prove that for every $\ell\ge 3$, every exceptional sequence of line bundles on $X_\ell$ of maximal length $\ell(\ell+1)=\operatorname{rk} K_0(X_\ell)$ is full. Together with the case $\ell=2$, due to Altmann, Hochenegger and Witt, this shows that for all $\ell\ge2$ an exceptional sequence of line bundles on $X_\ell$ is full if and only if it has maximal length. The proof translates exceptionality into a combinatorial condition on lattice points of $\operatorname{Pic}(X_\ell)\cong\mathbb{Z}^2$ and reduces fullness to sequences containing a non-orthogonal descent. A capacity count for admissibly ordered subsets rules out all but one family of descents; for that family we classify the possible configurations and verify generation using Euler sequences and Koszul complexes.

[103] arXiv:2611.17783 [pdf, html, other]
Title: Entire curves in surface bundles over tori
Anthony Nguyen
Comments: Comments are welcome!
Subjects: Symplectic Geometry (math.SG)

Cattalani recently initiated the study of Ahlfors currents in symplectic topology. We combine these with the symplectic pairs of Bande-Kotschick to show that some non-trivial surface bundles over tori have pseudoholomorphic entire curves. In particular the Kodaira-Thurston manifold has an entire curve for every $J$ tamed by an invariant form.

[104] arXiv:2611.17791 [pdf, html, other]
Title: Domains of attraction of quasi-stationary distributions for an absorbed random walk
Phil. Pollett
Subjects: Probability (math.PR)

We study a continuous-time random walk on the positive integers, killed at zero, where the downward rate $a$ and upward rate $b$ satisfy $a>b>0$. Its quasi-stationary distributions form a one-parameter family. We show that if the initial distribution $(m_n)_{n\geq 1}$ is strictly positive and satisfies $m_{n+1}/m_n\to r$, where $(b/a)^{1/2}<r<1$, then its conditional distribution given survival converges in total variation to the corresponding nonminimal quasi-stationary distribution. We obtain asymptotic equivalents for the joint probabilities of position and survival, and for the survival probability itself. We also give a moment condition under which the minimal quasi-stationary distribution is selected. Finally, we construct an initial distribution whose successive-term ratios do not converge but whose conditional distribution nevertheless converges to a nonminimal quasi-stationary distribution. Thus the ratio condition is sufficient but not necessary.

[105] arXiv:2611.17792 [pdf, html, other]
Title: The Dirichlet Problem for Quaternionic $k$-Hessian Equations
Xi-Nan Ma, Yang Zhou, Jingyong Zhu
Comments: 43 pages
Subjects: Analysis of PDEs (math.AP)

We study the Dirichlet problem for quaternionic $k$-Hessian equations on smooth bounded domains. For a smooth positive density $f(q,z)$ satisfying $f_z\ge0$, we prove existence and uniqueness of a smooth admissible solution whenever a smooth admissible subsolution with the prescribed boundary values exists. The proof extends the quaternionic Monge--Ampère subsolution method to $2\le k<n$ through boundary second derivative estimates. We also construct subsolutions on strictly quaternionic $(k-1)$-convex domains and characterize smooth solvability for constant boundary values.

[106] arXiv:2611.17799 [pdf, html, other]
Title: Localization for Lipschitz monotone quasi-periodic operators with power-law hopping
Hongyi Cao, Yunfeng Shi, Peizhen Wang
Comments: 35 pages
Subjects: Dynamical Systems (math.DS); Mathematical Physics (math-ph)

We prove spectral and dynamical localization for quasi-periodic operators on $\mathbb Z^d$ with Lipschitz monotone potentials and power-law hopping. For sufficiently small coupling, localization holds at every allowed phase whenever the hopping decay exponent $r$ exceeds the Diophantine exponent $\tau$. The proof is based on multiscale analysis with exponentially growing scales. We use homotopy in the coupling constant to select the local eigenvalue branches and Schur complement estimates to control the successive elimination of coordinates.

[107] arXiv:2611.17812 [pdf, html, other]
Title: Closed formulas for the permanents of structured matrices
M. Fazeel Anwar
Subjects: Combinatorics (math.CO); Representation Theory (math.RT)

We give finite formulas for permanents of structured matrices and prove polynomial bounds for their evaluation. Over any field, the permanent of a matrix of bounded rank-width can be computed from the matrix alone, answering a question of Lyaudet. In characteristic $p>0$, the bound is $p^{O(k)}n^{O(1)}$, where $k$ is the rank-width. In characteristic zero, a determinant formula treats Cauchy matrices with an added polynomial of fixed degrees in the row and column nodes. This includes polynomial perturbations of Hilbert matrices and dense Toeplitz and Hankel families. For ordered cuts we give a single determinant; in positive characteristic, rational diagonal sequences give a fixed rational generating function for the Toeplitz permanents. We also give formulas for cycle weights and hook immanants. For translation matrices we obtain signed determinant formulas and classify the supports for which the permanent is the coefficientwise absolute value of the determinant. Further formulas cover cyclic block matrices, residue supports, and bands bounded on one side.

[108] arXiv:2611.17813 [pdf, html, other]
Title: An accelerated multiobjective gradient flow with implicit Hessian-driven damping
Wen Jiang, Hao Luo
Subjects: Optimization and Control (math.OC); Dynamical Systems (math.DS)

In this paper, we propose an accelerated multiobjective gradient flow with implicit Hessian-driven damping for unconstrained convex multiobjective optimization problems in a real Hilbert space. The continuous flow is formulated as a system of two first-order equations involving only a single multiobjective projection operator and suitable time-scaling factors. Formally, it can also be expressed as a second-order system with explicit multiobjective Hessian-driven damping, which corresponds to the usual Hessian-driven damping introduced by Alvarez et al. [J. Math. Pures Appl., 81(8):747--779, 2002]. The first-order formulation, however, involves no Hessian term and can be regarded as an extension of the Hessian-driven Nesterov accelerated gradient flow by Chen and Luo [arXiv:1912.09276, 2019]. Assuming that the objective gradients are Lipschitz continuous on bounded sets and that the common lower level sets are bounded, we establish global existence in finite dimensions under suitable time-scaling conditions. An a priori energy estimate confines the solutions to a fixed bounded set, and a Lyapunov argument yields fast decay of a merit function and the KKT residual. Under an additional bound on the time-scaling factors, the trajectory of every global solution converges weakly to a weak Pareto point. Numerical tests illustrate the rapid residual decay and reduced oscillations.

[109] arXiv:2611.17829 [pdf, html, other]
Title: Contractions of realizations and differential invariants of the algebra sl(2,C)
M.Staryi, M. Nesterenko
Comments: 24 pages
Subjects: Mathematical Physics (math-ph); Analysis of PDEs (math.AP)

In this paper, we formalize a method for constructing limit transitions between local realizations of Lie algebras based on contractions of the corresponding algebras. In the complex holomorphic category, contractions of faithful realizations of the special linear algebra sl(2, C) to the complex three-dimensional Poincaré algebra and the Weyl-Heisenberg algebra are explicitly constructed. For the contraction of a generating realization of the algebra sl(2,C) to the algebra g_{3.4}^{-1}, differential invariants are constructed and a limit system of Newtonian type is found.

[110] arXiv:2611.17839 [pdf, html, other]
Title: Weighted Euler transforms, real-rootedness, and $γ$-positivity
Yinuo Cheng, Guoce Xin
Comments: 16 pages
Subjects: Combinatorics (math.CO)

For $a>0$ and a polynomial $F$ of degree $m$, let $H_{a,F}$ denote the weighted Euler numerator of $F$, defined as the numerator of the generating function $\sum_{k\ge0}(a)_kF(k)x^k/k!$ with denominator $(1-x)^{a+m}$. For every $a>0$, we show the following preservation result: if the numerators $H_{a,F}$ and $H_{a,G}$ have only real nonpositive zeros, then the same holds for $H_{a,FG}$. The proof relies on an explicit multiplication formula in falling-factorial coordinates and a characterization of multiplier sequences for generalized Laguerre bases due to Brändén and Ottergren. Furthermore, when the symmetric degrees coincide with the ordinary degrees of the input polynomials, the same operation preserves $\gamma$-positivity. For positive integers $a=r$, the weight is the Ehrhart polynomial of the standard simplex $\Delta_{r-1}$. This yields geometric preservation theorems for products with a single simplex factor, as well as applications to Gorenstein polytopes and a Reeve tetrahedron example.

[111] arXiv:2611.17841 [pdf, html, other]
Title: Inequalities for intersection numbers from Hodge-Riemann relations
Xiangru Zeng
Subjects: Algebraic Geometry (math.AG); Commutative Algebra (math.AC)

We derived inequalities for intersection numbers of nef classes inside algebras satisfying the Kähler package, using Hodge-Riemann relations up to degree two. As an application, we construct certain strictly Lorentzian polynomials and show that they cannot be realized as the volume polynomial of nef classes inside such an algebra.

[112] arXiv:2611.17844 [pdf, html, other]
Title: A Helly theorem for the Bruhat-Tits building
Rudrendra Kashyap, Kiumars Kaveh, Christopher Manon, Boris Tsvelikhovskiy
Subjects: Algebraic Geometry (math.AG); Commutative Algebra (math.AC)

Let $K$ be a discretely valued field with valuation ring $\mathcal{O}$. We show that a finite family of $\mathcal{O}$-lattices in $K^m$ is adapted to a common basis if any subfamily of at most $m+1$ $\mathcal{O}$-lattices is. In other words, in the Bruhat-Tits building of $\operatorname{GL}(m)$, a finite family of simplices lies in a common apartment if and only if any subfamily of at most $m+1$ simplices does. The proof uses a version of Radon's theorem for $\mathcal{O}$-lattices. We also give an alternative proof using truncated modules.

[113] arXiv:2611.17847 [pdf, html, other]
Title: Projective surfaces with infinite fundamental group and trivial profinite completion
Wenchuan Hu, Peihan Wu
Comments: 11 pages
Subjects: Algebraic Geometry (math.AG)

For every nontrivial finite abelian group \(A\) of odd order, we construct a smooth complex projective surface with infinite topological fundamental group and trivial étale fundamental group. The isomorphism types of its finite subgroups are precisely those of the subgroups of \(A\). The surface is Kobayashi hyperbolic and has Stein universal cover.

[114] arXiv:2611.17848 [pdf, html, other]
Title: Extreme central $L$-values of almost prime quadratic twists of elliptic curves II
Shenghao Hua
Comments: 8 pages. Comments welcome
Subjects: Number Theory (math.NT)

We prove lower bounds for central $L$-values of quadratic twists of an elliptic curve by discriminants with at most five prime factors. Under the rank-zero Birch--Swinnerton-Dyer formula, these bounds give large Tate--Shafarevich groups.

[115] arXiv:2611.17855 [pdf, html, other]
Title: On configurations that are nearly generalised polygons
Sam Adriaensen, John Bamberg, Jason Williford
Comments: 14 comments
Subjects: Combinatorics (math.CO)

Payne (1972) introduced nearly generalised $n$-gons as $(s+1)$-regular bipartite graphs of girth $2n$ with small excess over the Moore bound. Biggs and Ito (1980) proved nonexistence of such graphs if $s > 1$ and $n > 3$, leaving open the existence of regular antipodal planes. We revisit this problem from several equivalent viewpoints. First we show that a regular antipodal plane of order $s$ is equivalent to a balanced weighing matrix whose support is the incidence matrix of a biplane with parameters \[
2-\left(\frac{s^2+s+2}{2},\,s+1,\,2\right). \] This gives short determinant and local-arithmetic obstructions to existence. We then formulate the question of signing a biplane as an affine linear system over $\mathbb F_2$, and use this formulation to prove that no regular antipodal plane of order $s$ exists with $4\le s\le 14$. Finally, we give further equivalent formulations in terms of sharply deranged families of permutations and mutually orthogonal array-bic squares. These translations provide new computational and structural approaches to Payne's conjecture that regular antipodal planes exist only for $s=2,3$.

[116] arXiv:2611.17861 [pdf, html, other]
Title: Ergodicity without monotonicity: patch-positive spin systems
Maciej Głuchowski, Georg Menz
Comments: 48 pages, 6 figures
Subjects: Probability (math.PR)

Monotonicity is the standard tool for proving that an interacting particle system is ergodic. What can replace it when the system is not monotone and its invariant measure is unknown? The simplest such systems are kinetically constrained models such as FA-1f and East exposed to noise. In these models vacancies enable updates, so adding vacancies should help the system forget its initial state. We prove this for a broad class of spin systems, which we call patch-positive. If vacancies are created spontaneously at a uniformly positive rate, the system converges to the same equilibrium from a large class of initial states, and from every initial state if the threshold density is at most $\tfrac12$ or the interactions are oriented. In particular, the East model with noise is ergodic at every density, and we obtain new cases of the positive-rates conjecture. The key idea is to compare the dual processes of the system with and without the added deaths.

[117] arXiv:2611.17884 [pdf, html, other]
Title: HOL in HOL: mechanized soundness, completeness and consistency, with and without infinity
Christoph Benzmüller (Otto-Friedrich-Universität Bamberg and Freie Universität Berlin), Daniel Kirchner (Otto-Friedrich-Universität Bamberg)
Comments: 23 pages, 1 figure. Formal proof artifacts: Archive of Formal Proofs entries HOL_in_HOL_Deep and HOL_in_HOL_Deep_Infinity_ZFC (Isabelle2026). Submitted
Subjects: Logic (math.LO); Logic in Computer Science (cs.LO)

What can a logic certify about a copy of itself? For Church's simple theory of types, formalized as a deep embedding in Isabelle/HOL with Henkin semantics and a natural-deduction calculus, the answer has two tiers. On the first tier, plain Isabelle/HOL certifies the logic without an axiom of infinity, by a standard model with one individual. On the second tier, the logic with a Dedekind-style axiom of infinity is certified only in Isabelle/HOL extended by a large enough set-theoretic universe. Both tiers appear in Harrison's self-verification of HOL Light. What the present formalization adds is Henkin completeness, and with it a semantics that matches the calculus exactly, compactness and model existence on the first tier, and the boundary between the tiers. Comparing two ways of adding infinity to the object logic shows where the boundary lies. One is an infinite domain of individuals, expressed by the first-order sentences "there are at least $n$ individuals", each of which has a finite model; the other is the Dedekind axiom, a single sentence with no finite model, and there the first tier ends. In the calculus the axiom is strictly stronger than the sentences together: it derives each of them, but they do not derive it. The witness is a countable Henkin model in which every sentence holds and the axiom fails, because its function domain is too sparse for an injective, non-surjective self-map. On the second tier, the universe serves one purpose only: to prove the Dedekind axiom consistent. Everything that follows, completeness and even the countable Henkin model of the axiom, is obtained in plain Isabelle/HOL. The universe axiom is Harrison-style, realized in Paulson's ZFC_in_HOL with the domain of every type in $V_{\omega+\omega}$; with it, full classical higher-order logic with infinity and relational choice is consistent relative to set theory.

[118] arXiv:2611.17885 [pdf, html, other]
Title: Goodman-type lower bounds for graph homomorphism densities
Taeyoung Kim
Comments: 35 pages, 2 figures, 1 table
Subjects: Combinatorics (math.CO)

For a finite graph $H$ with $v(H)$ vertices, chromatic number $\chi(H)$, and chromatic polynomial $P_H$, define $\Phi_H(p)=(1-p)^{v(H)}P_H((1-p)^{-1})$. This polynomial interpolates the homomorphism densities of $H$ in balanced complete multipartite graphons. We study the lower bound $t(H,W)\ge\Phi_H(p)$ on the homomorphism density of $H$ in graphons $W$ of edge density $p>1-1/(\chi(H)-1)$, which generalises Goodman's triangle bound. We prove the inequality for chordal graphs whose maximal cliques have equal size, for trivially perfect graphs, and for joins of a clique and an odd cycle. The proofs use entropy along clique trees and a convexity criterion for adding a universal vertex. We also prove that a nonbipartite graph satisfies the inequality at all sufficiently high edge densities if and only if its girth is odd. For a graph on $n$ vertices whose girth is odd, the bound holds whenever $p>1-(72n^{12})^{-1}$. The proof combines Whitney's forest expansion with a spectral comparison of cycle densities. Finally, among the $117$ nonbipartite graphs on at most six vertices with no isolated vertices or isolated edges, exactly $94$ satisfy the bound. The main results are formally verified in Lean 4.

[119] arXiv:2611.17891 [pdf, html, other]
Title: Non-vanishing of central $\rm GL_3$ L-values in the level aspect
Hui Wang, Shilun Wang
Comments: 61 pages. Comments welcome!
Subjects: Number Theory (math.NT)

We study non-vanishing of central standard $L$-values of spherical cuspidal $\mathrm{GL}_3$ newforms of prime level. A logarithmic Möbius mollifier with finite inverse Euler factors, combined with a conjugate term from the functional equation, gives a non-vanishing harmonic proportion of at least $1/2-\varepsilon$ for every $\varepsilon>0$ and all sufficiently large prime levels. The required mixed moment is evaluated by an asymmetric approximate functional equation.

[120] arXiv:2611.17893 [pdf, html, other]
Title: Fano-Enriques threefolds of Fano index $>1$
Kuzma Khrabrov
Subjects: Algebraic Geometry (math.AG)

We study $\mathbb{Q}$-Fano threefolds of Fano index greater than $1$ whose Weil divisor class group has nontrivial torsion. We give a complete list of their possible numerical types: there are $176$ of them, which refine to $182$ possible graded Hilbert series. At least $40$ numerical types are realised: $27$ by quotients of weighted complete intersections by cyclic groups, twelve by quotients of threefolds of codimension $4$ or $5$ and one by a quotient of the del Pezzo threefold of degree $5$. Seventy-two numerical types are shown not to occur. In particular the torsion subgroup need not have prime order, and the Weil and $\mathbb{Q}$-Fano indices can be $(1,2)$, $(1,3)$ or $(1,4)$.

[121] arXiv:2611.17901 [pdf, html, other]
Title: Chow Stability of Polarized K3 Surfaces with ADE singularities
Zhiyuan Li
Comments: 20 pages
Subjects: Algebraic Geometry (math.AG)

The asymptotic Chow stability of smooth polarized K3 surfaces is known through the existence of Ricci-flat metrics and Donaldson's theorem. We give a purely algebraic proof and extend the result to polarized K3 surfaces with at worst ADE singularities. The proof gives a uniform effective bound for the exponent, depending only on the degree of the polarization. Following the approach of Mumford and Morrison, we establish quantitative estimates for linear systems and their contributions to Chow weights, without restrictions on the Picard number.

[122] arXiv:2611.17911 [pdf, html, other]
Title: The speed of convergence for propagation of chaos in the mean-field Ising model
Jonas Jalowy, Matthias Löwe, Sara Terveer
Comments: 18p, comments always welcome!
Subjects: Probability (math.PR); Mathematical Physics (math-ph)

We derive sharp relative-entropy asymptotics for increasing propagation of chaos in the Curie--Weiss model at zero external field. For every fixed inverse temperature $0<\beta<1$, the relative entropy of a $k$-spin marginal with respect to the symmetric product measure is $$ \frac{\beta^2}{4(1-\beta)^2}\frac{k(k-1)}{N^2}+o\left(\frac{k^2}{N^2}\right),\qquad k=o(N). $$ At the critical inverse temperature $\beta=1$, the rate changes to $\alpha_{\mathrm c}^2 k(k-1)/(4N)+o(k^2/N)$ in the regime $k=o(\sqrt N)$, where $\alpha_{\mathrm c}$ is the second moment of the limiting quartic law of the rescaled magnetization. We also obtain asymptotics for sequences $\beta_N\uparrow1$ that interpolate between these two regimes.
Crucially, the proof reveals that the pair correlations determine the leading correction to the likelihood ratio, providing precise control of both the chi-square divergence and relative entropy.

[123] arXiv:2611.17916 [pdf, html, other]
Title: Existence and uniqueness of non negative radial solutions to semilinear elliptic problems on the exterior of a unit ball in $\mathbb{R}^2$
Ameerraja Ansari, Lakshmi Sankar
Subjects: Analysis of PDEs (math.AP)

We study the problem \begin{equation}\notag
\begin{cases} - \Delta u &= \lambda K(x) f(u) \hspace{.1cm} \mbox { in } B_1 ^c, \\ u(x)&=0 \hspace{1.5cm} \mbox { on } \partial B_1, \end{cases} \end{equation} where $\lambda$ is a positive parameter, $B_1^c:=\{x\in\mathbb{R}^2:|x|>1\}$ is the exterior of the unit ball in $\mathbb{R}^2$, $K:B_1^c\rightarrow (0,\infty)$ is a $C^1$ radial function and $f:[0,\infty)\rightarrow \mathbb{R}$ is a $C^1$ concave function which is sublinear at infinity such that $f(0)<0$. We establish the existence and uniqueness of non negative radial solutions for large values of parameter $\lambda$. Moreover, we prove certain qualitative properties of nonnegative radial solutions for a class of problems in dimension 2. In contrast to the case $n\geq3$, where positive solutions decay to zero at infinity, we prove that non negative solutions are positive, radially increasing with the limit existing at infinity.

[124] arXiv:2611.17923 [pdf, html, other]
Title: High-Dimensional Gaussian and Bootstrap Approximation: Near $1/\sqrt{n}$ Rates with General Covariance
Miles E. Lopes, Ricardo Masini
Comments: 42 pages
Subjects: Statistics Theory (math.ST); Probability (math.PR)

We consider Berry-Esseen bounds over rectangles for sums of $n$ random vectors in $\mathbb{R}^p$ that are i.i.d. A longstanding open question in high-dimensional probability and statistics is whether bounds of order $1/\sqrt n$ are attainable up to factors of $\log(pn)$ when the population covariance matrix is unrestricted. We answer this question affirmatively, provided that the random vectors have sub-Gaussian entries with non-zero variance. In addition, we provide analogous results for bootstrap approximation and Gaussian comparison, which make use of a special discrepancy measure between covariance matrices that enables improvement with respect to prior work. Taking an approach based on interpolation, the novel aspects of the proofs deal with bounding the interpolation derivatives in a way that is not sensitive to the covariance structure.

[125] arXiv:2611.17926 [pdf, html, other]
Title: A solution to Petty's polar projection problem
Yiqian Zhang
Comments: 6 pages,1 figure
Subjects: Metric Geometry (math.MG)

In 1971, Petty asked whether a convex body in $\mathbb{R}^n$, $n\geqslant 3$, must be an ellipsoid if its projection body is a dilate of its polar. In this paper, we give an affirmative answer to this question.

[126] arXiv:2611.17934 [pdf, html, other]
Title: Statistical guarantees for signature kernel ridge regression
Christian Bayer, Jakob Kellermann
Comments: Keywords: Path space regression, Signature transform, Rough paths, Functional data analysis, Kernel methods
Subjects: Statistics Theory (math.ST); Probability (math.PR)

Path signatures are a standard tool for learning functionals on path space. The main underpinnings of their application are universal approximation results. For a wide range of function classes on path space, these results state that any function in such a class can be approximated arbitrarily well by a linear functional of the path signature. Hence, linear functionals of the signature are in principle expressive enough for learning functions on path space. Nonetheless, these results do not provide insights into the statistical question of how much data is needed to identify a suitable signature functional. In this work, we study this question in the framework of kernel ridge regression with the signature kernel. The target is the conditional expectation $\E[Y|X]$, where $X$ is the observed path and $Y$ is a real-valued response. Under different assumptions on the moments of the signature kernel and the response, we provide finite-sample and consistency guarantees for the method. We supplement our theoretical analysis with numerical experiments that illustrate our results.

[127] arXiv:2611.17943 [pdf, html, other]
Title: Projection of massive and interacting conformal theories to the future null infinity
Beatrice Costeri, Claudio Dappiaggi, Alberto Ferrari
Comments: 56 pages, no figures
Subjects: Mathematical Physics (math-ph); High Energy Physics - Theory (hep-th)

On a four-dimensional, globally hyperbolic and asymptotically flat spacetime, we consider a real, linear, massive scalar field. Within the framework of perturbative algebraic quantum field theory and inspired by the principle of perturbative agreement, we regard the mass term in the underlying Lagrangian as an interaction potential. This allows us to construct the algebra of observables of the massive theory and, using a Møller map, to represent its elements as formal power series in the squared mass, with coefficients in the algebra of observables of a massless, conformally coupled scalar field. Following [DMP06], we use the bulk-to-boundary correspondence for the massless theory to project each coefficient to future null infinity $\mathscr{I}^+$.In four-dimensional Minkowski spacetime, we prove convergence of the projected series in the presence of an infrared cut-off and show that the global adiabatic limit exists but is trivial. We circumvent this obstruction by exploiting the time-slice axiom, which allows us to restrict our attention to observables localized in a causally convex neighbourhood containing a Cauchy hypersurface. Removing the cut-off locally yields a non-trivial limit and hence a bulk-to-boundary correspondence for the massive theory. We then extend our procedure to a self-interacting real scalar field. We represent interacting observables as formal power series in the coupling constant, with coefficients in the algebra of observables of a massless, conformally coupled scalar field. Each coefficient in the domain of the bulk-to-boundary map can thus be projected to future null infinity. As a concrete example, we apply this method to the stress-energy tensor of a massless scalar field with a quartic self-interaction, computing its projection up to first order in perturbation theory.

[128] arXiv:2611.17947 [pdf, other]
Title: A narrow band method for non-causal discretizations of anisotropic eikonal equations, with adaptive width, sub-and super-solution construction, and quasi-linear complexity
Jean-Marie Mirebeau (CNRS, CB), Yanis Mouheb (CB, CEA/DAM)
Subjects: Numerical Analysis (math.NA)

We describe a narrow band method for numerically solving anisotropic eikonal equations, and more generally static first order Hamilton-Jacobi equations with possibly non-convex Hamiltonians, discretized using standard schemes (semi-Lagrangian, upwind-differences, Lax-Friedrichs). The causality property is not needed, in contrast with the fast marching method. The proposed approach simultaneously builds a numerical sub-solution u and super-solution u to the problem, and adapts the width of the narrow band based on their comparison. We prove that (1 + $\epsilon$)u $\ge$ u at termination, where $\epsilon$ > 0 is any given tolerance parameter, and that the worst case complexity is O(N | ln $\epsilon$| ln(N/$\epsilon$)), where N denotes the number of discretization points, and the underlying constant is explicit in terms of those associated with the scheme properties. Numerical experiments illustrate our results.

[129] arXiv:2611.17949 [pdf, html, other]
Title: Auto-conditioned Gradient Descent Methods for Multiobjective Optimization
Shuaichenji Jiang
Subjects: Optimization and Control (math.OC)

This paper proposes two linesearch-free algorithms based on steepest descent methods for smooth multiobjective optimization: auto-conditioned steepest descent method for multiobjective optimization (AC-SDM) and auto-conditioned normalized gradient descent method for multiobjective optimization (AC-NGDM). Both algorithms estimate the local Lipschitz constant from the function values and the first-order information obtained in previous iterations. AC-SDM uses a shared estimate of the Lipschitz constant to construct a scaled steepest descent direction. For AC-NGDM, we use each function's local Lipschitz estimate to normalize the gradient of the corresponding function and construct the descent direction. We prove that every accumulation point of any sequence generated by both algorithms is a Pareto critical point. We also establish convergence rates of $O(1/\sqrt{k})$ for nonconvex objectives and $O(1/k)$ for convex objectives. Numerical results on several test problems demonstrate that AC-SDM and AC-NGDM require fewer iterations and less CPU time than the multiobjective steepest descent method with an Armijo line search and a max-type nonmonotone line search.

[130] arXiv:2611.17962 [pdf, html, other]
Title: Common values of linear recurrences related to Ankeny-Brauer-Chowla polynomials
Attila Pethő
Subjects: Number Theory (math.NT)

Let $P_u(X)=XQ(X)(X-u)+1$, where $Q(X)\in \mathbb{Z}[X]$ is monic, separabel, has constant term $\pm 1$, and degree $q\ge 1$. Denote $(A_n(u))$ the linear recursive sequence having characteristic polynomial $P_u(X)$ and initial terms $A_0,\ldots,A_{q+1}\in \mathbb{Z}$ such that at least one of them is non-zero. Then there exist effectively computable constants $n_0,u_0$ depending only on $Q(X)$ and $\max\{|A_0|,\ldots, |A_{q+1}|\}$ such that if $|A_n(u)| = |A_m(u)|$ holds for some integers $u,n,m$ with $u>u_0$ and $n\not=m$ then $\max\{

[131] arXiv:2611.17965 [pdf, html, other]
Title: Lower bounds on ranks of universal quadratic forms through geometry-of-numbers
Martí Oller
Comments: 10 pages
Subjects: Number Theory (math.NT)

We obtain lower bounds for the ranks of universal forms over totally real cubic fields using techniques from geometry-of-numbers and the parametrisation of cubic rings by binary cubics due to Delone--Faddeev. Additionally, our methods give lower bounds for totally real primitive fields of any degree with codifferent generated by a totally positive element.

[132] arXiv:2611.17969 [pdf, html, other]
Title: Exponential Lower Bounds for the Spherically Averaged Density of Atoms
Yukimi Goto
Comments: 18 pages
Subjects: Mathematical Physics (math-ph); Quantum Physics (quant-ph)

We study the asymptotic behavior of the spherically averaged density $\widetilde \rho$ for fermionic bound states of the $N$-electron atomic Hamiltonian $H_{N,Z}$ with nuclear charge $Z$. For the density associated with an eigenfunction satisfying $H_{N,Z}\psi=E\psi$, we show that if the energy $E$ is below the bottom of the essential spectrum $\Sigma:=\inf\mathop{\rm this http URL} (H_{N,Z})$, then \[ \lim_{r\to\infty}\frac{\ln \widetilde \rho(r)}{r} =\lim_{r\to\infty}\frac{d}{dr}{\ln \widetilde\rho(r)} =-2\alpha_0, \] with $\alpha_0=\sup\{\alpha \ge 0\colon e^{2\alpha r}\widetilde \rho \in L^1(\mathbb{R_+},r^2dr)\}$. The same is true at threshold in certain cases. Moreover, we prove $\alpha_0^2=\Sigma-E$ for the ground states of $H_{3,Z}$ with sufficiently large $Z$.

[133] arXiv:2611.17973 [pdf, html, other]
Title: Wireless Node Ranking via Fourier-Driven Maximum-Likelihood Estimation (extended version)
Daniel Schneider, Hannes Frey
Subjects: Information Theory (cs.IT); Networking and Internet Architecture (cs.NI)

We apply non-abelian Fourier theory to the problem of maximum-likelihood estimation of the order of a line topology, based on signal strength measurements under shadowing only. This yields up to a 60-fold speedup over standard methods for uncorrelated shadowing.
Moreover, for correlated Gaussian shadowing with a singular covariance (e.g. the joint path-loss model), maximum-likelihood recovery is exact and independent of the shadowing variance (an infinite Le Cam threshold), which our implementation confirms for $\sigma/\alpha$ as high as 7.0. The key object is the covariance's null space. Its dimension is fixed by the topology; its orientation depends on the correlation function only through the per-link variances.
Although the mechanism formally requires an exact line, it is robust to small perturbations of the formation: an approximate kernel recovers as well as the exact one. We explore the dependence on the perturbation in detail for five nodes.

[134] arXiv:2611.17987 [pdf, html, other]
Title: The Train Unit Shunting Problem with Service Scheduling and Workforce Assignment: classical and quantum optimization approaches
Alessia Ciacco, Francesca Guerriero, Eneko Osaba
Comments: Train Unit Shunting Problem, Railway Optimization, Mixed-Integer Linear Programming, Quantum Annealing, Hybrid Quantum-Classical Optimization
Subjects: Optimization and Control (math.OC); Emerging Technologies (cs.ET); Quantum Physics (quant-ph)

Efficient railway rolling stock management requires the coordinated planning of train-unit assignment, shunting movements, track occupation, service operations, and workforce allocation. These interdependent decisions give rise to a challenging combinatorial optimization problem, particularly as the size of the fleet and the planning horizon increase. This paper introduces the Train Unit Shunting Problem with Service Scheduling and Workforce Assignment, a mixed-integer linear programming formulation that integrates these operational decisions within a unified optimization framework. To improve computational tractability, a preprocessing procedure is developed to reduce the size of the resulting model. The proposed approach is evaluated through computational experiments on instances of increasing size and under different objective-function weight and cost configurations. Classical optimization experiments using Gurobi show that filtering method reduces the number of decision variables and constraints, while its impact on computational time varies across instances. In addition, a constrained quadratic model representation is investigated using D-Wave's hybrid quantum-classical optimization solver.

[135] arXiv:2611.17993 [pdf, html, other]
Title: On character conductors and Sylow p-subgroups
Yang Zhou, Heguo Liu
Subjects: Group Theory (math.GR); Representation Theory (math.RT)

Let $P\in\operatorname{Syl}_p(G)$, where $G$ is a finite group and $p$ is a prime, and let $\chi\in\operatorname{Irr}(G)$. In 2024, I. M. Isaacs and G. Navarro asked whether the degree of $\mathbb{Q}_{p^f}$ over $\mathbb{Q}_p(\chi_P)$ is always at most the $p$-part $\chi(1)_p$ of $\chi(1)$, where $p^f$ is the $p$-part of the conductor of $\chi$ and $f\geq1$. Here $\mathbb{Q}_n=\mathbb{Q}(e^{2\pi i/n})$ is the $n$th cyclotomic field, $\chi_P$ is the restriction of $\chi$ to $P$, and $\mathbb{Q}_p(\chi_P)$ is the field generated over $\mathbb{Q}_p$ by the values of $\chi_P$. We prove that this inequality holds for $p$-solvable groups.

[136] arXiv:2611.17994 [pdf, html, other]
Title: Essential spectrum of singularly perturbed Dirac operators on bounded domains
Jussi Behrndt, Badreddine Benhellal, Markus Holzmann, Konstantin Pankrashkin
Comments: 54 pages
Subjects: Spectral Theory (math.SP); Mathematical Physics (math-ph); Analysis of PDEs (math.AP); Functional Analysis (math.FA)

In this paper self-adjoint Dirac operators on bounded domains in $\mathbb{R}^2$ and $\mathbb{R}^3$ with elliptic boundary conditions perturbed by singular $\delta$-shell potentials supported on compact curves or surfaces are considered. While the unperturbed operator has purely discrete spectrum, it is shown that certain critical values of the interaction strengths lead to the appearance of essential spectrum. More precisely, each connected component of the interaction support, where the coupling constants have such critical values, produces in dimension two a point and in dimension three even a closed interval in the essential spectrum, where the size of the latter depends on the geometry and the coupling constants.

[137] arXiv:2611.17999 [pdf, html, other]
Title: Additive cubes are avoidable over $\{0,1,2,3\}$, $\{0,1,4\}$ and $\{0,2,5\}$
Damien Jamet, Matthieu Rosenfeld
Subjects: Combinatorics (math.CO); Discrete Mathematics (cs.DM); Formal Languages and Automata Theory (cs.FL)

We prove that additive cubes are avoidable over the alphabet $\{0,1,2,3\}$, thereby solving a long-standing question initiated by Pirillo and Varricchio in 1994. By extending the reduction and spectral machinery of Cassaigne, Currie, Schaeffer, and Shallit (2014), we prove that the search for additive cubes in such morphic images reduces to a finite graph traversal. We exhibit eight explicit morphisms from $\{0,1,3,4\}^*$ to $\{0,1,2,3\}^*$ of length 3 whose images on the Cassaigne \textit{et al.} infinite word contain no additive cubes.

[138] arXiv:2611.18000 [pdf, html, other]
Title: Dimensionalities on monoids
Gejza Jenča
Subjects: Rings and Algebras (math.RA)

We study equivalence relations on monoids in $\Rel$ that are lax morphisms. We call them \emph{dimensionalities}. We prove that the quotient of a monoid in $\Rel$ by a dimensionality is again a monoid. We prove that polygroupoids (and hence hypergroups) are exactly the symmetric $†$-Frobenius structures in $\Rel$. We use this characterization to prove that the quotient of a polygroupoid by a dimensionality that preserves the inverse is a polygroupoid.

[139] arXiv:2611.18004 [pdf, html, other]
Title: Existence and regularity for a non-autonomous Born-Infeld equation with a confining potential
Fan Yang, Chengxiang Zhang
Comments: 46 pages. Corresponding author: Chengxiang Zhang
Subjects: Analysis of PDEs (math.AP)

We study the non-autonomous Born-Infeld equation $\operatorname{div}(Du/\sqrt{1-|Du|^2})-V(x)u+|u|^{p-2}u=0$ in $\mathbb R^N$, where $N\ge3$ and $2<p<2^*=2N/(N-2)$. For a $C^1$ potential satisfying $\inf V>0$, $V(x)\to\infty$ as $|x|\to\infty$, and $|x\cdot\nabla V(x)|\le C_DV(x)$ with $0\le C_D<p-2$, we prove the existence of a positive classical solution and infinitely many distinct nontrivial classical solutions. The argument combines the nonsmooth monotonicity trick with compactness induced by the confining potential. A Pohozaev-type identity yields uniform bounds for parameter-dependent critical points. A local minimization characterization identifies these critical points with weak solutions and establishes strict spacelikeness. Local Schauder estimates then give $C^{2,\alpha}_{\mathrm{loc}}$ regularity. All the solutions belong to the natural energy space $H_V^1(\mathbb R^N)$ and satisfy $|Du|<1$.

[140] arXiv:2611.18011 [pdf, html, other]
Title: Higher derived limits, Kurepa families and Chang's Conjecture
Dianthe Basak, Matteo Casarosa, Chris Lambie-Hanson, Pedro Marun, Boban Velickovic, Alessandro Vignati
Comments: 37 pages
Subjects: Logic (math.LO)

We investigate the interplay between homological algebra and combinatorial set theory, specifically focusing on the (non)vanishing of higher derived limits of certain inverse systems of abelian groups, denoted $\mathbf C_{[\kappa]^\lambda}$, indexed by the ordered sets $([\kappa]^{\lambda},\subseteq)$, where $\lambda < \kappa$ are infinite cardinals.
Our first main result is a general structural theorem which provides a generalisation of Goblot's theorem to the setting of locally small directed sets. We then present the first systematic study of generalised cofinal Kurepa families. We establish their existence in the constructible universe $L$ and under specific cardinal arithmetic hypotheses. Then, we apply our structural result to show that $\mathrm{lim}^{n+2} \mathbf{C}_{[\kappa]^{\aleph_n}} = 0$ in environments where the appropriate cofinal Kurepa families exist.
In contrast, we explore conditions that force these derived limits to be nonzero. In particular, we prove that certain instances of Chang's conjecture (CC), together with the existence of suitable $\diamondsuit$ sequences, imply that $\mathrm{lim}^{n+2} \mathbf{C}_{[\kappa]^{\aleph_n}} \neq 0$ for appropriate values of $\kappa$. Adapting forcing techniques from Eskew and Hayut, we construct models of these instances of CC together with the required $\diamondsuit$ sequences, establishing the consistency, for each $n \in \mathbb{N}$, of $\mathrm{lim}^{n+2} \mathbf{C}_{[\aleph_{\omega_n}]^{\aleph_n}} \neq 0$.

[141] arXiv:2611.18016 [pdf, html, other]
Title: Stable projective immersions of Kähler metrics with some radial symmetry
Claudio Arezzo, Andrea Loi, Giovanni Placini, Michela Zedda
Comments: 27 pages, comments are welcome
Subjects: Differential Geometry (math.DG); Complex Variables (math.CV)

We combine Calabi's criterion with Pringsheim's theorem to study projective inducibility under positive rescaling. By restricting to suitable radial holomorphic curves, we obtain an obstruction to local Kähler immersions into finite- or infinite-dimensional complex projective space that applies uniformly to every positive rescaling. For invariant rational curves, we show that non-rationality of the moment map implies that no positive rescaling is projectively induced. We apply these criteria to the Taub-NUT, Candelas-de la Ossa, non-flat Stenzel, and Hwang-Singer scalar-flat metrics, as well as to Gibbons-Hawking metrics. Except for the Burns-Simanca metric in the Hwang-Singer family, no positive rescaling is projectively induced. For Gibbons-Hawking ALE spaces with at least two centres, the conclusion holds in every compatible complex structure. We also extend the results to complex space forms of arbitrary curvature with at least one finite signature index.

[142] arXiv:2611.18018 [pdf, html, other]
Title: Two correlation scales in homogeneous density-matrix functionals: the Müller logarithm and the sharp Csányi--Arias asymptotics
Heinz Siedentop
Subjects: Mathematical Physics (math-ph); Strongly Correlated Electrons (cond-mat.str-el)

We resolve the exact high-density correlation scales and coefficients of the three-dimensional translation-invariant, spin-symmetric Müller and Csányi--Arias corrected Hartree--Fock (CHF) functionals, settling long-standing numerical observations of Müller overcorrelation and apparently vanishing CHF correlation. In Hartree units, for fixed spin multiplicity $q$ and Fermi momentum $k=(6\pi^2\rho/q)^{1/3}$, their gains per particle over the filled Fermi sea satisfy \[
D_{\rm M}(k)=\frac{3}{4\pi^2}\log k+O(1),\qquad
D_{\rm CHF}(k)=12e^{-1/2-\pi^2/8}
k^2e^{-\pi^{3/2}\sqrt{k}}(1+o(1)). \] The Müller proof retains the occupation cap and identifies the factor-of-two cancellation between exchange defect and energy gain. For periodic Müller jellium, convexity and translation--spin averaging allow a global minimizer to be chosen invariant and identify the unrestricted thermodynamic energy with the homogeneous spin-symmetric value. The CHF upper bound follows from a deterministic comparison built from the explicit Hartree--Fock dispersion, combining a full Birman--Schwinger bound with one-sided norms and completion of the square; a number-preserving trial state provides the matching lower bound, and the retained remainder yields weighted $L^2$ convergence of the occupation defect without analyzing the self-consistent gap. We also prove existence for both functionals and uniqueness of the CHF minimizer. Relative to the unpolarized quantum high-density benchmark, Müller has a larger logarithmic coefficient, providing quantitative evidence for the conjectured Müller lower-bound property, whereas CHF misses the logarithmic scale altogether. The quantum benchmark is not used in either functional proof.

[143] arXiv:2611.18022 [pdf, html, other]
Title: Products of Trees, $Σ$-theory, Higher Baumslag-Solitar Groups
Ilaria Castellano, Kevin Klinge, José Pedro Quintanilha
Comments: 52 pages, 7 figures, no generative AI, comments welcome
Subjects: Group Theory (math.GR)

We study the $\Sigma$-theory of groups equipped with multiple HNN decompositions in the case where the product of the associated Bass-Serre trees satisfies the hypotheses of Brown's criterion. We then obtain an explicit description of the $\Sigma$-theory restricted to the span of all characters dual to one of the HNN decompositions. One consequence is that Meinert's Direct Product Formula holds in this context. As a key ingredient for the proof, we present a purely topological result that allows reading off the essential connectedness and acyclicity properties of products of regular trees with height functions.
As the main application of our theorem, we introduce higher Baumslag-Solitar groups. We prove that they admit a canonical system of HNN decompositions, and use it to deduce multiple results, such as the existence of normal forms, and a well-behaved structure of standard parabolic subgroups (which include the vertex and edge groups). By understanding their interplay with a special class of endomorphisms called multiplication maps (which include the structure maps), we control the action on the product of Bass-Serre trees. This allows us to compute the full $\Sigma$-theory of higher Baumslag-Solitar groups.

[144] arXiv:2611.18044 [pdf, other]
Title: Another step towards spectral descriptions of cyclic functions
J. Airán Santana-Rivero, Daniel Seco
Subjects: Complex Variables (math.CV); Functional Analysis (math.FA); Spectral Theory (math.SP)

We consider the operator $V_f=M^{*}_{f}M_{f}$ in the weighted Hardy spaces $H^{2}_{\omega}$, with $M_f$ the operator of multiplication by the function $f$. We determine some basic properties like the essential spectrum when $f$ is a polynomial. Then we focus on the point spectrum when $f$ is a degree 2 polynomial and $H^{2}_{\omega}$ is the Bergman space, assuming that certain parameter is real. We show how this bifurcates into two possibilities: in one we establish the lack of eigenvalues while, in the other, the lack of maximal dimension eigenspaces.

[145] arXiv:2611.18046 [pdf, html, other]
Title: Local well-posedness for the Novikov-Veselov equation at subcritical regularity
Andreia Chapouto, Simão Correia, João Pedro Ramos
Comments: 38 pages
Subjects: Analysis of PDEs (math.AP)

We establish local well-posedness of the Novikov--Veselov equation (NV), at every fixed value of the energy parameter, for initial data in $H^s(\mathbb{R}^2)$ in the entire subcritical Sobolev range $s>-1$. The argument is perturbative and does not invoke the integrable structure, instead adapting the strategy in our previous work on KdV (2026). An infinite normal-form expansion indexed by binary trees is combined with a gauge transform that bypasses the obstructions in the associate bilinear estimate, and the resulting gauged equation -- carrying nonlinear contributions of every order -- is closed by a contraction in a Fourier restriction space. The analytic engine is a family of frequency-restricted multilinear bounds, supported by a detailed description of the two-dimensional resonance geometry attached to (NV).

[146] arXiv:2611.18047 [pdf, html, other]
Title: Twisted Fourier-Mukai partners of genus 1 curves
Tanya Kaushal Srivastava, Sofia Tirabassi, Naïa Vivares
Comments: 11 pages. Comments and remarks welcome
Subjects: Algebraic Geometry (math.AG)

We study twisted derived equivalence between genus 1 curves over an arbitrarly perfect field.

[147] arXiv:2611.18049 [pdf, html, other]
Title: Dualizing involutions on Kazhdan-Patterson covers of $\mathrm{GL}(r)$
Ila Ahmad, Kumar Balasubramanian, Sanjeev Kumar Pandey, Ekta Tiwari, Varsha Vasudevan
Subjects: Representation Theory (math.RT)

Let $F$ be a non-Archimedean local field of characteristic zero and $G=\mathrm{GL}(r,F).$ Let $r,n \geq 2$ and $\widetilde{G}$ be an $n$-fold Kazhdan-Patterson cover of $G$. Let $\pi$ be an irreducible smooth representation of $G$ and $\pi^{\vee}$ be the contragredient of $\pi$. Let $\tau$ be an involutive anti-automorphism of $G$ satisfying $\pi^{\tau}\simeq \pi^{\vee}$. In this case, we say that $\tau$ is a dualizing or duality involution. When $r=2$, it is known that any lift of the standard involution on $G$ to $\widetilde{G}$ is a dualizing involution if and only if $n=2$. In this paper, we study the dualizing property of the lifts of the standard involution on $G$ to $\widetilde{G}$ and prove the following: (i) When $r \geq 2$ and $n \geq 3$, we show that any lift of the standard involution to $\widetilde{G}$ is never a dualizing involution. (ii) When $r=2t$ and $n=2$, we show that any lift of the standard involution to $\widetilde{G}$ is a dualizing involution. (iii) When $r=2t+1$ and $n=2$, we show that there is a unique lift of the standard involution to $\widetilde{G}$ which is a dualizing involution.

[148] arXiv:2611.18051 [pdf, html, other]
Title: Stochastic Nonlocal Conservation Laws with Lévy Noise: Stability, BV Estimates, and Vanishing Viscosity
Aekta Aggarwal, Debopriya Mukherjee, Akash Ashirbad Panda
Subjects: Analysis of PDEs (math.AP); Functional Analysis (math.FA)

We study one-dimensional stochastic nonlocal conservation laws with a convolution-type interaction field, driven by multiplicative Brownian noise and compensated Poisson random measures. The nonlocal operator modifies the classical entropy structure, while the jump noise produces nonlinear correction terms in the entropy inequality. We introduce a notion of stochastic entropy solution and establish an $L^1$-stability estimate using spatial doubling of variables and the Itô--Lévy formula. This yields uniqueness in the vanishing-viscosity class and, under additional bounds, a localized Cauchy estimate of order $\sqrt{\varepsilon+\varepsilon'}$. Existence is obtained by vanishing viscosity: we construct the viscous solutions through a Faedo--Galerkin scheme and derive viscosity-uniform $L^1$ and localized $BV$ estimates, which allow us to pass to the limit and obtain a spatially $BV$ stochastic entropy solution.

[149] arXiv:2611.18058 [pdf, other]
Title: Perfect Matching Complexes of $3\times 2n$ Grid Graph
Himanshu Chandrakar, Trung Chau, Shuchita Goyal, Rahul Karki, B. Subhash
Comments: 9 pages, 1 figure, Comments are welcome!
Subjects: Combinatorics (math.CO); Algebraic Topology (math.AT)

The perfect matching complex of a simple graph $G$ is an abstract simplicial complex whose facets (maximal faces) are precisely the perfect matchings of $G$. In this article, we study the topology of the perfect matching complex of the $3\times 2n$ grid graph and show that it is homotopy equivalent to a wedge of $f_{n-1}$ copies of $(n-1)$-dimensional spheres, where $f_{k}$ denotes the $k$-th Fibonacci number. This proves a particular case of the conjecture given by Chandrakar and Singh for perfect matching complex of grid graphs.

[150] arXiv:2611.18059 [pdf, html, other]
Title: Compatible zero-sum partitions of finite Abelian groups and their applications
Ahmet Batal, Sylwia Cichacz
Subjects: Combinatorics (math.CO)

Let $(\Gamma,+)$ be a finite Abelian group and let $g\in\Gamma\setminus\{0\}$. A partition of $\Gamma$ is called $g$-compatible if no part contains both $x$ and $x+g$. For a prescribed involution $h$ and odd $r\ge3$, we prove that $\Gamma$ admits an $h$-compatible partition into zero-sum $r$-element sets if and only if $r$ divides $|\Gamma|$ and $\Gamma$ has at least three involutions. Moreover, the partition can be chosen so that the multigraph whose vertices are its parts and whose edges are the pairs $\{x,x+h\}$ is Hamiltonian and has a proper edge coloring with $r$ colors. We also give examples, for groups of odd order and for even block sizes, in which zero-sum partitions exist but compatible ones do not.
We give two applications of these partitions. For block size three, we obtain complete mappings whose cycles are precisely the parts of the partition. We also construct Hamiltonian $r$-regular $\Gamma$-distance-magic graphs admitting $0$ and every involution of $\Gamma$ as magic constants.

[151] arXiv:2611.18061 [pdf, html, other]
Title: Strong endpoint estimates for bilinear spherical averaging operators on closed hypersurfaces and curved patches
Xi Cen
Comments: Submitted; Comments are welcome!
Subjects: Classical Analysis and ODEs (math.CA); Functional Analysis (math.FA)

Tainara Borges~\cite[Section~7.1, Question~7.2]{Borges2026} asked whether the strong $L^1\times L^1\to L^{1/2}$ estimate for bilinear spherical averages extends to all compact smooth hypersurfaces without boundary and with nonvanishing Gaussian curvature. We give a positive answer when $d\ge2$. The geometric argument concerns the difference projection $(y,z)\mapsto y-z$: at every critical point, two definite directions in its fiber already ensure that the projected surface measure has bounded density. This condition holds for the closed hypersurfaces in the original question. The ensuing strong endpoint uses the localization principle of Iosevich, Palsson and Sovine~\cite[Propositions~4.1--4.2]{IPS2022}. Our proof also establishes a partial positive result for the curvature-rank problem in Borges~\cite[Question~7.1]{Borges2026}. We exhibit a smooth full-curvature patch with boundary for which the strong estimate fails. The endpoint yields the entire fixed-scale Hölder family.

[152] arXiv:2611.18068 [pdf, html, other]
Title: A Realizability-Based Kinetic-Fluid Domain Decomposition Method for Single-Temperature Gas Mixtures
Domenico Caparello, Lorenzo Pareschi, Thomas Rey
Subjects: Numerical Analysis (math.NA)

This paper introduces a domain-adaptive numerical method for multi-species kinetic models that relax toward a single-temperature and single-velocity hydrodynamic limit. To this end, we derive moment realizability matrices for this regime. In this way the ideas of Levermore, Morokoff, and Nadiga are extended to non-equilibrium mixtures in which inter-species and intra-species collisions occur at comparable rates, so that all species relax to a common velocity and a common temperature. The realizability conditions are used as an indicator to divide the computational domain, at each time step, into macroscopic and kinetic regions. In the kinetic regions, where the continuum description fails (e.g., across strong shocks, non-equilibrium interfaces, or kinetic boundary layers), the method solves the multi-species kinetic equations. Close to local thermodynamic equilibrium, the Euler equations of the mixture are solved instead. Confining the kinetic computations to the non-equilibrium regions reduces the simulation time, while the results remain close to those of the full kinetic solver. The method is discretized on Cartesian grids with high-order schemes in space and time. The kinetic equations are integrated with an Asymptotic-Preserving Implicit-Explicit (IMEX) scheme, so that a consistent discretization of the single-velocity, single-temperature Euler system of the mixture is recovered when the Knudsen number goes to zero. To the best of our knowledge, this is the first realizability-based adaptive spatial domain decomposition method for gas mixtures in this single-velocity, single-temperature setting.

[153] arXiv:2611.18070 [pdf, html, other]
Title: Stochastic inverse source problem in inhomogeneous media: far-field statistics
Dong Qiu, Xiang Xu, Yue Zhao
Comments: 24 pages, 3 figures
Subjects: Analysis of PDEs (math.AP)

This paper is concerned with an inverse random source problem for the stochastic Helmholtz equation in a known three-dimensional inhomogeneous medium. The source is driven by spatial white noise. We seek to recover its mean and strength from the mean and cross-frequency covariance of the far-field pattern. For a smooth nontrapping wave speed, we use the spectral measure of the acoustic operator to relate the far-field data to the source statistics. Under a priori regularity bounds, this relation gives conditional stability for the source mean and the source strength. We derive explicit reconstruction formulas for both quantities and bound the errors due to frequency truncation and data perturbations. We also obtain mean-square error bounds for reconstructions from finitely many independent experiments. Numerical experiments illustrate the reconstruction accuracy and the effects of bandwidth and sample size.

[154] arXiv:2611.18076 [pdf, html, other]
Title: Upper bounds for the number of spanning forests of a graph
Tingzeng Wu, Shuxin Lu, Xiangshuai Dong
Subjects: Combinatorics (math.CO)

Let $G$ be a simple graph on $n$ vertices, and let $F(G)$ denote the number of spanning forests of $G$. Bencs and Csikvári proved that every $r$-regular graph $G$ with $r\ge 2$ satisfies $F(G)\le r^n$. Motivated by this result, they conjectured that if $G$ has minimum degree at least $3$, then $F(G)\leq \prod_{i=1}^n d_i$, where $(d_1, d_2, \dots, d_n)$ is the degree sequence of $G$. In this paper, we prove that graphs with minimum degree at least $n/3$ $(n\geq7)$
satisfy $F(G)\leq \prod_{i=1}^n d_i$. We also construct a counterexample to the conjecture. We therefore further study the enumeration of spanning forests in general graphs, proving an upper bound in terms of the degree sequence
and characterizing the extremal graphs attaining this bound. In addition, using the matrix-forest theorem, we obtain an upper bound for the number of spanning forests of a connected graph in terms of its algebraic connectivity,
and characterize the extremal graphs attaining this bound.

[155] arXiv:2611.18079 [pdf, html, other]
Title: High-order IMEX local discontinuous Galerkin methods with sparse grids for high-dimensional nonlinear parabolic PDEs
Joel P. Villarino, Manuel J. Castro, J. A. García-Rodríguez, J. G. López-Salas
Subjects: Numerical Analysis (math.NA)

In this work, we develop a high-order IMEX-LDG scheme on sparse grids for solving nonlinear parabolic PDEs in moderate to high dimensions. The method combines the advantages of LDG methods for convection--diffusion problems, IMEX-RK time integrators for stiff systems, and sparse-grid techniques to mitigate the curse of dimensionality. The resulting scheme is fully parallelized in MPI, is robust, efficient, and scalable, making it suitable for a wide range of applications involving high-dimensional nonlinear parabolic PDEs.

[156] arXiv:2611.18087 [pdf, html, other]
Title: On the convergence of the False Nearest Neighbours algorithm
Adam Śpiewak
Subjects: Dynamical Systems (math.DS); Chaotic Dynamics (nlin.CD)

The False Nearest Neighbours (FNN) algorithm is one of the most widely used methods for choosing the embedding dimension, i.e. the number $k$ of delay coordinates, in the time-delay reconstruction of a dynamical system from an observed scalar time series. We prove rigorous results on the behaviour of this algorithm for long time series. We consider a smooth dynamical system on a compact manifold $M$ and an invariant probability measure $\mu$. For a typical measurement function and $\mu$-almost every trajectory, we show that the proportion of false nearest neighbours tends to zero (provided that the tolerance threshold is large enough) once $k >\dim M$. On the other hand, for systems with super-polynomial decay of correlations, we prove that this proportion tends to one whenever $k$ is smaller than the Hausdorff dimension of $\mu$. Consequently, in this case, the FNN algorithm (run for long enough time series) returns an embedding dimension $k$ satisfying $\dim_H \mu \leq k \leq \dim M + 1$. This is below the threshold $2\dim M + 1$ required by the Takens embedding theorem, so the classical Takens embedding theory does not explain why reconstructions and predictions with $k$ chosen by the FNN algorithm work in practice. The explanation for this case is provided by a recent probabilistic theory of time-delay embeddings. We apply our results to the Hénon and Lorenz attractors, showing that the FNN algorithm typically returns $k=2$ for the Hénon map (in the chaotic case) and $k \leq 3$ for the Lorenz system.

[157] arXiv:2611.18090 [pdf, html, other]
Title: Bound-preserving finite volume scheme for a coupled parabolic system with nonlinear and nonlocal drift
Nicklas Jävergård, Adrian Muntean
Subjects: Numerical Analysis (math.NA)

We propose a bound preserving finite-volume scheme for a coupled system of partial differential equations with nonlinear, nonlocal drift. The main contribution of this work is twofold: $(1)$ we show that the proposed scheme preserves physically motivated bounds; $(2)$ we prove that the scheme is well-posed and leads to a sequence of approximate solutions converging to the weak solution of the original problem. This setting is motivated by questions related to morphology formation in organic solar cells.

[158] arXiv:2611.18102 [pdf, html, other]
Title: Singularly embedded solitons and Stokes phenomenon in the fifth order KdV equation
Roberto Barrio, Vassili Gelfreich, J. Tomás Lázaro, Juan Ramon Pacha
Comments: 40 pages
Subjects: Dynamical Systems (math.DS)

We study embedded solitons (ES) in a fifth-order Korteweg-de Vries (KdV) equation near a reversible Hamiltonian saddle-centre bifurcation. The solitons correspond to homoclinic orbits to an equilibrium whose linearisation has a pair of real and a pair of purely imaginary eigenvalues. Existence of symmetric homoclinic near the bifurcation is a codimension-one phenomenon governed by a parameter-dependent Stokes constant associated with an inner equation. Using complex matching, we derive an oscillatory large-parameter asymptotic formula for the Stokes constant. This formula implies the existence of a countable sequence of zeros and gives their asymptotic distribution in parameter space. We also develop two complementary high-precision numerical procedures for evaluating the Stokes constant: one based on the late terms of the formal inner expansion and another on direct computation of the stable and unstable manifolds. The numerical results agree with each other and with the asymptotic prediction, confirming both the existence and the predicted locations of the embedded-soliton branches.

[159] arXiv:2611.18106 [pdf, html, other]
Title: On the spectrality of non-homogeneous self-similar measures
Yi-Qiu Mao, Zhi-Yi Wu
Subjects: Classical Analysis and ODEs (math.CA)

We develop a finite-cylinder difference-set obstruction to the existence of an exponential orthonormal basis for a compactly supported probability measure. This obstruction uses the equal-scale and equal-mass structure of finitely many disjoint affine copies of the measure, together with Parseval's identity and an elementary atom bound for positive measures. We apply it to prove that the golden-mean self-similar measure generated by $x/2$ and $(x+2)/4$ is non-spectral. Together with a weight-rigidity argument, this excludes spectrality for every positive choice of weights in this iterated function system. We also analyze a logarithmically incommensurable example generated by $x/2$ and $(x+2)/3$, proving non-spectrality for all first-branch weights $p\in[1/3,5/6]$, including the natural weights. The latter proof reduces to two finite, exactly checkable integer difference-set conditions; an independent verification program is included in the paper.

[160] arXiv:2611.18124 [pdf, html, other]
Title: Muon Attains $\mathcal{O}(\varepsilon^{-3})$ Iteration Complexity under Shuffling
Kun Huang, Shi Pu, Karl Henrik Johansson
Comments: 25 pages, 14 figures
Subjects: Optimization and Control (math.OC); Machine Learning (cs.LG)

Muon is a stochastic first-order optimizer for matrix-valued parameters. It maintains an exponential moving average of stochastic gradients in a momentum buffer with coefficient $\beta$, and orthogonalizes the buffer to obtain the update direction. Muon has been reported to accelerate and stabilize the training of large language models. In practice, it is often used with shuffling (sampling without replacement), where each epoch visits the components of a finite-sum objective in a permuted order. However, its iteration complexity in this setting remains open. We analyze Muon under shuffling, with the momentum buffer orthogonalized by the polar map. For smooth nonconvex finite-sum problems, we establish an $\mathcal{O}(\varepsilon^{-3})$ iteration complexity for finding an $\varepsilon$-stationary point. This guarantee holds for every sequence of permutations, covering random reshuffling, shuffle once, and the incremental gradient method. This complexity matches that of stochastic gradient descent under shuffling in its dependence on $\varepsilon$, and improves on Muon's $\mathcal{O}(\varepsilon^{-4})$ complexity under sampling with replacement. Our guarantee requires a problem-dependent $\beta$ that approaches one as the number of components grows. In contrast, no fixed $\beta$ guarantees convergence to stationarity for every number of components. We show this by constructing a family of smooth convex problems on which, for any fixed $\beta\in[0,1)$, Muon remains bounded away from stationarity once the number of components is sufficiently large. This failure occurs for every sequence of permutations and persists even with small stepsizes. These results suggest two practical tuning rules: if the training loss stops decreasing even after reducing the stepsize, increase $\beta$; when increasing $\beta$, reduce the stepsize accordingly.

[161] arXiv:2611.18129 [pdf, html, other]
Title: The minimal excludant of $\ell$-regular overpartitions
Sourav Bhowmick, Nabin Kumar Meher
Comments: First draft of the paper, 15 pages
Subjects: Number Theory (math.NT)

Andrews and Newman \cite{AN1} introduced the minimal excludant (mex) of an integer partition, and Aricheta and Donato \cite{AD} extended it to overpartitions. More recently, Meher \cite{Meher} and Tejash, Bhowmick and Meher \cite{TBM} studied the analogous statistic for $\ell$-regular partitions. In this article, for an integer $\ell\ge 2$, we define the minimal excludant $\omex_\ell(\pi)$ of an $\ell$-regular overpartition $\pi$ as the smallest positive integer that is not divisible by $\ell$ and does not occur as a non-overlined part of $\pi$. We study $\sm{\ell}(n)$, the sum of $\omex_\ell(\pi)$ over all $\ell$-regular overpartitions $\pi$ of $n$. We obtain generating functions for $\sm{\ell}(n)$ as eta-quotients for $\ell=2$ and $\ell=3$. Later, motivated from \cite{TBM}, we obtained explicit generating functions for $\sm{\ell}(n)$. We show that $\sm{\ell}(n)$ is weakly increasing in $n$, and we derive Hardy--Ramanujan type asymptotic formulas for $\sm{2}(n)$ and $\sm{3}(n)$. We then determine the parity of both functions completely: $\sm{2}(n)$ is even for every $n\ge 1$, while $\sm{3}(n)$ is odd if and only if $n=0$ or $n$ is a centred hexagonal number. Also, we obtain for every $\ell\ge3$, $\sm{\ell}(n)$ is odd for infinitely many $n$, and the number of such $n\le X$ is $\gg\sqrt{X}$. Finally, we establish congruences for these functions modulo $3$, $4$ and $8$.

[162] arXiv:2611.18134 [pdf, html, other]
Title: On the Construction of New Families of Distance Equienergetic Graphs
Anjitha Ashokan, Chithra A V
Subjects: Combinatorics (math.CO)

For a graph $G$ with vertex set $V(G)=\{v_{i}:1\leq i \leq p\}$ and edge set $E(G)=\{e_{j}:1\leq j \leq q\},$ its subdivision graph $S_G$ is generalized to $S_{G}(n,m),$ by replacing each vertex $v_{i}$ with $n$ vertices and each edge-vertex $e_{j}$ with $m$ vertices, with each copy having the same neighbors as the vertex it replaces. Building on this construction, we define the generalized subdivision vertex join $S_{G_{1}}(n,m)\dot{\vee} G_{2}$ and the generalized subdivision edge join $S_{G}(n,m)\veebar G_{2},$ which extend the known subdivision vertex and subdivision edge join of graphs. In this paper, we determine the distance spectrum of $S_{G_{1}}(n,n)\dot{\vee} G_{2}$ and $S_{G}(n,n)\veebar G_{2},$ when $G_{1}$ and $G_{2}$ are regular graphs. As an application, we construct new families of $D$-cospectral graphs and $D$-equienergetic graphs of diameter $4.$

[163] arXiv:2611.18137 [pdf, html, other]
Title: Rate Optimal Streaming Codes Under an Extended Delay Profile for Three-Node Relay Networks
Ke Wang, Wenjie Ma, Zhipeng Li, Yaqiang Zhang
Comments: 27 pages
Subjects: Information Theory (cs.IT)

We study streaming codes for a three-node relay network with burst lengths $b_1,b_2$ and an end-to-end decoding delay $T$. Let $u=\max\{b_1,b_2\}$ and $v=\min\{b_1,b_2\}$, and write $T-v=pu+q$, where $T\ge u+v$ and $0\le q<u$. We develop two binary constructions, SR and SR-2, using extended delay profiles that allow the relay to forward causally invertible combinations of current and past source symbols. The SR construction attains the non-adaptive rate upper bound whenever \[ \frac{T-u-v}{2u-v}\le\left\lfloor\frac{T-u-v}{u}\right\rfloor. \] SR-2 enlarges this range under the sufficient condition \[ q(v-q)\le(p-1)u(u-v). \] These constructions complement the known divisibility and large-delay regimes. We also establish two limitations of systematic ordinary coordinate forwarding. First, it cannot attain the rate upper bound when $0<T-u-v<v$. Second, for equal burst lengths $b$, it attains the bound if and only if $b\mid(T-2b)$; a quantitative upper bound gives a strictly positive rate gap in every nondivisible case. These converses allow nonlinear components and predetermined time variation within the stated ordinary-forwarding architecture. Existing adaptive schemes for equal bursts approach the same rate upper bound asymptotically using time-varying convolutional codes and lie outside the non-adaptive setting considered here.

[164] arXiv:2611.18138 [pdf, html, other]
Title: Universal Spaces for Coarsely Light Maps
David Hume, Harsh Patil
Comments: 9 pages
Subjects: Metric Geometry (math.MG); Group Theory (math.GR)

Coarsely light maps were introduced by Dydak--Weighill as a large-scale analogue of light maps. We show that a proper metric space has asymptotic dimension at most $n$ if and only if it admits a coarsely light map to $\mathbb R^n$. As an application, we resolve two questions of Benjamini--Schramm--Timár concerning semi-regular maps.

[165] arXiv:2611.18141 [pdf, html, other]
Title: Characterizing M-estimators using canonical divergences from information geometry
Paul Navas
Comments: 30 pages, 1 figure. Supplementary material included
Subjects: Statistics Theory (math.ST); Methodology (stat.ME)

On Euclidean space, the losses that produce consistent M-estimators of a functional are its strictly consistent scoring functions (Dimitriadis, Fissler and Ziegel, 2024), and Osband's principle characterizes these through identification functions, which define method-of-moments estimators. We extend this characterization to the probability simplex. We define the residual, which on Euclidean space is a subtraction, as the inverse exponential map of an affine connection. It identifies the exponential barycenter of the connection: the arithmetic, normalized geometric and Fréchet means for the mixture, exponential and Levi-Civita connections. Its integral along geodesics is the canonical divergence of Ay and Amari (2015). A geometric form of Osband's principle decides which losses each connection admits. For the flat connections every strictly convex generator yields a consistent Bregman loss. For the curved $\alpha$-connections, half the squared Fisher-Rao distance is (up to scale) the only consistent loss for the Fréchet mean, and for $\alpha \notin \{-1, 0, 1\}$ no such loss exists and only the method of moments remains. The residual is integrable only at $\alpha = 0$, sharpening the integrability claim of Ay and Amari. The characterization yields the estimating equations of regression on the simplex and the calibration decomposition of compositional forecasts.

[166] arXiv:2611.18151 [pdf, html, other]
Title: Sharp Finite-Time Blow-Up for Unforced Axisymmetric Euler Without Swirl via Multiscale Data
Jeaheang Bang, Alexey Cheskidov
Comments: 57 pages
Subjects: Analysis of PDEs (math.AP)

For the unforced Euler equations, we construct a compactly supported initial vorticity within the class of axisymmetric flows without swirl, whose solution blows up in finite time. The initial vorticity belongs simultaneously to every Hölder space $C^\alpha$, $\alpha<1/3$. This is sharp given that global regularity is known when $\alpha=1/3$ in the case of axisymmetric flows without swirl.
Previous constructions by Shkoller \cite{Shk26}, Chen \cite{Chen26I,Chen26II}, and Shao--Wei--Zhang--Zhang \cite{SWZZ26} establish blow-up for each prescribed exponent $\alpha$ in the same sharp range. Our construction achieves simultaneous membership in all these spaces. In addition, our construction is short.
Our proof uses multiscale initial data, in the spirit of Kim--Jeong~\cite{KJ22}, Córdoba--Martínez-Zoroa--Zheng~\cite{CMZZ25}, and Bang--Cheskidov~\cite{BC26}. The blow-up mechanism is a forward cascade through successively smaller scales. A main difficulty in approaching the critical exponent $1/3$ is caused by large self-deformation. Our main idea to overcome this difficulty is to obtain a lower bound for strain at the stationary non-smooth point by using angular redistribution.
A related outstanding open problem is to establish an unforced Euler blow-up from smooth data in the case of axisymmetric flows with swirl. A recent multiscale construction by OpenAI for the unforced Euler equations is, however, non-axisymmetric. Although we work in the no-swirl class, the axisymmetric multiscale mechanism developed here may offer a possible route toward the still-open problem of axisymmetric smooth blow-up.

[167] arXiv:2611.18156 [pdf, html, other]
Title: Hamming and Johnson-Type Bounds for Joint Error Correction and Detection
Yulin Chen, Raymond W.Yeung
Comments: This manuscript is a preliminary draft and is currently being revised. The final version will be posted once the revisions are complete. Comments and suggestions are welcome
Subjects: Information Theory (cs.IT)

We derive upper bounds on the size of codes for joint error correction and detection over classical $q$-ary Hamming spaces. A $(c,c')$ joint error correcting and detecting code corrects every error of weight at most $c$ and detects every error whose weight lies between $c+1$ and $c+c'$. We establish equivalent conditions for this decoding requirement using Hamming balls and Hamming rings, and derive a joint bound that reduces to the Hamming bound when $c'=0$. We introduce joint perfect codes and show that binary repetition codes attain the joint bound whenever $n=2c+c'+1$. For codes satisfying $d_{\min}=2c+c'+1$, we investigate an alternative joint bound based on ring multiplicity and constant-weight code bounds. A further argument using the Cauchy-Schwarz inequality and pairwise ring intersections yields a refined joint bound that is always at least as strong as the original joint bound. We then incorporate an additional outer Hamming shell to obtain a Johnson-type extension. This extension provides a strict improvement for binary codes with $c'=1$, $d_{\min}=2c+2$, $c\geq2$, and $d_{\min}+2\leq n\leq3d_{\min}/2-1$. These results connect sphere-packing bounds with the geometry of joint error correction and detection.

[168] arXiv:2611.18160 [pdf, html, other]
Title: Holonomy groupoids of singular subalgebroids in the non-integrable case
Nicolas Tribouillard, Marco Zambon
Comments: 37 pages, 2 figures
Subjects: Differential Geometry (math.DG)

The holonomy groupoid of a singular foliation was constructed by Androulidakis and Skandalis around 2006. The construction was later extended to singular subalgebroids of an integrable Lie algebroid, upon a choice of integrating Lie groupoid. In this work, we extend the construction of the holonomy groupoid even further, by allowing for non-integrable Lie algebroids. To do so, we make a choice of integrating local Lie groupoid $G$. When the Mal'cev completion $AC(G)$ is smooth, our construction recovers the holonomy groupoid associated with the Lie groupoid $AC(G)$. Furthermore, our holonomy groupoid has an associated $*$-algebra. We present examples in which the holonomy groupoid is realized as a quotient of the transformation groupoid of a Lie group action.

[169] arXiv:2611.18165 [pdf, html, other]
Title: The Thermodynamic Limit and the Landau degeneracy
Stéphane Ouvry
Comments: 9 pages
Subjects: Mathematical Physics (math-ph)

Usually, thermodynamic quantities are calculated by first regularizing the system in a confining box, which may have hard walls or periodic boundaries. One then studies the finite system and takes the thermodynamic limit by letting the box grow indefinitely. Here, we discuss a regularization scheme devised in the late 1980s [1] to study the thermodynamic equations of an anyon gas [2]. Instead of confining the system with walls, the method adds a smooth harmonic potential. Quantities are evaluated in its presence, and the potential is then gradually removed. A suitable prescription for taking this limit is needed to obtain meaningful thermodynamic results.

[170] arXiv:2611.18166 [pdf, other]
Title: An entropy-stable splitting strategy for a hyperbolic dispersive shallow-water model on unstructured meshes
Frédéric Couderc, Arnaud Duran, Maria Kazakova, Bastien Lombard, Pascal Noble, Rémy Baraille, Jean-Paul Vila
Subjects: Numerical Analysis (math.NA)

This paper presents an entropy-stable splitting strategy for the numerical solution of a hyperbolic approximation of the Serre--Green--Naghdi (SGN) model, leading to an efficient solver for dispersive water waves on unstructured meshes. The model was introduced by Escalante et al. (2019) and justified shortly thereafter by Richard (2021) as an asymptotic model of the free-surface Euler equations under a weak compressibility assumption. While the parent model includes full topography terms and enhanced dispersive properties, the present study focuses on its mild-slope form without enhanced dispersion, which retains an exact energy equation, the cornerstone of the stability analysis. The splitting yields a shallow-water subsystem with two passive scalars, governed by the \textit{slow} gravity waves, and an acoustic subsystem carrying the dispersive effects, governed by the \textit{fast} acoustic waves. The gravity step adapts an existing entropy-stable scheme, while an original scheme is derived for the acoustic step; both dissipate the energy at the discrete level, under local fully discrete stability criteria on general unstructured meshes. Complementary linear analyses select the low-dissipation calibration of the gravity step used in the computations, outside the scope of the nonlinear estimate. The acoustic step, which requires no global linear solve, is sub-iterated after each gravity time step; the resulting solver is three to six times more expensive than a classical shallow-water solver, depending on the chosen acoustic speed. Numerical validations, ranging from academic benchmarks to a realistic coastal configuration, highlight the properties of the approach and pave the way for operational use.

[171] arXiv:2611.18167 [pdf, html, other]
Title: Equidistribution of Gross lattices of supersingular elliptic curves
Lam L. Pham
Subjects: Number Theory (math.NT); Algebraic Geometry (math.AG)

For a prime $p$, we consider two important families of integral quadratic lattices associated to isomorphism classes of supersingular elliptic curves over $\overline{\mathbb{F}_{p}}$, the lattices of endomorphisms of trace zero, and the Gross lattices of endomorphisms. We prove effective equidistribution of the shapes of these lattices as $p\to\infty$ through primes, in the arithmetic locally symmetric space of unimodular lattices up to isometry. As an application, we obtain, as $p\to\infty$, the asymptotic distribution of successive minima of these lattices. These results are proved using tools from homogeneous dynamics, in particular, the key dynamical input is a recent adelic equidistribution theorem due to Einsiedler, Margulis, Mohammadi, and Venkatesh.

[172] arXiv:2611.18173 [pdf, html, other]
Title: Safety Certificates for Systems under Attack via Stackelberg Set Games
Nikolaos Athanasopoulos, David Laverty, Gregory Provan, Quanyan Zhu
Subjects: Optimization and Control (math.OC); Systems and Control (eess.SY)

We study a Stackelberg set selection game for linear systems subject to bounded disturbances and additive attacks. The defender selects the vector parameter of a polytopic safe set template; the attacker, after observing this choice, selects the vector parameter of an admissible attack set. The payoff is a signed, facet-normalised invariance margin that tests invariance exactly and quantifies either the available contraction or the facet inflation needed when invariance fails. Both controlled and robust controlled invariance are treated, corresponding to different information patterns for the control input. Exploiting the structure of parameterised polyhedra, we show that within each validity region the margin is concave in the attack parameter, which reduces the follower minimisation to finitely many extreme parameters. The complete max--min game is then solved by a finite family of LPs, one per defender validity region, each enforcing all attacker regions under a common defender decision and guaranteed margin. The framework handles hard state constraints and additional costs related to the safe set size, and recovers optimal set parameters together with state and attack realisations that activate the certificate. A load frequency control example under false data injection illustrates the construction, the validity decomposition, and the two information patterns.

[173] arXiv:2611.18174 [pdf, html, other]
Title: Sample complexity and scalability of adaptive-sampling trust-region methods for zeroth-order stochastic optimization --- Part~II: a new pathwise analysis with randomized subspaces
Sara Shashaani, Coralia Cartis, Kwassi Joseph Dzahini
Subjects: Optimization and Control (math.OC)

Stochastic trust-region methods are usually analyzed in expectation or with high probability: the guarantee is about the law of the algorithm, not about the run in hand. This paper analyzes the adaptive sampling stochastic trust-region method ASTRO-DF (which is the reuse variant ASTRA-R in Part I) in random subspaces along almost every sample path. The route has one probabilistic ingredient, the accuracy of the common-random-number estimates at the adaptive sample size, uniformly over the trust region; Part~I established it by chaining, here it is obtained at the stopping time by optional stopping and converted, by the first Borel--Cantelli lemma, into an accuracy that holds from a random index on, after which the deterministic trust-region argument applies. We prove almost sure convergence and almost sure iteration and sample complexity of orders $\tilde{\mathcal{O}}(d\epsilon^{-2})$ and $\tilde{\mathcal{O}}(d^2\epsilon^{-4})$, with a subspace dimension growing logarithmically; we show that at a fixed subspace dimension the eventual-accuracy argument yields $\tilde{\mathcal{O}}(\epsilon^{-2-\mathcal{O}(1/p)})$ iterations and $\tilde{\mathcal{O}}(\epsilon^{-4-\mathcal{O}(1/p)})$ samples; we show that the random index after which the rates hold cannot be too large and has an explicit, rapidly decaying tail. Compared with the supermartingale route, the pathwise route needs no lower bound on the per-iteration probability of a good iteration, no coupling between the trust-region expansion factor and the sketch, and no moment condition on the summed squared radii.

[174] arXiv:2611.18178 [pdf, html, other]
Title: Cartesian products of groups as quantum metric spaces
Are Austad, David Kyed
Subjects: Operator Algebras (math.OA)

We provide a new class of finitely generated groups whose word-length functions give rise to compact quantum metric spaces. Kaad's recent theory of matrix compact quantum metric spaces is instrumental in obtaining this new class, and along the way we also show that any length function on an amenable group which gives rise to a compact quantum metric space in fact gives rise to a matrix compact quantum metric space, and that the corresponding result is false for the free group on two generators.

[175] arXiv:2611.18185 [pdf, html, other]
Title: On the periodicity of meromorphic functions of the form $ff^{(k)}$
Shuang-Shuang Yang, Dong-hai Zhao, Chung-Chun Yang, Liang-Wen Liao
Subjects: Complex Variables (math.CV)

For a non-entire meromorphic function $f$ and an integer $k$, we will show that whenever $ff^{(k)}$ is periodic so is $f$. This result gives an affirmative answer to a significant class of the so called generalized Yang's conjecture.

[176] arXiv:2611.18191 [pdf, html, other]
Title: Representing in Low rank II: Virtual structure and Isomorphism problem
Robynn Corveleyn, Geoffrey Janssens, Doryan Temmerman
Comments: Preliminary version. 50 pages
Subjects: Group Theory (math.GR); Representation Theory (math.RT)

We group theoretically characterise the finite groups $G$ and number fields $F$ such that all $F$-representations of reduced degree at least $2$ are so-called exceptional. If $G$ is not a $2$-group, we obtain a full classification. Secondly, we determine whether such groups are uniquely determined by their group algebra $FG$. In particular, we obtain an instance of the virtual structure problem of Kleinert and answer the rational isomorphism problem for such groups.

[177] arXiv:2611.18193 [pdf, html, other]
Title: Graphs attaining Haemers' toughness bound
Yifan Li, Cheng Yeaw Ku
Subjects: Combinatorics (math.CO)

Haemers \cite{Haemers2020} conjectured that every connected noncomplete graph $G$ satisfies $t(G)\geqslant\mu_2/(\mu_n-\delta)$, where $t(G)$ is the toughness of $G$, $\mu_2$ and $\mu_n$ are its algebraic connectivity and Laplacian spectral radius, and $\delta$ is its minimum degree. Greaves and Zhu \cite{GreavesZhu2026} recently proved this conjecture, leaving the equality case open. We characterize all graphs attaining equality: a graph attains equality if and only if its complement has a complete component whose order is at least the Laplacian spectral radius of every other component. Equivalently, its algebraic connectivity and independence number sum to its order. We also determine all vertex cuts attaining the toughness, and show that for regular graphs, the equality graphs are exactly the complete multipartite graphs with parts of equal size.

[178] arXiv:2611.18194 [pdf, html, other]
Title: The Möbius function of factorizations with a simple prime factor
Madjid Mirzavaziri, Daniel Yaqubi
Comments: 5 pages
Subjects: Combinatorics (math.CO); Number Theory (math.NT)

The poset of factorizations of a positive integer $n$ (ordered by refinement) is known to have a very irregular Möbius function. We prove that this function becomes completely explicit whenever $n$ is divisible by a prime $q$ to the first power only ($q^2 \nmid n$). Specifically, between a factorization with $k$ factors and $n$ itself, the Möbius function is given by $(-1)^{k-1}$ multiplied by the number of ways to order the factors that are not divisible by $q$. As a consequence, the sum of the absolute values of the Möbius function over this interval equals twice the number of ordered factorizations of $n/q$.

[179] arXiv:2611.18195 [pdf, html, other]
Title: Stability theorems for $\varepsilon$-simplicial sets
Dominik Lachman
Subjects: Category Theory (math.CT); Algebraic Topology (math.AT)

We establish stability results for internal homs of $\varepsilon$-simplicial sets, a framework motivated by nerves of Frobenius monoids in the category of relations. Rotations are modelled through edge witnesses and horn-filling conditions, without requiring unique fillers. For $\varepsilon$-fibrant objects $X$ and $Y$, we prove that the internal hom $\mathrm{Fun}(X,Y)$ satisfies the $\varepsilon$-coherence conditions and admits fillers for all $\varepsilon$-horns of dimension at least two. Its subobject consisting of simplices whose vertices correspond to $\eta$-edge-preserving maps is $\varepsilon$-fibrant. We also introduce $\eta\varepsilon$-simplicial sets by adding explicit $\eta$-witnesses and prove that the internal hom of two $\eta\varepsilon$-fibrant objects is again $\eta\varepsilon$-fibrant.
Our proofs use adjunctions relating $\varepsilon$-simplicial sets and paracyclic sets. We characterise the $\varepsilon$-horn filling property by requiring the corresponding counit to be a trivial Kan fibration. Consequently, for every object satisfying this property, coherent choices of rotations of each simplex form a contractible Kan complex.

[180] arXiv:2611.18196 [pdf, html, other]
Title: Movable Antenna-Aided ISAC: A Time- and Frequency-Division Framework
Yuyan Zhou, Haocheng Hua, Jie Xu, Rui Zhang
Comments: 13 pages, 9 figures, 1 table
Subjects: Information Theory (cs.IT)

This paper investigates movable-antenna (MA)-enhanced integrated sensing and communication (ISAC) under time division duplex (TDD) and frequency division duplex (FDD) protocols, where sensing and communications occupy orthogonal time and frequency resources, respectively. A wideband target-position Cramér-Rao bound (CRB) is derived under a pulse-radar framework with pulse compression, incorporating delay and angle estimation error bounds in Cartesian coordinates. Both bounds depend on sensing power; the delay bound also depends on sensing bandwidth, while the angle bound depends on the effective aperture determined by the antenna position vector (APV). A worst-case position CRB over a prescribed target region ensures robust sensing performance. For multiuser downlink communication, joint APV and resource-allocation problems are formulated for TDD and FDD to maximize the minimum achievable user rate subject to the sensing requirement. An alternating optimization algorithm is developed for FDD, while TDD is addressed by searching over feasible sensing pulse numbers combined with APV optimization. Representative scenarios clarify how MA improves channel orthogonality and enlarges the sensing aperture, and how these effects shape the TDD/FDD rate comparison. Numerical results show that APV optimization enlarges the communication-sensing tradeoff region over fixed-position antenna benchmarks. The optimized configurations exhibit distinct tendencies: TDD favors a larger antenna position variance, whereas FDD favors better channel orthogonality among users.

[181] arXiv:2611.18203 [pdf, html, other]
Title: The Benjamin-Feir stability diagram for Stokes waves with constant vorticity in finite depth
Bowen Chen, Huy Q. Nguyen
Comments: This paper builds on our previous work arXiv:2610.39000 and reuses several technical results established there. Companion Mathematica notebooks and Rocq proof scripts are available upon request
Subjects: Analysis of PDEs (math.AP); Fluid Dynamics (physics.flu-dyn)

We determine the Benjamin-Feir stability diagram for small-amplitude Stokes waves with constant vorticity in finite depth. For the full water wave system, we derive an explicit instability index and rigorously classify its sign throughout the depth-vorticity plane. With gravitational acceleration and carrier wavenumber normalized to one, we identify a unique minimum depth $h_{\text{crit}}\approx1.36271$, below which Benjamin-Feir instability is absent for every vorticity. Above this depth, two vorticity thresholds delimit the unstable regime, outside of which the spectrum near the origin remains purely imaginary for all small Floquet exponents. In particular, at each fixed finite depth, constant vorticity of sufficiently large magnitude suppresses Benjamin-Feir instability. Moreover, any constant vorticity $\gamma\ge 2/\sqrt{3}$ suppresses Benjamin-Feir instability at every finite depth. The proof combines Hamiltonian spectral perturbation theory, symbolic computations, and formal verification in Rocq. Away from the transition set, our results rigorously confirm the stability criterion predicted by the nonlinear Schrödinger approximation of Thomas, Kharif, and Manna.

[182] arXiv:2611.18208 [pdf, html, other]
Title: Consensus-Based Optimization of Path-Integral Free Energy for Model Predictive Control
Daisuke Inoue, Yuyang Huang, Dante Kalise
Subjects: Optimization and Control (math.OC)

We propose CBO-MPPI, a sampling-based predictive controller that applies consensus-based optimization (CBO) to the free energy underlying model predictive path integral control (MPPI). Under hard constraints, this objective rewards sampling neighborhoods containing feasible, low-cost trajectories under perturbation. Standard MPPI performs a local stochastic search by updating one nominal control sequence from Gaussian perturbations around it. In CBO-MPPI, we estimate the free energy at multiple nominal centers from local rollouts. These estimates define a shared consensus that guides drift and diffusion, and the final selected center supplies an MPPI weighted-mean output. For the associated mean-field model, we establish well-posedness and, under additional assumptions, convergence toward a free-energy minimizer. In simulations of obstacle navigation, pendulum swing-up, and planar-arm manipulation under equal rollout budgets, at high temperatures, CBO-MPPI attains lower free energy than MPPI and multi-start MPPI and maintains greater obstacle clearance than CBO-MPC.

[183] arXiv:2611.18212 [pdf, html, other]
Title: Frobenius and perfection in framed motives
Grigory Garkusha
Subjects: Algebraic Geometry (math.AG); Algebraic Topology (math.AT)

We develop explicit Frobenius and perfection arguments for framed motives over imperfect fields. In positive characteristic, power framing homotopies and local framed transfers make relative Frobenius invertible after inverting the characteristic. Descent through successive Frobenius twists then gives a proof of strict homotopy invariance for homotopy invariant quasi-stable additive framed presheaves and identifies the canonical comparison with the perfect closure as a stable Nisnevich local equivalence of framed motives. We extend the comparison to E-framed motives for every motivic Thom spectrum E. It also yields the cancellation theorem and the cone theorem. For commutative symmetric Thom ring spectra, we identify triangulated categories of effective E-framed motives and effective E-modules and prove perfection invariance of these triangulated categories. All comparisons are made after inverting the exponential characteristic.

[184] arXiv:2611.18216 [pdf, html, other]
Title: On weakly m-convex sets, m=1,...,n-1, in n-dimensional Euclidean spaces
Tetiana M. Osipchuk
Comments: 7 pages, 2 figures
Subjects: Metric Geometry (math.MG)

We study general topological properties of open and closed weakly $m$-convex sets, $m=1,\ldots, n-1$, in the real $n$-dimensional Euclidean space $\mathbb{R}^n$, $n\geqslant2$. An open set in $\mathbb{R}^n$ is called weakly $m$-convex if, through every boundary point of the set, there passes an $m$-dimensional plane that does not intersect the set. A closed set in $\mathbb{R}^n$ is weakly $m$-convex if it can be approximated from the outside by a countably decreasing family of open weakly $m$-convex sets. The set of all points in the complement of a given subset of $\mathbb{R}^n$ through each of which every $m$-dimensional plane intersects the subset is called the $m$-nonconvexity-point set corresponding to the given subset. We prove that the nonempty $m$-nonconvexity-point set corresponding to an open weakly $m$-convex set is itself open and weakly $m$-convex, and that the interior of every closed weakly $m$-convex set with nonempty interior is weakly $m$-convex for every $m=1,\ldots, n-1$.

[185] arXiv:2611.18218 [pdf, html, other]
Title: The Chabauty--Kim dimension inequality via noncommutative Iwasawa theory
Sa'ar Zehavi
Comments: 61 pages, comments welcome!
Subjects: Number Theory (math.NT); Algebraic Geometry (math.AG)

We establish Kim's conjectural dimension inequality for smooth projective geometrically connected curves $C/\mathbb{Q}$ of genus at least two with a rational basepoint. For every odd prime $p$ of good reduction, we prove that $$\mathrm{dim} H_f^1(G_{\mathbb{Q},\Sigma},U_n^\mathrm{ét}) < \mathrm{dim}(U_n^{\mathrm{dR}}/F^0)$$ for all sufficiently large $n$, where $U_n^\mathrm{ét}$ and $U_n^\mathrm{dR}$ are the $n$'th lower central series truncations of the $\mathbb{Q}_p$-pro-unipotent geometric étale, and de Rham fundamental groups of $C$, and $\Sigma$ is any finite set of places containing $p$, $\infty$, and the primes of bad reduction. Inspired by Coates and Kim's work on curves with CM Jacobians, we use noncommutative Iwasawa theory to bound second Galois cohomology through dimensions of kernels of certain Iwasawa operators, acting on finite dimensional representations of the ambient generalized symplectic group. We establish bounds for these kernels in terms of the highest weight and dimension of the ambient symplectic representation. No restriction is imposed on the Jacobian's geometric endomorphism ring or its Tate-module Galois image. Consequently, the Chabauty--Kim loci are finite at all sufficiently large levels, recovering the Mordell theorem over $\mathbb{Q}$ through the Chabauty--Kim method.

[186] arXiv:2611.18222 [pdf, html, other]
Title: Motivic Invariants of Automorphisms and the Plane Cremona Group
Ran Azouri, Anubhav Nanavaty, Jesse Pajwani
Comments: 48 pages, comments welcome!
Subjects: Algebraic Geometry (math.AG)

Recent work of Campbell and Zakharevich studies the $K$-theory spectrum of varieties. In previous work, the second author constructs a derived version of the $\mathbb{A}^1$-Euler characteristic, giving a map out of this spectrum. We analyse the morphism that the derived $\mathbb{A}^1$-Euler characteristic induces out of $K_1(\mathrm{Var}_k)$. We obtain an explicit description of this map, which encodes information about automorphisms of varieties. We use Hermitian $K$-theory to obtain a geometric description for part of this morphism in terms of Hodge cohomology. This allows us to obtain structural results about the group $K_1(\mathrm{Var}_k)$. As an application, we use the $\mathbb{Z}/2\mathbb{Z}$-equivariant minimal model programme for surfaces to construct an arithmetic invariant of a large class of involutions in the plane Cremona group. We use this to construct two non-conjugate de Jonquières involutions with isomorphic positive genus fixed curves over any perfect field $k$ of characteristic not $2$ with at least 6 elements which admits a quadratic extension.

[187] arXiv:2611.18225 [pdf, html, other]
Title: Causal and conditional tail coefficients: asymptotics, inference and graph recovery
Axel Bücher, Mario Krali
Subjects: Statistics Theory (math.ST); Methodology (stat.ME)

The causal tail coefficient (CTC) measures the influence of an extreme value of one variable on another variable and has been proposed as a tool for causal discovery in heavy-tailed models. Despite its popularity, the asymptotic behavior of its empirical counterpart has not been well understood. We develop an asymptotic theory for the rank-based CTC estimator with an intermediate threshold under nonparametric conditions that are satisfied by all standard copula models. A key observation is that the CTC is determined by the mean of a conditional tail limit distribution, which clarifies its interpretation and determines the asymptotic variance of the estimator. We establish joint asymptotic normality for the entire CTC matrix and prove consistency of a multiplier bootstrap for simultaneous inference. For heavy-tailed linear and recursive max-linear structural equation models, we show that the CTC equals one if and only if the first variable is an ancestor of the second, which leads to confidence graphs for the ancestral graph with asymptotic coverage guarantees. All results extend to general conditional tail coefficients, defined as further functionals of the conditional tail limit distribution. A simulation study and an application to dietary intake data illustrate the methods.

[188] arXiv:2611.18228 [pdf, html, other]
Title: New Results on the Subfield Metric
Ana Kosovac, Jeanette Plechinger, Nikola Spirovski, Violetta Weger
Subjects: Information Theory (cs.IT)

In this paper, we further develop the theory of the recently introduced $\lambda$-subfield metric. We investigate extremal codes, classical bounds and asymptotic densities in this setting.
We first study codes attaining a Singleton-type bound, called Maximum $\lambda$-subfield Distance (M$\lambda$D) codes. We establish structural restrictions on their parameters and extend the theory to sublinear codes. We then investigate the asymptotic density of M$\lambda$D codes in several parameter regimes and compare their behavior with that of MDS and MRD codes.
We then turn to a Plotkin-like bound, where we construct a family of constant-weight codes attaining the bound and classify all non-degenerate linear constant-weight codes for $\lambda>1$.
Finally, we complement the collection of classical coding-theoretic bounds available for the $\lambda$-subfield metric by deriving Griesmer-, Elias- and Johnson-type bounds.

[189] arXiv:2611.18231 [pdf, html, other]
Title: Periodic orbits of quadratic polynomials of periods six and seven
Pekka Kosunen
Subjects: Dynamical Systems (math.DS)

The dynamics of quadratic polynomials is commonly studied by using the family of maps f_{c}(x) = x^{2} + c, where c include C. In this paper we form equations of periodic orbits of periods six and seven on a new (u,v)-plane and consider also the corresponding equations on the (x,y)-plane. The new (u,v)-model produces equations for the periods six and seven with significantly lower degree than the ones obtained by the previous models which enables us to find their solutions.

[190] arXiv:2611.18234 [pdf, html, other]
Title: Optimal polynomial decay and nonlinear stabilization for an indirectly damped wave-MGT system
Tae Gab Ha
Subjects: Analysis of PDEs (math.AP)

We study a conservative wave equation coupled to a dissipative Moore--Gibson--Thompson equation by a zero-order interaction that is symmetric in augmented variables. A general modal proposition relates the exact resolvent and semigroup asymptotic constants through an asymptotically unitary diagonalization. Its application to this system yields the optimal fourth-order resolvent estimate and the exact linear decay constants. These estimates lead to nonlinear stabilization from small regular initial data. On smooth bounded domains, a weighted composition estimate that accommodates a singular third derivative of the source at zero gives the optimal state rate $t^{-3/4}$ and energy rate $t^{-3/2}$ for power and logarithmic sources. In dimension three, the result includes $f(u)=|u|^q u$ with $3/2<q<2$ and $f(u)=|u|^{\gamma-2}u\log|u|$ with $7/2<\gamma<4$, within the source ranges of the companion general-source theory. Dimension-dependent extensions hold through dimension seven in the same data space, and in arbitrary dimension with higher regularity and a higher order of vanishing at zero. A lower-regularity graph-norm theorem and a conditional transfer theorem for general sources are also proved. Each nonlinear small-data decay exponent is optimal among uniform estimates with the stated dependence on the initial-data norm.

[191] arXiv:2611.18242 [pdf, html, other]
Title: Simultaneous recovery of elastic and viscous coefficients in a Kelvin-Voigt equation
Dong Qiu, Song-Ren Fu, Yeqiong Ye, Ting Zhou
Comments: 27 pages, 3 figures
Subjects: Analysis of PDEs (math.AP)

In this paper, we study the simultaneous recovery of a spatially dependent elastic coefficient and a time- and space-dependent viscosity coefficient in a scalar Kelvin-Voigt equation. We prove that the displacement-to-traction map over any fixed time interval uniquely determines both coefficients, provided that the Riemannian metric induced by the viscosity is simple at each time. In the velocity formulation, the elastic term gives rise to a Volterra memory term involving second-order spatial derivatives, with a corresponding memory contribution to the boundary traction. We first determine all normal derivatives of both coefficients at the boundary using highly oscillatory boundary data. We then construct exact parabolic exponential solutions in the presence of memory and determine the viscosity by boundary rigidity. With the viscosity determined, an approximate identity argument reduces recovery of the elastic coefficient to injectivity of the scalar geodesic ray transform. Finally, numerical experiments illustrate a regularized finite-dimensional reconstruction of both coefficients from finitely many moments of the displacement-to-traction map.

[192] arXiv:2611.18247 [pdf, html, other]
Title: Group classification of a class of generalized Korteweg-de Vries equations
Oleksandra O. Vinnichenko
Comments: 26 pages, 3 tables
Subjects: Mathematical Physics (math-ph); Analysis of PDEs (math.AP); Exactly Solvable and Integrable Systems (nlin.SI)

Applying the method of furcate splitting, we carry out the complete group classification of a class of generalized Korteweg-de Vries equations. This class includes the Korteweg-de Vries, modified Korteweg-de Vries and Harry Dym equations, as well as the Rosenau-Hyman compacton equations. The equivalence group of the class is computed in two independent ways, by the advanced version of the direct method and by the megaideal-based version of the algebraic method. As a by-product, we construct the automorphism group of the equivalence algebra and all its megaideals, whose number is infinite. We also find all additional point equivalences between the classification cases. The maximal Lie invariance algebras of equations from the class are of dimensions from two to five, and all the corresponding Lie-symmetry extensions are regular except those for the equations similar to the Harry Dym equation, which are singular and are the only ones of the maximal dimension five. Finally, we classify the conservation laws of equations from the class with characteristics of nonpositive order.

[193] arXiv:2611.18250 [pdf, html, other]
Title: What is... An Exceptional Set Estimate?
Paige Bright, Krystal Taylor
Comments: 4 pages, 1 figure. To appear in the Notices of the AMS
Subjects: Classical Analysis and ODEs (math.CA)

Exceptional set estimates are a fundamental topic of interest in projection theory. We introduce the topic through discrete geometry, and use this perspective to motivate some key results in the realm of geometric measure theory. To appear in the "What is?" series in the Notices of the AMS.

[194] arXiv:2611.18258 [pdf, html, other]
Title: Equivariant resolution of singularities for $T$-varieties in positive characteristic
Gary Martínez-Núnez
Comments: 22 pages. Comments are welcome :)
Subjects: Algebraic Geometry (math.AG)

Let the ground field be algebraically closed of positive characteristic. We prove that every variety endowed with an algebraic torus action whose general orbits have codimension at most three admits an equivariant resolution of singularities. The proof combines the description of such varieties in terms of proper polyhedral divisors and divisorial fans, the existence of log resolutions in dimension at most three, and the resolution of toroidal embeddings established by Kempf, Knudsen, Mumford and Saint-Donat.

[195] arXiv:2611.18260 [pdf, html, other]
Title: Short quadratic exponential sums with primes in major arcs
Zarullo Rakhmonov
Comments: revised version of the article
Journal-ref: Z. Kh. Rakhmonov, "Estimates of short exponential sums with primes in major arcs'', Chebyshevskii Sb., 22:4 (2021), 200-224
Subjects: Number Theory (math.NT)

Using the second moment of Dirichlet $L$-functions on the critical line over the major arcs ${\mathfrak M}({\mathscr L}^b)$, with $\tau=y^3x^{-1}{\mathscr L}^{-b_1}$, and excluding a small neighborhood of the centers of these arcs, i.e., those $\alpha$ satisfying $|\alpha-\frac{a}{q}|>(8\pi y^2)^{-1}$, for $y\ge x^{1-\frac{\scriptstyle1}{\scriptstyle{9-4\sqrt{2}}}}{\mathscr L}^{c_2}$, where $c_2=\frac{2A+24+(\sqrt{2}-1)b_1}{2\sqrt{2}-1}$, we obtain the estimate $$ S_2(\alpha;x,y)=\sum_{x-y<n\le x}\Lambda(n)e(\alpha n^2)\ll y\,{\mathscr L}^{-A}. $$ Moreover, in a small neighborhood of the center of the major arcs, defined by $|\alpha-\frac{a}{q}|\le(8\pi y^2)^{-1}$, for $y\ge x^{\frac{\scriptstyle5}{\scriptstyle8}}{\mathscr L}^{1,5A+0,25b+18}$, an asymptotic formula with a remainder term is obtained for $S_2(\alpha;x,y)$, where $A$, $b_1$, and $b$ are arbitrary fixed positive constants, and ${\mathscr L}=\ln xq$.

[196] arXiv:2611.18263 [pdf, html, other]
Title: Einstein contact metrics with integrable CR structure
Beniamino Cappelletti-Montano
Subjects: Differential Geometry (math.DG)

We prove that every compact Einstein contact metric manifold of dimension at least $5$ with integrable associated CR structure is Sasakian. We show that without the assumption of compactness this result does not hold: namely, for every odd dimension at least $5$, we construct an explicit noncompact Einstein contact metric manifold, with integrable CR-structure, which is not Sasakian.

[197] arXiv:2611.18265 [pdf, html, other]
Title: The Capillary Orlicz--Christoffel--Minkowski Flows
Dongjing Ma, Peihe Wang, Hua Zhu
Subjects: Analysis of PDEs (math.AP)

We study a capillary Orlicz--Christoffel--Minkowski flow on a non-obtuse spherical cap for $1\le k\le n-1$: \[ \partial_t h= \frac{h^2\varphi(\ell/h)}{f}\, \bar{\sigma}_k(\nabla^2h+h\sigma)-h, \qquad \nabla_\mu h=\cot\theta\,h. \] In the supercritical regime \[ a_\varphi(s)=\frac{s\varphi'(s)}{\varphi(s)} \ge k+1+\delta, \qquad s a_\varphi'(s)\ge0, \] we obtain time-uniform $C^0$ and $C^1$ estimates and a closed scalar equation for the speed ratio. A dynamic Orlicz square-completion identity, combined with inverse-concavity, yields a viscosity estimate for the minimum principal radius. Under a strict dynamic Orlicz-convexity condition and \[ \frac{f_\mu}{f}\ge\frac{n-k}{n}\cot\theta, \] we prove time-uniform two-sided principal-radius bounds on every smooth existence interval for $0<\theta\le\pi/2$ and deduce long-time existence and smooth convergence to a stationary solution. The boundary regularity step uses a quantitative interior concave estimate through Neumann reflection and a concave uniformly elliptic extension. Under the weaker condition $(f\ell^{k-1})_\mu\ge0$, strict convexity is preserved on every smooth existence interval. For $k=1$, the transformed scalar equation is uniformly parabolic for every $0<\theta<\pi$. Classical parabolic estimates then give an all-angle scalar flow theorem, without asserting geometric convexity preservation in the obtuse range.

[198] arXiv:2611.18266 [pdf, html, other]
Title: Atlas-DeePC: Learning Behavioral Atlases for Predictive Control
Dian Jin, Zhiyuan Jin, Jeremy Coulson
Comments: 25 pages, 8 figures, 4 tables. Submitted to 9th Annual Learning for Dynamics & Control Conference
Subjects: Optimization and Control (math.OC)

Data-enabled Predictive Control (DeePC) uses linear combinations of recorded input-output trajectories to compute control actions without a parametric model. For nonlinear systems, these linear combinations may not satisfy the system dynamics, and the computational cost grows with dataset size. We propose Atlas-DeePC, which approximates the behavior of a dynamical system using a collection of low-dimensional subspaces, termed a behavioral atlas, to enable computationally efficient prediction and control. The atlas is constructed offline by clustering the data and fitting a subspace to each cluster. Online, the controller selects the subspace that best matches recent measurements and solves a predictive control problem parameterized by its orthonormal basis. A graph-based reference planner complements the controller by providing intermediate references across operating regions. We illustrate Atlas-DeePC on a planar robotic manipulator, where it achieves higher success rates and substantially lower online computation times than the compared controllers based on online data selection. An additional benchmark of an autonomous racing task is also included. The project website provides code and demonstrations this https URL

[199] arXiv:2611.18269 [pdf, html, other]
Title: Inverse energy transfer for 2D Navier--Stokes near a self-similar vortex collapse
Trinh T. Nguyen
Comments: 32 pages
Subjects: Analysis of PDEs (math.AP); Mathematical Physics (math-ph)

We prove inverse energy transfer for the two-dimensional Navier--Stokes equations near a self-similar three-vortex collapse, confirming the 1979 prediction of Novikov and Sedov. Nonlinear interactions transfer kinetic energy from high to low frequencies over a common time interval that shrinks to the collapse time as the viscosity tends to zero. We prove that the net nonlinear transfer over this interval converges to the same positive constant across an expanding range of frequency cutoffs, with quantitative error bounds uniform in the cutoff.

[200] arXiv:2611.18277 [pdf, html, other]
Title: Nondegeneracy of the bubble for a fourth-order Liouville boundary problem
Jiaoping Chen, Wenjing Chen, Shengbing Deng
Subjects: Analysis of PDEs (math.AP)

We establish the nondegeneracy of the bubble for \[ \Delta^2u=0\quad \text{in }\mathbb R^4_+,\qquad \partial_tu=0,\quad \partial_t\Delta u=e^{24\pi^2u} \quad \text{on }\partial\mathbb R^4_+. \] Using Fourier analysis, stereographic projection and a removable-singularity argument, we classify the weighted $L^2$ boundary kernel without assuming boundedness of the boundary solution. This determines the bounded half-space kernel. Both kernels are generated by dilation and tangential translations. We further obtain sharp estimates for the projected spherical inverse.

[201] arXiv:2611.18283 [pdf, html, other]
Title: Kobayashi-Hitchin Correspondence on Equivariant and Basic Bundles
Lucas H. S. Gomes, Hisashi Kasuya, Takashi Ono
Comments: 22 pages. Comments are welcome
Subjects: Differential Geometry (math.DG)

Let $(X,J,\omega)$ be a compact complex manifold with Gauduchon metric and $G$ a Lie group acting on $X$ by holomorphic isometries. We give an explicit proof of the existence of a $G$-invariant Hermitian-Einstein metric on a $G$-polystable $G$-equivariant holomorphic vector bundle adapting the proof of Lübke-Teleman. We see that if $G$ is a connected complex Lie group with the bijective exponential map and the action of $G$ on $X$ is locally free, then our existence theorem is equivalent to the existence of a basic Hermitian-Einstein metric on a basic polystable basic holomorphic vector bundle on $X$ foliated by the foliation generated by the $G$-action. As an application, we can say that the foliated Kobayashi-Hitchin correspondence on a Sasakian manifold $S$ is a $\mathbb{C}$-equivariant Kobayashi-Hitchin correspondence on the Vaisman manifold $S\times S^1$.

[202] arXiv:2611.18285 [pdf, html, other]
Title: On non-vanishing of the first Hochschild cohomology of blocks
Matthew Antrobus
Comments: 15 pages, comments welcome
Subjects: Representation Theory (math.RT)

Let $B$ be a block of a finite group algebra $kG$, where $k$ is an algebraically closed field of characteristic $p>0$. Inspired by the result of Fleischmann, Janiszczak and Lempken that $\mathrm{HH}^1(kG) \not=0$ when $p$ divides the order of $G$, Linckelmann conjectured that $\mathrm{HH}^1(B)\not= 0$ when $B$ has non-trivial defect. By developing the methods of Briggs, Rubio y Degrassi and the author, we give a fusion theoretic criterion for non-vanishing, proving the conjecture holds for all blocks of abelian defect. Further, we show the criterion holds for all blocks at $p > 5$, proving the conjecture for all such primes

[203] arXiv:2611.18287 [pdf, html, other]
Title: The Capillary Dual Orlicz--Christoffel--Minkowski Problem
Dongjing Ma, Qiqi Zhang, Hua Zhu
Subjects: Analysis of PDEs (math.AP)

We study a capillary dual Orlicz--Christoffel--Minkowski problem on a spherical cap. For $2\le k\le n$, $1<p<k+1$, and $0<\theta<\pi/2$, we consider \[
\sigma_k(\nabla^2h+h\sigma)
=
f(\xi)h^{p-1}\frac{\rho^{k+1}}{\varphi(\rho)},
\qquad
\rho=(h^2+|\nabla h|^2)^{1/2}, \] with the capillary Robin condition $\nabla_\mu h=\cot\theta\,h$. Assuming that $f$ is positive, smooth and horizontally even, $g=f^{-1/(p+k-1)}$ satisfies the capillary spherical-convexity and boundary compatibility conditions, and $H(r)=\varphi(r)/r^p$ is strictly increasing and proper with $Q_\varphi(r)\le k+1$, we prove the existence of a smooth, positive, horizontally even solution that is strictly capillary convex. The proof uses an Orlicz homotopy, uniform a priori estimates, a viscosity constant-rank argument when $k<n$, global oblique regularity, and degree theory.

[204] arXiv:2611.18289 [pdf, html, other]
Title: Transforming local positivity: from minimal valuations to irrational Seshadri constants
Sönke Rollenske
Subjects: Algebraic Geometry (math.AG)

We explain how a valuative Nagata type statement proposed by Dumnicki, Harbourne, Küronya, Roé and Szemberg on a polarised surface $(S, H)$ implies maximality (and hence often irrationality) of Seshadri constants on simple cyclic covers.
As sample applications we show that very general degree two K3 surfaces and very general hypersurfaces in $\mathbb P^3$ of degree $6$, $8$ or $d\geq 10$ have irrational Seshadri constant at a very general point, unless $d$ is a square.

[205] arXiv:2611.18292 [pdf, other]
Title: On the dynamics of N classical particles interacting with a complex environment
Thierry Goudon (LJAD), Bruno Marcos (LJAD), Thomas Oudeville (LJAD), Simona Rota Nodari (LJAD, IUF)
Subjects: Analysis of PDEs (math.AP); Mathematical Physics (math-ph)

The interactions of a particle with its environment eventually lead to the damping of its motion. This phenomenom is well understood when considering a single particle exchanging energy with the environment. The situation is definitely more complex when many particles are considered: the energy dissipation mechanisms are not clear whenever particles create a common well in which they keep interacting. In this framework, we identify the equilibrium solutions, that consist in clusters of particles at rest, and we establish their spectral stability. We show that the mean position/velocity pair is damped exponentially fast at the linearized level. Coming back to the non linear problem, we can show, at least in some simplified cases, that the dissipation mechanisms also involve far slower rates, that explain the difficulty in observing the relaxation behavior on the individual trajectories.

[206] arXiv:2611.18296 [pdf, html, other]
Title: From Butson Hadamard switching to graph switching and back
Aida Abiad, Ronan Egan, Stef Mohnen
Subjects: Combinatorics (math.CO)

Switching is a local operation that preserves specified properties of a combinatorial object. It has been used to derive constructions of inequivalent Hadamard matrices and nonisomorphic cospectral graphs. In this paper we investigate the relation between these constructions for real and Butson Hadamard matrices. We show that, while equivalent matrices have isomorphic associated graphs, the converse can fail for Butson matrices. We prove that a character decomposition determines the graph spectrum from the singular values of entrywise powers. For prime phase, we also observe that the spectrum depends only on the order and phase; for composite phase, a switching preserving the Butson property can change it. We show that Orrick's closed-quadruple and Hall-set switchings correspond to Wang-Qiu-Hu switching, up to graph isomorphism. Going in the other direction, we characterise when the Godsil-McKay and Wang-Qiu-Hu reflections preserve the Butson property and give phase-multiplicity conditions for the corresponding graph switchings. Finally we also relate block switching to cyclic graph switching under a phase-balance condition, automatic at prime phase. These results provide a basis for transferring tools and techniques between matrix switching and graph switching.

[207] arXiv:2611.18299 [pdf, html, other]
Title: The Capillary Orlicz--Christoffel--Minkowski Problem
Hua Zhu
Subjects: Analysis of PDEs (math.AP)

We study the Capillary Orlicz--Christoffel--Minkowski Problem on an acute spherical cap. For $1\le k\le n-1$, the equation is \[ h\,\varphi(\ell/h)\,\bar\sigma_k(\nabla^2h+h\sigma)=f, \qquad \nabla_\mu h=\cot\theta\,h, \] where $\ell$ is the support function of the unit capillary spherical cap. For $1\le k\le n-1$, this includes the capillary Christoffel--Minkowski and capillary $L_p$ Christoffel--Minkowski problems; the same density formally recovers the capillary Orlicz--Minkowski endpoint when $k=n$. We organize the theory in five parts. After recalling the elementary symmetric functions and the capillary support-function formalism, we review the capillary Orlicz--Brunn--Minkowski framework and introduce the intermediate-order Orlicz $k$-mixed functional and its Euler--Lagrange equation. In the supercritical regime \[ a_\varphi(t):=\frac{t\varphi'(t)}{\varphi(t)}\ge k+1+\delta, \] we derive uniform $C^0$, $C^1$ and $C^2$ estimates for positive $k$-admissible solutions. The same supercritical index produces a strictly coercive second variation and a spectral gap for the linearized Neumann operator. These facts lead to existence and uniqueness by a continuity method, quantitative stability of the solution map in both the datum and the Orlicz weight, and an open perturbative class of strictly convex non-power solutions. Under an additional capillary Orlicz-convexity condition on the datum, a full-rank argument upgrades the global admissible solution to a strictly convex capillary support function.

[208] arXiv:2611.18300 [pdf, html, other]
Title: Arithmetical and set-theoretic semantics of the logic of problems and propositions
Anastasia Onoprienko, Nikolay Vereshchagin
Subjects: Logic (math.LO)

Kolmogorov interpreted intuitionistic logic as a calculus of problems and later remarked that a complete treatment should deal with problems and propositions together. Melikhov's logic HC is such a joint two-sorted system: it combines classical propositions with intuitionistic problems by means of two modalities, the problem !A (``find a proof of the proposition A'') and the proposition phi (``the problem phi has a solution''). We give the language of HC a formal semantics in which the modalities are read literally: solutions of !A are proofs of A in a fixed formal theory, ?phi states that phi has a solution, and the connectives on problems are interpreted as in Kleene realizability. Three variants are studied: the arithmetical semantics I (provability in PA), its external version E (truth in the standard model), and the set-theoretic semantics B over ZF, where problem variables are ``black boxes'' and a quantifier Pi over them is available. Validity is defined as the existence of a computable uniform solution. We determine which schemes are valid, build calculi HCI, HCE, HCB sound with respect to the three semantics, and derive Lob's scheme from the fixed-point lemma inside the common core of our calculi and HC. The propositional fragments of HCI and HCE are exactly the provability logics GL and GLS; the positive modality-free fragment of valid problems is intuitionistic logic, while the full modality-free fragment lies strictly above it (Rose's formula is valid, Scott's principle is not). We compare the calculi with HC, which turns out to be incompatible with fixed points, prove independence results and list open questions.

[209] arXiv:2611.18302 [pdf, html, other]
Title: Integrated Topology and Redispatch Optimization of Real-World Power Transmission Systems using Branch-and-Benders-Cut
Tim Donkiewicz, Oliver Gaul, Marco Lübbecke
Subjects: Optimization and Control (math.OC)

Transmission system operators can reduce congestion management costs by jointly optimizing network topology, generator redispatch, and transformer settings. The large number of switching decisions, detailed operational constraints, and security requirements under outages make this problem computationally demanding. We present a full mixed-integer linear programming formulation that combines line switching, substation reconfiguration, generator commitment and redispatch, and transformer settings with operational requirements. We solve the problem using an exact branch-and-Benders-cut algorithm. We integrate specialized subproblem solution methods, subproblem selection, cut filtering, partial decomposition, and techniques for enforcing network connectivity. A sequential switching heuristic provides initial solutions for the exact solve. An extensive computational study on 130 synthetic instances demonstrates substantial reductions in solution time compared with standard Benders decomposition and shows how heuristic warmstarting improves solution quality, especially when more switching actions are allowed. Results on real transmission networks illustrate how joint topology and redispatch decisions identify effective switching actions that sequential approaches can miss. Selected solutions generated by our approach were presented to system operators and subsequently checked using alternating current power flow calculations. All seven discussed solutions passed a first operator assessment, indicating the practical potential of the integrated approach.

[210] arXiv:2611.18304 [pdf, html, other]
Title: Composition of Near-Planar Infrastructure Network Instances with Certified Skewness Bounds
Tim Donkiewicz
Subjects: Optimization and Control (math.OC)

Computational studies of optimization problems on infrastructure networks may require more suitable instances than are available. We propose a method to obtain additional instances by extracting and joining connected parts of existing networks, reusing their topology and parameters. Many infrastructure networks are near-planar, so added connections should preserve this property. We measure near-planarity by skewness, the minimum number of edges whose removal makes a graph planar. We derive bounds on the additional skewness caused by joining and give sufficient conditions under which none is added, and propose the corresponding strategy. We evaluate our approach on 100 sets of network parts extracted from each of PGLib-OPF and SNDlib. Within time limits, we show that no skewness is added for about half of the resulting power transmission networks and all considered telecommunication networks. Our method gives smaller mean upper bounds on added skewness than baselines that select vertices randomly, in order of decreasing degree, or using a Kamada--Kawai layout. Extraction and composition may also make the resulting optimization instances infeasible. To reduce this risk, we solve a simpler, tractable variant of the intended optimization problem during generation and restart if it is infeasible. On the generated instances, we solve security-constrained optimal transmission switching and survivable network design problems in full, demonstrating that the instances vary in computational difficulty with runtimes ranging from seconds to hours. The method thus extends the available benchmark sets with instances that inherit source data, have known skewness bounds, and cover a range of computational difficulty.

[211] arXiv:2611.18308 [pdf, html, other]
Title: Syzygy matrices and higher extensions over string algebras
Martin Irungu
Comments: 16 pages, 5 figures
Subjects: Representation Theory (math.RT)

Over a finite-dimensional string algebra, higher extension dimensions may eventually vanish, become periodic, or grow without bound. We show how their behaviour can be read from a finite directed graph. Second syzygies split into uniserial modules from a finite family; their syzygies define a nonnegative integer matrix, so higher extension dimensions become weighted counts of walks. Only the part of the graph relevant to the chosen pair of modules contributes. This gives four growth regimes: eventual vanishing, periodicity, quasi-polynomial growth, and exponential growth. We derive the construction from projective covers, give explicit extension formulas over truncated cycles, and illustrate the growth regimes with examples.

[212] arXiv:2611.18309 [pdf, other]
Title: Kronecker Approximations of Covariance Matrices for Solving Inverse Problems
Srijon Sarkar, Julianne Chung
Subjects: Numerical Analysis (math.NA)

Inverse problems arise in many applications where the task is to recover unknown parameters from indirect or noisy observations. In contrast to forward problems, where outputs are directly computed from known inputs, inverse problems are designed to infer the underlying variables from the observed effect. Inverse problems are often ill-posed, so regularization is needed to compute reasonable solutions. One form of regularization incorporates prior knowledge about the unknown parameters in the form of prior distributions. However, in many settings, large prior covariance matrices pose computational bottlenecks for solving inverse problems. To address this, we study approximations of large covariance matrices via structured Kronecker-Toeplitz products and demonstrate how these approximations can be used to solve inverse problems. We exploit the Block-Toeplitz-Toeplitz-Block structure induced by the covariance kernel to construct compact approximations that are orders of magnitude cheaper to store and invert. These approximations are deployed as prior covariance surrogates in Bayesian inverse problems solved via generalized hybrid iterative methods. We demonstrate that the Kronecker-Toeplitz approximation attains lower relative approximation error than existing matrix approximations, exhibits rapid error decay with rank, and enables efficient matrix-vector products. Applications to 2D seismic tomography reconstruction problems illustrate the practical utility of these methods.

[213] arXiv:2611.18311 [pdf, html, other]
Title: Nuclear dimension of uniform Roe algebras
Liang Guo, Kang Li, Jiawen Zhang, Jingming Zhu
Comments: 20 pages
Subjects: Operator Algebras (math.OA); Functional Analysis (math.FA)

We prove that for every discrete metric space $X$ of bounded geometry with Yu's Property A, the uniform Roe algebra $C^*_u(X)$ has nuclear dimension at most one. This answers in the negative a long-standing question of Winter and Zacharias on whether the nuclear dimension of $C^*_u(X)$ always equals the asymptotic dimension of $X$. Consequently, $dim_{nuc} C^*_u(X)\in\{0,1,\infty\}$ for every discrete metric space $X$, with or without bounded geometry.

[214] arXiv:2611.18316 [pdf, html, other]
Title: Correlation functions of the Lieb--Liniger Bose gas in equilibrium states: a microscopic approach to space-time asymptotics
Frank Göhmann, Karol K. Kozlowski, Mikhail D. Minin
Comments: 53 pp
Subjects: Mathematical Physics (math-ph); Statistical Mechanics (cond-mat.stat-mech); Exactly Solvable and Integrable Systems (nlin.SI)

We develop an approximation-free approach to the analysis of form-factor series for the correlation functions of quantum integrable models in the thermodynamic limit and in equilibrium states described by a class of stationary density matrices. This allows us to obtain the long-time, large-distance asymptotics of the correlation functions in thermal equilibrium and in stationary states after a quench, including such states that can be described by generalized Gibbs ensembles. Our approach will be exemplified with the Lieb--Liniger Bose gas or non-linear Schrödinger model. It applies to the correlation functions of all local operators. For the two-point functions of particle-density or particle-current density operators our findings confirm the phenomenological predictions based on generalised hydrodynamics. We extract as well the long-time, large-distance asymptotics of a field- conjugated field correlation function. At present its behaviour is outside the reach of any heuristic method. It is governed by a novel non-linear integral equation that depends on space and time.

[215] arXiv:2611.18317 [pdf, html, other]
Title: Non-abelian Hodge correspondence for semistable parabolic connections on curves in positive characteristic
Shiyu Shen
Comments: 29 pages, comments welcome
Subjects: Algebraic Geometry (math.AG)

Let $C$ be a smooth projective curve over an algebraically closed field $k$ of characteristic $p>0$. We establish a non-abelian Hodge correspondence between semistable parabolic connections on $C$ and semistable parabolic Higgs bundles on its Frobenius twist $C'$, allowing arbitrary prescribed residue eigenvalues, parabolic weights and filtration types. The relationship between the parabolic weights and residue eigenvalues on the two sides is encoded in a table analogous to Simpson's table. We obtain this result by extending the notion of "very good regular connections" to incorporate a residue-dependent degree condition, and by developing a Cartier descent formalism for parabolic connections. Working with filtered sheaves, we obtain a particularly clean description of this Cartier descent formalism that potentially extends to higher dimensional varieties.

[216] arXiv:2611.18320 [pdf, html, other]
Title: All coupling Anderson localization in the quantum kicked rotor model
Yunfeng Shi, Li Wen
Comments: Comments welcome; 25 pages
Subjects: Mathematical Physics (math-ph); Dynamical Systems (math.DS); Spectral Theory (math.SP)

In this paper, we study $$\mathscr{H}=\lambda \Delta +\tan\pi(\theta+n^2\alpha)\delta_{n,n'},\ n\in\Bbb Z$$ and prove its Anderson localization for all $\lambda >0$ and Lebesgue almost every (a.e.) $(\alpha, \theta)\in\Bbb T^2$. This conforms in the full measure sense the main assumption of Fishman-Grempel-Prange [{\it Phys. Rev. Lett.} 49(8), 509--512 (1982)] in the study of the quantum suppression of chaos: The pseudo-randomness of the sequence $\{\tan\pi(\theta+n^2\alpha)\}_{n\in\Bbb Z}$ (for $\alpha\in\Bbb T\setminus \Bbb Q$) should result in all coupling Anderson localization for $H$ similar to that for the one-dimensional Anderson model. Our proof is based on nonperturbative Green's function estimates approach using Cayley transform, quadratic Weyl sum estimate and Rellich function analysis.

[217] arXiv:2611.18323 [pdf, html, other]
Title: On Borwein polynomials with multiple roots outside the unit disk
Souad El Otmani, Musbahu Idris, Jean-Marc Sac-Epee
Comments: 11 pages
Subjects: Number Theory (math.NT)

A Borwein polynomial has coefficients in ${-1,0,1}$ and nonzero constant and leading coefficients. We seek Borwein polynomials having a multiple root outside the unit disk. To this end, we consider the powers $L^2$ and $L^3$ of Lehmer's polynomial $L$, which has a real root $\tau>1$.
Since $L$ has exceptionally small Mahler measure, the theorem of Bombieri and Vaaler guarantees the existence of Borwein multiples of these powers. Such multiples have $\tau$ as a root of multiplicity at least 2 and 3, respectively. Mossinghoff (2003, Algorithm 3, p. 323) constructed examples that, under the substitution $x\mapsto -x$, yield such multiples.
The main contribution of this paper is to determine the least possible degrees of Borwein multiples of $L^2$ and $L^3$, with and without symmetry restrictions on their coefficients, and to describe their degree spectra. For $L^2$, the minimum degree is 34 without symmetry restrictions, 38 among self-reciprocal multiples, and 41 among antireciprocal multiples. For $L^3$, the corresponding minimum degrees are 115, 115, and 117.
We determine the complete degree spectra for $L^2$ and, for $L^3$, classify the degrees from 115 to 150 for which self-reciprocal or antireciprocal Borwein multiples exist, giving an explicit example for each admissible degree in each symmetry class. Further constructions yield Borwein multiples of $L^3$ in every degree $D\geq 215$, with both symmetry types for every $D\geq 231$.

[218] arXiv:2611.18328 [pdf, html, other]
Title: Matrix ultraproducts have trivial fundamental group
Hiroshi Ando, Isaac Goldbring
Comments: 43 pages; first draft; comments welcome!
Subjects: Operator Algebras (math.OA); Logic (math.LO); Representation Theory (math.RT)

We prove that every tracial ultraproduct $\prod_{\mathcal{U}} M_n(\mathbb{C})$ of matrix algebras has trivial fundamental group. In particular, this establishes that there are uncountably many nonisomorphic matrix ultraproducts, answering a question of Sorin Popa. We actually prove the stronger result that every matrix ultraproduct has trivial first-order fundamental group and thus our techniques are model-theoretic in nature.

[219] arXiv:2611.18344 [pdf, html, other]
Title: Enumeration of Cospectral Graphs with Respect to the Average Flow Matrix
Usama Waheed, Naveed Ahmed Azam
Subjects: Combinatorics (math.CO); Spectral Theory (math.SP)

A graph is said to be determined by the spectrum of a graph-associated matrix if no nonisomorphic graph shares the same spectrum with it. In this paper, we introduce the average flow matrix of a connected graph and study its spectral properties. We investigate its effectiveness in distinguishing graphs by carrying out a computational enumeration of connected graphs having a cospectral mate with respect to this matrix up to order 10. Our computations show that every connected graph on at most 10 vertices is determined by the spectrum of the average flow matrix. To the best of our knowledge, this is the first graph-associated matrix for which the spectrum distinguishes all connected graphs of order at most 10.

[220] arXiv:2611.18348 [pdf, html, other]
Title: Quantifying Dependence Effects on $k$-out-of-$n$ Reliability Relative to the Independent Benchmark
Nuria Torrado
Subjects: Statistics Theory (math.ST); Probability (math.PR); Methodology (stat.ME)

Understanding how dependence among component lifetimes affects the reliability of redundant systems is a central problem in reliability engineering. In this paper, we develop a framework for quantifying the impact of multivariate dependence on $k$-out-of-$n$ system reliability relative to the independent benchmark. Using an orthogonal Legendre expansion of the copula density, we derive an exact decomposition that separates the dependence structure from the system architecture. This representation identifies how individual dependence contributions are transmitted to system reliability through explicit structural weights. An application to multivariate Farlie-Gumbel-Morgenstern copulas demonstrates that higher-order dependence can produce distinct reliability effects even when all bivariate copulas remain unchanged. Our findings provide a systematic approach to quantifying and interpreting the effects of multivariate dependence on the reliability of redundant systems.

[221] arXiv:2611.18351 [pdf, other]
Title: A Parametric Active-Set Algorithm for Solving Monotone Generalized Nash Equilibrium Problems
A. Bemporad, T. Tatarenko
Comments: 29 pages, 1 figure
Subjects: Optimization and Control (math.OC)

We present a fast active-set algorithm for the solution of monotone linear-quadratic generalized Nash equilibrium problems (GNEPs) with shared affine inequality and equality constraints. The algorithm, which we call gPAQ, is an adaptation of the parametric active-set method proposed by Best (1996) and extended in qpOASES by Ferreau et al. (2014) to solve convex quadratic programs. Under strong monotonicity, we show that the same active-set strategy applies. We handle the case of merely monotone problems by using gPAQ as the inner solver within proximal-point iterations. To solve strongly monotone convex nonlinear GNEPs, we propose a Newton-type iterative scheme, which we call gPAN, which iteratively linearizes the nonlinear problem and solves the resulting LQ-GNEP subproblems using gPAQ. We show in numerical examples that the proposed algorithms are significantly faster than existing methods.

[222] arXiv:2611.18352 [pdf, html, other]
Title: Online Switching Control as Learning with Experts
Masataka Nakamura, Kaito Ito, Hideaki Ishii
Subjects: Optimization and Control (math.OC); Machine Learning (cs.LG); Systems and Control (eess.SY)

This paper addresses the problem of online switching control for discrete-time nonlinear systems where a controller is sequentially selected from a finite set of candidates. The goal is to generate an adaptive sequence of controllers to minimize the cumulative cost under unknown disturbances and cost functions. Specifically, we consider a full-information feedback setting where realized disturbance effects and cost functions are available after each selection. Using counterfactual costs computed from historical data, we reduce the online switching control problem to the experts problem with switching costs. Then, we propose an adaptive switching algorithm based on the Hedge algorithm with a switching suppression mechanism. Notably, the proposed algorithm achieves an expected regret of $O(\sqrt{T\log N})$, where $T$ is the time horizon and $N$ is the number of candidate controllers, while ensuring uniform boundedness of the state. This matches the optimal regret order for the standard experts problem.

[223] arXiv:2611.18353 [pdf, html, other]
Title: Cover times of random recursive trees and linear preferential attachment trees
Omer Angel, Christina Goldschmidt, Peleg Michaeli
Comments: 15 pages, 1 figure
Subjects: Probability (math.PR); Combinatorics (math.CO)

We study the cover times of uniform random recursive trees and linear preferential attachment trees, including the negative-parameter models corresponding to random $d$-ary increasing trees. We prove explicit limits in probability and expectation when the cover times are rescaled by $n (\log n)^2$. In particular, for the uniform random recursive tree the cover time is close to $e n (\log n)^2$ with high probability.

[224] arXiv:2611.18354 [pdf, html, other]
Title: Quantitative high-contrast homogenisation of composite media with highly anisotropic fibres
Shane Cooper, Ilia Kamotski
Subjects: Analysis of PDEs (math.AP); Spectral Theory (math.SP)

This work concerns a non-uniformly elliptic second-order differential operator with periodic coefficients that describes a composite medium formed by a periodic array of highly anisotropic cylindrical fibres set in an isotropic matrix. The ratio of transverse to axial conductivity in the fibres is linked to the period of the coefficients through a `critical' high-contrast scaling, and the axial conductivity is allowed to vary along the fibres. As the period $\varepsilon$ tends to zero, ellipticity degenerates in the directions transverse to the fibres. We are concerned with the resolvent of this operator in the small-$\varepsilon$ limit. For fibres with constant axial conductivity, the two-scale limit of such problems was identified by Cherednichenko, Smyshlyaev and Zhikov (Proceedings of the Royal Society of Edinburgh: Section A Mathematics 136(1), 87--114 (2006)), and a full two-scale asymptotic expansion, with remainder estimates for smooth right-hand sides, was constructed by Cherednichenko (Asymptotic Analysis 49(1--2), 39--59 (2006)). In the non-constant axial conductivity setting, considered here, we approximate the resolvent in terms of the two-scale limit operator and prove that the error is order $\varepsilon$ in the operator norm, uniformly over right-hand sides in the unit ball of $L^2(\mathbb{R}^3)$; we also obtain order-$\varepsilon$ estimates for the reciprocals of the spectral band functions. This work builds on results announced, without proof, for fibres with circular cross-section in Cooper and Kamotski (Direct and Inverse Problems with Applications: Extended Abstracts of the 2024 GAP Center Summer School, pp.~69--75, Birkhäuser (2026)).

[225] arXiv:2611.18356 [pdf, html, other]
Title: Squared Bessel particle systems with weak repulsion
Julia Lenczewska, Jacek Małecki, Szymon Sołtysiak
Comments: 27 pages
Subjects: Probability (math.PR)

We study squared Bessel particle systems with repulsion parameter $\kappa>0$ and dimension parameter $\delta\in\mathbb R$. We prove that the singular equation has a unique global strong solution for every initial state in the closed Weyl chamber, including states with coinciding particles. The solutions have locally integrable interaction terms and spend zero Lebesgue time at pairwise collisions. We also consider the equation in which the interaction terms are set to zero at collisions. At certain integer values of $\delta$, this equation admits infinitely many solution laws from suitable initial configurations. In these solutions, a block of particles can remain at zero for any prescribed time before being released. For positive initial states, we determine when zero is reached and when particles enter the negative half-line. From distinct initial positions, collisions occur almost surely for $0<\kappa<1$ and do not occur for $\kappa\ge1$. Collisions of three or more particles are excluded away from zero. We give an example of a triple collision at zero. We obtain two-sided bounds for the tails of the first-zero and first-collision times. The bounds give matching powers for the first-zero time when it is finite, and for the first-collision time in nonnegative systems when $0<\kappa<1$.

[226] arXiv:2611.18357 [pdf, html, other]
Title: The Moduli of Canonical Threefolds of Minimum Volume
Pinxian Bie, Peien Du, Zhengjie Yu
Comments: 322 pages. Computational code and data included as ancillary files. Comments are welcome
Subjects: Algebraic Geometry (math.AG)

We determine the moduli space of complex projective canonical threefolds of volume $1/420$. It consists of an irreducible rational component of dimension $33$ and two isolated points, represented by the explicitly constructed rigid threefolds Vega and Altair.

[227] arXiv:2611.18358 [pdf, html, other]
Title: Quadratic APN Functions of $\mathbb{F}_2^{10}$ with a Self-Equivalence of Prime Order
Emanuele Bellini
Subjects: Information Theory (cs.IT); Cryptography and Security (cs.CR); Combinatorics (math.CO)

Almost perfect nonlinear (APN) functions of $\mathbb{F}_2^n$ have the lowest possible differential uniformity. The only known APN permutation in even dimension, in dimension six, is equivalent to a quadratic APN function with a nontrivial linear self-equivalence; no APN permutation is known for even $n \geq 8$. In a published collection of about 3.8 million quadratic APN classes of dimension eight, at most 0.34% have a nontrivial linear self-equivalence. In dimension ten, the 25 literature classes considered here all have one. We study all quadratic APN functions of $\mathbb{F}_2^{10}$ with such a self-equivalence, which usually confines them to a much smaller linear space. Up to conjugacy and power similarity, self-equivalences of prime order have 299 types. We settle 298 of them. Elementary lemmas exclude 280 types, and exhaustive searches confirm this for 242 of them. The other 18 types are settled by exhaustive searches with exact equivalence certificates. Up to extended affine equivalence, the 298 types contain 29 classes of quadratic APN functions, four of them new. This also classifies the quadratic APN functions with coefficients in a subfield. Exactly 24 classes contain one with coefficients in $\mathbb{F}_4$, and all 3 that contain one with coefficients in $\mathbb{F}_{32}$ are among them. The open type consists of the quadratic canonical triplicate functions. They correspond to maximum additive Hermitian rank-distance codes. Three different searches find only the invariants of 16 classes, all among the 29. We conjecture there are no others. No quadratic APN function in the 298 settled types is Carlet-Charpin-Zinoviev equivalent to a permutation.

[228] arXiv:2611.18360 [pdf, html, other]
Title: The roads taken in the directed landscape
Pranay Agarwal, Sourav Sarkar, Bálint Virág
Comments: 57 pages, 2 figures
Subjects: Probability (math.PR)

Every finite-length path in the directed landscape spends almost all of its time on geodesics. More precisely, let G be the union of the interiors of all geodesics. We prove that, almost surely, every path of finite landscape length lies in G outside a set of times of Hausdorff dimension at most 57/61. We also construct finite-length paths whose exceptional set has dimension at least 1/3. The proof combines quantitative bounds on nearly optimal detours, stochastic domination of the environment outside a geodesic, and a three-geodesic disjointness estimate.

[229] arXiv:2611.18361 [pdf, html, other]
Title: Normalized ground state solutions to the nonlinear Born--Infeld problem
Jaros\law Mederski, Xiangjian Zeng
Comments: 27 pages
Subjects: Analysis of PDEs (math.AP)

We study normalized solutions to the Born--Infeld problem
\begin{equation*}
-{\rm div}\left(\frac{\nabla u}{\sqrt{1-|\nabla u|^2}}\right)+\mu u=f(u)\ \hbox{ in }\mathbb{R}^N,\qquad \int_{\mathbb{R}^N}|u|^2\,dx=2m^2,
\end{equation*}
$N\ge3$, where $m>0$ is prescribed and $\mu>0$ is an unknown Lagrange multiplier. The nonlinearity $f$ is assumed to be superlinear at infinity, with no upper restriction on its growth, and to behave like $|s|^{p-2}s$ near zero, with $2<p<2^*$. Following a Lagrangian approach, we relate the action ground state level $a(\mu)$ of the prescribed frequency problem to the masses of its ground states by means of one-sided derivative formulas, which lead to the existence of normalized solutions. A distinctive feature of the Born--Infeld operator is that the gradient constraint makes the energy bounded from below on every mass sphere, even in the $L^2$-supercritical case. For $2+4/N\le p<2^*$ we obtain a threshold $c_*>0$ such that normalized action ground states exist for $m^2>c_*$, and none exist for $m^2<c_*$. In the $L^2$-subcritical case they exist for every $m^2>0$. We prove that every action ground state has constant sign and is radial up to a translation.

[230] arXiv:2611.18368 [pdf, html, other]
Title: The BCC Lattice Maximizes the First Positive Neumann Eigenvalue among 3D Lattice Voronoi Cells
Kaixin Deng, Senping Luo
Subjects: Analysis of PDEs (math.AP); Mathematical Physics (math-ph); Optimization and Control (math.OC); Spectral Theory (math.SP)

It is shown that, among three-dimensional lattices of fixed covolume, the body-centered cubic lattice maximizes the first positive Neumann eigenvalue of its Voronoi cell uniquely, up to orthogonal transformations.

[231] arXiv:2611.18374 [pdf, html, other]
Title: The $\operatorname{Proj}$ construction for pro-graded Huber pairs
Dimitri Dine
Comments: 58 pages, comments welcome!
Subjects: Algebraic Geometry (math.AG); Commutative Algebra (math.AC); Number Theory (math.NT)

Inspired by the theory of pro-graded adic rings developed recently by Ishizuka and Yoshikawa, we introduce and study the notions of a pro-graded Huber ring and a pro-graded Huber pair \begin{equation*}((\mathcal{A}, \mathcal{A}_{\textrm{gr}}), \mathcal{A}^{+}),\end{equation*}which capture the intuition of a complete Huber ring (or Huber pair) equipped with a dense graded subring. Using these notions, we define and study an analog \begin{equation*}\operatorname{Proj}(\mathcal{A}, \mathcal{A}_{\textrm{gr}}, \mathcal{A}^{+})\end{equation*}of the $\operatorname{Proj}$ construction from algebraic geometry in the realm of adic spaces, without restricting our attention to adic spaces satisfying any Noetherian or finite-type assumptions. We consider gradings both by $\mathbb{Z}$ and by $\mathbb{Z}[1/p]$ for a fixed prime number $p$, so our $\operatorname{Proj}$ construction recovers both classical examples such as usual adic projective space $\mathbb{P}_{K}^{n,\textrm{ad}}$ and infinite-type, perfectoid examples such as perfectoid projective space $\mathbb{P}_{K}^{n,\textrm{perfd}}$. Using GAGA, we prove that the adic analytification of any projective variety $X$ over a nonarchimedean field $K$ can be described as the adic $\operatorname{Proj}$ of a suitable pro-graded affinoid algebra $\mathcal{A}$. Moreover, we prove that in this case $\dim X=\dim \mathcal{A}-1$. We also relate our adic $\operatorname{Proj}$ construction to formal models.

[232] arXiv:2611.18380 [pdf, other]
Title: Convergence rate of observables in the Marcus-Lushnikov process toward Smoluchowski with singular homogeneous kernels
R{é}mi Catellier (UniCA, LJAD), Sebastian Baudelet-Aponte Garcia
Subjects: Probability (math.PR)

We study the approximation of the Smoluchowski coagulation equation by the Marcus--Lushnikov process with $N$ initial particles for the singular family of kernels $K\_\alpha(x,y)=x^{-\alpha}+y^{-\alpha}, \alpha > 0$. For regular mean-field particle systems, pathwise fluctuations are naturally expected on the scale $N^{-1/2}$, whereas sufficiently smooth observables may exhibit a weak error of order $N^{-1}$ after averaging. The singularity of $K\_\alpha$ at the origin makes it unclear whether this second-order mechanism survives. We prove that it does: for a class of sufficiently regular nonlinear functionals of the empirical measure, we establish a weak error of order $N^{-1}$ on finite time intervals. The main mechanism is a regularization produced by the singular dynamics itself. Small clusters coagulate at increasingly large rates, which generates exponential moments in the singular variable $x^{-\alpha}$ and yields a rapid escape from the singularity at zero. We exploit this phenomenon through a Wasserstein-type distance adapted to $x^{-\alpha}$, together with weighted total variation estimates used to construct and control the derivative of the Smoluchowski flow.

[233] arXiv:2611.18381 [pdf, html, other]
Title: Fourier Harmonics and Pentagonal Rigidity in the Planar Ulam Floating Body Problem
Oleg Asipchuk, Maksim Kosmakov
Subjects: Metric Geometry (math.MG)

We give a new proof that the disk is the only strictly convex planar body floating in equilibrium in every orientation at perimetral densities $\sigma=1/5$ and $\sigma=2/5$. The proof uses the Fourier harmonics of the chord-angle function and the closure relations of the associated pentagonal carousel. Their combination gives inequalities that force the body to be a disk.

[234] arXiv:2611.18383 [pdf, html, other]
Title: Self-Interpretations and Kraj\'ı{č}ek-Theories
Albert Visser
Subjects: Logic (math.LO)

We study self-interpretations of theories and their connection to Kraj\'ıček-theories. Our two main results are the following. Firstly, if the self-interpretations of a theory form a group in the category ${\sf INT}_3$ of theories and interpretations, then the theory is a Kraj\'ıček-theory. Secondly, a sequential theory is a Kraj\'ıček-theory iff all its self-interpretations are initial. Here initiality of the interpretation $K$ means roughly that its internal interpretations of the weak theory ${\sf S}^1_2$ are initial in all interpretations of ${\sf S}^1_2$.

[235] arXiv:2611.18384 [pdf, html, other]
Title: From Diagonal Coloring to Proper Vertex Labelings Distinguishing Adjacent Facial Sums
Zhou Guofei
Subjects: Combinatorics (math.CO)

In this paper we study proper vertex labelings of 3-connected plane graphs that give distinct boundary-vertex sums to faces sharing an edge. Let $\lambda(G)$ be the least $k$ for which labels from $\{0,\ldots,k\}$ suffice, and let $\laml(G)$ be its arbitrary-real-list counterpart. Our two main results are an eight-element list theorem for fullerenes and the universal bound $\lambda(G)\le708587$ for all 3-connected plane graphs. We establish structural nine- and eight-color bounds, classify triangulations whose vertices of degree at least five form an independent set, and determine their exact diagonal chromatic numbers. We also prove closure under triangular sums for $q\ge7$ diagonal colors, with an optimal uniform threshold. For cubic 3-connected plane graphs we obtain $\lambda\le14$, improving to $\lambda\le9$ in the bipartite case.

[236] arXiv:2611.18401 [pdf, html, other]
Title: Stability Certification for Approximate Nonlinear Model Predictive Control
An Aloysius Wang, Kostas Margellos, Mark Cannon
Subjects: Optimization and Control (math.OC)

Neural-network approximations of nonlinear model predictive control can reduce online computational costs, but ensuring constraint satisfaction and closed-loop stability remains challenging. We propose a framework in which convex optimisation is used to restore feasibility under suitable local assumptions, while bounds on the corrected controller's cost suboptimality provide sufficient conditions for practical closed-loop stability. To assess these conditions over a compact set of initial states, we investigate a branch-and-bound approach based on convex relaxations of the nonlinear dynamics, with probabilistic guarantees established through scenario optimisation. The proposed approach represents a step towards combining the computational efficiency of approximate nonlinear model predictive control with systematic methods for restoring feasibility and assessing stability.

[237] arXiv:2611.18403 [pdf, html, other]
Title: Strongly Monotone Central Path Equations for Quadratic Cone Programs
Michael Cummins, Matteo Santamaria, Brendan O'Donoghue
Subjects: Optimization and Control (math.OC)

We introduce a canonical central path for the homogeneous embedding of quadratic cone programs, defined by strongly monotone equations whose modulus is the barrier parameter. We prove that the path exists uniquely, is smooth, and lies on a sphere of fixed radius. Under mild regularity assumptions, its limit points recover optimal solutions or certificates of infeasibility. Exploiting the fact that the embedding operator has a closed-form resolvent, we derive Josephy-Newton steps that retain the nonlinear embedding equations and linearize only the complementarity conditions. Each step reduces to quasi-definite linear system solves and a scalar quadratic. Using this, we derive a new predictor-corrector interior-point method with a surrogate formulation that allows the predictor and corrector to share a single sparse factorization. We provide an open-source implementation, cpo3, for linear and quadratic programs. On 675 instances from eight benchmark collections, with presolve and crossover disabled, cpo3 achieves the highest verified solve count (631) and the lowest penalized shifted geometric mean runtime among the tested open-source and commercial solvers. It is the only tested solver to solve all 138 Maros-Meszaros instances to high accuracy. Moreover, we establish Euclidean and local-norm error bounds that motivate a warm-start heuristic for the proposed algorithm, yielding up to 2.3x median runtime speedup over cold starts on perturbed Netlib and Maros-Meszaros problems.

[238] arXiv:2611.18408 [pdf, html, other]
Title: The random KKM mapping principle and its applications
Tiexin Guo, Xiaohuan Mu, Qiang Tu
Subjects: Functional Analysis (math.FA)

Based on the recently developed random Brouwer fixed point theorem and the theory of stable compactness, we establish a random Knaster--Kuratowski--Mazurkiewicz (KKM) mapping principle in Hausdorff topological $L^0$-modules. As consequences of this principle, we obtain several results on fixed points, minimax problems, variational inequalities, and conditional games. These results solve a large class of noncompact problems in random functional analysis and its applications.

[239] arXiv:2611.18418 [pdf, html, other]
Title: Stability of crystalline measures under random perturbations
Jorge Antezana, Luciano Scazzola
Comments: 39 pages; accepted for publication in Transactions of the American Mathematical Society
Subjects: Classical Analysis and ODEs (math.CA); Mathematical Physics (math-ph); Probability (math.PR)

In this paper, we study random perturbations and the diffraction properties of translation-bounded crystalline measures. Under a non-vanishing assumption on the known perturbation factor, we prove that, almost surely, any realization of the perturbed measure preserves sufficient structural information to allow the full recovery of the original measure. Previous works have only considered crystalline measures with uniformly discrete supports and equal-mass atoms. Our general setting includes many important crystalline measures that were excluded until now. To treat this broader setting, we adopt a different framework. In this work, we model the perturbation as a random measure rather than as a random set. In particular, this leads us to consider not only perturbations of the support, but also perturbations of the atoms' masses. On the other hand, using elementary techniques of Fourier analysis, we prove that any translation-bounded crystalline measure has a diffraction measure, and we explicitly compute its diffraction.

[240] arXiv:2611.18421 [pdf, html, other]
Title: Dynamic Assortment Optimization Under Arbitrary Demand Distributions: The Uniform Price Setting
Shuo Sun, Rajan Udwani
Subjects: Optimization and Control (math.OC)

We study the joint optimization of assortment and inventory when products are identically priced and the total demand (number of customers) is uncertain. A seller chooses initial inventories before customers arrive and every customer buys her preferred product among those still in stock according to a choice model known to the seller. The objective is to maximize the (expected) total sales, subject to a capacity constraint. We give a $(1-1/e)^2$-approximation under any ranking-based choice model and a $(1-1/e-\varepsilon)$-approximation under the Markov chain choice model, where $\varepsilon$ is a tunable parameter that trades off runtime with approximation guarantee. Our guarantees hold for arbitrary demand distributions and do not require the ubiquitous Increasing Failure Rate (IFR) assumption. In fact, our results also improve on the state-of-the-art approximations for IFR demand distributions. Key to our results is the discovery of hidden submodularity in these problems and the development of efficient procedures to evaluate (or approximate) the objective values. Specifically, we uncover a novel connection to online bipartite matching (for ranking-based models) and use stochastic coupling arguments (for the Markov chain choice model) to reduce the problems to instances of constrained submodular maximization. This opens the door to applying the vast algorithmic machinery for submodular maximization to our problem setting, leading, for example, to natural generalizations beyond cardinality constraint where no approximation results were previously known.

[241] arXiv:2611.18424 [pdf, html, other]
Title: Balancing-based model reduction for output-constrained optimal control of switched linear systems
Michael Kartmann, Mattia Manucci, Benjamin Unger, Stefan Volkwein
Comments: 24 pages
Subjects: Optimization and Control (math.OC); Numerical Analysis (math.NA)

We develop a balanced-truncation (BT) framework for model-order reduction of optimal control problems governed by switched linear systems, with quadratic tracking costs, convex input constraints, and Moreau--Yosida-regularized output constraints. For general Petrov--Galerkin reduced models, we derive an a posteriori bound for the error in the optimal value function, and combine it with BT-based estimates of the dynamical-system reduction error. We show that BT preserves the duality structure underlying the first-order optimality conditions, making first-reduce-then-optimize and first-optimize-then-reduce equivalent. Consequently, reducing the forward system also reduces the associated optimality system, leading to a certified, online-efficient, and online-adaptive approximation of the parameterized solution operator. The reduced model can therefore be reused across different regularization parameters, constraint sets, switching signals, and reference trajectories.

[242] arXiv:2611.18425 [pdf, html, other]
Title: Thresholds of the Polya Szego inequality for the fractional logarithmic p-Laplacian
Hichem Hajaiej
Comments: All comments are welcome
Subjects: Analysis of PDEs (math.AP)

We establish three surprising features of the Polya Szego principle for the full signed energy of the fractional logarithmic p-Laplacian. First, the energy doesn't not decrease under rearrangement for all admissible functions. Second, the sharp threshold for Polarization and Schwarz rearrangements are different. Third, for Steiner rearrangement, the threshold in 1 dimension and N dimensions is not the same. Additionally the dimension doesn't appear in the formula.

[243] arXiv:2611.18432 [pdf, html, other]
Title: A quotient formula for the Behrend function
Fatemeh Rezaee
Comments: 29 pages, 15 figures, comments welcome
Subjects: Algebraic Geometry (math.AG); Commutative Algebra (math.AC); Combinatorics (math.CO)

The Behrend function is essential in enumerative geometry. However, computing it, even in zero dimension, has been a highly subtle and mysterious matter since its introduction in the 2000s. We present a quotient formula for the Behrend function of any closed $r$-dimensional affine scheme $X^r \subset \mathbb{A}^N$, evaluated at a singular point, where $0\leq r \leq N-1$. In particular, if the scheme is monomial, we associate parallelepipeds to it and interpret the Behrend function as simple volume information about them. The results here, in particular, recover the recent results of Graffeo-Ricolfi for the zero-dimensional case in 2D in \cite{Graffeo-Ricolfi}, and also the more recent result of Polini-Sammartan-Ulrich on the zero-dimensional case in \cite{PSU26}.

[244] arXiv:2611.18446 [pdf, html, other]
Title: Maxwell's equations with thin wires in critical scaling
Ben Schweizer, David Wiedemann
Subjects: Analysis of PDEs (math.AP); Mathematical Physics (math-ph)

We derive effective equations for a situation in which electromagnetic waves hit an array of very thin wires. We study two cases, perfectly conducting wires and highly conducting wires, and investigate in both the critical scaling of the parameters. The electric field $E^\eta$ and the magnetic field $H^\eta$ satisfy the time-harmonic Maxwell equations, and the small parameter $\eta>0$ is the spacing of the wires. A non-critical scaling of the wires implies either that the wires have no effect or that the tangential component of the limiting electric field in the direction of the wires vanishes along the effective interface. In the critical scaling, we observe an interesting effect: The wires act as oscillators and there is a relation between the electric field in longitudinal direction and the jump of the magnetic field in transversal direction involving second derivatives of a flux quantity.

[245] arXiv:2611.18461 [pdf, other]
Title: An Obstruction to Realizing Aspherical $3$-Manifold Groups via Torus Surgery
Nicholas Meyer
Comments: 8 pages, 2 figures. Comments welcome!
Subjects: Geometric Topology (math.GT)

Let $Y$ be a closed, connected, oriented, aspherical $3$-manifold with fundamental group $\pi = \pi_1(Y)$ and positive first Betti number $\beta_1(Y) > 0$, and let $X_0 = Y \times S^1$. We prove that no torus surgery on $X_0$ along a torus-fibered $T^2$-knot $T \subseteq X_0$ can yield a $4$-manifold $X = X_{0; T, f}$ with fundamental group $\pi$. The obstruction combines the vanishing of the Euler characteristic of $X$ with a classifying-map argument showing that the unimodular intersection form on $H^2(X; \mathbb{Z})$ must admit an isotropic subgroup of rank $\beta_1(\pi)$, forcing $\chi(X) \geq 2$. Along the way, we also present an independent geometric proof via covering space theory, the Sphere Theorem, and Scott's Core Theorem that the fundamental group of a closed aspherical $3$-manifold is torsion-free.

[246] arXiv:2611.18465 [pdf, html, other]
Title: On four problems from the Kourovka Notebook: spectra, periodic automorphism groups, commutators, and operator simplicity
Ivan Samuil Nnuga Mongo
Subjects: Group Theory (math.GR)

We examine Problems 18.62(a), 18.63, 18.65, and 20.120 of the Kourovka Notebook. First, a family of semidirect products involving $\operatorname{PSL}_2(p^2)$ gives arbitrarily many pairwise nonisomorphic groups critical with respect to one simple-group spectrum, subject to explicit arithmetic congruences. Second, a completed-algebra construction using sparse torsion identities and a matrix Golod-Shafarevich-Vinberg inequality produces an infinite periodic group generated by two fixed-point-free automorphisms of order five of an abelian group. Third, we give a short matrix proof that the class of elements of order three in $\operatorname{PSL}_2(8)$ contradicts the assertion in Problem 18.65 as written. Finally, we spell out how P. Hall's 1962 wreath-power theorems answer Problem 20.120 under the usual normal-subgroup meaning of simplicity for a group with one distinguished automorphism. The four arguments have substantially different provenance. In particular, the last is a consequence of a known construction, not a priority claim. The two longer constructions are recorded in detail for independent mathematical scrutiny.

[247] arXiv:2611.18467 [pdf, html, other]
Title: Score-based neural ordinary differential equations for reaction-diffusions
Jianguo Hou, Wuchen Li
Subjects: Numerical Analysis (math.NA); Machine Learning (cs.LG)

A diffusion equation can be rewritten as a transport equation driven by the score function of the evolving density. Conventional probability-flow formulations, which move particles deterministically with this score-driven velocity, typically conserve total mass. In this work, we develop a Lagrangian method for reaction-diffusion equations in which each particle carries a position and a physical weight. The characteristic ODEs incorporate source terms into the evolution of the log-density and its gradient, while particle weights track changes in mass. We combine this representation with a learned velocity field and weighted particle training to approximate these dynamics. For non-increasing reaction rates, a relative-entropy inequality supports the mass-normalized self-consistency residual as the training objective. This objective can control the error of the induced density when the growth rate is bounded. The algorithm divides the time interval into short windows. In each window, a frozen velocity generates the particle data for a regression of the network velocity. We draw the particles from period-adapted initial sampling distributions and weight them in the loss partly by their predicted future mass, because the reaction can make regions with little initial mass important later. We numerically investigate the method on the Ornstein--Uhlenbeck (OU) equation with a linear source term, Fisher--KPP equations, and Wasserstein--Fisher--Rao gradient flows.

[248] arXiv:2611.18474 [pdf, html, other]
Title: Efficient Reconfiguration of Independent Transversals
Sahab Hajebi, Penny Haxell
Comments: 30 pages, 2 figures
Subjects: Combinatorics (math.CO)

We study the reconfiguration of independent transversals in graphs with a prescribed vertex partition. Given a graph $G$ with a vertex partition $\mathcal{V}=(V_1,\ldots,V_m)$, an independent transversal is an independent set containing exactly one vertex from each part $V_i$ of $\mathcal{V}$. The reconfiguration problem concerns transforming one independent transversal into another through a sequence of local changes, while preserving the independent transversal property at every step. For any fixed $r\in\mathbb{N}$ and $\epsilon>0$, we present a polynomial-time algorithm that, given an $r$-claw-free graph $G$ with a vertex partition $\mathcal{V}=(V_1,\ldots,V_m)$ and two independent transversals $S$ and $R$, either finds a polynomial-length reconfiguration path between $S$ and $R$, or identifies a nonempty set of partition classes $\mathcal{B}\subseteq\mathcal{V}$ such that the subgraph induced by their union admits a strong dominating set of size at most $(2+\epsilon)|\mathcal{B}|$. Our result provides an algorithmic counterpart to recent connectivity results for the reconfiguration graph of all independent transversals, and establishes polynomial bounds on its diameter under suitable conditions. As a specific application, we obtain a polynomial-time algorithm for reconfiguring perfect matchings in $r$-uniform bipartite hypergraphs $H=(A,B,E)$, that either produces a polynomial-length reconfiguration path between two given perfect matchings or identifies a subset $S\subseteq A$ whose link hypergraph $E_S$ in $B$ has a small cover.

[249] arXiv:2611.18476 [pdf, html, other]
Title: Beyond Blossom: Accelerating MWPM Decoding for Surface Codes With Local Predecoding and Architecture-Aware Optimizations
Jiayu Fu, Zirong Shen, Lin Gan, Yiming Zhang, Wenjing Han, Xiaoming Sun, Riling Li, Guangwen Yang
Comments: 11 pages, 8 figures
Subjects: Information Theory (cs.IT); Performance (cs.PF); Quantum Physics (quant-ph)

Minimum-weight perfect matching (MWPM) is widely used to decode surface codes, but its computational cost increases with code distance. We present Beyond Blossom, a state-of-the-art CPU-based MWPM decoder for surface codes. It combines algorithmic optimization through local predecoding, architecture-aware optimization, and pipeline-wide parallelism to reduce matching workload and execution overhead while preserving MWPM optimality. Across rotated surface codes with distances 9-33 and circuit-level physical error rates of 0.05%-0.3%, on a single CPU core, Beyond Blossom achieves a 4.23$\times$ geometric-mean speedup and up to 5.58$\times$ speedup over Sparse Blossom in PyMatching. At distance 33 and a physical error rate of 0.1%, with 8 CPU cores, decoding a block of 33 measurement rounds takes 21.40 $\mu$s on average, equivalent to 0.65 $\mu$s per round.

[250] arXiv:2611.18483 [pdf, html, other]
Title: Rigidity of the moving particle lemma for the interchange process
Joe P. Chen
Comments: 28 pages
Subjects: Probability (math.PR); Mathematical Physics (math-ph); Combinatorics (math.CO)

Let $G=(V,c)$ be a finite connected weighted graph. We establish the exact conditions for attaining equality in the moving particle lemma for the interchange process on $G$ subject to a unit voltage drop across two terminal vertices $x\neq y \in V$. First, equality can occur only in irreducible representations indexed by partitions with at most two rows. We then show that the equality phenomenon beyond the constant and linear sectors is already visible in the two-particle exclusion process. Such equality occurs in exactly two cases: either the harmonic $x$--$y$ voltage is $\frac12$ on every nonterminal vertex, and the induced nonterminal graph $G[V\setminus\{x,y\}]$ is disconnected; or the harmonic voltage is constant on each connected component of $G[V\setminus \{x,y\}]$, and both voltage values $a$ and $1-a$, with $0\le a<\frac12$, occur. In each case we compute the equality kernel in every degree and particle sector. The resulting decomposition gives the complete equality kernel for exclusion and, through the regular representation, for the interchange process.

[251] arXiv:2611.18488 [pdf, html, other]
Title: Multiplicity of Positive Solutions for Singular Anisotropic Elliptic Equations with Variable Exponents
Ali Akbar Esmailnejad, Somayeh Khademloo, Seyyed Hashem Rasouli
Subjects: Analysis of PDEs (math.AP)

We study anisotropic elliptic Dirichlet problems with variable exponents, singular nonlinearities, and subcritical superlinear reactions. Our contribution is a direct variational construction that combines Nehari geometry and fibering maps without requiring global differentiability of the singular energy, and the result establishes the existence of two positive weak solutions for sufficiently small \(\lambda\), distinguished by their energy signs.

[252] arXiv:2611.18495 [pdf, html, other]
Title: Cohen Macaulayness and Buchsbaumness of Cartesian Products of Paths and Cycles
Bidwan Chakraborty
Subjects: Combinatorics (math.CO)

We study the independence complexes of Cartesian products of paths and cycles. Let G(m,n) denote the Cartesian product of the path P_m and the cycle C_n, and let Delta(m,n) denote its independence complex. We determine the well-covered graphs in this family and use reduced homology to study their Cohen-Macaulay and Buchsbaum properties. Using these results, we completely classify the Cohen-Macaulay members. We then study the Buchsbaum property of Delta(m,n) through vertex links. For the remaining family P_m x C_3, we introduce an auxiliary family of graphs and use an inductive link argument together with Reisner's criterion to determine precisely when the independence complex of P_m x C_3 is Buchsbaum. Combining this with the remaining well-covered cases yields the complete Buchsbaum classification.

[253] arXiv:2611.18500 [pdf, html, other]
Title: On a generalization of result due to Peskine and Szpiro-II
Sayed Sadiqul Islam, Tony J. Puthenpurakal
Comments: Comments are welcome
Subjects: Commutative Algebra (math.AC)

Let $(R,\mathfrak{m})$ be a regular local ring and let $I$ be a Cohen-Macaulay ideal of $R$. When $\operatorname{Char} R=p>0$, a result of Peskine and Szpiro proves that $H^i_I(R)=0$ for $i\neq\operatorname{height} I$. This result is not true when $\operatorname{Char} R=0$. In this article, we prove that the Bass numbers of $H^{\operatorname{height} I}_I(R)$ completely determines the vanishing of $H^i_I(R)$ for $i\neq \operatorname{height} I$. This result was previously established by the second author in the equicharacteristic case and more generally for Gorenstein local rings by Hellus and Schenzel. In contrast to the spectral sequence methods employed by Hellus and Schenzel, our proof is elementary and self-contained.

[254] arXiv:2611.18508 [pdf, other]
Title: Restoring Consistency with Poynting's Theorem in Numerical MHD and RMHD
Dinshaw S. Balsara, Deepak Bhoriya
Comments: Accepted in ApJS
Subjects: Mathematical Physics (math-ph); Instrumentation and Methods for Astrophysics (astro-ph.IM); Computational Physics (physics.comp-ph); Plasma Physics (physics.plasm-ph)

For perfectly conducting plasmas, Poynting's theorem states that the time rate of change of electromagnetic energy density equals the negative of the divergence of the Poynting flux. To the best of our knowledge, this involutive theorem has never been mimetically incorporated in codes. We show that there is an inconsistency in MHD and RMHD codes that evolve face-centered magnetic fields in globally-divergence-free fashion. This is because the face-centered flux of energy density, which incorporates a Poynting vector, is evaluated using one-dimensional Riemann solvers that are applied at face-centers. However, the face-centered magnetic fields are evolved according to edge-centered electric fields that come from two-dimensional Riemann solvers that are applied to the edges of a zone. While edge-centered electric fields are used to evolve the magnetic field, they have no influence on the face-centered Poynting flux. For situations where the magnetic energy is much larger than the thermal energy, this causes a negative pressure to be evaluated at the zone-centers. This paper restores consistency by using edge-centered variables to evaluate a face-centered Poynting flux. A simple accuracy-preserving correction is made to the face-centered flux of energy density. We show that it helps considerably in simulations that have very strong magnetic fields.

[255] arXiv:2611.18518 [pdf, html, other]
Title: Polytopal realization of double root free subword complexes
Zijun Li
Comments: 22 pages
Subjects: Combinatorics (math.CO); Representation Theory (math.RT)

We give a convex geometric sufficient condition for a convex polytope to realize a spherical subword complex. Using this criterion, we first prove that each root independent spherical subword complex is polytopal, for any Coxeter group. Then we prove the polytopality of double root free subword complexes, for any Coxeter groups. To prove this, we construct a polytope in an auxiliary vector space whose image under a natural affine map is the usual brick polytope. In the complex Kac-Moody case, the polytope is integral, with vertices in the character lattice of the torus of unfolded galleries in a thick building. In finite Lie types, in double root free cases, these tori are precisely the corresponding braid varieties.

[256] arXiv:2611.18536 [pdf, html, other]
Title: On Zhao's conjectural basis for finite multiple zeta values
Shin-ichiro Seki
Comments: 28 pages
Subjects: Number Theory (math.NT)

We prove a conjecture by J. Zhao which states that every finite multiple zeta value associated with a nonempty index is a $\mathbb{Q}$-linear combination of $\zeta^{}_{\mathcal{A}}(k_1,\dots, k_r, 2, 1)$, where $k_i\in \{2, 3\}$. Our proof proceeds by constructing a basis for the space of formal multiple zeta values defined by the confluence relations. This approach also reduces the Kaneko--Zagier conjecture (apart from compatibility with the depth filtration) to linear independence conjectures for ordinary and finite multiple zeta values, without using motivic theory.

[257] arXiv:2611.18537 [pdf, html, other]
Title: Valid Inequalities for Bilevel 0-1 Shortest-Path Problems
Bruno M. Pacheco, Margarida Carvalho, Kim Yu
Subjects: Optimization and Control (math.OC)

We characterize valid inequalities for bilevel programs in which the leader makes binary decisions, and the follower solves a shortest-path problem. We exploit a dualize-and-combine reformulation and show that even with ideal formulations for the leader and the follower primal solution sets, fractional solutions may still appear in the continuous relaxation. From that reformulation, we identify that the interaction between the leader variables and the follower dual variables, which we capture through a leader-potential set, is the key structure to be convexified to guarantee that a continuous relaxation recovers the optimal value of the original problem, closing the objective gap. Furthermore, we characterize the valid inequalities for the leader-potential set through network flows, and identify a family of inequalities we name root cuts that suffice to recover the optimal value. Complementary to the structural results, we prove that the cut generation problem is NP-hard even with partially fixed coefficients and a network with two nodes and two parallel arcs. Motivated by the complexity result, we propose a constructive method to fix coefficients in the valid inequalities while preserving separation guarantees, by exploiting the network structure.

[258] arXiv:2611.18538 [pdf, html, other]
Title: Why Finite Intelligence Works in an Infinite World: A Mathematical Theory
Mojtaba Soltanalian
Comments: 56 pages, 5 figures
Subjects: Information Theory (cs.IT); Machine Learning (cs.LG); Machine Learning (stat.ML)

An information system often has to learn before it knows what it will be asked. A finite representation can succeed without recording an infinite environment in full when those asks share collective structure, rather than demand unrelated facts scattered arbitrarily across it. We formalize this phenomenon through future-task information, the minimum retained information needed to preserve decision value relative to the available evidence. A joint decision-regret state records posterior comparisons among actions for every permitted task. Under compactness assumptions, every retained representation admits a calibrated replacement based on this state, preserving all task regrets without increasing information; the resulting information-regret curve equals an operational coding rate. Two exact boundaries govern finite preservation: weak-star closure for a fixed action count, and the singular mass of the source-evidence law when all finite action menus are admitted. Collective structure determines information requirements beyond individual-question difficulty. Families with identical source laws, pairwise task metrics, and individual-task rates can have different high-resolution exponents. Covariance-identical coordinate and parity families have different exact rate-distortion curves, with optimal parity retention characterized by a sharp Fourier-entropy inequality. For balanced nested task families, refinement sizes and weighted reach determine the rate within an additive constant, attained by prefix coding under explicit decay conditions. Nonlinear learning and computational separations distinguish preservation from efficient discovery and use. The proposed mathematical theory identifies which shared decision requirements allow finite information to remain useful for infinitely many possible purposes.

[259] arXiv:2611.18540 [pdf, html, other]
Title: Internal diameter bounds for DLA on random planar maps under invariance principles
Deven Mithal
Comments: 26 pages, 2 figures
Subjects: Probability (math.PR); Mathematical Physics (math-ph)

We establish sublinear bounds for the internal diameter of External Diffusion Limited Aggregation (DLA) clusters on random planar maps. We develop two conditional DLA growth results for deterministic planar maps: the weaker condition yielding sublinear growth for DLA, and the stronger yielding polynomially sublinear growth for DLA. We then verify the strong assumption a.s. for the $\gamma$-mated CRT maps, and the weak condition a.s. for ergodic scale-free random environments, establishing the corresponding a.s bounds.

[260] arXiv:2611.18541 [pdf, html, other]
Title: No free lattice contains an infinite ascending chain of copies of FL(3)
William DeMeo, Ralph Freese
Comments: 59 pages, 13 figures; the main theorem is checked in Agda; the formal development is available at this https URL
Subjects: Rings and Algebras (math.RA); Logic in Computer Science (cs.LO); Group Theory (math.GR); Logic (math.LO)

No free lattice contains an infinite strictly ascending chain of sublattices isomorphic to FL(3), the free lattice on three generators; this answers a question that R. A. Dean asked and the second author's 1997 notes on the problem left open. Every such chain would yield, inside FL(3), a coherent chain of proper self-embeddings $\Theta_0, \Theta_1, \Theta_2, \dots$ with $\Theta_k \circ \Theta_j = \Theta_j$ for $j < k$, so that each later embedding fixes the image of each earlier one pointwise. Every proper self-embedding of FL(3) whose fixed sublattice contains a free generating triple fixes one of the three generators, say $z$, because a power of it or of its dual lies above the identity, and a self-embedding that moves every generator and lies above the identity fixes at most eleven elements. Up to duality, a proper self-embedding fixing the image of such a $\Theta_1$ pointwise fixes only elements above $z \wedge (x \vee y)$, where no free generating triple containing $z$ can lie. We also verify the one-step example of the 1997 notes, prove that no step toward such a chain is self-similar, and show that the configuration the argument rules out at length three does occur at length two.
Without freeness the answer reverses: FL(3) contains an infinite strictly ascending chain of 3-generated sublattices, so the lattice analogue of Takahasi's chain condition for free groups fails. The theorem itself is checked by the Agda proof assistant under its safe flags, for free lattices over generators with decidable equality, and its formal proof uses no classical principle: finite searches and an induction on a finite set replace the infinite pigeonhole principle by which a chain yields a coherent chain.

[261] arXiv:2611.18547 [pdf, html, other]
Title: Polynomial-Time Solvability of the Multi-Dimensional Slope Change Problem
Apoorva Narula, Santanu S. Dey
Subjects: Optimization and Control (math.OC)

Slope change detection seeks to identify changes in the trends of time-ordered signals. We study the problem of fitting a multidimensional time series by continuous piecewise-linear functions with a shared continuous breakpoint and unrestricted slopes. We consider both the dense setting, in which every dimension may change slope, and the sparse setting, in which at most $k$ dimensions may change slope. Although the resulting optimization problems are nonconvex mixed integer nonlinear programs and may have irrational optimal solutions even for rational data, we prove that all six variants, corresponding to the $\ell_1$, $\ell_2$, and $\ell_\infty$ losses in both settings, are exactly solvable in polynomial time. For least-squares loss, we obtain efficient algorithms requiring $O(JT)$ operations in the dense setting and $O(J^2T\log J)$ operations in the sparse setting, where $T$ is the number of time points and $J$ is the number of dimensions. We implement these least-squares algorithms and evaluate them on simulated data and three real-world time series, namely, surface temperatures (ERA5), hand-tracking data from a mixed-reality headset (HoloAssist), and turbofan engine sensor data (NASA C-MAPSS). The dense algorithm solves instances with up to $J=10^5$ and $T=100$, that is, $10^7$ observations, in less than $0.1$ seconds on a laptop, while the sparse algorithm solves instances with about $10^3$ dimensions and up to $T=240$ in under a second. Compared with a mixed-integer nonlinear programming (MINLP) formulation solved by Gurobi, our algorithms are several orders of magnitude faster (approximately $8.9 \times 10^3$ to $3.4 \times 10^6$ times) on instances where Gurobi terminates within its default optimality tolerance of $0.01\%$ optimality gap. On larger instances, Gurobi frequently reaches a 10,000-second time limit with substantial optimality gaps.

[262] arXiv:2611.18551 [pdf, html, other]
Title: The Klein-Gordon equation in projective geometry
Jack Borthwick, Yannick Herfray
Subjects: Differential Geometry (math.DG)

We discuss a geometric method by which Hörmander's result on the asymptotics of a Klein-Gordon field, on an asymptotically flat spacetime, can be related to some partial peeling, à la Penrose, along an extended projective boundary, embedded in a spacetime with one dimension higher.

[263] arXiv:2611.18554 [pdf, html, other]
Title: Sharp nonuniqueness for the Vlasov--Navier--Stokes system
Xingyu Li
Subjects: Analysis of PDEs (math.AP)

We consider the Vlasov--Navier--Stokes system on $\mathbb T^d\times\mathbb R^d$, $d\ge2$. For smooth data and every $p<2$, $q<\infty$, we construct infinitely many weak solutions with velocity in $L^p_tL^\infty\cap L^1_tW^{1,q}$ and bounded, renormalized distribution function; infinitely many of them violate the energy inequality. For smooth velocity data, weak solutions with velocity in $L^2_tL^\infty$ are unique, so the result is sharp at the endpoint of the Ladyzhenskaya--Prodi--Serrin scale. The fluid carries the nonuniqueness, through the convex integration scheme of Cheskidov and Luo, and the kinetic equation is solved exactly. The main new difficulty is the memory of the particles: the kinetic state at time $t$ depends on the whole past of the velocity, so a modification on a short interval changes the system at all later times. We overcome it by a causal gluing, carried out from left to right in time, which re-solves the system on every interval of regularity. This yields wild solutions that are strong outside a closed set of times of arbitrarily small Hausdorff dimension. A causal mollification extends the construction to rough data, including every finite-energy velocity datum in dimensions two and three; in two dimensions the energy class is thus exactly the borderline of uniqueness. Finally, in three dimensions we construct Leray solutions satisfying the strong energy inequality and show that they are strong outside a closed set of times of vanishing $\mathcal H^{1/2}$ measure.

[264] arXiv:2611.18555 [pdf, html, other]
Title: Towards invertibility of derived categories of sheaf-theoretic line operators
Claudia Scheimbauer, Jackson Van Dyke
Comments: 31 pages. Comments welcome!
Subjects: Quantum Algebra (math.QA); Mathematical Physics (math-ph); Algebraic Geometry (math.AG); Category Theory (math.CT)

We investigate when the braided monoidal $\infty$-categories of sheaf-theoretic line operators of $3$-dimensional topological quantum field theories are invertible in the higher Morita category, so that they determine invertible $4$-dimensional anomaly theories. We consider a zoo of different examples which are inherently derived. First, enhancing Ben-Zvi--Francis--Nadler, we show that a symmetric monoidal category of quasi-coherent sheaves $\mathrm{QC}(X)$ is invertible only if $X$ is a point, and convolution categories on loop stacks are Morita trivial whenever the stack satisfies descent along its diagonal, e.g. for classifying stacks. Secondly, we provide an example showing that, unlike for finite braided tensor categories, non-degeneracy does not imply invertibility in the derived setting: For an odd vector space $V[1]$, the $2$-shifted $\mathcal{D}$-modules $\mathrm{DMod}^2(V[1])$ are $3$-dualizable and non-degenerate but neither factorizable nor cofactorizable. This category is closely related to the line operators of linear Rozansky--Witten theory. Finally, we define an anomaly of a group action on an invertible braided monoidal $\infty$-category as a Witt class over $\mathrm{Rep}(G)$, and show that the category of representations of the quantum group of a torus at a root of unity is invertible relative to its quantum Frobenius.

[265] arXiv:2611.18560 [pdf, html, other]
Title: On the pure part of the cohomology of character varieties
Olivier Schiffmann, Eric Vasserot
Comments: 33 pages
Subjects: Algebraic Geometry (math.AG); Representation Theory (math.RT)

We prove the purity conjecture of Hausel and Rodriguez-Villegas relating the graded dimension of the pure part of the cohomology of the twisted character variety $M^B(r,d)$ of $GL(r)$ of genus $g$ with the cohomology of a suitable quiver variety associated to the quiver $S_g$ with one vertex and $g$ loops. In particular, this provides an explicit formula for the pure part of the mixed Hodge polynomial of $M^B(r,d)$ in terms of the Kac polynomial $A_{S_g,r}(q)$. Our approach is based on the $P=W$ theorem to transfer the purity conjecture into a statement about the perverse filtration on the cohomology of th stack of Higgs bundles on a genus $g$ curve. We use the theory of BPS Lie algebras, their $\chi$-independence property (proven by Kinjo-Koseki), the recent proof of the stack version of $P=C$ due to Picovschi and Davison's analytic neighborhood theorem to reduce the conjecture to a comparison problem between (the 'pure' part) of the BPS Lie algebra asociated to the stack of Higgs bundles on a genus $g$ curve and the BPS Lie algebra of the stack of representations of the preprojective algebra of the quiver $S_g$. This last step is taken care of by a quiver analog of Markman's tautological generation theorem for the BPS Lie algebra of arbitrary quivers (this last result is also proven by Davison and Hennecart).

Cross submissions (showing 53 of 53 entries)

[266] arXiv:2611.17386 (cross-list from cs.DM) [pdf, html, other]
Title: TSP instances that require exponentially many subtour elimination constraints
Eleonora Vercesi, Austin Buchanan
Subjects: Discrete Mathematics (cs.DM); Combinatorics (math.CO)

We construct pathological TSP instances that require exponentially many subtour elimination constraints (SECs) in the sense that, if a smaller collection of SECs is imposed, then the Dantzig-Fulkerson-Johnson model returns a disconnected solution costing less than an optimal tour. For asymmetric instances on $n$ vertices, we prove a growth rate of \(\Omega(\phi^n)\), where \(\phi\approx 1.618\) is the golden ratio. A node-splitting reduction gives metric instances with \(\Omega(\phi^{n/2})\) growth. We also give instances in the plane under the Euclidean, Rectilinear, and Maximum metrics that require exponentially many SECs. Concorde struggles on them, with solve times growing exponentially despite tiny integrality gaps.

[267] arXiv:2611.17393 (cross-list from cs.CR) [pdf, html, other]
Title: Evolutionary-based Transfer Learning for Physical Attack on End-to-End Autoencoder Communications
Ho Viet Duc Luong, Lang Hong Nguyet Anh, Huynh Thi Thanh Binh, Trinh Van Chien
Comments: 31 pages, 10 figures, and 4 tables. Accepted by JNCA
Subjects: Cryptography and Security (cs.CR); Information Theory (cs.IT)

End-to-end autoencoder communication has emerged as a promising means of achieving efficient data transmission across various domains. Nevertheless, vulnerabilities have recently been revealed in these systems by adversarial attacks, wherein malevolent entities manipulate the transmitted signals to deceive the autoencoder. This paper leverages the applications of evolutionary algorithms to solve a challenging optimization problem of launching physical attacks against end-to-end autoencoder communication. For white-box scenarios, we introduce PAGA (Physical Attack based on Genetic Algorithm), which combines a genetic algorithm with elite population initialization to craft attack signals that degrade autoencoder performance. To gauge the efficacy of these attack signals, we employ a fitness function that assesses their capacity to induce substantial reconstruction errors and misclassification rates. A Multi-Factorial version of PAGA, referred to as PAMFGA, is proposed to deal with practical scenarios where the attackers have limited knowledge about the receiver, also known as a black-box attack. Our experimental results show that the proposed attacks can substantially degrade the reliability of the considered autoencoder communication systems across the evaluated settings. This study also underscores the critical importance of incorporating security considerations into the design and implementation of end-to-end autoencoder communication systems.

[268] arXiv:2611.17397 (cross-list from eess.SY) [pdf, html, other]
Title: Admissibility-Preserving Control for Block Strict-Feedback Systems Under Time-Varying Asymmetric Actuator and State Constraints
Saurabh Kumar, Lohitvel Gopikannan, Shashi Ranjan Kumar, Abhinav Sinha
Subjects: Systems and Control (eess.SY); Dynamical Systems (math.DS)

This paper addresses the tracking control of block strict-feedback nonlinear systems subject to time-varying asymmetric actuator and full state constraints. To that end, we develop a time-varying Admissibility-Preserving Control (APC) framework, in which the Admissibility-Preserving Input Realization (APIR) generates the plant input through a dynamic realization. The APIR guarantees input admissibility under the moving actuator set whenever each actuator bound contracts slower than the decay rate of the realization, and a closed-form lower bound on its gain is derived. The state constraints are handled by a logarithmic barrier coordinate at every backstepping step, with widths measured from the virtual control to the moving envelope of the corresponding state. We prove that every state lies inside its envelope, with each virtual control only required to remain inside the envelope of the next state, while the tracking error converges to zero exponentially. Simulations demonstrate the efficacy of the proposed safety-critical control scheme.

[269] arXiv:2611.17403 (cross-list from hep-th) [pdf, html, other]
Title: Graded unitarity constraints on simply-laced affine Kac--Moody algebras
Harshal Kulkarni
Comments: 44 pages, 3 figures, 5 tables
Subjects: High Energy Physics - Theory (hep-th); Quantum Algebra (math.QA); Representation Theory (math.RT)

We investigate constraints imposed by four-dimensional unitarity (recently formalised as graded unitarity) on possible simply-laced affine Kac--Moody vertex algebras arising from four dimensions via the SCFT/VOA correspondence. Under the assumption that the $\mathfrak{R}$-filtration is weight-based with respect to the currents and the Casimir operators, with appropriately shifted $R$-charge assignments for the latter, we demonstrate that all values of the level other than a discrete set are incompatible with four-dimensional unitarity. This set includes all the boundary admissible affine vertex algebras, those corresponding to rank-one Kodaira SCFTs, as well as certain non-admissible families conjecturally associated with specific $D^b_q(\mathfrak{g})$ Argyres--Douglas theories. Specialising to $\mathfrak{sl}_N$ with $N$ prime, we find a stronger result: under the same $\mathfrak{R}$-filtration assumption, four-dimensional unitarity rules out all levels except the boundary admissible $k = k_{N,q}$, which are precisely those corresponding to the $D_q^N(\mathfrak{sl}_N)$ Argyres--Douglas theories.

[270] arXiv:2611.17433 (cross-list from quant-ph) [pdf, html, other]
Title: Fast mixing and thermal phases from strong decay of correlations
Chao Yin, Vedika Khemani
Comments: 35 pages, 6 figures
Subjects: Quantum Physics (quant-ph); Statistical Mechanics (cond-mat.stat-mech); Mathematical Physics (math-ph)

We show that a strong form of correlation decay in quantum Gibbs states has far-reaching dynamical consequences. For a smooth path of geometrically local commuting Hamiltonians whose Gibbs states satisfy strong decay of correlations, we construct $\mathrm{O}(1)$-time quasi-local Lindbladian evolutions exactly connecting these states in both directions, together with $\mathrm{O}(1)$-time quasi-local Hamiltonian evolutions exactly connecting their canonical purifications. These quasi-local connections strengthen previously known quantum-channel circuit constructions based on the decay of connected correlation functions [R. Ma, V. Khemani, and S. Sang, PRX Quantum 7, 033052 (2026)], which approximately connect states within the same phase but have depths that grow logarithmically with system size. Furthermore, if the Gibbs-state path contains a product state, we prove that the single-site Glauber dynamics has a $\Omega(1)$ spectral gap independent of the system size throughout the path. This establishes Glauber-dynamics fast mixing for models that may violate the strong spatial mixing condition used in prior proofs, including (1) the $q$-state Potts model throughout the high-temperature phase for any $q$ and any finite dimension; (2) the Ising model with a longitudinal field at low temperature, with frustrating perturbations that destroy monotonicity of the dynamics; and (3) the three-dimensional $\mathbb{Z}_2$ lattice gauge theory at low temperatures comparing to a field perturbation, even though the model supports classical memories at intermediate temperatures. Intriguingly, we establish fast mixing of these classical Markov chains using tools from quantum physics like Lieb-Robinson bounds.

[271] arXiv:2611.17449 (cross-list from physics.chem-ph) [pdf, html, other]
Title: Methanol substitution suppresses deflagration-excited knock and increases the efficiency of a hydrogen-fuelled CFR engine
Riming Xu, Mebin Panithasan, Xinyang Wang, Giovanni Vorraro, James W.G. Turner
Comments: 20 pages 8 figures
Subjects: Chemical Physics (physics.chem-ph); Systems and Control (eess.SY); Mathematical Physics (math-ph)

Knock restricts the performance of hydrogen spark-ignition engines and is usually attributed to end-gas autoignition. To the authors' knowledge, this is the first study in which methanol is used to replace part of the hydrogen in a hydrogen engine at constant fuel energy addition, and it shows that near the knock boundary the limiting oscillation is excited by the deflagration itself, which methanol removes without derating the performance. Port-injected methanol replaced 20--50% of the hydrogen energy in a variable-compression Cooperative Fuel Research engine at 600 rpm and compression ratios of 8--12. With pure hydrogen, oscillation in the 4--15 kHz range began before 10% of the charge had burned in 97--100% of cycles, and its maximum amplitude (MAPO) followed the maximum pressure-rise rate across 2499 cycles (Spearman $\rho=0.94$). Methanol slowed the deflagration: it replaced high-flame-speed hydrogen, cooled the intake by 24--25 K and, at unchanged intake pressure, enleaned the mixture by 10--13%. At 50% methanol, the 10--90% combustion duration lengthened 2.7--3.0-fold, oscillation onset moved 4.5--8.3$^\circ$CA after CA10 and mean MAPO fell by 89--93% although the spark timing was advanced by 13--19$^\circ$CA, and IMEP and indicated thermal efficiency rose by 2.4--7.8%. Methanol was thus worth more than this advance, and at matched CA50 MAPO was still about 90% lower. The measured combustion duration of all 25 data sets scaled with the computed laminar flame speed as $S_L^{-0.58}$ ($R^2=0.99$); fuel replacement accounted for about three quarters of the reduction in $S_L$, and the end-gas autoignition integral stayed below 0.07, against 1 at autoignition. The chamber kept its cylindrical acoustic modes, whose frequencies fell by 8--9%. The trade-off is formaldehyde emissions, which rose five- to sixfold while NO$_x$ fell by 49--85%.

[272] arXiv:2611.17459 (cross-list from cs.LG) [pdf, html, other]
Title: Classification with Large-Step Gradient Descent: Unifying Self-Stabilization and Convergence Rates
Salma Tarmoun, Lachlan Ewen MacDonald, Konstantinos Emmanouilidis, Ziqing Xu, René Vidal
Subjects: Machine Learning (cs.LG); Optimization and Control (math.OC)

Neural networks are often trained with gradient descent (GD) using step sizes that exceed classical stability thresholds, a regime where standard convergence theory no longer applies. Despite exhibiting non-monotonic loss and oscillatory dynamics, this regime frequently leads to faster convergence and better generalization. Existing theoretical perspectives offer complementary but incomplete insights: one identifies a self-stabilization mechanism that drives GD toward flat regions but does not yield convergence rates; another derives rigorous rates for specific losses but does not explain the underlying stabilization mechanism; and a third unifies these views for overparameterized least squares, but relies on the existence of a minimizer manifold, which is absent in classification settings. In this work, we extend this unified geometric perspective to exponential-tail losses, including logistic and cross-entropy losses in separable linear classification, where the loss infimum is not attained at any finite parameter. We identify a curvature-defined reference subspace that replaces the role of the minimizer manifold, yielding a coupled dynamical system in which orthogonal oscillations are damped by parallel progress along directions of decreasing sharpness. Under regularity conditions, which we verify for logistic and multiclass cross-entropy losses on symmetric data models, we derive explicit bounds for the iterates, not just the loss, covering both the unstable and stable regimes, and revealing a three-phase damping structure in the latter. Our analysis further uncovers a transient implicit bias induced by large step sizes: although GD converges asymptotically to the max-margin direction, large steps can leave persistent orthogonal residuals and, in certain geometries, amplify them, affecting finite-time alignment with the max-margin direction.

[273] arXiv:2611.17484 (cross-list from cs.LG) [pdf, html, other]
Title: SURFACE: Preference Distribution Matching on Pareto Fronts via Scalarization Steering
Liuyuan Jiang, Prasanna Sattigeri, Lisha Chen
Subjects: Machine Learning (cs.LG); Optimization and Control (math.OC); Machine Learning (stat.ML)

Constructing a finite Pareto representation requires allocating a limited number of solutions across the Pareto front (PF). A desired preference distribution specifies this allocation by assigning more solutions to some PF regions and fewer to others. Scalarization generates Pareto solutions by varying objective weights and solving single-objective problems. However, a distribution of scalarization weights generally does not translate into the same distribution of Pareto solutions along the PF, because the weight-to-solution map is nonlinear and unknown in this http URL account for this distortion, we introduce SURFACE (Scalarization Updates for Redistributing Finite Approximations with Chart Estimation}), which adaptively updates scalarization weights to match a desired PF distribution. SURFACE estimates how each region of the weight grid corresponds to an area of the PF from the current scalarized solutions, then redistributes the weights accordingly. The method supports parallel, warm-started, inexact optimization with standard single-objective solvers. Theoretically, we establish that, under the stated regularity conditions, SURFACE achieves linear convergence of the preference distribution mismatch to a finite-resolution error floor of $\mathcal{O}(N^{-2/(M-1)})$, where $N$ is the number of adaptive weights and $M$ is the number of objectives. Empirically, experiments across multiple benchmarks demonstrate improved target-mass balance and PF coverage compared with established baselines.

[274] arXiv:2611.17492 (cross-list from cs.LG) [pdf, html, other]
Title: PF-Exec: Large-Scale UAV Relay Load Balancing with an Anchored Potential Direction Decider and a Per-Dimension Gain-Learning Executor
Liheng Zeng, Hanzhang Jia, Yiran Li, Yi Gao, Bo Ma
Subjects: Machine Learning (cs.LG); Information Theory (cs.IT); Signal Processing (eess.SP)

Relay load balancing in large-scale UAV networks requires joint decisions on association, bandwidth, power and hovering position, while the dimension grows with the number of UAVs and each UAV sees only its local state. This paper splits the decision into two layers. An anchored potential direction decider emits a closed-form target at every instant and returns its direction only. A gain-learning executor maps a local observation into a positive gain per dimension, composes gain and target, and clips the action against the physical single-step bound; the two layers form PF-Exec. The unit gain is the default start, so the executor reduces to the pure potential policy before training. The load is first-order homogeneous in bandwidth, making the bandwidth target closed form, and the position target is the demand-weighted centroid of the served users. The system uses a two-hop access and millimetre-wave backhaul link with soft association, a 3GPP UMa-AV channel with two shadowing layers, an OU-type social-force crowd and a quadrotor physical layer. Evaluation spans all fleet sizes, two crowd scenarios, independent seeds, the published baselines in their own settings and a degraded-information line. In the highest-pressure burst setting the fixed-step comparison breaks down on part of the seeds, losing fairness and mean load at once, while PF-Exec holds fairness near one. Among the ten comparison methods only the greedy heuristic survives that setting; its load variance stays far higher. Under stale global state and position noise the fairness index stays high at both largest-scale scenarios. Flight energy is nearly identical between the learned and the fixed-step executor, and three constants are fixed once across all settings. The convergence properties of both layers, from the truncated gain iteration to the perturbed tracking bound, are proved in the companion analysis.

[275] arXiv:2611.17503 (cross-list from stat.ML) [pdf, other]
Title: Multifidelity Operator Inference for Dynamical Systems
Vignesh Sella, Anirban Chaudhuri, Karen Willcox
Comments: 19 pages, AIAA SciTech Forum 2027 (Uncertainty Quantification Conference)
Subjects: Machine Learning (stat.ML); Computational Engineering, Finance, and Science (cs.CE); Machine Learning (cs.LG); Numerical Analysis (math.NA)

This paper presents a multifidelity (MF) formulation of Operator Inference (OpInf) for learning non-intrusive, physics-based reduced-order models (ROMs) of nonlinear dynamical systems. OpInf learns reduced operators from projections of snapshot data by solving a least squares regression problem. However, generating high-fidelity snapshots can be computationally expensive, limiting parameter coverage and the temporal extent of training trajectories for many aerospace applications, which can lead to inaccurate or unstable ROM predictions. This work proposes MF-OpInf, which combines limited high-fidelity snapshots with more plentiful low-fidelity snapshots through a control-variates-inspired MF least squares formulation to learn a single set of reduced operators across multiple trajectories. Low-fidelity trajectories provide additional parameter coverage and extend beyond the high-fidelity training time horizon. The low-fidelity snapshots are also used to construct an improved reduced basis through weighted proper orthogonal decomposition. We demonstrate MF-OpInf on a nonlinear reaction-diffusion problem with parametrized sinusoidal forcing and a two-dimensional incompressible flow past a cylinder with a parametrized inlet pulse. In these experiments, under an equal training simulation budget, MF-OpInf reduces the mean relative prediction error at unseen parameters by up to $87\%$ for the reaction-diffusion problem and $28\%$ for the cylinder flow problem over the test time regime, which extends beyond the high-fidelity training time horizon. These results demonstrate that MF-OpInf can improve temporal extrapolation and prediction at unseen parameters without increasing the training simulation budget.

[276] arXiv:2611.17504 (cross-list from eess.SY) [pdf, html, other]
Title: Learning monotone game-theoretic linear MPC
Alberto Bemporad, Tatiana Tatarenko
Comments: 15 pages, 1 figure
Subjects: Systems and Control (eess.SY); Optimization and Control (math.OC)

We propose a method to learn a game-theoretic model predictive control (GT-MPC) law by imitation from input and output data of a running multi-agent system. By interpreting the recorded inputs as the first moves of the equilibria of a game played by the agents, we learn the GT-MPC weights under hard input constraints and soft output constraints, without requiring the agents to reveal their objectives. We also impose that the resulting generalized Nash equilibrium (GNE) problem is strongly monotone, which ensures the existence and uniqueness of the equilibrium and, hence, that the learned GT-MPC law is well defined and can be evaluated efficiently online by variational GNE-seeking algorithms for linear-quadratic games. Moreover, strong monotonicity implies that the equilibrium is almost everywhere differentiable with respect to the references and the weights, which enables automatic differentiation for gradient-based optimization. In addition, we promote closed-loop stability of the unconstrained equilibrium feedback by incorporating a penalty that involves a jointly learned quadratic Lyapunov function. Learning a GT-MPC formulation enables us to explain the agents' objectives, reproduce their behavior in simulation in new scenarios, optimize their set-points, design mechanisms, and enforce additional constraints. A numerical example illustrates the approach.

[277] arXiv:2611.17555 (cross-list from cs.MS) [pdf, html, other]
Title: Red-Blue Hamiltonian Tomography via the Operator Lightcone Wavemap
Paolo D'Alberto
Comments: 15 pages, 2 figures, 3 tables
Subjects: Mathematical Software (cs.MS); Mathematical Physics (math-ph); Quantum Physics (quant-ph)

We introduce a model-free method for Hamiltonian tomography based on the operator spreading wavefront. Given two tensor network simulations of the same quantum lattice (one with the nominal Hamiltonian and one with one or more perturbed bonds), the signed cross-entropy of the non-identity Pauli weight field $\mathcal{L}(v,t) = -\ln(n_{\rm pert}/n_{\rm base})$ identifies each perturbed bond by its causal signature: a red-blue sign flip at the two endpoints, visible from the first wavefront crossing. Combining measurements from $p$ strategically placed observation centers via an ensemble log-likelihood sum, a single broken bond is identified with an 82-fold margin over the next candidate on a $7\times7$ lattice. Extending to realistic coupling degradation ($\delta J = -0.20$) and up to 8 simultaneous faults, the integrated log-ratio $\Lambda(v) = \ln(\mathcal{B}(v)/\mathcal{N}(v))$ achieves a per-bond detection rate above 90\% in a single seismic pass using only 6 simulations. An iterative re-scan strategy progressively resolves multi-bond cases as the signal clears with each recalibration pass. The method requires no model assumptions and no knowledge of the perturbation type or magnitude; the detection is deliberately blind.

[278] arXiv:2611.17609 (cross-list from stat.ME) [pdf, html, other]
Title: Homogeneous pursuit in $β$ model
Ergan Shang, Si Chen, Canhong Wen
Subjects: Methodology (stat.ME); Statistics Theory (math.ST); Machine Learning (stat.ML)

Data in forms of networks has been encountered in various prevalent fields at the arrival of big data era. To unveil and recover the true model with core units with numerous links, the $\beta$-model under sparsity constraint is proposed to meet the expectation of statisticians and engineers. Not only does this network model inherit spectacular property from the Erdős-Rényi model, but also exhibits degree heterogeneity through tuning sparsity parameter $s$. In this paper, we propose Homogeneous Pursuit (HP), an $\ell_0$-constrained maximum likelihood estimation method implemented through a primal-dual algorithm. To ease the harshness of computation, we find the surrogate function of the corresponding objective function to derive Majorization Minimization algorithm through the primal-dual process. Moreover, after meticulous evaluation, the algorithm brought about captures the property of fine convergence rate in a contraction mapping way. Under some mild conditions, the proposed generalized information criterion (GIC$^*$) for selecting the sparsity level is consistent to find the truth. Combining HP with GIC$^*$ gives the adaptive procedure HP-GIC$^*$; HP-BIC denotes the same estimation method with sparsity selected by BIC. Finally, simulation studies show that GIC$^*$ improves support recovery relative to BIC in the reported comparisons, while HP achieves lower computational cost while maintaining estimation accuracy comparable to the sparse benchmark methods. A microfinance application illustrates the use of HP-GIC$^*$ for studying the association between network prominence and participation, with improved fit in the reported village-level regressions.

[279] arXiv:2611.17614 (cross-list from physics.flu-dyn) [pdf, html, other]
Title: Global saddle selection and exact absolute-instability boundaries for convection in porous media with throughflow
Oleg N. Kirillov
Comments: 32 pages, 8 figures
Subjects: Fluid Dynamics (physics.flu-dyn); Mathematical Physics (math-ph); Pattern Formation and Solitons (nlin.PS)

In the Darcy-Prats problem, horizontal throughflow leaves the temporal onset of convection unchanged but raises the heating required for a localized disturbance to grow at a fixed point. The saddle equations give five candidates, but only the saddles reached by deformation of the Fourier contour contribute to the growth. For $Ra>\pi^2$, $Pe>0$ we prove that the same off-axis pair contributes throughout the domain: no Stokes transition can change its contribution. Its growth gives a unique analytic absolute threshold, first reached by the lowest vertical mode. Rescaling transfers the selection to Forchheimer drag, transverse rolls of a power-law fluid, anisotropic permeability, an open upper boundary and a vertical magnetic field. A shift of the same growth function accounts for interphase heat exchange in a model of metallic foam. At prescribed throughflow the threshold increases strictly with either resistance coefficient. In particular, a vertical magnetic field raises the absolute threshold at fixed Péclet number. Tabulated thresholds check the reduction. Algebraic elimination gives the boundary polynomial, and frequency recovery selects its physical branch. At the Darcy level the selected saddles trace an arc of the elliptic curve 11a3, a degeneration of a genus-two family at nonzero shifted levels. Series inversion on this arc gives an integer weak-throughflow series and an all-order strong-throughflow expansion. Rational certificates establish the exact convergence radii of both series on the selected sheets.

[280] arXiv:2611.17663 (cross-list from hep-th) [pdf, html, other]
Title: Dynamical Gauss--Bonnet Sum Rules and Global Consistency in Five-Dimensional Braneworld Cosmology
Paulo Michel Longo Tavares da Silva
Subjects: High Energy Physics - Theory (hep-th); Mathematical Physics (math-ph)

We derive an exact dynamical consistency relation for a smooth, periodically compactified five-dimensional Einstein--Gauss--Bonnet cosmology sourced by a real, minimally coupled canonical scalar field. For a spatially flat Friedmann--Lemaitre--Robertson--Walker slicing and a generally time-dependent warp factor, a contraction of the bulk equations eliminates both the scalar potential and the bulk cosmological constant. A direct orthonormal-curvature reconstruction gives the independent diagonal and mixed field equations and verifies the contracted Gauss--Bonnet identity. The integrated relation separates an exact total derivative from the dynamically active Lovelock sector. Importantly, satisfying the integrated sum rule alone does not imply a solution of the complete system. We prove that, for positive Gauss-Bonnet coupling, a smooth periodic time-independent warp factor and a canonical scalar exclude all exact expanding power-law scale factors $a(t)\propto t^p$ with $p>0$. This strengthens the previously established de Sitter sign obstruction and removes an earlier interpretation of $p=1/2$ as an admissible sign-compatible physical branch. For time-dependent warping, we reformulate bouncing conditions using proper time and the physical scale factor on each constant-$y$ hypersurface. We compare the common $w=-1$ geometric member with the perturbative weighted construction of Dias, Hoff da Silva, and da Rocha. At the level of the unexpanded Ricci-trace rearrangement, the curvature-only tensor contribution differs from the full Lanczos contraction by a definite scalar-curvature term. This distinction, and the additional independent field equations, delimit the physical conclusions that may be drawn from a necessary integrated condition.

[281] arXiv:2611.17822 (cross-list from cs.CE) [pdf, html, other]
Title: Scalar Entropic Damage Transport: Well-posed softening with a single damage variable
Jonas Nutz, Vikram Laheri, Matti Schneider
Comments: 42 pages, 15 figures. Submitted to Computer Methods in Applied Mechanics and Engineering
Subjects: Computational Engineering, Finance, and Science (cs.CE); Numerical Analysis (math.NA)

Entropic Damage Transport (EDT) represents material softening via a local continuum damage model while ensuring the well-posedness of the mechanical boundary value problem. It is based on a convexification of the time-incremental potential associated with a rate-limited scalar damage model. A one-dimensional distribution of damage states serves as the internal variable, and the number of these states grows with the number of time steps. We show that the emergence of the damage distribution is an artifact of the time discretization. Surprisingly, the distribution concentrates at a single damage state in the time-continuous limit, and EDT converges to a rate-limited damage model with a scalar damage variable, whose free energy is jointly convex in the strain and the reciprocal degradation. We exploit this hidden convexity by a frozen-metric discretization in terms of the reciprocal degradation, which renders every increment jointly convex. The resulting scalar update preserves damage irreversibility, the prescribed damage-rate limitation and thermomechanical consistency, reduces to a scalar equation and provides a symmetric and positive definite algorithmic tangent in closed form. Computational experiments assess the accuracy and the efficiency of both formulations from the material point to the microstructure level, and demonstrate that the scalar update permits a finite-element computation of industrial size with more than 14 million degrees of freedom.

[282] arXiv:2611.17902 (cross-list from q-fin.MF) [pdf, html, other]
Title: Well-Posedness of Semimartingale Optimal Transport with Partial Marginal Constraints for Model Calibration
Jean-François Chassagneux, Stéphane Crépey, Grégoire Loeper, Justin Ruelland
Subjects: Mathematical Finance (q-fin.MF); Optimization and Control (math.OC); Probability (math.PR)

We study the well-posedness and stability of a semimartingale optimal transport problem with partial marginal constraints at several maturities, motivated by the calibration of financial models to finitely many option prices. We connect its probabilistic and Eulerian formulations within the Benamou--Brenier framework. Under convex-duality assumptions, we establish strong duality for every price vector in the extended-value sense and existence of a primal optimizer whenever the value is finite. Under additional PDE assumptions, we establish dual attainment on the relative interior of the admissible price set, together with uniqueness of the primal optimizer. Under further non-degeneracy assumptions, we show that this price set has nonempty interior, on which the dual optimizer is unique and depends locally Lipschitz continuously on the prices. The analysis combines convex methods with regularity and local strong convexity results for Hamilton--Jacobi--Bellman solution maps established in a companion paper. For a fixed deterministic initial state, we also prove continuity of the optimal law on path space in the adapted Wasserstein distance of order two as prices vary within this interior. This stability concerns the optimizer over the full admissible class of semimartingale laws, allowing characteristics that depend on the past. The framework accommodates bounded uniformly continuous payoffs, including European puts in log-price coordinates, without payoff regularization or spatial truncation.

[283] arXiv:2611.17948 (cross-list from quant-ph) [pdf, html, other]
Title: Local Quantum Metrology: Precision Limits for Observers in QFT
Markus Fröb, Albert Much
Subjects: Quantum Physics (quant-ph); High Energy Physics - Theory (hep-th); Mathematical Physics (math-ph)

How precisely can an observer estimate a parameter related to a quantum field? This question is answered for quantum-mechanical systems using the SLD--Bures--Fisher metric and the quantum Cramér--Rao bound. However, local algebras in relativistic quantum field theory are of type III: they carry no trace and normal states have no density matrices, so the SLD quantum Fisher information and the quantum Cramér--Rao bound cannot be defined in the usual way. We define the SLD (Bures) quantum Fisher information on arbitrary von Neumann algebras through Uhlmann's transition probability and prove a quantum Cramér--Rao bound for collective measurements. We also show that the bound is sharp, and equals the largest classical Fisher information obtainable by measurements in the region.

[284] arXiv:2611.17982 (cross-list from eess.IV) [pdf, html, other]
Title: BeST: Beta splatted tomography for direct reconstruction from coherent imaging measurements
Johannes Gruen, Philipp Paetzold, Andreas Schropp, Aknur Karabay, Shahin Sepanlou, Sebastian Eberle, Martin Seyrich, Felix Wittwer, Imke Greving, Silja Flenner, Ken Vidar Falch, Jan Garrevoet, Manuel Guizar-Sicairos, Christian G. Schroer, Johannes Hagemann
Subjects: Image and Video Processing (eess.IV); Mathematical Physics (math-ph); Data Analysis, Statistics and Probability (physics.data-an)

Conventional coherent X-ray tomography requires the phase of each projection to be reconstructed with high fidelity. However, individual reconstructed projections might be flawed, e.g. due to positioning errors, yielding inconsistent tomographic reconstructions. By directly coupling phase retrieval and tomography, consistency is enforced through a common object volume. But reconstructing a full volume demands substantial computational resources. To reduce this demand, we introduce Beta Splatted Tomography (BeST), which represents the common object volume using compactly supported beta primitives with closed-form analytical projections, enabling efficient reconstruction directly from coherent scattering images. This representation substantially reduces the number of optimizable parameters compared to a voxel grid. We demonstrate BeST on experimental datasets from hard X-ray near-field holography and far-field ptychography measurements. In both cases, the joint technique improves reconstruction quality compared to two-step methods.

[285] arXiv:2611.17989 (cross-list from cs.DC) [pdf, other]
Title: The Exact Stabilization Time of Self-Stabilizing Coloring: Mean, Variance, and Distribution
{É}lie de Panafieu, Fabien Mathieu (NPA), Maria Gradinariu Potop-Butucaru (NPA), S{é}bastien Tixeuil (NPA, IUF)
Subjects: Distributed, Parallel, and Cluster Computing (cs.DC); Combinatorics (math.CO); Probability (math.PR)

The worst-case stabilization time of a self-stabilizing algorithm usually says little about its typical behavior beyond the order of magnitude. This paper revisits the classical self-stabilizing $Delta+1$ coloring algorithm with vertices activated at random, one at a time (the random central daemon). Considering the number of color changes as a random variable, we study its mean, variance and, on several families of graphs, its exact distribution. The analysis rests on a reduction: a vertex changes color, at most once, exactly when it is not a local maximum of a uniformly random labeling of the vertices, maxima being taken among the neighbors that share its initial color (the monochrome initial configuration is the slowest case). What can be predicted depends on what is known of the graph. The degree distribution (the view at distance one) gives the mean. The variance needs the view at distance two, in particular the triangles, and the full law needs the whole graph. We give closed-form results, from monochrome and from uniformly random initial configurations, on paths, cycles, random trees, Erdős-R{é}nyi graphs and bipartite random graphs. From a monochrome start, the mean stays within a factor two of the worst case, whereas the variance ranges from zero (disjoint cliques) to order $n^2$ (the star on $n$ vertices)..

[286] arXiv:2611.18001 (cross-list from quant-ph) [pdf, html, other]
Title: The cone of states over time: exact tests and convergent two-sided hierarchies
Matt Hoogsteder-Riera
Comments: 51 pages
Subjects: Quantum Physics (quant-ph); Mathematical Physics (math-ph)

A state over time (stote) pairs a state $\rho$ with a channel $\mathcal{E}$ as the Hermitian, generally non-positive operator $(\rho\otimes\mathbf{1})\star J_\mathcal{E}$. We study the convex cone $\widehat{\mathcal{Q}}$ generated by these operators. Our main result is a convergent outer semidefinite hierarchy with an explicit trace-norm Hausdorff bound on its trace-one slices. Specializing constrained symmetric-extension theory to the input--channel representation, we show that Bose-extension rounding preserves the channel marginal constraint and gives error at most $2d_A^2(d_A-1)/(k+d_A-1)$ at level $k$. A complementary inner hierarchy retains all channels at each chosen pure-input direction. For $d_A\ge2$, its error is at most $2(d_A-1)\sin^2\delta$, where $\delta$ is the Fubini--Study covering radius; nested sets of $N$ directions give error at most $2\pi^2(d_A-1)N^{-1/(d_A-1)}$, independently of $d_B$. These bounds provide explicit size--accuracy guarantees and certified support-value bounds, without guaranteeing finite termination for exact boundary membership. For binary classical outputs, we obtain an exact SDP membership test, including indefinite output blocks and mixtures that are not single stotes. At faithful marginal the test reduces to a scalar inequality; every trace-one member of this sector with input marginal $\rho$ has a constructive realization using at most $\operatorname{rank}\rho$ pure-input stotes with binary measurement channels. Finally, we compute the exact isotropic boundary and prove $\mathrm{PPT}\subsetneq\widehat{\mathcal{Q}}\cap\mathrm{PSD}\subsetneq\mathrm{PSD}$ for equal local dimensions at least two.

[287] arXiv:2611.18012 (cross-list from physics.comp-ph) [pdf, html, other]
Title: ADfiRe: An empirical- and CFD-informed advection-diffusion-reaction thermal model for wildfire spread
Konstantinos Vogiatzoglou, Nikolaos Sdiros, Costas Papadimitriou, Konstantinos Ampountolas, Petros Koumoutsakos, Vasilis Bontozoglou
Comments: 35 pages, 9 Figures, 2 Tables
Subjects: Computational Physics (physics.comp-ph); Computational Engineering, Finance, and Science (cs.CE); Mathematical Physics (math-ph); Fluid Dynamics (physics.flu-dyn)

Real-time wildfire forecasting requires a trade-off between rapid yet physically relevant models and high fidelity but computationally costly models of flame spread over heterogeneous, multiphase solid fuel. The present study introduces ADfiRe, a hybrid framework that integrates empirical correlations and CFD-informed parameterizations into a physics-based advection-diffusion-reaction (ADR) formulation. The key features of ADfiRe are the use of established fuel databases, the capacity to handle multiple fuels, and a methodology to capture the effect of arbitrary topography. Furthermore, it includes the effect of flame tilting due to wind, thus accounting for the differences between plume- and wind-dominated fire propagation. ADfiRe resolves explicitly the coupled thermochemical degradation as well as heat and mass transport mechanisms of the advancing fire front. The wind field is modeled based on an appropriately defined Byram number. The model is validated against five well-documented experimental field-scale fires in Mediterranean shrublands, showing quantitative agreement with key metrics such as the rate of spread (ROS) and the fireline intensity, through a two-stage, Arrhenius-based heterogeneous reaction scheme coupling solid-fuel pyrolysis and oxygen-limited char/volatile combustion.

[288] arXiv:2611.18028 (cross-list from cs.DS) [pdf, html, other]
Title: Long rational and Gaussian integer multiplication
Yuval Spiizer, Raphael S. Steiner
Comments: 38 pages
Subjects: Data Structures and Algorithms (cs.DS); Number Theory (math.NT)

Long integer multiplication is a fundamental operation in computational algebra, heavily relying on Toom--Cook and related evaluation-interpolation algorithms. Conventional wisdom dictates that multiplication on the Gaussian integers $\mathbb{Z}[i]$ is reduced to standard rational integer multiplication, since $\mathbb{Z}[i]$ is a ring extension of $\mathbb{Z}$. We show that this approach is far from optimal and moreover inverting this established paradigm, that is reducing rational to Gaussian multiplication, leads to faster rational integer multiplication algorithms.
We introduce a novel Toom--Cook framework that reduces rational long integer multiplication to Gaussian integer multiplication, yielding a strictly more efficient computational pipeline. By taking advantage of the special properties of the rational integer domain inside the Gaussian integers, we achieve a more favourable algebraic structure that reduces the overall arithmetic cost in every metric. To validate this theoretical shift, we provide a complete implementation of our algorithm. Benchmarks demonstrate that our approach outperforms the highly optimised GNU Multiple Precision Arithmetic Library (GMP) by up to 29\%, bridging a fundamental theoretical insight with significant practical improvements in high-performance computer algebra.

[289] arXiv:2611.18040 (cross-list from quant-ph) [pdf, html, other]
Title: Hidden Quantum Markov Processes: Mealy Formulation and Observable Reduction
Soueidi El Gheteb, Abdessatar Souissi
Subjects: Quantum Physics (quant-ph); Mathematical Physics (math-ph); Quantum Algebra (math.QA)

We formulate hidden quantum Markov processes in a Mealy architecture using a single completely positive unital transition expectation coupling the present hidden system, the emitted output, and the next hidden system. Together with a boundary state, it generates a quasi-local, finitely correlated hidden--output state; for the commutative generator associated with a classical Mealy kernel, this state is the full joint law of the classical Mealy model.
Moore realizations correspond to transition expectations that factor on the prescribed hidden algebra. We establish a rank obstruction to such factorization and prove its sufficiency for isometric generators: factorization holds exactly when the induced hidden-memory channel has Kraus rank at most the hidden Hilbert-space dimension. The Kraus rank also gives the minimal intermediate Hilbert-space dimension. When the hidden and output dimensions are at least two, the factorizable isometric generators form a closed subset of measure zero.
For any fixed projective readout, a Mealy generator induces an operational hidden quantum Markov model in the sense of Monràs, Beige and Wiesner; conversely, every finite-dimensional operational model admits a Mealy lift on the same memory space with a rank-one readout. For their cluster-state instrument, two isometric, Moore-factorizable lifts with the same instrument and initial memory state yield identical measured output statistics but different quantum output states: one has marginals entangled across $1|2\cdots n$ for $n\geq3$, with three-output negativity $\tfrac12$, whereas the other has fully separable marginals. Thus operational equivalence does not determine output entanglement.

[290] arXiv:2611.18083 (cross-list from astro-ph.EP) [pdf, html, other]
Title: Separability defects in artificial satellite theory: intermediaries, zonal harmonics and secular separatrices
Vladimir Martinusi
Comments: 50 pages, 6 figures, 9 tables. Submitted to Celestial Mechanics and Dynamical Astronomy. Code: this https URL
Subjects: Earth and Planetary Astrophysics (astro-ph.EP); Dynamical Systems (math.DS)

A five-input Poisson-bracket operator, which reproduces the Levi-Civita separability expressions and is cubic in the Hamiltonian, is used as a diagnostic of artificial satellite theory, in a modified polar-nodal chart regular at prograde equatorial orbits. For the general intermediary proposed by the author in 2020, covering those of Sterne, Garfinkel, Brouwer, Aksnes, Cid and Lahulla and Deprit, the linearised defects vanish if and only if the integrability ansatz holds, the condition for additive first-order Hamilton-Jacobi separation in polar-nodal variables. Second-order defects follow in closed form, and the coupling with the nodal pair comes from the dependence on the physical latitude, shared by the zonal term, Aksnes's intermediary and the originals of Sterne and Garfinkel. For every axisymmetric field the radial defect is linear, with a torque form, and the first-order zonal defect is the operator response to the first-order Lie generator, which also gives the second-order mean radial defect per revolution. In its gauge the long-period second-order average is common to intermediaries without latitude terms. Oblate structures with a displaced centre separate the zonal field exactly if and only if its coefficients satisfy the recurrence of Vinti's translated spheroidal potential, and along orbits propagated over 300 periods in the field truncated at $J_4$ they conserve the approximate third integral better than the centred structure, by median factors of 23 to 77. On secular separatrices the integrated defect is the derivative of the Melnikov function, tested in the eccentric Kozai-Lidov problem, and transverse zero sets of the operator define event surfaces.

[291] arXiv:2611.18094 (cross-list from eess.SY) [pdf, html, other]
Title: Controllability-Informed Distributed Electric Propulsion Aircraft Design Using Probabilistic Attainable Moment Sets
Umut Demir, Torbjørn Cunis, Aamir Ahmad, Walter Fichter
Subjects: Systems and Control (eess.SY); Optimization and Control (math.OC)

Integrated aircraft design combines models of aerodynamics, propulsion, mass, and mission performance in one design loop, so that the disciplines can be traded against each other from the earliest stage. For configurations with distributed electric propulsion (DEP), part of the control authority comes from the propulsion system itself, which directly affects the required size of the tail and should therefore be known while the aircraft is being sized. This paper presents a controllability measure that is evaluated for every design in the loop and returned to it as a design signal. The attainable moment set of each candidate design is computed from the surrugate models of the loop and it is compared with a required moment set. Since the low-fidelity surrugate models are uncertain, the comparison is formulated with probabilistic attainable moment sets: the uncertainty is propagated to the boundary of the set, which yields a margin for every direction in the moment space and the probability of violating the requirement. The design loop thereby informed whether a configuration provides sufficient control authority, on which axes it falls short, and how this changes with the design variables. The approach is demonstrated on a DEP regional aircraft, where the signal is used to assess the size of the vertical tail.

[292] arXiv:2611.18095 (cross-list from stat.ML) [pdf, html, other]
Title: Training-point consistency of kernel ridge regression with varying correlation scales
Weiyan Mu, Shifeng Xiong, Yuming Shen
Subjects: Machine Learning (stat.ML); Machine Learning (cs.LG); Statistics Theory (math.ST)

The scale parameter in kernel ridge regression plays a pivotal role in modeling the correlation structure of data. In modern applications, sampling density and the underlying correlation range often change simultaneously, making a fixed-scale assumption highly restrictive. However, establishing asymptotic theories under varying scale parameters is fundamentally challenging. To address this gap, this paper develops a unified theoretical framework for kernel ridge regression under varying scale parameters. We establish that, on uniform tensor grids with product exponential kernels, the consistency of the training-point risk holds if and only if the effective local sample size diverges to infinity. This sharp criterion universally covers all regimes along arbitrary deterministic scale sequences, seamlessly unifying the long-range, fixed-scale, and short-range. Furthermore, we provide an explicit, signal-independent construction of a deterministic regularization penalty that guarantees this consistency. Numerical experiments illustrate the criterion and the corresponding penalty across all the three regimes.

[293] arXiv:2611.18135 (cross-list from quant-ph) [pdf, html, other]
Title: Quantum Preparation without Disturbance: Information Costs and Hypothesis Testing
Pablo Costa Rico, Robert Salzmann, Mario Berta, Ángela Capel
Subjects: Quantum Physics (quant-ph); Mathematical Physics (math-ph)

We determine the minimum information cost of preparing either of two quantum states with one common device while preserving its memory. Measured by the Umegaki relative entropy between the two possible memory states, this minimum is the Belavkin-Staszewski relative entropy of the target states. If the memory may instead be consumed, the minimum is their Umegaki relative entropy. More generally, for any divergence satisfying data processing, memory preservation selects the maximal extension of its classical restriction. We also study the cost of requiring only finitely many outputs, with the costs increasing from Umegaki to Belavkin-Staszewski relative entropy as the number of outputs grows. Finally, we consider hypothesis testing of an unknown device over independent runs. The optimal Stein exponent per run converges to the Belavkin-Staszewski relative entropy whenever the number of outputs per run diverges. This gives an operational characterization of the Belavkin-Staszewski relative entropy in quantum statistics.

[294] arXiv:2611.18148 (cross-list from cs.CE) [pdf, html, other]
Title: Certificate-Based Verification of Pulsed Field Ablation Models
Konstantinos Dovelos
Comments: 18 pages, 5 figures, 7 tables
Subjects: Computational Engineering, Finance, and Science (cs.CE); Numerical Analysis (math.NA); Medical Physics (physics.med-ph)

Computational models of pulsed field ablation predict the lesion as the tissue where the electric field exceeds a lethal threshold. Their numerical error is rarely bounded, and automated pipelines increasingly run them without an expert checking each result. To verify each run, we separate the question "was the stated model solved correctly?" from the solver that answers it. An untrusted solver returns with its answer a certificate, consisting of a potential with the correct electrode and ground values and an exactly charge-conserving current. A small independent checker verifies the certificate against a written specification of the physics. Using the Prager-Synge hypercircle theorem evaluated in ball arithmetic, it turns the certificate into guaranteed two-sided bounds on the impedance and on the root-mean-square field of every tile of a lesion map, also over a range of blood/tissue conductivity ratios. A vectorized version of the checker takes about a tenth of the solve time. For a focal electrode in contact, the tile-resolved depth at 1000 V and 700 V/cm is proven to lie in 3.50-3.75 mm for every ratio from 1.7 to 3.75. For a bipolar catheter, certified depths overlap published in-vivo depths. Where they differ from a published reference model, the certificates prove that the difference is not numerical error in our computation. We compare the certificate with a grid convergence study on the same solver. On graded grids the study is sharper for local fields but remains an estimate. On uniform grids it fails to converge at the electrode edge, where the certificate still gives a valid bracket. Solvers that deliberately solve equations other than the specified ones pass the grid convergence study, but the certificates refute their claims or leave them unsupported.

[295] arXiv:2611.18181 (cross-list from eess.SP) [pdf, html, other]
Title: Linear Dynamic Range Extension for Rydberg Atomic Receiver via Band-Limited Reconstruction
Meng Fang, Lebin Chen, Jun-Rong Chen, Ming-Min Zhao, Bin-Bin Wei
Comments: 6 pages, 7 figures
Subjects: Signal Processing (eess.SP); Information Theory (cs.IT)

Rydberg-atom receiver offers a promising approach to radio-frequency (RF) signal reception in wireless communication and sensing systems, combining high sensitivity with the potential for broad frequency coverage. However, the limited linear dynamic range (LDR) of the atomic system causes nonlinear distortion at high input signal levels, thereby restricting the receiver's effective linear input range. To address this issue, we analyze the mechanisms underlying nonlinear distortion in Rydberg atomic receivers and propose a physics-informed band-limited iterative reconstruction (PI-BLIR) method. Specifically, by exploiting the known nonlinear atomic response and signal bandwidth prior, we formulate a constrained maximum-likelihood problem to reconstruct the distorted complex intermediate-frequency (IF) waveform. With the bandwidth constraint absorbed into the frequency-domain parameterization, the constrained maximum-likelihood problem is transformed into an unconstrained optimization problem, which is solved using gradient descent. The proposed method relies solely on digital post-processing and requires no changes to the local-oscillator (LO) field strength, optical parameters, or atomic operating conditions. Simulation results demonstrate that PI-BLIR extends the receiver's LDR by more than 14 dB and enhances the demodulation performance of the atomic receiver.

[296] arXiv:2611.18192 (cross-list from quant-ph) [pdf, html, other]
Title: Entropic quantum error correction for independent and correlated amplitude damping errors
Gang Zhou
Comments: 59 pages
Subjects: Quantum Physics (quant-ph); Mathematical Physics (math-ph); Operator Algebras (math.OA)

The idea of using quantum entropy for quantum error correction (QEC) has existed for a long time. However, its computational complexity has limited its practical use: even a $[[4,1]]$ code for standard independent amplitude damping errors involves a $256\times 256$ Hermitian matrix, so the approach scales poorly as the codeword length increases. For correlated errors, the situation is even worse. In this paper, we show that, by using the insights developed in our previous paper and exploiting certain structures of quantum conditional mutual information, we can solve these problems exactly by hand, using only $2\times 2$ unitary matrices. By examining the entropy, we identify the leakage channels and the amount of leakage exactly, then define the recovery map accordingly. The rules defining our recovery map are simple, intuitive, and computationally inexpensive: for independent errors, it is based on 16 explicitly given orthonormal vectors and 6 instructions; for correlated errors, it is based on 6 explicitly given orthonormal vectors and 6 instructions. Our method sacrifices little in terms of performance: for the widely used entanglement fidelity, our simple QEC recovery map achieves a sharp result; for the worst-case fidelity, the best result is about $9\%$ better than ours; for correlated errors, there are no comparable results for short codewords. Among the known techniques, our recovery map is the first non-global one. The calculations use elementary linear algebra and calculus, and is presented in great detail.

[297] arXiv:2611.18198 (cross-list from hep-th) [pdf, html, other]
Title: Infinite Index Identities for Argyres-Douglas Theories and Graded Vector Space Isomorphisms for VOAs
Hongliang Jiang
Subjects: High Energy Physics - Theory (hep-th); Mathematical Physics (math-ph); Quantum Algebra (math.QA); Representation Theory (math.RT)

Supersymmetric indices provide stringent tests of dualities between superconformal field theories (SCFTs). We establish infinite families of Schur-index identities among four-dimensional $\mathcal N=2$ Argyres-Douglas (AD) theories, with the logarithms of their fugacities related linearly. These identities connect theories with markedly different physical properties without requiring infrared duality, while still implying simple relations among their central charges and flavor levels. Through the SCFT/VOA correspondence, they become character identities for the associated affine and $W$-algebras. One broad family relates $D_p(G)$ and $(A_{(h+1)(p-1)},G)$ theories, corresponding to affine and principal $W$-algebras at boundary admissible levels. At the level of the underlying state spaces, these character identities suggest that the corresponding VOAs are related by graded vector space isomorphisms, which are weaker than full VOA isomorphisms. We explicitly construct such a graded isomorphism between the VOAs associated with $(A_1,A_{4p-3})$ and $(A_1,D_{2p})$. We also show the correspondence for universal affine and principal $W$-algebras and test its compatibility with their simple quotients by matching the lowest-degree null states. We establish analogous character identities for certain non-vacuum modules in concrete examples and conjecture a broader extension. Finally, beyond the SCFT/VOA correspondence, we discover similar identities between level-one affine and Virasoro algebras, whose further generalizations point toward a new spectral level-rank duality in WZW models.

[298] arXiv:2611.18209 (cross-list from nlin.SI) [pdf, html, other]
Title: Painlevé quadrics and their confluence for the dispersionless Kadomtsev-Petviashvili equation
Benoit Huard Lewis Patterson, Anh-Asma Koheeallee
Subjects: Exactly Solvable and Integrable Systems (nlin.SI); Mathematical Physics (math-ph)

We construct and study a distinguished class of solutions of the dispersionless Kadomtsev--Petviashvili (dKP) equation whose geometry is governed by the first and second Painlevé equations. The level surfaces of these solutions correspond to three geometric families of central quadrics, and we determine when their level surfaces degenerate into planes. In the parabolic family parametrised by $\mathrm{P_I}$, degenerate levels occur at the stationary points of the transcendent. For the hyperbolic family parametrised by rational solutions of $\mathrm{P_{II}}$, we show that degenerate levels occur at points where consecutive solutions intersect and we give a precise count of such degeneracies. In the homogeneous elliptic family, the Hastings--McLeod solution of $\mathrm{P_{II}}$ is characterised, up to sign, as the unique non-trivial real pole-free solution with Airy asymptotics whose quadric has no finite degenerate level. Finally, under critical scaling, the quadrics generated by the $n$-th rational Painlevé-II solution converge locally, and away from poles, to the parabolic quadrics associated with the Painlevé-I tritronquée solution, with error $O(n^{-1/5})$.

[299] arXiv:2611.18221 (cross-list from hep-th) [pdf, html, other]
Title: Destabilization of Abelian-Higgs vortices at large Chern-Simons coupling
Emir Syahreza Fadhilla, Mulyanto, Hadi Susanto, Fiki Taufik Akbar, Bobby Eka Gunara
Comments: 19 pages, 8 figures
Subjects: High Energy Physics - Theory (hep-th); Mathematical Physics (math-ph)

We study the effect of the Chern--Simons (CS) coupling on the radial spectral stability of axially symmetric vortices in the $(2+1)$-dimensional Abelian--Higgs model. From the linear stability approach, we obtain the dispersion relations of gauge field perturbations, which signal the existence of a critical CS coupling $k_{\rm c}$ that depends on Maxwell's coupling constant. For $k<k_{\rm c}$, the continuous spectrum is purely imaginary and the modes remain gapped. At $k=k_{\rm c}$, one of the modes becomes gapless, while for $k>k_{\rm c}$ real eigenvalues appear, corresponding to exponentially growing radial modes. Direct time-evolution simulations are consistent with the spectral analysis, which shows instability for $k>k_{\rm c}$. Below the threshold, the perturbed vortex relaxes toward its stationary profile, whereas above the threshold, growing fluctuations deform the core and propagate outward. These results show that the CS coupling controls radial spectral stability of Abelian-Higgs vortices, and destabilization occurs for sufficiently large CS coupling, relative to the Maxwell coupling.

[300] arXiv:2611.18237 (cross-list from hep-th) [pdf, html, other]
Title: Link invariants in nilpotent group gauge theories
Thomas Nicosanti, Pavel Putrov, Johann Quenta-Raygada
Comments: 61 pages, 11 figures
Subjects: High Energy Physics - Theory (hep-th); Strongly Correlated Electrons (cond-mat.str-el); Mathematical Physics (math-ph); Geometric Topology (math.GT); Quantum Algebra (math.QA)

We consider 3-dimensional topological gauge theories with nilpotent gauge groups, both finite, that is Dijkgraaf-Witten theories, and continuous, that is Chern-Simons theories. Abelian topological quantum field theories are exactly those which do not detect the Borromean rings, and nilpotent gauge groups provide the natural next steps beyond the abelian case. We show that the untwisted Dijkgraaf-Witten theory with gauge group $G$ detects Brunnian links with up to $n+1$ components, but no Brunnian links with more components, if and only if $G$ is $n$-step nilpotent. Moreover, the expectation values of such links are determined by their Milnor invariants. We also study the properties of Chern-Simons theories with nilpotent Lie groups and draw parallels with those of the Dijkgraaf-Witten theories. Finally, we conjecture, using the Lazard correspondence, a relation between expectation values of line operators in the two types of theories, and test it in examples.

[301] arXiv:2611.18239 (cross-list from cs.LG) [pdf, html, other]
Title: Neural Classifiers as Error-Correcting Codes
Sergey Salishev, Anton Makarov, Oleg Granichin, Renata Avros, Zeev Volkovich
Comments: 40 pages, 6 figures. Submitted version. Published in Information Sciences 766 (2027) 124394
Journal-ref: Information Sciences 766 (2027) 124394
Subjects: Machine Learning (cs.LG); Information Theory (cs.IT)

A unified framework is proposed that characterizes supervised deep classification as the decoding of error-correcting codes in the Shannon sense. Cross-entropy optimization is shown to align softmax classifiers with maximum-likelihood decoding, where logits map to Hamming distances to class-specific codewords. This correspondence explains the emergence of standard divergence objectives (e.g., Kullback-Leibler, Jeffreys) and provides a geometric basis for the stability of decision boundaries. Furthermore, the geometries of Neural Collapse and LeJEPA are identified as optimal constellations for decoding under isotropic noise. Unlike classical Error-Correcting Output Codes, deep networks are shown to learn effective codebooks in the feature space implicitly. This insight is leveraged to derive novel criteria for lossless quantization, improved knowledge distillation, and architectural regularization based on code redundancy. Finally, this perspective is extended to self-supervised encoders, offering a cohesive explanation for the geometry of latent representations in modern neural models.

[302] arXiv:2611.18249 (cross-list from quant-ph) [pdf, html, other]
Title: Fer expansion converges almost twice as far as Magnus for qubits
Lorenzo Bagnasacco, Vittorio Giovannetti
Comments: 11 pages, 6 figures
Subjects: Quantum Physics (quant-ph); Mathematical Physics (math-ph)

The Fer expansion writes the propagator of a time-dependent Hamiltonian as a product of unitary exponentials whose error decreases doubly exponentially with the number of factors, while the Magnus expansion improves by one order at a time. Its convergence, however, was guaranteed only below a radius of about $2.6058$, smaller than the Magnus radius $\pi$. We establish a guaranteed convergence threshold of about $6.2106$, or $1.98\,\pi$, for a qubit. This is almost twice the optimal universal Magnus threshold $\pi$; the bound on a single Fer step is sharp, while the exact convergence radius remains open.

[303] arXiv:2611.18252 (cross-list from cs.LG) [pdf, html, other]
Title: ParetoM$^3$: Learning on the Pareto Set under Preference Guidance via Min-Max-Min Optimization
Pei Tang, Songtao Lu
Comments: Accepted at the 40th Annual Conference on Neural Information Processing Systems (NeurIPS 2026)
Subjects: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Optimization and Control (math.OC)

Learning across multiple inherently conflicting objectives requires selecting desirable trade-offs from the Pareto set. In this work, we study preference-guided multi-objective optimization, where a predefined preference function is minimized over the weak Pareto set of multiple nonconvex objectives. Leveraging a merit function that vanishes on the weak Pareto set, we propose a penalty-based min-max-min formulation, termed the M$^3$ problem, which unifies preference optimization and the enforcement of weak Pareto optimality in a single objective. We further develop ParetoM$^3$, a single-loop first-order algorithm for computing stationary solutions of the resulting M$^3$ problem. Under a local Kurdyka-Lojasiewicz assumption, we prove that ParetoM$^3$ finds an $\epsilon$-stationary point of the M$^3$ problem that is also approximately weakly Pareto optimal for the original multi-objective problem when the penalty parameter is sufficiently large, with explicit non-asymptotic convergence rates. We also show that this stationarity notion recovers existing optimality criteria, including approximate preference stationarity and approximate Karush-Kuhn-Tucker conditions, under the same assumptions used in prior works. Experiments on a synthetic benchmark, image classification, regression, and math reasoning demonstrate that ParetoM$^3$ reliably attains preferred weak Pareto optimal solutions while achieving strong practical performance. Code is available at this https URL.

[304] arXiv:2611.18270 (cross-list from cond-mat.stat-mech) [pdf, html, other]
Title: Real-Space-RG for the drawups and drawdowns of run-and-tumble trajectories: universality classes for models with space-dependent velocities and switching rates
Cecile Monthus
Comments: 25 pages
Subjects: Statistical Mechanics (cond-mat.stat-mech); Probability (math.PR)

For one-dimensional run-and-tumble processes with the two velocities $v_{\pm}(x)$ and the two switching rates $\gamma_{\pm}(x)$, a given stochastic trajectory is an alternating sequence of local minima and local maxima corresponding to the switching events between the ballistic motions with velocities $v_{\pm}(x) $ in the two directions. The renormalized trajectory at scale $\Gamma$ is obtained by keeping only the alternating sequence of local minima and local maxima that are separated by drawups and drawdowns of amplitude bigger than $\Gamma$. Its statistical properties can be analyzed via the generalization of the previous work arXiv:2611.04853 concerning diffusion processes involving arbitrary diffusion coefficients $D(x)$ and Ito forces $F_I(x)$. The main result is that the scale function $s(x)$ of diffusion processes that depends only on the ratio $\frac{F_I(x)}{D(x) } $ is replaced by a pair of scale functions $s_{\pm}(x)$ that depend only on the two ratios $\frac{\gamma_+( x ) }{v_+( x )}$ and $\frac{\gamma_-( x ) }{v_-( x )}$. This pair of scale functions $s_{\pm}(x)$ govern the exit probabilities from an interval and determine the universality classes of the renormalized trajectories: all run-and-tumble processes with the same two ratios $\frac{\gamma_+( x ) }{v_+( x )}$ and $\frac{\gamma_-( x ) }{v_-( x )}$ share the same statistics of renormalized trajectories. This general framework is illustrated with examples that are compared to their diffusive counterparts : uniform symmetric and asymmetric processes on the whole line $x \in]-\infty,+\infty[$, geometric process on the half-line $x \in]0,+\infty[$, and an exponential functional of the telegraph process with a normalizable steady state.

[305] arXiv:2611.18313 (cross-list from eess.SY) [pdf, html, other]
Title: Hierarchical Interactions in Mobility Networks: A Model-Free Feedback Approach
Mingjia He, Zhiyu He, Jan Ghadamian, Florian Dörfler, Emilio Frazzoli, Gioele Zardini
Comments: 12 pages
Subjects: Systems and Control (eess.SY); Optimization and Control (math.OC)

Urban mobility systems are large-scale networked systems whose performance emerges from hierarchically coupled decisions of public authorities, competing mobility operators, and travelers. Existing approaches to policy design either collapse one of these levels or assume that the authority can model and differentiate through the equilibrium responses of operators and travelers. In this paper, we model policy design as a tri-level game on a multimodal network, in which a municipality sets taxes, licenses, and integration subsidies, a public transport and a taxi operator compete on prices and service supply, and heterogeneous travelers reach a stochastic user equilibrium. We prove that the traveler equilibrium is unique and continuously differentiable in the operator strategies, that the variational inequality characterizing operator equilibria admits a solution for every policy, and that the resulting tri-level game admits a Stackelberg equilibrium. Building on this structure, we design a model-free hierarchical controller in which the municipality and the operators update their decisions from zeroth-order evaluations of observed equilibrium outcomes. On the Zurich multimodal network, operator equilibria computed from different initializations differ by a median of 0.3% in the municipal objective. On a grid of 3,125 policies, only those that subsidize transfers between public transport and taxis benefit both operators, and 24 of them also lower travel costs without degrading the municipal objective. Finally, the controller matches the best policies of three black-box optimizers and terminates at the most consistent policies across runs.

[306] arXiv:2611.18343 (cross-list from physics.flu-dyn) [pdf, html, other]
Title: Potential Flow, Stress, and Straightness in Flow Matching: Euler Error on Gaussian-Mixture Targets
Zijian Liu, Julian Olszewski, Jie Xu
Comments: 39 pages, 4 figures, includes supplementary material
Subjects: Fluid Dynamics (physics.flu-dyn); Mathematical Physics (math-ph); Computational Physics (physics.comp-ph)

In linear flow matching, coupling straightness measures conditional displacement variance. The conditional covariance gives a kinetic stress in the Jeans balance. The virial identity relates the mean trace of the covariance to a radial moment of acceleration. Euler error also depends on how the flow propagates acceleration. On constructed Gaussian-mixture targets, closed-form couplings with matched straightness yield different median Euler errors. Learned fields from fresh minibatch assignments also yield different Euler errors from their partners at matched estimated straightness. The leading Euler coefficient accounts for more of the error variation than straightness in these experiments. We relate the additive-noise characterization of isotropic Gaussian sources to potential flow. A gradient constraint reduces velocity error on the independent isotropic Gaussian example and increases it on two examples with rotational exact fields.

[307] arXiv:2611.18373 (cross-list from cond-mat.dis-nn) [pdf, html, other]
Title: Guerra Interpolation and Optimal Transport: Kantorovich Bounds, Brenier Maps and the Replicon
Elena Agliari, Adriano Barra, Andrea Ladiana, Andrea Lepre, Diego Pallara
Subjects: Disordered Systems and Neural Networks (cond-mat.dis-nn); Analysis of PDEs (math.AP); Probability (math.PR)

Since Guerra's work, mean-field spin glasses have been studied through Hamilton--Jacobi equations. Here, using the Curie--Weiss and the Sherrington--Kirkpatrick models as prototypical examples, we show that his celebrated interpolation method is itself an optimal transport computation.
After a linear change of variables the finite-$N$ pressure becomes an action $u$ with $\partial_t u = -A/2$ and $\partial_x u = -B$, where $B^2 \le A$, so $u$ is a classical subsolution of $\partial_t u+\frac12(\partial_x u)^2 \le 0$. Integrating along a straight segment gives Guerra's sum rule, and dropping its remainder makes $u(0,\cdot)$ and $u(t,\cdot)$ an admissible pair for the dual Kantorovich problem with quadratic cost. For the Curie--Weiss model and $t > 0$, $T_t(y) = y-t\tanh y$ is an optimal transport map from every source with finite first moment if and only if $t \le 1$, and the Kantorovich potentials are the limiting pressures. For the replica-symmetric Sherrington--Kirkpatrick model, the cavity map is injective on the physical half-line and the curvature of its Brenier potential is the longitudinal eigenvalue, which exceeds the replicon eigenvalue $\Lambda_{\mathrm{AT}}$: transport of Dirac masses does not detect the de Almeida--Thouless line. The replicon appears along the $\mathcal{W}_2$ geodesic that splits a Dirac mass into two atoms, as the second variation of a second-order surrogate of the two-atom Parisi functional. From a Dirac initial datum, Guerra's $K$-step bound takes Hopf--Lax form, and the Parisi formula becomes a Hopf--Lax formula over atomic measures. With a $\mathcal{W}_1$-Lipschitz bound for its initial datum, proved by comparing Cole--Hopf layers, we let $K\to\infty$ and recover at Dirac data the Hopf--Lax form of the Parisi formula due to Mourrat and to Mourrat and Panchenko, with a rate for equal-mass approximations.

[308] arXiv:2611.18391 (cross-list from cs.DM) [pdf, other]
Title: Color Refinement Distinguishes Connected Rooted Outerplanar Graphs
Louann Coste (DI-ENS), M{ó}nika Csik{ó}s (IRIF (UMR\_8243)), Laurent Viennot (DI-ENS, ARGO)
Subjects: Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS); Combinatorics (math.CO)

Color refinement, also known as the $1$-dimensional Weisfeiler-Leman algorithm ($1$-WL), is a classical near-linear-time heuristic for graph isomorphism, which also captures the expressive power of message-passing graph neural networks. A long line of work asks on which graph classes $1$-WL, or its higher-dimensional variant $k$-WL, identifies every graph; the least such $k$ is the WL-dimension of the class. Planar graphs have WL-dimension at most $3$ (Kiefer, Ponomarenko and Schweitzer, 2019), and whether $2$-WL already distinguishes all planar graphs is a central open problem. We bring new insight on this question for outerplanar graphs, whose WL-dimension is $2$. We show that color refinement, i.e. 1-WL, distinguishes connected rooted outerplanar graphs: two non-isomorphic such graphs receive different stable colorings once a single vertex, the root, is individualized. The root is necessary, as there are non-isomorphic $2$-connected outerplanar graphs that color refinement does not distinguish. Our result extends to pseudo-rooted graphs, in which the stable coloring merely contains a singleton color class, and to non-connected graphs whose components all contain such a class. Consequently, the $(1,1)$-WL test of Rattan and Seppelt (2023) distinguishes all outerplanar graphs. We proceed by inversion: we reconstruct a connected rooted outerplanar graph, up to isomorphism, from its color graph, the weighted quotient of the graph by its stable color classes, together with its root color. The reconstruction runs in time linear in the output size and is canonical, which yields a near-linear-time canonization algorithm for these graphs. Our main tool is a dichotomy lemma, formalized in Rocq: in a rooted outerplanar graph with an equitable coloring, every block either receives pairwise distinct colors or admits a color-preserving mirror symmetry fixing its vertex closest to the root.

[309] arXiv:2611.18447 (cross-list from quant-ph) [pdf, html, other]
Title: Nesting in additive manufacturing using quantum annealing
Xiangqian Wu, Jannik Gayer, Marcel Wagner, Jan C. Aurich
Subjects: Quantum Physics (quant-ph); Optimization and Control (math.OC)

Nesting in powder bed fusion (PBF), an additive manufacturing (AM) process, determines the positions and orientations of parts within the build space and influences build height and build time. As the number of parts and feasible placements increases, the nesting problem becomes computationally demanding. Exact approaches are limited to small problem sizes as computational effort increases rapidly with the problem size, while heuristic and metaheuristic approaches involve a trade-off between solution quality and computation time. Quantum annealing (QA) offers an alternative for solving combinatorial optimization problems, but its application to nesting in AM remains largely unexplored. This paper presents a QA-based approach for nesting in AM to investigate its feasibility and its scaling behavior across three problem sizes. An iterative binary quadratic model based approach (IBQM) is developed to minimize build height while considering the geometric characteristics of AM parts. Geometric abstraction, iterative decomposition, and variable pruning are applied to address the computational complexity of the nesting problem. The approach is evaluated using three cases with increasing problem sizes and compared to a classical approach combining tabu search and simulated annealing (TBSA). Compared with TBSA, IBQM reduces the build height of the original parts by up to 13.32% and the computation time by up to 74.27%.

[310] arXiv:2611.18448 (cross-list from quant-ph) [pdf, html, other]
Title: Learning observable propagation with sparse local moments
Yuehaw Khoo, Bowen Li, Yuguan Wang, Siyao Yang
Comments: 33 pages, 16 figures
Subjects: Quantum Physics (quant-ph); Numerical Analysis (math.NA)

We propose a unified framework for predicting local moment dynamics in high-dimensional many-body systems from short-time trajectories. Thanks to the locality of the dynamics, we construct the transition moment matrices by projecting the Markov operator onto low-order connected-cluster basis functions supported near the target observable. Exploiting the spatial decay of time-lagged correlations, {these matrices} can be approximated in sparse-plus-low-rank form using trajectory samples, with computational cost scaling linearly in the system dimension and the number of trajectories. The learning error can be further reduced by correcting the memory effect induced by the Galerkin projection. We numerically demonstrate the effectiveness of the framework in extrapolating the dynamics of various many-body systems, including Langevin and Glauber dynamics for classical systems as well as Lindblad dynamics for open quantum systems. In addition, for a class of single-site Glauber dynamics, we establish error bounds for sparse-plus-low-rank compression and uniform-in-time bounds for connected-cluster approximation and observable propagation with compressed transition moment matrices.

[311] arXiv:2611.18455 (cross-list from stat.ML) [pdf, html, other]
Title: Mesh-Free Weak-Form Regression for Learning Interaction Kernels from Particle Trajectories
Daisuke Inoue, Dante Kalise
Comments: 47 pages, 8 figures
Subjects: Machine Learning (stat.ML); Optimization and Control (math.OC)

We propose mesh-free weak-form regression for learning interaction kernels from noisy particle trajectories. Our method uses smooth test functions to avoid differentiating noisy data and empirical particle averages to avoid density reconstruction and spatial grids. We then fit sparse combinations of candidate functions, evaluating interaction terms on sampled particle pairs to avoid all-pair quadratic cost. By transferring identifiability from the mean-field limit, we prove high-probability coefficient error bounds that separate finite-particle, time-discretization, observation-noise, and pair-sampling errors, without grid-resolution or density-estimation terms. We evaluate one-dimensional (1D) Newtonian-repulsion, 2D predator-prey, and 10D distance-localized experiments. The numerical results show trends consistent with the theoretical coefficient-error bounds. Comparisons of weak and forward-difference formulations with LASSO, Ridge, and OLS show that weak LASSO gives the smallest coefficient and drift errors in the three nominal experiments.

[312] arXiv:2611.18480 (cross-list from stat.ML) [pdf, html, other]
Title: Bregman geometry in regular exponential families: dual representations and relative smoothness
Mame Diarra Fall, Éric Barat, Nicolas Dobigeon
Subjects: Machine Learning (stat.ML); Machine Learning (cs.LG); Optimization and Control (math.OC)

Regular exponential-family distributions are ubiquitous in statistics due to their appealing and convenient properties. Notably, they can be expressed in terms of Bregman divergences, revealing fundamental connections between statistics, convex analysis, and information geometry. However, this geometric structure has not been systematically exploited to characterize these distributions with respect to their expectation parametrization. Building on a projective characterization, we establish a general construction of equivalent dual Bregman representations, together with normalization and uniqueness results. These representations express log-densities as ordinary Bregman divergences in dual coordinate systems, providing geometric characterizations of the parameter space. So-called $\beta$- and $\alpha$-scaled dual representations emerge as particular instances of this framework. We further derive dual Bregman representations of conjugate priors and establish that they preserve conjugacy. Applications to classical distributions illustrate the geometric structures underlying seemingly different statistical models. Moreover, we show that these representations provide natural reference geometries for establishing relative smoothness of the primal Bregman representation of the distribution, with explicit bounds that are sharp in the scalar and separable settings. An illustrative application to the Poisson distribution sheds new light on several works in the literature, providing complementary geometric justifications for reference geometries while deriving existing algorithms.

[313] arXiv:2611.18502 (cross-list from eess.SY) [pdf, html, other]
Title: EPIGRIDS: Documentation and Validation of Seven Open Synthetic Transmission Grid Cases
Jonathan M. Snodgrass, Scott Greene, Thomas J. Overbye, Christopher L. DeMarco, Bernard C. Lesieutre
Comments: 10 pages, 2 figures, 6 tables. Submitted to the IEEE Open Access Journal of Power and Energy. Cases: this https URL load series: this https URL construction method: arXiv:2611.16222
Subjects: Systems and Control (eess.SY); Optimization and Control (math.OC)

This paper documents and checks EPIGRIDS, seven open synthetic transmission grid cases from four independently built networks, made with an optimization-based construction method instead of the graph-statistics method behind most large public synthetic grids. The cases range from 250 to 78,484 buses, with geolocated substations, voltages up to 765 kV, and line parameters taken from conductor data. Each ships under an open license in three common power flow formats that agree at the solved operating point, and the six larger cases have a companion hourly, bus-level load series for one year. The Texas, Florida, and Michigan, Ohio, and Indiana cases are sub-networks of the Eastern case. Every case solves an alternating-current power flow from its stored operating point. With parallel circuits merged, the Eastern and Western cases are 9 and 16% denser than the real interconnections, while graph-statistics cases on the same footprints lie within 6% and meet more published realism criteria. A full single-outage contingency analysis completes on every case, and in an optimal power flow benchmark every case except the New England base case and one of its 12 operating points solves in polar form.

[314] arXiv:2611.18511 (cross-list from cs.LG) [pdf, html, other]
Title: On numerical issues of divergences between nearly equal distributions
Brandon Amos
Subjects: Machine Learning (cs.LG); Numerical Analysis (math.NA); Machine Learning (stat.ML)

Barron et al. (2026) recently identified numerical issues in the softmax and soft cross-entropy loss. We show that similar issues are present in standard divergence operations between categorical distributions. This includes the forward and reverse Kullback-Leibler (KL) divergence and generalized Jensen-Shannon divergence (JSD), as well as Monte Carlo KL estimates and entropy. When the distributions are nearly equal, rounding and cancellation issues affect the forward and gradient computations. These issues can affect settings using divergences in optimization objectives, such as knowledge distillation, reinforcement learning, and proximal methods. We propose numerically stable reformulations and provide example implementations for each setting, validated by property-based tests.

[315] arXiv:2611.18539 (cross-list from hep-th) [pdf, html, other]
Title: Geometric Quantization of the Giant Graviton Master Moduli Space
Kasia Budzik, Davide Gaiotto
Comments: 37+21 pages
Subjects: High Energy Physics - Theory (hep-th); Mathematical Physics (math-ph)

We describe a remarkable reorganization of the space of gauge invariant operators of free or twisted $U(N)$ gauge theories as combinations of single-trace and determinant operators modulo certain "open loop equations". The reorganization has a transparent holographic interpretation, describing how states at finite $N$ can be reproduced by imposing certain $N$-independent gauge constraints on the combination of the closed strings Fock space and a geometric quantization of the moduli space of Giant Graviton D-branes, with quantization parameter $N^{-1}$. The moduli space of Giant Graviton D-branes is reproduced from tachyon condensation of auxiliary D-brane/anti-D-brane pairs which are "Koszul dual" to the D-brane system which supports the original gauge theory. We describe how to impose the open loop equations via certain BRST complexes and conjecture that their homology recovers the finite $N$ BPS Hilbert space in the limit of large auxiliary rank. The BRST construction conjecturally categorifies Murthy's Giant Graviton Expansion of indices counting $U(N)$-invariant BPS operators.

[316] arXiv:2611.18545 (cross-list from cs.DS) [pdf, html, other]
Title: From smoothed analysis to backward error: The power of adaptive perturbations
Michał Dereziński, Michael W. Mahoney, Raphael A. Meyer, Christopher Musco
Subjects: Data Structures and Algorithms (cs.DS); Numerical Analysis (math.NA)

Smoothed analysis has become a central tool in theoretical computer science, often allowing for significant improvements to worst-case running times if we settle for a solution to a small random perturbation of the problem instance. This is closely related to the classical concept of backward error in numerical analysis, which allows an algorithm to return a solution to an arbitrary perturbation of the problem.
Despite the qualitative similarity of these concepts, we show that they can exhibit large quantitative differences. Notably, we prove that, while a linear system with any $n \times n$ matrix $A$ can be solved to backward error $\epsilon$ using $O(\log(n) / \epsilon)$ matrix-vector products with $A$, any algorithm that solves a random $\epsilon$-sized perturbation of $A$ requires $\Omega(n)$ matrix-vector products. This means that a useful perturbation for solving a linear system in backward error must be adaptive to the input. Interestingly, however, randomness is still essential: we show that any deterministic method that attains small backward error for all linear systems provably requires $\Omega(n)$ matrix-vector products, resulting in the first separation between randomized and deterministic algorithms in a natural computational model for solving linear systems. Finally, we show that matrix structure can significantly affect backward error complexity. For example, we show a deterministic $O(1/\epsilon)$ matrix-vector product algorithm for symmetric linear systems.

[317] arXiv:2611.18548 (cross-list from stat.CO) [pdf, html, other]
Title: Limitations of nonreversible lifts for subgeometric diffusions
Mengxi Gao, Gareth O. Roberts, Andi Q. Wang
Comments: 20 pages, 1 figure
Subjects: Computation (stat.CO); Probability (math.PR)

We study the effect of lifting on continuous-time Markov processes with potentially subgeometric convergence rates. Using a series of weak Poincaré-type inequalities, we derive a bound on the maximum acceleration that can be obtained through lifting. We present several examples to explore the sharpness of our derived bound, where the resulting bound has the same square-root order as in the spectral gap setting. Our results provide a framework for understanding the potential and limitations of non-reversible lifting beyond geometric convergence.

[318] arXiv:2611.18556 (cross-list from hep-th) [pdf, html, other]
Title: From pure spinor modules to superspace superfields
Ondrej Hulik, Raphael Senghaas
Comments: 38 pages
Subjects: High Energy Physics - Theory (hep-th); Mathematical Physics (math-ph)

We relate the pure spinor formalism to the superspace description of constrained superfields and gauge multiplets, mainly for abelian two-dimensional N=(2,2) supersymmetry, with three- and four-dimensional N=1 examples for comparison. For each multiplet we give an explicit module over the supertranslation Chevalley-Eilenberg algebra and match its reconstruction with the known superfields. First-order constraints come from modules supported on linear subspaces of the nilpotence variety, and higher-order ones, such as the complex-linear constraint, from Yoneda products of their Ext classes. Requiring a connection to act on given matter and its conjugate restricts its curvature, which yields the ordinary, twisted and semichiral vector multiplets with their field strengths. The module of each vector multiplet is the fiber product over the origin of the coordinate rings of the matter supports: its potentials are differences of partial potentials, and its gauge parameters are the matter superfields. For the large vector multiplet this fiber product is not a quotient of the pure spinor ring; its field strengths are four odd semichiral superfields, and partial regluing gives its constrained versions.

Replacement submissions (showing 236 of 236 entries)

[319] arXiv:1701.08233 (replaced) [pdf, html, other]
Title: The variety of $2$-dimensional algebras over an algebraically closed field
Ivan Kaygorodov, Yury Volkov
Comments: Corrected version verified by Lean
Journal-ref: I.~Kaygorodov, Yu.~Volkov, The variety of $2$-dimensional algebras over an algebraically closed field, Canad. J. Math. 71 (2019), no.~4, 819--842
Subjects: Rings and Algebras (math.RA)

The work is devoted to the variety of $2$-dimensional algebras over an algebraically closed field. Firstly, we classify such algebras modulo isomorphism. Then we describe the degenerations and the closures of principal algebra series in the variety under consideration. Finally, we apply our results to obtain analogous descriptions for the subvarieties of flexible and bicommutative algebras. In particular, we describe rigid algebras and irreducible components for these subvarieties.

[320] arXiv:1703.05146 (replaced) [pdf, html, other]
Title: Periodic orbits 1-5 of quadratic polynomials on a new coordinate plane
Pekka Kosunen
Subjects: Dynamical Systems (math.DS)

While iterating the quadratic polynomial f_{c}(x)=x^{2}+c the degree of the iterates grows very rapidly, and therefore solving the equations corresponding to periodic orbits becomes very difficult even for periodic orbits with a low period. In this work we present a new iteration model by introducing a change of variables into an (u,v)-plane, which changes situation drastically. As an excellent example of this we can compare equations of orbits period four on (x,c)- and (u,v)-planes. In the latter case, this equation is of degree two with respect to u and it can be solved explicitly. In former case the corresponding equation ((((x^{2}+c)^{2}+c)^{2}+c)^{2}+c-x)/((x^{2}+c)^{2}+c-x)=0 is of degree 12 and it is thus much more difficult to solve.

[321] arXiv:1809.09517 (replaced) [pdf, html, other]
Title: Time Relaxation with Iterative Modified Lavrentiev Regularization
Ming Zhong
Subjects: Numerical Analysis (math.NA)

We study a time relaxation regularization of the Navier--Stokes equations, \[u_t+u\cdot\nabla u+\nabla p-\nu\Delta u+\tfrac{\chi}{\delta}(u-D_N\bar u)=f,\] in which $\bar u$ is the differential filter of radius $\delta$ applied to $u$ and $D_N$ is the iterated modified Lavrentiev deconvolution operator with regularization parameter $\alpha$. We first show that the relaxation term has a simple closed form: it is a filtered hyperviscosity, $\nu_N(-\Delta)^{N+1}G_{\sqrt\alpha\delta}^{N+1}u$ with $\nu_N=\chi\alpha^{N+1}\delta^{2N+1}$, where $G_{\sqrt\alpha\delta}$ is the differential filter of the smaller radius $\sqrt\alpha\,\delta$. From this we obtain sharp consistency bounds, the existence of weak solutions with an energy inequality, and an explicit estimate showing that the energy in scales below any given length is $O(\delta/\chi)$ as $\chi\to\infty$. Extending a result of Pakzad for van Cittert deconvolution, we bound the time-averaged energy dissipation rate by $\frac{U^3}{\ell}\big(1+\Rey^{-1}+\Rey_N^{-1}\big)$, where $\Rey_N=UL^{2N+1}/\nu_N$ is the relaxation Reynolds number. We then develop a K41-type similarity theory. The model's micro-scale solves an explicit scalar equation, which has no solution below a threshold value of $\chi$ and two solutions above it; the larger one is the cut-off scale. Requiring the micro-scale to equal the filter radius gives the scaling $\chi\simeq U(\delta/L)^{1/3}(1+1/\alpha)^{N+1}$, for which the consistency error of the relaxation term is $O(\delta^{2N+4/3})$ uniformly in $\alpha$.

[322] arXiv:1902.01706 (replaced) [pdf, html, other]
Title: The algebraic and geometric classification of nilpotent binary Lie algebras
Hani Abdelwahab, Antonio Jesús Calderón, Ivan Kaygorodov
Comments: Corrected version
Journal-ref: H. Abdelwahab, A. J. Calder\'on, I. Kaygorodov, The algebraic and geometric classification of nilpotent binary Lie algebras, International Journal of Algebra and Computation, 29 (2019), no.~6, 1113--1129
Subjects: Rings and Algebras (math.RA)

The paper is devoted to give the complete algebraic classification of nilpotent binary Lie algebras of dimension $\leq 6$ over an arbitrary base field ${\mathbb{F}}$ of characteristic not $2$ and the complete geometric classification of nilpotent binary Lie algebras of dimension $6$ over $\mathbb C.$ As an application, we have the algebraic and geometric classification of nilpotent anticommutative $\mathfrak{CD}$-algebras of dimension $\leq 6.$

[323] arXiv:1911.04717 (replaced) [pdf, html, other]
Title: Holomorphic vector fields and rationality
Wenchuan Hu, Peihan Wu
Comments: 17 pages. The proof of the main result is corrected. Comments are welcome!
Subjects: Algebraic Geometry (math.AG); Differential Geometry (math.DG)

We prove Carrell's conjecture that a smooth complex projective variety with a holomorphic vector field having a nonempty finite zero set is rational. The proof uses slices for projective additive group actions and a birational invariant in the dimension-graded Grothendieck ring. For a vector field with one zero, we bound the second Betti number by the dimension of the kernel of the linear part at that zero. A multiplicative group that normalizes the additive action with a nontrivial character gives a product formula for the Betti numbers and a sharp upper bound for the Euler characteristic. We classify smooth projective surfaces admitting a holomorphic vector field with exactly one zero. Among smooth projective threefolds of Picard number one admitting a holomorphic vector field with exactly one zero, there are five isomorphism types.

[324] arXiv:2003.01453 (replaced) [pdf, html, other]
Title: A Note on Decomposable and Reducible Integer Matrices
Carlos Marijuán, Ignacio Ojeda, Alberto Vigneron-Tenorio
Comments: 11 pages. Published in Symmetry. Minor corrections and clarifications to the published version
Journal-ref: Symmetry 2021, 13(7), 1125
Subjects: Combinatorics (math.CO)

We propose necessary and sufficient conditions for an integer matrix to be decomposable in terms of its Hermite normal form. Specifically, to each integer matrix, we associate a symmetric integer matrix whose reducibility can be efficiently determined by elementary linear algebra techniques, and which completely determines the decomposability of the first one.

[325] arXiv:2101.07652 (replaced) [pdf, html, other]
Title: Cohomology and Deformation of Leibniz Superalgebras
RB Yadav, Arpan Sharma
Subjects: Rings and Algebras (math.RA)

In this article, we give a characterization of Leibniz superalgebras. We study cohomology theory of Leibniz superalgebras. Using the cohomology we study the formal deformation theory of Leibniz superalgebras. We do some cohomology computation in lower dimensions. We establish a one to one correspondence between extensions of a Leibniz superalgebra and its cohomology group in dimension 2.

[326] arXiv:2102.00361 (replaced) [pdf, html, other]
Title: Convergence in Wasserstein Distance for Empirical Measures of Semilinear SPDEs
Feng-Yu Wang
Comments: 16 pages
Journal-ref: Annals of Applied Probability 2023
Subjects: Probability (math.PR)

The convergence rate in Wasserstein distance is estimated for the empirical measures of symmetric semilinear SPDEs. Unlike in the finite-dimensional case that the convergence is of algebraic order in time, in the present situation the convergence is of log order with a power given by eigenvalues of the underlying linear operator.

[327] arXiv:2109.07853 (replaced) [pdf, html, other]
Title: Rational Solutions of Abel Differential Equations
J.L. Bravo, L.A. Calderón, M. Fernández, I. Ojeda
Comments: 19 pages. Published in Journal of Mathematical Analysis and Applications
Journal-ref: Journal of Mathematical Analysis and Applications 515 (2022), 126368
Subjects: Classical Analysis and ODEs (math.CA)

We study the rational solutions of the Abel equation $x'=A(t)x^3+B(t)x^2$ where $A$ and $B \in \mathbb{C}[t]$. We prove that if $°(A)$ is even or $°(B)>(°(A)-1)/2$ then the equation has at most two rational solutions. For any other case, an upper bound on the number of rational solutions is obtained. Moreover, we prove that if there are more than $(°(A)+1)/2$ rational solutions then the equation admits a Darboux first integral.

[328] arXiv:2111.03714 (replaced) [pdf, html, other]
Title: Minimal Systems of Binomial Generators for the Ideals of Certain Monomial Curves
Manuel B. Branco, Isabel Colaço, Ignacio Ojeda
Comments: 11 pages. Published in Mathematics
Journal-ref: Mathematics 9 (2021), no. 24, 3204
Subjects: Commutative Algebra (math.AC); Group Theory (math.GR)

Let $a, b$ and $n > 1$ be three positive integers such that $a$ and $\sum_{j=0}^{n-1} b^j$ are relatively prime. In this paper, we prove that the toric ideal $I$ associated to the submonoid of $\mathbb{N}$ generated by $\{\sum_{j=0}^{n-1} b^j\} \cup \{\sum_{j=0}^{n-1} b^j + a\, \sum_{j=0}^{i-2} b^j \mid i = 2, \ldots, n\}$ is determinantal. Moreover, we prove that for $n > 3$, the ideal $I$ has a unique minimal system of generators if and only if $a < b-1$.

[329] arXiv:2202.01584 (replaced) [pdf, html, other]
Title: The extremal process of a cascading family of branching Brownian motion
Mohamed Ali Belloum
Comments: 22 pages
Subjects: Probability (math.PR)

We study the asymptotic behaviour of the extremal process of a cascading family of branching Brownian motions. This is a particle system on the real line such that each particle has a type in addition to his position. Particles of type $1$ move on the real line according to Brownian motions and branch at rate $1$ into two children of type $1$. Furthermore, at rate $\alpha$, they give birth to children too of type $2$. Particles of type $2$ move according to standard Brownian motion and branch at rate $1$, but cannot give birth to descendants of type $1$. We obtain the asymptotic behaviour of the extremal process of particles of type $2$.

[330] arXiv:2210.13072 (replaced) [pdf, html, other]
Title: Demystifying the characterization of SDP matrices in mathematical programming
Daniel Porumbel
Comments: 100 pages
Subjects: Optimization and Control (math.OC)

This manuscript was written because I found no other introduction to SDP programming that targets the same audience. A first difference compared to other existing introductions to SDP is that this work comes out of a mind that was itself struggling to understand. This may seem to be only a weakness, but, paradoxically, it is both a weakness and a strength. First, I did not try to overpower the reader, but I tried to minimize the distance between the author and the reader as much as possible, even hoping to achieve a small level of mutual empathy. This enabled me avoid a quite common pitfall: many long-acknowledged experts tend to forget the difficulties of beginners. Other experts try to make all proofs as short as possible and to dismiss as unimportant certain key results they have seen thousands of time in their career. I also avoided this, even if I did shorten a few proofs when I revised this manuscript two years after it was first written. However, I also kept certain proofs that seem longer than necessary because I feel they offer more insight; an important goal is to capture the "spirit" of each proven result instead of reducing it to a flow of formulae.
The very first key step towards mastering SDP programming is to get full insight into the eigen-decomposition of real symmetric matrices. It is enough to see the way many other introductions to SDP programming address this eigen-decomposition to understand that their target audience is different from mine. They often list the eigen-decomposition without proof, while I give two proofs to really familiarize the reader with it.

[331] arXiv:2211.03997 (replaced) [pdf, html, other]
Title: Online Nonconvex Decision Making with Approximate Oracles
Rui Chen, Oktay Gunluk, Andrea Lodi, Guanyi Wang
Subjects: Optimization and Control (math.OC); Data Structures and Algorithms (cs.DS)

We study online decision making with possibly nonconvex (for example, combinatorial or integer) local feasible sets and convex long-term constraints. At each period, a decision maker selects a local action to maximize cumulative reward while ensuring that the sequence of actions satisfies the global constraints in the long term. It is known that $O(\sqrt{T})$ long-term constraint violation and $O(\sqrt{T})$ reward regret are achievable if given access to a local optimization oracle that exactly solves optimization problems over each local feasible set. Instead of requiring exact optimization over each local feasible set, we assume access to an approximate local optimization oracle that permits optimization errors quantified by two parameters $(\delta_+,\delta_\times)$. We develop an approximate online dual mirror descent algorithm and show that its guarantees depend on a feasibility slack parameter $\underline d$, which measures the compatibility between local feasible sets and the long-term constraint. Under the standard random permutation model, when $\delta_+=O(1)$, $\delta_\times<\underline d$ and $\underline d-\delta_\times=\Omega(1)$, the algorithm achieves $O(\sqrt T)$ long-term constraint violation and reward regret up to $O\bigl(\sqrt T+\delta_\times T\bigr)+\delta_+ T$. We also show a matching limitation: when $\delta_+=0$ and $\delta_\times>\underline d$, no online algorithm relying on such approximate oracle outputs can guarantee sublinear long-term constraint violation in general.

[332] arXiv:2303.02510 (replaced) [pdf, html, other]
Title: Testing the equality of the copulas of two multivariate populations with Bernstein polynomials
Guanjie Lyu, Mohamed Belalia
Subjects: Statistics Theory (math.ST)

The empirical Bernstein copula process is utilized to conduct tests for the equal- ity of the dependence structures between two samples. To this end, three tests statistics are proposed, and their asymptotic properties are established under mild regularity conditions. Furthermore, in order to obtain a valid p-value, sub- sampling and multiplier bootstrap methods are introduced and investigated for the Bernstein based-test statistics. Through a simulation study, it is shown that Bernstein-based tests significantly outperform tests based on the empirical copula.

[333] arXiv:2309.10242 (replaced) [pdf, html, other]
Title: Reinforcement Learning for optimal dividend problem under diffusion model
Lihua Bai, Thejani Gamage, Jin Ma, Gaozhan Wang
Comments: In this version the numerical scheme and the experiments are reconstructed
Subjects: Optimization and Control (math.OC)

In this paper, we study the optimal dividend problem under the continuous time diffusion model with the bounded dividend rate from the Reinforcement Learning (RL) perspective. Unlike the standard literature, our main focus will be on numerical algorithms that allow part or all of the system parameters to be unspecified so that the optimal control cannot be explicitly determined. Following the RL literature we introduce the entropy-regularized exploratory control problem, which randomizes the control actions and balances the levels of exploitation and exploration, and carry out a theoretical analysis of the associated Policy Improvement (PI) and Policy Evaluation (PE) devices and the corresponding sequence of the approximating optimal strategies. Specifically, our algorithm will be based on two independent neural networks that approximate the value function and its derivative simultaneously. Such an algorithm, to the best of our knowledge, is new in the context of the optimal dividend problems, and can be effective even for the situation when the premium and/or interest rate is state dependent, hence beyond reach of the standard statistical methods. Some numerical experiments are presented to empirically demonstrate the effectiveness of our RL algorithm.

[334] arXiv:2312.08546 (replaced) [pdf, html, other]
Title: Heat kernel estimates for boundary traces of reflected diffusions on uniform domains
Naotaka Kajino, Mathav Murugan
Comments: 129 pages; Examples 5.23 and 5.24 have been interchanged, essential errors in Example 5.24 have been corrected, and a number of minor corrections and modifications have been made
Subjects: Probability (math.PR); Analysis of PDEs (math.AP)

We study the boundary trace processes of reflected diffusions on uniform domains. We obtain stable-like heat kernel estimates for such a boundary trace process when the diffusion on the underlying ambient space satisfies sub-Gaussian heat kernel estimates. Our arguments rely on new results of independent interest such as sharp two-sided estimates and the volume doubling property of the harmonic measure, the existence of a continuous extension of the Naïm kernel to the topological boundary, and the Doob--Naïm formula identifying the Dirichlet form of the boundary trace process as the pure-jump Dirichlet form whose jump kernel with respect to the harmonic measure is exactly (the continuous extension of) the Naïm kernel.

[335] arXiv:2401.11683 (replaced) [pdf, html, other]
Title: Traveling waves of NLS system arising in optical material without Galilean symmetry
Yuan Li, Kai Wang, Qingxuan Wang
Comments: 29 pages
Subjects: Analysis of PDEs (math.AP)

We study a nonlinear Schrödinger (NLS) system with cubic interactions arising in nonlinear optics, focusing on how the absence of Galilean symmetry affects solution dynamics. In the mass-critical case, we establish a new global existence result that contrasts with classical results. By exploiting the properties of traveling solitary waves, we obtain a condition on the initial data that relaxes the standard sharp assumptions. We also characterize the high-frequency limit of these traveling solitary waves as the frequency $\omega$ tends to infinity.

[336] arXiv:2408.07574 (replaced) [pdf, html, other]
Title: Degenerations of nilalgebras
Ivan Kaygorodov, Oleg Shashkov
Comments: Corrected version
Journal-ref: I. Kaygorodov, O. Shashkov, Degenerations of nilalgebras, Communications in Mathematical Research, 41 (2025), no. 1, 9--24
Subjects: Rings and Algebras (math.RA)

All complex $3$-dimensional nilalgebras were described. As a corollary, all degenerations in the variety of complex $3$-dimensional nilalgebras were obtained.

[337] arXiv:2408.08136 (replaced) [pdf, html, other]
Title: Fluctuations in the non-linear supersymmetric hyperbolic sigma model with hierarchical interactions
Margherita Disertori, Franz Merkl, Silke W. W. Rolles
Comments: 31 pages, 2 figures. This manuscript was obtained by splitting and updating arXiv:2305.07359v1 into this manuscript and arXiv:2305.07359v2. In this version the proofs have been reorganized and, to clarify the focus of the paper, the title has been slightly changed. To appear in Annales Henri Poincaré
Subjects: Mathematical Physics (math-ph); Probability (math.PR)

We consider a class of non-linear supersymmetric hyperbolic sigma models on a hierarchical lattice. We prove that the hyperbolic distance between the superspin at any vertex and a reference superspin has asymptotically small fluctuations for large enough interactions, uniformly in the size of the graph and in the choice of the vertex. This can be viewed as a spontaneous breaking of the Lorentz boost symmetry.

[338] arXiv:2408.14695 (replaced) [pdf, html, other]
Title: The Column-Diamond Resolution over Quadratic Monomial Rings
Daniel Bravo, Federico Castillo, Nelly Villamizar
Comments: 32 pages. This version supersedes v1, titled "Combinatorial free chain complexes over quotient polynomial rings"
Subjects: Commutative Algebra (math.AC); K-Theory and Homology (math.KT)

We study infinite minimal free resolutions of modules $M = R/(x_{i_1},\ldots,x_{i_m})$ over quadratic monomial rings $R = k[x_1,\ldots,x_n]/I$. We introduce the Column-Diamond construction, a recursive diagrammatic procedure that builds an explicit free resolution of $M$ from columns and diamonds determined by the quadratic generators of $I$. We prove that this resolution is exact and minimal. As an application, the Betti numbers of $M$ are counted by valid words in a graph associated to $I$, which yields a combinatorial rational formula for the Poincaré series.

[339] arXiv:2409.06275 (replaced) [pdf, other]
Title: On Sparsity and Sub-Gaussianity in the Johnson-Lindenstrauss Lemma
Aur{é}lien Garivier (UMPA-ENSL, MC2), Emmanuel Pilliat (UMPA-ENSL)
Journal-ref: Transactions on Machine Learning Research 2025
Subjects: Statistics Theory (math.ST)

We provide a simple proof of the Johnson-Lindenstrauss lemma for sub-Gaussian variables. We extend the analysis to identify how sparse projections can be, and what the cost of sparsity is on the target dimension. The Johnson-Lindenstrauss lemma is the theoretical core of the dimensionality reduction methods based on random projections. While its original formulation involves matrices with Gaussian entries, the computational cost of random projections can be drastically reduced by the use of simpler variables, especially if they vanish with a high probability. In this paper, we propose a simple and elementary analysis of random projections under classical assumptions that emphasizes the key role of sub-Gaussianity. Furthermore, we show how to extend it to sparse projections, emphasizing the limits induced by the sparsity of the data itself.

[340] arXiv:2409.06294 (replaced) [pdf, other]
Title: Positivity, cross-ratios, photons, and the Collar Lemma
Jonas Beyrer, Olivier Guichard (IRMA, UNISTRA), François Labourie (UniCA), Beatrice Pozzetti, Anna Wienhard
Subjects: Differential Geometry (math.DG); Group Theory (math.GR)

We prove that $\Theta$-positive representations of fundamental groups of surfaces (possibly cusped or of infinite type) satisfy a collar lemma, and their associated cross-ratios are positive. As a consequence we deduce that $\Theta$-positive representations form closed subsets of the representation variety. Along the way we systematically study a class of curves inside general flag manifolds that we call photons. Using their interplay with transversality in the flag manifold, we construct photon projections, which we use to relate the cross-ratios on the photons to the cross-ratios on the flag manifolds.

[341] arXiv:2409.08745 (replaced) [pdf, html, other]
Title: Tilted Solid-On-Solid is liquid: scaling limit of SOS with a potential on a slope
Benoît Laslier, Eyal Lubetzky
Comments: 120 pages; 20 figures
Subjects: Probability (math.PR); Mathematical Physics (math-ph)

The $(2+1)$D Solid-On-Solid (SOS) model famously exhibits a roughening transition: on an $N\times N$ torus with the height at the origin rooted at $0$, the variance of $h(x)$, the height at $x$, is $O(1)$ at large inverse-temperature $\beta$, vs $\asymp \log |x|$ at small $\beta$ (as in the Gaussian free field (GFF)). The former--rigidity at large $\beta$--is known for a wide class of $|\nabla\phi|^p$ models ($p=1$ being SOS) yet is believed to fail once the surface is on a slope (tilted boundary conditions). It is conjectured that the slope would destabilize the rigidity and induce the GFF-type behavior of the surface at small $\beta$. The only rigorous result on this is by Sheffield '05: for these models of integer height functions, if the slope $\theta$ is irrational, then Var$(h(x))\to\infty$ with $|x|$ (with no known quantitative bound).
We study a family of SOS surfaces at a large enough fixed $\beta$, on an $N\times N$ torus with a nonzero boundary condition slope $\theta$, perturbed by a potential $V$ on an $\epsilon_\beta$-fraction of sites (arbitrarily small). Our main result is (a) the measure on the height gradients $\nabla h$ has a limit $\mu_\infty$ as $N\to\infty$; and (b) the scaling limit of a sample from $\mu_\infty$ converges to a full plane GFF. In particular, we recover the asymptotics Var$(h(x))\sim c\log|x|$. To our knowledge, this is the first example of a tilted $|\nabla\phi|^p$ model, or a perturbation thereof, where the limit is recovered at large $\beta$. The proof looks at random monotone surfaces that approximate the SOS surface, and shows that (i) these form a weakly interacting dimer model, and (ii) the renormalization framework of Giuliani, Mastropietro and Toninelli '17 leads to the GFF limit. New ingredients are needed in both parts, including a nontrivial extension of [GMT17] from finite interactions to ones with exponential decay in the radius.

[342] arXiv:2411.00629 (replaced) [pdf, html, other]
Title: Transformation of Stochastic Recursions and Critical Phenomena in the Analysis of the Athreya-Aldous-Shields Cascade and Related Mean Flow Equations
Radu Dascaliuc, Tuan N. Pham, Enrique Thomann, Edward C. Waymire
Comments: 62 pages, 7 figures
Subjects: Probability (math.PR); Analysis of PDEs (math.AP)

We study the discounted branching random walk process introduced by Athreya (1985) and Aldous and Shields (1988), referred to as the Athreya-Aldous-Shields (AAS) cascade. This process can be viewed as an idealized version of the stochastic model introduced by Le Jan and Sznitman in 1997 for the Navier-Stokes equations. The AAS cascade exhibits phase transitions at the critical branching rates $\alpha=1$ and $\alpha=2$. These transitions are reflected in the behavior of the associated mean flow equation, a nonlocal ODE referred to as the $\alpha$-Riccati equation. It is known that if $\alpha>1$, the AAS cascade is explosive in the sense of infinitely many splittings in finite time, and the $\alpha$-Riccati equation has at least two solutions. In this paper, we establish finer structural properties of an explosive AAS cascade and obtain a stronger non-uniqueness result. Namely, for each initial data in a certain range, the $\alpha$-Riccati equation has an infinite family of distinct solutions parametrized by their convergence rates at infinity. Our approach exploits a simple transformation between the AAS cascade and its "linearized" counterpart, whose mean flow equation is precisely the well-studied pantograph equation. This transformation demonstrates how a relationship at the level of stochastic processes can reveal an otherwise hidden relationship at the level of mean flow equations.

[343] arXiv:2411.02153 (replaced) [pdf, html, other]
Title: Quandle Cohomology Quiver Representations
Sam Nelson
Comments: 15 pages. Version 3 includes expositional clarifications, typo corrections and computational corrections
Subjects: Geometric Topology (math.GT); Quantum Algebra (math.QA)

We define a family of quiver representation-valued invariants of oriented classical and virtual knots and links associated to a choice of finite quandle $X$, abelian group $A$, set of quandle 2-cocycles $C\subset H^2_Q(x;A)$, choice of coefficient ring $k$ and set of quandle endomorphisms $S\subset \mathrm{Hom}(X,X)$. From this representation we define four new polynomial (or ``polynomial'' depending on $A$) invariants. We generalize to the case of biquandles and compute some examples.

[344] arXiv:2411.08325 (replaced) [pdf, html, other]
Title: Stabilities of the Kleitman diameter theorem
Yongjiang Wu, Yongtao Li, Lihua Feng, Jiuqiang Liu, Guihai Yu
Comments: Final version
Journal-ref: European Journal of Combinatorics 140 (2027) 104477
Subjects: Combinatorics (math.CO)

Let $\mathcal{F}$ be a family of subsets of $[n]$. The diameter of $\mathcal{F}$ is defined as the maximum size of the symmetric difference between any two of its members. Resolving a conjecture of Erdős, Kleitman determined the maximum size of a family with fixed diameter. Specifically, if $2\leq s\leq n-2$ and $\mathcal{F}\subseteq2^{[n]}$ is a family with diameter $s$, then for $s=2d$, $|\mathcal{F}|\le \sum_{i=0}^d {n \choose i}$; for $s=2d+1$, $|\mathcal{F}|\le \sum_{i=0}^d {n \choose i} + {n-1 \choose d}$. This result, known as the Kleitman diameter theorem, generalizes both the Katona union theorem and the Erdős--Ko--Rado theorem. In 2017, Frankl provided a complete characterization of the extremal families for Kleitman's theorem and established a stability result. In this paper, we determine the extremal families for Frankl's theorem and prove a further stability result of Kleitman's theorem. This solves a recent problem proposed by Li and Wu and provides the second stability for the Kleitman diameter theorem.

[345] arXiv:2411.15121 (replaced) [pdf, html, other]
Title: Information geometric regularization of unidimensional pressureless Euler equations yields global strong solutions
Ruijia Cao, Florian Schäfer
Subjects: Analysis of PDEs (math.AP); Differential Geometry (math.DG); Optimization and Control (math.OC)

Partial differential equations describing compressible fluids are prone to the formation of shock singularities, arising from faster upstream fluid particles catching up to slower, downstream ones. In geometric terms, this causes the deformation map to leave the manifold of diffeomorphisms. Information geometric regularization addresses this issue by changing the manifold geometry to make it geodesically complete. Empirical evidence suggests that this results in smooth solutions without adding artificial viscosity. This work makes a first step towards understanding this phenomenon rigorously, in the setting of the unidimensional pressureless Euler equations. It shows that their information geometric regularization has smooth global solutions. By establishing $\Gamma$-convergence of its variational description, it proves convergence of these solutions to entropy solutions of the nominal problem, in the limit of vanishing regularization parameter. A consequence of these results is that manifolds of unidimensional diffeomorphisms with information geometric regularization are geodesically complete.

[346] arXiv:2411.16266 (replaced) [pdf, html, other]
Title: On reality of eigenvalues of banded block Toeplitz matrices
Dario Giandinoto
Subjects: Spectral Theory (math.SP); Classical Analysis and ODEs (math.CA)

We formulate and partially prove a general conjecture providing necessary and sufficient conditions for the reality of the asymptotic spectrum of an arbitrary real banded block Toeplitz matrix. Additionally we present numerical experiments supporting it. This conjecture is a direct generalization of the already existing one in the case of banded Toeplitz matrices.

[347] arXiv:2411.18938 (replaced) [pdf, html, other]
Title: Triangulations of the 3-sphere with knotted edge
Dionne Ibarra, Daniel V. Mathews, Jessica S. Purcell, Jonathan Spreer
Comments: 20 pages, 13 figures
Subjects: Geometric Topology (math.GT)

We prove that for any knot $K$, there exists a one-vertex triangulation of the $3$-sphere containing an edge forming $K$. The proof is constructive, and based on fully augmented links. We use our method to produce ``complicated'' simplicial triangulations of the $3$-sphere that we show are smallest possible, up to a constant multiplicative factor.

[348] arXiv:2412.03942 (replaced) [pdf, html, other]
Title: Dimension-free Fourier restriction inequalities
Diogo Oliveira e Silva, Błażej Wróbel
Comments: 18 pages, 2 figures, corrected proof of inequality (1.8), all main results of the article remain unchanged
Journal-ref: Bulletin of the London Mathematical Society 57 (8) 2025
Subjects: Classical Analysis and ODEs (math.CA)

Let ${{\bf R}_{\mathbb{S}^{d-1}}}(p\to q)$ denote the best constant for the $L^p(\mathbb{R}^d)\to L^q(\mathbb{S}^{d-1})$ Fourier restriction inequality to the unit sphere $\mathbb{S}^{d-1}$, and let ${\bf R}_{\mathbb{S}^{d-1}} (p\to q;\textrm{rad})$ denote the corresponding constant for radial functions. We investigate the asymptotic behavior of the operator norms ${{\bf R}_{\mathbb{S}^{d-1}}}(p\to q)$ and ${\bf R}_{\mathbb{S}^{d-1}} (p\to q;\textrm{rad})$ as the dimension $d$ tends to infinity. We further establish a dimension-free endpoint Stein-Tomas inequality for radial functions, together with the corresponding estimate for general functions which we prove with an $O(d^{1/2})$ dependence. Our methods rely on a uniform two-sided refinement of Stempak's asymptotic $L^p$ estimate of Bessel functions.

[349] arXiv:2412.18465 (replaced) [pdf, html, other]
Title: Limits of harmonic functions on $\mathbb{Z}^d$
Ferdinand Jacobé de Naurois
Comments: v2: accepted version, published online first in L'Enseignement Mathématique (DOI https://doi.org/10.4171/LEM/1109). 8 pages
Subjects: Group Theory (math.GR)

We give an example of a sequence of positive harmonic functions on $\mathbb{Z}^d$, $d\geq 2$, that converges pointwise to a non-harmonic function.

[350] arXiv:2412.20001 (replaced) [pdf, html, other]
Title: Colouring signed analogues of Kneser, Schrijver, and Borsuk graphs
Luis Kuffner, Reza Naserasr, Lujia Wang, Xiaowei Yu, Huan Zhou, Xuding Zhu
Subjects: Combinatorics (math.CO)

The Kneser signed graph $\KS(n,k)$, $k\leq n$, is the graph whose vertices are signed $k$-subsets of $[n]$ (i.e. $k$-subsets $S$ of $\{ \pm 1, \pm 2, \ldots, \pm n\}$ such that $S\cap (-S)=\emptyset$). Two vertices $A$ and $B$ are adjacent with a positive edge if $A\cap (-B)=\emptyset$ and with a negative edge if $A\cap B=\emptyset$. We prove that the balanced chromatic number of $\KS(n,k)$ is $n-k+1$. We then introduce the signed analogue of Schrijver graphs and show that choosing one representative from each antipodal pair of alternating signed $k$-sets gives a vertex-critical subgraph of $\KS(n,k)$ with respect to balanced colouring. For the Borsuk signed graph on $S^d$, we obtain balanced chromatic number $d+1$ for sufficiently small distance parameter and relate this equality to antipodal covers of the sphere. On $S^2$, spherical and projective covering bounds give three, four and six as the first successive values of the balanced chromatic number.

[351] arXiv:2501.04151 (replaced) [pdf, html, other]
Title: Efficient LP warmstarting for linear modifications of the constraint matrix
Guillaume Derval, Bardhyl Miftari, Damien Ernst, Quentin Louveaux
Subjects: Optimization and Control (math.OC); Computational Complexity (cs.CC)

We consider the problem of computing the optimal solution and objective value of a linear program whose constraint matrix changes linearly with a parameter, for a predefined set of values of this parameter. Based on the information given by a precomputed basis, we present three efficient LP warm-starting algorithms, based on the eigenvalue decomposition, the Schur decomposition and the Hessenberg decomposition, to evaluate the optimal solution and optimal objective value of these problems. The three algorithms have an overall complexity of $O(pm^2+pmn)$ where $m$ (resp. $n$) is the number of constraints (resp. variables) of the original problem and $p$ the number of parameter values after an initial preprocessing step. We also provide theorems related to the optimality conditions to verify when a basis is still optimal. When the perturbation of the basis matrix has a low rank $\rho$, as is often the case in practice, we then reduce all the computations to a $\rho\times\rho$ matrix built with $\rho$ solves with the factorization of the basis maintained by the simplex solver; with it, we compute, in each direction, an interval on which the basis is guaranteed to remain optimal, together with a bound on the objective. In practice, these intervals are close to the exact ones, and they remain useful for degenerate bases. We also propose a matrix-free method based on shifted Krylov subspaces. Numerical experiments on 398 instances built from real models, with up to 349,120 constraints, assess the accuracy, the cost and the range of applicability of all the methods. On the interval on which a basis remains optimal, once this interval is known, the low-rank and Krylov methods compute the optimal objective value 117 to 304 times faster than a warm start of the solver, in median.

[352] arXiv:2501.06812 (replaced) [pdf, html, other]
Title: Branching Ratios of Input Trees for Directed Multigraphs
Paolo Boldi, Ian Stewart
Comments: 34 pages, 10 figures
Journal-ref: Journal of Algebraic Combinatorics (2026)
Subjects: Combinatorics (math.CO)

We define the branching ratio of the input tree of a node in a finite directed multigraph, prove that it exists for every node, and show that it is equal to the largest eigenvalue of the adjacency matrix of the induced subgraph determined by all upstream nodes. This real eigenvalue exists by the Perron-Frobenius Theorem for non-negative matrices. We motivate our analysis with simple examples, obtain information about the asymptotics for the limit growth of the input tree, and establish other basic properties of the branching ratio.

[353] arXiv:2502.00312 (replaced) [pdf, html, other]
Title: Extensibility and denseness of periodic monoid actions
Raimundo Briceño, Álvaro Bustos-Gajardo, Miguel Donoso-Echenique
Comments: 28 pages, 2 figures
Subjects: Dynamical Systems (math.DS); Group Theory (math.GR); Probability (math.PR)

A monoid has the periodic approximation (PA) property if, for every full shift on a finite alphabet, finitely supported invariant probability measures are weak-* dense in the space of invariant Borel probability measures. We introduce the class of measure-theoretically extension-compatible (MEC) monoids, consisting of embeddable monoids for which every probability measure-preserving (p.m.p.) action admits an invertible p.m.p. extension. For an embeddable monoid $S$ with free $S$-group $(\Gamma,\gamma)$, we prove that the PA property implies MEC, and that the converse holds whenever $\Gamma$ has the PA property. We establish that every left reversible bicancellative monoid and every finitely generated free monoid is MEC, and deduce the PA property for left amenable monoids that are residually a finite group and for finitely generated free monoids. Moreover, for $S=\mathbb F_d^+$, we characterize the free $S$-group as the unique receiving $S$-group for which all fully supported invariant Markov measures on full shifts on finite alphabets admit invariant invertible extensions.

[354] arXiv:2502.03137 (replaced) [pdf, html, other]
Title: Positivity of line bundles on general blow ups of Hirzebruch surfaces
Cyril J. Jacob, Bivas Khan
Comments: Theorem 3.5 has been corrected, along with the consequent revisions to Theorems 4.3 and 5.3. We have also added an application to an interpolation problem. Comments and suggestions are welcome
Subjects: Algebraic Geometry (math.AG)

We investigate various positivity properties of line bundles on general blow ups of Hirzebruch surfaces motivated by \cite{Han}, where the author has studied general blow ups of $\mathbb{P}^2$. For each of the properties: ampleness, global generation, very ampleness, and $k$-very ampleness, we provide several sufficient numerical conditions.

[355] arXiv:2502.13518 (replaced) [pdf, html, other]
Title: Rubik's Abstract Polytopes
Giovanni Luca Marchetti
Comments: New version: mistakes corrected, and several additions
Subjects: Combinatorics (math.CO)

We generalize the Rubik's cube, together with its group of configurations, to any abstract regular polytope. We discuss general aspects, and provide a description of the group of the Rubik's simplex in arbitrary dimension, and of Rubik's tori. We sketch an analogous argument for the Rubik's hypercube as well.

[356] arXiv:2503.21265 (replaced) [pdf, html, other]
Title: Exact module categories over $\mathrm{Rep}(u_q(\mathfrak{sl}_2))$
Daisuke Nakamura, Taiki Shibata (Okayama University of Science), Kenichi Shimizu (Shibaura Institute of Technology)
Comments: 49 pages. Some minor errors are corrected. The argument that used Chebyshev polynomials has been replaced with one using Dickson polynomials and, as a result, Appendix D has been removed
Subjects: Quantum Algebra (math.QA); Category Theory (math.CT); Representation Theory (math.RT)

We give a complete list of indecomposable exact module categories over the finite tensor category $\mathrm{Rep}(u_q(\mathfrak{sl}_2))$ of representations of the small quantum group $u_q(\mathfrak{sl}_2)$, where $q$ is a root of unity of odd order. Each of them is given as the category of representations of a left comodule algebra over $u_q(\mathfrak{sl}_2)$ explicitly presented by generators and relations.

[357] arXiv:2504.00508 (replaced) [pdf, html, other]
Title: Triadic structures in multislice networks
Kevin Ren, Tara Trauthwein, Gesine Reinert
Subjects: Probability (math.PR)

Networks provide a popular representation of complex data. Often, different types of relational measurements are taken on the same subjects. Such data can be represented as a multislice network, a collection of networks on the same set of nodes, with connections between nodes of different layers. For the analysis of multislice networks, we take inspiration from the analysis of simple networks, for which small subgraphs (motifs) have proven to be useful; motifs are even seen as building blocks of complex networks. A particular instance of a motif is a triangle, and while triangle counts are well understood for simple network models such as Erdős-Rényi random graphs, with i.i.d. distributed edges, even for simple multislice network models little is known about triangle counts. Here we address this issue by extending the analysis of triadic structures to multislice Erdős-Rényi networks. Again taking inspiration from the analysis of sparse Erdős-Rényi random graphs, we show that the distribution of triangles across multiple layers in a multislice Erdős-Rényi network can be well approximated by an appropriate Poisson distribution. This theoretical result opens the door to statistical goodness of fit tests for multislice networks.

[358] arXiv:2504.11141 (replaced) [pdf, html, other]
Title: A definition of the background state of the atmosphere using optimal transport
Charlie Egan, John Methven, David P. Bourne, Mike J. P. Cullen
Subjects: Optimization and Control (math.OC)

The dynamics of atmospheric disturbances are often described in terms of displacements of air parcels relative to their locations in a notional background state. Modified Lagrangian Mean (MLM) states have been proposed by M. E. McIntyre using the Lagrangian conserved variables potential vorticity and potential temperature to label air masses in the instantaneous 3-D atmospheric state, and then rearranging air masses sandwiched between potential vorticity contours in potential temperature layers so that they are zonally symmetric. Methven and Berrisford used conservation of Kelvin's circulation to define the distribution of MLM state mass in zonal angular momentum ($z$) and potential temperature ($\theta$) coordinates given 3-D global data. We prove that for any such mass distribution in $(z, \theta)$ there exists a mapping to a unique mass distribution in geophysical coordinates (latitude and pressure) which minimises energy and completely defines the MLM state in a single hemisphere. Since the state is an energy minimum, it is suitable for quantification of finite amplitude disturbances and examining atmospheric instability. This state is obtained by solving a free surface problem, which we frame as the minimisation of an optimal transport cost over a class of source measures. The solution consists of a source measure, encoding surface pressure, and an optimal transport map, connecting the distribution of mass in geophysical coordinates to the known distribution of mass in $(z, \theta)$. We show that this problem reduces to an optimal transport problem with a known source measure, which has a numerically feasible discretisation, and we present a numerical solution using atmospheric reanalysis data. Additionally, our results hold for a large class of cost functions, and generalise analogous results on free surface variants of the semi-geostrophic equations.

[359] arXiv:2505.17965 (replaced) [pdf, html, other]
Title: Bias-Optimal Bounds for Stochastic Gradient Descent
Daniel Cortild, Lucas Ketels, Juan Peypouquet, Guillaume Garrigos
Comments: 30 pages. Under review
Subjects: Optimization and Control (math.OC); Machine Learning (cs.LG); Machine Learning (stat.ML)

The non-asymptotic analysis of Stochastic Gradient Descent (SGD) typically yields bounds that decompose into a bias term and a variance term. In this work, we focus on the bias component and study the extent to which SGD can match the optimal convergence behavior of deterministic gradient descent. Assuming only (strong) convexity and smoothness of the objective, we derive new bounds for the full range of constant step-sizes $\gamma L \in (0,2)$. This includes critical and large step-size regimes that were previously unexplored without additional variance assumptions, in both the convex and strongly convex cases. Those bounds are bias-optimal, in the sense that the bias term coincides with the worst-case rate of gradient descent, for all non-critical step-sizes. For critical step-sizes, we show that no bounds can be obtained with an optimal bias term, but that this optimal bias can be approximated arbitrarily closely. As an immediate application, we provide new complexity bounds for the Stochastic Proximal algorithm, without the need of regularity assumptions.

[360] arXiv:2506.04948 (replaced) [pdf, other]
Title: Entropic smoothing and gradient approximation for Wasserstein distributionally robust optimization
Tam Le (LPSM (UMR\_8001))
Subjects: Optimization and Control (math.OC); Machine Learning (stat.ML)

Wasserstein distributionally robust optimization offers a framework for model fitting in machine learning under potential shifts in the data distribution. We study a regularized variant of this problem in which entropic smoothing produces a sampled approximation of the original objective. We establish convergence of the approximate gradients to subgradients of the unregularized objective as the regularization parameter vanishes, enabling convergence guarantees for stochastic gradient methods. We obtain qualitative convergence results under general assumptions and provide convergence rates under additional regularity. In particular, we prove rates for the convergence of the unregularized objective values, up to sampling errors, when the regularization level is decreased across iterations. Our analysis also yields results of independent interest on approximating the subdifferentials of maximum functions by gradients of their smooth approximations, together with growth-based lower bounds on optimal dual variables in Wasserstein distributionally robust optimization.

[361] arXiv:2506.07991 (replaced) [pdf, html, other]
Title: Automorphism groups of solvable groups of finite abelian ranks
Jonas Deré, Mark Pengitore
Comments: 34 pages, improved exposition and added examples
Subjects: Group Theory (math.GR)

This paper gives a new explicit construction of the $\mathbb{Q}$-algebraic hull for virtually solvable groups $\Gamma$ of finite abelian ranks, taking into account the spectrum $S$ of the group $\Gamma$. As an application, we make a detailed study of the structure of $Aut(\Gamma)$ in the finitely generated case and show that a number of natural subgroups are $S$-arithmetic under the condition that $Fitt(\Gamma)$ is $S$-arithmetic. We then proceed by demonstrating that $Out(\Gamma)$ has a $S$-arithmetic image in the group of algebraic outer automorphisms of the $\mathbb{Q}$-algebraic hull. We finish by discussing further applications of the $\mathbb{Q}$-algebraic hull towards an open conjecture by Nekrashevych and Pete and topological fixed point theory.

[362] arXiv:2506.09618 (replaced) [pdf, html, other]
Title: Ideals generated by corner-interval minors
Marie Amalore Nambi
Comments: 18 pages, comments are welcome! To appear in Collectanea Mathematica
Subjects: Commutative Algebra (math.AC); Combinatorics (math.CO)

In this article, we study binomial ideals generated by an arbitrary collection of corner-interval $2$-minors of a generic matrix. We determine the minimal prime ideals of such ideals and characterize their radicality in the special case of corner minors. Moreover, we discuss connectivity properties of contingency tables in algebraic statistics. We compute the Hilbert-Poincaré polynomial of the ideal generated by the set of all corner-interval minors and we derive the formula for the regularity in the case of corner minors.

[363] arXiv:2507.04124 (replaced) [pdf, html, other]
Title: Semiadditive Alternating Powers and Twisted Power Operations
Shai Keidar, Shaul Ragimov
Comments: Final version. To appear in Trans. Amer. Math. Soc
Subjects: Algebraic Topology (math.AT)

We study a class of representations of symmetric groups in higher semiadditive categories. For these representations in $\mathrm{Mod}^{\wedge}_{E_n}$, the transchromatic character of Hopkins--Kuhn--Ravenel and Stapleton is recovered as a sequence of monoidal characters on suitable categorifications, giving an explicit algorithm for its computation, and relating it to the iterated monoidal character in $(\infty,n)$-categories. These representations also give rise to notions of alternating powers and power operations in semiadditive categories, extending the classical alternating powers and $\lambda$-operations in $\mathrm{K}$-theory. We provide explicit computations in both the chromatic and higher categorical settings at low heights.

[364] arXiv:2507.21020 (replaced) [pdf, html, other]
Title: Medians, Oscillations, and Distance Functions
Marcus Pasquariello, Ignacio Uriarte-Tuero
Comments: 43 pages, 6 figures; incorporated referee comments
Subjects: Classical Analysis and ODEs (math.CA)

Vasin (for $n=1$) and Anderson, Lehrbäck, Mudarra, and Vähäkangas (arXiv:2209.06284) (for $n>1$) provided a geometric characterization of the sets $E \subset \mathbb{R}^n$ for which $w = \operatorname{dist}(\cdot, E)^{-\alpha}$ is a Muckenhoupt $A_1$ weight for some $\alpha > 0$. In this paper, we provide a geometric characterization of the sets $E \subset \mathbb{R}^n$ (which we call median porous sets) such that $w = \operatorname{dist}(\cdot, E)^{-\alpha}$ is a Muckenhoupt $A_p$ weight for some $\alpha > 0$ (given any $1 < p \leq \infty$). Given $1 < p \leq \infty$, we also find the precise range of exponents $\alpha$ for which $w = \operatorname{dist}(\cdot, E)^{-\alpha} \in A_p$, in analogy to the $p=1$ case done in arXiv:2209.06284. With our characterization, we prove that $\mathbb{R}^n \setminus E$ supports a Hardy-Sobolev inequality if $E$ is an appropriate median porous set. The proofs rely on a new median-value characterization of $BMO$: For a real-valued measurable function on $\mathbb{R}^n$ and constants $0 < s < t < 1$, \[\|f\|_{BMO} \approx_{s, t, n} \sup_{Q}[M_t(f, Q) - M_s(f, Q)]\] where $M_s(f, Q)$ denotes the $s$-median value of $f$ on $Q$.

[365] arXiv:2508.02358 (replaced) [pdf, html, other]
Title: Fully implicit timestepping methods for the rotating shallow water equations
Werner Bauer, Colin J. Cotter, Joshua Hope-Collins
Subjects: Numerical Analysis (math.NA); Fluid Dynamics (physics.flu-dyn)

Fully implicit timestepping methods have had limited application in geophysical fluid dynamics due to challenges of finding suitable iterative solvers, since the coupled treatment of advection prevents the standard elimination techniques. However, overlapping Additive Schwarz methods provide a robust, scalable iterative approach for solving the monolithic coupled system for all fields and Runge-Kutta stages. In this study we investigate this approach applied to the rotating shallow water equations, facilitated by the Irksome package which provides automated code generation for implicit Runge-Kutta methods. We compare various schemes in terms of accuracy and efficiency using an implicit/explicit splitting method, namely the ARK2 scheme of Giraldo et al (2013), as a benchmark. This provides an initial look at whether implicit Runge-Kutta methods can be viable for atmosphere and ocean simulation.

[366] arXiv:2509.03251 (replaced) [pdf, html, other]
Title: Multi-period Asset-liability Management with Reinforcement Learning in a Regime-Switching Market
Zhongqin Gao, Ping Chen, Xun Li, Yan Lv, Wenhao Zhang
Comments: 25 pages, 3 figures
Subjects: Optimization and Control (math.OC); Probability (math.PR)

This paper explores the mean-variance portfolio selection problem in a multi-period financial market characterized by regime-switching dynamics and uncontrollable liabilities. To address the uncertainty in the decision-making process within the financial market, we incorporate reinforcement learning (RL) techniques. Specifically, the study examines an exploratory mean-variance (EMV) framework where investors aim to minimize risk while maximizing returns under incomplete market information, influenced by shifting economic regimes. The market model includes risk-free and risky assets, with liability dynamics driven by a Markov regime-switching process. To align with real-world scenarios where financial decisions are made over discrete time periods, we adopt a multi-period dynamic model. We present an optimal portfolio strategy derived using RL techniques that adapt to these market conditions. The proposed solution addresses the inherent time inconsistency in classical mean-variance models by integrating a pre-committed strategy formulation. Furthermore, we incorporate partial market observability, employing stochastic filtering techniques to estimate unobservable market states. Numerical simulations and empirical tests on real financial data demonstrate that our method achieves superior returns, lower risk, and faster convergence compared to traditional models. These findings highlight the robustness and adaptability of our RL-based solution in dynamic and complex financial environments.

[367] arXiv:2509.05894 (replaced) [pdf, html, other]
Title: Toric geometry of ReLU neural networks
Yaoying Fu
Subjects: Algebraic Geometry (math.AG); Machine Learning (cs.LG); Machine Learning (stat.ML)

Given a continuous piecewise linear function $f:\mathbb{R}^{n_0} \to \mathbb{R}$ and a fixed architecture of feedforward ReLU neural networks, the exact function realization problem asks when a network of that architecture realizes $f$. In contrast, expressivity concerns characterizing all functions exactly realizable by a given architecture. To address these questions systematically, we establish a connection between toric geometry and ReLU neural networks, allowing tools from algebraic geometry to analyze the structures. Starting with an unbiased ReLU network with rational weights, we define the ReLU fan, the ReLU toric variety, and the ReLU Cartier divisor associated with the network. This work also relates the tropical and the toric geometry: the former captures combinatorial data of ReLU networks, while the latter recovers the underlying geometric structure. As an application, we obtain a complete characterization of the functions realizable by unbiased shallow ReLU networks with rational weights. The characterization is expressed in terms of intersection numbers of ReLU Cartier divisors with torus-invariant curves and leads to a decomposition of piecewise-linear functions into shallow and non-shallow components.

[368] arXiv:2509.09449 (replaced) [pdf, html, other]
Title: Multipole and Berezinskii-Kosterlitz-Thouless Transitions in the Two-component Plasma
Jeanne Boursier, Sylvia Serfaty
Comments: 166 pages, 12 figures
Subjects: Mathematical Physics (math-ph); Probability (math.PR)

We study the two-dimensional two-component Coulomb gas in the canonical ensemble and at inverse temperature $\beta>2$. In this regime, the partition function diverges and the interaction needs to be cut off at a length scale $\lambda\in (0,1)$. Particles of opposite charges tend to pair into dipoles of length scale comparable to $\lambda$, which themselves can aggregate into multipoles. Despite the slow decay of dipole--dipole interactions, we construct a convergent cluster expansion around a hierarchical reference model that retains only intra-multipole interactions. This yields a large-deviation result for the number of $2p$-poles as well as a \textcolor{black}{free-energy expansion} as $N\to\infty$ and $\lambda\to0$, with three contributions: (i) the free energy of $N$ independent dipoles, (ii) a perturbative correction, and (iii) the contribution of a non-dilute subsystem.
The perturbative term has two equivalent characterizations: (a) a convergent Mayer series built from non-divergent elementary dipole activities; and (b) a variational formula as the minimum of a large-deviation rate function for the empirical counts of $2p$-poles. The Mayer coefficients \textcolor{black}{should undergo} transitions at $\beta_p=4-\tfrac{2}{p}$\textcolor{black}{, and these thresholds} accumulate at $\beta=4$, which corresponds to the \textcolor{black}{Berezinskii--Kosterlitz--Thouless} transition in the low-dipole-density limit. \textcolor{black}{We prove that the limiting $p$-dipole activities are finite for $\beta>\beta_p$.}
The non-dilute system corresponds to the contribution of large dipoles. For $2<\beta<4$, the independent-dipole dilution estimate predicts the critical length scale $R_{\beta,\lambda}=\lambda^{-(\beta-2)/(4-\beta)}$. For $\beta\geq4$, we set $R_{\beta,\lambda}=+\infty$, as this estimate gives no algebraic crossover scale in $\lambda$.

[369] arXiv:2509.20035 (replaced) [pdf, html, other]
Title: Limit groups with respect to Thompson's group $F$ and other hereditarily separating groups
Aleksander Ivanov, Roland Zarzycki
Comments: 28 pages. This version is very close to the journal version. Published by Monatshefte fur Mathematik
Subjects: Group Theory (math.GR)

We prove that a limit group over Thompson's group $F$ cannot be an HNN-extension of $F$ with finitely generated associated subgroup. On the other hand we give an example of an $F$-limit group which is a centralized HNN-extenstions of $F$. We also study relatively limit groups with respect to $F$ and some other known groups of homeomorphisms of topological spaces.
This paper revises and extends some results of the second author from arXiv:1308.6330.

[370] arXiv:2510.08782 (replaced) [pdf, html, other]
Title: A generalized alternating NGMRES method for PDE-constrained optimization problems governed by transport equations
Yunhui He, Andreas Mang
Comments: 34 pages, 3 figures, 14 tables
Subjects: Optimization and Control (math.OC)

We propose a generalized alternating nonlinear generalized minimal residual method (GA-NGMRES) to accelerate first-order optimization schemes for PDE-constrained optimization problems governed by transport equations. Interpreting
the update rule of a gradient descent scheme in the Hilbert space induced by the regularization model, i.e., a Sobolev gradient descent, as a fixed-point (FP) iteration, GA-NGMRES periodically alternates NGMRES updates with FP
steps. It requires only first-order derivatives. We consider advection, mass-preserving transport, and incompressible flows as PDE models; variational regularization of the control variable promotes diffeomorphic transport maps,
which we verify numerically. With a line search safeguard, GA-NGMRES converges globally. Since its FP map need not be contractive, we extend a recent analysis of NGMRES for noncontractive iterations to the alternating scheme. We
compare GA-NGMRES to this Sobolev gradient descent, Anderson acceleration, a limited-memory BFGS method in the same Hilbert space, and Gauss-Newton-Krylov methods on real-world and synthetic data. GA-NGMRES converges where the
unaccelerated scheme does not and outperforms Anderson acceleration. On our problems, it does not, in general, outperform the (quasi-)Newton methods, but it closes much of the gap to them; which method is fastest depends on the
preconditioner, the regularization parameter, the data, and the stopping tolerance. GA-NGMRES is a simple and robust option when moderately accurate solutions suffice.

[371] arXiv:2510.14140 (replaced) [pdf, html, other]
Title: Functional and parametric identifiability for universal differential equations
Torkel E Loman, Ruth E Baker
Subjects: Dynamical Systems (math.DS)

Mechanistic knowledge of a studied system can be encoded as predictive mathematical models, but this raises the question of what to do when knowledge is uncertain or incomplete. Hybrid mechanistic/data-driven modelling, where unknown system dynamics are learnt from data using machine learning components, is a potential solution. This work focuses on one such approach, universal differential equations (UDEs), and asks when these can learn unknown dynamics from data. We investigate this question using identifiability. We show that UDE identifiability decomposes into parametric and functional identifiability, which concern the model's mechanistic and data-driven parts, respectively. We consider these two types of identifiability along a second, orthogonal, division: structural and practical identifiability, which distinguish ambiguity inherent to the model formulation from ambiguity arising under finite, noisy observations. Specifically, we consider the problem of how to assess practical identifiability for UDEs. As a modelling setting, we use ordinary differential equations derived from chemical reaction network models. Such models arise naturally across systems biology, chemistry, pharmacology, epidemiology, and population dynamics, making them a broadly relevant test case. Through a wide range of examples, we show that chemical reaction networks are a promising setting for UDEs, yielding learnt dynamics that are highly interpretable. We then examine how model properties---including the number of neural networks, the constraints imposed on them, and data availability---affect identifiability. A key finding is that generalising a fully mechanistic model to a UDE can have remarkably little impact on its identifiability. Our results provide strong evidence that UDEs offer an intuitive means of integrating data-driven elements into mechanistic models while preserving predictive capability.

[372] arXiv:2510.23392 (replaced) [pdf, html, other]
Title: Sturm-Liouville problems on graphs with Robin boundary conditions
Yuri Latushkin, Vyacheslav Pivovarchik, Alesia Supranovych
Subjects: Spectral Theory (math.SP); Mathematical Physics (math-ph)

We study characteristic functions and describe asymptotics of the eigenvalues for the spectral Sturm-Liouville problem on graphs equipped with Robin-Kirhhoff boundary conditions. Also, we show how to recover the coefficients in the Robin conditions for the quantum graphs provided the shape of the graphs and some Robin eigenvalues are known.

[373] arXiv:2510.26123 (replaced) [pdf, html, other]
Title: Directed distances in bipolar-oriented triangulations: exact exponents and scaling limits
Jacopo Borga, Ewain Gwynne
Comments: This new version of the paper includes a Lean formalization of all 90 numbered definitions, theorems, propositions, and lemmas, available at this https URL. A few minor errors have also been corrected
Subjects: Probability (math.PR); Mathematical Physics (math-ph); Combinatorics (math.CO)

We study longest and shortest directed paths in the following natural model of directed random planar maps: the uniform infinite bipolar-oriented triangulation (UIBOT), which is the local limit of uniform bipolar-oriented triangulations around a typical edge. We construct the Busemann function which measures directed distance to $\infty$ along a natural interface in the UIBOT. We show that in the case of longest (resp.\ shortest) directed paths, this Busemann function converges in the scaling limit to a $2/3$-stable Lévy process (resp.\ a $4/3$-stable Lévy process).
We also prove up-to-constants bounds for directed distances in finite bipolar-oriented triangulations sampled from a Boltzmann distribution, and for size-$n$ cells in the UIBOT. These bounds imply that in a typical subset of the UIBOT with $n$ edges, longest directed path lengths are of order $n^{3/4}$ and shortest directed path lengths are of order $n^{3/8}$. These results give the scaling dimensions for discretizations of the (hypothetical) $\sqrt{4/3}$-directed Liouville quantum gravity metrics.
The main external input in our proof is the bijection of Kenyon-Miller-Sheffield-Wilson (2015). We do not use any continuum theory. We expect that our techniques can also be applied to prove similar results for directed distances in other random planar map models and for longest increasing subsequences in pattern-avoiding permutations.

[374] arXiv:2511.01474 (replaced) [pdf, html, other]
Title: Decreasing Filtrations, $C_{2}$-Algebra and Twisted Modules
Shijie Cao, Jiancai Sun
Journal-ref: SIGMA 22 (2026), 113, 28 pages
Subjects: Quantum Algebra (math.QA)

We investigate a question posed by Gaberdiel and Gannon (2009) concerning the relationship between $C_{2}$-algebras and twisted modules. To each twisted module $W$ of a vertex algebra $V$, we first associate a decreasing sequence of subspaces $\bigl\{E_{n}^{T}(W)\bigr\}_{n\in\mathbb{Z}}$ and demonstrate that the associated graded vector space $\mathrm{gr}_{\mathcal{E}}^{T}(W)$ is a twisted module of vertex Poisson algebra $\mathrm{gr}_{\mathcal{E}}^{T}(V)$. We introduce another decreasing sequence of subspaces $\bigl\{C_{n}^{T}(W)\bigr\}_{n\in\mathbb{Z}_{\geq2}}$ and establish a connection between $\bigl\{E_{n}^{T}(W)\bigr\}_{n\in\mathbb{Z}}$ and $\bigl\{C_{n}^{T}(W)\bigr\}_{n\in\mathbb{Z}_{\geq2}}$. By utilizing the twisted module $\mathrm{gr}_{\mathcal{E}}^{T}(W)$ of vertex Poisson algebra $\mathrm{gr}_{\mathcal{E}}^{T}(V)$, we prove that for any twisted module $W$ of a vertex algebra $V$, $C_{2}$-cofiniteness implies $C_{n}$-cofiniteness for all $n\geq 2$. Furthermore, we employ $\mathrm{gr}_{\mathcal{E}}^{T}(W)$ to study generating subspaces of $\frac{1}{T}\mathbb{N}$-graded twisted modules of lower truncated $\mathbb{Z}$-graded vertex algebras.

[375] arXiv:2511.13538 (replaced) [pdf, html, other]
Title: Full range of infinite point blow-up exponents for the critical generalized KdV equation
Nailya Manatova
Subjects: Analysis of PDEs (math.AP)

For the quintic, mass critical generalized Korteweg-de Vries equation, for any $\nu \in (\frac{1}{2}, 1)$, we prove the existence of solutions in the energy space that blow up in finite time $T>0$ with the blow-up rate $\|\partial_x u(t)\|_{L^2} \sim (T-t)^{-\nu}$ (infinite point blow-up). These solutions are constructed arbitrarily close to the family of solitons and correspond to the concentration of a soliton traveling at $+\infty$ in space as $t\uparrow T$. This complements the previous results obtained in the work of Martel, Merle, Raphaël in 2015 on infinite point exotic blow-up, which were valid under the technical restriction $\nu>\frac {11}{13}$. The value $\nu=\frac 12$ corresponds to a critical case to be treated elsewhere. At the technical level, we implement a modification of the virial-energy functional, to allow all $\nu > \frac 12$ and simplify the proof of energy estimates.

[376] arXiv:2511.15876 (replaced) [pdf, html, other]
Title: Universal TT- and TQ-relations via centrally extended q-Onsager algebra
Pascal Baseilhac, Azat M. Gainutdinov, Guillaume Lemarthe
Comments: 72pp v2: refs updated, implications for generalized Gibbs ensemble discussed in Intro, minor rewritings; v3: final published version with minor changes
Journal-ref: Nucl. Phys. B 1026 (2026) 117427
Subjects: Quantum Algebra (math.QA); Statistical Mechanics (cond-mat.stat-mech); Mathematical Physics (math-ph); Representation Theory (math.RT)

Let $A_q$ be the alternating central extension of the q-Onsager algebra, a comodule algebra over the quantum loop algebra of $sl_2$. We classify one-dimensional representations of $A_q$, and show that spin-j K-operators constructed in arXiv:2301.00781 act as K-matrices previously obtained in the literature. Using these K-operators and K-matrices, we construct universal spin-j transfer matrices generating commutative subalgebras in $A_q$. Within a technical conjecture, we derive their fusion hierarchy, the so-called universal TT-relations. On spin-chain representations of $A_q$, we show how the universal transfer matrices evaluate to spin-chain transfer matrices, and as a result we get explicit TT-relations for all values of spins for auxiliary and quantum spaces, any inhomogeneities, and general integrable boundary conditions. In particular, we derive previously conjectured TT-relations. Using the TT-relations, we show that n-th local conserved quantities of the spin-j chains of length N are polynomials of total degree 4Njn in two non-local operators of the q-Onsager algebra. As a result, we give an algorithm of explicit calculation of all local conserved quantities in terms of spin operators. Furthermore, using the universal TT-relations we derive exchange relations between spin-j Hamiltonians and the two non-local operators showing non-trivial symmetries for special boundary conditions, that they commute with all Hamiltonian densities. As another application of our universal TT-relations we propose universal T-system, Y-system and universal TQ-relations for $A_q$, and as a result, universal TQ for the q-Onsager algebra. For diagonal boundary conditions, we also obtain universal TT- and TQ-relations for a degenerate version of $A_q$ known as centrally extended augmented q-Onsager algebra. We finally discuss implications of our results for generalized Gibbs ensemble construction.

[377] arXiv:2512.01817 (replaced) [pdf, html, other]
Title: Self-Normalized Bounds for Time Series with Sample Variance Only and Their Application to Forecasting
Zihao Yuan
Subjects: Statistics Theory (math.ST)

Evaluating a forecasting rule on a time series requires a risk bound that can be computed from the observed losses. Such generalization bounds rest on empirical Bernstein (EB) and self-normalized inequalities, which replace the unknown variance by a sample counterpart. These tools, however, have been developed almost exclusively for independent observations and martingale differences, and, for dependent data, the natural setting of forecasting, direct results are scarce. They require $\beta$-mixing and knowledge of the mixing coefficients, and their leading terms are not sharp. This paper fills this gap. We first establish, for martingale differences, an EB inequality in closed form that uses only the realized quadratic variation, holds with probability at least $1-\alpha$ for every sample size, and is sharp under heteroscedasticity, whereas the sharpness of existing EB inequalities is established for a constant conditional variance. Building on this, we derive EB and self-normalized inequalities for the marginal mean of $\tilde{\phi}$- and $\tau$-mixing processes, a class that contains processes that are not even strongly mixing, such as autoregressions with Bernoulli innovations. The radii use nothing but a block sample variance: no variance proxy has to be designed or tuned, and, for $\tau$-mixing processes, no dependence coefficient enters the radius. Under summability-type conditions on the dependence coefficients, their leading terms carry the constant of the oracle Bernstein inequality with the long-run variance, so, to our knowledge, these are the first sharp self-normalized inequalities under non-strong mixing conditions. As an application, we obtain a sharp upper bound on the risk of a time-series forecasting rule that is computed from its observed losses with a single block length and contains no dependence coefficient.

[378] arXiv:2512.03733 (replaced) [pdf, html, other]
Title: A Superfast Direct Solver for Type-III Inverse Nonuniform Discrete Fourier Transform
Yingzhou Li, Jingyu Liu
Subjects: Numerical Analysis (math.NA)

Various fields in scientific computing require the use of the nonuniform discrete Fourier transform (NUDFT) and its inversion. In [H. Wilber, E. N. Epperly, and A. H. Barnett, SIAM J. Sci. Comput., 47 (2025), pp. A1702-A1732], the authors proposed a direct inversion method for the type-II NUDFT, which achieves quasi-linear complexity by approximating the type-II NUDFT matrix as a product of a hierarchical semiseparable (HSS) matrix and a DFT matrix. In this article, we propose a novel superfast direct inversion method for type-III NUDFT. The proposed method approximates the type-III NUDFT matrix as a product of a type-II NUDFT matrix and an HSS matrix. This decomposition enables both the forward application and the backward inversion to be accomplished with quasi-linear complexity. The fast inversion can serve as a high-accuracy direct solver or as an efficient preconditioner. Additionally, we provide an error bound for the approximation when the sample points are independent and identically distributed uniform random variables and the frequencies are perturbed continuous integers. Numerical results are presented to verify the relevant theoretical properties and demonstrate the efficiency of the proposed methods.

[379] arXiv:2512.08395 (replaced) [pdf, html, other]
Title: Holomorphic one-forms without zeros on Kähler manifolds of Kodaira codimension one
Simon Pietig
Comments: 29 pages
Subjects: Complex Variables (math.CV); Algebraic Geometry (math.AG)

We give a bimeromorphic classification of compact Kähler manifolds of Kodaira codimension one that admit a holomorphic one form without zeros.

[380] arXiv:2512.17044 (replaced) [pdf, html, other]
Title: Geometry for Kleinian Groups Generated by a Parabolic Pair
Eric Chesebro
Comments: 129 pages, 60 figures. To appear in the Memoirs of the AMS
Subjects: Geometric Topology (math.GT)

This paper develops a computational framework for studying the hyperbolic geometry of 2-bridge link complements and Kleinian groups generated by two parabolic elements. The framework is built on Sakuma-Weeks triangulations and introduces a family of Farey recursive polynomials.
For a rational number which determines a hyperbolic 2-bridge link, this paper provides a simple recursive algorithm to determine a Farey recursive polynomial which has a root which determines the geometry of the link complement. This root is the shape parameter for a pair of tetrahedra in the Sakuma-Weeks triangulation. Using the same polynomials, the paper defines rational functions, one function for each edge in the Farey graph. Evaluating these rational functions at the root yields the complete collection of shape parameters for the triangulation.
The Riley slice and its exterior lie in the complex plane and are traditionally viewed as parameter spaces for two-parabolic generated subgroups of PSL(2,C). This paper's triangulation-based approach provides a more geometric perspective to these parameter spaces. The Farey recursive methods apply throughout the Riley slice and its exterior, enabling computations for quotient orbifolds of Kleinian groups generated by parabolic pairs, incomplete hyperbolic spaces with non-discrete parameter groups, and others. Explicit calculations include the cusp groups in the boundary of the Riley slice and singly augmented 2-bridge link complements.
Applications include: explicit computation of fundamental domains and holonomies for 2-bridge link complements; a precise correspondence between group elements and crossing circles in tangle diagrams; determination of cusp fields for 2-bridge links; geometric analysis of algebraic and geometric limits arising from Dehn surgery on singly augmented 2-bridge links; and explicit triangulations of Heckoid orbifolds.

[381] arXiv:2512.18350 (replaced) [pdf, html, other]
Title: On the sharp multi-bubble stability for fractional Hardy--Sobolev equations: a quantitative approach in low dimensions
Souptik Chakraborty, Utsab Sarkar
Comments: 45 pages. Added Appendix C on Bahri-Coron type projection and fixed minor errors. Comments welcome!
Subjects: Analysis of PDEs (math.AP)

We establish sharp quantitative multi-bubble stability for nonnegative critical points of the fractional Hardy--Sobolev inequality in the low-dimensional regime $2s<N<6s-2t$. For functions whose energy is close to that of a finite superposition of bubbles, we prove that the Euler--Lagrange deficit controls linearly the distance, in the homogeneous fractional Sobolev norm, to the multi-bubble set, and we recover the precise bubble configuration. This yields quantitative rigidity under arbitrary finite weak interactions. The proof combines a localization scheme adapted to the Hardy weight, Kato--Ponce type weighted commutator estimates, a bubble-wise spectral gap inequality, and a sharp bubble-bubble interaction analysis. We also show that the linear rate is optimal by constructing a matching counterexample.

[382] arXiv:2601.03064 (replaced) [pdf, html, other]
Title: Similarity-Sensitive Entropy under Representation Change and Inference
Joseph Samuel Miller
Comments: 26 pages. v3: Revised abstract; generalized coarse graining proof; added further directions; revised theorem statements
Subjects: Probability (math.PR); Information Theory (cs.IT)

Similarity-sensitive entropy measures the uncertainty of a probability law relative to a similarity kernel that encodes the distinguishability of states. We develop the measure-theoretic treatment covering both finite similarity matrices and general probability spaces, and study how the law and similarity kernel transform under measurable maps, channels, and conditioning operations. This yields data-processing inequalities, so a reduction in entropy quantifies how much distinguishability is lost under representation change. We also define a conditional similarity-sensitive entropy theory, give a counterexample to a recent conjecture on concavity, and identify a practical one-dimensional Laplace kernel class where concavity holds.

[383] arXiv:2601.10647 (replaced) [pdf, other]
Title: Michael-Simon inequality for anisotropic energies close to the area via multilinear Kakeya-type bounds
Guido De Philippis, Alessandro Pigati
Comments: This is the version published on Ars Inveniendi Analytica: this https URL
Journal-ref: Ars Inveniendi Analytica (2026), Paper No. 3, 33 pp
Subjects: Analysis of PDEs (math.AP); Differential Geometry (math.DG)

Given an anisotropic integrand $F:\text{Gr}_k(\mathbb{R}^n)\to(0,\infty)$, we can generalize the classical isotropic area by looking at the functional $$\mathcal{F}(\Sigma^k):=\int_\Sigma F(T_x\Sigma)\,d\mathcal{H}^k.$$ While a monotonicity formula is not available for critical points, when $k=2$ and $n=3$ we show that the Michael-Simon inequality holds if $F$ is close to $1$ (in $C^1$), meaning that $\mathcal{F}$ is close to the usual area.
Our argument is partly based on some key ideas of Almgren, who proved this result in an unpublished manuscript, but we largely simplify his original proof by showing a new functional inequality for vector fields on the plane, which can be seen as a quantitative version of Alberti's rank-one theorem, and we also remove a convexity assumption on $F$.
As another byproduct, we also show Michael-Simon for another class of integrands which includes the $\ell^p$ norms for $p\in(1,\infty)$. For a general $F$ satisfying the atomic condition, we also show that the validity of Michael-Simon is equivalent to compactness of rectifiable varifolds.

[384] arXiv:2601.21843 (replaced) [pdf, html, other]
Title: The Leibniz adjunction in homotopy type theory, with an application to simplicial type theory
Tom de Jong, Nicolai Kraus, Axel Ljungström
Comments: v4: Corrected links to Agda HTML. To appear at CSL 2027
Subjects: Category Theory (math.CT); Logic in Computer Science (cs.LO); Logic (math.LO)

Simplicial type theory extends homotopy type theory and equips types with a notion of directed morphisms. A Segal type is defined to be a type in which these directed morphisms can be composed. We show that all higher coherences can be stated and derived if simplicial type theory is taken to be homotopy type theory with a postulated interval type. In technical terms, this means that if a type has unique fillers for $(2,1)$-horns, it has unique fillers for all inner $(n,k)$-horns. This generalizes a result of Riehl and Shulman for the case $n = 3, k \in \{1, 2\}$. Our main technical tool is the Leibniz adjunction: the pushout-product is left adjoint to the pullback-hom in the wild category of types. While this adjunction is well known for ordinary categories, it is much more involved for higher categories, and the fact that it can be proved for the wild category of types (a higher category without stated higher coherences) is non-trivial. We make profitable use of the equivalence between the wild category of maps and that of families. We have formalized the results in Cubical Agda.

[385] arXiv:2601.22102 (replaced) [pdf, html, other]
Title: Integrability properties and stochastic McKean-Vlasov dynamics with singular Lennard-Jones drift: a mesoscale regularization
Ernesto M. Greco, Daniela Morale
Comments: Revised version
Subjects: Probability (math.PR)

We study the convergence of the empirical measure of moderately interacting particle systems subject to singular forces derived by Lennard-Jones potential. Although the classical Lennard-Jones force is widely used in molecular dynamics, analytical results are not available. We consider a Lennard-Jones potential with free parameters in the McKean-Vlasov framework and proceed with a regularization at the mesoscale letting the particles interact moderately. We prove the well-posedness of the McKean-Vlasov SDE involving such singular kernels and the convergence of the empirical measure towards the solution of the McKean-Vlasov Fokker-Planck PDE, by means of a semigroup approach. We derive both the range of parameters characterizing the aggregation and repulsive force and the mesoscale order for which the convergence is achieved, by obtaining the right integrability regularity of the drift.

[386] arXiv:2601.23237 (replaced) [pdf, html, other]
Title: Applications of QR-based Vector-Valued Rational Approximation
Simon Dirckx, Joar Bagge, Daan Huybrechs
Subjects: Numerical Analysis (math.NA); Mathematical Software (cs.MS)

Several applications of the QR-AAA algorithm, a greedy scheme for vector-valued rational approximation, are presented. The focus is on demonstrating the flexibility and practical effectiveness of QR-AAA in a variety of computational settings, including Stokes flow computation, multivariate rational approximation, function extension, the development of novel quadrature methods and near-field approximation in the boundary element method.

[387] arXiv:2602.05834 (replaced) [pdf, html, other]
Title: Descent properties for an abelian variety with extended Galois representation
Ludovic Felder
Comments: 19 pages, corrected an error in section 3
Subjects: Number Theory (math.NT); Algebraic Geometry (math.AG)

Let $K$ be a field, $L$ a finite Galois extension of $K$, and $X$ an abelian variety defined over $L$. If $X$ is isogenous over $L$ to an abelian variety defined over $K$, then the $\ell$-adic Galois representations associated to $X$ extend to representations $\bar{\rho}_{\ell,X}:\mathrm{Gal}(\bar{L}/K)\to\mathrm{Aut}(V_\ell X)$ for every prime $\ell$. This paper aims to show that the converse is true for abelian varieties of Type I, with some supplementary conditions needed on the endomorphisms of $X$, when $L$ is either a number field or a function field of prime characteristic different from $2$.

[388] arXiv:2602.06567 (replaced) [pdf, html, other]
Title: Markov Decision Processes of the Third Kind: Learning Distributions by Policy Gradient Descent
Nicole Bäuerle, Athanasios Vasileiadis
Subjects: Optimization and Control (math.OC)

The goal of this paper is to analyze distributional Markov Decision Processes as a class of control problems in which the objective is to learn policies that steer the distribution of a cumulative reward toward a prescribed target law, rather than optimizing an expected value or a risk functional. To solve the resulting distributional control problem, we propose a policy-gradient algorithm based on neural-network parameterizations of randomized Markov policies, defined on an augmented state space and a sample-based evaluation of the characteristic-function loss. Under mild regularity and growth assumptions, we prove convergence of the algorithm to stationary points using stochastic approximation techniques. Several numerical experiments illustrate the ability of the method to match complex target distributions, recover classical optimal policies when they exist, and reveal intrinsic non-uniqueness phenomena specific to distributional control.

[389] arXiv:2602.17982 (replaced) [pdf, html, other]
Title: Bestvina metric and tree reduction for $K(π,1)$-conjecture
Jingyin Huang
Comments: 57 pages, 5 figures
Subjects: Group Theory (math.GR); Geometric Topology (math.GT); Metric Geometry (math.MG)

We reduce the $K(\pi,1)$-conjecture for all Artin groups to properties of Artin groups whose Coxeter diagrams are trees, from which we deduce new classes of Artin groups satisfying the $K(\pi,1)$-conjecture. This relies on constructing actions of Artin groups on Bestvina complexes of suitable Garside groupoids.

[390] arXiv:2602.17983 (replaced) [pdf, html, other]
Title: From Trees to Tripods: Proof of $K(π,1)$ for Artin groups with $ABI$-type spherical parabolics
Nima Hoda, Jingyin Huang
Comments: Add new results about contractibility criterion for certain simplicial complexes, and applications to Shephard groups.58 page, 9 figures
Subjects: Group Theory (math.GR); Geometric Topology (math.GT); Metric Geometry (math.MG)

We describe contractibility criteria for typed simplicial complexes modeled on Coxeter diagrams. Such complexes include buildings and also arise as coset complexes of groups with strongly admissible parabolic systems, including Shephard groups, which generalize both Artin and Coxeter groups. Our result applies to a large class of complexes modeled on \emph{tree Coxeter diagrams} and implies deformation retraction onto a nonpositively curved subcomplex.
As an application, we reduce the $K(\pi,1)$-conjecture for all Artin groups with tree Coxeter diagrams to properties of Artin groups with tripod-shaped Coxeter diagrams. Combining this reduction theorem and properties of braid groups in previous works of Charney, Crisp-McCammond, Haettel and the second named author, we deduce that the $K(\pi,1)$-conjecture holds for every Artin group whose spherical parabolic subgroups avoid type $D_n$ ($n \ge 4$) and the exceptional types. We give an analogous tree to tripod reduction for Shephard groups.
Our proof relies on two ingredients of independent interest: a notion of combinatorial convexity and a Bestvina-type inequality in certain injective orthoscheme complexes. These ingredients further rely on the use of structural properties of bi-Helly graphs developed in joint work of the first named author with this http URL bi-Helly graphs (also known as absolute bipartite retracts) developed in joint work of the first named author with Munro.

[391] arXiv:2602.19904 (replaced) [pdf, html, other]
Title: Finitary Cartesian closed varieties and semigroup actions
Mark V Lawson
Subjects: Category Theory (math.CT)

We build on some ideas of Richard Garner. Let $M$ be a monoid and $B$ a Boolean algebra. A matched pair $[B|M]$ consists of $B$ and $M$ satisfying some axioms introduced by Garner. He then showed that every such matched pair determines a Boolean left restriction monoid $S = S[B|M]$. In this paper, we show that the data of a $[B|M]$-set, an action of a matched pair, may be encoded by means of what we call a factorizable Boolean supported action by $S$. This means that the category of $[B|M]$-sets is equivalent to the category of factorizable Boolean supported actions of $S$. We deduce, as a result of Garner's work, that every non-degenerate finitary Cartesian closed variety is equivalent to the category of factorizable Boolean supported actions of some Boolean left restriction monoid $S$.

[392] arXiv:2603.04588 (replaced) [pdf, html, other]
Title: Central Limit Theorems for Common Zeros via Bergman Kernels
Bin Guo
Comments: 67 pages, 1 figure. Substantially revised and retitled. Extends the domain CLT to weighted volumes and identifies their leading variance. Shows that conditioning all sections to vanish on the same fixed finite set preserves the leading variance and Gaussian limit. Adds a Bergman kernel criterion and an explicit lower bound for the integrated smooth variance coefficient
Subjects: Complex Variables (math.CV); Probability (math.PR)

We prove central limit theorems as \(N\to\infty\) for common-zero statistics of \(k\) independent standard Gaussian holomorphic sections of \(L^N\), where \(L\) is a positive Hermitian holomorphic line bundle over a compact Kähler manifold of complex dimension \(m\). For fixed real \(\mathscr C^3\) forms \(\varphi\) of bidegree \((m-k,m-k)\) with \(\partial\bar\partial\varphi\not\equiv0\), we prove the CLT in codimensions \(2\leqslant k\leqslant m\) and show that the integrated coefficient in the Shiffman--Zelditch variance formula at scale \(N^{2k-m-2}\) is strictly positive. Shiffman and Zelditch proved the unconditioned smooth CLT for \(k=1\). For \(1\leqslant k\leqslant m\) we also prove a CLT for weighted volumes in fixed domains \(U\) with \(\mathscr C^2\) boundary and fixed real \(\mathscr C^3\) weights \(f\) whose restriction to \(\partial U\) is not identically zero. The variance of a weighted volume is asymptotic to \(N^{2k-m-1/2}\nu_{m,k}\int_{\partial U}f^2\,\mathrm d\sigma\), with \(\nu_{m,k}>0\) the Shiffman--Zelditch boundary constant and \(\sigma\) the induced surface measure. For \(k=m\) and \(f\equiv1\), the statistic counts common zeros in \(U\). Conditioning each section to vanish on the same fixed finite set preserves the leading variance and the Gaussian limit for both classes of tests, including smooth tests for \(k=1\). The set may meet \(\partial U\). A Bergman kernel criterion yields variance bounds and the new unconditioned CLTs from a uniform local \(L^2\) Bargmann--Fock limit and integrable off-diagonal derivative bounds.

[393] arXiv:2603.07932 (replaced) [pdf, html, other]
Title: Hard/Soft NLoS Detection via Combinatorial Data Augmentation for 6G Positioning
Sang-Hyeok Kim (1), Seung Min Yu (2), Jihong Park (3), Seung-Woo Ko (1) ((1) Inha University, South Korea, (2) Korea Railroad Research Institute, South Korea, (3) Singapore University of Technology and Design, Singapore)
Comments: 24 pages, 15 figures, 13 tables. An earlier version of this work was presented in part at the IEEE Wireless Communications and Networking Conference (WCNC) 2026. This work has been submitted to the IEEE for possible publication
Subjects: Information Theory (cs.IT); Networking and Internet Architecture (cs.NI)

A key enabler for meeting the stringent requirements of 6G positioning is the ability to exploit site-dependent information governing line-of-sight (LoS) and non-line-of-sight (NLoS) propagation. However, acquiring such environmental information in real time is challenging in practice. To address this issue, we propose a novel NLoS detection algorithm termed combinatorial data augmentation-guided NLoS detection (CDA-ND), which builds upon our prior work. CDA-ND generates numerous preliminary estimated locations (PELs) by applying multilateration over many gNodeB (gNB) combinations using a single snapshot of range measurements. When a target gNB is in NLoS, the resulting PELs split into two clusters: one derived using the target gNB's range measurement and the other derived without it. Their displacement is summarized by a single vector, called the NLoS evidence vector (NEV), which is used to compute an NLoS likelihood score. Based on this score, two modes of NLoS detection are developed. First, each gNB is classified as LoS or NLoS, termed hard decision (HD), using a simple threshold test. Second, each gNB's NLoS confidence is probabilistically quantified, termed soft decision (SD), which extends HD with weak site-survey priors, namely empirical NLoS-score samples and the average NLoS probability. We then design positioning algorithms tailored to these two modes by excluding gNBs deemed NLoS and re-weighting the remaining gNBs for SD. The proposed CDA-ND achieves high reliability in indoor factory environments under frequency range 1, attaining NLoS detection accuracies of 96.8% and 91.5% when the proportion of NLoS gNBs is approximately 18% and 56%, respectively. As a result, integrating CDA-ND into positioning significantly reduces mean absolute error by about 22% and 67% in LoS- and NLoS-dominant environments, respectively.

[394] arXiv:2603.25998 (replaced) [pdf, html, other]
Title: Spectral synthesis with the complexity parameter
Shantanu Deodhar, Alex Iosevich
Comments: The manuscript now contains a sharpness example and end-point recovery of the Main Theorem under uniformity assumptions
Subjects: Classical Analysis and ODEs (math.CA); Spectral Theory (math.SP)

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

[395] arXiv:2603.26180 (replaced) [pdf, html, other]
Title: Smooth plane curves with a unique outer Galois point and their automorphism groups
Eslam Badr, Takeshi Harui
Subjects: Algebraic Geometry (math.AG)

We consider smooth plane curves $\mathcal{X}$ of degree $d\geq4$, defined over an algebraically closed field of characteristic $0$, that possess a unique outer Galois point. This geometric condition forces the curve to be a cyclic covering of the projective line, and ensures that its automorphism group fits into a specific theoretical framework. For each possible non-cyclic reduced automorphism group $\operatorname{Aut}_{\operatorname{red}}(\mathcal{X})$, we fully characterize the defining equation of $\mathcal{X}$ and the precise structure of its full automorphism group $\operatorname{Aut}(\mathcal{X})$.
This comprehensive analysis not only identifies the exact form of the equation for each automorphism type but also establishes the detailed criteria under which these scenarios can occur, thereby offering a complete classification of defining equations for smooth plane curves with a unique outer Galois point and a non-cyclic reduced automorphism group.

[396] arXiv:2603.28745 (replaced) [pdf, html, other]
Title: Weakly special varieties, Campana stacks, and Remarks on Orbifold Mordell
Finn Bartsch, Ariyan Javanpeykar
Comments: 47 pages. v2 is an expansion of v1. Appendix B has been added. Theorem G and Corollary H are new. Section 2 was improved. Comments more than welcome
Subjects: Algebraic Geometry (math.AG); Number Theory (math.NT)

We construct the first weakly special surfaces that are not Campana-special, including the complement of the plane curve $x^2y^3 = 1$ in $\mathbb{A}^2$. We prove that the set of $\mathcal{O}_{K,S}$-integral points on this surface is non-dense for every number field $K$ and finite set $S$ of finite places of $K$ if and only if Campana's Orbifold Mordell conjecture holds for $(\mathbb{G}_m, \tfrac{1}{2}[1])$. This basic example carries a natural $\mathbb{G}_m$-action, and the quotient stack is an Artin stack parametrizing points on a C-pair. This leads to the introduction of "Campana stacks", which encode morphisms of C-pairs in a manner analogous to the role of root stacks for integral points satisfying prescribed divisibility conditions.

[397] arXiv:2603.29157 (replaced) [pdf, html, other]
Title: Hodge Structures in Sextic Fourfolds Equipped with an Involution
Benjamin E. Diamond
Comments: Various improvements. Note that q = 2 suffices; improve Theorems 2.3 and 2.13
Subjects: Algebraic Geometry (math.AG)

To each ternary sextic $f(X_0, X_1, X_2)$ whose associated plane curve is smooth, the Shioda construction attaches a smooth sextic fourfold $X \subset \mathbb{P}^5$ whose defining equation $f(X_0, X_1, X_2) - f(Y_0, Y_1, Y_2)$ is fixed under the involution $\iota : (X_0, X_1, X_2, Y_0, Y_1, Y_2) \mapsto i \cdot (Y_0, Y_1, Y_2, -X_0, -X_1, -X_2)$. The induced action $\iota^* : H^4(X, \mathbb{Q}) \to H^4(X, \mathbb{Q})$ fixes a Hodge substructure $H \subset H^4(X, \mathbb{Q})$ whose Hodge coniveau is 1. By the general Hodge conjecture, we expect that there should exist a divisor $Y \subset X$ for which $H \subset \ker\left( H^4(X, \mathbb{Q}) \to H^4(X \setminus Y, \mathbb{Q}) \right)$. We verify this prediction in case the Waring rank of $f(X_0, X_1, X_2)$ takes on its minimum possible value, partially answering a question of Voisin (J. Math. Sci. Univ. Tokyo '15).

[398] arXiv:2603.29609 (replaced) [pdf, html, other]
Title: On intersections of function fields
Fedor Pakovich
Subjects: Algebraic Geometry (math.AG); Complex Variables (math.CV)

Let $X:\mathcal{E}\rightarrow\mathcal{R}$ and $Y:\mathcal{E}\rightarrow\mathcal{T}$ be holomorphic maps between compact Riemann surfaces such that $X^*M(\mathcal{R})\cdot Y^*M(\mathcal{T})=M(\mathcal{E})$, where $M(\mathcal{S})$ denotes the field of meromorphic functions on a Riemann surface $\mathcal{S}$. We study the problem of determining when the degree $[M(\mathcal{E}):X^*M(\mathcal{R})\cap Y^*M(\mathcal{T})]$ is finite and attains the minimal possible value $\mathrm{deg}\,X\cdot\mathrm{deg}\,Y$. When $X$ is a Galois covering, we give a complete characterization in terms of factorizations of $Y$ into an equivariant map followed by a Galois covering. We also establish some results without the maximality condition, as well as general results on the functional equation $A\circ X=B\circ Y$ when one of the maps involved is a Galois covering.

[399] arXiv:2604.02058 (replaced) [pdf, html, other]
Title: Faster Symmetric Rendezvous on Four or More Locations
Javier Cembrano, Felix Fischer, Max Klimm
Subjects: Optimization and Control (math.OC); Computer Science and Game Theory (cs.GT)

In the symmetric rendezvous problem, two players follow the same (randomized) strategy to visit one of $n$ locations in each time step $t=0,1,2,\dots$. Their goal is to minimize the expected time until they visit the same location and thus meet. A canonical strategy due to Anderson and Weber (J. Appl. Probab., 1990) is known to be optimal for $n=2$ and $n=3$ (Weber, Math. Oper. Res. 2012), but whether it remains optimal for larger values of $n$ has been an open question since 1990. We show that it does not remain optimal: for any finite $n\geq 4$, we construct an explicit symmetric strategy that achieves a strictly smaller expected meeting time than the Anderson-Weber strategy.
In the Anderson-Weber strategy players stay at a dedicated home location for $n-1$ steps with a certain probability $\theta$ and with the remaining probability tour all non-home locations in a random order. Our improving strategy introduces carefully chosen correlations between consecutive tours of the non-home locations. The construction is uniform in $n$ and is guided by a graph-theoretic view in which tours correspond to permutations and meetings to edges in the complement of the derangement graph. By exploiting the clique structure of this graph we obtain a correlated strategy that improves on the Anderson-Weber strategy. For $n=4$, we give an exact expression for the improvement; for any $n\geq 5$, we obtain a lower bound on the expected improvement of $\frac{483(1-\theta)^6}{(n-1)^8}$, where $\theta \in [0,1)$ is the probability of staying at the home location. The graph-theoretic framework we introduce may be useful more widely in the design and analysis of correlated strategies for rendezvous.

[400] arXiv:2604.02516 (replaced) [pdf, html, other]
Title: A rational model for the fiberwise THH transfer I: Sullivan algebras
Florian Naef, Robin Stoll
Comments: 74 pages. Comments welcome! v3: Improved introduction
Subjects: Algebraic Topology (math.AT); K-Theory and Homology (math.KT); Rings and Algebras (math.RA)

Given a map $f$ of fibrations over a space $B$ such that the fiber of $f$ is simply connected and finitely dominated, we prove that its fiberwise THH transfer, considered as a map of parametrized spectra over $B$, is rationally modeled by the Hochschild homology transfer of a Sullivan model of $f$. The proof goes in two steps. Firstly, we use the machinery of higher categorical traces to show that the fiberwise THH transfer can be computed internally to parametrized spectra. Secondly, we model the resulting description rationally using work of Braunack-Mayer, who proved that parametrized spectra can be modeled by modules over Sullivan algebras. In Part II, we will use our result to obtain a rational model of the Becker-Gottlieb transfer, and for applications to manifold topology.

[401] arXiv:2604.06822 (replaced) [pdf, html, other]
Title: Non-RS type cyclic MDS codes over finite fields via cyclotomic field reduction
Can Xiang, Chunming Tang
Comments: 17pages
Subjects: Information Theory (cs.IT)

Cyclic maximum distance separable (MDS for short) codes are a special subclass of linear codes and have received a lot of attention, as these codes have very important applications in many areas including quantum codes, designs and finite geometry. However, the existing construction methods for cyclic MDS codes mainly rely on strict restrictions on certain parameters or involve relatively complex procedures. In this paper, we investigate this problem further via norm reduction in cyclotomic fields. By converting the verification of the MDS property over a finite field into checking non-zero minors in characteristic zero, we propose a construction method of cyclic MDS codes over finite fields via cyclotomic field reduction. Based on this method, we obtain several cyclic MDS codes over finite fields and many non-RS type cyclic MDS codes are produced. Compared with the existing construction method in [Non-Reed-Solomon Type Cyclic MDS Codes, IEEE Trans. Inf. Theory, 71(5): 3489--3496, 2025], we give a new and relatively direct characterization method for constructing cyclic MDS codes over finite fields and the obtained non-RS cyclic MDS codes have flexible parameters in terms of the code length $n$, the defining set $J$, and the underlying finite field $\mathbb{F}_q$.

[402] arXiv:2604.20883 (replaced) [pdf, html, other]
Title: Linear Response for Bernoulli Convolutions
Jianning Fu
Subjects: Dynamical Systems (math.DS); Classical Analysis and ODEs (math.CA)

Let $\mu_{\lambda}$ be the Bernoulli convolution measure with parameter $\lambda\in(0,1)$. We study the regularity of
the function
%We prove that
$h=h_{\phi}:\lambda\mapsto \int_{\mathbb{R}}\phi(x)\,d\mu_{\lambda}(x)$
for Hölder observables $\phi$. We describe sufficient conditions for both smoothness and non smoothness of this function.
In particular, we show that for almost every function with respect to certain Wiener like measures on $C[0,1]$,
$h_\phi$ exhibits a phase transition: it is almost nowhere differentiable for small
$\lambda$ and it is almost everywhere differentiable for large $\lambda.$

[403] arXiv:2604.25535 (replaced) [pdf, html, other]
Title: The SK model with a sparse variance profile: free energy and AMP-based magnetization estimation at high temperature
Walid Hachem
Subjects: Mathematical Physics (math-ph); Probability (math.PR)

A generalization of the Sherrington-Kirkpatrick model for spin glasses is considered, in which the interaction matrix is endowed with a variance profile that has no particular structure and may be sparse. In the first part of the paper, an asymptotic equivalent of the free energy is derived at sufficiently high temperatures, regardless of the signature of the variance profile matrix. In the second part, the mean of the spin vector under the Gibbs measure is estimated using an Approximate Message Passing algorithm that generalizes the one used for the SK case. The dynamical approach of Adhikari et al (J Stat Phys 2021), originally developed for the classical SK model, is adapted to the present setting to obtain these results.

[404] arXiv:2604.26701 (replaced) [pdf, html, other]
Title: Explicit Planar Finite Element Elasticity Complexes and $C^1$ Elements on Barycentric Refinements
Chunyu Chen, Long Chen, Xuehai Huang
Comments: 22 pages, 4 figures
Subjects: Numerical Analysis (math.NA)

We give a closed-form realization of the finite element elasticity complex associated with the Arnold--Douglas--Gupta family on barycentric refinements. Their construction implies the existence of minimal $C^1$ potential spaces, but does not provide explicit general-degree scalar enrichments. On each macrotriangle, we derive three divergence-free stress enrichments and their Airy potentials. For every degree $q\geq4$, the resulting potential space enriches $\mathbb P_q$ by three explicit functions. A geometric decomposition yields unisolvent degrees of freedom and $C^1$ assembly without vertex supersmoothness. The space attains the dimension bound for macroelements containing $\mathbb P_q$ with full polynomial boundary trace freedom. Its Airy image is the divergence-free subspace of the corresponding stress space, and global assembly gives an exact discrete elasticity complex on simply connected domains. The low-order spaces $U_2$ and $U_3$ recover the reduced and full Hsieh--Clough--Tocher spaces, respectively.

[405] arXiv:2604.26741 (replaced) [pdf, html, other]
Title: Analytically Characterized Optimal Power Control for Signal-Level-Integrated Sensing, Computing and Communication in Federated Learning
Paul Zheng, Yao Zhu, Xiaopeng Yuan, Yulin Hu, Anke Schmeink
Journal-ref: IEEE Transactions on Wireless Communications, vol. 25, pp. 25941-25958, 2026
Subjects: Information Theory (cs.IT); Signal Processing (eess.SP); Optimization and Control (math.OC)

In next-generation wireless edge systems, efficient functionality integration is essential to address the growing demands of communication, computation, and sensing. Signal-level integrated sensing, computing, and communication (Sig-ISCC) is envisioned, where a single waveform simultaneously supports sensing, computing and communication via over-the-air computation (AirComp). Meanwhile, federated learning (FL) is widely regarded as a promising distributed machine learning framework that enables network intelligence in a privacy-preserving and secure manner, and exhibits strong synergy with AirComp, which alleviates the communication bottleneck of FL. In this paper, we study uplink Sig-ISCC design for AirComp-FL with joint target detection. We formulate the joint power and receive-scaling control problem, where edge devices' transmitted signals should serve both sensing and AirComp purposes. The goal is to minimize the AirComp aggregation distortion subject to a joint target-detection requirement. Although the resulting problem is non-convex in the original variables, we show that it admits an equivalent convex reformulation after a suitable variable transformation. By exploiting analytical optimality properties, we develop a robust, optimal, and polynomial-time-complexity algorithm that efficiently achieves the optimal transmit powers and receive scaling factor. Simulation results validate the optimality and numerical robustness of the proposed algorithm and show its superior FL performance compared to baseline methods.

[406] arXiv:2605.02254 (replaced) [pdf, html, other]
Title: A complete classification of perfect state transfer in Grover walks on Cayley graphs over dihedral groups
Koushik Bhakta, Bikash Bhattacharjya, Xiwang Cao
Subjects: Combinatorics (math.CO); Quantum Physics (quant-ph)

We give a complete classification of Cayley graphs over dihedral groups that exhibit perfect state transfer between vertex states in Grover walks. For $n\ge 3$, let $D_n:=\langle a,b : a^n=b^2=1,\ bab=a^{-1}\rangle$ be the dihedral group of order $2n$, and let $S\subseteq D_n\setminus\{1\}$ satisfying $S=S^{-1}$ and $\langle S\rangle =D_n$. We show that the Cayley graph $\operatorname{Cay}(D_n,S)$ exhibits perfect state transfer if and only if $(D_n,S)$ is equivalent to one of the following pairs: $(D_n,\{b,ba\})$; $(D_n,\{a,a^{-1},ba,ba^{-1}\})$, where $4$ does not divide $n$; or $(D_{2m},\{b,ba^{m},ba,ba^{m+1}\})$, where $m$ is odd. Our proof combines the representation theory of $D_n$ with tools from algebraic number theory.

[407] arXiv:2605.02754 (replaced) [pdf, html, other]
Title: Transferability of Error Bounds and the Kurdyka-Łojasiewicz Property under $C^1$ Partial Smoothness
Hanju Wu, Ching-pei Lee, Yue Xie
Subjects: Optimization and Control (math.OC)

This work studies how a generalized error bound (GEB) property in the ambient Euclidean space transfers to the active manifold under $C^1$ partial smoothness. The GEB generalizes the standard error bound, which upper bounds the distance to a subset of critical points using first-order stationarity residuals, by allowing the distance to be composed with a gauge function. In the ambient space, these residuals are measured by the subdifferential or the slope of the original function, while on the manifold they are measured by the Riemannian gradient or the slope of the restricted function. We develop complementary geometric and metric analyses to show that the ambient and manifold GEBs are equivalent with the same gauge function. The geometric argument shows that the projection of the subdifferential onto the tangent space coincides with the Riemannian gradient, while the metric approach combines slope estimates, identifiability, and a new uniform linear-growth result for $C^1$ manifolds. We further extend our analysis to establish the analogous equivalence for the Kurdyka--Łojasiewicz (KL) property, with the same desingularizer, and separately characterize their connections with the GEB. Finally, for regularized optimization, we relate subdifferential and proximal error bounds, thereby placing the previously established equivalence between proximal and manifold error bounds for $\ell_1$-regularization within a broader framework.

[408] arXiv:2605.03300 (replaced) [pdf, html, other]
Title: Smoothed estimation of Wasserstein barycenters
Pengtao Li, Changbo Zhu, Xiaohui Chen
Subjects: Statistics Theory (math.ST)

This paper studies the statistical estimation of exact Wasserstein barycenters. Existing non-asymptotic results for empirical barycenters exhibit a severe curse of dimensionality. Motivated by the semi-dual formulation of the barycenter problem and its associated Sobolev optimization geometry, we develop a smoothness-aware approach that combines density estimation with Sobolev geometric structure to estimate the population barycenter. We establish nonparametric convergence rates for estimating both the barycenter functional and its minimizer, demonstrating how smoothness can substantially improve statistical performance.

[409] arXiv:2605.05043 (replaced) [pdf, html, other]
Title: Finding accurate eigenvalues and eigenvectors of positive semi-definite matrices given a subspace
Yuji Nakatsukasa, Zheng Tang
Comments: Revised based on reviewer feedback
Subjects: Numerical Analysis (math.NA)

We revisit a classical problem in numerical linear algebra: given a $k$-dimensional subspace $\mathcal{Q}$ with orthonormal basis $Q$ that approximates the leading eigenspace of an $n\times n$ positive semi-definite matrix $A$, the goal is to extract high-accuracy eigenvalues. The Rayleigh-Ritz (RR) method is the standard algorithm for the task, which has been shown to be optimal in several ways (when $A$ is symmetric, not necessarily positive semi-definite $A\succeq 0$). In this paper, we show that when $A\succeq 0$, alternative methods can outperform RR, including Nystr{ö}m and one-sided projected SVD, while having the same computational complexity; that is, the main cost is in computing $AQ$, plus an $O(nk^2)$ term. In particular, we advocate the use of Nystr{ö}m's method, quantitatively showing that the approximate leading eigenvalues have better accuracy than RR, and the improvement can be arbitrarily large. The significant accuracy improvement occurs for the first $i$ eigenvalues if $\lambda_i \gg \lambda_{k+1}$ and uniformly for all $k$ eigenvalues if $\lambda_k \gg \lambda_{k+1}$. This theoretical observation can be extended to the case where we extract $k$ leading eigenvalues from a larger-dimensional subspace. A similar improvement is numerically observed for the purpose of approximating the leading eigenvectors. In contrast, when the target eigenvalues are the trailing ones, the situation is reversed, and the Nystr{ö}m method performs poorly; we suggest a remedy based on a shift for this situation.

[410] arXiv:2605.12063 (replaced) [pdf, html, other]
Title: Memory Constrained Adversarial Hypothesis Testing
Malhar A. Managoli, Vinod M. Prabhakaran
Subjects: Information Theory (cs.IT)

We study adversarial binary hypothesis testing under memory constraints. The test is a time-invariant randomized finite state machine (FSM) with S states. Associated with each hypothesis is a set of distributions. Given the hypothesis, the distribution of each sample is chosen from the set associated with the hypothesis by an adversary who has access to past samples and the history of states of the FSM so far. We obtain upper and lower bounds on the minimax asymptotic error probability that are tight to within one state. These bounds determine the exact error exponent in S, and coincide under a weak least-favourability condition. For time-invariant deterministic FSMs, we also extend known achievable error-exponent bounds from the non-adversarial Bernoulli setting to the adversarial case with parameters in two separated intervals.

[411] arXiv:2605.15783 (replaced) [pdf, html, other]
Title: Set-indexed and multiple sums in high dimensions
Bochen Jin, Alexander Marynych, Ilya Molchanov
Subjects: Probability (math.PR)

We consider multiple and set-indexed sums of random vectors taking values in Euclidean space of growing dimension. It is shown that, when viewed as finite metric spaces, the sets of values of such sums converge in probability. The limit is identified as a generalization of the Wiener spiral, which appears as the high-dimensional limit of single-index sums.

[412] arXiv:2605.17702 (replaced) [pdf, html, other]
Title: Boundary Behavior of Bisectional Curvatures for Weighted Bergman Metrics
Sungmin Yoo
Subjects: Complex Variables (math.CV); Differential Geometry (math.DG)

This paper investigates the asymptotic boundary behavior of the holomorphic bisectional curvature for weighted Bergman metrics. By characterizing extremal functions via $L^2$-orthogonal projections, we establish an explicit formula for the weighted bisectional curvature. Utilizing the squeezing function, we then obtain quantitative upper and lower bounds for the curvature on bounded pseudoconvex domains. Furthermore, we prove that at strongly pseudoconvex boundary points, the bisectional curvature asymptotically coincides with that of the unit ball. As an application, these results provide a streamlined and unified proof for the known asymptotic behavior of the bisectional curvature of the Kähler-Einstein metric.

[413] arXiv:2605.29371 (replaced) [pdf, html, other]
Title: Kernel-based potential mean-field games with unbiased random Fourier $U$-statistics
Yumiharu Nakano
Subjects: Optimization and Control (math.OC); Machine Learning (cs.LG); Numerical Analysis (math.NA); Machine Learning (stat.ML)

We study the subclass of potential mean-field games in which the running interaction cost and the terminal target cost are both expressed through reproducing-kernel maximum mean discrepancy (MMD) penalties, and develop a computational framework that exploits this kernel structure. Both costs are estimated from finite-sample empirical distributions using a random Fourier U-statistic representation that is unbiased and has linear cost in the batch size. The drift of the controlled diffusion is parametrized by a neural network and trained via stochastic gradient descent. For population near-minimizers we prove convergence to the terminal-constrained problem as the penalty diverges, and show that the same limit is recovered almost surely when such controls are evaluated on independent finite samples under explicit coupling conditions on the penalty, random-feature count and sample size. The framework includes the kernel-MMD-penalty Schr{ö}dinger bridge problem as the special case of a vanishing interaction cost. Numerical experiments illustrate the method on the Schr{ö}dinger bridge problem in dimensions up to one hundred, and on an electric vehicle charging coordination problem with per-vehicle physical heterogeneity, where a control-dependent aggregate-demand cost produces a trade-off between peak normalized charging power and the terminal service level.

[414] arXiv:2605.30243 (replaced) [pdf, html, other]
Title: Non-monotone clustering and energetic regime switching in aggregation-diffusion systems
Nathalie Wehlitz, Richard Scherzer, Carsten Hartmann, Stefanie Winkelmann
Comments: 25 pages, 11 figures
Subjects: Dynamical Systems (math.DS); Probability (math.PR)

We investigate transient clustering dynamics in nonlocal aggregation-diffusion systems from an energetic perspective. Starting from a stochastic interacting particle system, we study the associated macroscopic McKean-Vlasov equation on the torus and use its Wasserstein gradient-flow structure to analyse the competition between interaction-driven aggregation and entropy-driven diffusion. Through numerical experiments for locally attractive interaction kernels, we observe non-monotone clustering behaviour in intuitive geometric observables: in particular, the density peak height may first increase and subsequently decrease along trajectories converging to equilibrium. Using the decomposition of the free energy as a diagnostic, we identify alternating aggregation- and diffusion-dominated regimes underlying these transient dynamics. We investigate to what extent transitions between these regimes are related to the evolution of geometric observables, such as the peak height. Our results illustrate how non-monotone transient clustering can arise even in a dissipative gradient-flow system and highlight the complementary information provided by geometric clustering observables and the free-energy-based regime classification.

[415] arXiv:2606.01531 (replaced) [pdf, html, other]
Title: Proof of Dittert's conjecture for dimensions $n\ge 17$
Zhekai Pang
Comments: 8 pages
Subjects: Rings and Algebras (math.RA)

Dittert's conjecture gives a sharp upper bound for the Dittert functional on nonnegative matrices whose entries sum to $n$. It extends the van der Waerden permanent problem from the doubly stochastic polytope to a larger simplex in which row and column sums are allowed to vary. We prove the conjecture for every dimension $n\ge 17$. The proof combines the Knopp--Sinkhorn lower bound for boundary points of the doubly stochastic polytope with a refined scaling step in the Cheon--Wanless method. The main improvement is a subset-sum estimate for the row and column sums of a near maximizer that is sharper for subset sizes in the central range and reduces the scaling factor needed to obtain a doubly superstochastic matrix. This strengthened comparison is sufficient to exclude boundary maximizers in all dimensions $n\ge 17$, and the known positive-support characterization then identifies the unique maximizer as $n^{-1}J_n$.

[416] arXiv:2606.03062 (replaced) [pdf, html, other]
Title: On $\mathbb J$-strata with Parahoric Stabilizers in Affine Deligne-Lusztig Varieties
Ryosuke Shimada
Comments: 42 pages. The proofs have been substantially simplified, and the paper is now much shorter
Subjects: Algebraic Geometry (math.AG); Number Theory (math.NT)

In this paper, we study the $\mathbb J$-stratification of basic affine Deligne-Lusztig varieties for a minuscule cocharacter $\mu$. This stratification was introduced by Chen-Viehmann and has been expected to serve as an interesting tool for studying basic loci in Shimura varieties. We parametrize the $\mathbb J$-strata whose stabilizers in the Frobenius-twisted centralizer group are parahoric by constructing a natural bijection to combinatorial invariants called small cocharacters. We further prove that the cardinality of these sets is equal to that of a certain subset of the Weyl group orbit of $\mu$. A relationship with the weakly fully Hodge-Newton decomposability of Chen-Tong is also discussed.

[417] arXiv:2606.24537 (replaced) [pdf, html, other]
Title: Importance Sampling for Event Discovery via Guesswork
Asaf Cohen
Comments: Short version submitted to ITW 2026. This is a longer version after being accepted to ITW, correcting reviewers comments, organizing and rephrasing, and adding more complete proofs, comments, etc
Subjects: Information Theory (cs.IT)

Traditional importance sampling (IS) is designed to estimate rare-event probabilities by minimizing estimator variance. However, many applications prioritize rapid discovery: the generation of a trajectory within a rare set $A_n$. This requires a shift from ensemble-based estimation to a design principle focused on the hitting time $\tau_{A_n} := \inf\{t \ge 1 : Y_t^n \in A_n\}$.
We formalize a Quality of Discovery problem as the problem of minimizing the description length (surprisal) of the discovered trajectory under the nominal model $p$. We prove that minimizing this description length is equivalent to minimizing the nominal rank exponent $J_{\mathrm{rank}}(q_n) := \lim_{n\to\infty} \frac{1}{n} \log G_n(Y^n)$, where $G_n(x^n)$ is the guesswork of sequence $x^n$. For i.i.d.\ models and type-defined rare sets $\Gamma$, we show that while classical IS targets the mass-dominating type $Q_{\mathrm{IS}}^* \in \arg\min_{Q \in \Gamma} D(Q\|p)$, discovery optimality is achieved by $Q_{\mathrm{GW}}^* \in \arg\min_{Q \in \Gamma} [H(Q) + D(Q\|p)]$. This framework identifies a fundamental rule: minimizing the guesswork exponent ensures the discovered sequence is the "least surprising" representative of the set relative to the nominal model's search order. We further demonstrate that under budgetary constraints, this exponent serves as a lexicographic tie-breaker when the hitting-time minimizer is not unique. This establishes $H(Q) + D(Q\|p)$ as a natural objective for discovery-based importance sampling, providing a formal bridge between randomized sampling and systematic search.

[418] arXiv:2606.25560 (replaced) [pdf, html, other]
Title: Equivariant Cleft Extensions and Singular Equivalences
Miltiadis Karakikes
Comments: 16 pages. v3: Final Version
Journal-ref: Bull. Hellenic Math. Soc. 70 (2026) 43-64
Subjects: Representation Theory (math.RT); Category Theory (math.CT); Rings and Algebras (math.RA)

We study the equivariant lifting of cleft extensions of abelian categories and its impact on singularity categories. Specifically, we establish the framework for lifting a cleft extension to a G-equivariant cleft extension. Furthermore, we prove that a restriction functor associated to a cleft extension induces a singular equivalence if and only if its equivariant counterpart does. As a concrete application, we demonstrate that the skew group ring of a $G$-equivariant $\theta$-extension is isomorphic to a $\widehat{\theta}$-extension of the base skew group ring, allowing us to lift singular equivalences for these structures.

[419] arXiv:2606.29553 (replaced) [pdf, html, other]
Title: An annihilation-number Caro-Wei bound: a TxGraffiti conjecture and an independence-number bracket
Chakshu Gupta
Comments: 9 pages
Subjects: Combinatorics (math.CO); Discrete Mathematics (cs.DM)

Computable independence bounds give intervals that can be compared by containment or by their worst-case endpoint ratios. For positive maximum degree $\Delta$, the Caro-Wei sum $W$ bounds the independence number from below, while $(\Delta+1)W/2$ bounds it from above. A second interval has the Havel-Hakimi residue as its lower endpoint and the annihilation number as its upper endpoint. This note proves that the annihilation number does not exceed the Caro-Wei upper endpoint. This upper bound is sharp, with equality for regular graphs of positive degree and even order. Since the residue is at least $W$, this upper bound places the residue-annihilation interval inside the Caro-Wei interval. Both endpoints can improve strictly on one graph, although the sharp worst-case endpoint ratio remains unchanged, even for connected graphs. The annihilation-number bound also proves a conjectured lower estimate based on the annihilation number and residue for every connected graph with at least three vertices. Equality in this estimate holds for exactly eight graph types, while the single edge violates it. For maximum degree at least three, however, the estimate never exceeds the residue, even without connectedness.

[420] arXiv:2607.00458 (replaced) [pdf, other]
Title: Kinetic Fokker-Planck Equations with Nonlinear Diffusion
Zimo Hao, Zhengyan Wu, Xicheng Zhang
Subjects: Analysis of PDEs (math.AP); Probability (math.PR)

We study existence, regularity, and uniqueness for the nonlinear kinetic Fokker--Planck equation $$
\partial_t f=\Delta_v\Psi(f)-v\cdot\nabla_x f,
\qquad f|_{t=0}=f_0, $$ on $\mathbb R^{2d}$. In the model case $\Psi(r)=r^s$, this equation couples nonlinear fast-diffusion/porous-medium type diffusion with kinetic transport. A distinctive feature is that the diffusion acts only in the velocity variable $v$, so that compactness in the spatial variable $x$ cannot be obtained from standard elliptic estimates and must instead be recovered through the hypoelliptic structure.
Under general structural assumptions on $\Psi$, including the fast-diffusion powers $\Psi(r)=r^s$ with $s\in(0,1)$, we construct nonnegative weak solutions and prove quantitative anisotropic Besov regularity estimates. Under an additional mass-critical growth condition on the fast-diffusion side, the constructed weak solution preserves mass, admits a renormalized kinetic formulation, and is unique in the $L^1$-class of mass-preserving renormalized kinetic solutions. In the power-law case $\Psi(r)=r^s$, this condition is precisely $s\ge 1-1/d$ when $d\ge2$, while in dimension $d=1$ the whole fast-diffusion range $s\in(0,1)$ is covered.
The main analytic ingredient is a parameter-dependent smoothing estimate for the kinetic semigroup generated by $$
\Psi'(\zeta)\Delta_v - v\cdot\nabla_x , $$ which quantitatively tracks the dependence on the kinetic level $\zeta$. Combined with the kinetic formulation, this estimate yields compactness in both spatial and velocity variables for the nonlinear hypoelliptic problem. As an application, we also obtain martingale-problem solutions to the associated distributional-density dependent stochastic differential equation.

[421] arXiv:2607.04365 (replaced) [pdf, other]
Title: Certified Minimal-Prime Branch Closures for Odd Perfect Numbers
Marco Mantovanelli
Comments: Withdrawn due to a gap in Section 7, in the applications of Lemma 7.3 through Definition 7.4. The lower bound B = 59 for remaining support primes and the upper bound M = 18 for their number are unproved. The numerical checks do not establish them. Thus the claimed closures for minimal primes q = 5, 7, 11, 13, 17 remain unproved
Subjects: General Mathematics (math.GM)

For an odd perfect number $N$, write $q=\min\{p:p\mid N\}$ for its smallest prime divisor. This paper proves a certified branch-closure theorem for the five minimal-prime branches $q=5,7,11,13,17$. The proof combines the exact $q$-adic valuation balance for $\sigma(N)=2N$ with lower-prime avoidance: primes below $q$ cannot occur in the support and therefore cannot divide any divisor-sum factor. These constraints reduce each branch to a finite first-input coverage split and then to terminal forced-or-pure cofactor records. The terminal records are checked by the frozen certificate release C-small-2026-07, consisting of JSONL certificate bundles, Python verifier scripts, expected terminal outputs, and SHA256 hashes. The $q=5$ branch is presented as the detailed audit model, while the branches $q=7,11,13,17$ are closed by the same forced-or-pure mechanism. The result is scoped: it does not prove nonexistence of odd perfect numbers, and the branches $q=3$ and $q\ge 19$ remain outside the paper.

[422] arXiv:2607.08389 (replaced) [pdf, html, other]
Title: On $q$-pre-Lie algebras
Chengyang Lu, Yanyong Hong
Comments: 27 pages. Section 4 is rewritten
Subjects: Rings and Algebras (math.RA)

In this paper, we introduce the notion of $q$-pre-Lie algebras from the perspective of representations of Lie algebras, providing a parametrized generalization that unifies pre-Lie algebras and anti-pre-Lie algebras. For a $q$-pre-Lie algebra $(A,\circ)$, the commutator of $\circ$ is a Lie bracket and the left multiplication operator scaled by $q$ gives a representation of the associated commutator Lie algebra. We also introduce the notions of $q$-$\mathcal{O}$-operators and $q$-Novikov algebras, and investigate their relationships with $q$-pre-Lie algebras. Several explicit constructions of $q$-pre-Lie algebras are provided. Moreover, we give a complete classification of graded $q$-pre-Lie algebra structures on the Witt algebra and investigate a class of compatible $q$-pre-Lie algebra structures on the Virasoro algebra. Finally, we classify all compatible $q$-pre-Lie algebra structures on finite-dimensional complex simple Lie algebras. We show that every finite-dimensional complex simple Lie algebra admits a compatible $q$-pre-Lie algebra structure precisely when $q=2$, except for $\mathfrak{sl}_2(\mathbb{C})$, which also admits such a structure when $q=-1$. In particular, the compatible anti-pre-Lie algebra structures on $\mathfrak{sl}_2(\mathbb{C})$ are parametrized by invertible anti-derivations.

[423] arXiv:2607.23429 (replaced) [pdf, html, other]
Title: Convergence for the porous medium equation with combustion in higher dimensions
Maolin Zhou
Subjects: Analysis of PDEs (math.AP)

\paper{Lou--Zhou}{JEMS}{2026} proved convergence and sharp threshold results for the one-dimensional porous medium equation with combustion reaction. In this paper, we extend these results to radially symmetric solutions with compactly supported initial data in higher dimensions. Under suitable assumptions on the reaction term, we first prove that every solution converges to a stationary solution. Based on this result, we obtain a spreading--transition--vanishing trichotomy with a sharp threshold. When $N=2$, transition solutions converge to the ignition temperature $\theta$ locally uniformly in $\mathbb R^2$ as $t\to\infty$. When $N\ge3$, they converge to positive ground state solutions uniformly in $\mathbb R^N$ as $t\to\infty$. The main difficulty is to exclude $\theta$ from the $\omega$-limit set when $N\ge3$. We prove this by normalizing the difference $u-\theta$, estimating the resulting limit with the heat kernel, and applying the radial zero number argument. In contrast, when $N=1$ or $N=2$, the $\omega$-limit set of a transition solution is $\{\theta\}$.

[424] arXiv:2607.26158 (replaced) [pdf, html, other]
Title: On phase-lock area parquet in a special slow-fast limit of model of Josephson junction
Alexey Glutsyuk
Comments: 55 pages, 14 figures. Minor editorial corrections are made and some figures are improved
Subjects: Dynamical Systems (math.DS)

B Josephson (Nobel Prize, 1973) predicted a tunnelling effect for a system of two superconductors separated by a narrow dielectric (such a system is called Josephson junction): existence of a supercurrent through it and equations governing it. The overdamped Josephson junction is modeled by the family of differential equations on the 2-torus, $\frac{d\theta}{d\tau}=\frac1{\omega}(\cos\theta+B+A\cos\tau)$, which is known as the RSJ model. It depends on three parameters: $B$ called the abscissa, $A$ called the ordinate, and a fixed frequency $\omega$. We study its rotation number $\rho(B,A;\omega)$ as a function of $(B,A)$ and the phase-lock areas: those its level subsets that have non-empty interiors. They exist only for integer values of the rotation number (Buchstaber, Karpov, Tertychnyi). In this paper we study asymptotics of the phase-lock area portrait in a special slow-fast limit, as $\omega\to0$ and $(B,A)\to(0,1)$ so that $(B,A)-(0,1)=O(\omega)$. We show that in the rescaled parameters $\ell:=\frac B{\omega}$ and $u:=\frac{A-1}{\omega}$ the phase-lock area portrait converges to a parquet with boundary lines being parallel to the lines $\{ u\pm\ell=0\}$. Namely, the limit of phase-lock area with rotation number $r$ is the union of an infinite chain of squares going up, with integer vertices and diagonals of length two lying on the line $\{\ell=r\}$, and an infinite strip going down (sector in the case, when $r=0$). We state and prove a generalization of this result to a wide class of slow-fast systems on 2-torus.

[425] arXiv:2607.28465 (replaced) [pdf, html, other]
Title: Deformation of the absolute Galois groups of number fields
Takeo Uramoto
Comments: draft; 31 pages. ver4: fixed some typos; made some minor modifications; added Data Availability Statement
Subjects: Number Theory (math.NT)

The technical goal of this paper is to construct and study profinite monoids DG_K for number fields K such that (1) the unit group of DG_K is isomorphic to the absolute Galois group G_K; (2) the maximal abelian quotient of DG_K is isomorphic to the Deligne-Ribet monoid DR_K; (3) the idempotents of DG_K bijectively correspond to subsets of the set P_K of (finite) primes of K; (4) the maximal Galois groups G_{K, S} with restricted ramifications S all appear as maximal closed subgroups of DG_K at idempotents; (5) all maximal closed subgroups of DG_K at idempotents are of this form. We also discuss the relationship between DG_K and the p-typical Witt vectors of Borger and de Smit, where we will describe the fundamental monoid of the semi-galois category of Lambda-rings of Borger and de Smit in terms of fields of norms of the local field K_p in particular.

[426] arXiv:2607.29458 (replaced) [pdf, html, other]
Title: Optimal MM* bounds for convex bodies
Pierre Bizeul
Comments: journal version
Subjects: Metric Geometry (math.MG); Functional Analysis (math.FA); Probability (math.PR)

Let $K\subset\R^n$ be a convex body in isotropic position. We prove the optimal mean-width estimate \[
M^*(K)\leq C\sqrt{n\log n}. \] The main new ingredient is a geometric inequality relating the Gaussian mean of the support function to its mean under the uniform measure on $K$, obtained through a heat-flow argument. Combined with the Gaussian-log-concave comparison of Eldan and Lehec and the newly available dimension-free bound on the third-moment parameter $\kappa_n$, this yields the result. The boundedness of $\kappa_n$ also makes the mean-norm estimate of Bizeul and Klartag sharp. Combining both estimates yields \[
M(K)M^*(K)\leq C\log n, \] extending Pisier's $MM^*$ estimate to non-symmetric convex bodies and to the isotropic position.

[427] arXiv:2608.00615 (replaced) [pdf, html, other]
Title: Machine learning the arithmetic of Boyd's Mahler measure conjectures
Alberto Alfarano, Pablo Bianucci, Matilde N. Lal\'ın, Berend Ringeling
Comments: 33 pages, 19 figures
Journal-ref: J. Math. Artif. Intell. 1 (2026), Art. 2, pp. 1-39
Subjects: Number Theory (math.NT)

Boyd conjectured that the Mahler measure of $P_k(x,y)=x+y+\frac{1}{x}+\frac{1}{y}+k$ for $k$ an integer, is given by $r_kL'(E_k,0)$, where $E_k$ is the elliptic curve associated to the zero locus of $P_k$ and $r_k$ is a rational number. We study various arithmetic properties of $r_k$ using a dataset containing the first $250{,}000$ values of $k$, combining large-scale statistical analysis assisted by \textsc{Claude} with transformer-based experiments carried out using Axolver.
We recover Boyd's observation that, apart from a few exceptions, $r_k$ is the reciprocal of an integer. The size of this integer is governed by the conductor of the elliptic curve. Moreover, its $p$-adic valuations display markedly different behavior according to the prime. For $p\geq5$, the observed frequencies of $v_p(r_k)=-m$, for $m\geq1$, are close to $p^{-m}$. At $p=5$, the agreement improves substantially when we restrict to curves with good reduction at $5$. For the primes $2$ and $3$, however, we find additional arithmetic structure involving congruence conditions on $k$ and the primes of bad reduction of $E_k$. Although the neural networks do not predict $r_k$ exactly, they recover significant information about its magnitude and valuations. In particular, the experiments at the prime $2$ suggest predictive relationships within the computed range that are not fully captured by the explicit predictor obtained from our statistical analysis.

[428] arXiv:2608.01878 (replaced) [pdf, html, other]
Title: Collective superintegrable systems from the Guillemin--Sternberg torus action
L. Feher
Comments: 12 pages, v2: corrected the wording of Lemma 2.11 and added a few sentences, v3: 14 pages, 1 figure, added a new subsection with examples, some explanations and a figure, accepted version
Subjects: Mathematical Physics (math-ph); High Energy Physics - Theory (hep-th); Exactly Solvable and Integrable Systems (nlin.SI)

We present a novel approach to the superintegrability of collective Hamiltonians invariant under a Hamiltonian action of a compact connected semisimple Lie group, $G$, on a symplectic manifold, $M$. For this purpose, we consider $\mathfrak{H} := \mathcal{J}^*(C^\infty(\mathfrak{g}^*)^G)$ and the centralizer $\mathfrak{F}$ of $\mathfrak{H}$ with respect to the Poisson bracket on $C^\infty(M)$, where $\mathcal{J}: M \to \mathfrak{g}^*$ is the momentum map of the $G$-action. By exploiting a Hamiltonian torus action that goes back to Guillemin and Sternberg [GS,1983], we demonstrate that the functional dimensions of $\mathfrak{H}$ and $\mathfrak{F}$ satisfy the equality $\mathrm{ddim}(\mathfrak{H}) + \mathrm{ddim}(\mathfrak{F}) = \mathrm{dim}(M)$. Together with a non-triviality condition, this ensures that the Abelian Poisson algebra $\mathfrak{H}\subset C^\infty(M)$ represents a superintegrable system, and it also follows that the momentum map of the GS torus action yields action variables for the system. Our work provides new insight into collective superintegrability complementing earlier results of Bolsinov and Jovanović.

[429] arXiv:2608.03246 (replaced) [pdf, html, other]
Title: Optimal Oracle Complexity for Weakly Convex Optimization
Jiajin Li, Siyu Pan
Comments: 28 pages, 1 figure. This version extends the lower bound to randomized first-order algorithms and a substantially broader initial-gap regime, with revised proofs and exposition
Subjects: Optimization and Control (math.OC)

We study the oracle complexity of finding $\epsilon$-stationary points of $\rho$-weakly convex and $G$-Lipschitz functions, where stationarity is measured by the gradient norm of the Moreau envelope. We consider an exact first-order oracle that returns both the function value and the full subdifferential at every query point. For sufficiently small $\epsilon>0$, we prove that every first-order algorithm, including randomized algorithms, requires $\Omega({\rho G^2\Delta}/{\epsilon^4})$ oracle queries to succeed with any fixed positive probability, where $f(0)-\inf f\le\Delta$. This lower bound matches the best known deterministic and stochastic first-order upper bounds, up to universal constants, and establishes the optimal randomized and deterministic first-order oracle complexity. The result separates smooth nonconvex and nonsmooth weakly convex optimization: the additional $\epsilon^{-2}$ factor is intrinsic to nonsmooth geometry rather than to stochastic oracle noise.

[430] arXiv:2608.03465 (replaced) [pdf, html, other]
Title: A Spectral Proximal DC Algorithm with Nonmonotone Line Search and Extrapolation
Kelin Wu, Hongpeng Sun
Subjects: Optimization and Control (math.OC); Numerical Analysis (math.NA)

The paper proposes a novel proximal difference-of-convex (DC) algorithmic framework to solve general nonconvex, nonsmooth optimization problems. The basic pBBDCA method combines Barzilai-Borwein (BB) parameter selection with a nonmonotone directional line search, requiring only one proximal solve per iteration. We also develop two extrapolated variants using restart and safeguarding mechanisms. The global convergence of the proposed framework is rigorously established under the Kurdyka-Łojasiewicz property. Numerical experiments on the SCAD-regularized least squares problem and graph Ginzburg-Landau image segmentation models demonstrate that the proposed methods achieve highly competitive efficiency and accuracy.

[431] arXiv:2608.06585 (replaced) [pdf, html, other]
Title: Slowly travelling infinite point blow-up for the critical generalized KdV equation
Nailya Manatova
Subjects: Analysis of PDEs (math.AP)

We study the finite time blow up phenomenon for the quintic, mass critical gKdV equation. We prove the existence of a class of solutions $U$ with infinite point, finite time blow up behavior, at the particular blow up rate $$\|\partial_x U(t)\|_{L^2} \sim (T-t)^{-\nu}\quad \text{as} \quad t \uparrow T,$$ where $\nu = \frac 12$, $T$ is the blow up time and where the travel speed of the blow up bubble is logarithmic. Therefore, we call this behaviour slowly travelling infinite point blow up. The special blow up rate $\nu =\frac 12$ is a threshold which separates finite and infinite point bubbling. In a previous work arXiv:2511.13538, the author constructed other infinite point blow up solutions for the continuum of rates $\nu\in(\frac 12,1)$, using polynomial tails in the space variable and extending the results in arXiv:1209.2510, restricted to $\nu> \frac{11}{13}$. However, that work suggested a change of the tail for the threshold case. In the present paper, we consider an exponentially decaying tail on the right in space. As in arXiv:2511.13538, the initial data can be taken arbitrarily close to the ground state in $H^1$. From a technical perspective, in addition to the change of tail, we have to adapt the energy-virial functional to the presence of the exponential tail, by modifying a scaling term used to control the right-hand side of the blow up solution.

[432] arXiv:2608.07244 (replaced) [pdf, html, other]
Title: A constrained Onsager variational framework for parametric approximations of Willmore and Helfrich flows
Quan Zhao
Subjects: Numerical Analysis (math.NA)

We develop a constrained Onsager variational framework for parametric finite element approximations of Willmore and Helfrich flows. The weak curvature relation is used as a PDE constraint to express the first variation of the bending energy in curvature-vector form. Onsager's principle then combines this variation with dissipation based on the normal velocity, while an independent relaxed minimal-deformation-rate (relaxed-MDR) constraint selects the tangential velocity. The resulting mixed formulation admits a semidiscretization by continuous piecewise linear elements that satisfies an exact energy-dissipation law and exactly preserves area and volume when the corresponding constraints are imposed. The framework accommodates constant spontaneous curvature and applies to both closed surfaces and open surfaces with fixed boundaries under Navier or clamped conditions. We also propose a linearly implicit fully discrete scheme, prove its unique solvability, and present numerical experiments demonstrating convergence, energy decay, constraint preservation, and effective mesh redistribution.

[433] arXiv:2608.12723 (replaced) [pdf, html, other]
Title: Tree-partitions of graphs with bounded tree-depth
Rong Chen, Huayue Liu
Subjects: Combinatorics (math.CO)

A tree-partition of a graph $G$ is a partition of $V(G)$ such that identifying the vertices in each part gives a tree. It is known that every graph with treewidth $k$ and maximum degree $\Delta(G)$ has a tree-partition in which each part has size $O(k\cdot\Delta(G))$. In this paper, we study tree-partitions of graphs with bounded tree-depth, a stronger parameter than treewidth, with an additional property for the tree $T$ indexing the tree-partition. We prove that every connected graph with tree-depth $h$ admits a $T$-partition for some tree $T$ with $\operatorname{rad}(T)\leq h-1$ and with width at most $\mathrm{max}\{1, (4h-10)\Delta(G)+1\}$.

[434] arXiv:2608.14013 (replaced) [pdf, html, other]
Title: Kusner's conjecture on equilateral sets is false
Logan R. Chalmers
Comments: The counterexample (Theorem 1) has been formalised in Lean from standard axioms. Lean proof: this https URL
Subjects: Metric Geometry (math.MG); Combinatorics (math.CO); Numerical Analysis (math.NA)

We disprove Kusner's 1983 conjecture that every equilateral set in $\ell_p^n$ with $2<p<\infty$ has at most $n+1$ points: there exist $58$ points in $\mathbb{R}^{56}$ whose pairwise $\ell_5$ distances are all equal, so the maximum equilateral-set size satisfies $e(\ell_5^{56})\ge58>57$. This is the first equilateral set of more than $n+1$ points in $\ell_p^n$ for any finite $p\ge2$. The construction persists on an open interval of exponents around $5$. The configuration is specified by the unique solution of an explicit polynomial system with rational coefficients in a rational box; existence and uniqueness are proved by exact integer inequalities. The existence of the $58$-point equilateral set in $\ell_5^{56}$ has been formalised in Lean from standard axioms.

[435] arXiv:2608.14092 (replaced) [pdf, html, other]
Title: Order dimension beyond rank for simplicial hyperplane arrangements
Daria Poliakova
Comments: 5 pages; acknowledgements updated
Subjects: Combinatorics (math.CO)

We show that the order dimension of the poset of regions in a simplicial hyperplane arrangement can exceed its rank, answering a question of Reading and Segovia. Examples are Coxeter arrangements $H_4$ and $E_6$, with $\dim W(H_4) \geq 5$ and $\dim W(E_6) \geq 7$.

[436] arXiv:2608.15035 (replaced) [pdf, html, other]
Title: Accelerating Stochastic Gradient Method Using Large Stepsize for Smooth Strongly Convex Minimization
Luwei Bai, Baoyu Zhou
Comments: 46 pages, 5 figures
Subjects: Optimization and Control (math.OC)

We study predetermined stepsize schedules for stochastic gradient methods on m-strongly convex, M-smooth objectives with conditionally unbiased gradient estimates and bounded conditional variance. We derive an exact tight analysis on every schedule with stepsizes in [0,2/(M+1)]. We then characterize the globally optimal one- and two-step schedules over all nonnegative stepsizes. Both optimal schedules depend on the ratio of the initial optimality gap to the noise level and exhibit several distinct regimes. As the influence of stochastic noise diminishes, the optimal stepsizes become larger, reflecting a balance between the benefits of faster iterate convergence and the perturbations induced by stochastic noise. These solutions motivate serial and silver composition rules with explicit performance bounds. For arbitrary horizons, we construct a schedule combining a balanced Silver prefix with constant and decreasing short steps, with the prefix length selected through explicit thresholds. Its certified upper bound never exceeds the exact optimum over all short-step schedules and is strictly smaller whenever a nonempty Silver prefix is selected. Finally, we prove global optimality of the proposed schedule on an explicit sufficient interval of the initial-error-to-variance ratio.

[437] arXiv:2608.15114 (replaced) [pdf, html, other]
Title: $F$-congruences on $F$-inverse monoids
Ajda Lemut Furlani
Comments: 13 pages
Subjects: Rings and Algebras (math.RA); Group Theory (math.GR)

We study the class of congruences on $F$-inverse monoids that respect the unary operation $a\mapsto\mx{a}$, assigning to each element the maximum element of its $\sigma$-class, which we refer to as $F$-congruences. We characterize kernel normal systems and congruence pairs on $F$-inverse monoids which give rise to such congruences and establish a number of further related results including a classification of $F$-congruence-free $F$-inverse monoids.

[438] arXiv:2608.15444 (replaced) [pdf, html, other]
Title: Eigenvalues of locally positive semidefinite matrices: Non-convexity and Geometry
Jose Acevedo, Grigoriy Blekherman, Sebastian Debus, Seokbin Lee, Cordian Riener
Comments: New section for general non-convexity
Subjects: Rings and Algebras (math.RA); Algebraic Geometry (math.AG); Optimization and Control (math.OC)

A real symmetric matrix is called $d$-locally positive semidefinite if all of its $d \times d$ principal submatrices are positive semidefinite. We investigate the spectral geometry of $d$-locally positive semidefinite matrices. The set of vectors of eigenvalues of $d$-locally positive semidefinite matrices of size $n \times n$ is fully understood and known to be convex when $d \in \{1,n-1,n\}$ \cite{blekherman2022hyperbolic}. In the smallest remaining case $n=4, d=2$, non-convexity of the set of vectors of eigenvalues was proved in \cite{kozhasov2023eigenvalues}, but even in this case the full description was unknown. We provide a basic semialgebraic description of the set of vectors of eigenvalues for $n=4, d=2$ by establishing a Fischer-type inequality for $2$-locally positive semidefinite matrices of size $4 \times 4$. We prove non-convexity for all $n \geq 4$ and $2 \leq d \leq n - 2$. For $d=2$ we prove a natural linear inequality on a linear slice of eigenvalues of locally positive semidefinite matrices which is tight at exactly two points. This gives a stronger proof of non-convexity in this case. For $d \in \{2, n - 2\}$, analyzing this slice involves solving certain non-smooth and non-convex min-max point configuration problems in the complex plane, which could be of independent interest. Similar problems were considered in \cite{nesterenko2024submatrices,sengupta2026submatrices} in the context of matrix decomposition and approximation.

[439] arXiv:2608.16127 (replaced) [pdf, html, other]
Title: The Brualdi--Hoffman--Turán problem for odd wheels: Resolving a conjecture of Yu, Li and Peng
Longfei Fang, Mingqing Zhai, Yuhan Zhang
Subjects: Combinatorics (math.CO)

This paper addresses the Brualdi--Hoffman--Turán problem, which asks for the maximum adjacency spectral radius over graphs with a fixed number of edges that forbid a prescribed subgraph. We settle an open conjecture due to Yu, Li and Peng for odd wheel graphs $W_{2k+1}$. A striking dichotomy appears in the extremal configurations: the forbidden-$W_5$ case and the general case $k\ge 3$ rely on identical stability and dense-core reductions but produce completely different extremal graphs. For sufficiently large size $m$, we derive sharp spectral inequalities and give complete characterizations for graphs achieving equality. Our approach combines the edge-spectral stability theorem with the dense-core method and residual-function analysis. Beyond solving the target conjecture, the developed framework provides a systematic approach for edge-spectral Turán problems and implies several known results for odd cycles, friendship graphs and odd fans. Directions for future research on edge-spectral supersaturation are also discussed.

[440] arXiv:2608.18392 (replaced) [pdf, html, other]
Title: On Samuels' Conjecture
Zhi Ling
Subjects: Probability (math.PR); Combinatorics (math.CO)

Let $0\leq\mu_1\leq\cdots\leq\mu_n$ and let $\lambda>\sum_{i=1}^n\mu_i$. Let $X_1,...,X_n$ be independent nonnegative random variables satisfying $\mathbb{E}X_i=\mu_i$, and write $D_i := \lambda-\sum_{k=1}^{i-1}\mu_k$ for $1\leq i\leq n$. We prove that $$ \inf_{X_1,...,X_n} \mathbb{P}\left( \sum_{i=1}^nX_i<\lambda \right) = \min_{1\leq i\leq n} \prod_{j=i}^n \left( 1-\frac{\mu_j}{D_i} \right). $$ The bound is sharp and is attained. This proves Samuels' conjecture. Feige's conjecture is thereby resolved, since it follows immediately from the equal-means case. The proof is self-contained.

[441] arXiv:2608.23202 (replaced) [pdf, html, other]
Title: Locally finite fixed points of branching Brownian motion
Xinxin Chen, Arnab Chowdhury, Atul Shekhar, Shuo Zhu
Comments: 36 pages
Subjects: Probability (math.PR)

We give a full characterization of the fixed points of Branching Brownian motion with critical and supercritical drifts under no additional assumptions besides it being locally finite almost surely. In particular, we do not assume finite intensity (Kabluchko, 2012) or the finite top particle (Chen-Garban-Shekhar, 2023) conditions. We also give a full characterization of the domain of attraction of the fixed points of BBM.

[442] arXiv:2608.23718 (replaced) [pdf, html, other]
Title: The least-squares RBF-PU method for linear elasticity in the diaphragm geometry
Andreas Michael, Elisabeth Larsson, Pierre-Frédéric Villard, Davoud Mirzaei
Subjects: Numerical Analysis (math.NA)

The human diaphragm is vital for respiration and its simulation can aid in further understanding complications arising in individuals that have been subjected to mechanical ventilation. The diaphragm is very thin and hence its numerical simulation poses a challenge for most numerical methods. In this paper, we compute the deformation of real diaphragm geometries, which are modelled as linearly elastic, and are subject to realistic boundary conditions. The method used is the unfitted least-squares radial basis function partition of unity method. The patches used are cylindrical and refinement is performed along the thin direction of the diaphragm. Both the unfitted nature of the method as well as the refinement technique make this method particularly well suited to solve problems formulated in thin geometries. We derive a theoretical proof showing that the method converges with high order to the solution of a well-posed linear elasticity boundary value problem.

[443] arXiv:2608.23810 (replaced) [pdf, html, other]
Title: Let AEDs Move: Urban Mobility Enhanced Defibrillator Deployment
Bahar D Viniche, Sheng Liu, Nooshin Salari
Subjects: Optimization and Control (math.OC)

Early defibrillation is critical to survival after out-of-hospital cardiac arrest (OHCA). However, public-access defibrillation programs rely largely on stationary automated external defibrillators (AEDs), whose fixed locations cannot adapt to spatial and temporal variation in OHCA demand and which a bystander must retrieve on foot. We study a platform-enabled deployment model in which ride-hailing vehicles carry AEDs that can be dispatched directly to OHCA locations. Holding total AED supply fixed, we evaluate the full range of allocations between stationary and mobile deployment. Our analysis draws on public AED inventories, EMS-reported OHCA incidents, and ride-hailing mobility data from New York City and Toronto. Reallocating part of the supply to vehicles substantially shortens AED response times, but the benefit is non-monotonic in the mobile share. Under a specification common to both cities, mean improvement reaches approximately 2.9 minutes in each, yet the preferred allocation differs: it peaks with 55% of AEDs mobile in Toronto, whereas New York City retains near-maximum gains across 40%-80%, with further variation across boroughs. The preferred allocation also depends on the response-time target, where coverage within 3 and 5 minutes favors greater mobility while 10-minute coverage favors retaining part of the stationary network. Toronto's vehicle-level data further show that targeting AEDs to active vehicles is essential and with such targeting, restricting dispatch to idle vehicles, which disrupts no passenger trip, does not reduce the gain, and allowing any active equipped vehicle to respond raises it to 5.7 minutes under full mobilization. Mobilizing AEDs can therefore materially improve access, and the stationary-mobile mix must be tailored to local coverage, fleet activity, and dispatch rules.

[444] arXiv:2608.27074 (replaced) [pdf, html, other]
Title: Coupled stochastic variational principles for multiscale surface gravity waves -- Part I: theoretical framework
Etienne Mémin, Arnaud Debussche
Subjects: Mathematical Physics (math-ph); Atmospheric and Oceanic Physics (physics.ao-ph)

This paper develops a comprehensive stochastic variational framework for surface gravity waves. Starting from Luke's variational principle for irrotational, incompressible free-surface flow, we introduce a decomposition of the velocity potential into a large-scale deterministic component and a regularized stochastic noise term representing unresolved scales. A path-wise variational principle yields the stochastic counterparts of the Laplace, Bernoulli, and kinematic boundary conditions. To close the system, a second variational principle in expectation is formulated, providing evolution equations for the noise correlation functions. The resulting coupled system preserves the Hamiltonian structure of the Zakharov--Craig--Sulem formulation. We further analyze explicit solutions via WKB approximation and show that the noise correlation functions satisfy a Hamilton-Jacobi equation with ray-tracing dynamics. This framework provides a rigorous foundation for reduced stochastic models of ocean waves and for the kinetic theory developed in the companion paper.

[445] arXiv:2609.01093 (replaced) [pdf, html, other]
Title: Ideal MHD below the classical well-posedness threshold
Matteo Giardi
Comments: AI and LLM use statement added
Subjects: Analysis of PDEs (math.AP)

We establish local existence and uniqueness of solutions for the ideal incompressible magnetohydrodynamics system posed on $[0,T]\times\mathbb{R}^n$ with $n\ge2$ and initial conditions given by a nonzero constant magnetic field $\mathbf{B}_0$ and arbitrary divergence-free velocity $v_0\in H^s$, in the range $(n+1)/2<s\le n/2+1$. The proof uses a Lagrangian wave--Hodge reformulation and exploits an Alfvén null--structure hidden in the pressure forcing. This work builds on Zhang \cite{Zhang2026} and provides a bridge from the Lagrangian theory to the Eulerian Cauchy problem. In particular, the constructed solutions are induced by a bi-Lipschitz and volume-preserving map.

[446] arXiv:2609.01237 (replaced) [pdf, html, other]
Title: The $α$-Limit Problem: Convergence of a Linear Degenerate Interface Transmission Problem
Toai Luong, Tadele Mengesha, Kerrek Stinson, Steven M. Wise, Ming Hei Wong
Subjects: Analysis of PDEs (math.AP); Numerical Analysis (math.NA)

We study the singular limit of a family of linear degenerate interface transmission problems arising from a regularization procedure in the newly proposed Two-Parameter Diffuse Domain Method (DDM2p). For $\alpha>0$, the regularized problem admits a strictly convex variational formulation on $H^{1}(\Omega)$. In the limit $\alpha\to0$, the problem degenerates to a weakly coupled interface system with a nonstandard energy structure. To characterize the limit, we introduce a closed Hilbert subspace $\mathcal{H}\subset H^{1}(\Omega)$, defined through an auxiliary Helmholtz problem on an annular subdomain $\Omega_2\subset \Omega$, and identify the limiting energy functional $\mathcal{E}_{0}$ on $\mathcal{H}$. We prove that the regularized energies $\mathcal{E}_{\alpha}$ restricted to $\mathcal{H}$ $\Gamma$-converge to $\mathcal{E}_{0}$ in the strong $L^{2}(\Omega)$ topology, using the standard framework. Consequently, minimizers of $\mathcal{E}_{\alpha}$ converge to the unique minimizer of $\mathcal{E}_{0}$, which is shown to be equivalent to the solution of the limiting interface problem. We further prove a strong convergence $u_{\alpha}\to u_{0}$ in $H^{1}(\Omega)$ and establish a convergence rate of $O(\alpha)$. Numerical experiments in one spatial dimension exhibit first-order convergence, suggesting that the proved $O(\alpha)$ upper bound is sharp.

[447] arXiv:2609.03524 (replaced) [pdf, other]
Title: Exceptional model structures and the induced extriangulated categories
Chencheng Zhang, Pu Zhang
Subjects: Representation Theory (math.RT)

A Hovey triple $(\mathcal{C}, \mathcal{F}, \mathcal{W})$ is {\it exceptional}, if $(\mathcal{C} \cap \mathcal{F}, \ \mathcal{C} \cap \mathcal{F} \cap \mathcal{W})$ is not a Frobenius pair. One has a disjoint union $\{\text{Hovey triple}\} = \{\text{Hereditary Hovey triple}\} \ \dot\bigcup \ \{\text{Exceptional Hovey triple}\}$ \ $\dot\bigcup \ \{\text{non-hereditary and non-exceptional Hovey triple}\}.$ Exceptional Hovey triples appear widely. For a selfinjective Nakayama algebra $A= kC_n/J^t$, $A\mbox{-}{\rm mod}$ admits exceptional Hovey triples if and only if $\gcd (n, t) \ge 2$ and $t \geq 3$. Their homotopy categories reveal new phenomena. Nakaoka-Palu's Theorem implies that there is a triangulation on $\frac{\mathcal C\cap\mathcal F}{\mathcal C\cap\mathcal F\cap\mathcal W}.$ It is proved that a Hovey triple in a weakly idempotent complete extriangulated category $(\mathcal A, \mathbb E, \mathfrak s)$ is exceptional if and only if the induced extriangulated structure $\bigl(\frac{\mathcal C\cap\mathcal F}{\mathcal C\cap\mathcal F\cap\mathcal W}, \ \overline{\mathbb E}, \ \overline{\mathfrak s}\bigr)$ is not {\it canonically triangulated}. Between this extriangulated structure and the one arising from the triangulation, the intermediate extriangulated structures are in one-to-one correspondence with Serre subcategories of $\mathrm{fp}((\frac{\mathcal P(\mathcal C\cap\mathcal F)}{\mathcal C\cap\mathcal F\cap\mathcal W})^{\mathrm{op}}, \mathrm{Ab})$.

[448] arXiv:2609.05197 (replaced) [pdf, html, other]
Title: Transverse Analytic Envelopes and the Baum--Bott Rationality Conjecture
Maurício Corrêa, José Seade
Comments: 26 pages. Applications to the Baum-Bott Rationality Conjecture
Subjects: Complex Variables (math.CV)

We study holomorphic first integrals near singular leaves through transverse analytic envelopes. For diagonal actions these are normal toric quotients, and complete semiglobal integrability along singular orbits with independent support weights is equivalent to maximal resonance rank and finite monodromy. For commuting fields in convergent simultaneous Poincaré--Dulac normal form, induced derivations determine the first-integral algebra. Labelled quotients and logarithmic residues reconstruct weights at maximal rank; Grassmannians describe the ambiguity otherwise. Polynomial examples show losses invisible to prescribed finite jets. For the Baum--Bott rationality conjecture, we prove rationality and an explicit residue formula for smooth compact singular components with product charts and a common invertible semisimple transverse linear part of maximal resonance rank. Equivariant cohomology gives higher-degree vanishing for affine diagonal torus actions, including intersecting singular strata.

[449] arXiv:2609.06584 (replaced) [pdf, html, other]
Title: The periodic Wulff problem in two dimensions
Marco Bonacini, Alberto Fiorini
Comments: 27 pages
Subjects: Analysis of PDEs (math.AP)

We characterize the minimizers of the anisotropic perimeter in the two-dimensional flat torus under an area constraint. We show that, as the prescribed area increases, global minimizers undergo two phase transitions, changing from a droplet (a rescaled Wulff shape) to a flat band wrapping around the torus in a preferred direction determined by the anisotropy (lamellar phase), and finally to a bubble (the complement of a reflected and rescaled Wulff shape). The transition thresholds are given explicitly in terms of the area and the lattice width of the Wulff shape. For certain non-symmetric surface tensions, the lamellar phase is absent altogether. Finally, we characterize the surface tensions for which further minimizers appear: this may happen only in the lamellar regime, and exactly when the Wulff shape has a corner whose normal cone contains, in its interior, a direction realizing the lattice width; in this case there are infinitely many minimizers.

[450] arXiv:2609.10480 (replaced) [pdf, html, other]
Title: Open Inextensible Filaments in Planar Stokes Flow: Well-Posedness, Endpoint Asymptotics, and Straightening
Han Zhou
Subjects: Analysis of PDEs (math.AP); Mathematical Physics (math-ph)

We study an inextensible open filament with free ends in a planar Stokes fluid. The system reduces to a third-order nonlocal curvature equation coupled to an elliptic equation for the tension. We prove local well-posedness for nearly critical initial data in supported Sobolev spaces $\widetilde H^s$, $-1/2<s\le0$, satisfying the arc-chord condition. For positive times, we prove improved Sobolev regularity and derive a $d^{3/2}$-type expansion at each free end using Wiener--Hopf factorization, where $d$ denotes the distance to that endpoint. We further prove global existence and exponential convergence to a straight filament for sufficiently small initial data and for finite-energy initial data satisfying $E(0)<\pi^2/4$. The finite-energy result follows from an energy identity and a geometric estimate relating the bending energy to the arc-chord constant. More generally, any finite-time breakdown must be accompanied by loss of the arc-chord condition, while every global solution either converges exponentially to a straight filament or has arc-chord constants tending to zero along a sequence of times tending to infinity.

[451] arXiv:2609.11528 (replaced) [pdf, html, other]
Title: Mean Square Error Analysis of Stochastic Runge-Kutta Integrators
Xuda Ye
Subjects: Numerical Analysis (math.NA)

We analyze the mean square error of stochastic Runge--Kutta integrators for overdamped Langevin dynamics whose potential is strongly convex outside a bounded region. A decomposition splits the local error into a mean-zero term and a smaller remainder, and the discrete Poisson equation turns their moments into a bound on the error of a time average. We carry this out for two stochastic Runge--Kutta integrators proposed by Yang \& Wang (2026), both of strong order $\frac32$ and weak order $2$, which evaluate the gradient of the potential and no higher derivative. We show that their laws approach the law of the exact solution at second order in Wasserstein-1 distance, up to a logarithm, uniformly in the number of steps. For a test function with bounded derivatives up to third order, we prove that the mean square error over $N$ steps with step size $h$ is $\mathcal O ( \frac{1}{Nh} + h^4 )$, which is the optimal order in the discretization. Experiments measure the strong and weak orders and the sampling bias on a nonconvex potential in $\mathbb R^2$, and compare the integrators on a diffusion model of CIFAR-10.

[452] arXiv:2609.11598 (replaced) [pdf, html, other]
Title: Liouville regular Jordan curves
Tomohiro Asano, Yuichi Ike
Comments: 27 pages, v2:Revised
Subjects: Classical Analysis and ODEs (math.CA); Metric Geometry (math.MG)

We investigate Liouville regular Jordan curves, which were introduced in our previous paper as "Jordan curves that admit continuous Legendrian lifts". We prove that a Jordan curve satisfying certain variation conditions in a neighborhood of each point is Liouville regular. We also prove that the boundary of a Jordan domain is Liouville regular if the images of the radial tails under a conformal mapping have uniformly vanishing length. Together with our previous result, these criteria show that each such Jordan curve admits an inscribed rectangle in every prescribed similarity class.

[453] arXiv:2609.14855 (replaced) [pdf, html, other]
Title: Resonant saddles, tangencies with small spheres, and the characteristic flow
Toshikazu Ito \and Bruno Scárdua
Subjects: Complex Variables (math.CV); Dynamical Systems (math.DS)

We study resonant Siegel saddles in $\C^2$, with eigenvalue ratio $-p/q$, where $p,q$ are coprime positive integers, through their position relative to small round spheres. An intrinsic invariant $k$, defined through a resonance index that measures approximate first integrals, equals the first resonant obstruction. For $k<\infty$, the maximal contact order with the linear foliation is $m=k(p+q)+1$, and suitably normalized charts give $2k$ tangency circles. We compute their transverse type: resonant terms cancel to first order, and Poincaré--Dulac normalization through degree $2m-1$ makes every contact a saddle, while weaker normalization can produce elliptic arcs and periodic characteristic orbits. For the exact model we describe the whole-sphere flow and the correspondence between its tangency circles and separatrix sectors. In arbitrary charts the characteristic return map near a separatrix circle realizes its holonomy, whose $p$-th iterate has, when $k<\infty$, multiplicity $kp+1$, with $kp$ attracting and $kp$ repelling petals. Classical rigidity of resonant holonomy then recovers the analytic saddle class from $C^1$ orbital equivalence near that circle. We also describe tangency loci for arbitrary nondegenerate germs by the numerical range and the leading orbital form.

[454] arXiv:2609.15936 (replaced) [pdf, html, other]
Title: An Adaptive Linesearch-free Method for Monotone Variational Inequalities under Local Lipschitz Continuity
Hongjia Ou, Andreas Themelis, Puya Latafat
Subjects: Optimization and Control (math.OC)

The forward-reflected-backward (FRB) splitting solves monotone inclusions involving the sum of a maximally monotone operator and a monotone Lipschitz continuous operator. Each iteration performs one resolvent step and one evaluation of the Lipschitz operator, together with a reflection term with coefficient equal to one that reuses the operator value from the previous iteration. We consider the setting where the maximally monotone operator is the subdifferential of a proper, closed, convex function. We identify the admissible range of constant reflection coefficients, namely all values larger than one half for a sufficiently small stepsize. We then propose a linesearch-free adaptive variant of FRB for locally Lipschitz continuous operators, in which both the stepsize and the reflection coefficient change across iterations. The stepsize is computed in closed form from a simple local Lipschitz estimate, without knowledge of a global Lipschitz constant, while keeping the iteration cost of FRB. The analysis of both methods relies on a new Lyapunov function that combines the distance to a solution, a residual, and a gap-related term. Alongside nonasymptotic rates, we derive explicit lower bounds on the generated stepsizes, and report numerical experiments on minimax problems, equilibrium models, and regularized regression.

[455] arXiv:2609.17506 (replaced) [pdf, html, other]
Title: Proof of the singularity conjecture for discrete subgroups of $\mathrm{SL}_2(\mathbb{R})$
Timothée Bénard
Comments: 29 pages. Since v2, only the formatting has changed
Subjects: Dynamical Systems (math.DS)

Let $\mu$ be a finitely supported probability measure on $\mathrm{SL}_2(\mathbb{R})$ whose support generates a Zariski-dense discrete subgroup. We prove that its stationary probability measure on $\mathbb{P}^1(\mathbb{R})$ is singular with respect to the $\mathrm{SO}(2)$-invariant probability measure. The proof compares winding variances on finite covers of a closed hyperbolic surface and uses a topological obstruction.

[456] arXiv:2609.17519 (replaced) [pdf, html, other]
Title: An Equivariant Landweber Exact Functor Theorem for Abelian Compact Lie Groups
Yingxin Li
Comments: 30 pages, 1 figures; Comments Welcome! v2: a new application for the formal groups from elliptic curves
Subjects: Algebraic Topology (math.AT)

We prove an equivariant Landweber exact functor theorem for abelian compact Lie groups $G$. For a graded module $N$ over the $G$-equivariant Lazard ring $L_G$, we give necessary and sufficient algebraic conditions on $N$ for the functor
\[
X\longmapsto (MU_G)_*(X)\otimes_{L_G} N
\]
to define a homology theory on the category $\mathrm{Sp}^G$ of genuine $G$-spectra. Our criterion is obtained by varifying the Landweber exactness on each stratum indexed by a closed subgroup of $G$ and then gluing the local flatness data via Euler classes. As an application, we show that for any non-equivariant Landweber exact ring spectrum $E$, $MU_G\wedge_{MU} E$ is equivariantly Landweber exact, thereby proving a conjecture of Wisdom. Finally, we study the $G$-equivariant formal groups $\widehat E_G$ over $\hom(G^*,E)$ associated to elliptic curves $E/S$. We prove that its classifying map $\hom(G^*,E)\to\mathcal M_{\mathrm{FG}}^G$ is flat whenever $S\to\mathcal M_{\mathrm{ell}}$ is flat, and recover $\widehat E_G$ from Gepner-Meier's equivariant elliptic cohomology associated to any oriented spectral lifting of $E/S$.

[457] arXiv:2609.17712 (replaced) [pdf, html, other]
Title: Range Failure, Resolvent Growth, and Resonance in Partially Dissipative Systems
Boris Muha, Sebastian Schwarzacher, Justin T. Webster
Comments: 6 figures, 46 pages
Subjects: Analysis of PDEs (math.AP); Classical Analysis and ODEs (math.CA); Dynamical Systems (math.DS); Functional Analysis (math.FA)

We analyze resonance for partially dissipative systems, $\dot u=Au+f(t)$, where $A$ generates a strongly stable semigroup $S(t)$ on a Hilbert space $H$. {Resonance is} the phenomenon whereby a bounded, time-periodic $f$ yields an unbounded $u$, classically occurring when $A$ has imaginary eigenvalues. In infinite dimensions, however, several other resonance notions, introduced here, may occur.
Classically, {$T$-periodic solvability} is equivalent to a range condition: $\mathcal{R}(I-S(T))=H$. We describe a hierarchy of range failures, and demonstrate how the growth rate of~$||(A-i\omega I)^{-1}||_H$ dictates a regularity gap between $u$ and $f$. For super-polynomial growth, that gap can be infinite. We demonstrate this phenomenon and its equivalence to the existence of smooth resonant forces.
The theory is motivated by a well-studied hyperbolic-parabolic system, which is a simplification of fluid-solid interactions. Our main result shows that, for a carefully constructed geometry, the PDE system exhibits smooth-forcing resonance for a dense set of periods. The geometry sharply violates geometric conditions for which finite regularity losses were shown previously.

[458] arXiv:2609.19434 (replaced) [pdf, html, other]
Title: Asymptotic counting of integers with prime factors $p_{r^a s^b}$
Mehdi Golafshan
Comments: 12 pages, 1 figure
Subjects: Number Theory (math.NT)

Let $p_n$ be the $n$th prime, and let $r,s\ge2$ be fixed multiplicatively independent integers. We count the integers up to $x$ whose prime factors all have the form $p_{r^a s^b}$ with integers $a,b\ge0$. Our asymptotic formula for this count has relative error $o(1)$ and is explicit down to the multiplicative constant. For $(r,s)=(2,3)$ these integers are the prime codes of the ordinals below $\omega^{\omega^2}$, so the formula settles that case of the counting problem of Vernaeve, Vindas and Weiermann.

[459] arXiv:2609.23518 (replaced) [pdf, html, other]
Title: Well-posedness for Wright--Fisher SPDEs with measurable drift
Jere Koskela, Oliver Tough
Comments: 27 pages, v2 plugs a gap in the proof in v1
Subjects: Probability (math.PR); Analysis of PDEs (math.AP)

We prove weak existence and uniqueness in law of $[0,1]$-valued solutions for a class of scalar stochastic heat equations with measurable drifts $b : [0,1] \to \mathbb{R}$, driven by Wright--Fisher noise. The only assumptions we require on the drift are Borel-measurability, and the one-way inequalities $-Cu\leq b(u)\leq C(1-u)$ for some $C<\infty$, compatible with the necessary condition $b(1)\leq 0\leq b(0)$. These are vastly more general conditions than were previously available. Our proof relies on a stochastic duality between the solution of the stochastic heat equation, and a voting scheme running along the graph of a branching-coalescing particle system, generalising the class of drifts for which a dual process is available. Our results and their proof put the regularisation-by-noise result of Barnes, Mytnik and Sun, and its explanation, on a much more general footing.

[460] arXiv:2609.23663 (replaced) [pdf, html, other]
Title: Reduction of Zieve's Conjecture on the Hurwitz problem to Three Branch Points
Xitaiyu Liu, Tianyang Sun, Bin Xu, Yu Ye, Yi Zhou
Comments: v2: Substantially shortened and reorganized. The proof in Section 3 has been rewritten, and the exposition and references have been updated. The main theorem is this http URL number of pages has been reduced from 39 to 23 v3: Updated to match the version submitted to the journal
Subjects: Differential Geometry (math.DG)

M. E. Zieve conjectured that a candidate datum over the sphere is realizable whenever the gcd of the parts of every branch partition is one and it satisfies the lcm condition. We prove that this conjecture reduces to its three-branch-point case. More precisely, if every Zieve-admissible triple is realizable, then every Zieve-admissible datum with at least four branch points is realizable. As already noted by Petronio, Zieve's conjecture would imply the prime-degree conjecture of Edmonds, Kulkarni, and Stong. Song, Wen, and Zhang proved the latter conjecture in a preprint posted on arXiv in September.

[461] arXiv:2609.27335 (replaced) [pdf, html, other]
Title: Polynomial Decay in Absorbing Continuous-Time Markov Chains
Phil Pollett
Comments: 40 pages, 0 figures
Subjects: Probability (math.PR)

Let $P(t)$ be the transition function of an absorbing continuous-time Markov chain on a countable state space. We study asymptotic relations of the form $p_{ij}(t)\sim a_{ij} L(t)$, $t\to\infty$, where $L$ is independent of $i$ and $j$. We obtain general conditions under which the coefficient matrix $A=(a_{ij})$ has rank one and describe the resulting consequences for survival probabilities and conditional distributions. The analysis applies to both reducible and irreducible chains. We also construct an irreducible counterexample, based on a killed random walk on a homogeneous tree, for which a common asymptotic scale exists but the coefficient matrix has rank greater than one. This shows that irreducibility alone does not imply rank-one asymptotics. The results identify conditions under which fixed-state transition asymptotics determine the asymptotic behaviour of the entire transition function and clarify the limitations of such conclusions in the absence of additional structure.

[462] arXiv:2609.30106 (replaced) [pdf, html, other]
Title: Stopping models closed under pgf composition, and the stability of randomly stopped model extensions
Jordi Valero, Josep Ginebra
Comments: 45 pages
Subjects: Statistics Theory (math.ST); Probability (math.PR)

Statistical model transformations based on randomly stopped sums, maxima, and minima are widely used to extend statistical models by introducing an additional parameter. We characterize the finite-dimensional positive stopping models for which these randomly stopped sum and extreme transformations act as statistically stable (idempotent) model extensions. Stability requires the underlying stopping model to be closed under pgf composition. We prove that any finite-dimensional, connected, positive stopping model closed under pgf composition necessarily forms a family of random variables whose pgfs commute. Using the associated Koenigs function, we establish that these models form a statistical manifold admitting a global, one-dimensional parametrization $\theta = \Pr(N=1) \in (0, \theta_*]$, in which the probability mass at $i$ is a polynomial in $\theta$ of degree at most $i$. Within this class, we further establish a duality between those models containing the identity variable (the ones yielding statistically stable extensions) and the set of all probability distributions supported on the positive integers. By providing numerous examples of stopping models closed under pgf composition, we clarify the assertion that, under certain conditions, the only stopping model that is so is geometric.

[463] arXiv:2609.32052 (replaced) [pdf, html, other]
Title: VC-dimension of distance graphs in finite field geometries
Brian McDonald Bakas, Moustapha Diallo, Alex McDonald
Comments: Simplified proof and stronger main theorem than appeared in first version
Subjects: Combinatorics (math.CO)

We study the VC-dimension of distance graphs of large subsets of vector spaces over finite fields. For $3\leq k\leq d$, we prove the distance graph of $E\subset \F_q^d$ has VC-dimension at least $k$ provided that $|E|>Cq^{\min(d-1,\frac{d+k-1}{2})}$. We also show that this exponent is sharp in the $k=d$ case.

[464] arXiv:2609.38290 (replaced) [pdf, html, other]
Title: Notions of equivalence among constant Yang--Baxter Operators: To $\infty$-Equivalence and Beyond
Paul P. Martin, Eric C. Rowell
Comments: two figures. substantially revised to include a significant new theorem
Subjects: Quantum Algebra (math.QA)

A fundamental question in any higher-representation classification problem is to determine an appropriate notion of equivalence among representations. In ordinary representation theory we have the notion of isomorphism, but in general there may be several coherent choices for morphisms and then the question arises of the relationship between corresponding notions of equivalence. This question is already relevant in the classification of constant Yang--Baxter operators where gauge equivalence (i.e., local basis change) is comfortingly familiar, but is by no means canonical. In this paper we first review the equivalences used in recent advances in this field (through charge-conserving YBOs); we determine the relationships between them; and then develop a toolkit of theorems applicable for testing equivalence in practice.
We use $\infty$-equivalence as the reference notion here: for $m\in\N$, $m$-equivalence denotes $n$-strand braid group representation equivalence for all $n \leq m$. This combines naturally with an appropriate variation of the ordinary Artin--Wedderburn Theorem. We show, for example, that for each dimension $N$ there is a finite $m(N)$ so that $m(N)$-equivalence implies $\infty$-equivalence, up to radical (but also show that the function $m(N)$ is unbounded). In principle proving $\infty$-equivalence requires providing an infinite sequence of intertwiners, so this reduces the burden significantly. For another example, we show that in dimension $2$ all bar one local family of solutions are charge-conserving up to radical and $\infty$-equivalence --- a characterisation relatively simple enough that it gives us a framework for addressing the major open classification problem in dimension $3$.

[465] arXiv:2609.38394 (replaced) [pdf, html, other]
Title: Zong's problem on $2d$ half-spaces containing the unit ball
Grigory Ivanov
Subjects: Functional Analysis (math.FA)

We prove that the intersection of $2d$ half-spaces containing the Euclidean unit ball in $\mathbb{R}^d$ contains a point of norm at least $\sqrt{d}$. Equality in the radius bound characterizes the cube up to orthogonal transformations. The proof gives a lower bound for the average squared norm of the vertices, weighted by the Gaussian measures of their normal cones. This estimate follows from an inequality for the Gaussian measures of a simplicial cone and its projected facets, which in turn reduces to a linear estimate for the Gaussian centroid of a simplicial cone.
We also discuss a quadratic extension of the problem and give a bound for it using an independent spectral argument. This bound implies that the intersection of any $m > d$ half-spaces containing the unit ball contains a point of norm at least $\sqrt{m}\,\ln\frac{m}{m-d}$.

[466] arXiv:2609.39606 (replaced) [pdf, html, other]
Title: Regularity of critical immersions for scale-invariant curvature energies in even dimensions
Tian Lan
Comments: v2: revised title and abstract; shortened exposition; corrected reference; added role of AI. v3: reorganized the introduction
Subjects: Analysis of PDEs (math.AP); Differential Geometry (math.DG)

For immersions of a closed $2h$-dimensional manifold $\Sigma$ into $\mathbb R^m$, we consider curvature energies that are invariant under ambient isometries and dilations, with the principal term $\int_{\Sigma} \big|\nabla^{(h-1)} \vec{\mathrm{I\!I}}\big|_g^2\,d\text{vol}_g$ and lower-order submanifold invariants. Following the four-dimensional approach developed in joint work with Bernard, Martino, and Rivière, we prove that every weak critical immersion in the natural Sobolev class $W^{h+1,2}$, whose induced metric and its inverse have $L^\infty$ coefficients, is real-analytic in harmonic coordinates. The proof combines geometric conservation laws, structural identities, and elliptic estimates with critical Sobolev coefficients to obtain Morrey decay and bootstrap to full regularity.

[467] arXiv:2610.02155 (replaced) [pdf, html, other]
Title: An abstract averaging method for quasilinear equations
Jean Mawhin, Jorge Novoa
Subjects: Analysis of PDEs (math.AP); Classical Analysis and ODEs (math.CA)

We develop an abstract averaging method for equations $Mx=\varepsilon N(x,\varepsilon)$ in Banach spaces. The method applies when the equation can be separated into an averaged compatibility condition and a nonlinear complementary problem, and it allows the principal operator $M$ to be genuinely nonlinear. We prove that every nondegenerate zero of the corresponding averaged equation generates, for all sufficiently small nonzero values of $\varepsilon$, a nearby solution. Under a suitable small Lipschitz condition this solution is locally unique, while in the differentiable case it belongs to a unique local $C^1$ branch. The framework contains the abstract linear Fredholm averaging theory as a special case, but also covers quasilinear problems for which the principal operator has no invertible linearization at the reference state. We also determine the leading asymptotic profile of the solutions. Applications are given to a vector $p$-Laplacian Duffing system and to a nonsmooth problem in a Hilbert space.

[468] arXiv:2610.02171 (replaced) [pdf, html, other]
Title: Ahlfors--Weill Extension, Asymptotically Conformal Curves and Epstein--Poincaré Surfaces
Ming Hong Tee
Subjects: Differential Geometry (math.DG); Geometric Topology (math.GT)

The Ahlfors--Weill construction explicitly extends a univalent function $f$ with Schwarzian norm less than $1/2$ to a quasiconformal homeomorphism of the Riemann sphere, an extension that can be understood geometrically through Epstein surfaces. For asymptotically conformal curves, the uniformization map can be extended to a larger disk, and Loewner theory can be used to verify that this extension is quasiconformal. In this paper, we construct a local quasireflection with such an extension. Using this local quasireflection, we modify classical estimates of Ahlfors and show that domains bounded by asymptotically conformal curves have asymptotically similar hyperbolic and quasihyperbolic metrics. Furthermore, by combining these estimates with a geometric reinterpretation of the extension through Epstein surfaces, we show that the Epstein-Poincaré surfaces of the complementary domains are arbitrarily close to one another near the curve.

[469] arXiv:2610.10577 (replaced) [pdf, html, other]
Title: A Faithful Action of the Mapping Class Group $\mathrm{Mod}(S_g)$ on the $(2g-1)$-Sphere
Shile Wang
Comments: 12 pages; v2: fixed typos
Subjects: Geometric Topology (math.GT)

We prove that $\mathrm{Mod}(S_g)$ acts faithfully by orientation-preserving homeomorphisms on a $(2g-1)$-sphere when $g \geq 3$ using equivariant blow-up and bi-orderability of the Torelli group.

[470] arXiv:2610.10578 (replaced) [pdf, html, other]
Title: Coefficient arithmetic and Mellin moments of the Rogers-Ramanujan continued fraction
K. Srinivasa Raghava
Comments: 21 pages, no figures. Substantially revised; title and abstract updated. Added Theorem 1.1 on coefficient signs in all arithmetic progressions and Theorem 1.2 on leading double-logarithmic limits for the density and first occurrence of negative coefficients at prescribed 5-adic valuations. Integral sections shortened
Subjects: Number Theory (math.NT)

We study the signs of logarithmic coefficients associated with the Rogers-Ramanujan continued fraction. An explicit criterion involving a finite product determines whether all coefficients in an arithmetic progression are negative or both signs occur with positive natural density. On the sets $n=5^a m$, $5\nmid m$, negative coefficients occur with positive relative density $\delta_a^-$ at every fixed $a$. If $m_a$ is the least such $m$, we prove that both $5^{-a}\log\log(1/\delta_a^-)$ and $5^{-a}\log\log m_a$ tend to $5\log\phi/(12e^\gamma)$, where $\phi=(1+\sqrt5)/2$ and $\gamma$ is Euler's constant. These are leading double-logarithmic asymptotics, obtained from classical results on additive and multiplicative functions. Coefficient formulas also give irrationality and nonvanishing, determine the poles and residues of generating functions for normalized Mellin moments, and imply that these generating functions are not D-finite. We conclude with applications to integrals involving zeta, Dirichlet $L$, and cusp-form $L$-functions.

[471] arXiv:2610.16693 (replaced) [pdf, html, other]
Title: Surface-to-Volume Homogenization of NonLinear Steklov Eigencouples with NonHomogeneous Orlicz Growth in Perforated Domains
Hermann Douanla, Hubert Nnang, Joel Fotso Tachago, Jean Louis Woukeng
Comments: 28 pages
Subjects: Analysis of PDEs (math.AP)

We study normalized principal Steklov eigencouples on periodically perforated domains when both the bulk energy and the boundary normalization have general, possibly nonhomogeneous, Orlicz growth. The surface term on the hole boundaries carries the critical surface-to-volume scaling. For each fixed mass level, the constrained minima converge along the whole family, while selected minimizers, fluxes and Lagrange multipliers converge along subsequences to the corresponding objects of a homogenized problem. In the limit, the bulk operator is given by a convex cell problem, and the boundary term becomes a volume term weighted by the total surface density of the reference hole. The key tool is a strong approximation of the microscopic traces by cell averages, measured in the scaled surface modular.

[472] arXiv:2610.16746 (replaced) [pdf, html, other]
Title: Superdecomposable Incidence and Complete Path Algebras
Can Hatipoğlu, Christian Lomp
Comments: 10 pages
Subjects: Rings and Algebras (math.RA)

Generalizing the setting of the second author's work from 2007, we characterize quivers $Q$ for which the dual algebra $R$ of the path coalgebra of $Q$, equivalently the complete path algebra, has no nonzero uniform right ideals: this happens exactly when every vertex of $Q$ can reach a vertex emitting at least two distinct arrows. Equivalently, the injective hull $E(R)$ of the right regular module is superdecomposable. These conditions are also equivalent to the path coalgebra having no nonzero hollow factor modules as a left module over its dual algebra. We also characterize nonempty locally finite posets whose incidence algebras have superdecomposable injective hulls of their right regular modules: this happens exactly when no principal up-set is upward directed.

[473] arXiv:2610.17876 (replaced) [pdf, html, other]
Title: A converse to Littlewood-type theorem for random Dirichlet series
Jiale Chen, Min He, Maofa Wang
Comments: This version generalizes the characterization in the mixed norm space setting to the full range $0<q<\infty$
Subjects: Complex Variables (math.CV)

This article investigates random Dirichlet series within the framework of Hardy and mixed norm spaces of Dirichlet series. For randomization methods by sequences of non-constant independent and identically distributed random variables, we completely characterize when the random symbol space of the Hardy space $\mathscr{H}^p$ (respectively, the mixed norm space $\mathscr{H}^{p,q}_{\alpha}$) coincides with $\mathscr{H}^2$ (respectively, $\mathscr{H}^{2,q}_{\alpha}$). We also obtain some integrability results when Dirichlet series belong to the corresponding random symbol spaces. The same methods also yield a complete characterization for mixed norm spaces on the unit disk in the range $0<q<4$, closing the gap between previously known necessary and sufficient conditions.

[474] arXiv:2610.22063 (replaced) [pdf, html, other]
Title: Finite Volume Convergence for a Heat Equation with a Measure-Valued Source
Matthias Gobbert, Martin Kružík, Andreas Meister, Michael Muscedere
Subjects: Numerical Analysis (math.NA); Analysis of PDEs (math.AP)

Past work with Tom Seidman analyzed the spatial convergence order of the numerical finite element method applied to time-dependent diffusion-reaction equations with a measure-valued source term. For smooth source terms, the numerical method has second-order accuracy, but the non-smooth source terms introduce a limitation of the order that depends on the spatial dimension. This work in honor of Tom extends the analysis to the finite volume method in its clas- sical two-point flux form and shows that the regularity of the source term reduces the convergence order to 1 in two and 0.5 in three spatial dimensions which is reduced from the nominal second-order and depends on the space dimension. Computational tests with a point source modeled by a Dirac delta distribution exhibit the behavior predicted by the analytical results.

[475] arXiv:2610.22183 (replaced) [pdf, html, other]
Title: Fixed-Point Abundances and the Onset of Extinctions in Multispecies Lotka-Volterra Ecosystems
Philippe Jacquod
Comments: Erroneous reference to the chat with Claude corrected
Subjects: Mathematical Physics (math-ph)

I investigate the average and variance of species abundance distributions for fixed-point solutions to generalized Lotka-Volterra ecosystems. Two different analytical methods are constructed. First, I build up on the perturbative Random Matrix Theory approach developed in my earlier work [Phys. Rev. E. 113, L062202 (2026)], and formalize this method diagrammatically. The abundance average is given by a sum of planar diagrams with non-crossing vertex pairings which can be encoded as Dyck paths. This allows me to express the combinatorial factor multiplying perturbative terms at each order as Catalan and Narayana numbers, following which the abundance average is given by the latter's generating functions. In this way, the infinite perturbation expansion is exactly resummed in a closed-form formula. I have not been able to find a similar resummation for the abundance variance, however diagrammatic Feynman rules are expressed, following which the perturbative series can be calculated to any desirable order. Second, I do the same calculations using the cavity method, which gives closed-form formulas for both the abundance average and variance. For the average, the cavity formula gives the exact same result as the perturbative approach when the average interspecies interaction vanishes. When this is not the case, the two results are functionally different, however they are hardly distinguishable in their parametric range of validity. Comparison with numerical data indicate that the cavity result is more accurate over a larger parameter range.

[476] arXiv:2610.24427 (replaced) [pdf, html, other]
Title: Prescribed-Vertex Rainbow Cycle Spectra in Graph Systems under a Local Ore Condition
Ailian Chen, Jiahuang Lin
Subjects: Combinatorics (math.CO)

Let $\GraphSys=(G_1,\ldots,G_n)$ be a system of graphs on a common $n$-vertex set, put $\delta(v)=\min_i d_{G_i}(v)$ and $E_\cap=\bigcap_i E(G_i)$, and write $d^c$ for rainbow distance. Assume that each $G_i$ is $2$-connected and that $d^c(u,v)\le2$ and $\delta(u)+\delta(v)<n$ imply $uv\in E_\cap$. We prove that either every prescribed vertex belongs to a rainbow cycle of every length $4,\ldots,n$, or all members coincide with the balanced complete bipartite graph. The non-exceptional systems are also rainbow pancyclic. Under the stronger local cutoff $4n/3-1$, every vertex additionally lies on a rainbow triangle, yielding rainbow vertex-pancyclicity; the cutoff is sharp in the stated congruence class. The proofs use prescribed-color detours, root-preserving neighborhood separation, and a rigidity theorem for missing rooted lengths.

[477] arXiv:2610.24576 (replaced) [pdf, html, other]
Title: Least energy solutions for a quasilinear Neumann problem
Annamaria Canino, Simone Mauro
Comments: 27 pages, 1 figure
Subjects: Analysis of PDEs (math.AP)

We study the existence of nonconstant weak solutions and the qualitative behavior of the least energy level for a class of quasilinear elliptic problems with Neumann boundary conditions of the form \[ -\sum_{i,j=1}^N D_{x_j}(a_{ij}(x,u)D_{x_i}u) +\frac12\sum_{i,j=1}^N D_s a_{ij}(x,u)D_{x_i}uD_{x_j}u =g(u)-\lambda u \quad \text{in }\Omega. \] Since the associated energy functional is neither of class $C^1$ nor locally Lipschitz, the classical Nehari manifold method cannot be applied directly. We therefore rely on variational techniques combined with nonsmooth critical point theory.
For $\lambda>0$, we prove the existence of least energy solutions and show that, under suitable assumptions, they are nonconstant for large $\lambda$ and constant for sufficiently small $\lambda$. Moreover, the least energy level tends to $+\infty$ as $\lambda\to+\infty$.
In the indefinite regime, a key ingredient is a spectral decomposition of $H^1(\Omega)$ associated with the linear operator \[ \mathcal L_0u :=-\sum_{i,j=1}^N D_{x_j}\bigl(a_{ij}(x,0)D_{x_i}u\bigr). \]

[478] arXiv:2610.26523 (replaced) [pdf, html, other]
Title: Counting Lattice Points in Translations: Uniqueness and Existence Results
Ansgar Freyer, Georg C. Hofstätter
Subjects: Combinatorics (math.CO); Metric Geometry (math.MG)

Generalizing a recent theorem by Higashitani et al. (Comb. Theory 2025), it is shown that a convex body $K$ is uniquely described up to integer translation by the function $\mathrm{t}_K(v) = |(K-v)\cap\mathbb{Z}^n|$, $v\in\mathbb{R}^n$. For a lattice polytope $P$ the function $\mathrm{t}_P$ is decomposed into homogeneous components $\mathrm{t}_{P,i}$, similar to the Ehrhart polynomial. It is shown that the functions $\mathrm{t}_{P,i}$ are simultaneous eigenfunctions of a family of linear operators introduced by Kubert and Lang in (Math. Z. 1976) and that, conversely, the linear spaces of piecewise constant eigenfunctions are generated by the respective coefficients $\mathrm{t}_{P,i}$. A structure theorem for the simultaneous eigenspace corresponding to the $(n-1)$st coefficient in the decomposition of $\mathrm{t}_P$ is obtained. This leads to an explicit description of the set of functions $\mathrm{t}_P$, where $P$ ranges over all lattice polygons, as well as to inequalities for the number of lattice points in dilated and translated lattice polytopes.

[479] arXiv:2610.28301 (replaced) [pdf, html, other]
Title: Gaussian Fluctuations of the Gradient of the Fréchet Function and Nonstandard Asymptotics of Sample Fréchet Means
Yutaro Nakabayashi
Comments: 25 pages
Subjects: Probability (math.PR); Statistics Theory (math.ST)

We establish a central limit theorem for the gradient of the Fréchet function in local Euclidean coordinates on a metric space. Assuming a unique population mean, a consistent measurable sequence of sample means, semiconcavity or semiconvexity and moment bounds for the squared distance functions, and local $C^{1,\alpha}$ regularity of the population Fréchet function, we prove an asymptotic linear representation for its gradient at the sample mean. The leading term is the negative empirical average of the gradients of the squared distance functions at the population mean; these gradients exist almost surely under our assumptions. On complete connected Riemannian manifolds, uniqueness of the population mean, existence of a $(2+\eta)$-moment, and local $C^{1,\alpha}$ regularity suffice, and the leading term is expressed through the logarithm map. We also give a sufficient condition for the regularity of the population Fréchet function through probability bounds for neighborhoods of cut loci. We then show how the local behavior of the population Fréchet function transforms these Gaussian fluctuations into limit distributions for suitably rescaled sample Fréchet means, allowing for anisotropic scaling and non-Gaussian limits. A flat-torus example exhibits anisotropic scaling, and two examples on the circle illustrate logarithmic smeariness and the failure of any deterministic linear scaling to yield a nondegenerate limit, respectively.

[480] arXiv:2610.28691 (replaced) [pdf, html, other]
Title: Two q-Deformations of Narayana Polynomials: Rogers Moments, Hankel Positivity, and q-Narayana Kernels
Jiang Zeng
Comments: 39 pages. Added a Rogers-functional derivation of Tevlin's recurrence, results on dual \(q\)-Narayana triangles, and further total-positivity consequences
Subjects: Combinatorics (math.CO)

We study two $q$-deformations of the continuous interpolation between type $B$ and shifted type $A$ Narayana polynomials, both based on the continuous $q$-ultraspherical (Rogers) functional. For the affine-moment deformation, we establish coefficientwise Hankel total positivity via a continuant criterion and determine Hankel determinants and extremal coefficients of minors. The Askey--Wilson basis deformation yields a basic-hypergeometric Narayana kernel whose row polynomials have simple negative zeros, strict interlacing, and $\gamma$-positivity after palindromic normalization. A $q^2$-Askey--Wilson integral gives a continuous-parameter moment proof of the Krattenthaler--Wachs super $q$-Narayana expansion; an ordinary-power expansion recovers Pan's Touchard identity. For $0<q<1$ and $\theta>-1$, we establish total positivity of the kernel triangle and strict total positivity of its associated square, extending Wang--Yang's results simultaneously in $(\theta,q)$. We also prove coefficientwise total nonnegativity through order two for endpoint triangles and give an exact triangular change of basis between the deformations. Finally, we identify Tevlin's dual super $q$-Narayana polynomials with a normalized kernel, derive the recurrence for their index-two $q$-$\gamma$ coefficients via Rogers-functional Pearson--Christoffel identities, and deduce total positivity of the dual triangles and strict total positivity of their squares.

[481] arXiv:2610.29771 (replaced) [pdf, html, other]
Title: Logics vs doctrines, a mirror symmetry
Ivan Di Liberti, Umberto Tarantino, Lingyuan Ye
Comments: Corrected minor mistakes and introduced the notion of tightness in Section 5
Subjects: Category Theory (math.CT); Logic in Computer Science (cs.LO); Logic (math.LO)

We study the relationship between doctrines, encoding 2-categories of theories in predicate logic, and fragments of geometric logic, defined through Kan injectivity in the 2-category of topoi. After a brief historical account of the notion of doctrine, we propose our working definition. Our main result then establishes a Galois connection between doctrines and subgeometric logics. This connection suggests a mirror symmetry between the world of doctrines and the world of logics, in which constructions and results on either side admit counterparts on the other. We develop this symmetry through constructions of syntactic categories and classifying topoi in both settings, recovering the familiar examples from categorical logic. We prove paired Diaconescu-type theorems and give symmetric descriptions of the two closure operators induced by the Galois connection. Finally, we characterise when passing from a doctrine to its closure induces a reflection between the corresponding 2-categories of algebras, and we relate this reflection to conceptual completeness.

[482] arXiv:2610.30204 (replaced) [pdf, html, other]
Title: Triple Products of Correlated Multivariate Hermite Polynomials
Laura Lyman
Comments: 25 pages, 4 figures, 1 supplementary PDF with data tables
Subjects: Numerical Analysis (math.NA); Methodology (stat.ME)

Stochastic Galerkin schemes (SGS) are used to approximate solutions to differential equations with stochastic parameters. In particular, they express the solution with an infinite orthogonal functional basis of the parameter space and derive a deterministic surrogate system of PDEs whose solution approximates that of the original stochastic problem. When the parameters are correlated, the infinite series representation of the solution does not provably converge for all joint distributions; further, classic decorrelating transformations (e.g., Rosenblatt, Nataf) often introduce known numerical instabilities. Rahman (2017) established convergence in probability and distribution for correlated Gaussian parameters when the basis functionals are multivariate Hermite polynomials (MHPs), where these polynomials are only weakly orthogonal with respect to the underlying joint density. Due to weak orthogonality, the $N$th moments of MHPs that emerge during Galerkin projection do not trivially decompose into products of one-dimensional expectations via tensorization. Namely, an $N$th-order moment has no closed-form expression for $N > 2$ and consequently is estimated numerically. Because the number of such moments grows combinatorially with parameter dimension and polynomial degree, approximating each one individually via sampling or quadrature can quickly become cost-prohibitive. In this paper, we introduce and prove several foundational properties of MHPs. These results culminate in an explicit formula for evaluating the $N = 3$ moments (triple products) directly without numerical estimation.

[483] arXiv:2610.31590 (replaced) [pdf, html, other]
Title: Upper tail large deviations of regular subgraph counts in sparse random regular graphs
Anirban Basak, Shaibal Karmakar
Comments: 64 pages, 2 figures; Conditional-ER result added (Theorems A.1 and A.2)
Subjects: Probability (math.PR); Combinatorics (math.CO)

For a $\Delta$-regular connected graph $H$ we obtain the upper tail large deviations speed and rate function for the number of copies of $H$ in $\mathbb{G}_n^d$, a random $d$-regular graph on $n$ vertices, in the localized regime $np^{\Delta/2}\gg(\log n)^{1/(v_H-2)}$ and $p\ll 1$, where $p:=d/n$ and $v_H$ is the number of vertices in $H$, and identify the typical structure of $\mathbb{G}_n^d$ conditioned on this rare event.
The degree constraint in $\mathbb{G}_n^d$ changes the Erdős-Rényi picture in two ways. First, the hub construction that competes with a clique in the regime $p \gg n^{-1/\Delta}$ is not feasible here. Consequently, for $\Delta \geq 3$ throughout the entire localized regime, both the rate function and the conditional structure are governed by a planted almost-clique, of size roughly $\delta^{1/v_H}np^{\Delta/2}$. Second, as no clique in $\mathbb{G}_n^d$ can be of size greater than $(d+1)$, for $\Delta=2$ (i.e.~in case of cycles), the rate function and the conditional structure are governed by $\lfloor\delta\rfloor$ many planted almost-cliques of size roughly $d$ and another planted almost-clique of size roughly $\{\delta\}^{1/v_H}d$. For cycles of even length, in lieu of pairs of almost-cliques each of size roughly $d$, the conditional structure may possess copies of almost-bicliques with each side roughly of size $d$.
In the complementary regime $1\ll n^{v_H}p^{e_H}\ll(\log n)^{\alpha^*_H/(\alpha^*_H-1)}$, where $e_H$ is the number of edges and $\alpha^*_H$ is the fractional independence number of $H$, and $H$ is a strictly balanced graph (and thus including regular $H$), we show that the upper tail large deviations speed and rate function for the number of copies of $H$ match with those in the Erdős-Rényi setting. In this regime, we further show that almost all unlabeled copies of $H$ conditioned on the upper tail event are edge disjoint.

[484] arXiv:2610.31689 (replaced) [pdf, html, other]
Title: Tilting theory on continuous quivers (I) maximal rigid and tilting subcategories
Haowei Liu, Zonghui Liu, Shijie Zhu
Comments: 29 pages
Subjects: Representation Theory (math.RT)

Let $\mathrm{rep}(\mathbb I)$ be the category of finitely generated persistence modules on the interval $\mathbb I\subseteq\mathbb R$. We study the maximal rigid subcategories of $\mathrm{rep}(\mathbb I)$. Maximal rigid interval consistent subcategories are classified via tilting modules over the corresponding discrete type $A$ quiver. We compare several related notions, (weak) tilting and maximal rigidity, in both the context of hereditary abelian categories with enough projective objects and $\mathrm{rep}(\mathbb I)$ and prove that every maximal rigid interval consistent subcategory is weak tilting and every maximal rigid consistent below subcategory is tilting. In addition, any maximal rigid subcategory $\mathbf T\subseteq \mathrm{rep}(\mathbb I)$, not necessarily being interval consistent, satisfies $\mathbf T^{\perp_1}=\mathop {Gen}(\mathbf T)$. We also establish a continuous analogue of Ingalls-Thomas's bijection by showing a bijection between integrally supported maximal rigid consistent below subcategories and integrally generated torsion classes.

[485] arXiv:2610.33219 (replaced) [pdf, html, other]
Title: Explicit strong blocking sets and minimal codes from expander graphs using a new graph parameter
Anurag Bishnoi, Ioannis Kakatelis
Comments: 15 pages
Subjects: Combinatorics (math.CO)

A strong blocking set is a set of points in a finite projective space that intersects every hyperplane of the space in a spanning set of the hyperplane. These objects have been studied both in finite geometry and coding theory due to their equivalence with minimal codes. We give an explicit construction of strong blocking sets using expander graphs that improves the explicit construction of Alon et al. (Noga Alon, Anurag Bishnoi, Shagnik Das, Alessandro Neri, Strong blocking sets and minimal codes from expander graphs. Transactions of the American Mathematical Society ) by introducing a new geometrically motivated graph parameter that is better suited for this problem. Using this approach, we improve the constant $C$ in the explicit construction of a strong blocking set of size $C (q+1) k$ in the $(k - 1)$-dimensional projective space over $\mathbb{F}_q$ for every prime power $q \geq 7$.

[486] arXiv:2610.33384 (replaced) [pdf, html, other]
Title: Absolutely universal projective embeddings of long-root geometries of orthogonal type
Antonio Pasini
Subjects: Group Theory (math.GR)

Let $G$ be a split Chevalley group of type $B_n$ ($n \geq 3$) or $D_n$ ($n \geq 4$), let $L$ be its Lie algebra and $\Gamma$ its long-root geometry, namely $\Gamma$ is the line-grassmannian of the polar space associated to $G$. It is well known that $L$ hosts a projective embedding of $\Gamma$, called the adjoint embedding, which realizes $\Gamma$ as a projective variety in the projective geometry of the underlying vector space of $L$. It is also known that $\Gamma$ admits the absolutely universal projective embedding, which is such that all projective embeddings of $\Gamma$ can be obtained from it as projections. When the field $F$ over which $G$ is defined is finite, the universal embedding of $\Gamma$ is just the same as the adjoint embedding. The same is not necessarily true when $F$ is infinite. Indeed, as we shall prove in this paper, the universal projective embedding of $\Gamma$ lives in a direct sum $K\oplus L$ for an $F$-vector space $K$, the dual of which is isomorphic to the derivation space $\mathrm{Der}(F)$ of $F$, which in general is non-trivial. Accordingly, the adjoint embedding of $\Gamma$ is universal if and only if $\mathrm{Der}(F)$ is trivial, namely $F$ is either perfect of positive characteristic or algebraic over its minimum subfield.

[487] arXiv:2610.35742 (replaced) [pdf, html, other]
Title: Yang-Mills-Higgs Limits of Reflexive Higgs Sheaves
Tianshu Jiang, Yijian Zhang
Comments: 37 pages
Subjects: Differential Geometry (math.DG)

For stable Higgs bundles, Hermitian-Einstein metrics can be obtained as limits of the Yang-Mills-Higgs (Y-M-H) flow. We study the algebraic structure of subsequential limits of this flow for reflexive Higgs sheaves over compact Kähler manifolds, without assuming stability. We prove that the limiting reflexive Higgs sheaf is isomorphic to the double dual of the graded sheaf associated with the Harder-Narasimhan-Seshadri filtration of the initial sheaf.

[488] arXiv:2610.37444 (replaced) [pdf, html, other]
Title: DREAM: Delay-Resistant Acceleration with Momentum
Mert Gürbüzbalaban, M. Hamza Rafi, Necdet Serhat Aybat, Waheed U. Bajwa
Subjects: Optimization and Control (math.OC)

With exact, delay-free gradients, Nesterov's accelerated gradient (NAG) achieves optimal $\sqrt{\kappa}$ dependence for $L$-smooth, $\mu$-strongly convex objectives, where $\kappa=L/\mu$; heavy-ball (HB) achieves the same scaling on strongly convex quadratics. In asynchronous and distributed settings, gradients can be inexact, with delays varying across workers and iterations. We isolate staleness using a fixed delay $\tau\ge1$, replacing $\nabla f(y_k)$ with $\nabla f(y_{k-\tau})$ at iteration $k$. Arjevani, Shamir, and Srebro establish a worst-case lower bound of $\Omega(\tau\sqrt{\kappa}\log(1/\varepsilon))$ iterations to reach objective error at most $\varepsilon$ as $\varepsilon\to0$. We show that for any fixed positive delay, neither NAG nor HB retains $\sqrt{\kappa}$-acceleration on strongly convex quadratics when updating every iteration, for any stable constant step size and positive momentum. We introduce delay-resistant accelerated momentum (DREAM), which decouples gradient-query extrapolation from momentum and uses explicit delay-dependent parameters. DREAM attains a linear convergence rate $1-\Theta(1/(\tau\sqrt{\kappa}))$ for all smooth strongly convex objectives as $\kappa\to\infty$, yielding complexity matching the delayed first-order lower bound up to logarithmic factors. Our proof combines characteristic-polynomial stability analysis on quadratics with an analytic Zames--Falb integral quadratic constraint certificate. We extend DREAM to smooth convex objectives, obtaining near-optimal iteration complexity up to logarithmic factors for sufficiently small target accuracy. Experiments on strongly convex quadratics and regularized logistic regression corroborate DREAM's accelerated condition-number dependence under delay, unlike NAG and HB, and suggest this scaling persists when parameters use a conservative bound on the true delay.

[489] arXiv:2610.37724 (replaced) [pdf, other]
Title: Symplectic Cuts and Moment Polyptychs of Hypertoric Varieties
Benjamin C. W. Brown
Comments: 28 pages, 6 figures. v4: abstract updated; v3: references added, minor edits; v2: the paper has been split into two parts; this is Part I, and the quantisation results of v1 will appear in Part II
Subjects: Symplectic Geometry (math.SG); Algebraic Geometry (math.AG)

We study compact symplectic cuts of hypertoric varieties and characterise their smoothness. When the defining arrangement has a non-empty bounded base region, the fibre-rotation action has a proper moment map and gives compact Kähler orbifold cuts at regular levels. For a smooth hypertoric manifold, an outer-chamber cut, taken above the largest critical value of this moment map, is smooth if and only if the manifold is the cotangent bundle of its distinguished compact toric subvariety; that subvariety is then a product of projective spaces, and every positive level is regular with a smooth cut. If the compact core of a smooth hypertoric manifold is reducible, every outer-chamber cut has a boundary point with non-trivial cyclic isotropy and a singular coarse local quotient, whereas every cut below the smallest positive critical value is smooth. We introduce the moment polyptych, assembled from truncated arrangement regions, and recover the residual fixed points, tangent weights, and finite local groups from its edges and labelled lattice data. Restriction to arrangement flats is compatible with cutting and supplies the lower-dimensional models used in these calculations. The resulting local data are applied to equivariant quantisation in the companion paper (arXiv:2611.14090).

[490] arXiv:2610.39336 (replaced) [pdf, html, other]
Title: Point Corrections and Wall-Crossing Geometry on the Quintic del Pezzo Threefold
Zheyuan Fu
Subjects: Algebraic Geometry (math.AG)

We study wall crossing for ideal classes of rational curves of degrees two through five on the quintic del Pezzo threefold $X=V_5$. Wall exclusion and a uniform bound on the correction length rule out point corrections in degrees two through four on the outer segments of the negative zero-tilt-slope paths. In degree five a correction of length one occurs and gives rise to a second component of the good moduli space.
For a rational outer stability parameter, this space is reduced and has exactly two irreducible components. The closure of the smooth rational-quintic locus is a normal tenfold. The other component is the smooth thirteenfold $X\times\mathrm{Gr}(2,7)$. Its points represent the polystable objects $I_{E_L}[1]\oplus\mathcal{O}_p$, where the pencil $L$ cuts out a quintic linear section $E_L$ of arithmetic genus one. The scheme-theoretic intersection is the normal determinantal ninefold parametrizing pairs $(p,L)$ for which $E_L$ is singular at $p$. Along their common reduced singular locus, the principal component and the intersection have transverse models given by the cones of $2\times4$ and $2\times3$ matrices of rank at most one, respectively. We construct a small resolution of the principal component as the projectivization of a rank-five extension bundle over the blow-up of the Altavilla--Petković--Rota sixfold along its point locus.

[491] arXiv:2610.39838 (replaced) [pdf, html, other]
Title: Indecomposability of derived categories and nef canonical divisors in dimensions three and four
Dongjian Wu, Nantao Zhang
Comments: Update title and introduction, 26 pages, Comments are welcome
Subjects: Algebraic Geometry (math.AG)

We prove that a smooth projective threefold or fourfold whose bounded derived category admits no nontrivial semiorthogonal decomposition has nef canonical divisor, which establishes \cite[Conjecture~1.1]{KO2018} in these dimensions. The proof combines the classification of extremal contractions with constructions of nontrivial admissible subcategories. In dimension four, we refine the descriptions of isolated surface fibers and construct exceptional objects supported on certain fibers.

[492] arXiv:2611.00257 (replaced) [pdf, html, other]
Title: Porosity in Diophantine approximation
Henna Koivusalo, Benjamin Ward
Comments: 18 pages
Subjects: Number Theory (math.NT); Dynamical Systems (math.DS)

We provide a general framework for obtaining upper bounds on the packing dimension of certain sets arising from Diophantine approximation using the notion of porosity from geometric measure theory. In particular, the framework relies on showing that such sets are mean porous, as introduced by Koskela and Rohde (Math. Ann., 1997). As applications of our framework we show that:
For $\varepsilon>0$ sufficiently small, the set of $d$-dimensional $\varepsilon$-badly approximable points has packing codimension comparable to $\varepsilon^{d}$ up to multiplicative constant.
Any $C^{2}$ submanifold of $\mathbb{R}^{d}$ with bounded first and second partial derivatives intersected with the set of $d$-dimensional $\varepsilon$-badly approximable points has packing dimension strictly less than the dimension of the submanifold.
For any matrix $A\in \mathbb{R}^{m\times n}$ satisfying certain Diophantine conditions, the set of points that avoid the $\varepsilon \|\mathbf{q}\|_{\infty}^{-\frac{n}{m}}$-neighbourhood of the orbit $\{A\mathbf{q} \mod \mathbb{Z}^{m}:\mathbf{q} \in \mathbb{Z}^{n}\}$ has packing codimension greater than $C_{A} \varepsilon^{m}$ for $C_{A}$ a constant depending on $A$ and $m$ only. \end{itemize}

[493] arXiv:2611.00793 (replaced) [pdf, html, other]
Title: A Second-Order Stochastic Dynamic Mode Decomposition by Richardson Extrapolation
Yuanchao Xu
Subjects: Numerical Analysis (math.NA)

Stochastic dynamic mode decomposition (SDMD) approximates the Koopman semigroup of an Itô diffusion by a Galerkin generator matrix on a dictionary of observables, computed from samples of the invariant law and generator evaluations, and advances observables with a first-order stochastic Taylor step (SDMD-1). The second-order Taylor step (SDMD-2) also needs a third matrix, a dictionary with four derivatives, and a fourth-order differential operator evaluated at every sample. Richardson extrapolation of the SDMD-1 step (SDMD-R) is second-order accurate with the data, the matrices, and the regularity of SDMD-1. The error bound, for exact and empirical matrices, consists of the Galerkin error of the dictionary, a time-stepping term, and a data term of order $m^{-1/2}$ in the sample size $m$. Relative to the Galerkin semigroup, the limit of the schemes as the time step $\dt\to0$, the time-stepping error is $O(\dt^2)$ for SDMD-R and $O(\Theta_N\dt+\dt^2)$ for SDMD-2, with $\Theta_N$ the norm of the second-order Galerkin residual $\Proj_N\cA(I-\Proj_N)\cA|_{\cV_N}$, and the first-order term is attained. For reversible periodic diffusions and trigonometric dictionaries with cutoff $K$, the step restriction $\dt\lesssim K^{-2}$ makes all three schemes contractions, and the error against the Koopman semigroup on $H^\ell$ observables is $O(K^{-(\ell-2)}+\dt^p)$ plus a data term of order $K^{d+2}(m^{-1}\log K)^{1/2}$ in dimension $d$, with $p=1$ for SDMD-1 and $p=2$ for SDMD-R and SDMD-2. In experiments with trigonometric dictionaries the errors of SDMD-R and SDMD-2 differ by at most ten percent. For a spline dictionary with two derivatives, SDMD-R remains second-order accurate, whereas SDMD-2 with pointwise evaluations is first-order accurate.

[494] arXiv:2611.01741 (replaced) [pdf, html, other]
Title: Improved Berezin--Li--Yau Bounds for Dirichlet Eigenvalues via Fourier Coupling and Frequency Concentration
Yifan Wang, Hehu Xie
Comments: 35 pages
Subjects: Functional Analysis (math.FA)

Let $0<\lambda_1\leq\lambda_2\leq\cdots$ be the Dirichlet eigenvalues of an open set $\Omega\subset\mathbb R^n$, $n\geq2$. We develop two Fourier-space refinements of the Berezin--Li--Yau argument. For every finite-measure open set, coordinate commutator identities and coupled scalar--vector projections lead to a one-dimensional variational constant $C_n^{\mathrm{new}}$ and the individual bound \[ \lambda_k\geq C_n^{\mathrm{new}}(2\pi)^2\omega_n^{-2/n} |\Omega|^{-2/n}k^{2/n}, \qquad \frac{n}{n+2}<c_n^{\mathrm{env}}<C_n^{\mathrm{new}}<1. \] Here $n/(n+2)$ is the classical Li--Yau individual coefficient and $c_n^{\mathrm{env}}$ is the coefficient associated with the uncoupled scalar envelope developed in our previous paper. Thus the displayed strict hierarchy separates the gain of the scalar energy envelope from the further gain supplied by the commutator coupling. For bounded open sets, a frequency-concentration operator, its first two traces, and the Ky Fan principle force Fourier mass outside the Li--Yau filling ball. A two-region bathtub argument then gives \[ \sum_{j=1}^k\lambda_j \geq \mathcal C_k^{(2)}(\Omega) \frac{n}{n+2}(2\pi)^2\omega_n^{-2/n} |\Omega|^{-2/n}k^{1+2/n}, \qquad \mathcal C_k^{(2)}(\Omega)>1, \] where $\mathcal C_k^{(2)}(\Omega)$ is strictly decreasing in $k$ and converges to one, and \[ \mathcal C_k^{(2)}(\Omega)-1\geq \frac{n+2}{2(n+1)^2} \left(\frac{\omega_{n-1}}{\omega_n}\right)^2 \left(\frac34\right)^{n-1}k^{-2/n}. \] Thus the sharp leading term in the Berezin--Li--Yau sum is supplemented by an explicit positive, volume-only correction of order $k$. Apart from boundedness in the concentration argument, no boundary regularity, convexity, or connectedness is assumed. These improvements do not prove Pólya's conjecture: the individual coefficient is below one, and the sum multiplier tends to one.

[495] arXiv:2611.04184 (replaced) [pdf, html, other]
Title: Short permutation pattern waves: The complete length-five classification
Lihong Qiu, Minglei Mao, Yaping Mao
Comments: 20 pages, 6 figures
Subjects: Combinatorics (math.CO)

For a permutation pi in Sk, a pi-wave is an increasing sequence of integers whose consecutive gaps have relative order pi. Let g(pi, n) be the maximum cardinality of a pi-wave-free subset of [n], and let P(pi, r) be the least integer N such that every r-coloring of [N] contains a monochromatic pi-wave. We determine the asymptotic orders of both functions for every permutation of length at most five. Existing upper bounds and weak-wave constructions provide sharp bounds for all but eight length-five patterns in S_5. For these eight exceptional alternating patterns, we establish g(pi, n) = Theta((log n)squared) and P(pi, r) = Theta(r(log r)squared).

[496] arXiv:2611.05656 (replaced) [pdf, html, other]
Title: Every obstruction to noncontextual hidden variables is finite: well-founded refutations in infinitary real-valued logic
Olivia Aubone, José Iovino
Subjects: Logic (math.LO)

We study the obstructions to noncontextual hidden variables when quantum probability is described in full, by the complete lattice of closed subspaces of a separable infinite-dimensional Hilbert space together with its countably additive measures. We give such a description in infinitary real-valued logic, the infinitary extension of Keisler's model theory of general structures; the countable suprema and infima of this logic express the completeness of the lattice and the countable additivity of the measures. The standard models of our axioms represent exactly the density-operator measures of Gleason's theorem. The axioms are closed conditions, non-strict inequalities between the values of sentences and rational numbers. The expressive power afforded by infinitary sentences comes at the price of compactness. The hypothesis that at each hidden state every event receives the value 0 or 1, whatever the context of measurement, contradicts the axioms, yet it is consistent with every finite subset of them. The obstructions nevertheless remain finite. We prove that in this logic a countable set of closed conditions is inconsistent if and only if a well-founded tree whose branches end in finite contradictions refutes it; for the hypothesis above, every such tree has an infinitely branching node. The finiteness theorem is therefore maximal: a hidden-variable hypothesis expressed by countably many closed conditions is inconsistent with the axioms, and thus an obstruction, exactly when such a tree refutes the hypothesis together with the axioms. The same language defines, uniformly across standard models, exactly the $\sigma$-projective sets of probabilities, and all these results are proved in ZFC.

[497] arXiv:2611.06041 (replaced) [pdf, html, other]
Title: Poissonian Pair Correlation and Discrepancy Rates
Bo Tan, Zhen Zhang, Qing-Long Zhou
Comments: Revised version
Subjects: Number Theory (math.NT); Probability (math.PR)

We prove the existence of a sequence in $[0,1)$ with Poissonian pair correlation (PPC) and optimal-order star discrepancy $D_N^*=O((\log N)/N)$, and further give a deterministic construction by applying a conditional-expectation rule to a nested dyadic random model. We also show that PPC imposes no universal discrepancy decay rate: for every positive sequence $\rho_N\to0$, there exists a PPC sequence with $D_N^*/\rho_N\to\infty$. Under suitable regularity and growth assumptions, we realize prescribed discrepancy asymptotics, including $D_N^*\sim c_\beta N^{-\beta}$ for every $0<\beta<1$, with $c_\beta>0$. We further construct a PPC sequence satisfying $D_N^*\asymp(\log N)/N$ for all sufficiently large $N$.

[498] arXiv:2611.06388 (replaced) [pdf, html, other]
Title: Lyapunov spectrum, Harder--Narasimhan filtration and thin monodromy
Fei Yu, Junming Zhang
Comments: Update several references. 63 pages,including a declaration of AI use, comments are very welcome
Subjects: Differential Geometry (math.DG); Algebraic Geometry (math.AG); Dynamical Systems (math.DS)

We study the equality case of the inequalities between the Lyapunov spectrum and the Harder--Narasimhan slopes of a semi-simple local system with non-expanding cusp monodromy over a finite-area hyperbolic surface. This gives a nonlattice-transversality alternative of the monodromy group. On the other hand, we generalize Filip's Assumptions A and B to give classes of polarized variation of Hodge structures that achieve the equality. As an application, we recover the thinness of C-32 in $\mathrm{Sp}_6\mathbb{R}$. Besides, we provide an upper bound, called average Cartan spectrum, that dominates the Lyapunov spectrum and study its rigidity.

[499] arXiv:2611.06578 (replaced) [pdf, html, other]
Title: Construction of entropies for cross-diffusion systems
Xiuqing Chen, Ansgar Jüngel, Mingyue Zhang
Subjects: Analysis of PDEs (math.AP)

The analysis of cross-diffusion systems with nonsymmetric and indefinite diffusion matrices often relies on the existence of entropies, that is, Lyapunov functionals whose dissipation often yields gradient estimates. We propose a general strategy for constructing entropies for two-species cross-diffusion systems, based on the assumption that the mobility matrix is symmetric, in accordance with Onsager's reciprocal relations. The symmetry condition leads to a linear hyperbolic equation in two variables, which can be reformulated as a linear transport system along the eigendirections of the diffusion matrix, related to the approach of Jenssen and Kogan for hyperbolic conservation laws. Positive solutions to this system yield a family of entropies parametrized by two arbitrary functions of one variable. Sufficient conditions for their existence on (possibly unbounded) characteristic rectangles are given, the mechanisms that may prevent the existence of an entropy are identified, and systems without any entropy structure are presented. The general construction recovers known entropies for models arising in physics and biology and provides new ones. For systems with an arbitrary number of components, we derive sufficient conditions for the existence of separable entropies and give a rank criterion for the uniqueness of entropies (up to affine functions). Cross-diffusion systems without symmetry of the mobility matrix are also discussed.

[500] arXiv:2611.07219 (replaced) [pdf, html, other]
Title: Neyman Orthogonalized Specification Tests for Conditional Tail Index Models
Liuhua Peng, Shuo Li, Xiaojun Song
Subjects: Statistics Theory (math.ST); Methodology (stat.ME)

We develop specification tests for parametric conditional tail index models of heavy-tailed distributions. The tests are based on a projected empirical process that removes the first-order effect of estimating the null parameter. Within the conditional Hall class, we identify conditions under which projection also eliminates the leading Pareto approximation bias in the test process, permitting lower thresholds while preserving asymptotically correct size. We establish the validity of the tests via multiplier bootstrap and characterize power against fixed and local alternatives. For log-linear models, bootstrap validity extends to settings in which covariates of observations above a common threshold concentrate and the smallest eigenvalue of the information matrix tends to zero. We further propose a novel threshold selection rule based on an estimate of the Pareto approximation bias after projection. The rule uses the estimated bias to determine whether a reference threshold can be lowered to retain more observations, with potential gains in power. The finite sample performance of the tests is examined through simulations and a real data application.

[501] arXiv:2611.09000 (replaced) [pdf, html, other]
Title: A Trivalent Graph of Girth 14 and Order 372
Geoffrey Exoo, Theodore Kolokolnikov
Comments: 6 pages and 3 figures
Subjects: Combinatorics (math.CO)

The smallest known trivalent graph of girth 14 is constructed. The graph has 372 vertices, improving the old upper bound of 384 \cite{exoo14}. The construction uses methods that may be new to this problem.

[502] arXiv:2611.09555 (replaced) [pdf, html, other]
Title: Supercuspidal, discrete, and elliptic densities for reductive groups over non-archimedean local fields
Erez Lapid, Mark Shusterman
Comments: 54 pages. Extended to discrete series densities and the distribution of Levi support classes; title and abstract updated
Subjects: Representation Theory (math.RT); Number Theory (math.NT)

Let $G$ be the group of points of a connected reductive group over a non-archimedean local field $F$ of arbitrary characteristic, with residue field of size $q$. For a principal congruence tower $K_n$ attached to a Lie algebra lattice $\mathcal{L}$, the supercuspidal and discrete series proportions of the Plancherel mass of the $K_n$-fixed vectors both converge, with error $O(q^{-n/4})$, to the probability that a Haar-random form in the dual lattice $\Lambda=\mathcal{L}^\vee$ is elliptic. For $\mathrm{GL}_d$, the supercuspidal limit confirms a prediction of Howe. This probability is positive, and we characterize when it is one. More generally, outside a union of congruence cells of total mass $O(q^{-n/4})$, each cell determines a common Levi class for the supercuspidal and discrete series supports of every tempered representation containing its character. The limiting mass of each class is the probability that a Haar-random form in $\Lambda$ lies in the corresponding stratum. The proof combines finite Fourier analysis, quantitative estimates for parabolic incidence maps, and a Jacquet-module argument that detects unitary exponents.

[503] arXiv:2611.10286 (replaced) [pdf, html, other]
Title: Costate-Conditioned Dynamic Programming for Parallel-in-Time Solution of Equality-Constrained Optimal Control Problems
Tom Lefebvre
Subjects: Optimization and Control (math.OC)

Gradient based trajectory optimisation algorithms spend most of their per-iteration time on a structured Newton--KKT system. The system corresponds to an equality-constrained linear-quadratic optimal control problem and dedicated Riccati-type solvers exhibit linear complexity in the horizon length. Parallel-in-time algorithms exhibit the potential to reduce the complexity to logarithmic in the horizon by distributing several subtrajectories over multiple cores and then stitch together the results by means of an associative scan. Existing exact formulations condition each subtrajectory on its terminal state. Each subproblem then carries the reachability to that terminal state explicitly as constraint rows. The associated reachability decision however is ill-conditioned for weakly actuated systems. In this work we condition each subtrajectory on the terminal costate instead. The resulting subproblems can now be computed by a free-end Riccati recursion without reachability carrying rows. This approach effectively compensates for the ill-conditioning of weakly actuated systems but requires additional bookkeeping with Lagrangian multipliers when stitching together the various subproblems. Numerically the method reproduces a direct solution of the primal-dual Newton-KKT system to $10^{-12}$ in relative terms, on a weakly controllable chain of masses. The accurracy rivals that of a sequential recursion, whereas terminal-state conditioning loses up to six digits or fails. Operation counts on a problem with 64 subtrajectories and a horizon of 4096 stages gives a speed-up of 26 compared with a sequential solve.

[504] arXiv:2611.11942 (replaced) [pdf, html, other]
Title: Pointwise estimates for an anisotropic product type singular integral on the sphere
Ahmed A. Abdelhakim
Subjects: Classical Analysis and ODEs (math.CA)

Let $\Gamma=\{1,\dots,d\}$, $d\geq 2$. For each $j\in \Gamma$, let ${\ell}_{j}\geq 1$ be an integer and let $\alpha_{j}\in (1/2,1)$. We obtain a pointwise estimate for the integral \begin{equation*} \int_{\mathbb{S}^{d-1}}\prod_{j\in \Gamma} |x^{\ell_{j}}_{j}-\xi_{j}|^{-\alpha_{j}} d \sigma(x), \end{equation*} in the region \begin{equation*} \{\xi\in \mathbb{R}^{d}: \xi_{j}\neq 0,\;j\in\Gamma,\;\; \sum\nolimits_{j\in F}|\xi_{j}|^{2/\ell_{j}}\neq 1,\; F\subseteq \Gamma\}. \end{equation*} These estimates are used to prove a Tomas - Stein type restriction theorem for the oscillatory integral operator $Tf(x)=\int_{\mathbb{R}^d}e^{\dot{\imath}h(x,y)}f(y)dy$, with the phase $h(x,y)=\sum\nolimits_{j\in\Gamma} a_{j} x_{j}^{\ell_{j}} y_{j}^{m_{j}}$, where, for each $j\in \Gamma$, $a_{j}\neq 0$ is a real number and $m_{j}>1$ is an integer.

[505] arXiv:2611.12258 (replaced) [pdf, html, other]
Title: On transition probabilities for the ASEP on the half-line
Alexandr Garbali, Cengiz Gazi, Jan de Gier, William Mead, Michael Wheeler
Comments: 19 pages
Subjects: Mathematical Physics (math-ph); Statistical Mechanics (cond-mat.stat-mech); Probability (math.PR)

We study the asymmetric simple exclusion process on the half-line with particle insertion and no particle removal at the boundary. We point out that there exist two distinct multiple contour integral formulas for the transition probability between two finite particle configurations containing the same number of particles. We recall one of these formulas from the literature and prove a second, new formula by showing that it satisfies the evolution equation using a coordinate Bethe ansatz calculation and verify that the initial condition is implemented by the contour integrals. As an application we sum this formula over all final configurations and obtain an integral formula for the probability that the number of particles is conserved up to a given time. The proofs use symmetric rational functions and their properties together with contour deformations.

[506] arXiv:2611.12866 (replaced) [pdf, html, other]
Title: Coarse Embeddings Beyond Doubling: Persistence Diagrams and Multiparameter Modules
Sushovan Majhi, Atish Mitra, Žiga Virk
Comments: 23 pages, 3 figures. Companion paper: arXiv:2611.16965
Subjects: Metric Geometry (math.MG); Algebraic Topology (math.AT)

We study coarse embeddings into Hilbert space and the asymptotic dimension of spaces of persistence diagrams and multiparameter persistence modules. We build coarse embeddings from admissible tent covers of bounded multiplicity at every scale, which doubling spaces carry but which do not require doubling: stacking them across dyadic scales gives an explicit $1$-Lipschitz coarse embedding, with lower gauge $c\sqrt{\tau t}$, or nearly linear for slowly decaying weights, and the same covers bound the asymptotic dimension by the multiplicity. The spaces of persistence diagrams are not doubling but carry such covers, and for diagrams with at most $n$ points our covers improve the constant of the known landmark embedding by a factor exponential in $n$. Slice by slice, the construction embeds multiparameter modules with boundedly many bars per slice under the matching distance on any finite net of slices, a class that contains the modules with at most $n$ generators. Under the continuous distances, bounding bars or persistent Betti numbers does not suffice: two-parameter modules with one bar on every slice have infinite asymptotic dimension, and neither they nor the modules of bounded support and bounded rank admit a coarse embedding into Hilbert space, under the matching or the interleaving distance.

[507] arXiv:2611.13533 (replaced) [pdf, html, other]
Title: Entropy maximization for cube projections
Zhekai Pang
Comments: 29 pages
Subjects: Probability (math.PR)

We prove that, in every dimension $n\ge150$, the one-dimensional projections of the uniform distribution on a cube have the largest differential entropy in directions with equal coordinate magnitudes. This establishes the conjecture of Eskenazis, Nayar, and Tkocz in these dimensions.

[508] arXiv:2611.13896 (replaced) [pdf, html, other]
Title: Face lattices of polytopes and bipolar polytopes
Jan Pavlík
Comments: 30 pages, 6 Figures, to be submitted in Journal of Combinatorial Theory, Series A v2: references updated, figures improved for greyscale printing
Subjects: Combinatorics (math.CO)

We show that the face lattice of every convex polytope $Q$ is, on the combinatorial level, the vertex set of a polytope one dimension higher: the faces of $Q$ are the vertices of a \emph{bipolar polytope} $W(\mathcal{F}(Q))$, and the intervals of the face lattice are its faces. Here a bipolar polytope is a polytope with two distinguished vertices, the poles, such that every facet contains exactly one of them and an intersection property holds. The vertices of every bipolar polytope carry a lattice order whose intervals are the faces, and this lattice is the face lattice of the vertex figure at either pole; conversely, every atomistic and coatomistic lattice that is an abstract polytope arises in this way. Geometrically, the polar of the Cayley polytope of $Q$ and $Q^\circ$ is a convex realization of $W(\mathcal{F}(Q))$ whenever the normal fan and the face fan of $Q$ satisfy a certain interval condition; this holds for cubes and cross-polytopes and for suitable realizations of all polytopes of dimension at most three. Finally, every combinatorial type of $3$-polytope has a realization that decomposes into convex bipolar polytopes, one for each vertex.

[509] arXiv:2611.14069 (replaced) [pdf, html, other]
Title: Quasi-equatorial controlled switching in inertial magnetization dynamics
Alessandro Fortunati, Massimiliano d'Aquino
Comments: 22 pages, 5 figures
Subjects: Dynamical Systems (math.DS)

We design exponentially decaying transverse magnetic fields for reliable and ultra-fast (picosecond) magnetization reversal governed by the inertial Landau--Lifshitz--Gilbert equation. The control construction uses an explicitly resolvable auxiliary model to select the field amplitude and characterize the influence of its decay rate, with the aim of obtaining reversal followed by relaxation without requiring a precisely timed interruption of the excitation. The auxiliary model is obtained through an equatorial approximation, and bounds on its latitude identify a regime consistent with quasi-equatorial motion. For the full nonlinear macrospin dynamics, an energy argument accounting for both inertial kinetic energy and the remaining field input provides a sufficient condition excluding backhopping, even while the exponential tail remains applied. Approximate confinement times and optimal decay rates are derived from the competition between field decay and inertial relaxation. Numerical simulations confirm the usefulness of these design estimates and identify their limitations near a capture boundary, where nearby pulses can lead to opposite final states. Spatially resolved inertial micromagnetic simulations further support reversal followed by relaxation over the simulated interval and quantify the transient departures from spatially coherent motion. The resulting approach combines explicit pulse design with a full-system energy certificate, while distinguishing rapid initial rotation from safe confinement and subsequent relaxation.

[510] arXiv:2611.14277 (replaced) [pdf, html, other]
Title: Thales's theorem in higher dimensions
Jan Pavlík
Comments: 23 pages, 6 figures V2: references updated, figures improved for greyscale printing
Subjects: Metric Geometry (math.MG); Combinatorics (math.CO)

In the Euclidean plane, Thales's theorem is equivalent to the statement that a quadrilateral with two opposite right angles has a circumscribed circle. We generalize the latter to higher dimensions: a convex polytope with two distinguished vertices, the \emph{poles}, such that the faces spanned by the two poles are perpendicular, is inscribed in the sphere whose diameter joins its poles. These \emph{orthogonally bipolar} polytopes are exactly the bipolar polytopes of a companion paper that arise as cutouts by orthogonal projections. As an application we show that for a polytope $P$ and a point $B$, the balls with diameters $[V,B]$, $V$ a vertex of $P$, cover $P$, and that the power diagram of their boundary spheres refines this covering to a tiling. Further, we investigate the properties of orthogonally bipolar polytopes, their characterization, and their application to tilings: in dimension three, the cutouts of $P$ by the orthogonal projections of $B$ onto its faces tile $P$ by orthogonally bipolar polytopes exactly when every such projection lies in the relative interior of its face. Finally, we propose an interpretation of the topic in political science.

[511] arXiv:2611.14576 (replaced) [pdf, html, other]
Title: The bias interval of the elephant random walk
Arjun Pemmasani
Comments: 28 pages, 2 figures. Code, certificates and Lean files: this https URL
Subjects: Probability (math.PR); Statistical Mechanics (cond-mat.stat-mech)

Guérin, Laulin, Raschel, and Simon conjectured that the initial biases giving the superdiffusive elephant random walk a bimodal limit law form an interval centered at one half, and they described the problem as challenging. We prove this. For every superdiffusive memory, strongly biased starts are unimodal, and the limit density has two local maxima exactly when the bias lies in a proper open interval. Outside it, including its endpoints, the density has a unique local maximum. The interval is nonempty exactly above a single memory threshold, numerically about $0.6688$, whose uniqueness follows from a positive-weight integral for the central curvature of the fair-start density. We control sign changes in the finite walk's first and second differences, including those created at the boundary, and pass them to the limit. The bias boundary is continuous and tends to zero at least quadratically fast as memory tends to one.

[512] arXiv:2611.14605 (replaced) [pdf, html, other]
Title: $\mathbb Z$ is diophantine over $\mathbb Q$ with 26 unknowns
Zhi-Wei Sun
Comments: 39 pages. Reduce 28 variables to 26 variables, and add Theorem 1.2
Subjects: Number Theory (math.NT); Logic (math.LO)

Recently, OpenAI proved that Hilbert's Tenth Problem over the field $\mathbb Q$ of rational numbers has a negative solution. Motivated by this work, G. Conant et al. showed that $\mathbb Z$ is diophantine over $\mathbb Q$, i.e., there is an integer-coefficient polynomial $F(x,y_1,\ldots,y_n)$ such that for any $x\in\mathbb Q$ we have $$ x\in\mathbb Z\quad\iff \exists\,y_1,\ldots,y_{n}\in\mathbb Q\ [F(x,y_1,\ldots,y_{n})=0].$$ They constructed such a polynomial $F$ with $°F=4$ and $n=221$.In this paper, we prove the existence of such a polynomial $F$ with $n=26$. We also show that $16$ existential unknowns suffice under the $abc$-conjecture.

[513] arXiv:2611.14873 (replaced) [pdf, html, other]
Title: Rational isogenies of rank-two Drinfeld modules
Shun Ishii, Ryotaro Sakamoto
Comments: 27 pages
Subjects: Number Theory (math.NT); Algebraic Geometry (math.AG)

We determine the $\mathbb{F}_{q}(T)$-rational points on the Drinfeld modular curves $X_{0}(\mathfrak{n})$ of arbitrary level, obtaining a complete classification of rational cyclic isogenies of rank-two Drinfeld $\mathbb{F}_{q}[T]$-modules over $\mathbb{F}_{q}(T)$. As consequences, we prove Schweizer's conjecture on rational torsion, establish optimal uniform bounds on the number of isomorphism classes in an $\mathbb{F}_{q}(T)$-isogeny class of rank-two Drinfeld $\mathbb{F}_{q}[T]$-modules and determine the geometric automorphism groups of $X_{0}(\mathfrak{p})$ for primes $\mathfrak{p}$ of degree at least three.

[514] arXiv:2611.15122 (replaced) [pdf, html, other]
Title: Ehrhart Series and Transfer Matrices for Period-Two Polytopes with Consecutive Inequalities
Yangbiao Zhou
Subjects: Combinatorics (math.CO)

We study a family of period-two polytopes that can be naturally realized as lattice polytopes. In contrast to polytopes defined by a uniform system of inequalities, this family is characterized by consecutive coordinate inequalities whose bounds alternate between $s+1$ and $s$. The lattice points of these polytopes admit an explicit transfer-matrix formulation, which provides an effective framework for their enumeration and analysis. Furthermore, by considering fixed dilations, we investigate the associated dimensional generating functions and derive rational forms for the generating functions of the lattice points in the $m$-th dilates of the polytopes.

[515] arXiv:2611.15620 (replaced) [pdf, html, other]
Title: Splitting Number at Singular Cardinals
Andrés F. Uribe-Zapata
Comments: 23 pages, 1 table. Minor typo corrections
Subjects: Logic (math.LO)

We study the splitting number at singular cardinals with emphasis on what we call the reduction to the cofinality problem: whether $\mathfrak{s}_{\kappa} = \mathfrak{s}_{\mathrm{cf}(\kappa)}$ holds for a singular cardinal $\kappa$. Our main tool is the transfinite logarithm function $\mathrm{log}_{2}(\mu) := \min \{ \lambda \in \mathrm{card} \colon \mu \leq 2^{\lambda} \}$ defined for every infinite cardinal $\mu$. We prove that the reduction holds, and in fact $\mathfrak{s}_{\kappa} = \mathrm{log}_{2}(\mathrm{cf}(\kappa))$, whenever $\mathrm{cf}(\kappa)$ is uncountable and not weakly compact. When $\mathrm{cf}(\kappa) = \aleph_{0}$, we show that $\mathfrak{s}_{\kappa} = \mathfrak{s}$ provided that $\mathfrak{s} \leq \log_{2}(\kappa)$, while the failure of the reduction is consistent with $\mathrm{ZFC}$. When $\mathrm{cf}(\kappa)$ is weakly compact, we use a model constructed by Ben-Neria and Gitik to prove that, under suitable large cardinals hypothesis, $\mathfrak{s}_{\kappa} < \mathfrak{s}_{\mathrm{cf}(\kappa)}$ is consistent. Furthermore, we show that the consistency strength of $\mathrm{ZFC} \, +$"$\exists \kappa \in \mathrm{card} [\mathrm{cf}(\kappa) > \aleph_{0} \wedge \mathfrak{s}_{\kappa} < \mathfrak{s}_{\mathrm{cf}(\kappa)}]$'' is at least that of the negation of the singular cardinal hypothesis. Finally, we study the cofinality of $\mathfrak{s}_{\kappa}$, extending several results about the cofinality of $\mathfrak{s}$ to the uncountable setting. In particular, we show in $\mathrm{ZFC}$ that there are regular cardinals $\kappa$ such that $\mathfrak{s}_{\kappa}$ is singular, partially answering an open question posed by Fischer and Soukup.

[516] arXiv:2611.15672 (replaced) [pdf, html, other]
Title: Nagata dimension, separation modulus and stochastic embeddings into trees
Ramón J. Aliaga, Rubén Medina
Comments: 18 pages, 1 figure
Subjects: Metric Geometry (math.MG); Functional Analysis (math.FA)

The separation modulus of a metric space, introduced by Bartal in 1996, is related to different notions of dimensionality. Most generally, Naor and Silberman gave in 2011 an upper bound on the separation modulus in terms of Nagata dimension. We prove that this bound cannot be reversed; that is, there are metric spaces with arbitrarily high Nagata dimension and stochastically embeddable into trees with uniform distortion, which therefore have uniformly bounded separation modulus. Similarly, we construct spaces with arbitrarily high Nagata dimension whose spaces of probability measures endowed with the Earth Mover's Distance (equivalently, their Lipschitz-free spaces) are embeddable into $L_1$ with uniformly bounded distortion. By gluing these spaces together, we obtain infinite Nagata dimensional metric spaces whose separation modulus is finite and whose Lipschitz-free space is isomorphic to $\ell_1$, respectively. Finally, we provide relations between separation modulus and stochastic embeddability into trees, also known as random approximability by tree metrics, in particular for the case of snowflake metrics.

[517] arXiv:2611.15799 (replaced) [pdf, html, other]
Title: GV-subschemes and hyperelliptic Jacobians
Songsong Huang, Zhi Jiang
Subjects: Algebraic Geometry (math.AG)

We provide a solution to the hyperelliptic Schottky problem: a principally polarized complex abelian variety whose theta divisor has singular locus of codimension three is a hyperelliptic Jacobian. As a key step towards this criterion for hyperelliptic Jacobians, we prove a conjecture of Pareschi and Popa which predicts that if the ideal sheaf $I_X$ of a subscheme $X$ of an indecomposable PPAV $(A, \Theta)$ satisfies that $I_X(2\Theta)$ is IT$_0$, then $X$ is a GV-subscheme.
As a corollary of the main result, the base scheme of an ample line bundle on a complex abelian variety is generically reduced along every irreducible component of codimension $2$, confirming a conjecture of Debarre. This corollary completes the algebro-geometry proof by Arbarello-Codogni-Pareschi in \cite{ACP21, ACP25} of Novikov's conjecture, which characterizes Jacobians via the KP equation.

[518] arXiv:2611.16256 (replaced) [pdf, html, other]
Title: $(r,s)$-Designs in the Nonbinary Johnson Scheme: Constructions and Linear Codes
Ryutaro Misawa, Yuuho Tanaka
Subjects: Combinatorics (math.CO)

Using factorizations of complete graphs, we determine the existence conditions for $(2,1)$-designs in the nonbinary Johnson scheme where each $3$-element subset appears exactly once as a support. Furthermore, by utilizing large sets of Steiner triple systems, we construct designs with index $1$ that cannot be obtained from the known construction combining block designs and orthogonal arrays. For linear codes, we express multiplicative character sums over specified nonzero coordinates as sums over the codewords of the dual code. Using this identity along with the rank of a matrix formed by Krawtchouk polynomials, we provide a sufficient condition for the set of all codewords of a given weight to form an $(r,s)$-design. In this matrix, we can utilize not only the rows corresponding to weights absent from the code, but also the rows corresponding to weights for which the set of codewords already forms a design. Moreover, let $q>2$ be a prime power, and let $0 \neq C \subsetneq \mathbb{F}_q^n$ be a linear code with exactly two nonzero weights. For $t \geq 2$, the set of all codewords of weight $w \geq t$ forms a non-empty $(t,t)$-design if and only if the dual minimum distance is at least $t+2$. Consequently, this provides a negative answer to the Wu--Zhou problem concerning two-weight codes with a dual minimum distance of $3$.

[519] arXiv:2611.17132 (replaced) [pdf, html, other]
Title: Rings with unequal $\operatorname{silp-spli}$
Xuyang Chen, Honghui Ding
Comments: 6 pages, comments are welcome
Subjects: Rings and Algebras (math.RA); Representation Theory (math.RT)

For a unital associative ring $R$, let $\operatorname{silp}(R)$ be the supremum of the injective dimensions of all projective right $R$-modules, and let $\operatorname{spli}(R)$ be the supremum of the projective dimensions of all injective right $R$-modules. We construct an explicit non-Noetherian unital algebra \[R=k1\oplus \frac{k(0\longrightarrow1\longrightarrow2\longrightarrow\cdots)} {\langle\text{all paths of length }2\rangle}\] over any field and prove that $\operatorname{silp}(R)=1$ and $\operatorname{spli}(R)=\infty. $ The algebra is the unitization of the non-unital path algebra of the one-sided infinite ray modulo paths of length two. The example answers the question whether $\operatorname{silp=spli}$ raised by Gedrich and Gruenberg.

[520] arXiv:2401.13712 (replaced) [pdf, html, other]
Title: Engineering Yeast Cells to Facilitate Information Exchange
Nikolaos Ntetsikas, Styliana Kyriakoudi, Antonis Kirmizis, Bige Deniz Unluturk, Andreas Pitsillides, Ian F. Akyildiz, Marios Lestas
Comments: 18 pages, 9 figures (2 of which are not colored) all .png, recently accepted for publication at TMBMC
Subjects: Emerging Technologies (cs.ET); Information Theory (cs.IT); Molecular Networks (q-bio.MN)

Although continuous advances in theoretical modelling of Molecular Communications (MC) are observed, there is still an insuperable gap between theory and experimental testbeds, especially at the microscale. In this paper, the development of the first testbed incorporating engineered yeast cells is reported. Different from the existing literature, eukaryotic yeast cells are considered for both the sender and the receiver, with {\alpha}-factor molecules facilitating the information transfer. The use of such cells is motivated mainly by the well understood biological mechanism of yeast mating, together with their genetic amenability. In addition, recent advances in yeast biosensing establish yeast as a suitable detector and a neat interface to in-body sensor networks. The system under consideration is presented first, and the mathematical models of the underlying biological processes leading to an end-to-end (E2E) system are given. The experimental setup is then described and used to obtain experimental results which validate the developed mathematical models. Beyond that, the ability of the system to effectively generate output pulses in response to repeated stimuli is demonstrated, reporting one event per two hours. However, fast RNA fluctuations indicate cell responses in less than three minutes, demonstrating the potential for much higher rates in the future.

[521] arXiv:2406.01999 (replaced) [pdf, html, other]
Title: Random Abstract Cell Complexes
Josef Hoppe, Michael T. Schaub
Comments: 9 pages, 7 figures (plus appendix). For evaluation code, see this https URL
Subjects: Data Structures and Algorithms (cs.DS); Discrete Mathematics (cs.DM); Social and Information Networks (cs.SI); Algebraic Topology (math.AT)

In machine learning and signal processing, methods based on (abstract) cell complexes (CCs) are being applied successfully in different applications. However, there is currently a lack of random models, which are necessary for a thorough evaluation of these methods, both by generating synthetic data and as null models to compare results to. We fill this gap by defining a random model for abstract cell complexes based on independent inclusion probabilities, similar to the Erdős-Rényi model for graphs. We also discuss how modifications to bias the model to incorporate more structure can be implemented. The model can also be used to lift a graph (or other cell complex) to a cell complex of arbitrary dimension. The main challenge in this is that the number of cycles (possible 2-cells) on graphs is exponential, and the same is true in higher dimensions. We overcome this complexity with an approximate sampling algorithm limited to 2-cells (polygons) that is based on a recent advance in sampling cycles on a graph. Using this algorithm, we analyze the properties of random 2-dimensional CCs and showcase its usage as a performance baseline for both topological signal processing and topological deep learning. The algorithm is available in the package py-raccoon on the Python Package Index.

[522] arXiv:2502.03312 (replaced) [pdf, html, other]
Title: An 'Experimental Mathematics' Approach to Stolarsky Interspersions via Automata Theory
Jeffrey Shallit
Comments: This revision fixes up numerous typographical errors and adds some new results
Subjects: Formal Languages and Automata Theory (cs.FL); Discrete Mathematics (cs.DM); Number Theory (math.NT)

We look at the Stolarsky interspersions (such as the Wythoff array) one more time, this time using tools from automata theory. These tools allow easy verification of many of the published results on these arrays, as well as proofs of new results.

[523] arXiv:2504.16150 (replaced) [pdf, html, other]
Title: Evaluating the Generalizability and Explainability of Firn Image Classification with Topological Features
Jesse Dimino, Matt Jester, Kaitlin Keegan, Thomas Weighill, Sarah Day
Comments: Extended version with additional experiments on generalizability and explainability
Subjects: Computer Vision and Pattern Recognition (cs.CV); Algebraic Topology (math.AT)

In this paper we evaluate the performance of topological features for generalizable and explainable classification of firn image data, with the broader goal of understanding the advantages, pitfalls, and trade-offs in topological featurization. Firn refers to layers of granular snow within glaciers that haven't yet been compressed into ice. This compaction process imposes distinct topological and geometric structure on firn that varies with depth within the firn column. However, the limited and highly correlated training data available results in naive classifiers (such as convolutional neural networks) overfitting to orientation-dependent features. This motivates us to evaluate topological data analysis (TDA) as a way to design features which capture the shape of the firn data while retaining a large degree of invariance. We evaluate two classes of topological features, sublevel set features and distance transform features, together with persistence curves, to predict sample depth from firn images. A range of challenging training-test scenarios reveals that no one choice of method dominates in all categories. In particular, we see a tradeoff between accuracy on the one hand, and generalizability and explainability (via feature importance) on the other.

[524] arXiv:2506.11628 (replaced) [pdf, html, other]
Title: Two Tiling is Undecidable
Jack Stade
Comments: 38 pages, 48 figures
Subjects: Computational Geometry (cs.CG); Combinatorics (math.CO); Metric Geometry (math.MG)

We show that the following problem is undecidable: given two polygonal prototiles, determine whether the plane can be tiled with rotated and translated copies of them. This improves a result of Demaine and Langerman [SoCG 2025], who showed undecidability for three tiles.
Along the way, we show that tiling with one prototile is undecidable if there can be edge-to-edge matching rules. This is the first result to show undecidability for monotiling with only local matching constraints.

[525] arXiv:2507.18520 (replaced) [pdf, html, other]
Title: Recovering the Euclidean Geometry of High-Dimensional Data Under Heterogeneous Noise
Keyi Li, Yuval Kluger, Boris Landa
Subjects: Machine Learning (stat.ML); Machine Learning (cs.LG); Statistics Theory (math.ST)

Pairwise Euclidean distances provide a simple geometric representation of high-dimensional data and underlie many data analysis methods, including clustering, visualization, and manifold learning. However, in real-world applications, these distances can be severely corrupted by heterogeneous noise, where different data points are subject to different, and potentially large, noise levels. Such noise distorts the distances inhomogeneously, leading to a misrepresentation of the underlying data geometry. In this work, we ask whether the underlying clean Euclidean geometry can nevertheless be recovered from the corrupted pairwise distances. We answer this question affirmatively, showing that, perhaps surprisingly, such recovery is possible across a broad class of high-dimensional settings with underlying low-dimensional geometry, even when the noise magnitudes vary substantially across observations. We develop a principled approach for recovering the clean pairwise distances, without prior knowledge of either the clean data structure or the noise distribution, and establish probabilistic recovery guarantees. In particular, the recovery error converges to zero at polynomial rates as the feature dimension and dataset size increase simultaneously. Experiments on synthetic datasets demonstrate accurate recovery of the Euclidean geometry in challenging regimes and improved robustness of downstream methods that rely on pairwise distances. When applied to real single-cell RNA sequencing data, our method reliably recovers local neighborhood structure, enabling accurate nearest-neighbor identification used in many downstream analyses.

[526] arXiv:2508.18104 (replaced) [pdf, html, other]
Title: On the Parameterized Complexity of Grundy Domination and Zero Forcing Problems
Robert Scheffler
Comments: version published in the Journal of Computer and System Sciences
Journal-ref: Journal of Computer and System Sciences 164, Article 103875 (2027)
Subjects: Computational Complexity (cs.CC); Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS); Combinatorics (math.CO)

We consider two different problem families that deal with domination in graphs. On the one hand, we focus on dominating sequences. In such a sequence, every vertex dominates some vertex of the graph that was not dominated by any earlier vertex in the sequence. The problem of finding the longest dominating sequence is known as $\mathsf{Grundy~Domination}$. Depending on whether the closed or the open neighborhoods are used for domination, there are three other versions of this problem: $\mathsf{Grundy~Total~Domination}$, $\mathsf{L\text{-}Grundy~Domination}$, and $\mathsf{Z\text{-}Grundy~Domination}$. We show that all four problem variants are $\mathsf{W[1]}$-complete when parameterized by the solution size.
On the other hand, we consider the family of zero forcing problems which form the parametric duals of the Grundy domination problems. In these problems, one looks for the smallest set of vertices initially colored blue such that certain color change rules are able to color all other vertices blue. It has been shown that the dual of $\mathsf{Z\text{-}Grundy~Domination}$, known as $\mathsf{Zero~Forcing~Set}$, is in $\mathsf{FPT}$ when parameterized by the treewidth or the solution size. We extend the treewidth result to the other three variants of zero forcing and their respective Grundy domination problems. Our algorithm also implies an $\mathsf{FPT}$ algorithm for $\mathsf{Grundy~Domination}$ when parameterized by the number of vertices that are not in the dominating sequence. In contrast, we show that $\mathsf{L\text{-}Grundy~Domination}$ is $\mathsf{W[1]}$-hard for that parameter.

[527] arXiv:2509.22482 (replaced) [pdf, html, other]
Title: Bayesian Transfer Operators in Reproducing Kernel Hilbert Spaces
Septimus Boshoff, Stefan Klus, Sebastian Peitz
Subjects: Machine Learning (cs.LG); Dynamical Systems (math.DS); Chaotic Dynamics (nlin.CD); Data Analysis, Statistics and Probability (physics.data-an)

Transfer operators provide a linear description of nonlinear dynamical systems by propagating observables or probability distributions. In reproducing kernel Hilbert spaces, these operators are represented through conditional mean embeddings, whose regularized estimator coincides with the posterior mean of Gaussian process regression. Building on this correspondence, we formulate Gaussian Process Dynamic Mode Decomposition, a Bayesian transfer-operator method that combines sparse variational Gaussian processes with kernel-based Koopman and Perron--Frobenius operator approximation. The resulting framework provides a principled route to uncertainty quantification, scalable sparse approximations, and data-adaptive dictionary learning for prediction and spectral analysis. Additionally, the model-selection formulation naturally gives rise to a forward--backward operator structure, which establishes a connection between Bayesian transfer-operator learning and time-lagged canonical correlation analysis.

[528] arXiv:2510.05241 (replaced) [pdf, html, other]
Title: Simultaneous Learning and Optimization via Misspecified Saddle Point Problems
Mohammad Mahdi Ahmadi, Erfan Yazdandoost Hamedani
Comments: Accepted for publication in the Journal of Computational Optimization and Algorithms
Subjects: Machine Learning (cs.LG); Optimization and Control (math.OC)

We study a class of misspecified saddle point (SP) problems, where the optimization objective depends on an unknown parameter that must be learned concurrently from data. Unlike existing studies that assume parameters are fully known or pre-estimated, our framework integrates optimization and learning into a unified formulation, enabling a more flexible problem class. To address this setting, we propose two algorithms based on the accelerated primal-dual (APD) by Hamedani & Aybat 2021. In particular, we first analyze the naive extension of the APD method by directly substituting the evolving parameter estimates into the primal-dual updates; then, we design a new learning-aware variant of the APD method that explicitly accounts for parameter dynamics by adjusting the momentum updates. Both methods achieve a provable convergence rate of $\mathcal{O}(\log K / K)$, while the learning-aware approach attains a tighter $\mathcal{O}(1)$ constant and further benefits from an adaptive step-size selection enabled by a backtracking strategy. Furthermore, we extend the framework to problems where the learning problem admits multiple optimal solutions, showing that our modified algorithm for a structured setting achieves an $\mathcal{O}(1/\sqrt{K})$ rate. To demonstrate practical impact, we evaluate our methods on a misspecified portfolio optimization problem and show superior empirical performance compared to state-of-the-art algorithms.

[529] arXiv:2510.07559 (replaced) [pdf, html, other]
Title: General coupling-based f-divergence diagnostics for Markov chain Monte Carlo
Adrien Corenflos, Hai-Dang Dau
Comments: Significantly revised manuscript including new nonasymptotic bounds
Subjects: Computation (stat.CO); Probability (math.PR); Statistics Theory (math.ST); Methodology (stat.ME)

A long-standing gap exists between the theoretical analysis of Markov chain Monte Carlo convergence, which is often based on statistical divergences, and the diagnostics used in practice. We introduce the first general convergence diagnostics for Markov chain Monte Carlo based on a broad class of f-divergence, allowing users to directly monitor, among others, the Kullback-Leibler and the chi-squared divergences as well as the total variation distance. Our approach rests on a coupling-based 'weight harmonization' scheme that produces direct, computable, and consistent importance weights for interacting Markov chains with respect to their target distribution. Beyond their use as convergence diagnostics, these weights give unbiased estimates of the Radon-Nikodym derivative between the un-normalized target and the distribution of the current iterate, a richer object than the convergence bounds alone, with natural applications to importance-weighted inference. We show how such weightings can provide asymptotic upper bounds to any f-divergence, prove that these bounds converge to zero as the chains approach stationarity, and demonstrate that, while more conservative than existing coupling-based total variation estimators, our method remains a practical and broadly applicable diagnostic tool.

[530] arXiv:2511.01442 (replaced) [pdf, html, other]
Title: A fast and rigorous numerical tool to measure length-scale artifacts in molecular simulations
Benedikt M. Reible, Nils Liebreich, Carsten Hartmann, Luigi Delle Site
Comments: 29 pages, 6 figures. To be published in Commun. Appl. Math. Comput. Sci., see this https URL
Subjects: Computational Physics (physics.comp-ph); Statistical Mechanics (cond-mat.stat-mech); Mathematical Physics (math-ph)

The two-sided Bogoliubov inequality for classical and quantum many-body systems is a theorem that provides rigorous bounds on the free-energy cost of partitioning a given system into two or more independent subsystems. This theorem motivates the definition of a quality factor which directly quantifies the degree of statistical-mechanical consistency achieved by a given simulation box size. A major technical merit of the theorem is that, for systems with two-body interactions and a known radial distribution function, the quality factor can be computed by evaluating just three six-dimensional integrals. We present a numerical algorithm for computing the quality factor and demonstrate its consistency with respect to results in the literature obtained from simulations performed at different box sizes.

[531] arXiv:2511.13816 (replaced) [pdf, html, other]
Title: Sparse Modular Forms, Lattices, and Codes
Christoph A. Keller, Ashley Winter Roberts
Comments: 21 pages. v2: After publication, we found a reference that allowed us to prove sparseness of Reed-Muller code lattices. We added section 4.4 explaining this
Subjects: High Energy Physics - Theory (hep-th); Number Theory (math.NT)

Motivated by sparseness conditions for holographic CFTs, we investigate sparseness of modular forms, lattices, and codes. For this we investigate the free energy of such objects as their weight, dimension or size goes to infinity. We construct families of modular forms that are sparse, such as the Eisenstein series $E_{2k}(\tau)$. We then investigate lattices that come from codes and introduce a sparseness condition for such lattices. We investigate the limit of lattices constructed from self-dual Reed-Muller codes and prove that they are sparse in this sense.

[532] arXiv:2512.20777 (replaced) [pdf, html, other]
Title: Improving Matrix Exponential for Generative AI Flows: A Taylor-Based Approach Beyond Paterson--Stockmeyer
Jorge Sastre, Daniel Faronbi, José Miguel Alonso, Peter Traver, Javier Ibáñez, Nuria Lloret
Comments: 52 pages, 4 figures. Revised version: added new theoretical results, sharper error analysis, additional numerical experiments, benchmarking on modern GPU hardware, comparisons with standard library implementations, and validation of generative model quality
Subjects: Machine Learning (cs.LG); Numerical Analysis (math.NA)

The matrix exponential is a fundamental operator in scientific computing and system simulation, with applications ranging from control theory and quantum mechanics to modern generative machine learning. While Padé approximants combined with scaling and squaring have long served as the standard, recent Taylor-based methods, which utilize polynomial evaluation schemes that surpass the classical Paterson--Stockmeyer technique, offer superior accuracy and reduced computational complexity. This paper presents an optimized Taylor-based algorithm for the matrix exponential, specifically designed for the high-throughput requirements of generative AI flows. We provide a rigorous error analysis and develop a dynamic selection strategy for the Taylor order and scaling factor to minimize computational effort under a prescribed error tolerance. Extensive numerical experiments demonstrate that our approach provides significant acceleration and maintains high numerical stability compared to existing state-of-the-art implementations. These results establish the proposed method as a highly efficient tool for large-scale generative modeling.

[533] arXiv:2603.20891 (replaced) [pdf, html, other]
Title: Auto-differentiable data assimilation: Co-learning of states, dynamics, and filtering algorithms
Melissa Adrian, Daniel Sanz-Alonso, Rebecca Willett
Subjects: Machine Learning (stat.ML); Machine Learning (cs.LG); Signal Processing (eess.SP); Dynamical Systems (math.DS)

Data assimilation algorithms estimate the state of a dynamical system from partial observations, where the successful performance of these algorithms hinges on costly parameter tuning and on employing an accurate model for the dynamics. This paper introduces a framework for jointly learning the state, dynamics, and parameters of filtering algorithms in data assimilation through a process we refer to as auto-differentiable filtering. The framework leverages a theoretically motivated loss function that enables learning from partial, noisy observations via gradient-based optimization using auto-differentiation. We further demonstrate how several well-known data assimilation methods can be learned or tuned within this framework. To underscore the versatility of auto-differentiable filtering, we perform experiments on dynamical systems spanning multiple scientific domains, such as the Clohessy-Wiltshire equations from aerospace engineering, the Lorenz-96 system from atmospheric science, the generalized Lotka-Volterra equations from systems biology, and the two-layer quasi-geostrophic model from geophysical fluid dynamics. Finally, we provide guidelines for practitioners to customize our framework according to their observation model, accuracy requirements, and computational budget.

[534] arXiv:2604.21909 (replaced) [pdf, html, other]
Title: Directional Confusions Reveal Divergent Inductive Biases Through Rate-Distortion Geometry in Human and Machine Vision
Leyla Roksan Caglar, Pedro A.M. Mediano, Baihan Lin
Subjects: Computer Vision and Pattern Recognition (cs.CV); Information Theory (cs.IT); Neurons and Cognition (q-bio.NC)

Humans and modern vision models can reach similar classification accuracy while making systematically different kinds of mistakes -- differing not in how often they err, but in who gets mistaken for whom and in which direction. We show that these directional confusions reveal distinct inductive biases that are invisible to accuracy alone. Using matched human and deep vision model responses on a natural-image categorization task under 12 perturbation types, we quantify asymmetry in confusion matrices and link it to the shape of the information-error trade-off. We characterize this trade-off geometry using three signatures extracted from the rate-distortion (RD) frontier: slope beta, curvature kappa and efficiency (AUC). We find that humans exhibit broad but weak asymmetries, whereas deep vision models show sparser, stronger directional collapses. Robustness training reduces global asymmetry but fails to recover the human-like breadth-strength profile of graded similarity. Mechanistic simulations further show that different asymmetry organizations shift the RD frontier in opposite directions, even when matched for performance. Together, these results position directional confusions and RD geometry as compact, interpretable signatures of inductive bias under distribution shift.

[535] arXiv:2605.13348 (replaced) [pdf, html, other]
Title: Adequate Losses via Quantitative Linear Logic
Matteo Capucci, Robert Atkey, Charles Grellois, Ekaterina Komendantskaya, Matthew Daggitt
Comments: Numerous tweaks and small corrections. To appear at POPL 2027
Subjects: Logic in Computer Science (cs.LO); Logic (math.LO)

As neural components are increasingly embedded in existing symbolic software -- including safety-critical systems -- the question arises of how to specify and enforce the safety of the newly introduced neural parts. Unlike traditional logical specifications, these must be amenable not only to the standard Boolean interpretation, but also to training and optimisation. The latter calls for a quantitative interpretation of the logical syntax, subject to further requirements such as smoothness and differentiability. Moreover, the qualitative and quantitative sides of the logic must share a unifying proof-theoretic and categorical semantics. Finally, the new logic should link cleanly to the substructural and program logics that underpin the verification of existing symbolic programs. In this paper, we present a logic that ticks all of these boxes. We introduce a family of calculi, $p$QLL, indexed by a hardness degree $p$, prove a cut-elimination theorem for them, and establish completeness with respect to enriched residuated `soft' lattices. At $p = \infty$, $p$QLL reduces to multiplicative additive linear logic (MALL), and provability in $p$QLL converges to provability in MALL as $p \to \infty$. We express optimisation objectives in the syntax of this logic and prove the quantitative adequacy of neuro-symbolic loss functions -- a result that has eluded the neuro-symbolic machine learning community for nearly a decade.

[536] arXiv:2605.25610 (replaced) [pdf, html, other]
Title: Match classification in the last round of four-team round-robin tournaments
László Csató, András Gyimesi
Comments: 24 pages, 4 figures, 6 tables
Subjects: Physics and Society (physics.soc-ph); General Economics (econ.GN); Optimization and Control (math.OC); Applications (stat.AP)

Classification of matches played in the last rounds of sports competitions is a well-established tool for evaluating tournament designs. Our paper offers the first comparison of deterministic and probabilistic match classification models by analysing the most prominent example of four-team round-robin competitions, the group stage of the FIFA World Cup. We show that both models are highly relevant in practice: all (four) deterministic and (six) probabilistic match types occurred in the 2014 and 2018 FIFA World Cups, respectively. The probabilistic model, which accounts for the relative benefits of attacking and defending, provides a deeper insight; for instance, the competitive matches from the deterministic approach can be of any of the six probabilistic types. Therefore, the probabilistic model is used to decompose the impact of three reforms introduced in the 2026 FIFA World Cup: the expansion to 48 teams, the modified qualification rules, and head-to-head tie-breakers.

[537] arXiv:2606.10944 (replaced) [pdf, html, other]
Title: Express Language Modeling
Albert Gong, Annabelle Michael Carrell, Raaz Dwivedi, Lester Mackey
Subjects: Machine Learning (cs.LG); Data Structures and Algorithms (cs.DS); Statistics Theory (math.ST); Methodology (stat.ME); Machine Learning (stat.ML)

We introduce a new tool, Express, for converting a non-causal attention approximation into a causal approximation with matching approximation guarantees. When combined with the state-of-the-art Thinformer approximation, Express improves upon the best known causal attention guarantees, delivering $\log^{3/2}(n)/s$ approximation error with only $O(s)$ memory and $O(s^2 \log^2(n))$ compression overhead for a sequence of length $n$. We pair these developments with an efficient I/O-aware Triton implementation, demonstrate substantial speedups over FlashAttention 2, and use Express to overcome four resource bottlenecks in the language modeling pipeline: long-context prefill, KV cache compression, long-form memory-constrained decoding, and long-form compute-constrained decoding.

[538] arXiv:2606.15383 (replaced) [pdf, other]
Title: Quantum optimal control of steady orbits
Shebha Anandhi Jegadeesan, Yujie Zhao, Robert Hunter, Hassane El Mkami, Maximilian Keitel, Callum Musselwhite, Graham Smith, Guinevere Mathies, Ilya Kuprov
Subjects: Quantum Physics (quant-ph); Mathematical Physics (math-ph); Chemical Physics (physics.chem-ph)

Periodically driven dissipative systems can settle into steady orbits - fixed infinite loops on their dynamical manifolds. In quantum mechanics, steady orbits occur in cooling engines, lasers and masers, precision metrology devices, and magnetic resonance. Steady orbits and stroboscopic steady states are a promising target for quantum optimal control, but the numerical complexity is prohibitive: infinite loops defeat state-of-the-art algorithms that use explicit numerical propagation in the time domain. We report a solution to this problem and introduce a numerically efficient quantum optimal control algorithm for steady orbits. We use this algorithm to design microwave pulse sequences that dynamically polarise nuclear spins and enhance their magnetic resonance signals, while taking into account instrumental distortions. Improved performance relative to leading current methods is demonstrated experimentally.

[539] arXiv:2608.05434 (replaced) [pdf, html, other]
Title: Risk-Aware Quantile Learning for Personalized Dynamic Treatment Regimes
Chunyin Lei, Annie Qu
Comments: An earlier version of this work was accepted at STAI-X 2026
Subjects: Methodology (stat.ME); Statistics Theory (math.ST); Machine Learning (stat.ML)

Sequential clinical decision-making often involves more than maximizing average efficacy. Clinicians may need to simultaneously optimize clinically relevant tails of the outcome distribution, control treatment-related risk, and choose among multiple treatment options. Existing quantile dynamic treatment regime (DTR) methods capture distributional features of treatment outcomes but remain largely restricted to efficacy-only objectives and binary treatments. To address these limitations, we propose Risk-Aware Quantile Dynamic Treatment Regimes (RQDTR), a unified framework that optimizes a prespecified quantile of the cumulative potential outcome while explicitly incorporating treatment-related risk. We also develop an angle-based formulation for jointly learning decision rules across multiple treatment categories. Our framework includes three interpretable subclasses: efficacy-only quantile learning, constraint-based learning with population-level risk control, and utility-based learning through a composite benefit-risk utility. Theoretically, we establish identification and oracle equivalence, surrogate and estimator consistency under increasing quadratic penalties, asymptotic risk feasibility, and finite-sample performance error bounds. Extensive simulation studies and applications to All of Us major depressive disorder and MIMIC-III sepsis data demonstrate that RQDTR improves tail-oriented efficacy and achieves more favorable benefit-risk trade-offs than existing quantile DTR methods.

[540] arXiv:2608.13644 (replaced) [pdf, html, other]
Title: Heuristic Lookahead Distillation Protocol Search
Matthew Barber, Stefano Pirandola
Comments: REVTeX. 13 pages. 7 figures
Subjects: Quantum Physics (quant-ph); Other Condensed Matter (cond-mat.other); Mathematical Physics (math-ph); Optics (physics.optics)

Bipartite qubit entanglement distillation is the process of converting noisy ebits into pure ebits using only local operations and classical communication. This is a core operation for quantum repeaters, enabling such crucial tasks as long-distance quantum communication and distributed quantum computing. In this work, we introduce a method for searching for entanglement distillation protocols and, using this technique, distil qubit Werner states at a higher rate than could be achieved using previously discovered protocols. In particular, we demonstrate the advantage of our new distillation strategy by improving the best known lower bound for the two-way-assisted quantum capacity of the qubit depolarising channel across a wide range of channel parameters, making progress in one of the long-standing problems of quantum information theory.

[541] arXiv:2608.16296 (replaced) [pdf, html, other]
Title: Novel lump solutions of the modified Kadomtsev--Petviashvili-I equation
Tianwei Qiu, Zhen Wang
Comments: v2: added new results and updated figures
Subjects: Exactly Solvable and Integrable Systems (nlin.SI); Mathematical Physics (math-ph); Pattern Formation and Solitons (nlin.PS)

We apply the generalized long-wave limit method with spectral perturbations to construct second-order two- and three-lump solutions and third-order three-, four-, five-, and six-lump solutions of the modified Kadomtsev--Petviashvili-I equation. We determine the long-time positions and amplitudes of these degenerate lumps and show that their anomalous scattering produces asymptotic amplitude corrections that differ from those in the Kadomtsev--Petviashvili-I equation.

[542] arXiv:2608.20714 (replaced) [pdf, html, other]
Title: Multiparameter Quantum Affine Spaces and the Scalene Yang--Baxter Equation
Pramod Padmanabhan, Somnath Maity, Vladimir Korepin
Comments: 22 pages + Appendices + References ; v2 24 pages + Appendices + References, Published version
Subjects: Exactly Solvable and Integrable Systems (nlin.SI); Statistical Mechanics (cond-mat.stat-mech); High Energy Physics - Theory (hep-th); Mathematical Physics (math-ph)

We construct representation-independent families of solutions of the non-braided scalene Yang--Baxter equation from quadratic noncommutative algebras. Beginning with two anticommuting generators, we obtain a continuous deformation in terms of quantum-plane algebras and extend the construction to an arbitrary number of generators. In the latter case the scalene Yang--Baxter relation fixes the multiparameter exchange matrix to an exact multiplicative form, thereby selecting a distinguished subclass of multiparameter quantum affine spaces. We construct finite-dimensional realizations using singular matrices and finite Heisenberg--Weyl operators, as well as infinite-dimensional realizations in terms of bilateral weighted shifts and multiplicative-shift operators. The explicit realizations are generically weakly purely scalene: their individual constituent operators do not satisfy the ordinary constant non-braided Yang--Baxter equation. For selected finite-dimensional realizations, we additionally establish strong purity by obstructing a generic common meromorphic Yang--Baxter parametrization, even up to consistent invertible local similarities and nonzero scalar rescalings.
These results provide a representation-independent algebraic framework for constructing scalene triples and a starting point for investigating their possible applications to quantum integrability.

[543] arXiv:2609.06351 (replaced) [pdf, html, other]
Title: A Theory of Information Architecture for Networked Decisions: Freshness, Locality, and Coordination
Scott Moeller, Bhaskar Krishnamachari
Comments: 32 pages, 6 figures. Manuscript source and complete reproduction materials are available at this https URL
Subjects: Systems and Control (eess.SY); Networking and Internet Architecture (cs.NI); Optimization and Control (math.OC)

A broader view of a network can help agents coordinate, but collecting that view takes time. When is a fresh local observation more useful than an older view of the whole network, and when should an agent look only partway across it? We study agents that repeatedly minimize a shared quadratic cost in an environment that evolves independently of their actions. An information architecture specifies what each agent observes and how old those observations are. Each agent uses a synchronized neighborhood snapshot, so extending its scope also ages the nearby readings used in the decision. We assume that the optimal action with complete information is affine in the state, and that the conditional mean of the current state equals the old state scaled by a common exponential decay factor. Using the classical Marschak--Radner decomposition, we derive the delay threshold beyond which fresh local information outperforms a complete but older global view. This comparison allows non-Gaussian states and nonlinear decision rules. We then determine how far an agent should look by balancing the benefit of additional observations against their greater age. In a Gaussian spatial model on a line, we derive the optimal observation radius: looking beyond the local node pays only when information travels more than twice the spatial correlation length in one coherence time. The preferred information architecture also depends on the decision being made. On a fixed 64-node ring, increasing only the reach of the decision weights from 0.7 to 6 hops shifts the optimal observation radius from one to five hops.

[544] arXiv:2609.27792 (replaced) [pdf, html, other]
Title: Improved lower bound for the two-way-assisted quantum capacity of the bosonic thermal-loss channel
Matthew Barber, Stefano Pirandola
Comments: REVTeX. 9 pages. 5 figures
Subjects: Quantum Physics (quant-ph); Mathematical Physics (math-ph); Computational Physics (physics.comp-ph); Optics (physics.optics)

The bosonic thermal-loss channel is a fundamental model for quantum communication. This Gaussian channel models the transmission of bosonic systems subject to both loss and thermal noise. It describes many practical systems, including optical fibres, waveguides and free-space links, where background thermal noise is significant. Determining the channel's two-way-assisted quantum capacity, the maximum rate at which quantum information can be transmitted reliably through the channel with two-way classical assistance, remains an open problem. Here, we improve upon the best known lower bound for this capacity for a wide range of channel parameters. We achieve this by combining an improved qubit-bosonic distribution technique with a recently introduced technique for discovering entanglement distillation protocols.

[545] arXiv:2609.37512 (replaced) [pdf, html, other]
Title: Exact anomalous current fluctuations in the strong-anisotropy limit of the XXZ chain
Taiki Ishiyama, Taiga Kurose, Kazuya Fujimoto, Tomohiro Sasamoto
Comments: Revised the presentation and figures
Subjects: Statistical Mechanics (cond-mat.stat-mech); Quantum Gases (cond-mat.quant-gas); Mathematical Physics (math-ph); Quantum Physics (quant-ph)

We study spin-current fluctuations of the folded XXZ chain, which describes the strong-anisotropy limit of the XXZ chain. We obtain an exact expression for the moment-generating function of the time-integrated spin current at infinite temperature. A long-time asymptotic analysis establishes that the rescaled time-integrated current converges to a non-Gaussian distribution described by the M-Wright function. The derivation relies on a nonlocal map to the one-dimensional t-0 model and its exact spin-charge separation. By extending this approach, we also show that the dynamical correlation function of the spins summed over two adjacent sites exhibits a diffusive Gaussian profile at long times.

[546] arXiv:2609.38083 (replaced) [pdf, html, other]
Title: A commuting operator self-test for exact entanglement embezzlement
Connor Paddock, Simon Schmidt
Comments: changed introduction from v1
Subjects: Quantum Physics (quant-ph); Operator Algebras (math.OA)

We show that the optimal commuting operator correlation for a variant of Coladangelo's two-player generalized nonlocal game, based on the embezzlement of entanglement, is a commuting operator self-test. Our result gives the first correlation self-test for an exact entanglement embezzlement protocol in the commuting operator framework. Because the unique optimal correlation necessitates the exact embezzlement of entanglement, the correlation is unrealizable using quantum tensor-product models, even if the local spaces are allowed to be infinite dimensional. Our proof relies on Harris' unique abstract state characterization of exact embezzlement of entanglement involving Cuntz algebras.

[547] arXiv:2610.12392 (replaced) [pdf, html, other]
Title: Tiling 3D Space by (Translates of) a Single Polycube is Undecidable
Erik D. Demaine, Stefan Langerman
Comments: 10 pages, 2 figures, 2 tables, 15 snippets. Added rotation/reflection results and corresponding table
Subjects: Computational Geometry (cs.CG); Combinatorics (math.CO); Metric Geometry (math.MG)

We prove co-RE-completeness, and thus undecidability, of the following problem: given a single (connected) polycube, decide whether it tiles 3D Euclidean space by translations. The same result holds if we also allow rotations and/or reflections. We reduce from Wang tiling using the decorated two-prime Sudoku construction of Greenfeld and Tao and a cyclic encoding adapted from OpenAI's 3D aperiodic tile, and apply a reduction of Kim to make the prototile connected (via faces). Dimension three is optimal: translational monotiling is known to be decidable in $\mathbb{Z}^2$ and for a single (possibly disconnected) polyomino in $\mathbb{R}^2$.

[548] arXiv:2610.12654 (replaced) [pdf, html, other]
Title: Symbolic-Permutation-Based Direct Sparse Jacobian Assembly for Accelerated Power-Flow Analysis
Tianshi Cheng, Venkata Dinavahi
Comments: 11 pages, 3 figures
Subjects: Systems and Control (eess.SY); Performance (cs.PF); Numerical Analysis (math.NA)

The repeated assembly of the sparse Jacobian matrix constitutes a primary computational bottleneck in the Newton-Raphson power-flow analysis. Through an algebraic operator equivariance analysis of the Jacobian matrix, this paper formalizes the reduction process and proposes a direct sparse Jacobian assembly method based on symbolic permutation. By pre-applying the permutation to the admittance matrix during a fast one-time symbolic phase via its sparse prefix-sum property, the runtime bus-type projection overhead and indirect mapping caches are entirely eliminated. Consequently, complex Jacobian differentiation and global matrix assembly fuse into a single operation, yielding a single-pass, branchless algorithm that streams values directly into contiguous memory. The proposed algorithm is implemented in the open-source RustPower solver. Benchmarks on IEEE test systems and PEGASE 9241 demonstrate that the proposed assembly is 28.1-37.9 times faster than the MATPOWER-style baseline and 8.9-9.7 times faster than the in-house Schäfer-Braun-inspired assembly (V1); on PEGASE 9241, it outperforms optimized traditional C++ assembly routines by 3.72 times in cold construction and 2.59 times across iterations. End-to-end, the iteration-loop solve time with KLU is 1.16-1.97 times faster than the native C++ LightSim2Grid and up to 95.5 times faster than pandapower, while leaving numerical results and convergence behavior unchanged. The method extends directly to general problems where a sparse Jacobian inherits its structure from a static network operator, including transient stability analysis, EMT simulation, and OPF Hessian assembly.

[549] arXiv:2610.16473 (replaced) [pdf, other]
Title: Some complete $ω$-powers of a one-counter language in the difference hierarchy
Jacques Duparc (UNIL), Olivier Finkel (IMJ-PRG (UMR\_7586)), Dominique Lecomte (IMJ-PRG (UMR\_7586))
Subjects: Logic in Computer Science (cs.LO); Computation and Language (cs.CL); Formal Languages and Automata Theory (cs.FL); Computer Science and Game Theory (cs.GT); General Topology (math.GN); Logic (math.LO)

Fix a finite alphabet $\Sigma$ having at least two letters, and natural numbers $n,k\geq 1$. We denote by $D_n(\mathbf{\Pi}^0_k)$ the class of differences of $n$ subsets of the Cantor space $\Sigma^\omega$ in $\mathbf{\Pi}^0_k$, and by $D^-_n(\mathbf{\Pi}^0_k)$ the class of complements of sets in $D_n(\mathbf{\Pi}^0_k)$. We prove, for any natural numbers $n,k\geq 1$, the existence of a finite alphabet $\Sigma$ having at least two letters and a finitary language $U_{n,k}$ over $\Sigma$ accepted by a one-counter automaton such that the $\omega$-power $$U_{n,k}^\infty:=\{ w_0w_1\cdots\in\Sigma^\omega\mid\forall i\in\omega ~~w_i\in U_{n,k}\}$$ is $D_{2n-1}(\mathbf{\Pi}^0_k)$-complete. We also prove a conditional result for the dual classes $D^-_{2n}(\mathbf{\Pi}^0_k)$: under the assumption that there exists a finitary language $V_{n,3}$ accepted by a one-counter automaton, such that its $\omega$-power $V_{n,3}^\infty$ is $D^-_{2n}(\mathbf{\Pi}^0_3)$-complete, there would also exist, for any integer $k > 3$, a finitary language $V_{n,k}$ accepted by a one-counter automaton, such that its $\omega$-power $V_{n,k}^\infty$ is $D^-_{2n}(\mathbf{\Pi}^0_k)$-complete. Finally we add another conditionnal result about Wadge degrees of rational $\mathbf{\Delta}^0_2$ omega powers, which completes the recent results of [FGL26].

[550] arXiv:2610.27979 (replaced) [pdf, html, other]
Title: Fer expansion of driven spins: closed-form recursion and no-go theorems for termination
Lorenzo Bagnasacco, Daniel Burgarth, Vittorio Giovannetti, Kazuya Yuasa
Comments: 9 pages, 1 figure; title and abstract revised to communicate the results more clearly; introduction and conclusion improved as well;
Subjects: Quantum Physics (quant-ph); Mathematical Physics (math-ph)

The Fer expansion factorizes the propagator of a driven quantum system into exponentials of time-integrated effective Hamiltonians, which govern the evolution left over by the previous factors. Every truncation is unitary, and adding a factor squares the size of the remainder, but each effective Hamiltonian is an infinite series of nested commutators of the previous one. For $\mathfrak{su}(2)$, in every representation, from qubits to spins of any dimension, we represent the effective Hamiltonians by time-dependent vectors in $\mathbb{R}^3$ and resum this series exactly. The result is a closed map from one vector to the next, in which the infinite series reduces to the previous vector crossed once and twice with its time integral, weighted by elementary functions. Using this map, we address the question of when the expansion can be stopped after finitely many factors. This is possible whenever the leftover evolution is known in closed form, for instance when the effective Hamiltonian commutes with itself at all times or precesses about a fixed axis with constant angular velocity. We prove that, for real-analytic drives, neither happens beyond the first factor unless the first exponential is already exact. Stopping the expansion therefore yields no new exactly solvable drives.

[551] arXiv:2610.38584 (replaced) [pdf, html, other]
Title: Resurgence and Modularity in the First Painlevé Equation
Kohei Iwaki, Noam Tamarin
Comments: 30 pages, 7 figures
Subjects: High Energy Physics - Theory (hep-th); Mathematical Physics (math-ph)

For the first Painlevé equation, we relate three nonlinear Stokes maps associated with a full turn around infinity to modular transformations of the two-parameter tau function through the identity $\boldsymbol S_\pi\circ\boldsymbol S_0\circ \boldsymbol S_{-\pi}=\mathsf S\circ\mathsf T$. Here the subscripts label Borel directions, while $\mathsf S$ and $\mathsf T$ denote the modular generators. Working under the analytic assumptions of the topological recursion and exact WKB constructions, we compare Stokes multipliers of the associated isomonodromy system while tracking the homology basis of its elliptic spectral curve under rotations of the independent variable. For the sectors considered, we identify the known parameter transformation induced by an $8\pi/5$ rotation with the modular $T$-action and derive a new explicit parameter relation realizing the $S$-action for a $2\pi/5$ rotation. We also determine the multiplicative factors in the corresponding tau-function relations, including their normalization constants. Together, these results give an explicit realization of single-valuedness after one full turn around infinity for both the Painlevé transcendent and its tau function, with the tau-function prefactors cancelling by Abel's five-term identity for the Rogers dilogarithm.

[552] arXiv:2611.13372 (replaced) [pdf, html, other]
Title: Extending indoor airborne infection risk modelling to 3D, with local surface deposition
Neha Bansal, Katerina Kaouri, Thomas E. Woolley
Subjects: Populations and Evolution (q-bio.PE); Dynamical Systems (math.DS); Other Statistics (stat.OT)

Mathematical models of indoor airborne disease transmission often rely on simplifying assumptions to reduce computational cost. In particular, aerosol concentrations may be assumed uniform across room height, allowing a two-dimensional (2D) formulation, while particle deposition on surfaces is represented by a first-order removal term acting throughout the computational domain. Here, we investigate how these assumptions affect predictions of airborne infection risk. We extend the Viral Infection Risk Indoor Simulator (VIRIS) [Xue et al. 2024] by developing a three-dimensional (3D) reaction-diffusion formulation in which aerosol deposition is represented by local removal at surfaces through a Robin boundary condition. We compare the original VIRIS framework with the extended model (VIRIS-3D-L) across three indoor spaces of increasing architectural and people-movement complexity: a courtroom, a care home and a supermarket. Across all three settings, the original 2D formulation with global removal predicts lower infection risks than the 3D formulation with local deposition, with differences of up to 50%. The predictions of VIRIS-3D-L also show encouraging agreement with observations from a documented courtroom outbreak previously used to validate VIRIS. Although computation time increases by approximately a factor of four on average, simulations remain feasible on a standard laptop, taking between 7 minutes and just over two hours. These findings suggest that VIRIS-3D-L offers a more physically realistic framework for assessing indoor airborne infection risk without prohibitive computational costs, while the original VIRIS remains useful when rapid simulations are required.

[553] arXiv:2611.17108 (replaced) [pdf, html, other]
Title: LazyWeights: Decode-on-Demand Edge LLMs
Arnab Sanyal, Gourav Datta, Sandeep P. Chinchali
Comments: 6 pages, 1 reference page, 5 figures
Subjects: Machine Learning (cs.LG); Hardware Architecture (cs.AR); Computation and Language (cs.CL); Information Theory (cs.IT)

Memory decides which LLMs an edge device runs, and how fast: capacity on a 4 GB Jetson Nano, bandwidth on an 8 GB Jetson Orin Nano Super. Deployed formats (GPTQ, AWQ, this http URL's K- and I-quants) spend equal bits on every integer code of a matrix, although the codes are far from uniform. LazyWeights keeps these formats but tunes GPTQ so the codes compress, Huffman-codes them losslessly in interleaved lanes, and decodes them on demand in a small unit between DRAM and L2, so GPU kernels run unchanged and DRAM moves only coded bytes. At 1% and 3.5% perplexity budgets, coded Phi-3-mini, Mistral-7B and SmolLM-1.7B are 5.7-31.4% smaller than the best this http URL format. A bit-exact 0.21 mm^2 ASIC decoder unit (1 GHz, 7 nm) cuts Orin latency and energy per token by up to 36% and 38% (54% and 44% with prompt-lookup speculation). On the Nano, LazyWeights needs 58-64% less time and 53-57% less energy per token than CPU this http URL, and runs a streamed Mistral-7B 6.6x faster at 3.89 bits per weight. A Huffman decoder beats an rANS decoder in rate and area at equal throughput; the ASIC decoder unit runs bit-exact on a Zynq UltraScale+ FPGA (AMD ZCU102).

[554] arXiv:2611.17143 (replaced) [pdf, other]
Title: A Convex-Analytic Reformulation for Poisoning Attacks on Logistic Regression
Carina Moreira Costa, Maria Eduarda Pinheiro, Martin Schmidt
Subjects: Machine Learning (cs.LG); Optimization and Control (math.OC)

We study data poisoning attacks on logistic regression with $\ell_2$-regularization, where an attacker chooses the features of a fixed number of injected observations with prescribed labels to maximize the logistic loss on the clean training data. Strong convexity of the defender's problem yields an exact reformulation through its first-order optimality conditions. Using convex conjugacy of the softplus function, we replace the sigmoid relations by a single convex optimality-gap inequality and express the attacker's objective as a concave function. A change of variables makes the stationarity condition affine, leaving bounded bilinear equalities as the only nonconvex constraints. We derive finite bounds on all variables involved in these equalities, including a global bound on the coefficient norm and tighter bounds obtained by preprocessing based on convex optimization. Experiments on eight binary classification datasets evaluate attack effectiveness and compare the two reformulations when solved with SCIP. Attacks obtained by local optimization degrade predictive performance on most datasets, while the convex-analytic formulation produces substantially stronger reported dual bounds within a fixed time limit.

Total of 554 entries
Showing up to 2000 entries per page: fewer | more | all
We gratefully acknowledge support from our major funders, member institutions, , and all contributors.
About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)