Paperlane

no. 14 · from the archive← Wed 11 Nov archive Mon 16 Nov →

Friday, 13 November 2026

1270 papers in 32 fields

Combinatorics86

We introduce general methods to derive lower tail large deviation principles, for a variety of nonlinear problems of combinatorial interest. These methods are especially effective in "critical" regimes, where the nonlinearities are not sparse enough for Poissonian lower tails (e.g., Janson's inequality does not provide a sharp tail bound), but the situation is not so dense that combinatorial effects dominate (e.g., we cannot directly apply the theory of hypergraph containers or the relative entropy framework of Kozma-Samotij). In particular, these are regimes where one expects interesting phase transitions to occur. Our results have a number of consequences related to subgraphs in random graphs, answering various questions of Warnke and Jenssen-Perkins-Potukuchi-Simkin. For example, consider a random graph $G\sim \mathbb G(n,p)$, and let $L_\triangle(n,p)=\log\Pr[G\text{ is triangle-free}]$. The first-order asymptotics of $L_\triangle(n,p)$ have long been known in all parameter ranges except the critical regime where $p$ has order of magnitude $1/\sqrt n$. We are able to fill this gap: for any fixed $c>0$, we show that $n^{-3/2}L_\triangle(n,c/\sqrt n)$ converges to a limit expressed in terms of a two-parameter variational problem, which has a single phase transition at $c\approx 4.341$. In contrast, we show that there is no such phase transition for the probability that $G$ is $C_{2\ell}$-free, for any fixed even cycle $C_{2\ell}$. We also obtain some applications in combinatorial design theory. Addressing conjectures of Glock-Kühn-Lo-Osthus, Kelly, and Kwan-Sah-Sawhney-Simkin, we obtain new estimates on the number of order-$n$ Steiner triple systems with no Pasch configuration and the number of order-$n$ Latin squares with no $2\times 2$ Latin subsquare (both tight up to a factor of $\exp(o(n^2))$).

fields
Combinatorics, Probability
pdf ↗ page arXiv:2610.10233 ↗

We give an explicit formula for the normal-play Sprague–Grundy (SG) function of slow exact $k$-Nim with $k+1$ piles. A move removes one stone from each of exactly $k$ nonempty piles. A truncation preserves every legal move sequence. The SG value depends only on the total of the truncated coordinates modulo $2k$, their number of odd entries, and the parities of the two smallest piles. For every $k\geq2$, the set of the SG values is $\{0,1,2,3\}$. We prove the formula by the mex characterization, including the reductions needed after boundary moves. We also prove a unit-shift identity and use it with a known optimal-move theorem to explain the four-value bound independently of the explicit formula.

fields
Combinatorics
pdf ↗ page arXiv:2611.14546 ↗

We develop a general monoid-theoretic framework to construct and study graded and color Hopf algebras of formal power series of bounded degree invariant under group actions. Rather than working with external alphabets of commuting, noncommuting, or anti-commuting variables, we start from an abstract monoid $M$ equipped with a $2$-cocycle twisting $τ:M\times M\to \mathbb{K}$, which is allowed to vanish, a bigrading over a commutative monoid $\mathcal{G}\times\mathbb{N}$ endowed with a bicharacter $φ$, and a group $G$ acting on $M$ via a bigraded action $ρ$ that is quasi-multiplicative with respect to $τ$, coupled with a $1$-cocycle weight function $ω:G\times M\to\mathbb{K}^\times$. By formulating local finiteness, gradings, quasi-multiplicativity, and ideals relative to the non-vanishing of $τ$, we prove that the invariant space $\mathbb{K}\langle\kern-0.2em\langle M\rangle\kern-0.2em\rangle^G$ forms a well-defined bigraded subalgebra of bounded-degree formal power series with a canonical monomial basis indexed by $ω$-admissible orbits. Furthermore, we establish four functorial constructions: embeddings into larger invariant algebras via restricted actions, color tensor product decompositions for direct products and diagonal actions, connected color Hopf algebra structures induced by internal monoid duplication, and quotient color Hopf algebras governed by invariant-retraction pairs with an explicit description of their kernel bi-ideals. As applications, we uniformly recover and extend the classical and twisted Hopf algebras of symmetric and quasisymmetric functions in commuting and noncommuting variables, MacMahon symmetric functions, the full square of symmetric and quasisymmetric Hopf algebras in superspace, symmetric and quasisymmetric functions in partially commutative variables, and signed-symmetric functions associated with the hyperoctahedral group.

comments
53 pages
fields
Combinatorics, Quantum Algebra, Rings and Algebras
pdf ↗ page arXiv:2611.14667 ↗

The $q$-permanent $P_q$ of an $n\times n$ matrix weights the term of each permutation $σ$ by $q^{\inv(σ)}$, where $\inv(σ)$ is the number of inversions of $σ$. It interpolates between the determinant ($q=-1$) and the permanent ($q=1$). Extending a conjecture of Bapat on $[-1,1]$, it was conjectured in 2010 that the $q$-permanent of every non-diagonal real symmetric positive definite matrix is strictly increasing on an interval $(\varepsilon,+\infty)$ with $\varepsilon<-1$. In this note, we disprove this conjecture. An explicit real symmetric positive definite integer matrix of order five, whose $q$-permanent has only nine nonzero terms, satisfies $P_{14}(A)>P_{15}(A)$. A sparse family shows that for every real $r>1$ some real symmetric positive definite matrix has a $q$-permanent with negative derivative at $q=r$. The counterexamples can be chosen to be correlation matrices without zero entries or, separately, to have integer entries. We also show that the smallest order of a counterexample is four, and that matrices supported on three coordinates separated by identity blocks fail much closer to $q=1$: in order five already near $q=1.7$, and in order $O(1/(r-1))$ at any prescribed $q=r>1$.

fields
Combinatorics
pdf ↗ page arXiv:2611.14694 ↗

Let $(Γ,+)$ be a finite Abelian group. A $Γ$-distance magic labeling of a graph is a bijection from its vertex set to $Γ$ such that the sum of the labels of the neighbours of each vertex is a fixed element of $Γ$, called the magic constant. The constructions of Kovář and collaborators provide regular distance magic graphs of odd order with consecutive integer labels for every even degree from $4$ to $14$. We adapt these constructions to prove the existence of connected $r$-regular $(A\times\mathbb{Z}_n)$-distance magic graphs with magic constant $0$, where $A$ is any finite Abelian group of odd order, $n$ is odd, and $r\in\{4,6,8,10,12,14\}$, under explicit sufficient conditions on $n$. Here $\mathbb{Z}_n$ is the cyclic group of order $n$. It suffices to take $n\ge13$ for $r=6$, $n\ge19$ for $r=14$, and $n\ge15$ for $r\in\{4,8,10,12\}$.

fields
Combinatorics
pdf ↗ page arXiv:2611.14730 ↗

Steiner triple systems (STS) and subsets of these known as partial STS (PSTS) are combinatorial objects that have received substantial interest from mathematicians since their introduction in 1847. Over the last three decades, (P)STS have found applications in diverse fields ranging from digital circuit testing to wireless transmission. Perhaps unsurprisingly, the triple in (P)STS allows for a mapping to 3-conjunctive normal form (3-CNF) formulas, the Boolean formula used as input to 3-SAT. Prompted by this ready conversion of (P)STS to 3-CNF formulas and numerous real-world applications of (P)STS, we explore the intersection of (P)STS with 3-SAT and its counting version \#3-SAT. We explain the properties of (P)STS-generated 3-CNF formulas in terms familiar to the SAT community and experimentally compare them against randomly-generated 3-CNF formulas. We find that PSTS-3-CNF formulas are statistically distinct from randomly generated 3-CNF formulas, in both probability of satisfiability and expected solution count.

comments
Revised manuscript of work presented at the Pragmatics of SAT (PoS) Workshop, FLoC 2026, July 19, 2026, Lisbon, Portugal. Not published in the workshop proceedings. Minor wording and notation corrections
fields
Combinatorics
pdf ↗ page arXiv:2611.14738 ↗

We present schubmult, a GPL-licensed Python system for exact multiplication of ordinary, double, quantum, and quantum double Schubert polynomials, as well as independent-alphabet triple and quantum triple products. Its central algorithm expands one factor into filtered column paths and couples them to Pieri computations on the other factor. Dynamic programming shares intermediate states, and the algorithm returns every Schubert-basis coefficient as an exact arithmetic circuit. We prove input-sensitive operation bounds for the entire product, not just a selected coefficient: for inputs of minimal rank $n$, the classical algorithms have complexity $2^{O(n\log n)}$ and polynomial complexity in $n$ for fixed Lehmer-code lengths. The quantum algorithms have the same general bound and polynomial complexity when, in addition, the number of nonzero entries in the Lehmer code of $v^{-1}$ is fixed. We describe the implementation and distinguish it from the algorithms analyzed, verify computations against independent routines and exact identities, and report reproducible timings for flag and Grassmannian workloads. Parabolic quantum products are treated separately via the Peterson-Woodward comparison.

comments
26 pages, 2 tables. Ancillary files contain the benchmark script and raw timing data
fields
Combinatorics, Algebraic Geometry
pdf ↗ page arXiv:2611.14743 ↗

A chess queen in $d$-dimensions can move any distance in the direction of any edge or diagonal of the $d$-dimensional hypercube. (That is, a queen can move from a position $x$ to $x+cv$ for any $c$ and any nonzero $v\in\{-1,0,1\}^d$.) We prove that one can place $n^{d-1}$ non-attacking queens on the $d$-dimensional modular board $(\mathbb Z/n\mathbb Z)^d$ if and only if all prime factors of $n$ exceed $2^d$. The $d=3$ case of this result is a conjecture of van Rees from 1981. Our proof involves both human ideas and substantial AI assistance.

comments
8 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.14754 ↗

Perfect matchings of a bipartite graph are counted by the permanent of the graph's biadjacency matrix, and permanents of sequences of structured biadjacency matrices lead to integer sequences. We consider a number of such sequences and illustrate how zeon-algebraic representations of bipartite graphs lead to recursively defined zeon sequences. Then, using formal power series methods, we show that the ``$Ω$-exponentials'' of these zeon sequences reveal numbers of perfect matchings in the graphs.

comments
23 pages, 7 figures
fields
Combinatorics, Rings and Algebras
pdf ↗ page arXiv:2611.14802 ↗

A queue layout of a graph consists of a linear order of the vertices and a partition of the edges into queues so that no two edges in a single queue are nested. The minimum number of queues needed in a queue layout of a graph is called its queue number. A planar product structure theorem of Dujmović, Joret, Micek, Morin, Ueckerdt, and Wood (JACM, 2020) states that every planar graph is a subgraph of the strong product of a graph of simple treewidth at most $3$, a clique $K_3$, and a path. The result has been used to show that the queue number of planar graphs is at most $49$. Recently, Bekos, Gronemann, and Raftopoulou (Algorithmica, 2023) investigated how the general approach based on the product structure can be optimized for planar graphs. They claim that an appropriate reordering of the three vertices associated with each bag in the product structure decomposition, called a tripod, reduces the queue number of planar graphs to $42$. We first highlight a gap in their queue layout algorithm: one of the choices required by the algorithm is not guaranteed to exist. Then we show how to address the limitation and provide an alternative tripod reordering mechanism that reduces the upper bound on the queue number of planar graphs to $33$. As a corollary, bipartite planar graphs have queue number at most $22$.

fields
Combinatorics
pdf ↗ page arXiv:2611.14817 ↗

We use the Eigenvalue Method to obtain upper spectral bounds on the size of permutation codes in the Hamming, Ulam, Cayley and Kendall metrics. For the Kendall metric, we improve the double-ball upper bound of Buzaglo and Etzion [IEEE Transactions on Information Theory, 2015] at minimum distance four and lengths seven and eight. For the Cayley metric, we improve the sphere packing bound, and determine when these spectral improvements occur. We derive theoretical spectral criteria for improvements from the ratio-type bounds of low degree, and show that the quadratic ratio-type bound for the Kendall metric always equals sphere packing. Furthermore, we prove sharp spectral bounds and recover known optimal code sizes for the Hamming and Ulam metrics.

fields
Combinatorics
pdf ↗ page arXiv:2611.14819 ↗

We investigate growing uniform random hypergraphs whose hyperedges are $(k-1)$-simplices. At each step, one of two processes occurs: (i) a new vertex is added with probability $p$; (ii) a simplex $\langle v_1,\ldots,v_k\rangle$ with randomly chosen distinct vertices is added with probability $1-p$. Emerging random uniform hypergraphs exhibit a percolation transition. A giant component is formed when $p<p_c=1-(2k-1)^{-2}$. The fraction of vertices in the giant component scales as $\exp[-C/\sqrt{p_c-p}]$, a signature of the Berezinskii-Kosterlitz-Thouless phase transition. In the non-percolating phase, the cluster size distribution has an algebraic tail with a continuously varying exponent, while at $p=p_c$, it acquires a logarithmic correction. We analyze triadic hypergraphs ($k=3$) in detail and then generalize to higher $k$. We show that the Euler characteristic and the first Betti number of the giant component scale linearly with system size. Higher Betti numbers fluctuate between realizations but remain finite, and hence the normalized Euler characteristic and the first Betti number of the giant component are asymptotically equal, up to a sign.

comments
16 pages, 8 figures
fields
Combinatorics, Mathematical Physics, Probability
pdf ↗ page arXiv:2611.14824 ↗

The frustration index of a signed graph is the minimum number of edges meeting every negative cycle. Let $F_n$ be the frustration index of the signed $n$-cube $Q_n$ in which every square is negative. Using signings constructed from weighted cubes, we prove that for every positive integer $r$, \[ F_{r^2+1}=(r^2-r+1)2^{r^2-1}. \] When $4\mid r$, our construction also gives the exact value $F_n=(n-r-p/4)2^{n-2}$ in the six dimensions $n=r^2+1+pr/2$, $p\in\{\pm1,\pm2,\pm3\}$. In dimension nine an argument with integral eigenvectors gives $F_9=772$. By varying one weight in the construction for $r^2+1$, we obtain $F_n=(n-\sqrt n+O(n^{-1/2}))2^{n-2}$ for arbitrary $n$. The values at $n=r^2+1$ show that the error term has the best possible order. Taking the positive edges of an optimal signing gives a square-free subgraph of $Q_n$ with at least $(n+\sqrt n-O(n^{-1/2}))2^{n-2}$ edges whose complement is also square-free.

fields
Combinatorics
pdf ↗ page arXiv:2611.14906 ↗

For a nonzero polynomial $P(x)\in\mathbb{Z}[x]$ with $P(0)=0$, let $W(P(x);4)$ denote the least integer $N$ such that every four coloring of $[N]$ contains distinct integers $u,v$ of the same color with $v-u=P(d)$ for some integer $d$. The best known general upper bounds for polynomial van der Waerden numbers are primitive recursive but remain enormous compared with the few known exact values. In this paper we determine the exact four color polynomial van der Waerden numbers for \[ \begin{gathered} x^2+x,\quad 2x^2+x,\quad 3x^2+x,\\ x^2+7x,\quad 2x^2+7x,\quad 3x^2+7x,\\ x^2+9x,\quad 2x^2+9x,\quad 3x^2+11x. \end{gathered} \] We derive upper bounds using combinatorial proofs and lower bounds using constructions of explicit colorings of $[N]$ found using the alternative computing inspired method of simulated annealing. More generally, we also prove that the four color polynomial van der Waerden numbers for the entire family of nonzero polynomials $ex^2+fx$ grow only linearly in the magnitude of their coefficients \[ W(ex^2+fx;4)=Θ(|e|+|f|). \]

fields
Combinatorics
pdf ↗ page arXiv:2611.14913 ↗

A connected graph with at least two vertices is matching covered if each of its edges is contained in a perfect matching. A bipartite matching covered graph is a brace if no nontrivial cut meets every perfect matching in exactly one edge.An edge $e$ of a brace $G$ is thin if $G-e$ is matching covered and its retract is a brace. Every brace can be reduced to $K_2$ or $C_4$ by successively deleting thin edges and taking retracts. Indeed, Carvalho, Lucchesi and Murty proved that every brace of order at least six has at least two thin edges. They conjectured that there exists a positive constant $c$ such that every brace of order $n\ge6$ has at least $cn$ thin edges. In this paper, we prove that every simple brace of order $n\ge6$ has at least $\left\lceil\frac{n+2}{6}\right\rceil$ thin edges and that every brace of order $n$, withparallel edges allowed, has at least $\frac{n}{13}$ thin edges. This proves the conjecture. Moreover, we prove that every cubic brace of order $n$ has at least $\left\lceil\frac{n+1}{5}\right\rceil$ thin edges for $n\ge6$ and that the coefficient $\frac15$ is best possible.

fields
Combinatorics
pdf ↗ page arXiv:2611.14988 ↗

The Merino-Welsh conjecture states that the Tutte polynomial $T_G(x,y)$ of a loopless and bridgeless graph $G$ satisfies the inequality $\max\{T_G(2,0),T_G(0,2)\}\geq T_G(1,1).$ It is known to hold for several graph classes, among them sufficiently sparse and sufficiently dense graphs. In this paper, we improve the previously known sufficient density conditions and show that the multiplicative version of the conjecture also holds for sufficiently sparse and sufficiently dense graphs. In particular, we show that for a connected graph $G$ with $m$ edges and $n$ vertices, the Merino-Welsh conjecture holds if either $m\leq1.64(n-1)$ and $G$ is loopless or $m\geq2.55(n-1)$ and $G$ is bridgeless, and the multiplicative conjecture holds if $G$ is loopless and bridgeless with $m\leq1.21(n-1)$ or $m\geq5.62(n-1)$.

comments
7 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.15008 ↗

We study directed graphs whose homomorphism densities never increase or never decrease when the host edge directions are randomized. We call these properties oriented Sidorenko (OS) and oriented anti-Sidorenko (OAS), respectively. A directed graph is symmetry-forcing if equality between its original and randomized densities forces quasi-random edge directions. We characterize connected OS directed graphs in terms of weakly norming graphs and show that they are symmetry-forcing exactly when their underlying graphs contain a cycle. We also prove that a connected graph is step forcing exactly when it is step Sidorenko and contains a cycle, giving a negative answer to a question of Doležal et al. Both forcing results follow from a characterization of strict convexity: the homomorphism density functional of a graph is strictly convex on nonnegative kernels exactly when the graph is weakly norming and contains a cycle. On the OAS side, we construct an infinite symmetry-forcing family and a nonbipartite example. We also classify OS and OAS orientations of stars, paths, and cycles.

comments
28 pages.Comments are welcome!
fields
Combinatorics
pdf ↗ page arXiv:2611.15027 ↗

The Pons–Batle conjecture on tree-child networks was regarded as a specific and challenging problem in the phylogenetics community. We found an unexpected weighted symmetry for a class of three-row Young tableaux with walls and holes. This weighted symmetry implies the Fuchs–Yu identity, which together with the bijection of Chang, Fuchs, Liu, Wallner, and Yu leads to a simple proof of the Pons–Batle conjecture. We construct an involutive proof of this symmetry via introducing decorated binary networks as an intermediate structure. We also provide an elementary proof of this weighted symmetry using recurrence relations.

comments
15 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.15038 ↗

We study the relation between electrical positivity introduced by Lam and Pylyavskyy $[9]$ and total positivity of symplectic matrices arising from circular planar electrical networks. A particularly convenient framework for our purpose is provided by a construction of an embedding of electrical network into the positive Lagrangian Grassmannian, see Section $1.1$. Employing this technique, we demonstrate that mentioned below two types of positivity do not coincide, see Theorem $2.2$. In Section $3$ we also derive explicit rational formulas recovering the parameters of the factorization from our symplectic matrix entries and minors, and prove uniqueness under explicit nonvanishing conditions.

fields
Combinatorics, Group Theory, Symplectic Geometry
pdf ↗ page arXiv:2611.15043 ↗

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.

fields
Combinatorics
pdf ↗ page arXiv:2611.15122 ↗

The $k$-token graph $F_k(G)$ of a graph $G$ is the graph whose vertices are the $k$-subsets of $V(G)$, with two $k$-subsets adjacent if and only if their symmetric difference is an edge of $G$. In this paper we study the domination number of $F_k(G)$ for graphs $G$ whose domination number $γ(G)$ is at least two, with a primary focus on the case $γ(G)=2$. For $k=2$, we give an upper bound for $γ(F_2(G))$ in terms of a dominating pair of $G$, and show that this bound is sharp for every double star $S_{a,b}$ with $2\le a\le b$; moreover, we determine the exact value for every double star, namely $γ(F_2(S_{a,b}))=2a+b-1$ for $1\le a\le b$. We also prove that $γ(F_2(G))\ge\lceil n/2\rceil$ for every graph $G$ on $n$ vertices with $γ(G)\geq2$, with equality for the graphs with the maximum number of edges among those with $γ(G)\geq2$. Then, we focus on complete bipartite graphs; we give upper bounds for $γ(F_2(K_{r,t}))$ that match the exact values independently established in recent work, together with a short proof that $γ(F_2(K_{2,n-2}))=n-2$. For $k\ge3$ we show that $γ(F_k(K_{2,n-2}))$ equals, up to lower-order terms, the Turán number $T(n-2,k,k-1)$, and we determine $γ(F_3(K_{2,n-2}))$ exactly, obtaining $T(n-2,3,2) +n-4=n^2/4+O(n)$; for $k=4$, determining the leading constant is related to the still-open Turán conjecture for 3-uniform hypergraphs. Finally, for $n\geq 12$ even, we prove that $γ\left(F_3(K_{n/2,n/2})\right) =\frac{7}{48}n^2+O(n)$.

fields
Combinatorics
pdf ↗ page arXiv:2611.15124 ↗

We show that for every integer $n\ge2$ that is not a power of two there are constants $c_n>0$ and $B_n>2$ such that $s(C_n^r)\ge c_nB_n^r$ for all $r\ge1$. For powers of two, Harborth's formula gives growth rate exactly $2$. For the remaining even exponents, the previous lower bounds were of order $r2^r$. When $n=2m$ with $m\ge3$ odd, we prove the transfer inequality \[ A_n(H\oplus C_n^5)\ \ge\ 12\,A_n(H\oplus C_n)+8\,A_n(H\oplus C_m), \] where $A_n(G)$ is the maximal length of a sequence over $G$ without an $n$-term zero-sum subsequence and $H$ is any finite abelian group whose exponent divides $n$. The transfer extends a configuration of Elsholtz to twenty full cyclic fibers. Combined with a nine-point binary construction for $2m$-term zero-sums over $C_m^r$, it gives bases at least $2.0341$ that tend to $2.0394\ldots$; combined with a finite-field construction, it gives $s(C_6^r)\ge c\cdot 2.0491^r$. For exponents divisible by $4$ that are not powers of two, we obtain a base above two from a weighted random construction on the eighteen-point configuration of Wang and Zeng.

comments
12 pages
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2611.15210 ↗

We study the areas of the cells determined by an arrangement $\mathcal{A}$ of $n$ distinct great circles on the unit sphere, with no three concurrent. Let $m(\mathcal{A})$ and $M(\mathcal{A})$ denote the smallest and largest cell areas, respectively. Our first result is the bound \[ m(\mathcal{A})\le \frac{C_*+O(n^{-3/4})}{n^2}, \qquad C_*=7.0666071493\ldots , \] where the implied constant is absolute. This improves the coefficient $π^2$ obtained from classical polygonal perimeter estimates. We also prove that $M(\mathcal{A})/m(\mathcal{A})>13$ for all sufficiently large $n$, improving the bound $7.43$ of L.~Fejes Tóth. The main tool is a perimeter inequality for planar polygons which takes account of their exterior angles. We combine this with a positive semidefinite kernel on the sphere and use gnomonic projection to obtain bounds for spherical cells.

comments
16 pages,3 figures
fields
Combinatorics, Metric Geometry
pdf ↗ page arXiv:2611.15244 ↗

A hereditary graph class is small if it contains at most $n!c^n$ labelled graphs on $n$ vertices for some constant $c$. Small classes include proper minor-closed classes and classes of bounded twin-width. We prove that every small class has linear neighbourhood complexity, that is, in every graph in the class, vertex neighbourhoods intersect any $k$-vertex set in only $O(k)$ distinct ways. This resolves a conjecture of Bonnet, Duron, and the first two authors (ITCS 2025) and makes the algorithmic, structural, and representation consequences of linear neighbourhood complexity available for every small class. In particular, every small class admits an adjacency labelling scheme with $O(\log^2 n)$-bit labels, improving the previous $O(\log^3 n)$ bound.

comments
31 pages, 6 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.15299 ↗

Let $\mathcal A$ and $\mathcal B$ be nonempty families of $k$-subsets of $\{1,\ldots,n\}$ such that $|A\cap B|\ge t$ for all $A\in\mathcal A$ and $B\in\mathcal B$, and suppose that each family has fewer than $t$ common elements. For $k\ge t+2\ge4$ and $n\ge(t+1)(k-t+1)$, we prove \[ |\mathcal A||\mathcal B|\le\max\{h_t(n,k)^2,b_t(n,k)^2\}, \] where \[ h_t(n,k)=\binom{n-t}{k-t}-\binom{n-k-1}{k-t}+t,\quad b_t(n,k)=(t+2)\binom{n-t-2}{k-t-1}+\binom{n-t-2}{k-t-2}. \] The bound is sharp, and we characterize all extremal pairs, whose families have equal sizes but need not coincide. The proof combines clique lifts, exchanges of generating families and a density inequality for cross-intersecting uniform layers. This gives a product version of the Hilton–Milner–Frankl theorem throughout the Erdős–Ko–Rado range. In particular, it answers a question of Wen and Lv on whether a threshold of order $kt$ suffices for the sharp product bound.

comments
44 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.15327 ↗

We prove a conjecture of Kühnel, Lassmann, and Lutz, first asked in 1984, that the minimal number of vertices in a triangulation of the $3$-dimensional torus is $15$.

comments
9 pages, 2 figures
fields
Combinatorics, Geometric Topology
pdf ↗ page arXiv:2611.15358 ↗

We investigate combinatorial properties of the semigroup of all order- preserving mappings on {1, 2, . . . , n} and of its subsemigroup of all decreasing order-preserving mappings. We show that the cardinal of the latter is the nth Catalan number and obtain a new proof of the standard Catalan identity. Using ballot arguments and the Reflection principle we find the probability that a random order-preserving mapping is indecomposable, and via the Wallis product we show that the mean number of orbits is of order root n. By contrast, the mean number of orbits of a random decreasing mapping of this type never exceeds 3; we find the distribution of the orbit number explicitly in both cases and obtain the limiting distribution for the Catalan monoid.

comments
This is a slightly adjusted copy of my paper of that name published in 1993: Math. Proc. Camb. Phil. Soc. (1993), 113, 281-296. Printed in Great Britain. I am often asked about it (it has 125 citations on Google Scholar)
journal
Math. Proc. Camb. Phil. Soc. (1993), 113, 281-296
fields
Combinatorics
pdf ↗ page arXiv:2611.15369 ↗

For integers $r\ge s\ge t\ge1$, we introduce the Ramsey number $R(G;r,s,t)$, defined as the least $N$ such that every assignment of an $s$-element subset of $[r]$ to each edge of $K_N$ yields a copy of $G$ whose edges have at least $t$ colors in common. This generalizes the classical set-coloring Ramsey number $R(G;r,s)=R(G;r,s,1)$, studied since the work of Erdos, Hajnal, and Rado. We show that $t$ cannot in general be eliminated by reparametrization: infinitely many quadruples $(G;r,s,t)$ satisfy $R(G;r,s,t)\ne R(G;a,b)$ for every $a\ge b\ge1$. Writing $α=\binom{r}{t}/\binom{s}{t}$, the shadow inequality $R(G;r,s,t)\le R(G;\binom{r}{t},\binom{s}{t},1)$ and the recent proof of the Erdos–Sos conjecture imply $R(T_n;r,s,t)\le\lfloorα(n-2)\rfloor+2$ for every $n$-vertex tree $T_n$. For stars, we obtain packing bounds and exact values under suitable divisibility conditions. For paths and even cycles $G$ of order $n$, we improve the upper bound to $R(G;r,s,t)\le(α-γ+o(1))n$ as $n\to\infty$, for fixed $r>s\ge t\ge1$ and some $γ=γ(r,s,t)>0$. We also prove that, for fixed $s,t$, the tree bound is asymptotically sharp for paths as $r,n\to\infty$, and for even cycles when $n\to\infty$ first and then $r\to\infty$. For cliques $K_n$, we transfer known bounds of Conlon et al. for ordinary set-coloring Ramsey numbers to the general parameter $t$, obtaining two-sided exponential bounds. For each fixed $n\ge3$, we identify an explicit piecewise-linear function $Φ_n$ that determines a growth threshold. If $s/r\toσ$ and $t/r\toτ$ as $r\to\infty$, with $0<τ\leσ<1$, then $R(K_n;r,s,t)=O(1)$ when $τ<Φ_n(σ)$, whereas $R(K_n;r,s,t)\ge\exp(cr)$ for some $c>0$ when $τ>Φ_n(σ)$.

comments
23 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.15376 ↗

In the Traveling Salesman Problem, a route must visit all customers and return to its starting point while minimizing its total length. The Minimum Latency Problem, also known as the Traveling Repairman Problem, instead minimizes the sum of the times at which customers are first visited. We give a deterministic polynomial-time approximation scheme for the weighted Euclidean Minimum Latency Problem in every fixed dimension, with arbitrary nonnegative customer weights. Our proof restricts the form of a solution in three steps, each with a controlled increase in cost. First, a decomposition based on Sitters' method assigns customers to phases that start and end at the root. Second, within each phase, we divide the route into a constant number of blocks and charge each customer at the end of its assigned block. The resulting objective is a nonnegative linear combination of block lengths. Third, we add an auxiliary dimension and use a fixed Minkowski norm to close each block path into a tour. Arora's closed-tour estimate then gives paths that cross the boundaries of a common dissection only at designated portals and a bounded number of times per face. A dynamic program optimizes the restricted objective, and projecting its paths back to the original space gives the final route. Rounding weights and coordinates keeps the state space polynomial.

fields
Combinatorics
pdf ↗ page arXiv:2611.15425 ↗

We prove that, for all integers $r\ge 2$ and $d\ge 1$, every finite simple $d$-regular $r$-uniform hypergraph $H$ on $n$ vertices satisfies \[ \operatorname{ind}(H)\le \operatorname{ind}(H_d^r)^{n/(rd)}, \] with equality if and only if $H$ is a disjoint union of copies of $H_d^r$. Here $\operatorname{ind}(G)$ denotes the number of independent sets in $G$, and $ H_d^r$ is the $d$-regular $r$-partite $r$-graph on $rd$ vertices obtained by taking all $r$-sets consisting of one vertex from a fixed $d$-vertex set and one of $d$ pairwise disjoint $(r-1)$-sets partitioning the remaining vertices. This settles the conjecture of Balogh, Bollobás and Narayanan, who proved the bound for quasi-bipartite hypergraphs.

fields
Combinatorics
pdf ↗ page arXiv:2611.15486 ↗

Latroids are a generalization of matroids and polymatroids, given by a submodular rank function on a modular lattice. We study integer-valued latroids whose length function is the height of a finite modular lattice, without assuming that the lattice is complemented. We show that their cyclic flats form a lattice and, together with their ranks, determine the rank function. We also characterize which families of lattice elements, together with prescribed rank values, occur as the cyclic flats of such latroids. We then focus on principal intervals of Young's lattice, where we classify the latroids with modular rank functions and characterize the sparse paving ones. Finally, we attach a latroid to every Ferrers diagram rank-metric code and show that its cyclic flats, together with their ranks, determine the dimensions of all shortenings to Young subdiagrams.

fields
Combinatorics
pdf ↗ page arXiv:2611.15501 ↗

For a real polynomial of degree $n$ with $n$ distinct real roots, assume that no two different nonconstant derivatives, including the polynomial itself, share a root. Recording the derivative orders of all roots from left to right gives a Rolle word. We present an exact, computer-assisted classification in degree six: $2706$ words are realizable, with a word and its reversal counted separately. Starting from $33592$ formal interlacing words, published necessary restrictions leave $13404$ candidates. Integer realization certificates and $53$ exact exclusion stages classify every candidate. The surviving set agrees exactly with the set of certified realizations. All verification uses integer and rational arithmetic. The accompanying code, certificates, proof notes, and per-word exclusion ledger make the computation reproducible. The result concerns degree six; it does not resolve the classification problem in arbitrary degree or count connected components of coefficient space. Most of the mathematical development, code, certificates, and initial manuscript were generated using ChatGPT under the author's direction. No independent human audit of the complete proof chain has yet been completed.

comments
12 pages. Exact certificates and Python verification code included as ancillary files. Substantial use of ChatGPT disclosed on the first page and in Section 9. Preprint; not peer reviewed
fields
Combinatorics, Classical Analysis and ODEs
pdf ↗ page arXiv:2611.15505 ↗

We prove that every matroid of rank or corank at most three is $Z$-Rayleigh: its multivariate Tutte polynomial satisfies the Rayleigh inequalities for every positive weighting and every parameter $0<q\le1$. This settles a conjecture of Mani and answers the rank-$3$ spanning-correlation question of Cocks and the correlated-matroid question of Semple and Welsh. For simple rank-$3$ matroids, we obtain an explicit decomposition of each spanning-set Rayleigh difference into the corresponding basis Rayleigh difference, positively weighted squares, and a polynomial with nonnegative coefficients. A second identity compares the normalized multivariate Tutte Rayleigh difference with $(1-q)^2$ times the spanning-set difference, with a remainder of the form $q(1-q)R(q,x)$, where $R$ has nonnegative coefficients. The proof uses the bipartite incidence graph of the lines through two fixed elements and Wagner's theorem that rank-$3$ matroids are basis-Rayleigh. The rank bound is sharp, since a rank-four matroid can fail even the basis Rayleigh inequalities.

comments
12 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.15512 ↗

We study strictly Deza graphs that occur as prime graphs of finite solvable groups and admit a partition into two cliques. Using Gruber's characterization of the prime graphs of finite solvable groups, we relate this problem to bipartite $(0,2)$-graphs. We first show that a non-complete regular graph with a partition into two cliques has equal parts. For a graph of diameter two, writing $F$ for its $c$-regular complement on $2m$ vertices, the Deza condition is equivalent to every component of $F$ being a bipartite $(0,2)$-graph. Within this class, strongly regular graphs occur exactly when $c=1$; we give elementary descriptions for $c=2$ and $c=3$, and translate the existing classification of bipartite $(0,2)$-graphs of valency at most eight. A counting argument yields $m\ge1+c(c-1)/2$, with equality corresponding to biplanes. These observations recover the ten feasible parameter pairs for $m\le7$ without enumeration and give infinite families of strictly Deza prime graphs. We also exhibit a known eight-vertex strictly Deza graph whose complement is triangle-free and three-colourable but not bipartite, showing that clique cover number three occurs.

fields
Combinatorics
pdf ↗ page arXiv:2611.15536 ↗

We study a variation of the shuffle operation on permutations, which acts on their cycle structure instead of their one-line notation. Given two permutations $σ\in S_k$ and $τ\in S_{n-k}$, the $\textit{shuffle-by-cycle}$ $σ\mathbin{\,\sqcup\!\sqcup}_c τ$ is the set of all permutations in $S_n$ whose set of cycles can be separated into two disjoint subsets: one whose standardization is $σ$, and one whose standardization is $τ$. One can think of the sets $σ\mathbin{\,\sqcup\!\sqcup}_c τ$ as refinements of conjugacy classes. We show that if $σ$ and $τ$ have no order-isomorphic cycles, then the descent set has the same distribution, over the set $σ\mathbin{\,\sqcup\!\sqcup}_c τ$ of shuffles-by-cycle, as over the set $σ\mathbin{\sqcup\!\sqcup} τ$ of standard shuffles; our proof is bijective. This result no longer holds when $σ$ and $τ$ have order-isomorphic cycles. For an arbitrary shuffle-by-cycle, we provide a description of the distribution of the descent set in terms of plethysm of quasisymmetric functions. For the set $σ\mathbin{\,\sqcup\!\sqcup}_c σ\subset S_{2n}$, where $σ$ is an $n$-cycle, we deduce explicit generating functions for the bivariate distribution of descent number and major index.

comments
14 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.15723 ↗

Matroid theory and skew zero forcing (SZF) in graphs are both topics of mathematical interest, but very little is known about their overlap. When a matroid arises from a graph in the traditional way, the edges of the graph correspond with the elements of the matroid. However, the SZF color change rule for graphs can be viewed as a closure operator on the vertices of a graph. As such, when a matroid arises from a graph via SZF, the vertices of the graph correspond with the elements of the matroid. We call such a matroid SZF-realizable. Notably, unlike the traditional method of obtaining a matroid from a graph, skew zero forcing in a graph does not always give rise to a matroid. This paper establishes fundamental results in graph and matroid theory with respect to (1) which matroids are SZF-realizable, and (2) what kinds of graphs do and do not give rise to SZF matroids. The main result of the paper focuses on cycle matroids of outerplanar graphs.

comments
14 pages, 12 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.15741 ↗

A configuration of a cellular automaton on the $d$-dimensional torus $\mathbb{Z}_n^d$ is shift-symmetric if it is fixed by some nonzero translation. Banda, Caughman, Cenek, and Teuscher (Chaos 29, 063120, 2019) enumerated these configurations in two dimensions and drew dynamical and algorithmic consequences. We extend their results to every dimension. We give an explicit closed-form enumeration for all $n$, $d$, and alphabet sizes $σ$, in which the two-dimensional coefficients $1$, $p+1$, and $p$ become $r_d(p,v)=p^{\binom{v}{2}}\binom{d}{v}_p$, with $\binom{d}{v}_p$ the Gaussian binomial; it extends to configurations with a prescribed number of active cells and to all finite abelian groups. The case of prime $n$ recovers, in complement form, a result of Castillo-Ramirez and Gadouleau; the multi-prime closed form and the dynamical consequences beyond the stabilizer inclusion are new. We prove a lower bound attained exactly when $n$ is prime, and upper bounds, among them $(2^d-1+2\log_2 n)\,σ^{n^d/2}$. As $d$ grows, the symmetry probability decays as $σ^{-c\,n^d}$ with $c\to1-1/p_1(n)$, set solely by the smallest prime factor of $n$, and the symmetry advantage of the side $p+1$ over a prime side $p$ inverts within an explicit window around $d_c(p)\approx p\ln 2$. Under the necessary hypothesis of translation-equivariant neighborhoods, shift-symmetry is irreversible, the per-prime symmetry ranks never decrease, and non-symmetric tasks are unsolvable from symmetric inputs. We give a detection algorithm with worst-case cost $O(n^d\sum_{p\mid n}\frac{p^d-1}{p-1})$ and an average-case analysis, exact for each subgroup test. The mathematical content of every numbered statement is formally verified in Lean 4, and the correspondence between each theorem, lemma, proposition, and corollary and its formal statement was audited by hand.

fields
Combinatorics, Dynamical Systems
pdf ↗ page arXiv:2611.15751 ↗

For a regular matroid on $m$ elements with positive weights and weighted girth $g_w$, we prove that the number of circuits of weight at most $αg_w$ is bounded by $(Km)^{2α}$, for every real $α\ge1$ and an absolute constant $K$. This improves the previous $m^{O(α^2)}$ bound of Gurjar and Vishnoi and matches classic graph cut and cycle counting bounds of Karger and Subramanian. We also show this is asymptotically optimal for all real $α\geq 1$ under the Erdős girth conjecture, while unconditional optimality holds for half-integer $α$ by prior results. As consequences, we resolve a recent conjecture by Khanna, Putterman, and Song implying the existence of a parallel basis search algorithm for regular matroids terminating in logarithmically many rounds of independence queries, and obtain improved bounds on the number of near-minimum weight codewords in regular codes and near-shortest vectors in totally unimodular lattices under $\ell_p$-norms.

comments
28 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.15755 ↗

We extend exponential double Riordan arrays to exponential multiple Riordan arrays $[g;f_1,\ldots,f_\ell]$, whose columns are generated, in exponential form, by a function $g$ of $t^\ell$ and $\ell$ multipliers $f_1,\ldots,f_\ell$ used cyclically. We prove an $\ell$-case fundamental theorem, define the exponential multiple Riordan group, and determine its identity, inverses, and its Appell, associated, and $\ell$ Bell-type subgroups; the group is the semidirect product of its Appell and associated subgroups. We compute the production matrix in terms of $2\ell$ sequences, the $c_r$- and $r_r$-sequences ($0\leq r\leq \ell-1$), give its bivariate generating function in terms of generalized hyperbolic functions, and derive recurrence relations for the entries. Finally, we give two sequence characterizations: one by $\ell-1$ one-step $A$-sequences, an $\ell$-step $A$-sequence, and a $Z$-sequence, and one by a single $\ell$-step $A$-sequence and $\ell$ $Z$-sequences. For $\ell=2$ all results reduce to those for exponential double Riordan arrays.

fields
Combinatorics
pdf ↗ page arXiv:2611.15801 ↗

We address the question of $q$-$γ$-positivity of $q$-Narayana polynomials for $q$-super Catalan numbers $A_{n,m}(q)$ and their duals, $B_{n,m}(q)$. We offer three main results. First, both the $q$-$m$-Narayana polynomials, whose coefficients refine the q-super Catalan numbers, and the dual q-Narayana polynomials are $q$-$γ$-positive of index one. Second, the dual $q$-Narayana polynomials are also $q$-$γ$-positive of index two. Third, both the $q$- Narayana numbers and their duals are coefficient-wise $q$-unimodal.

comments
16 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.15811 ↗

The generalized nested logit model extends the nested logit model by allowing each product to belong to multiple nests. The overlapping nests in the generalized nested logit model can capture complex substitution patterns, and the model has found applications in many areas. We study the assortment optimization problem under the generalized nested logit model and prove that it is NP-hard when there are only two nests or when any two distinct nests have at most one product in common. Motivated by these complexity results, we introduce novel concepts of product and nest graphs that capture which products are included in which nests. We use the tree decompositions of the graphs to characterize when the assortment optimization problem admits efficient solution methods. When the treewidth of a product graph is bounded, the assortment optimization problem can be solved in polynomial time. If the treewidth of the product graph is unbounded but the treewidth of the nest graph is bounded, then there exists a fully polynomial-time approximation scheme. These results represent the first polynomial-time algorithms for assortment optimization under the generalized nested logit model. Our numerical experiments on synthetic and real datasets show that the generalized nested logit model provides a better fit to the data than many existing models in the literature.

comments
32 pages in main text, 18 pages in appendices
fields
Combinatorics
pdf ↗ page arXiv:2611.15817 ↗

A conflict-free cut of a host graph $G$ is an edge cut containing no conflicting pair of edges. The conflicts are specified by a conflict graph $\widehat G$ whose vertex set is $E(G)$. The conflict-free cut problem asks if the given instance $(G, \widehat G)$ has a conflict-free cut. When restricted to planar $G$ and 1-regular $\widehat G$, the problem is polynomial time solvable when $G$ has maximum degree 4, but NP-complete already at maximum degree 5. We study the complexity of conflict-free cut problem under restrictions on the degrees of $G$, the components of $\widehat G$, and the locality of the conflicts. A conflict is local if its two edges share an endpoint in $G$. We prove the following results. * For $Δ(\widehat G)\le1$, a directed-cycle formulation gives a polynomial-time algorithm when $|E(G)|\le2|V(G)|$, hence for maximum degree four. The problem is NP-complete on $5$-regular hosts with exactly $1$-regular conflicts. * For $Δ(\widehat G)\le1$, we give a constructive FPT algorithm in $s_4(G)=\sum_v\max\{0,d_G(v)-4\}$, single-exponential for planar hosts. For arbitrary conflicts, we give an XP algorithm in $η=\max\{0,|E(\widehat G)|-|V(G)|\}$. * On $4$-regular hosts, local exactly $2$-regular conflicts with components $C_3,C_4$ give NP-completeness. For local conflicts at maximum degree four, pair or triangle components separately permit polynomial algorithms, but mixing them gives NP-completeness. We classify cases where $\widehat G$ is a union of cliques. * An $a$-COC is a vertex set whose deletion leaves components of order at most $a$. For local conflicts, the problem is FPT in the minimum $2$-COC size, but NP-complete with a supplied $3$-COC of size six. Without locality, hardness holds with a supplied $2$-COC of size six. Both hardness results use exactly $1$-regular conflicts.

comments
48 pages, 9 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.15846 ↗

Riordan arrays have traditionally been studied as infinite lower-triangular matrices that encode generating-function transformations and combinatorial relationships. This note proposes a complementary direction: using Riordan arrays as structured operators in artificial intelligence and data analysis. For a data sequence with generating function $A(z)$, a Riordan array $(g(z),f(z))$ produces the transformation \[ A(z)\longmapsto g(z)A(f(z)). \] This yields a parameterized family of causal linear operators that combine convolution, substitution, and multiscale mixing. The resulting structure may support parameter-efficient neural-network layers, variable-length sequence models, interpretable recurrent systems, invertible architectures, and models for hierarchical or recursively generated data. We explain what the infinite-dimensional viewpoint does and does not provide, outline several possible architectures, identify theoretical and numerical challenges, and propose an initial experimental program. The aim is not to claim that Riordan arrays are appropriate for all data, but to identify settings in which their algebraic structure supplies a useful inductive bias.

fields
Combinatorics
pdf ↗ page arXiv:2611.15954 ↗

We prove that the multiplicative complexity of the three-bit low-half multiplier is six, giving a structural, enumeration-free lower-bound proof valid against unrestricted nonlinear reuse in Boolean XOR-AND circuits. The value was previously established by SAT searches of the second author. An explicit six-AND circuit supplies the upper bound. The lower bound combines derivatives, quadratic products, complementary minors, and extraction modulo a Boolean ideal. Independent finite checks accompany the arguments. $\mathrm{MC}(M_3)=6$ is fully formalized in Lean 4. The kernel-checked proof uses only the axioms propext, Classical.choice and Quot.sound.

code
github.com/bishara74/lowhalf-mul3 ∎ Lean project (lakefile.toml, lean-toolchain) builds, no sorry at 62f8bde, checked 2026-11-13 build details
comments
21 pages, 1 table. Lean formalization and verification artifacts: https://github.com/bishara74/lowhalf-mul3
fields
Combinatorics
pdf ↗ page arXiv:2611.15992 ↗

An edge map $f:E(G)\to E(H)$ between graphs is called an $FT_M$ map if the pullback of every $M$-tension on $H$ is an $M$-flow on $G$; equivalently, the pullback of every $M$-valued 1-coboundary is an $M$-valued 1-cycle. The correspondence between restricted tensions and homomorphisms to Cayley graphs motivates two flow analogues. An $(M,B)$-flow (or tension), is an $M$-flow (resp. $M$-tension) taking values in $B$. For subsets $B=-B\subseteq M$ with $M$ an abelian group, Šámal conjectured that a graph admits an $(M,B)$-flow if and only if it admits an $FT_M$ map to the Cayley graph $\operatorname{Cay}(M,B)$. DeVos conjectured that, whenever there is a graph homomorphism $\operatorname{Cay}(M,B)\to\operatorname{Cay}(M',B')$, every graph admitting an $(M,B)$-flow also admits an $(M',B')$-flow. We prove that these conjectures are equivalent and give a counterexample using the Petersen graph.

fields
Combinatorics
pdf ↗ page arXiv:2611.16055 ↗

We determine the asymptotically sharp minimum number of $q$-cliques that appear in any $n$-vertex graph with $γn^2$ edges and $δn^{p}$ $p$-cliques for $q>p>2$. The question of determining the minimum number of $r$-cliques that appear in any $n$-vertex graph with $γn^2$ edges was previously resolved by Razborov for $r=3$, Nikiforov for $r=4$ and Reiher for all $r\geq 5$. For all $r\geq 3$, the minimum is attained by a complete multipartite graph where all parts are equal except for one that can be smaller or by a limit of such graphs. Very recently, Ma, Wang and Zhu as well as Li, Liu and Zhang showed that the same construction is also a minimizer for the number of $r$-cliques when the number of $s$-cliques is fixed for any $2\leq s<r$. A minimizer in our setting is the disjoint union of the same complete multipartite graph with an independent set. This establishes the lower boundary of the three-dimensional $\{K_2, K_p, K_q\}$-profile.

comments
33 pages, 1 figure
fields
Combinatorics
pdf ↗ page arXiv:2611.16140 ↗

We study a Nim-adjacent poset game, where chips are arranged in a pyramid and two players take turns removing chips that do not currently support chips to the upper-left and upper-right; upon removing this chip, all supported chips above are also removed. Play continues until the final chip is removed. We use a bijection between the game states, Dyck paths, and unit interval graphs to count the number of possible game states up to isomorphism.

comments
16 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.16153 ↗

For fixed integers $s\ge3$ and $r$ satisfying $\log(r!)>\frac{r(s-1)}s\log r$, the union of $r$ independent uniform perfect matchings of the complete $s$-uniform hypergraph is mutually contiguous to the uniform simple $r$-regular $s$-uniform hypergraph, as $n\to\infty$ through multiples of $s$. In particular, $r=\lceil e^s\rceil$ suffices. The main input is the sharp entropy inequality for random permutations of Bristiel and Caputo. It proves the global maximization needed for the second moment of the number of complete factorizations. The remaining calculation, including its lattice factor, matches the short-cycle contribution required by small-subgraph conditioning.\\ This is an expanded version of a proof provided by ChatGPT-Astra.

fields
Combinatorics
pdf ↗ page arXiv:2611.16160 ↗

Null designs are finite point configurations with real weights whose polynomial moments vanish up to a given degree. In Godsil's framework of polynomial spaces, we give elementary proofs of sharp lower bounds on the number of points in the Euclidean and spherical cases. We characterize the spherical null designs attaining the bound and give explicit formulas for their weights. We then study how null designs can be used to replace part of a weighted design while preserving its polynomial moments. We give conditions ensuring nonnegative weights and apply the minimum-size classification to switching on circles. Examples on spheres and in Hamming and Johnson spaces illustrate these results, including a replacement between noncongruent spherical $5$-designs that preserves equal weights and the number of points.

comments
24 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.16178 ↗

A subset $D$ of the vertex set of a graph is called an $(a,b)$-regular set if each vertex in $D$ has exactly $a$ neighbors in $D$, and each vertex outside $D$ has exactly $b$ neighbors in $D$. A proper subgroup $H$ of $G$ is called an $(a,b)$-regular set of $(G,α)$ if it is an $(a,b)$-regular set of $GC(G,S,α)$ for some generalized Cayley subset $S$ of $G$ induced by the involutory automorphism $α$. This paper investigates subgroup $(0,b)$-regular sets in generalized Cayley graphs. We first obtain some necessary and sufficient conditions for a proper subgroup of a group $G$ to be a $(0,b)$-regular set of a generalized Cayley graph. In particular, we show that a proper normal subgroup $H$ of $G$ is a $(0,b)$-regular set of $(G,α)$ if and only if $H$ is a perfect code of $(G,α)$ for some odd integer $b,$ which generalizes the result in [F.S. Seiedali, Z. Akhlaghi, B. Khosravi. Generalized Cayley graphs and perfect code. Discrete Math. 2026]. Furthermore, for connected generalized Cayley graphs with $α$-normal generalized Cayley subsets, we characterize subgroup $(0,b)$-regular sets via equitable partitions.

fields
Combinatorics
pdf ↗ page arXiv:2611.16226 ↗

We give a short elementary proof of Norine's antipodal-coloring theorem: every red–blue edge coloring of a hypercube in which antipodal edges have opposite colors contains a monochromatic path joining antipodal vertices.

fields
Combinatorics
pdf ↗ page arXiv:2611.16243 ↗

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$.

fields
Combinatorics
pdf ↗ page arXiv:2611.16256 ↗

We prove analogues of Turán's theorem and the Erdős–Stone theorem for graph $a$-numbers. The $i$th $a$-number $a_i(G)$ equals the $i$th rational Betti number of the real toric manifold associated with the graph associahedron of $G$. We show that the Turán graph $T_r(n)$ maximizes every $a$-number among $K_{r+1}$-free graphs on $n$ vertices. We also show that for any fixed graph $H$ with at least one edge and each fixed $i\geq1$, the limiting extremal density of the $i$th $a$-number among $H$-free graphs depends only on the chromatic number of $H$. Since $a_1(G)$ is the number of edges of $G$, these results recover the two classical theorems in degree one and extend them to higher $a$-numbers.

comments
17 pages, 1 figure, 3 tables
fields
Combinatorics
pdf ↗ page arXiv:2611.16262 ↗

Swap coboundary expansion, introduced independently by Bafna–Minzer and Dikstein–Dinur, is a local-to-global property that underlies agreement tests in the low-acceptance regime and recent constructions of succinct PCPs. Previous works obtained bounds of $\exp(-O(\sqrt{r}))$ for the $r$-swap coboundary expansion of Chapman–Lubotzky complexes. We establish the first inverse-polynomial bounds for bounded-degree complexes: suitable skeleta of Kac–Moody–Steinberg (KMS) complexes have $r$-swap coboundary expansion at least $r^{-O(1)}$. Our theorem supplies a key ingredient in forthcoming work of Ben Yaacov–Dikstein–Liu, which obtains local tests for sparse algebraic codes with guarantees even at arbitrarily small acceptance probability. These tests use $\exp(\operatorname{poly}(1/\varepsilon))$ queries and guarantee that any word accepted with probability at least $\varepsilon$ agrees with a codeword on an $\varepsilon^{O(1)}$ fraction of coordinates. Separately, substituting our bound into the existing analysis of Bafna–Minzer–Vyas–Yun improves the soundness dependence of their two-query PCP construction, giving perfect completeness, soundness $\varepsilon$, and proof length $n(\log n)^{\exp(\operatorname{poly}(1/\varepsilon))}$. Our proof exploits the product structure of the groups arising in KMS complexes. The main new ingredient is a decomposition lemma for Dehn functions, which separates the analysis of group relations into independent problems on much smaller factors, with only polynomial overhead.

comments
63 pages
fields
Combinatorics, Group Theory
pdf ↗ page arXiv:2611.16295 ↗

A Latin square of order $n$ is an $n\times n$ array over symbols $\{0,1,\ldots n-1\}$, such that the same symbol does not appear twice in any row or any column. Two Latin squares of order $n$ are orthogonal if, when superimposed, they yield each of the $n^2$ ordered pairs of symbols exactly once. A set of two or more Latin squares are mutually orthogonal Latin squares (MOLS) if each pair of distinct squares is orthogonal. Let $N(n)$ be the maximum size of a set of MOLS of order $n$. For most $n$ which are not prime powers, there is a wide gap between known upper and lower bounds on $N(n)$. This has led to interest in constructing new larger sets of MOLS for explicit values of $n$, to incrementally improve the lower bounds on $N(n)$. This paper provides MOLS that improve the lower bound on $N(n)$ for 33 values of $n$ in the range from 22 through 494. The constructions were found by GPT-6 Astra, and use established techniques including difference matrices, quasi-difference matrices, orthogonal arrays, and projective planes. A highlight is 4 MOLS of order $n=22$; combined with pre-existing results, this establishes $N(n) \geq 4$ for all $n>10$.

fields
Combinatorics
pdf ↗ page arXiv:2611.16299 ↗

We show that every finite simple cubic graph on $n$ vertices has total edge irregularity strength $n/2+1$, confirming the Ivančo-Jendrol' conjecture for cubic graphs. The key step is to algorithmically construct a $\{1,n/2+1\}$-vertex labeling such that half of the vertices are labeled $1$ and the average degree of the subgraph induced by them is close enough to two. We extend such a labeling to a total edge irregular $(n/2+1)$-labeling, possibly after a local adjustment to a single vertex.

comments
6 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.16338 ↗

We study subsets of finite Lee tori that minimize pair energy among sets of the same cardinality for every discretely completely monotone potential. At half occupancy on a product of even cycles, the two checkerboards minimize both total pair energy and maximum individual energy. They are the only minimizers for every nonconstant classical completely monotone potential on $(0,\infty)$, proving the checkerboard conjecture of Bouman, Draisma, and van Leeuwaarden for this class. At the independence number of the distance one graph on $\Z_q^n$, universally optimal sets exist exactly when $q$ is even, $q=3$, $n=1$, or $(q,n)=(5,2)$. In these cases they are precisely the maximum independent sets and form a single Lee isometry class. At density $1/5$ in $\Z_5^n$, $n\ge2$, universal optimality is characterized by a weighted count of pairs at distances one and two. We prove these results using integer box occupancy bounds that strengthen Fourier linear programming and, in the quinary case, Fourier certificates with a common zero set.

comments
30 pages
fields
Combinatorics, Information Theory
pdf ↗ page arXiv:2611.16377 ↗

Let $\mathcal{O}$ be a Dedekind domain, $\mathfrak{p}$ a prime ideal of residue order $q$, and $\mathcal{O}_r=\mathcal{O}/\mathfrak{p}^r$ which is a finite chain ring; the motivating example is $\mathbb{Z}/p^r$. The free projective geometry $\mathbb{P}^{d-1}_{fr}(\mathcal{O}_r)$ is the graph whose vertices are the nontrivial free submodules of $\mathcal{O}_r^{d}$, two of them adjacent when one strictly contains the other. For every $d$, $q$ and $r$ we reduce its adjacency matrix to explicit symmetric matrices (blocks) of size at most $d-1$. There is one block for each signature (a partition with at most $d/2$ parts, each at most $r$) and we show that every block, at every depth, is a single universal matrix $L(s,σ)$ evaluated at the number $s$ of parts of the signature $λ$ and at $σ=2rs-|λ|$. The same blocks give the spectrum of the subgraph induced on any set of levels, and for two levels this spectrum is completely explicit. All of it depends on the ring only through $q$ and $r$; in particular the subgraphs $\mathbb{P}^{d-1}_{S}$ over $\mathbb{Z}/p^r$ and over $\mathbb{F}_p[t]/(t^r)$ are isospectral for all $\varnothing\ne S\subseteq\{1,\dots,d-1\}$; together with known rigidity results of arXiv:2510.09324, this proves that they are isospectral and non-isomorphic whenever $S$ contains at least two levels, as conjectured there.

comments
24 pages
fields
Combinatorics, Group Theory, Representation Theory
pdf ↗ page arXiv:2611.16443 ↗

We study the zero-free chromatic polynomial $Z_Σ(q)$ of a signed graph $Σ$ and the characteristic polynomial $χ_Σ(q)=Z_Σ(q-1)$ of its associated hyperplane arrangement containing all coordinate hyperplanes. For a connected signed graph on $n\ge 2$ vertices with a balancing vertex, we prove the equivalence of the following four conditions: (i) $Z_Σ(q)$ is the chromatic polynomial of an ordinary graph; (ii) the numerator of $\sum_{q\ge 1}χ_Σ(q)t^q$, written with denominator $(1-t)^{n+1}$, has nonnegative coefficients; (iii) $Σ$ has a balanced block; and (iv) $χ_Σ(2)=0$. We also provide explicit counterexamples showing that neither the balancing-vertex assumption nor connectedness can be omitted.

comments
10 pages, 3 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.16458 ↗

Lazebnik-Ustimenko graphs $D(k,q)$ constitute a notable family of $q$-regular, edge-transitive bipartite graphs characterized by high symmetry and large girth, with wide applications in algebraic graph theory and coding theory. The precise girth of $D(k,q)$ is governed by a celebrated conjecture proposed by Füredi et al., which remains unresolved in general cases. Although prior works have validated this conjecture for several specific parameter regimes and established fundamental structural properties of graph girth, a systematic characterization of girth cycles for even-indexed subfamilies of \(D(k,q)\) is still absent. This paper focuses on the graph subclass $D(4s,q)$ and conducts structural analysis via its isomorphic bipartite model $Λ_{k,q}$. We derive an explicit necessary and sufficient condition for the existence of length-$(4s+4)$ backtrackless circuits in $Λ_{4s,q}$. Using this criterion, we completely characterize all girth cycles of $Λ_{8,q}$ and verify the Füredi-Lazebnik-Ustimenko girth conjecture for the parameter family $k=2(p^r+1)p^t-4$ over finite fields of odd characteristic $p\geq 3$ with $q=p^m>3$. The results further enrich the structural theory of symmetric large-girth bipartite graphs and extend the valid parameter range of this classic girth conjecture.

fields
Combinatorics
pdf ↗ page arXiv:2611.16470 ↗

We exploit two-dimensional dual polyhedra to study triangulated $3$-spheres and nuclei. First, we show that the long-standing open problem of whether the number of triangulated $3$-spheres is exponentially bounded is equivalent to the corresponding problem for one-vertex generalized triangulations, and hence also for special spines of the $3$-ball. This also establishes an equivalent counting problem for nuclei. Second, we investigate properties of nuclei, including their dual polyhedra. We also prove that every nontrivial nucleus contains a tetrahedron with six interior edges, identify the unique vertex-minimal nontrivial nucleus with $11$ vertices and $35$ tetrahedra, and construct nuclei whose dual graphs have genus growing linearly with the number of tetrahedra.

fields
Combinatorics
pdf ↗ page arXiv:2611.16518 ↗

A $BCK(p)$-term is a closed lambda-term in which each abstraction binds at most $p$ variables; for $p=1$ these terms are related to the axiom system BCK of combinatory logic. We determine the number of $BCK(p)$-terms of size $n$, up to a constant multiplicative factor, for every $p\ge2$. For $p=2$ the result is fully explicit: \[ f\_n\sim A\,n^{2n/5}2^{n/5}e^{-2n/5}n^{-3/5}e^{P(n^{1/5})}, \] where $P$ is an explicit polynomial of degree $4$. In general the asymptotic formula involves $n^{pn/(2p+1)}$ and an exponential of a polynomial in $n^{1/(2p+1)}$. The proof combines a linearization of the defining functional equation, the analysis of the Borel transform of the linearized generating function, which satisfies a linear differential equation with an irregular singularity at infinity, the saddle point method for Hayman-admissible functions, and positivity arguments comparing the original and the linearized sequences. For $p=1$ this comparison fails: the quadratic term then also changes the polynomial factor.

fields
Combinatorics
pdf ↗ page arXiv:2611.16554 ↗

For a graph with q edges, a graceful labeling assigns distinct integers from {0,...,q} its vertices so that the absolute differences across the edges are exactly 1,...,q. A Jahangir graph J_{n,m}, with n >= 2 and m >= 3, consists of an outer cycle on nm vertices and a hub joined to m equally spaced vertices of that cycle, with q = (n+1)m edges. This family of graphs is known to be graceful. In this paper we strengthen the gracefulness property of such graphs by assigning labels to their vertices through a parametric formula. These labeled graphs have a mono tonicity property: deleting an edge from the outer cycle leaves a path whose edge differences, in the negative orientation, are strictly increasing for even n and strictly decreasing for odd n. The starting observation is that large differences admit few endpoint pairs and require adjacencies between high and low labels. This suggests a construction based on alternating two separated label sets along the outer cycle. The formula has two parity branches, each with two cases modulo 4. Applications are given for every case.

fields
Combinatorics
pdf ↗ page arXiv:2611.16570 ↗

A proper vertex colouring is 2-homogeneous if every open neighbourhood contains exactly two colours. We show that every cubic bipartite graph admits a 2-homogeneous colouring with at most four colours, proving a conjecture of Janicová, Madaras, Soták and Lužar. For 3-connected det-extremal cubic bipartite graphs, we establish the stronger bound $χ_h^{(2)}(G) = 3$, showing that every such graph admits a fall 3-colouring.

comments
12 pages, 1 table
fields
Combinatorics
pdf ↗ page arXiv:2611.16649 ↗

We determine the exact Turán density of the $3$-uniform zycle $Z_\ell$ for every even integer $\ell\ge 4$ with $3\nmid\ell$, showing that $π(Z_\ell)=5/9$. More generally, we prove that $π(Z_\ell)\le 5/9$ for all even $\ell\ge 4$. In the range of equality, we also establish a stability theorem, showing that every almost extremal $Z_\ell$-free $3$-graph is close in edit distance to the classical Turán construction.

fields
Combinatorics
pdf ↗ page arXiv:2611.16654 ↗

We consider two distance-based concepts in rooted trees and compare them to their leaf-restricted counterparts. The path length is the sum of all distances from the root to the vertices of the tree, while the external path length is the sum of all distances from the root to the leaves of the tree. Upon dividing by the number of vertices and leaves respectively, we obtain the average distance to the root. The Wiener index is the sum of all distances between pairs of vertices, and the terminal Wiener index is the sum of all distances between pairs of leaves. Dividing by the number of pairs of vertices and pairs of leaves respectively, we obtain the average distance between vertices and average distance between leaves. For two important classes of random trees, we show that the average distance of the root to a random leaf is almost the same as the average distance to a random vertex and that the average distance between vertices is almost the same as the average distance between leaves. For Bienaymé–Galton–Watson trees, each of these differences is bounded in probability. For three varieties of increasing trees (recursive trees, $d$-ary increasing trees, generalised plane-oriented recursive trees), on the other hand, the differences converge to constants in probability. This allows the transfer of convergence results for the path length to the external path length, and results for the Wiener index to be transferred to the terminal Wiener index.

fields
Combinatorics, Probability
pdf ↗ page arXiv:2611.16674 ↗

We establish the first nontrivial upper bound on the number of edges of a Gomory corner polyhedron, resolving a long-standing open question. For an $n$-dimensional corner polyhedron associated with an integer lattice of determinant $δ$, the number of edges is at most $$ O\left(n6^n \cdot \bigl(1+\log_2(2δ)\bigr)^{2n-3}\right). $$ This improves the standard bound obtained by counting pairs of vertices, reducing the logarithmic exponent from $(2n-2)$ to $(2n-3)$.

fields
Combinatorics, Optimization and Control
pdf ↗ page arXiv:2611.16839 ↗

We study the interplay between two types of graph classes: the ones defined by intersections of geometric objects and the ones defined by the absence of a substructure. More precisely, we study intersection graphs that are grounded, that is, the objects lie above a horizontal line that they touch, and ordered graphs with forbidden patterns, that is, ordered graphs that avoid a set of ordered induced subgraphs. These two approaches are fundamentally different, but it is known that several interesting graph classes have both types of characterizations, and we aim to understand whether this is a general phenomenon. Our contributions are the following. First, we identify a family of patterns on four vertices and a natural hierarchy of intersection graphs of strings whose classes are nicely interleaved. This raises hopes to prove connections between the two perspectives. Second, we dampen these hopes by proving that a class of (ordered) intersection graphs that we study cannot be characterized by a finite set of forbidden patterns. Third, we show a dual impossibility result: there exists a pattern-defined class of our hierarchy that admits no intersection representation, if we require this representation to be closed under natural operations such as translation and scaling. However, it turns out that if we allow slightly more exotic intersection representations, then we can find one for this pattern-defined class.

fields
Combinatorics
pdf ↗ page arXiv:2611.16849 ↗

The support enumerator of a finite preorder counts lattice points of its polytope by support size. We prove Athanasiadis and Chapoton's conjecture that this polynomial is $γ$-positive. On an $n$-element preorder, the $j$th $γ$-coefficient counts points of the preorder polytope with entries in $\{0,1,2\}$, coordinate sum $n$, and exactly $j$ entries equal to $2$. Oh's correspondence for transversal matroids and Hall's theorem give a formula that records the support itself. For arbors, a separate proof gives a refinement by coordinate sum.

fields
Combinatorics
pdf ↗ page arXiv:2611.16858 ↗

In 2023, Fomin and Pylyavskyy introduced the master theorem to find and prove linear incidence theorems using quadrilateral tilings of oriented surfaces. Each face of the surface corresponds to an incidence condition, which they call a coherence condition. We extend their master theorem by incorporating polarity into coherence and allowing nonorientable surfaces. Our new coherence condition can be interpreted as perpendicularity from the perspective of Cayley–Klein geometry. Moreover, a polarity incidence theorem on a nonorientable tiled surface gives rise to a self-polar linear incidence theorem on the orientation double cover. We also extend the master theorem to Hermitian polarities over division rings, with its validity depending on the topology of the surface. Finally, we determine which incidence presentations admit proofs using tilings. When such proofs exist, we express the minimum Euler genus of the corresponding tiling in terms of the fundamental group.

fields
Combinatorics
pdf ↗ page arXiv:2611.16862 ↗

The $n$-omino fence problem asks how many cells can be surrounded by placing every $n$-omino exactly once in the grid. We present a new dynamic programming approach for this problem, allowing us to prove optimality for the pentomino and hexomino fence and to classify all possible pentomino orders by optimal area. For the first time we also provide strong heuristic solutions and upper bounds for all fences up to $n = 15$, after which we even approximate the $500$-omino fence with computational experiments. Finally, we generalize the problem to 3D, where we prove optimality for pentacubes and derive heuristic solutions for hexacubes and heptacubes.

comments
56 pages, 38 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.16883 ↗

We give a key polynomial of degree fourteen whose expansion in Demazure $t$-atoms has a coefficient with a negative term. This computation disproves the conjectured Demazure atom positivity of flagged LLT polynomials and the corresponding stable atom positivity assertion for modified nonsymmetric Macdonald polynomials.

comments
3 pages, comments welcome
fields
Combinatorics, Representation Theory
pdf ↗ page arXiv:2611.16899 ↗

Pairwise graph ``alignments'', usually defined as maximum common subgraphs, have been considered in many application domains, including the comparison of molecular structures. Most commonly, the problem is formulated as maximum common induced subgraph (MCIS) or maximum common edge subgraph (MCES) problems. Sometimes these formulations are restricted to connected common subgraphs. Common subgraph problems readily generalize to more than two input graphs. However, this concept is fundamentally distinct from the notion of multiple sequence alignments. Abstractly, alignments are defined as super-structures from which the individual input objects are recovered via structure-preserving projections. While the mathematical construction readily applies to common induced subgraphs, it does not fully encompass the common edge subgraph problem, which is the variant more commonly employed in cheminformatics applications. In order to consistently define multiple edge-based alignments of graphs we represent a graph $G$ as E-graph $(E,\mathscr{V})$, where $E$ is the edge set of $G$ and $\mathscr{V}$ is the set of sets of incident edges. This representation implicitly encodes the vertices in terms of edge data. Alignments of E-graphs are themselves E-graphs that contain the input (E-)graphs as subgraphs. Maximum edge subgraphs correspond to maximum induced sub-E-graphs, and they can thus be computed using a slightly modified version of the VF2 algorithm without the need to switch from graphs to line graphs. Furthermore, multiple alignments of (E-)graphs yield a natural definition of a consensus graph that is ``on average'' present in the input without having to be a subgraph of every (and in fact of any) input graph.

fields
Combinatorics
pdf ↗ page arXiv:2611.16901 ↗

An $r$-uniform loose triangle $C_3$ consists of three edges that intersect pairwise in exactly one vertex and have no vertex common to all three. For graphs, this is the usual triangle, and the Ramsey number $R(C_3,K_t)$ has order of magnitude $t^2/\log t$ by celebrated results of Ajtai, Komlós, and Szemerédi and of Kim. Kostochka, Mubayi, and Verstraëte proved that $R(C_3,K_t^{(r)})=O_r(t^{3/2})$ for every fixed $r\ge3$ and showed that this bound is sharp up to a logarithmic factor. Motivated by the logarithmic saving in the graph case, they conjectured in 2013 that the upper bound could be improved to $o(t^{3/2})$.This conjecture has since received significant attention and has been reiterated in several papers. We prove the conjecture by showing that, for every fixed $r\ge3$, \[ R(C_3,K_t^{(r)}) =O_r\left(\frac{t^{3/2}}{\sqrt{\log\log t}}\right). \]

comments
22 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.16957 ↗

Let $s\geq 1$, $r_1, r_2,\dots, r_{s+1}$ be given positive integers and $r=\max\{r_1, r_2,\ldots, r_{s+1}\}$. We prove that if $\mathcal{F} = \{\mathcal{F}_1, \ldots, \mathcal{F}_{s+1}\}$ is a family of hypergraphs on a ground set of $n$ vertices, $n\geq 4r^2(s+1)$, such that $\mathcal{F}_i\subseteq \binom{n}{r_i}$ and $|\mathcal{F}_i|>\binom{n}{r_i}-\binom{n-s}{r_i}-\binom{n-s-r}{r_i-1}+1$, for all $i \in [s+1]$, then $\mathcal{F}$ admits a rainbow matching of size $s+1$ or there exists $W \in \binom{[n]}{s}$ such that $W$ is a vertex cover of $\mathcal{F}_i$, for all $i \in [s+1]$. This improves upon the previously known range $n>2r^3s$ to $n>4r^2(s+1)$. Moreover, for a given family $\mathcal{F} = \{\mathcal{F}_1, \ldots, \mathcal{F}_{s+1}\}$ of hypergraphs $\mathcal{F}_i\subseteq \binom{n}{r_i}$, we give a best possible Ore-degree condition for $\mathcal{F}_{i}$'s that guarantees the existence of a rainbow matching of size $s+1$ for $\mathcal{F}$.

fields
Combinatorics
pdf ↗ page arXiv:2611.16970 ↗

Given a graph $G$ and an integer $k$, the reconfiguration graph $\mathcal{R}_{k}(G)$ has the proper $k$-colourings of $G$ for vertices, two of which are adjacent if and only if they differ on precisely one vertex of $G$. In $2022$, Cambie, Cranston and the author proved that the diameter of $\mathcal{R}_{Δ+2}(G)$ is at most $n+2μ$, and put forth a collection of conjectures that in its strongest and most beautiful form would imply that the diameter of $\mathcal{R}_{Δ+2}(G)$ is precisely equal to $n + μ$, for every graph $G$ with $n$ vertices, matching number $μ$ and maximum degree $Δ$. Here we disprove most of those conjectures. Our constructions have reconfiguration diameter at least $n+\frac{3}{2}μ-2$. We also provide counterexamples that are $Δ$-regular, we show that every graph has reconfiguration diameter at least $n+\frac{1}{2} μ$, and we advertise an extension to hypergraphs. It is now much more mysterious how the diameter behaves, so we propose a number of open problems.

comments
15 pages, 2 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.17022 ↗

We classify the lattice polytopes arising from vertex-weighted oriented graphs that have the integer decomposition property (IDP). Allowing vertex weights and edge orientations introduces non-vertex lattice points in the polytope which need to be accounted for when studying the IDP. We can then identify forbidden induced subgraphs in the sense that their presence obstructs the IDP for the supergraph. We establish positive results for several families of graphs under suitable orientation and coprimality conditions, including weighted oriented paths and cycles, and show that any weighted oriented tree with a unique sink has the IDP.

comments
8 figures
fields
Combinatorics, Commutative Algebra, Algebraic Geometry
pdf ↗ page arXiv:2611.17047 ↗

Commutative $B_\infty$-algebras provide a natural generalisation of the shuffle and quasi-shuffle algebras, giving deformations of the shuffle algebra. We introduce a Zinbiel analogue in $Z_\infty$-algebras, giving deformations of the half-shuffle Zinbiel algebra. All commutative $B_\infty$-algebras have been shown to be isomorphic to the shuffle algebra, though this isomorphism is not canonical. We show that all $Z_\infty$-algebras are canonically isomorphic to the half-shuffle algebra, which gives a canonical isomorphism to the shuffle algebra for $B_\infty$-algebras arising from $Z_\infty$-algebras. Finally, we explore which $B_\infty$-algebras can be ``Zinbielified'' to a $Z_\infty$-algebra, working through a number of explicit examples in the case of quasi-shuffle algebras and uncovering a very explicit classification of simple Zinbielifications via semigroup cocycles.

fields
Combinatorics
pdf ↗ page arXiv:2611.17133 ↗

We introduce a helicity functional of each order on graphs for real-valued edge forms, and give it a unified local Pfaffian realization. Motivated by the continuous energy inequality, we further construct a discrete version of helicity energy, and prove sharp Maclaurin inequalities for these energies. In particular, a special case of these Maclaurin inequalities yields a lower bound on the clique number, depending on the choice of edge form. As an application, we use this certificate to prove that every nonempty $d$-regular graph with smallest adjacency eigenvalue at least $-3$ satisfies $ω(G)\ge d\,g(η)-C$, where $C$ is an absolute constant and $g(η)$ is a rank-dependent coefficient taking values between $1/4$ and $1/3$. Building on the structural results of Koolen, Yang and Yang, this improves the known clique-number bound to the optimal leading constant $1/4$, whose asymptotic sharpness follows from Yang and Koolen's construction.

comments
43 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.17168 ↗

For a graph $G=(V,E)$, the boxicity $\operatorname{box}(G)$ is the least integer $d$ such that $G$ is the intersection graph of axis-parallel boxes in $\mathbb{R}^d$. The Kneser graph $K(n,k)$ is the graph whose vertex set corresponds to the family of $k$ sized subsets of an $n$ sized ground set, and a pair of vertices are adjacent if and only if the corresponding sets are disjoint. In this short paper, we provide new bounds for the boxicity of $K(n,k)$. We first show that for $k\ge 2$ and $n\ge 2k+1$, $\operatorname{box}(K(n,k))\ge n-2k$, thereby improving the lower bounds of Caoduro and Lichev [Discrete Mathematics 346(5):113333 (2023)] when $n\geq 3k+1$ and $k\ge 3$. The proof of this result uses the topological method and follows a strategy similar to Greene's proof of the Kneser's conjecture on the chromatic number of $K(n,k)$. We also show that for $k\ge 2$, $t\ge 1$ and $n=2k+t$, $\operatorname{box}(K(2k+t,k)) \leq O( t^3\log(2k+t) ).$ In particular, for every $t=t(k)\ge1$ with $t^3\log k=o(k)$, $\operatorname{box}(K(2k+t,k))=o(k)$. This is the first upper bound on the boxicity of $K(n,k)$ that is sublinear in $n$. We also show that for large enough $k$, $\operatorname{box}(K(2k+1,k))\le \frac{3\ln (2k+1)}{\ln\ln (2k+1)}$.

fields
Combinatorics
pdf ↗ page arXiv:2611.17183 ↗

For fixed $k\ge3$, we determine the first sublinear correction to the logarithm of the matching partition function for a class of $n$-vertex $d$-regular $k$-uniform hypergraphs, uniformly for activities in each fixed compact interval of $(0,\infty)$.Our hypotheses include every regular linear hypergraph of polynomial degree and a class of nonlinear hypergraphs described by higher codegrees and intersection patterns, which we introduce here. The weighted counting estimate implies an averaged version of Kahn's conjecture: under the uniform measure, the expected number of uncovered vertices is $(1+o(1))nd^{-1/k}$, with concentration and large deviations on this scale. The proof combines a novel variant of random greedy counting, based on short stages and regular completions, with a new entropy method that uses intersection patterns to control reconstruction after deleting matching edges. We highlight the following applications. (i) Partial transversals in Latin squares. Every Latin square of order $n$ has $(n/e^2)^n\exp((3+o(1))n^{2/3})$ partial transversals. Also, almost all partial transversals have $(1+o(1))n^{2/3}$ missing cells. (ii) Linear $3$-uniform hypergraphs. There are $(n/e^2)^{n^2/6}\exp((1/2+o(1))n^{5/3})$ linear $3$-uniform hypergraphs on $[n]$, and almost all have $n^2/6-(1/6+o(1))n^{5/3}$ edges. (iii) Matroids of fixed rank. For each fixed $r\ge4$, the number $m(n,r)$ of rank-$r$ matroids on $[n]$ satisfies $\log m(n,r)=\frac{n^{r-1}}{r!}(\log n-r+1)+\left(\frac1{(r-1)!}+o(1)\right)n^{r-1-1/r}$, refining the estimates of van der Hofstad, Pendavingh and van der Pol.

comments
67 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.17197 ↗

For $c>0$ let $f_c(n)$ be the largest size of a set $A\subseteq\{1,\dots,\lfloor cn\rfloor\}$ such that $n$ is not a sum of distinct elements of $A$. Erdős and Graham asked whether $f_c(n)$ depends on $n$ in an irregular way (Erdős Problem \#361). We prove that $f_c(n)=\lfloor cn\rfloor-\lceil n/2\rceil$ for $c\ge 1$, while for $0<c<1$ the ratio $f_c(n)/n$ has $\limsup$ equal to $c/2$, attained along odd $n$, and, along the integers $n$ whose least non-divisor equals a prime power $q$, tends to \[ \max\Bigl\{\frac cq,\; c-\frac12+\frac{1-c}{q}\Bigr\} \qquad\text{whenever } 2^{q-2}\min\{c,1-c\}\le 1 . \] Consequently $f_c(n)/n$ converges if and only if $c\ge1$; for $0<c<1$ it has at least two limit points, and arbitrarily many as $c\to0^+$ or $c\to1^-$. For $c=1/2$ the set of limit points is exactly $\{1/6,1/4\}$. The upper bounds follow from an inverse theorem of independent interest: if $s\ge1$, $q$ is the least positive integer not dividing $s$, and $\varepsilon>0$, then every $A\subseteq\{1,\dots,E\}$ with $|A|\ge E/q+\varepsilon T$ has a subset summing to $sT$, uniformly for all sufficiently large $T$ and all $E\le sT/2^{q-2}$. For $s=2$, this extends Alon's theorem on subsets of $\{1,\dots,N\}$ with no subset sum equal to $2N$. The results for $c\ge1$ and the $\limsup$, as well as the limits and the inverse theorem for $q\in\{2,3\}$, have been formalized and machine-checked in the Lean~4 proof assistant.

comments
16 pages, 1 figure, Lean verification
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2611.17205 ↗

We prove that any permutation $π\in S_n$ whose inversion graph is $k$-connected has at least $\frac{k+1}{2}n - C$ inversions, where $C$ depends only on $k$. In particular, inversion graphs beat the general lower bound $\frac{kn}{2}$ for the number of edges in a $k$-connected graph. Furthermore, we characterize the permutation patterns $σ$ having the property that if $π$ avoids $σ$, then the bound improves to $kn - C$. The collection of patterns is $\mathrm{Av}(321, 2341, 4123)$, and it is independent of $k \geq 2$. This work is motivated by a result of Linusson and Verkama (2025) that can be reinterpreted as stating that any $1324$-avoiding permutation whose inversion graph satisfies a certain weaker notion of $2$-connectivity must have at least $2n - C$ inversions. Our final result gives a characterization of the patterns having this stronger property.

comments
36 pages, 14 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.17237 ↗

Kalah is a classic two-player game in the mancala family of sowing games. Computers have solved several standard-size starting positions, but the complexity of the game on boards of growing size has remained open. We study the natural generalization in which the number of pits per side is part of the input and an arbitrary position is given, with the stone counts given in unary. We show that deciding whether a designated player can force a win from such a position is PSPACE-complete. The hard positions have Alice to move first and both stores initially empty. The same positions are hard under either common convention for capture opposite an empty pit, and with or without the bonus rule, which gives a player another turn when the last stone is sown into their own store. We introduce Line Kalah as an intermediate problem, a game on a line in which stones that leave the line effectively disappear and Alice must save each of her target pits before Bob captures it, and we reduce quantified Boolean formulas to it. The reduction uses a set of sequential timer piles whose last stones approach a group of targets, forcing Alice to choose between two captures in order to set the truth value of a variable, and a final capture gadget to test a clause chosen by Bob (only one is needed adversarially). Since either player may move any pile at any time, the stages are placed so that premature timer firings protect earlier potential targets. For a true formula, Alice's strategy against arbitrary opposing play either gains enough time to save the remaining targets (after Bob deviates from the intended play) or reaches the final test with a correctly encoded, protected input. Finally, the line positions are embedded in Kalah with both stores empty. A separate Bob pit holds the score adjustment, so the winner takes a strict majority of the stones.

comments
55 pages, 6 figures, 5 tables
fields
Combinatorics
pdf ↗ page arXiv:2611.17252 ↗

We study upper bounds for the triameter of a connected graph in terms of distance packings and vertex connectivity. For any positive integer $k$, we bound the triameter of a graph by a linear function of its $k$-packing number and show that this bound is tight for all values of the parameters. As a corollary, we confirm the conjecture of Das and Abdioğlu on the upper bound for the triameter in terms of the order and the minimum degree of a graph. We also find the maximum triameter among graphs with given order and vertex connectivity, and describe the extremal graphs. Our main tool is a projection of a graph onto a spider or a unicyclic graph which preserves the distances between three prescribed vertices.

comments
Preliminary version, any comments are welcome
fields
Combinatorics
pdf ↗ page arXiv:2611.17259 ↗

We prove a three-ends incidence estimate whose multiplicity exponent is sharp for one-dimensional Katz-Tao point sets.} At the heart of the argument lies rectangular non-concentration and its incidence theory introduced earlier by the authors. As an application, we obtain a strong quantitative bound on the number of approximate rectangles with the vertices belonging to four separated camps, each retaining a non-concentration condition.

fields
Combinatorics, Classical Analysis and ODEs
pdf ↗ page arXiv:2611.17293 ↗

Optimization and Control65

Reinforcement-learning portfolio policies can optimize allocations from prices, covariances, and prior positions, yet they lack a calibrated, replayable mechanism for certifying that a proposed allocation respects a bounded risk envelope before execution. Regulators increasingly expect automated portfolio systems to provide exactly this kind of pre-trade audit trail, interpretable risk limit, and human-oversight mechanism. Gated Conformal Semantic Risk Control addresses this gap by separating return-seeking allocation from text-conditioned downside-risk verification. An instruction-tuned language model maps timestamped disclosures into schema-validated semantic risk states over macro, liquidity, earnings, and sector channels. These states induce correlated ellipsoidal factor-shock uncertainty sets whose conformal radii are calibrated by rolling finite-sample prediction over localized semantic nonconformity buckets. An asymmetric second-order cone gate then checks each raw PPO proposal against a certified worst-case semantic loss budget. The gate stays inactive for compliant proposals and intervenes only when that budget is exceeded. In walk-forward out-of-sample tests on nine liquid U.S. Select Sector SPDR ETFs, Raw PPO earns a 12.7% annual return while incurring a 4.05% semantic violation rate. Gated-CSRC removes all observed out-of-sample semantic limit breaches while retaining an 11.7% annual return. This 100-basis-point auditable safety premium is smaller than the yield loss imposed by unconditional hard projection, and exact McNemar testing confirms the compliance gain at $p < 10^{-15}$. Loughran-McDonald lexicon controls and time-shuffled text controls fail to reproduce this certificate.

comments
26 pages, 5 figures, 10 tables. Submitted to Annals of Operations Research
fields
Optimization and Control
pdf ↗ page arXiv:2611.14699 ↗

Internal model principle-based controllers regulate polynomial references and disturbances exactly, but only asymptotically, and their transient input can peak and oscillate, increasingly so as the degree of the exogenous signals grows. A filter placed in series with the plant smooths the command but alters the closed-loop spectrum and can destroy stability. We propose an architecture that keeps the filter outside the loop the regulator stabilizes: the internal model is driven by the error of an ideal, unfiltered copy of the plant, the physical plant receives the filtered command, and an auxiliary plant copy absorbs the mismatch between the two inputs. If the filter satisfies blocking conditions at the origin, any gains that stabilize the unfiltered loop can be combined with any such filter without losing regulation of the true error. Under additive plant uncertainty, we derive a small-gain condition that guarantees robust stability and regulation. On a scalar plant, the proposed controller produces a smoother input and a larger input-delay margin than the unfiltered one, and it maintains regulation under a large loss of actuator effectiveness. On a three-mass chain, its tolerance to unmodeled actuator dynamics and delay stays essentially constant as the regulator is made more aggressive.

fields
Optimization and Control
pdf ↗ page arXiv:2611.14715 ↗

We develop the compactness–uniqueness method for the null controllability of abstract linear control systems on Banach spaces. Our first main result characterizes the null controllable states for systems that are null controllable up to finite dimensional spaces, and shows that null controllability is then equivalent to the Fattorini–Hautus test. Our second main result gives a dual counterpart of this assumption, an observability inequality with a suitable compact remainder. These results unify and extend several known results, such as those on heat equations with nonlocal terms and on the simultaneous controllability of systems. Finally, for a transport equation with nonlocal terms from population dynamics, we characterize the null controllable states after a sharp time, including in the non-reflexive space $L^1$.

fields
Optimization and Control
pdf ↗ page arXiv:2611.14790 ↗

BEST-RQ, based on random projection and quantization, has been a well-established self-supervised learning approach to learn speech representations from large-scale unlabeled audio due to its high performance and efficiency. However, in BEST-RQ representations learned by random quantization can be sensitive to the choice of quantization targets. To address this issue, we propose a distributionally robust extension of BEST-RQ that seeks representations robust across multiple quantization configurations. Specifically, we define groups by codebooks and formulate the training as a group Distributionally Robust Optimization (DRO) problem. Rather than optimizing solely for the average loss across groups, our approach adaptively reweights groups to emphasize those performing poorly. Additionally, we regularize DRO with a Kullback-Leibler divergence to prevent excessive distribution deviation. We evaluate our approach on the Multilingual LibriSpeech dataset and show that the distributionally robust BEST-RQ achieves superior performance over the conventional uniform average across multiple codebooks.

fields
Optimization and Control
pdf ↗ page arXiv:2611.14801 ↗

In this work, we study last-iterate convergence bounds for stochastic gradient descent (SGD) on convex and $β$-smooth loss functions and improve the bound from $\cO((\log T)^3/T)$ to $\cO((\log T)^3/(T\log\log T))$ in the interpolation regime. The improvement comes from applying a horizon-dependent multiscale estimate of gradients to the comparison of trajectories. The bound applies to both sampling with replacement and sampling without replacement within one pass.

fields
Optimization and Control
pdf ↗ page arXiv:2611.14811 ↗

In 1965, Bregman proved that the sequence of iterates of the method of alternating projections applied to two closed convex sets with nonempty intersection in a Hilbert space converges weakly to a point in the intersection. The question whether this convergence may actually fail to be strong was settled in a seminal paper by Hundal in 2004. He provided a counterexample featuring a halfspace and a closed convex cone generated by a certain curve. While largely elementary, the details of Hundal's construction and analysis are quite involved. We revisit this seminal example and present a family of such examples that allows for simpler proofs. Our generating curve combines unit vectors with Gaussian inner products and a height determined by a scalar function. The orbits converge weakly --- but not strongly --- to the origin, while their norms have a positive limit for which we give explicit lower bounds. We also prove that the associated Cesàro means behave likewise; in fact, this is generalized to alternating proximal mappings whose composition has a fixed point. Finally, these orbits allow interpretations in the context of projected-gradient, proximal-point, and gradient-descent algorithms.

fields
Optimization and Control
pdf ↗ page arXiv:2611.14829 ↗

Lenstra showed that mixed-integer linear programming can be solved in polynomial time when the number of integer variables is fixed and the number of continuous variables is arbitrary. Mixed-integer quadratic programming (MIQP) can be solved in polynomial time when the total number of variables is fixed. However, since MIQP is NP-hard already without integer variables, the analog of Lenstra's result fails unless P = NP. Hence, polynomial-time algorithms for MIQP with an arbitrary number of continuous variables must exploit additional structure. We study MIQPs with two-stage structure, which underlies Benders decomposition and two-stage stochastic programming. A few linking variables, including all integer variables, are coupled with many blocks of continuous variables that interact only through them, both in the constraints and in the objective. We give a polynomial-time algorithm for MIQP with an arbitrary quadratic objective when the number of linking variables and the block size are fixed, while the number of blocks, and hence the number of variables, is arbitrary. The case with no blocks is MIQP in fixed dimension. None of our assumptions can be dropped. Unless P = NP, the number of linking variables and the block size must both be fixed, the blocks cannot interact or contain integer variables, and large blocks cannot be allowed even if their objective is linear. Unless FPT = W[1], the exponent of the running time must depend on both the number of linking variables and the block size.

fields
Optimization and Control
pdf ↗ page arXiv:2611.14837 ↗

Training deep feedforward networks with weight matrices constrained to layer-wise Stiefel manifolds serves as an effective regularization technique to improve generalization. However, the simultaneous presence of orthogonality constraints and nonsmooth activation functions poses severe theoretical and computational challenges for standard stochastic gradient and Riemannian optimization methods. In this paper, we propose two splitting and alternating-based algorithms to train orthogonal deep feedforward networks (OrthDFNs). By introducing auxiliary variables, we decouple the nested nonsmooth compositions and manifold constraints into a structured equality-constrained optimization problem. To solve this model, we develop OrthALM, an inexact augmented Lagrangian method (ALM) that employs a proximal alternating minimization scheme to solve its subproblems. Crucially, every block coordinate subproblem admits an exact, closed-form solution. We establish a rigorous convergence theory for OrthALM, proving that every accumulation point of the generated sequence is a Karush–Kuhn–Tucker (KKT) point of the regularized, reformulated problem. Furthermore, we introduce OrthADMM as a practical, proximal-free variant that executes a single inner alternating sweep per multiplier update to accelerate computation. Extensive numerical experiments show that OrthALM attains lower training error and constraint residuals than OrthADMM in most configurations. OrthADMM achieves competitive test accuracy and the lowest reported runtime in most comparisons with the selected baselines.

comments
43 pages, 4 figures, 5 tables
fields
Optimization and Control
pdf ↗ page arXiv:2611.14855 ↗

Semidefinite complementarity constraints arise in applications such as inverse semidefinite programming and rank-constrained matrix optimization. We develop a structure-preserving augmented Lagrangian method (SPALM) for mathematical programs with these constraints. The method augments the smooth constraints and retains matrix complementarity in its subproblems. We handle these subproblems by an inexact proximal alternating framework with verifiable descent and stationarity conditions. With vanishing absolute subproblem errors, feasible accumulation points of infinite outer sequences are asymptotically M-stationary. Under AM-regularity, these points are M-stationary. We prove that active-set SDCMPCC-LICQ is sufficient for this regularity. For each AL subproblem, the full stationarity residual converges to zero along infinite accepted inner sequences if the initial sublevel set is bounded, the proximal parameters are bounded above and away from zero, and the block errors vanish. If the block errors are also square-summable, an $O(T^{-1/2})$ best-residual bound holds over $T$ accepted iterations. Huber-Stiefel and fixed-basis procedures generate feasible matrix candidates, whose acceptance is verified by descent tests and computable limiting-normal certificates. For rank-constrained correlation matrix approximation, we construct a lifting that preserves the projected feasible set and global optimal value and satisfies active-set SDCMPCC-LICQ at every feasible point. The stationarity guarantees apply to this lifted model. Finite-budget experiments on this lifting and a single-equality observation-fitting inverse SDP meet the prescribed numerical feasibility and stationarity tests in all 120 runs.

comments
38 pages, 2 figures, 2 tables
fields
Optimization and Control
pdf ↗ page arXiv:2611.14885 ↗

Q-learning has been empirically observed to exhibit substantial transient error. This transient remains uncaptured by the leading Gaussian limit because the central-limit normalization removes the smaller-scale displacement generated by the initial nonlinear evolution. On the other hand, worst-case finite-sample guarantees, while accounting for transient effects, can obscure the mechanisms responsible for the error on a particular problem instance. We develop a finer asymptotic analysis that gives an asymptotically exact characterization of this transient for a fixed instance. Specifically, for synchronous Q-learning in finite discounted Markov decision processes, we separate the last-iterate error into an optimal-policy temporal-difference (TD) component and a nonnegative displacement caused by maximization. The centered TD component has Gaussian fluctuations at scale $n^{-1/2}$, whereas the maximization transient is of order $n^{-1}$ and converges almost surely, after rescaling by $n$, to a random limit. This limit represents the propagated effect of maximization errors generated before the greedy policy stabilizes. We combine this characterization with an Edgeworth expansion of the TD component to identify the corrections to its Gaussian approximation, separating the effects of initialization, non-Gaussian TD fluctuations, and maximization. The results reveal how transient errors arise for individual Q-learning instances and how their effects persist below the central-limit scale.

fields
Optimization and Control
pdf ↗ page arXiv:2611.14926 ↗

We study efficient robust estimation of a high-dimensional mean under strong contamination when the clean distribution has only $p\ge2$ moments, bounded by $ν_p$. We give a unified proof of stability for every $p\ge2$ with the optimal dimension-free sub-Gaussian rate, linking the reweighting, trimming and truncation techniques of the outlier and heavy-tailed robust literatures through concentration of counting and truncation processes. Building on stability and spectral signatures, we quantify the optimization landscape over sample weights that remove at most a fraction $\varepsilon_{n,k}=k/n$ of the mass, where the trimming parameter $k$ slightly exceeds the number of outliers. An unobserved convex spectral loss has inexact quadratic growth, with curvature $\frac{1-\varepsilon_{n,k}}{\varepsilon_{n,k}}$, relative to a mean-induced Bregman divergence, and the observable spectral loss supplies a dimension-free, inexact, relatively weakly star-convex subgradient oracle for it. This yields a Lyapunov analysis of mirror descent reweighting for $\varepsilon_{n,k}<\frac13$ that covers Hedge, the projected subgradient method, a new mean-induced mirror descent, and a centered multiplicative weights update. Each method uses one top-eigenvector computation per step and attains the optimal sub-Gaussian rate without knowledge of $(p,ν_p)$. Mean-induced mirror descent further achieves faster optimization rates and last-iterate guarantees, at the cost of a more expensive projection step in higher dimensions.

comments
4 figures
fields
Optimization and Control, Statistics Theory
pdf ↗ page arXiv:2611.14966 ↗

We present RPX, an independent certificate checker for AI-generated reformulations of mixed-integer linear programs (MILPs). RPX verifies that every feasible solution of either the original or the reformulated model can be converted into a feasible solution of the other with no worse objective value. This guarantees equal optimal values and enables solution recovery in the original variables. The checker derives the required checks directly from both models and verifies the certificate using exact arithmetic and reusable reconstruction rules. RPX certifies an agent-generated reformulation for each of the 240 instances in MIPLIB 2017 Benchmark v2. The source models contain up to 27.3 million matrix nonzeros. The median time to decode and check a certificate is 0.312 s, with a 95th percentile of 10.1 s.

fields
Optimization and Control
pdf ↗ page arXiv:2611.15035 ↗

The Frank-Wolfe theorem states that a quadratic function bounded from below on a polyhedron attains its infimum. We study when this remains true in the presence of integer variables, for sets defined by quadratic inequalities. Our main result is a complete classification for sets defined by convex quadratic inequalities with rational coefficients and a rational affine hull, a condition that holds for all full- dimensional sets. One integer variable never destroys attainment: if every rational quadratic objective that is bounded from below attains its infimum over the set, even after adding rational linear constraints, the same holds with one integer variable. In dimension at most 2, integer variables never destroy attainment. In dimension at least 3 and with two or more integer variables, attainment holds for every such objective if and only if the set has bounded curvature, that is, it is bounded except along directions in which all constraints are linear. Without convexity, these results remain valid, except that bounded curvature is no longer necessary. Moreover, integer variables can destroy attainment only if there are at least two of them and at least one continuous variable. The result for one integer variable follows from a lifting theorem, which also extends known results for cubic objectives and convex polynomial constraints. Finally, for convex constraints and rational data, attainment holds when the objective is bounded from above, convex, or quasi-convex over a full-dimensional convex set containing the feasible region.

comments
24 pages, 1 figure, Submitted to IPCO 2027
fields
Optimization and Control
pdf ↗ page arXiv:2611.15055 ↗

This paper develops a relative-energy control approach for a boundary-controlled irreversible port-Hamiltonian model of a non-isothermal tubular reactor around a spatially nonuniform stationary profile. The starting point is a thermodynamic duality between the entropy-based availability used in earlier reactor control and the relative Hamiltonian induced by the irreversible port-Hamiltonian representation. Under physically interpretable stability conditions—positive heat capacity, positive compressibility and positive compositional susceptibility—the Hamiltonian density is shown to be strictly convex, while the corresponding entropy representation is strictly concave. The resulting relative Hamiltonian decomposes into kinetic, compressive, thermal and mixing contributions and yields an exact relative-energy balance in which irreversible dissipation is separated from profile-dependent terms. This structure leads to a bounded monotone distributed jacket feedback that injects thermal damping without cancelling the nonlinear PDE dynamics. A continuous coercivity condition gives a local a-priori decay estimate for sufficiently regular nonlinear solutions, while a composite energy functional provides an exponential estimate for the linearized closed-loop initial-boundary value problem. Structure-preserving PFEM simulations are used to verify the predicted dissipation mechanisms and constrained profile regulation.

fields
Optimization and Control
pdf ↗ page arXiv:2611.15088 ↗

Exploiting the rich dynamics of wrapped weighted shifts and their residualizations, we characterize exact projected steering with vanishing initial controls. For wrapped shifts, steering is characterized by an expansive cycle multiplier and a residue separating the source and control channels. For residual shifts, a distinct spectral–toral mechanism emerges: steering through selected conjugate planes is equivalent to radial expansion and an arithmetic parity condition on phase resonances, yielding bounded-gap steering times and quantitative control estimates. For structured machine-learning representations built from orbit dictionaries, we derive a two-scale gain condition for steering coefficients while preserving decoded outputs.

fields
Optimization and Control
pdf ↗ page arXiv:2611.15098 ↗

We propose a projected subgradient method for solving quasiconvex minimization problems. By employing the Clarke subdifferential, we prove that the sequence generated by the proposed algorithm converges to a solution of the minimization problem when the objective function is locally Lipschitz continuous and strongly quasiconvex in the sense of Polyak, under the same assumptions required for convex functions with the convex subdifferential. Moreover, we derive explicit convergence rate estimates for both the iterates and objective function values. In particular, compared with the corresponding results for nonsmooth, locally Lipschitz, strongly convex optimization, our analysis replaces strong convexity with strong quasiconvexity while preserving the order of the convergence rate, thereby extending the guarantees to a class of possibly nonconvex objective functions. In addition, we investigate a stochastic finite-difference scheme for minimizing a strongly quasiconvex function subject to inequality constraints defined by strongly quasiconvex functions, and establish a convergence rate of order $O(k^{-1/4})$, consistent with known complexity bounds for stochastic zeroth-order methods.

fields
Optimization and Control
pdf ↗ page arXiv:2611.15144 ↗

Introduced by Solodov and Svaiter \cite{SS}, star monotone operators have repeatedly appeared as a sufficient condition ensuring global convergence of first-order algorithms, without requiring full monotonicity. Yet, despite this recurring role, a systematic study of the class itself has been missing from the literature. This paper fills that gap with the first comprehensive treatment of star monotone operators, a class that strictly encompasses monotone and pseudomonotone operators with nonempty zero sets, together with operators that are strongly quasimonotone along rays and satisfy a radial nondegeneracy condition. We develop basic calculus rules, existence and uniqueness results for zeros, global metric subregularity, and precise structural relationships with classical monotonicity notions. We further demonstrate the versatility of star monotonicity through a Clarke subdifferential characterization of nonsmooth star quasiconvexity, applications to Minty and Stampacchia variational inequalities, linear convergence guarantees for subgradient-type methods, and separable operators related to the Debreu–Koopmans problem.

fields
Optimization and Control
pdf ↗ page arXiv:2611.15151 ↗

Potential-based flow problems arise for a range of practical problems, like the operation of lossless power networks. The distribution of flows through the network is governed by the potential equation, which relates arc flows and node potentials following arc potential functions. We consider a general variant with affine potential functions, topology switching, and scenarios. It can be solved using a Benders decomposition algorithm, with each scenario corresponding to a subproblem. Subproblem solving time can then significantly contribute to overall running time. We present a fast algorithm to obtain Benders optimality and feasibility cuts from fixed master solutions. Problems with affine potential functions are reduced to equivalent problems where every potential function is the identity function. Optimal primal and dual solutions as well as unbounded dual rays are determined by systems of linear equations (SLE), resulting in a constant number of SLEs solved per subproblem. SLEs are solved using LU-factorizations, with the similarity between primal and dual, scenarios, and master solutions exploited by reusing factorizations via low-rank updates to significantly reduce theoretical complexity. We demonstrate the method on security-constrained optimal transmission switching instances, where subproblem solve time reductions of 97.98 percent compared to a standard LP solver are observed.

comments
35 pages, 7 figures, 1 table, 2 algorithms
fields
Optimization and Control
pdf ↗ page arXiv:2611.15203 ↗

Computing the $L_\infty$-norm of a time-invariant linear ordinary differential control system is a routine task in robust control, usually delegated to floating-point routines that perform well on most practical systems. Behind the numerical value, however, lies a discrete decision: whether a pole lies on the imaginary axis, and whether a mode of a realization is actually a pole of the transfer matrix. Floating-point arithmetic can only replace this decision with a tolerance. This paper explains, for a control audience, what reliable symbolic-numeric computation offers for this problem: exact arithmetic where a decision has to be made, and certified enclosures where a value has to be computed. We show how the problem is turned into a small polynomial system directly from state-space data, how this system is solved in practice, and what it costs. A benchmark on the {\tt COMPleib} library and on families of systems with known norms shows that two standard numerical routines err in opposite directions on the imaginary-axis decision, and never on the same system, while the certified method decides it correctly on every instance tested and computes the norm at a cost comparable to that of the numerical routines on most systems. We conclude with practical guidelines for users of numerical tools.

comments
6 pages, 1 table. Submitted to the European Control Conference (ECC 2027)
fields
Optimization and Control
pdf ↗ page arXiv:2611.15258 ↗

Hyperparameter transfer across model depth is instrumental in training deep models, as it enables learning rates calibrated on shallow networks to be effectively applied to deeper architectures. The recent CompleteP framework establishes a $1/L$ residual scaling rule that demonstrates this for Adam-family optimizers. We study whether similar transfer extends to constrained optimization methods, specifically Frank-Wolfe and projected non-Euclidean normalized steepest descent, where updates are determined by linear minimization oracles. We derive scaling rules for these methods which confirm that the $1/L$ residual scaling applies, although the arguments differ from the Adam-family optimizers. Our analysis supports depth-wise transfer and width-wise transfer of the learning rate for the Scion algorithm while ensuring feature learning and avoiding the kernel-regime. In experiments on NLP transformers (nanoGPT on FineWeb), vision transformers (DeiT on ImageNet), and vision MLPs (MLP-Mixer on CIFAR-10), we observe learning rate transfer across depth and feature learning for appropriately chosen residual scaling.

journal
Transactions on Machine Learning Research (10/2026)
fields
Optimization and Control
pdf ↗ page arXiv:2611.15291 ↗

We address the problem of designing time-varying feedback controls that stabilize a given equilibrium of a nonholonomic system at a faster than the exponential rate. We consider systems with an arbitrary degree of nonholonomy and prove a theorem on practical hyperexponential stabilization under a suitable assumption on the parameterized dither signals. The convergence proof is based on a comparison equation with a prescribed power of logarithmic terms. We apply this result to stabilize a model of a car with two off-hooked trailers.

comments
Submitted to the European Control Conference (ECC 2027)
fields
Optimization and Control
pdf ↗ page arXiv:2611.15324 ↗

We study a stylized single-vehicle replenishment-routing problem in which the cities of a national logistics network are both demand points and supply points: a vehicle of limited capacity delivers to every city once, and when its load is insufficient for the next city it must detour to a city already served that can still supply goods. A 100-node benchmark is built from Korean population and geographic data, with the cities divided into 10 levels; the per-visit supply coefficient and the allowed number of stops decrease geometrically with the level. Building on matrix-based ant colony optimization, we keep the states of the whole colony in arrays, couple route construction with a fixed greedy replenishment-decoding policy, and evaluate the candidate moves of a local search in batches. With frozen parameters and 30 runs on seeds never used for tuning, the matrix-based ant colony search with the batch local search (MACO) reaches a mean total distance of 3081.7 km; a genetic algorithm equipped with the same local search at the same frequency reaches 3074.9 km (no significant difference), and a MAX-MIN ant system with the same local search 3142.2 km. Ablation identifies the batch local search as the main contributor to solution quality; a load-aware transition factor gives no significant gain. Within the parameter ranges tested, raising the supply coefficients of the cities below the top level shortens the route more than relaxing the stop limits, which are not binding here.

comments
9 pages, 6 figures, 4 tables; code, data and raw records in the ancillary files
fields
Optimization and Control
pdf ↗ page arXiv:2611.15338 ↗

Understanding the equilibrium behavior of large populations of interacting agents in transportation systems is challenging due to the high-dimensional state space and the coupled decision-making among agents. This study proposes the Markov population potential game (MPPG) that integrates Markov games, potential games, and population games as a unified framework for analyzing such interactions. The framework extends the classical Markov potential game to the population level and establishes theoretical conditions on stage rewards and state transitions under which the Markov population game admits a Beckmann-type potential function. Accordingly, every KKT point of the associated optimization problem yields an MPPG equilibrium. We further demonstrate that if only the reward condition holds, each KKT point of the optimization problem corresponds to a support-restricted $\varepsilon$-equilibrium, meaning the Q-values of any two active actions differ by at most $\varepsilon$, thereby significantly extending the applicability of MPPG. We further establish both priori and posteriori upper bounds of $\varepsilon$ to efficiently evaluate the approximation error. Inspired by the equivalent optimization problem, a projected-gradient (PG) policy iteration algorithm is developed. The theoretical bounds and PG algorithm are demonstrated through numerical experiments on a parametric Markov population game.

fields
Optimization and Control
pdf ↗ page arXiv:2611.15482 ↗

We study the convexification of mixed-integer quadratic optimization with indicator variables. The problem remains NP-hard even when the quadratic matrix has bandwidth two, posing a fundamental obstacle to tractable exact convexification. To overcome this challenge in realistic settings, we introduce probabilistically exact (inner) convexification, a framework that relaxes the requirement of exactness for every objective while preserving exact optimality for statistically relevant ones. Our approach is motivated by inference applications, where the objective is determined by a data vector drawn from a distribution and a regularization vector chosen from a prescribed family. Our convexification preserves the exactness of the optimal value with high probability over the data distribution, simultaneously for every regularization vector in this family. We apply this notion to quadratic matrices of any fixed bandwidth. Despite their worst-case NP-hardness, we construct probabilistically exact convexifications that admit exact extended second-order cone formulations of size polynomial in the dimension $n$ and the inverse failure probability $1/δ$. The required assumptions for their high-probability exactness are surprisingly mild: they accommodate both light-tailed and heavy-tailed data, including distributions without finite mean, as well as arbitrary nonnegative regularization coefficients.

fields
Optimization and Control
pdf ↗ page arXiv:2611.15492 ↗

The Abelian sandpile model is a classical framework for studying large cascading events, such as those arising in models of forest fires and earthquakes. This work studies the control of such avalanches through the targeted removal of sand grains. We formulate this sequential control problem as an average-cost Markov decision process in which, before each grain addition, a controller may remove a sand grain from a selected vertex. The objective is to balance the long-run expected avalanche size against the cost of intervention. We analyze local intervention policies, which remove grains from a prescribed set of vertices whenever possible, and establish structural results for the recurrent classes and stationary distributions of the induced Markov chains. When the intervention set satisfies a property called topple-freeness, we sharpen these results, derive expressions for the gain and bias functions, and give necessary and sufficient conditions for optimality on general finite graphs. Finally, we apply the general theory to several specific graph classes and obtain a complete characterization of optimal policies on the one-dimensional lattice, the complete graph and the star graph for every value of the intervention cost.

fields
Optimization and Control, Mathematical Physics, Probability
pdf ↗ page arXiv:2611.15549 ↗

In this paper we consider the problem of constructing a portfolio composed of a set of financial options. We present a mixed-integer linear program. We apply our approach to index options for the S&P 500.

fields
Optimization and Control
pdf ↗ page arXiv:2611.15553 ↗

Evolutionary algorithms (EAs) evaluate many candidate solutions but use them mainly to rank individuals. This paper treats the evaluated solutions as the spot heights of a topographic survey and draws the contour lines they imply. The contour map decomposes the evaluated region into peaks: in two dimensions a contour tree with persistence separates significant peaks from interpolation ripples, and in more dimensions hill climbing on the interpolated surface locates the peaks and ray-cast level sets describe them. A memory of the explored peaks directs the search to new ones. The data-supported contours of each peak are extrapolated to zero size by an area law, exact for quadratic peaks and second-order accurate for smooth ones, that estimates a peak's location, height and shape before it is sampled. A contour-assisted EA (CA-EA) inserts contour steps with local search and peak memory into a genetic algorithm (GA), differential evolution or particle swarm optimization. A contour-assisted surrogate-assisted EA (CA-SAEA), for expensive problems, spends each evaluation on surrogate-screened offspring or on sampling around a peak, entered at the maximum of the interpolated surface. On 2-D benchmarks, CA-EA reduces the evaluations a plain GA needs by factors of 12 to 112; controls attribute its gain over classical memetic search to restarting local search on distinct peaks. On the CEC 2015 expensive suite in 10 and 30 dimensions, CA-SAEA has the second-best average rank, behind DYCORS and ahead of lq-CMA-ES and the competition winner MVMO, although in 30 dimensions MVMO wins significantly on 9 functions and loses on 6; there the map beats sampling around the best point on 5 of 15 functions and loses on 3. Entering the peaks at their extrapolated locations brought no gain at these budgets, although, with enough samples, it improves the estimated heights on most two-dimensional functions.

comments
15 pages; supplementary material (10 pages) is provided as an ancillary file
fields
Optimization and Control
pdf ↗ page arXiv:2611.15641 ↗

Power system operations rely on approximate solutions of the AC optimal power flow problem, most notably the DC optimal power flow used in security-constrained unit commitment and economic dispatch, while convex relaxations, machine learning surrogates, and other approximations are studied extensively in the academic literature. Because these approximations neglect or relax parts of the AC power flow equations, their solutions must be adjusted before dispatch; for example, the DC optimal power flow, which neglects transmission losses, reactive power, and voltage magnitude variations, is known to produce solutions that are always infeasible. The cost of this adjustment is not adequately understood. This paper proposes a method that quantifies, for any approximate solution, the minimum cost of the adjustments that restore AC feasibility, which is a lower bound on the cost of the heuristic adjustments used in practice. We apply it to the DC optimal power flow, the second-order cone and quadratic convex relaxations, and the AC optimal power flow solved to a loose relative tolerance of $10^{-4}$ instead of $10^{-8}$. Relative to the AC optimal power flow solution obtained from a local nonlinear optimization solver, and even with the minimum adjustment, the DC optimal power flow requires adjusting, on average, generators that account for 15.6% of total generation capacity and incurs a 1.10% cost increase; the convex relaxations require more adjustment (17.2% and 16.9%) but smaller cost increases (0.68% and 0.78%); and the loose-tolerance AC optimal power flow requires 6.1% and incurs 0.42%. These results indicate significant value in operating markets directly on the AC optimal power flow, which avoids the distortion of the dispatch and prices caused by heuristic feasibility restoration.

comments
5 pages, 4 figures, submitted to 2027 IEEE Power & Energy Society General Meeting
fields
Optimization and Control
pdf ↗ page arXiv:2611.15706 ↗

We consider the convex hull of the quadratic lift $(x,xx^\top,y)$ of the set $\{(x,y) \mid 0 \le x \le y,\ y \in \{0,1\}^n \}$. Descriptions of this convex hull provide convex relaxations for quadratic optimization with switching variables, including problems with indefinite quadratic objectives and constraints. For $n=2$, we completely characterize the extreme rays of the corresponding cone of nonnegative quadratic functions, which consists of two switching rays, six boundary-product rays, discounted affine-square rays, and a parameterized family of discounted rank-two rays. These families generate the cone, so their linearizations give a complete valid-inequality description of the convex hull in the lifted space. The discounted rank-two rays also show that rank-one liftings cannot generate all valid inequalities. Using this classification, we prove a conjecture of Anstreicher and Burer on an exact semidefinite representation of this convex hull.

fields
Optimization and Control
pdf ↗ page arXiv:2611.15745 ↗

We devise a fully polynomial time approximation scheme for minimizing a monotone norm $\left\lVert\cdot\right\rVert$ over a convex set $X\subseteq \mathbb{R}^d_{\geq 0}$. We study the multi-customer setting, where $X=\sum_{i=1}^n X_i$ and the solution set $X_i\subseteq \mathbb{R}^d_{\geq 0}$ is given by a linear minimization oracle for each customer $i$. Our algorithm computes, for any given $\varepsilon>0$, a $(1+\varepsilon)$-approximate solution. With high probability, it uses $\tilde{\mathcal{O}}\left( \varepsilon^{-2}(n+d) \right)$ single-customer linear minimization oracle calls and the same number of generalized KL projections to the dual space $Y=\{y\in \mathbb{R}^d_{\geq 0}: \left\lVert y \right\rVert^* \le 1\}$. We assume no prior knowledge on $X$, and our running time depends only on $n$, $d$, and $\varepsilon$. Our result is robust in the sense that it allows for approximate linear minimization oracles and approximate KL projections. We show that the (approximate) KL projection can be performed efficiently for large classes of monotone norms, demonstrating the applicability of our approach. While such a result (with exact projection) is well-known for the $\ell_{\infty}$ norm via multiplicative weight updates and was recently obtained for ordered norms via a smooth norm approximation and a novel randomization, existing techniques do not extend to general monotone norms. In particular, a key feature used in previous proofs was dual price stability, which was derived from a global contraction property of the KL projection to the dual space $Y$. We show that this property does not extend to general monotone norms. Therefore, we use a different price mechanism, based on the well-known mirror descent paradigm, for which a local contraction property holds and guarantees stability.

comments
44 pages, 2 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.15748 ↗

Disturbance uncertainty requires safety filters based on control barrier functions (CBFs) to leave a robustness margin, which can alter the nominal control input and degrade closed-loop performance. This paper studies safety and the resulting performance loss for discrete-time nonlinear systems with additive disturbances and polytopic input constraints. We develop a causal disturbance observer and construct two robust barrier conditions. The first uses a time-dependent bound on the estimation error. The second uses a constant margin when the disturbance increments are uniformly bounded and moves the requirement on the initial error from the online filter to an explicit initialization condition. For affine barriers, both filters are quadratic programs. We bound their input deviations from an oracle filter with access to the current disturbance and derive sufficient conditions for uniform contraction of the oracle closed loop. The contraction analysis accounts for state-dependent actuation, unmatched disturbances, and active physical input limits. Combining the sensitivity and contraction estimates gives finite-time dynamic regret bounds that quantify the effects of observer convergence, disturbance variation, and robustness margins. With sublinear cumulative certified disturbance variation and observer innovation error, the bounds yield sublinear regret.

comments
15 pages, temporary, (optional) simulation to be added
fields
Optimization and Control
pdf ↗ page arXiv:2611.15776 ↗

Edge-following methods, such as the simplex method, move along edges of a polytope. Their behavior depends on which vertices are adjacent and on the diameter. We study both for the two polytopes of binary polynomial optimization: the multilinear polytope and its standard linear relaxation. For quadratic polynomials, Padberg showed that two integral vertices are adjacent in both polytopes if and only if the variables where they differ induce a connected subgraph. For higher degree, we replace this subgraph by a contracted hypergraph on the same variables, built from the monomials whose constraints tie these variables together. We show that its connectivity decides adjacency in the relaxation but, unlike in the quadratic case, not always in the multilinear polytope. Adjacency is the same in both polytopes exactly when the relaxation has the Trubin property. We investigate when this property holds and characterize it for cubic polynomials. The contracted hypergraph also yields short paths. The diameter of the multilinear polytope is at most the number of variables, and that of the relaxation is linear in the numbers of variables and monomials. Similar linear bounds hold for the number of pivots between bases of the relaxation.

fields
Optimization and Control
pdf ↗ page arXiv:2611.15785 ↗

In sparse principal component analysis (SPCA) with several components, each must be sparse and all must be pairwise orthogonal. When the supports of the components overlap, these two requirements interact. For a covariance matrix of fixed rank, polynomial-time algorithms with optimality or approximation guarantees are known for one component, and for several components with disjoint supports or with a common support. We study the general model, with individual sparsity constants and arbitrary support overlaps. We are given a rational $n\times r$ matrix $R$ and $d$ sparsity constants $s_i \le n$, and the goal is to find an $n\times d$ matrix $X$ with orthonormal columns that maximizes $\|R^\top X\|_F^2$, such that column $i$ has at most $s_i$ non-zero entries. Here $RR^\top$ plays the role of the covariance matrix and has rank at most $r$. We show that SPCA is NP-hard even when $r = d = 2$, but admits a fully polynomial-time approximation scheme (FPTAS) when $r$ and $d$ are fixed. The returned solution has exactly orthonormal columns, and its entries are real algebraic numbers in an exact representation. For fixed $ε$, the number of steps of the algorithm is linear in $n$ up to a polylogarithmic factor. Our approach reduces SPCA to a sparse version of the orthogonal Procrustes problem, that is, to maximizing a linear function over the feasible region of SPCA. We show that this problem is NP-hard even for $d = 2$, and we give an FPTAS for it when $d$ is fixed. This FPTAS combines approximate dynamic programming over the rows, two-column updates that restore exact orthogonality, and an exact computation of the few variables for which these updates are not available.

fields
Optimization and Control
pdf ↗ page arXiv:2611.15810 ↗

In this paper, we consider the adaptive linear quadratic optimal control problem for a class of discrete-time stochastic systems, where the system matrix pair $(A,B)$ is unknown and the state weighting matrix $Q$ in the cost function is not necessarily positive semidefinite. Our proposed adaptive optimal control only assumes that the corresponding algebraic Riccati equation has a stabilizing solution, which weakens the standard controllable and observable assumptions used in the literature. To address this problem, we modify a weighted least squares algorithm by incorporating a random regularization method, which ensures the uniform stabilizability of the family of estimated models. Additionally, a diminishing excitation is introduced in the design of the proposed adaptive control to guarantee the strong consistency of the desired components of the estimates. Finally, by leveraging this family of estimates and employing a suitable switching method, we demonstrate that a certainty equivalence control with such a diminishing excitation is an optimal adaptive control.

fields
Optimization and Control
pdf ↗ page arXiv:2611.15823 ↗

Gradient descent optimization methods are the key tools to train deep neural networks in artificial intelligence systems. In practice, one typically employs suitable accelerated gradient descent optimization methods such as the momentum optimizer, the Adam optimizer, or the MUON optimizer proposed by Jordan et al. in 2024. In 1964 Polyak showed that, in a neighborhood of a local minimizer, the momentum optimizer converges with the rate $(\sqrtχ+1)^{-1}(\sqrtχ-1)$, which is strictly faster than the rate $(χ+1)^{-1}(χ-1)$ of the standard gradient descent optimizer, where $χ\in(1,\infty)$ is the condition number (the ratio of the largest to the smallest eigenvalue) of the Hessian of the objective function at the local minimizer. Recently, the same faster rate has been established for the Adam optimizer. In this work we show that the MUON optimizer achieves the same higher speed of convergence and we establish the optimality of the obtained convergence rates. More specifically, we propose a precise concept for measuring the speed of convergence of gradient descent optimization methods, and we establish optimal convergence rates for the standard gradient descent, the momentum, the RMSprop, the Adam, and the MUON optimizers.

comments
37 pages
fields
Optimization and Control
pdf ↗ page arXiv:2611.15825 ↗

Bilevel optimization is a core tool in practical machine learning workflows, including hyperparameter tuning, data reweighting, robust learning, reinforcement learning, and imbalanced classification. Hypergradient computation requires the inverse of the inner Hessian, typically estimated via a truncated Neumann series. While existing analyses focus on bias and variance, we show that the product structure of the Neumann series introduces a third source of error: skewness. We identify that, unlike ordinary gradients, whose asymmetry is suppressed by mini-batch averaging, the Neumann estimator amplifies skewness across factors, with the third-moment error growing, under weak contraction, with truncation depth, inner condition number, and per-factor noise asymmetry. This arises in many practical settings such as corrupted labels, outliers, heterogeneous or class-imbalanced datasets. To address this, we introduce the Antithetic Neumann Estimator (ANE), which pairs each Hessian sample with a mirrored counterpart around a reference Hessian and averages the resulting inverse-Hessian estimates. With an exact reference, the antithetic product retains only even-order noise, eliminating all odd-order perturbation terms; with an approximate reference, the residual odd-order contribution is bounded linearly in the reference error. ANE requires only a modification of the Hessian vector step and combines with existing stochastic or variance-reduced bilevel methods. We instantiate ANE-SGD and ANE-VR, the latter adding recursive variance reduction. Across robust regression, data cleaning, offline reinforcement learning, and imbalanced classification, ANE-based methods improve on stochastic and variance-reduced baselines on every task (20 seeds each), lowering loss by 4 to 25% relative to the best baseline; the largest gains, on robust regression, are a 25% lower test loss and a 54% higher test r-squared.

comments
Accepted at NeurIPS 2026
fields
Optimization and Control
pdf ↗ page arXiv:2611.15895 ↗

We design and justify a proximal inexact random reshuffling method for minimizing sums of the finite average of functions with Lipschitz continuous gradients and lower semicontinuous regularizers that may be nonconvex. Each epoch visits every component once, using inexact gradients with a prescribed tolerance, and ends with a single proximal step. Our analysis is pathwise: it holds for every sequence of permutations and does not depend on how the reshuffling is performed. We show that when the stepsizes and error tolerances satisfy suitable summability conditions, the objective values converge and every accumulation point is stationary. Furthermore, under the Polyak–Łojasiewicz–Kurdyka condition at a single accumulation point and sufficient decrease of stepsizes, the entire sequence has finite length and converges to that point. For polynomial stepsizes and power-type desingularizing functions, we derive convergence rates for objective values and iterates. Finally, faster objective-value rates are derived when the limit is a local minimizer.

comments
26 pages
fields
Optimization and Control
pdf ↗ page arXiv:2611.15916 ↗

State-of-the-art neural network verifiers evaluate linear relaxations over axis-aligned bounding boxes. However, verification domains in cyber-physical systems are rarely boxes. Reachability specifications, obstacle-avoidance constraints, and neural Lyapunov certificates typically yield oblique or non-convex polyhedral regions, over which box-based bounds become extremely loose. This paper proposes Fit-LRP (Fitting Linear Relaxations to Polytopes), a framework the implements exact optimization of affine bounds over non-convex domains (represented by unions of polytopes) by solving a sequence of small, low-dimensional linear programs. Our approach seamlessly enhances the final optimization step of LiRPA and $α,\! β$-CROWN branch-and-bound (BaB) algorithms. In BaB verification, approximating oblique constraints with axis-aligned splits causes severe combinatorial blowup and risks non-termination. By optimizing the final affine bound of a nonlinear function over the exact polyhedral state-space constraints our method eliminates box-induced over-approximations, enabling earlier search-tree pruning. On ARCH-COMP and neural Lyapunov benchmarks, Fit-LRP reduces branching on the hardest region by $47\times$, cuts worst-case verification time by $15\times$, and with region-wise partitioning, verifies on a single CPU $6.1\times$ faster than $α,\! β$-CROWN on a GPU.

fields
Optimization and Control
pdf ↗ page arXiv:2611.16003 ↗

A discrete PID controller is exactly a recurrent neural network, a classical state-space fact: a fixed linear memory of the running integral and the last error, read out by three trainable weights that map one-to-one to the PID gains. Networks with bounded hidden states, such as LSTMs of any width, only approximate it. Trained only on a one-step physical cost (the expected cost of one transition from a fixed state distribution), with no demonstrations, teacher controller, or known gains, the network solves a strongly convex least-squares problem, so gradient descent converges from any initialization to the unique one-step optimal PID gains; the limit network is that PID, with the same action on every error sequence. Partitioned regression then shows what extra capacity buys. Orthogonal residual features keep these gains and improve on the PID if and only if they correlate with the part of the optimal action outside the PID span. On a nonlinear second-order example the gap is 5.88% of the optimal PID cost, and 4.00% against PID with a bias; no controller can improve on PID by more on this objective. A residual started at a tuned PID begins exactly at that PID; at the one-step optimal PID, a fixed-feature residual's first gradient step lowers the cost if and only if its features can improve on the PID. Experiments confirm the realization, recovery, and gap results to numerical precision. On held-out plants of three families, under a protocol frozen before the test data existed, a residual warm-started at a heavily tuned PID and trained with it lowers the long-horizon cost by 3.5%, 3.5%, and 1.9%, with family-wise 95% bounds excluding zero, also under distribution shift; a post hoc comparison with the PID tuned alone suggests that most of it comes from the recurrent part in two families. The primary endpoint, a gain of at least 5% from a generic PID start, is not met in any family.

code
github.com/FelixStaff/PIDAsNet repository not found
comments
18 pages main text plus appendices, 17 figures. Code: https://github.com/FelixStaff/PIDAsNet
fields
Optimization and Control
pdf ↗ page arXiv:2611.16050 ↗

Auction mechanisms are widely used to support generation investments. In the US, capacity auctions serve as supply-adequacy instruments to address the missing-money problem, whereas in Latin America, energy and capacity auctions procure long-term contracts to support generation expansion. In both settings, accreditation metrics, such as Firm Energy (FE) and Effective Load Carrying Capability (ELCC), are used to approximate the reliability contribution of selected units and winning projects are selected based on a financial offer. This approach fails to recognize the actual contribution of winners to the multiple services they provide to the system. This limitation becomes more significant with high shares of renewables, as the value of each resource increasingly depends on network and technological constraints, as well as on complementarities within the generation portfolio. Inspired by short-term auctions, such as day-ahead markets, this paper proposes a joint optimization-based auction for generation and transmission investments that internalizes these interactions, capturing the intrinsic value of generation candidates without requiring the computation of FE or ELCC metrics. The auctioneer determines the winning portfolio through an expansion-planning model that explicitly represents network constraints, operational interactions, reliability standards, and multiple scenarios. A case study of the Brazilian system indicates lower system costs, lower risk, and a more diverse portfolio relative to the stylized decoupled procurement approaches currently deployed in many systems.

comments
10 pages, 3 figures, 3 tables
fields
Optimization and Control
pdf ↗ page arXiv:2611.16084 ↗

We consider the question of describing gradient flows over the collection of convex bodies. This is motivated by foundational questions arising in inverse problems. Suppose we wish to solve an ill-posed inverse problem using regularization techniques. Can we learn an optimal choice of a convex regularizer directly from prior data? Given a numerical algorithm that computes such an optimal regularizer, is there a principled manner for describing the evolution of its iterates? The objective of this paper is to lay the foundation towards answering these questions. To this end, we consider a criterion of an optimal regularizer based on seeking a convex body that minimizes the expected gauge evaluation with respect to a prior data distribution subject to a volume constraint. The formulation is initially nonconvex, but admits hidden convexity by passing to its polar. We characterize the Karush-Kuhn-Tucker (KKT) conditions that certify global optimality. We also analyze the $L^2$-gradient flow as well as a minimizing movement scheme with the Hausdorff penalty. Our results show that the objective gap decays exponentially along the gradient flow and we obtain dimension-dependent rates for both the objective gap and distance to the optimal body for the Hausdorff scheme. Finally, we apply the KKT conditions to identify explicit optimal convex bodies. For data where the optimal nonconvex regularizer is the $\ell_p$-quasinorm, $p \in (0,1)$, the optimal convex regularizer is the volume-normalized $\ell_1$-ball. For data described by paired basis atoms, the optimal convex regularizer is the polar of a shifted zonotope.

fields
Optimization and Control, Metric Geometry
pdf ↗ page arXiv:2611.16142 ↗

We prove that the split rank of a rational pure-integer polyhedron is polynomially bounded in its input length, resolving a conjecture of Basu, Conforti, Di Summa, and Jiang. If the defining system has dense binary encoding length $L$, then $O((L+1)^9)$ split rounds suffice to reach the integer hull in arbitrary dimension.

fields
Optimization and Control, Combinatorics
pdf ↗ page arXiv:2611.16231 ↗

Movable seats enable passengers to transfer between coupled modular bus units while remaining seated, but require physical reconfiguration that existing modular transit models largely abstract away. We model seat reconfiguration as a colored generalized sliding-tile puzzle on the physical track graph, capturing simultaneous movements, seat indistinguishability within destination groups, and vertex, edge, and corner-following conflicts. A lexicographic objective minimizes makespan first and then the sum of costs (SoC), which penalizes movements and waiting at non-target positions. We develop an exact time-expanded mixed-integer linear programming formulation and a Boundary-Sequence Dynamic Programming (BSDP) algorithm. BSDP decomposes the problem at single-edge module interfaces and coordinates local schedules through compressed boundary-crossing sequences, provably preserving feasibility and optimal costs. On two- and three-module benchmarks, BSDP achieves mean per-instance speedups of 3.24x and 6.30x over Gurobi, respectively. In fixed-horizon tests with four to seven modules, both methods start from identical greedy schedules and receive a 300 s budget. BSDP obtains lower final SoC than Gurobi on 197 of 200 instances and ties on three, reducing mean final SoC by 17.93%-69.07% across the four size classes. Geometry sensitivity and ablation studies further clarify the contribution of boundary compression to computational performance. The framework links seat reconfiguration to the timing and operational cost of modular bus decoupling.

fields
Optimization and Control
pdf ↗ page arXiv:2611.16357 ↗

A key source of uncertainty in multi-agent systems is the behavior of other agents. Game-theoretic control approaches ignore this uncertainty, while robust control approaches treat others as fully adversarial. In this paper, we introduce strategically robust multi-agent control to populate the spectrum between these two paradigms. Specifically, in dynamic games, we propose that players are strategically robust and seek protection against misspecified control policies of the other players. This formulation induces a novel equilibrium concept, strategically robust dynamic equilibrium, that interpolates between game-theoretic control and robust control. We study this concept across canonical open- and closed-loop settings and show that accounting for strategic robustness also has computational benefits over classic approaches in game-theoretic control. Numerical experiments on vehicle platooning, inventory management, and network control illustrate resilience to misspecification, and also exhibit a "free-lunch" phenomenon in which strategic robustness can improve performance or social welfare.

comments
16 pages, 10 figures, 3 tables
fields
Optimization and Control
pdf ↗ page arXiv:2611.16388 ↗

This paper studies differential two-stage stochastic linear complementarity problems, in which an ordinary differential equation (ODE) is coupled with a two-stage stochastic linear complementarity problem (SLCP) under a time-dependent probability distribution. The right-hand side of the ODE involves a solution pair (here-and-now and wait-and-see decisions) of the two-stage SLCP, while the two-stage SLCP involves two functions depending on the time $t$ and the state $x(t)$ of the ODE. Under appropriate conditions, we prove that the solution function of the two-stage SLCP is Lipschitz continuous in $x(t)$ and locally $\frac{1}{2}$-Hölder continuous in $t$, and establish the existence and uniqueness of a classical solution to the differential two-stage SLCP. Moreover, we develop a discrete approximation scheme for the differential two-stage SLCP. We first use a finite-scenario partition with mesh size $δ_N$ to approximate the distribution, then apply the Euler method for time discretization with step size $h$, and finally solve the resulting finite-dimensional problems using an inexact progressive hedging method with tolerance $η$. We prove that the error between a computed solution by the discrete approximation scheme and the classical solution of the original problem is bounded by $C(δ_N+h+η)$, where $C>0$ is a constant independent of $N$, $h$ and $η$. Finally, we apply our method to find an equilibrium point of a differential two-stage stochastic two-player zero-sum game. Numerical experiments illustrate the convergence rates and the efficiency of the discrete approximation scheme.

comments
27 pages, 4 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.16501 ↗

Simplified swarm optimisation (SSO) updates each variable by one draw that copies the global or personal best, keeps the current value or redraws uniformly, with probabilities $c_g$, $c_p$, $c_w$ and $c_r$. As a finite Markov chain under frozen memory, its coordinate kernel $c_w I + (1 - c_w)Π$ has an explicit stationary law and exact convergence rate $c_w^t$. The elitist chain has a geometric hitting-time bound, from a non-optimal start a fixed $c_r$ needs at least $\exp(nc_r/2)$ expected evaluations to reach a unique optimum, and a coupling under changing memories gives $O(n\log n)$ and $O(n^2)$ expected generations on OneMax and LeadingOnes for every population size with redraw share of order $1/n$ and no inertia, and within a $\log n$ factor for fixed inertia. With a frozen memory, inertia cannot speed up first entry into any set from stationary positions, though it can from others. Where the three reference values agree, only $c_r$ acts; where they disagree, copy branches recombine the memories, forcing a redraw only where no active branch holds the target value. Branch logging and checkpoint replay show inertia slowed the tested OneMax and LeadingOnes runs and suggest memory-mediated gains on wider gaps. On Jump functions SSO needed 3.8–8.9 times fewer evaluations than the (1+1) evolutionary algorithm with rate $1/n$, but no consistent advantage over rate-adjusted mutation or a $(μ+1)$ genetic algorithm with uniform crossover was established. The analytical redraw rule improved six of eight benchmark–setting pairs and redundancy allocation, but was slower than $c_r = 0.1$ on Jump$_2$.

comments
29 pages, 7 figures, 17 tables. Submitted to Swarm and Evolutionary Computation. Code, per-run records and a one-command reproduction workflow: Zenodo, doi:10.5281/zenodo.24153497
fields
Optimization and Control, Probability
pdf ↗ page arXiv:2611.16541 ↗

Mixed-integer programming (MIP) solver runtimes vary substantially across random seeds. Parallel replication exploits this variability but can waste computational resources when applied indiscriminately. We investigate whether information from an ordinary solve can guide this allocation decision. We formulate replication under a finite deadline, establish an exact relationship between runtime dispersion and the value of independent searches, and analyze delayed replication and imperfect allocation decisions. Using 101,615 seeded SCIP runs, we examine the association between root-LP dual degeneracy and replication value. We then introduce a non-invasive root-gated policy that preserves the original solver trajectory and launches three additional seeded processes when a root dual-degeneracy indicator reaches a fixed threshold. In a prospective two-hour experiment on 130 paired instances, root-gated racing proves optimality on 77 instances (59.23%), versus 73 (56.15%) for both Single and unconditional Race-4, while reducing active worker-process occupancy by 43.00% relative to unconditional racing. These findings demonstrate the promise of selective parallel resource allocation without solver-source modifications.

comments
17 pages, 4 figures, 2 tables
fields
Optimization and Control
pdf ↗ page arXiv:2611.16543 ↗

We study how to combine three One Health interventions against antimicrobial resistance: prescription-only dispensing of antibiotics to people, access to veterinary care for animals, and treatment of household sludge and manure. Each household is a Markov chain on the carriage states of its people, animals and soil, and households are linked through the community, whose prevalence feeds the acquisition rates. We prove that, as the number of households grows, the distribution of household states converges to the solution of a nonlinear mean-field equation. This system is monotone for the stochastic order, so that no intervention increases carriage anywhere, and for every constant intervention it has exactly one equilibrium, which attracts all solutions and is given by a scalar equation. For the optimal control problem we prove existence, necessary conditions, positivity of all controls under a quadratic cost, uniqueness for short horizons, and a turnpike property under an explicit dissipativity condition, which we verify for our parameters by a computer-assisted numerical certification. With parameters from Tenkodogo, Burkina Faso, the optimal combined strategy averts about 17% of human carriage over three years in the baseline scenario, and 11% to 28% over the plausible scenarios for the parameters that the survey cannot identify; these figures are projections conditional on the model. The strategy itself is robust: the value of perfect information on the unmeasured parameters is about 2% of the achievable benefit. A compartmental model with the same transmission rates but without households underestimates the benefit, and targeting the interventions by zone of the town increases it.

fields
Optimization and Control
pdf ↗ page arXiv:2611.16617 ↗

Despite the remarkable progress of deep learning in image processing, variational methods remain a fundamental and actively developing framework, offering interpretability, mathematical rigor, and well-founded guarantees. In this work, we introduce a weighted second-order nonlocal total variation regularizer for image restoration, which is based on measuring gradient differences across the image domain and allows for weights that are neither smooth nor symmetric and may vanish outside a search window. We first provide a rigorous definition of the regularizer and prove that it enjoys several desirable properties under realistic assumptions on the underlying weight function. We then consider a nonlocal variant of the variational image restoration model of Chambolle and Lions, and prove the existence and uniqueness of solutions to the associated minimization problem. On the computational side, we develop a discrete formulation of the model and derive the corresponding Chambolle-Pock primal-dual algorithm. Finally, we conduct an extensive experimental evaluation, comparing the proposed regularizer with a range of local and nonlocal, first- and second-order regularizers across several image restoration tasks. The results demonstrate its strong noise-suppression and texture-preservation capabilities, as well as its robustness to nonlocal weights computed under non-ideal conditions.

fields
Optimization and Control
pdf ↗ page arXiv:2611.16618 ↗

We study optimization of an average of \(n\) functions when gradient predictions are exact except for at most \(k\) unknown components. An initial scan may miss these exceptions. For a class of smooth problems, we prove that the optimal worst-case expected number of component-gradient evaluations needed to find an approximate stationary point is \[ Θ\!\left(\min\left\{nk+\mathcal R,\frac nk\mathcal R\right\}\right), \] where \(\mathcal R\) represents the optimal cost when the exceptional components are known. Prediction evaluations are free. This bound shows that discovering even a few exceptions can cost more than one full scan and can account for most of the gradient evaluations.

fields
Optimization and Control
pdf ↗ page arXiv:2611.16638 ↗

Dynamic time-to-collision (TTC) is the first contact time of a prediction flow and defines a feedback map implicitly. We study its capped value function $\VV$ for Carathéodory dynamics with bounded, measurable forcing. A self-contained argument establishes local Lipschitz continuity on the transversal collision domain. A derivative-free stopped-step Bellman equation then characterizes $\VV$ uniquely: it advances the prediction for a fixed duration or until contact and adds the elapsed time. A two-sided error bound uses only the candidate's residual along complete stopped trajectories and its error at their endpoints. Exact continuum iteration recovers $\VV$ after finitely many sweeps, including one additional sweep for initializations that violate the boundary condition. We also characterize an optional-duration infimum operator: its fixed points are the dynamic-programming subsolutions, so its residual alone does not identify $\VV$. Finally, on compact subsets of the transversal domain, an optimization-free ReLU construction has explicit size, controlled local residual, and robustness to errors in its nodal TTC values. The optimal velocity model provides the running application.

fields
Optimization and Control
pdf ↗ page arXiv:2611.16663 ↗

We propose an online method for choosing both a blood pressure target and a norepinephrine dose for an individual surgical patient. From a short record of mean arterial pressure (MAP) and norepinephrine delivery, the method fits a reduced pharmacokinetic/pharmacodynamic model and uses a local Gaussian approximation to propagate uncertainty to future MAP readings. It searches for the lowest target for which a bolus and constant infusion keep the predicted probability of at least one MAP reading below 65 mmHg after the rise phase within a prescribed limit. If no such target is found, the decision returns to the clinician. We assess calibration of the predicted minimum MAP on retrospective surgical records under the doses actually administered. In a cohort of 4,096 virtual patients, the method recommended a dose for 74 % of patients at a nominal risk of 5 %. Among the patients receiving a recommendation, 6.9 % had a reading below 65 mmHg. A fixed target of 70 mmHg yielded a rate of 25 % when applied to the full virtual cohort.

fields
Optimization and Control
pdf ↗ page arXiv:2611.16757 ↗

Online advertising is a central marketing lever for e-commerce retailers, yet it complicates operational planning by simultaneously stimulating product demand and increasing product returns. Motivated by the practice of a fashion retailer on Amazon, we study a retailer's joint inventory and advertising problem across multiple products over a single season, in which advertising has both direct and cross-product spillover effects on demand and returns. Using linear net-demand and return models that capture both effects, we formulate a contextual stochastic optimization model that jointly determines inventory levels and advertising decisions before the selling season. Because ad clicks are realized only after the advertising decision, the predictive covariates are partially observable and decision-dependent, and their joint distribution with the demand and return errors is unknown. We therefore develop an estimate-then-robustify (ETR) approach grounded in a data-driven robust satisficing framework. We establish a finite-sample guarantee on the out-of-sample profit of the ETR solution that holds for any parameter estimator, show that the solution is asymptotically optimal when the estimator is consistent and the profit target approaches the empirical optimal profit, and derive a mixed-integer conic approximation via affine recourse adaptation that is exact for a single product. On the retailer's data, ETR improves out-of-sample profit over conventional estimate-then-optimize by 6.39\% and earns the higher profit in 74.5% of instances, with the largest gains when training data are scarce; the gain falls to 1.02% when the decision model omits cross-product spillovers.

fields
Optimization and Control
pdf ↗ page arXiv:2611.16778 ↗

This paper was inspired by a post on Twitter and by the eight months the author spent at the AASS Centre at Orebro University in 2007. This phenomenon is interesting not only to a physicist, but also to someone like me working in control theory, because of its potential relevance to stabilizing drones and similar flying machines subject to random velocity fluctuations while hovering. A chain fountain can settle without an engineered controller, yet its natural height is selected by transport and boundary forces. We ask how an ideal boundary traction force can sustain a prescribed height or motion. Within an established three-state model, we connect feedback design to force and energy balances and derive sufficient conditions for nominal tracking that preserve the model's mechanical constraints. We also bound the deviations caused by bounded pickup uncertainty. The resulting framework explains how feedback can shape a naturally regulated process and identifies physical limits on the motions it can sustain: stabilizing a mathematical trajectory is useful only if the corresponding motion remains mechanically admissible. This is a preliminary step towards stabilization of the chain in three dimensions.

comments
61 pages, 16 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.16781 ↗

A method is presented for margin-inducing optimal guidance and control with application to atmospheric entry. The method induces margin in state inequality path constraints during entry while simultaneously retaining a large portion of the non-margin-inducing performance. The margin in the guidance trajectory is based on a differentiable approximation of the maximum of a continuous function. This differentiable approximation is derived from the Kreisselmeier-Steinhauser (KS) function, where the KS function is defined for a function over sampled data. The KS function is first modified into a weighted form where the data points and weights are associated with a multiple-interval Legendre-Gauss-Radau quadrature. This weighted form is then shown to be an approximation of a logarithmic integral. This smooth approximation of the maximum function is then used to formulate a margin-inducing optimal control problem, and this margin-inducing optimal control problem is re-solved at specified guidance update times. The method is applied to a reusable launch vehicle atmospheric entry problem subject to heating rate and dynamic pressure constraints. It is found that the method of this paper produces a guidance trajectory that remains a significant distance from the path constraint limits while maintaining a large portion of the performance of the constrained optimal control problem.

comments
41 pages, 10 figures, 12 tables
fields
Optimization and Control
pdf ↗ page arXiv:2611.16891 ↗

We formulate and numerically study the problem of finding the minimum energy required to trigger a spike in a three-dimensional conductance-based excitable model. The variational formulation seeks a state trajectory that reaches the boundary of the spiking region with the least \textit{peak} cumulative work supplied through the membrane port. We approximate voltage histories by sums of real exponentials, reducing the problem to a finite-dimensional optimization. The best-found voltage waveform consists of a hyperpolarization phase followed by a depolarization phase, which seems to match the experimentally determined optimal stimulus in squid giant axons.

fields
Optimization and Control
pdf ↗ page arXiv:2611.16915 ↗

In this paper, we develop a hierarchical control framework for nonlinear dynamical systems with safety constraints. Specifically, a low-fidelity model is introduced for trajectory planning, while a tracking controller is designed for the high-fidelity system. We first characterize the tracking error bound (TEB) using a storage function. Then, we formulate the synthesis of the tracking controller, the storage function, and the TEB as an optimization problem. Following that, we develop an offline learning approach to approximately solve the optimization problem, by incorporating behavior cloning and satisfiability modulo theories (SMT) solver. We further integrate the learned controller and the TEB into online tracking of the high-fidelity system. This framework enables the control of high-dimensional nonlinear systems with safety guarantees, while maintaining computational efficiency for real-time implementation. Finally, experiments are provided for illustration.

fields
Optimization and Control
pdf ↗ page arXiv:2611.16982 ↗

In this work we propose BLDS-SIMPLEX, a derivative-free direct search method for the solution of bilevel optimization with polytope constraints at the upper level. The proposed method reformulates the feasible set using barycentric coordinates and explores it using Frank-Wolfe-type directions, relying on a fixed-accuracy black-box oracle for the upper-level objective function. We analyze its convergence properties and complexity in the case of smooth reduced objective; additionally, we analyze a variant for the case of nonsmooth objectives and show its convergence to a specific kind of stationary point that we introduce as a natural generalization to the classic stationarity notions in this setting. Numerical tests on modified instances from BOLIB support the viability of our new approach.

comments
20 pages, 8 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.16983 ↗

Accelerated transformed primal–dual (ATPD) methods are proposed for smooth convex optimization problems with affine equality constraints. The methods combine primal–dual dynamics with a transformation designed to accelerate convergence. In the strongly convex case, ATPD achieves an accelerated linear convergence rate and matches the known lower bounds on first-order oracle complexity in terms of gradient evaluations and matrix–vector products. The analysis distinguishes these two types of computational work when assessing the complexity of the method. For general convex objectives, a homotopy perturbation strategy is introduced, and an accelerated sublinear rate for the modified Lyapunov energy is proved under a uniform boundedness condition on the primal iterates at all homotopy stages. The acceleration mechanism is based on an exponentially stable ATPD flow and a modified discrete Lyapunov function. This continuous-time perspective guides the construction and analysis of the discrete methods. Numerical experiments on policy evaluation and constrained signal reconstruction problems support the theory and illustrate the efficiency of the proposed methods.

fields
Optimization and Control
pdf ↗ page arXiv:2611.17026 ↗

This paper proposes an adaptive constraint-sampling technique for stochastic gradient-based methods to efficiently solve constrained optimization problems with a large number of inequality constraints. The proposed constraint-sampling technique maintains a set of recently violated constraints and draws the constraint used in each iteration uniformly either from this set or from the set of all constraints. This keeps its per-iteration arithmetic overhead independent of the number of constraints. In simulations on synthetic convex optimization problems and in the synthesis of a control barrier function for the Dubins Car, the constraint-sampling technique is shown to significantly outperform uniform constraint sampling.

comments
Preprint to be submitted to the Learning for Dynamics and Control (L4DC) Conference 2027
fields
Optimization and Control
pdf ↗ page arXiv:2611.17076 ↗

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 \textsf{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.

fields
Optimization and Control
pdf ↗ page arXiv:2611.17143 ↗

We investigate when metric regularity of a subdifferential mapping rules out multiple local inverse branches and therefore upgrades to strong metric regularity. Let $h:\mathbb{R}^n\to(-\infty,\infty]$ be proper, lower semicontinuous, definable, prox-regular, and subdifferentially continuous at $(\bar x,\bar v)\in\operatorname{gph}(\partial h)$. We characterize this ``upgrade'' through the second subderivative $q = \mathrm{d}^2h(\bar x|\bar v)$ of $h$. If $\partial h$ is metrically regular, then it is strongly metrically regular if and only if the set of negative curvature directions of $q$ on the unit sphere of $\operatorname{span}(\operatorname{dom}(q))$ has Euler characteristic $0$ or $2$. We also prove a simpler and directly verifiable sufficient condition: nonnegativity of $q$ on the lineality space $\operatorname{dom}(q)\cap(-\operatorname{dom}(q))$ forces a quadratic lower bound for $q$ on its entire domain and hence yields strong metric regularity. In particular, if $\bar x$ is a local minimizer and $\bar v=0$, the second subderivative is nonnegative on its domain $\operatorname{dom}(q)$, which proves a conjecture of Drusvyatskiy, Mordukhovich, and Nghia in the definable setting. The derived principle strengthens this conjecture by replacing local minimality with a weaker second-order condition on the lineality space.

comments
26 pages
fields
Optimization and Control
pdf ↗ page arXiv:2611.17164 ↗

This paper studies time-inconsistent linear-quadratic mean-field games governed by stochastic evolution equations in Hilbert spaces. The time inconsistency arises through the dependence of the cost functional on the initial time, while the mean-field interaction enters through the mean of the state distribution. By employing a multiperson differential game approach, we show that the closed-loop equilibrium strategy admits an affine feedback representation characterized by an operator-valued Riccati equation and a novel coupled forward-backward equilibrium system. We establish the existence and uniqueness of mild solutions to the equilibrium system and hence the existence of a closed-loop equilibrium strategy.

comments
35 pages, comments are welcome
fields
Optimization and Control
pdf ↗ page arXiv:2611.17180 ↗

Multi-horizon optimal control aims to select optimal control sequences simultaneously for several possible future scenarios, ensuring consistency at the first stage. While this enables advanced model predictive control schemes that explicitly handle prediction uncertainty, solving these problems tends to be costly. We introduce FanCyqlone, a linear solver that exploits parallelism across both time steps and scenario branches. The method builds on Cyqlone to compute the contribution of each branch and combines these results through a shared root problem. We integrate FanCyqlone into QPALM to develop FanCyQPALM, a solver for multi-horizon optimal control problems with general linear stage-wise constraints. We compare its performance with state-of-the-art solvers on spring-mass and quadruped control benchmarks.

fields
Optimization and Control
pdf ↗ page arXiv:2611.17221 ↗

Fictitious play (FP) is one of the earliest and most fundamental learning procedures in games, where each agent independently chooses a best response to the empirical distribution of opponents' past actions by maximizing the expected payoff with respect to it. However, learning agents may not always be expected-utility maximizers: they may use nonlinear evaluation functionals to account for the uncertainty induced by the opponents, e.g., via risk measures. In this work, we study nonlinear fictitious play (NL-FP), in which each pure action is evaluated by a general, possibly nonlinear functional of the payoff distribution induced by the opponent's empirical belief. To analyze NL-FP, we first identify a single-crossing property (SCP) of evaluation functionals that preserves the classical geometry of FP in $2\times2$ games. Furthermore, we conduct a novel geometric analysis of the convergence behavior of NL-FP in $2\times2$ games, even when the SCP fails. Beyond $2\times2$ games, we show that the convergence of NL-FP in $2\times n$ ($n\ge3$) games may fail even for continuous-time NL-FP, when the two-action player uses conditional value-at-risk (CVaR) in a $2\times3$ game. In addition, we identify a finite-crossing condition that ensures convergence of the selected continuous-time dynamics and the discrete-time iterates in general $2\times n$ games, which also provides new insights into the global landscape of continuous-time classical FP in such games.

fields
Optimization and Control
pdf ↗ page arXiv:2611.17286 ↗

Probability64

We present an explicit numerical approximation scheme, denoted by $\{X^n\}$, for the effective simulation of solutions $X$ to a multivariate stochastic differential equation (SDE) with a superlinearly growing $κ$-dissipative drift, where $κ>1$, driven by a multiplicative heavy-tailed Lévy process that has a finite $p$-th moment, with $p>0$. We show that the strong $L^{p_X}$-convergence $\sup_{t\in[0,T]}\mathbf E \|X^n_t-X_t\|^{p_X}=\mathcal O (h_n^γ)$ holds for any $p_X\in (0,p+κ-1)$, which is exactly the range where the $p_X$-moment of the solution is known to be finite. Additionally, for any $p_X\in (0,p)$ we establish strong uniform convergence: $\mathbf E\sup_{t\in[0,T]} \|X^n_t-X_t\|^{p_X}=\mathcal{O} ( h_n^δ )$. In both cases we determine the convergence rates $γ$ and $δ$. In the special case of SDEs driven solely by a Brownian motion, our numerical scheme preserves super-exponential moments of the solution. The scheme $\{X^n\}$ is realized as a combination of a well-known Euler method with a Lie-Trotter type splitting technique.

comments
43 pages
fields
Probability, Numerical Analysis
pdf ↗ page arXiv:2504.07255 ↗

We prove a volume-uniform Gaussian approximation for local spin coordinates in the zero-field nearest-neighbour $O(N)$ model on periodic boxes of side $M$ in $d\ge3$, at and below the critical temperature of the limiting spherical model. On a fixed spatial window, for sufficiently large $M,N$, the unnormalized $1$-Wasserstein error for the first $p\le N$ coordinates is at most $C\sqrt p (N^{-1/2}+s_M)$, where $s_M\to0$ is the spectral shift of the finite-volume mean spherical model. The estimate is uniform on compact ranges of positive directional couplings and inverse temperatures. The target has independent coordinate fields, each a scaled anisotropic Gaussian free field with an independent spatially constant Gaussian term below criticality. On a window containing a nearest-neighbour star (a site and its $d$ positive-direction neighbours), the error tends to zero as $M,N\to\infty$ exactly when $p=o(N)$ and $\sqrt p s_M\to0$. For any choice of periodic infinite-volume accumulation states, the error on any nonempty fixed window tends to zero as $N\to\infty$ exactly when $p=o(N)$. In $d\ge5$, when the inverse temperature exceeds its critical value by at least a fixed positive amount, the bound improves to $C(p/N+\sqrt p M^{-d})$. For fixed $p$, the sharp order is $N^{-1}+M^{-d}$ on star-containing windows and $N^{-1}$ on every nonempty fixed window in periodic accumulation states.

comments
37 pages, no figures
fields
Probability
pdf ↗ page arXiv:2611.14570 ↗

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.

code
github.com/apemm/elephant-bias-interval ∎ Lean project (lean/lakefile.toml, lean/lean-toolchain) builds, no sorry at f8b3050, checked 2026-11-13 build details
comments
28 pages, 2 figures. Code, certificates and Lean files: https://github.com/apemm/elephant-bias-interval
fields
Probability
pdf ↗ page arXiv:2611.14576 ↗

What does the occupation law of a finite Markov chain determine about its generator $Q$? From the stationary start, the law of the occupation times at one time determines $Q$ exactly up to time reversal and reversals of memoryless blocks, the sets of states that are all left at one rate with one landing law and are entered in proportion to the stationary law. These reversals commute and give exactly $2^k$ generators, with $k$ read off a tree of memoryless blocks. This leaves only time reversal when $Q$ has no rank-one cut, when there are at most 4 states, and generically. The law at one time determines the law at every time, and a generic start determines $Q$. A renewal block is a set of states that is left at the same rates from each of its states, is entered with one law, and is charged by the start in proportion to that law. From every start the law determines $Q$ exactly up to lumped reversals, which lump disjoint renewal blocks to single states and reverse a memoryless block of the lumped chain. We also find every start that hides time reversal. At the scale of large deviations, the functional of Donsker and Varadhan determines exactly the principal minors of $-Q$.

comments
29 pages. Code and Lean library in the ancillary files and at https://doi.org/10.5281/zenodo.24099075
fields
Probability, Rings and Algebras
pdf ↗ page arXiv:2611.14587 ↗

Understanding the persistence of learned behaviors in AI safety motivates an investigation of the dynamical counterpart to the equilibrium geometry studied in singular learning theory. We analyze this persistence through transitions between singular wells. We establish an Eyring-Kramers formula for a low temperature Langevin diffusion between two compact connected zero components of a real-analytic potential. The wells may be singular and nonisolated, and the unique minimizing gate is a nondegenerate index-one saddle, with gates understood as inclusion-minimal sets meeting every minimizing path. A boundary-gate construction shows that uniqueness of this inclusion-minimal gate is equivalent to every minimizing path passing through the saddle and one such path meeting the communication level only there. Compact semianalytic topology provides a separating function away from a fixed saddle neighborhood; analytic Morse coordinates give matching capacity bounds by first sending the temperature to zero and then shrinking that neighborhood. An anchored energy estimate and a small-ball potential-theoretic identity give uniformity for deterministic starting points. The leading constant is expressed in terms of the sublevel-volume coefficient, a Gamma factor, and the saddle Hessian.

comments
32 pages
fields
Probability
pdf ↗ page arXiv:2611.14603 ↗

We give an alternative proof of the Bourgade-Sodin-Zeitouni theorem on the excess of the sine-$β$ process for the Paley-Wiener space when $\sqrt{2/β}\in (1,+\infty)$ is not an integer. Let $k(β)=\lfloor\sqrt{2/β}\rfloor$. For almost every configuration, removing any $k(β)$ points leaves a minimal uniqueness set for the Paley-Wiener space. The same conclusion holds for each Bernstein space $\mathcal{B}^p$ of $L^p(\mathbb{R})$-integrable functions with $m(β)<p<\infty$, where $m(β)=β(k(β)+1)-\sqrt{β^2(k(β)+1)^2-2β}$.

comments
15 pages
fields
Probability
pdf ↗ page arXiv:2611.14655 ↗

We study (unreflected and reflected) Lévy processes that are modified at independent Poisson review epochs by a random state-dependent reset map. The first model is unreflected: between resettings the level evolves as a Lévy process, and at a resetting epoch the new level is $F$ of the level seen just before the resetting. The second model is the reflected Lévy process at $0$, but with reset maps chosen from a wider transform-solvable class. In this work, we give contraction-type ergodicity criteria for the existence of the steady-state. We identify this steady-state of the system as the solution of certain stochastic fixed-point equation. This allows to find the Laplace-transform, moments recursions, and regularly-varying-tail formulae. For non-reflected case, the examples include affine deterministic resets $F(x)=cx+b$, random-coefficient resets $F(x)=Cx+b$ with two-point $C$ for the finite-activity Lévy process, spectrally positive Lévy flight, reflected Brownian process. For the reflected cased we analyse affine resetting mechanism $F(x)=cx$, the alternating resetting $F(x)=(B-x)^+$, and uniform proportional resetting $F(x)=Cx$ with $C$ having uniform distribution.

fields
Probability
pdf ↗ page arXiv:2611.14692 ↗

In a recent study on the one-dimensional discrete parking process, it was conjectured that the number of occupied sites in the sequential model first-order stochastically dominates its static counterpart on any path graph. In this paper, we first prove this conjecture for all path graphs and then explore whether stochastic dominance holds for general graph topologies. We show that the property extends naturally to all cycle graphs, and an exhaustive computational analysis confirms that it holds for all 31 connected simple graphs with fewer than 6 vertices. For graphs with 6 or more vertices, we demonstrate that this dominance does not hold universally by constructing explicit counterexamples in which the static model dominates the sequential one; moreover, while one model always dominates the other for all connected graphs with up to 7 vertices, we show that stochastic comparability fails starting at 8 vertices. We also prove that stochastic dominance is inherited by disjoint unions when all connected components share the same dominance direction, and we exhibit mixed unions in which stochastic comparability is either preserved or lost. Finally, supported by algorithmic computations, we formulate a conjecture proposing that the dominance of the sequential model over the static one holds for all graphs with maximum degree at most 3.

comments
21 pages
fields
Probability
pdf ↗ page arXiv:2611.14718 ↗

Talagrand's convolution conjecture, recently proven by J. Lu, S. Guo, and E. Fang, concerns the smoothing properties of the heat semigroup on $\{-1,1\}^N$. We follow their perturbed coupled reverse-heat approach to generalize the theorem to tensor powers of irreducible continuous-time Markov semigroups on finite state spaces. Specifically, let $(S_t)_{t\geq0}$ be the semigroup of an irreducible continuous-time Markov chain on a finite state space $G_0$ with stationary distribution $π$. Then, for every $τ>0$, there exists a finite constant $C_{τ,S,π}<\infty$ such that, for every $N\geq1$, every nonnegative function $f:G_0^N\to[0,\infty)$, and every $η>1$, \begin{align*} π^{\otimes N}\left(S_τ^{\otimes N}f>η\int_{G_0^N}f\,dπ^{\otimes N}\right)\leq\frac{C_{τ,S,π}}{η\sqrt{\logη}}, \end{align*} where the constant is independent of $N$, $f$, and $η$. Most of the machinery developed by Lu, Guo, and Fang transfers cleanly, but since probability distributions on $|G_0|$ elements are not determined by their mean for $|G_0|>2$, we must use explicit terminal bridge laws to find a dimension-independent bound for the terminal-discrepancy estimate. We have formalized our result in Lean 4. The formalization is publicly available.

comments
25 pages
fields
Probability
pdf ↗ page arXiv:2611.14869 ↗

For the attractive logarithmic potential, we prove that the partition function is bounded uniformly in the number of particles on every compact inverse-temperature interval $[0,\be_0]$ with $\be_0<B$, where $B\in(0,2\d]$ is the sharp constant in the logarithmic Hardy–Littlewood–Sobolev inequality. The proof separates a smooth bulk, which inherits the entropy inequality, from a short-range singular interaction. The singular contribution is controlled on the event that each box of a fixed grid contains few particles. The complementary overcrowding event has exponentially small probability, which compensates a crude linear-in-$N$ bound on the log partition function. The resulting estimate supplies the partition bound that can be used recycled in a few different results. A separate Lean formalization verifies the conditional partition-bound theorem under the log-HLS assumption.

fields
Probability, Analysis of PDEs
pdf ↗ page arXiv:2611.14914 ↗

Let $X_1,X_2,\ldots$ be independent copies of a full random vector in $\mathbb R^p$, where $p$ is fixed. We prove that Hotelling's $T^2$-statistic at a prescribed location converges to $χ_p^2$ if and only if the underlying distribution belongs to the generalized domain of attraction of the normal law and has that location as its mean. Our proof of necessity combines moment bounds with matrix comparisons for self-normalized sums. It yields a sharp moment inequality for the squared norm of the uncentered self-normalized sum. Convergence of the first two moments of this squared norm to the chi-square values implies generalized normal attraction and identifies the mean. The necessity part of the multivariate Student normal-limit theorem follows as a corollary. Its sufficiency is the established result of Sepanski and of Vu, Maller and Klass.

comments
13 pages, comments are welcome
fields
Probability
pdf ↗ page arXiv:2611.14977 ↗

We establish quantitative uniform-in-time propagation of chaos for a generalization of the classical Kuramoto model on spheres of arbitrary dimension. For $n$ particles that are initialized independently from a probability measure with an $L^p$ density, $p>1$, and a nonzero mean vector, we obtain an explicit high-probability bound for the supremum over all times of the Wasserstein distance between the empirical and mean-field distributions. In sufficiently high dimension, this bound has the same order as the standard empirical sampling rate on the sphere and is therefore optimal. The proof combines a finite-time propagation of chaos estimate, a quantitative synchronization result for the mean-field model, and a late-time stability estimate of the system.

comments
20 pages
fields
Probability, Mathematical Physics, Analysis of PDEs
pdf ↗ page arXiv:2611.15015 ↗

We consider an $N\times N$ complex Gaussian random band matrix in one dimension with band width of order $W$, in the periodic block form of Yau and Yin. The $N$ sites are split into $n=N/W$ blocks of size $W$ on a ring, and the entries are nonzero only within a block and between adjacent blocks. The conjectured localization–delocalization transition occurs at $W\sim\sqrt N$. We prove quantum unique ergodicity for bulk eigenvectors at every deterministic rank whenever $W^2/N\to\infty$, with no power or logarithmic separation between $W^2$ and $N$. At the threshold $N/W^2\toτ\in(0,\infty)$, we show that the rescaled bulk eigenvalues and the block-mass profiles of their eigenvectors (the probability measures on the circle placing at $k/n$ the squared norm of the eigenvector on block $k$) converge jointly to a unique law. This law is encoded by a random entire function whose zeros give the limiting eigenvalues, and its derivatives there give the limiting profile integrals. The law of this function is determined by the Dorokhov–Mello–Pereyra–Kumar (DMPK) diffusion of the unitary class. In the critical law, the profiles have strictly positive variance against every nonconstant smooth test function, so they are not concentrated on the uniform profile. As $τ\to0$ this variance vanishes and the local spectrum tends to the sine process. As $τ\to\infty$ it tends to a Poisson process where both limits taken after the critical one. The critical family thus interpolates between the delocalized and localized regimes, confirming for this model the prediction of Fyodorov and Mirlin that at $W^2\asymp N$ the joint law of eigenvalues and eigenvectors depends only on $N/W^2$. The full content of this work has been autoformalized in Lean4 by AxiomProver.

comments
302 pages; 53 figures
fields
Probability, Mathematical Physics, Spectral Theory
pdf ↗ page arXiv:2611.15085 ↗

In this paper, we consider the Gaussian $β$ corner process, whose edge particles are known to converge to the Tracy-Widom $β$ law. We study the almost sure behaviour of the extrema of the whole trajectory of the edge particles and establish a law of fractional logarithm (LFL) for the corner process for every fixed $β>0$, extending the previous known results in the case $β=1,2$. Our proof relies on the upward Gamma and downward Dirichlet secular equations, which can be regarded as two discrete dynamics to form the corner processes. The secular dynamics are used in both the correlation estimate and the decorrelation estimate, which are known as two key steps of proving LFL in \cite{BCEHK-LFL} for the Wigner minor process. Especially, in the decorrelation part, they are used as discrete analogues of the continuous Dyson Brownian motion.

fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2611.15096 ↗

Moving cut loci can change the limiting covariance of sample Huber means even when the cut locus of the population mean has probability zero. On a closed connected Riemannian manifold, we prove that the averaged logarithm field is $C^1$ near a point $m$ whenever the sampling law has a continuous density near its cut locus. The result holds for every continuous weight depending only on the observation, and the covariant derivative includes an explicit integral over the regular cut locus. When $m$ is a Huber mean for a fixed positive threshold, assume that the distance to $m$ has no atom at that threshold. The Hessian of the population risk then equals the expected pointwise Hessian minus a positive semidefinite cut locus correction. If $m$ is unique and this Hessian is positive definite, every measurable selection of global minimizers for i.i.d. samples satisfies a tangent-space central limit theorem. The cut loci of points in a ball of radius $δ$ sweep out a region of volume $O(δ)$, uniformly in the centre. These results establish the volume and integrability conditions previously assumed in a central limit theorem for intrinsic Fréchet means. At each fixed centre, the volume measure on this region, divided by $δ$, converges weakly to an explicit measure on the regular cut locus. The Huber correction vanishes exactly when the region swept out about $m$ has probability $o(δ)$.

fields
Probability, Statistics Theory
pdf ↗ page arXiv:2611.15177 ↗

We prove that the collection of all cluster boundaries of near-critical site percolation (with a fixed parameter) on the triangular lattice has a unique scaling limit in the loop-ensemble space, as the mesh size tends to 0. This answers a problem proposed by Camia, Fontes and Newman (2006). Using this, we also prove that near-critical percolation exploration path in a disk converges in distribution to a continuous path as the mesh size goes to 0. The main idea of our proof is to construct the cut-off loop ensembles under the near-critical coupling, based on the enhanced networks and the quad-crossing scaling limits of near-critical percolation constructed by Garban, Pete and Schramm (2018); the proof also relies on the study of the geometry of cluster chains. Some properties of the limiting loop ensemble, including rotation invariance, scale covariance and finite chaining, are established. Moreover, a few applications of our scaling-limit result and proof strategy are discussed.

comments
61 pages, 19 figures
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2611.15209 ↗

We consider temporal approximations of stochastic PDEs driven by additive space-time white noise, with nonlinearities that may lose both integrability and regularity. Our key examples are the stochastic Burgers equation in dimension 1 and the stochastic Cahn-Hilliard equation in dimensions $\leq 3$. We show that the accelerated exponential Euler scheme achieves a rate of convergence in probability that is well beyond the state of the art: arbitrarily close to $3/4$ in the case of Burgers and $1-d/8$ in the case of Cahn-Hilliard.

comments
31 pages
fields
Probability, Numerical Analysis
pdf ↗ page arXiv:2611.15228 ↗

We give a new, short, and intuitive proof of the strong law of large numbers for i.i.d. random variables.

fields
Probability
pdf ↗ page arXiv:2611.15294 ↗

We study the notion of duality in the setting of time-inhomogeneous Markov processes. We define duality with time-dependent duality functions. We establish the connection between duality and time-dependent symmetries and intertwinings. We illustrate the abstract results with examples from interacting particle systems and diffusion processes.

comments
46 pages
fields
Probability
pdf ↗ page arXiv:2611.15334 ↗

We study how quickly the normalized Polyak–Ruppert average approaches its Gaussian limit in linear stochastic approximation with bounded i.i.d.\ coefficients. For step sizes decaying as $k^{-γ}$, with $1/2\leγ<1$, we prove an upper bound of order $n^{γ-1}$ on the approximation error over convex sets in fixed dimension. A matching lower bound holds for every fixed model. The fastest rate in this range is $n^{-1/2}$, attained at $γ=1/2$. We also obtain an $O(n^{-1/2})$ bound on the error of the recursive multiplier bootstrap procedure.

comments
26 pages
fields
Probability, Statistics Theory
pdf ↗ page arXiv:2611.15442 ↗

Choose a random plane that hits a solid torus. How likely is the slice to be a single disk, and how fat should the doughnut be to make this as likely as possible? Answering requires saying precisely what a "random plane" is. We explain this from scratch, first for random lines in the plane and then for random planes in space, and then solve the problem with nothing more than calculus. Along the way we meet a two-dimensional cousin of the problem (the doughnut's shadow) and two tempting wrong turns. One wrong turn appeared in print; it turns out to be a correct solution of the two-dimensional cousin. The other was the author's own first attempt, which luckily stayed in a drawer.

comments
11 pages
fields
Probability, Metric Geometry
pdf ↗ page arXiv:2611.15546 ↗

High-order recombination keeps weak approximation trees of diffusions small by a moment-preserving reduction of the measure on each patch of nodes. The weighted Litterer–Lyons (WLL) test of Ninomiya and Shinozaki sets the patch scale using a scalar \(λ>0\) chosen beforehand, whose appropriate value depends on coordinate units. First, the anisotropically weighted Litterer–Lyons (AWLL) rule selects the scale during recombination within a bounded factor of the measured increment amplitude. On a fixed set of nodes, expanding coordinate units leaves the AWLL patch-count bound unchanged but raises the WLL lower bound as a power until saturation. In Heston and shifted Stochastic-Alpha-Beta-Rho (sSABR) systems with initial price or forward rate 100, AWLL reduces the terminal supports of WLL with \(λ=1\) by factors of 137 and 1488 at comparable errors, but enlarges them at smaller Heston initial prices. Second, \(λ\) is extended to a positive definite matrix with a joint error bound for prices and sensitivities, a bound on the gain of its shape, and patch-count bounds. Third, the elimination stage of batched basis exchange requires \(O(J)\) arithmetic operations for \(J\) nodes at fixed moment rank and panel width, against \(Θ(J^{3})\) for the direct kernel update of Ninomiya and Shinozaki.

comments
46 pages, 5 figures
fields
Probability
pdf ↗ page arXiv:2611.15564 ↗

Bonnefont, Rajamäki and Vargas conjectured that, for complex Gaussian multiplicative chaos built from a single real Gaussian field, the Fourier dimension at $α+iβ$ equals the dimension of the real chaos at $α$ minus $β^2$. We prove the conjecture on the circle throughout their stated parameter range. For the canonical holomorphic family, the identity holds on one event of probability one for all $γ=α+iβ$ in the union of the open unit disk and the region $1/\sqrt2<|α|<\sqrt2$, $|α|+|β|<\sqrt2$. For each fixed parameter on the conjecture's sloping boundary, where $1<|α|<\sqrt2$ and $|α|+|β|=\sqrt2$, the Fourier coefficients decay at a logarithmic rate almost surely and the Fourier dimension is zero. For nonzero interior parameters with $|α|\ne1/\sqrt2$, the critical Sobolev index is half the Fourier dimension minus $1/2$. The chaos fails to belong to the corresponding space when $|α|<1/\sqrt2$ and belongs to it when $|α|>1/\sqrt2$. For $1/\sqrt2<|α|<\sqrt2$ and $|β|\le\sqrt2-|α|$, we bound the Fourier coefficients at the decay power predicted by the dimension formula, up to logarithmic factors. For $0<|γ|<1$ and $α^2<1/2$, the measures obtained by multiplying the squared modulus of the smoothed chaos by $ε^{|γ|^2}$ converge weakly almost surely along $ε=e^{-m}$, uniformly on compact parameter sets, to explicit multiples of the real chaos at $2α$.

comments
72 pages
fields
Probability
pdf ↗ page arXiv:2611.15733 ↗

How many rounds of parallel queries are needed to sample from a smooth, strongly log-concave distribution on $\mathbb{R}^d$? For every fixed condition number $κ\in (1, \infty)$, we prove that any sampler making polynomially many queries per round requires $Ω_κ(\log d)$ rounds to achieve constant total variation error in the worst case. The lower bound holds even if queries return derivatives of all orders. Together with the first-order parallel Picard algorithm of \cite{zhou2025parallel}, this establishes a depth complexity of $Θ_κ(\log d)$ for parallel log-concave sampling with $\operatorname{poly}(d)$ width. We then study centered Gaussian targets to understand how much width is needed at a given depth. From \cite{chewi2023query,zhou2026complexitygaussiansampling}, it is known that either one round of width $d$ or $\mathcal{O}(\sqrtκ \log d)$ rounds of constant width suffice for first-order Gaussian sampling. At fixed $κ$ we characterize the depth-width tradeoff interpolating between these regimes: when using $ \lceil c \log d\rceil$ rounds, if $0 < c < c_\star(κ)$ then the optimal width at constant TV error is $\widetildeΘ(d^{1-c/c_\star(κ)})$, while if $c \geq c_\star(κ)$ then it is $Θ_κ(1)$. Here, $c_\star(κ)$ is an explicit constant with $c_\star(κ) \sim \sqrtκ / 8$ as $κ\to \infty$.

fields
Probability
pdf ↗ page arXiv:2611.15849 ↗

We study the small-noise behaviour of a two-dimensional stochastic nematic liquid crystal model, where the Navier–Stokes equations with multiplicative noise are coupled with a Ginzburg–Landau equation for the director field driven by geometric Stratonovich noise. While large deviations for stochastic nematic liquid crystal models have been studied earlier, the central limit and moderate deviation regimes have not been considered. We first prove a central limit theorem in the natural energy space and show that the rescaled fluctuations converge, in every $L^p$-norm and with rate $\sqrt{\eps}$, to the solution of a linear stochastic system. The limiting process is centred Gaussian. We then establish a moderate deviation principle with a quadratic rate function determined by the corresponding linearised skeleton equation, which coincides with the Cameron–Martin form of the Gaussian limit. We also show that the moderate deviation principle holds uniformly over bounded sets of initial data. The main arguments use a cancellation between the coupling terms, a one-sided estimate for the polynomial potential, and energy estimates with deterministic Gronwall coefficients, thereby avoiding exponential moment estimates.

fields
Probability, Analysis of PDEs
pdf ↗ page arXiv:2611.15900 ↗

We study discrete-time random walks on a locally finite graph whose conductances are non-decreasing in time and bounded on each edge. We compare their hitting probabilities with those of the time-homogeneous walk obtained by fixing the conductances at the starting time. These estimates give proofs of two results established in greater generality by Li and Park: if the upper network is recurrent, every vertex is visited infinitely often almost surely; if the initial network is transient, the expected number of visits to each vertex is finite. In a finite domain, the difference between the two exit probabilities is bounded by the square root of the product of a capacity increment and a dual energy. We obtain a corresponding infinite-volume estimate for the probability of never hitting a given vertex. To prove these estimates, we compare two Dirichlet forms and use a contraction property of the killed transition operators. We also consider walks on increasing finite sets. On each prescribed time interval, called a plateau, the transition operator is fixed. A lower bound on transition probabilities after mixing and an upper bound on the expected number of returns give a sufficient condition for every vertex to be visited infinitely often almost surely. For uniformly elliptic lazy walks on boxes of radius $R_n$ in $\mathbb Z^d$, $d\geq3$, it is enough that $\sum_n(L_n-b_n)_+/R_n^d$ diverges, where $L_n$ is the duration of the $n$th plateau and $b_n=\lceil aR_n^2\rceil$.

fields
Probability
pdf ↗ page arXiv:2611.15999 ↗

Using point process theory we propose and investigate a probabilistic identification of zeros of a deterministic real valued function. We construct a random atomic driving measure for a Cox point process whose mass at a candidate location depends explicitly on the value of the function at that location. We study the properties of the constructed random measure, including its exact asymptotic properties, its Laplace functional and related random processes. We also give an important application involving zero detection for Riemann's ξ function.

comments
31 pages; work towards building a rigorous criterion for probabilistic zero detection and identification
fields
Probability, Statistics Theory
pdf ↗ page arXiv:2611.16011 ↗

We study MA(1) processes with uniform innovations conditioned to remain positive for a long time when $|θ|>1$, where $θ$ denotes the coupling parameter. We show that, for a fixed starting point, the finite-dimensional distributions of the conditioned process converge and identify the limiting process as a Doob $h$-transform with explicit function $h$. We also obtain precise asymptotics for the corresponding persistence probabilities. The limiting process exhibits qualitatively different behaviour depending on $θ$ and on the support of the innovation distribution. We also determine stationary distributions of the limiting conditioned processes for all $θ\ne 1$.

comments
32 pages, 1 Figure
fields
Probability
pdf ↗ page arXiv:2611.16041 ↗

This is an expository note on the asymptotics of the Wasserstein distance between the empirical measure of infinite-dimensional random paths and their common distribution. We present the classical proof for these asymptotics in the case of the Wiener measure, unifying quantization arguments from Dereich and coauthors or Boissard and Le Gouic, and we adapt it for Itô diffusions sampled through the Girsanov theorem. More precisely, let $\mathbb{Q}$ be the law of the solution of a stochastic differential equation with a bounded Lipschitz drift. Let $W_1,\ldots,W_n$ be independent Brownian paths, and let $Z_i$ be their Girsanov weights for $\mathbb{Q}$. The reweighted empirical measure $$\widehatμ_n=\frac{\sum_{i=1}^n Z_iδ_{W_i}}{\sum_{i=1}^n Z_i}$$ approximates $\mathbb{Q}$ when $n$ is large. We prove that the Wasserstein cost $W_p^p(\widehatμ_n,\mathbb{Q})$ is of order $(\log n)^{-p/2}$, in expectation and almost surely, for every fixed $p\geqslant1$. In the Brownian case where $Z_i=1$ these results show that $\sqrt{\log n}W_p(\widehatμ_n,\mathbb{Q})$ is asymptotically sandwiched between $\sqrt{2λ_d}$ and $4\sqrt{2λ_d}$, where $λ_d$ is the first eigenvalue of the Laplacian operator in the unit ball. We provide numerical experiments to estimate the (conjectured) limiting constant in dimension $d=1$.

comments
16 pages. Full Lean formalization publicly available at gitlab.com/SimonCoste/wasserstein
fields
Probability, Functional Analysis
pdf ↗ page arXiv:2611.16043 ↗

Linear expansions in Brownian Stratonovich signatures, which originate in stochastic Taylor expansions, are increasingly used to represent and model processes with memory. Their numerical use requires truncating the signature at a level $M$ and discretising the driving path along $N$ steps. Under a simple growth condition on the coefficients of the linear expansion, we establish strong and weak convergence rates for both approximations, uniformly in time. The strong truncation error decays like $(B^M/(M!)^\varepsilon)^a$ for some constant $B$, uniformly in $N$, where $\varepsilon$ measures the growth of the coefficients and $a$ the regularity of the test function; the weak error does not improve on it. The discretisation error is of order $N^{-a/2}$ in $L^p$, and $N^{-1}$ weakly for polynomial test functions, uniformly in $M$. All these rates are sharp for polynomial test functions, and $M$, $N$ can be chosen independently. We extend the estimates to errors in probability, on distribution functions and on risk measures, and illustrate them on stochastic delay equations, Volterra processes and option pricing in signature volatility models.

comments
39 pages, 5 figures
fields
Probability
pdf ↗ page arXiv:2611.16087 ↗

Let $ρ_n$ be a real orthogonal representation of the symmetric group $S_n$ of dimension $d_n\to\infty$, let $σ_n$ be a uniform random permutation, and let $O_n$ be an independent Haar-orthogonal matrix. We study the linear statistics $\operatorname{Tr}(A_nO_nρ_n(σ_n)O_n^T)$ for deterministic real test matrices $A_n$ normalized only in Frobenius norm, which allows tests that isolate individual entries. Conditionally on $σ_n$, the statistic has mean $s_nχ_n(σ_n)$, where $χ_n$ is the character of $ρ_n$ and $s_n=d_n^{-1}\operatorname{Tr} A_n\to s$. We show that the centered statistic has conditional Gaussian limit $N(0,1-s^2)$ for every such test if and only if the trivial and sign constituents of $ρ_n$ occupy $o(d_n)$ dimensions, and that this limit is asymptotically independent of every convergent $σ_n$-measurable observable. The key input is a tensor-square estimate, based on the Frobenius-Schur identity and the minimum degree of non-linear irreducible representations of $S_n$, which shows that this single condition controls both normalized traces needed in the Haar-conjugation argument. For the uncentered statistic, convergence in distribution of $χ_n(σ_n)$ to a law $Ξ$ is necessary and sufficient for every test statistic to converge to $sΞ+\sqrt{1-s^2}G$, with $G$ standard Gaussian and independent of $Ξ$. For every irreducible sequence with $d_n\to\infty$, finitely many entries scaled by $\sqrt{d_n}$ have independent standard Gaussian limits. Finally, we compute $Ξ$ explicitly for diagrams with a fixed first-row tail, their transposes, and diagrams with sublinear largest hook, answering in these cases a question of Tsou.

comments
34 pages, 1 figure, 1 table
fields
Probability
pdf ↗ page arXiv:2611.16154 ↗

We resolve Erdős Problem~521 by proving that the normalized real-root count $N_n/\log n$ of Rademacher polynomials almost surely has no limit. More generally, consider the Kac polynomials \[ P_n(x)=\sum_{j=0}^{n}ξ_jx^j \] with i.i.d.\ real coefficients of mean zero, variance one, and a finite absolute exponential moment. Let $N_n$ denote the number of distinct real roots of $P_n$. We prove that, almost surely, \[ \liminf_{n\to\infty}\frac{N_n}{\log n}=\frac1π, \qquad \limsup_{n\to\infty}\frac{N_n}{\log n}=\frac1π+C_*, \] and the set of subsequential limits is exactly \[ \left[\frac1π,\;\frac1π+C_*\right]. \] Here $C_*>1/π$ is a constant uniquely determined by an equation. The lower-limit identity remains valid under the weaker assumption that $\mathbb{E}|ξ_0|^{2+δ}<\infty$ for some $δ>0$.

comments
49 pages, no figure
fields
Probability
pdf ↗ page arXiv:2611.16157 ↗

This paper introduces a model for infinite-server queues driven by a Cox process with stochastic intensity given by a squared Bessel (BESQ) process. Exploiting the affine structure of the underlying dynamics, we derive a closed-form expression for the joint moment-generating function (MGF) of the arrival intensity, the number of customers in the system, and the integral of the number of customers in the system over a time interval. The asymptotic properties of the model are also analysed. We establish laws of large numbers, central limit theorems, large deviation principles, and moderate deviation principles for several quantities of interest. More precisely, these results are obtained for three important settings: cumulative occupancy over a finite time interval, system occupancy under a diverging long-run mean arrival intensity, and the superposition of independent infinite-server queues with Cox-BESQ arrival intensities. Numerical experiments illustrate the associated rate functions and demonstrate the effectiveness of the resulting rare-event approximations.

comments
39 pages
fields
Probability
pdf ↗ page arXiv:2611.16195 ↗

For a centered Gaussian process $G$ with continuous sample paths on a compact metric space $T$, a continuous drift $f: T \mapsto \mathbb{R}$, a noise level $σ>0$, and $ε\ge 0$, let $A_ε$ be the set of points at which $f+σG$ is within $ε$ of its maximum. Writing $\mathbb{E}\sup_TG$ for the expected supremum of $G$, we prove that the expected squared diameter of $A_ε$ in the canonical pseudometric of $G$ is at most $8ε\mathbb{E}\sup_TG/σ$ and that the expected maximal squared distance from a point of $A_ε$ to an exact maximizer is at most $4ε\mathbb{E}\sup_TG/σ$. The constants cannot be improved uniformly over index sets, processes, and drifts, and no logarithmic factor in $ε$ appears, unlike in bounds integrated from tail estimates. At $ε=0$ the bounds give the almost sure uniqueness of the maximizer in the canonical pseudometric without nondegeneracy assumptions. Given this uniqueness, both bounds follow from a bound with constant $2$ on the mean square of the largest increment of an independent copy of $G$ from an exact maximizer to a point of $A_ε$. The proof rests on an identity for the mean squared support function of the $ε$-subdifferentials of a smooth convex function at a standard Gaussian vector, obtained from two Gaussian integrations by parts.

fields
Probability, Statistics Theory
pdf ↗ page arXiv:2611.16233 ↗

In dimension $d$, we consider stochastic differential equations driven by additive fractional Brownian motion with Hurst parameter $H<1/2$ and with a time-dependent drift that is $p$-integrable in space and $q$-integrable in time. Under the subcriticality condition $\frac{Hd}{p}+\frac1q<1-H$, complemented by two integrability conditions needed for Girsanov's theorem, we prove strong existence and path-by-path uniqueness of solutions. We also establish stability with respect to the initial data and the drift, both pathwise and in moment norms, and construct a Hölder continuous semiflow. When $H$ approaches $1/2$, our conditions reduce, up to an endpoint case, to the condition of Krylov and Röckner (2005) for Brownian motion, and in dimension one they complement the results of Nualart and Ouknine (2003), which rely on comparison arguments. Our methods combine the stochastic sewing lemma, Lyons' rough path theory, and the quantitative John–Nirenberg inequality for stochastic processes of vanishing mean oscillation.

fields
Probability
pdf ↗ page arXiv:2611.16344 ↗

We investigate qualitative and quantitative continuity of martingale optimal transport under perturbations of both marginals in dimensions $d\geq2$. We assume that each pair of marginals admits a reference martingale coupling whose density relative to the product of its marginals is bounded above and away from zero, uniformly along the sequence. If the limiting target measure is not carried by a hyperplane, we prove continuity under $W_1$-convergence for continuous costs of at most linear growth, assuming only finite first moments. For Lipschitz costs, a uniform $p$-moment bound on the targets, $p>1$, yields an explicit stability estimate with exponent $(1-1/p)/2$; uniformly bounded target supports give exponent $1/2$. The proof constructs a correction of couplings with small martingale bias while preserving both marginals. Truncated moment corrections allow the target measure to have unbounded support. The construction also shows that every martingale coupling of the limiting marginals can be approximated in $W_1$ by martingale couplings of the approximating marginals. We also discuss counterexamples showing that neither the uniform density condition nor non-degeneracy of the limiting target measure can be omitted in general.

fields
Probability
pdf ↗ page arXiv:2611.16429 ↗

We prove zero $1$-capacity of first-gap collisions for the minimal Liouville spectral Green-response form and its canonical extension. The minimal-form diffusion avoids collisions for every initial law absolutely continuous with respect to the spectral law.

fields
Probability, Mathematical Physics, Spectral Theory
pdf ↗ page arXiv:2611.16432 ↗

Using wavelet series, we construct Gaussian stochastic processes whose pointwise Hölder exponent is random along a typical sample path, although at every fixed point the exponent is deterministic almost surely. We first give a local non-sparsity condition under which the Hölder exponent almost surely is a deterministic function. In the opposite direction, a lacunary construction shows that the exceptional set on which the exponent is modified can have full Hausdorff dimension. For this model we determine the marginal multifractal spectra and the bivariate spectrum of the deterministic series and its Gaussian randomization.

comments
33 pages
fields
Probability
pdf ↗ page arXiv:2611.16465 ↗

The dynamical Seppäläinen-Johansson first passage percolation defines a random directed metric on $\mathbb Z^2$ where the environment is updated according to a Poisson process. We show that its finite dimensional distributions converge after $0:1:2$ scaling to those of the Brownian web landscape defined on the finite dimensional marginals of the dynamical Brownian web. We prove non-uniqueness of geodesics in the Brownian web landscape and we relate it to exact formulas on one-sided reflected Brownian motions. We prove a locally uniform law of large numbers and uniform deviation bounds, and identify Poisson increment-stationary laws for the associated height evolution.

comments
44 pages, 2 figures
fields
Probability
pdf ↗ page arXiv:2611.16599 ↗

Sample distance correlation can remain large between independent random walks. For centred walks with independent, identically distributed increments of finite, positive variance, we prove convergence in distribution to the distance correlation of the joint occupation measure of two independent Brownian paths. This universal limit lies strictly between zero and one almost surely and has full support on the unit interval. We calculate the expected squared distance covariance of the limiting measure and show that ordinary permutation calibration rejects independence with probability tending to one at every fixed nominal level. Gaussian simulations illustrate the persistent dispersion of random-walk correlations and the failure of permutation calibration.

fields
Probability, Statistics Theory
pdf ↗ page arXiv:2611.16614 ↗

In this paper, we introduce a time-changed compound Poisson process (TCCPP) obtained by subordinating the classical compound Poisson process (CPP) with a subordinator and an inverse subordinator, which are defined via distinct Bernstein functions. We study the governing equations and distributional properties of a TCCPP including its moments, dependence structure and limiting behaviour. We derive distributions of the integrated CPP and a linear combination of TCCPPs. We also obtain the law of iterated logarithm, the central limit theorem and weighted sum representation for a TCCPP. Finally, we provide some characterizations of a TCCPP in terms of martingales, a univariate multinomial process, a triangular array process and waiting time distribution. The proposed framework generalizes several existing fractional stochastic processes and offers greater flexibility for modelling complex count data.

comments
29 pages
fields
Probability
pdf ↗ page arXiv:2611.16676 ↗

We study the outlying eigenvalues of a sample covariance matrix whose population covariance is itself random. The population covariance is $Σ_p=A_p+O_pB_pO_p^*+σ^2I_p$, where $A_p$ and $B_p$ are deterministic positive semidefinite matrices of fixed ranks $r$ and $s$, and where $O_p$ is Haar distributed on the orthogonal group in the real case, and on the unitary group in the complex case. Conditionally on $O_p$, we observe $n$ independent centered Gaussian vectors with covariance $Σ_p$, and we build the sample covariance matrix $\widehatΣ_p$ from these vectors. The fluctuations of the spike eigenvalues of $\widehatΣ_p$ come from two different sources: the Haar matrix $O_p$, which displaces the population spikes at the scale $1/p$, and the sampling, which acts at the scale $n^{-1/2}$. Comparing these two scales amounts to comparing $p^2$ with $n$, so the ratio which governs the fluctuations is $p^2/n$, while in the classical spiked model it is the aspect ratio $p/n$. We give the limiting law of each spike in four regimes where $n,p\to \infty$. When $p/n\to c>0$, and when $p/n\to0$ with $p^2/n\to\infty$, the sampling term dominates, the limit does not depend on $O_p$ and is Gaussian, as in the classical spiked model. When $p^2/n\to0$, the Haar randomness dominates, and the limit is a weighted sum of independent $χ^2_1$ variables in the real case, and of independent exponential variables in the complex case. When $p^2/n\toτ\in(0,\infty)$, the two terms are of the same order, and the limit is the convolution of Gaussian and $χ^2_1$ or Exponential variables. We then apply these results to a linear mixed model with a continuous batch effect, in which the Haar assumption is what makes the separation of the signal and of the batch possible, and we build a test for the value of a single spike.

fields
Probability
pdf ↗ page arXiv:2611.16739 ↗

The main aim of this work is to investigate the limiting behavior and asymptotic properties of time-dependent slow-fast stochastic dynamical systems. The slow component is driven by a stochastic process with Hölder-continuous paths of regularity greater than 1/2, while the fast component is driven by a Brownian rough path. We introduce a novel Young-rough integration framework tailored to such systems and establish well-posedness results, providing the analytical foundation for further asymptotic analysis. Building on this framework, we employ Khasminskii's time-discretization method to establish the strong convergence of the slow component to the solution of the corresponding averaged equation in the L^p-sense. Furthermore, when the driving noise in the slow equation is specified as a fractional Brownian motion, we apply the weak convergence approach to establish a uniform large deviation principle for the slow component, uniformly over compact sets of initial conditions, in the Hölder topology.

fields
Probability, Dynamical Systems
pdf ↗ page arXiv:2611.16762 ↗

Counting (integer) lattice points in a convex body $K$ has a rich history, beginning with the famous circle problem imposed by Gauss in 1834. Clearly, the number of covered lattice points depends on the position, orientation, size, and shape of $K$ in a delicate way. In 1947, Kendall was the first to consider a randomized version of this problem by allowing random translations of $K$. In this survey, we aim to provide an overview of the current state of research on the \emph{randomized lattice-point count problem}, i.e.\ on the distribution of the lattice-point count under random rotations and translations of $K$. As it turns out, even the variance is far from being well-understood, leaving multiple open questions for future research. The motivation for the present work grew out of the author's research interest in a related combinatorial problem, dealing with the convex hull of all covered lattice points.

comments
20 pages
fields
Probability, Combinatorics
pdf ↗ page arXiv:2611.16769 ↗

Let $M$ be a $d$-dimensional compact connected Riemannian manifold $M$ with boundary $\pp M$, and let $X_t$ be the diffusion process generated by $L:=\DD+\nn V$ for some $V\in C^2(M)$ which is killed on the boundary. For any initial distribution $ν$ which is not fully supported on $\pp M$, let $μ_t^ν$ be the conditional empirical measure for the diffusion process under the condition that the process is not yet killed at time $t$, and let $μ_0$ be the associated quasi-stationary distribution. We derive the sharp convergence rate of $μ_t^ν$ to $μ_0$ in the quadratic Wasserstein distance $\W_2$ as $t\to\infty$. In particular, if $ν(B(x,r))\asymp r^k$ for some $k\in [0,d]$ and all $r\in [0,1]$ uniformly in $x\in {\rm supp}ν$, then for large $t>0$ $$ \W_2(μ_t^ν,μ_0)\asymp_ν\begin{cases} t^{-1},&d-k<6,\\ t^{-1}\sqrt{\log t},&d-k=6,\\ t^{-\ff{d-k+2}{2(d-k-2)}},&d-k>6. \end{cases} $$ Moreover, letting $\rr_\pp(x)$ be the distance of $x$ to $\pp M$, for large $t>0$ we have $$ \W_2(μ_t^{\dd_x},μ_0)\asymp \begin{cases} t^{-1},&d\le 3,\\ t^{-1}\log (1+\rr_\pp(x)^{-1}), & d=4,\\ t^{-1} \rr_\pp(x)^{-1}, & d=5,\\ t^{-1}\sqrt{\log t} \rr_\pp(x)^{-1},&d=6,\\ t^{-\ff{d+2}{2(d-2)}}\rr_\pp(x)^{-\ff 4{d-2}},&d\ge 7. \end{cases} $$

comments
34 pages
fields
Probability
pdf ↗ page arXiv:2611.16860 ↗

We develop an iterated forward-backward stochastic differential equation (FBSDE) approach to the two-dimensional infinite-volume Abelian-Higgs model in Coulomb gauge. We prove tightness of the joint renormalized lattice gauge-Higgs laws, after continuum extension, as the lattice spacing tends to zero and the volume tends to infinity. We represent the lattice measure as the joint terminal law of the FBSDEs and establish uniform moment bounds for the corresponding terminal shifts. For the Higgs field, we combine a low-high frequency decomposition with covariant energy estimates to obtain bounds with sufficiently mild dependence on the gauge shift. For the gauge field, we establish high-frequency estimates for the effective force and combine them with quantitative diamagnetic control in the infrared.

comments
78 pages
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2611.16875 ↗

We show that at sufficiently large inverse-temperature $β>0$, the 3D Ising model on the torus, under boundary conditions that have a positive slope $θ_1,θ_2>0$, has a GFF scaling limit for its interface. The proof goes through three steps of a Tetris map, which lets cubes drop according to gravity in each of the three axes, yielding Solid-On-Solid (SOS), Half-Monotone SOS (HMSOS) and monotone surfaces (dimers). We establish GFF limits sequentially, in particular resolving the analogous problem for the $(2+1)$D SOS. A crucial ingredient is an improved RG analysis for interacting dimers, which is of independent interest: it relaxes the assumptions on interactions from being uniformly bounded in $L^\infty$ to only being typically small.

comments
192 pages, 10 figures
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2611.16943 ↗

We develop score-based generative models for time series and standard finite-dimensional data, building on the analytical computation of the expected signature of a new class of jump-diffusions, called entire sig-jump-diffusions. These are semimartingales whose characteristics are given by linear combinations of potentially infinitely many components of their own signature. We show that their expected signature can be computed by solving linear ODEs in the extended tensor algebra, providing a tractable foundation for learning procedures. Specifically, the learning of a generalized score function for jump diffusions, a key ingredient of our generative modeling framework, can be reduced to solving linear ODEs and a deterministic optimization problem. We further prove that polynomial jump-diffusions can be embedded into this framework, and that their expected signature reduces to a finite-dimensional system of linear ODEs. Building on this result, we develop an alternative approach for finite-dimensional data, based on inverse signature matching, a method that learns the score by matching the expected signature of the reverse process with that of the inverse forward signature.

fields
Probability
pdf ↗ page arXiv:2611.16995 ↗

The present paper is the second in a series of three papers in which we consider a \emph{spatial multi-type population model} arising as the many-individuals-per-site limit of individual-based models. The evolution mechanisms in this model are: migration, Fleming-Viot resampling, $Λ_0$-Cannings resampling, and $(Λ_k)_{k \in \N}$-Cannings block-resampling. This evolution leads to a collection of \emph{measure-valued} processes indexed by a continuum geographic space $Ω_N^\infty$, called the \emph{continuum hierarchical group}, obtained as the limit of a discrete hierarchical group $Ω_N^L$ as $L\to\infty$, where $Ω_N^L = \oplus_{k \geq -L} Z_N$ with $Z_N$ the cyclical group of order $N$. On this geographic space, each component is a probability measure on a type space $\K$. In the first paper \cite{gh1}, we \emph{constructed} the measure-valued process on $Ω_N^\infty$ describing the type frequencies in the population and identified its main properties. We found a \emph{dichotomy} between this process being \emph{stochastic} (= locally monotype) or \emph{deterministic} (= locally multitype). In the present paper we turn to the \emph{genealogies} of the population on $Ω_N^\infty$.

comments
54 pages
fields
Probability
pdf ↗ page arXiv:2611.17017 ↗

We study non-Hermitian matrices $Y_n$ obtained by normalizing each row of an $n\times n$ matrix with i.i.d. entries to Euclidean norm one. We consider regularly varying radial tails of index $α\in[0,2]$, with $α=0$ denoting slowly varying tails, and the broader normal domain of attraction. For $0<α<2$, assuming angular tail convergence, we prove convergence in probability of the empirical singular value measures of every shift $Y_n-zI$ to deterministic laws characterized by the root resolvent of a column-normalized directed Poisson weighted infinite tree, extending the framework of Bordenave, Caputo and Chafai (arXiv:1006.1713). Under a bounded density assumption, the empirical eigenvalue distribution converges in probability to a deterministic law $μ_α^{\mathrm{SN}}$ on $\mathbb{C}$. This law is rotationally invariant, is supported in the closed unit disk with outer radius one, and has neither point atoms nor mass on the unit circle. The laws interpolate between $δ_0$ as $α\downarrow0$ and the circular law as $α\uparrow2$. These also describe the limiting eigenvalue distributions of $Y_n$ for real entries with slowly varying tails and for centered entries with bounded density in the normal domain of attraction, respectively. For real symmetric entries with bounded density, the spectral radius converges to one in probability for $0<α\le2$, using the upper bound of Francois, Heiny and Hu (arXiv:2608.28169). We also give a general criterion identifying the outer support radius of rotationally invariant laws from fractional moments of fresh cavity weights, under explicit trace and radial-recovery assumptions.

comments
45 pages, 1 figure
fields
Probability
pdf ↗ page arXiv:2611.17064 ↗

We establish equality between several asymptotic limits of the transportation cost between stationary random measures, with respect to the Euclidean distance cost raised to the $p$-th power, with different boundary conditions. Our approach relies on a comparison with the optimizer of the mean transportation cost between the two random measures, which is defined on the whole space. In particular we do not use any PDE techniques related to the regularity theory for optimal transport maps.

fields
Probability
pdf ↗ page arXiv:2611.17066 ↗

The quantitative study of the Gaussian measure of symmetric convex sets is a central theme at the interface of probability theory and convex geometry. From a probabilistic perspective, it amounts to analyzing the tail behavior of suprema of Gaussian processes. The typical magnitude and upper tail of Gaussian processes are well-understood, thanks to Talagrand's celebrated Majorizing Measures theorem and to Gaussian concentration. In contrast, despite fundamental connections with metric entropy established by Kuelbs and Li, no general sharp characterization of the lower tail is available. In this work, we close this gap by establishing a sharp two-sided characterization of Gaussian small ball probabilities, involving both metric entropy and local widths of the underlying convex body. This yields an explicit chaining-type description of lower quantiles of Gaussian processes in terms of the metric structure of the convexified index set, as well as a general comparison inequality for convex sets. We further obtain analogous quantitative characterizations of two important geometric quantities associated with symmetric convex sets, namely intrinsic volumes (quermassintegrals) and the radii of random sections beyond the classical Dvoretzky range. A unifying theme of these results is the central role of convexity in the quantitative understanding of small ball probabilities.

comments
63 pages
fields
Probability, Functional Analysis, Metric Geometry
pdf ↗ page arXiv:2611.17071 ↗

We prove a two-sided a posteriori error estimate for numerical approximations of fully coupled McKean-Vlasov forward-backward SDEs with jumps under full-tuple law dependence. The coefficients may depend on the joint law of $(X,Y,Z,U)$, and we allow infinite jump activity. We construct a computable estimator ${\mathcal{E}_π}$ for the squared full-tuple error ${\mathcal{D}_π}$ relative to the exact Euler solution. The estimator uses the boundary and cumulative residuals of any admissible grid approximation. Under monotonicity and on sufficiently fine grids, $c\,{\mathcal{E}_π} \le {\mathcal{D}_π} \le C\,{\mathcal{E}_π}$. The efficiency bound holds without monotonicity or a mesh restriction. Analogous two-sided bounds hold for the continuous-time error up to a discretisation remainder that vanishes under coefficient time regularity. Closed-form and state-nonlinear benchmarks cover full-tuple law dependence, mark-dependent jump integrands, nonzero orthogonal martingales and infinite jump activity. In our experiments, the estimator tracks the discrete error during neural training and across Picard iterations. In a mean-field inventory model, we use the estimator and a computable discretisation term to bound the excess cost of the computed control over the discrete optimum.

comments
54 pages, 8 figures
fields
Probability, Numerical Analysis
pdf ↗ page arXiv:2611.17087 ↗

The friendship paradox describes a bias in mean degree induced by neighbour sampling. We study signed weighted networks, with transitions proportional to edge magnitudes and signed strength as the vertex score. We characterize all positive initial weights, depending on total strength and score, that guarantee a nonnegative one-step mean change on every connected graph. Without regularity assumptions, the same condition yields stochastic dominance at every fixed time. Continuous admissible rules are precisely total strength multiplied by a positive continuous nonincreasing function of the score. It is enough to test connected graphs with at most five vertices and two vertex types. The bound of five is optimal even for continuous rules; the proof uses a sharp four-vertex energy inequality. The complete score vector alone cannot determine a universally valid initial law with full support. Under marked local convergence and suitable integrability assumptions, we also obtain joint limits for local conditional mean score increments and compute an explicit limiting law and mean for independently signed random regular graphs. Under joint cut-norm convergence of the magnitude and signed kernels and uniformly bounded normalized strengths, we also obtain Wasserstein convergence of the sampling-weighted distributions of normalized local biases and convergence of their means.

fields
Probability
pdf ↗ page arXiv:2611.17118 ↗

We present a new, simple and self-contained technique for proving a mass gap for Euclidean quantum field theories in the high-temperature regime using the stochastic quantisation approach. As an application, we establish exponential decay of spatial correlations for the fractional $Φ^4$ model on the plane in the Wick-ordering regime. The key idea is to analyse the propagation of perturbations using the linearised stochastic quantisation equation. Spatial propagation is controlled by an auxiliary random walk, while the potentially destabilising effect of the renormalised nonlinearity is controlled by combining dissipative energy estimates for the nonlinear dynamic with the Boué-Dupuis variational formula.

comments
20 pages
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2611.17119 ↗

We link the solvability of backward stochastic differential equations with time-augmented Brownian signature data to the solvability of a differential equation on the tensor algebra of signature coefficients. We show that in certain cases the solutions are of closed form and remain within the class of linear functionals of the signature. Lastly, we derive a closed-form solution to a pricing and hedging problem in terms of the time-augmented Brownian signature.

comments
12 pages
fields
Probability, Optimization and Control
pdf ↗ page arXiv:2611.17175 ↗

We consider a nearest-neighbor Gibbs measure on a region in $\mathbb{Z}^2$ (e.g., the Ising model) tilted by $\sum_{x,r} g_{x,r}$, where $g_{x,r}$ is an arbitrary function of the spins in the ball of radius $r$ about $x$, with $\|g_{x,r}\|_\infty\leq \exp(-C r)$: an exponential decay in the radius of the ball rather than in its volume. Standard cluster expansions fail for such many-body tilts, as a ball of radius $r$ carries $\exp(c r^2)$ configurations. We show that the partition function can be resummed into a polymer model whose polymers are outer boundaries of connected unions of balls, decorated by the spins along them, with weights decaying exponentially in the boundary length. The proof uses only the domain Markov property of the base measure; it develops a version of this resummation argument that appeared in a recent work of the authors in the context of RG analysis of Grassmann variables. As applications, we show convergent cluster expansions for many-body tilts of Ising models at high and low temperatures; existence of infinite-volume limits; and exponential decay of correlations.

comments
29 pages, 2 figures
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2611.17193 ↗

We consider an infinite system of particles on the positive real line, initiated from a Poisson point process, which move according to Brownian motion up until the hitting time of a barrier. The barrier increases when it is hit, allowing for the possibility of sequences of successive jumps to occur instantaneously. The scaling limit gives a representation for the supercooled Stefan problem and its free boundary, from which we can determine the asymptotic limit for the barrier movement. We establish also a functional central limit theorem describing the fluctuations about this limit, from which we can determine the rate of convergence for particle system approximations to the supercooled Stefan problem under ``weak feedback" assumptions introduced in arXiv:1811.12356. We finally show that these fluctuations are identical to the fluctuations of a continuous analogue to 1D-MDLA.

fields
Probability
pdf ↗ page arXiv:2611.17200 ↗

We provide an efficient implementation of combinatorial Bernoulli factories. Such a factory turns coins of unknown biases $x$ into a random vertex of a polytope $P$ whose mean is exactly $x$. For every affine slice of the cube (the class of polytopes that admit a factory), we give a single algorithm whose expected number of coin flips and running time at every interior $x$ are polynomial in the dimension and in $1/{δ_*}$, where ${δ_*}=\min_i\{x_i,1-x_i\}$ is never supplied to the algorithm. For perfect matchings this gives $O(n^{8}{δ_*}^{-2}\log(n/{δ_*}))$ flips, while the factory of Niazadeh, Paes Leme, and Schneider [STOC 2021] spends at least $n^{2n-1}$ flips in expectation at the uniform doubly stochastic matrix. For other polytopes, our method rounds exactly given a point deep inside $P$ and the promise that $x$ is far from the boundary of $P$.

fields
Probability
pdf ↗ page arXiv:2611.17223 ↗

We determine the sectional distributions of Poisson–Laguerre tessellations in spaces of non-zero constant curvature, proving closure under totally geodesic sections and deriving explicit weight intensity measures. This includes sections of Poisson–Voronoi tessellations. We construct the generalised polar region, a new geometric object which extends existing polar constructions for both positive and negative curvature and provides an alternative representation of Laguerre tessellations. We also give deterministic conditions for tessellation existence and establish sharp integrability criteria for Poisson–Laguerre tessellations.

comments
20 pages, 6 figures
fields
Probability
pdf ↗ page arXiv:2611.17227 ↗

We study first-passage percolation on finite weighted graphs whose normalized Weibull edge hazards form a symmetric Markov kernel on $N$ vertices. We prove that a uniform absolute spectral gap and an $O(N^{-1})$ bound on a fixed even-step return probability imply the stochastic mean-field passage-time limit and an independent Gaussian hopcount limit. Jointly with these quantities, the entire geodesic from an arbitrary source to an independent uniform target is approximated in total variation by an independent Markov chain stopped at the hopcount. This comparison yields laws of large numbers for fixed-length path segments and joint central limit theorems for bounded additive observables. The results extend to edge laws with a uniform relative hazard error $o(1/\log N)$, including common noise distributions with a power-law hazard and a positive-power error near zero. Applications include integrable singular torus kernels, macroscopic spread-out graphs, non-transitive regular graphs, finite groups, and discretizations of symmetric continuum kernels.

fields
Probability
pdf ↗ page arXiv:2611.17234 ↗

We consider stationary log-correlated random fields of the form \[ X_n(t):= \sum_{j\le n} f(e^{τ_j} t+ v_{j})\,,\quad t\in \mathbb{R} \] for a centered 1-periodic analytic function $f:\mathbb{R}\to\mathbb{R}$, where $(τ_j)_{j\ge1}$ are the arrival times of a rate-1 Poisson process on $\mathbb{R}_+$ and $(v_j)_{j\ge1}$ are iid uniform random variables in $[0,1)$. We show that with high probability, \[ \max_{t\in[-1,1]}X_n(t) = c_1 n + c_2 τ_n- (c_3+o(1))\log n \] where $c_1,c_2,c_3$ are positive constants depending on $f$. In particular, the random frequency $τ_n$ produces a central limit fluctuation of order $\sqrt{n}$, together with a logarithmic correction different from the ubiquitous Bramson correction for models with strong comparisons to Gaussian fields, such as homogeneous branching random walks and log-characteristic polynomials of C$β$E matrices. Our proof makes a connection with branching random walks in random time-environment, where coarse-scale fluctuations of the arrival times $τ_j$ play the role of a quenched random environment, and fine-scale fluctuations are leveraged to establish a branching decorrelation structure. We conjecture analogous asymptotics for the characteristic polynomials of random permutation matrices, and expect the same mechanism to arise in other Poissonian fields such as characteristic polynomials of sparse random matrices.

comments
52 pages
fields
Probability
pdf ↗ page arXiv:2611.17236 ↗

Martingale optimal transport (MOT) provides model-independent bounds for option prices calibrated to vanilla options, assuming frictionless trading in the underlying. In this work, we consider the case where dynamic trading incurs quadratic temporary price impact. First, we prove a duality result for the superhedging price. In particular, the primal of the duality relaxes the strict martingale constraint by penalizing the deviation from a specific martingale. Second, for one asset and one trading period, we interpret this price-impact martingale optimal transport (PIMOT) as a weak optimal transport (WOT) problem, and provide a characterization in the spirit of Wasserstein projection. Finally, we justify that PIMOT is an interpolation between MOT and classical optimal transport (OT), and derive the convergence rate to both sides. Numerical examples with SPX option data show how the price bounds per claim depend on the order size.

fields
Probability
pdf ↗ page arXiv:2611.17247 ↗

We consider an individual-based model of niche construction built upon birth-death processes of d interacting biological entities (e.g., species, subpopulations or mutant strains in the same species) immersed in a slowly-varying environment which is influenced by the population state. In this setting, extinction and/or emergence of entities with negligible size or rarity, on long time scales can be observed. We prove that the joint dynamics of the environment and the species sizes on a logarithmic scale undergo a piecewise deterministic Markov process in a large time regime, which can be approximated by an explicit dynamical system in the limit of large populations. This convergence result holds true under the assumption that no "bad event" occurs during the population dynamics, corresponding to situations where several species become dominant or go extinct simultaneously. We also prove that no such bad event occurs for Baire-almost all initial conditions of the population sizes and the environmental resources. We apply this framework to study the long term coexistence of two specialist species consuming two resources, with a "joint" niche construction where each species constructs the niche of the other while depleting its resources. We also study an example of immune escape in cancer, where the environmental variable is associated with the state of the immune system and the species are associated with three types of tumor cells.

fields
Probability
pdf ↗ page arXiv:2611.17271 ↗

Analysis of PDEs56

A gas giant Riemannian metric $g$ on a compact $n$-dimensional manifold-with-boundary $M$ blows up at the boundary $\partial M$ at the rate $1/x^α$, for $α\in (0,2)$, where $x \in C^\infty(M)$ is a boundary-defining function. Such metrics arise in the modeling of acoustic waves in gaseous planets. De Hoop-Ilmavirta-Kykkänen-Mazzeo [arXiv:2403.05475] showed that, if $α> 2/n$, the Laplace-Beltrami operator $Δ_g$ is essentially self-adjoint and has discrete spectrum. Moreover, its spectrum is stable under truncations of $M$. The proof leverages the 0-calculus of Mazzeo-Melrose. We extend this theory by introducing a 0-transition calculus for studying families of 0-operators. We demonstrate a parametrix construction for $Δ_g$ that is stable under truncations. Using this, we study the behavior of the resolvent of $Δ_g$ under truncation and extend the characterization of the spectrum obtained by de Hoop-Ilmavirta-Kykkänen-Mazzeo. In particular, we prove that (on appropriate functional-analytic domains) simple eigenvalues admit asymptotic expansions in the truncation parameter $ε$ and that the corresponding eigenfunctions admit joint asymptotic expansions in $(ε, x)$.

comments
63 pages, 21 figures
fields
Analysis of PDEs, Differential Geometry
pdf ↗ page arXiv:2611.04191 ↗

We extend the differential structure on Wasserstein spaces of Schichl (arXiv:2508.15140) to the normed Wasserstein space $\mathbb{W}_1$ of finite signed measures, the natural setting for measure differential equations with source terms. We generalize the averaged flow dispersion and expectational flow operators to $\mathbb{W}_1$ and show that along divergence–free tangent vectors they act by measure–preserving flows, and further define source operators. As an application, we construct a purely Lagrangian splitting scheme for the incompressible Navier–Stokes equations on $\mathbb{R}^N$, inspired by the Averaged Flow Approximation Series (AFAS) in \cite{Schichl2025}. We recover, with explicit constants, the classical lifespan bound, a blow–up rate and the inviscid limit with rate $O(η^2)$, and a linearised scheme yields $L^{\infty}$, Hölder, $L^1$ and moment estimates for classical solutions.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.14662 ↗

This work investigates the stabilization of a wave equation with a localized damping and dynamic boundary conditions. This model traces back to the classical treatment of torsion and impact problems. Consider a second-order hyperbolic equation posed with a dynamic boundary condition on a smooth compact Riemannian manifold $(\M,g)$ with boundary, in which the damping acts either in the interior or on $\d \M$. Under the assumption that the damping is positive on an open subset of its domain of action, a resolvent estimate is established. A logarithmic decay rate is then deduced for the energy of strong solutions. We provide examples that establish the sharpness of the resolvent estimate.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.14751 ↗

We characterize the well-posedness of the higher order regularity problem in the upper half-space with data in Sobolev Banach function spaces by proving its equivalence to natural weighted estimates for the Hardy-Littlewood maximal operator. The generality of our framework allows for applications to Lebesgue spaces, rearrangement-invariant spaces such as Orlicz spaces, and variable exponent Lebesgue spaces, as well as their weighted counterparts, among others. This is established for the family of second-order, homogeneous, elliptic, constant complex coefficient systems in ${\mathbb{R}}^n$ that admit a distinguished coefficient tensor, a natural condition that always holds in the scalar case and for the Lamé system of elasticity.

journal
Potential Anal 65, 20 (2026)
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.14787 ↗

Let $C \subset \mathbb{R}^N$ be a compact strictly convex core and $\mathcal{O}_C$ denote the class of domains whose outer boundary is a global outward normal graph over $\partial C$ and whose inward boundary normals return to the interior of $C$. We study volume-constrained critical domains of the Dirichlet-perimeter functional: \[ \mathcal{E}_μ(Ω) = -\frac{1}{2}\int_Ω|\nabla u_Ω|^{2}\,\mathrm{d}x + μP(Ω), \qquad -Δu_Ω = f, \quad u_Ω|_{\partialΩ}=0, \] in the large-perimeter regime $μ\to\infty$. We give an adapted Lyapunov–Schmidt construction near translated spheres to extract the first physical shape coefficient of scale $μ^{-1}$. We then prove that $\mathcal{O}_C$ is open under small $C^1$ thickness perturbations and establish a quantitative coordinate-transfer theorem to a unique core-normal thickness. Finally, we prove that the forward return-map operator $d \mapsto F_d$ is Fréchet $C^1$ between Hölder spaces and provide its explicit derivative. This yields a shape-to-dynamics sensitivity theorem for $\mathcal{O}_C$: a perimeter-regularized PDE-constrained critical deformation produces an explicitly controlled first-order deformation of the return dynamics. A nonradial example confirms that the response coefficient is generically nonzero.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.14859 ↗

We construct positive multi-peak solutions of a singularly perturbed Hamiltonian elliptic system with a common uniformly positive potential $a$ and powers $p,q>1$ below the Sobolev critical hyperbola. The peaks concentrate at any prescribed set of $k$ distinct nondegenerate critical points $P_i$ of $a$. The Hessian of the action is strongly indefinite. A Schur complement gives exactly $kN$ eigenvalues near zero and their leading terms, which have order $\varepsilon^2$ and are determined by $D^2a(P_i)$. The solutions are nondegenerate. A scalar Schur reduction and localization of its inverse term give the relative Morse index $k+\sum_{i=1}^k\ind D^2a(P_i)$. Local Pohozaev identities give local uniqueness. A compactness argument then shows that, for $m$ prescribed nondegenerate critical points, the union of the fixed profile neighborhoods associated with their nonempty subsets contains exactly $2^m-1$ positive solutions. Using uniqueness of positive solutions of the limiting system up to translations, we obtain the same count in classes defined by nonvanishing in fixed balls and a scaled nonlinear mass bound that excludes an additional peak. We also give second-order expansions of the peak locations and rescaled profiles.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.14899 ↗

We study the affine Hardy-Littlewood-Sobolev inequality under the constraint $\frac{1}{2}\int_{\mathbb{R}^n}(f^{q-\varepsilon}+f^{q+\varepsilon}) dx=1$ for $f\ge0$, where $q=\frac{2n}{n+α}$, $n\ge2$, $0<α<n$, and $0<\varepsilon<q-1$. We determine the second-order expansion of its sharp constant and the scale selected by all normalized radial extremals as $\varepsilon\rightarrow0^+$. For sufficiently small fixed $\varepsilon$, we prove stability estimates with power $2$ in $L^{q-\varepsilon}\cap L^{q+\varepsilon}$ for the Euclidean and affine energies. The power $2$ is sharp, and the sharp stability constants admit $O(\varepsilon^2)$ upper bounds as $\varepsilon\rightarrow0^+$. The proof combines identities for the two power integrals with Euclidean spectral estimates, affine compactness and a nonlinear directional expansion. No uniqueness or additional regularity of the radial extremals is assumed.

comments
34 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.14917 ↗

We study the diffusion phenomenon for the abstract damped wave equation $u''+Bu'+Au=0$ on a Banach space and its possibly degenerate parabolic counterpart $Bv'+Av=0$. We assume that $B$ is bounded and the wave equation is well-posed, without requiring symmetry, injectivity, or commutativity of $A$ and $B$. Our aim is to identify initial data for which the parabolic solution is a genuine diffusive profile: $\|u(t)-v(t)\|=o(\|v(t)\|)$ as $t\to\infty$. Using Fourier analysis of resolvent expressions for the associated quadratic and linear operator pencils, we establish decay estimates for the difference of hyperbolic and parabolic solutions and their time derivatives. In particular, we characterize broad classes of initial data yielding the classical upper bounds of orders $t^{-1}$ and $t^{-2}$. We also prove lower bounds for both solutions, of the form $\|u(t)\|,\|v(t)\|\gtrsim r(t)$, for large sets of initial data and arbitrary prescribed functions $r(t)\to0$ that decay sufficiently slowly. Combining these results with high- and low-frequency resolvent estimates and a condition on the ranges of $A$ and $B$, we obtain genuine diffusive profiles. The analysis uses spectral properties of a sectorially holomorphic parabolic solution semigroup, which need not be strongly continuous. We apply the theory to damped wave equations on $L^2(Ω)$ with the Dirichlet Laplacian and bounded nonnegative damping that may vanish on large sets. We establish criteria for the required resolvent and range conditions, treat the whole space and exterior domains, and construct diffusive initial data using Weyl sequences.

comments
110 pages, 1 figure
fields
Analysis of PDEs, Functional Analysis
pdf ↗ page arXiv:2611.14951 ↗

In this paper, we establish new results on BKM-type criteria for the incompressible Euler equations on $\mathbb{R}^3$ as well as the Euler equations with space-time variable coefficients in a bounded domain. Our first result shows that if a finite-energy solution to the Euler equations on $\mathbb{R}^3$ blows up at a time $T_\ast$, and $T_\ast$ is the first such time, then $\limsup_{t\to T_\ast^-}(T_\ast -t)^{1+2k/5}\|D^kω(t)\|_{L^\infty} = \infty$ for every $k \geq 1$, thereby excluding the endpoint rate allowed by previously established lower bounds. The proof assumes the endpoint rate as an upper bound near the blowup time and uses a result by Chae and Wolf to obtain a contradiction. The second result gives a BKM-type criterion for solutions to the incompressible Euler equations with variable coefficients in the minimal regularity class $H^r$, where $r \in (2.5,3)$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.14954 ↗

The free-boundary incompressible Euler equations linearized at a rigidly rotating equilibrium on the flat product of the unit disk and a circle are Hadamard ill-posed in Sobolev spaces of order at least two. The equilibrium violates the Taylor sign condition, under which local well-posedness is known. Eulerian linearization retaining free-surface advection reduces the spectral problem to a modified Bessel equation; Rouché's theorem yields an unstable root whose real part grows as the square root of the axial frequency. Eigenmode Sobolev norms grow as the corresponding power of that frequency. Rescaling gives data tending to zero whose solutions are unbounded at any prescribed positive time. At zero axial frequency the analysis recovers Ebin's rotating-disk rate (Communications in Partial Differential Equations 12 (1987), 1175–1201). The product lift gives nonlinear ill-posedness on the invariant class of axially independent data.

comments
14 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.15083 ↗

In this paper, we address the local-in-time well-posedness of an obstacle problem arising from a combustion model. The equation under consideration is a linear inhomogeneous heat equation on the moving domain $(s(t),\infty)$, subject to homogeneous Dirichlet and inhomogeneous Neumann boundary conditions. Our main result establishes the existence and uniqueness of a positive classical solution. Although several results are known for the homogeneous heat equation, much less is known about the inhomogeneous case. We show that the boundary function $s(t)$ is $\frac{1}{2}$-Hölder continuous in time when the forcing term has a singularity of order $O(1/\sqrt{t})$ as $t \to 0$. We also prove that if both the initial data and the forcing term are smooth, then $s$ has higher regularity than $\frac{1}{2}$-Hölder continuity.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.15089 ↗

Let $n\geq2$, $s\in(0,1)$, and $Ω\subset\mathbb{R}^n$ be a bounded Lipschitz domain. In this paper, we study the solvability of the fractional Neumann problem \begin{equation*} \left\{\begin{aligned} (-Δ)^su&=0 & & \text{in}\ \ Ω,\\ \mathcal{N}_s u&=g & & \text{in}\ \ \mathbb{R}^n\setminusΩ, \end{aligned}\right. \end{equation*} with $\mathcal{N}_s$ denoting the nonlocal normal derivative in $\mathbb{R}^n\setminusΩ$ and $g:=a_sq$, where $a_s(z):=(1-s)\frac{δ(z)^{-s}}{1+δ(z)^{n+s}}$ with $δ(z):=\mathrm{dist\,}(z,\partialΩ)$ for any $z\in\mathbb{R}^n\setminusΩ$, and $q\in L^2(\mathbb{R}^n\setminusΩ,a_s\,dz)$ satisfies $\int_{\mathbb{R}^n\setminusΩ}a_sq\,dz=0$. For the weak solution $u$, we obtain the non-tangential maximal function estimate \begin{equation*} \left\|\left(δ^{1-s}|\nabla u|\right)^*\right\|_{L^2(\mathbb{R}^n\setminusΩ,\,a_s\,dz)} \leq C\|q\|_{L^2(\mathbb{R}^n\setminusΩ,\,a_s\,dz)}, \end{equation*} where, for any function $f$ on $Ω$, $f^\ast$ denotes the non-tangential maximal function of $f$ on $\mathbb{R}^n\setminusΩ$. This result extends the classical $L^2$ solvability theory for the Neumann problem of Laplace equations on bounded Lipschitz domains to the setting of fractional Neumann problems, and also provides a Neumann counterpart to the $L^2$-solvability result for fractional Dirichlet problems established by Colombo, Fernández-Real and Ros-Oton \cite{CFR26}. In addition, we prove the fractional Sobolev estimate $\|u\|_{H^{3s/2}(Ω)}\leq C\|q\|_{L^2(\mathbb{R}^n\setminusΩ,\,a_s\,dz)}$ and the weighted gradient estimate \begin{equation*} \left(\int_Ωδ^{2-3s}|\nabla u|^2\,dx\right)^{\frac12} \leq C\|q\|_{L^2(\mathbb{R}^n\setminusΩ,\,a_s\,dz)}. \end{equation*}

comments
37 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.15103 ↗

We prove finite-time gradient blow-up with sharp $C^{(5-b)/(b+3)}$ Hölder regularity for a class of nonlocal transport equations extending the $b$-family, for all real $1<b<5$. This class includes the Camassa–Holm and Degasperis–Procesi equations and, after rescaling, the generalized hyperelastic-rod wave equation. In the blow-up regime, the nonlocal equations reduce at leading order to the generalized Hunter–Saxton (gHS) equation with parameter $\ell=2/(b-1)$, whose self-similar scaling and corresponding profiles depend on $\ell$. Consequently, standard approaches tailored to a fixed self-similar profile cannot be applied directly. To handle this parameter dependence, we develop a general framework for self-similar singularity formation in evolution equations whose leading-order dynamics are governed by the gHS family. The key ingredient is a family of profile inequalities established for all real $\ell>1/2$, which we combine with a generalized maximum principle to close a parameter-dependent bootstrap argument. We identify model-specific hypotheses adapted to this framework, under which this argument yields the required stability estimates. This leads to a general theorem on singularity formation, which we apply to the entire class of nonlocal equations, thereby establishing finite-time gradient blow-up and sharp Hölder regularity. The theorem can also be applied to other evolution equations once the corresponding model-specific hypotheses are verified, without repeating the profile analysis or the common stability argument.

comments
73 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.15174 ↗

We study the recovery of an acoustic coefficient from boundary measurements made after the injection of a collection of small, highly contrasting droplets. This enters into the framework of quantitative ultrasound imaging using contrast agents. The centers are randomly distributed according to a prescribed strictly positive density $ρ\in C^1(\overlineΩ)$. We choose real incident frequencies near an active Newtonian resonance and prove a point-interaction approximation, followed by a comparison with the effective model $(-Δ+P^2ρ-ω^2n^2)u=0$. The constants are uniform as the amplitude $P^2$ increases, provided it is coupled to the size and distribution discrepancy of the droplets. A random rounding and displacement construction verifies the distribution assumption for each such given density. The effective Neumann-to-Dirichlet map is then linearized with a remainder of order $P^{-4}$. We derive reconstruction identities using complex geometrical optics solutions of the known reference operator $-Δ+P^2ρ$. We also estimate the amplification of the boundary-map error in these identities and give a boundary integral correction for reconstruction from the full (and not the linearized) measured map.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.15196 ↗

Understanding boundary-layer detachment and its consequences for the infinite-Reynolds-number limit remains a major challenge in fluid mechanics. Here, direct numerical simulations of incompressible flow in a two-dimensional periodic channel with no-slip walls are used to investigate this problem. Reynolds-number-dependent initial conditions are constructed with a boundary layer of Prandtl thickness that converge in the energy norm to an analytic, stationary Euler flow, while the associated Prandtl system develops a finite-time singularity. Highly resolved simulations show boundary-layer detachment and departures from Prandtl scaling, yet provide numerical evidence that the Navier–Stokes solutions continue to converge to the Euler flow over the simulated time interval. In particular, the squared energy norm of the velocity difference and the time-averaged energy dissipation both scale approximately as $Re^{-1/2}$, consistently with established convergence criteria. Although the detached vortices become more numerous and intense as the Reynolds number increases, their characteristic size and occupied area appear to decrease. These observations suggest how boundary-layer detachment and the breakdown of the Prandtl description can coexist with convergence to a smooth Euler flow.

comments
34 pages, 11 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.15239 ↗

We prove subcritical nonexistence for $-Δ_pu=|x|^au^q$ in $R^N$, with $1<p<N$ and $a>-p$, in the positive locally bounded weak class. Continuous Steiner symmetrization of a nonlinear auxiliary potential yields a directional pressure inequality; a localized Pohozaev identity and scaling give the Liouville theorem. At criticality, for $N\ge3$ and $-p<a<0$, we classify all positive entire weak solutions in $W^{1,p}_{\mathrm{loc}}(R^N)$, without assuming local boundedness, symmetry, stability, finite energy, or decay at infinity.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.15282 ↗

We study the vanishing discount problem $G(x,Du_λ,λu_λ)=c_0$, where $G$ is convex and superlinear in the momentum and strictly increasing in its last variable. Assuming a leading-order expansion of the Lagrangian of order $q>0$, we prove uniform convergence and characterize the selected solution by nonlinear inequalities against Mather measures. In particular, our results cover discount terms whose first derivative at the origin vanishes, such as the cubic discount, beyond existing convergence results based on first-order nondegeneracy. Our proof uses truncated calibrated curves and time averages, without the exponentially weighted measures used by Davini–Fathi–Iturriaga–Zavidovique. In the linear case, it gives a short alternative proof of their convergence and selection theorem. An example shows that linear and cubic discounts may select critical solutions that do not differ by an additive constant.

comments
10 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.15399 ↗

In this paper, we formulate a Riemann–Hilbert problem framework -- based on the Unified Transform Method (Fokas method) -- for the Short Pulse equation posed on a periodic domain. Under the stated spectral and reconstruction regularity assumptions, we show that a local solution of the periodic initial-value problem can be reconstructed from the solution of a suitably defined Riemann–Hilbert problem, whose jump data are explicitly characterized by spectral functions associated with the initial condition.

comments
34 pages, 4 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.15511 ↗

We investigate an inverse problem for the Helmholtz equation in a three-dimensional half-space with a biperiodic medium above a sound-soft plane. We establish the uniqueness of a real-valued, bounded, biperiodic refractive index that depends only on the horizontal variables using spectral techniques. %The frequency and quasiperiodicity parameter are fixed. An orthogonality identity is first derived from near-field measurements. By constructing suitable separated solutions, this identity is reduced to relations involving eigenfunctions of two-dimensional quasiperiodic Schrödinger operators. To recover Fourier information from these relations, we project horizontal plane waves onto suitable high-energy spectral subspaces, obtaining finite combinations of eigenfunctions that approximate the plane waves with a quantified error. Combining these approximations with the orthogonality identity, we show that all Fourier coefficients of the difference of two refractive indices vanish, thereby establishing the desired uniqueness.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.15588 ↗

We investigate when Calderón-Zygmund estimates hold for PDEs of the type \[ \operatorname{div}(A(\nabla u)) = \operatorname{div}(F) \] where $A: \mathbb{R}^2 \to \mathbb{R}^2$ is a continuous map with linear growth. We show that, under natural assumptions, $L^p$-Calderón-Zygmund estimates hold for all $p \in (1,\infty)$ if and only if $v \mapsto \lim_{t \to \infty} A(tv)/t$ is linear and non-degenerate.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.15636 ↗

In this paper we consider positive weak solutions $u\in\mathcal{D}^{s,p}(\mathbb{R}^{N})$ to the critical fractional $p$-Laplace equation with Hardy potential $(-Δ_p)^s u-μ\frac{u^{p-1}}{|x|^{ps}}=u^{p_s^{*}-1}$ in $\mathbb{R}^{N}$, where $N\geqslant 2$, $s\in(0,1)$, $p\in(1,\infty)$ satisfying $ps<N$, $p_s^{*}=\frac{Np}{N-ps}$ and $μ\in(0,\mathcal{C}_{N,s,p})$, $\mathcal{C}_{N,s,p}$ denotes the sharp constant of the fractional Hardy inequality. By means of a suitable comparison principle for weak subsolutions and supersolutions of the equations $(-Δ_p)^sf=\big(\fracμ{|x|^{ps}}+a(x)\big)f^{p-1}$ on general open set $Ω$, with nonzero exterior data and $a\in L^{\frac{N}{ps}}(\mathbb{R}^{N})$, combined with careful constructions of the weak subsolutions and supersolutions, we prove that every positive weak solution $u$ of the above problem satisfies $C^{-1}\leqslant|x|^{μ_1}(1+|x|)^{μ_2-μ_1}u(x)\leqslant C$ for a.e. $x\in\mathbb{R}^{N}$, where $μ_1<μ_2$ are the two roots of the indicial equation associated with the Hardy operator and $C\in[1,\infty)$ depends on $u$. Also, we show that the constant $C$ cannot be chosen to depend only on $N$, $s$, $p$ and $μ$.

comments
34 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.15648 ↗

In this paper, we study the two-dimensional incompressible Navier–Stokes equations with only horizontal dissipation in the upper half-plane $\mathbb{R}^2_+$. The combination of the missing directional regularity and the influence of the boundary presents an essential difficulty for the pressure estimates. We circumvent this difficulty by establishing an extension theorem for the weak formulation, based on the divergence-free condition and the homogeneous impermeability boundary condition. A key feature of this extension principle is that no boundary condition is required for the tangential velocity component. Consequently, every weak solution in the natural energy class on $\mathbb{R}^2_+$ admits a reflection extension that is a weak solution of the corresponding whole-space problem on $\mathbb{R}^2$. This extension allows us to transfer the energy rigidity and weak–strong uniqueness properties established by Demmel and Wiedemann \cite{E-W} to the half-plane setting. In particular, we prove the energy equality for weak solutions in the natural energy class and establish weak–strong uniqueness under the corresponding additional regularity assumptions.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.15703 ↗

We study a three-dimensional dynamic thermoplastic system with a temperature-dependent convex yield set whose deviatoric section may collapse completely at a finite temperature. The underlying constitutive model is rate-independent Prandtl-Reuss perfect plasticity, without Kelvin-Voigt viscosity, hardening, or a safe-load condition. We construct global approximation-generated relaxed entropy-energy states by a one-parameter Temam-Norton-Hoff-Galerkin scheme with an undiscretized heat equation and untruncated plastic heat production. The logarithmic temperature is strongly compact in $L^2(0,T;L^q(Ω))$ for every $q<6$ and in $L^p((0,T)\timesΩ)$ for every $p<8/3$. An entropy-weighted work estimate yields convergence of the overstress at rate $O(\sqrt{\log n/n})$ in every fixed finite Lebesgue space and identifies stress admissibility. The constitutive limit comprises a distributional plastic balance, finite support-weighted measures, and compact-fibre lifts carrying exact normality and maximum plastic work. A locally finite lift on the positive-radius fibres unifies the level-restricted limits at every continuity level. At the macroscopic level, however, the available compactness does not identify a canonical stress-plastic-flow pairing. Moreover, an explicit smooth state satisfying the intrinsic relaxed balance conditions shows that these conditions do not imply macroscopic Prandtl-Reuss normality. In the fully collapsed regime, an energy-entropy rigidity argument determines the evolution and yields approximation-generated examples in which the plastic flow need not be a finite measure or the displacement need not retain its full boundary trace. Thermal concentration and plastic entropy production remain explicit throughout.

comments
43 pages, 1 figure
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.15719 ↗

Classical theorems of Epstein–Schiffer and Kuran characterize balls by the mean value identity for integrable harmonic functions. In the Fermi Lectures, Caffarelli described an obstacle problem construction of analogous averaging sets for symmetric uniformly elliptic divergence-form operators. Working in dimension $n \ge 2$ throughout the paper, we prove that for symmetric uniformly elliptic operators with bounded measurable coefficients, every bounded open set satisfying the mean value inequality for all integrable subsolutions defined on that set (what we call ``strong mean value sets'') agrees almost everywhere with the canonical set from Caffarelli's construction which has the same center and volume. The proof uses weak modified Schwarz potentials and an energy comparison. Additionally, we construct smooth symmetric uniformly elliptic operators for which the unit ball satisfies the mean value identity for all integrable solutions but fails the subsolution inequality, showing that there can be two distinct notions for what one can consider to be a ``mean value set.'' The canonical mean value set with the same center and volume as this weak mean value ball has a hole of positive measure.

comments
48 pages, 2 figures, 1 table
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.15988 ↗

We investigate the blow-up behavior of solutions to the semilinear wave equation $$ \partial_t^2 u - \partial_x^2 u = |u|^{p-1}u \ln^a(u^2+2), \quad (x,t)\in \mathbb{R} \times [0,T), $$ with $p > 1$ and $a<0$. While the blow-up rate at non-characteristic points was determined for all $a \in \mathbb{R}$ in previous work, the analysis at characteristic points has remained an open problem. The main obstruction is that known constructions of a Lyapunov functional in similarity variables require several steps and rely on a covering argument, which is not available at characteristic points. Focusing on the regime $a < 0$, we construct a Lyapunov functional directly, without any covering argument. This yields uniform bounds on the solution in similarity variables, and hence the blow-up rate at every point, including characteristic ones. To our knowledge, this is the first work to determine the blow-up rate at characteristic points for an equation without scaling invariance.

comments
26 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.16004 ↗

We generalize the 2D linear internal wave equation to non-compact surfaces of revolution with flat ends. We show that the leading profile of this equation with oscillatory forcing is the unique incoming solution to the corresponding stationary equation. This is done by proving a limiting absorption principle via propagation of semiclassical defect measure.

comments
27 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.16112 ↗

In this paper, we analyze the validity of the maximum principle and the existence of a principal eigenvalue for a problem involving two regions, in one of them the main operator is the classical Laplacian (a local operator) while in the other region the operator is a nonlocal one (these regions are coupled via a transmission term that is also nonlocal). The main difficulty here comes from the lack of compactness of the nonlocal part that occurs since we are considering non-singular kernels.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.16131 ↗

This paper addresses a two-phase fluid system on the periodic domain $\mathbb{T}^3$, consisting of the pressureless Euler equations and the incompressible non-Newtonian equations coupled through a drag force. We prove the global-in-time existence of strong solutions to this system for a certain class of stress tensors in the non-Newtonian fluid. Our proof combines a priori large-time behavior estimates for classical solutions with a bootstrapping argument on the $L^2$-Sobolev norms, which effectively handles the difficulties caused by the lack of dissipation in the density of the Euler equation.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.16319 ↗

We establish the sharp constants $\mathcal H_N$ of the second-order Hydrogen Heisenberg uncertainty principle for $N=2,3$. Starting from the first angular mode reduction, we rewrite the fourth-order radial quotient as two coupled radial Coulomb channels. Then we turn the compatibility constraint into an explicit Jacobi chain by expanding the $B$-channel in generalized Laguerre polynomials and passing to parity-tail variables. Its tail energies satisfy scalar Riccati recursions, equivalently continued fractions. Furthermore, we characterize $2\mathcal H_2$ and $2\mathcal H_3$ as the unique roots of two explicit scalar equations, and we show that free-tail and Dirichlet finite sections provide monotone lower and upper approximations converging to the sharp constants. This yields rigorous bounds and the values $$\mathcal H_2\approx0.84478056,\quad \mathcal H_3\approx1.82348779.$$ We also obtain uniqueness of the first-mode radial extremizer up to amplitude, rotation, and dilation.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.16353 ↗

We study the critical Dirac equation \[ Dψ=H(x)|ψ|^{\frac{2}{m-1}}ψ\] on the round sphere $\mbs^m$, $m\ge2$, where $D$ is the Dirac operator. For $H\equiv1$, the ground-state energy $E_m=\frac{m^{m-1}}{2^{m+1}}\vol(\mbs^m)$ depends only on the dimension $m$. In dimension two, the nonzero solution energies are exactly $π,3π,4π,\ldots$. For $m\ge3$, we prove a gap $(E_m,(1+\Ga_m)E_m)$ above the ground-state energy and give bounds for its optimal relative size $\Ga_m$. For positive $H$, let $τ_H=E_m/(\max H)^{m-1}$ be the first bubble energy. If $m\ge3$, every $H$ in a residual subset of the positive $C^1$ functions admits solutions with infinitely many distinct weighted energies in $(τ_H,\min\{2,1+\Ga_m\}τ_H)$ tending to $τ_H$. Along a subsequence these solutions form a single ground-state bubble at a global maximum of $H$. For each $k\ge1$, smooth positive coefficients admitting at least $k$ distinct energies in this interval are dense among positive functions in $C^1$ and $W^{2,s}$, $m/2<s<\infty$. In the $C^2$ topology, however, an open set of positive coefficients admits only the trivial solution. We approximate a smooth $H_*$ in this set by smooth positive $H_j$ in every $C^{1,\al}$ and $W^{2,s}$ with $0<\al<1$ and $1\le s<\infty$. Solutions for $H_j$ form a single bubble at the unique maximum of $H_*$ as their weighted energies tend to $τ_{H_*}$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.16355 ↗

We study a parabolic-elliptic-ODE chemotaxis system with indirect signal production on closed connected Riemannian surfaces. For all sufficiently regular nonnegative initial data, the system admits a unique global classical solution. We show that the solution remains globally bounded if the total mass $M<8π$. For each $M>8π$, we find initial data of mass $M$ that yield infinite-time blow-up solutions. We then adapt the argument to the corresponding Neumann problem in a smooth bounded planar domain and obtain infinite-time blow-up solutions for any mass $M>4π$. At the critical mass $M=8π$, we show that the solutions are globally bounded on spheres equipped with the canonical spherical metric, and we construct a solution blowing up in infinite time on the Riemann sphere equipped with a special metric.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.16572 ↗

We study the recovery of small normal displacements of a known inclusion from a single mixed Steklov eigenpair. The data consist of the eigenvalue and the eigenfunction trace on any nonempty open subset of the fixed outer boundary, with the eigenfunction normalized using only that subset. For an inner Dirichlet condition, we prove that the linearized measurement map is injective at every simple eigenvalue. A compatible adjoint identity yields a reconstruction method with a conditional stability estimate on any fixed finite-dimensional space of smooth displacements. For the principal Dirichlet eigenpair, the same local data also determine the inclusion uniquely among sufficiently small normal graphs. In a three-dimensional concentric shell, the eigenvalue determines the mean displacement at first order, while spherical harmonics diagonalize the remaining full-boundary trace map. The singular values decay exponentially with harmonic degree, yielding logarithmic conditional stability under a Sobolev prior. Numerical experiments using the perturbed geometry illustrate the quadratic linearization error and the deterioration of conditioning as the observed patch shrinks. For an inner Neumann condition, we prove linearized injectivity at every positive simple eigenvalue.

comments
21 pages
fields
Analysis of PDEs, Numerical Analysis
pdf ↗ page arXiv:2611.16596 ↗

We study an optimal control problem aimed at enhancing mixing in anisotropic electrolytes described by an instationary Stokes-Nernst-Planck-Poisson system in three space dimensions, where the anisotropy is encoded by a given director field in the diffusion and permittivity matrices. The control is the external electric potential entering through the Robin boundary condition of the Poisson equation. The cost functional combines tracking-type terms for the charge concentrations and an $L^2$-regularization of the control with a negative vorticity term that favors rotational flow. Assuming that the diffusion and permittivity matrices coincide, we first prove existence and uniqueness of weak solutions with nonnegative, essentially bounded concentrations, together with Lipschitz continuous dependence on the control. Since, through the negative vorticity term, the cost functional is no longer weakly lower semicontinuous, existence of an optimal control relies on strong convergence of the velocity gradients. Finally, we prove Fréchet differentiability of the control-to-state operator, introduce the adjoint system, and derive first-order necessary optimality conditions in the form of a variational inequality.

comments
38 pages. The keywords are: Weak solution, anisotropic electrolyte, well-posedness, existence of optimal controls, first-order optimality conditions
fields
Analysis of PDEs, Optimization and Control
pdf ↗ page arXiv:2611.16615 ↗

We consider the semiclassical logarithmic Schr{ö}dinger equation, with an at most quadratic potential and with Gaussian initial states. For a critical nonlinear term in the semiclassical regime, we analyze an approximation based on the variational evolution of Gaussian wave packets. We also prove a nonlinear superposition principle for solutions issued from the sum of two Gaussian wave packets initially localized at distinct points in phase space. For both a single Gaussian wave packet and a superposition of two Gaussian wave packets, we compare the variational approximation with the standard coherent-state approximation and highlight their respective features. The required assumptions are weakened in this setting without becoming technically involved.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.16640 ↗

We study uniqueness for stationary incompressible Navier–Stokes flows in infinite pipes with the Navier-slip boundary. For a cylindrical pipe of unit radius and a positive friction ratio, uniqueness holds when $|Φ|\leq 2π\sqrt{40/7}\approx 15$. This significantly improves upon the result of the first author, Liu and Zhou (J. Differential Equations 461:114108, 2026) where the uniqueness requires $|Φ|\leq π/16\approx 0.2$. For small positive friction ratio $α$, this flux condition can be improved to $|Φ|\leq 4\sqrt{2}\,π^2/α$. For an infinite pipe with a bounded, smooth, simply connected cross-section $Σ$, we prove uniqueness for every $0<α<\infty$ provided that $|Φ|\leq c_Σ(1+α)/α$, where $c_Σ>0$ depends only on $Σ$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.16668 ↗

The coercivity conjecture for nonlocal energies asks whether uniform ellipticity implies $H^s$-coercivity for symmetric nonlocal kernels of order $2s$, with $0<s<1$. We show that the conjecture fails whenever $n>2s$ for every $s \in (0,1)$ and $n \geq 1$, even for smooth compactly supported test functions; for $n=1$ and $s>1/2$, we show that it holds. The construction also gives bounded discontinuous weak solutions in $H^s_{\rm loc}$ to nonlocal equations in divergence form with kernels in this class. Despite the failure, we show that the conjecture holds for several important classes of kernels. We establish a general local coercivity criterion based on annular cancellation, which applies in particular to kernels satisfying both divergence- and nondivergence-form symmetry. The criterion also allows us to treat kernels comparable to stable kernels with bounded measurable coefficients, as well as non-cutoff Boltzmann kernels under a geometric nonconcentration assumption. As an application, we obtain a short and self-contained proof of the Gressman–Strain anisotropic coercivity estimate. Furthermore, by combining our new criterion with existing regularity results, we obtain Hölder estimates under ellipticity and cancellation assumptions.

comments
44 pages, 1 figure
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.16682 ↗

We provide a method to construct a real-analytic ideal MHD equilibrium $(B,p)$ in a solid toroidal domain $Ω\subset\mathbb{R}^{3}$, with $B$ tangential to the boundary $\partialΩ$. The regular pressure level sets foliate $Ω\setminusΓ$ by nested tori surrounding a magnetic axis $Γ$, with $\nabla p\neq0$ away from the axis. We construct an example where the magnetic field is nonvanishing on $Ω$, and the rotational transform equals 2 on every regular pressure surface. The equilibrium has a trivial Euclidean symmetry group. It is non-isolated in the sense that it belongs to a real-analytic one-parameter family connecting it to an axisymmetric equilibrium. The toroidal domain, magnetic field and pressure vary smoothly along this family. Under the MHD–Euler correspondence, the construction also yields a real-analytic steady incompressible Euler flow with a nonconstant Bernoulli function. This constructively disproves one formulation of Grad's conjecture by exhibiting a smooth toroidal MHD equilibrium with nested pressure surfaces whose Euclidean symmetry group is trivial.

comments
30 pages, 4 figures, 1 table
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.16688 ↗

We prove asymptotic stability of the small-parameter Glangetas-Merle self-similar blow-up solutions of the two-dimensional Zakharov system under nonradial perturbations in the energy space. The proof establishes dissipation on the wave time scale by canceling the fast density coupling. We impose nonlinear orthogonality to the ground state of the density-dependent Schrödinger operator for modulation and use successive energy corrections after subtracting the instantaneous density response from the Schrödinger error. The resulting dissipation yields power-law decay of the rescaled errors in the Schrödinger gradient, weighted local mass, and wave energy norms.

comments
85 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.16731 ↗

In this paper, we investigate the existence of solutions to the following supercritical elliptic problem involving the $p$-Laplace operator and the Hardy-Leray potential \begin{equation*} \left\{\begin{array}{rcll} -Δ_p u +u^β|\nabla u|^p &= & {\vartheta} \dfrac{u^q }{|x|^p}+ f\;\; &\hbox{in } Ω u &\geq & 0\;\; &\hbox{in } Ω u &= & 0\;\;&\hbox{on } \partialΩ, \end{array}\right. \end{equation*} where $0\inΩ$. We analyze the effect of the perturbation term $u^β|\nabla u|^p$, with $β\geq 0$, and the role of the exponent $q$ on the existence of solutions. We also analyze nonexistence of solutions when $f$ is a singular measure. Finally, we focus on the regularity and asymptotic properties of these solutions.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.16754 ↗

We study the weakly collisional Vlasov-Poisson-Fokker-Planck system near a Maxwellian equilibrium and construct global classical solutions exhibiting large transient growth before eventual collisional relaxation. The main mechanism is a nonlinear plasma-echo cascade which remains effective up to the enhanced-dissipation time scale $t\simν^{-\frac13}$, producing norm inflation of size larger than $ν^{-1}$ from arbitrarily small $ν$-dependent perturbations. At the same time, the nonzero spatial modes decay at the enhanced-dissipation scale $e^{-rν^{\frac13}t}$, while the zero mode relaxes at the thermal scale $e^{-νt}$. The estimates also reveal a sharp contrast in the smoothing effects before and after the collisional time scale $t\sim ν^{-1}$. As a consequence, our construction gives explicit upper bounds on the Sobolev and Gevrey stability thresholds: perturbations of the corresponding $ν$-dependent sizes can still trigger severe echo-driven amplification before collisional dissipation becomes dominant at the critical time scale $t\simν^{-\frac13}$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.16761 ↗

We establish final-state observability for heat equations with real-valued bounded space–time potentials on bounded $C^2$ domains, from arbitrary measurable space–time sets of positive measure. On $\mathbb R^n$, we prove observability from time-dependent sets whose spatial slices are uniformly thick on a set of times of positive measure. A counterexample for the free heat equation on $\mathbb R$ shows that integral thickness alone is insufficient for observability.

comments
25pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.16811 ↗

For a variational model of incompressible elastomers exhibiting cavitation, we establish the existence of irreversible quasi-static evolutions driven by time-dependent boundary conditions. Our result extends previous work by Mora-Corral (2014) to incompressible materials under weaker regularity assumptions on the boundary datum. The proof employs the multiplicative splitting introduced by Francfort and Mielke (2006) to reduce the problem to time-independent boundary conditions and then invokes abstract results on the existence of energetic solutions to rate-independent systems. Specifically, the construction of mutual recovery sequences requires particular attention to accommodate the incompressibility constraint: to this end we employ the method by Moser (1965) to exhibit incompressible diffeomorphisms interpolating between localized translations and the identity.

comments
26 pages, 3 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.16854 ↗

We construct smooth solutions of the three-dimensional incompressible free-boundary Euler equations with surface tension whose vorticity remains bounded while its full spatial gradient blows up in finite time. The solutions are axisymmetric without swirl and occupy bounded domains in which a tubular cavity collapses onto a circle at time $T$, while the outer free surface converges smoothly. The vorticity $ω$ can be chosen arbitrarily small in $L^\infty$, uniformly up to collapse, and satisfies $\|\nablaω(t)\|_{L^\infty}\asymp (T-t)^{-1/2}|\log(T-t)|^{1/4}$ as $t\uparrow T$. A nonconstant material trace of the relative vorticity on the shrinking surface determines direction-dependent limits of the terminal vorticity, which therefore has no continuous extension across the collapse circle. The kinetic energy measure converges to the sum of a uniform line measure on this circle and a nonzero bulk part carried by a bounded rotational field. The construction couples vorticity transport to the boundary dynamics through weighted estimates in the collapsing collar and a cancellation in the normal acceleration.

comments
57 pages, 2 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.16868 ↗

Figalli and Zhang [29] established gradient stability for the sharp Sobolev inequality with the optimal exponent $r_p=\max\{2,p\}$. We prove that, for every fixed $p>1$, the corresponding optimal stability constant $\mathsf C_{n,p}$ admits effective upper and lower bounds of order $n^{-1}$ for all integers $n>p$. In particular, the dimensional dependence $n^{-1}$ is optimal. Our result extends the optimal dimensional dependence established for $p=2$ by Dolbeault, Esteban, Figalli, Frank, and Loss [18] to every $p>1$.

comments
61 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.16946 ↗

We establish upper and lower bounds for the off-diagonal entries of the capacitance matrix of infinite systems of spherical resonators in chain, screen and crystal geometries. Let $d$ denote the distance between two resonator centres. For chains contained in a cylinder of bounded radius and with bounded axial gaps, the decay is of order $d^{-1}\log^{-2}(2+d)$. For screens contained in a slab and relatively dense in the tangential directions, it is of order $d^{-3}$. For relatively dense three-dimensional configurations, we obtain exponential upper and lower bounds. No periodicity is assumed. Our proofs are based on the classical connection between the Dirichlet problem and Brownian motion, which enables us to relate the decay estimates to hitting probabilities of Brownian motion.

fields
Analysis of PDEs, Mathematical Physics, Probability
pdf ↗ page arXiv:2611.16978 ↗

Arranging points in the plane appears to be an elementary geometric problem, yet it is deeply rooted in statistical physics. As a toy model, we consider the configuration of four points. We completely classify the minimal configurations of four points interaction energy in $\R^2$ under the general Lennard-Jones potentials $V(r)=r^{-p}-br^{-q}$, where $p>q>0$ and $b\in\R$. We find that there is a threshold curve \[ D_{p,q}=2^{-(p-q)/2}\Bigl(1+\frac{p-q}{q+2}\bigl(1+2^{-(q+2)/2}\bigr)\Bigr) \] to determine the minimal shapes. The main results can be stated concisely as follows: consider $\min\sum_{1\le i<j\le4}\bigl(|x_i-x_j|^{-p}-b|x_i-x_j|^{-q}\bigr)$. For $b\le0$, the minimizer does not exist. For $b>0$, the minimizer is unique up to rotation and translation. Furthermore, the minimizer is \[ \begin{cases} \text{a square},&\hbox{if}\;\; D_{p,q}\ge1, \text{a rhombus with angle }θ\in(π/3,π/2),&\hbox{if}\;\; D_{p,q}<1. \end{cases} \]

fields
Analysis of PDEs, Mathematical Physics, Classical Analysis and ODEs
pdf ↗ page arXiv:2611.16990 ↗

We establish an instantaneous global $L^\infty(\R^3)$ bound at positive times for smooth, rapidly decaying solutions to the three-dimensional spatially homogeneous Landau equation with Coulomb potential, where the upper bound depends solely on the initial mass, momentum, energy, and entropy. This resolves an open problem posed by Golding, Gualdani, and Loher \cite{GGL} without requiring any initial higher velocity moments, Fisher information, or Lebesgue integrability. The proof builds on two main analytical ingredients. First, we establish the instantaneous generation of the negatively weighted Fisher information with weight $\la{v}^{-1}$. On the lifted two-particle phase space, we compare the separable weight matrix against a collision-invariant pair weight and control the rotational commutator near the diagonal via the quadratic local mass decay supplied by the conserved energy, closing a Riccati differential inequality at the second-moment threshold. Second, to overcome the $\la{v}^{-3}$ radial degeneracy of the diffusion matrix at large velocities, we prove a truncated anisotropic mixed Nash inequality on upper level sets of the density that recovers longitudinal regularity from two transverse Fisher directions and the nonlinear high-density part of the Coulomb entropy dissipation. Localizing this functional inequality to radially aligned velocity cells with the critical weight $\la{v}^{3/2}$ and coupling it with a weighted truncated entropy identity across nested exterior domains yields a superlinear De Giorgi recurrence that bounds the velocity tail uniformly in $\R^3$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.17000 ↗

We investigate a tissue regeneration model that describes the coupled dynamics of human mesenchymal stem cells (MSCs), chondrocytes, and newly formed extracellular matrix (ECM). The system features motility terms only for the mesenchymal stem cells, more precisely myopic diffusion and haptotaxis towards increasing ECM; all of those terms involve a space-dependent, possibly degenerating tensor. The chondrocytes are obtained from MSCs by differentiation and provide positive feedback to MSCs via dedifferentiation. The considered macroscopic model was obtained by upscaling from a formulation within the kinetic theory of active particles. Under appropriate assumptions we prove global existence of classical solutions in 2D and 3D in the case of a nondegenerating tensor and global existence of weak solutions in 2D when the diffusion tensor is allowed to degenerate. Numerical simulations are performed in 2D in order to illustrate the solution behavior.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.17063 ↗

We study discrete unique continuation for one-dimensional Schrödinger equations. We prove that if a solution vanishes at the points $\pm n^α$ at time $0$ and at the points $\pm n^β$ at time $1$, it must vanish identically in two main cases: the case of a Schrödinger equation with a real potential that is uniformly of Gevrey class $σ\ge 0$ in space, provided that $\max\{1,σ\}\big(α/(1-α)+β/(1-β)\big)<1$, and in the case of the cubic nonlinear Schrödinger equation, provided that $α/(1-α)+β/(1-β)<1$. Unlike previous results for logarithmically spaced zeros, our methods do not rely on complex analysis. We first show that, whenever $α+β<1$, the zeros force the solution to lie in the Schwartz class at all times. We then convert the zeros into gaussian decay at the two times, by combining energy estimates for iterations of the vector field $Γ=x+2it\partial_x$ with techniques from Fourier uniqueness problems, and conclude with the Morgan-type uncertainty principle of Escauriaza, Kenig, Ponce and Vega.

comments
26 pages, 1 figure
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.17073 ↗

We study the global Hessian integrability for nonzero convex solutions of the degenerate Monge-Ampère equations $\det D^2u=M(-u)^p$ with zero boundary values on arbitrary bounded convex domains in $\mathbb{R}^n$ in the global Lipschitz regime $p>n-2$. We establish global $W^{2,1+\varepsilon}$ estimates for every $0<\varepsilon<\min\{(p-n+2)/n,1\}$ and determine the optimal range of $\varepsilon$ in dimension two. The flat faces of rectangular boxes and their intersections impose upper bounds on the admissible exponents of global Hessian integrability. A new input in the proof for general dimensions is a Caccioppoli-type estimate for the boundary Hessian mass using vector fields arising from a mixed second inner variation. For the sharp higher integrability result in the plane, we use the combined hodograph-Legendre transform to control the curvature of level sets.

comments
37 pages, 3 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.17088 ↗

We establish quantitative convergence results for the smoothed particle hydrodynamics (SPH) method approximating the compressible Euler equations with nonlinear pressure laws $ρ^γ$, $γ\geq 2$. Our approach is based on a nonlocal approximation of the pressure force that preserves the energy structure of the original system, including an exact energy balance. Using the relative entropy method, we prove convergence towards smooth solutions of the compressible Euler equations as the nonlocality parameter $\varepsilon\to0$, with algebraic convergence rates and an explicit algebraic relationship between $\varepsilon$ and the number of particles $N$. In particular, we obtain quantitative convergence rates for the density in the Wasserstein distance and negative Sobolev norms, and for the momentum in the flat metric. A key feature of our analysis is that it applies to measure-valued densities in the nonlocal system, providing a unified framework for both continuum and particle solutions. Our results extend the existing rigorous convergence theory for SPH beyond quadratic pressure ($γ=2$) to general nonlinear pressure laws with $γ\geq 2$ on the periodic domain.

fields
Analysis of PDEs, Numerical Analysis
pdf ↗ page arXiv:2611.17151 ↗

This paper aims to establish higher gradient integrability away from the initial time for solutions to parabolic $p$-Laplace equations with general gradient-dependent lower-order terms throughout the singular and degenerate regimes. For this purpose, we develop an elliptic reconstruction argument based on an $L^2$-valued temporal Hölder estimate, thereby transferring the problem to elliptic estimates and quantitative control of the reconstruction error. In particular, our approach yields an explicit higher-integrability exponent. We further construct counterexamples illustrating that bounded continuous initial data alone are insufficient to ensure higher gradient integrability up to the initial time. Finally, we provide counterexamples demonstrating that gradient-dependent lower-order terms can prevent temporal Lipschitz regularity.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.17154 ↗

In this work, we study the local Hölder continuity of non-negative solutions to a class of doubly nonlinear anisotropic partial differential equations, with prototype \[ u_t-\sum_{i=1}^N D_i\Big(|D_i u^{m_i}|^{p_i-2}D_i u^{m_i}\Big)=0, \quad m_i>0,\quad p_i>1,\quad i=1,\ldots,N. \] The main result shows that, when the exponents describing the diffusion in different spatial directions are sufficiently close to one another, the solutions enjoy local Hölder continuity. A key feature of the analysis is the distinction between two diffusion regimes: the degenerate and the singular cases; the local regularity results are established in both regimes, under suitable conditions on the exponents.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.17203 ↗

We consider the nonradial five-dimensional focusing energy-critical wave equation. We construct a forward-global solution which remains arbitrarily close to a nondegenerate sign-changing stationary state in the energy space and is asymptotic to a varying stationary profile plus one free wave. The stationary profile moves in a compact conformal family, but its limit set contains a continuum of classes modulo translations, dilations and rotations. Consequently, the solution admits no soliton resolution using a fixed finite collection of stationary profiles and fixed Lorentz velocities, with pairwise orthogonal spatial parameters. That is, we disprove the fixed-profile soliton resolution conjecture for the five-dimensional focusing energy-critical wave equation. The construction uses a sequence of incoming waves with summable energies. Their quadratic impulses produce fixed shape displacements on increasing time scales. The main estimates control the zero eigenvalue of the linearized operator and the nonlinear error uniformly over the entire sequence. The stationary input uses a computer-assisted spectral bound for a symmetric single-node state.

comments
v1, 60 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.17243 ↗

We consider the three-dimensional focusing energy-critical wave equation. We construct a bounded forward-global solution which starts arbitrarily close to a sign-changing stationary state and is asymptotic to a varying stationary profile plus one free wave. The core has two limits in distinct similarity orbits. A single energy-space norm identity identifies the radiation and reduces every competing fixed list to one profile; the two limits then give a contradiction. The construction uses summable radiation packets whose quadratic impulses produce fixed shape displacements on increasing time scales. We control the nonlinear error uniformly over these intervals and select the endpoints by a compact fixed-point map. A computer-assisted certificate validates the stationary state and its complete odd energy kernel.

comments
57 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.17291 ↗

We establish a regularity criterion for $Q$-valued maps $u\in W^{2,2}_{\mathrm{loc}}(Ω,\mathcal A_Q(\mathbb R^k))$, where $Ω\subset\mathbb R^n$ is open. If $|Δu|\leqδ_*|D^2u|$ almost everywhere, with $δ_*=δ_*(n,k,Q)>0$ sufficiently small, then $u\in C^{1,α}_{\mathrm{loc}}$ for some $α=α(n,k,Q)>0$, with quantitative estimates. The result holds for arbitrary $n\geq2$, $k\geq1$, and $Q\geq1$. The proof establishes uniform energy decay using a rigidity principle for positive-semidefinite matrix-valued measures with an aperture bound and approximately atomic divergence, extending the target-stress argument for the homogeneity gap in \cite{Luc26}. The argument relies only on first variation identities. As consequences, we obtain $C^{1,α}$ regularity for Dirichlet-stationary $W^{2,2}$ maps and for locally Lipschitz $W^{2,2}$ maps whose graph varifolds are stationary and have sufficiently small slope. Combining the latter result with Bellettini's Lipschitz sheeting theorem \cite{Bel25}, we establish $C^{1,α}$ sheeting in the multiple-valued sense for two-sided stable minimal immersions whose singular set has vanishing $2$-capacity relative to the immersion, under suitable flatness and mass bounds. Our results allow us to reduce the proof of compactness within this class, under locally uniform mass bounds, to the conjecture that branch sets of stationary $C^{1,α}$ multiple-valued graphs in codimension one have vanishing $2$-capacity.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.17317 ↗

Mathematical Physics54

We show (Theorem 3) that the symplectic reduction of the spatial $n$-body problem at non-zero angular momentum is a singular symplectic space consisting of two symplectic strata, one for spatial motions and the other for planar motions. Each stratum is realized as coadjoint orbit in the dual of the Lie algebra of the linear symplectic group $Sp(2n-2)$. The planar stratum arises as the frontier upon taking the closure of the spatial stratum. We reduce by going to center-of-mass coordinates to reduce by translations and boosts and then performing symplectic reduction with respect to the orthogonal group $O(3)$. The theorem is a special case of a general theorem (Theorem 2) which holds for the $n$-body problem in any dimension $d$. This theorem follows largely from a ``Poisson reduction'' theorem, Theorem 1. We achieve our reduction theorems by combining the Howe dual pair perspective of reduction espoused by Lerman-Montgomery-Sjamaar with a normal form arising from a symplectic singular value decomposition due to Xu. We begin the paper by showing how Poisson reduction by the Galilean group rewrites Newton's equations for the $n$-body problem as a Lax pair. In section 6.4 we show that this Lax pair representation of the $n$-body equations is equivalent to the Albouy-Chenciner representation in terms of symmetric matrices.

comments
28 pages, 2 figures
fields
Mathematical Physics, Dynamical Systems
pdf ↗ page arXiv:2504.01272 ↗

An isoperimetric flow is introduced in the setting of causal variational principles. Describing the whole space by the support of a minimizing measure, we define an area functional on subsets by a surface layer integral. Mean curvature is defined via the first variation of this area functional. Using the method of minimizing movement, the isoperimetric flow is constructed as a Lipschitz curve of measures with prescribed volume change. As illustrating examples, we introduce and analyze ``smeared variants'' of the mean curvature flow in Euclidean space and on a Riemannian manifold. In these examples, it is shown that our area functional coincides with the usual area up to specified curvature corrections. As an application of our general results, by analyzing the volume and area of small isoperimetric balls, we introduce notions of local dimension and synthetic scalar curvature.

comments
33 pages, LaTeX, 3 figures
fields
Mathematical Physics, Analysis of PDEs, Differential Geometry
pdf ↗ page arXiv:2611.14265 ↗

Lieb–Robinson bounds limit the spread of quantum information, but do not establish that a prescribed input can be prepared and transmitted with appreciable probability. For quantum graphs with fluctuating edges, connecting spectral propagation to unconditional readout also requires control of graph coherence, finite boundaries, and preparation errors. We address this problem in a one-probe model on a prescribed square candidate lattice, combining a generalized Rokhsar–Kivelson parent, spectral reduction, adiabatic preparation, and local dynamical estimates. Assuming a supplied coherent graph ground state, we construct a finite-source wave packet and a hopping ramp that populate an isolated branch with strictly positive group velocity. We prove an unconditional arrival probability of at least $5/8$ in a specified receiver region of a sufficiently large finite open square. Explicit bounds on local joint-state and Hamiltonian errors retain a lower probability of $9/16$, without requiring global many-body state closeness or postselection on graph measurements. Exact arithmetic certificates and a separate small-system numerical diagnostic support the quantitative analysis. The construction provides a model-specific benchmark for transport and readout in fluctuating quantum networks, linking a propagation mechanism to an observable lower bound and identifying the local error budgets required to preserve it. It distinguishes suppression of unwanted influence from guaranteed signal delivery, a useful separation for quantum-network and emergent-geometry models. The resource estimates are conservative, graph-state supply is assumed, and the result does not establish background-free geometry or gravitational dynamics.

comments
13 pages, 1 figure; includes appendices. Reproducibility code and data provided as ancillary files
fields
Mathematical Physics
pdf ↗ page arXiv:2611.14588 ↗

We study total time derivatives in infinite-order and nonlocal Lagrangian mechanics. In the formal infinite-order setting, such terms remain variationally trivial. For nonlocal functionals on trajectories, however, exactness in the form $L=DW$ is not sufficient to ensure a vanishing nonlocal Euler-Lagrange expression. We exhibit a smooth convolution-type counterexample.

comments
21 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.14612 ↗

We derive a microscopic relation between the many-body Chern number $C$ of the fermionic ground state and the braiding of fluxes in $\mathbb{Z}_{2}$ gauge theory coupled to matter: under a spectral gap condition, dressed flux loops obey $W_2W_1=e^{i\fracπ{2}C}W_1W_2$ on the ground-state sector. We realize $C=1$ by gauging charge parity in a weakly interacting Qi-Wu-Zhang insulator. Reflection positivity and chessboard estimates show that flux defects are massive, which yields a gapped, topologically ordered phase with four locally indistinguishable ground states.

comments
6 pages, 5 figures; 11 pages of supplementary material
fields
Mathematical Physics
pdf ↗ page arXiv:2611.14658 ↗

The action of closed bosonic string field theory is non-polynomial, and for more than thirty years a no-go theorem of Sonoda and Zwiebach (1990) has excluded a cubic formulation with a single string field, a symmetric vertex and the canonical propagator. We evade it with a Hubbard–Stratonovich transformation and provide an explicit construction of a cubic closed string field theory at all orders. The transformation introduces an infinite tower of auxiliary $k$-string fields $Σ_k$, entering at order $g_s^{2 k - 2}$, which turn the vertices with four or more legs into kinetic terms and cubic couplings. The action is cubic, at most quadratic in each auxiliary field, and triangular: eliminating the auxiliary fields by Gaussian integrals recovers the original action order by order at tree level, under invertibility and kernel conditions on the auxiliary kinetic operators. The original gauge symmetry lifts to the cubic action with no new parameter, and we argue that the auxiliary fields add no physical state at generic momentum, wherever their kinetic operators are invertible. On the worldsheet, $Σ_2$ is an entangled two-string state: by an operator product expansion, the quartic form reduces to a gluing of two asymmetric cubic vertices dressed by the motion of the local coordinates and defined on states without level matching. We expect this picture to generalize to higher orders, defining a gluing of patches carrying $k$ punctures each. The string vertices, read as products with several outputs, satisfy an extended form of the genus-zero $\mathrm{IBL}_\infty$ relations, including operations with no input or no output, exactly when the string products form a cyclic $L_\infty$ algebra. Finally, we compare our action with the bar–cobar construction of Chiaffrino, Mamade and Zwiebach.

comments
99 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.14670 ↗

The Poisson $σ$-model (PSM) over a closed worldsheet $Σ$ is reinterpreted as a theory of connections on a trivial principaloid bundle $P_0 = Σ\times G \to Σ$ with the symplectic structure groupoid $(G,ω)$ integrating the Poisson target $(M,Π)$, and that of sections of the shadow bundle $F_0 = Σ\times M \to Σ$ - as defined in 2503.09886 [math.DG]. The flat directions of the PSM are explained as linearisations of automorphisms of $P_0$, modelled on maps from $Σ$ into the group of lagrangean bisections of $G$, which induce Poisson automorphisms of $(M,Π)$. The gauge anomaly of the ensuing field theory is derived and demonstrated to vanish for prequantisable $ω$. A general anomaly-cancellation mechanism is proposed, which couples the bare model - rewritten as the holonomy of a connection-dependent trivial gerbe on $F_0$ - to a background gerbe over $M$ endowed with a $G$-equivariant structure. The coupling takes the form of the tensor product of the two gerbes and the extended PSM is defined as the holonomy of the product gerbe. An essential generalisation of the theory is then proposed - to shadows $F$ of principaloid bundles $P$ of arbitrary topology, in keeping with the interpretation of the gauging as descent to the orbistack $M//G$. The generalisation uses local product gerbes depending on local connections over trivialisations of $F$. The $G$-equivariant structure is proven to ensure a 2-stacky descent of the local gerbes to a global one over $F$. Its holonomy is taken as the definition of the generalised PSM. A cohomological discussion of obstructions against the descent is provided. Finally, a reformulation of the generalised PSM as a field theory with a topological gauge-symmetry defect is given, in which the $G$-equivariant structure is employed - alongside the transition cocycle of $P$ - as the datum of the defect.

comments
59 pages, 9 figures
fields
Mathematical Physics, Differential Geometry, Symplectic Geometry
pdf ↗ page arXiv:2611.14784 ↗

XXX spin-chain Hamiltonians can be derived within the $R$-matrix formalism. For a simple Lie algebra $\mathfrak{g}$, the rational $R$-matrix $R$ intertwines the coproduct $Δ$ in the Yangian $\mathsf{Y}(\mathfrak{g})$. $R$ admits a particular Gauss decomposition $R=LDU$, where the upper-triangular matrix $U$ can be obtained from the lower-triangular matrix $L$. We treat $U$ in three ways. Algebraically, $U$ is known as a factorization twist. It plays the role of a ``universalizer'': it conjugates a non-universal pseudo-coproduct $\mathscr{D}$ in the molten crystal chain basis to the true Yangian coproduct $Δ=U^{-1}\mathscr{D} U$. Physically, $U$ can be obtained as a Berry phase in SUSY quiver QFT for a quiver associated with the Dynkin diagram of $\mathfrak{g}$. In this case, $U$ is calculated as a sum over tunneling amplitudes. Geometrically, $U$ can be interpreted as a renormalized Maulik-Okounkov stable envelope localized at a fixed point. In the physical setting, the Yang-Baxter equation (YBE), which ensures integrability, follows from the flatness of the Berry connection, which in turn follows from supersymmetry. However, the YBE imposes subtle constraints on the tunneling amplitudes, which we examine here. We construct recursion relations that allow higher collective amplitudes to be obtained from more elementary ones. We observe that different tunneling channels are in fact intertwined, leading to finer cancellations among amplitudes and to wall-crossing phenomena: depending on the parameters, the same amplitude is represented as a sum over different channels. We focus on $\mathsf{Y}(\mathfrak{sl}_2)$ with higher-spin and non-evaluation representations, as well as on the fundamental representation of $\mathsf{Y}(\mathfrak{sl}_{n+1})$.

comments
44 pages, 5 figures
fields
Mathematical Physics, Algebraic Geometry, Quantum Algebra, Representation Theory
pdf ↗ page arXiv:2611.14793 ↗

We study the one-loop Casimir interaction between two $δ$--$δ'$ plates in the fixed one-soliton Pöschl–Teller background of the sine-Gordon kink. The transverse fluctuation problem is the Gaussian truncation of an $S^2$ sigma model, equivalently an easy-axis antiferromagnet with a domain wall, in which the plates exert no classical force on the wall. For $v\ge2|w|$ the fluctuation operators are non-negative, and strictly stable couplings, $v>2|w|$, also exclude zero modes, so the quadratic field theory is consistent at the fixed sine-Gordon mass. The background-dressed relative determinant factorises exactly into effective, gradient-dependent strengths of the two plates, and the sign of each frequency channel of the interaction energy is fixed by their orientation. Two identical, equally oriented, strictly stable plates switch from attraction near the kink to repulsion away from it under a rigid translation at fixed couplings and separation. The interaction energy and the force conjugate to the separation neither share their sign everywhere nor change sign at the same positions: there are regions of negative energy and repulsive force, so attraction and repulsion must be read from the force. For such plates with $w\neq0$ the force is repulsive at short and attractive at large separation, and the interaction energy has a minimum at a separation that depends on the position of the pair. For $v=1.05$, $w=0.5$ and $d=1.5$ the energy changes sign at $c\simeq-0.44$ and $2.63$, and the force at $c\simeq-0.30$ and $2.00$.

comments
18 pages with 4 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.14799 ↗

Driving between nonequilibrium steady states incurs two thermodynamic costs: excess entropy production (EP) resulting from changing control parameters, and housekeeping EP required to sustain steady currents. Conventional fixed-duration optimization minimizes the former while neglecting the latter. Here, we instead optimize excess EP over both the protocol and its duration subject to a fixed leading order of housekeeping-EP budget, thereby minimizing total EP for that budget constraint. In the slow-driving regime, accumulated housekeeping EP acts as an entropic time, mapping the problem to a geodesic optimization under a friction metric weighted by the steady-state EP rate. This resource-based geometry determines optimal paths and schedules for systems that continue to dissipate even in steady states, establishing an intrinsic trade-off between housekeeping and excess EPs. Near equilibrium, this framework further yields geometric lower bounds on total EP, attained with equipartition at the optimal budget given by a modified thermodynamic length. Numerical simulations of a three-state model for an ATP-driven calcium pump reveal distinct optimal protocols compared to fixed-duration driving, confirming the total-EP bounds.

comments
6 pages, 2 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.14891 ↗

Stabilizer measurements provide a direct route to preparing quantum error-correcting codes and long-range entangled states. In realistic implementations, however, finite measurement strength can coherently deform the encoding map away from the projective limit. Certain nonlocal signatures associated with long-range order can survive such a deformation, but this alone does not guarantee that the resulting state protects encoded quantum information. We show that, at fixed strength, local logical leakage obstructs asymptotically faithful recovery; along logical operators' supports, its accumulation forces the relevant measurement strength to grow logarithmically with code distance. We then prove that this obstruction can be removed locally: for fixed toric registers under sufficiently weak local-stochastic errors, enhancing only a vanishing fraction of checks near selected logical supports restores recovery while the bulk remains at finite measurement strength. With recoverability restored, we prove a further dimensional distinction in logical operations. In the strict three-dimensional deconfined phase, suitable enhanced tubes restore the equivalence of macroscopically separated representatives, so either representative asymptotically implements the same controlled logical action on a fixed encoding. In two dimensions, recoverability alone does not restore this equivalence: the representatives can remain inequivalent even when both associated encodings are recoverable.

comments
19 pages, 5 figures, with 39 pages "Detailed Derivations and Proofs of the Theorems"
fields
Mathematical Physics
pdf ↗ page arXiv:2611.14967 ↗

We revisit the bilinear formulation of the intermediate long-wave (ILW) equation by interpreting its principal-value integrals in the framework of Sato hyperfunctions. When the tau-functions have no zeros inside the relevant contours, the conventional source-free ILW equation is recovered. When zeros enter the contours, their residue contributions must instead be retained, leading naturally to a residue-extended ILW system with self-consistent sources determined by the tau-functions themselves. We introduce a residue index that counts the zeros enclosed in each analytic strip and use it to classify the resulting soliton sectors. The conventional elevation-soliton belongs to the zero-residue sector, whereas depression-solitons and higher elevation branches generally carry non-zero residue indices. Exact one- and multisoliton tau-functions are constructed, including mixed elevation–depression configurations with factorised two-body interactions. Their residue indices are additive and remain invariant during collisions, provided that no zero crosses a contour boundary. A Fourier-space analysis shows that the soliton spectra decay exponentially at large wavenumbers, with a decay rate determined by the distance of the nearest complex singularity from the real axis. This rate vanishes as an odd-multiple boundary between adjacent residue sectors is approached, providing a direct spectral signature of the transition between them.

comments
29 pages, 10 figures, 3 tables
fields
Mathematical Physics
pdf ↗ page arXiv:2611.15072 ↗

The paper presents a brief overview of recent advances in the mathematical theory of evolution equations for quantum many-particle systems. The structure of expansions representing non-perturbative solutions to the Cauchy problem for hierarchies of fundamental evolution equations for many quantum particles is outlined. It has been shown that the concept of cumulants of operator semigroups forms the basis for non-perturbative representation of solutions to hierarchies of evolution equations that describe the state and observables. It is proven that the constructed dynamics of correlations underlie the description of the evolution of the state, both for finitely and infinitely many particles, governed by the BBGKY hierarchy for reduced density operators or by the hierarchy of nonlinear evolution equations for reduced correlation operators. In fact, it is demonstrated that the behavior of particle correlations governs the dynamics of states in quantum systems with an infinite number of particles.

comments
17 pages
fields
Mathematical Physics, Analysis of PDEs
pdf ↗ page arXiv:2611.15304 ↗

We study the formation and stability of weak null singularities for solutions to the massive and massless Einstein–Vlasov systems without symmetry assumptions. Extending previous results of Luk in the vacuum setting, we establish the existence of spacetimes arising from characteristic initial data that develop a singular null boundary while remaining extendible with a continuous metric. For both massive and massless particles, the energy-momentum tensor and Ricci curvature remain bounded and extend continuously to the singular boundary. For genuinely singular initial data, the Christoffel symbols in the original double-null coordinates fail to be locally square integrable near the boundary. We introduce new commutator vector fields that avoid both derivative loss and the most singular curvature component. Under additional curvature assumptions, we also prove Lipschitz inextendibility across the singular null boundary.

comments
62 pages, 4 figures
fields
Mathematical Physics, Analysis of PDEs
pdf ↗ page arXiv:2611.15318 ↗

Within an analytical non-perturbative framework based on a single exact model, the coupled dynamics of gravitational waves and high-frequency electromagnetic fields is investigated in General Relativity and DHOST gravity. Using an exact gravitational-wave spacetime in an isotropic (null) wave coordinate system, Maxwell's equations are integrated analytically. This analysis provides an exact non-perturbative confirmation from the full field equations that a gravitational wave acts as a waveguide, forming a propagation channel for electromagnetic radiation co-directional with the gravitational wave and generating an effective pure-radiation source. Applying this exact electrodynamic solution to the nonlinear field equations of DHOST class~Ia gravity reveals that the algebraic structure of the DHOST constraint equations enforces a modification of the electromagnetic-wave parameters. Based on this mechanism, an observationally testable effect of scalar frequency drift is derived, providing a direct way to discriminate between General Relativity and modified gravity theories even when their metric tensors share identical functional forms.

comments
17 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.15414 ↗

Reinforcement learning (RL) is proposed as a strategy for the multi-objective design of Helmholtz resonators with near-perfect acoustic absorption. The approach formulates resonator design as a sequential decision-making problem in which geometrical parameters are iteratively updated to balance competing objectives, including resonator volume, resonance frequency, and acoustic reflection. A Q-learning algorithm based on a neural network is developed to explore the design space and identify non-dominated solutions, providing a Pareto front of optimal configurations. The acoustic response is evaluated using a transfer matrix method that incorporates viscothermal losses and acoustic end corrections. Three representative designs are subsequently investigated using full-wave finite element simulations, showing good agreement in their absorption and reflection spectra and validating the accuracy of the reduced-order model. Finally, one optimized resonator is fabricated by three-dimensional printing and experimentally characterized in an impedance tube. The measured absorption coefficient reaches approximately 95\% near the resonance frequency, in agreement with the numerical predictions. These results demonstrate the potential of reinforcement learning for the automated design of compact acoustic absorbers and establish a computationally efficient framework combining multi-objective optimization, numerical modelling, and experimental validation.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.15422 ↗

We construct the canonical boundary algebras of Jackiw–Teitelboim gravity coupled to free bosonic matter. For a nonempty finite or countable family of species with lowest weights greater than one half, the two boundary algebras are mutual commutants and nonhyperfinite type $\mathrm{II}_\infty$ factors. Their nonzero finite corners are nonhyperfinite type $\mathrm{II}_1$ factors. The construction uses bounded heat-regularized fields and a Hilbert algebra, which gives a faithful normal semifinite trace without a path-integral argument. The weight restriction is sharp: elementary point fields remain unbounded after positive heat regularization when $0<d\leq1/2$. For one massless scalar, specified bounded observables and normal states have a high energy limit described by a hyperfinite continuous core. We explain why this limit does not preserve the nonhyperfiniteness of the exact algebra.

comments
72 pages
fields
Mathematical Physics, Operator Algebras
pdf ↗ page arXiv:2611.15452 ↗

We review recent progress on the conjectural relation between the resurgent structure of topological string free energies and BPS invariants of type II string theory compactified on the same Calabi-Yau threefold. In this picture, Borel singularities are located at integral periods associated with central charges of stable D-brane bound states, while Stokes constants encode their BPS indices, or generalized DT invariants. After introducing resurgence and perturbative topological strings, we explain how trans-series solutions of the holomorphic anomaly equations determine non-perturbative amplitudes and illustrate the proposed correspondence in local and compact geometries. We discuss the behavior under changes of polarization and moduli, and review supporting arguments based on exact WKB analysis, blowup equations, the Stokes automorphisms of flat coordinates and dual partition functions, and Kontsevich-Soibelman wall-crossing. We conclude with open questions concerning a general proof, the interpretation of non-perturbative amplitudes, and the construction of non-perturbative completions.

comments
32 pages, 9 figures, proceedings to CY 50 conference
fields
Mathematical Physics
pdf ↗ page arXiv:2611.15480 ↗

We show that a Lotka–Volterra system with an interior equilibrium admits a metriplectic structure, with a Volterra function $V_C$ as energy and an entropy variable for the environment, if and only if Volterra's dissipativity condition $CA+A^{\top}C\le0$ holds, and we construct it explicitly with a log-canonical Poisson bivector. Adding noise through the fluctuation–dissipation relation of stochastic GENERIC yields multiplicative environmental noise, with covariance fixed by the symmetric part of $AC^{-1}$, whose stationary law is an explicit Gibbs measure: a product of independent Gamma distributions. Unlike known Gibbs measures for stochastic Lotka–Volterra systems, this holds for nonsymmetric interactions, predator–prey included. The stationary law determines only the equilibrium and $C/k$: every interaction matrix in an open cone of dimension $n^2$, in particular any Poisson part, produces with its compatible noise the same law as uncoupled stochastic logistic equations. Gamma-distributed, uncorrelated abundance fluctuations, as observed in microbial communities, are therefore no evidence of absence of interactions. The interactions are, however, visible in time: the zero-lag derivative of the log-abundance covariance equals $A(C/k)^{-1}$, and its antisymmetric part is the Poisson part, which carries all the stationary entropy production, computed in closed form. Finally, for general noise we prove an exact Lyapunov-type identity $AK+K^\top A^\top+Q=0$ for $K=\mathrm{Cov}(x,\log x)$ at any stationary solution. It implies that the populations are independent if and only if the noise is metriplectically compatible, and gives an explicit lower bound on interspecies cross-covariances in terms of the distance of $Q$ to the compatible family. Simulations of a predator–prey model show that the bound is nearly sharp.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.15632 ↗

We investigate criticality-enhanced sensing near ground- and excited-state quantum phase transitions in a strongly coupled qubit-boson system. Accounting for finite-size effects, we design driving protocols that exploit diverging susceptibilities to enhance signal-to-noise ratios in parameter estimation using experimentally relevant generators. We show that the excited-state criticality provides a metrological advantage through single-mode bosonic squeezing in regimes that circumvent the 'death of adiabaticity', limiting conventional critical quantum metrology with ground-state criticality.

comments
[6 pages, 4 figures, letter, submitted]
fields
Mathematical Physics
pdf ↗ page arXiv:2611.15683 ↗

Realizing the potential of optimized acoustic holograms for applications like transcranial ultrasound requires sub-wavelength alignment accuracy (less than 1.5 mm at 1 MHz), which is difficult to achieve with current non-MRI optical neuro-navigation methods. To address the critical challenge of alignment, we leverage the parametric array (PA) signal as an alignment surrogate, a highly penetrative, low-frequency difference wave generated by the nonlinear mixing of two primary high-frequency beams. Simulations show that a misaligned skull-compensating lens increases the primary acoustic energy within the skull bone (volumetric energy trapping), which strengthens the nonlinear source of the PA signal. We also tested whether shear-mode conversion in bone contributes: 2D elastic simulations showed only a small (3-5%) increase in shear-type motion with misalignment, and the transmitted ex vivo bursts did not lengthen as a shear path would require. Pseudo-sound and microbubble artifacts were examined and found unlikely to explain the signal, consistent with the PA signal arising from the intrinsic nonlinearity of the bone. Minimizing this PA signal yields a noninvasive real-time feedback mechanism that achieves sub-wavelength alignment accuracy, outperforming standard neuronavigation. Our findings present a robust framework that supports the design of simple, economical, and high-performance transcranial ultrasound systems for high-precision neuro-interventions.

comments
25 pages, 13 figures (6 main, 7 supplementary), 2 tables. Adapted from the first author's Ph.D. dissertation at the Georgia Institute of Technology (2026)
fields
Mathematical Physics
pdf ↗ page arXiv:2611.15730 ↗

We compute the point symmetry pseudogroup of the Kadomtsev-Petviashvili equation using both the direct and the algebraic methods. We also revisit the classical Lie symmetry analysis of this model in detail, concentrating on hidden infinitesimal and hidden point symmetries. Additionally, we re-examine the symmetry properties of each codimension-one reduced model and determine their point symmetry pseudogroups.

comments
27 pages
fields
Mathematical Physics, Analysis of PDEs, Rings and Algebras
pdf ↗ page arXiv:2611.15833 ↗

We study the recovery of a rank-one signal embedded in a symmetric Euclidean random matrix, whose dense and geometrically correlated entries generally lack rotational invariance. We show that signal recovery through the leading eigenvector is governed by a competition between the principal directions of the noise and the signal. In particular, the signal may already be encoded in a subleading eigendirection, while remaining undetected by the leading principal component. As the signal strength increases, a crossing between competing eigenvalues can change their ordering, causing the leading eigenvector to switch abruptly from a noise-dominated to a signal-bearing direction. This mechanism gives rise to a discontinuous BBP-type transition, in which the overlap with the signal jumps from zero to a finite value. Using the replica method, we reduce the problem to a Fredholm eigenvalue equation and derive general criteria for the existence of a positive recovery threshold, expressed in terms of the unperturbed spectral edge, the spike mean and the spatial averages of the principal eigenfunctions. We obtain analytically the limiting largest eigenvalue, eigenvector-component distribution and signal overlap, and illustrate the results with explicit solutions for quadratic distance and rank-two kernels, finding excellent agreement with numerical diagonalisation.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.15927 ↗

Isometries of a manifold and special types of spinors called Killing spinors which are related to Killing vector fields constitute a symmetry superalgebra structure corresponding to Poincare superalgebra. The antisymmetric generalization of Killing vector fields to higher degree forms which are called Killing-Yano forms are considered. The odd part of the Poincare superalgebra is extended from the space of Killing vector fields and their rotational representation to the space of special odd Killing-Yano forms and special even closed conformal Killing-Yano forms. The even part is again corresponds to the space of Killing spinors. By defining the relevant brackets, we show that hidden symmetries and Killing spinors together define an extension of the Poincare superalgebra.

comments
9 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.15946 ↗

This is the first of two papers devoted to spatial Fréchet structures on AF algebras and their derivations. Here, we study the simplest example of such a structure: the Fréchet algebra of almost-local compact operators associated with a fixed orthonormal basis. We revisit the characterization of its continuous derivations in terms of infinite matrices and their operator-theoretic implementation on rapidly decreasing vectors. Reformulating this description in the language of 0-chains, borrowed from the theory of quantum many-body systems, we establish a sufficient condition for continuity in terms of spatial growth. Finally, we construct a Fréchet-continuous symmetric derivation that does not generate a one-parameter group of automorphisms of this algebra that is strongly continuous with respect to its Fréchet topology.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.16021 ↗

In this work, we extend the equilibrium-evolution duality between stochastic quantization and Wilsonian renormalization to non-abelian gauge theories in anti-de Sitter space, for which the radial coordinate of AdS plays the role of the stochastic time. We show, to all orders in the fields for bulk theories without explicit radial dependence, that the Langevin distribution at time $t$ is the product of the ultraviolet and infrared radial wavefunctions at the cutoff $ε=t$. We therefore identify this Langevin process as the ground-state (Doob) transform of the radial evolution. By explicit calculation, we also extend the existing dictionary in the stochastic-renormalization duality: the radial component of the bulk field is Zwanziger's stochastic gauge-fixing function; radial gauge is Parisi-Wu quantization; and the bulk gauge $A_z=α^{-1}\partial_iA_i$ is Zwanziger's gauge. We also obtain the expressions for the triple-trace and quadruple-trace couplings of the holographic Wilsonian action at finite cutoff in closed form; in the infrared, they reduce to the known gluon correlators and, at the total-energy pole, to flat-space Yang-Mills amplitudes as expected. Although our explicit results are provided at tree-level and derived in AdS$_4$, we also comment on the de Sitter counterpart of these statements and on the loop corrections.

comments
22 pages, 1 figure
fields
Mathematical Physics
pdf ↗ page arXiv:2611.16074 ↗

We construct two-parameter Baxter $\mathbb{Q}$-operators for the transfer matrices of noncompact open $SL(2,\mathbb{C})$ BC-type spin chains with general boundary interactions, treating both one-boundary and two-boundary models. The $\mathbb{Q}$-operators are defined as traces of general monodromy matrices over infinite-dimensional auxiliary spaces carrying principal series representations of $SL(2,\mathbb{C})$. At specific values of parameters the two-parameter $\mathbb{Q}$-operators degenerate into simpler one-parameter Baxter operators. We prove that the general transfer matrices factorize into products of these one-parameter $Q$-operators. We provide both an algebraic derivation based on local operator identities and a diagrammatic proof using Feynman diagrammatic techniques. Finally, we apply the quantum Separation of Variables (SoV) method to the spectral problem of the one-boundary transfer matrix. We derive the system of separated difference equations for the transfer matrix eigenfunctions and show that, under the assumption of kernel factorization, it reduces to a one-dimensional difference equation coinciding precisely with the Baxter equation for eigenvalues of appropriately normalized one-parameter Baxter $Q$-operator.

fields
Mathematical Physics, Representation Theory
pdf ↗ page arXiv:2611.16105 ↗

Machine learning (ML) developments have empowered valuable calculations in many areas of theoretical physics. Certain topics involving moderate-to-low accuracy requirements have been particularly fortunate because many ML techniques, such as neural networks, introduce a noise floor that would be difficult to penetrate with stricter tolerances. For this reason, topics requiring high accuracy can be hesitant to pursue ML. One prominent example is gravitational wave modeling, which relies on traditional methods that accommodate the high sensitivities of detectors such as LISA. However, recent progress in applied mathematics has identified hybrid methods where fast-but-noisy ML mechanisms are inserted into otherwise traditional numerical schemes to accelerate convergence in a way that ultimately meets or exceeds the accuracy of standard methods. We develop an optimized hybrid ML method to tackle a class of challenging PDEs; specifically, we demonstrate ML implementations for gravitational waves from asymmetric-mass black hole binaries and elastic waves. These require solving sparse linear algebra systems with Helmholtz features that are especially difficult for traditional iterative methods. Our new approach is to train a graph neural network (GNN) as a significantly faster preconditioner using a novel loss function based on the true residual of the iterative algorithm. For the most difficult regions of parameter space, our neural preconditioner decreases iteration counts by 2-15x compared to traditional preconditioners. Because the GNN operates directly on the sparse matrix and needs only modest physical context, it generalizes beyond its training domain and can be adapted to new problems across physics by retraining rather than redesign. Hybrid ML methods such as this offer a new and compelling avenue to handle high accuracy and speed requirements in gravitational wave modeling and beyond.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.16106 ↗

We give a probabilistic characterization of the ideals of resolvent algebras. Through the correspondence of Klein and Landau between KMS systems and stochastic processes, the fields of an isotropic subspace become commuting random variables, and the description of ideals by subspaces of the one-particle space becomes a description by $σ$-algebras: the ideal generated by the resolvents outside a subspace $Y$ corresponds to the $σ$-algebra of the fields on $Y$, inclusions of the ideals reverse those of the $σ$-algebras, and independence is characterized by conditional expectations.

comments
28 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.16133 ↗

We derive closed-form relations between projected fibril-axis statistics and tensor-dependent second-harmonic generation (SHG) harmonics using a single axial von Mises population. Under coherent emission within domains and detected intensity addition across domains, each angular harmonic factors into a local tensor coefficient and an axial circular moment. Parallel-analyzer detection contains second, fourth and sixth harmonics; ideal equal-weight analyzer-free detection contains second and fourth harmonics. The resulting formulas identify geometry-specific harmonic zeros, sensitivity loss and ambiguous inversion of a secondary fixed-angle ratio. In particular, the analyzer-free fourth-harmonic zero at $ρ=1/3$ does not imply loss of all orientation sensitivity. Prepared-cornea forward/reverse recordings illustrate extraction of empirical analyzer-free harmonics. In the bundle ROI, second harmonics are resolved in both sweeps, while their normalized amplitudes differ and fourth harmonics remain unresolved. An exploratory central ROI from the same recordings yields a different forward/reverse profile. Within the same operator-identified tissue, low-signal space coverage and apparent fibre alignment vary slightly across recordings. These observations support angular-measurement feasibility while leaving quantitative normalized-shape agreement unestablished. The thermal extension illustrates consequences of assumed kinetics rather than calibrated tissue trajectories. The contribution is an analytical interpretation of SHG harmonics with explicit conditions for physical inference; the measurements do not establish absolute susceptibility ratio $ρ$, axial concentration $κ$, or experimental separation of thermal disorder from degradation.

comments
20-page main manuscript with 7 figures; 21-page supplement with 12 figures included
fields
Mathematical Physics
pdf ↗ page arXiv:2611.16232 ↗

Higher-order topological insulators and superconductors, under combined point and fundamental symmetries, display topological modes supported by boundaries of higher codimensions, such as a corner mode. In this work, we explain a theoretical device that enables us to claim that there exists {\it one and only one} intrinsic chiral-symmetric higher-order topological phase for the quarter-plane geometry with point-symmetry given by reflection about the diagonal of the corner. Furthermore, we supply a minimal tight-binding model of this phase and design an acoustic crystal whose dynamics reproduce that of the model. The robust properties of the corner mode are investigated by COMSOL simulations.

comments
14 pages, 10 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.16261 ↗

We develop a spinorial symmetry framework for metric Dirac structures in $H$-twisted exact Courant algebroids. A generalized metric equips a Dirac structure with an intrinsic Riemannian Lie-algebroid geometry and identifies it isometrically with the positive subbundle of the generalized tangent bundle. For sections preserving the generalized metric, we prove an exact intertwining between the positive-spinor Kosmann–Dorfman action and the intrinsic Kosmann derivative. The comparison is independent of the auxiliary compatible generalized connection. Within the intrinsic geometry we derive Killing–Yano (KY) and conformal Killing–Yano (CKY) integrability identities, construct Killing-spinor-preserving operators from odd special KY and even special closed CKY forms, and obtain these forms from Hermitian bilinears of Killing spinors with imaginary Killing number. We illustrate the framework on a global Dirac structure over $S^2\times S^1$ with nontrivial $H$-flux class and rank-two anchor. Its spin connection and symmetry operators are explicit, and its Killing-spinor space is a transverse family $C^\infty(S^1,\mathbb C^2)$. Finally, intrinsic Killing sections act on Killing spinors by a Lie algebra representation. For a graph Dirac structure over $S^3$, the odd Jacobi identity of the Hermitian-current bracket fails by a phase, and adjoining a single even phase generator yields a Lie superalgebra. These results connect generalized isometries, hidden spinorial symmetries, and flux-sensitive Lie-algebroid geometry.

comments
19 pages
fields
Mathematical Physics, Differential Geometry
pdf ↗ page arXiv:2611.16309 ↗

A normalized two-point function with several poles does not, on its own, fix the source-free thermal partition function. For the Gaussian measure of the original gluon field, a positive-residue rational propagator contributes determinants from its poles and from zeros interlaced between them. The zero factors distinguish this completion from a gas of independent pole fields and restore two ultraviolet polarizations per adjoint eigenvalue at every finite truncation. We apply the construction to a background-covariant completion of the elliptic Dyson-Schwinger gluon kernel. The first-order SU(3) transition is already present with a single pole, and the saturated six-pole result shifts $T_c/M_g$ by only $1.48\%$, where $T_c$ is the coexistence temperature and $M_g$ is the lowest pole mass. At six poles, the zero determinants raise $T_c/M_g$ by $2.31\%$ and lower $L/T_c^4$ by $12.4\%$, where $L$ is the latent heat and each prescription uses its own $T_c$. At fixed $M_g$ the dimensional latent heat decreases by $4.0\%$. The fixed-holonomy free-energy difference gives an ultraviolet test independent of the additive pressure normalization. At fixed pole number $P$, its asymptotic value agrees with the two-polarization Weiss result when the zeros are retained and is $(3P-1)/2$ times as large in the poles-only prescription.

comments
10 pages, 3 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.16392 ↗

Data-driven constitutive model discovery is recast as causal discovery of mechanism parent sets using time-unrolled structural causal models. Hard-coding balance laws and constitutive skeletons, candidate graphs score environment–mechanism and state–state edges via weak-form equilibrium gaps evaluated from full-field displacements, avoiding the need to measure stresses or internal variables. An adaptive lasso and a NOTEARS-type constraint ensure graph acyclicity and an explicit evaluation order, treating climate-chamber protocols as interventions. Automatic differentiation yields the score's Gauss–Newton matrix as a local identifiability certificate, driving greedy D-optimal test design. In a synthetic study on a hygro-thermo-viscoelastic damaging plate (8 true edges among 13 candidates), interventional data recover the exact true graph in 7 of 10 runs (0.01px displacement noise) with zero attribution error. Conversely, observational data with a temperature–moisture correlation of $-0.998$ fail entirely because confounded scores are 250–380 times flatter. Observationally discovered models reproduce training climates (3.6% error) but mispredict hot and humid climates by up to 41.5% (16.9% average), whereas interventionally discovered models stay within 3.2%. A correlation sweep shows the certificate successfully predicts attribution errors, though weak-form score noise bias remains a primary limitation. Computed without knowledge of the truth, the D-optimal design selects test sets ranked second or third out of 126 candidates.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.16468 ↗

We develop a first-principles framework for analyzing photonic quantum communication in an atomic medium. Starting from a real-space quantization of the electromagnetic field coupled to an ensemble of two-level atoms, we derive an effective model for polarization-encoded single-photon states. We apply this framework to superdense coding to study communication efficiency and to the BB84 quantum key distribution protocol for communication security. For superdense coding, we evaluate the protocol capacity of the fixed Bell-state alphabet under erasure, dephasing, and depolarizing channels and show that it decreases monotonically with increasing atom-field coupling. For BB84, we formulate a modified protocol that discards erasure outcomes and uses the microscopic model to estimate the intrinsic loss rate. We derive the corresponding asymptotic key rate and show that it decreases monotonically with coupling strength and vanishes beyond a finite critical coupling.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.16519 ↗

We study various families of non-periodic configurations of symbols assigned to vertices of regular graphs. We restrict ourselves to such systems where considered configurations support a uniquely ergodic measure. Symbols can be interpreted as particles and we are concerned with configurations which minimize the interaction energy of particles, the so-called ground-state configurations. One of the main questions then is whether ground-state configurations are stable with respect to small perturbations of interactions. Such stability may be interpreted as a sort of rigidity of non-periodic structures such as tilings, substitution systems, Sturmian systems, and other uniquely ergodic non-periodic systems. We introduce a property of bounded fluctuations of finite patterns of non-periodic configurations, the so-called Strict Boundary Property. We discuss how relevant this property is for stability of non-periodic structures. Examples of Robinson's tilings, Thue-Morse, and Sturmian systems are presented. Some open problems are formulated.

comments
To appear in Perspectives on Ergodic Theory and Its Interactions, In Honor of Vitaly Bergelson, Birkhauser Trends in Mathematics
fields
Mathematical Physics
pdf ↗ page arXiv:2611.16685 ↗

We develop a metriplectic framework for quantum–classical hybrid dynamics that ensures thermodynamic consistency through conservation of energy and non-negative entropy production. The approach combines a hybrid Poisson bracket with a metriplectic $4$-bracket, with coupling between quantum and classical subsystems arising solely through dissipative processes. Within this hybrid formulation, we produce thermodynamically consistent generalizations of the Lindblad master equations and the Bloch–Torrey equations for open quantum systems. This provides a unified description of quantum relaxation and classical diffusion, together with a clear interpretation of entropy production.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.16708 ↗

How well a superposition of nonorthogonal states, such as an optical cat state, serves as a resource depends on how its components interfere. Here we determine the optimal probability of converting one such superposition into another by superposition-free operations. These operations cannot make the components of a superposition interfere more destructively with certainty while keeping all of them, and this principle fixes the optimal probability for every source that is symmetric under permutations of its components. When the reference states are coherent states, as in a cat state, every operation that maps each of them to a coherent state, such as photon loss or photon subtraction, is superposition-free. For two reference states we solve the problem completely. Superpositions with coefficients of equal modulus, the counterparts of the maximally coherent states of coherence theory, are therefore inequivalent resources: an odd cat state becomes even with certainty by a normalized photon subtraction, whereas an even one becomes odd only with a probability that vanishes for small amplitudes, and the even and the Yurke$-$Stoler cat states cannot be converted into each other with certainty in either direction. Collective operations on several copies can do better than converting them one at a time, except in the distillation of coherence, which gains nothing from them. For three or more reference states with equal positive overlaps, no state reaches every other state with certainty; the equal-modulus superpositions that interfere most destructively still yield a maximally coherent state with certainty and reach every superposition of all reference states at least as well as such a state does, but in the worst case no better.

comments
21 pages, 3 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.16719 ↗

Machine learning coupled with device simulation is widely used to optimize thin-film solar cells, but almost exclusively in the forward direction, from device parameters to predicted performance. The inverse problem encountered after fabrication, namely identifying the mechanism that limits a given device, is still addressed by manual inspection of characterization data. In this work, both directions are examined for lead-free $RbSn_{0.5}Ge_{0.5}I_{3}$ solar cells using approximately 42,000 SCAPS-1D simulations. Replacing the Spiro-OMeTAD hole transport layer with CuI increases the simulated power conversion efficiency from 19.6\% to 21.6\%, almost entirely through the fill factor. Surrogate models trained and tested on a factorial parameter grid substantially overstate their predictive accuracy. An XGBoost regressor attains $R^2 = 0.9997$ on held-out grid points but only 0.58 on independently sampled devices, whereas training on a Latin hypercube design of comparable size restores $R^2 = 0.995$. For the inverse problem, a multi-label classifier identifies which of six degradation mechanisms are present from simulated temperature- and illumination-dependent open-circuit-voltage measurements. It achieves a macro $F_1$ score of 0.938, compared to 0.687 for a calibrated physics-rule baseline. The classifier does not, however, generalize to combinations of mechanisms absent from the training set.

comments
Under review in RSC Advances
fields
Mathematical Physics
pdf ↗ page arXiv:2611.16750 ↗

Norton's dome illustrates how a Newtonian initial-value problem can admit both rest and delayed departure from the same initial state. We examine how this nonuniqueness changes when the point particle is replaced by a rigid sphere of positive radius. For a generalized family of Norton's domes, we show that any fixed positive sphere radius prevents spontaneous departure from rest at the apex. We then extend the analysis to more general bodies and establish two sufficient conditions: a geometric constraint on the distance between the center of mass and the apex, and an interior tangent ball condition for rigid bodies whose center of mass is vertically aligned with the initial contact point. Both arguments combine geometric estimates with an energy inequality and Grönwall's inequality. The first condition also applies to passive deformable bodies without releasable internal energy. These results identify explicit conditions under which finite-body geometry excludes the spontaneous motion allowed by Norton's point-particle model.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.16797 ↗

In this work, we study the edge states localized at a spherical interface between two $3\mathrm{D}$-topological insulators from a continuous model of the semiclassical Dirac equation. Using the dynamical and spectral properties of the semiclassical Dirac operator tangent to the interface and the Landau level stratification of the energy in the transverse variable, we describe several concentration and invariance properties of the semiclassical measures associated with quasimodes of the system localized at the interface. Moreover, we construct explicit quasimodes which fulfill some of these properties and concentrate on some particular single periodic geodesics of the sphere.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.16809 ↗

We investigate inducing data for three dimensional asymptotically flat BMS gravity on hyperbolic Virasoro orbits with winding, which contain no constant supermomentum, and the restriction of formal smooth equivariant sections to global Lorentz orbits. Using the developing map of the associated Hill operator we rederive their stabilizer and show that, in the spin double cover, it is the direct product of a line with a cyclic group of even order. The character of the cyclic factor is therefore a discrete inducing label independent of the continuous one, unlike for the massive BMS particles, where it is fixed by the spin. At points with the corresponding finite rotational symmetry, restriction of formal smooth equivariant sections to a global Lorentz orbit yields the finite cyclic equivariance condition, while an independently defined unitary global branch realizes the associated finite difference equation. At points with timelike projected momentum we derive the resulting ladder of Poincare helicities, show that the projected rest energy is not an orbit invariant, construct locally flat winding BMS geometries with hyperbolic Lorentz holonomy, prove that the smooth real periodic near horizon current model excludes these winding orbits, and obtain selection rules and closed form expressions for finite monodromy resolved orbital functionals. A unitary realization on the full infinite dimensional orbit is not constructed, and the interpretation of the cyclic sectors in quantum gravity remains conjectural.

comments
50 pages 1 Figure
fields
Mathematical Physics
pdf ↗ page arXiv:2611.16823 ↗

We show that the domain of outer communications of a smooth, asymptotically flat, stationary vacuum spacetime describing a single rotating non-degenerate black hole is isometric to the domain of outer communications of a subextremal Kerr solution under reasonable geometric and physical assumptions, without analyticity or any smallness assumptions. The method is to apply Harrison transform to construct a family of solutions of Einstein–Maxwell equations. Combining null area comparison with the area-charge inequality, we show that, in the limiting transformed geometry, the bifurcate sphere has area radius one and constant electric and magnetic flux densities, with the original ADM mass normalized to $M=1$. These identities imply the technical assumptions of Ionescu–Klainerman, yielding the identification with Kerr.

comments
31 pages
fields
Mathematical Physics, Analysis of PDEs, Differential Geometry
pdf ↗ page arXiv:2611.16853 ↗

The question of local encodability asks: can a given, multipartite pure quantum state be completed to an orthonormal basis using only local unitary rotations? If any such state in a given system has this property, it is called universally locally encodable (ULE), a feature, which has applications in quantum information theory, engineering and math. Despite its easy formulation, the answer to this question depends nontrivially on the local dimensions of the system: While universal local encodability is known for $2\times 2$, $4\times 4$ and $8\times 8$-dimensional systems, it was so-far only conjectured to hold in $3\times 3$, and non-ULE was recently proved for systems of four and more qubits by Pauwels and Gühne. We resolve the open conjecture by proving universality for two qutrits. Furthermore, we construct (among others) universal local encodings in dimensions $d\times2$ for $d\ge2$, in dimensions $d\times3$ for $d=3,4$ and $d\ge6$, and in every bipartite system with one or two infinite-dimensional subsystems. For finite-dimensional multipartite systems, we turn a heuristic parameter count into a necessary condition for universality, which excludes universal local encodability in infinitely many cases. Finally, we give universal local encodability an operational interpretation by showing that non-ULE is equivalent to whether general measurements yield an advantage over projectively simulable ones in discrimination tasks where unknown, random local unitary rotations have to be detected.

comments
9 + 18 pages, 2 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.16921 ↗

We obtain infinite spin representations of the super-Poincaré algebra from a higher-derivative superparticle action on a super-Minkowski background in 3, 4, 6 and 10 dimensions. Super-twistor transforms are performed, and used to deduce first-quantised spectra.

comments
27 pages, 2 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.17006 ↗

Following Bach, Lieb and Solovej, quadratic Hamiltonians can be defined as generators of unitary groups implementing one-parameter groups of Bogoliubov transformations. We develop an analogous dynamical definition of generalized spin–boson Hamiltonians. For a single spin level, we review results of Guichardet and Dereziński: the van Hove Hamiltonians, including the renormalized ones, are exactly the generators of affine Bogoliubov dynamics that do not mix creation and annihilation operators. For several spin levels, there is no analogue of this group, and we introduce spin-dressed implementations, that is to say the free flow of the fields is implemented up to bounded operator-valued displacements, which vanish at a rate measured by a so-called regularity scale and have a spin observable, the coupling map, as derivative at time zero. The one-particle Hamiltonian $Υ$ and the coupling map are determined by the Hamiltonian, and the field obeys a quantum Langevin equation. Spin-dressed implementations in Fock space, at the finest scale and for form factors in $D(Υ^{-1/2})$, are exactly the generalized spin–boson Hamiltonians, unique up to the spin Hamiltonian. At the roughest scale, the renormalized spin–boson Hamiltonian of a two-level system with ultraviolet-singular form factor and arbitrary tunnelling is a spin-dressed implementation, and the definition alone yields asymptotic Weyl operators on the test functions along which the coupling map is integrable, a dense set under standard assumptions.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.17025 ↗

For modelling dissipative phenomena such as friction, diffusion and viscosity, the Hamiltonian framework has a key limitation: once the Casimir invariants are fixed, Hamiltonian flows preserve phase-space volume, which rules out relaxation to equilibrium. Thus modelling dissipation requires modifying the Hamiltonian structure. Following the metriplectic (equivalently, GENERIC) approach, we add to the Hamiltonian vector field a dissipative term generated by a symmetric bracket, here constructed from a Riemannian metric. The resulting flow conserves the energy, and optionally further invariants, while driving a chosen generalised entropy monotonically, which makes the dynamics irreversible; when the entropy is bounded on energy level sets in the direction in which it is driven, it acts as a Lyapunov functional. We apply this construction to ideal fluids on compact Riemannian manifolds, choosing Casimirs of the Lie-Poisson bracket as entropies. In two dimensions, dissipating enstrophy yields the already-known energy-constrained Navier-Stokes equations, which include a nonlocal term restoring energy balance. In three dimensions, where enstrophy is no longer a Casimir, we derive new irreversible models. For incompressible and compressible fluids carrying an advected scalar, dissipating potential enstrophy or higher potential-vorticity moments gives a nonlinear, anisotropic diffusion that acts to align the gradients of the scalar and of the potential vorticity. For a purely incompressible fluid, taking helicity as the entropy gives a first-order, non-smoothing dissipative term whose stationary states are Beltrami fields.

comments
32 pages, no figures, first version. All comments are welcome!
fields
Mathematical Physics, Dynamical Systems
pdf ↗ page arXiv:2611.17049 ↗

We study quantum Hamiltonians whose separated angular component is expressed through a generic Painlevé VI transcendent. We construct generalized ladder operators for one-dimensional Schrödinger operators with a quadratic spectral variable. For the Painlevé VI angular Hamiltonian these operators satisfy $[N,J_\pm]=\pm2kJ_\pm$, where $N=\sqrt M$, and close through an eighth-degree norm polynomial. Combining the angular shifts with the radial shift operators of the oscillator, Coulomb and free Bessel systems yields higher-order integrals and deformed Racah-type polynomial algebras for the two-dimensional superintegrable models. This construction provides new families of Tremblay-Turbiner-Winternitz (TTW)- and Post-Winternitz (PW)-like Hamiltonians with integrals of arbitrarily high order and Painlevé VI in the potential. This framework also recovers models from the classification of third- and fourth-order integrals as particular cases. For a representative oscillator extension we compute the Casimir explicitly and recover the finite-dimensional energy spectrum from a deformed-oscillator realization. We then analyze the special-solution sector using the explicit families collected by Gromak, Laine and Shimomura. The resulting potentials are organized into a small number of spectral classes, and the distinction between formal zeros of the ladder norm and physical self-adjoint representations is made explicit. The regular nonclassical rational examples are rational Darboux deformations of the trigonometric Pöschl–Teller system and lead to strictly isospectral exceptional-Jacobi sectors or to state-adding representations with an isolated angular level. A singular branch produces an interior inverse-square barrier and a split-domain problem. For one regular exceptional sector and two state-adding sectors we display the polynomial algebras.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.17117 ↗

Quantum scattering is a fundamental probe of the scattering region and the quantum dynamics of outgoing particles. In two terminals, the statistics of non-interacting fermions is described by a generalized binomial distribution, that arises from the Pauli exclusion principle, while deviations are a signature of interactions. In this work, we extend this result to a scattering region coupled to three outgoing terminals (or channels), obtaining exact bounds for the statistics of the outgoing fermions. In particular, for two fermions and three terminals, four inequalities involving six measured probabilities determine whether a non-interacting scatterer can explain the observed statistics. Applying these inequalities to recent scattering experiments in cold atoms, we are able to identify a regime where interactions have a significant contribution on the outgoing particles. Therefore, our work opens up the possibility of identifying fermion interactions at the nanoscale in systems that range from mesoscopic conductors to optical traps in cold atoms.

comments
5 pages of main text, 2 figures. Supplementary information and code are available in the GitHub repository cited as Ref. [84] in the manuscript
fields
Mathematical Physics
pdf ↗ page arXiv:2611.17122 ↗

A foundational principle of physics is that all coordinate systems are equally valid: the behavior of a PDE-governed system does not depend on the origin or orientation of the frame, nor on the units or mesh used to write it down, and neither should a surrogate model. Yet the neural surrogates with the lowest errors on today's aerodynamics benchmarks lack these invariances and fail under simple transformations of the same problem: for models trained on PDEs of cars in one pose (i.e., translation and rotation) and from one mesher, rotating the full PDE raises the surface-pressure error from 4% to more than 100%, and re-sampling its boundary raises it to about 30%. We introduce ISLA (Invariant Slice Attention), a slice-attention transformer for steady, boundary-driven PDEs in which no learned operation receives a coordinate and every sum over the boundary is a quadrature. Positions enter only as distances and relative angles to learned slice anchors, lengths are measured in a unit computed from the boundary, and interior points query the boundary through a tree-accelerated learned kernel without influencing one another. With every boundary cell a token and an exact boundary read, ISLA is equivariant to rigid motions and reflections, invariant to the units of its declared data, and consistent under mesh refinement, while at every setting each query is independent of all other queries. On AeroZoo, 2,816 flows that vary in shape, size, speed, and boundary conditions, its mean reference-scaled velocity and pressure errors are at least 3.1 and 3.3 times lower than any baseline's. On AirfRANS its errors are second only to those of a boundary-integral model (GLOBE) and at least 1.6 times lower than those of Transolver and GeoTransolver.

comments
48 pages, 14 figures, 26 tables. Companion paper to "AeroZoo: A Benchmark of Well-Posed Flow Problems for Foundation Models of Aerodynamics" (Sharpe et al., 2026)
fields
Mathematical Physics
pdf ↗ page arXiv:2611.17141 ↗

The two-dimensional one-component plasma is a system of point charges that repel each other logarithmically, in a uniform neutralizing background. When the inverse temperature $β$ is at most $2$, we prove that its correlations decay exponentially, and that its Gibbs state is unique among point processes whose fluctuations are controlled. This constitutes part of the fluid phase predicted by physicists. As a consequence, we obtain the existence of an infinite-volume limit, extending the Ginibre point process, which we call $\mathrm{Gin}_β$. We show that its truncated two-point function, at the scale of the Debye length, is given to first order in $β$ by the Debye-Hückel approximation.

comments
79 pages
fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2611.17174 ↗

Motivated by the conjectural relationship between the IKKT matrix model and type IIB string theory, we classify supersymmetric twists of the matrix model, allowing for both dynamical and kinematical supercharges. Beyond the two twists available at any finite $N$, which we studied in our previous work, we find five additional classes at infinite rank which require non-commuting backgrounds associated with D-branes in IIB supergravity. Together, these twists realize representatives of every equivalence class of twisting supercharges in flat-space type IIB supergravity recently classified by the first author; however, the precise form of the orbit stratification differs. This difference is related to a higher central extension of the IIB superalgebra that appears in our treatment of the IKKT model in the BV formalism. Expanding around the non-commutative backgrounds gives worldvolume theories on products of A- and B-branes, including four-dimensional BF theory on an emergent D3-brane. We relate all these twists to deformations of BCOV theory (the closed string field theory of the topological B-model) using the open-closed duality of classical string field theory. For one of the twists with Spin$(7)$ symmetry, we also show the localization of the IKKT partition function by Moore, Nekrasov, and Shatashvili can be directly reconstructed with the BV formalism, with their auxiliary field completion encoded by quadratic antifield terms. Throughout, we provide self-contained treatments of the formal techniques we employ.

comments
51 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.17270 ↗

Multiparameter pure-state metrology is limited by the incompatibility of measurements optimized for different parameters. We characterize uniform sensitivity by the Fisher floor, the smallest fraction of the quantum Fisher information (QFI) retained over all pure states and parameter directions. We prove that a constant number of fixed orthonormal bases suffices for a nearly optimal Fisher floor, independently of the Hilbert-space dimension $d$. With high probability, five independent Haar bases already achieve a positive, dimension-independent floor, and larger constant families achieve approximate universal Fisher symmetry: they retain nearly one half of the QFI in every direction, the largest uniform fraction permitted by measurement incompatibility. The required number of bases is optimal up to a logarithmic factor in inverse accuracy. In contrast, $d+1$ mutually unbiased bases, when they exist, can minimize mean Fisher anisotropy among families of $d+1$ bases yet have a Fisher floor of at most $1/(d+1)$, showing that optimal average balance does not ensure uniform sensitivity.

comments
8+27 pages, 2 figures, and 1+2 tables; comments and suggestions are very welcome! see also "Sharp Uniform Fisher Information Bounds from Projective Designs"
fields
Mathematical Physics
pdf ↗ page arXiv:2611.17281 ↗

We investigate multiparameter quantum metrology and the energetic properties of an effective electron–proton spin system inspired by the hyperfine structure of the hydrogen atom. Considering the external magnetic field $\mathcal B$ and the hyperfine coupling strength $Λ$ as unknown parameters, we derive the quantum Fisher information matrix and establish the corresponding quantum Cramér–Rao bounds for their simultaneous estimation. We analyze the estimation precision and the correlations between the two parameters, showing that the weak-commutativity condition is satisfied despite the noncommutativity of the associated symmetric logarithmic derivatives. Independently, we explore the energetic properties of the system under a unitary charging protocol, characterizing its ergotropy, anti-ergotropy, storage capacity, and energy-basis coherence. We investigate the dependence of these quantities on the magnetic field, hyperfine coupling, temperature, and charging time. Our results provide a comprehensive characterization of the metrological properties and energetic performance of a hyperfine spin-based quantum system, highlighting its potential as a platform for quantum sensing and energy storage.

comments
14 pages, 8 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.17310 ↗

Numerical Analysis51

Sparse-angle X-ray computed tomography (CT) presents a challenge for reliable inference, as limited measurements may leave object boundaries unresolved. Bayesian optimal experimental design (BOED) methods select informative measurements, but can be computationally expensive or require data-driven surrogates and do not explicitly exploit microlocal visibility. We address this limitation by focusing on estimating inclusion boundaries rather than the entire attenuation field. For piecewise-constant objects, these boundaries correspond to singularities characterized by their wavefront sets. Microlocal analysis determines the X-ray view-angles at which these singularities are visible. We combine this information with Bayesian uncertainty quantification to introduce B-MUSE, a microlocal uncertainty-driven sequential experimental design method. We define a microlocal C-optimality criterion associated with the wavefront direction of the most uncertain boundary singularity and prove that its optimal solution satisfies the microlocal visibility condition. B-MUSE uses this result to sequentially select informative view-angles according to boundary uncertainty. It also incorporates an adaptive stopping criterion that terminates acquisition when additional measurements provide no meaningful uncertainty reduction. We evaluate B-MUSE through numerical experiments, including interpretable examples, prior-generated inclusions, and a multi-inclusion example from an external dataset, and benchmark it against recent methods. The results show that B-MUSE substantially reduces posterior uncertainty with few adaptively selected measurements while providing boundary estimates. These findings establish a direct connection between BOED and microlocal visibility and demonstrate the potential of uncertainty-driven acquisition to reduce measurement requirements for goal-oriented X-ray CT without training data.

fields
Numerical Analysis, Probability
pdf ↗ page arXiv:2611.14528 ↗

A new approach to discretise and solve Richards equation based on the finite element method (FEM) is presented. The novelty of the approach, called the Neural Physics method, is that it expresses the discretisation as a convolution neural network (CNN) whose weights are predetermined by the integrals of the basis functions in the FEM. The Neural Physics method is physically consistent as it represents a discretisation of the governing equation and can run on CPUs, GPUs and the latest AI accelerators, resulting in an increase in computational speed. The Neural Physics method is demonstrated for two different discretisations of Richards equation, including a multigrid method that is realised through a U-Net architecture. The accuracy and speed of these methods is tested on a problem with a known analytical solution and compared to a standard FEM, and shows that the Neural Physics method is almost an order of magnitude faster than a comparable FEM. Finally, the Neural Physics method is applied to a real-world test case with integrated experimental data and simulates the infiltration of water through a rain garden. This new approach therefore provides a route to efficiently and accurately solve Richards equation for a wide array of hydrological applications.

comments
36 pages (including appendix), 7 figures, 3 tables
fields
Numerical Analysis
pdf ↗ page arXiv:2611.14562 ↗

Let $\mathcal{S}(X)$ be the principal shift invariant space generated by a box spline $B_X$ with $d$-dimensional direction set $X$ and associated differential operator $D_X$. Assuming that each direction in $X$ appears with even multiplicity i.e $X = [X_0|X_0]$, we may endow $\mathcal{S}(X)$ with a special inner product $\langle \cdot , \cdot \rangle_X$ which is similar to a homogeneous Sobolev-like inner product of order $|X_0|$. Then, for the special case when the directions in $X$ are selected from a root system, we introduce bi-orthogonal systems for $\mathcal{S}(X)$. Within any fixed bi-orthogonal system, each basis function is compactly supported albeit the diameter of the supports of the basis functions is not uniformly bounded. On the other hand, the image of any bi-orthogonal system under $D_X$ (which is necessarily finite and discrete) is uniformly finite. In other words, the basis elements, while having non-sparse box-spline representation, are uniformly sparse in their truncated-power representation. Using the Sobolev-like inner product and an aforementioned biorthogonal system for $\mathcal{S}(X)$, the analysis-synthesis operator from smooth compactly supported continuous functions into $\mathcal{S}(X)$ is well-defined. Using integration by parts and the orthogonality satisfied by the bases under $\langle \cdot , \cdot \rangle_X$, this operator is a local discrete quasi-interpolation operator. When $X$ comes from an irreducible root system, we can slightly modify these quasi-interpolants to ensure they have optimal approximation order. In other words, if $f$ is sufficiently smooth and compactly supported, we can optimally approximate $f$ from a collection of generalized derivative samples induced by one of our bases.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.14764 ↗

Standard algorithms of numerical linear algebra use their scalars through seven operations: addition, subtraction, multiplication, division, the adjoint, the $*$-square root and $(i,j)$ indexing. This thesis overloads these operations, as automatic differentiation overloads arithmetic, allowing scalars in associative algebras with involution. Many of the resulting decompositions and algorithms reduce to Hermitian eigendecomposition over these $*$-algebras. The decompositions are organised by doubly-signed quivers, whose vertices record real, complex or quaternionic scalars and the action of the involution. We prove an analogue of Gabriel's theorem: every finite-dimensional real $*$-algebra is a matrix algebra, with sizes and signs, over a quotient of its quiver's path $*$-algebra. Spectral theorems, the singular value decomposition, Takagi factorisation, Sylvester's law of inertia and the real Jordan form arise as unitary similarity problems for Hermitian matrices. Division and square roots take place in a completed localisation which inverts the arrows. For the singular value decomposition, Householder tridiagonalisation becomes Golub–Kahan bidiagonalisation. Over split-complex numbers, the QR algorithm becomes Rutishauser's LR algorithm, two steps at a time, and Cholesky factorisation becomes Doolittle's LU factorisation. These identifications require suitable $*$-square roots and hold whenever the steps are defined. Infinitesimals make limits of algorithms exact computations: Gram–Schmidt yields the Bruhat decomposition, and Gaussian elimination with pivots chosen by orders of magnitude yields Dijkstra's shortest-path algorithm in leading terms. A Python library implements the seven operations and algorithms. An appendix visualises the QR algorithm on $2\times2$ real matrices.

comments
PhD thesis, Imperial College London. 281 pages. Submitted September 2025; revised following examination October 2026
fields
Numerical Analysis, Rings and Algebras, Representation Theory
pdf ↗ page arXiv:2611.14831 ↗

The Poisson Nernst Planck (PNP) equation is widely used to simulate ion channel transport, but its strong nonlinearity and coupling characteristics make numerical solutions extremely challenging, and decoupling methods are usually required. The Gummel iteration method is widely adopted as a common decoupling algorithm owing to its simplicity, ease of implementation, and applicability even under complex conditions. But its convergence efficiency highly depends on the selection of the relaxation parameter, unsuitable parameters will lead to slow convergence or even divergence. At present, parameter selection relies heavily on manual experience, which is inefficient and unstable, significantly hindering the solving efficiency for practical problems such as ion channel simulations. To address this, we propose a machine learning-based parameter selection method, which can select near-optimal relaxation parameters for the Gummel iteration of PNP equations for ion channels. Based on the machine learning-based parameter selection algorithm, we develop a coupled finite element and Gummel iteration solver, and more stable convergence and higher computational efficiency have been achieved in ion channel simulations. To validate the method, we conduct tests on two real channels with complex geometries that differ significantly from the training samples. Numerical results demonstrate that this method has a significant effect on improving the convergence efficiency and stability of Gummel iteration, confirming its applicability in practical ion channel simulations.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.14866 ↗

We propose a random feature policy iteration method for reconstructing the obstacle function in a mean-field game (MFG) from observations of its value function, leveraging the method's mesh-free nature and flexibility to handle complex geometries and high-dimensional problems. The method builds on a policy iteration framework for inverse MFGs, which decouples the coupled nonlinear forward-backward PDE system into a sequence of linear PDE and inverse problem solves. The fixed random feature representations preserve this linear structure, allowing the resulting subproblems to be solved by minimizing residuals at sampled collocation points through linear least-squares problems. The mesh-free nature of the method further extends the applicability of the policy iteration framework to inverse MFGs with complex geometry and in high dimensions. Another key advantage is its flexibility in using different spatial approximations for different variables: the obstacle function, value function, and population density can be represented in separate feature spaces, accommodating obstacles that are substantially less regular than the corresponding PDE solutions. Moreover, boundary conditions can be enforced through collocation on irregular domains without constructing boundary-fitted meshes. Numerical experiments involving smooth and discontinuous obstacles, a domain with holes, and higher-dimensional problems demonstrate the accuracy and flexibility of the proposed method.

comments
20 pages, 7 figures
fields
Numerical Analysis, Optimization and Control
pdf ↗ page arXiv:2611.14883 ↗

The Boltzmann transport equation describes particle transport across collisional regimes, but resolving its velocity dependence is expensive. Moment methods reduce this cost by evolving finitely many velocity moments, requiring a closure for unresolved higher-order moments. Data-driven closures can represent these moments accurately, yet without structural constraints they may produce complex characteristic speeds and unstable simulations. Learned Boltzmann closures with guaranteed hyperbolicity have so far been formulated in one spatial dimension; in multiple dimensions, hyperbolicity must hold in every direction simultaneously. We develop, to the best of our knowledge, the first data-driven closure for multidimensional Hermite moment systems of the linear Boltzmann equation that is hyperbolic by construction. The network learns a symmetric positive-definite symmetrizer shared by all spatial directions and restricted to a subspace that preserves the known lower-order transport equations; the unresolved rows follow from a symmetric completion. Every directional Jacobian thus has real eigenvalues and a complete set of eigenvectors for every network output and at any truncation order. The closure is trained only on spatial derivatives of unresolved moments from kinetic reference solutions, with no solver in the training loop, and evolved by a partially conservative discontinuous Galerkin method. In two-dimensional experiments in the transition and scattering-dominated regimes, a single learned third-order system with ten moments remains stable in all cases. Averaged over time, it is more accurate than the classical P7 and P15 truncations with 36 and 136 moments in every experiment, and its density error is about two orders of magnitude smaller than that of the P3 truncation with the same moments.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.14894 ↗

Entropy-stable discontinuous Galerkin schemes are known for their robustness. These schemes satisfy a semi-discrete entropy inequality, mimicking the entropy inequality of the continuous governing equations. Entropy-stable viscous discretizations with entropy-stable wall boundary conditions have been used in the literature, using a scheme similar to BR1. On the other hand, viscous discretizations with compact stencil, such as BR2 and CDG schemes, are more efficient for computation and for forming the Jacobian. Moreover, it is known that the weight-adjusted formulations have better efficiency with regard to the computational and storage costs. To that end, we derive the weight-adjusted entropy-stable BR2 and CDG schemes with modifications for the numerical flux at the boundary to account for the entropy-stable boundary conditions.

comments
24 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2611.14994 ↗

We construct and analyze multiple-relaxation-time vectorial lattice Boltzmann schemes for the incompressible Navier-Stokes equations in two and three space dimensions. The same moment-space relaxation matrix is applied to all physical components, with independent rates for the flux, stress, and energy moments. A Maxwell expansion organized by moment parity establishes formal second-order consistency of the unforced interior schemes under diffusive scaling, assuming a smooth near-equilibrium Maxwell branch. The viscosity depends only on the flux rate; for the two-dimensional scheme, we identify the first contributions of the stress and energy rates to the second-order macroscopic truncation error. We further construct a positive definite symmetrizer for the collision Jacobian at rest and derive an exact weighted-norm identity for the nonlinear kinetic residual under local collision. At fixed viscosity, a finite Fourier search selects the free rates by combining transverse-mode accuracy with short-wavelength damping. The resulting rates are compared with those calibrated against flow errors on a coarse grid. Numerical experiments exhibit second-order convergence and illustrate how the free rates affect spectral properties and finite-time flow errors.

comments
46 pages, 5 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.15033 ↗

We develop a monotone meshfree–particle method for mean field games (MFGs). We discretize the backward Hamilton–Jacobi–Bellman (HJB) equation on a fixed scattered cloud, transport the forward Fokker–Planck law with reflected and killed particles, and close the fictitious-play loop by interpolation and mass-preserving kernel density estimation. Monotonicity is imposed row by row on two-dimensional clouds. Each row combines a positive generalized finite difference Laplacian with a nonnegative decomposition of the drift along rays to surrounding visible neighbors, with mirror images at reflecting walls, and every fixed-policy matrix is an M-matrix for arbitrary cell-Péclet number. We prove a discrete comparison principle and, on polygons with re-entrant corners included, that one HJB solve at a prescribed density converges to the viscosity solution off the boundary vertices, for convex Hamiltonians of at most quadratic growth under a structure condition. On a two-room floor plan with re-entrant door jambs, the computed HJB solutions converge to exact ones. A source-free exact MFG tests the fully coupled computation. At matched degrees of freedom on a grid domain, the meshfree HJB solve has a larger $L^2$ error and a smaller $L^\infty$ error than a five-point finite-difference solve, and is about twice as expensive including the stencil construction. On a non-convex evacuation game, the interior nodes of nine clouds receive monotone rows, apart from a few next to the boundary vertices that copy a neighbor.

comments
36 pages
fields
Numerical Analysis, Optimization and Control
pdf ↗ page arXiv:2611.15132 ↗

We develop robust high-order basis-update and Galerkin (BUG) integrators for dynamical low-rank approximation without basis augmentation or rank truncation. The basis and core updates use the same approximate increment. We establish a two-sided relaxed-exactness estimate that controls the error in the low-rank approximation by the increment error. Under the stated assumptions on the vector field and its normal component, sufficiently accurate increments yield local and global error bounds whose constants and step-size restrictions are independent of small singular values. Using explicit Runge–Kutta increments, we obtain robust orders two, three, and four for the explicit midpoint method, Heun's third-order method, and Merson's fourth-order method, respectively. Every internal stage and final approximation has rank at most the prescribed rank $r$. We also prove that these orders are retained under arbitrary basis augmentation followed by best rank-$r$ SVD truncation at the internal stages and the endpoint, without a separate assumption on the truncation error. Numerical experiments confirm the convergence orders and show comparable performance with and without augmentation.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.15175 ↗

Age-of-infection models, formulated as integro-differential equations (IDEs), provide elegant mathematical descriptions for the spread of infectious diseases. In contrast to ordinary differential equation (ODE)-based models, IDE-based models can accommodate general distributions of transition times between disease stages. Yet, the accurate numerical assessment of the solution of IDE models remains challenging. Here, we extend a recently proposed fixed-point method based on Gregory quadrature. We generalize the formulation to time-dependent contact rates whose changes at discrete time points are represented by continuously differentiable sigmoidal interpolants, and suggest additional finite difference approximations to obtain higher-order schemes for susceptible, infected and recovered subpopulations. The resulting numerical schemes achieve convergence orders of two, three and four for all three subpopulations, enabling accurate and flexible simulations of IDE-based epidemic models with general sojourn time distributions and changing contact patterns.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.15251 ↗

In this work, we develop and analyze a macroscopic multicontinuum model for Biot poroelasticity. The full macroscopic multicontinuum system is derived by projecting the microscopic weak formulation onto continuum-dependent Galerkin spaces enriched with first-order multiscale corrections. This construction retains generalized pressure storage and coupling terms, with effective coefficients inherited from the microscopic bilinear forms. Under suitable coefficient assumptions, we establish well-posedness and energy stability of the macroscopic multicontinuum model. A fully discrete scheme combining the Galerkin finite element method in space with the backward Euler method in time is then developed. Its well-posedness and stability are proved, and a priori error estimates are derived using appropriate projection operators and energy arguments. Finally, numerical experiments for periodic and non-periodic high-contrast media demonstrate the accuracy of the multicontinuum model with respect to the averaged fine-scale solution.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.15275 ↗

In this paper, we aim to develop a linearized, energy-stable, second-order-in-time parametric finite element method without Lagrange multipliers for surface evolution equations on surfaces with or without boundaries, including (volume-preserving) mean curvature flow and surface diffusion. We first reformulate the original equations into a new unified form in which the tangential motion is determined by requiring the flow map to be conformal. Based on this new formulation, we present a family of parametric finite element schemes that employ a linearized Euler or Crank-Nicolson discretization in time. We prove the existence and uniqueness of the resulting linear system, as well as the energy stability of the schemes. Our discrete methods can be applied to general surfaces although the second-order scheme may degenerate to first-order accuracy in certain cases. Numerical results verify the robustness of our method and demonstrate its ability to preserve mesh quality.

comments
25 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2611.15323 ↗

We consider the Cauchy problem for a second-order evolutionary equation with an integral term containing the convolution of a memory kernel with the second derivative of the solution. The kernel is specified by a finite sum of damped sinusoidal functions with positive damping coefficients, amplitudes, and frequencies. A transformation of the original nonlocal problem into an equivalent local system of coupled second-order differential equations with additional variables is proposed. For the local system, an energy identity with a dissipative term is constructed and a priori estimates of the solution are obtained. On the basis of the local formulation, a three-level difference scheme with a weight parameter is considered. The decrease of the discrete energy under standard constraints on the weight parameter is proved, which ensures unconditional stability of the scheme in the corresponding energy norm. The theoretical consideration is supplemented by the results of numerical solution of a problem with memory for a one-dimensional wave equation.

comments
15 pages, 6 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.15337 ↗

Strong, or pathwise, simulation of stochastic differential equations (SDEs) requires linking a generated SDE path to the corresponding realization of its driving Wiener process. In this work, we develop Wiener-path-based simulation procedures for multidimensional linear and semi-linear SDEs with additive noise that preserve this connection. Building upon a known Wiener-path-based exact simulation approach for linear SDEs, we extend this construction to generate coherent paths simultaneously on different time grids. We further propose an alternative exact simulation procedure that requires fewer random numbers and therefore provides a more efficient construction, while retaining a controlled approximation of the coupling between the SDE path and its associated Wiener path. The proposed methods are illustrated on a stochastic harmonic oscillator, a well-known model from classical mechanics, with the simulation results confirming the theoretical findings. We then extend the Wiener-path-based construction to semi-linear SDEs, which arise in many real-world applications. In contrast to linear SDEs, their solutions are generally not available in closed form, making numerical approximation methods necessary. For Euler–Maruyama-type methods, the relation between a given Wiener path and the corresponding approximate SDE path is explicit, whereas constructing Wiener-path-based simulations using structure-preserving splitting methods is less immediate. We address this challenge by incorporating the aforementioned Wiener-path-based constructions into splitting methods. Illustrations on the stochastic FitzHugh–Nagumo model and the stochastic Jansen–Rit neural mass model, two important models from neuroscience, demonstrate the applicability of the proposed procedures to non-linear stochastic systems.

comments
37 pages, 11 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.15419 ↗

We consider a linear-quadratic elliptic optimal control problem in three dimensions with a box-constrained control supported on a compact embedded $C^{1,1}$ curve strictly contained in a bounded convex polyhedral domain. The right-hand side of the state equation is a measure supported on the curve, and the state is singular along it. We establish well-posedness and first-order optimality conditions and derive curve-adapted weighted inequalities and finite element error estimates for the singular state. For continuous piecewise linear finite elements on quasi-uniform tetrahedral meshes and variational discretization of the control, assuming exact integration over the curve, we prove the almost quadratic estimate $\|\bar q-\bar q_h\|_{L^2(γ)}\le Ch^2(1+\abs{\ln h})^3$. The proof of this estimate requires new results, which are of independent interest. The convergence rate observed in a numerical experiment is consistent with the predicted algebraic order.

fields
Numerical Analysis, Optimization and Control
pdf ↗ page arXiv:2611.15474 ↗

We investigate the well-posedness and finite element approximation of a three-field formulation of the time-harmonic Biot model, motivated by frequency-domain magnetic resonance elastography. The underlying complex-valued mixed variational problem is noncoercive because of the inertial elasticity term and the coupled three-field structure. Continuous well-posedness is established under a non-resonance condition by decomposing the variational operator into an invertible principal part and a compact perturbation and applying the Fredholm alternative. We then develop stabilized equal-order finite element methods based on momentum-residual stabilization and local projection stabilization of the pore pressure. For the discrete problem, we establish mesh-uniform stability and well-posedness on sufficiently fine meshes via an a priori stability estimate and a Schatz-type compactness argument, without invoking discrete $T$-coercivity. Optimal-order a priori error estimates are derived in the natural energy norm. We also develop systematic selection principles for the stabilization parameters. Numerical experiments confirm the predicted convergence rates and demonstrate stable approximations for heterogeneous low-permeability media and anatomically realistic brain geometries relevant to magnetic resonance elastography.

comments
It has been submitted to CMAME
fields
Numerical Analysis, Functional Analysis
pdf ↗ page arXiv:2611.15495 ↗

Hierarchical models are central to applied Bayesian statistics, yet the variance structures they depend on can produce posterior geometries that remain difficult to explore even with Hamiltonian Monte Carlo (HMC), a designation now covering a large and increasingly heterogeneous family of algorithms. This survey uses Generalized HMC as an organizing framework to describe the many variants of HMC, their methodological and computational properties, and their empirical consequences. Varying the trajectory length, the degree of momentum refreshment, and the presence of a Metropolis correction recovers several familiar Hamiltonian and Langevin samplers as special cases. Three further, largely independent directions account for much of the remaining literature: modifying the metric, as in Riemannian HMC; modifying the Hamiltonian used by the acceptance test, as in modified or shadow HMC; and modifying the numerical integrator, as in multi-stage splitting schemes. We review these variants alongside the procedures used to tune and diagnose them, with particular attention to the effective sample size, whose standard estimators assume a reversibility that generalized and modified samplers lack, and ignore the importance weights that modified Hamiltonians introduce. We close with the open problems these methods face for hierarchical models, taking joint longitudinal and time-to-event models as the motivating example.

comments
36 pages, 7 figures, 10 tables, 3 algorithms
fields
Numerical Analysis
pdf ↗ page arXiv:2611.15634 ↗

We study Newton's method for the Cauchy problem for viscous Hamilton–Jacobi equations with Hamiltonians that need not be convex. Each Newton step solves a linear parabolic equation obtained by linearizing the equation at the current iterate. We prove that the iterates converge geometrically in \(L^\infty\) from any initial guess satisfying the initial condition, and quadratically in the parabolic Hölder space \(C^{2+α,1+α/2}\) from initial guesses close to the solution. When the Hamiltonian admits a control representation, the Newton iterates coincide with those of classical policy iteration, which therefore inherits both convergence rates. We extend the local quadratic convergence to uniformly parabolic fully nonlinear equations. For small viscosity, we introduce a Nash–Moser variant that smooths the iterate and the residual in space, and we give a convergence criterion with constants independent of the viscosity. Finally, we show how computable residuals certify the error of inexact Newton corrections computed with physics-informed neural networks.

comments
44 pages
fields
Numerical Analysis, Analysis of PDEs
pdf ↗ page arXiv:2611.15678 ↗

We present a purely algebraic coarsening operator for hierarchical spline spaces, obtained by inverting locally the refinement matrix that relates the coarsened basis to the current one. Only the B-splines that interact with the coarsened region are involved, so that a coarsening step reduces to one small least-squares problem followed by explicit corrections of the surviving coefficients, without mass matrices or numerical quadrature. The operator is a left inverse of the refinement matrix, hence exact whenever the fine spline belongs to the coarse space, and leaves the spline unchanged away from the coarsened region. The residual of the least-squares problem bounds the $L^\infty$-error with no unknown constants and is available before the mesh is modified, which yields an adaptive multi-level algorithm that guarantees a prescribed tolerance. The construction carries over to truncated hierarchical B-splines, where the corrections disappear. In numerical experiments, the bound is sharp within an order of magnitude, the local transfer is nearly as accurate as a global $L^2$-projection, and much of the refinement left behind a moving front is removed without degrading the solution.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.15687 ↗

This study introduces a novel a posteriori space error estimator derived within the variational multiscale (VMS) framework for the stationary incompressible Navier-Stokes equations. In this framework, the continuous problem is decomposed into coarse and fine scales. The fine scale, often referred to as the sub-grid scale (SGS), is modeled as proportional to the component of the residual orthogonal to the finite element (FE) space. This modeled SGS then serves as a reliable error estimator. Specifically, the approach employs a scaled norm of the SGSs as an a posteriori error estimate, evaluated within the stabilized norm associated with the problem. This methodology was previously applied to the stationary convection-diffusion-reaction equation (Codina et al., 2025) and is now extended to the stationary incompressible Navier-Stokes equations. The accuracy and robustness of the proposed space error estimator are assessed through a series of numerical experiments on both manufactured and benchmark incompressible flow problems. Additionally, its performance is compared in selected cases with the space error estimator proposed by Irisarri and Hauke (2021).

fields
Numerical Analysis
pdf ↗ page arXiv:2611.15688 ↗

This paper develops reliable residual-based a posteriori error estimators for the full discretization of a bulk–surface Cahn–Hilliard system with a two-parameter family of dynamic boundary conditions on a curved domain. The main novelty are theoretically justified computable temporal, coarsening and geometric error estimators. The numerical method combines a linear bulk–surface finite element method in space and a linearly implicit backward Euler method in time. Based on the derived error indicators, a space–time adaptive algorithm is proposed and numerical experiments illustrate and complement the theoretical result.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.15699 ↗

We propose a trust-region high-index saddle dynamics (TRHiSD) framework for computing high-index saddle points in ill-conditioned problems. To address the deterioration of high-index saddle dynamics caused by inappropriate step sizes and search directions, we exploit its intrinsic local min–max structure and construct separate trust-region subproblems on the maximization and minimization subspaces to adapt the two trust-region radii to different local curvature scales. Under suitable assumptions and with exact spectral subspaces, we prove local linear convergence of the Cauchy-point variant and local quadratic convergence of the Newton-step variant. Numerical experiments on modified Rosenbrock functions are consistent with the predicted convergence rates. For the Landau–de Gennes model, a TRHiSD variant using a truncated conjugate-gradient step for the minimization subproblem substantially reduces the outer-iteration count and the wall-clock time in the tested cases.

comments
20 pages, 2 figures, 3 tables
fields
Numerical Analysis, Optimization and Control
pdf ↗ page arXiv:2611.15709 ↗

We develop a pseudostress-based fully mixed finite element method for the stationary Biot-Poisson-Nernst-Planck system describing ionic transport in a charged, saturated, and deformable porous medium. The mechanical equations are reformulated in terms of a non-symmetric pseudostress and the solid displacement, while mixed formulations are retained for the Darcy, electrostatic, and ionic equations. The nonlinear electrostatic and advective couplings are treated in a Banach space setting. The formulation provides direct approximations of the pseudostress, fluxes, and concentration gradients, and permits algebraic reconstruction of the displacement gradient and Cauchy stress. Under block-stability and small-data assumptions, we establish continuous and discrete well-posedness, with poroelastic stability bounds uniform with respect to the first Lame parameter. A conforming Raviart-Thomas discretization, completed by discontinuous polynomials, yields a priori error estimates and convergence rates. For the coupled scheme in two dimensions, we construct a residual-based a posteriori error estimator and establish its reliability under an additional smallness condition on the prescribed data. Local efficiency is proved for polynomial boundary data, with boundary-data oscillation included for general traces. We also describe the estimator modifications for nonhomogeneous displacement and normal-flux data under corresponding stability and solvability hypotheses. Numerical experiments examine convergence of the mixed and reconstructed fields, robustness in the nearly incompressible regime, adaptive refinement, and ionic polarization in a charged porous medium.

comments
43 pages, 12 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.15960 ↗

We develop two hybrid data-driven Uncertainty Quantification (UQ) Reduced-Order Models (ROMs) for the non-stationary incompressible Navier–Stokes Equations (NSEs) with random viscosity. The proposed framework combines Proper Orthogonal Decomposition (POD) ROMs, spatial filtering, data-driven closure modeling, and the Stochastic Collocation Method (SCM). A key feature is the approximation of the realization-dependent closure term by the closure associated with the expected viscosity. Consequently, a single data-driven closure model constructed from the full-order solution corresponding to the expected viscosity can be reused across all realizations, thereby avoiding the expensive construction of realization-specific closure models. This leads to the Data-Driven Correction UQ ROM (DDC-UQ-ROM) and its physically constrained variant, the Constrained DDC-UQ-ROM (CDDC-UQ-ROM), in which physical constraints are imposed on the data-driven correction model. The proposed methods are evaluated for a two-dimensional (2D) flow past a circular cylinder problem with a 5D random viscosity field, considering mean Reynolds numbers $Re=100$ and $Re=500$, different correlation lengths, and both in-sample and out-of-sample parameter settings. Numerical results show that the DDC-UQ-ROM generally improves upon the standard Galerkin ROM (G-ROM), while the CDDC-UQ-ROM exhibits the most accurate and robust approximation of the benchmark energy evolution across the cases considered. The robustness and accuracy of the CDDC-UQ-ROM are further assessed through statistical error analyses of the first- and second-order energy moments, reduced-training-data experiments, and an indicative comparison of wall-clock computational costs with the full-order UQ calculations.

comments
23 pages, 10 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.15980 ↗

We analyze a trace finite element method (TraceFEM) for a surface fluid with a stabilization term that filters out Killing vector fields, and use it to discretize the surface Stokes-Cahn-Hilliard problem in space only. Assuming no geometric error, we show that the discrete inf-sup condition that our method requires is equivalent to the usual condition found in the literature and known to hold for trace Taylor-Hood pairs of arbitrary order in intrinsic dimension two. Inspired by a continuous dependence estimate at the PDE level, we derive error estimates for our scheme in the energy norms, which in turn lead to estimates in $L^2$-norms and, for two-dimensional surfaces, $L^\infty$-norm for the phase variable. To that end, we introduce a $p$-dependent scaling for the normal derivative volume stabilization, and use it to prove new approximation and inverse estimates in the $L^p$- and $W^{1,p}$-based setting ($p \in [1,\infty]$ for approximation and $p \in [2,\infty]$ for inverse estimates). Finally, we corroborate the analysis with numerical experiments.

comments
27 pages, 1 figure
fields
Numerical Analysis
pdf ↗ page arXiv:2611.15982 ↗

It is well known that for numerically solving hyperbolic conservation laws, even a convergent numerical scheme still may not always converge to a weak solution. The remedy is the famous Lax-Wendroff theorem. In a recent work on degenerate convection-diffusion equations, an analogous phenomenon was identified and doubly conservative schemes were introduced. In this paper, we address the same issue for solving the following nonlinear degenerate dispersive or convection-dispersion equations: \begin{equation*} u_t+f(u)_x+A(u)_{xxx}=0. \end{equation*} The resulting equation is regarded as degenerate if $A'(u)$ is allowed to vanish. An important example is the Rosenau-Hyman $K(m,n)$ equation. In contrast to classical KdV solitons possessing exponentially decaying tails, $K(m,n)$ equations can admit compactly supported solitary waves, known as compactons, whose regularity can deteriorate at the boundary of their support. We first give an example in which both a classical conservative and doubly conservative scheme converges to a limit that fails to satisfy the ultra-weak formulation. To address this issue, we introduce the notion of a triply conservative (TriC) scheme and prove a Lax-Wendroff type theorem for consistent TriC schemes. Under suitable assumptions, a convergent sequence generated by a consistent TriC scheme will converge to an ultra-weak solution. Several existing high-order schemes are shown to have a TriC structure. We further introduce a new high-order TriC finite volume scheme based on a connection between triple cell averages and quadratic B-splines. The theory and the scheme are also suited for two-dimensional anisotropic problems and non-uniform meshes. Numerical experiments in one and two dimensions confirm the high-order accuracy on smooth solutions and illustrate the behavior of the schemes for compactons and traveling fronts.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.16059 ↗

We study the periodic circular convolution or PCC, where the convolution kernel depends periodically on the spatial location. We introduce two fast algorithms to compute the PCC that rely on the Discrete Fourier Transform. One of the algorithms reveals that the matrix representation of the PCC is unitarily equivalent to a block diagonal matrix, which facilitates the analysis of PCCs and operations such as their product and inversion. We present two sample applications. One to deconvolve the action of an optical system whose point spread function depends periodically in space. The second is to compute dispersion relations for a periodic chain of masses.

comments
19 pages, 9 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.16144 ↗

Stiff phase-field dynamics are typically solved by semi-implicit or fully implicit time discretizations, since the interfacial scales in the Allen–Cahn and Cahn–Hilliard equations impose severe step-size restrictions on standard explicit methods. In this paper, we investigate a different strategy based on stabilized Runge–Kutta solvers, in particular the Runge–Kutta–Legendre (RKL) and Runge–Kutta–Gegenbauer (RKG) families. These schemes possess enlarged stability regions and therefore provide a natural explicit framework for diffusion-dominated gradient flows without requiring implicit solves. For the Allen–Cahn equation, combined with Strang splitting, we establish a maximum principle in 1-dimensional case, and prove energy dissipation in all the dimensions. For the modified energy dissipation analysis, we further introduce two new first-order stabilized schemes of RKL and RKG type and derive a novel eigenvalue estimate for the second-order RKG method. We also conduct extensive numerical experiments with both constant and adaptive time stepping, on regular domains as well as on an L-shaped irregular domain. The numerical results show that stabilized explicit Runge–Kutta methods provide an effective and flexible approach for the numerical simulation of Allen–Cahn and Cahn–Hilliard dynamics while preserving key structural properties. The Python implementation is available at https://github.com/ZT220501/SRK-for-Gradient-Flows.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.16238 ↗

We propose the Lower-envelope Eikonal Neural Operator (LENO), a physics-informed neural operator for eikonal equations with heterogeneous velocity fields and general source sets. LENO encodes the variational minimum principle of viscosity solutions by constructing source-wise candidate fields and taking their pointwise minimum. This lower-envelope structure enforces the source condition exactly and represents nonsmooth multi-source solutions without a soft boundary penalty. The model is trained without precomputed solution data, using a Godunov upwind residual as the sole training signal. Experiments on point sources and curve sources, sample-dependent piecewise velocity fields, and OpenFWI CurveVel-A and Style-A media show accurate agreement with references of Fast Marching Method (FMM). Additional validation shows that the Godunov residual outperforms conventional finite difference residuals on a high-resolution test, that velocity conditioning and the lower-envelope transform are essential in realistic heterogeneous media, and that the trained operator supports efficient batched evaluation and resolution transfer.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.16240 ↗

This paper is concerned with strong error estimates for fully discrete finite element approximations of the stochastic Burgers–Huxley equation with multiplicative noise. We use the implicit Euler–Maruyama scheme for time discretization and continuous piecewise linear finite elements for spatial discretization. Moment bounds and exponential integrability estimates are established and used with the discrete stochastic Gronwall inequality to derive error estimates in full expectation. Sub-second-moment error estimates are first obtained in the discrete maximum-in-time $L^2$-norm and the discrete $L^2$-in-time $H^1$-norm. Second-moment error estimates in the discrete maximum-in-time $L^2$-norm are then established using a higher-moment argument. The convergence rates are of order $k^{1/2}$ in time and $h$ in space, with the spatial rate being optimal in the $H^1$-norm. Finally, numerical experiments are provided to examine the convergence rates and the influence of multiplicative noise on the solution.

comments
41 pages
fields
Numerical Analysis, Probability
pdf ↗ page arXiv:2611.16273 ↗

We develop an intrinsic kinetic moment closure for shallow-water equations on smooth manifolds of arbitrary dimension equipped with prescribed, possibly time-dependent Riemannian metrics. Hamiltonian transport on the cotangent bundle and metric-dependent momentum integration yield balance laws with hydrostatic pressure, bottom topography, a skew-adjoint force, and dissipative bottom friction. An explicit compactly supported Gibbs equilibrium satisfies the required mass, momentum, and tensor second-moment conditions. We derive the quasilinear formulation and characteristic speeds, establish the continuous mechanical-energy balance with geometric work and frictional dissipation, and obtain a weak entropy inequality for vanishing-viscosity limits under stated convergence assumptions. On the rotating sphere with a fixed round metric, the skew-adjoint force represents Coriolis effects. We construct a kinetic finite-volume scheme combining local fluxes, hydrostatic reconstruction, and geometric source terms. A second-order time integrator uses independently restricted steps at its two Euler stages. The scheme conserves discrete water volume, preserves nonnegative depth under a sufficient CFL condition, and is well balanced for lakes at rest, including wet/dry interfaces. Six-hour simulations of a localized surface disturbance over Earth topography with Manning bottom friction maintain positive depths and conserve water volume to near machine precision. Comparison with a spherical central-upwind method shows similar surface-wave propagation and gauge time series, with remaining differences in late-time local extrema.

comments
38 pages. 5 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.16303 ↗

For the representation of signals on the sphere band-limited at $L$ using the optimal number of samples, $L^2$, equal to the number of degrees of freedom in harmonic space and placed on $L$ iso-latitude rings, we develop a spherical harmonic transform (SHT) that is theoretically exact, requires no solution of linear systems and no precomputation beyond the placement of the rings, and has complexity $O(L^3)$. The transform rests on the observation that, for each order $m$, the samples on the rings that resolve order $m$ are a complete set of samples for the order-$m$ profile of the signal, so that its values on the remaining rings follow from a closed-form Lagrange basis, the sampling functions of order $m$. We prove that the proposed optimal-dimensionality SHT (OSHT) recovers every band-limited signal exactly in exact arithmetic, so that the $L^2$ samples admit a sampling theorem in the collocation sense. For the final harmonic analysis we give two exact back-ends: Gauss-Legendre quadrature of the interpolated profiles and the algorithm of the equiangular sampling theorem, which applies without change because the rings coincide with its grid. We identify the amplification constant that governs numerical error, show that it replaces the condition number used previously for the placement of rings, propose a placement that minimizes it, and give an error propagation model that explains the growth of error with the band-limit. A multi-pass refinement converges in two passes to the rounding floor of the samples. We also describe a stable log-domain evaluation of the sampling functions, a rescaled Legendre recurrence, and a forbidden-region skipping rule that halves the cost of the elimination. Numerical experiments up to $L=2048$ characterize the accuracy, measured by the maximum and mean coefficient errors and the signal-to-noise ratio, the stability and the computation time.

comments
13 pages, 7 figures, 1 table. Code: https://github.com/zubairkhalid1/osht
fields
Numerical Analysis
pdf ↗ page arXiv:2611.16441 ↗

In this paper, we characterize the sharp almost sure asymptotics for the numerical error of the Euler–Maruyama method applied to stochastic differential equations with additive noise. Specifically, we establish, to our knowledge, the first sharp laws of the iterated logarithm for Euler–Maruyama errors in this setting along geometric mesh refinements $(N_i)_{i\in\mathbb N^+}=(α^i)_{i\in\mathbb N^+}$ for any integer $α\geq 2$. These results identify $(N_i)^{-1}\sqrt{\log\log N_i}$ as the sharp almost sure error scale and provide an explicit expression for the path-dependent constants governing the asymptotic error envelopes. The LIL constants also admit a natural interpretation through the asymptotic error distribution, specifically through the conditional covariance matrix of the stable limit of the rescaled error given the driving Wiener process. A central challenge in establishing these results is to characterize the almost sure fluctuations of Skorohod integrals arising in the error expansion, which are generally anticipating, non-Gaussian, and dependent across refinement levels. The analysis also provides a framework for studying analogous asymptotics for other numerical methods.

fields
Numerical Analysis, Probability
pdf ↗ page arXiv:2611.16457 ↗

We extend BK19 the semi-implicit finite-volume solver, to provide access to the quasi-geostrophic (QG) regime within the same compressible framework that already admits soundproof and hydrostatic limits. In order to achieve this goal, we incorporate the asymptotic framework from the continuous theory into the numerical scheme. Adopting the usual asymptotic setting for the quasi-geostrophic regime and using it directly in the numerical model, we perform a scale analysis of the compressible Euler equations in the synoptic length and time scales in the limit of small Rossby number. In this limit, the discrete implicit step recovers geostrophic balance, together with the pseudo-incompressible divergence constraint. We construct a staggered-grid curl operator consistent with the discrete derivatives and use it to define the vorticity in the numerical framework. An asymptotic analysis of the fully discrete scheme then yields a Poisson-type equation for the leading-order Exner-pressure perturbation that coincides with the QG pressure Poisson equation in the continuous theory. As a result of this analysis, we introduce two additional blending switches that (i) convert the elliptic pressure problem from the full Helmholtz to its QG Poisson-type equation and (ii) control whether the horizontal momenta are updated prognostically or diagnosed from geostrophic balance. In combination with the existing soundproof and hydrostatic switches, the resulting algorithm can be operated in fully compressible, pseudo-incompressible, hydrostatic, and QG modes without changing the underlying discretization. The functionality of the numerical scheme in the QG regime is then tested by two idealized vortex test cases to show how stable the vortices remain in the QG run and that, as the Rossby number is reduced, the full compressible scheme converges to slow, balanced QG dynamics.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.16601 ↗

The Method of Auxiliary Sources has been extensively studied in the case of cylindrical geometries. In this article, the authors provide analysis elements for the elliptical geometry case. Based on a Mathieu functions expansion, the impedance matrix is projected into a reduced diagonal matrix. At the same time, the matrix is studied in the Fourier domain. A checkerboard structure is found and a relation between the different elements of the matrix is proven. Numerical simulations confirm the theoretical results. We additionally identify an exact finite-grid parity rule, an aliasing identity connecting the discrete and continuous Fourier representations, and controlled near-circular Fourier-band localization. These results are mostly independent of a small-$q$ truncation of radial Mathieu functions.

comments
12 pages, 15 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.16670 ↗

Grid-based multinode Shepard collocation combines tensor-product Lagrange interpolants on overlapping Cartesian subgrids. On an implicitly defined domain, retained subgrids may cross the boundary and contain exterior source nodes. Removing or moving these nodes changes the local interpolants. We introduce exterior-row replacement (ERR) to preserve the source nodes and coefficients of every retained subgrid. We assemble PDE rows at strictly interior sources and supply the remaining equations through boundary evaluations. We consider two square completion methods based on projection and redistribution, an oversampled weighted least-squares one (ERR-OS), and a completion method that selects boundary rows through the interior PDE nullspace (ERR-QR). Full column rank is characterized by the boundary action on this nullspace. We also give completion conditions for prescribed fitted rows and an error estimate in terms of the residual. Global-full (GF) support uses all retained subgrids, whereas nearest-active (NA) support uses only those containing the active source nearest to the evaluation point. NA keeps off-source boundary rows sparse. The numerical study covers a disk, an annulus, a smooth star-shaped domain, a square hole with fitted and implicit boundary components, and a fitted L-shaped domain. With degree-$4$ local tensor polynomials, ERR-OS and ERR-QR recover the expected fifth-order accuracy in the reported refinement study. Further experiments examine the effects of boundary oversampling and trimming on algebraic admissibility and boundary observability.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.16732 ↗

Numerical simulations of fracture propagation require accurate computation of stress intensity factors (SIFs) to determine whether a pre-existing fracture will propagate. Even though displacement solutions from well-established numerical methods generally converge with mesh refinement, the convergence behavior of SIF estimates remains less understood. In this work, we propose a scaling law to improve the performance of SIF extraction using two-point displacement correlation methods. This scaling law relates sampling distance from the fracture tip to mesh resolution. It is developed by balancing the asymptotic truncation error against the numerical discretization error. Three numerical discretization methods–standard quadratic finite elements, quadratic finite elements with quarter-point elements, and a multi-point stress approximation finite volume method–are employed to validate the proposed scaling law on fracture benchmark problems under pure-mode and mixed-mode loading. We find that the conventional nearest-tip sampling strategy fails to compute convergent SIF estimates. In contrast, the proposed scaling-based approach yields decreasing errors in the SIF estimates as the mesh is refined. Across all three discretization methods, the proposed scaling law captures the sampling locations required for convergent SIF extraction, suggesting a general numerical characteristic of near-tip SIF extraction.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.16850 ↗

In this paper, we propose a coarse/fine splitting-based parallel unsmoothed aggregation algebraic multigrid (AMG) method, referred to as CF-UAMG. The proposed method utilizes the strong-connection structure identified by classical AMG (C-AMG) coarse/fine splitting to guide the selection of aggregate roots and the formation of aggregates, aiming to improve the quality of the aggregation-based coarse space and thus the convergence of unsmoothed aggregation AMG (UA-AMG). We also prove uniform two-grid convergence of CF-UAMG with a convergence bound independent of the matrix size for symmetric positive definite M-matrices with nonnegative row sums. Numerical experiments on three classes of three-dimensional problems, including Poisson-type equations, radiation diffusion equations, and incompressible Navier-Stokes equations, demonstrate the robustness both in convergence and parallelism of CF-UAMG. Compared with UA-AMG methods employing four commonly used aggregation algorithms, CF-UAMG achieves average speedups of 1.29x, 2.04x, and 1.94x for the three classes of problems, respectively.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.16920 ↗

In this paper, we establish algebraic strong convergence rates for spectral Galerkin and fully discrete approximations of the stochastic Burgers equation driven by additive space–time white noise. For deterministic initial data in $H^1$, the spectral approximation is shown to be convergent in the spatial supremum norm, uniformly in time and in every finite probability moment, with order arbitrarily close to $1/2$. Furthermore, we prove that an accelerated fully tamed exponential method possesses spatial and temporal strong convergence orders arbitrarily close to $1/2$ and $1/4$ under a CFL condition. The key to our analysis is a polynomial stability estimate for the conservative Burgers flux, which allows us to control the nonlinear error using polynomial moment bounds for the exact and numerical solutions. To the best of our knowledge, these are the first algebraic strong convergence rates on the whole probability space for this equation with additive space–time white noise.

comments
23 pages
fields
Numerical Analysis, Probability
pdf ↗ page arXiv:2611.16930 ↗

Explicit stabilized methods provide an efficient approach to stiff systems arising from deterministic parabolic equations, yet rigorous convergence theory for their application to stochastic partial differential equations remains scarce. To the best of our knowledge, the only prior fully discrete strong convergence analysis of explicit stabilized integrators for SPDEs is due to [A. Abdulle et al. IMA J. Numer. Anal. 43(1)(2023), pp. 258–292] and it is restricted to additive noise. The present work addresses the extension to multiplicative noise, by coupling Galerkin finite element spatial discretization with explicit stabilized time integrators. Under global Lipschitz assumptions and appropriate spatial regularity conditions, we derive the strong error bound $\mathcal{O}(h^{1+r}+τ^{1/2})$ with $r\in[0,1)$, which achieves the optimal temporal strong convergence rate $1/2$ for the considered family of methods. One- and two-dimensional numerical tests with multiplicative noise validate the predicted convergence rates and compare the computational performance of explicit stabilized methods against the linearly implicit Euler method.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.16932 ↗

We propose a numerical method for solving initial-boundary value problems for the Burgers equation that takes into account the presence of singularities of the analytic continuation of the solution into the complex plane. The algorithm uses rational approximations, a collocation method and a new scheme for time discretization combined with the relaxation method. An adaptive strategy is developed to account for the location of the singular point of the solution. Solutions to the well-known benchmark problem with a sine-shaped initial condition are obtained for the values of the viscosity as low as nu = 10^-8. Verification of the numerical results in such an extreme parameter regime makes it necessary to modify a classical formula for the exact solution so as to avoid floating-point overflow during its computation. The developed method is compared with an algorithm employing the Runge-Kutta scheme, and the conditions under which each approach yields superior results are outlined. An important feature of the proposed method is its capability to track the singular point of the solution. To verify this, we consider a problem whose solution has a simple analytical form and demonstrate that the exact and approximate coordinates of the singular point of the solution agree with high accuracy, even when the singularity comes extremely close to the domain of the problem. Taking the location of the singular point into account yields significant gains in both accuracy and run time relative to other methods.

comments
25 pages, 9 figures, 7 tables
fields
Numerical Analysis
pdf ↗ page arXiv:2611.16959 ↗

In Hu, Li and Min (2011), the authors propose a weak second order accurate $θ$-trapezoidal method as an improvement to the classical tau-leaping method. However, for complex chemical kinetic systems their model's underlying analytical assumptions can fail to hold in practice, leading to a significant reduction in its computational effectiveness. Here we introduce a modification to the method which allows it to regain desirable convergence characteristics, both given the original and a relaxed version of the underlying assumptions. We confirm this improvement through a local error analysis and present numerical examples showing it consistently performs either better or comparable to the $θ$-trapezoidal method.

comments
8 pages, 2 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.16975 ↗

We study the cell problem with mixed Dirichlet-Neumann boundary condition to reconstruct the effective matrix for two-dimensional scalar divergence-form equations with bounded measurable, and possibly nonsymmetric coefficients. We prove uniform invertibility of the mean-gradient matrix. Moreover, we derive the first-order error estimate when the medium is periodic.

fields
Numerical Analysis, Analysis of PDEs
pdf ↗ page arXiv:2611.17054 ↗

The simulation of semiclassical Schrödinger dynamics is often hindered by rapid oscillations, where classical numerical methods and quantum simulation algorithms can suffer severe precision loss as the semiclassical parameter $\varepsilon \to 0$. In this work, we uncover a surprising robustness of high-order Magnus quantum algorithms in the semiclassical regime. We establish two important results. First, we extend the theory of Magnus superconvergence from free-particle reference dynamics to a general class of Schrödinger operators whose reference Hamiltonian includes harmonic confinement. Second, and more importantly, we reveal a nontrivial semiclassical scaling law: while the expansion remainder term bound suggests an error prefactor of $O(\varepsilon^{-(p+1)})$ for a $p$th-order method, we prove that the loss is in fact order-independent and collapses to $O(\varepsilon^{-1})$ for all $p$. The key analytical mechanism is the exact Egorov transport associated with quadratic flows in semiclassical Weyl quantization, which enables a symbol-level analysis of the interaction-picture Hamiltonian and its Magnus commutators. Our results show that high-order Magnus quantum algorithms remain far more robust in the semiclassical regime than naive series remainder term counting would suggest.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.17055 ↗

Numerical simulation of transport processes in magnetized plasmas is characterized by extreme anisotropy, where diffusion along magnetic field lines can be many orders of magnitude larger than in the perpendicular direction. This anisotropy leads to thin, steep boundary layers and numerical pollution that standard finite element methods struggle to resolve without prohibitive mesh refinement. In this paper, we introduce the Partition of Unity Data-Driven Finite Element Method (PU-DDFEM), a data-driven local model reduction approach, for anisotropic diffusion. The method utilizes a bottom-up construction to enable a complete offline-online splitting. We parametrize the local magnetic field and boundary conditions to generate a snapshot space that captures the essential physics of plasma confinement. Dominant modes are extracted via a local spectral problem to identify representative features. These modes are then mapped to the global domain using a partition of unity to form a conforming approximation space. This ensures that the basis functions are fully reusable across different global magnetic configurations, significantly reducing the online computational overhead for large-scale plasma simulations.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.17086 ↗

We present a dynamic domain decomposition method for gas mixtures described by a multi-species BGK model in the regime where collisions between particles of the same species are dominant. In this regime the hydrodynamic limit is a system of Euler equations in which every species keeps its own velocity and temperature, the species being coupled through momentum and energy exchange terms. To decide locally whether this multi-velocity, multi-temperature Euler description is accurate, we extend the moment realizability criterion of Levermore, Morokoff and Nadiga: for each species, a realizability matrix is derived from the Chapman–Enskog expansion of the kinetic model, and its zeroth- and first-order approximations are compared. The indicator involves only macroscopic quantities and is evaluated species by species, so that in the same cell one species may be described by the Euler equations and another one by the kinetic equation. The kinetic solver is therefore used only where, and for the species for which, the indicator detects non-equilibrium effects, such as across shocks or near obstacles in rarefied flows. Both solvers are discretized on unstructured triangular meshes with second-order accuracy in space and time. The kinetic equation is integrated by an asymptotic-preserving IMEX Runge–Kutta scheme, whose limit for vanishing Knudsen number is a consistent discretization of the multi-velocity, multi-temperature Euler system. In the numerical tests the hybrid solution stays close to the kinetic one, while the computational time is reduced by a factor between about three and almost five.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.17131 ↗

Analog in-memory computing offers the potential to accelerate approximate inverse preconditioning, but hardware errors can degrade preconditioners designed in digital arithmetic. We develop an analog-digital preconditioner for symmetric positive-definite linear systems that combines analog block Jacobi with a small digital low-rank residual correction. The correction space is constructed by probing the same programmed analog arrays used in the solve, targeting errors from both the coupling omitted by block Jacobi and persistent hardware perturbations. Under a random linear-operator model, we separate the programmed-mean error from fresh read fluctuations, distinguish the effects of copy averaging and repeated reads, and quantify the sampling accuracy of columnwise probing. Under a centered additive write-noise model, we also derive a computable regularization threshold and identify the approximation error introduced by the regularization shift. Experiments with an analog hardware simulator show that programming errors can change the directions that block Jacobi reduces poorly. In the tested comparisons with significant programming errors, learning the correction space from the programmed copies reduces FGMRES iteration counts relative to construction from digital block Jacobi.

comments
27 pages, 11 figures, 3 tables
fields
Numerical Analysis
pdf ↗ page arXiv:2611.17251 ↗

Locally conformally symplectic (LCS) manifolds are characterized by a nondegenerate two-form $Ω$ satisfying $\mathrm{d}Ω=\varphi\wedgeΩ$, where $\varphi$ is a closed one-form, called the Lee form. Although an LCS structure is locally conformal to an ordinary symplectic structure, the local symplectic descriptions need not arise from a single global symplectic form. This creates a natural local-to-global problem for geometric numerical integration: local symplectic discretizations must be compatible on chart overlaps in order to determine a globally defined numerical dynamics. We develop a Hamiltonian variational framework for the construction and globalization of structure-preserving integrators for LCS systems. The continuous theory is first recalled in a form adapted to a Type~II Hamiltonian variational principle. We then introduce exact and approximate discrete right Hamiltonians for the local symplectic representatives and identify the transformation law that they must satisfy on overlaps. This compatibility condition implies equivariance of the associated local discrete Hamiltonian maps and therefore provides a sufficient condition for their globalization. The resulting global discrete map preserves the LCS two-form conformally, with a discrete conformal factor determined by the local conformal potentials. The framework applies naturally to Type~II Hamiltonian variational integrators and, in the cotangent-type setting considered here, to symplectic Runge–Kutta methods. In particular, Gauss–Legendre methods and the implicit midpoint rule yield globally compatible LCS structure-preserving schemes. Under suitable regularity assumptions, the corresponding Lagrangian formulation is recovered through discrete Legendre transformations. Numerical examples illustrate overlap compatibility, chart switching, convergence, and discrete conformal preservation.

fields
Numerical Analysis, Mathematical Physics
pdf ↗ page arXiv:2611.17256 ↗

Physics-informed neural networks (PINNs) solve partial differential equations without a mesh, but they do not in general preserve the steady states that well-balanced schemes reproduce exactly. We present a well-balanced extension of the weak and entropy PINN (WE-PINN) framework to the shallow water equations over smooth and discontinuous bathymetry. The residual is a weak space–time control-volume identity enforced on randomly placed control volumes that may overlap, so no mesh is needed. In free-surface variables, the geometric source is integrated by parts onto the bed, so that the network is never differentiated, and a cell-local bed-slope correction makes the quadrature reproduce the exact bed increment. Bed discontinuities, located from the bathymetry alone, separate sub-domains carrying independent networks, coupled through conservation of discharge and total head. We prove that the fully discrete residual vanishes identically on the lake at rest for any control-volume family, quadrature order and nominal bed slope, so that the equilibrium is an exact global minimiser of the training objective; that the continuous residual characterises weak solutions; that the slope correction is consistent; and that no approximation with a continuous free surface can satisfy the head condition at a step with non-zero discharge, so that the decomposition is necessary. Numerically, the residual vanishes to round-off on four lake-at-rest configurations over smooth, discontinuous, compound and tabulated beds, and the trained network reaches the equilibrium to round-off under an extended training budget. On seven Riemann problems at a bottom step, covering sub-, super- and critical transitions, the network attains relative $L^1$ free-surface errors between $6.9\times10^{-4}$ and $3.5\times10^{-3}$, and reaches critical states without prescribing them.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.17289 ↗

Differential Geometry40

The main flatness conjecture for $\mathrm{SL}_n(\mathbb{C})$-Fock bundles predicts the existence of a unique strongly positive flat compatible Hermitian metric for every $\mathrm{SL}_n(\mathbb{C})$-Fock bundle. We use cyclic Higgs bundles to disprove this conjecture for every rank $n \geq 3.$

fields
Differential Geometry, Algebraic Geometry, Geometric Topology
pdf ↗ page arXiv:2611.14847 ↗

We prove the entropy-degree theorem for continuous maps from a closed orientable non-collapsed $RCD(K,N)$ space $X$ to a closed negatively curved locally symmetric $N$-manifold $Y$, with $N \geq 3$. In the equality case, under a fundamental group index condition, we show the space is isometric to a smooth locally symmetric Riemannian manifold, and the map is homotopic to a Riemannian covering.

fields
Differential Geometry, Metric Geometry
pdf ↗ page arXiv:2611.14863 ↗

We prove an interior chord-arc estimate for graphical hypersurfaces without an a priori gradient bound, which is not restricted to balls on the scale of their curvature. As a main application we derive an in-radius lower bound depending on the curvature which then also implies Heinz-type estimates for minimal graphs and uniform area bounds for graphical hypersurfaces.

comments
19 pages, 1 figure
fields
Differential Geometry
pdf ↗ page arXiv:2611.15157 ↗

We introduce a weak notion of $\varepsilon$-super-$p$-biharmonic immersion into Euclidean space, formulated through a divergence inequality for the mean curvature vector. This class naturally extends the $\varepsilon$-superbiharmonic immersions previously introduced by the third author while remaining well-defined for all $p>1$, including the singular range $1<p<2$. We prove a Liouville-type rigidity theorem showing that every proper $\varepsilon$-super-$p$-biharmonic immersion is minimal provided \[ \liminf_{r\to\infty} \frac1{r^{2}} \int_{f^{-1}(B_r)} |\vec{H}| ^{q}\,dμ=0 \] for some $q>p-\varepsilon$. This extends the corresponding superbiharmonic rigidity theorem to the $p$-biharmonic setting under a natural growth hypothesis. We also establish a minimality theorem for complete $p$-biharmonic immersions into Riemannian manifolds of non-positive sectional curvature under a polynomial growth assumption on the mean curvature. More precisely, if \[ \int_{B_r(x_0)} | \vec{H} | ^{\,q}\,dμ= O(r^d) \] for some $q\ge0$ and $d>0$, then the immersion is minimal. For $q=0$ this recovers the polynomial volume-growth theorem of Cao–Luo \cite{CL16}, while for $q>0$ it provides a polynomial-growth analogue of Han's $L^q$-integrability rigidity theorem \cite{H15}.

fields
Differential Geometry
pdf ↗ page arXiv:2611.15212 ↗

We characterize the image of the inverse-weight Lin-Lu-Yau curvature map on finite edge-weighted trees. We prove that the prescribed curvature flow converges if and only if the target curvature is attainable, and that the convergence is exponential whenever it occurs. The key ingredient in the proof is a formulation of the prescribed curvature flow as the gradient flow of a convex functional.

comments
Report no: MPIM-Bonn-2026
fields
Differential Geometry
pdf ↗ page arXiv:2611.15213 ↗

On the Fermat quartic K3 surface and the Fermat quintic threefold, we construct Kähler metrics from explicit rational polynomial potentials and bound their differences from the Ricci-flat metrics in integral tensor norms. For specified compact families of smooth quartic and quintic hypersurfaces near the Fermat hypersurfaces, we give a terminating algorithm that constructs polynomial Kähler metrics with prescribed pointwise bounds on their differences from the Ricci-flat metrics and on their Ricci forms. The resulting metrics converge to the Ricci-flat metrics in every $C^r$ norm, uniformly in the parameter.

comments
25 pages, 2 tables
fields
Differential Geometry
pdf ↗ page arXiv:2611.15319 ↗

We classify the $G$-g.o. metrics on compact homogeneous spaces $G/H$, where $G$ is a compact connected simple Lie group and $H$ is an arbitrary closed subgroup. We give the complete list of nonnormal metrics, including their parameter conditions and the possible mixing between equivalent isotropy summands. The proof uses rigidity criteria for arbitrary cometric operators, reductions through centralizers, and the stabilizers of the relevant representations. For every fixed pair $(G,H)$, the space spanned by the $G$-g.o. cometrics has dimension at most three, and we determine the equality cases. We also compare the classification with the compact weakly symmetric pairs and explain why the choice of the transitive group is essential.

comments
No AI;No Dream
fields
Differential Geometry
pdf ↗ page arXiv:2611.15336 ↗

In this paper, we establish and recover some results about noncompact 3-manifolds with nonnegative scalar curvature and some topological assumptions. Firstly, we apply the work in Oronzio \cite{Oro1,Oro2} to obtain a nonexistence result of the harmonic function. Secondly, we use the argument in Yan-Zhu \cite{YZ} to establish a rigidity result, which states that such manifold is isometric to the warped product of a flat tours and a half line. Finally, we recover a topological result in Yan-Zhu \cite{YZ} via a different argument.

fields
Differential Geometry
pdf ↗ page arXiv:2611.15384 ↗

Gromov's Kähler hyperbolicity, extended by McMullen to complete manifolds of finite volume and bounded geometry, has non-Kähler analogues (balanced, SKT, Gauduchon and divisorial hyperbolicity) that have so far been studied only on compact manifolds. We define these notions for complete Hermitian manifolds and prove the following. A manifold carrying a balanced metric and a Hermitian metric with bounded $(\partial+\bar\partial)$-potentials satisfies a Cheeger inequality, so its fundamental group is non-amenable in the compact case. Kähler and SKT hyperbolic manifolds are Brody hyperbolic, and balanced and Gauduchon hyperbolic manifolds are divisorially hyperbolic, without any compactness assumption. Products give complete non-compact non-Kähler examples. A non-compact surface may be divisorially hyperbolic without being Brody hyperbolic. Finally, no functorial pseudo-distance characterises divisorial hyperbolicity.}

fields
Differential Geometry
pdf ↗ page arXiv:2611.15396 ↗

We study how curvature bounds control the Dirac eigenvalues of closed spin manifolds, comparing the positive and negative eigenvalues separately. Within a fixed conformal class and spin structure, pointwise ordering of scalar curvature relative to a metric of negative scalar curvature implies comparison at every nonzero index. On the two-sphere, a holomorphic ladder on the half-canonical bundle proves the corresponding comparison in both directions under a Gaussian curvature bound. On surfaces of higher genus, the same bundle identities propagate comparison from the scalar and spinor levels to higher canonical powers. In the round conformal class on the higher dimensional sphere, a prescribed scalar curvature bound yields an upper bound in absolute value for the first $2^{[n/2]}$ Dirac eigenvalues. When the conformal class varies, we can show that the corresponding comparisons on hyperbolic surfaces and odd-dimensional spheres no longer hold; while on even-dimensional spheres, the first gap and all sufficiently high-index eigenvalues of either sign satisfy a one-direction comparison.

comments
27 pages. Comments are welcome
fields
Differential Geometry, Spectral Theory
pdf ↗ page arXiv:2611.15400 ↗

In this note, we introduce an equivariant version of twisted holomorphic analytic torsion for the twisted Dolbeault complex on a complex manifold equipped with an action of a compact Lie group. Our construction is motivated by Ray and Singer's holomorphic analytic torsion, by the equivariant analytic torsion developed for elliptic complexes with group actions, notably in the work of Donnelly and later in the holomorphic setting by Bismut, and by Mathai and Wu's twisted analytic torsion for the twisted de Rham complex. Using pseudodifferential operators and the equivariant noncommutative residue, we define the equivariant twisted holomorphic analytic torsion. We also state its variation formulas under changes of the metric and of the twisting element, and present its functorial properties.

comments
16 pages; this note presents the core material of the author's master's degree thesis. It was completed between late May and early June 2026
fields
Differential Geometry
pdf ↗ page arXiv:2611.15562 ↗

In this paper, we consider weighted minimal surfaces in H2xR, namely, surfaces that arise as critical points of a weighted area functional, where the corresponding weight depends only on the height function associated with the second factor R. We refer to these surfaces as φ-minimal surfaces. For a class of increasing and concave weight potential functions φ, we focus our attention on height-weighted minimal surfaces that are invariant under isometries of H2xR that act trivially on R and act by hyperbolic translations in H2. Through a detailed analysis of the corresponding three-dimensional system of ordinary differential equations, we present families of entire graphs, graphs over half-spaces of H2 that are asymptotic to vertical planes, winglike surfaces, and surfaces whose height function has no minimum. These families show that the hyperbolic-invariant setting is considerably richer than the rotational and parabolic settings. For the class of potential functions φ we consider, they also allow us to classify all weighted minimal surfaces in H2xR that are invariant under hyperbolic translations.

comments
22 pages, 11 figures
fields
Differential Geometry
pdf ↗ page arXiv:2611.15570 ↗

We study the Hennig-Neugebauer family of stationary and axisymmetric vacuum multi-horizon candidates. The regularity conditions on the symmetry axis lead to quadratic determinant relations which leave an apparent ambiguity between two sign branches. Under explicit non-degeneracy assumptions, we prove that one of these branches is impossible. This branch selection yields a system of explicit determinant equations characterizing equilibrium within the family.

comments
71 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.15637 ↗

We consider a construction of hyper-Hermitian structures on total spaces of circle bundles over 3-quasi-Sasakian manifolds. We study the HKT-Einstein equation in this setting, proving that a large family of non-homogeneous hyper-complex manifolds admit compatible HKT-Einstein metrics with positive Einstein factor. We also show that the hyper-Hermitian structures on such circle bundles are quaternionic balanced or quaternionic Gauduchon if and only if they are HKT. Finally, the HKT-Einstein condition is investigated under the twist construction.

comments
16 pages; comments are welcome
fields
Differential Geometry
pdf ↗ page arXiv:2611.15697 ↗

We study synthetic Ricci bounds and related rigidity phenomena in conic and boundary neighborhoods through the behavior of entropy along optimal transports. For cones over manifolds, we show that two-sided entropic Ricci bounds at the vertex force the fiber to have constant sectional curvature 1, while non-trivial quotient singularities, such as Euclidean cones over spherical space forms, remain admissible. An analogous rigidity holds for Riemannian manifolds with conic singularities. We also give a local characterization of boundary convexity in terms of entropic lower Ricci bounds, based on a direct optimal transport argument.

comments
29 pages, 2 figures. Comments welcome
fields
Differential Geometry, Metric Geometry
pdf ↗ page arXiv:2611.15796 ↗

We study Poisson and Jacobi structures compatible with quadratic structures on finite-dimensional Lie algebras, mostly over fields of characteristic zero. Building on the theory of generalized double extensions, we give necessary and sufficient reconstruction criteria for the skew operators preserving a marked isotropic ideal, allowing degenerate operators, a nonabelian quadratic quotient, and the full generalized extension data. Recalling the characterization of quadratic Poisson structures in terms of skew-symmetric solutions of the classical Yang–Baxter equation, we combine the ambient bracket reconstruction of Kostant and Meyer with prescribed symplectic leaf data to reconstruct Poisson structures whose characteristic subalgebra is nondegenerate for the quadratic form. We express the standard algebraic Jacobi equations through the invariant form and obtain analogous reconstruction results for nondegenerate characteristic subalgebras. Particular attention is given to the contact and locally conformally symplectic cases. A common cochain framework identifies the remaining scalar obstruction in third cohomology in the Poisson case and in the Jacobi branch whose Euler element belongs to the marked ideal, with coefficients in a one dimensional module in the latter case. Our reconstruction results yield systematic procedures for constructing quadratic Poisson structures in dimension $n+2k$ from those in dimension $n$, and recover the earlier quadratic symplectic extension formulas when the Poisson operator is invertible. Explicit examples illustrate the applicability of the theory, including oscillator algebras, the five-dimensional Lie algebra $A_{5,3}$, and Poisson structures associated with the curvature tensor of a bi-invariant metric.

comments
64 pages. Comments are welcome!
fields
Differential Geometry, Mathematical Physics, Symplectic Geometry
pdf ↗ page arXiv:2611.15800 ↗

We prove that for generic elements in three natural families of Laplace-type differential operators on smooth manifolds, which are equivariant with respect to a finite symmetry group, all the eigenspaces are irreducible representations. In other words, the spectrum of these operators is generically equivariantly simple. The three families of operators with symmetry are Schrödinger operators parametrized by the potential, going back to the work of Wigner, Laplace-Beltrami operators parametrized by invariant Riemannian metrics and conformal Laplacians parametrized by invariant metrics in a given conformal class. The latter two results extend prior work of Zelditch for certain free group actions and resolve, for finite group actions, a well-known open question raised by Guillemin and Yau. Our approach stems from methods developed by Wendl and Doan-Walpuski to address equivariant transversality in symplectic topology.

comments
56 pages
fields
Differential Geometry, Spectral Theory
pdf ↗ page arXiv:2611.15832 ↗

We prove the existence of entire maximal hypersurfaces, asymptotic to suitable coordinate-dependent boosts in the two asymptotically flat ends of maximally extended Schwarzschild spacetime. As a corollary, this generates a foliation of maximal hypersurfaces in exterior Schwarzschild, which corresponds to a geometric choice of time function associated with any boost parameter. As a crucial step in the proof, we introduce a novel rotationally symmetric time function in maximally extended Schwarzschild, which is Cauchy and has properties of independent interest.

comments
52 pages. Comments are welcome!
fields
Differential Geometry
pdf ↗ page arXiv:2611.15912 ↗

In the paper ``Geodesic fields for Pontryagin type $C^0$-Finsler manifolds'', the same authors introduced a geometric object called Pontryagin-type $C^0$-Finsler structures, which includes Finsler structures on a smooth manifold $M$. Such a structure is defined locally by a control system of $C^1$ unit vector fields on an open subset $U$ of $M$, such that Pontryagin's maximum principle (PMP) is applicable. As a result of PMP, we obtain the extended geodesic field $\mathcal{E}$, which is a multivalued vector field on the slit cotangent bundle $T^{\ast}U\backslash 0 = \{(x,α): x\in U, α\in T^{\ast}_x U\}$, such that every minimizing path $x(t)$ on $(U,F)$ is an extremal (projection of a Pontryagin extremal $(x(t),α(t))$). Some time after its introduction, its use and external comments, it is useful to provide remarks that clarify the applicability and limitations of this theory. In addition, we point out two errors contained in that work which, although discernible from the context, we believe should be pointed out. Finally, we prove some cases where the property that a minimizing path is the projection of a Pontryagin extremal can be extended beyond a coordinate system, sometimes to $M$. We also work on the problem of determining when $\mathcal{E}$ does not depend on the control system chosen to represent $F$. In particular, $\mathcal{E}$ satisfies these two properties globally for left-invariant $C^0$-Finsler structures on Lie groups, and for $C^1$-Finsler structures (without the condition of strong convexity).

comments
9 pages
fields
Differential Geometry, Optimization and Control
pdf ↗ page arXiv:2611.16101 ↗

We give an alternative proof of Li and Petersen's theorem that every invariant Kähler metric on a compact generalized flag manifold has positive holomorphic sectional curvature. For a unitary partial flag manifold, we realize the given metric by Kähler reduction of a Hermitian vector space. The defining equations place the level set on a sphere of radius \varrho, where the radial component of its second fundamental form gives the explicit lower bound 4/\varrho2 through the quotient curvature formula. Finally, we use a holomorphic isometric totally geodesic embedding to transfer the bound to generalized flag manifolds of every Lie type.

comments
10 pages
fields
Differential Geometry, Complex Variables
pdf ↗ page arXiv:2611.16181 ↗

In this article, we investigate nontrivial compact m-quasi-Einstein manifolds with boundary, m > 1 and constant scalar curvature. We first prove that such a manifold is rigid whenever the set of critical points of its potential function is totally geodesic, which extends to quasi-Einstein manifolds a theorem of Li, Li, Ou, Qu, Wu and Zhou for shrinking Ricci solitons. Then, we prove that, in every dimension, this set is totally geodesic whenever it has dimension two or three, so that the manifold is rigid in this case. The proof is based on a Bochner identity for the covariant derivative of the Ricci tensor at the points of this set. In particular, every such manifold of dimension five is rigid. Finally, we obtain rigidity in arbitrary dimension under an integral Weyl pinching condition when the set of critical points has dimension four.

comments
27 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.16314 ↗

Let $(M=G/H,J)$ be a reductive complex homogeneous space and $F$ be a $G$-invariant strongly pseudoconvex complex Finsler metric on $M$. Using the adapted $(1,0)$-frame field obtained by parallel transformation with respect to the canonical connection on $M$, we obtain the necessary and sufficient condition for $F$ to be a Kähler-Finsler metric (resp. weakly Kähler-Finsler metric) in terms of Lie-bracket. The curvature tensor of the complex Rund connection associated to $F$ is then decomposed into an algebraic part and a derivative part, yielding explicit formulas for the holomorphic bisectional curvature and holomorphic sectional curvature of $F$, respectively. As an application, we give a Lie-theoretic proof of the rigidity theorem: every $G$-invariant strongly pseudoconvex complex Finsler metric on a complex symmetric manifold $M=G/H$ is necessarily a Kähler–Berwald metric.

comments
31 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.16370 ↗

Conjugate symmetric statistical manifolds generalize Hessian manifolds. Shima introduced Hessian sectional curvature in 1995 as an invariant for studying Hessian structures. We extend this invariant to conjugate symmetric statistical manifolds and study related curvature conditions and invariants. Our main results are as follows. For connected Hessian manifolds of dimension at least two, we characterize constant Hessian sectional curvature (CHC) by pointwise orthogonal invariance. We call conjugate symmetric statistical manifolds satisfying this invariance condition weakly CHC. We classify connected weakly CHC statistical manifolds of dimension at least two whose cubic forms are parallel with respect to the Levi-Civita connection. This classification characterizes the non-Hessian statistical structures induced on the classical hyperbolic affine spheres $xyz=c>0$ in the positive octant. We also introduce principal Hessian curvatures and show that they form a complete invariant for left-invariant Hessian structures on $\mathbb{R}^n$ up to statistical isomorphism.

comments
28 pages. Comments are welcome!
fields
Differential Geometry
pdf ↗ page arXiv:2611.16381 ↗

We prove that totally geodesic hypersurfaces are at infinite Kobayashi distance in a Kobayashi hyperbolic Riemannian manifold. To do this, we prove a Schwarz lemma on minimal maps with a uniform control on their Laplacians. Finally we give a full characterisation of submanifolds at infinite distance on spaces of constant sectional curvature in dimension at least 4.

comments
23 pages, 3 figures
fields
Differential Geometry
pdf ↗ page arXiv:2611.16571 ↗

A locally conformally symplectic (LCS) structure on a manifold $M$ is a pair $(η,ω)$ consisting of a closed $1$-form $η$ called Lee form and a nondegenerate $2$-form $ω$ satisfying \[ dω=η\wedgeω. \] We classify compact connected homogeneous LCS manifolds with nonzero Lee form. To this end, we construct three explicit families of pairs $(G,K)$, where $G$ is a connected simply connected Lie group and $K$ is a closed subgroup such that $G/K$ is compact, the $G$-action is almost effective, and $G/K$ admits a $G$-invariant LCS structure. We show that every compact connected homogeneous LCS manifold with nonzero Lee form arises from one of these families. Moreover, each such manifold is LCS-isomorphic to a product $(S/H_d)\times S^1$, where $S$ is a compact connected simply connected semisimple Lie group and $S/H_d$ carries an $S$-invariant contact form $α$. Under this identification, the LCS structure is given by \[ η=π_2^*ξ,\qquad ω=d(π_1^*α)+π_1^*α\wedgeη, \] where $π_1$ and $π_2$ are the projections onto the two factors and $ξ$ is a nowhere-vanishing $1$-form on $S^1$. This description also yields topological consequences for compact homogeneous LCS manifolds. In particular, none of these compact homogeneous LCS manifolds admits a symplectic structure, even without any invariance assumption. As a consequence, we show that in dimension four the underlying manifolds are precisely $L(d,1)\times S^1$, where $L(d,1)$ is a three-dimensional lens space. In dimension eight, we obtain families arising from seven-dimensional lens spaces and Aloff–Wallach spaces, including infinitely many distinct topological types.

comments
39 pages
fields
Differential Geometry, Symplectic Geometry
pdf ↗ page arXiv:2611.16625 ↗

We study complete critical metrics for the quadratic scalar curvature functional \[ g\mapsto\int_M S_g^2\,\dv_g, \] with criticality understood under compactly supported variations, focusing on rigidity phenomena and nontrivial examples. In dimension three, we prove that every complete critical metric is scalar-flat, without any additional assumption. In dimension four, we construct complete non-Einstein critical metrics with bounded, nonconstant negative scalar curvature. In every dimension $n\geq5$, we show that either $S_g\equiv 0$ or $S_g<0$ everywhere, and a new argument proves scalar-flatness whenever $S_g \in L^p$ for some $0<p\leq P_n$, where $P_n>2$ is an explicit threshold. Moreover, we construct complete critical metrics with bounded, negative scalar curvature, decaying to zero at infinity. These examples establish the optimality of our rigidity threshold $P_n$ in dimension six and in every dimension $n\geq10$. To the best of our knowledge, these are the first complete critical metrics for this functional that are neither scalar-flat nor Einstein.

fields
Differential Geometry
pdf ↗ page arXiv:2611.16712 ↗

This paper investigates the global geometry of loxodromes and loxodromic curves on surfaces of revolution in $\mathbb{R}^3$. A loxodrome is a regular curve avoiding the poles and making a constant directed angle with the meridians. To allow curves to reach or pass through poles, we introduce loxodromic curves, whose pole-free interior portions are loxodromes. The directed azimuths of these portions agree modulo $π$. We classify surfaces of revolution into four types based on the number of poles and whether the profile curve is closed: cylinder-like, torus-like, paraboloid-like, and sphere-like. For cylinder-like surfaces, every maximal loxodromic curve other than a parallel is non-self-intersecting. For torus-like surfaces, nonparallel maximal loxodromic curves are closed or dense according to the rationality of their rotation numbers. For paraboloid-like and sphere-like surfaces, only maximal meridians can pass smoothly through poles, while nonmeridional, nonparallel maximal loxodromic curves have poles as endpoints. We derive the differential equations for arc-length-parametrized loxodromes and introduce coordinates in which they are represented by straight lines. We solve the direct and inverse problems for loxodromic segments on all four surface types and give criteria for maximal loxodromic curves to be geodesics. We show that diffeomorphisms preserving maximal loxodromic curves preserve surface type and that their inverses preserve such curves. These maps preserve maximal meridians and parallels on surfaces with poles, but need not do so on pole-free surfaces. We characterize azimuth-consistent diffeomorphisms and, for cylinder-like surfaces, establish criteria for conformality and isometry. In particular, azimuth-consistent diffeomorphisms are conformal when both surfaces have poles.

comments
43 pages, 5 figures, 4 tables
fields
Differential Geometry
pdf ↗ page arXiv:2611.16810 ↗

We determine the Morse index and normal nullity of all linearly full homogeneous minimal two-spheres in complex hyperquadrics. These invariants satisfy a common relation involving only the ambient dimension and the induced Gauss curvature. We also prove that every normal Jacobi field is integrable through minimal immersions.

comments
25 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.16813 ↗

We give a rigorous, constructive proof that there exists a Ricci-flat Kähler metric on the Fermat quartic hypersurface, independently of Yau's famous theorem, along with an explicit and accurate analytic approximation to the metric. The proof combines numerical techniques to obtain the approximately Ricci flat metric, a fixed point theorem to prove existence, and verified numerics to get the bounds used by the fixed point theorem. The method is general and we discuss the computational issues in applying it to other manifolds.

fields
Differential Geometry
pdf ↗ page arXiv:2611.16908 ↗

We prove weak $L^\infty$ stability for complete, non-collapsed Ricci flows with almost WPIC1 curvature and scaling-invariant curvature bounds. Small $L^\infty$ perturbations of the initial metric admit Ricci-DeTurck flows which remain uniformly close to the background flow and depend Lipschitz continuously on the initial data. This extends an earlier stability theorem of the first and third authors with Lai.

comments
24 pages, comments welcome
fields
Differential Geometry
pdf ↗ page arXiv:2611.16910 ↗

This note explains the counterexamples to Lee's conjecture on pseudo-Einstein structures obtained in joint work with Yoshinori Gongyo, Kengo Hirachi, and Shuya Matsumoto. The examples are links of normal isolated singularities and occur in every odd real dimension at least three. Each link has vanishing first Betti number and vanishing integral first Chern class of its CR structure, yet admits no pseudo-Einstein structure. We explain how finite first homology relates the existence problem on the link to the canonical divisor at the singular point. For the higher-dimensional examples, we describe the key obstruction directly in terms of the first normal derivatives of the transition functions of a line bundle along an exceptional hypersurface.

comments
22 pages. This is an expository note of arXiv:2611.04851
fields
Differential Geometry, Algebraic Geometry, Complex Variables
pdf ↗ page arXiv:2611.16911 ↗

In this paper, we show that any three-dimensional differentially non-degenerate left-symmetric algebra over $\mathbb R$ is non-degenerate both in the formal and real-analytic categories via the correspondence with Nijenhuis operators.

fields
Differential Geometry
pdf ↗ page arXiv:2611.16954 ↗

We give a counterexample to S. Novikov's 1982 conjecture that every Riemannian $2$-sphere contains a closed embedded curve of curvature $c$ for every $c>0$.

fields
Differential Geometry
pdf ↗ page arXiv:2611.16960 ↗

Given an asymptotically conical unstable expanding gradient Ricci soliton, we provide the existence of a family of Ricci flows starting at the same metric cone up to isometry. Moreover, the family of solutions we construct is shown to be parametrized by positive modes of the weighted Lichnerowicz operator associated to the background expanding gradient Ricci soliton. Each solution of this family is shown not to be induced by an expanding gradient Ricci soliton. If the background expander has no non-trivial infinitesimal deformations, we show furthermore that the solutions we provide are not self-similar. We finally prove that solutions are distinct up to isometries preserving the potential function of the background expanding gradient Ricci soliton.

comments
60 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.16976 ↗

We study geometric consequences of modified Hessian estimates on Riemannian manifolds with density. For general radial functions, we derive tensorial, spectral, and trace identities for the modified Hessian in the original metric. We also establish a comparison identity relating the modified Hessians of two radial functions and characterize when they are proportional. We then prove a hinge comparison theorem under an upper bound on the modified Hessian, yielding a weighted law of cosines and lower bounds for the excess function. Finally, under nonnegative weighted sectional curvature and suitable density control assumptions, we obtain an Abresch-Gromoll-type upper excess estimate.

comments
24 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.17039 ↗

We present a pair of spinorial equations, generalizing the internal Killing spinor equations of Type I supergravity, and show that they characterize several classes of Bismut-Hermitian-Einstein structures on six-dimensional Riemannian spin manifolds. We show that in this framework the local reduction to a four-dimensional transverse Hermitian geometry is provided by two canonical, commuting, Bismut-parallel Killing vector fields arising as bilinears in the Killing spinors, without assuming compactness. In one class, the transverse geometry is conformally Kahler and both compact and non-compact solutions exist. We also discuss variants that do not admit compact solutions, one of which has hyper-Hermitian transverse geometry. We discuss the relation of these structures to the Hull-Strominger system with closed three-form and to five-dimensional Gauntlett-Kim geometries and provide explicit embeddings in Type I, Type IIB and massive Type IIA supergravity, as well as in generalized supergravity. We illustrate our results with a number of examples, both compact and non-compact.

fields
Differential Geometry
pdf ↗ page arXiv:2611.17195 ↗

We establish optimal sheet separation estimates for stable $s$-minimal hypersurfaces in dimensions up to seven, using an iteration argument in the nonlocal approximation theory of Chan-Dipierro-Serra-Valdinoci. These estimates imply that every stable $s$-minimal hypersurface in $\mathbb{R}^7$ is a hyperplane when $s$ is close to $1$. More generally, every finite Morse index $s$-minimal set in $\mathbb{R}^7$ is a half-space. We also establish a compactness theorem for stable $s$-minimal cones in $\mathbb{R}^8$. We prove uniform curvature and area estimates for their links and show that, as $s \uparrow 1$, they subconverge graphically in $C^{2,α}$, either with multiplicity one to a classical stable minimal cone, or with multiplicity two to a hyperplane. The stability of Lawson and axisymmetric $s$-minimal cones in $\mathbb{R}^8$ shows that these results are optimal.

fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2611.17249 ↗

Let $(M^3,g)$ be a closed and oriented 3-dimensional Riemannian manifold with $π_2(M)\neq 0$ and let $A_{π_2}(M,g)$ denote the least area among homotopically nontrivial two-spheres in $M$. By a theorem of Bray-Brendle-Neves, $A_{π_2}(M,g)\inf_M R_g \leq 8π$ with equality characterizing the cylindrical geometry $S^2\times\mathbb{R}$. Motivated by Sormani's questions on volume preserving intrinsic flat stability for scalar curvature rigidity problems, we study the almost equality regime of this theorem. We build, using Sweeney's tunnel construction, a sequence satisfying $A_{π_2}(M_j,g_j)\inf_{M_j} R_{g_j} \rightarrow 8π$ with uniformly bounded volume and diameter whose volume preserving intrinsic flat limit is not the Bray-Brendle-Neves rigidity space, showing that stability fails in general. We then prove stability in two special cases: for sequences of rotationally symmetric metrics (with non-collapsing assumptions) and for sequences of manifolds with nonnegative Ricci curvature.

fields
Differential Geometry
pdf ↗ page arXiv:2611.17263 ↗

We construct smooth isometric embeddings of closed surfaces of positive genus in Euclidean 3-space which are tight, i.e., have minimal total positive curvature, but are not congruent. These embeddings agree outside a compact subset of the region of negative curvature, and enclose different volumes. Thus the rigidity theorem of Alexandrov for analytic tight surfaces does not hold in the smooth category, which settles problems of Nirenberg and Banchoff-Kuhnel.

comments
16 pages, 5 figures
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2611.17269 ↗

We solve the Cauchy problem for an irreducible real spinor parallel with respect to a metric connection with skew-symmetric torsion on a globally hyperbolic Lorentzian four-manifold, proving that it is well-posed modulo an obstruction that we identify explicitly, and obtaining an initial-data characterization of such spinors. Our proof relies on the theory of spinorial forms, which we use to explicitly integrate the coupled flow for the spinor and underlying metric via a rotated pull-back action of the flow generated by a vector field on the Cauchy hypersurface $Σ$. We characterize the corresponding constraint equations as an explicit exterior differential system and describe all its solutions in terms of contact structures and flat foliations, obtaining a complete classification in the compact case. In particular, we conclude that every oriented compact three-manifold arises as the Cauchy hypersurface of a globally hyperbolic Lorentzian four-manifold equipped with a skew-torsion parallel spinor. Building on these results, we study the interaction between the four-dimensional Neveu-Schwarz supergravity evolution flow on an abelian bundle gerbe and the spinorial evolution flow determined by its supersymmetric conditions, which we prove to be well-posed and compatible. This establishes the well-posedness of the supersymmetric Neveu-Schwarz system in four dimensions and provides an initial-data characterization of supersymmetry. Furthermore, we obtain a strong rigidity result stating that every globally hyperbolic supersymmetric Neveu-Schwarz solution with a compact Cauchy hypersurface is flat and has vanishing bundle-gerbe curvature.

comments
65 pages. Comments welcome!
fields
Differential Geometry
pdf ↗ page arXiv:2611.17319 ↗

Number Theory39

In this note we assume the existence of divergent trajectories (if any) under the Collatz map and investigate the consequences of this assumption, even though the Conjecture of Collatz seems to be true. In a trajectory we show that the Diophantine exponential equation $x + y = w 2^n$ in the integers $x, y, w, n$ plays an important role. In this context the recent strong finiteness theorem of Bennett and Billerey on ${\it S}-Units has consequences on the set of prime numbers generated by a collection of local minima, called wave-minima (defined ad hoc for simplicity's sake) in a divergent trajectory. It allows to define canonically a density of a trajectory and some conjectures and open problems related to these prime numbers.

journal
Uniform Distribution Theory, 2026, 21 (1), pp.1-9
fields
Number Theory
pdf ↗ page arXiv:2611.14569 ↗

We prove that for a Rademacher random multiplicative function $(f(n))_{n\in\mathbb{N}}$ and any non-linear polynomial $P\in\mathbb{Z}[x]$ admitting a positive constant $κ_P$ such that \[\lim_{N\rightarrow\infty} \frac{\#\{n\in\left[N\right]:P(n)\text{ is square-free}\}}{N} =κ_P,\] we have \[ \frac{1}{\sqrt{κ_PN}}\sum_{n\leqslant N}f(P(n)) \xrightarrow[]{d}\mathcal{N}(0,1), \] as $N\rightarrow\infty $, where convergence is in distribution to a standard Gaussian. Using a direct combinatorial argument, we establish paucity estimates for non-trivial square products of square-free polynomial values at every fixed moment order. These estimates yield the Gaussian limit by the method of moments. We also study partial sums of the form $\sum_{n<N} F(f(n),f(N-n))$ for a suitable class of bivariate functions $F$ when $f$ is a Steinhaus random multiplicative function, and prove analogous results in special cases in the Rademacher setting. These results can be viewed as random analogues of the Goldbach-type problems considered by Mangerel.

comments
47 pages
fields
Number Theory, Combinatorics, Probability
pdf ↗ page arXiv:2611.14579 ↗

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 deg $F=4$ and $n=393$. In this paper, we prove the existence of such a polynomial $F$ with $n=28$.

comments
32 pages
fields
Number Theory, Logic
pdf ↗ page arXiv:2611.14605 ↗

A $Δ$-triple for a natural number $n$ is a triple $(x,y,z)$ of divisors of $n$ with $1<x<y\leq z<\sqrt n$ and $n/x-x=(n/y-y)+(n/z-z)$. The numbers that admit such a triple are those with the $Δ$ property, which governs the existence of certain $n$-simple triangles in factor graphs of split graphs. We allow the three components to be rational numbers, and show that, once the quotient $z/y=a/b$ is fixed, the rational $Δ$-triples for $n$ are exactly the rational points of the elliptic curve $Y^2=n\,ab\,w(w+ab)\bigl(w+(a+b)^2\bigr)$ lying over the interval $-b(a+b)<w<-ab$. Since a rational $Δ$-triple for $n$ amounts to $Δ$-triples for infinitely many of the numbers $κ^2n$, the chord–tangent construction becomes a way of producing new $Δ$-triples from old ones. For perfect squares, the curve always carries a rational point coming from a degenerate triple. This point has order $4$ if $a=b$, and infinite order if $a>b$. As a consequence, for every quotient $a/b>1$ there are infinitely many pairwise non-proportional $Δ$-triples of perfect squares with $z/y=a/b$, in contrast with the fact that perfect squares have no $Δ$-triple with $y=z$. For arbitrary $n$, there are infinitely many rational $Δ$-triples for $n$ with a given quotient if and only if the corresponding curve has positive rank.

fields
Number Theory
pdf ↗ page arXiv:2611.14803 ↗

A classical theorem of Schoenberg (1937) characterizes the dimensions $d$ for which $\mathbb{Q}^d$ contains the vertex set of a regular simplex with $d+1$ vertices. We generalize Schoenberg's result to all fields of characteristic not equal to $2$, using elementary Witt theory and Lagrange's four-square theorem. Our generalization also sharpens Schoenberg's theorem and complements more recent work of Lorenz and Zimmermann (2026) by characterizing the admissible edge lengths. In the case of finite characteristic, equilateral simplices with $d+2$ vertices can sometimes exist (F.~Radó 1986), and we characterize this situation as well, again for all fields of characteristic not equal to $2$. We also briefly consider the edge lengths of equilateral simplices of $d$ vertices.

comments
14 pages
fields
Number Theory, Metric Geometry
pdf ↗ page arXiv:2611.14845 ↗

We prove that for almost all additive Diophantine inequalities of degree $k$ in at least $k+1$ variables the expected asymptotic formula for the density of solutions holds true. This improves the result of Brüdern and Dietmann \cite{BD}.

comments
14 pages
fields
Number Theory
pdf ↗ page arXiv:2611.14865 ↗

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.

comments
27 pages
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2611.14873 ↗

In 2022, Balister, Bollobás, Morris, Sahasrabudhe, and Tiba proved that the least common multiple of the moduli in any distinct covering system with odd moduli is divisible by $9$ or $15$. We strengthen this necessary condition to divisibility by $45$ and prove that the minimum modulus of an odd distinct covering system is at most $9$. For arbitrary distinct moduli, we lower the upper bound of Balister et al.\ on the minimum modulus from $616000$ to $14000$. For distinct squarefree moduli, we lower the upper bound of $118$ obtained by Cummings, Filaseta, and Trifonov in 2025 to $7$. Our proofs combine the distortion method with a joint comparison based on directional convexity. The comparison uses independent random exponents to bound expectations of convex functions of sums of indicators of residue classes, while retaining the restrictions on the allowed moduli. A sharper bound for the conditional density on each fibre further improves the estimates for the subsequent stages of the distortion process.

comments
34 pages
fields
Number Theory
pdf ↗ page arXiv:2611.15110 ↗

We study Anderson t-modules whose positive-degree coefficient matrices admit a flag-jump basis and extend the t-reduction algorithm to this setting. We prove that these t-modules are abelian, with motive rank equal to the sum of their jump degrees. If $Φ$ has jump degrees $j_1,\ldots,j_d$ and $deg_τΨ<\min_s j_s$, we compute the t-module structure on ${\mathbf{Ext}}^1_τ(Φ,Ψ)$, its subgroup ${\mathbf{Ext}}_{0,τ}(Φ,Ψ)$, and the associated exact sequence. The construction allows nonzero nilpotent constant terms and includes the strictly pure case. When $Ψ$ is the Carlitz module, $N_Φ=0$, and all jump degrees are at least two, the construction yields a dual t-module. We give complexity bounds for the algorithms and implementations in SymPy and Mathematica.

comments
50 pages
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2611.15116 ↗

Let $\textup{PDO}_\textup{t}(n)$ denote the total number of tagged parts over all partitions of $n$ into odd parts with designated summands. Using $3$-dissection identities and coefficient extraction, we obtain explicit polynomial expansions for the generating functions of two infinite families of arithmetic subsequences of $\textup{PDO}_\textup{t}(n)$. We establish lower bounds for the $3$-adic valuations of the coefficients in these expansions, thereby proving two infinite families of congruences modulo powers of 3 conjectured by Lin (J. Number Theory,~2018). We then estimate the $3$-adic valuations of two-by-two determinants formed from consecutive coefficient vectors. These estimates yield two infinite families of internal congruences modulo high powers of $3$.

comments
24 pages
fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2611.15164 ↗

Let $k, a, c$ be positive integers, let $b$ be a nonnegative integer, and let $f$ be a nonvanishing complex-valued multiplicative function. Qian, Tan and Hong proved that $$G_f(n)=\frac{\prod\limits_{i=0}^k f(b+a(n+i c))}{f\left(\operatorname*{lcm}\limits_{0 \leq i \leq k}\{b+a(n+i c)\}\right)}$$ is periodic and asked for its least positive period. In this paper, we answer this problem by giving an explicit formula for this period in terms of finitely many values of $f$ at prime powers. In particular, we determine the least periods for $f(n)=σ_α(n)=\sum\limits_{d \mid n} d^α$ for every real $α$, and for $f(n)=n^{\varepsilon}$ for every real $\varepsilon$.

comments
12 pages
fields
Number Theory
pdf ↗ page arXiv:2611.15379 ↗

We prove that the cyclotomic field $K_{11}=\mathbb{Q}(ζ_{11})$ is unit reducible but not strongly unit reducible. So every nonzero principal fractional ideal of $K_{11}$ has a generator that is a shortest nonzero vector. For $I=h\mathcal{O}_{K_{11}}$, every shortest nonzero vector $α\in I$ satisfies $N_{K_{11}/\mathbb{Q}}(α/h)\in\{1,11\}$. The proof uses Sigrist's Hermite bound for cyclic forms and an averaging identity for cyclotomic units. For principal ideals in $K_{11}$, ideal-SVP and the shortest-generator problem are polynomial-time equivalent.

fields
Number Theory
pdf ↗ page arXiv:2611.15432 ↗

We find the correct order of magnitude for the number of $n\leq x$ having at least $r$ divisors in the interval $(y,2y]$, uniformly in a wide range of the parameters $x,y,r$.

comments
18 pages
fields
Number Theory
pdf ↗ page arXiv:2611.15534 ↗

Let $L_1,\dots,L_k\in \mathbb Z[x,y]$ be a system of linear polynomials whose homogeneous parts are pairwise linearly independent. Let $K=\mathbb Q(α)$ be an imaginary quadratic field. Utilizing the higher order Fourier analysis machinery of Green and Sawhney in their breakthrough work on the Gaussian prime conjecture, we show that if there are no local obstructions, then there are infinitely many $(x,y)\in \mathbb Z$ such that $L_1(x,y),\dots,L_k(x,y),$ and $N_{K/\mathbb Q}(x+yα)$ are simultaneously prime. We further establish an asymptotic formula which matches the prediction by the multivariate Bateman-Horn conjecture. We present two arithmetic applications of this prime counting result. First, we show that the Brauer–Manin obstruction is the only obstruction to weak approximation on a new family of varieties, including diagonal conic bundles all of whose degenerate fibres are defined over $\mathbb Q$ except one fibre that may be defined over an imaginary quadratic field. Second, we construct elliptic curves over $\mathbb Q$ with infinitely many quadratic twists of rank exactly two.

comments
74 Pages. Comments Welcome!
fields
Number Theory
pdf ↗ page arXiv:2611.16062 ↗

We prove that the integers form a Diophantine subset of the rational numbers. More precisely, there exist an integer $n\ge1$ and a polynomial $P\in\mathbb{Z}[T,W_1,\dots,W_n]$ of total degree at most four such that $q\in\mathbb{Q}$ is an integer if and only if $P(q,\mathbf w)=0$ for some $\mathbf w\in\mathbb{Q}^n$. Consequently, any recursively enumerable subset of $\mathbb{Q}^r$ is Diophantine, and Mazur's conjecture on the topology of rational points fails. The proof is inspired by OpenAI's work on Hilbert's tenth problem over $\mathbb{Q}$. It does not use the $2$-converse or the $2$-adic Fontaine–Mazur results announced and employed by OpenAI. We define the rational numbers with square denominator using rational points on certain quadratic twists of the congruent number elliptic curve. The criterion of Tian, Yuan and Zhang, in Smith's formulation, implies that these quadratic twists have analytic rank one. A height estimate for rational points on a fixed quotient of a Shimura curve allows us to express multiplication of elliptic-curve indices. We obtain this estimate by bounding the modular levels of the associated quaternionic abelian surfaces. The level bound is based on a compatible system of Galois representations over $\mathbb{Q}$ with controlled ramification and on Khare–Wintenberger's proof of Serre's conjecture. Green–Tao–Ziegler's theorem on linear patterns of primes supplies the rational solutions needed for a Diophantine model of integer arithmetic.

fields
Number Theory, Logic
pdf ↗ page arXiv:2611.16130 ↗

Let $\overline{t}^{(3)}(n)$ denote the number of overpartitions of $n$ in which consecutive parts differ by a multiple of $3$ unless the larger part is overlined, and the smallest part is overlined unless it is divisible by $3$. Using dissections of theta functions, we establish two infinite families of congruences modulo $32$ and $64$. We also obtain two residue formulas modulo $16$ and use them to derive four further infinite families of congruences modulo $16$. In particular, for every positive integer $M$ and nonnegative integer $n$, the residue of $\overline{t}^{(3)}(M^2(18n+12))$ modulo $16$ is $8$ if $6n+4$ is a square and $0$ otherwise.

fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2611.16145 ↗

We prove that for any sufficiently large odd integer $s$, there exist at least \[ 2.78 \, \sqrt{\frac{s \log\log s}{\log s}} \] irrational values among $ζ(3), ζ(5), \dots, ζ(s)$, where $ζ$ is the Riemann zeta function. This improves on the best known estimate by a constant factor times $\sqrt{ \log\log s}$. The proof combines the elimination technique and an arithmetic lemma of Fischler–Sprang–Zudilin, the hypergeometric constructions of Lai–Yu, and the Hankel determinant method that appeared in the proof that $ζ(5)$ is irrational posted by Fauzan on September 17, 2026.

comments
17 pages
fields
Number Theory
pdf ↗ page arXiv:2611.16156 ↗

Let $G$ be a $p$-adic Lie group and $k$ a field of characteristic $p$. We prove that a complex of smooth $k$-representations of $G$ has admissible cohomology if and only if it is globally admissible, i.e., its hypercohomology with respect to a torsion-free open compact pro-$p$ subgroup is finite dimensional in every degree. This extends the bounded-below and bounded-above comparison of Schneider–Sorensen to arbitrary unbounded complexes.

comments
8 pages
fields
Number Theory
pdf ↗ page arXiv:2611.16167 ↗

We study the top-weight sheaf $\mathcal W_n$ of linearly constrained Kloosterman sums over finite fields of odd characteristic, of rank $r(n)=2^n-\binom n{\lfloor n/2\rfloor}$. A local Fourier-transform analysis describes wild monodromy at infinity along rays through nonescaping critical points and their quadratic characters, giving explicit Swan conductors and the escape locus. The resulting stationary-phase description yields a ray-theoretic proof of the geometric determinant. A reflection pairing and a Frobenius calculation at the tame endpoint recover the arithmetic determinant $\det\mathcal W_n\simeq\mathcal L_ψ(-2^{n-1}λ^{-1}\sum_i h_i)\otimes\overline{\mathbb Q}_\ell(-(n+1)r(n)/2)$. We obtain reciprocity for exterior-power Frobenius traces, the exact distribution of normalized determinants, and spectral compression on symmetric loci. Assuming the ambient connected-monodromy theorem from companion work, we determine the monodromy of the geometric generic ray. Further results include bounds for complete exponential sums, conductor identities for selected parameter curves, and the Euler characteristic of the parameter torus. Rank-two boundary conormal calculations are separated from higher-codimension characteristic-cycle recursions, which remain conditional on explicit microlocal hypotheses.

comments
52 pages, 0 figures. Companion to arXiv:2610.03081 and arXiv:2610.04099
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2611.16254 ↗

We apply classical prime-power congruence criteria to two families of exponential series. For the Fibonacci numbers $F_n$, we characterize the polynomials \(P\in\Z[T]\) for which $\exp(\sum_{n\ge1}P(F_n)x^n/n)$ has integer coefficients: this holds if and only if $P$ is even and $P(0)\equiv P(1)\equiv P(2)\pmod5$. In particular, $5$ is the least positive multiplier for each positive even power of $F_n$, and the series with weights $5F_n^{2k}$ has degree $5^{k-1}$ over \(\Q(x)\) for $k\ge1$. For \(R_n(y)\in\Z[y]\) satisfying $R_{pn}(y)\equiv R_n(y)\pmod p$ for every prime $p$ and every $n\ge1$, we prove that $H(x,y)=\exp(\sum_{n\ge1}R_n(y)^n x^n/n)$ belongs to \(\Z[y][[x]]\) and that $A(x)=H(x,A(x))$ has a unique integral solution. For \(q\in \Z\), taking $R_n(y)=q^n+y$ proves the conjecture in OEIS A163138; the Fibonacci result proves the conjecture in A207969 and A207970. For the implicit family with indeterminate $q$, the coefficient of $x^n$ has degree $n^2$, leading coefficient $1/n$, and nonnegative integer coefficients in the binomial basis, for every $n\ge1$.

fields
Number Theory
pdf ↗ page arXiv:2611.16283 ↗

A rational map of degree at least two is postcritically finite (PCF) if every critical point has a finite forward orbit. For the unicritical family $f_{d,c}(z)=z^d+c$ with $d\ge2$, we call $c$ a PCF parameter if $f_{d,c}$ is PCF. As discussed by Baker and DeMarco, these parameters are analogous to $j$-invariants of elliptic curves with complex multiplication. For every $d\ge2$, we determine which PCF parameters lie in a CM field. The same list gives all PCF parameters over the maximal abelian extension of $\mathbb{Q}$. This extends the classifications of Noytaptim and Petsche over the maximal totally real extension of $\mathbb{Q}$ and of Ferraguti and Pagano over quadratic number fields. The proof uses the totally real classification in degree two, orbit bounds, Kronecker's theorem, Goksel's unit theorem, Lam–Leung's short-sum classification, cyclotomic averages, and known irreducibility results.

comments
16 pages, 1 figure
fields
Number Theory, Dynamical Systems
pdf ↗ page arXiv:2611.16354 ↗

We study exact recovery of the Hasse–Weil zeta numerator from repeated noisy observations of a randomized Euler product. For a genus-two curve over $\mathbb{F}_q$, we attach independent symmetric signs to its closed points and observe the logarithm of the resulting product at $t_q=c/\sqrt q$, where $0<c<1/\sqrt{12}$ is fixed. For every fixed, known additive noise density $f$ satisfying $\sqrt{f}\in H^1(\mathbb{R})$, we prove that the minimax number of independent observations required for exact recovery with error probability at most $δ$ has order $q^4\log(1/δ)$. No moment condition is imposed on the noise, so the result includes Cauchy readout. The upper bound estimates the phase of an empirical characteristic function and uses the separation of the integral Weil coefficients. The matching lower bound compares the full observation laws for two actual curves with ordinary, absolutely simple Jacobians. It combines a binomial comparison with a uniform bound on the closed-point tail. Thus access to the full observations does not improve the sample order attained by the phase estimator. The result concerns the information in a specified observation channel. It does not assume an efficient implementation of that channel.

fields
Number Theory, Statistics Theory
pdf ↗ page arXiv:2611.16358 ↗

We construct a p-adic height pairing for curves with split degenerate stable reduction over the prime p using the higher class field theory of Kato-Saito. We then show this pairing coincide with the standard Coleman-Gross p-adic height pairing when extended to the semistable reduction case using methods by Besser and Vologodsky.

fields
Number Theory
pdf ↗ page arXiv:2611.16379 ↗

In this paper, we will show that the positive integer triple $(k,l,m)$ satisfying the equation in the title is $(2,1,1).$

fields
Number Theory
pdf ↗ page arXiv:2611.16437 ↗

Let $X$ be a smooth projective curve of genus $g$ over an algebraically closed field $k$ of characteristic $p>2$. We give upper bounds for the $a$-number $a(X)$ when $X$ is hyperelliptic or, more generally, a tame cyclic cover of the projective line. For hyperelliptic curves, writing $g=pm+r$ with $0\le r<p$ and $n=(p-1)/2$, we prove the sharp bound $a(X)\le nm+\min\{n,r\}$. For tame cyclic covers, we refine previously known upper bounds and give curves attaining the resulting bound in infinitely many genera in characteristics $3$ and $5$. The proofs combine an alternating pairing on the bundle of locally exact differentials, originally due to Raynaud, with an explicit polynomial description of the Cartier operator. We also produce an explicit locus of hyperelliptic curves $X$ with $a(X)\ge a_g$, where $\frac{a_g}{g}$ converges to $\frac{p-1}{2p}$ as $g$ goes to $\infty$, whose dimension grows linearly with the genus $g$. These families exhibit excess intersections of the Torelli locus with loci of large $a$-number in the moduli space of principally polarized abelian varieties.

comments
16 pages. Comments are welcome
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2611.16449 ↗

The interval result of Evertse and Ferretti (2013) concerns a tuple $L$ of linear forms and one tuple $c$ of weights. It says that the parameters $Q$ for which the twisted height $H_{L,c,Q}$ has a small value outside an exceptional subspace $T(L,c)$ lie in $O(δ^{-2}\logδ^{-1})$ intervals $[Q_i,Q_i^ω)$. We prove this for a whole set $\mathcal{C}$ of weights with the same forms. At most $J$ subspaces $T(L,c)$ occur, where $J$ depends only on the dimension and on the number of places, and one family of $O(δ^{-2}\logδ^{-1})$ intervals serves every $c\in\mathcal{C}$ at once. Neither count depends on $\mathcal{C}$. In applications of Bugeaud-Evertse type the solutions are sorted into about $\varepsilon^{-1}$ classes with the same forms and different weights, and one application now serves all classes. We deduce three complexity bounds. For a real algebraic irrational number $ξ$, the number $p(n,ξ,b)$ of blocks of length $n$ in its base-$b$ expansion satisfies $\limsup p(n,ξ,b)/(n(\log n)^η)=\infty$ for every $η<1/2$; Bugeaud and Evertse proved this for $η<1/11$. The same holds for the continued fraction expansion of an algebraic number of degree at least three, and for the steering word of $(3/2)^n$. We explain why $1/2$ is the limit of the method. All results are machine-verified in Lean~4.

fields
Number Theory
pdf ↗ page arXiv:2611.16536 ↗

The Frobenius angles of non-CM elliptic curves and the Hecke angles of non-CM newforms are equidistributed with respect to the Sato–Tate measure, while for Kloosterman angles, this is known on average over natural families. We study the fluctuations around these laws in large families, for smooth test functions. We prove an unconditional central limit theorem for Frobenius angles of elliptic curves for a much larger class of test functions than previously considered; earlier results assumed the Riemann hypothesis for $L$-functions of Hecke eigenforms of full level. This result follows from a general framework, developed here, which yields Gaussian moments for statistics of sequences in $[0,1]$ varying over families. In this framework, independence is replaced by two quantitative conditions: approximate independence at distinct indices, and convergence of the family averages to the Weyl limits at a suitable rate. As further applications, we extend central limit theorems for Kloosterman angles and for Hecke angles of newforms to larger classes of test functions, the latter with the weight and the level varying simultaneously. We also treat the dilated angles $αθ$ for integers $α\geq2$, whose limiting distribution is uniform. Finally, we discuss sharp statistics, obtaining a central limit theorem for Hecke angles and explaining the obstruction for the other two families.

comments
50 pages
fields
Number Theory
pdf ↗ page arXiv:2611.16550 ↗

Using quartic Gauss sums in place of the cubic Gauss sums in OpenAI's original proof, we prove that the Dedekind $ζ$-function $ζ_{\mathbb Q(i)}(s)$ of $\mathbb Q(i)$ has no zeros in the half-plane $\Re s>599/600$, thereby obtaining the same zero-free half-plane for the Riemann $ζ$-function.We obtain the upper bound for the smoothed sum by applying Poisson summation twice and using the functional equation of the quartic Kubota series of angular weight $1$.In the Mellin representation, a zero-density bound for the family of quartic characters controls the terms from nonprincipal characters,and a residue and a lattice average over fourth powers give the main term.

fields
Number Theory
pdf ↗ page arXiv:2611.16665 ↗

For an odd prime $p,$ consider the affine varieties $X_k: \sum\limits_{i=1}^{k}(x_i+x_i^{-1})=0$ over the finite field $\F_p.$ In this paper, a key feature of our work is arithmetic interpretation between the higher power moments of Kloosterman sums, modular forms and arithmetic geometry of the varieties $X_5$ and $X_6$ through their rational point counts. Our main results provide two distinct explicit formulas for the point count $\#X_5(\F_p).$ In the first formula, we express $\#X_5(\F_p)$ in terms of Fourier coefficients of modular forms and a certain weighted average of fourth power twisted Kloosterman moments, where the average is taken over multiplicative characters. We further establish an identity expressing this weighted average of fourth power moment of twisted Kloosterman sums in terms of fifth power quadratic twisted Kloosterman moment, together with Fourier coefficients of modular forms. Moreover, we derive an independent expression for the same average with different weight directly in terms of Fourier coefficients of modular forms. In the second identity for $\#X_5(\F_p)$, we express this purely in terms of Fourier coefficients of two modular forms. Moreover, we express $\#X_6(\F_p),$ in terms of Fourier coefficients of three modular forms. For these two expressions of $\#X_5(\F_p)$ and $\#X_6(\F_p),$ our approach is based on an identity that relates the point counts of $X_k$ to the $k$-th power moments of Kloosterman sum and its quadratic twist.

fields
Number Theory
pdf ↗ page arXiv:2611.16713 ↗

Let $Γ\subset\mathrm{O}^+(n,2)$ be a rational arithmetic group with $n\geq 3$. A non-constant modular form for $Γ$ is called strongly reflective if its zero divisor is a reduced union of mirrors of reflections in $Γ$. We show that, up to conjugation and multiplication by a nonzero scalar, there are only finitely many strongly reflective modular forms. As a consequence, we establish the finiteness of holomorphic automorphic products of singular weight. These results answer a question posed by Borcherds in 1995 and settle a conjecture of Gritsenko–Nikulin from 1998. As an application, up to conjugation, we prove the finiteness of $Γ$ whose corresponding algebra of modular forms is freely generated. The key ingredient is a uniform upper bound on the covolume of $Γ$, obtained by adapting the higher-rank lattice convergence theorem of Abért et al. to the study of the degrees of reflective branch divisors.

fields
Number Theory
pdf ↗ page arXiv:2611.16819 ↗

When solving a number of additive problems with almost equal summands, along with estimating short trigonometric sums with primes of the form $$ S_k(α;x,y)=\sum_{x-y<n\le x}Λ(n)e(αn^k), $$ on the minor arcs, estimates of these sums on the major arcs are also needed, except in a small neighborhood of their centers, as well as an asymptotic formula in a small neighborhood of the center of the major arcs. In this paper, using the second moment of Dirichlet $L$-functions on the critical line, for $S_k(α;x,y)$ on the major arcs $\mathfrak{M}(\mathscr{L}^b)$, $τ=y^5x^{-2}\mathscr{L}^{-b_1}$, $\mathscr{L} =\ln xq$, except in a small neighborhood of their centers $|α-\frac{a}{q}|>\left(2πk^2x^{k-2}y^2\right)^{-1}$, for $y\ge x^{1-\frac{1}{2k-1+η_k}}\mathscr{L}^{c_k}$, $$ η_k=\frac{2}{4k-5+2\sqrt{(2k-2)(2k-3)}}, \qquad c_k= \frac{2A+22+\left(\frac{2\sqrt{2k-3}}{\sqrt{2k-2}}-1\right)b_1}{2\sqrt{(2k-2)(2k-3)}-(2k-3)}, $$ a nontrivial estimate of the form $$ S_k(α;x,y)\ll y\mathscr{L}^{-A}, $$ is obtained, where $A$, $b_1$, $b$ are arbitrary fixed positive numbers, and an asymptotic formula is proved in a small neighborhood of the centers of the major arcs.

comments
Revised version of the article. 18 pages
journal
Chebyshevskii Sbornik, 2021, Volume 22, Issue 4, Pages 200-224
fields
Number Theory
pdf ↗ page arXiv:2611.16828 ↗

Let $p$ be an odd prime, $a,m\in\Bbb Z_{(p)}$ and $a(a+1)m\not\equiv 0\pmod p$. In this paper, we deduce the congruence for $(\sum_{k=0}^{p-1}\frac{\binom{2k}k\binom ak\binom{-1-a}k}{m^k}) (\sum_{k=0}^{p-2}\frac{\binom{2k}k\binom ak\binom{-1-a}k}{m^k(k+1)})$ modulo $p^3$. As applications we obtain many congruences for \begin{align*}&\sum_{k=0}^{(p-1)/2}\frac{\binom{2k}k^3} {m^k(k+1)^r},\quad \sum_{k=0}^{p-2}\frac{\binom{2k}k^2\binom{4k}{2k}}{m^k(k+1)^r}, \quad \sum_{k=0}^{p-2}\frac{\binom{2k}k\binom{3k}k\binom{6k}{3k}} {m^k(k+1)^r}\quad(r=1,2,3) \\&\sum_{k=0}^{(p-1)/2}k^j\frac{\binom{2k}k^3} {m^k},\quad \sum_{k=0}^{p-1}k^j\frac{\binom{2k}k^2\binom{4k}{2k}}{m^k}, \quad \sum_{k=0}^{p-1}k^j\frac{\binom{2k}k\binom{3k}k\binom{6k}{3k}} {m^k}\quad(j=2,3) \end{align*} modulo $p^3$, which confirm the author's conjectures and improve previous results modulo $p^2$.

comments
36 pages
fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2611.16834 ↗

We study the action of vector fields on the Drinfeld symmetric spaces on de Rham classes of the generic Drinfeld module. The resulting Kodaira-Spencer map is an isomorphism, and is described by the Jacobian matrix \(J := (\frac{\partial g_{j}}{\partial ω_{i}})_{1 \leq i,j \leq r}\), where the \(g_{j}\) are the basic coefficient modular forms of rank \(r\). We show that \(J\) is the matrix inverse of the period matrix \(P\) that results from the de Rham theory of Drinfeld modules. We define the notion of Drinfeld modular differential form, which generalizes the transformation behavior of Drinfeld modular forms from functions to differential \(n\)-forms on the Drinfeld symmetric space \(Ω^{r}\). The algebra \(\mathbf{M}^{(*)} = \bigoplus_{0 \leq n < r} \mathbf{M}^{(n)}\) of all such is provided with a Serre derivation \(D \colon \mathbf{M}^{(n)} \to \mathbf{M}^{(n+1)}\) from \(n\)-forms to \((n+1)\)-forms, where \(\mathbf{M}^{(0)} = \mathbf{M}\) is the algebra of customary modular forms for \(\mathrm{GL}(r, \mathbb{F}_{q}[T])\). We determine the structure of \(\mathbf{M}^{(*)}\), which turns out to be the exterior algebra \(\bigwedge (\mathbf{M}^{(1)})\) of the \(\mathbf{M}\)-module \(\mathbf{M}^{(1)}\).

comments
43 pages. Comments welcome!
fields
Number Theory
pdf ↗ page arXiv:2611.16909 ↗

We introduce lower-truncated $p$-adic multiple zeta-star values and construct their harmonic regularizations. We show that they are independent of the branch of the $p$-adic logarithm and satisfy harmonic product relations. We express finite multiple harmonic sums as alternating convolutions of harmonic-regularized $p$-adic multiple zeta values and lower-truncated $p$-adic multiple zeta-star values. This gives a $p$-adic analogue of the classical truncation identity, which reduces to the inversion relation between ordinary and star harmonic-regularized values when the truncation point is $1$. For truncation point $p$, it relates finite multiple zeta values to $p$-adic multiple zeta values.

comments
13 pages
fields
Number Theory
pdf ↗ page arXiv:2611.16923 ↗

Let $q$ be a prime power and let $\ell$ be a divisor of $q-1$. We classify the permutation polynomials of $\mathbb F_q$ of polynomial index exactly $\ell$ up to quasi-multiplicative equivalence $G(X)\equiv uF(vX^d)\pmod{X^q-X}$, where $u,v\in\mathbb F_q^*$ and $\gcd(d,q-1)=1$, and we count the classes. For polynomials vanishing at $0$, the classes are the orbits of an explicit finite group on vectors of values at the $\ell$-th roots of unity. Through the permutation it induces on the roots of unity, each orbit lies over a double coset of the symmetric group $S_\ell$ with respect to its translation subgroup and an explicit affine group, and the stabilizers are explicit. For polynomials with nonzero constant term the action is free. Burnside's lemma, Möbius inversion over the coefficient support and congruences along the cycles of affine permutations give an exact formula for the number of classes. For fixed $\ell\geqslant2$ these numbers are quasi-polynomials in $s=(q-1)/\ell$ of degree at most $\ell-1$, with period dividing $\ell$ for odd $\ell$ and $2\ell$ for even $\ell$; for polynomials vanishing at $0$ the degree is exactly $\ell-1$, and we determine the leading coefficient. For odd prime $\ell$ and for $\ell=4$ the counts are given in closed form. For index four we also count the binomials and trinomials at each admissible coefficient support. The sums of two binomial counts that occur are expressed through quartic Jacobi sums and Frobenius traces of elliptic curves and of a curve of genus two; one of the elliptic curves is the reduction of the curve $Y^2=X^3+8X^2+32X$, which has no complex multiplication over $\mathbb Q$. The trinomial counts are expressed through quartic cyclotomic numbers and these sums. All these terms cancel when the counts with a fixed residue of the vanishing order modulo $s$ are added.

comments
30 pages
fields
Number Theory
pdf ↗ page arXiv:2611.16944 ↗

We give a Diophantine definition of the integers in the rational numbers conditional on the $abc$ conjecture, Dickson's conjecture, and finiteness of $2$-primary parts of Shafarevich–Tate groups. We also discuss some consequences of the existence of a Diophantine definition of the integers in the rational numbers. The goal of this work is to serve as an entry point to recent developments around Hilbert's tenth problem for the rational numbers.

comments
Comments and feedback are welcome
fields
Number Theory, Logic
pdf ↗ page arXiv:2611.17124 ↗

We study the multidimensional polynomial Szemerédi theorem over prime fields. Let $P_1,\dots,P_m\in\F_p[t]^k$ be block independent vector polynomials of degree at most $d$, with $P_i(0)=0$ for every $i$. We prove that there is a constant $c=c(k,m,d)>0$ such that, for every sufficiently large prime $p$, every set $A\subset\F_p^k$ with $|A|\ge p^{k-c}$ contains a configuration $x,x+P_1(t),\dots,x+P_m(t)$ with $t\in\F_p\setminus\{0\}$.

fields
Number Theory, Classical Analysis and ODEs, Combinatorics
pdf ↗ page arXiv:2611.17136 ↗

Let $f=E_1(χ_1,χ_2)$ be an irregular Eisenstein series of weight one, that is, with $χ_1(p)=χ_2(p)$, and consider the generically cuspidal ordinary family passing through it. When $χ_1$, $χ_2$ and $χ_1χ_2^{-1}$ are primitive of the same conductor, we show that the specialization at $f$ of the modular-symbol $p$-adic $L$-function of this family, with periods taken in the cohomology of the compactified modular curves, factors as a product of two Kubota–Leopoldt $p$-adic $L$-functions attached to $χ_1$ and $χ_2$. Since there are no complex critical values in weight one, the factorization is obtained directly from the cohomological construction: we compute the tame-twisted modular measure by means of the localized Sharifi map and explicit reciprocity, and show that tame twisting identifies the compact period modules at weight one. This gives a weight-one analogue of the factorization of Bellaïche–Dasgupta for critical-slope Eisenstein series. As applications, and under explicit specialization hypotheses, we compare Kato classes with circular units, Heegner classes with elliptic units, and diagonal cycles with Kato classes through two successive Eisenstein degenerations. We also discuss the passage from compact to open periods, and include an exposition of the congruence and degeneration methods underlying these comparisons.

comments
51 pages, comments welcome
fields
Number Theory
pdf ↗ page arXiv:2611.17210 ↗

We prove that all mod $2$ Galois representations of a global field lift modulo $4$. In contrast, for every odd prime $p$, we exhibit examples of global Galois representations modulo $p$ that do not lift modulo $p^2$. Our methods also allow us to prove liftability of generalized quaternion groups and hence to complete the classification of liftable finite groups initiated by Khare and Merkurjev.

comments
26 pages
fields
Number Theory
pdf ↗ page arXiv:2611.17255 ↗

Algebraic Geometry37

We study nonreduced critical schemes with prescribed support on nilpotent orbit closures and on the Kleinian singularity $\mathbb C^2/\mathbb Z_n$, and show that one specified minimal invariant syzygy among the first jet equations fixes their scheme structure. For $\mathfrak g=\mathfrak{sl}_N$ or $\mathfrak{so}_{2N}$ with Coxeter number $h$ and $p\ge2$ coprime to $h$, the selected polynomial is the coefficient of $s^{p+1}$ in $\det(1-sM)^{p/h}$, with reduced critical locus $\{M^p=0\}$, and the selecting syzygy is equivalent to the twisted period equation of Dubrovin and Feigin-Silantyev. The minimal invariant syzygies of that degree correspond to the lowest nonquadratic twisted periods, which, for $\mathfrak{so}_8$, form the standard representation of triality; in type D the Betti number alone does not determine the scheme. On $\mathbb C^2/\mathbb Z_n$, the selected polynomial is given by a terminating hypergeometric series. Restriction to Slodowy slices commutes with forming critical schemes and their nilradicals. These results determine, uniformly in rank and degree, the rings and nilradical filtrations through which the Schur and Macdonald indices of the corresponding Argyres-Douglas theories are proposed to arise as Hilbert series of arc spaces.

comments
36 pages + references, 6 tables
fields
Algebraic Geometry, Commutative Algebra, Representation Theory
pdf ↗ page arXiv:2611.14631 ↗

We prove that freeness is determined by the intersection lattice for arrangements of seventeen lines in the complex projective plane. The proof reduces a possible counterexample to smaller arrangements whose realisation spaces can be computed. A minimal logarithmic derivation defines a foliation; its inflection divisor and a local singularity count imply that the non-free member of a counterexample is nearly free with exponents $(7,10)$. Deleting four lines then produces a thirteen-line arrangement whose second Chern class is controlled by a combinatorial deficit. When the deficit is four, the remaining arrangement is free with exponents $(6,6)$. An exact covering argument places the necessary thirteen-line cores in four finite classes, containing $3{,}829{,}691$ lattices. We compute their realisation spaces and reconstruct all relevant seventeen-line extensions, including specialisations of positive-dimensional families. Among the candidate lattices, exactly sixteen admit a non-free realisation; they are rigid and have no free realisation. Together with the known cases, this establishes Terao's conjecture for central arrangements of at most seventeen planes in $\mathbb{C}^3$.

comments
27 pages, 3 tables
fields
Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:2611.14689 ↗

We study how many polarized anti-invariant factors of the intermediate Jacobians of smooth Eckardt hyperplane sections determine a cubic fourfold with a symplectic involution. In rank three, the equation is determined by its fixed cubic surface and a conic in the dual projective space. The Torelli theorem of Casalaina-Martin–Zhang recovers the surface together with one plane section from each factor. When the surface has no automorphisms, these planes can be compared in a common dual space, and reconstruction reduces to classical conic interpolation. Five factors suffice without parameter data, and four suffice with their ordered parameter configuration; both bounds are sharp. In rank two, we construct two-dimensional families of pairwise nonisomorphic equivariant fourfolds with the same entire unparametrized Prym image. For a fixed fourfold, we also show that the closure of the anti-invariant factor family in an associated OG10 compactification is an integral projective Lagrangian subvariety.

comments
17 pages, comments are welcome!
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.14747 ↗

We fully characterize piecewise-regular functions on nonsingular real algebraic varieties in terms of continuous quasirational functions. We also obtain extension theorem for piecewise-regular functions defined on closed semialgebraic subsets of $\mathbb{R}^n.$

comments
29 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.15034 ↗

Let \(X\) be a smooth projective complex variety with a boundary divisor \(Δ=\sum_{i=1}^s(1-1/m_i)D_i\) of simple normal crossings support and integers $m_i$. We prove that, if \(-(K_X+Δ)\) is nef and big, then \((X,Δ)\) is Campana rationally connected. We do this by constructing a free Campana rational curve whose class lies in the interior of the nef cone of curve classes and whose contacts with \(D_i\) have order \(m_i\) and avoid deeper strata. We construct such a curve from a free Campana curve by attaching to it free rational curves which intersect positively with divisors that span the cone of effective divisors, and smooth the resulting comb.

comments
21 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.15191 ↗

We describe the Nonabelian Hodge Theory correspondence in positive characteristic between nilpotent Higgs bundles and flat bundles with nilpotent p-curvature, as constructed in the seminal paper by Ogus-Vologodsky, in the special case of rank-2 vector bundles over a smooth projective curve. In this set-up we can rephrase this correspondence as a shift of the extension class of a rank-2 vector bundle by a cohomology class encoding a W_2-lift of the curve. As an application, we obtain that a general rank-2 vector bundle of degree 0 admits a connection with non-zero nilpotent p-curvature.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.15312 ↗

We exhibit examples of K-stable Fano varieties with obstructed qG-deformations; more precisely, their miniversal qG-deformation spaces can be non-reduced. As a consequence, we show that both the K-moduli stack and the K-moduli space can be non-reduced, and hence non-smooth, at points corresponding to K-stable Fano varieties.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.15330 ↗

Let $k$ be a field of characteristic $p>0$, $K/k$ a field extension, $X$ a geometrically reduced connected scheme proper over $k$, and $x\in X(k)$. We study when the natural homomorphism $π^{Loc}(X_K,x_K)\rightarrowπ^{Loc}(X,x)_K$ is an isomorphism. If $\mathcal C^{Loc}(X)$ is saturated, then it is an isomorphism for every algebraic extension $K/k$. If $π^{Loc}(X,x)$ is finite, then it is an isomorphism if $K/k$ is purely transcendental or $k$ is algebraically closed. Combining these results, if $\mathcal C^{Loc}(X)$ is saturated and $π^{Loc}(X,x)$ is finite, then the natural homomorphism $π^{Loc}(X_K,x_K)\rightarrow π^{Loc}(X,x)_K$ is an isomorphism. As an application, if $X_{\bar k}$ is smooth and rationally chain connected, then the natural homomorphism $π^{Loc}(X_K,x_K)\longrightarrowπ^{Loc}(X,x)_K$ is an isomorphism.

comments
8 pages. Comments welcome!
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2611.15643 ↗

We establish a period comparison for a two-dimensional rational Hodge summand of type $(3,0)+(0,3)$ in a smooth projective threefold over $\mathbb Q$ with $h^{3,0}=1$. Given an algebraic projector onto the summand and a correspondence whose action on the motive of a rational weight-four newform is nonzero after projection to the summand, restriction to the holomorphic de Rham lines identifies motivic morphisms with maps between these lines. Fixing rational generators of the holomorphic de Rham lines determines a unique isomorphism of homological motives. Its Betti realization then yields an exact relation between geometric periods and two critical modular $L$-values. For the Fermat sextic, we construct the correspondence over $\mathbb Q$ and compute its Betti and de Rham actions, determining the scale from algebraic traces and cup-product pairings. Critical-value evaluations and, under mirror comparison and explicit continuation hypotheses, a continued genus-zero Gromov–Witten partition identity follow as corollaries.

comments
36 pages. Comments are welcome
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2611.15696 ↗

We prove that a very general quartic hypersurface of any positive dimension over an uncountable algebraically closed field of characteristic different from 2 does not admit an integral decomposition of the diagonal, and in particular it is not stably rational.

comments
23 pages
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2611.15702 ↗

Lissajous varieties are affine algebraic varieties parametrized by sine and cosine functions. They generalize algebraic Lissajous curves in the plane to higher dimensions by applying a component-wise trigonometric map to a rational affine subspace and are motivated by applications in dynamical systems (Kuramoto model) and semidefinite optimization (graph elliptopes). We establish several algebraic and geometric properties of Lissajous varieties. In particular, we show that intersections of Lissajous varieties are finite unions of such varieties and describe them explicitly. We investigate algebraic properties of the defining polynomials of Lissajous hypersurfaces and describe the singular locus of Lissajous varieties.

comments
24 pages, 8 figures
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.15725 ↗

We seek space-filling hypersurfaces of a projective space over a finite field. They are hypersurfaces contain all rational points. The main goal is to construct a smooth space-filling hypersurface of minimal degree. For each projective space over a finite field, we find a lower bound of the minimum degree of space-filling hypersurface, and construct an example without any singular rational points. Finally, over an odd-dimensional projective space or for fields of characteristic two, we provide a construction of a smooth space-filling hypersurface of minimal degree.

comments
19 pages, an REU project at Fordham University
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.15768 ↗

Eisenbud and Schreyer proved that the cohomology table of a vector bundle $F$ on $\mathbb{P}^n$ is a unique positive combination of supernatural tables along a chain of root sequences. The slopes of the pieces, weighted by their ranks, form a concave polygon $Ψ_F$, the Boij-Söderberg polygon, with the same endpoints as the Harder-Narasimhan polygon $P_F$. We prove that $P_F\leqΨ_F$, in any characteristic, by testing subsheaves against sheaves with pure resolutions on thickened lines; the bound is optimal among bounds depending only on the ray of the table. The chain majorizes every other supernatural decomposition, and $Ψ$ is monotone under cancellations, hence upper semicontinuous in flat families. The comparison extends to coherent sheaves and, by linear projection, to sheaves of positive dimension. On $\mathbb{P}^2$ the defect is a sum of four cohomological terms; we characterize equality and show that the inequality survives the large volume limit of Bridgeland stability. For a smooth projective variety $X$ of dimension $n\geq2$ in characteristic zero, with $H$ ample and base-point-free, the mean normalized squared spread $G(\mathcal{E})$ of the roots in the cohomology table of every vector bundle $\mathcal{E}$ satisfies $G(\mathcal{E})\geq(K_X^2-2c_2(X))\cdot H^{n-2}/((n+1)H^n)$, a bound independent of $\mathcal{E}$. Since $G(\mathcal{E})=1$ exactly for arithmetically Cohen-Macaulay bundles, when this bound exceeds $1$ it is a uniform form of their absence.

comments
46 pages
fields
Algebraic Geometry, Commutative Algebra
pdf ↗ page arXiv:2611.15790 ↗

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, Θ)$ satisfies that $I_X(2Θ)$ 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 algebraic-geometry proof by Arbarello-Codogni-Pareschi in \cite{ACP21, ACP25} of Novikov's conjecture, which characterizes Jacobians via the KP equation.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.15799 ↗

We prove the existence of certain steps of the minimal model program for projective morphisms between complex analytic spaces in the semi-log canonical case, generalizing results of Ambro and Kollár. This is obtained by providing a sufficient criterion for the finite generation of the relative log canonical algebra. As a consequence, we prove demi-normal analogues of results of Hacon–Xu and Birkar. As a further application, we derive the existence of crepant semi-dlt modifications of analytic slc pairs whose irreducible components are normal in codimension 1, extending a result of Hashizume. The methods are new even in the algebraic case, providing streamlined proofs of the algebraic counterparts to the statements proved in this work, without relying on Kollár's gluing techniques.

comments
43 pages. This paper substantially extends and supersedes the author's earlier algebraic preprint, arXiv:2609.36018v1
fields
Algebraic Geometry, Complex Variables
pdf ↗ page arXiv:2611.15899 ↗

We study the birational relationship between cubic fourfolds and Verra fourfolds, which are double covers of the product of two projective planes. We show that in?nitely many divisors in the moduli space of cubic fourfolds containing a plane parametrize cubic fourfolds birational to Verra fourfolds. Our approach relies on the geometry of quadric surface bundles and their associated K3 surfaces, together with the study of Brauer classes. We also investigate two particularly interesting families, providing explicit geometric descriptions and equations for the associated varieties. In one case, the cubic fourfolds have two planes and the two projections from these planes directly show the existence of birational isomorphisms with Verra fourfolds.

comments
23 pages, Comments welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.15908 ↗

We construct a smooth projective Calabi–Yau threefold $X_5$ over $\mathbb F_5$ with $b_3(X_5)=0$ and $b_2(X_5)=31$. Consequently, $X_5$ has no smooth proper lifting to characteristic zero, including over ramified bases. To our knowledge, this is the first smooth projective Calabi–Yau threefold with this property in characteristic $p>3$. The threefold is a crepant resolution of the Kummer quotient of the self-fiber product of a rational elliptic surface. We prove the vanishing of its third Betti number by semistable reduction and point counts. A birational double-octic model gives a direct obstruction to lifting to the ring of Witt vectors of length two, through an explicit inconsistent system of linear equations for the branch data. We also determine the Hodge and crystalline cohomology: the threefold is infinitesimally rigid, its crystalline cohomology is torsion-free, and its third de Rham cohomology vanishes. Its Hodge-de Rham spectral sequence has exactly two nonzero differentials, both of rank one on the second page.

fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2611.15943 ↗

In this paper, we study the geometry of certain affine Springer fibers. In particular, we generalize the construction of Lusztig in "Remarks on affine Springer fibres" to identify a locally closed subvariety in terms of some Lagrangian in the resolution of the nilpotent Slodowy slice. We use this description to prove some geometric properties of these affine Springer fibers, including existence of affine pavings and equidimensionality of affine Spaltenstein varieties.

fields
Algebraic Geometry, Representation Theory
pdf ↗ page arXiv:2611.15962 ↗

For K3 surfaces of BHK type, there are two versions of mirror symmetry that might be applied, namely BHK mirror symmetry and LPK3 mirror symmetry of Dolgachev, which involved choosing a polarizing lattice. It has been conjectured that for a pair of BHK mirror K3 surfaces, one can choose a polarizing lattice as the invariant lattice of some nonsymplectic diagonal symmetry. We provide a counterexample, showing that LPK3 mirror symmetry cannot be realized by polarizing surfaces by the invariant lattice of a diagonal symmetry. However, in our example the polarizing lattice can be realized as the invariant lattice of a permutation symmetry.

comments
26 pages, 7 figures
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.15986 ↗

We study the derived categories of matrix factorizations for certain toric Landau–Ginzburg models that are mirror dual to del Pezzo surfaces and Fano threefolds. Some of these models have non-isolated singularities: their critical loci may contain curves and surfaces, possibly with intersecting irreducible components. We handle these cases by studying the potential in the formal neighborhood of each irreducible component of the critical locus. Away from $\operatorname{Sing}(\operatorname{CritLoc}(W)_{\mathrm{red}})$, we construct global formal coordinates and determine the local normal form of the singularity. Near the singular or intersection strata, we analyze how the pieces of the whole connected formal neighborhood are related by localization. This gives explicit decompositions of the derived categories of matrix factorizations after idempotent completion. For the five rank-one pairs $(B_d,V_{4d+2})$, we also compare projective compactifications. The isolated sectors and central-component counts agree for $d=2,3,4,5$ and differ for $d=1$. Equivalence of the distinguished compactified contributions for the remaining matched pairs requires compatible global gluing data or compactified Homological Mirror Symmetry.

comments
78 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.16030 ↗

We introduce a new class of toric varieties which admit an HKKN stratification compatible with the combinatorics of the GKZ fan. This class includes all smooth projective toric varieties of Picard ranks 1 and 2. We show that the grade restriction windows due to Halpern-Leistner and Ballard–Favero–Katzarkov arising from our HKKN stratifications agree with the intrinsic window categories appearing in work of Ballard–Berkesch–Brown–Cranton Heller–Erman–Favero–Ganatra–Hanlon–Huang. On the other hand, we provide an example of a smooth projective toric DM stack where this intrinsic window is never a grade restriction window despite the many possible choices. As an application, we demonstrate that reordering and/or taking a subset of an HKKN stratification sometimes changes the grade restriction window and sometimes does not.

comments
69 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.16034 ↗

Building on Liu's and Liu–Sheshmani's systematized description of Kontsevich's localization methods in toric varieties, we develop a computational framework for genus-zero Gromov–Witten invariants of smooth projective toric varieties and their smooth complete intersections. This is grounded in equivariant localization and the combinatorial structure of toric fans. We describe how the geometric data required by the localization formulas can be recovered directly from the fan and extend the existing software for flag varieties to compute the small quantum multiplication by the first Chern class. The implementation also incorporates cyclic determinants and regularized-exponent multisets, providing computational tools for investigating the atomic decomposition of quantum cohomology. Using this framework, we obtain the nonrationality of every smooth complete intersection of a quadric and a cubic in $\mathbb{P}^5$. Also applying new methods to study Hodge atoms in Fano fivefolds, we recover the nonrationality of every smooth complete intersection of a quadric and a cubic in $\mathbb{P}^7$, due to Cavenaghi–Katzarkov–Kontsevich, and we prove the nonrationality of every smooth quartic double fivefold and every smooth quartic fivefold.

fields
Algebraic Geometry, Differential Geometry, Symplectic Geometry
pdf ↗ page arXiv:2611.16068 ↗

We characterize products of projective spaces and smooth quadrics using Schur functors and positivity of vector bundles. First, we obtain characterizations of projective spaces and smooth quadrics using positivity of arbitrary Schur functors of extensions of a unipotent bundle by the tangent bundle, generalizing several existing results. We then prove that almost nef regular foliations whose direct sum is a subbundle of the tangent bundle determine a product decomposition, if the corresponding Schur functors admit suitable positive Schur submodules. For smooth weak Fano varieties similar results are obtained by replacing almost nefness and individual integrability of the foliations by the integrability of their total image. As special cases, we obtain product analogues of well-known characterizations of projective spaces and quadrics.

comments
42 pages. Comments welcome!
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.16529 ↗

We construct a 4-dimensional family of projective hyperkähler fourfolds of Kummer type. A general member of this family can be described as an irreducible component of a complete intersection of Heisenberg-invariant cubics in an 8-dimensional projective space. Several properties of the corresponding moduli space are also obtained. Our arguments rely on specializing to the case of generalized Kummer fourfolds of genus-two Jacobians, and make use of classical results dating back to Burkhardt and Coble.

comments
29 pages, 1 figure
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.16593 ↗

We use a highly parallelized backtracking algorithm implemented in CUDA to enumerate every compatible collection of Harnack splits in degrees eight and nine. By a theorem of Haas (1997) this yields every maximal T-curve. In this way, we find that exactly 38 real schemes of real plane algebraic curves of degree eight with 22 real components and 225 of degree nine with 29 real components are realized by combinatorial patchworking.

comments
10 pages, 2 figures
fields
Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:2611.16659 ↗

We study the category of bounded complexes of finite sums of indecomposable injectives over a locally Noetherian scheme, which we call the immaculate complexes. We show that regularity and finiteness of dimension can be detected from this category using strong generation. Our methods involve studying when the unbounded derived category of a Grothendieck category is strongly generated by injectives. As applications we prove a conjecture of Hartshorne and recover a result of Keller and Krause. To any specialisation closed subset we associate a semi-orthogonal decomposition of the immaculates and use this to compute additive finitary invariants in terms of the completions of the local rings. The immaculates are equivalent to the perfect derived category of a left coherent preadditive category i.e. a ring with many objects and we compute this category for one-dimensional integral or Gorenstein schemes.

comments
Comments welcome
fields
Algebraic Geometry, Commutative Algebra, K-Theory and Homology
pdf ↗ page arXiv:2611.16680 ↗

We study inequalities between symmetric functions that hold in every number of variables. First, we prove that it is undecidable whether a symmetric function with rational coefficients is nonnegative in all dimensions, answering a question posed by Acevedo, Blekherman, Debus and Riener. As a consequence, the validity of dimension-free moment criteria for entanglement in quantum information is undecidable. Second, we present a homogeneous symmetric function of degree 8 which is positive definite in every dimension but admits no sum of squares multiplier that is uniform in the number of variables. Consequently, Artin's solution of Hilbert's 17th problem and the Krivine-Stengle Positivstellensatz have no any-dimensional analog and any-dimensional Positivstellensätze asked for by Levin and Chandrasekaran cannot hold in general.

comments
17 pages, comments welcome
fields
Algebraic Geometry, Optimization and Control
pdf ↗ page arXiv:2611.16690 ↗

We compute projective degrees of composition loci for polynomial and rational maps of the projective line. For normalized polynomials of degree $rs$ with a right composition factor of degree $s$, a projective-bundle construction gives the degree $S(r+s-2,r)$. We extend this calculation to composition chains, and obtain $S(r+s-1,r)$ in the uncentered normalization used for decomposable interpolation. For rational maps, a Grassmann-bundle model gives a Plücker degree formula and an interpretation by prescribed critical points. We relate these loci to factorization of the Bezoutian in the ring of symmetric polynomials, where factors correspond to monodromy orbits on unordered pairs. Fried's polynomial criterion then determines the invariant reducibility locus. For rational maps we determine its composition components when a marked pole fiber has exactly one ramified point and at least one unramified point. The qualitative equivalence between finite full orbits and a first integral is already known. We give a direct proof from forward stabilization, with an explicit test using bounded forward orbits and with quotient fibers identified at every point. We also determine when absolute and invariant irreducibility differ and give a growth formula for a class of translation correspondences.

comments
35 pages
fields
Algebraic Geometry, Dynamical Systems
pdf ↗ page arXiv:2611.16763 ↗

We establish a version of Okounkov's conjecture on multiple $q$-zeta values arising from integrals over Hilbert schemes of points on smooth projective surfaces. We prove that normalized generating series of integrals involving products of Chern characters of tautological bundles belong to the algebra $\mathcal Z_q$ of multiple $q$-zeta values, without restrictions on the canonical class of the surface. The proof combines vertex-operator methods with a reduction to graph sums, whose arithmetic structure is governed by the cohomology of the surface. We also derive a closed universal formula for the Chern character operators acting on the cohomology of Hilbert schemes by solving a system of differential equations arising from Lehn's commutator relations.

comments
44 pages
fields
Algebraic Geometry, Quantum Algebra
pdf ↗ page arXiv:2611.16768 ↗

Let $k$ be an algebraically closed field of not necessarily characteristic $0$, and $d,n$ be integers $\ge 2$. We first formulate the dynamical moduli spaces of rational functions defined over $k$ in terms of the intrinsic reduction data of non-archimedean rational functions. As an application, we show that the locus $C_{d,n}$ of semistable intrinsic reduction data in degree $d$ whose $n$th iteration is defined and unstable is of codimension $d$ in the intrinsic reduction data space of degree $d$, settling a conjecture of Kiwi and Nie, and show that the image of $C_{d,n}$ in the compactified dynamical moduli $\overline{\mathrm{M}}_{d,k}$ is of dimension $\le d-2$ and the equality holds precisely either if $d$ is even or if $d\ge 5$ is odd and $(4/d)^n<1/(d-3)$ and determine the dimensions even for all the five exceptional pairs $(d,n)$, in addition describing the images of $C_{3,n}$ themselves. We also determine the indeterminacy of iterate maps either on the intrinsic reduction data spaces or on the compactified dynamical moduli spaces.

comments
22 pages
fields
Algebraic Geometry, Complex Variables, Dynamical Systems
pdf ↗ page arXiv:2611.16784 ↗

We study Chern characteristic classes of normal vector bundles of complex generalized flag submanifolds $G_{n-1}/P_{n-1}$ in complex generalized flag manifolds $G_n/P_n$. This procedure can be regarded as the relative version of Schubert calculus for the pair $G_{n-1}/P_{n-1}$ and $G_n/P_n$. The CW structure and additive structure of the cohomology of $\mathrm{Gr}(n, k)$ allows inductive calculation of Chern classes of the canonical and complementary canonical vector bundles over $\mathrm{Gr}(n, k)$. The combination of representation theory and algebraic geometry allows to derive analogous properties for the isotropic Grassmannians $\mathrm{LGr}(m, k)$ and $\mathrm{OGr}(m, k)$ via their embeddings in $\mathrm{Gr}(m, k)$. Then the induced CW structure yields the additive structure on the cohomology of $\mathrm{LGr}(m, k)$ and $\mathrm{OGr}(m, k)$, and consequently leads to the calculation of Chern classes of the canonical and complementary canonical vector bundles over $\mathrm{LGr}(m, k)$ and $\mathrm{OGr}(m, k)$.

fields
Algebraic Geometry, Algebraic Topology, Differential Geometry, Representation Theory
pdf ↗ page arXiv:2611.16837 ↗

We prove that for every nonempty smooth projective variety $X$ over an arbitrary field and every Brauer class $α$, the twisted derived category $D^b(X,α)$ admits a Bridgeland stability condition with full numerical support. Based on Chunyi Li's construction and its extension to arbitrary fields, we establish uniform phase control under tensoring by an Azumaya algebra and calibrate the resulting slicing to the induced central charge. We further show that the constructed stability condition is geometric and satisfies a mass–Hom bound, which persists throughout its connected component.

comments
26 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.16953 ↗

We exhibit a congruence subgroup $Γ\subset\operatorname{SL}(2,\mathbb{Z})$ of level $120$ and index $23040$ whose modular curve $X_Γ$ has genus $1777$ and whose Jacobian is isogenous over $\overline{\mathbb{Q}}$ to a product of elliptic curves. This surpasses the previous record of a completely decomposable complex Jacobian of dimension $1297$ found by Ekedahl and Serre in $1993$.

comments
17 pages, comments welcome!
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2611.16963 ↗

In this paper, we study the properties of the real log canonical threshold $\text{rlct}(X,Y)$ associated with a pair $(X,Y)$ and the real log canonical thresholds with signs $\text{rlct}^{\pm}(f)$ associated with a polynomial function $f: \mathbb{R}^d \to \mathbb{R}$. In particular, we relate these invariants to other invariants arising from the theory of motivic integration. We also show how to compute these invariants in several particular cases, including the Newton non-degenerate case and the case of analytically irreducible plane curve germs.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.17004 ↗

We study quasi-isometry classes of automorphism groups of K3 surfaces using Sierpiński spaces. We introduce K3 surfaces of Sierpiński type and prove that their limit sets are round Sierpiński spaces. For such K3 surfaces, the quasi-isometry class of the automorphism group is equivalent to the rational isometry class of the Néron–Severi lattice together with its integral roots. As an application of this rigidity, we construct infinitely many quasi-isometry classes of hyperbolic automorphism groups in Picard rank 4. This reveals a new phenomenon in Picard rank 4, sharply contrasting with the finiteness of quasi-isometry classes in Picard ranks at most 3 and at least 6.

comments
28 pages
fields
Algebraic Geometry, Group Theory, Geometric Topology
pdf ↗ page arXiv:2611.17113 ↗

We prove that over $\mathbb{C}$, for any smooth projective curve $\mathscr{C}$ and any smooth hypersurface $V \subset \mathbb{P}^n$ of degree $d$ such that $n \geq 2^d(d-1)$, Faisant's equidistribution principle holds for $(\mathscr{C},V)$. In other words, for any reasonable set of jet conditions $W$, the moduli space $\mathrm{Hom}^e(\mathscr{C},V|W)$ of degree $e$ maps $\mathscr{C} \to V$ satisfying conditions $W$ converges in the Grothendieck ring of complex varieties, after renormalisation, as $e \to \infty$. This provides the dimension and decomposition into irreducible components of $\mathrm{Hom}^e(\mathscr{C},V|W)$ for $e$ large enough. The strategy follows Bilu and Browning's motivic version of the circle method, and Hase-Liu's framework for genus $\geq 1$.

comments
98 pages. Comments welcome!
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.17120 ↗

In the context of compact moduli spaces of Kollár, Shepherd-Barron, and Alexeev stable surfaces, a degeneration can acquire an exceptional K3 component in the limit, or more simply a K3 tail. We study this phenomenon for Kunev surfaces: minimal surfaces of general type with $K^2=p_g=1$ that arise as $(\mathbb{Z}/2\mathbb{Z})^2$-covers of the projective plane branched along two general cubics and a line. We classify the K3 tails that occur when the branch curve degenerates to a singular curve with a non-log canonical isolated semi-quasihomogeneous singularity, and describe the corresponding boundary strata. This builds on the Kerr-Laza classification of K3 tails arising from isolated semi-quasihomogeneous hypersurface singularities.

comments
31 pages. Comments are welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.17149 ↗

Dynamical Systems33

In this paper we present the chaotic-periodic alternation phenomenon within a three-dimensional nonlinear financial system subjected to Pyragas-type time-delayed feedback, as well as the lag effect of the interest rate in the price index dynamics. Through numerical analysis, transitions to chaos, including period-doubling cascades, period-halving routes, and incommensurable-period dynamics are characterized. The emergence of chaotic-periodic alternation are found and described. Results suggest that minor timing misalignments in the inner dynamics of a financial system, as well as those considered in the feedback loop can induce systemic volatility.

comments
24 pages, 17 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2611.14702 ↗

The multivariate breeder's equation $Δ\bar z=G\nabla\ln\bar W$ is a widely used discrete-time modified-gradient system describing the evolution of continuous traits in organisms. This system could more conventionally be expressed as $x_{k+1}=x_k+P_k\nabla f(x_k)$. For its continuous-time counterpart $x'=P(t)\nabla f(x)$, it has been proven that an isolated local maximum of $f$ is uniformly stable whenever $P(t)$ is positive semidefinite, as is the case for the "$G$-matrix." Furthermore, the continuous time system is uniformly asymptotically stable when the maximum is an isolated critical point and $\int_0^\inftyλ_1(P(t))\,dt=\infty$. We show that the literal discrete analog of this result is false: with constant positive definite $P$ the iterates can oscillate or diverge. The result is restored by a single additional hypothesis, a uniform bound on the largest eigenvalue of $P_k$, $λ_n$, such that $λ_n(P_k)\le 2/L$ where $L$ is a local Lipschitz constant of $\nabla f$. Under this bound the maximum is uniformly stable; under a stricter version together with $\sum_kλ_1(P_k)=\infty$, the maximum is uniformly asymptotically stable. Given these hypotheses, a level-set estimate of the basin of attraction carries over. Both bounds are sharp, and each remaining hypothesis is shown to be necessary. Biologically, the bound says that genetic variance in every direction must be small relative to the curvature of log mean fitness; outside this regime the mean phenotype can overshoot a fitness peak as hypothesized by Fisher's geometric model. As further application of our results, the same conditions apply to the mean update of Gaussian evolutionary optimization algorithms, in which the covariance of the search population plays the role of $G$.

code
github.com/magbenji/discrete-modified-gradient-lean ∎ Lean project (lakefile.toml, lean-toolchain) builds, no sorry at c3e4688, checked 2026-11-13 build details
comments
16 pages, 5 figures, 2 tables. Lean 4 formalization of the main results: https://github.com/magbenji/discrete-modified-gradient-lean (doi:10.5281/zenodo.24118844)
fields
Dynamical Systems, Optimization and Control
pdf ↗ page arXiv:2611.14756 ↗

We prove that the acceleration-dependent Hölder exponent $1/(2ω)$ for the integrated density of states is sharp in the supercritical regime. For every positive integer $k$ and every Diophantine frequency, we construct a real even trigonometric polynomial potential of degree $k$ such that, at a spectral edge, the Lyapunov exponent is positive, the acceleration is $k$, and the exact local Hölder exponent is $1/(2k)$. In particular, the $1/2$-Hölder regularity of the subcritical regime for Diophantine frequencies does not hold in general in the supercritical regime. The proof uses Aubry duality and a KAM iteration that adjusts the potential coefficients to make the dual cocycle reducible to a principal unipotent matrix. A comparison with an explicit reference family and symplectic block diagonalization then reduce the IDS estimate to a two-dimensional rotation-number estimate.

comments
24 pages
fields
Dynamical Systems, Spectral Theory
pdf ↗ page arXiv:2611.15014 ↗

We study canard explosions in mass-action networks with one slow direction. For any number of species and any rank of the fast subnetwork, the derivatives that enter the Krupa-Szmolyan conditions and coefficient are rational functions of the fluxes and the reciprocal concentrations. For a fast subnetwork of rank one, the dynamics is planar on stoichiometric classes and these forms are linear in the fluxes, extending our planar flux criterion; the criticality is an explicit cubic. When one species is fast, these forms decompose over the slow species, weighted by their reciprocal concentrations. The elementary-mode criterion then carries over, and the criticality depends on the composition of the slow pool, so one network can explode in either way. The obstruction that the slow flux cannot vanish on the fold is characterised by a Farkas certificate and a yield diagram decided on configurations of at most three reactions. Under four conditions on the critical curve, a canard point with $A\neq0$ unfolded by a rate constant gives the full canard explosion; with one fast species and a fast equation affine in the slow variable, these follow from sign conditions on the reactions and injectivity on the class. For fast subnetworks of higher rank, a centre-manifold reduction adds corrections through the group inverse of the fast Jacobian; in the Oregonator they make both canard points change criticality between its planar reduction and the full model. All results are proved; exact computations and simulations serve as independent checks.

comments
31 pages, 3 figures; supplementary materials included (Sections SM1-SM7). Data and code: https://doi.org/10.5281/zenodo.23962730. Companion paper: arXiv:2610.27188
fields
Dynamical Systems
pdf ↗ page arXiv:2611.15129 ↗

We study the rigidity phenomenon of the time changed unipotent flows on general Lie groups. Under some spectral gap assumptions, we prove that every ergodic nonsplitting $\mathfrak{sl}_2$-induced unipotent flow on a finite volume quotient space $\mathbf{G}/Γ$ is time changed rigid. We also prove that for $\mathfrak{sl}_2$-induced unipotent flow, the splitting condition is equivalent to loosely Kroneckerness. Our result in particular applies to $\mathbf{G}=\mathbf{S}\ltimes\mathbf{N}$, where $\mathbf{S}$ is the identity component of a real semisimple linear algebraic group without compact factors and $\mathbf{N}$ is simply connected and connected nilpotent Lie group. These are extensions of [KVW21,LW25].

comments
88 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2611.15182 ↗

A zero-Hopf bifurcation can occur for dynamical systems that have a singularity where the linear part has a zero eigenvalue and a pair of purely imaginary eigenvalues. We call a zero-Hopf network a regular network whose adjacency matrix has a zero eigenvalue and a pair of complex eigenvalues with zero real part. In this work, we prove that there is an infinite number of zero-Hopf networks for which the zero-Hopf bifurcation can occur as a generic codimension-one phenomenon for the class of the network admissible smooth vector fields. Our results are achieved using the network adjacency matrices and the associated eigenvector structures. General results are presented for four-cell zero-Hopf networks concerning the network set of synchrony spaces. As a case study, we present a classification of all connected zero-Hopf 4-cell regular networks of valency two showing that, up to permutation of the cells, there are 9 distinct such networks. Moreover, the normal forms of these networks are computed using the method of Rink and Sanders (Trans. Amer. Math. Soc. 367 (2015) 3509–3548) for coupled cell networks. It is remarked that these normal forms are less simplified as the input symmetry of the network admissible smooth vector fields restricts the admissible normal form transformations. Nevertheless, the networks share a common coupling function normal form.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.15221 ↗

The aim of this work is to give conditions on the parameters of a family of analytic planar vector fields with a fixed Newton diagram and a monodromic singularity in order to guarantee that the coefficient (generalized first Lyapunov constant) of the linear part of the Poincaré map has an explicit formula. We revisit using this formalism some monodromic examples appearing in the literature and also we apply the results to other families were, as far as we know, the stability problem was open.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.15233 ↗

Reduced-precision arithmetic is increasingly used to accelerate scientific simulation, while AI workloads are driving its growing prominence in hardware design. Yet small arithmetic errors do not necessarily imply accurate statistics. Finite representation limits spatial resolution, while rounding can merge trajectories that should separate in chaotic systems, progressively concentrating probability on a shrinking collection of computer states. This redistribution can distort statistical averages well before periodicity becomes apparent; furthermore, disjoint computational basins can induce an initialisation bias, even when the intended equilibrium statistics are independent of the initial ensemble. We use functional graphs and their transfer operators to connect these pathologies to bounds on statistical bias, the duration of accurate averaging, and the effect of reducing precision. Exhaustive numerical experiments on four chaotic maps, with 1-24 significand bits and the 24-bit endpoint matching IEEE FP32, show how initially accurate ensembles drift towards incorrect statistics, with lower precision often bringing this deterioration forward. Stochastic rounding substantially extends some useful averaging windows but leaves others severely biased. Longer computed trajectories can therefore worsen inferred statistics, and a finite average can outperform the "infinite-time" computer average by orders of magnitude. This exposes a risk of statistically biased inference at reduced precision and provides a further motivation for collecting statistics from ensembles of shorter trajectories.

comments
15 pages, 5 figures
fields
Dynamical Systems, Numerical Analysis
pdf ↗ page arXiv:2611.15344 ↗

We study the realization problem for Milnor attractors on compact metric spaces and establish a general sufficient criterion for universal realization. In particular, we prove that every smooth compact one-dimensional manifold, with or without boundary, and every smooth closed two-dimensional manifold has the property that each nonempty closed subset is the Milnor global attractor of a continuous self-map. If the manifold is connected, the realizing map may be chosen to be a homeomorphism. We also investigate the realization problem on selected one-dimensional continua and exhibit spaces for which universal realization fails.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.15353 ↗

This paper presents a methodology for the global description of the sets of heteroclinic and homoclinic connections between the center manifolds of the collinear libration points of the spatial circular Restricted Three-Body Problem. The approach builds on high-order parameterizations of the center-stable and center-unstable invariant manifolds and uses them to extract global information on how connections are organized across broad energy ranges. It involves: (a) constructing connectivity maps at the level of invariant tori, which encode which tori in the neighborhoods of $L_1$ and $L_2$ are connected through heteroclinic and homoclinic trajectories; (b) refining this description to the level of individual connections by computing traces of torus–center manifold connections and using them to determine the number and distribution of distinct connecting trajectories between selected pairs of tori. Results are given for the Earth–Moon and Sun–Earth problems, together with examples illustrating how the resulting connectivity information can be used to design heteroclinic and homoclinic pseudo-trajectories with different purposes.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.15361 ↗

Let $f$ be a holomorphic correspondence on a complex projective surface $X$ such that $f^{-1}$ is also holomorphic. Assume that the action of $f^*$ on cohomology is simple and that the dynamical degrees of $f$ satisfy $d_1>\max\{d_0,d_2\}$. We prove that the Green currents $T^\pm$ associated with $f$ are woven. We also provide a large family of examples of holomorphic correspondences satisfying our assumptions, obtained as generic complete intersections in $X\times X$.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.15554 ↗

We prove uniform tightness of Hecke neighbours of any probability measure of positive entropy that is invariant and ergodic under the diagonal flow. As an application, we confirm a conjecture of Einsiedler concerning a homogeneous dynamics analogue of an equidistribution theorem of Johnson and Rudolph on the torus. We also obtain applications to continued-fraction patterns in arithmetic sequences and to the \(p\)-adic Littlewood conjecture. Our proof studies escape of mass using dynamics on the boundary of the Chabauty compactification of the space of lattices, together with averaging operators defined by leafwise measures along horospherical subgroups.

comments
16 pages
fields
Dynamical Systems, Number Theory
pdf ↗ page arXiv:2611.15558 ↗

We study autonomous neural adaptive control, where the controller modifies the physical dynamics while the data generated by the physical dynamics itself drive subsequent parameter updates. We formulate the coupled evolution of the physical state distribution and controller parameters through a self-consistent transfer operator. Assuming that the physical dynamics under each fixed controller admits a unique invariant distribution, we characterize adaptive equilibria through a finite-dimensional self-consistency equation for the stationary mean learning update. We establish existence using Brouwer degree, without requiring global convexity, and reduce uniqueness to uniqueness of the corresponding zero. Under suitable differentiability and spectral-gap assumptions, we derive a finite-dimensional criterion for local exponential convergence of both the physical distribution and controller parameters at sufficiently small positive learning rates. The criterion involves the Jacobian of the reduced equation, computed using linear response to include the effect of controller-induced changes in the invariant distribution. The asymptotic slow relaxation time scales inversely with the learning rate. We rigorously verify the assumptions and apply the theory to a noisy Duffing-type system with a neural residual compensator, providing a nontrivial example of adaptive control with provable existence, uniqueness, and local stability of an adaptive equilibrium. Numerical experiments illustrate statistical feedback and the role of time-scale separation.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.15649 ↗

Let $F$ be the diagonal flow on the modular space $X_2$, and let $\mathcal{S}_f$ be the set of positive square-free numbers, which is identified with the set of all real quadratic fields via the natural map $d\mapsto \mathbb{Q}(\sqrt d)$. In this paper, we prove that, for any finite subset $A\subseteq\mathcal{S}_f$, there exists a density-zero set $B\subseteq\mathcal{S}_f\setminus A$ such that the set of all $F$-periodic measures with associated quadratic fields from $B$ is dense in the set of all $F$-invariant measures on $X_2$.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.15685 ↗

In this article we study sets of limit points $\mathcal{L}$ for the sequence of empirical measures of intermittent maps with several equally sticky neutral fixed points. Such intermittent maps come with a parameter $α> 0$ which determines the "stickiness" of the neutral fixed points. When $α\neq 1$, it is known that two different behaviours can occur: either $\mathcal{L}$ is almost surely the singleton $\{μ\}$ where $μ$ is an absolutely continuous invariant probability measure; or $\mathcal{L}$ is almost surely given by the entire simplex $π\mathcal{S}$ of invariant measures supported at the neutral fixed points. We study the case that $α= 1$ and show that neither of these two behaviours occur and that $\mathcal{L}$ is almost surely equal to a star-shaped subset of the simplex $π\mathcal{S}$. Moreover, we show that when slowly varying functions are introduced one can obtain a large range of different behaviours, including both the possible outcomes when $α\neq 1$. Our results apply to a large class of intermittent interval maps as well as parabolic rational maps of the Riemann sphere.

comments
20 pages, 1 figure
fields
Dynamical Systems
pdf ↗ page arXiv:2611.15955 ↗

In S.P.~Novikov's problem on plane sections of 3ply periodic surfaces, the author and I.\,A.~Dynnikov showed that, for the $μ$-cube, the directions lying in no stability zone form the union of a fractal set $N$, the Levitt–Yoccoz gasket (projectively equivalent to the Rauzy gasket), and of its images under the sign changes of the coordinates. $N$ is the limit set of a parabolic projective iterated function system $PΓ_N$ generated by a semigroup $Γ_N\subset SL_3(\mathbb Z)$, and each zone is labelled by a primitive integer vector, its soul. We show that $N$ is the global attractor of $PΓ_N$ and that the chain graphs of $PΓ_N$ and its Hutchinson map consist of a single node. Building on the theorem of Jiao–Li–Pan–Xu and Jurga that $\dim_H N$ equals the affinity exponent of $Γ_N$, we prove $1.6853<\dim_HN=\dim_BN<1.6854$. For some class of cut-out gaskets $K$, we bound $\overline{\dim}_B K$ from both sides by the norm exponent $s_N(Γ)$. The norm exponent $s_N$ of $G_N$, the counting exponent of the souls, is Baragar's exponent of the Markoff–Hurwitz equation $x_1^2+x_2^2+x_3^2+x_4^2=ax_1x_2x_3x_4$. We prove $2.4411\le s_N\le2.4465$, improving Baragar's bounds, and $\frac23 s_N\le\dim_H N\le\frac12(1+s_N)$, which proves a conjecture by Gamburd, Magee and Ronan; and we show that the exponent of the equation in six variables exceeds $3$, answering a question of Baragar. For the three-dimensional Levitt–Yoccoz gasket $G\subset\mathbb RP^3$ we prove $2.74\le s_N(Γ_G)\le2.777$ and $\dim_H G\le2.3885$. Finally, for the renormalization flow of Avila, Hubert and Skripchenko, we show that the invariant measure they introduce is the Gibbs measure at the parameter $s_N$ and that $s_N$ is the maximal entropy per unit time of the return map, attained only by this measure. So, the diffusion exponent of their chaotic plane sections is less than 0.7766.

comments
80 pages, 7 figures
fields
Dynamical Systems, Metric Geometry, Number Theory
pdf ↗ page arXiv:2611.15996 ↗

We prove that for multiplicatively independent natural numbers $p,q \ge 2$, if $μ$ is a Borel probability measure on the space $\mathcal{K}(\mathbb{T})$ of nonempty compact subsets of the circle $\mathbb{T}$ which is invariant under the induced actions of both multiplication by $p$ and $q$, and $μ$-a.e. $Y$ has positive Hausdorff dimension, then $μ$-a.e. $Y$ is equal to $\mathbb{T}$.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.16008 ↗

For a fixed irrational rotation number and every $1\le r<\infty$, we construct an exact area-preserving $C^r$ twist map preserving a Lipschitz graph. The set of nondifferentiability points has Hausdorff dimension $d=2/(r+1)$ and zero $d$-dimensional Hausdorff measure. At the same rotation number, we construct a $C^\infty$ twist map whose invariant graph is nondifferentiable on exactly one two-sided orbit. The dynamics on these graphs has wandering intervals.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.16294 ↗

Visibility graphs map a time series into a network by linking two data whenever the straight line between them is not obstructed by intermediate data. Their extension to two-dimensional fields has so far been restricted to regular lattices, where visibility is checked along a finite number of lattice directions. We propose a definition for scalar data sampled at arbitrary, irregularly scattered points of the plane. Each point is assigned its Voronoi cell, so that the data become a landscape of prisms, and two points are linked when the line of sight between them clears the cells crossed by the connecting segment. This yields horizontal ($\HVGV$) and natural ($\NVGV$) Voronoi visibility graphs that reduce exactly to the classical horizontal and natural visibility graphs when the points are collinear, contain the Gabriel graph of the point set, and can be built by an exact walk through the Delaunay triangulation. For uncorrelated heights, the horizontal graph depends only on the ranks of the data, so its statistics are independent of the marginal distribution. The probability that two points see each other is $2/[(M+1)(M+2)]$, where $M$ is the number of Voronoi cells crossed, which reduces the problem to the geometry of the tessellation. For Poisson points this gives a degree distribution with a scale-free tail $P(k)\simeq(π^3/4)\,k^{-2}$ and a mean degree that grows as $(π^3/8)\ln N$, in contrast with the finite value $\langle k\rangle=4$ of one-dimensional series. Two dimensions are therefore the marginal case in which isotropic horizontal visibility ceases to be local. Numerical simulations with up to $N=1.28\times10^5$ points support these predictions.

comments
10 pages, 5 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2611.16336 ↗

Following the time rescaling introduced by Dragičević and Silva in their paper [Discrete Contin. Dyn. Syst. Ser. S 18 (2025), 3917–3944], we establish several criteria for uniform $h$-stability and uniform $h$-instability of discrete evolution cocycles. In particular, these asymptotic properties are characterized by suitable weighted summability conditions under uniform $h$-boundedness and uniform $h$-decay assumptions, respectively. Explicit examples show that the respective assumptions cannot be omitted. Our results cover a wide range of discrete growth rates $h$, including exponential and polynomial ones. Furthermore, working in the general setting of discrete evolution cocycles, we provide a framework for discrete evolution families and discrete cocycles.

comments
26 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2611.16352 ↗

We study the asymptotic flocking dynamics of the delayed stochastic Cucker-Smale (in short, DSCS) model driven by agent-wise independent, component-wise multiplicative Brownian noise. The simultaneous interplay of stochastic perturbations and time delay yields fundamental challenges to asymptotic stochastic flocking analysis, as the communication weight may lose a uniform positive lower bound, while the velocity moment is no longer monotone. To overcome these difficulties, we present a sufficient framework and an analytical tool combining the method of time-varying effective region and Lyapunov functional approach with time-delay corrections. This approach avoids any reliance on uniformly positive communication weights or monotone velocity moments. The proposed approach recovers sufficiently strong effective velocity alignment despite stochastic fluctuations and delay effects. As a consequence, we establish the mean-square stochastic flocking with an explicit polynomial convergence rate. The admissible decay exponent is determined by the communication kernel exponent and the orders of the spatial and velocity history moments. These results establish a quantitative theory for long-time stochastic flocking under simultaneous delay and multiplicative noise, and we provide a positive answer to an open problem raised by~[R. Erban, J. Haskovec, Y. Sun, SIAM J. Appl. Math., 76, 1535–1557 (2016)]. We also develop robust analytical tools applicable to delayed stochastic collective dynamics with degenerate communications.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.16613 ↗

For a smooth area-preserving cylinder map with a non-splitting separatrix and an exact symplectic linearization at its saddle, we prove accumulation by smooth essential invariant circles when the boundary transition is sufficiently $C^4$-close to a translation. As an application, we give an answer to Herman's open problem in 1983.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.16616 ↗

Emerging infectious diseases often spread freely before an outbreak is detected, yet the duration of this free-transmission period and the infection size accumulated during this period are difficult to quantify. These quantities directly affect forecasts of subsequent transmission dynamics, estimates of infection size, and decisions regarding prevention and control measures. In this study, we propose and compute the infectious disease horizon (IDH)-the time span from when an infectious disease begins spreading to when it is first detected-and examine its antecedents and consequences. First, based on the SEAIR free-transmission model, we derive transmission characteristics, including the generation interval, the serial interval, the basic reproduction number, and the effective reproduction number, and describe the incidence using a renewal equation. Second, by considering two detection routes, we further obtain the distribution and mean of the IDH under different detection settings and quantify the infection size at the time of outbreak detection. Third, intervention measures are incorporated to derive a post-detection transmission model with generally distributed stage durations, followed by the derivation of the corresponding model under exponentially distributed stage durations and the determination of the final infection size. Finally, under the exponential-distribution assumption, the model is applied to the COVID-19 outbreak in Xi'an. The unified framework developed in this study provides a theoretical basis for evaluating early surveillance capacity for emerging infectious diseases, optimizing testing strategies, and determining the intensity of prevention and control measures after outbreak detection.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.16675 ↗

In this work, we consider a standard regression technique for time series analysis which fits a low-dimensional proxy system to a higher (even infinite) dimensional target model. We then propose a novel diagnostic that exploits a-posteriori computer-assisted proofs, and try to certify the existence of a true periodic solution of the target, nearby. When successful, this certification procedure provides mathematically rigorous information about how well an invariant structure in the proxy approximates a corresponding invariant structure in the target model. To illustrate the utility of the procedure, we develop surrogates using time series data from the Mackey–Glass delay differential equation, and for the Kuramoto–Sivashinsky (KS) partial differential equation, using periodic boundary conditions for forecasting and Neumann boundary conditions for certification. In both test cases we extract invariant dynamics from low-dimensional proxies and use this to validate the existence of corresponding structures in the targets.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.16706 ↗

Topological entropy is a fundamental invariant of dynamical systems, quantifying their complexity. For cellular automata, however, determining topological entropy is generally algorithmically intractable. We study group cellular automata, namely cellular automata over a finite group alphabet whose global map is a group endomorphism. In dimension one, we decompose topological entropy into two one-sided components describing information propagating from the left and from the right in space–time. We introduce finite families of left and right traces and prove that the entropy is the sum of their growth rates. Hence, the entropy is completely determined by the growth rate of a fixed-width family of space–time patterns. This reduction from arbitrarily large windows to uniformly bounded width yields an effective procedure for computing the entropy. In particular, the entropy of every one-dimensional group cellular automaton is the logarithm of a positive integer. Using Pontryagin duality and the Bridge Theorem between topological and algebraic entropy, we also derive an explicit formula for linear cellular automata over $(\mathbb{Z}/p\mathbb{Z})^n$ in terms of their characteristic polynomial. Moreover, in every dimension $D\geq 2$, a group cellular automaton is either equicontinuous with zero entropy or sensitive to initial conditions with infinite entropy. Combined with decidability of equicontinuity, this implies that topological entropy is effectively computable from the local rule in every dimension. Thus, group cellular automata form a natural nontrivial class in which algebraic structure restores computability of topological entropy.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.16746 ↗

LLM agents, i.e., language models run by a harness, can now write, run and debug software autonomously. This raises the question of whether they can also carry out control system design. In this paper, we consider control system design as a task for LLM agents and grade the designed controller as control engineers do: the controller is given in a single Python file mapping measurements to actions, evaluated on held-out seeds against an ordered set of requirements, under specified physical perturbations and structural certificates, without using neural networks. We formulate the task as a chance-constrained feasibility problem and instantiate it in ControlHarbor, a benchmark of 44 tasks over 13 plants, which includes network consensus, vehicle platooning, the MuJoCo hopper, walker and humanoid. The tasks are packaged in the Harbor format, so that any agent harness can be run against them, and the same environments also serve learning algorithms other than LLMs, such as reinforcement learning (RL), under the same evaluation. With ControlHarbor, we observe that the controllers designed by three frontier coding agents, Claude Opus 5.5, Fable 5.1 and Sonnet 5.5, reach the RL return on every parity task, but only in a minority of sessions. We also observe that the controllers certified for return alone usually fail under perturbations. When robustness is part of the specification, a structured design meets it at the RL return on the humanoid task, where domain-randomised RL does not; under large pushes, domain-randomised RL succeeds and no designed controller does. The benchmark, the controllers, and their grades are released.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.16867 ↗

When do mode energies preserve regime information as measurement quality changes? Stochastic Kernel Mode Decomposition (sKMD) fits joint regime laws on signed KMD mode coordinates and transfers the reference mode posterior to regime probabilities and conditional reconstructions. For centered Gaussian regimes with independently varying known noise variances, fixed coordinate energies retain the full regime posterior precisely when all classes share their cross-covariances and class variances can differ only at isolated vertices of the covariance graph. We extend the characterization to nonzero means and show that freely varying correlated noise forces a fixed linear log-odds decoder to retain the full quadratic feature span even for two distinct centered regimes. At fixed quality, a three-regime example has no sufficient two-energy basis. Its smallest Bayes log-loss gap over bases of condition number at most $κ$ has sharp order $κ^{-1}$. Exact Bayes energy posteriors supply numerical gap estimates for specified bases. Additional bounds relate feature compression, independently learned mode spans and sensor-noise error to log loss. Two controlled experiments with 64 independent panels each show that signed information can improve prediction over energy summaries, while integration gives small gains over strong signed controls and depends on how the competing point rule is calibrated and how accurately observation noise is measured.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.16874 ↗

For $(x,y)\in\mathbb{R}^2$ and $Q\ge 1$, set $F_Q(x,y)=Q\min_{1\le q\le Q}\lVert qx\rVert\lVert qy\rVert$, where $q$ ranges over positive integers and $\lVert\cdot\rVert$ denotes distance to the nearest integer. The set on which the uniform Littlewood constant $L=\limsup_{Q\to\infty}F_Q$ is positive has full Hausdorff dimension. We prove that for every fixed $c>0$ the superlevel set $\{L\ge c\}$ has Hausdorff dimension strictly less than two. More precisely, the Lebesgue measure of $\{(x,y)\in[0,1]^2:F_Q(x,y)\ge c\}$ is $O_c(Q^{-κ(c)})$ for some $κ(c)>0$ and all $Q\ge 2$. The proof combines large deviations for one diagonal action on the space of unimodular lattices with effective equidistribution of expanding horospheres for another.

comments
12 pages
fields
Dynamical Systems, Number Theory
pdf ↗ page arXiv:2611.17189 ↗

The leaky integrate-and-fire (LIF) neuron combines a passive membrane law with threshold-triggered firing and reset. We formulate this hybrid neuron model, under constant input, on an arbitrary Hilger time scale $\mathbb{T}$. Our central result is that, after the first spike, the firing times satisfy $t_{n+1}=Π_{\mathbb{T}}^{+}(t_n+T_c)$, where $T_c$ is the classical reset-to-threshold travel time. This recursion requires no periodicity, homogeneity, or translation invariance of $\mathbb{T}$; it holds for every time scale that is unbounded above. To preserve the passive membrane physics, we use the inverse cylinder transformation to construct a positively regressive coefficient $p_m$. The resulting delta-dynamic equation is exactly the restriction to $\mathbb{T}$ of the classical continuous-time LIF trajectory. By contrast, the direct transcription $V^Δ=-(V-V_\infty)/τ_m$ exhibits graininess-dependent sign reversal and amplification at coarse right-scattered points. The first firing time is the forward projection of the classical continuous threshold-crossing time onto $\mathbb{T}$, and, when the graininess is bounded by $μ^\ast$, the per-event forward-projection delay -- from each reset to the next realized firing time, relative to the continuous crossing time computed from that same reset -- is bounded above by $μ^\ast$. On $\mathbb{T}=h\mathbb{Z}$ we obtain the explicit lattice-quantized law $T_{\mathrm{ISI}}^{(h)}=h\lceil T_c/h\rceil$, which converges to the classical continuous-time inter-spike interval as $h\to0^+$. The framework therefore separates preserved membrane physics from the temporal opportunity structure imposed by the time domain. To our knowledge, this is the first systematic Hilger-calculus treatment of a threshold-and-reset LIF spiking neuron on an arbitrary time scale.

comments
11 pages, 5 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2611.17219 ↗

Only a few species of a gene regulatory network can be measured, so the others must be reconstructed by a state observer, and how well this works depends on the function chosen to describe regulation. We examine this for the two-gene negative feedback loop with one measured protein, for monotone regulation functions including the logistic function and the Hill function with its leaky and shifted variants. Using standard tools, we show that the answer is set by the smallest and the largest slope of the regulation function on the concentrations visited. For every function considered, the unmeasured concentration can be recovered from the measured signal and its rate of change, with an error sensitivity set by the smallest slope. A Luenberger observer with explicit gains converges exponentially from any initial guess and tolerates bounded measurement noise whenever a checkable matrix condition involving only the largest slope holds, as it does for every model examined with bounded slopes. The guaranteed rate cannot exceed the degradation rate of the unmeasured protein unless the smallest slope is positive, and faster rates then hold only for small initial errors. All reported rates are certified from above and below. At matched threshold and steepness, no family is uniformly better: the logistic function is better conditioned when the threshold lies mid-range, leaky or shifted Hill functions when it lies low. Hill functions with exponent below one have an unbounded slope at zero concentration and lose the global guarantee, which logistic and shifted Hill functions keep.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.17232 ↗

We prove that an absolutely continuous self-similar measure has an $L^p$ density for some $p>1$. Moreover, explicit examples of Bernoulli convolutions with a continuous density are established.

comments
18 pages
fields
Dynamical Systems, Classical Analysis and ODEs, Probability
pdf ↗ page arXiv:2611.17277 ↗

We study countable dynamical systems with a dense orbit. Given an infinite compact metric countable space $X$, we show that $\mathcal{DO}(X)$, the collection of continuous functions on $X$ to itself admitting a dense orbit, is always nonempty. We then classify the systems in $\mathcal{DO}(X)$ up to topological conjugacy in terms of the second Cantor–Bendixson derivative $X^{(2)}$: if $X^{(2)} = \emptyset$ then all systems in $\mathcal{DO}(X)$ are mutually conjugate, while if $X^{(2)} \neq \emptyset$ then $\mathcal{DO}(X)$ contains $2^{\aleph_0}$ pairwise nonconjugate systems. The proof of the latter relies on a gluing construction for countable dynamical systems with a dense orbit, which is of independent interest. We also show that $\mathcal{DO}(X)$ is nowhere dense in $C(X,X)$ with the compact-open topology. We also study the Ellis semigroup $E(X,f)$ of a countable dynamical system. We characterize, under the assumption that $|ω(x,f)| = 1$ for each $x \in X^{(1)}$, when the nontrivial functions of $E(X,f)$ are continuous. In particular, for the family constructed on spaces with $|X^{(2)}| \geq 2$, every nontrivial function of the Ellis semigroup is discontinuous.

comments
23 pages, 5 figures, summited to Topology and its Applications
fields
Dynamical Systems, General Topology
pdf ↗ page arXiv:2611.17315 ↗

The Covering Lemma of J. Kahn and M. Lyubich is a fundamental analytic tool for controlling conformal moduli of annuli under branched coverings of finite degree. In the last several decades, it has played a crucial role in establishing rigidity of multicritical polynomial and rational maps. The classical proof uses the Near-Degenerate Regime as the main mechanism. In this short note, we prove this lemma using hyperbolic area and the Dirichlet energy. We also establish a version of the Covering Lemma for holomorphic maps of infinite degree. Our argument is inspired by recent applications of the hyperbolic area method to the study of wandering domains in rational and transcendental dynamics.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.17326 ↗

Information Theory32

In this paper, we investigate carrier shutdown (CS) in high-altitude platform station (HAPS)-Hypercell-assisted networks, leveraging network-wide information to optimize both coverage macro cells and capacity cells CS. To address the high dimensionality of this problem, we propose ComBO, a community-aware Bayesian optimization framework that exploits user equipment (UE) reference signal received power (RSRP) reports to construct a fallback graph representing the underlying network and identify groups of strongly coupled cells. The resulting communities decompose the original optimization problem into lower-dimensional subproblems, which are sequentially optimized using trust region Bayesian optimization (TuRBO) and refined through a final joint search. Evaluation in a high-fidelity 3GPP-based system-level environment shows that ComBO consistently outperforms legacy CS strategies and overcomes the scalability limitations of global Bayesian optimization (BO). Considering normalized terrestrial power ComBO achieves nearly 84% savings while preserving quality of service. These results demonstrate the potential of community-aware decomposition as a scalable approach to large-scale network optimization.

fields
Information Theory
pdf ↗ page arXiv:2611.14761 ↗

Cellular communication is done over an imperfectly predictable multimode environment, where the sender only knows about the distribution of possible intermode coupling and scattering a signal faces. It may thus seem surprising that such communication is efficient. Telatar proved that the sender's lack of exact knowledge about the channel, on average, does not significantly hinder multimode communication. As the number $N$ of modes increases at fixed signal-to-noise ratio, the average capacity of a classical multimode fading channel grows linearly in $N$, like that of $N$ decoupled single-mode channels. We study the quantum analogue in a Haar-random passive bosonic network and prove a similar scaling for unassisted quantum information transmission. Suppose that the sender drives a fixed fraction of the input modes and the receiver collects more than half of the output modes. Then the quantum capacity of such channels at zero temperature grows linearly with the number of modes at fixed photon number per mode, just like the classical capacity grows with the number of antennas. At nonzero temperature, the Haar-averaged coherent information of the isotropic thermal input bounds the capacity from below, and its value per mode converges to an integral against Wachter's law. We numerically identify positive achievable rates in models motivated by cryogenic microwave networks and room-temperature multimode fibers.

comments
22 pages, 2 figures, 2 tables
fields
Information Theory
pdf ↗ page arXiv:2611.14822 ↗

Existing channel estimation methods for affine frequency division multiplexing (AFDM) over doubly dispersive channels commonly isolate pilots and data with pilot guard symbols, resulting in substantial transmission overhead, while fractional Doppler introduces off-grid mismatch and complicates accurate channel estimation. This paper develops a pilot-guard-free AFDM transmission and reception scheme with a Bayesian receiver for joint channel estimation and data symbol detection. Uniformly interleaved pilots are embedded among data symbols without dedicated guard symbols, and the resulting pilot-data coupling is explicitly incorporated into the joint inference problem rather than suppressed through guard-based isolation.

comments
13 pages, 10 figures
fields
Information Theory
pdf ↗ page arXiv:2611.14877 ↗

Given a finite field $\mathbb F_q$, we say that a set $A\subseteq \mathbb F^n_q$ is an $(r,c)$ subspace evasive set if and only if for any affine subspace $U\subseteq \mathbb F^n_q$ with bounded dimension $\dim(U)\leq r$, the intersection size $|A\cap U|$ is at most $c$. The probabilistic method shows the existence of $(r,c)$ subspace evasive sets with $|A| = q^{(1-ε) n}$ with $c = O(r/ε)$. However, the best explicit constructions by Dvir–Lovett (STOC 2012) and Ben-Aroya–Shinkar (CJTCS 2013) have $c$ growing as an exponential function of $r$. Here, we give an explicit construction of such subspace evasive set that achieves the intersection bound $c=O(\min(r\log(r/ε)/ε, r^2/ε))$ when both $r$ and $1/ε$ are constants. Our approach is simple and the key idea is to compose subspace design codes (Guruswami-Xing, STOC 2013) with a suitably chosen ``local'' subspace evasive set. As a corollary, we give the first construction of an explicit (strongly) capacity-achieving list-recoverable code with nearly optimal list size, circumventing all previously-known barriers to construction.

comments
27 pages
fields
Information Theory, Combinatorics
pdf ↗ page arXiv:2611.14909 ↗

We propose a reduced-complexity weighted minimum mean squared error (R-WMMSE) framework for cell-free massive MIMO (CF-mMIMO) systems with finite-capacity fronthaul links. To maximize the system capacity, we need to jointly design beamforming vectors at distributed access points (APs) and fronthaul quantization noise covariances. Such a task would be addressed using conventional WMMSE algorithms and their variants. However, existing WMMSE-based methods either assume ideal infinite-capacity fronthaul links or incur high computational complexity when jointly optimizing the network-wide beamforming and fronthaul compression variables. To this end, the proposed method jointly optimizes beamforming and fronthaul compression by leveraging a sequential per-AP optimization strategy. Since each subproblem is efficiently solved via Lagrangian duality with closed-form updates, the overall computational complexity can be significantly reduced compared to the conventional WMMSE method. To further reduce hardware cost, we extend the R-WMMSE framework to hybrid analog-digital beamforming systems, tackling the joint design of digital beamforming, fronthaul compression, and analog beamforming. Numerical results show that the proposed scheme achieves performance nearly identical to that of the conventional WMMSE while reducing the runtime by over 99%.

fields
Information Theory
pdf ↗ page arXiv:2611.15054 ↗

Reed-Solomon proximity gaps establish soundness guarantees for protocols that test received words through random combinations. For length-$n$ codes over $\mathbb{F}_q$, classical scalar combiners achieve error $O(n/q)$ in the unique-decoding regime, with larger known bounds near the Johnson radius. We prove smaller error bounds using affine combiners, which combine two received words $f,g$ as $f(x)+(α+βx)g(x)$, where $α,β$ are independent uniform elements of $\mathbb{F}_q$. For output degree bound $d=ρn$, fixed $ρ\in(0,1)$ and $0<η<1-\sqrtρ$, and sufficiently large block length $n$, we prove mutual correlated agreement (MCA) with one coordinate of agreement loss at threshold $A=\lceil(\sqrtρ+η)n\rceil$, with error $O_{ρ,η}\left(\frac{1}{q}+\frac{n^2}{q^2}\right)$. The result holds over arbitrary evaluation domains in every finite field, including prime and binary extension fields. The agreement threshold can approach the Johnson threshold, beyond unique decoding. For $q\ge n^2$, our error is $O_{ρ,η}(1/q)$, an asymptotic factor-$n$ separation from scalar combiners: we prove that their worst-case MCA error is $Ω_{ρ,η}(n/q)$ at the same agreement threshold and with the same one-coordinate loss. We also prove that affine combiners incur worst-case error $Ω_{ρ,η}(n/q)$ when no agreement loss is allowed. Thus one coordinate of agreement loss is necessary for our guarantee; this relaxation of standard MCA reduces the guaranteed common agreement fraction by at most $1/n$. We also extend the result to $k$-variate Reed-Muller codes on subfield grids, obtaining MCA error $O_{ρ,η,k}(q^{-k})$ for fixed $ρ,η,k$, sufficiently large $n$, and $q\ge n^{k+1}$, with agreement loss $n^{1-1/k}$.

fields
Information Theory
pdf ↗ page arXiv:2611.15128 ↗

Recently, the radio access network (RAN) has been reimagined through open RAN (O-RAN) architecture to overcome the limitations of the traditional monolithic, black-box design philosophy and to leverage emerging technologies such as cloud computing, machine learning, and artificial intelligence. Although O-RAN disaggregates the base station (BS) into independent components to enable modular deployment, this paradigm introduces new challenges in signal processing and beamforming. In particular, beamforming in O-RAN must account for fronthaul link (FHL) capacity constraints, coordinated operation of multiple radio units (possibly from different vendors), and resource management, including transmit power allocation. To address these challenges, this work proposes novel beamforming techniques for a downlink multiuser hybrid massive multiple-input multiple-output system, in which hybrid architectures are deployed at both the users and at each BS radio unit. We formulate a sum-rate maximization problem incorporating transmit-power, unit-modulus, and FHL capacity constraints. The proposed algorithm integrates gradient descent and the Lagrange multiplier method to design analog beamformers and digital precoders, respectively, whereas digital combiners are designed to render the received streams parallel to each other. By avoiding computationally intensive operations such as eigenvalue and singular value decompositions, the proposed approach, as evidenced by simulation results, achieves superior performance with moderate computational complexity compared to existing benchmark schemes.

comments
16 pages, 13 figures
fields
Information Theory
pdf ↗ page arXiv:2611.15199 ↗

Semantic communication (SemCom) has emerged as a promising paradigm for bandwidth-constrained mobile and vehicular networks. This paper proposes a unified representation learning framework for multimodal SemCom (MSC), which encodes heterogeneous data into a compact semantic space for efficient transmission and source recovery. The framework addresses the multimodal semantic representation gap, which arises when at least one modality contains semantic information that cannot be fully inferred from the other. To preserve this information for reconstruction, the framework decomposes each representation into shared and modality-specific components. We formulate a mutual information objective for source reconstruction, cross-modal alignment of the shared components, and decoupling of the shared and modality-specific components. To enhance transmission efficiency, we introduce a shared knowledge base implemented as a compact codebook of semantic vectors learned during training. The shared components are transmitted digitally as codebook indices, while the modality-specific components are sent in analog form. We apply knowledge distillation during training, using a pretrained vision foundation model to guide the learning of quantized shared features. On image–text pairs over additive white Gaussian noise (AWGN) and Extended Vehicular A (EVA) channels, the proposed framework improves image reconstruction over conventional separate source-channel coding (SSCC) and representative multimodal and unimodal SemCom systems. Further evaluations show gradual degradation under channel-estimation mismatch, complementary effects of alignment, decoupling, and knowledge distillation on the shared representation, and alignment of shared features across modalities with separation of the modality-specific features.

comments
This work has been submitted to the IEEE for possible publication
fields
Information Theory
pdf ↗ page arXiv:2611.15357 ↗

Collaborative perception in Vehicle-to-Everything (V2X) networks faces dual challenges: strictly limited bandwidth and channel impairments. Existing static quantization schemes often suffer from feature manifold drift caused by highly non-stationary traffic environments. To address this, we propose MetaCom, a robust digital semantic communication framework featuring a Meta-Codebook Learning paradigm. First, we introduce a Differentiable Quantized Semantic Communications (DQSemCom) module trained with perturbations induced by the simulated digital modulation and channel via Gumbel-Softmax relaxation. Building on this, we design a Bi-Level Meta-Evolution Mechanism (Bi-MEM) that treats manifold drift as a sequence of rapid adaptation tasks, aligning the codebook via data-level smoothing and parameter-level meta-updates. Furthermore, we validate MetaCom under AWGN, Rayleigh, and Rician fading channels. Experimental results demonstrate that MetaCom achieves superior trade-offs between perception precision and communication overhead, outperforming state-of-the-art methods by a significant margin under low-SNR conditions.

comments
5 pages, 5 figures. Accepted by IEEE Communications Letters
fields
Information Theory
pdf ↗ page arXiv:2611.15359 ↗

Spatial non-stationarity in multi-cell extremely large-scale MIMO (XL-MIMO) confines each user to a visibility region (VR) of each array. VR-Net exploits these regions for subarray-level coordinated beamforming. A base-station (BS)-indexed conflict graph identifies overlapping VRs; gain-based association and a masked multi-cell weighted minimum mean square error (WMMSE) iteration restrict beam design and channel state information (CSI) uploads to the relevant subarray blocks. We establish conditions for exact per-cell decoupling, derive the expected CSI loads, bound the loss of designing on the VR-gated channel and the loss of the support constraint, and characterize single-edge visibility contrast through a closed-form Fresnel transition width. Simulations use a 3GPP TR 38.901 Release-19-based near-field UMi channel with modular facade arrays and pre-registered criteria. At a 30 dB threshold, VR-Net retains at least 99.6% of the full-aperture WMMSE sum rate in every tested setting while uploading 10-39% fewer complex CSI entries. It gains up to 3.5 bit/s/Hz over an all-user adaptation of the multi-cell scheme of Pérez-Adán et al. at moderate power and dense load, and inter-cell coordination adds up to 33% over per-cell design.

fields
Information Theory, Statistics Theory
pdf ↗ page arXiv:2611.15393 ↗

We prove subadditivity for the Nichols–Wootters family of entropies interpolating between the von Neumann entropy and the subentropy, with all spectra evaluated in one common ambient dimension. Beyond the von Neumann entropy, equality holds exactly when at least one marginal is pure. This settles the subadditivity conjecture concerning subentropy. Every member except the von Neumann entropy fails strong subadditivity, already on a maximally entangled two-qubit state tensored with a mixed qubit. Its strong-subadditivity defect takes both signs on quantum Markov states. For a pure bipartite state tensored with an ancillary state, we identify the defect with a separately concave product gap and determine its exact maximum under rank constraints. For arbitrary bipartite states, we obtain an explicit lower bound in the marginal purities. For two-qubit states, we determine the optimal coefficient multiplying the product of the smaller marginal eigenvalues in every common ambient dimension, including the subentropy coefficient $1/3$. A positive representation by Haar averages of compressed matrix entropies gives the pinching inequality underlying these results and also yields entropy-gain bounds for unital quantum channels.As an application, each entropy equals the classical communication capacity retained after a specified isotropic partial projective measurement, at a prescribed average input state, even when entangled block encodings are allowed.

comments
110 pages
fields
Information Theory, Mathematical Physics
pdf ↗ page arXiv:2611.15431 ↗

Model broadcast in federated learning (FL) with wireless channels faces significant challenges due to large model sizes and heterogeneous, unreliable channel conditions. While rateless coding has been widely adopted in modern broadcast communications to handle channel heterogeneity, its potential for model broadcast in FL remains largely unexplored. To fill this gap, we propose a joint source-channel coding scheme based on rateless coding to improve the robustness and efficiency of downlink model broadcast in FL. Specifically, we establish a rigorous convergence analysis of FL to inform the rateless code and quantization design under noisy downlink channel conditions. Moreover, by observing that the iterative process of FL naturally provides prior information about client updates, we leverage client-side local models as conditional prior information to aid the decoding process, thereby reducing transmission costs. Extensive simulations demonstrate that our rateless coding scheme significantly enhances downlink model broadcast efficiency in FL, while retaining comparable training accuracies for both homogeneous and heterogeneous data distributions.

fields
Information Theory
pdf ↗ page arXiv:2611.15499 ↗

Let $k\ge 2$, $N=2^k$, $M=N-1$ and let $Δ(r)$ be the range, over all starting offsets, of the total-variation degree discrepancy of a length-$r$ window of a primitive binary linear feedback shift register (LFSR) of period $M$. Degree-discrepancy profiles for every $k\le 28$ support the scaling $\max_r Δ(r)=Θ(\sqrt{N})=Θ(2^{k/2})$. The tabulated peaks are maxima on a discrete grid, hence lower bounds on the exhaustive maximum. The normalized peaks $d_k=\max_{r\in R_k}Δ(r)/2^{k/2}$ oscillate between values near 1/2 and values that approach, but do not exceed, 1. The data suggest $\liminf d_k=1/2$ and $\limsup d_k\le 1$. We conjecture the same square-root law for the exhaustive maximum, with those normalized envelopes. A Brownian-bridge heuristic accounts for the square-root scale. The same profiles do not place the recorded maximizer at mid-path: after folding by the complement identity $Δ(M-r)=Δ(r)$, the median of $\min(ρ^*_k,1-ρ^*_k)$ is 0.35, and several $k$ (notably 16 and 28) peak on a short window. Mid-horizon $Δ$ remains a large fraction of the peak, so the square-root scale can still come from a Brownian-bridge envelope. The same range has two readings of the starting offset: a pairing fragment in serial-knockout scheduling, and a change to the plaintext on an LFSR orbit. The location of the maximizer is not part of the conjecture. Open questions that separate the conjecture from a theorem are listed.

fields
Information Theory, Combinatorics, Number Theory
pdf ↗ page arXiv:2611.15635 ↗

In this paper, we propose a novel design method for the lookup tables (LUTs) of the minimum reconstruction, computation, and quantization (min-RCQ) LDPC code decoding algorithm. The proposed design method uses Bayesian optimization and samples from a subspace of the design space. The novel design method does not require knowledge about the channel or the modulation format and uses the frame error rate (FER) as loss function. The design method is applicable to irregular low-density parity-check (LDPC) codes with puncturing and shortening. Furthermore, the design method creates a set of iteration-agnostic LUTs that can be used over all iterations, which makes this approach suitable for fully node-parallel decoder architectures. We show that our proposed approach achieves a 38.6 % better energy efficiency than a state-of-the-art normalized min-sum (NMS) decoder without loss in error correction performance.

fields
Information Theory
pdf ↗ page arXiv:2611.15694 ↗

Accurate and reliable near-field multi-source localization is essential for location-aware processing in future wireless systems. However, coherent multipath propagation complicates the direct recovery of line-of-sight (LoS) source positions, while existing estimation methods generally lack explicit control of the risk of source underestimation and positioning uncertainty. In this paper, we investigate reliable source enumeration and positioning in near-field coherent multipath environments. Specifically, we develop a conformal risk control (CRC) based source enumeration scheme that calibrates the penalty coefficient of an eigenvalue-based criterion to control the expected miss-detection ratio at a prescribed level. We further propose MUSIC-Net, a model-based deep learning framework informed by two-stage MUltiple SIgnal Classification (MUSIC), which learns the LoS-related subspace and surrogate distances through subspace-distance-based training, thereby enabling direct source positioning without estimating non-line-of-sight (NLoS) path parameters or performing subsequent path association. To quantify the uncertainty of the estimated positions, we develop a split conformal prediction (SCP) based calibration method that constructs angle-range predicted regions with finite-sample simultaneous coverage guarantees. Numerical results show that the proposed framework effectively controls the risk of source underestimation, while providing improved positioning accuracy with tighter predicted regions than benchmarks given the same target coverage levels.

comments
15 pages, 14 figures
fields
Information Theory
pdf ↗ page arXiv:2611.15722 ↗

We study distributed binary detection when the fusion node must implement a prescribed Boolean decision rule. Under conditionally independent Bernoulli observations, we derive a signed-influence path identity valid for arbitrary Boolean rules; for monotone rules, it reduces to an exact Russo–Margulis representation in terms of coordinate influences. The identity yields rule-sensitive necessary conditions for a target Bayes error and an influence-weighted Kullback–Leibler feasibility bound. We then connect Boolean relevance to exact rule implementation and derive lower bounds on the number of sensors that must participate, including a heterogeneous bound based on the ordered per-sensor hypothesis separations. Numerical and Monte Carlo results illustrate both the tightening provided by the heterogeneous participation bound and the performance penalty that can arise when a prescribed fusion rule is retained instead of optimal likelihood-ratio fusion.

fields
Information Theory
pdf ↗ page arXiv:2611.15824 ↗

Quantum low-density parity-check (QLDPC) codes are a promising route to fault-tolerant quantum computation with low overhead, and qudits offer advantages over qubits including more efficient information representation, improved magic state distillation, and richer algebraic structure for code design. Asymptotically good QLDPC codes arise from the lifted product (LP) construction with non-abelian lifts, but cyclic lifts remain attractive in practice because the resulting quasi-cyclic codes have circulant structure that hardware decoders exploit, which matters especially for non-binary decoders with costly check node operations. We introduce a qudit generalization of the LP construction over cyclic group algebras, which extends hypergraph product and LP codes to arbitrary prime-power dimensions and yields quasi-cyclic qudit CSS codes for every stacking order. We bound encoding rates via a connection to additive codes, and show that in the fully stacked case, qudit LP codes built from lifted Tanner codes on expander graphs form families with $Θ(\log N)$ logical qudits and almost linear minimum distance $Θ(N/\log N)$, via a distance bound that holds for a general class of LP factors. We also study an additive decoder for general qudit codes and a linear merged-syndrome decoder for fully stacked codes. Monte Carlo simulations under a depolarizing channel with equal symbol error probability show that qudit codes achieve lower frame error rates than comparable qubit codes, and that the linear decoder gives further gains for fully stacked codes.

comments
43 pages, 6 figures
fields
Information Theory
pdf ↗ page arXiv:2611.15952 ↗

We derive closed-form Gaussian information projections of Beta–Gaussian distributions whose tangential components are supported on affine embedded hypercubes and whose normal components are Gaussian. The optimal Gaussian is uniquely characterized by moment matching, and the corresponding minimum Kullback–Leibler divergence admits an explicit expression depending only on the intrinsic Beta parameters, independently of the embedding geometry, ambient dimension, and normal Gaussian parameters. In the uniform case, this divergence reduces to a linear function of the intrinsic dimension. We further extend this construction to finite, pure embedded cubical complexes by considering mixtures of the componentwise Gaussian projections. Using the joint convexity of the Kullback–Leibler divergence, we establish an explicit upper bound on the approximation error of the resulting Gaussian Mixture. For uniform tangential distributions and volume-based mixture weights, the bound is linear in the intrinsic dimension and independent of the geometry of the complex, its embedding, and the normal Gaussian parameters.

comments
11 pages
fields
Information Theory
pdf ↗ page arXiv:2611.16022 ↗

We study the average one-guess success probability of an adversary who observes the ordinary integer sum of a finite-support secret and an independent integer-valued mask, subject to an absolute-moment budget on the mask. For a uniform secret on an interval the exact optimum and an explicit optimiser are obtained. For a biased bit the masks that achieve no increase over the prior baseline are characterised and their minimal cost is determined. The entire cost-vulnerability frontier is then determined for every bias. It is the piecewise-linear interpolation of an explicit sequence of points generated by cost-optimally shifted truncated geometric masks. It has infinitely many affine pieces, which accumulate at the critical cost, where the frontier meets the prior baseline with zero slope. The proof rests on a layer-cake decomposition of an arbitrary mask into truncated geometrics, along which both the vulnerability and the cost are exactly additive. The results give exact design guidance for additive integer noise under the average one-guess metric; they do not constitute a cryptographic masking scheme.

comments
14 pages, 1 figure. Code and data: https://github.com/fv2fm2z7rk-droid/additive-integer-masks-qif
fields
Information Theory
pdf ↗ page arXiv:2611.16066 ↗

We give an information-theoretic formulation of two-stage secret sharing for situations in which secret information becomes available progressively. In the proposed model, shares for an initial part of the secret are distributed before the remaining part becomes available, and additional shares are distributed to new participants after the remaining part becomes available, without updating the shares already distributed and without using any additional information other than shares. To characterize this setting, we propose the notion of a two-stage access structure and provide its characterization. We further quantify the amount of information about the first-stage secret that the dealer must retain between the two distribution stages, derive a universal lower bound, and present a construction that achieves this bound for every two-stage access structure. We also position advance sharing as a special case of the proposed model and give its characterization and a related construction in classical information-theoretic secret sharing.

fields
Information Theory
pdf ↗ page arXiv:2611.16146 ↗

Constructing codes that attain the Gilbert-Varshamov (GV) bound while admitting efficient encoding and decoding is a fundamental problem in coding theory. We study concatenated codes that reuse a single binary inner code across all outer coordinates. To exploit existing encoding and decoding algorithms, we restrict the outer codes to random subcodes of scaled copies of prescribed algebraic codes and investigate their minimum distance. Our first contribution is a general upper bound on the minimum-distance failure probability that separates two terms controlled by the inner code's bias moments and the dual weight distribution of the prescribed code, together with sufficient conditions for exponential decay. Our second contribution is a concrete construction satisfying these conditions using algebraic-geometric codes from the Garcia-Stichtenoth tower. For every sufficiently small $\varepsilon>0$, we construct a family of random binary codes $C_m$ whose rates approach $\varepsilon^2$ and satisfy \[ \Pr\left[δ(C_m)\geq\frac12-\sqrt{\frac{\ln 2}{2}}\left(\varepsilon+\frac{\varepsilon^3}{2}\right)\right]\geq 1-2^{-c\varepsilon^4N_m}, \] for all sufficiently large $m$, where $N_m$ is the block length and $c>0$ is independent of $\varepsilon$ and $m$. Thus, the distance guarantee matches the leading coefficient of the GV bound at low rates. For each fixed $\varepsilon$, the construction uses a single inner encoding map throughout the family and admits polynomial-time encoding and unique decoding within a guaranteed radius. This answers the question of Doron, Mosheiff, and Wootters for subcodes of scaled algebraic geometry codes at low rates.

comments
25 pages
fields
Information Theory
pdf ↗ page arXiv:2611.16179 ↗

We introduce SEC, an expander-code-based ramp secret sharing scheme over $\mathbb{Z}$-modules, particularly suitable for lattice-based distributed cryptography. It is everywhere-short: bounded secret coefficients yield bounded share coefficients, and the integer reconstruction vectors have bounded entries. Moreover, each participant receives exactly one share, regardless of the number of parties and the privacy and reconstruction thresholds. This improves on prior schemes with bounded share coefficients and bounded entries in the integer reconstruction vectors, in which the number of sub-shares or shares per participant grows either with the number of parties and the threshold or with the security parameter. The construction rests on a coding-theoretic observation: in the bi-adjacency matrix of a lossless bipartite expander, unique-neighbor peeling completes every sufficiently small set of columns to a square unimodular submatrix. We prove correctness, everywhere-shortness, and linearity, and give a publicly computable entrywise bound on the reconstruction vector our algorithm returns for each authorized set. For privacy, we introduce hard-core local leakage resilience, which strengthens the leakage-resilience notion of Nielsen and Simkin (EUROCRYPT 2020) to protect a hard-core function of the secret, and we prove that SEC satisfies it against correlated multi-query local leakage under the MatrixHint-MLWE problem, which admits a reduction from the standard MLWE problem. For $n=60$ participants and security parameter $κ=128$, SEC achieves privacy threshold 6 against $2^{64}$ leakage queries and empirical reconstruction threshold 46. The ideal entropy-coded secret and share sizes are about 3.5 KiB and 6.4 KiB, respectively.

comments
84 pages, 3 figures. Also available as Cryptology ePrint Archive, Paper 2026/2841: https://eprint.iacr.org/2026/2841
fields
Information Theory
pdf ↗ page arXiv:2611.16244 ↗

Rate-distortion functions are defined by a variational problem whose analytic solution depends on the source distribution and distortion measure. We develop a posterior-based construction framework using conditional entropy as a common distortion coordinate. Building on the rate-entropy formulation, we establish entropy-level attainability for discrete sources with finite entropy and absolutely continuous sources with integrable log densities. We give a constructive rate-entropy coding proof for finite-alphabet sources and such continuous sources, without a second-moment assumption. Marginal compatibility ensures that a candidate posterior and output distribution recover the source, while a Gibbs representation and a kernel mass bound certify attainment of maximum conditional entropy. The negative log posterior identifies candidate fixed distortions. Excess rate equals a conditional entropy gap and decomposes into budget slack and posterior mismatch. Convolution decompositions and conjugate posteriors provide two construction paths. They recover established results, including the Gamma-source rate-distortion function under Itakura-Saito distortion, and yield a closed-form parametric expression for zeta sources under divisibility-constrained logarithmic multiplicative distortion. Exact expressions are obtained on specified intervals for negative binomial sources under one-sided counting distortion and Gamma sources under one-sided mean error. A residual-count coordinate for Poisson entropy budgets and rate-entropy parametrizations of Gamma and Dirichlet counting channels connect model parameters to remaining uncertainty. The framework unifies distortion selection, compatible-channel construction, and optimality verification.

comments
26 pages, 3 figures, 1 table
fields
Information Theory
pdf ↗ page arXiv:2611.16253 ↗

This letter investigates flexible intelligent metasurface (FIM)-aided secure multiple-input single-output (MISO) communications in the presence of a multi-antenna eavesdropper. By exploiting the morphing capability of the FIM, the transmit array geometry can be dynamically reconfigured to reshape the legitimate and eavesdropping channels. We formulate a secrecy rate maximization (SRM) problem by jointly optimizing the transmit covariance matrix and the FIM surface shape. For a given FIM surface shape, the optimal transmit covariance matrix is shown to be rank one and is obtained in closed form from the dominant generalized eigenvector. For a fixed transmit covariance matrix, a projected gradient ascent (PGA) method is developed to optimize the FIM shape. Based on these two subproblems, a block coordinate ascent (BCA) algorithm is proposed. Moreover, for the special line-of-sight (LoS) scenario, we derive a globally optimal closed-form joint transmit covariance matrix and FIM surface shape design under a sufficient morphing-range condition. Numerical results demonstrate that FIM effectively improves the secrecy rate over a conventional rigid antenna array (RAA). Moreover, FIM achieves a transmit-power saving of about 2.5 dB compared with the RAA benchmark at the same secrecy rate.

fields
Information Theory
pdf ↗ page arXiv:2611.16411 ↗

The Gilbert-Varshamov (GV) bound is a fundamental benchmark for the existence of error-correcting codes. For non-linear $q$-ary codes of code length $n$, its finite length form is known to admit a multiplicative improvement of order $Θ(n)$. In contrast, for $q$-ary linear codes of arbitrary rates, the best previously known general improvement was only of order $Θ(\sqrt n)$. This leaves open whether the algebraic constraint of linearity inherently prevents a linear-order refinement. We show that it does not. For every fixed prime power $q$ and relative distance $0<δ<1-1/q$, we obtain a $Θ(n)$-multiplicative improvement of the GV bound for $q$-ary linear codes of arbitrary rate, matching the corresponding result for nonlinear codes. Our proof is based on a simple change of viewpoint. Rather than requiring the initial random linear construction to contain no low-weight vectors, we allow $O(n)$ low-weight points, show that they are independent in the underlying projective space, and then eliminate all of them simultaneously at the cost of a single dimension. The key probabilistic ingredient is an exponential bound on nontrivial linear dependencies among low-weight vectors. We further show that this approach can be extended to quantum codes despite the symplectic self-orthogonality constraint. We obtain a $Θ(n)$-multiplicative improvement of the quantum GV bound for every fixed $0<δ<1-1/q^2$ satisfying $H_{q^2}(δ)<1/2$. Thus, the same $Θ(n)$ finite length improvement is applicable to both general linear structure and symplectic self-orthogonality.

comments
20 pages
fields
Information Theory
pdf ↗ page arXiv:2611.16447 ↗

The performance of Zak-OTFS modulation depends critically on the delay-Doppler (DD) domain pulse shaping filter, which must support both accurate channel estimation and reliable data detection. Filters reported in the Zak-OTFS literature fall short in bit error rate (BER) performance for higher-order modulation due to sensitivity to model-free channel estimation errors and pilot-data interference. Motivated by this, in this paper, we introduce a separable two-dimensional Mirabbasi-Martin (MM) filter for Zak-OTFS and propose a filter coefficient optimization framework that minimizes the aggregate sidelobe energy while preserving the compact structure of the MM prototype. By trading exact Nyquist nulls for high localization, the optimized MM filter exhibits no sidelobes with the narrowest $-40$ dB DD domain pulsewidth compared to sinc, Gaussian, and GS pulses. This compactness of the optimized filter tightly confines the pilot energy within the pilot region of the embedded frame, ensuring that the full response is captured for model-free channel estimation while significantly reducing pilot-data interference. This yields both an improved estimation performance and a significantly improved BER performance for higher-order QAM. For the proposed filter, we derive closed-form expressions for the effective DD domain channel and the covariance of the receive-filtered noise, which drastically reduce simulation run times. Our simulation results demonstrate that the optimized MM filter achieves significantly better uncoded/coded BER performance for higher-order QAM compared to that of sinc, Gaussian, and GS filters. For example, for 64-QAM with M=32, N=48, rate-1/2 convolutional code, and TDL-A channel model with fractional DDs, the optimized MM filter achieves a coded BER of 3x10^{-4} at an E_b/N_0 of 40 dB, while the sinc, Gaussian, and GS filters exhibit error floors above 10^{-2}.

comments
Submitted to IEEE journal for possible publication
fields
Information Theory
pdf ↗ page arXiv:2611.16643 ↗

In a nonergodic channel such as a slowly fading link, the channel law is drawn once and held fixed for the whole codeword, and the relevant performance measure is the $\varepsilon$-capacity. We study the $\varepsilon$-capacity regions of two-user mixed multiple-access channels (MACs) with finite alphabets, additive cost constraints and an arbitrary mixing measure. The direct parts are derived from a single information spectrum formula; the converse parts use, in addition, Fano's inequality and Ahlswede's strong converse applied to each component. Without knowledge of the realized component, we prove a single-letter inner bound for every $0\le\varepsilon<1$, in which one input serves all components; for $\varepsilon=0$ it is tight, and the capacity region is given by the essential infima of the component mutual informations. We prove a single-letter outer bound, the outage region, in which each component may use its own input; it holds with or without channel state information (CSI) at either terminal, and it is the $\varepsilon$-capacity region when the encoders know the component and the parameter space is countable. Both bounds coincide, in all four CSI scenarios, for well-ordered mixed MACs, which include degradedly ordered families and mixtures with a common optimal input, such as mixed additive MACs. Without CSI the outer bound can be strictly loose, and the no-CSI $\varepsilon$-capacity region for $0<\varepsilon<1$ remains open in general. Finally, we extend Ahlswede's strong converse to $K$ users with cost constraints and show that most of these results extend to $K$-user mixed MACs.

comments
27 pages, 2 figures
fields
Information Theory
pdf ↗ page arXiv:2611.16653 ↗

This paper, Part III of a series, treats $K$-user multiple-access channels (MACs). Its starting point is a pair of fundamental lemmas, a random-coding lemma of Feinstein type and a converse lemma of Verdú–Han type, which are the $K$-user extensions of the two lemmas underlying Han's information spectrum approach to the general two-user MAC. From them we derive the capacity region of the general $K$-user MAC with cost constraint and show that it contains the polymatroid capacity region of the $K$-user Gaussian MAC. We then prove, by an elementary information spectrum calculation that adapts a diffuse–exceptional subspace decomposition used in recent second-order converses for the Gaussian MAC, that for every subset $\cS$ of users and every independent input satisfying the power constraints, the conditional information spectral-sup rate of the $K$-user Gaussian MAC does not exceed $\frac12\log(1+P_\cS/N)$, where $P_\cS$ is the total power of the users in $\cS$, with a probability bound that does not depend on the input. Consequently, the strong converse for the $K$-user Gaussian MAC, in the sense that the error probability tends to one for every rate tuple outside the capacity region, follows directly from the converse lemma, without the wringing technique and without hypothesis-testing meta-converses. This strong converse was first established by Fong and Tan, whose per-blocklength bounds yield it, through wringing and quantization. It is the key ingredient in the converse parts of the coding theorems for mixed Gaussian MACs in Part I, where the $\varepsilon$-strong converse would not suffice.

comments
13 pages, 0 figures
fields
Information Theory
pdf ↗ page arXiv:2611.16664 ↗

Motivated by quantum key distribution networks, we compare key relay protocols with secure network coding on the same undirected graph. In this comparison, we fix the finite field, terminal set, and wiretap family. Each edge supplies one independent uniform symbol to its endpoints for key relay, or carries one symbol once for network coding. The network code may choose its source terminal, edge orientations, and causal transmission order before execution. In this setting, the standard one-time-pad simulation readily converts every secure network code to key relay. We investigate the reverse conversion to linear network coding. For two terminals and a one-symbol key, arbitrary key relay is equivalent to scalar linear acyclic network coding over the prescribed field. The proof uses connectivity and flow conservation, related to the binary $st$-flow protocol. However, this equivalence fails in general when several terminals seek one common key. A doubled triangle separates key relay from acyclic coding but admits causal coding on a cyclic orientation. On the four-terminal complete graph, a linear key relay protocol over the ternary field withstands the three perfect-matching wiretap sets, whereas no linear causal network code distributes a source symbol of the same size, even with private randomness at every vertex and its use in decoding. We also establish a linear key relay normal form that removes interaction and private randomness and bounds public communication. All results concern one-shot feasibility with exact agreement and perfect secrecy.

comments
36 pages, 5 figures
fields
Information Theory
pdf ↗ page arXiv:2611.16776 ↗

For any fixed integers $q\ge2$ and $t\ge1$, we construct explicit $q$-ary codes of length $n$ that correct any combination of at most $t$ insertions, deletions, and substitutions, with redundancy at most $2t\log_q n+O_{q,t}(\log\log n)$ $q$-ary symbols. This matches the leading redundancy term of Levenshtein's classical existential bound. Building on the standard graph-coloring approach, we use a prime-based multicoloring of the edit-confusion graph to assign multiple colors to each $q$-ary word of length $m<n$. Appending a short, edit-protected representation of an assigned color to the length-$m$ word yields a length-$n$ codeword. The choice among the assigned colors carries additional message information, thereby reducing the redundancy. The construction admits deterministic encoding and decoding in $\widetilde O_{q,t}(n^{6t+2})$ and $\widetilde O_{q,t}(n^{7t+2})$ time, respectively.

fields
Information Theory
pdf ↗ page arXiv:2611.16835 ↗

AI-RAN distributes network control across multiple autonomous agents, namely xApps and rApps operating over shared radio resources. When an alert or degradation appears, operators currently lack a structured way to trace which decision caused it, what context triggered that decision, and how other agents interacted. Existing explainability tools focus on single-model feature attribution or linear event logging, neither of which captures cross-agent decision chains. We propose the Context Graph, a heterogeneous directed graph that organizes policies, measurements, decisions, and alerts into a queryable explanation layer. Its foundational primitive is the Decision-Event node acting as a causal junction, where incoming edges capture triggering context and outgoing edges track downstream consequences that are progressively upgraded through counterfactual verification. Instantiated over existing E2, A1, and O1 data flows, our proof-of-concept demonstrates that compliance and diagnosis queries are resolved at sub-millisecond latency over graphs of tens of thousands of nodes, while reliably distinguishing true causal impacts from spurious correlations.

comments
This work has been submitted to the IEEE for possible publication
fields
Information Theory
pdf ↗ page arXiv:2611.16879 ↗

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, $\texttt{llama.cpp}$'s K- and I-quants) spend equal bits on every integer code of a matrix, although the codes are far from uniform. $\texttt{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 $\texttt{llama.cpp}$ 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, $\texttt{LazyWeights}$ needs $58-64\%$ less time and $53-57\%$ less energy per token than CPU $\texttt{llama.cpp}$, and runs a streamed Mistral-7B 6.6$\times$ 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).

comments
6 pages, 1 reference page, 5 figures
fields
Information Theory
pdf ↗ page arXiv:2611.17108 ↗

Representation Theory23

The salient result of this paper is the complete classification of all nilpotent Lie superalgebras in dimensions up to four over an algebraically closed field of characteristic 2. Our method adapts the Skjelbred-Sund method to show that every n-dimensional nilpotent Lie superalgebra arises as a one-dimensional central extension of an (n-1)-dimensional one, and determines precisely when two such extensions yield isomorphic superalgebras. Carrying out this construction for dimensions up to 4, we obtain a finite, non-redundant list of pairwise non-isomorphic examples.

comments
29 pages, no figures
fields
Representation Theory
pdf ↗ page arXiv:2611.14523 ↗

We construct a surjective algebra homomorphism from the $K$-theoretic Hall algebras of certain quivers with potential to the (half) quantum affine and toroidal orthosymplectic superalgebras.

fields
Representation Theory, Mathematical Physics, Quantum Algebra
pdf ↗ page arXiv:2611.14550 ↗

For a finite-dimensional unitary representation of a finite or compact group, consider the mean squared matrix coefficient on the unit sphere. Its local maxima are the vectors generating irreducible cyclic subrepresentations. We show that for compatible group actions this variational picture retains the incidence structure of representation theory. For two commuting actions, intersections of projectivized local-maximal components recover the weighted support graph of the product representation, including its multiplicity spaces; Howe duality is the multiplicity-one matching case. More generally, for pairwise commuting actions, and for subgroup chains, every positive linear combination of the corresponding functionals has exactly their common local maxima, while every other critical point has a positive Hessian direction. On a fixed irreducible module at the top of a subgroup chain, the simultaneous projective local-maximal components are indexed by vertex paths in the weighted Bratteli diagram. Each component is the product of the projective space of the bottom representation and the projectivized branching multiplicity spaces. In the multiplicity-free case with one-dimensional bottom type, these reduce to the Gelfand-Tsetlin lines. Peter-Weyl, Frobenius reciprocity, Young branching and Schur-Weyl duality provide concrete instances of the general picture.

fields
Representation Theory, Number Theory
pdf ↗ page arXiv:2611.14591 ↗

We prove that the sign-isotypic components of the symmetric group coinvariant rings $R_n^{(k,\ell)} \otimes R_n^{(a,b)}$ and $R_n^{(k+a,\ell+b)}$ are isomorphic if and only if $n \leq 2$ or at least one of $(k,\ell)$ or $(a,b)$ is $(0,0)$ or $(0,1)$. Moreover, for $k \geq 1$ the $ν$-isotypic components $\left(R_n^{(k,\ell)} \otimes R_n^{(0,1)}\right)^ν$ and $\left(R_n^{(k,\ell+1)}\right)^ν$ are isomorphic if and only if $ν$ corresponds to the sign representation. We also show that the socle of $R_n^{(k,\ell)}$ always contains the sign component, extending one direction of a result of Haiman for $R_n^{(2,0)}$. We settle the hook components conjecture of Bergeron (2024) for coinvariant rings, and a conjecture of Bergeron (2020) that the multiplicity of the sign character of $R_n^{(1,2)}$ is $3^{n-1}$. Our results also recover several existing results in the literature. Lastly, we extend our results to the hyperoctahedral group ${\mathfrak{B}_n}$ and prove that the determinant-isotypic components of $R_{\mathfrak{B}_n}^{(k,\ell)} \otimes R_{\mathfrak{B}_n}^{(0,1)}$ and $R_{\mathfrak{B}_n}^{(k,\ell+1)}$ are isomorphic.

comments
32 pages. Comments welcome!
fields
Representation Theory, Combinatorics
pdf ↗ page arXiv:2611.14773 ↗

We show that all higher Verlinde categories are maximally nilpotent, as conjectured by Coulembier (2023). By previous results, it suffices to show that non-trivial simple objects have only finitely many non-zero symmetric powers in odd characteristic. We compute the maximal degrees of these non-zero symmetric and exterior powers explicitly, hence confirming their finiteness. We discuss some of the far-reaching consequences.

fields
Representation Theory, Category Theory
pdf ↗ page arXiv:2611.14810 ↗

We study cluster-roots of $n$-representation-finite algebras, namely the dimension vectors of cluster-indecomposable modules. We give a direct proof of Mizuno's higher analogue of Gabriel's theorem, and show that cluster-roots are precisely the non-negative integer vectors whose Coxeter orbits contain the dimension vector of an indecomposable projective module. Moreover, we give an explicit description of all cluster-roots of the $(n-1)$-Auslander algebras of type $A$. For $n=2$, we use periodic integer sequences to give a method for constructing counterexamples to Mizuno's positivity conjecture within this family, which reduces to determining whether finitely many quadratic equations admit non-negative integer solutions.

comments
18 pages
fields
Representation Theory
pdf ↗ page arXiv:2611.14976 ↗

We realize the restricted dual Verma modules of arbitrary highest weight for the complex simple Lie algebra of type $E_6$ by inhomogeneous first-order differential operators in $36$ variables. The construction is obtained by applying Xu's functor (2016) to the full conformal oscillator representation of $\mathfrak{o}(10)$. We construct polynomial bases for all six fundamental $E_6$-modules and obtain a finite spanning set for every finite-dimensional irreducible $E_6$-module $V(λ)$. The degree in $16$ selected variables gives $V(λ)$ a grading over the symmetric algebra of the opposite abelian nilradical. We compute its Hilbert series and graded Betti numbers, and verify the Buchsbaum-Eisenbud-Horrocks conjecture for this family. The minimal graded free resolution of $V(λ)$ is pure precisely when $λ$ is a nonnegative multiple of the Weyl vector of $E_6$. Among nonzero dominant integral $λ$'s, the minimum total Betti number is $435204$, attained exactly at two minuscule weights $ω_1$ and $ω_6$.

fields
Representation Theory
pdf ↗ page arXiv:2611.15245 ↗

We classify all controlled $2$-blocks with defect group of rank $2$ up to Morita equivalence. This provides a proof of Donovan's Conjecture for resistant $2$-generated $2$-groups.

fields
Representation Theory, Group Theory
pdf ↗ page arXiv:2611.15332 ↗

We study irreducible (admissible) representations $π$ of the split group $G_n=SO(2n+1)$, both over finite and $p$-adic fields, which are distinguished for the (unramified) nonsplit form of $K_n=SO(2n)$ and for one more subgroup $H_n$. Over finite fields, $H_n$ is the split $SO(2n)$ while over $p$-adic fields it is the Gross-Tsai paramodular subgroup (of minimal level for $π$). These are all multiplicity one situations. With $0 \neq \ell_{n,K} \in {\rm Hom}_{K_n}(π_n,1)$ and $0 \neq v_{n,H} \in π_n^{H_n}$, both being one dimensional spaces, we are interested in the vanishing/nonvanishing of $|\ell_{n,K}(v_{n,H})|^2$. Appropriately normalized, this defines the notion of the correlation coefficient $c(π;H_n,K_n)$ of $H_n$ and $K_n$ in $G_n$ with respect to $π$. Via the theta correspondence between ${\rm SL}(2)$ (or ${\rm Mp}(2)$), we establish a bijection $π_n \leftrightarrow π_1$ between representations of $G_n$ and $G_1$ under consideration. Our main results then prove that $d_n c(π_n;H_n,K_n)$ is independent of the rank $n$, where $d_n =\dim π_n$ for finite fields and is defined in terms of the index of $H_n$ in the standard maximal compact subgroup of $G_n$ in the $p$-adic case. We also highlight a conjecture from [Ana25] on Legendre polynomials modulo $p$. Its truth will have the arithmetic consequence that over $\mathbb F_p$, given $π_1$, we can choose $u \in \mathbb F_p$ such that, in every rank $n$, all the correlation coefficients $c(π_n;H_n,u_nK_n u_n^{-1})$ are simultaneously nonzero and moreover they belong to $\mathbb Z_p^\times$ under any identification $\mathbb C \simeq \overline{\mathbb Q}_p$, where $u_n$ is a specific unipotent element in $G_n$ corresponding to $u$.

fields
Representation Theory, Number Theory
pdf ↗ page arXiv:2611.15483 ↗

In this paper, we study the monoidal category of finite-dimensional right comodules over the path algebra $\Bbbk Q$ of a finite acyclic quiver $Q$, equipped with the weak bialgebra structure in which every path is grouplike. We prove that the lax center of this category is monoidally equivalent to $\operatorname{Rep}^{\mathrm{fd}}_{\Bbbk}(Q)$, the category of finite-dimensional representations of $Q$. We also classify all $\Bbbk$-linear strong monoidal functors between any two such comodule categories, and all monoidal natural transformations between them. For the right adjoint of such a functor, we determine when the left or right projection formula holds. When both projection formulas hold, this adjoint will induce a functor between the lax centers, and we describe the induced functor explicitly on quiver representations.

fields
Representation Theory, Rings and Algebras
pdf ↗ page arXiv:2611.15496 ↗

The homogeneous coordinate ring of a Grassmannian variety $\mathrm{Gr}_{k,n}$ is equipped with a structure of a cluster algebra. The frozen variables are identified with the Plücker coordinates corresponding to length-$k$ segments of ${\mathbb Z}_n$. We study two families of algebras: the first family is obtained by specializing all the frozen variables and the second corresponds to the specialization of the nonwrapping variables. We construct flat bases in both families and study their affine spectra. The special fibers of the families are cones over projective varieties. We identify the irreducible components of these projective varieties with certain positroid varieties.

comments
26 pages
fields
Representation Theory, Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:2611.15611 ↗

We generalize Mirković's construction of Zastava spaces. These spaces form an inductive system, giving a generalization of affine and Beilinson–Drinfeld Grassmannians as indschemes, defined for any integral symmetric matrix $κ$ with even diagonal entries. When $κ$ is the Cartan matrix from a simply-laced Kac–Moody algebra, we also construct an action of the Tits group on the generalized affine Grassmannian.

comments
27 pages, comments welcome
fields
Representation Theory
pdf ↗ page arXiv:2611.15788 ↗

This paper provides a conceptual understanding of the Mackey bijection from the admissible dual of a real reductive group $G$ into the admissible dual of its Cartan motion group $G_0$, by studying the primitive spectrum of a Hecke algebra over $\mathbb{C}[t]$ arising from the contraction of $G$ to $G_0$. If $K$ denotes a maximal compact subgroup of $G$, our approach leads to the following two results: the admissible Mackey bijection is a piecewise homeomorphism, each piece being defined by the length of the lowest $K$-types; the Hecke algebras of $G$ and $G_0$ have, up to $K$-types not exceeding a certain length, the same periodic cyclic homology.

comments
40 pages
fields
Representation Theory
pdf ↗ page arXiv:2611.16002 ↗

Let $\mathbb{G}$ be a generic reductive group in the sense of Broué–Malle–Michel. We construct a category over $\mathbb{Z}[t,t^{-1}]$ which interpolates between the various categories of unipotent representations of $\mathbb{G}(q)$ as we specialize $t$ to $q$. We use this category to show two properties of the unipotent decomposition matrix of $\mathbb{G}(q)$ mod $\ell$ (not dividing $q$): that, uniformly in $(q,\ell)$, there are finitely many such matrices and that for $\ell$ large enough, depending only on $\mathbb{G}$, this decomposition matrix depends only on the root of unity corresponding to $q$ mod $\ell$. We also prove that for $q$ and $q'$ two prime powers that are $\ell$-adically close enough, the categories of unipotent mod $\ell$ representations of $\mathbb{G}(q)$ and $\mathbb{G}(q')$ are equivalent.

comments
49 pages, comments welcome
fields
Representation Theory
pdf ↗ page arXiv:2611.16014 ↗

The goal of this paper is to start proving the Broué–Digne–Michel conjectures concerning the cohomology of Deligne–Lusztig varieties attached to roots of the full twist. The main result establishes that the $\mathrm{Ext}$-algebras of the cohomology complexes attached to roots of the full twist are concentrated in degree $0$. The main idea is to reduce the problem to a calculation in the Hecke category. The resulting argument is essentially topological and applies to all realizations of the Hecke category.

comments
28 pages, comments welcome
fields
Representation Theory
pdf ↗ page arXiv:2611.16017 ↗

We show that non-counital Frobenius algebras with injective comultiplication coincide with QF-3 algebras, thereby providing a new characterization of QF-3 algebras. As an application, we recover that gendo-Frobenius algebras, self-injective algebras, and more generally Morita algebras, all admit an injective non-counital Frobenius algebra structure. Furthermore, we construct a canonical family of injective comultiplications on QF-3 algebras that admit a counit if and only if the algebra is Frobenius. This settles a question of Hernandez–Walton–Yadav and unifies a wealth of results in the literature. We conclude with applications to topological quantum field theories and Poincaré duality algebras.

comments
19 pages. Comments welcome
fields
Representation Theory, Quantum Algebra, Rings and Algebras
pdf ↗ page arXiv:2611.16024 ↗

Let $Q$ be a quiver and let $\mathbf{d}$ be a dimension vector. We prove that the affinized BPS cohomology of the stack of $\mathbf{d}$-dimensional representations of the preprojective algebra $Π_Q$ is generated by its reduced virtual fundamental class under the action of tautological classes. This is a generalisation to singular quiver varieties of the Kirwan surjectivity statement of McGerty-Nevins for smooth framed quiver varieties. We prove that the statement holds for every King stability condition. To prove this, we attach legs to vertices of $Q$ and construct a correspondence with a smooth quiver variety for the extended quiver. This correspondence sends the reduced virtual fundamental class of the singular preprojective quiver stack to the Vandermonde determinant capped with the fundamental class of the smooth preprojective quiver stack for the leg-extended quiver. We construct the Weyl group action by the simultaneous Springer resolution of Dobrovolska-Ginzburg-Travkin, providing a comparison of the cohomology of fibres. This comparison preserves the tautological Chern classes. The sign-isotypic formula involving Kac polynomials of Hausel-Letellier-Rodriguez-Villegas, combined with Kirwan surjectivity for smooth framed quiver varieties of McGerty-Nevins, then implies the tautological generation theorem. We also describe the sign isotypic component of the cohomology of quiver varieties using the real-root subalgebras of the BPS Lie algebra. The tautological generation result can be extended via similar methods to deformed preprojective algebras of Crawley-Boevey-Holland at central parameters.

comments
50 pages
fields
Representation Theory, Algebraic Geometry
pdf ↗ page arXiv:2611.16036 ↗

Let $\mathcal C$ be a Hom-finite Krull–Schmidt extriangulated category over a commutative artin ring. Write ${\rm Rel}(\mathcal C)$ for the subgroup of the split Grothendieck group generated by the relations of all $\mathbb E$-triangles, and ${\rm AR}(\mathcal C)$ for the subgroup generated by those coming from Auslander–Reiten $\mathbb E$-triangles. We first prove that either one-sided finiteness condition on Hom supports implies ${\rm Rel}(\mathcal C)={\rm AR}(\mathcal C)$. For incoming Hom supports, the proof uses a Jordan–Hölder filtration of the contravariant defect. The outgoing case follows by duality. This gives a new proof of the implication from local finiteness to generation by Auslander–Reiten relations. Our argument uses defects and induction on their composition length. In this way, it avoids the radical filtration argument used by Zhu and Zhuang. We then sssume that $\mathcal C$ has enough projectives and injectives, and prove that $\mathcal C$ is locally finite if and only if its projective and injective subcategories are locally finite, the Euler functions associated with Auslander–Reiten relations have finite support, stable and costable morphisms detect ordinary morphisms away from the projective and injective boundary, and ${\rm Rel}(\mathcal C)={\rm AR}(\mathcal C)$. Our results recover the classical module and triangulated cases. They also explain why the two one-sided support conditions are equivalent in the triangulated setting, but may differ in a general extriangulated category.

comments
33 pages
fields
Representation Theory
pdf ↗ page arXiv:2611.16277 ↗

In this paper we consider Grothendieck groups of extended module categories $\C_m(A)=m\text{-}\modu A$, where $A$ is a finite-dimensional algebra over a field and $m$ is a positive integer. We show that the relation subgroup of the split Grothendieck group of $\C_m(A)$ is generated by Auslander–Reiten extriangles if and only if $\C_m(A)$ has finitely many indecomposable objects up to isomorphism. To this end, we establish a criterion for extriangulated categories with bounded negative extension sequences and a finite extension generator. We then apply this criterion to extended module categories and recover the two-term silting criterion of Padrol, Palu, Pilaud and Plamondon. We also use the cohomological Euler characteristic to determine the rank of the relation subgroup. In particular, when $A$ is hereditary and representation-finite, we explicitly describe the indecomposable objects of $\C_m(A)$ and calculate the rank of its relation subgroup.

fields
Representation Theory
pdf ↗ page arXiv:2611.16343 ↗

We study continuous representations of topological monoids on discrete modules via a finite-restriction reconstruction method. For an arbitrary topological monoid $\mathscr{M}$, we construct a transformation monoid $\mathscr{E}_\mathscr{M}$ whose uniformly continuous representations are equivalent to continuous representations of $\mathscr{M}$ on discrete modules. By the finite-restriction reconstruction, these categories are equivalent to categories of sheaves of modules over special sites. We illustrate this method by several examples, including various realizations of $\mathrm{FA}$-modules and continuous representations of $\operatorname{End}_A(\varinjlim_r A^r)$ for a finite ring $A$.

fields
Representation Theory, Combinatorics
pdf ↗ page arXiv:2611.16436 ↗

Let $V^{\Bbbk}(\mathfrak{g})$ be the universal affine vertex algebra attached to a finite-dimensional complex simple Lie algebra at arbitrary level, and let $M=\bigoplus_{N=0}^{\infty}M_N$ be a $V^{\Bbbk}(\mathfrak{g})$ -module. We give an explicit formula for every genus-one trace of affine currents as a finite sum over cycle partitions. We then show the convergence of all fixed zero-mode trace series, hence absolute locally uniform convergence of the current traces and their meromorphic continuation on the elliptic configuration space. The same conclusion is obtained for arbitrary affine-state insertions. Finally, we compute the cases of at most four currents and the nodal limit $q\to 0$, in which the type-1 and type-2 elliptic cycle coefficients degenerate to rational genus-zero cycle coefficients and the module trace reduces to the ground-state space.

comments
28 pages, 2 figures
fields
Representation Theory, Mathematical Physics, Quantum Algebra
pdf ↗ page arXiv:2611.16453 ↗

The trace map of a finite group gives a perfect duality between conjugacy classes and irreducible complex representations. For reductive $p$-adic groups, an analogous duality holds due to the classical work of Bernstein, Deligne and Kazhdan. In this paper, we study this trace map for modular representations of reductive $p$-adic groups in characteristic $\ell\ne p$. The failure of the duality is measured by the kernel of the trace map on the cocenter of the ``big Hecke algebra''. Our main theorem expresses this kernel in terms of corresponding kernels for finite-dimensional Hecke algebras associated with normalizers of parahoric subgroups in suitable central quotients of Levi subgroups, reducing a problem on infinite-dimensional algebras to finite-dimensional ones. We also show that projective representations provide a natural complementary subspace on the compact part of the cocenter. For affine Hecke algebras, we prove the naive-kernel conjecture over algebraically closed fields of arbitrary characteristic and for arbitrary compatible nonzero parameters, including unequal parameters and roots of unity.

comments
28 pages
fields
Representation Theory, Number Theory
pdf ↗ page arXiv:2611.16847 ↗

State space models (SSMs) are an emerging alternative to Transformers. SSMs offer linear-time inference and parallel training, but most implementations make the parallel scan efficient by making the recurrence diagonal: each channel of the hidden state is multiplied by an input-dependent real or complex number. These numbers commute, so the state records which inputs occurred but not their order. We formalize this with representation theory, which explains and fixes the state-tracking failures previously reported for SSMs. The state update defines a linear representation of the monoid of input sequences, and we show that an SSM tracks a group at every sequence length exactly when that group is a quotient of the group generated by its transition matrices. Two consequences follow. Diagonal real- and complex-valued SSMs can track only commutative groups, while the transition matrices of any SSM that can track a group must split into independent blocks over the real, complex, and quaternion numbers. We then introduce HyperSSM, which adds quaternion channels while keeping linear-time inference and parallel training. Trained only on final answers, HyperSSM solves the group tasks of recent state-tracking benchmarks exactly with at most five state numbers. This includes $S_5$ with 32 generators, where previous SSMs are at chance, and HyperSSM generalizes to sequences 25 times longer than those seen in training. Because the theory says what the transitions must encode, the learned weights of the linear recurrence can be interpreted directly. We demonstrate this by recovering the calibration of a real gyroscope, the rotations of imperfect qubit gates and the geometry of protein backbones.

fields
Representation Theory
pdf ↗ page arXiv:2611.17162 ↗

Statistics Theory21

We study noncentral normal-reference inference for high-dimensional two-sample Behrens-Fisher problems. Within the Gaussian reference, a shifted null law is accurate if and only if covariance-weighted signal energy is negligible relative to the trace of the squared covariance. We establish the sharp uniform fourth-root error order over unrestricted spectra and a linear bound under spectral spread. A separate spectral-range criterion determines when signal magnitude alone suffices. An augmented spherical reference gives finite-sample calibration for Gaussian samples and asymptotically recovers Gaussian-reference local power under projection fourth-moment bounds and control of diagonal fluctuations, without a dimension-to-sample-size restriction. For unknown Gaussian covariance, explicit trace and hollow-Gram confidence bounds turn the linear approximation bound into a simultaneous, computable certificate over local effect ranges. Eigenspace signal energies describe directional power, while a two-point argument limits estimation of unknown local power. Simulations with 10,000 evaluation replications per configuration examine unequal and noncommuting covariances, severe sample imbalance, non-Gaussian observations and the informativeness of the certificate.

fields
Statistics Theory
pdf ↗ page arXiv:2611.14598 ↗

The average rectangular volume ($\ARV$) of a bivariate aggregation function is the average of its volumes over all axis-parallel rectangles of the unit square; for a copula, it is the expected copula volume of the rectangle spanned by two independent uniform points. We determine the exact region of the pairs $(\ARV(C),ρ(C))$, where $C$ ranges over all bivariate copulas and $ρ$ is Spearman's rho. The region is compact, convex and symmetric, and its upper boundary consists of three analytically parametrized arcs. A previously proposed family of shuffles of Min generates one arc, but only on part of its range; the other two arcs are generated by singular copulas whose supports contain hyperbolic branches. The boundary is continuously differentiable away from its left endpoint $\ARV=\frac{11}{120}$, where it has a vertical tangent. The proof uses a folding transformation and explicit Kantorovich potentials for a family of optimal transport problems. Finally, we show that the arachnitude, a rank correlation used in actuarial practice, is an affine transformation of $\ARV$, so that the result also describes the joint region of Spearman's rho and arachnitude.

fields
Statistics Theory
pdf ↗ page arXiv:2611.14645 ↗

Transfer learning can improve precision by borrowing information from external sources, but how much improvement is possible while maintaining valid inference? We address this by studying honest confidence intervals for a target parameter using multiple sources with heterogeneous prespecified discrepancy bounds. Under local information and admissibility conditions, we establish a universal lower bound on interval length for procedures maintaining uniform coverage. A scalar information equation characterizes the bound, revealing how precision depends jointly on source sample sizes and discrepancies. Large source samples need not yield greater precision gains when their discrepancies are large. When discrepancies are unrestricted, honest intervals cannot improve upon the target-only rate, even when all sources are unbiased. For the Gaussian location model, we calculate optimal source weights and construct honest intervals attaining the lower bound order, establishing sharpness. We extend the lower bound theory to semiparametric models through parametric submodels. For the Cox proportional hazards model, we verify the information conditions under which the lower bound applies, including under right censoring.

comments
8 pages, 1 table
fields
Statistics Theory
pdf ↗ page arXiv:2611.14684 ↗

We study the cyclic discrete total variation obtained by adding the wrap-around edge to the usual open-chain statistic. Under the uniform multinomial law the cyclic symmetry recombines the same per-edge, adjacent, and disjoint covariance blocks used for the linear statistic, but with different multiplicities, and this simplifies the variance: the bin-independent leading coefficient \(2A+4B\) carries over, the constant-order correction collapses \emph{exactly} to \(β_c(n)=β_1 n\) (no \(n^0\) or \(1/n\) tail; obtained directly here, and already reached in Part~2 through the transfer identity), and a conditional second-order coefficient \(γ_c(n)\) is given. The exact finite-\(N\) cyclic–linear transfer identity of Part~2, read order by order, both delivers these and, as its main consequence for the \emph{linear} statistic, explains the traveling mode of the linear variance: comparison with the (first-order) mode-free symmetric cyclic profile shows that deleting one edge introduces a rising contribution whose balance against the falling cyclic bulk creates a ridge at \(n\asymp\sqrt{K_0N}\) with local optimizer \(K_0=C_1/β_1\). Uniform control of three ridge blocks proves this optimizer on every compact ridge window, upgrading the previously heuristic \(\sqrt N\) mode law to a theorem; the global localization of the exact maximizer remains open. We also record the corresponding cyclic reference-centered statistic under a fixed alternative and the leading Nabeya variance formula for the matched non-uniform cyclic statistic. Throughout, ``exact'' refers to the asymptotic coefficient in \(N\); the operative symmetry is cyclic stationarity (rotation invariance), not exchangeability.

comments
28 pages
fields
Statistics Theory, Probability
pdf ↗ page arXiv:2611.14735 ↗

Nonparametric regression conventionally assumes equispaced observations, a premise often violated by empirical data with irregular sampling and long-memory noise. This study establishes the asymptotic mean square ($L^2$) consistency of a weighted Nadaraya-Watson (wN-W) estimator for stochastic processes sampled at random times and perturbed by fractional Brownian motion (fBm). Leveraging the occupation time formula and Fernique's Theorem, we derive exact parametric restrictions on bandwidth and sampling rates ensuring convergence. We validate these theoretical findings via extensive simulations evaluating the mean squared error under varying noise persistence. Crucially, we explicitly benchmark the performance of the estimator under random sampling times against classical deterministic grids, while assessing the relative efficiency of quartic versus Gaussian kernels. Finally, we introduce an interactive Shiny application to dynamically visualize the admissible parameter space, and we empirically validate our theoretical framework by applying the estimator to the Vostok ice core paleoclimatological dataset. This real-world application demonstrates the practical capacity of the methodology to extract macroscopic trends while robustly avoiding severe overfitting under random sampling times.\

comments
20 pages, 5 figures
fields
Statistics Theory
pdf ↗ page arXiv:2611.14737 ↗

Many results in random matrix theory and high-dimensional statistics depend on weak convergence of spectral measures, which is usually established via pointwise convergence of Stieltjes transforms. This approach has recently been applied to signed measures. However, for signed measures, pointwise convergence of Stieltjes transforms alone no longer characterizes weak convergence. While this is unproblematic in many cases, in the high-dimensional regression setting, recently considered by Green and Romanov (2025), the underlying signed eigenvector-overlap measures can fail to converge weakly, despite pointwise convergence of their Stieltjes transforms. Using a novel approach to risk analysis, we show that weak convergence can be replaced by a simple convergence result for bilinear forms. This allows us to establish convergence of the prediction risk for estimators based on arbitrary continuous spectral filters, including (regularized) gradient descent and ridge regression, even when the underlying signed measures fail to converge weakly. Under additional regularity conditions, we construct an explicit finite signed measure yielding an integral representation of the asymptotic prediction risk. This representation provides necessary and sufficient conditions for minimum-norm interpolation and optimally tuned ridge regression to attain the smallest asymptotic prediction risk among estimators with continuous spectral filters. Moreover, we provide characterizations of weak and vague convergence of finite signed measures in terms of pointwise convergence of their Stieltjes transforms.

fields
Statistics Theory, Probability
pdf ↗ page arXiv:2611.14836 ↗

In empirical economics, regression discontinuity design (RDD) inference is commonly based on asymptotic normality under an independence assumption, but the running variables or disturbances may exhibit unknown and complex dependence. We first rigorously identify a fundamental dilemma for this conventional practice. To address it, we propose a validity recovery procedure that redefines the roles of bias and stochastic calibration, thereby decoupling data dependence from stochastic calibration. Taking the independence-assumption-based confidence interval as our inferential anchor, our procedure restores its validity while preserving its asymptotic leading constant, even when the data are dependent. For fixed-design RDD based on local linear regression, our intervals achieve asymptotically exact nominal coverage and, compared with the anchor, exploit higher-order smoothness without enlarging the asymptotic variance constant, attaining the minimax-optimal shrinking rates up to a mild factor, such as $\sqrt{\log T})$. The procedure requires neither specific dependence frameworks (e.g., mixing or physical dependence) nor dependence-modeling techniques (e.g., long-run variance estimation). For random-design RDD, under more specific dependence assumptions, we derive the rate-explicit coverage error at each nominal level and characterize the trade-off between this rate and interval length. Moreover, modeling dependence becomes an optional enhancement that can further enable validity recovery and improve finite-sample coverage, while averaging over repeated calibrations stabilizes the randomized center and protects against undercoverage in finite samples without increasing interval length. In short, under mild dependence and moment conditions, our procedure makes data independence an implementation default rather than a validity requirement. Simulations support the theoretical results.

fields
Statistics Theory
pdf ↗ page arXiv:2611.15279 ↗

In neural networks, distinct parameter configurations often realize the same input–output mapping, indicating that nominal parameter counts can overstate functional complexity. In this paper, we characterize the parameter-space symmetries of ReLU and Leaky ReLU networks across fully connected, convolutional, and residual architectures. We prove that every quasianalytic parameter map preserving the network function is a composition of positive channel scaling and channel permutation. By quotienting out both symmetries, we derive uniform covering-number upper bounds in which positive scaling reduces the complexity exponent from the total parameter count $S$ to $S-H$ (with $H$ denoting the number of scalable channels) and permutation symmetry divides the bound by the factorial count $G$ of channel permutations. We establish matching lower bounds showing that the exponent $S-H$ is sharp in general and that the divisor $G$ is attained for one-hidden-layer and generically identifiable networks. We further extend these results to general continuous piecewise-linear activated networks. Finally, we apply our covering-number bounds to derive statistical risk guarantees for empirical risk minimization and capacity control beyond i.i.d.\ settings, and show how the underlying symmetries help explain weight rebalancing in function approximation and flat directions in empirical risk optimization.

fields
Statistics Theory
pdf ↗ page arXiv:2611.15300 ↗

Flow and diffusion-based generative models achieve state-of-the-art quality, but require multiple forward passes at inference time, making them computationally costly. Consistency models overcome this by learning a flow map directly, enabling few-step generation and dramatically reducing the computation needed at test time. However, formal statistical guarantees for such one-step generators are scarce. Existing results either suffer from the curse of dimensionality or rely on impractical loss functions. We investigate whether one-step flow-based models can escape the curse of dimensionality under the assumption that the data distribution is generated by a low-dimensional surface perturbed with Gaussian noise. In this setup, we derive approximation and generalization error bounds for the flow map estimate that circumvent the curse of dimensionality. Our findings provide the first principled explanation for practical success of one-step flow-based generative models.

comments
52 pages; accepted at NeurIPS 2026
fields
Statistics Theory
pdf ↗ page arXiv:2611.15447 ↗

We study high-dimensional central limit theorems (CLTs) as hypothesis testing problems, comparing the number of summands needed for statistical and computational indistinguishability of the normalized sum from the limiting Gaussian distribution as the dimension and number of summands grow together. For the off-diagonal entries of sums of i.i.d. rank-one tensors formed from standard Gaussian vectors (equivalently, the problem of distinguishing Wigner from Wishart tensors), we prove total variation bounds sharpening previous estimates of Mikulincer (2020) and give matching polynomial-time tests. This shows that the statistical and computational thresholds coincide for this CLT, contrary to a proposal by Kunisky, Moore, and Wein (2024). On the other hand, we also show that, for tensors of order at least three, sufficient Gaussian dilution of the summands by adding independent Gaussian noise and rescaling gives a CLT model with a statistical-to-computational gap (in the above setting and ones with more general rank-one summand distributions). To the best of our knowledge, such a phenomenon has not been observed before in any high-dimensional CLT. In particular, in the relevant parameter regimes, we show that a brute-force search achieves strong detection, while polynomials of degree up to $n^{Ω(1)}$ cannot achieve strong separation. The latter lower bounds control low-degree $χ^2$-divergences by a novel method based on cumulant generating functions, and we further illustrate the use of these tools by applying them to masked tensor CLT models where only a prescribed subset of tensor entries is revealed.

comments
44 pages, 1 figure
fields
Statistics Theory, Probability
pdf ↗ page arXiv:2611.15803 ↗

In pre-deployment testing of AI systems such as AI agents, a developer can often deal with known failure modes (e.g., leaking API keys, deleting important databases, or installing a malicious package) by implementing fixes or making contingency plans for when the same issue might occur again. What is more challenging are the unknown unknowns: the unseen failure modes that haven't surfaced during testing. The decision to stop testing and deploy therefore faces an inherent tradeoff: continue testing to observe more behaviors, at the cost of time and resources, or stop testing and deploy, at the risk of failure modes remaining undiscovered. How then does the developer decide when they have tested enough? To answer this, we develop an algorithm that certifies when the probability of observing an unseen failure mode is sufficiently small. The algorithm constructs an anytime-valid upper confidence sequence on this quantity, so the developer can repeatedly test a system, inspect the bound, and decide to stop when it falls below a chosen threshold without invalidating the statistical guarantee. Our problem can be interpreted as a sequential variant of the missing-mass estimation problem which gave rise to the classic Good-Turing estimator (Good, 1953). On SWE-Chat, a dataset of real-world coding agent traces (Baumann et al., 2026), we implement our procedure and show that it achieves tighter upper bounds than a simple multiple-testing corrected Good-Turing baseline, and even dominates a fixed-horizon (non-multiple-testing-corrected) Good-Turing upper confidence bound, which is not anytime valid. Additionally, to better match realistic evaluation pipelines, we extend our method to handle sampling from a different task distribution and imperfect automated failure labeling.

comments
62 pages, 10 figures
fields
Statistics Theory
pdf ↗ page arXiv:2611.15835 ↗

We propose Fréchet oblique forests (FOF) for non-Euclidean regression with predictors and responses in metric spaces. An Alexandrov inner-product score defines directional splits in metric predictor spaces and recovers ordinary oblique splits for Euclidean predictors. Candidate splits are evaluated through pairwise response distances, avoiding repeated Fréchet mean computations during split search. Forest predictions minimize a weighted Fréchet criterion obtained by averaging leaf weights across trees. For compatible tree rules, we establish integrated consistency and polynomial risk bounds under explicit approximation and entropy conditions. Simulations with matrices, distributions, spherical data and mixed predictors, together with an application to taxi-flow networks, demonstrate competitive predictive performance.

comments
30 pages, 1 figure
fields
Statistics Theory
pdf ↗ page arXiv:2611.16209 ↗

Local manifold-fitting procedures smooth noisy observations over neighborhoods of scale $h$, inducing a systematic normal bias of order $h^2+σ^2$ that persists at the population level. We develop geometric bias cancellation (GBC), a multiscale framework for higher-order manifold recovery under ambient Gaussian noise. For procedures admitting a normal-bias expansion $c(h,σ)b(x)+O(h^4)$, we construct cross-scale correspondence using estimated normal fibers and show that second-order normal accuracy suffices for fourth-order correspondence accuracy. Canceling the leading geometric bias yields $O(h^4)$ population Hausdorff accuracy while preserving an embedded manifold diffeomorphic to the underlying manifold. We establish the required expansions and finite-sample recovery guarantees for successive tangent-space projection and Gaussian density ridges. For STSP, geometric bias cancellation also achieves an asymptotically vanishing Hausdorff error ratio relative to oracle bandwidth-tuned single-scale fitting. For the local contraction estimator of \citet{yao2023manifold}, we identify an obstruction to scalar bias cancellation and develop a directional cancellation achieving $O(σ^4)$ population Hausdorff accuracy with uniform positive reach, as well as fourth-order finite-sample accuracy when $n\gtrsimσ^{-(d+6)}\log(1/σ)$. Simulations confirm the predicted improvement from second- to fourth-order population bias.

comments
128 pages
fields
Statistics Theory
pdf ↗ page arXiv:2611.16235 ↗

The missing-at-random assumption underlies most analyses of incomplete data. Under nonmonotone missingness, it is especially stringent, imposing pattern-specific restrictions with different conditioning sets. A strictly weaker normalization condition is known to justify maximizing the observed-data likelihood. We show that every law satisfying this condition has a unique missing-at-random counterpart sharing its observed-data and complete-data distributions. Observed-data procedures developed under missing at random for identified functionals, including doubly robust estimators, therefore remain valid, with the same semiparametric efficiency bound. We then prove that the condition holds if and only if filling in the missing values from their conditional distribution under the true full model preserves the complete-data distribution, hence the name completion-invariant missingness. We use a characteristic kernel to compare the completed distribution with the fitted model and assess the joint compatibility of the specified full model and completion-invariant missingness. We derive the asymptotic null distribution with estimated parameters and establish bootstrap and multiplier calibration. Since a parametric full model alone need not identify completion-invariant missingness, we give identification conditions for Gaussian, Student $t$ and finite mixture families. Simulations assess sensitivity to departures from each assumption, and applications to clinical laboratory measurements and childhood growth illustrate the diagnostic.

fields
Statistics Theory
pdf ↗ page arXiv:2611.16278 ↗

Gaussian process regression models are widely used in modern statistics and machine learning due to their flexibility, interpretability, built-in uncertainty quantification, and strong theoretical foundations. However, training Gaussian processes (GPs) has a computational cost of $O(n^3)$, while the memory and prediction costs are also $O(n^2)$. For large datasets commonly encountered in practice, this becomes infeasible and necessitates the use of approximate posterior methods. In this work, we propose a class of approximations based on sparse covariance matrices, where the kernel matrix is sparsified according to the spatial proximity of the design points. We analyze the accuracy of the resulting approximate posterior distribution and show that the proposed approach preserves optimal statistical inference properties, provided that the dependencies among a sufficient number of neighboring points for each feature are retained. We derive explicit sufficient and necessary conditions on the number of neighbors required in a general setting and apply these results to standard kernels, including the squared exponential and Matérn kernels. Our theoretical findings are supported by numerical experiments.

fields
Statistics Theory
pdf ↗ page arXiv:2611.16482 ↗

We study drift parameter estimation for a positive stochastic process with singular mean-reverting drift driven by Gaussian noise. For Riemann-Liouville fractional Brownian noise with Hurst parameter $H>1/2$, an observable fractional transformation reduces the model to a semimartingale with drift linear in the unknown parameters. Using the quasi-likelihood approach, we derive explicit estimators of both drift coefficients. For a broader class of Gaussian driving processes, we construct a strongly consistent estimator of the ratio $a/b$, which has a natural mean-reversion interpretation, and verify the required assumptions for several Gaussian models. The theoretical results are complemented by a simulation study investigating the effects of the observation horizon and the discretization step on the finite-sample accuracy of the proposed estimators.

comments
24 pages, 7 figures
fields
Statistics Theory
pdf ↗ page arXiv:2611.16790 ↗

Minimum-distance fitting selects a degree threshold and a power-law exponent from the same network. We study the procedure that fits a continuous Pareto law with the Hill estimator and minimizes the Kolmogorov–Smirnov distance over retained ranks. For homogeneous linear preferential attachment and Norros–Reittu graphs with Pareto weights, we derive the joint limiting law of the selected rank, retained fraction of the threshold tie, and exponent error. The selector retains of order $n^{2/(α+2)}$ of $n$ vertices, where $α$ is the survival exponent. At this rank, integer spacing and finite-degree departures from a Pareto tail have the same order as sampling fluctuations. The exponent estimate is consistent and retains a shift on the scale used for confidence intervals. For integer degree laws whose tail sums have a first-order inverse-degree expansion, adding the retained tie fraction divided by the threshold to the Hill statistic removes the leading contribution of the tie. Under homogeneous preferential attachment with a fixed known number of edges per new vertex, removing the remaining model-specific term and calibrating for selection gives confidence intervals with asymptotically exact coverage. Observed networks show sensitivity of the fitted exponent and the classification of degree variance to threshold ties. Simulations assess interval coverage and show improved pooled connectivity predictions after correction under both specified graph laws. Changes to the Norros–Reittu weight distribution can reverse the prediction gain.

fields
Statistics Theory
pdf ↗ page arXiv:2611.16817 ↗

Accurate estimation of Moment Generating Functions is fundamental in many applications, but empirical estimators have high variances. Within a control variate setup, Extreme Value Theory is leveraged to identify how extreme values affect the variance reduction method's optimality.

fields
Statistics Theory
pdf ↗ page arXiv:2611.17016 ↗

We compare the least squares estimator (LSE) with the $\ell_{1}$-estimator recently introduced by Baraud and Maillard~\citeyearpar{BM-2026} for estimating a regression function under a fixed design, when the errors are independent but possibly heteroscedastic and heavy-tailed. We show that the two estimators coincide on the class of nondecreasing (or nonincreasing) functions on an interval. As a consequence, the isotonic LSE inherits the non-asymptotic $\ell_{1}$-risk bounds of the $\ell_{1}$-estimator, which only require a moment of order $p\in[1,2]$ on the errors and depend on the average of their $p$-th absolute moments rather than on their maximum. This coincidence no longer holds on the nonconvex class of unimodal functions: we exhibit a heteroscedastic Gaussian example in which the LSE is inconsistent while the $\ell_{1}$-estimator converges at the parametric rate. Finally, we show on a one-dimensional linear model that neither estimator dominates the other: depending on the way the noise is distributed among the design points, the LSE may converge at rate $1/n$ while the $\ell_{1}$-estimator is inconsistent.

fields
Statistics Theory
pdf ↗ page arXiv:2611.17082 ↗

We revisit the problem of estimating $k$ linear regressors with self-selection bias in $n$ dimensions up to error $\varepsilon$ with the maximum self-selection criterion, as introduced by Cherapanamjeri, Daskalakis, Ilyas, and Zampetakis [CDIZ23, STOC]. Our main result is a $\mathrm{poly}(n,k,1/\varepsilon)$ time algorithm for the unknown-index variant of this problem, thereby improving upon the running times of the best known algorithms due to Gaitonde and Mossel [GM24] and Kalavasis, Mehrotra, and Zhou [KMZ26, COLT] with exponential dependence on $k$. Our algorithm succeeds in the presence of correlated noise between regressors, which captures the related setting of max-affine regression. Consequently, we also give the first polynomial-time algorithm for this problem, improving on the prior works of Ghosh, Pananjady, Guntuboyina, and Ramchandran [GPGR22, IEEE Transactions on Information Theory] and Gaitonde and Mossel [GM24] with exponential dependence on $k$. Prior works exhaustively search over a $k$-dimensional subspace spanned by the regressors, using conditional moments of the response to test candidates. In contrast, our algorithm is driven by an improved understanding of the moments of the covariates. We show that, restricting to observations with large response values, the degree-$(\log n)$ Hermite moment of the covariates approximately decomposes as a sum of tensor powers of the regressors. The first step of our algorithm can be viewed as a tensor decomposition algorithm for these implicitly represented high-order tensors, which outputs unit vectors parallel to the regressors. A secondary step based on a simple variant of ordinary least squares extracts estimates for the regressors given these unit vectors. We believe our analytic insight and algorithmic components may have applications to designing efficient algorithms for other latent-variable problems.

fields
Statistics Theory
pdf ↗ page arXiv:2611.17228 ↗

Auxiliary information can improve estimation precision under probability sampling, but the relationship between the study and auxiliary variables may not be known well enough to specify suitable balancing variables. Distributionally balanced designs address this by targeting agreement between sample and population auxiliary distributions. We extend energy-based distributional balance to prescribed unequal inclusion probabilities by comparing the empirical sample distribution with an inclusion-probability-weighted population distribution. Under a regularity condition relating the study values divided by their inclusion probabilities to the auxiliaries, we establish an upper bound on the design variance of the Horvitz-Thompson estimator in terms of the expected energy distance. This bound motivates an algorithm that exchanges units between randomly paired candidate samples without increasing their average energy distance. Combined with random initialization and uniform selection of a final candidate, the procedure preserves the prescribed first-order inclusion probabilities. We evaluate its auxiliary-space properties and estimation performance using generated populations and the Meuse data.

fields
Statistics Theory
pdf ↗ page arXiv:2611.17273 ↗

Classical Analysis and ODEs18

OpenAI proved that a compact set $E\subset{\mathbb R}^d$ of Hausdorff dimension greater than $\frac{d}{2}$ determines a set of Euclidean distances of positive length. We give a complete proof of this theorem which follows the overall architecture of the OpenAI argument, from the construction of the initial pair measures to the final Fourier estimate, but which modifies that argument substantially at the points where the geometric costs are paid and where the estimates are reassembled. The reductions are organized by the descent and chaining viewpoint of Burstein, Iosevich, and Krause: one potential, built from two separated depths together with a penalty for insufficient separation, pays for every reduction on every interval of scales, the terminal intervals included, and a finite-record chaining lemma keeps the fixed power losses attached to the few reductions which incur them. In odd dimensions the radial improvement is obtained directly at each finite scale from a quantitative contact interval, chosen by minimizing a mass curve against lines of two slopes, with explicit margins in place of a compactness argument, and the conditional estimates on the three parts of that interval are multiplied by a lemma on full source fibers. A random sign identity represents the coarse pair filter by products of endpoint multipliers and reduces the cost of reassembling the spatial pieces inside the shell estimate. The argument gives more than positive length. Since the mass first excluded near heavy hyperplanes at each late scale is summable with a power rate, all the Fourier estimates compare with one fixed measure, and the distance set supports a probability measure with an $L^p$ density for some $p>1$ and with power Fourier decay, so that $Δ(E)$ has positive Fourier dimension.

fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.14867 ↗

In this paper, we prove the one-weight reverse fractional integral operators \[ \|I_s f\|_{L^q(w^q)}\geq C_w\|f\|_{L^p(w^p)} \] holds for all nonnegative measurable functions $f$, with $\frac ns<p<1$ and $\frac1q=\frac1p-\frac sn$, if and only if $w^{p/(1-p)}\in A_{\frac{p(s-n)}{n(1-p)}}$. Furthermore, we show the lower bound \[ C_w\gtrsim_{n,s,p}[w]_{p,q}^{\min\left\{\frac{p(n-s)}{n(1-p)},\frac{p(n-s)}{sp-n}\right\}}, \] and the exponent is sharp. We also investigate when the reverse weak-type estimate \[ \|I_s f\|_{L^{\frac{n}{n-s},\infty}(w^{\frac{n}{n-s}})}\geq \frac{n}{s}\,v_n^{(n-s)/n}[w^{\frac{n}{n-s}}]^{(n-s)/n}_{A_1}\|f\|_{L^1(w)} \] holds if and only if $w^{\frac{n}{n-s}}\in A_1$.

fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.15075 ↗

Let $G=(V_G,E_G)$ be a finite connected graph (here $V_G$ and $E_G$ denote the set of vertices and edges of $G$ respectively). The primary aim of this paper is to study the sharp variation and $L^p$ inequalities of the centered Hardy–Littlewood maximal operator $M_G$ defined on $G$ and its fractional variant $M_{α,G}\,(0<α<1)$). Set $${\bf C}_{α,G}^{p,q}=\sup\limits_{{\rm Var}_{p,G}(f)>0}\frac{{\rm Var}_{q,G}(M_{α,G}f)}{{\rm Var}_{p,G}(f)},$$ where ${\rm Var}_{p,G}(f)$ denotes the $p$-variation of $f$ on $G$. We denote by $K_n$ (resp., $S^n$) the complete (resp., star) graph with $n\geq4$ vertices. When $α=0$, we prove ${\bf C}_{α,S_n}^{p,p} =1-\frac{1}{n}$ for $0<p<1$. This solve a question originally posed by Liu and Xue in 2021. In the fractional case $0<α<1$, we prove ${\bf C}_{α,S_n}^{1,q}=1-n^{-α}$ and ${\bf C}_{α,K_n}^{1,q} =(1-n^{α-1})(n-1)^{-α}$ for $q=\frac{1}{1-α}$, which provide some examples focusing on sharp variation inequalities of fractional maximal operators. The sharp variation inequalities of uncentered fractional maximal operators are also established. In addition, the sharp $L^p$ inequalities of uncentered fractional maximal operator $\widetilde{M}_{α,G}$ are also studied. More precisely, we obtain lower bounds and upper bounds for $C_{q,G}$ such that the inequality $\|\widetilde{M}_{α,G}f\|_q\leq C_{q,G}\|f\|_p$ holds and the complete graphs $K_n$ and star graphs $S_n$ are two extreme graphs that reach the lower bound and upper bound respectively.

fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.15377 ↗

For nonempty Borel sets $E\subset\mathbb R^d$ and $Θ\subset O(d)\times\mathbb R^d$, where $d\ge2$, let $Θ(E)$ be the union of the rigid copies $gE+z$, where $(g,z)\inΘ$. We prove that $Θ(E)$ has positive Lebesgue measure whenever $\dim_{\mathrm{SF}} E+\dim_HΘ>\frac{d(d+1)}2$, where $\dim_{\mathrm{SF}} E$ is the spherical Fourier dimension of $E$. This resolves a conjecture on packing by arbitrary Borel families of rigid motions. Our proof develops a discrete-to-continuous framework by adapting a finite-field averaging argument to $\mathbb R^d$ using Sobolev estimates on the group of rigid motions. We also obtain analogous packing results for similarities. The same framework can be used to show that if $τ$ is a compactly supported probability measure on the similarity group with finite $\bigl(\frac{d(d-1)}{2}+1\bigr)$-energy, then every compactly supported $τ$-stationary probability measure on $\mathbb R^d$ has a smooth density. We deduce that a nonempty compact set has nonempty interior if its family of similarity self-embeddings has Hausdorff dimension greater than $\frac{d(d-1)}{2}+1$.

comments
47 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.15402 ↗

We prove that the maximal operator over line segments in $N$ arbitrary directions on a real algebraic curve of degree $D$ in $\mathbb R^n$ has $L^2$ operator norm at most $C_{n,\varepsilon}D^{C_n}N^\varepsilon$ for every $\varepsilon>0$, with $C_n$ independent of $\varepsilon$. Combined with polynomial partitioning, this gives the sharp bound $N^{\frac14}$, up to a polylogarithmic factor, for $N$ arbitrary directions in $\mathbb R^3$. The first main ingredient is a new quantitative strengthening of the property that the curve crosses each affine hyperplane at most $D$ times. This condition controls the overlap of variable-width neighborhoods of hyperplanes. The width attached to each direction is a small multiple of its distance to the osculating hyperplane at an endpoint of its arc. The problem is projectively invariant, and a projective almost orthogonality principle turns the overlap control into the $L^2$ bound. The second main ingredient, building on the complex cellular preparation of Binyamini and Novikov, is a new effective decomposition of algebraic curves. Up to $D^{C_n}$ points, the curve is covered by $D^{C_n}$ arcs whose coordinates, in a suitable parametrization and projective frame, are monomials with distinct exponents times nearly constant units. In these charts we verify the quantitative crossing condition with polynomial dependence on $D$. The framework also applies to nonalgebraic curves with doubling Frenet curvature measures. Consequences include local Sobolev maximal estimates along measurable vector fields with values in an algebraic curve, and the same bounds, up to a logarithmic factor, for directional Calderón–Zygmund operators.

comments
69 pages, submitted for publication
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.15517 ↗

We extend Artin's characterizations of the gamma function to the multiple setting by means of the Kubert identity. We obtain uniqueness theorems for positive continuous solutions of a difference equation $G(z + 1) = α(z)G(z)$ that also satisfy an Artin-type multiplication formula, remaining within the class of continuous functions under a modest initial condition. The results apply in particular to the Barnes multiple gamma functions and the Kurokawa multiple sine functions.

comments
9 pages, no figures
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.15679 ↗

The Erd\H os similarity conjecture says that for every infinite set $A \subset \mathbb{R}$, there exists a set $E$ of positive Lebesgue measure which does not contain any affine copy of $x + tA$ of $A$ (with $t \neq 0$). Kolountzakis proved that for every infinite $A$, there exists $E$ of positive Lebesgue measure so that the exceptional sets $D_E(A)$ of scales $t$, and $\mathcal E_E(A)$ of affine maps $(x,t)$, for which $x+tA\subseteq E$, are both Lebesgue null. We show that these exceptional parameter sets are small in two finer senses. First, given any countable family of Fourier decay rates, a single $E$ can be constructed so that $D_E(A)$ is null with respect to every measure whose Fourier transform decays at one of these rates. Consequently, there are compact sets $K$ of measure arbitrarily close to $1$ for which $D_K(A)$ and $\mathcal E_K(A)$ have modified Fourier dimension zero. Second, we give a criterion, depending both on the growth of a gauge function $h$ and on the gaps between elements of lacunary sequences in $A$, which guarantees that $\mathcal H^h(D_E(A))=0$ for gauges with $h(u)/u\to\infty$, as well as a similar result for $\mathcal E_K(A)$. For sets such as $A = \{1/n!\}$ and $A = \{e^{-n^q}\}$, this yields explicit gauges of the form $h(u) = u\exp((\log 1/u)^θ)$ with $0 < θ< 1$.

fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.15734 ↗

We present a short, self-contained proof of the averaging-operator criterion for the boundedness of the Hardy-Littlewood maximal operator on variable Lebesgue spaces over unbounded spaces of homogeneous type. Building on techniques of Diening and Lerner, we establish a Jensen-type inequality with uniformly summable error, from which the criterion follows directly via a Calderón-Zygmund argument.

fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.15808 ↗

We investigate the relationship between the $L^p$ integrability of functions and the curvature geometry of their Fourier support. We prove that if $M\subset\mathbb{R}^n$ is a $C^n$ manifold of dimension $d$ and $n>2d$, then every $u\in L^p(\mathbb{R}^n)$ with $\operatorname{supp}\widehat u\subseteq M$ vanishes whenever \[ 2\le p\le\frac{6n-4}{3d-1}. \] This strictly improves the classical threshold $2n/d$ throughout the range $n>2d$. More generally, we obtain a family of dimension-dependent improvements in higher codimension. As a consequence, we obtain a strict quantitative improvement in the necessary conditions for Fourier restriction when $n>2d$, resolving a conjecture of Mockenhaupt \cite{Mockenhaupt96}. This further establishes the nonexistence of quadratic manifolds satisfying the Christ–Mockenhaupt condition when $n>2d$. For quadratic manifolds, we obtain spectral synthesis bounds from joint sublevel estimates for the eigenvalues of the normal Hessian pencil. In codimension two, we determine the exact critical exponent from the ranks and eigenvalue vanishing orders, including nonexistence at the critical endpoint. We also obtain integrability bounds for manifolds with constant relative nullity, extending Guo's hypersurface results \cite{Guo93} to higher codimension. Finally, we use the Fourier ratio as a measure of the geometric complexity of individual strata of the characteristic set to establish $L^p$ uniqueness criteria for homogeneous constant-coefficient PDEs.

fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.15970 ↗

We study convergence, divergence, and approximation of matrix-transform means of Vilenkin–Fourier series. For bounded groups, we prove convergence along ${M_n}$ at Vilenkin–Lebesgue points without additional diagonal conditions. For arbitrary bounded or unbounded groups, every regular matrix-transform method admits divergence on any prescribed null set along any increasing sequence. We also obtain $L_p(G_m)$ approximation estimates in terms of the modulus of continuity.

fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.15972 ↗

We study the least constant $C_*$ in the two-weight Hardy inequality from $L^p(σ)$ to $L^q(ω)$ for the operator $H_σg(x)=\int_{(0,x]}g\,dσ$, where $σ$ is a Borel measure on the half-line that is finite on each interval $(0,x]$ and $ω$ is a $σ$-finite Borel measure there, atoms allowed. Let $\mathcal A$ be the Maz'ya–Rozin functional and let $1<p<\infty$. For $0<q<p$ we find the best factor $κ_{p,q}$ in $C_*\leκ_{p,q}\mathcal A$. For $1\le q<p$ we prove $C_*\ge\mathcal B\ge\mathcal A$, where $\mathcal B$ is a Lebesgue–Stieltjes form of $\mathcal A$. The factor $1$ is best possible. For $0<q<1$ we give a lower factor valid for all such measures and an upper bound for the best lower factor. This bound comes from atoms of $ω$. It is smaller than the lower factor proved by Sinnamon (1991) for weights. A two-atom example shows that the bound is not always sharp. The proofs use a reverse martingale with Doob's inequality, a special function of Osękowski (2015), a quantile coupling and a splitting of atoms. The same tools recover the theorem of Li and Mao (2020) for $1<p\le q$, in the closed-interval form of Klaassen and Wellner (2021). They also recover the two-sided estimate of Sinnamon and Stepanov (1996) for $0<q<p$, which goes back to Maz'ya (1979) for $q\ge1$ and to Sinnamon (1991) for $q<1$. We also treat the case $p=1$ and a discrete criterion.

comments
39 pages, 2 tables. Ancillary file: exact rational recheck of the numerical steps in the proof of Theorem 2.7(3)
fields
Classical Analysis and ODEs, Functional Analysis, Probability
pdf ↗ page arXiv:2611.16007 ↗

This paper solves the fixed-length recurrence problem posed by Horozov, Shapiro and Tater. For the rational Darboux transformations specified here, it also resolves the order and classification questions raised by their two conjectures. It classifies monic polynomial sequences whose members are eigenpolynomials of one fixed nonscalar differential operator of arbitrary finite order with polynomial coefficients and for which multiplication by the variable involves a fixed number of consecutive polynomials. Orthogonality is not assumed, and only sufficiently large degrees need be prescribed. If the lowest recurrence index is $n-m+1$, with $m\ge3$, the differential order equals $m$ times the degree of the eigenvalue as a polynomial in $n$. After translating the variable, every such sequence is a finite rational Darboux transform of an explicit family with differential order $m$ and eigenvalue $n$. Necessary and sufficient conditions on the factors determine all polynomial differential eigenoperators of the resulting family. For families that cannot be obtained by these transformations from families of smaller minimum differential order, the minimum differential and recurrence orders coincide. All such families are classified in minimum differential orders at least three, including additional families in composite orders.

fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.16547 ↗

Let $\mathsf{E}\subset\mathbb{R}$ be compact. We derive local scaling limits of the Chebyshev polynomials associated to $\mathsf{E}$ at a gap edge. We describe the scaling limits by a one parameter family of functions explicitly given by elliptic integrals. We show that for the union of two generic intervals all functions in this family are in fact attained as limits. As a consequence, we describe the local scaling behavior of the zeros of the Chebyshev polynomials at the gap edge.

fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.16580 ↗

In this note, we study the defect set of a symmetric analytic matrix field $M$ defined on an open set $Ω\subset \mathbb{R}^d$ with $d\ge2$. A defect point $x \in Ω$ of $M$ is defined as a point for which no eigenframe can be chosen continuously in any neighborhood of $x$. We show that the defect set $S(M)$ is contained in a locally finite union of analytic submanifolds of codimension at least $2$. The proof follows fairly directly from results by Parusinski and Rond (Trans. Am. Math. Soc., 2020) and by Kurdyka and Paunescu (Duke Math. J., 2008). This result can be applied in the context of the Landau-de Gennes Theory to estimate the physical defects of a nematic liquid crystal.

fields
Classical Analysis and ODEs, Analysis of PDEs
pdf ↗ page arXiv:2611.16660 ↗

For every $n\geq 2$, we construct a domain in $\mathbb{R}^n$ whose harmonic measure has packing dimension $n$. That is, the packing analogue of Bourgain's constant is zero, in contrast with Bourgain's constant, which is positive. Moreover, the elliptic measure of the same domain also has packing dimension $n$ for every uniformly elliptic matrix.

fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.16945 ↗

For any Hausdorff gauge \(h\), we prove that all level sets of planar Brownian motion have zero \(h\)-measure almost surely if and only if \(\liminf_{r\to0^+}h(r)\log(1/r)=0\). This resolves Taylor's question for arbitrary Hausdorff gauges. The proof yields \(0<\HH^{h_0}(L_x)<\infty\) for some \(x\) almost surely, where \(h_0(r)=1/\log(1/r)\). The Hausdorff dimensions of the spatial mass superlevel sets form a deterministic, strictly decreasing bi-Lipschitz spectrum. For each fixed positive mass below the supremum, the exact-mass set almost surely has the same dimension as the corresponding superlevel set.

comments
22 pages
fields
Classical Analysis and ODEs, Probability
pdf ↗ page arXiv:2611.17002 ↗

We complete the classification of algebraic relations among solutions of equations in the second Painlevé family $P_{II}(α): y''=2y^3+ty+α$, where $α\in\mathbb{C}$. More precisely, we prove that if $y_1,\ldots,y_n$ are generic solutions of $P_{II}(α_1),\ldots,P_{II}(α_n)$, respectively, and $tr.deg_{\mathbb{C}(t)}\mathbb{C}(t)(y_1,y_1',\ldots,y_n,y_n')<2n$, then for some $i<j$, we have that $α_i\pmα_j\in\mathbb{Z}$, and $y_i=T(y_j)$ for a classical Bäcklund transformation $T$. In particular, the classical Bäcklund transformations are the only Bäcklund transformations in the second Painlevé family.

fields
Classical Analysis and ODEs, Logic
pdf ↗ page arXiv:2611.17179 ↗

A central theme in modern harmonic analysis, with strong connections to Ramsey theory, is the tension between randomness and structure: to what extent can a "large" set avoid prescribed configurations, and when must such patterns inevitably appear? The answer depends delicately on how size is measured, with notions such as Hausdorff dimension, Fourier dimension, and density leading to strikingly different phenomena. In this mini-course, we explore this theme through two complementary perspectives. On one hand, we study translation-invariant linear patterns, a natural class of Euclidean Ramsey-type configurations. On the other hand, we investigate distance sets of sparse subsets of Euclidean space, which encode metric configurations of pairs of points. Together, these results illustrate a unifying principle: while sparse sets may avoid individual configurations, sufficiently strong analytic or geometric conditions enforce the emergence of Ramsey-type structure. The course will emphasize key ideas, methods, and examples, aiming to provide an accessible entry point to current developments at the interface of harmonic analysis, geometric measure theory, and Euclidean Ramsey theory. Lectures are by Malabika Pramanik.

comments
30 pages, 3 figures. To appear in the Springer volume 'Discrete Harmonic Analysis' in the Bolyai Society Lecture Notes Series
fields
Classical Analysis and ODEs, Combinatorics
pdf ↗ page arXiv:2611.17198 ↗

Complex Variables17

We study representing systems of Cauchy kernels or dilations of a given function in Hardy spaces. We give a complete geometric description of countable sets $Λ\subset \mathbb{D}$ such that the system $\{\hat{k}_λ\}_{λ\in Λ}$ of normalized Cauchy kernels forms a generalized frame in the Hardy space $H^p(\mathbb{D})$ with $p \in (1, \infty)$ with respect to a particular coefficient space. For a wide class of functions we construct representing systems of their dilations in $H^2$. We also obtain a linear method for expanding functions in series of Cauchy kernels in $H^2$.

comments
20 pages
fields
Complex Variables, Functional Analysis
pdf ↗ page arXiv:2611.14555 ↗

We consider mappings between domains of two Riemannian surfaces. The main subject of the investigation are families of homeomorphisms with moduli inequalities. For such families, we obtain the uniform openness (uniform lightness). As a consequence, we obtain similar results for homeomorphisms of Sobolev classes with finite distortion whenever its maximal dilatations have a majorant integrable on almost all concentric circles. In particular, we obtain the Koebe-type theorem for both direct and inverse Sobolev mappings.

fields
Complex Variables
pdf ↗ page arXiv:2611.14792 ↗

Let $K\subset\Bbb C^N$ be compact and let $f=(f_1,\dots,f_N)$ be a smooth map on a neighbourhood of $K$. We give sufficient conditions for the algebra generated by $z_1^{m_1},\dots,z_N^{m_N}$ and $f_1,\dots,f_N$ (or by all monomials of degree $n$ and $f_1,\dots,f_N$) to be dense in $C(K)$. We appropriately extend the techniques developed in our previous works [3,4,6] and [8] for algebras of functions on the complex plane to tackle the problem in the several-variable setting. More precisely, the argument separates a purely algebraic reduction, in which the rotated graphs are glued one coordinate at a time, from the study of the single graph of $f$. For the latter we give an exact computation of the Levi form of $|w-f|^{2p}$, which yields a Hermitian matrix criterion on the polynomial hull of the graph; a criterion by peak functions that removes the invertibility hypothesis from a theorem of Preskenis; a division theorem for $f_j=\bar k_jh_j$ with degenerate holomorphic factors $h_j$; and a treatment of the singular set $\{\det(\partial f_i/\partial\bar z_j)=0\}$, which in several variables is not finite. The angle $π/m_j$ in the reduction is shown to be sharp.

comments
26 pages
fields
Complex Variables
pdf ↗ page arXiv:2611.14973 ↗

We study the two-step Lempert function and the pluricomplex Green function near a non-semipositive boundary point of a bounded domain $D\subset\mathbb{C}^n$. We prove a sharp upper estimate for the two-step Lempert function in terms of the local boundary scale $H_D$, and obtain matching estimates for the pluricomplex Green function. As a consequence, these quantities have the same boundary behaviour as the Kobayashi distance. For the usual Lempert function, we prove an upper estimate of order $\sqrt{H_D}$, which implies the optimal local $1/4$-Hölder estimate, and determine its precise boundary behaviour along the real normal.

fields
Complex Variables
pdf ↗ page arXiv:2611.15261 ↗

We study quasihyperbolic distance and geodesic uniqueness in the plane punctured at 0 and 2. For endpoints on the perpendicular bisector of the punctures and on opposite sides of the real axis, the distance is the smaller of the length of the vertical segment and the least length of a feasible detour. For symmetric endpoints 1 \pm it with t > 0, the geodesic is unique precisely when arsinh t + arctan t < π. At equality there are exactly three geodesic images, and above the threshold there are exactly two. For arbitrary endpoints, we derive variational formulas for the distance in terms of admissible logarithmic spirals and their contacts with the bisector. The minimizing candidates in these formulas give all geodesic images and yield a length-comparison criterion for uniqueness.

fields
Complex Variables
pdf ↗ page arXiv:2611.15265 ↗

We study zeros of the Bergman kernel on the generalized Hartogs triangles $H_γ=\{(z_1,z_2)\in\mathbb C^2:|z_1|^γ<|z_2|<1\}$. For every real $1<γ<2$, suitable sections near the singular vertex contain exactly $\lceil(γ-1)^{-1}\rceil-1$ zeros in a prescribed disk, all of them simple. This answers a question of Edholm and Mathew [\emph{Math. Z.} \textbf{313} (2026)] and, together with the known cases, shows that $H_γ$ has a zero-free Bergman kernel precisely when $γ$ is the reciprocal of a positive integer. We also fix the second kernel argument and a complex line in the first argument, and prove that the total number of zeros on the admissible section is comparable to $(γ-1)^{-1}$ as $γ\to1^+$; a comparable number are simple and nonreal. For the sections near the vertex, all but at most one of the counted zeros concentrate near the unit circle, and the angular counting error is uniformly bounded.

comments
23 pages
fields
Complex Variables
pdf ↗ page arXiv:2611.15406 ↗

We prove that a reduced complex analytic germ is weighted homogeneous if and only if, in suitable local coordinates, it admits a holomorphic vector field vanishing at the origin and pointing strictly outward along a single sufficiently small link. On a connected link, transversality suffices. The criterion applies in arbitrary codimension, including to non-isolated singularities. The proof uses a compact composition operator to control the spectrum on the Zariski tangent space and obtains a positive grading from the resulting spectral condition.

comments
6 pages
fields
Complex Variables, Algebraic Geometry
pdf ↗ page arXiv:2611.16268 ↗

The Schwarz lemma bounds the differential at the origin of a holomorphic self-map of the unit disc fixing $0$: $|f'(0)|\le1$. For monogenic maps in $\mathbb R^3$, the optimal constant is not known. Let $\mathcal M$ be the class of monogenic functions $f$ from the unit ball of $\mathbb R^3$ to the reduced quaternions with $|f|\le1$ and $f(0)=0$, and let $C_*=\sup_{\mathcal M}|f'(0)|$, where $f'=\partial_0f$ is the hypercomplex derivative. We show that $\frac{80}{61}\le C_*\le1.35784$. Thus the classical bound $1$ fails, while $C_*$ stays below the sharp constant $\frac32$ for harmonic maps of the ball into itself. The estimates rest on a reduction, by rotation covariance and averaging about the $x_0$-axis, to a convex extremal problem in one variable for zonal harmonic functions. Lower bounds come from restricting this problem to polynomials, and upper bounds from its dual formulation in terms of vector fields on the sphere.

fields
Complex Variables
pdf ↗ page arXiv:2611.16332 ↗

We study the singular sets of pointwise bounded-above envelopes of families of functions. For families of subharmonic functions on open subsets of $\mathbb C$, of plurisubharmonic functions on open subsets of $\mathbb C^N$, and, more generally, of functions subharmonic in each complex variable separately, we prove that the singular set of a pointwise bounded-above envelope is relatively closed and nowhere dense. In contrast, for $N\ge3$ we construct a sequence of subharmonic functions on $\mathbb R^N$ whose upper envelope is finite everywhere but nowhere locally bounded above. We also characterize the singular sets that arise for admissible classes of functions, both with and without a continuity assumption, and give applications to separately subharmonic functions.

fields
Complex Variables
pdf ↗ page arXiv:2611.16348 ↗

Cegrell and Sadullaev showed that a separately harmonic and subharmonic function is subharmonic outside the product of two closed nowhere dense sets. We obtain sufficient conditions, expressed in terms of the second set, under which the function is subharmonic on the whole domain. In particular, we prove that this holds whenever the second set is polar.

fields
Complex Variables
pdf ↗ page arXiv:2611.16360 ↗

We define and study three Möbius invariant functionals for multiply connected planar domains with finitely many boundary components: the Loewner energy, the renormalized volume, and the Grunsky determinant. Using quasiconformal variations, we prove that when the boundary curves are sufficiently regular, the three functionals differ only by a modulus-dependent constant. We also prove that the Loewner energy is finite if and only if every boundary curve is a Weil–Petersson quasicircle. Moreover, we prove that the three functionals all attain their unique extremal value at the circle domains. In particular, the Loewner energy is zero if and only if it is evaluated at a circle domain. Finally, we use the minimization of Loewner energy to give a new proof of the finitely connected version of Koebe uniformization theorem.

comments
56 pages, 3 figures
fields
Complex Variables, Differential Geometry
pdf ↗ page arXiv:2611.16503 ↗

In this paper, we establish a Jackson $q$-difference analogue of Jack's lemma and its higher-order extension by Miller and Mocanu, which serve as cornerstone tools in geometric function theory and differential subordination. Applying this foundation, we establish $q$-counterparts of Nunokawa's boundary theorem and the Miller-Mocanu subordination lemma, and deduce applications to circular enclosure bounds. All obtained results naturally recover their classical counterparts in the limiting case as $q \to 1^-$.

comments
13 pages
fields
Complex Variables
pdf ↗ page arXiv:2611.16698 ↗

We prove that a boundary point $p$ of a bounded pseudoconvex domain in $\mathbb{C}^n$, $n\ge2$, is strictly pseudoconvex if the boundary is locally $C^{2,α}$ near $p$, $0<α\le1$, and the squeezing function tends to one along the inward normal. Neither finite type nor convexity is assumed. Under local $C^2$ regularity alone, the same limit gives the normal logarithmic Bergman-kernel growth exponent $n+1$. The proof uses normalized Bergman-kernel profiles and holomorphic translation semigroups on the ball.

fields
Complex Variables
pdf ↗ page arXiv:2611.16703 ↗

For a conformal map $g$ of the unit disc $U$ onto any bounded convex domain $Ω$ we determine the invariant subspaces for the integration operator $T_gf = \int_0^zfg'$ on the Hardy space $H^p$, by means of a Fock space model. Under some additional regularity assumptions on $\partialΩ$ we also treat integration from a boundary point of $U$, and we determine the residual subspaces (those invariant subspaces on which the operator has empty spectrum) for the left inverse $D_gf = f'/g'$ of $T_g$ on the smooth disc algebra $A^\infty$. The latter result is new even for $Ω= U$.

fields
Complex Variables, Functional Analysis
pdf ↗ page arXiv:2611.16734 ↗

The main purpose of this paper is to establish the tropical Nevanlinna theory to piecewise linear real functions with arbitrary first-kind discontinuities (called generalized tropical meromorphic functions). The key point is that we introduce the directional jump counting functions $J^+(r,f)$ and $J^-(r,f)$ for the case of arbitrary first-kind discontinuities to refine the single function $J(r,f)$ in the previous theory. We first obtain the new tropical version of the Poisson-Jensen formula, the first main theorem. Under the assumption that $f$ is slope-admissible, we show that $T(r,f)$ is nondecreasing and establish a logarithmic derivative lemma. These results unify the classical continuous case due to Halburd and Southall and the one-sided continuous case due to Halonen, Korhonen and Filipuk. As applications, we study several first-order and second-order ultra-discrete equations, showing that certain equations admit infinitely many generalized tropical meromorphic solutions, and that under suitable conditions infinite-order solutions also exist. Finally, using the logarithmic derivative lemma obtained above, we establish a tropical Clunie lemma.

comments
29 pages, 5 figures
fields
Complex Variables
pdf ↗ page arXiv:2611.16799 ↗

Let $f$ be a transcendental entire solution of order less than 1 of the linear difference equation \begin{equation*} \sum_{j=0}^{m}P_j(z)Δ^j f(z)=0, \qquad P_m\not\equiv0, \end{equation*} where $P_0,\ldots,P_m$ are polynomials. Applying the inverse Newton transform $\Scal$, which sends $\fall{z}{n}$ to $z^n$, we obtain a function $g=\Scal f$ satisfying a linear differential equation with polynomial coefficients. We then show that the completely regular growth of $g$ transfers to $f$. Consequently, $f$ is of completely regular growth and the zeros of \(f\) are regularly distributed. An example involving the \(Γ\) function is given to shows that the condition order less than $ 1$ cannot be relaxed.

fields
Complex Variables
pdf ↗ page arXiv:2611.16865 ↗

We construct logarithmic potentials with positive masses at a sequence of points tending to infinity and with no critical points. These potentials can have any prescribed order $ρ\in [1/2, 1)$; for $ρ= 1/2$ we obtain examples of both normal and maximal type. For $1/2 < ρ< 1$, the masses at conjugate poles are prescribed by a power law. We determine the pole asymptotics and the angular growth of these potentials. For sums of simple fractions with absolutely summable complex residues and nonzero sum of residues, we prove the existence of infinitely many zeros and compare their counting function with that of the poles.

comments
25 pages, 4 figures
fields
Complex Variables
pdf ↗ page arXiv:2611.17218 ↗

Functional Analysis16

We prove the bounded approximation property for Banach function lattices with order continuous norm on which the Hardy-Littlewood maximal operator is bounded. This allows us to develop a general framework for the quantitative interpolation of compact operators, understood in terms of the essential norm, encompassing a large class of function spaces including weighted Lebesgue spaces, rearrangement invariant Banach function spaces, and variable exponent Lebesgue spaces. Combined with extrapolation techniques, we show how to transfer compactness (or, more generally, control of the essential norm) from unweighted Lebesgue spaces to the three aforementioned classes of function spaces. Finally, we present several applications in analysis and partial differential equations.

journal
J. Math. Anal. Appl. 568 (2027)
fields
Functional Analysis, Classical Analysis and ODEs
pdf ↗ page arXiv:2611.14807 ↗

Let \(0<p,q<\infty\). We prove \[ L_q(0,1)\hookrightarrow\mathcal C_{p,q} \quad\Longleftrightarrow\quad q=2. \] As a consequence, we obtain, for all \(0<p_1,q_1,p_2,q_2<\infty\), \[ L_{p_1,q_1}(0,1)\hookrightarrow\mathcal C_{p_2,q_2} \quad\Longleftrightarrow\quad p_1=q_1=2. \]

fields
Functional Analysis
pdf ↗ page arXiv:2611.15176 ↗

In the super-dimensional case $p>n$ we show that $W^{1,p}$-functions can be uniformly approximated by Hölder continuous functions with improved exponent $\frac {p-n}{p-1}$. We use this to show density of smooth functions and absence of Lavrentiev's phenomenon for $(p, q)$-growth with optimal conditions. The special cases of double phase and Musielak–Orlicz growth are also included. Finally, we improve the conditions for maximal regularity of the double phase minimizers. In each case the optimality of our range of exponents is shown by known examples.

fields
Functional Analysis
pdf ↗ page arXiv:2611.15428 ↗

We study the periodicity of complex-time boundedness and holomorphy domains of operator semigroups. We show that an imaginary-time covariance identity involving an isometry yields periodicity of these domains. The method is applied to the Ornstein–Uhlenbeck operator and the hypoelliptic Laplacian on the circle, providing a spectral explanation of periodicity independent of the explicit geometry of their boundedness regions. We also discuss the distinction between boundedness and contractivity, using the classical heat semigroup as an example.

comments
9 pages
fields
Functional Analysis, Analysis of PDEs
pdf ↗ page arXiv:2611.15455 ↗

Building on the approach of Bayart, Costa Júnior and Papathanasiou, we establish a Baire criterion for possibly noncommuting operator pairs to support hypercyclic algebras, with hypercyclicity defined through all finite compositions.We then study weighted double backward shifts under different multiplications and topologies.We characterize the existence of hypercyclic algebras for coordinatewise multiplication on sequence algebras admitting a continuous norm and, separately, on $ω^2=\mathbb C^{\mathbb N_0^2}$ with the product topology.For the noncommutative triangular product induced by upper triangular matrix multiplication, we obtain necessary and sufficient conditions for the existence of dense hypercyclic algebras on $ω^2$.In this setting, their existence is equivalent to that of one freely generated by countably infinitely many elements.Finally, we exhibit a pair on a fixed Fréchet space that supports a dense hypercyclic algebra for coordinatewise multiplication and a nonzero hypercyclic algebra, but no dense one, for the triangular product.

comments
19 pages
fields
Functional Analysis
pdf ↗ page arXiv:2611.15559 ↗

For a $C_0$-semigroup $(S_t)$ with generator $B$, sampling the Laplace integral $(λ-B)^{-1}=\int_0^\infty e^{-λt}S_t\,dt$ on the grid $T\mathbb{N}$ gives $Q_T=T(I-e^{-λT}S_T)^{-1}$, the impulse-invariant discretization of the resolvent. The motivation is a dyadic series of Castillo, Costin and Costin for the resolvent of a self-adjoint operator: its partial sums are exactly $Q_{2^{-N}}$, so the series is a telescoped rectangle rule. By Poisson summation, on $D(B)$ the error of $Q_T$ is the scalar $T/2$ plus the symmetric limit of the resolvents at the alias points $λ-2πin/T$, $n\ne0$, and the dyadic levels remove these aliases according to the $2$-adic valuation of $n$. Our main result is a sharp scale of rates for the trapezoid correction $Q_T-\frac T2I$. If $(S_t)$ belongs to the Crandall–Pazy class with parameter $α\in(0,1]$, that is $\|BS_t\|=O(t^{-1/α})$ as $t\to0$, the error is $O(T^α)$ in operator norm, $O(T^{α+θ})$ on the interpolation space of order $θ$ between $X$ and $D(B)$, and $O(T^{1+α})$ on $D(B)$, the last requiring only resolvent decay of order $α$ along the line $\mathrm{Re}\, z=\mathrm{Re}\,λ$. This interpolates between unitary groups with unbounded generator ($α=0$, no convergence in norm) and analytic semigroups ($α=1$), and every exponent is attained. For smooth data an Euler–Maclaurin expansion justifies Romberg extrapolation. For self-adjoint generators we give closed forms for the contribution of each dyadic level to Stone's formula, and we translate the results into an explicit error bound and step-size rule for Green functions computed from sampled autocorrelations. Experiments, including a structurally damped string whose semigroup is of Gevrey class, confirm the rates.

fields
Functional Analysis, Mathematical Physics
pdf ↗ page arXiv:2611.15563 ↗

Let $\mathcal M$ be a factor acting on a separable complex Hilbert space. For every operator $T$ in $\mathcal M$ with dense generalized kernel and $T^2\ne 0$, we characterize the strong reducibility of $T$ relative to $\mathcal M$ based on a $3\times 3$ asymmetric matrix representation of $T$. As applications, we obtain criteria for the strong reducibility of algebraic operators in finite factors and type $\mathrm{III}$ factors. We also prove that every Hilbert space operator with an infinite-dimensional multicyclic direct summand is similar to an irreducible operator.

comments
28 pages
fields
Functional Analysis
pdf ↗ page arXiv:2611.15586 ↗

In 1984, Voiculescu conjectured that the Hilbert–Schmidt quasicentral modulus vanishes for every almost normal operator. We prove this conjecture.

fields
Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2611.15604 ↗

In this article, we prove that the Fredholm index classifies the norm-path components of almost doubly commuting Fredholm n-tuples on a separable infinite dimensional Hilbert space. Using Kasparov's technical theorem, we join each tuple to an essentially normal one by a straight-line Fredholm path and applying the Douglas-Curto theorem.

fields
Functional Analysis
pdf ↗ page arXiv:2611.15994 ↗

We introduce a convolution of noncommutative tori. The construction is the preadjoint of a trace-preserving cocycle-addition homomorphism. Its zero-parameter case is the function–operator semi-convolution. We prove both mixed $L_{1}$--$L_\infty$ inequalities and various Young inequalities with the optimal constant one, including their limiting cases. The endpoint bounds also yield submajorization and convolution estimates in fully symmetric spaces. As applications, we establish, for every integer $k\geq1$ and $1\leq p\leq\infty$, $W_{p}^{k}(\mathbb{T}_θ^{d})\hookrightarrow B_{\infty,\infty}^{k-\frac{d}{p}}(\mathbb{T}_θ^{d})$, and prove the critical embedding $W_{1}^{d}(\mathbb{T}_θ^{d})\hookrightarrow L_\infty(\mathbb{T}_θ^{d})$. These results settle the two questions posed in Remark~6.8 of Xiong, Xu and Yin \cite{XiongXuYin}.

fields
Functional Analysis
pdf ↗ page arXiv:2611.16350 ↗

We develop a transform-adapted approximation framework for shallow neural networks based on the short-time special affine Fourier transform (STSAFT). Replacing the short-time Fourier transform (STFT) in the definition of classical modulation spaces, we work with weighted STSAFT-modulation spaces, building on the existing SAFT-associated modulation-space framework, and use their chirp correspondence with classical weighted modulation spaces through the chirp factorization of the SAFT kernel. We construct an associated neural dictionary and establish an $N$-term Sobolev approximation bound of order $N^{-1/2}$ on bounded one-dimensional domains. A global approximation theorem is also obtained when the spatial translation parameter ranges over the whole real line; a compact-support argument explains why an unrestricted global conclusion cannot in general be inferred from a bounded translation range. For a fixed-scale chirp family $f_κ(x)=e^{iπκx^2}u(x)$, we combine the global estimate with a phase analysis to obtain the stronger phase-dependent upper-bound factor $\langleλ\rangle^n\langleκ-λ\rangle^{n+3/2-1/r}.$ For each fixed nonzero Schwartz envelope, matching the dictionary phase reduces the growth of this specified upper bound from order $|κ|^{n+3/2-1/r}$ to order $|κ|^n$, while preserving the $N^{-1/2}$ rate. The associated mismatch scale is stated as a comparison of upper bounds, not as a threshold for the optimal approximation error. Four numerical experiments examine model comparison, error decay with dictionary size, phase mismatch, and the obstruction caused by restricted translations. We discuss the effective number of fitted output coefficients, including the rank loss of the sine branch at zero phase, and distinguish the numerical diagnostics from the theoretical best-approximation estimates.

comments
34 pages, 8 figures
fields
Functional Analysis
pdf ↗ page arXiv:2611.16448 ↗

Let $μ$ be a pure point complex measure on a tube set $R^d+i F$, where $F$ is a compact convex subset in $R^d$, such that this tube set is the minimal closed convex tube set containing support of $μ$. Furthermore, assume that the Fourier transform $\hatμ$ (in the sense of distributions) is a measure. We determine conditions on the measure $μ$ under which the variation of the measure $\hatμ$ grows at least as $\exp\{2πH_F(t)\}$, as well as conditions under which this variation grows at most as $\exp\{2πH_F(t)\}$; here $H_F(t)$ is the support function of $F$.

comments
16 pages, 20 references
fields
Functional Analysis
pdf ↗ page arXiv:2611.16506 ↗

We prove that on every infinite-dimensional real Hilbert space \(H\), there exist three real-valued Lipschitz functions with no common point of Fréchet differentiability. This gives a negative answer to a longstanding question of Lindenstrauss, Preiss, and Tišer. The proof is constructive and relies on elementary calculus and finite-dimensional linear algebra. Since every Lipschitz map from a Hilbert space into $\mathbb R^2$ has a point of Fréchet differentiability, the target dimension three is optimal.

fields
Functional Analysis
pdf ↗ page arXiv:2611.16777 ↗

We construct an outer function in the classical Dirichlet space whose radial zero set has logarithmic capacity zero, but whose polynomial multiples do not approximate the constant function $1$. This disproves the Brown–Shields conjecture. The proof rests on two approximation theorems for canonical generators of invariant subspaces. The first shows that every proper outer canonical generator can be approximated in the Dirichlet norm by canonical generators associated with singular inner functions determined by finite positive atomic measures. The second shows that each fixed finite-atomic canonical generator can be recovered as a strong Dirichlet limit of outer canonical generators whose radial zero sets have arbitrarily small logarithmic capacity. We then combine these approximations using two techniques: a complete metric that controls boundary logarithms and a nested-ball construction that preserves outerness and noncyclicity while ensuring that the radial zero set is polar. In fact, we show that every proper outer canonical generator can be approximated arbitrarily closely by such counterexamples, both in the Dirichlet norm and in the $L^1$ norm of their boundary logarithms.

comments
This is an expository version with navigational aids, not intended for publication
fields
Functional Analysis
pdf ↗ page arXiv:2611.16997 ↗

We study recovery of an initial state from dynamical samples of a trajectory driven by unknown additive forcing. Measurements against both the original sensors and their images under the adjoint nominal evolution yield one-step residuals that cancel the initial state exactly. These residuals separate forcing estimation from initial-state reconstruction. For a centered Gaussian forcing model with fixed covariance parameters, we combine Gaussian conditioning with canonical dual-frame reconstruction and derive an exact unconditional second-moment identity, including the correlation between the forcing-estimation error and the measurement noise. We also obtain high-probability bounds and identify the irreducible forcing uncertainty through a conditional covariance in the geometry induced by the prior. A hierarchy of augmented sensor systems separates the role of sampling depth in forcing visibility from that of the observation horizon in nominal observability. An image-transport experiment and finite-dimensional and periodic-convolution experiments illustrate the residual correction and the separate roles of sampling depth and observation horizon.

fields
Functional Analysis
pdf ↗ page arXiv:2611.17137 ↗

The hexablock is a domain in $\mathbb{C}^4$ given by \[ \mathbb{H}=\left\{(a,x_1,x_2,x_3)\in \mathbb{C}\times\mathbb{E}: \sup_{z_1,z_2\in\mathbb{D}} \left| \frac{a\sqrt{(1-|z_1|^2)(1-|z_2|^2)}} {1-x_1z_1-x_2z_2+x_3z_1z_2} \right|<1 \right\}, \] where $\mathbb{E}=\left\{(x_1,x_2,x_3)\in\mathbb{C}^{3}: 1-x_1z_1-x_2z_2+x_3z_1z_2\neq 0 \ \text{for all}\ z_1,z_2\in\overline{\mathbb D}\right\}$ is the tetrablock. We introduce a Hardy space $H^2(\mathbb H)$ associated with a canonical measure $μ_{\mathbb H}$ on the distinguished boundary $b\mathbb H$ of the hexablock. We identify $H^2(\mathbb H)$ with a closed subspace of $L^2(b\mathbb H,μ_{\mathbb H})$ and show that it is a reproducing kernel Hilbert space. We prove that $\mathbb H$ is the interior of the polynomial convex hull of $Ψ_{\mathbb H}(\overline{\mathbb D}^4)$, where \[ Ψ_{\mathbb H}(ξ_1, ξ_2,λ_1,λ_2) = \left(\frac{λ_1(ξ_1-1)}{2}, \frac{ξ_2(ξ_1+1)}{2}, \ \frac{λ_1λ_2(ξ_1+1)}{2}, \ ξ_1 ξ_2λ_1λ_2 \right). \] We obtain a Brown-Halmos type characterization of Toeplitz operators on $H^2(\mathbb H)$ and a commutant lifting theorem for $\mathbb H$-isometries. We characterize $\mathbb H$-unitaries as the images of commuting quadruples of unitaries under $Ψ_{\mathbb H}$ and present a class of $\mathbb H$-contractions from commuting quadruples having $\overline{\mathbb D}^4$ as a spectral set. We prove an analogous characterization of $\mathbb E$-unitaries and present a class of $\mathbb E$-contractions arising from commuting triples of contractions having $\overline{\mathbb D}^3$ as a spectral set. En route, we also study a weighted Hardy space on the hexablock.

comments
This is a preliminary draft. It shall be revised soon
fields
Functional Analysis, Complex Variables
pdf ↗ page arXiv:2611.17140 ↗

Geometric Topology16

We give three fundamental examples highlighting the relationship between loops of spheres in $\#^k S^2\times S^2$, pseudo-isotopies, and diffeomorphisms of the 4-sphere. First, we describe an explicit pseudo-isotopy and Hatcher-Wagoner family that realizes the barbell diffeomorphism $β$ of the 4-sphere by constructing a finger-Whitney system for the family. From the Hatcher-Wagoner family, we are able to conclude that the example in §7 of ``Pseudo-isotopies of simply connected 4-manifolds'' generates $β$. Next, it is known that the square of $β$ is isotopic to id. We reprove this by building an explicit 2-parameter family of Morse functions that trivializes the Hatcher-Wagoner family for $β^2$. We do this by utilizing exchange points and families of handle slides. In the final example, we show that another Hatcher-Wagoner family, affectionately called the double cross, also generates $β$.

fields
Geometric Topology
pdf ↗ page arXiv:2611.14771 ↗

We prove that the Euler characteristic of the framed real monopole Floer homology of the double branched cover of a link is given by the Alexander polynomial evaluated at $\sqrt{-1}$. For knots $K$ with determinant one, this formula shows that Miyazawa's degree invariant of $K$ can be computed in terms of the Alexander polynomial of $K$. The proof involves a new connected-sum formula and oriented skein exact triangles for some new variants of real monopole Floer homology, called the diagonal and cone real monopole Floer homology, which admit mod-two gradings. This is the monopole counterpart of Srivastava's Euler characteristic formula in real Heegaard Floer homology.

comments
40 pages, 17 figures
fields
Geometric Topology
pdf ↗ page arXiv:2611.14806 ↗

We prove that any complete intersection numerical semigroup can be realized as the value semigroup of an end curve in a splice quotient singularity. Therefore, providing a converse to the semigroup-theoretic statement of the End Curve Theorem of Neumann and Wahl for integral homology sphere links. Moreover, for a complete-intersection numerical semigroup, we define a family of knots such that the Alexander polynomial of any knot of the family coincides (up to a factor) with the generating series of the semigroup. Let $(X,0)$ be a splice quotient singularity with $\mathbb{Z}HS^3$ link $Σ$ and let $(C,0)$ be a reduced curve-germ embedded in $(X,0)$ defined as the zero locus of the product of end curve functions. We prove, thorugh our topological characterization of complete intersection semigroups, the coincidence between the Alexander polynomial of the knot cut out by $C$ in $Σ$ and the Poincaré series of the embedded curve. Hence providing a generalization of the result due to Campillo, Delgado and Gusein-Zade for plane curve singularities. Furthermore, for any good resolution of $(X,0)$ compatible with the splice quotient analytic structure, we provide an explicit description of the semigroup of integer multiplicities of functions along any divisor of the resolution.

comments
48 pages, comments are very welcome
fields
Geometric Topology, Algebraic Geometry
pdf ↗ page arXiv:2611.14816 ↗

In a recent paper by Dougherty and McCammond, the authors introduced a piecewise Euclidean cell structure for the space of monic centered polynomials. This was achieved by studying the relationship between the polynomials and their critical values, using the Lyashko-Looijenga (LL) map, as well as the noncrossing combinatorics of the polynomials. In this paper, we extend their results to the space of polynomials with rotationally symmetric roots by studying an appropriate generalisation of the LL map, which relates the polynomials and their reduced critical values. The combinatorics of the polynomials are noncrossing partitions of type $B_d$. This give us a piecewise Euclidean cell structure built using the order complex of the noncrossing partition of type $B_d$. Along the way, we also give a compactification of this space of polynomials.

fields
Geometric Topology, Combinatorics, Group Theory
pdf ↗ page arXiv:2611.14841 ↗

For the family $\{\mathcal{M}_{g,k}\}_{g\geqslant k\geqslant 0}$ of orientable hyperbolic 3-manifolds with totally geodesic boundary and cusps introduced by R.~Frigerio, B.~Martelli, and C.~Petronio, the volume of the manifolds depends only on the non-negative integer parameters $g$ and $k$; thus the volume function $Vol(g,k)$ is well defined. The main result of the paper is an asymptotic description of this function: it is approximated by a linear function of $g$ and $k$ whose coefficients are explicitly expressed in terms of the volumes of the regular ideal tetrahedron and the regular ideal octahedron; moreover, the volume does not exceed the linear approximation by a difference of order $O(1/g)$. As consequences, three theorems comparing volumes are obtained: monotonicity under coordinatewise increase of the parameters, estimates for the passage from parameter $g$ to $g+1$, and monotonicity along lines of constant complexity $g+k$. For small values of the parameters, approximate values of the volumes are computed and collected in a table used in verifying the cases $g<8$.

comments
17 pages, 3 figures, 1 table. Wolfram Mathematica 14 was used for numerical computations; the verification scripts are included in Appendices A and B
fields
Geometric Topology
pdf ↗ page arXiv:2611.15179 ↗

Miller and Piccirillo demonstrated the existence of non-concordant knots that share the same 0-trace. In this short note, we generalize their result by showing that every smooth concordance class contains a knot K such that, for every nonzero integer n, there exists a knot $K_n$ whose n-trace is orientation-preservingly diffeomorphic to that of K, but for which $p[K_n] \ne p[K]$ in the topological concordance group for every positive integer p. Furthermore, $p[K_n]$ is distinct from $p[K']$ for any knot K' obtained from K by mirroring and/or reversing its orientation.

comments
10 pages, 1 figure
fields
Geometric Topology
pdf ↗ page arXiv:2611.15340 ↗

A compact hyperbolic surface is $k$-extremal if it contains $k$ disjoint embedded discs of the largest possible radius; such surfaces are uniformized by surface subgroups of the triangle groups $Δ^{\pm}(2,3,N)$. We determine all extremal $k$-packings in every $k$-extremal surface of minimal genus, orientable of genus $2$ and non-orientable of genus $3$: $373$ surface groups in total, all treated in a unified way; $264$ of them had never been studied before. The computation is automatic and verified in exact arithmetic, each packing being certified by an element $α\in\mathrm{PGL}_2$ over an explicit number field with $α^{-1}Kα<Δ^{\pm}(2,3,N)$. We also obtain the full isometry groups of these surfaces. In every surface but one, all the extremal packings are related by isometries. The exception is the genus two surface $X_6$ of Girondo and González-Diez, which has exactly five extremal $4$-packings, one invariant under all isometries and four forming an orbit; it is also the only one of these surfaces uniformized by two non-conjugate subgroups of the same triangle group, and we show that the two facts are equivalent. We find its equation, $y^2=x^6+2\sqrt{3}\,i\,x^3+1$. The results form a catalogue with detailed data and pictures of every surface (packings, isometries, Weierstrass points, Dirichlet domains), distributed with programs that allow the reader to consult it and to reproduce it completely.

comments
23 pages, 7 figures. Code and data: doi:10.5281/zenodo.24136024
fields
Geometric Topology, Complex Variables, Group Theory, Metric Geometry
pdf ↗ page arXiv:2611.15477 ↗

Geometric chains are formal combinations of smooth maps from compact oriented manifolds or orbifolds with corners. In earlier work the author showed that, modulo a relation D that kills degenerate chains, they compute rational singular homology. We show that D can be replaced by a gluing relation, which identifies a chain with the sum of its restrictions to finitely many pieces whenever its source is glued from these pieces along whole codimension-one faces. With this relation the comparison map from singular homology is an isomorphism in all degrees for compact polyhedra and smooth manifolds without boundary, with rational and with integer coefficients. Unlike D, the gluing relation is defined through the sources alone, and chain-level identities such as the equivalence of a degree d covering with d times its base, which fails modulo D, and the correction terms of the chain map from a Morse complex, which are degenerate modulo D, become gluing relations. The proof is axiomatic; injectivity comes from integration or dual cells, surjectivity from cutting along regular levels, where the cut of a gluing relation is again one, and at the point we use Whitehead triangulations of manifolds with corners subordinate to their corner strata. The gluing relation, read on underlying spaces, also suffices for orbifold sources, with integer coefficients modulo classes with an orientation reversing automorphism, and for effective orbifold targets.

comments
60 pages
fields
Geometric Topology, Mathematical Physics, Algebraic Topology
pdf ↗ page arXiv:2611.15551 ↗

We prove that every iterated untwisted Whitehead double of a nontrivial two-bridge knot satisfies the meridional rank conjecture. More precisely, for such a knot $K$ and every $N\geq0$, the augmentation rank, meridional rank, and bridge number of $\operatorname{Wh}^N(K)$ are all $2^{N+1}$. We use microlocal sheaf theory and a doubling construction to produce a lower bound for the meridional rank of the Whitehead double, assuming the peripheral data satisfy suitable conditions. For two-bridge knots, the required curves arise from ideal points detecting nonzero boundary slopes. In contrast, the ordinary group rank of an $N$-fold Whitehead double is at most the rank of the companion group plus $N$. We also give a non-example when the doubling construction does not work -- the first Whitehead double of the square knot has augmentation rank at most 5, whereas its meridional rank and bridge number are 6.

comments
44 pages, 2 figures
fields
Geometric Topology, General Topology
pdf ↗ page arXiv:2611.15673 ↗

Rivin showed that every cusped hyperbolic metric on a punctured sphere is uniquely realized by a convex ideal polyhedron in hyperbolic space with possible degeneration. We consider the analogous problem for cusped hyperbolic metrics on a punctured surface of positive genus: locally convex ideal polyhedral surfaces in hyperbolic space. Each such surface determines a complex projective structure on the underlying closed surface. With a cusped hyperbolic metric $h$ prescribed, we investigate the space $\mathcal{P}(h)$ of such ideal polyhedral realizations and their possible degeneration. Particularly in the case of tori, we show that the space $\mathcal{P}(h)$ is homeomorphic to $\mathbb{R}^2$, and that the induced map to Teichmüller space of the closed torus is a $C^1$-embedding. This map extends to a bijection from the closure of $\mathcal{P}(h)$ onto the whole Teichmüller space, where the added points are degenerate surfaces. This is dual to the Kojima-Mizushima-Tan conjecture about circle patterns on closed surfaces with complex projective structures.

comments
49 pages, 1 figures
fields
Geometric Topology, Complex Variables, Metric Geometry
pdf ↗ page arXiv:2611.15708 ↗

We derive formulas from Eisemann's formula for the second quandle homology of quandles. We prove that for a finite injective quandle $Q$, the second quandle homology $H_2(Q)$ can be computed in a representation group of $Q$, which is a finite quotient of the enveloping group of $Q$, by giving a formula for that. We use this to compute $H_2(Q)$ for $Q$ the subquandle of $k$-cycles of $S_n$ and $Q$ the quandle corresponding to the conjugacy class of a diagonalizable element of $SL(n,q)$, with some exceptions. For $G$ a finite group with trivial Bogomolov multiplier, as many classical groups, simple groups and (with exceptions) quasi-simple groups, we derive a formula for $H_2(Conj(G))$ that can be computed in $G$ alone. The formula relies on conjugacy classes of $G$, centralizers in $G$ of representative of such classes and the derived group of $G$. If $G$ is moreover perfect this formula can be related to the first Hochschild homology of the group ring $\mathbb{Z}[G]$. As an application, we compute $H_2(Q)$ for $Q$ the conjugacy quandle of $GL(2,q)$ for $q\neq 2,3$.

fields
Geometric Topology, Group Theory
pdf ↗ page arXiv:2611.15826 ↗

We study multiplicity among lengths of simple closed geodesics on the principal congruence surfaces $X(n)=Γ(n)\backslash\mathbb{H}$. We show that for every $\varepsilon>0$ there are positive constants $n_\varepsilon,C_{\varepsilon}$ so that, for $n\ge n_\varepsilon$, there are at least $\exp((\frac{π^2}{12}-\varepsilon)n)$ simple closed geodesics on $X(n)$ of the same length $\ell<C_\varepsilon n$. We produce the same multiplicity for $λ$-length of simple arcs with distinct endpoints via the McShane identity, which is immediately relevant as the size of a McShane gap around such an arc is roughly the reciprocal square of its $λ$-length. Our method of proof relies on an independently interesting theorem about the McShane identity for $X(n)$: the total mass of the gaps of pants with two cusps tends to 1 as $n\to \infty$. We present a proof of this latter fact that relies on estimates for the speed of mixing provided by Selberg's 3/16-Theorem (discovered with the help of ChatGPT). We indicate several avenues for further investigation.

comments
24 pages, 7 figures
fields
Geometric Topology, Number Theory
pdf ↗ page arXiv:2611.16078 ↗

These notes, which are based on four lectures delivered at the summer school "Knotted Surfaces in Four-Manifolds" at PCMI in 2026, discuss classifications of locally flat surfaces in simply-connected $4$-manifolds.

comments
17 pages. These are expository lecture notes accompanying four lectures given at a summer school at PCMI in Summer 2026
fields
Geometric Topology
pdf ↗ page arXiv:2611.16124 ↗

We give a combinatorial condition ensuring global projective rigidity of simple hyperbolic Coxeter $3$-polytopes. As an application, we prove that every right-angled Löbell polytope is globally rigid.

comments
9 pages, 4 figures
fields
Geometric Topology, Combinatorics
pdf ↗ page arXiv:2611.16135 ↗

We study the diameter function on the Teichmüller space of closed hyperbolic Riemann surfaces. Although the Bolza surface maximizes the systole among hyperbolic surfaces of genus 2, its extremal behavior with respect to the diameter function is less clear. Using first variations of distances at diameter pairs and linear programming duality, we establish a sufficient criterion for a surface not to be a local minimizer of the diameter function. More precisely, we show that if each diameter pair can be assigned a simple closed geodesic formed by two minimizing geodesic segments joining its endpoints, with distinct assigned geodesics pairwise disjoint, then a deformation varying only the length parameters in Fenchel-Nielsen coordinates strictly decreases the diameter. The assigned geodesics extend to a pants decomposition, and the decrease is detected by a strictly negative upper bound for the first-order variation of the diameter. We then apply this criterion to the Bolza surface and prove that it is not a local minimizer of the diameter function on the Teichmüller space of genus 2.

comments
10 pages, 1 figure
fields
Geometric Topology, Differential Geometry
pdf ↗ page arXiv:2611.16340 ↗

Let $R$ be a real closed field expanded by an o-minimal structure, let $A$ be a definable, closed and bounded subset of $R^n$ and let $p$ be a positive integer. It was recently shown in \cite{pa2} that $A$ admits a strict ${\mathcal C}^p$-triangulation $({\mathcal T},h)$, i.e., there exist a finite simplicial complex ${\mathcal T}$ in $R^n$ and a homeomorphism $h:|{\mathcal T}|\to A$ that is definable and of class ${\mathcal C}^p$. The aim of this article is to analyze a generalization of the notion of strict ${\mathcal C}^p$-triangulation of subanalytic sets to the case $p=\infty$. Examples in dimension $n=3$ show that such a generalization is not always possible within subanalytic geometry, where the class ${\mathcal C}^\infty$ is equivalent to the class ${\mathcal C}^ω$. We formulate the conjecture that strict ${\mathcal C}^\infty$-triangulations of subanalytic sets always exist in the wider o-minimal structure $\mathbb{R}_{{\rm an},\exp}$, generated by subanalytic sets and the exponential function. We check the conjecture for all subanalytic subsets of $\mathbb{R}^n$ when $n\leq 3$, and prepare tools to address the conjecture for arbitrary $n$. We also apply the obtained strict ${\mathcal C}^\infty$-triangulation results to approximate subanalytic continuous mappings $f:X\to Y$ between subanalytic sets $X\subset\mathbb{R}^n$ and $Y\subset\mathbb{R}^m$ by ${\mathcal C}^\infty$-mappings $g:X\to Y$ definable in the o-minimal structure $\mathbb{R}_{{\rm an},\exp}$, with respect to the strong Whitney ${\mathcal C}^0$ topology. If the continuous mapping $f:X\to Y$ is not necessarily subanalytic, we can still approximate it by ${\mathcal C}^\infty$ mappings $g:X\to Y$.

fields
Geometric Topology, Logic
pdf ↗ page arXiv:2611.16672 ↗

Group Theory15

We study automorphism orbit graphs of oriented conjugacy classes in the free group of rank two, with every elementary Whitehead move assigned unit cost. Collapsing signed permutations of the basis turns each orbit component into a tree of edges and triangles. We obtain this description by combining the known rank-two conjugacy-class stabilizer structure with the Bass-Serre tree of the rank-two outer automorphism group. The simplified graph and all its vertex-induced subgraphs have optimal thin-triangle constant zero for tree components and 3/4 otherwise. Every whole orbit component of the original graph has thin-triangle constant at most 2, while every component of every vertex-induced subgraph has constant at most 5/2. Both bounds are sharp in the primitive orbit and apply to the full geometric realization, including edge-interior triangle corners. The hereditary upper estimate also follows from known chordality theory; the whole-component improvement uses the geometry of adjacent permutation fibres. These results complement earlier fixed-length and minimum-length orbit classifications.

comments
17 pages, 2 figures
fields
Group Theory, Combinatorics
pdf ↗ page arXiv:2611.14566 ↗

We construct a free subgroup of countably infinite rank in $\ZZ^2\rtimes\SL_2(\ZZ)$ that acts regularly on $\ZZ^2$. At each stage we adjoin an affine transformation taking the origin to the least point of a prescribed orbit. Disjoint domains for reduced words ensure that the stabilizer of the origin remains trivial. The orbit map gives a left brace with additive group $\ZZ^2$ and multiplicative group free of countably infinite rank. This group contains a nonabelian free subgroup and is therefore nonsolvable, answering both parts of Problem 20.126 of the Kourovka Notebook.

fields
Group Theory
pdf ↗ page arXiv:2611.14972 ↗

Let $h(n)$ be the largest number of abelian subgroups needed to cover a group in which every set of more than $n$ elements contains two distinct elements that commute, and let $ζ(n)$ be the largest index of the centre under the same constraint. Erdős asked for the growth of $h$, Neumann proved that both quantities are finite, and Pyber bounded both $ζ$ and $h$ exponentially. We determine $h(n)$ for every positive integer $n$ and prove that $h(n)=1+\sqrt{ζ(n)}$ whenever the constraint admits a nonabelian group. The covers are built directly from the commutator geometry of a scalar quotient, and the comparison with $ζ$ is made afterwards. Beyond finitely many small cases, both maxima are attained by the same groups, those isoclinic to an extraspecial $2$-group of order $2^{1+2\lfloor(n-1)/2\rfloor}$, confirming Pyber's prediction for the central index in this range.

comments
24 pages
fields
Group Theory
pdf ↗ page arXiv:2611.15068 ↗

We establish a property of quadratic elements in faithful modules for finite $p$-groups. Let $p$ be an odd prime, and suppose that $a$ is a quadratic element of an abelian subgroup $L$ normalized by $b$. Writing $a_0=a$ and $a_i=[a_{i-1},b]$, we prove that if, for some $r$ with $2\leq r\leq(p+1)/2$, one has $a_{r-1}\neq1$ and $a_r=1$, then $a_{r-1}$ is quadratic. As an application, we prove that every finite $p$-group of nilpotency class at most $(p+5)/2$ satisfies the Quadratic Conjecture. Consequently, Oliver's $p$-group conjecture holds for a finite $p$-group $S$ whenever $S/\mathfrak X(S)$ has nilpotency class at most $(p+5)/2$.

fields
Group Theory
pdf ↗ page arXiv:2611.15156 ↗

We determine the growth functions of the cactus groups of all degrees with respect to their standard generators, and provide explicit equations for specific degrees as examples.

comments
8 pages, 1 diagram
fields
Group Theory, Combinatorics, Geometric Topology
pdf ↗ page arXiv:2611.15249 ↗

Let $G$ be a finite almost simple classical group over $\mathbb{F}_q$ with socle $G_0$ and natural module $V$ of dimension $n$. Let $H$ be a core-free maximal subgroup of $G$. By a well-known theorem of Aschbacher, either $H$ is contained in one of eight subgroup collections that are defined in terms of the geometry of $V$, or $H$ is almost simple and the embedding of $H$ in $G$ arises from an absolutely irreducible representation of a covering group of the socle of $H$. We write $\mathcal{S}$ for the latter collection of irreducibly embedded almost simple subgroups. Determining the subgroups in $\mathcal{S}$ is an intractable problem, in general, which has only been fully resolved in low dimensions. However, many applications require some control on the subgroups in $\mathcal{S}$, expressed in terms of their order, or properties of their elements, for example. Extending a theorem of Liebeck from the 1980s, and building on later work by Burness, Guralnick and Saxl, in this paper we determine all the subgroups $H \in \mathcal{S}$ satisfying the lower bound $|H| \geqslant q^n$. We also highlight a recent application of our main result to a problem in finite geometry.

comments
21 pages
fields
Group Theory
pdf ↗ page arXiv:2611.15410 ↗

For the class of Shepard groups (which contain Coxeter groups, Artin-Tits groups, and many finite complex reflection groups), we investigate the structure of the coset incidence systems defined using the standard parabolic subgroups. For the class of tame Shephard groups, which is when all the standard parabolic subgroups are equal to the corresponding Shephard groups, then the intersection of standard parabolic subgroups is also a standard parabolic subgroup. We show that when the Shephard group is either finite, right-angled, or rank two, then it is tame; this is further evidence that all Shephard groups are tame. Finally, we mix the Burau and the geometric representations to produce a representation for all Shephard groups, but we show it is not faithful in rank two unless the Shephard group is finite or an Artin-Tits group.

fields
Group Theory
pdf ↗ page arXiv:2611.15415 ↗

We study Bestvina-Brady kernels associated to graph products whose vertex groups are either infinite cyclic or finite. Using a $\mathrm{CAT}(0)$ cubical complex constructed by Ruane and Witzel, on which the graph product with defining graph $Γ$ acts, together with an equivariant Morse function, we establish sufficient conditions for homological finiteness properties in terms of the topology of the flag complex $Γ^\blacktriangle$, the subcomplex $Γ^\blacktriangle_\infty$ spanned by the infinite vertices, and the ascending and descending links of certain vertices. We also prove a partial converse, showing that, under additional vanishing hypotheses on homology in the next degree, non-vanishing homology of these complexes obstructs higher finiteness properties of the Bestvina-Brady kernel. The main new features are the presence of finite stabilizers and the resulting additional link conditions, which are expressed in terms of the flag complex of $Γ$. When the finite vertex groups are abelian, we characterize when the kernel has finitely many conjugacy classes of finite subgroups, describe the normalizers of its finite subgroups as Bestvina-Brady kernels of smaller graph products, and obtain a criterion for the kernel to be of Bredon type $\underline{\mathrm{FP}}_n$.

comments
25 pages, 2 figures
fields
Group Theory
pdf ↗ page arXiv:2611.15976 ↗

Let $G=F\rtimes_φ\mathbb Z$ be the mapping torus of a linearly growing UPG automorphism $φ$ of a finitely generated free group $F$. We compute the distortion of every finitely generated subgroup $H$ of $G$, and we show that it is linear, quadratic or exponential. In contrast, for each $d\ge2$, Dison and Riley constructed an automorphism of polynomial degree $d$ whose mapping torus contains a free subgroup with distortion equivalent to the Ackermann function $A_{d+1}$, which grows faster than every iterated exponential function. Using the natural splitting of $G$ over $\mathbb Z^2$ subgroups and its topological representative, we associate to $H$ a family of \emph{horizontal components}, together with \emph{dilation homomorphisms} defined from slopes along these components. We prove that $H$ is undistorted in $G$ if and only if every horizontal component of $H$ consists of only one piece. Otherwise, the distortion of $H$ is quadratic if all dilation homomorphisms are trivial, and exponential if one of them is nontrivial. Along the way, we show that the distortion of $H$ is determined, up to superadditive closure, by the distortions of the stabilizers of its horizontal components.

fields
Group Theory
pdf ↗ page arXiv:2611.16111 ↗

In this note we revise our approach from [Rostislav Grigorchuk. On the gap conjecture concerning group growth. Bull. Math. Sci., 4(1):113–128, 2014] to the reduction of the Gap Conjecture on Group Growth to the class of just-infinite groups. For this purpose we introduce the class of groups that we call \emph{(GAPSY)} as well as some other classes. The properties of these classes are discussed in the relation with growth, elementary amenability, and just-infiniteness. Additionally, we discuss the GAP type problems for cancellative semigroups. A number of (old and new) open problems and few historical remarks is included in the note as well.

comments
17 pages
fields
Group Theory
pdf ↗ page arXiv:2611.16279 ↗

This paper studies the global difference between the stable commutator length ${\rm scl}_G$ and the stable mixed commutator length ${\rm scl}_{G,N}$ from the perspective of coarse geometry, as well as the space ${\rm W}(G,N)$ of non-extendable quasimorphisms modulo invariant homomorphisms. Our main theorem concerns a finitely generated group $G$ and its normal subgroup $N$ such that the quotient group $ Γ= G/N$ is nilpotent. In this setting, we prove that the natural inclusion map of coarse groups from $[G,N]$ to $[G,G]$, equipped with the metrics induced by ${\rm scl}_{G,N}$ and ${\rm scl}_G$, respectively, is coarsely surjective. Moreover, this map has a splitting coarse kernel that is coarsely isomorphic to $(\mathbb{Z}^n, \| \cdot \|_1)$, where $n$ is the dimension of ${\rm W}(G,N)$. As a consequence, $[G,N]$ is isomorphic to $\mathbb{Z}^n \times [G,G]$ as a coarse group.

comments
44 pages. This paper is Part II of a two-part series; Part I is arXiv:2605.19843. The two parts together subsume the authors' earlier preprint arXiv:2306.08618
fields
Group Theory, Metric Geometry
pdf ↗ page arXiv:2611.16600 ↗

Let $k$ be a fixed positive integer and $p$ be an odd prime such that $\gcd(p-1,k)=1$. For sufficiently large primes $p$, we show that the equation $AX^k+BY^k=C$ has solutions $X,Y \in \mathrm{GL}(2, \mathbb{F}_p)$, where $A$ and $B$ are fixed matrices in $\mathrm{GL}(2, \mathbb{F}_p)$, and $C$ is a fixed matrix in $\mathrm{M}(2,\mathbb{F}_p).$ Our proof relies on Fourier analysis over $\mathrm{GL}(2, \mathbb{F}_p).$

comments
18 pages, comments welcome
fields
Group Theory, Number Theory, Rings and Algebras, Representation Theory
pdf ↗ page arXiv:2611.16651 ↗

We prove that the free Burnside group $B(m,n)$ is nonamenable for every $m\ge 2$ and every odd exponent $n\ge 557$. This improves Adian's bound $n\ge 665$ and matches the infiniteness bound of Atkarskaya, Rips and Tent. Our proof combines their canonical form construction with a counting argument to obtain an explicit isoperimetric inequality.

fields
Group Theory
pdf ↗ page arXiv:2611.16826 ↗

Rohrbach's conjecture holds for finite groups. In fact, there is an absolute constant $C$ such that, for every finite group $G$, every positive integer $h$, and all nonnegative real numbers $α_1,\ldots,α_h$ with $α_1+\cdots+α_h=1$, there are subsets $A_1,\ldots,A_h\subseteq G$ satisfying \[ G=A_1\cdots A_h, \qquad |A_1|\leq |G|^{α_1}, \qquad |A_i|\leq C|G|^{α_i}\quad(2\leq i\leq h). \] Consequently, for every $h$ there is a constant $c_h$ such that every finite group $G$ has a subset $A$ with \[ A^h=G\qquad\text{and}\qquad |A|\leq c_h|G|^{1/h}. \]

fields
Group Theory, Number Theory
pdf ↗ page arXiv:2611.16938 ↗

In this paper we study the structure of the finite subgroups of the braid groups $B_n(RP^2)$ of the real projective plane $RP^2$. It is known that the isomorphism classes of these subgroups are comprised of cyclic, dicyclic and binary polyhedral groups. Using specific elements of $B_n(RP^2)$, we construct embeddings of the cyclic and dicyclic subgroups, we show that there is a single conjugacy class of the maximal dicyclic groups, and for small values of n, we also construct embeddings of the bin- ary tetrahedral and octahedral groups. One interesting phenomenon that occurs is the existence of isomorphism classes of finite subgroups that admit embeddings in $B_n(RP^2)$ as both maximal finite and non-maximal subgroups. Up to conjugacy, we describe completely the lattice of the finite subgroups of $B_n(RP^2)$ for n = 3, 4, 5. Some of our results regarding the number of conjugacy classes of finite subgroups are obtained using the relation between $B_n(RP^2)$ and the mapping class group of $RP^2$ relative to n points. We also provide a new presentation of $B_n(RP^2)$ which has some interesting properties with respect to the classical presentation of Van Buskirk.

comments
Contains 56 pages
fields
Group Theory, Geometric Topology
pdf ↗ page arXiv:2611.17075 ↗

Metric Geometry14

We clarify and streamline OpenAI's proof of the sharp Euclidean filling inequalities in CAT(0) spaces. We extend the result to complete spaces without assuming properness or compact support, and we establish rigidity in the equality case.

fields
Metric Geometry, Differential Geometry
pdf ↗ page arXiv:2611.13159 ↗

We prove that a $4$-polytope with ten vertices inscribed in the unit sphere $\mathbb{S}^{3}$ has volume at most $\frac{25}{384}(10 + 2\sqrt{5})$, and that, up to orthogonal transformations, equality holds only for the convex hull of two regular pentagons inscribed in $\mathbb{S}^{3}$ in orthogonal $2$-planes through the origin. As for six to nine vertices, the optimum is thus the convex hull of two regular polygons in orthogonal planes. On the combinatorial type of the pair, whose boundary complex is the join of two $5$-cycles, the sharp bound follows from our work on nine vertices. Since an optimal polytope is simplicial, by a result of Horváth and Lángi, it remains to exclude the other $162003$ simplicial types. We do this by sum-of-squares certificates checked in exact arithmetic, extended by nonnegative multiples of facet polynomials, which are positive on every positively oriented realisation of

fields
Metric Geometry, Combinatorics
pdf ↗ page arXiv:2611.14674 ↗

We study general topological properties of open weakly $2$-semiconvex sets in real three-dimensional Euclidean space $\mathbb{R}^3$. An open set in $\mathbb{R}^3$ is called weakly $2$-semiconvex if through every boundary point of the set there passes a closed half-plane that does not intersect the set. The largest subset of the complement of a given set in $\mathbb{R}^3$ such that every closed half-plane intersecting this subset also intersects the given set is called the $2$-nonsemiconvexity-point set corresponding to the given one. We prove that the nonempty $2$-nonsemiconvexity-point set corresponding to an open weakly $2$-semiconvex set is open and weakly $2$-semiconvex. We also construct a weakly $2$-semiconvex domain whose $2$-nonsemiconvexity-point set is an unbounded domain that can be either convex or nonconvex.

comments
9 pages, 2 figures
fields
Metric Geometry
pdf ↗ page arXiv:2611.14725 ↗

In a pseudo-Euclidean space, the Cauchy-Bunyakovsky-Schwarz inequality generalization is derived and studied. Complex vector space is considered as well. Generalizations of angles and dihedral angles in these spaces are studied.

comments
21 pages
fields
Metric Geometry
pdf ↗ page arXiv:2611.15115 ↗

We propose and provide evidence for the following conjecture: the covering number of a product of metric spaces with the sum metric is greater than or equal to the product of their covering numbers. This generalizes Vizing's conjecture in graph theory. We prove an infinitesimal version of the conjecture for Finsler manifolds of dimension at least six.

comments
32 pages, 2 figures
fields
Metric Geometry
pdf ↗ page arXiv:2611.15599 ↗

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.

comments
18 pages, 1 figure
fields
Metric Geometry, Functional Analysis
pdf ↗ page arXiv:2611.15672 ↗

Smale's seventh problem asks for a polynomial-time algorithm that places $N$ points on the unit sphere $\mathbb{S}^2$ with logarithmic energy (the sum of $-\log$ of all pairwise distances) within $O(\log N)$ of the minimum. The minimal energy has an asymptotic expansion with explicit terms of order $N^2$ and $N\log N$ and a linear term whose constant is unknown. Brauchart, Hardin, and Saff conjectured this constant; the resulting expansion, $E_{BHS}(N)$, is known to be an upper bound on the minimum, up to $o(N)$. All previously analyzed constructions on $\mathbb{S}^2$ have energy exceeding $E_{BHS}(N)$ by an amount that grows at least linearly in $N$, i.e. $Ω(N)$, far from the $O(\log N)$ accuracy sought by Smale. We present TerracedZonal, a deterministic construction that generates $N$ points in $Θ(N)$ time and memory. Points are placed on latitude rings whose populations are held constant across bands ("terraces") chosen by a one-dimensional dynamic program, so that adjacent rings within each terrace lock into a staggered triangular lattice. Under a locality assumption, we prove that the energy exceeds $E_{BHS}(N)$ by only $Θ(N^{2/3})$, with an explicit constant; exact evaluation up to $N = 10^9$ confirms this rate. Under the same assumption, its distance from the true minimum is sublinear if the conjecture holds. To our knowledge, this is the first algorithmic construction with a sublinear excess over $E_{BHS}(N)$ of explicit order (proven under the locality assumption), a necessary step toward Smale's seventh problem. With one parameter changed, the same algorithm also gives an equal-weight integration rule on $\mathbb{S}^2$ that runs just as fast and whose error decays at an empirical rate of $N^{-4}$ on smooth functions, versus $N^{-3/2}$ for every previous fast construction we tested.

fields
Metric Geometry
pdf ↗ page arXiv:2611.15783 ↗

Schütt and Werner associated an almost polygonal planar convex body with a decreasing convex sequence and obtained two-sided estimates for the area removed by its floating body. We reinterpret the gaps of the defining sequence as the lengths of a normalized fractal string. Our main result shows that the area deficit, that is, the difference between the area of the set and its floating body, is comparable to an integral transform of the inner tubular volume of this string. As a consequence, if the string has Minkowski dimension $D$, then the principal power exponent of the area deficit is $1-D/3$. We also derive refinements for regularly varying tube functions, establish a realization criterion extending the almost polygonal case of the theorem of Schütt and Werner, and discuss several examples. As an application, we obtain corresponding asymptotic rates for the expectations and variances of the missed area and the number of vertices of random polygons, including new intermediate behaviors between the classical polygonal and smooth cases.

comments
16 pages, 1 figure
fields
Metric Geometry, Probability
pdf ↗ page arXiv:2611.16052 ↗

Wetzel conjectured, and Panraksa and Wichiramala proved, that the circular sector of radius one and angle $30^\circ$ contains a congruent copy, reflections allowed, of every arc of length one. We show that half of its arc is not needed: replacing the arc between the angles $15^\circ$ and $30^\circ$ by its chord gives a convex cover of area $π/24+(\sqrt6-\sqrt2)/8=0.2603092\ldots$. As in the proof for the sector, we place an arc in two supporting wedges. A sum of support, cap and radial inequalities, with vector coefficients summing to zero, shows that an arc with no copy in the trimmed sector is longer than one. One two-parameter family of configurations is checked by rational interval arithmetic; programs and data are supplied. No chord that starts below $3.6^\circ$ gives a cover. We also reduce the inclusion-minimality of the trimmed sector to two families of cuts.

comments
24 pages, 8 figures, 5 tables. Data and programs: https://github.com/chatchawanpan-dev/wetzel-sector-trim-computations (also included as ancillary files)
fields
Metric Geometry
pdf ↗ page arXiv:2611.16204 ↗

In this paper, we establish the forward and reverse geometric Brascamp–Lieb inequalities for isotropic measures on a Grassmann manifold, and characterize their equality conditions. The proofs use transportation and the Grassmannian Ball–Barthe inequality of Li, Xi, and Zhang. The functions form a jointly continuous family whose fiber integrals are positive and continuous. The equality conditions are described by an orthogonal decomposition determined by the supporting projections. On the common eigenspaces, the forward inequality permits arbitrary independent factors, whereas the reverse inequality requires log-concavity for factors shared by a nontrivial parameter distribution. On the orthogonal complement, the extremizers have Gaussian factors. Their centers are compatible projections in the forward inequality and may vary continuously between fibers in the reverse inequality. Gaussian convolution preserves extremizers, and the original factors are recovered at a fixed positive time using characteristic functions. As applications, we obtain Gaussian rigidity results and volume bounds for bodies defined by projection integrals and barycentric infima. These bounds recover the reverse isoperimetric inequalities of Li, Xi, and Zhang for bodies associated with Grassmannian cosine transforms, together with their equality conditions away from the endpoint cases. We also establish a forward extension under weaker mass assumptions and give a mass-escape example for the reverse inequality.

comments
41 pages
fields
Metric Geometry
pdf ↗ page arXiv:2611.16720 ↗

Let $b(n)$ be the least $m$ such that every bounded set in $\mathbb{R}^n$ of positive diameter can be partitioned into $m$ sets of smaller diameter. We prove that \[ b(4)\le6,\qquad b(5)\le12,\qquad b(6)\le31,\qquad b(7)\le45,\qquad b(8)\le89, \] and that \[ b(n)\le1+2^{n-1}\left(\tfrac{39}{64}\right)^{\lfloor(n-1)/8\rfloor} \qquad\text{for every } n\ge9 ; \] for instance, $b(9)\le157$ and $b(17)\le24337$. Further constructions give, for example, $b(10)\le289$ and $b(13)\le2313$. These bounds improve Lassak's bound $b(n)\le2^{n-1}+1$ of 1982 in every dimension $n\ge4$. In dimension four they also improve the recent bounds $b(4)\le8$ (Tolmachev and Voronov, May 2026) and $b(4)\le7$ (Arman, Bondarenko, Prymak and Radchenko, October 2026); the bound $b(4)\le6$ was announced independently by Chalmers in November 2026. The bounds for $n\ge7$ have analytic proofs: a quantitative form of Lassak's reduction to coverings of the sphere is combined with normal partitions of weighted vector configurations, for which the smallest inner product within a region is estimated explicitly. The bound for $n=6$ uses a covering of $S^4$ by thirty sets, checked in rational arithmetic. For $n=4,5$ three contact points of the circumscribed ball reduce the problem to a four-parameter family of bodies, which is split by finitely many power diagrams; that all parts have diameter less than one is verified by a computer program with rigorous error control.

comments
34 pages, 5 figures
fields
Metric Geometry, Combinatorics
pdf ↗ page arXiv:2611.16775 ↗

For $d>0$, let $\mathcal{S}_d$ be the square lattice and $\mathcal{H}_d$ the honeycomb point set with minimum distance $d$. We study for which $d$ these sets can be covered by closed unit disks with pairwise disjoint interiors; the periodic constructions of Phetmak, Nuntasombat and Fakcharoenphol cover them only from $d=1/2$ and $d=2/\sqrt{37}$ on, with gaps. Writing $\mathcal{N}(d)$ for the largest number of points in a closed unit disk and $ρ$ for the number of points per unit area, we show that neither set can be covered when $\mathcal{N}(d)<2\sqrt3\,ρ$, and we determine these spacings exactly, thirteen intervals for $\mathcal{S}_d$ and twelve for $\mathcal{H}_d$. At their right endpoints the bound is attained; there $\mathcal{S}_d$ is never coverable, and $\mathcal{H}_d$ is not coverable at nine of the twelve endpoints. We also give new periodic coverings, of $\mathcal{S}_d$ at $d=2/\sqrt{34}$ and of $\mathcal{H}_d$ for $2/9\le d\le1/\sqrt{19}$. Consequently, the smallest coverable spacing lies in $(0.2581,\,2/\sqrt{34}]$ for the square lattice and in $(0.1781,\,2/9]$ for the honeycomb point set, and coverability is not monotone in $d$ for either set.

comments
22 pages, 4 figures, 6 tables. Companion paper to arXiv:2611.13535 (triangular lattice). The ancillary file verify_square_honeycomb.py (Python 3 with numpy, exact arithmetic) carries out all computations used in the proofs
fields
Metric Geometry, Combinatorics
pdf ↗ page arXiv:2611.16894 ↗

For every origin-symmetric convex body $K\subseteq\R^n$, we prove that there exists a volume-preserving linear transformation $T\in\SL_n(\R)$, such that for every $\varepsilon\in (0,1)$ there is an origin-symmetric convex body $L$ with $(1-\varepsilon)TK\subseteq L \subseteq TK$ and the isoperimetric quotient $\iq(L)\le 40\varepsilon^{-1}\sqrt n$. This resolves the Naor isomorphic reverse isoperimetry conjecture.

comments
14 pages
fields
Metric Geometry
pdf ↗ page arXiv:2611.16898 ↗

We compute the asymptotic dimension of spaces of multiparameter persistence modules of bounded presentation under the interleaving distance. The $d$-parameter modules with at most $n$ generators and $m$ relations have asymptotic dimension, and Assouad-Nagata dimension, exactly $d(n+m)$, the number of coordinates of their generator and relation grades, over every field; for two parameters this is $2(n+m)$. The space has continuous moduli, already for two parameters and $n,m\ge2$: over an infinite field it contains, at every scale, infinite uniformly separated families of pairwise non-isomorphic modules with one fibered barcode, so it is not doubling even at a fixed fibered barcode; already for $m\ge1$ it is not coarsely equivalent to a proper metric space. The proof is an induction on the number of distinct grade coordinates: an interleaving small compared with the gaps between these coordinates moves each of them by at most twice its size and preserves the induced grid representation, so the continuous moduli are invisible at large scale. Each class of modules at finite distance therefore embeds coarsely into Hilbert space; for $n,m\ge2$ over an uncountable field, the classes that contain these families admit no such embedding into a separable Hilbert space. Under the two-parameter matching distance $2(n+m)$ is a lower bound, attained for one generator and for two generators with at most one relation; on a finite net of $S$ slices the asymptotic dimension is at most $2nS$.

comments
19 pages. Companion paper: arXiv:2611.12866
fields
Metric Geometry, Algebraic Topology
pdf ↗ page arXiv:2611.16965 ↗

Logic13

Piecewise interpretations, introduced by Visser, generalize ordinary interpretations between first-order theories by allowing formulae to be interpreted using disjoint unions of definable sets. This makes it possible to capture natural constructions, such as the projective completion of an affine plane, but also leads to a notion of equivalence of theories, namely piecewise bi-interpretability. We develop the theory of piecewise interpretations systematically in the many-sorted setting. Each piecewise interpretation induces a semantic dual, a functor between categories of models. In addition, we introduce a syntactic notion of morphism between piecewise interpretations, which likewise has a semantic dual. Using these semantic duals, we collect theories, piecewise interpretations, and morphisms between them into a bicategory, in particular defining a well-behaved notion of composition of interpretations, associative up to coherent isomorphism. As an application, we consider a familiar idea, championed by Quine, namely that one can replace any many-sorted theory with a corresponding single-sorted one by replacing sorts with sortal predicates. We show that this leads to a biequivalence between the developed bicategories of theories with finitely many sorts and single-sorted theories, thereby providing an argument for the dispensability of sorts.

comments
49 pages
fields
Logic
pdf ↗ page arXiv:2611.14552 ↗

A real number is called \emph{nearly computable} if it is the limit of a computable sequence of rational (or dyadic) numbers that has the additional property that for any computable subsequence the sequence of differences of consecutive elements converges to $0$ computably. The main result of this article provides methods for constructing nearly computable numbers with additional properties. The main result is proved by an infinite injury priority argument. Using these methods, we construct nearly computable numbers with several different additional properties: - a nearly computable number that is not divergence bounded computable, - for any left-computable number $α$ that is neither in the least nor in the highest Solovay degree, a left-computable, nearly computable number that is Solovay incomparable with $α$, - a nearly computable number $γ$ that can be written as the difference of two left-computable numbers but has the property that for any two left-computable numbers $α$ and $β$ wih $γ=α-β$ both $α$ and $β$ are Martin-Löf random. We also look at two classes of nearly computable numbers: the class $\mathbb{R}_{\mathrm{dlnc}}$ of differences of real numbers that are nearly computable and left-computable, and the class $\mathbb{R}_{\mathrm{wnc}}$ of nearly computable numbers that can be written as the difference of two left-computable numbers. Both classes form real closed fields, in fact, $\mathbb{R}_{\mathrm{dlnc}}$ is closed under computable functions with open domain that are Lipschitz continuous or differentiable. Finally, we show that $\mathbb{R}_{\mathrm{dlnc}}$ is a proper subset of $\mathbb{R}_{\mathrm{wnc}}$.

fields
Logic
pdf ↗ page arXiv:2611.15254 ↗

We study the splitting number at singular cardinals with emphasis on what we call the reduction to the cofinality problem: whether $\mathfrak{s}_κ = \mathfrak{s}_{\mathrm{cf}(κ)}$ holds for a singular cardinal $κ$. Our main tool is the transfinite logarithm function $\mathrm{log}_{2}(μ) := \min \{ λ\in \mathrm{card} \colon μ\leq 2^λ \}$ defined for every infinite cardinal $μ$. We prove that the reduction holds, and in fact $\mathfrak{s}_κ = \mathrm{log}_{2}(\mathrm{cf}(κ))$, whenever $\mathrm{cf}(κ)$ is uncountable and not weakly compact. When $\mathrm{cf}(κ) = \aleph_{0}$, we show that $\mathfrak{s}_κ = \mathfrak{s}$ provided that $\mathfrak{s} \leq \log_{2}(κ)$, while the failure of the reduction is consistent with $\mathrm{ZFC}$. When $\mathrm{cf}(κ)$ is weakly compact, we use a model constructed by Ben-Neria and Gitik to prove that, under suitable large cardinals hypothesis, $\mathfrak{s}_κ < \mathfrak{s}_{\mathrm{cf}(κ)}$ is consistent. Furthermore, we show that the consistency strength of $\mathrm{ZFC} \, +$"$\exists κ\in \mathrm{card} [\mathrm{cf}(κ) > \aleph_{0} \wedge \mathfrak{s}_κ < \mathfrak{s}_{\mathrm{cf}(κ)}]$'' is at least that of the negation of the singular cardinal hypothesis. Finally, we study the cofinality of $\mathfrak{s}_κ$, 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 $κ$ such that $\mathfrak{s}_κ$ is singular, partially answering an open question posed by Fischer and Soukup.

comments
23 pages, 1 table
fields
Logic
pdf ↗ page arXiv:2611.15620 ↗

We consider polynomial-time computation over arbitrary structures, with unit cost for the primitive operations and relations and with nondeterministic witnesses consisting of arbitrary structure elements. We prove that every finite-signature structure with two distinct available elements and containing a binary operation $*$ and total unary operations $L,R$ such that $L(x*y)=x$ and $R(x*y)=y$ satisfies $P\ne NP$. The proof encodes an exponentially long computation in one element. An incorrect transition has a polynomial-size binary address, and hence the existence of an error is an $NBP$ problem. Existence of a correct accepting trace belongs to the mixed second level $Σ_2^{S,B}$, with an arbitrary-element existential block followed by a binary universal block. We obtain $EXP\subseteqΣ_2^{S,B}\subseteq PH$. A hypothetical equality $P=NP$ would collapse this hierarchy to $P$ and imply $P=EXP$, contradicting a direct deterministic diagonalization over the same structure. A simulation by function graphs extends the obstruction to every jointly injective binary primitive under the same assumptions on equality and available elements. Consequently no unary predicate on Malcev's free binary-tree algebra yields $P=NP$, with or without the projections. In contrast, starting from the author's unary example, we construct five infinite structures with binary operations and $P=NP$. These include an algebra with one binary operation and one constant, an expansion with an associative rectangular-band operation, and an algebra with one binary operation whose every row and column has infinite image.

fields
Logic
pdf ↗ page arXiv:2611.15773 ↗

In \cite{Kojman2026}, Kojman generalized Mary Ellen Rudin's construction of a ZFC Dowker space to larger cardinals and gave a pcf-theoretic condition ensuring that the resulting spaces are collectionwise normal. A subsequent manuscript by Eisworth, Kojman, Lambie-Hanson, and Marun \cite{EKLM2026} develops the theory further and leaves open whether these generalized Rudin spaces can fail to be normal. We answer this question by proving that, for cardinals $μ<δ$ with $\operatorname{cf}(δ)=\aleph_0$, the generalized Rudin space $X(μ,δ)$ is normal if and only if $\operatorname{pp}(ν)<δ$ for every cardinal $ν\in(μ,δ)$ with $\operatorname{cf}(ν)=\aleph_0$. Given this characterization, known consistency results provide consistent examples of nonnormal generalized Rudin spaces.

comments
First public version
fields
Logic
pdf ↗ page arXiv:2611.15840 ↗

We study how stability and the independence property of the norm formula $\varphi(x,y)=\lVert x+y\rVert$ on a real Banach space relate to the same properties in its complete theory. We construct separable Banach spaces $X$ and $Y$ and a separable elementary extension $W$ of $X$. The norm formula is stable on $X$ and has the independence property on $W$, and therefore in $\operatorname{Th}(X)$. It is unstable on $Y$ and has no independence property in any model of $\operatorname{Th}(Y)$. Together with $\ell_2$ and $X\oplus_2Y$, these spaces realize all five possible combinations of stability, instability without the independence property, and the independence property on a space with the presence or absence of the independence property in its complete theory. All five spaces are uniformly convex and $\sqrt3$-isomorphic to Hilbert space. Their norms satisfy the common midpoint estimate $\lVert x\rVert,\lVert y\rVert\leq1 \Longrightarrow \lVert(x+y)/2\rVert^2\leq1-(1/12)\lVert x-y\rVert^2$, and $W$ contains no isomorphic copy of $c_0$. The proof for $Y$ uses coordinate truncation and a polynomial bound on threshold patterns for vectors of bounded support. These bounds give finite fat-shattering dimension at each positive scale, from which the complete-theory conclusion follows.

comments
18 pages
fields
Logic, Functional Analysis
pdf ↗ page arXiv:2611.15930 ↗

A structure is rigid if it admits no non-trivial automorphisms. We investigate an analogous invariance property for first-order theories, with relative interpretations playing the role of morphisms. A theory $T$ is called rigid if and only if every self-interpretation of $T$ is definably isomorphic to the identity interpretation. Extending work of Pakhomov and Zapryagaev (2020) on Presburger Arithmetic, we establish rigidity for Successor Arithmetic and Skolem Arithmetic (with respect to one-dimensional interpretations), True Arithmetic, and the theories of fields $\mathrm{RCF}$ and $\mathrm{ACF}$. By contrast, $\mathrm{PA}$ and $\mathrm{ZF}$ admit infinitely many self-interpretations, though both remain rigid with respect to (co-)retractions. Our main negative result is that $\mathrm{ZFC}$ has no consistent rigid extension in its own language. We compare rigidity with categoricity, model rigidity, completeness, and solidity, showing it to be independent of the first three, and indicate the relevance of rigidity to questions about semantic determinacy.

comments
33 pages
fields
Logic
pdf ↗ page arXiv:2611.16067 ↗

Grammar logics with converses are multi-modal logics that generalize tense logics and whose frame conditions are determined by context-free production rules. We study the strong Lyndon interpolation property (strong LIP) for these logics, which requires interpolants to respect both the polarities of propositional atoms and the indices of modalities. We show that the strong LIP properly strengthens the Lyndon interpolation property over grammar logics, since it fails for certain grammar logics with bridge axioms, i.e., path axioms relating modalities with distinct indices. We then prove that every bridge-free grammar logic, possibly extended with seriality axioms, has the strong LIP. This class includes the multi-modal tense logics obtained by imposing any combination of seriality, reflexivity, transitivity, symmetry, and Euclideanity on each pair of converse modalities. Our proof is constructive and purely syntactic, and is based on tree sequent calculi. Because standard methods for computing interpolants with tree and nested sequents may introduce modalities whose indices are not common to both sides of an implication, we introduce a novel tripartite partition method. It sorts the labels of a proof into common labels and labels private to the left or right component, and only lets relational atoms pointing to common labels contribute modalities to interpolants. Given a proof of an implication, our method computes a strong Lyndon interpolant together with proofs of its correctness.

comments
in review
fields
Logic
pdf ↗ page arXiv:2611.16481 ↗

We present a new axiomatic theory of disquotational truth based on the theory of positive disquotation PUTB. Formulated in classical logic, PUTB restricts the T-schema to positive sentences and satisfies key epistemic desiderata (semantic conservativity and trustworthiness). However, it fares poorly in proof-theoretic strength compared to reflective truth frameworks. To address this, we propose a new theory of positive disquotation aimed at axiomatizing its least fixed-point model. Without requiring additional resources, we achieve this by incorporating ill-founded reasoning under suitable soundness restrictions, applying the tools of cyclic proof theory to axiomatic theories of truth. The resulting theory, CPUTB, is sound relative to the minimal fixed-point model and proves the same arithmetical theorems as the impredicative theory ID1.

fields
Logic
pdf ↗ page arXiv:2611.16597 ↗

We investigate the strong completeness of $\mathrm{GL}(\mathbb P)$ for an infinite set of propositional variables $\mathbb P$ over ordinal spaces equipped with the interval topology $\mathcal{I}_1$. For every infinite cardinal $κ$, we consider the set \[ Γ_κ= \{\Diamond p_ξ:ξ<κ\} \cup \{\Box(p_ξ\to\Diamond p_η):ξ<η<κ\}, \] and prove that $Γ_κ$ has a model on an ordinal space with $\mathcal{I}_1$ if and only if $κ\nrightarrow_{\mathrm{ipath}}(ω)^2_{ω,<ω}$. We also prove that if $|\mathbb P|<\mathfrak p$, then $\mathrm{GL}(\mathbb P)$ is strongly complete with respect to $(ω^ω+1,\mathcal I_1)$. Finally, we establish the strong completeness of $\mathrm{GL}(\mathbb P)$ with respect to the same space whenever $|\mathbb P|=\aleph_1$.

fields
Logic
pdf ↗ page arXiv:2611.16753 ↗

It was shown recently by Borzechowski et al. (2026) that Propositional Dynamic Logic (PDL) has Craig Interpolation. Whether test-free PDL, i.e. PDL without the `?' operator, has interpolation remained open. Here we answer this question in the negative with a counterexample: a test-free PDL validity for which no test-free interpolant exists. The validity only uses one atomic program and the Kleene star, so it implies that the basic modal logic K extended with the reflexive transitive closure does not have interpolation, as previously shown by Studer (2009). The example was originally obtained using LLMs and Lean. We describe our methodology and provide links to all prompts, LLM output summaries as well as the Lean proof.

fields
Logic
pdf ↗ page arXiv:2611.16759 ↗

We develop a general technique for deriving covering theorems from pcf-theoretic information by refining sequences of partitions. The method gives a direct proof of Shelah's cov vs. pp theorem and analogous results for diagonal coverings associated with normal ideals and covering modulo arbitrary $σ$-complete ideals, where $σ$ is regular and uncountable. In each setting, we characterize the covering invariant through pseudopowers, true cofinalities of reduced products of progressive sets, and appropriate notions of cofinality in (possible non-progressive) intervals of regular cardinals.

comments
First public version
fields
Logic
pdf ↗ page arXiv:2611.17157 ↗

Solovay's celebrated result establishes the arithmetical completeness of GL by embedding Kripke models into arithmetic. We provide an alternative proof of the arithmetical completeness of GL, in which we instead embed failed proof searches into arithmetic. Our methodology requires only a well-behaved sequent calculus and does not rely on completeness with respect to Kripke semantics or any of its variants. This approach is particularly interesting for logics that do not behave well semantically, such as ER, for which we also provide a new proof of arithmetical completeness.

fields
Logic
pdf ↗ page arXiv:2611.17165 ↗

Quantum Algebra11

We examine the relationship between the Hopf algebra on nonplanar binary forests, previously defined by the author, and a Hopf algebra defined by Bruned and used in the renormalization of stochastic PDEs. We show that Bruned's Hopf algebra and its reduced analogue, previously studied by Foissy in the context of combinatorial twisted bialgebras, are dual to Hopf algebras derived from pre-Lie insertion operations respecting the number of leaves, which induce leaf-based gradings on the dual Hopf algebras. We compute Hochschild 1-cocycles for these Hopf algebras and show that Bruned's Hopf algebra satisfies a similar universal property as the Connes-Kreimer Hopf algebra.

comments
24 pages, 2 figures. Comments welcome!
fields
Quantum Algebra, Combinatorics, Rings and Algebras
pdf ↗ page arXiv:2611.14812 ↗

We formulate the notion of connection-twisted modules for $\mathbb{C}$-graded vertex algebras, as suggested by Feigin and Lentner, and investigate their fundamental properties. Let $G$ be an algebraic group acting on a vertex algebra $V$ by automorphisms. We establish an equivalence between the category of $\nabla$-twisted $V$-modules and the category of $g$-twisted $V$-modules, where $\nabla$ is a regular singular $\mathfrak{g}$-connection and $g\in G$ is its monodromy. For symplectic fermion and affine vertex algebras, we explicitly compute the commutation relations and the action of the Virasoro algebra on connection-twisted modules, recovering the formulas obtained by Feigin and Lentner \cite{FL24,FL25}.

comments
17 pages
fields
Quantum Algebra, Representation Theory
pdf ↗ page arXiv:2611.15148 ↗

We propose natural definitions of cuts and flows for quantum graphs. For cuts we consider two notions: ordinary cuts, which partition the vertex set into two parts; and generalised cuts, defined as a continuous relaxation of the binary partition function. We show that our definitions satisfy a max-flow min-cut theorem: For any disjoint terminal sets $S$ and $T$, the maximum value of an $S$-$T$-flow of a quantum graph equals the minimum value of a generalised $S$-$T$ cut, while the minimum value of an ordinary $S$-$T$ cut can be larger. While for classical graphs the values of the minimum generalised cut and the minimum ordinary cut coincide—recovering the classical max-flow min-cut theorem—we also show how it is more natural to think of flows as duals of generalised cuts instead of ordinary cuts.

fields
Quantum Algebra, Mathematical Physics, Operator Algebras
pdf ↗ page arXiv:2611.15508 ↗

Victoria Lebed observed that the map $(x, \, y) \mapsto (\min\{x, \, y\}, \, \max\{x, \, y\})$ on a totally ordered set is an idempotent solution of the braid equation. We extend this example in several directions, by constructing four families of solutions of the braid equation associated to posets. First, for a given poset $P$, the map $R_P$ which sorts the comparable pairs and fixes the incomparable ones is an idempotent solution of the braid equation whose automorphism group is the automorphism group of the poset $P$. Combined with the classical theorem of Birkhoff, this shows that every group is isomorphic to the automorphism group of an idempotent solution of the braid equation of the form $(P, \, R_P)$, for some poset $P$. Moreover, $R_P \cong R_Q$ if and only if $P \cong Q$, and the solutions of the form $R_P$ are exactly the idempotent solutions of the braid equation which permute the components of each pair. Secondly, we classify all the solutions $R$ of the braid equation on an arbitrary set $X$ such that $R(x, \, y) \in \{(x, \, y), \, (y, \, x)\}$ for all $x$, $y\in X$: they are exactly the solutions $R_{\mathcal{P}}$ associated to the decompositions $\mathcal{P}$ of $X$ into posets. Finally, we associate to any finite poset $P$ two involutive solutions $D_P$ and $E_P$ of the braid equation, whose automorphism groups are $(\mathbb{Z}/2)^P \rtimes {\rm Aut} (P)$ and, if $P$ is connected and has at least two elements, the group of automorphisms and anti-automorphisms of $P$.

comments
17 pages + references
fields
Quantum Algebra, Combinatorics, Group Theory, Rings and Algebras
pdf ↗ page arXiv:2611.15540 ↗

We investigate the orbifold theory for condensable algebras in fusion categories $\mathcal{C}$. We prove that the algebra automorphism group of a condensable algebra $A$ is finite and explicitly characterize its elements in terms of the fusion action and indecomposable $\mathcal{C}_{A}^0$-bimodule decomposition of $\mathcal{C}_{A}$. We further show that a finite group action on $A$ gives rise to a group extension of the category $\mathcal{C}_{A}^0$ in $\mathcal{C}_{A}$. Conversely, every such group extension arises from a finite group of algebra automorphisms of $A$. Finally, we also construct a canonical maximal group extension of $\mathcal{C}_{A}^0$, thereby providing a categorical framework for the classical correspondence among finite group actions, fixed-point algebras, and twisted modules.

comments
34 page in Latex
fields
Quantum Algebra, Category Theory, Group Theory, Rings and Algebras, Representation Theory
pdf ↗ page arXiv:2611.15630 ↗

We describe a quantization procedure for Betti mapping stacks with shifted Poisson targets by combining factorization homology and formal geometry. We quantize derived stacks of local systems of low-dimensional manifolds.

fields
Quantum Algebra, Mathematical Physics, Algebraic Geometry, Algebraic Topology
pdf ↗ page arXiv:2611.16137 ↗

Let $ V $ be a vertex operator algebra with two commuting automorphisms $ g_1 $ and $ g_2 $ (possibly of infinite order and non-semisimple). We derive a Jacobi identity for a twisted intertwining operator $ \mathcal{Y} $ of type $ \left( \begin{smallmatrix} W_3\\ W_1 \, W_2 \end{smallmatrix}\right) $ when $ W_1 $ is a $ g_1 $-twisted $ V $-module, $ W_2 $ is a $ g_2 $-twisted $ V $-module, and $ W_3 $ is a $ g_1 g_2 $-twisted $ V $-module. For any abelian group $ G $ of automorphisms of a CFT-type vertex operator algebra, under certain Noetherian assumptions, we derive differential equations satisfied by the multi-series $ \langle w_0, \mathcal{Y}_1(w_1,z_1) \cdots \mathcal{Y}_N(w_N,z_N) w_{N+1} \rangle $ when $ \mathcal{Y}_j $ are intertwining operators among $ C_2 $-cofinite and discretely graded $ V $-modules twisted by elements in $ G $. For modules twisted by automorphisms with only real positive eigenvalues, it suffices to assume $ C_1 $-cofiniteness and discrete grading. When all but at most two external modules are twisted by automorphisms having only positive real eigenvalues, it suffices to assume all in-state and internal modules are $ C_1 $-cofinite and discretely graded. When $ G $ is a finite abelian group, we use the theory of regular singular points to prove that the multi-series $ \langle w_0, \mathcal{Y}_1(w_1,z_1) \cdots \mathcal{Y}_N(w_N,z_N) w_{N+1} \rangle $ converges absolutely to a multivalued analytic function when $ |z_1| > \cdots > |z_N| > 0 $ and analytically extends to the region $ z_i \neq 0 $, $ z_j - z_k \neq 0 $, for $ 1 \leq i \leq N $ and $ 1 \leq j < k \leq N $. The vertex operator algebra $ V $ is not assumed to be $ C_2 $-cofinite or simple.

comments
55 pages, 3 figures
fields
Quantum Algebra
pdf ↗ page arXiv:2611.16391 ↗

We introduce small braidings on inclusions of monoidal categories $\mathcal{C}\hookrightarrow\mathcal{D}$, which allow one to braid objects in $\mathcal{C}$ with objects in $\mathcal{D}$. A small braiding makes $\mathcal{C}$ a braided monoidal category, and turns $\mathcal{D}$, as well as certain subcategories of $\mathcal{D}$, into braided module categories over $\mathcal{C}$. We prove versions of previously known reconstruction results for braided module categories which do not rely on finiteness assumptions. We construct a number of new examples coming from quantum groups, as well as the associated quantum moment maps.

comments
47 pages
fields
Quantum Algebra, Mathematical Physics, Category Theory
pdf ↗ page arXiv:2611.16900 ↗

Crossing a domain wall can permute anyons, and intersecting strings can create a particle. These couplings between defects of various dimensions are specified by higher groups. We develop a lattice framework defining higher-group statistics as Berry phases of closed sequences of hopping operators, invariant under local modifications of the operators. Our central example is a closed Majorana chain, a 1-dimensional topological superconductor, embedded in 3 dimensions. We construct a loop-flip process with phase $+i$, refining the usual $\pm 1$ loop-flip invariant through intermediate transfer of fermion parity between the chain and physical fermions. In two dimensions, charge-wall statistics distinguish two $\mathbb Z_4$ toric codes enriched by $\mathbb Z_2$ charge-conjugation symmetry, with identical anyon statistics but distinct gauged theories: the quantum doubles of the dihedral group $D_4$ and the quaternion group $Q_8$. We provide two complementary constructions of statistical processes. The first extends the Smith normal form algorithm in [Phys. Rev. X $\textbf{16}$, 011010 (2026), arXiv:2412.01886] to higher groups, generating processes from lattice geometry and prescribed local moves. For a finite higher group $\mathbb G$, we prove that statistical processes on a $d$-sphere are classified by $H_{d+2}(B\mathbb G,\mathbb Z)$. The second constructs processes directly from homology classes without examining exponentially many defect configurations, enabling us to study statistics for complex higher-group structures where the previous method is computationally prohibitive. These processes detect boundary anomalies of higher-group symmetry-protected topological phases. For example, we distinguish 2-group anomalies in 1, 2, and 3 dimensions. Higher-group statistics provide new invariants for characterizing coupled defects in quantum many-body systems.

comments
41 pages, 9 figures
fields
Quantum Algebra
pdf ↗ page arXiv:2611.16962 ↗

While studying the chiral Potts model Baxter discovered a cyclic analogue of Ramanujan's ${}_1ψ_{1}$ summation identity. This identity was subsequently interpreted by Faddeev and Kashaev as a pentagon relation for the quantum dilogarithm function, a key ingredient in cyclic quantizations of Teichmüller theory. Existing forms of the identity involve multivalued functions so one must either accept overall phase ambiguities or keep track of branches on a complicated covering space. In this paper we show how to remove the phase ambiguities with a much simpler choice of covering space. As an application we compute the Fourier transform of the holonomy $R$-matrices of the author and Reshetikhin. A corollary is a simpler proof that Kashaev's $R$-matrix is a specialization of the colored Jones $R$-matrix, which was first shown by Murakami and Murakami.

comments
25 pages + bibliography
fields
Quantum Algebra, Geometric Topology
pdf ↗ page arXiv:2611.16987 ↗

Let $\mathfrak{g}$ be a symmetrizable Kac–Moody algebra, let $q\in\mathbb{C}^\times$ not be a root of unity, and let $\mathbf{U}=U_q(L\mathfrak{g})$ be the corresponding quantum loop algebra, equipped with Hernandez' deformed Drinfeld coproduct. For every diagram involution $τ$ of $\mathfrak{g}$, we introduce a coideal subalgebra $\mathbf{B}$ in a topological completion of $\mathbf{U}$, obtained by adapting the Letzter-Kolb construction of quantum symmetric pairs to the Drinfeld generators of $\mathbf{U}$. We derive necessary constraints on the parameters defining $\mathbf{B}$ from a minimality condition on its intersection with the quantum loop Cartan subalgebra $\mathbf{U}^0\subset\mathbf{U}$. We show that $\mathbf{B}$ yields a topological realization of the quasi-split $\imath$quantum loop group $\mathbf{U}^\imath$ associated with $τ$, in the presentation recently obtained by Lu-Pan, building on work of Chen-Lu-Pan-Ruan-Wang on $\imath$Hopf algebras. By pullback, this gives rise to a rational restriction functor on category O representations. For modules with rational weights and generic values of the spectral parameter, every $\mathbf{U}^\imath$-submodule of a restricted module is stable under the derived quantum loop algebra $\mathbf{U}'$. In particular, irreducibility is generically preserved under restriction for such modules. For $|q|\neq1$ and under explicit assumptions on the quantum Cartan matrix, we construct meromorphic abelian K-matrices whose tensor counterparts yield boundary $q$-characters for both $\mathbf{U}$-modules and $\mathbf{U}^\imath$-modules. Finally, we extend the coideal construction and Drinfeld coaction to shifted $\imath$quantum loop algebras with arbitrary coweight shifts, providing a new approach to $\imath$GKLO representations by restriction from ordinary shifted quantum loop algebras.

comments
84p
fields
Quantum Algebra, Representation Theory
pdf ↗ page arXiv:2611.17138 ↗

Rings and Algebras11

We present a fast modular interpolation method for computing the hypersurface components of algebraic Kippenhahn varieties over number fields. Starting from Hermitian matrices, we factor their determinantal polynomial and use Katz's test to identify the factors whose duals are hypersurfaces. For each such factor, we sample smooth points over finite fields and compute their tangent hyperplanes. These give points on the dual hypersurface, from which we interpolate its defining equation. For number-field coefficients, we use primes at which the defining polynomial of the field factors completely into distinct linear factors. Interpolation across all its roots recovers the residues of the coefficients in a fixed number-field basis. Chinese remaindering and rational reconstruction then recover an equation over the original number field from the computations at different primes. An exact polynomial divisibility test and an irreducibility check certify each reconstructed equation. Four determinantal quartics arising from matrix examples in the literature yield certified dual surfaces of degrees $12$, $18$, $24$ and $34$. We give implementations in Magma and Singular and compare their running times with Gröbner basis elimination.

fields
Rings and Algebras, Algebraic Geometry
pdf ↗ page arXiv:2611.14543 ↗

This work investigates the involutive, adjoint, and spectral structures arising in the extended Alpha Group. Starting from the four-dimensional Alpha Group transformation matrix, whose angular depen- dence is governed by coupled tan θ and cot θ modes, an iterative commutator procedure generates a sixteen-dimensional real Lie algebra. Within this algebra, the operators B5 and B6 are identified as structurally distinguished elements and analyzed through their adjoint actions. The operator B6 is veri- fied to be involutive and induces an 8 + 8 decomposition of the Lie algebra, while the adjoint action of B5 defines an eight-dimensional invariant mixed sector through a polynomial kernel. The restricted adjoint operators preserve this sector, and their coupled action generates an idempotent operator Q, satisfying Q2 = Q, revealing an invariant projective structure. The spectral analysis further identifies characteristic- polynomial factorizations associated with B5 , B6 , and their compositions, including golden-ratio relations among distinct generators of the extended algebra. These results establish structural connections between the original modal representation, Lie-algebraic involution, adjoint dynamics, projective organization, and the spectral structure of the extended Alpha Group.

comments
18 pages, 2 figures. Includes explicit matrix representations of the 16 Lie algebra generators and symbolic and numerical verification of the main structural relations
fields
Rings and Algebras
pdf ↗ page arXiv:2611.14547 ↗

A numerical algorithm is described for computing the inverse of a non-singular multivector across dimensions. The method wraps a reversion-like product around a Faddeev–LeVerrier–Souriau (FLS) polynomial core. While FLS provides dimensional extensibility, the wrapper reduces the polynomial order of the FLS method, and introduces a sparse multivector which can be further exploited. The construction and essential properties of the initial involution are explained. For dimensions 4–7, the optimized inverse requires fewer real multiplications than a same-dimension multivector product. Dimensions 8–11 follow easily on common hardware with similar efficiency. For dimensions 12–15, higher-precision arithmetic demonstrates the generality of the algorithm when the arithmetic can support it. Performance on common hardware is reported. Directions are included for obtaining a Python package with examples for numerical computation in Clifford algebra, supporting arbitrary signatures including degenerate cases.

comments
17 pages, 1 figure. To be included in the conference proceedings for AGACSE 2026
fields
Rings and Algebras
pdf ↗ page arXiv:2611.14549 ↗

We first show that the nonfinitely based six-element ai-semiring $SR_6$ has finitely based full matrix semirings for every $n\ge2$, with a four-identity basis relative to the ai-semiring axioms. To the best of our knowledge, this is the first known example of this phenomenon. We then construct a countably infinite flat ai-semiring $P$ whose scalar and two-by-two matrix varieties are nonfinitely based, whereas its matrix varieties in sizes $n\ge3$ admit a five-identity relative basis. For both examples, the intervals from the scalar variety to each matrix variety of size at least two have cardinality $2^{\aleph_0}$. Finally, we establish transfer results for stronger forms of nonfinite basability and a finite-basis dichotomy for matrix semirings of size at least two over scalars with a genuine zero generating a locally finite variety: finite basability in the multiplicatively nilpotent case, and inherent nonfinite basability otherwise.

fields
Rings and Algebras, Group Theory
pdf ↗ page arXiv:2611.14551 ↗

The simple constituents of monic pencils determine singularity support in a free skew field. For a pencil inverse algebra that is a free ideal ring, the multiplicities of the nonbase constituents compute the scalar-regular part of Cohn's matrix divisor theory. For independent generic invertible matrices of size at least two, every entry of a nonidentity free-group word is an atom with one relative singularity component. In rank two, opposite pivots give the exact identifications among these components. Intersections of word-entry localizations are then given by intersections of their label sets. An irreducible pencil of dimension six represents a commutator entry. For an algebra finitely generated over the free polynomial algebra at a common regular scalar point, the residual closure is a finite pencil inverse algebra determined by the generators' common domain. Every nonzero inverse-adjoining defect is infinite-dimensional. We compute how free-group quotients change intersections and give additive formulas for general quotient and tensor intersections. We prove Berenstein–Retakh's polygon conjecture using $n-2$ charts for $n\geq4$. For an unpunctured Möbius strip with $n\geq2$ boundary marks, the upper-algebra equality follows from $n+1$ charts. For the once-marked strip, the allowed algebra is strictly smaller than its residual hull, which equals the full chart.

comments
30 pages, 1 figure, ancillary Python verification script
fields
Rings and Algebras, Quantum Algebra
pdf ↗ page arXiv:2611.14936 ↗

In this short note, we calculate the spectra of gcd-graphs defined over a matrix ring. Using character sums, we show that this calculation can be reduced to certain counting problems. In particular, when the underlying ring is a matrix ring with coefficients in a finite field, we calculate these spectra explicitly.

comments
Comments are welcome
fields
Rings and Algebras
pdf ↗ page arXiv:2611.15026 ↗

We prove that the Artin–Schelter Gorenstein and Artin–Schelter regular properties descend from a graded Ore extension to its coefficient algebra, for every twisting automorphism and every skew derivation. We then determine the dual reflection groups of graded Ore extensions for all gradings compatible with the Ore structure. They are exactly the semidirect products of a dual reflection group of the coefficient algebra by the cyclic group generated by the degree of the new variable, meeting it trivially, and a nonzero skew derivation never contributes a new degree. For iterated Ore extensions we characterize the dual reflection groups by an order formula analogous to the theorem of Shephard, Todd and Chevalley, and we prove the binomial conjecture of Buzaglo and Rogalski for these algebras. We show that their covariant rings are complete intersections of growth type, whose Ext-algebras grow like a polynomial ring in as many variables as there are generators of nontrivial degree. This answers a question of Kirkman, Kuzmanovich and Zhang for these algebras. Finally, we describe the smash product as a Cayley quiver with relations, factor its matrix Hilbert series, and show that the extension becomes Hopf–Galois once the Jacobian is inverted.

fields
Rings and Algebras, Quantum Algebra, Representation Theory
pdf ↗ page arXiv:2611.15830 ↗

A ring $R$ with nonzero unity is called centrally essential if for every nonzero element $a$ of $R$ there exist nonzero central elements $x$ and $y$ such that $ax = y$. In this paper we obtain a complete classification, up to isomorphism, of non-commutative centrally essential rings of minimal order $64$.

comments
20 pages
fields
Rings and Algebras
pdf ↗ page arXiv:2611.16086 ↗

Gábor Czédli introduced congruence density and investigated how it changes under sublattice extensions. We prove that density cannot increase: if $S$ is a sublattice of a finite lattice $L$, then $\cd(L)\leq2^{-d}\cd(S)$, where $d$ is the larger of the increases in the numbers of join-reducible and meet-reducible elements. We also determine when equality holds: $\cd(L)=\cd(S)$ precisely when every element of $L\setminus S$ is comparable with every element of $L$. The theorem of Czédli and Szabó relating quasiorders to pairs of congruences gives the corresponding results for quasiorder density.

fields
Rings and Algebras
pdf ↗ page arXiv:2611.16165 ↗

We obtain a criterion for the uniqueness of addition in Schrödinger Lie algebras, applicable to both bijections and injections. This allows us to construct the first example of a Lie algebra with unique addition and a non-trivial center over a field of characteristic zero. Furthermore, a necessary and sufficient condition is established for the Schrödinger algebras to have bracket width one.

fields
Rings and Algebras
pdf ↗ page arXiv:2611.16812 ↗

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.

comments
6 pages, comments are welcome
fields
Rings and Algebras, Representation Theory
pdf ↗ page arXiv:2611.17132 ↗

Operator Algebras7

We construct the first, to our knowledge, examples of strongly quasidiagonal C*-algebras with finite nuclear dimension and infinite decomposition rank. The examples are extensions of the form $0\to I \to E\to C(\mathbb{T})\to 0$ where $I$ is a simple AF-algebra. These examples are in some sense the easiest `natural' choices in light of Spielberg's work on AF-embedding extensions and the behavior of each dimension theory with respect to extensions. The standard extension bound provides $\dim_{\mathrm{nuc}} E \leq 2$ which is improved to 1 by recent work of Evington, Faurot and Schafhauser. Nuclear dimension 1 is the lowest possible for such an example because decomposition rank and nuclear dimension agree at 0. Finally, failure of the comparison property used to show infinite decomposition rank was inspired by local operator space techniques of Junge, Ozawa and Ruan.

comments
9 pages
fields
Operator Algebras
pdf ↗ page arXiv:2611.14888 ↗

Let $\mathcal A$ be a unital commutative real $C^*$-algebra and $\mathcal H$ be a finite dimensional real Hilbert space. In this article, an easily verifiable necessary and sufficient condition for a linear extreme unital completely positive (UCP) map $Φ:\mathcal A \rightarrow B(\mathcal H)$ to be C*-extreme, is obtained. As an application, the $C^*$-algebras $\mathcal A$ on which linear extreme UCP maps coincide with the $C^*$-extreme ones, are classified.

comments
First version. Comments are welcome
fields
Operator Algebras, Functional Analysis
pdf ↗ page arXiv:2611.15383 ↗

A unital $C^*$-algebra is called clean if every element is the sum of an idempotent and an invertible element. We prove that cleanness is equivalent to real rank zero. More precisely, the invertible summand can be chosen with inverse norm at most $2+\varepsilon$ for every $\varepsilon>0$, and the constant $2$ is optimal. In particular, every von Neumann algebra is clean, answering a question of Lam. Clean decompositions with uniformly bounded idempotent summands characterize real rank zero and stable rank one. Moreover, $*$-cleanness, defined by requiring the idempotent summands to be projections, is equivalent to real rank zero, stable rank one, and triviality of the $K_1$-group. Finally, sharp cleanness, defined by requiring clean decompositions with inverse norm at most $2$, is equivalent to real rank zero and the $SAW^*$ property.

fields
Operator Algebras
pdf ↗ page arXiv:2611.15407 ↗

We show that every classifiable stably finite $C^*$-algebra is isomorphic to the $C^*$-algebra of a second countable, locally compact Hausdorff, principal étale groupoid. Equivalently, every such $C^*$-algebra has a $C^*$-diagonal whose Weyl twist is trivial. Together with Evington and Sibbel's recent result for all UCT Kirchberg algebras, this provides untwisted principal groupoid models for every classifiable $C^*$-algebra.

comments
116 pages
fields
Operator Algebras
pdf ↗ page arXiv:2611.16079 ↗

We define a locally compact quantum group $\mathbb{G}$ to be almost unimodular if its modular element is diagonalizable. This is shown to be equivalent to the almost periodicity of a novel weight on the dual von Neumann algebra, which we call the middle Haar weight. The point modular spectrum of this weight is related to the point spectrum of $δ$, and we prove that unimodularity of $\mathbb{G}$ is equivalent to traciality of this weight. When $δ$ is affiliated with the center of $L^\infty(\mathbb{G})$, we show that there is a canonical closed, normal, unimodular quantum subgroup $\mathbb{G}_1 \leq \mathbb{G}$ which assumes the role of the unimodular part of $\mathbb{G}$, and moreover the openness of this quantum subgroup is equivalent to the almost periodicity of $\mathbb{G}$. Additionally, we establish several permanence properties of almost unimodularity.

comments
24 pages, no large language models were used in the development of this article
fields
Operator Algebras, Quantum Algebra
pdf ↗ page arXiv:2611.16136 ↗

We prove non-commutative Kac's formula for actions of countable groups. We replace the return time functions by suitable projections in von Neumann algebras. Moreover, we prove a generalised Kac's formula in the non-commutative setting which extends the allocation construction of Meyerovitch and Weiss and is motivated by the random Kac inequality of Aaronson.

comments
19 pages; preliminary version. Comments are welcome
fields
Operator Algebras, Dynamical Systems, Functional Analysis
pdf ↗ page arXiv:2611.16972 ↗

The free Burnside group $B(m,n)$ is obtained from the free group of rank $m$ by imposing the relations $w^n=1$ for all words $w$. We prove that $B(m,n)$ is completely $C^*$-selfless for every $m\geq2$ and every odd exponent $n\geq557$. Consequently, its reduced group $C^*$-algebra has stable rank one and strict comparison of positive elements by its canonical trace. This answers the question of whether $C^*$-selfless groups can satisfy a nontrivial group law. The proof establishes Ozawa's property $P_{PHP}$ by combining a combinatorial construction with a relative power-avoidance argument based on the canonical forms of Atkarskaya-Rips-Tent.

fields
Operator Algebras, Group Theory
pdf ↗ page arXiv:2611.17285 ↗

Commutative Algebra6

The binary Goldbach ring over a field $k$ is the quotient of $R=k[x_p:p\text{ an odd prime}]$ by the relations $x_px_q=x_{p'}x_{q'}$ whenever $p+q=p'+q'$, with $°x_p=(p,1)$. We prove that if $g$ is a map from the odd primes to an abelian group and $g(p)+g(q)$ depends only on $p+q$, then $g(p)=g(3)+\frac{p-3}{2}(g(5)-g(3))$ for every odd prime $p$. This settles Kátai and Phong's conjecture on shifted prime arguments and proves, for odd primes, the affine classification they conjectured for binary sums. The universal group of binary prime relations is free of rank two. We obtain a minimal bigraded free resolution from compatible resolutions of finite truncations and determine the growth of its linear Betti numbers in two regimes. For fixed monomial degree $d\ge3$, as the Goldbach degree $n\to\infty$ through $n\equiv d\pmod2$, we prove $β_{d-1,n,d}\sim(d-1)T_d(n)/d!$, where $T_d(n)$ counts ordered representations by $d$ odd primes. Explicit Koszul cycles from common prime shifts span a positive fraction of this strand. For finite supports $\mathcal{A}_m=\{p\le m:p\text{ an odd prime}\}$, fix the homological degree $i\ge1$ and sum over all Goldbach degrees. As $m\to\infty$, the linear-strand totals are asymptotic to $i|\mathcal{A}_m|^{i+1}/(i+1)!$ when all binary relations on $\mathcal{A}_m$ are retained, and to $(1-2^{-i})|\mathcal{A}_m|^{i+1}/(i+1)!$ when only relations of common weight at most $m$ are retained. These leading estimates are uniform over fields. The interpolation theorem gives eventual depth at most two for the variable truncations; both truncation families have asymptotically maximal projective dimension.

comments
56 pages, 6 figures. The ancillary files contain the computational supplement
fields
Commutative Algebra, Number Theory
pdf ↗ page arXiv:2611.14580 ↗

We generalize a result known for Prüfer domains to show that a PVMD $R$ is completely integrally closed if and only if $\text{Inv}^t(R)$ is an archimedean $\ell$-group. It has been conjectured that a PVMD is completely integrally closed if and only if it is an Archimedean domain. It is known that a completely integrally closed PVMD is an Archimedean domain. We provide an example to illustrate that an Archimedean PVMD need not be completely integrally closed.

comments
7 pages, comments welcome
fields
Commutative Algebra
pdf ↗ page arXiv:2611.14767 ↗

Let $I$ be a proper ideal in a standard graded polynomial ring $P$ with homogeneous maximal ideal $\m$. We show that there exists $k_0\in \mathbb{N}$ such that $\m^kI$ is Golod for all $k\geq k_0$. The smallest such $k_0$ is denoted $\mathrm{gt}_{\m}(I)$. We give an explicit formula for $\mathrm{gt}_{\m}(I)$ in the case when $I$ is a monomial complete intersection and bounds for $\mathrm{gt}_{\m}(I)$ for other classes of ideals. We show that under a certain degree condition, the product of a Golod ideal with a maximal homogeneous ideal is Golod. In the last section, we show that in a regular local ring of dimension 3, the product of any two proper ideals is Golod; this solves a question posed by Dao-Stefani \cite[Question 4.5]{dao2022monomial} and VandeBogert \cite[Question 4.11]{vandebogert2022products}.

comments
18 pages
fields
Commutative Algebra
pdf ↗ page arXiv:2611.14876 ↗

Let $(R,\mathfrak{m})$ be a Noetherian local ring and let $I$ be generated by a filter regular sequence. Set $A=R/I$, $s=\dim A>0$, and $D= \operatorname{hdeg}(A)$. If $A$ is equicharacteristic, we prove that perturbations of order $(2s+1)D$ preserve the Hilbert–Samuel function in every dimension. In arbitrary characteristic, we obtain the order $[s+(s+1)(k!)^{k-1}]D^k$, where $k$ is the maximum of $1$ and the dimensions of the lower deficiency modules of $\widehat A$. Both bounds depend only on the final quotient. The proof constructs monic annihilating equations for the deficiency modules and uses them to choose a parameter $d$-sequence with an explicit relation to a reduction of the maximal ideal. In the equicharacteristic case, a dimension filtration and characteristic polynomials over regular subrings give equations of degree at most the arithmetic degree, with coefficients in the required powers of the reduction.

comments
29 pages
fields
Commutative Algebra
pdf ↗ page arXiv:2611.14933 ↗

The cohomology ring of a union of Schubert varieties $X_{W}=\bigcup_{w\in W}X_w,$ for $W\subseteq S_n$, in the complete flag variety is well known to be a quotient of the coinvariant ring $R_n$. We determine exactly when the ideal defining this quotient is generated by squarefree monomials, i.e. when it can be identified with the image of a Stanley-Reisner ideal $I_Δ$ in $R_n$. We prove that a single Schubert variety $X_w$ has this property exactly when $w\in S_n$ avoids a set of seven patterns, and in this case we describe the corresponding doubly-pruned simplicial complex $Δ$. We then show this is equivalent to $X_w$ being cut out of the complete flag variety by particular inclusion conditions on the pieces of the flag. We prove these complexes are vertex decomposable, and are Cohen-Macaulay precisely when $X_w$ is smooth. We then give a closed formula for the Poincaré polynomial of $X_w$. For unions $X_W$, pattern avoidance is necessary but no longer sufficient, and we prove a necessary and sufficient condition we call prunable that describes how the individual complexes associated to each $w\in W$ may be glued in the union. Quotients of $R_n$ by squarefree monomial ideals appear naturally in the Adams-Reiner conjecture on resolutions of Stanley-Reisner rings over certain parameter rings. We prove their conjecture for a family of simplicial complexes that includes the doubly-pruned complexes.

fields
Commutative Algebra, Combinatorics
pdf ↗ page arXiv:2611.15065 ↗

We say that a standard graded algebra is cyclotomic if all roots of its $h$-polynomial lie on the complex unit circle. We study which products of cyclotomic polynomials can occur as $h$-polynomials of standard graded Cohen–Macaulay algebras without being of complete intersection type. For each fixed positive integer $a$, we reduce the nonexistence problem for multiplicities $ap$ over all sufficiently large primes $p$ to finitely many cases. Combining this reduction with explicit constructions, we completely characterize the positive integers $k$ for which such a polynomial of multiplicity $8k$ exists: precisely those satisfying \[k\notin\{1,2,3,6\}\cup\{p:p\ge7\text{ is prime}\}\cup\{3p:p\ge17\text{ is prime}\}.\]

comments
15 pages
fields
Commutative Algebra, Combinatorics
pdf ↗ page arXiv:2611.16362 ↗

Spectral Theory6

We consider a class of regularizations $\{δ_\varepsilon\}$ of the Dirac delta defined by a uniform $L^1$ bound, the normalization $\intδ_\varepsilon\to1$, and a truncated first-moment condition, with no restriction on sign, shape, support, or scaling. For this class we prove that the transmission and reflection coefficients for the Hamiltonian operator $H_\varepsilon=-\frac{d^2}{dx^2}-λδ_\varepsilon$ at fixed energy converge to those of the delta interaction. Under the additional assumption that each $δ_\varepsilon$ is bounded, we show that any family of negative eigenvalues of $H_\varepsilon$ bounded away from zero converges to $-λ^2/4$ when $λ>0$, and that no such family exists when $λ<0$. Both convergences are obtained with an explicit rate, expressed through two integrals of $δ_\varepsilon$, directly computable for a given regularization. The bound-state convergence follows from the work of Brasche, Figari, and Teta; here, our contribution is an elementary proof with an explicit rate. Their norm resolvent convergence, however, does not by itself imply convergence of the scattering matrix, which was previously known for families obtained by scaling a single fixed profile; we prove it for a strictly larger class.

comments
13 pages, no figures
fields
Spectral Theory, Mathematical Physics
pdf ↗ page arXiv:2611.14843 ↗

For $d\ge2$, consider the region between two nested spheres of fixed radii, with the inner sphere translated a distance $\varepsilon$ from the outer center. We prove that the first positive eigenvalue of the Steklov problem, with the spectral boundary condition imposed on both spheres, decreases strictly with $\varepsilon$ throughout the noncontact interval. This settles the planar monotonicity conjecture formulated by Nigam and establishes its higher-dimensional counterparts. In dimension two we use a double-center holomorphic expansion and a pair of positive compact coefficient operators. For every $d\ge3$, solid Gegenbauer harmonics yield analogous axisymmetric and transverse operators, with a positive rank-one monopole correction. Weighted angular-mode comparison for $d\ge3$ and a direct matrix comparison for $d=2$ identify the first positive eigenvalue as the unique level-one crossing of an associated spectral radius. The first eigenspace has dimension $d$ in the concentric case and dimension one for every nonconcentric configuration. Convergence and reconstruction estimates justify the coefficient reductions at the two boundaries.

comments
40 pages
fields
Spectral Theory, Analysis of PDEs
pdf ↗ page arXiv:2611.15063 ↗

We establish an upper bound to the norm of the resolvent of a relativistic version of the non-self-adjoint operator obtained by a dilation analytic transformation of the quantum harmonic oscillator. The estimate implies a decay for large complex energies along rays with angles larger than that of the dilation. In this way we positively answer a question left open in [Proceedings of the Royal Society A 2025].

comments
4 pages
fields
Spectral Theory
pdf ↗ page arXiv:2611.15180 ↗

We prove the Pólya–Szegő buckling conjecture in dimensions $2\le n\le47$: among open sets of prescribed finite volume, a ball minimizes the first clamped buckling eigenvalue. More precisely, we establish the sharp comparison $Λ_1\left(Ω\right)\ge \left(j_{n/2,1}/j_{n/2-1,1}\right)^2 λ_1^{\mathrm D}\left(Ω\right)$, where $λ_1^{\mathrm D}$ is the first Dirichlet eigenvalue and $j_{ν,1}$ is the first positive zero of the Bessel function $J_ν$ of the first kind. The proof extends a radial calibration to all Hessian directions; positive coefficient expansions and logarithmically convex Laplace integrals control the resulting matrix. A Lipschitz construction handles sign changes and arbitrary boundaries. Equality in the volume bound holds precisely for balls modulo sets of zero $H^2$ capacity. We prove that this calibration fails in every dimension $n\ge48$.

fields
Spectral Theory
pdf ↗ page arXiv:2611.15243 ↗

We study a charged quantum particle confined to an annulus and subject to a strong uniform magnetic field. A Dirichlet condition is imposed on the inner boundary and a Robin condition on the outer boundary. We are interested in the number of bound states whose energy lies below the lowest Landau level, the threshold set by the magnetic field in the whole plane. In the semiclassical regime, we derive an asymptotic formula for this number. It shows how the count depends on the geometry of the annulus, through the length and curvature of the outer boundary, and on the strength of the Robin parameter. We treat both the repulsive and the attractive cases of the Robin condition and describe how the attractive case changes the boundary behavior that produces these low-lying states. The proof reduces the problem to an effective one-dimensional model near the outer boundary and relies on separation of variables in angular momentum.

fields
Spectral Theory, Mathematical Physics
pdf ↗ page arXiv:2611.15775 ↗

Let $\mathcal{P}$ be a bounded Kleinian circle packing with symmetry group $Γ$, and let $N_{\mathcal{P}}(T)$ denote the number of circles in $\mathcal{P}$ of radius at least $T^{-1}$. We obtain an asymptotic formula for $N_{\mathcal{P}}(T)$ in which the eigenvalues of the Laplace operator below the continuous spectrum contribute a finite sum of main terms, with an error term having the same exponent as in the counting theorem of Lax–Phillips for $Γ$-orbits in $\mathbb H^3$.

fields
Spectral Theory, Geometric Topology, Number Theory
pdf ↗ page arXiv:2611.16328 ↗

Algebraic Topology5

The path homology theory is based on the notion of path complex and is a part of GLMY-theory created and developed by Grigor'yan, Lin, Muranov, and Yau in a cycle of papers in 2012-2014. In this paper we define a path complex with concatenation ($PC$-complex) which is a particular case of a path complex. We define a natural topology on a set of vertices of any $PC$-complex, and describe properties of this topology and its relation to the discrete topology of Alexandroff. We prove the existence of functorial relations between some categories of $PC$-complexes and digraphs. These relations allow to transfer covering, homotopy and various versions of homology theory from digraph theory to $PC$-complexes.

comments
17 pages,no figures
fields
Algebraic Topology
pdf ↗ page arXiv:2611.15308 ↗

Given a locally finite open cover of a paracompact space, a subordinate partition of unity defines a map into the geometric realization of the nerve. When the cover is good, the nerve theorem asserts that this map is a homotopy equivalence. In applied topology, one specializes this construction to covers of metric data by open balls centered at finitely many landmarks. The corresponding nerve map represents the data inside the Čech complex, enabling one to pull cohomological or spectral invariants back to the data. Since point cloud data often comes equipped with weights encoding domain-specific importance, we introduce a weighted version of the nerve map and study its stability under perturbations of the landmarks and weights using metrics from optimal transport. Our main result is a Lipschitz stability theorem for the weighted nerve map under a uniform nondegeneracy assumption. We state the bound in terms of a scale-dependent optimal transport distance, and give an example where our estimate is attained. Since this distance is dominated by a multiple of the $1$-Wasserstein distance, Wasserstein stability follows as a corollary. We also give geometric conditions ensuring nondegeneracy, obtain explicit estimates of the Lipschitz constant for closed Riemannian manifolds, and sketch applications to Laplacian eigenvector cascading and Eilenberg–MacLane coordinates.

comments
29 pages
fields
Algebraic Topology, Metric Geometry
pdf ↗ page arXiv:2611.15938 ↗

Let $a$ denote the stabilization of the Euler class of the sign representation of $\mathrm{C}_2$. In this paper, we show that the Behrens-Shah periodic $u$-self-equivalence of $C(a^i)$ -- a direct consequence of J.F. Adams' calculation of James periodicity -- determines the $\mathrm{H}\underline{\mathbb{F}}_2$-Hurewicz image of the $\mathrm{C}_2$-equivariant sphere spectrum, recovering a recent theorem of Guo-Li-Lu-Wu-Xu-Yang-Zhang via a different method. Furthermore, we use the $\mathrm{C}_2$-equivariant periodic $u$-self-equivalences on the cofiber spectra $C(a^i)$ to construct new infinite families in the $\mathrm{C}_2$-equivariant stable stems whose $\mathrm{H}\underline{\mathbb{F}}_2$-Hurewicz image is trivial.

fields
Algebraic Topology
pdf ↗ page arXiv:2611.16462 ↗

We calculate the mod $2$-homology of the fixed points of the $C_4$-equivariant Hill–Hopkins–Ravenel theory $BP^{((C_4))}\langle 1\rangle$, as an $\mathcal{A}_*$-comodule algebra. $2$-locally these fixed points are $tmf_0(5)$ by a theorem of Quinn. We deduce that $tmf_0(5)$ is an indecomposable $tmf$-module that is an extension of two $tmf$-modules of the form $tmf\otimes K$ for a finite spectrum $K$. The $K(2)$-localization of $tmf_0(5)$ is $32$-periodic, and we compute the Adams spectral sequence of $tmf_0(5)$ through the $32$-stem.

comments
57 pages, comments welcome
fields
Algebraic Topology
pdf ↗ page arXiv:2611.16531 ↗

We give explicit and recursive formulas for the Poincaré polynomials of Dani–Mainkar nilmanifolds associated with path graphs. We also prove that these polynomials are unimodal, and we calculate a range of Betti numbers asymptotically. As an application, we derive a sharp lower bound for the dimension of the total de Rham cohomology of a Dani–Mainkar nilmanifold.

comments
25 pages with 7 tables
fields
Algebraic Topology, Commutative Algebra, Combinatorics, Representation Theory
pdf ↗ page arXiv:2611.17014 ↗

General Mathematics5

A $0$-$1$ polynomial is a polynomial whose coefficients are all either $0$ or $1$. The unfair $0$-$1$ polynomial conjecture states that if $f$ is a $0$-$1$ polynomial and $f(x)=g(x)h(x)$ is a factorisation into non-constant polynomials with non-negative real coefficients, then $g$ and $h$ must themselves be $0$-$1$ polynomials. We call $f$ fair if every such factorisation has this property, and unfair otherwise. In this paper, we study structural properties of possible unfair factorisations and obtain conditions which guarantee fairness. In particular, we prove that if $$ f(x)=x^{n-\operatorname{deg} w}w(x)+v(x), $$ where $v$ and $w$ are $0$-$1$ polynomials and $v$ is fair, then $f$ is fair whenever $$ n\geq\max\{\operatorname{deg} w+2\operatorname{deg} v,\,2\operatorname{deg} w\}. $$

fields
General Mathematics
pdf ↗ page arXiv:2611.14596 ↗

For integers $k\geq2$ and $λ_1,λ_2\in\{-1,+1\}$, let $S_k^{λ_1,λ_2}:=\{n\in\mathbb{N}\setminus\{0,1\}:\gcd(n^k+λ_1,n!+λ_2)>1\}$. This family arose from a MathOverflow problem concerning the existence of integers $n$ satisfying $\gcd(n^2+1,n!+1)>1$ and from the subsequent question of whether arbitrarily many, but finitely many, solutions can be obtained by varying the exponent and the signs. We concentrate on the case $λ_1=λ_2=-1$ and introduce the notion of a universal invariant for an odd prime $p$, namely an integer $n\geq2$ such that $\gcd(n^{p\cdot m}-1,n!-1)>1$ for every integer $m\geq1$. We prove that this condition is equivalent to $\gcd(n^p-1,n!-1)>1$, characterize the possible prime divisors in terms of roots of unity over finite fields, and recall an explicit construction due to Jonathan Love that yields a universal invariant for every odd prime $p\geq5$, with the cubic case treated separately. As an application, we prove that $|S_k^{-1,-1}|\geqω_{\mathrm{odd}}(k)$ for every integer $k\geq2$, where $ω_{\mathrm{odd}}(k)$ denotes the number of distinct odd prime divisors of $k$. Hence, the cardinalities of these sets are unbounded as $k$ varies. This lower bound is deliberately coarse and constructive, as it is obtained by considering only universal invariants; stronger general lower bounds are obtained by different constructions. We also discuss minimal universal invariants, their persistent common divisors, the special structure of the cubic case, and a heuristic due to Will Sawin suggesting that there may be infinitely many cubic universal invariants, although the known examples are exceptionally sparse. Whether $S_k^{-1,-1}$ is finite or infinite for any fixed exponent $k\geq3$ remains an open problem.

comments
17 pages
fields
General Mathematics
pdf ↗ page arXiv:2611.14600 ↗

We derive a novel three-parameter master identity for Forsyth-Glaisher-type series for $1/π$. By unifying disparate results from the literature into a single overarching framework, we demonstrate that Glaisher's original series and numerous known variations emerge naturally as special cases through systematic choices of the parameters. This master identity simplifies the derivation of existing formulas, provides a mechanism for generating an infinite number of new series for $1/π$, and is further utilized to derive associated series involving harmonic and odd harmonic numbers.

comments
10 pages, no figures or tables
fields
General Mathematics
pdf ↗ page arXiv:2611.14874 ↗

We study recurrences in which a previous sequence value determines the number of iterations of an inner map. Campbell's example has an explicit power-of-three formula and inner orbits of eventual period at most two. Its normalized lower and upper limits are $2/5$ and $3/4$. For a variable-depth Conway recurrence $C$, we prove the golden-ratio lower bound, its exact equality set, a Fibonacci upper cap, and the landing of the inner orbit at every Fibonacci index $F_k$ with $k\ge6$. These proofs are elementary and start from twenty-four initial values. The plateau of $C$ to the left of $F_k$ has width exactly $\lfloor(2k-9)/3\rfloor$, and $C(F_k+t)=F_{k-1}+t$ for $0\le t\le\lfloor(k-8)/6\rfloor$. A maximum principle turns a finite exact computation into the bound $\limsup C(n)/n<0.65446923$. We characterize the convergence of $C(n)/n$ to $α=(\sqrt5-1)/2$ in terms of negative selected orbit jumps and of a limiting convex profile, and we derive entropy and variance budgets for the recursive splits. Along inverse rays of the map $x\mapsto C(x)$, the relative errors are absolutely summable and the growth is asymptotically Fibonacci. For Grytczuk's fixed-depth recurrence, we give a Pascal-word proof of convergence with the sharp error order $n/\sqrt{\log n}$ along interval maxima. The full variable-depth limit remains open.

comments
35 pages, 1 figure
fields
General Mathematics
pdf ↗ page arXiv:2611.15815 ↗

In this paper, we present characterizations of Pettis integrability in $bcc(X)$ and $cwk(X)$ of a multifunction $Γ: Ω\to cc(X)$, where $(Ω, Σ, μ)$ is a complete finite measure space and $cc(X)$ $(bcc(X), cwk(X))$ is the family of all nonempty convex closed (bounded convex closed, convex weakly compact) subsets of a Hausdorff locally convex topological vector space $X$. Incidentally, a convergence theorem for scalarly integrable multifunctions is proved. As an application, we are going to prove full characterizations of Pettis integrability for fuzzy maps defined on $Ω$ and taking values in the generalized fuzzy number hyperspace $\mathcal{F}_{cwk}(X)$.

comments
15 pages
fields
General Mathematics
pdf ↗ page arXiv:2611.16969 ↗

Symplectic Geometry5

We consider a version of Legendrian contact homology filtered by the action of Reeb chords. In this version, a union of two disjoint exact Lagrangian cobordisms with Legendrian boundary conditions gives rise to a morphism between persistence modules. We discuss a certain algebraic invariant of such morphisms and use it to obtain obstructions to Lagrangian isotopies of the cobordisms, as well as applications to symplectic and contact dynamics.

comments
53 pages
fields
Symplectic Geometry, Algebraic Topology
pdf ↗ page arXiv:2611.14682 ↗

We compute the cylindrical contact homology chain complex associated with a monotone toric domain in $\mathbb{R}^4$. The chain complexes allow us to compute the cylindrical contact homology capacities associated with monotone toric domains with one or two inflection points. These capacities are conjecturally equal to the Gutt-Hutchings capacities defined using $S^1$-equivariant symplectic homology. Using our results, we find embedding obstructions between toric domains.

comments
49 pages, 23 figures
fields
Symplectic Geometry
pdf ↗ page arXiv:2611.14691 ↗

Let $L_0$ and $L_1$ be a pair of transversely intersecting closed Lagrangians in a closed symplectic manifold, equipped with a relative-spin structure with respect to a common background class. We construct a curved, filtered, $A_\infty$-bimodule structure over the integral Fukaya algebras of $L_0$ and $L_1$ as given in \cite{rabah2024fukaya}, \cite{rabah2025fukaya}; on the free module generated by the intersection points of $L_0$ and $L_1$, over the integral Novikov ring. When both Lagrangians are unobstructed, we define a Lagrangian Floer homology of the pair over the integral Novikov ring, extending the work of Fukaya-Oh-Ohta-Ono in \cite{fukaya2013lagrangian} to general closed symplectic manifolds. We use this framework to bound the number of intersection points between a Lagrangian and its transverse Hamiltonian image. Such bound incorporates the torsion subgroup in the integral homology of the Lagrangian. In return, it improves the characteristic-zero Betti number bound.

fields
Symplectic Geometry
pdf ↗ page arXiv:2611.16410 ↗

These are notes to supplement my talks at the Current Developments in Mathematics Conference in 2026. They are an expository account of recent work in the study of braid varieties and their relation to low-dimensional contact and symplectic topology. A driving theme is the development and use of Demazure weaves to construct cluster algebra structures on the coordinate rings of such braid varieties.

comments
106 pages, 46 figures
fields
Symplectic Geometry, Combinatorics, Geometric Topology, Representation Theory
pdf ↗ page arXiv:2611.17155 ↗

We introduce a geometric construction whose terminal configuration determines the kernel and cokernel of a morphism between positive Lagrangian branes in the derived Fukaya category of a Calabi-Yau manifold. Thus, if the construction always terminates, the full subcategory of positive Lagrangian branes is abelian, as conjectured by Joyce. We show that this abelian category admits Harder-Narasimhan filtrations with respect to the central charge defined by the holomorphic volume form. Under appropriate split-generation assumptions, we construct a Bridgeland stability condition whose stable objects are isomorphic to special Lagrangian branes, as predicted by the Thomas-Yau conjecture. The geometric construction is based on a one-parameter family of special Lagrangian submanifolds with boundary. One part of the boundary is contained in the Lagrangian underlying the domain of the morphism and the other in the Lagrangian underlying the codomain. Surgeries occur as the family encounters singularities or obstruction walls. We prove that the construction always terminates for the two-torus and provide higher dimensional examples.

comments
98 pages, 25 figures
fields
Symplectic Geometry, Algebraic Geometry
pdf ↗ page arXiv:2611.17282 ↗

Category Theory3

We give an explicit description of the left adjoint $F$ of the forgetful functor $U\colon\mathsf{GAlg}\to\mathsf{GHoops}$ from Gödel algebras to Gödel hoops. If $H$ is a Gödel hoop with a least element $m$, then $F(H)$ is the direct product of the Gödel algebra obtained by adjoining a new bottom element to $H$ and of $H$ itself, regarded as a Gödel algebra with bottom element $m$. For an arbitrary Gödel hoop $H$, we glue these products along the principal filters of $H$, and we describe the operations of $F(H)$, the action of $F$ on homomorphisms and the unit of the adjunction. As an application, we show that the unit of the adjunction $F\dashv U$ is not cartesian, and that the same holds for BL-algebras and basic hoops. Moreover, the semi-abelian categories of Gödel hoops and of basic hoops are not equivalent to the slice categories of Gödel algebras and of BL-algebras over their initial object. Thus, in contrast with the cases of Wajsberg hoops and of product hoops, the free-forgetful adjunctions between Gödel algebras and Gödel hoops, and between BL-algebras and basic hoops, do not give rise to ideally exact contexts.

fields
Category Theory, Logic, Rings and Algebras
pdf ↗ page arXiv:2611.16695 ↗

We develop a mathematical abstraction for uniformly exploiting symmetries in programming and reasoning based on the mathematical proof principle `without-loss-of-generality' (w.l.o.g.). Given: group actions that describe symmetries of the input and the output; and a canoniser, which captures how arbitrary inputs get sent to canonical ones, our construction extends any function from the canonical inputs to the whole domain. We characterise the conditions on the canonisers which guarantee that the construction gives the unique equivariant (i.e. symmetry-preserving) extension. Furthermore, we adapt the construction to a dependently-typed setting, where it captures traditional symmetric w.l.o.g. arguments via the Curry-Howard correspondence. Finally, we extend the construction to algebraic data types, where the symmetries of the constructors both uniquely determine the symmetries of the data type and pave the way for efficient execution.

fields
Category Theory, Group Theory, Logic
pdf ↗ page arXiv:2611.17106 ↗

We construct $n$-categories $\mathscr{P}_n$ with generators given by simplices and relations given by bistellar moves between them, in any dimension $n$. We show that functors out of $\mathscr{P}_n$ into an $n$-category of theories, give the correct input for the orbifold construction for TQFTs, and subsume all previously known examples, which are all in dimensions $n \leq 3$. In particular, in dimension 3 the construction gives a highly nontrivial categorification of a kind of nonunital, noncounital, Frobenius algebra.

comments
37 pages + appendices
fields
Category Theory, Mathematical Physics, Quantum Algebra
pdf ↗ page arXiv:2611.17244 ↗

K-Theory and Homology2

We apply a derived completion construction for commutative ring spectra to give a description of the K-theory spectrum of a geometric field F (i.e. containing an algebraically closed subfield $k$) of characteristic zero purely in terms of the representation theory of its absolute Galois group $G_F$. A result that follows is that the l-adically completed Milnor K-theory of F is isomorphic to the derived completion of the representation ring of $G_F$. The main result, from which this follows, is that $K(F)$ completed at l is equivalent to the derived completion of the K-theory of the category of finite dimensional representations of $G_F$ in $k$.

fields
K-Theory and Homology, Algebraic Topology
pdf ↗ page arXiv:2611.15605 ↗

We give a generic presentation of the pre-Bloch group of a local ring with residue field $\mathbb{F}_{2}$. We apply this to the calculation of pre-Bloch groups and Bloch groups of some local rings.

comments
57 pages
fields
K-Theory and Homology, Commutative Algebra
pdf ↗ page arXiv:2611.16635 ↗

General Topology1

We study self-maps $f$ of a complete $b$-metric space $(U,d)$ (constant $b\ge1$) satisfying the rational contractive condition \[ d(fu,fv)\le\frac{d(u,fv)+d(v,fu)+κ}{b\,[d(u,fu)+d(v,fv)]+1}\,d(u,v)\qquad(u,v\in U), \] with $κ\in[0,1)$. We first observe that the two-parameter family of conditions studied in our earlier work reduces, after a rescaling of the $b$-metric, to this one-parameter form. We then prove: (A) every Picard sequence converges to a fixed point, with an explicit a~priori estimate whose geometric ratio depends only on $b$, $κ$ and $d(u_0,fu_0)$, an a~posteriori estimate, and asymptotic rate at most $κ$; (B) a structure theorem: such maps are automatically continuous, every fixed point attracts the whole ball of radius $(1-κ)/2$, distinct fixed points are at distance at least $(1-κ)/2$ (sharp), basins of attraction are clopen, and the number of fixed points does not exceed the number of connected components of $U$; in particular the fixed point is unique on connected spaces; (C) Ulam–Hyers stability of the fixed-point problem. The class of such maps is not invariant under passing from a quasi-norm to the equivalent $p$-norm metric, so the quasi-Banach results are not formal consequences of the metric ones. A gluing principle shows that the multiplicity permitted by (B) occurs. As applications we obtain existence, exact multiplicity and error estimates for infinite nonlinear systems with relay-type forcing in $\ell^p$, $0<p<1$, and for nonlinear perturbations of Volterra-type equations $f=\pm a+T_gf+ψ(f(z_0))k$ in the Hardy space $H^p$, $0<p<1$, where $T_gf(z)=\int_0^z f(ζ)g'(ζ)\,dζ$ and $g\in\BMOA$.

fields
General Topology
pdf ↗ page arXiv:2611.16170 ↗

History and Overview1

How did mathematicians of the past relate to history? What can we learn from their experience? It is a truism to say that all people are embedded in history. It impacts on them in ways that they may or may not realise. At the two extremes, some may be completely oblivious; others may deliberately set out to change the historical narrative and the course of history. In this chapter, I explore these questions through two case studies. Both are of eminent British mathematicians/physicists in the late 1800s and their handling of an inverse square law of force. Both case studies show ways in which these men were blind to the history of their subject, conscious of it but limited by it, or deliberately trying to use it. First, I look at William Thomson's and James Clerk Maxwell's attempts to establish the inverse square law of electrostatics in the 1850s to 1870s. I ask the question, why did Maxwell devote the last years of his life to editing the 100-year-old electrical researches of Henry Cavendish and repeating Cavendish's experimental verification of the inverse square law of electrostatic repulsion? Second, I discuss John Henry Poynting and Newton's law of gravitation in the 1880s and 1890s, asking why Poynting preferred to describe his experiments as measurements of the mean density of the Earth rather than of the gravitational constant.

comments
22 pages, 4 figures
fields
History and Overview
pdf ↗ page arXiv:2611.16700 ↗

Revised papers497

Motivated by the telescoping proofs of two identities of Andrews and Warnaar, we find that infinite q-shifted factorials can be incorporated into the implementation of the q-Zeilberger algorithm in the approach of Chen, Hou and Mu to prove nonterminating basic hypergeometric series identities. This observation enables us to extend the q-WZ method to identities on infinite series. As examples, we will give the q-WZ pairs for some classical identities such as the q-Gauss sum, the $_6φ_5$ sum, Ramanujan's $_1ψ_1$ sum and Bailey's $_6ψ_6$ sum.

comments
Revised version, 25 pages, with an addendum
fields
Combinatorics
pdf ↗ page arXiv:0806.2491 ↗

This is a story about the question of whether folding a square flat can increase its perimeter. It is written primarily for school students.

comments
8 pages, 8 figure, 4 attachments, Russian
journal
Zadachi Sankt-peterburgskoj matematicheskoj olimpiady shkol'nikov po matematike 2008, ISBN 978-5-7940-0139-6
fields
History and Overview, Metric Geometry
pdf ↗ page arXiv:1004.0545 ↗

We use quilted Floer theory to construct functor-valued invariants of tangles arising from moduli spaces of flat bundles on punctured surfaces. As an application, we show the non-triviality of certain elements in the symplectic mapping class groups of moduli spaces of flat bundles on punctured spheres.

comments
Added a lot of detail. The results are basically the same; there was one serious error in the description of the relative spin structures in the section on the field theory for graphs used to obtain a theory with integer coefficients which was fixed, by working with a different collection of relative spin structures
fields
Symplectic Geometry
pdf ↗ page arXiv:1503.07615 ↗

In this paper, we study rationality properties of reductive group actions over fields k of characteristic zero. In doing so, we unify Luna's theory of spherical systems with the Borel-Tits theory of reductive groups. Specifically, for any reductive group action, we define a generalized Tits index; its main constituents are a root system and a generalization of the anisotropic kernel. For k-spherical varieties (i.e., those for which a minimal parabolic subgroup has an open orbit), we obtain explicit smooth completions of the set of rational points. Over local fields, this yields genuine compactifications that generalize the maximal Satake compactification of symmetric spaces. Our main tool is a k-version of the Local Structure Theorem.

comments
v1: 62 pages; v2: 66 pages, some material added (especially 13.5-13.8), minor corrections; v3: 69 pages, section 12 on boundary degenerations rewritten, mistake in Prop. 13.1 fixed, Ex. 13.9 and Prop. 14.7 added; v4: 71 pages, extensively revised according to the recommendations of an anonymous referee
fields
Representation Theory, Algebraic Geometry
pdf ↗ page arXiv:1604.01005 ↗

We analyze an iterated, modified Lavrentiev regularization method (Mitlar) for deconvolving the Helmholtz-type differential filter $G=(I-δ^2Δ)^{-1}$ used in large eddy simulation. The method replaces the Lavrentiev operator $G+αI$ by the convex combination $(1-α)G+αI$; each step costs one Helmholtz solve, exactly as in iterated Lavrentiev regularization. We show that this one-line change has a precise structural meaning: the regularized operator is again a Helmholtz filter, now with the smaller radius $\sqrtα\,δ$, and $J$ refinement steps coincide with van Cittert approximate deconvolution of order $J$ applied to that filter. Consequently the regularization error is governed by the product $αδ^2$ rather than by $α$ alone. We prove sharp error bounds of order $(αδ^2)^{s}$ on a Hilbert scale, $0\le s\le J+1$, with saturation exactly at $s=J+1$; show that for noise-free data the Mitlar error never exceeds the iterated Lavrentiev error, for every datum, every $α$ and every $J$; give a priori parameter choices for noisy data with explicit $δ$-dependence; and prove finite element error bounds whose constants grow only linearly in $J$. Finally we show that the iterates decrease a natural energy functional for every $α>0$, and derive a computable stopping rule that guarantees monotone decrease of a weighted error and always terminates. Numerical examples illustrate the theory and compare Mitlar with a family of Tikhonov–Lavrentiev methods.

fields
Numerical Analysis
pdf ↗ page arXiv:1801.08913 ↗

We discuss how the fractional Dehn twist coefficient behaves under a fully ramified branched covering of an open book, and give applications to both topological and contact 3-manifolds. Among them, we show that non-right-veering closed braids represent virtually loose transverse links.

comments
26 pages, 1 figure. Part of the paper was originally contained in the early (but not the latest) version of "Quasi-right-veering braids and non-loose links". Version 2. we have added more details, fixed errors concerning exitence of branched covers, and added a characterization of right-veering in terms of FDTCs for reducible case
fields
Geometric Topology
pdf ↗ page arXiv:1807.04398 ↗

The usual passivity theorem considers a closed-loop, the direct chain of which consists of a strictly passive stable operator $H_{1}$, and the feedback chain of which consists of a passive operator $H_{2}$. Then the closed-loop is stable. Let $ρ>1$. We show here that the closed-loop is still stable when the direct chain consists of a strictly $ρ^{-1}$-passive $% ρ^{-1}$-stable operator (a weaker condition than above) and the feedback chain consists of a $ρ$-passive operator (a stronger condition than above). Variations on the theme of the small gain theorem (incremental or not) can be made similarly. This approach explains the results obtained in a paper on identification which was recently published.

comments
Error in the proof
fields
Optimization and Control
pdf ↗ page arXiv:1902.03015 ↗

Let $X_1$ and $X_2$ be derived equivalent smooth projective varieties over the field of complex numbers. We prove that the numbers $h^{0,p}(X_1)$ and $h^{0,p}(X_2)$ are equal for any $p$.

comments
A wrong fact on Hochschild homology was used in the proof of the main Theorem
fields
Algebraic Geometry, Category Theory
pdf ↗ page arXiv:1907.08721 ↗

We compute projective dimension of translated simple modules in the regular block of the BGG category $\mathcal{O}$ in terms of Kazhdan-Lusztig combinatorics. This allows us to determine which projectives can appear at the last step of a minimal projective resolution for a translated simple module, confirming a conjecture by Johan Kåhrström. We also derive some inequalities, in terms of Lusztig's $\mathbf{a}$-function, for possible degrees in which the top (or socle) of a translated simple module can live. Finally, we relate Kostant's problem with decomposability and isomorphism of translated simple modules, addressing yet another conjecture by Johan Kåhrström.

comments
The proof of Proposition 8.15 contains a gap, for corrigendum and addendum, see arXiv:2611.12892
journal
International Mathematics Research Notices, Vol. 2023, No. 4, pp. 3329-3373
fields
Representation Theory
pdf ↗ page arXiv:2007.00342 ↗

We give a complete classification of all $d$-representation-finite symmetric Nakayama algebras and of all $d$-representation-finite trivial extensions of path algebras of quivers, over an arbitrary field. As a consequence we get a classification, up to Morita equivalence, of all $d$-representation-finite symmetric algebras of finite representation type over an algebraically closed field.

comments
12 pages
journal
J. Algebra 714 (2027), 239-255
fields
Representation Theory, Rings and Algebras
pdf ↗ page arXiv:2103.15380 ↗

We establish universal eigenvalue inequalities for a drifted Cheng–Yau operator on bounded domains in pinched Cartan–Hadamard manifolds with Dirichlet boundary conditions. Our approach combines a universal quadratic eigenvalue inequality for operators in divergence form with a Rauch-type comparison theorem and a Bochner-type formula. We evaluate the geometric terms in this quadratic inequality under suitable assumptions on the radial behavior of the coefficient tensor and the drifting function, together with curvature pinching conditions. In the general setting, we establish a Rauch-type comparison theorem for the Cheng–Yau operator and derive two auxiliary estimates from its Bochner-type formula. We then prove integral estimates of independent interest and apply them to obtain the desired eigenvalue inequalities for both the Cheng–Yau operator and the drifted Laplacian, recovering known inequalities for the Laplacian. We also establish a rigidity result for the Cheng–Yau operator on a class of bounded annular domains in pinched Cartan–Hadamard manifolds. In Euclidean space, this result can be applied, for instance, with the potential function of the Gaussian shrinking soliton. The hyperbolic space is treated separately in two settings, one exploiting the conformal relation between its metric and the Euclidean metric, and the other via its warped product structure, reducing the problem to one dimension. We extend the hyperbolic construction of the fundamental gap for the Laplacian to a class of operators in divergence form. Examples are provided to illustrate the scope and applicability of our results.

comments
This is the final version, published in Annali di Matematica Pura ed Applicata
fields
Differential Geometry, Spectral Theory
pdf ↗ page arXiv:2107.09135 ↗

Assume that $K_{j\times n}$ be a complete, multipartite graph consisting of $j$ partite sets and $n$ vertices in each partite set. For given graphs $G_1, G_2,\ldots, G_n$, the multipartite Ramsey number (M-R-number) $m_j(G_1, G_2, \ldots,G_n)$ is the smallest integer $t$ such that for any $n$-edge-coloring $(G^1,G^2,\ldots, G^n)$ of the edges of $K_{j\times t}$, $G^i$ contains a monochromatic copy of $G_i$ for at least on $i$. C. J. Jayawardene, E. T. Baskoro et al. $(2016)$ gave the size of M-R-numbe $m_j(nK_2, C_7)$ for $j \geq 2 $ and $n\leq 6$. Y. Rowshan et al. $(2021)$ gave the size of M-R-number $m_j(nK_2, C_7)$ for $j = 2,3, 4$ and $n\geq 2$. Y. Rowshan $(2021)$ gave the size of M-R-number $m_j(nK_2,C_7)$, for each $j\geq 5$ and $n\geq 2$. In this article we compute the size of M-R-number $m_j(C_3,C_3, nK_2)$ for each $j\geq 7$, $n\geq 1$, $m_j(C_3,C_3, n_1K_2,n_2K_,\ldots,n_iK_2)$ for each $2\leq j\leq 6$, $i\geq 2, n_i\geq 1$, and M-R-number $m_j(C_3,C_4, nK_2)$, for each $n\geq 1$, and small $j$.

comments
This preprint is withdrawn after a colleague, Mostafa Gholami, identified errors in the stated formula for m_j(C_3,C_3,nK_2) and gaps in its proof. For example, the formula gives m_11(C_3,C_3,3K_2) = 0, whereas the correct value is 1. The main result is therefore incorrect as stated.
fields
Combinatorics
pdf ↗ page arXiv:2109.12210 ↗

We consider the growth of the norms of transfer matrices of ergodic discrete Schrödinger operators in one dimension. It is known that the set of energies at which the rate of exponential growth is slower than prescribed by the Lyapunov exponent is residual in the part of the spectrum at which the Lyapunov exponent is positive. On the other hand, this exceptional set is of vanishing Hausdorff measure with respect to any gauge function $ρ(t)$ such that $ρ(t)/t$ is integrable at zero. Here we show that this condition on $ρ(t)$ can not in general be improved: for operators with independent, identically distributed potentials of sufficiently regular distribution, the set of energies at which the rate of exponential growth is arbitrarily slow has infinite Hausdorff measure with respect to any gauge function $ρ(t)$ such that $ρ(t)/t$ is non-increasing and not integrable at zero. The main technical ingredient, possibly of independent interest, is a Jarník-type theorem describing the Hausdorff measure of the set of real numbers well approximated by the eigenvalues of the Schrödinger operator. The proof of this result relies on the theory of Anderson localisation and on the mass transference principle of Beresnevich–Velani.

comments
Mistake in previous version has been fixed, along with minor lapses. 14 pp
fields
Spectral Theory, Mathematical Physics, Classical Analysis and ODEs, Probability
pdf ↗ page arXiv:2112.14662 ↗

This paper studies the impact of bootstrap procedure on the eigenvalue distributions of the sample covariance matrix under a high-dimensional factor structure. We provide asymptotic distributions for the top eigenvalues of bootstrapped sample covariance matrix under mild conditions. After bootstrap, the spiked eigenvalues which are driven by common factors will converge weakly to Gaussian limits after proper scaling and centralization. However, the largest non-spiked eigenvalue is mainly determined by the order statistics of the bootstrap resampling weights, and follows extreme value distribution. Based on the disparate behavior of the spiked and non-spiked eigenvalues, we propose innovative methods to test the number of common factors. Indicated by extensive numerical and empirical studies, the proposed methods perform reliably and convincingly under the existence of both weak factors and cross-sectionally correlated errors. Our technical details contribute to random matrix theory on spiked covariance model with convexly decaying density and unbounded support, or with general elliptical distributions.

comments
106 pages, 9 figures, 6 tables
fields
Statistics Theory, Probability
pdf ↗ page arXiv:2202.06188 ↗

We study the continuity properties of a generalized Davenport Fourier expansion we recently discovered, by imposing conditions on the coefficients. We also put our expansion into perspective from the position of Appell sequences.

comments
Improved theorems and other corrections made
fields
Number Theory
pdf ↗ page arXiv:2204.00854 ↗

In this paper, we discuss unpolarized, complex variation of Hodge structures for non-Kähler manifolds. In particular, consider a holomorphic family of compact complex manifolds with central fiber $X$. Suppose that the inclusion of complexes $(F^pA^\bullet(X),d)\hookrightarrow (A^\bullet(X),d)$ induces injective maps \[ H^j(F^pA^\bullet(X),d)\longrightarrow H^j(A^\bullet(X),d),\qquad j=k,\ k+1. \] Under this condition, we show that the period map is holomorphic and transversal. An essential ingredient for the proof is a deformation theory of filtered $(p,q)$-forms. We prove a jumping formula for filtered de Rham cohomology and obtain a necessary and sufficient condition for its dimension to be invariant under deformation of complex structures.

comments
19 pages;
fields
Differential Geometry
pdf ↗ page arXiv:2205.09274 ↗

Matlis proved a lot of homological properties of the fraction field of an integral domain. In this paper, we simplify and extend some of them from 1-dimensional (resp. rank one) cases to the higher dimensional (resp. finite rank) cases. For example, we study the weakly cotorsion property of $\Ext(-,\sim)$, and use it to present splitting criteria. These are equipped with several applications. For instance, we compute the projective dimension of $\widehat{R}$ and present some non-noetherian versions of Grothendieck's localization problem. We construct a new class of co-Hopfian modules and extend Matlis' decomposability problem to higher ranks. In particular, this paper deals with the basic properties of Matlis' quadratic $(Q,Q/R, \widehat{R},\overset{\sim}R).$

fields
Commutative Algebra
pdf ↗ page arXiv:2212.10332 ↗

We study the number of rational limit cycles of the Abel equation $x'=A(t)x^3+B(t)x^2$, where $A(t)$ and $B(t)$ are real trigonometric polynomials. We show that this number is at most the degree of $A(t)$ plus one.

comments
12 pages. Published in Electronic Journal of Qualitative Theory of Differential Equations
journal
Electron. J. Qual. Theory Differ. Equ. 2023, No. 47, 1-13
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2302.10743 ↗

Given a matrix $M\in \mathbb{R}^{m\times n}$, the low rank matrix completion problem asks us to find a rank-$k$ approximation of $M$ as $UV^\top$ for $U\in \mathbb{R}^{m\times k}$ and $V\in \mathbb{R}^{n\times k}$ by only observing a few entries specified by a set of entries $Ω\subseteq [m]\times [n]$. In particular, we examine an approach that is widely used in practice -- the alternating minimization framework. Jain, Netrapalli, and Sanghavi [JNS13] showed that if $M$ has incoherent rows and columns, then alternating minimization provably recovers the matrix $M$ by observing a nearly linear in $n$ number of entries. While the sample complexity has been subsequently improved [GLZ17], alternating minimization steps are required to be computed exactly. This hinders the development of more efficient algorithms and fails to depict the practical implementation of alternating minimization, where the updates are usually performed approximately in favor of efficiency. In this paper, we take a major step towards a more efficient and error-robust alternating minimization framework. To this end, we develop an analytical framework for alternating minimization that can tolerate a moderate amount of errors caused by approximate updates. Moreover, our algorithm runs in time $\widetilde O(|Ω| k)$, which is nearly linear in the time to verify the solution while preserving the sample complexity. This improves upon all prior known alternating minimization approaches which require $\widetilde O(|Ω| k^2)$ time.

comments
ICLR 2024. This version corrects the algorithm and several proofs (sampling across rounds, initialization, the regression solver). The main theorem is unchanged
fields
Optimization and Control
pdf ↗ page arXiv:2302.11068 ↗

A criterion is obtained for the semi-stability of the isolated singular positive closed solutions, i.e., singular positive limit cycles, of the Abel equation $x'=A(t)x^3+B(t)x^2$, where $A,B$ are smooth functions with two zeros in the interval $[0,T]$ and where these singular positive limit cycles satisfy certain conditions, which allows an upper bound on the number of limit cycles of the Abel equation to be obtained. The criterion is illustrated by obtaining an upper bound of two positive limit cycles for the family $A(t)=t(t-t_A)$, $B(t)=(t-t_B)(t-1)$, $t\in[0,1]$. In the linear trigonometric case, i.e., when $A(t)=a_0+a_1\sin t +a_2\cos t$, $B(t)=b_0+b_1\sin t+b_2\cos t$, an upper bound of two limit cycles is also obtained for $a_0,b_0$ sufficiently small and in the region where two positive limit cycles bifurcate from the origin.

comments
25 pages. Accepted manuscript of the article published in Journal of Differential Equations
journal
Journal of Differential Equations 379 (2024), 1-25
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2302.13642 ↗

We present a construction of the measure of the fractional $Φ^4$ Euclidean quantum field theory on $\mathbb{R}^3$ in the full subcritical regime via parabolic stochastic quantisation. Our approach is based on a truncated flow equation for the effective description of the model at sufficiently small scales and on coercive estimates for the nonlinear stochastic partial differential equation describing the interacting field. The constructed measure is translation invariant, reflection positive, and has quartic exponential tails.

comments
136 pages, published version
journal
J. Eur. Math. Soc. (2026)
fields
Probability, Mathematical Physics, Analysis of PDEs
pdf ↗ page arXiv:2303.18112 ↗

Let k be a non-archimedean local field and let G be a commutative algebraic k-group that contains no nontrivial unipotent subgroups if car k=0. Given any presentation of G as an extension of commutative algebraic k-groups E: 0 --> L --> G --> A --> 0, where L is affine and A is an abelian variety, we establish Pontryagin duality theorems that relate the fppf cohomology groups of G (equipped with the extension structure E) to the hypercohomology groups of the dual of G in the truncated derived category D^{[-1,0]}(k_{fppf}). These results have applications (to be discussed elsewhere) to certain generalizations of Lichtenbaum-van Hamel duality to a class of non-smooth proper k-varieties.

comments
Major changes, including the identification of a long-standing gap in the literature. Now 55 pages
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2305.08699 ↗

We study the fluctuations in equilibrium for a dynamics of rods with random length. This includes the classical hard rod elastic collisions, when rod lengths are constant and equal to a positive value. We prove that in the diffusive space-time scaling, an initial fluctuation of density of particles of velocity $v$, after recentering on its Euler evolution, evolve randomly shifted by a Brownian motion of variance $\mathcal D(v)$.

comments
In the published version the linearized Euler equation was missing a term. This has been corrected in section 2. The main result, contained in Section 3, is not affected. AN erratum will appear in AAP
journal
Annals Applied Probability (2025)
fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2305.13037 ↗

Weighted low rank approximation is a fundamental problem in numerical linear algebra, and it has many applications in machine learning. Given a matrix $M \in \mathbb{R}^{n \times n}$, a non-negative weight matrix $W \in \mathbb{R}_{\geq 0}^{n \times n}$, a parameter $k$, the goal is to output two matrices $X,Y\in \mathbb{R}^{n \times k}$ such that $\| W \circ (M - X Y^\top) \|_F$ is minimized, where $\circ$ denotes the Hadamard product. It naturally generalizes the well-studied low rank matrix completion problem. Such a problem is known to be NP-hard and even hard to approximate assuming the Exponential Time Hypothesis [GG11, RSW16]. Meanwhile, alternating minimization is a good heuristic solution for weighted low rank approximation. In particular, [LLR16] shows that, under mild assumptions, alternating minimization does provide provable guarantees. In this work, we develop an efficient and robust framework for alternating minimization that allows the alternating updates to be computed approximately. For weighted low rank approximation, this improves the cost of each iteration of [LLR16] from $\|W\|_0k^2$ to $\|W\|_0 k$ where $\|W\|_0$ denotes the number of nonzero entries of the weight matrix. At the heart of our framework is a high-accuracy multiple response regression solver together with a robust analysis of alternating minimization. We also replace the random initialization of [LLR16], whose claimed guarantee fails, by subspace iteration from a Gaussian start, so our total running time of $\widetilde O((\|W\|_0 k+nk^3)\log(1/ε))$ includes the initialization. In exchange, our guarantee needs the weight matrix to be within spectral distance $γn$ of the all-ones matrix for a $γ$ that is polynomially small in $n$.

comments
ICLR 2025. This version replaces the random initialization, whose claimed guarantee fails, by subspace iteration, and states the main theorem with all the conditions it needs, including a stronger closeness condition on the weights. The running time bound is unchanged
fields
Optimization and Control
pdf ↗ page arXiv:2306.04169 ↗

Federated Learning (FL) is a distributed learning paradigm that enables multiple clients to collaborate on building a machine learning model without sharing their private data. Although FL is considered privacy-preserved by design, recent data reconstruction attacks demonstrate that an attacker can recover clients' training data based on the parameters shared in FL. However, most existing methods fail to attack the most widely used horizontal Federated Averaging (FedAvg) scenario, where clients share model parameters after multiple local training steps. To tackle this issue, we propose an interpolation-based approximation method, which makes attacking FedAvg scenarios feasible by generating the intermediate model updates of the clients' local training processes. Then, we design a layer-wise weighted loss function to improve the data quality of reconstruction. We assign different weights to model updates in different layers concerning the neural network structure, with the weights tuned by Bayesian optimization. Finally, experimental results validate the superiority of our proposed approximate and weighted attack (AWA) method over the other state-of-the-art methods, as demonstrated by the substantial improvement in different evaluation metrics for image data reconstructions. The source code is available at https://github.com/DCN-FAU-AvH/FL-AWA-attack.

comments
Funded by the European Union (HORIZON-MSCA-2021-DN-01-01 project ModConFlex, grant number 101073558). Code available at https://github.com/DCN-FAU-AvH/FL-AWA-attack. Code DOI: https://doi.org/10.5281/zenodo.21381126
journal
IEEE Transactions on Big Data, vol. 12, no. 5, pp. 1606-1617, 2026
fields
Optimization and Control
pdf ↗ page arXiv:2308.06822 ↗

In this paper, we discuss the quantum data processing inequality and its refinements that are physically meaningful in the context of approximate recoverability. An important conjecture regarding this due to Seshadreesan et. al. in J. Phys. A: Math. Theor. 48 (2015) is disproved. We prove some inequalities capturing universal approximate recoverability with the Petz recovery map for the sandwiched quasi and Rényi relative entropies for the parameter $t=2$. We also obtain convexity theorems on some parametrized versions of the relative entropy and fidelity, which can be of independent interest.

comments
29 pages, 0 figures Expanded the discussion on the counterexample in page 12. Proved a result demonstrating a class of 2 x 2 qubits satisfying the Seshadreesan-Berta-Wilde conjecture and introduced some further open questions. This is the final published version of the article
journal
Rev. Math. Phys. 2650012 (2026)
fields
Mathematical Physics
pdf ↗ page arXiv:2309.02074 ↗

We construct upper seminormal crystals on the $μ$-supported tropical points of skew-symmetric cluster algebras from their exchange matrices. A generic potential provides an additive categorification in which boundary representations determine the Cartan matrices and generic ranks describe the crystal operators. Under frozen-Jacobi-finiteness and reachability, the raising operators lift to locally nilpotent derivations of the upper cluster algebra. For $τ$-exact boundary pairs, these derivations give integrable actions of derived Kac–Moody algebras in characteristic zero. In particular, the associated Cartan matrices are positive semidefinite. When the generic characters form a basis, this basis is BK-biperfect and the $τ$-exact crystals are normal. We also construct algebraic Tits actions and describe compatibly pointed biperfect bases through a coefficient graph. The theory is illustrated by classical and new examples.

comments
77 pages, comments are welcome; v2. minor corrections, 10.3 deleted; v3. minor corrections, more details are given; v4. all conjectures are settled; Section 6.2 and 8.5 are new
fields
Representation Theory, Combinatorics, Rings and Algebras
pdf ↗ page arXiv:2309.08326 ↗

This is a kind of survey on properties of correlations of two very general arithmetic functions, from the point of view of {\it Ramanujan expansions}. In fact, our previous papers on these links had, as a focus, the "{\it Ramanujan coefficients}" of these correlations and the resulting "{\it R.e.e.f.}", i.e., {\it Ramanujan exact explicit formula}. This holds under a variety of sufficient conditions, mainly under two conditions of convergence involving correlation's {\it \lq \lq Eratosthenes Transform\rq \rq}, namely what we call {\it Delange Hypothesis} (DH) and {\it Wintner Assumption} (WA) (the former implying the latter). We proved, on Hardy-Ramanujan Journal, the {\it Hardy-Littlewood Conjecture} on {\it $2k-$twin primes}, in particular, from (DH) (implying convergence of the Ramanujan expansion, whence {\it R.e.e.f.}); then, we gave a more general proof, from (WA), again {\it entailing the R.e.e.f.}, but from another method of summation for {\it Ramanujan expansions}, that we detailed in arXiv, "On Ramanujan smooth expansions for a general arithmetic function". There we also started to introduce local Ramanujan coefficients. Which we deepen here, entailing a new conditional proof of quoted H-L Conjecture.

comments
Our Corollary 3.3, under Assumption (A), proves H-L Conjecture on a=2k-twin primes when a=2k is square-free
fields
Number Theory
pdf ↗ page arXiv:2309.17101 ↗

The original Hotelling-Solomons inequality states that an upper bound of the absolute difference between the mean and median, standardized by the standard deviation, is 1. However, in this paper, we introduce a new bound that depends on the sample size, which is strictly smaller than 1.

comments
references added, typo corrected
journal
Stat 2024, Vol 13, e710
fields
Statistics Theory
pdf ↗ page arXiv:2310.10303 ↗

We consider the time-harmonic scattering of electromagnetic waves by a bounded stationary inclusion whose effective constitutive law is of Minkowski type. The constant vector $V$ is regarded as a constitutive moving parameter. Such a law arises as an effective description of synthetic moving media and of suitable traveling-wave space–time modulations. Starting from the implicit Minkowski relations, we derive a Maxwell transmission system and its Lippmann–Schwinger volume-integral formulation. The dimensionless parameter $β=|V|/c_Ω$ governs the pointwise constitutive inversion, namely the matrix is invertible precisely for $β\neq1$, while on the subcritical branch $0\leqβ<1$ its inverse admits an explicit convergent expansion. Using the algebraic structure of the cross-product operator, we obtain a spectral characterization of solvability and a quantitative sufficient condition separating the static material contrast from the $V$-dependent contribution which allows to justify the convergence of the corresponding Born series. As an application, we prove that full-aperture electric far-field data at a fixed frequency uniquely determine the support of the inclusion within this perturbative regime without assuming that $V$ is known.

comments
32 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2311.00584 ↗

We show how algebraic constraints on weighted graphs yield exact localization and controlled transport in quantum and stochastic systems. Antisymmetrizing a noncommutative, nonassociative product of vertex functions defines a Lie bracket. For a specified Lie cobracket over commutative rings without nonzero $2$-torsion, compatibility holds if and only if products of distinct incident edge weights vanish. When the coefficient ring is a finite product of integral domains, the edges with nonzero weights in each component of the ring form a matching. These matchings are determined by the edge weights and need not coincide across the components. These matchings yield exact two-vertex caging in fixed quantum channels; separately specified channel-selective controls enable coherent routing and path–internal-state entanglement. For matching-supported stochastic jump rates, they enforce first-passage exclusion, while prescribed internal-state switching opens inaccessible paths and yields a singular weak-switching escape limit. The bracket–cobracket factorization identifies a common edge operator underlying quantum kinetic Hamiltonians and Markov generators, subject to distinct sign and positivity conditions. The algebra fixes the channel structure; controlled motion requires additional dynamical operations.

comments
29 pages
fields
Mathematical Physics, Combinatorics, Rings and Algebras
pdf ↗ page arXiv:2311.11978 ↗

Non-associative structures arise naturally in several areas of fundamental physics, including the quantum mechanics of charged particles in magnetic monopole backgrounds, or non-geometric flux compactifications in string theory. A key observation motivating the present work is that the non-commutativity of spatial coordinates can be recast as the non-associativity of observables within a Jordan algebraic framework. This paper provides a comprehensive review of the Jordan algebraic, non-associative formulation of quantum mechanics and demonstrates this passage from non-commutativity to non-associativity concretely through the non-commutative Landau problem coupled to a harmonic potential. We begin with a self-contained account of the operator algebra background, covering $C^*$-algebras, von Neumann algebras, and Jordan–Banach ($JB$) and Jordan–von Neumann ($JBW$) algebras, and present the axiomatic formulation of quantum mechanics in terms of the Jordan algebra of observables. We then develop an alternative Hilbert space construction based on 3-cyclic traces, extending the work of Schupp and Szabo to infinite dimensional Jordan algebras. A central result of this work is that the non-commutative parameter $θ$ can be expressed entirely in terms of an associator in the Jordan algebraic setting. Pure product states and density matrices arising from this construction are characterized within the JBW-algebra framework. A key advantage of our approach is the \emph{explicit} construction of split operators for the non-commutative Landau Hamiltonian, turning an abstract existence result into a concrete decomposition. This leads to the Jordan–Schrödinger time-evolution equation for state vectors, whose exact closed-form solution is presented.

fields
Mathematical Physics
pdf ↗ page arXiv:2312.12047 ↗

Federated learning (FL) is a promising framework for learning from distributed data while maintaining privacy. The development of efficient FL algorithms encounters various challenges, including heterogeneous data and systems, limited communication capacities, and constrained local computational resources. Recently developed FedADMM methods show great resilience to both data and system heterogeneity. However, they still suffer from performance deterioration if the hyperparameters are not carefully tuned. To address this issue, we propose an inexact and self-adaptive FedADMM algorithm, termed FedADMM-InSa. First, we design an inexactness criterion for the clients' local updates to eliminate the need for empirically setting the local training accuracy. This inexactness criterion can be assessed by each client independently based on its unique condition, thereby reducing the local computational cost and mitigating the undesirable straggle effect. The convergence of the resulting inexact ADMM is proved under the assumption of strongly convex loss functions. Additionally, we present a self-adaptive scheme that dynamically adjusts each client's penalty parameter, enhancing algorithm robustness by mitigating the need for empirical penalty parameter choices for each client. Extensive numerical experiments on both synthetic and real-world datasets are conducted. As validated by some numerical tests, our proposed algorithm can reduce the clients' local computational load significantly and also accelerate the learning process compared to the vanilla FedADMM. The source code is available at https://github.com/DCN-FAU-AvH/FedADMM-InSa.

comments
Funded by the European Union (HORIZON-MSCA-2021-DN-01-01 project ModConFlex, grant number 101073558). Code available at https://github.com/DCN-FAU-AvH/FedADMM-InSa. Code DOI: https://doi.org/10.5281/zenodo.21381070
journal
Neural Networks, vol. 181, 106772, 2025
fields
Optimization and Control
pdf ↗ page arXiv:2402.13989 ↗

We consider assortment and inventory planning problems with dynamic stockout-based substitution effects, and without replenishment, in two different settings: (1) Customers can see all available products when they arrive, a typical scenario in physical stores. (2) The seller can choose to offer a subset of available products to each customer, which is more common on online platforms. Both settings are known to be computationally challenging, and the current approximation algorithms for the two settings are quite different. We develop a unified algorithm framework under the MNL choice model for both settings. Our algorithms improve on the state-of-the-art algorithms in terms of approximation guarantee and runtime, and the ability to manage uncertainty in the total number of customers and handle more complex constraints. In the process, we establish various novel properties of dynamic assortment planning (for the MNL choice model) that may be useful more broadly.

fields
Optimization and Control
pdf ↗ page arXiv:2404.03604 ↗

Let $F/{\mathbb Q}_p$ be a finite unramified extension, let $k$ be a finite extension of the residue field of $F$. We provide explicit constructions of integral structures for all rank two étale Lubin-Tate $(\varphi,{\mathcal O}_F^{\times})$-modules over $k$. We construct algebraic families of such integral structures and show that these comprehensively reflect the degeneration behaviour of $(\varphi,{\mathcal O}_F^{\times})$-modules. These results reveal new combinatorial structures of the moduli stack of $(\varphi,{\mathcal O}_F^{\times})$-modules, and allow us, in particular, to rederive the fact that the Serre weights assigned to a two dimensional ${\rm Gal}(\overline{F}/F)$-representation over $k$ can be read off from the geometry of the stack.

comments
86 pages; significantly improved exposition; minor corrections; accepted for publication in Documenta Mathematica
fields
Number Theory
pdf ↗ page arXiv:2405.17133 ↗

We propose a two-step procedure to model and predict high-dimensional functional time series, where the number of function-valued time series $p$ is large in relation to the length of time series $n$. Our first step performs an eigenanalysis of a positive definite matrix, which leads to a one-to-one linear transformation for the original high-dimensional functional time series, and the transformed curve series can be segmented into several groups such that any two subseries from any two different groups are uncorrelated both contemporaneously and serially. Consequently in our second step those groups are handled separately without the information loss on the overall linear dynamic structure. The second step is devoted to establishing a finite-dimensional dynamical structure for all the transformed functional time series within each group. Furthermore the finite-dimensional structure is represented by that of a vector time series. Modelling and forecasting for the original high-dimensional functional time series are realized via those for the vector time series in all the groups. We investigate the theoretical properties of our proposed methods, and illustrate the finite-sample performance through both extensive simulation and two real datasets.

comments
35 pages, 1 figure, 7 tables
fields
Statistics Theory
pdf ↗ page arXiv:2406.00700 ↗

With growing interest in machine learning and data science, creating efficient algorithms to optimize various dimension reduction objectives has become particularly important. This paper is concerned with optimization problems on the Stiefel manifold whose objective functions take the form as the sum of a smooth function and a nonsmooth one. A common practice is to split such a problem into a smooth optimization subproblem on the Stiefel manifold and a nonsmooth one and solve them by some version of the alternating direction method of multipliers (ADMM). Usually the smooth subproblem is solved by standard optimization techniques skillfully adapting to the manifold. However, often the smooth subproblem has strong linear algebra characteristics which, if carefully exploited, can lead to much more efficient solvers than the standard optimization techniques that ignore the characteristics. In this paper, it is proposed to tackle the smooth subproblem through a nonlinear eigen-approach which can fully utilize rich linear algebra structures that dominantly present in objective functions from today's data science applications. We conduct convergence analysis and analyze computational complexity for obtaining an $ε$-stationary point. Numerical experiments demonstrate the advantages of the proposed algorithm compared to the state-of-the-art approaches.

comments
36 pages, 5 figures, 1 table
fields
Optimization and Control
pdf ↗ page arXiv:2406.01885 ↗

In this paper we study the necessary and sufficient conditions on domain for Musielak-Orlicz-Sobolev embedding of the space $W^{1,Φ(\cdot,\cdot)}(Ω)$ where $Φ(x,t):=t^{p(x)}{(\log(e+t))}^{q(x)}.$

comments
16 pages
fields
Functional Analysis
pdf ↗ page arXiv:2406.08091 ↗

We study the approximation errors $\varepsilon(x)=\operatorname{li}_{*}(x)-\operatorname{li}(x)$ and $\varepsilon_{S}(x)=\operatorname{li}_{S}(x)-\operatorname{li}(x)$ arising from the classical Stieltjes–van Boven and pure Stieltjes asymptotic expansions of the logarithmic integral, respectively. Our analysis establishes a top-down reduction based on the discrete error sequence $\varepsilon_n=\varepsilon(e^n)$ and its localized partial variations, for which we derive new, unconditional analytic bounds. By developing precise integral representations for these error increments and establishing sharp, fully explicit upper and lower estima-tes for the underlying kernel integrals, we obtain uniform bounds valid for every integer $n\geq 1$. These discrete results are subsequently lifted to the real domain to provide comprehensive estimates for all real $x\geq e$. In particular, we prove that $\varepsilon(x) = \frac{1}{3} \sqrt{2π/\log x} + O(1/\log x)$ as $x \to \infty$. Furthermore, we deploy these continuous bounds to uncover the fine structural behavior of the pure Stieltjes expansion, demonstrating that $|\varepsilon_{S}(x)| = \sqrt{2π}\,|1/3-α|/\sqrt{\log x} + O(1/\log x)$ as $x\to\infty$, where $n=\lfloor\log x\rfloor$ and $α=\log x-n$. This establishes a novel and explicit asymptotic description of the absolute pure Stieltjes error, fully capturing its non-trivial oscillatory dependence on the fractional part of the logarithm.

comments
Substantially revised and expanded version of arXiv:2406.12152v2. The presentation and proofs have been reorganized, and the main results strengthened. We establish positivity and monotonicity of the Stieltjes-van Boven approximation error, prove the asymptotic behavior conjectured in the previous version, and analyze the pure Stieltjes approximation. 30 pages
fields
Number Theory
pdf ↗ page arXiv:2406.12152 ↗

We prove the Gromov-Lawson-Rosenberg Conjecture for the group Z/4xZ/4 by computing the connective real k-homology of the classifying space with the Adams spectral sequence and two types of detection theorems for the kernel of the alpha invariant: one based on eta-invariants, closely following work of Botvinnik-Gilkey-Stolz, and a second one based on homological methods. Along the way, we determine differentials of the Adams spectral sequence for classifying spaces involved in the computation, and we study the cap structure of the Adams spectral sequence for sub-hopf algebras of the Steenrod algebra relevant to the computation of connective real and complex k-homology.

fields
Algebraic Topology, Differential Geometry, K-Theory and Homology
pdf ↗ page arXiv:2408.07895 ↗

Motzkin spin-chains, which include `colorless' (integer spin $s=1$) and `colorful' ($s \geq 2$) variants, are one-dimensional (1D) local integer spin models notable for their lack of a conformal field theory (CFT) description of their low-energy physics, despite being gapless. The colorful variants are particularly unusual, as they exhibit power-law violation of the area-law of entanglement entropy (as $\sqrt{n}$ in system size $n$), rather than a logarithmic violation as seen in a CFT. In this work, we analytically discover several unique properties of these models, potentially suggesting a new universality class for their low-energy physics. We identify a complex structure of symmetries and unexpected scaling behavior in spin-spin correlations, which deviate from known 1D universality classes. Specifically, the $s=1$ chain exhibits $U(1)$ spontaneous symmetry breaking and ferromagnetic order. Meanwhile, the $s \geq 2$ chains do not appear to spontaneously break any symmetries, but display quasi-long-range algebraic order with power-law decaying correlations, inconsistent with standard Berezinskii-Kosterlitz-Thouless (BKT) critical exponents. We also derive asymptotic scaling expressions, with explicit additive constants, for entanglement measures in both colorless and colorful chains, generalizing previous results of Movassagh [J. Math Phys. (2017)], while providing benchmarks for potential quantum simulation experiments. The $\sqrt{n}$ entanglement scaling implies that any matrix-product-state description of these ground states requires bond dimension $e^{Ω(\sqrt{n})}$; this superpolynomial cost of the standard 1D tensor-network toolkit, along with the analytical tractability of their ground state properties, positions Motzkin spin chains as intriguing testbeds for quantum simulation of many-body physics.

comments
39 pages, 6 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2408.16070 ↗

In this work, we present a hybrid numerical method for solving evolution partial differential equations (PDEs) by merging the time finite element method with deep neural networks. In contrast to the conventional deep learning-based formulation where the neural network is defined on a spatiotemporal domain, our methodology utilizes finite element basis functions in the time direction where the space-dependent coefficients are defined as the output of a neural network. We then apply the Galerkin or collocation projection in the time direction to obtain a system of PDEs for the space-dependent coefficients which is approximated in the framework of PINN. The advantages of such a hybrid formulation are twofold: statistical errors are avoided for the integral in the time direction, and the neural network's output can be regarded as a set of reduced spatial basis functions. To further alleviate the difficulties from high dimensionality and low regularity, we have developed an adaptive sampling strategy that refines the training set. More specifically, we use an explicit density model to approximate the distribution induced by the PDE residual and then augment the training set with new time-dependent random samples given by the learned density model. The effectiveness and efficiency of our proposed method have been demonstrated through a series of numerical experiments.

comments
38 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2409.02810 ↗

In this paper we prove a new characterization of the distinguished unipotent orbits of a connected reductive group over an algebraically closed field of characteristic 0. For classical groups we prove the characterization by a combinatorial computation, and for exceptional groups we check it with a computer. This characterization is needed in the theory of cuspidal sheaves on the stack of L-parameters in the article ``Cuspidal sheaves on the stack of L-parameters'' of the first two authors.

comments
35 pages, generalized results to $\mathbb{Q}_{\geq 0}$-valued weight functions which is needed in the cited paper of the first two authors
fields
Representation Theory, Group Theory
pdf ↗ page arXiv:2409.06006 ↗

In this paper we compute genus-zero orbifold Gromov-Witten invariants of Calabi-Yau threefold complete intersections in weighted projective stacks, regardless of convexity conditions. The traditional quantum Lefschetz principle may fail even for invariants with ambient insertions. Using quasimap wall-crossing, we are able to compute invariants with insertions from a specific subring of the Chen-Ruan cohomology, which contains all the ambient cohomology classes. Quasimap wall-crossing gives a mirror theorem expressing the I-function in terms of the J-function via a mirror map. The key of this paper is to find a suitable GIT presentation of the target space, such that the mirror map becomes invertible. An explicit formula for the I-function is given for all those target spaces and many examples with explicit computations of invariants are provided.

comments
39 pages; v2: agrees with journal version, comments are welcome!
journal
Letters in Mathematical Physics, Volume 116, article number 155 (2026)
fields
Algebraic Geometry
pdf ↗ page arXiv:2409.06193 ↗

We evaluate all Hankel determinants of the formal power series \(G=a/(1+b_1x+b_2x^2+cx^kG)\), where \(k\ge4\). The defining equation arises from a weighted lattice-path model with horizontal steps of lengths one and two. For \(k=4\), the determinants are expressed through Fibonacci polynomials. For \(k\ge5\), explicit formulas describe each residue class of the determinant size modulo \(k\). The proofs combine quadratic transformations with a second-order recurrence for an auxiliary family. As an application, we recover known Hankel evaluations for the square of the weighted Motzkin generating function.

comments
12 pages
fields
Combinatorics
pdf ↗ page arXiv:2409.18609 ↗

For an odd prime $p$, we fully determine the lower central series of a large family of non-periodic GGS-groups, which has a density of roughly $(\frac{p-1}{p})^2$ within all GGS-groups. We also describe the structure of the $\mathbb{F}_p$-Lie algebra associated to the lower central series of these groups. These results represent a major step forward in the knowledge of the lower central series of distinguished classes of branch groups, which to date was basically restricted to the Grigorchuk group. As part of our results, we obtain the exact values of the indices between consecutive terms of the lower central series, and we show that these groups, as well as their profinite completions, have lower central width equal to $2$. In particular, this confirms a conjecture of Bartholdi, Eick, and Hartung about the generalised Fabrykowski-Gupta groups.

comments
To appear in "Transactions of the American Mathematical Society". No use of AI at any stage
fields
Group Theory
pdf ↗ page arXiv:2410.07371 ↗

A symplectic groupoid of triangular bilinear forms consists of pairs of matrices $(B,A)$ with $A\in \mathcal A$ - the set of real unipotent upper-triangular matrices - and $B\in {\rm SL}_n({\mathbb R})$ such that $\widetilde{A}=BAB^{\mathsf T}\in\mathcal A$. The symplectic groupoid possesses a nondegenerate symplectic structure which induces a reflection-equation Poisson algebra on $\mathcal A$. Fock and Chekhov defined a Poisson map from the Teichmüller space ${\mathcal T}_{g,s}$ of genus $g$ surfaces with $s$ (one or two) holes to the space of unipotent upper-triangular $n\times n$ matrices; the image of this map forms a geometric locus. A matrix $A$ in the geometric locus satisfies the rank condition: $\operatorname{rank}\bigl(A+A^{\mathsf T}\bigr)\le 4$ and an additional positivity condition. We describe the coisotropic reduction of the Poisson cluster variety of $\mathcal A$ by the rank condition for $n=5$ and $6$ and show that these coisotropic reductions yield the corresponding geometric loci. Moreover, we analyze in both cases the cluster structures obtained by coisotropic reductions and recover the celebrated cluster structure of ${\mathcal T}_{2,1}$ for $n=5$ and ${\mathcal T}_{2,2}$ for $n=6$. We also discuss the positivity of the geometric cluster variables for $n=3,4,5,6$.

journal
SIGMA 22 (2026), 112, 45 pages
fields
Quantum Algebra
pdf ↗ page arXiv:2410.22620 ↗

For a uniformly locally finite metric space $(X, d)$, we investigate \emph{coarse} flows on its uniform Roe algebra $\mathrm{C}^*_u(X)$, defined as one-parameter groups of automorphisms whose differentiable elements include all partial isometries arising from partial translations on $X$. We first show that any flow $σ$ on $\mathrm{C}^*_u(X)$ corresponds to a (possibly unbounded) self-adjoint operator $h$ on $\ell_2(X)$ such that $σ_t(a) = e^{ith} a e^{-ith}$ for all $t \in \mathbb{R}$, allowing us to focus on operators $h$ that generate flows on $ \mathrm{C}^*_u (X)$. Assuming Yu's property A, we prove that a self-adjoint operator $h$ on $\ell_2(X)$ induces a coarse flow on $\mathrm{C}^*_u(X)$ if and only if $h$ can be expressed as $h = a + d$, where $a \in \mathrm{C}^*_u(X)$ and $d$ is a diagonal operator with entries forming a coarse function on $X$. We further study cocycle equivalence and cocycle perturbations of coarse flows, showing that, under property A, any coarse flow is a cocycle perturbation of a diagonal flow. Finally, for self-adjoint operators $h$ and $k$ that induce coarse flows on $\mathrm{C}^*_u(X)$, we characterize conditions under which the associated flows are either cocycle perturbations of each other or cocycle conjugate. In particular, if $h - k$ is bounded, then the flow induced by $h$ is a cocycle perturbation of the flow induced by $k$.

fields
Operator Algebras, Functional Analysis
pdf ↗ page arXiv:2411.06999 ↗

In 1995, Ismail and Masson introduced orthogonal polynomials of types \( R_I \) and \( R_{II} \), which are defined by specific three-term recurrence relations with additional conditions. Recently, Kim and Stanton found a combinatorial interpretation for the moments of orthogonal polynomials of type \( R_I \) in the spirit of the combinatorial theory of orthogonal polynomials due to Flajolet and Viennot. In this paper, we push this combinatorial model further to orthogonal polynomials of type \( R_{II} \). Moreover, we generalize orthogonal polynomials of type \( R_{II} \) by relaxing some of their conditions. We then prove a master theorem, which generalizes combinatorial models for moments of various types of orthogonal polynomials: classical orthogonal polynomials, Laurent biorthogonal polynomials, and orthogonal polynomials of types \( R_I \) and \( R_{II} \).

journal
Electron. J. Combin. 33(4) (2026), #P4.24
fields
Combinatorics, Classical Analysis and ODEs
pdf ↗ page arXiv:2411.12345 ↗

We study the Cauchy problem for a one-dimensional 2x2 non-symmetric Keyfitz-Kranzer system of conservation laws with a flux f= f(x,U) that is discontinuous with respect to the spatial variable x. No monotonicity assumption is imposed on the mapping x \to f(x,U). We introduce a Kruzhkov-type entropy condition and establish global existence and uniqueness of entropy solutions for initial data with arbitrarily large total variation. The proof relies on a wave-front tracking approximation. The main technical novelty consists in the introduction of adapted Riemann invariant coordinates, specifically designed to account for the discontinuities of the flux, which yield a uniform-in-time bound on the total variation of the approximate solutions U^n(t). As an application, we discuss the second-order ARZ model for vehicular traffic on inhomogeneous roads with abrupt collective changes in the speed law or road capacity.

fields
Analysis of PDEs
pdf ↗ page arXiv:2411.12531 ↗

In this work, we study the existence, non-existence, and uniqueness results for nonlocal elliptic equations involving logarithmic Laplacian, and subcritical, critical, and supercritical logarithmic nonlinearities. The Poho\u zaev's identity and Díaz-Saa type inequality are proved, which are of independent interest and can be applied to a larger class of problems. Depending upon the growth of nonlinearities and regularity of the weight function, we study the small-order asymptotic of nonlocal weighted elliptic equations involving the fractional Laplacian of order $2s.$ We show that the least energy solutions of a weighted nonlocal problem with superlinear or sublinear growth converge to a nontrivial nonnegative least-energy solution of Brézis-Nirenberg type and logistic-type limiting problem respectively involving the logarithmic Laplacian.

comments
Due to a mistake in the proof of Pohozeav identity the paper is withdrawn. A new draft is prepared with extended existence results for a large class of nonlinearity in arXiv:2504.18907.
fields
Analysis of PDEs
pdf ↗ page arXiv:2411.15985 ↗

Diffusional phase transformations in alloys are modeled either by phase-field methods of Cahn-Hilliard type, in which a double-well free energy and a gradient term impose an interface energy, or by reactive diffusion models, in which the driving forces follow from the CALPHAD methodology, the convex hull of the molar free energy, and the interface carries no energy. Their numerical schemes are tied to their free energies: phase-field schemes break down when the interface energy is set to zero, and reactive diffusion codes rely on finite differences. We derive, from the thermodynamic extremal principle, a single finite element scheme that covers both limits: the stationarity of the Rayleighian functional (free energy rate plus one half of the dissipation, with mass conservation imposed by multipliers) with respect to the rates, fluxes and multipliers at a frozen state. Fluxes and chemical affinities are primary unknowns, so no derivative of the affinity is required. The time-discrete scheme is the corresponding incremental minimization; it conserves mass exactly and satisfies a discrete energy-dissipation inequality for every convex molar free energy, including the convex hull without regularization. We make explicit that this last case is a degenerate parabolic problem of Stefan type, whose degeneracy can be removed, without altering the free energy, only by a moving mesh; since our aim is the coupling to continuum mechanics and damage on a fixed mesh, we operate at the boundary of degeneracy and show that mass conservation, the energy balance and the second law remain intact there. Thermodynamic consistency is proved for multi-component systems, a scheme relating Onsager and diffusion coefficients is proposed, and the role of interface energy is studied in binary and ternary examples, the latter with vacancies as a non-conserved component.

comments
29 pages, 13 figures, preprint
fields
Numerical Analysis
pdf ↗ page arXiv:2411.16430 ↗

We study a class of finite-area, infinite-type translation surfaces and construct an explicit cylinder decomposition on these surfaces. The cylinder decomposition contains a special curve which distinguishes it from cylinder decompositions in other periodic directions.

comments
Rewritten and restructured. Comments welcome!
fields
Geometric Topology
pdf ↗ page arXiv:2412.03535 ↗

For the Hamming graph $H(n,q)$, where $q$ is a constant prime power and $n$ grows, we construct perfect colorings without non-essential arguments such that $n$ depends exponentially on the off-diagonal part of the quotient matrix. In particular, we construct unbalanced functions (in the case $q=2$, Boolean functions) such that the number of essential arguments depends exponentially on the degree of the function. Another framing of the main construction is that it gives a sequence of very regular functions (perfect colorings) whose number of essential arguments grows exponentially with respect to sensitivity. A classical result that connects sensitivity with the number of essential arguments in the binary ($q=2$) case is the Simon–Wegener theorem. We prove an analog of this theorem for an arbitrary $q$. Keywords: boolean functions, perfect colorings, equitable partitions, degree, sensitivity, essential arguments

comments
v2: revised; Section 3 added; more general corollaries in Section 2
fields
Combinatorics
pdf ↗ page arXiv:2412.04461 ↗

Let $X$ be a manifold with boundary, and let $L$ be a 0-elliptic operator on X which is semi-Fredholm essentially surjective with infinite-dimensional kernel. Examples include Hodge Laplacians and Dirac operators on conformally compact manifolds. We construct left and right parametrices for L when supplemented with appropriate elliptic boundary conditions. The construction relies on a new calculus of pseudodifferential operators on functions over both $X$ and $\partial X$, which we call the "symbolic 0-calculus". This new calculus supplements the ordinary 0-calculus of Mazzeo–Melrose, enabling it to handle boundary value problems. In the original 0-calculus, operators are characterized as polyhomogeneous right densities on a blow-up of $X^2$. By contrast, operators in the symbolic 0-calculus are characterized (locally near each point of the boundary of the diagonal) as quantizations of polyhomogeneous symbols on appropriate blown-up model spaces.

comments
153 pages, 8 figures. Version published by Ars Inveniendi Analytica. Major changes from v1: 1. Addition of a "guiding example" (§2.6, §3.5, §6.5 §7.3) illustrating the theory. 2. Addition of a section (§7) with a new regularity theorem for solutions of 0-elliptic equations
journal
Ars Inveniendi Analytica (2026), Paper No. 4, 153 pp
fields
Analysis of PDEs, Differential Geometry
pdf ↗ page arXiv:2412.06084 ↗

We study continuous-time mean–variance portfolio selection in markets where stock prices are diffusion processes driven by observable factors that are also diffusion processes, yet the coefficients of these processes are unknown. Based on the recently developed reinforcement learning (RL) theory for diffusion processes, we present a general data-driven RL approach that learns the pre-committed investment strategy directly without attempting to learn or estimate the market coefficients. For multi-stock Black–Scholes markets without factors, we further devise an algorithm and prove its performance guarantee by deriving a sublinear regret bound in terms of the Sharpe ratio. We then carry out an extensive empirical study implementing this algorithm to compare its performance and trading characteristics, evaluated under a host of common metrics, with a large number of widely employed portfolio allocation strategies on S\&P 500 constituents. The results demonstrate that the proposed continuous-time RL strategy is consistently among the best, especially in a volatile bear market, and decisively outperforms the model-based continuous-time counterparts by significant margins.

comments
99 pages, includes appendix. Accepted for publication in Management Science
fields
Optimization and Control
pdf ↗ page arXiv:2412.16175 ↗

Boolean combinations allow combining given combinatorial objects to obtain new, potentially more complicated, objects. In this paper, we initiate a systematic study of this idea applied to graphs. In order to understand expressive power and limitations of boolean combinations in this context, we investigate how they affect different combinatorial and structural properties of graphs, in particular $χ$-boundedness, as well as characterize the structure of boolean combinations of graphs from various classes.

journal
The Electronic Journal of Combinatorics, 33(4), #P4.12, 2026
fields
Combinatorics
pdf ↗ page arXiv:2412.19551 ↗

We prove the existence of an inscribed rectangle with any prescribed aspect ratio for a large class of continuous Jordan curves that includes all rectifiable curves and Stromquist's locally monotone curves. Our proof is based on microlocal sheaf theory and is inspired by the recent work of Greene and Lobb.

comments
31 pages, v4:Revised
fields
Symplectic Geometry, Geometric Topology, Metric Geometry
pdf ↗ page arXiv:2412.21057 ↗

Quantale-enriched categories unify ordered, metric, relational, and tropical structures that arise across networked systems. To study consensus and relaxation over such structures, we develop a theory of diffusion for cellular sheaves of quantale-enriched categories over graphs, governed by an order-theoretic Laplace operator that we call the Lawvere Laplacian. Over an arbitrary unital quantale, we define the weighted global sections of a cellular sheaf as the quantale-enriched category of natural transformations from a weight diagram into the sheaf, which over a commutative base is a weighted limit, and characterize them as the vertex data that agree up to edge tolerances across every edge. For an adjoint bisheaf, we prove that the weighted global sections coincide with the suffix points of the Lawvere Laplacian, which are the equilibria of its harmonic flow. Under a chain-continuity hypothesis, the harmonic flow converges to the greatest weighted global section below the initial cochain. Instances of the theory include shortest-path iteration over the Lawvere quantale, reconciliation of local cost estimates, quantale and clock synchronization, and coupled max-plus discrete event systems.

fields
Category Theory
pdf ↗ page arXiv:2501.03890 ↗

The double Heston model is a widely used stochastic volatility model in financial mathematics, particularly for option pricing, risk management, and volatility surface calibration. This paper investigates the joint estimation of the drift parameters for an ergodic extension of the double Heston model. We first establish stochastic properties of the underlying process, including the existence of a stationary distribution and ergodicity. We then study maximum likelihood and conditional least squares estimators based on continuous-time observations. For both estimation procedures, we establish consistency and asymptotic normality under suitable ergodicity conditions.

fields
Statistics Theory
pdf ↗ page arXiv:2501.17100 ↗

We consider the strong numerical approximation for a fourth-order stochastic nonlinear SPDE driven by space-time white noise on {$d=1,2,3$}-dimensional torus. We consider its full discretisation with a spectral Galerkin scheme in space and Euler scheme in time. We show the convergence with almost spatial rate $2-\frac{d}{2}$ and $\frac{6-d}{4} \wedge 1$-temporal rate obtained mainly via \it{Stochastic Sewing} technique.

comments
21 pages
fields
Numerical Analysis, Probability
pdf ↗ page arXiv:2501.18240 ↗

Coordination of day-ahead and real-time electricity markets is imperative for cost-effective electricity supply and also to provide efficient incentives for the energy transition. Although stochastic market designs feature the least-cost coordination, they are incompatible with current deterministic markets. This paper proposes a new approach for compatible coordination in two-settlement markets based on benchmark bidding curves for variable renewable energy. These curves are optimized based on a bilevel optimization problem, anticipating per-scenario responses of deterministic market-clearing problems and ultimately minimizing the expected cost across day-ahead and real-time markets. Although the general bilevel model is challenging to solve, we theoretically prove that a single-segment bidding curve with a zero bidding price is sufficient to achieve system optimality if the marginal cost of variable renewable energy is zero, thus addressing the computational challenge. In practice, variable renewable energy producers can be allowed to bid multi-segment curves with non-zero prices. We test the bilevel framework for both single- and multiple-segment bidding curves under the assumption of fixed bidding prices. We leverage duality theory and McCormick envelopes to derive the linear programming approximation of the bilevel problem, which scales to practical systems such as a 1576-bus NYISO system. We benchmark the proposed coordination and find absolute dominance over the baseline solution, which assumes that renewables agnostically bid their expected forecasts. We also demonstrate that our proposed scheme provides a good approximation of the least-cost, yet unattainable in practice, stochastic market outcome.

fields
Optimization and Control
pdf ↗ page arXiv:2501.18732 ↗

Let $M$ be a closed spin manifold, in this paper, we show that if there is a foliation $(M,F)$ and a Riemannian metric on $M$ that has leafwise positive scalar curvature then the Rosenberg index of $M$ is zero.

comments
The proof has been reorganized and expanded, with more detailed arguments and improved exposition
fields
Differential Geometry, K-Theory and Homology
pdf ↗ page arXiv:2502.02325 ↗

We study when degree-zero identities for reduced and coreduced modules extend to ambient derived torsion and completion. For a non-idempotent ideal $I$ in an explicit polynomial ring, we construct a module $M$ that is simultaneously $I$-reduced and $I$-coreduced and satisfies $Γ_I(M)=Λ_I(M)=0$ but $H_I^2(M)\ne0$. The module is a union of finite reduced and coreduced submodules whose positive derived torsion vanishes. The supporting ideal has unrestricted torsion dimension two, whereas the dimension on each bounded-nilpotence quotient category is one. The calculations use compatible cone resolutions for $R=S[t]$ and $I=JS[t]+(t)$, where $J^2=J$. These give paired Ext–Tor formulas for coefficients annihilated by a fixed power of $t$. For arbitrary coefficients, an explicit mapping-fiber model realizes the standard derived-composition comparison sequence and identifies the obstruction to extending the bounded formula. Coordinate calculations for countably idempotent-generated ideals supply the computational foundation, and a valuation-domain example gives nonzero first derived completion on a cyclic reduced and coreduced coefficient.

comments
15 pages
fields
Commutative Algebra, Rings and Algebras
pdf ↗ page arXiv:2502.02937 ↗

We study a $q$-state Potts model on the square grid when $q>4$ at the point $T_c(q)$ of its (discontinous) transition. This model exhibits exactly $q+1$ extremal Gibbs measures: $q$ ordered (monochromatic) and one disordered (free). The current work deals with the Dobrushin order–disorder boundary conditions on a finite $N\times N$ box. Our main result is that this interface is a well-defined object, has $\sqrt{N}$ fluctuations, and converges to a Brownian bridge under diffusive scaling. The same holds also for the corresponding FK-percolation model for all $q>4$. Our proofs rely on a coupling between FK-percolation, the six-vertex model, and the random-cluster representation of an Ashkin–Teller model (ATRC), and on a detailed study of the latter. The coupling relates the interface in FK-percolation to a long subcritical cluster in the ATRC model. For this cluster we develop a ``renewal picture'' à la Ornstein-Zernike. This is based on fine mixing properties of the ATRC model that we establish using the link to the six-vertex model and its height function. Along the way, we derive various properties of the Ashkin-Teller model, such as Ornstein-Zernike asymptotics for its two-point function. In a companion work, we provide a detailed study of the Potts model under order-order Dobrushin conditions. We show emergence of a free layer of width $\sqrt{N}$ between the two ordered phases (wetting) and establish convergence of its boundaries to two Brownian bridges conditioned not to intersect.

comments
82 pages, 29 figures. v2: improved presentation, adaptations to fit with companion work. v3: cosmetic improvements. Comments still welcome!
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2502.04129 ↗

We construct an infinite two-parameter family of substitution rules with inflation factors $δ_{(m,n)}=m+n(1+\sqrt{2})$ for integers $m\geq0$ and $n\geq1$, excluding pairs in which $m$ is even and $n$ is odd. Extending four examples from our previous work, we show that each substitution admits a tiling with $8$-fold rotational symmetry and that the associated tilings are repetitive and have finite local complexity. We also classify the inflation factors according to their PV and unimodular properties and illustrate selected cases through perpendicular-space projections and Fourier spectra.

comments
21 pages, 15 figures. A hugely updated version of our previous work, expanding our four distinct tiling cases to an infinite family (which contains those cases)
fields
Mathematical Physics
pdf ↗ page arXiv:2502.04133 ↗

Twisting theories with super-Poincaré symmetry yields topological-holomorphic field theories, whose operator product expansions of local operators can have as coefficients not only ordinary functions but also `derived' functions with nonzero cohomological degree, described by certain elements of sheaf cohomology. Twisting non-Lorentzian supersymmetric theories yields richer phenomena, where topological and holomorphic spacetime coordinates coexist with ordinary (that is, neither topological nor holomorphic) spacetime coordinates. We propose a sheaf-cohomological description of such OPE coefficients for quantum field theories with arbitrary numbers of topological, holomorphic, and/or ordinary spacetime dimensions, and identify necessary and sufficient conditions for the proposed OPE coefficient space to contain nontrivial `derived' functions; in particular, theories with one topological spacetime dimension and multiple ordinary spacetime dimensions provide a smooth analogue of the (holomorphic) raviolo. We then demonstrate that two-point functions in topological twists of free supersymmetric non-Lorentzian field theories appearing in the literature define nontrivial derived functions consistent with our sheaf-theoretic construction.

comments
23 pages, 2 figures. Extensive revision with explicit non-Lorentzian examples
fields
Mathematical Physics
pdf ↗ page arXiv:2502.05077 ↗

We study subgraphs that appear in large Ramsey graphs for a given graph $F$. The recent girth Ramsey theorem of the first two authors asserts that there are Ramsey graphs such that all small subgraphs lie in `forests of copies of $F$' amalgamated on vertices and edges. We derive a few further consequences from this structural result and investigate to what extent such forests of copies must be present in Ramsey graphs. As an application, we improve a recent result on generalised Sidon sets with Ramsey-type properties.

comments
35 pages, updated and expanded
fields
Combinatorics
pdf ↗ page arXiv:2502.09830 ↗

This paper focuses on the value function in the time-optimal problem for a continuity equation in the space of probability measures. We derive the dynamic programming principle for this problem. Using this principle, we prove that the Kruzhkov transform of the value function is a unique discontinuous viscosity solution to the corresponding Dirichlet problem for the Hamilton-Jacobi equation. Finally, we establish the $Γ$-convergence of the value function in a perturbed problem to the value function in the unperturbed problem.

comments
41 pages
fields
Analysis of PDEs, Optimization and Control, Probability
pdf ↗ page arXiv:2502.20871 ↗

We propose a comprehensive framework for solving constrained variational inequalities via various classes of evolution equations displaying multi-scale aspects. In an infinite-dimensional Hilbertian framework, the class of dynamical systems we propose combine Tikhonov regularization and exterior penalization terms in order to induce strong convergence of trajectories to least norm solutions in the constrained domain. Our construction thus unifies the literature on regularization methods and penalty-based dynamical systems. An extension to a full splitting formulation of the constrained domain is also provided, with associated weak convergence results involving the Attouch-Czarnecki condition.

comments
This is a largely extended and revised version of the paper M. Staudigl and S. Qu, "Tikhonov Regularized Exterior Penalty Dynamics for Constrained Variational Inequalities," in IEEE Control Systems Letters, vol. 8, pp. 622-627, 2024
fields
Optimization and Control
pdf ↗ page arXiv:2503.03902 ↗

We show that w.h.p.\ the random $r$-uniform hypergraph $H_{n,m}$ contains a loose Hamilton cycle, provided $r\geq 3$ and $m\geq \frac{(1+ε)n\log n}{r}$, where $ε$ is an arbitrary positive constant. This is asymptotically best possible, as if $m\leq \frac{(1-ε)n\log n}{r}$ then w.h.p.\ $H_{n,m}$ contains isolated vertices.

fields
Combinatorics
pdf ↗ page arXiv:2503.05121 ↗

This paper is devoted to filtering, smoothing, and prediction of polynomial processes that are partially observed. These problems are known to allow for an explicit solution in the simpler case of linear Gaussian state space models. The key insight underlying the present piece of research is that in linear filtering applications polynomial processes and their discrete-time counterpart are indistinguishable from Gaussian processes sharing their first two moments. We describe the construction of these Gaussian equivalents of polynomial processes and explicitly compute optimal linear filters, predictors and smoothers for polynomial processes in discrete and continuous time. The consideration of Gaussian equivalents also opens the door to parameter estimation and linear-quadratic optimal control in the context of polynomial processes.

journal
Stochastic Processes and their Applications 202 (2026) 105077
fields
Probability, Statistics Theory
pdf ↗ page arXiv:2503.05588 ↗

We investigate the local linear convergence properties of the Alternating Direction Method of Multipliers (ADMM) when applied to Semidefinite Programming (SDP). A longstanding belief suggests that ADMM is only capable of solving SDPs to moderate accuracy, primarily due to its sublinear worst-case complexity and empirical observations of slow convergence. We challenge this notion by introducing a new sufficient condition for local linear convergence: as long as the converged primal-dual optimal solutions satisfy strict complementarity, ADMM attains local linear convergence, independent of nondegeneracy conditions. Our proof is based on a direct local linearization of the ADMM operator and a refined error bound for the projection onto the positive semidefinite cone, improving previous bounds and revealing the anisotropic nature of projection residuals. Extensive numerical experiments confirm the significance of our theoretical results, demonstrating that ADMM achieves local linear convergence and computes high-accuracy solutions in a variety of SDP instances, including those cases where nondegeneracy fails. Furthermore, we identify where ADMM struggles, linking these difficulties with near violations of strict complementarity-a phenomenon that parallels recent findings in linear programming.

fields
Optimization and Control
pdf ↗ page arXiv:2503.20142 ↗

We introduce a convex integration scheme for the continuity equation in the context of the Di Perna-Lions theory that allows to build incompressible vector fields in $C_{t}W^{1,p}_x$ and nonunique solutions in $C_{t} L^{q}_x$ for any $p,q$ with $\frac{1}{p} + \frac{1}{q} > 1 + \frac{1}{d}- δ$ for some $δ>0$. This improves the previous bound, corresponding to $δ=0$, or equivalently $q' > p^*$, obtained with convex integration so far, and critical for those schemes in view of the Sobolev embedding that guarantees that solutions are distributional in the opposite range.

comments
24 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2504.03578 ↗

Recent progress on the understanding of the Random Conductance Model is reviewed. A particular emphasis is on homogenization results such as functional central limit theorems, local limit theorems and heat kernel estimates for almost every realization of the environment, established for random walks among stationary ergodic conductances that are possibly unbounded but satisfy certain moment conditions.

comments
36 pages, 2 figures; accepted version, to appear in Fractal Geometry and Stochastics VII, Progress in Probability
fields
Probability
pdf ↗ page arXiv:2504.06690 ↗

Distributed systems, such as biological and artificial neural networks, process information via complex interactions engaging multiple subsystems, resulting in high-order structure of the information within the system with distinct properties across scales. Investigating how these systems process information remains challenging due to difficulties in defining appropriate multivariate metrics and ensuring their scalability to large systems. To address these challenges, we introduce a novel framework based on what we call "Shannon observables": quantities that capture essential properties of high-order information processing, yet can be computed directly from Shannon entropies and scale efficiently to large systems. Our theoretical results demonstrate how Shannon observables can be used to resolve long-standing ambiguities regarding the interpretation of widely used multivariate information-theoretic measures. On the practical side, we demonstrate the framework's versatility across several domains. An analytical study of error-correcting codes shows how Shannon observables trace out distinct encoding regimes as channel noise varies; analyses of deep classifiers and convolutional autoencoders reveal characteristic information-processing signatures across layers and over training; and applied to magnetoencephalography recordings from the human brain, the framework yields a cortical atlas exposing pronounced regional structure in directed information transfer. Overall, our framework resolves fundamental limitations in analysing high-order information phenomena and offers broad opportunities for theoretical developments and empirical analyses.

comments
28 pages, 8 figures, 3 tables. v2: substantially revised and retitled (formerly "Shannon invariants"); adds an analysis of error-correcting codes, an extension to directed information flow with a cortical atlas from MEG recordings, single-neuron lesion and dropout experiments, and bounds linking vulnerability to performance loss after neuron removal
fields
Information Theory
pdf ↗ page arXiv:2504.15779 ↗

We study how a smooth irreducible variety $X$ of dimension $n$ and degree $d$ in $\mathbb{P}^m$, $m\geq n+2$, can be recovered from the equations of its images under two generic projections from unknown centers. This extends earlier results on curves in $\mathbb{P}^3$ and surfaces in $\mathbb{P}^4$ to any dimension. Since $X$ is the normalization of each image, one image determines $X$ modulo the projective group when $X$ is linearly normal; what two images add is the configuration, that is the pair of projections. For complete intersections we prove unconditionally that the set of configurations compatible with the two images and their Hilbert polynomial is finite, of size at most $|\mathrm{Lin}(X)|$, the projective automorphism group of $X$. The argument is effective and the bound is attained. We then introduce an equation generalizing Kruppa's equation, relating the duals of the images to a fundamental matrix, encoding the pair of projections modulo the projective group. We give a necessary condition for its solution variety to be finite, a bound on its isolated points, and a sufficient condition under which the true fundamental matrix is rigid: no quadric may contain a generic line $L$ together with the locus of points of $X$ whose tangent space meets $L$. Rigidity is unconditional for curves; in higher dimension it holds under a first-order liftability hypothesis, which we certify for a del Pezzo quartic surface in $\mathbb{P}^4$. Global finiteness of that solution variety remains open, necessarily so, as it contains solutions realized by no variety; for $\dim X<\mathrm{codim}\,X-1$ the obstruction amounts to knowing the fundamental matrix itself. Once the projections are known, $X$ is recovered from the two cones over the images: in codimension two their intersection is $X$ plus a component of degree $d(d-1)$; in higher codimension $X$ is its unique component of maximal dimension.

comments
arXiv admin note: text overlap with arXiv:math/0208099, arXiv:math/0110157 by other authors. Code and computations: https://doi.org/10.5281/zenodo.24114814
fields
Algebraic Geometry
pdf ↗ page arXiv:2504.16771 ↗

Let $m,n,d >1$ be integers such that $n=md$ and let $(B, \mathscr{M}, Θ\_{\mathscr{M}})$ be a marked abelian variety of level $m$ over a field of odd characteristic. We study the theta structures of level $n$ for $\mathscr{M}^d$, and the theta structures on the abelian varieties $d$-isogenous to $B$, which are compatible with $Θ\_{\mathscr{M}}$. When $d$ is odd and coprime to $m$, they correspond to the isotropic subgroups of $B[n]$, and this correspondence underlies the known algorithms in theta coordinates. In general, this is no longer true. We introduce the notion of symmetric compatibility of a torsion point with a symmetric level subgroup, and we show that a subgroup of $B[n]$ isomorphic to $(\mathbb{Z}/n\mathbb{Z})^g$ comes from a compatible theta structure if and only if it is isotropic and all its points are symmetric compatible. We extend to every $d$ Mumford's notion of compatible pairs of theta structures, defined by Mumford for $d=2$, and prove that it is equivalent to our notion, which can be tested on theta coordinates; we also describe exactly the remaining ambiguity, which explains the sign choices met when the duplication formula is used to change the level. As applications, we obtain change of level and isogeny algorithms without assuming that $d$ is odd and coprime to $m$, using $O(n^{3g} \log(d))$ and $O(n^{2g} \log(d))$ operations in the base field respectively. In particular, they give change of level algorithms for even $d$, and $2$-isogenies in level $4$ theta coordinates with an explicit control of the theta structure of the codomain.

fields
Number Theory
pdf ↗ page arXiv:2504.21058 ↗

This paper concerns the shape optimization problem of minimizing the ground state energy of the magnetic Dirichlet Laplacian with constant magnetic field among three-dimensional domains of fixed volume. In contrast to the two-dimensional case, a generalized "magnetic" Faber-Krahn inequality does not hold and minimizers cannot be balls when the magnetic field is turned on. An analysis of the problem among cylindrical domains reveals geometric constraints for general minimizers. In particular, minimizers must elongate with a certain rate along the direction of the magnetic field as the field strength increases. In addition to the theoretical analysis, we present numerical minimizers which confirm this prediction and give rise to further conjectures.

comments
24 pages, 4 figures; updated to the final published version
journal
Appl Math Optim 95, 12 (2027)
fields
Mathematical Physics, Analysis of PDEs, Optimization and Control, Spectral Theory
pdf ↗ page arXiv:2504.21597 ↗

In an influential $L^2$ extension theorem due to Demailly, the subvariety to extend from is defined by the multiplier ideal of a quasi-plurisubharmonic defining function with analytic singularities. In his theorem, the finiteness of an $L^2$ norm called the Ohsawa norm plays the crucial role of determining whether a given holomorphic function or section can be extended. In 2016, Demailly asked if the Ohsawa norm behaves equally well when the defining function is further generalized to admit non-analytic singularities. We answer this question negatively by showing that for a wide class of log canonical defining functions with a unique log canonical place, only the zero holomorphic function on the subvariety has finite Ohsawa norm. It follows that for such a defining function, the $L^2$ extension theorem is vacuous. This reveals a fundamental obstruction in the theory of $L^2$ extension in the general non-analytic setting.

comments
Title changed, Demailly's Question 1.2 added
fields
Complex Variables, Algebraic Geometry
pdf ↗ page arXiv:2505.00801 ↗

A {\em fork} is a graph obtained from $K_{1,3}$ (usually called {\em claw}) by subdividing an edge once, an {\em co-fork} is the complement graph of a fork, and a {\em co-cricket} is a union of $K_1$ and $K_4-e$. A graph is perfectly divisible if for each of its induced subgraphs $H$, $V (H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B]) < ω(H)$. A graph is perfectly weight divisible if the same condition holds for any positive integer weights on its vertices, using the maximum weight of a clique instead of the clique number. Sivaraman proposed the conjecture that every fork-free graph is perfectly divisible in a paper by Karthick {\em et al.} [Electron. J. Comb. 29 (2022), P3.19.]. In the same paper, they proved that every ((\text{fork},\text{co-cricket}))-free graph is either claw-free or perfectly divisible. In this paper, we show that every (fork, co-fork$\cup K_1$)-free graph is perfectly weight divisible, and hence perfectly divisible. This improves some results of Karthick {\em et al.}.

fields
Combinatorics
pdf ↗ page arXiv:2505.04429 ↗

A family of simplicial complexes connected by simplicial maps and indexed by a finite poset $P$ is called a poset tower. Poset towers subsume multi-parameter filtrations, zigzag filtrations, and one-parameter simplicial towers, while allowing arbitrary finite posets and simplicial maps. The homology of a poset tower is a $P$-persistence module. To compute it globally over $P$, we consider the chain complex segment of $P$-persistence modules $C_{\ell-1}\xleftarrow{\partial_{\ell}}C_\ell \xleftarrow{\partial_{\ell+1}}C_{\ell+1}$ induced by the simplices of the tower. Unlike in one-critical multi-filtrations, the chain modules $C_\ell$ need not be projective and may have a complicated structure. We address the problem of replacing this segment by projective modules and $P$-graded matrices while preserving homology. The resulting projective implicit representation (PiRep) plays the role of the graded boundary-matrix representation in the classical persistence algorithm: it converts simplicial data into algebraic input on which persistent homology can be computed globally over $P$. In particular, a PiRep can be used as input to algorithms for computing minimal presentations of persistent homology. We give an efficient algorithm to compute a PiRep from a poset tower. It constructs degreewise minimal presentations and asymptotically minimal second terms of projective resolutions of the chain modules $C_\ell$, lifts the boundary maps $\partial_\ell$ to these resolutions, and assembles the resulting data into a PiRep using an additional correction term. The method is tailored to chain complexes induced by poset towers and computes the required algebraic data combinatorially, exploiting their special structure and avoiding general-purpose algebraic reduction. In the context of poset towers, it is fully general and can serve as a foundation for efficient algorithms on specific posets.

fields
Algebraic Topology
pdf ↗ page arXiv:2505.08755 ↗

We study quasi-$F^e$-split and quasi-$F$-regular singularities, which generalize Yobuko's quasi-$F$-splitting. We establish Fedder type criteria that characterize these properties for hypersurfaces. These criteria offer explicit tools for computation and verification. As an application, we construct a counterexample to the inversion of adjunction for quasi-$F$-regularity and compute the quasi-$F$-split threshold of the cone over the ordinary cusp.

comments
26 pages, v3:I added Section 6 on the quasi-$F$-split threshold. To appear in Nagoya Mathematical Journal
fields
Algebraic Geometry, Commutative Algebra
pdf ↗ page arXiv:2505.09015 ↗

This article addresses three problems: (1) the construction of a general nonlinear fractal interpolation function on post-critically finite (PCF) self-similar sets; (2) the study of the energy and normal derivatives of uniform nonlinear fractal functions; and (3) the estimation of the box-counting dimensions of the proposed fractal functions on the Sierpiński gasket and the von Koch curve. We present a general framework for constructing attractors and fractal functions on PCF self-similar sets using Edelstein contractions. Further, we derive upper and lower bounds for the box-counting dimensions of the graphs of nonlinear interpolants. Finally, we provide several graphical and numerical examples to illustrate the construction and estimate the dimensions for different data sets.

comments
This is the revised version. Earlier we computed only the upper bound of the box-dimension. Now we have given non-trivial upper and lower bounds of the box-dimension of the corresponding non-linear interpolant
fields
Dynamical Systems, Functional Analysis
pdf ↗ page arXiv:2505.10455 ↗

We classify isoparametric functions on Damek-Ricci spaces which can be written in terms of the standard coordinates $(v,z,t)$ on the half-space model as a polynomial function divided by $t$. Regular level sets of the functions in our classification encompass almost all previously known examples of isoparametric hypersufaces in Damek-Ricci space and also yield new ones. For the new examples, the focal varieties are determined and the mean curvatures of the regular level sets are expressed as a function of the distance from the focal variety. We also study the exceptional case of tubes about $\mathbb R\mathbf H^k$ in $\mathbb C\mathbf H^k$, which are isoparametric, but cannot be obtained as the level sets of any function in our classification. We show that these tubes are level sets of a polynomial function divided by $t^2$, and that analogous functions on Damek-Ricci spaces can be isoparametric only in the case of $\mathbb C\mathbf H^k$.

comments
We corrected the statement and proof of Lemma 3.4 appearing in version 2, which necessitated a slight modification of part (i) of the Main Theorem. We also added a new lemma (Lemma 3.2) to establish the revised statement of part (i) of the Main Theorem
fields
Differential Geometry
pdf ↗ page arXiv:2505.10608 ↗

This paper studies nonlinear elliptic equations involving the operator $-Δ_{\mathbb{B}^N} + (-Δ_{\mathbb{B}^N})^s-λ$ on the hyperbolic space $\mathbb{B}^N$, where $0 < s < 1$ and $λ<\frac{(N-1)^2}{4}$. We prove that the best Sobolev constant of this mixed local-nonlocal operator equals the Euclidean Sobolev constant $S$ and is never attained, whereas the corresponding purely local constant may lie strictly below $S$. As a consequence, the purely critical problem has no ground state and no nontrivial solution of small $L^{2^*}$ norm. For the subcritical problem, and for the critical problem with a subcritical perturbation $μ|u|^{p-1}u$, we obtain nonnegative radial solutions by variational methods, depending on $p$ and $μ$. Along the way, we prove the continuous embedding $H^1(\mathbb{B}^N)\hookrightarrow H^s(\mathbb{B}^N)$ and the equivalence of the spectral and the pointwise definitions of $(-Δ_{\mathbb{B}^N})^s$.

comments
v3: substantially revised and retitled. We prove that the best Sobolev constant of the mixed operator equals the Euclidean one and is never attained, deduce nonexistence results for the purely critical problem, verify the compactness condition for the perturbed problem, giving nonnegative radial solutions, and prove the equivalence of the spectral and pointwise fractional Laplacians
fields
Analysis of PDEs
pdf ↗ page arXiv:2505.12936 ↗

In this work we study the existence of solutions to the Mean Curvature Flow for which the initial condition has the structure of a two-dimensional Lie subgroup within a Lie group of dimension three. We consider Lie groups with a fixed left-invariant metric and first observe that if the Lie group is unimodular, then every Lie subgroup is a minimal surface (hence a trivial solution). For this reason we focus on non-unimodular Lie groups, finding the evolution of every Lie subgroup of dimension 2 (within a 3 dimensional Lie group). These evolutions are self-similar for abelian subgroups (i.e. evolve by isometries), but not self-similar in the other cases.

comments
This is the final version
fields
Differential Geometry
pdf ↗ page arXiv:2505.17892 ↗

Our work establishes a three-term asymptotic expansion of the ground state energy of a dilute gas of spin $1/2$ fermions with repulsive short-range interactions, validating a formula predicted by Huang and Yang in 1957. The formula is universal in the sense that it holds for a large class of interaction potentials and depends on those only via their scattering length. We have recently proved an upper bound on the ground state energy of the desired form, and the present work completes the program by proving the matching lower bound.

comments
Final version to appear in Inventiones Mathematicae
fields
Mathematical Physics
pdf ↗ page arXiv:2505.22340 ↗

Maximum distance separable (MDS), almost MDS (AMDS), and self-dual codes have applications in communications, data storage, and quantum coding. The construction and structural study of MDS codes that are not equivalent to generalized Reed-Solomon (GRS) codes are important problems in coding theory and finite geometry. In this paper, we investigate the generalized Roth-Lempel (GRL) codes \(GRL_k(α, v, A_{3\times 3})\) introduced by Li et al. [28] in the case of a \(3\times 3\) appended matrix. Using the Cauchy matrix method of Roth and Lempel, we derive a sufficient condition under which these codes are not equivalent to GRS codes. We also establish necessary and sufficient conditions for their duals to be AMDS and for the codes to be self-dual. The self-duality criterion extends the corresponding result in [28], and we provide examples illustrating our results. Under suitable parameter assumptions and an explicit rank condition, we show that the Schur square of an \([n, k]_q\) GRL code \(GRL_k(α, v, A_{3\times 3})\) has dimension \(2k + 2\). Using this invariant, we show that, under certain conditions, these GRL codes are not equivalent to codes from several known non-GRS families.

comments
21 pages
fields
Information Theory
pdf ↗ page arXiv:2506.03874 ↗

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, then we 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 yields byproducts of independent interest, including approximation results for smoothing of maximum functions subdifferentials and empirical lower bounds for dual solutions of Wasserstein distributionally robust optimization.

fields
Optimization and Control
pdf ↗ page arXiv:2506.04948 ↗

We investigate the existence of energy minimizing $n$-harmonic maps from an $n$-dimensional sphere to a compact manifold inside a prescribed homotopy class. Our results are of two kinds. First, inspired by the work by T. Rivière (1998) on minimizing 3-harmonic maps from $\mathbb{S}^{3}$ to $\mathbb{S}^{2}$ with given Hopf degree and by the work of R. Hardt and T. Rivière (2008) on critical and optimal Sobolev exponents for rational homotopy classes, we exhibit a general principle that guarantees the existence of infinitely many homotopy classes with a minimizing map inside. We apply this principle, each time proving the optimality of the relevant Sobolev exponents, to mappings from $\mathbb{S}^{4n-1}$ to $\mathbb{S}^{2n}$, where the relevant homotopical quantity is the Hopf invariant, and to mappings from $\mathbb{S}^{2n+1}$ to $\mathbb{CP}^{n}$, where homotopy classes are generated by the circle bundle on the projective space. These results hold for first-order as well as for fractional Sobolev mappings. Second, elaborating on the recent preprint of Wang G. and Zhang M. (2026), we derive sharp lower energy bounds for mappings with given Hopf invariant. We apply these bounds to deduce a sufficient energetic condition for the existence of minimizing maps in a given homotopy class. Finally, we exploit this condition, by explicit construction of mappings satisfying it, to prove the existence of energy minimizers from $\mathbb{S}^{3}$ to $\mathbb{S}^{2}$ of Hopf degree $d \in \{\pm2,\pm3,\dotsc,\pm6\}$ and from $\mathbb{S}^{7}$ to $\mathbb{S}^{4}$ of Hopf degree $\pm1$.

comments
48 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2506.05060 ↗

In 1949, L. Onsager conjectured that weak solutions of the Euler equations in $C_{t,x}^γ$ are energy conservative when $γ>\frac{1}{3}$, whereas nonconservative solutions exist when $γ<\frac{1}{3}$. Constantin, E and Titi [13] proved the conservation part, while Isett [26] constructed nontrivial $C^γ_{t,x}$ weak solutions with compact support in time in three dimensions for each $0<γ<\frac{1}{3}$. Building on this breakthrough work, Buckmaster, De Lellis, Székelyhidi Jr. and Vicol [7] obtained strictly dissipative solutions below the Onsager threshold. In two dimensions, Giri and Radu [23] first constructed a nontrivial weak solution in $C^{\frac{1}{3}-}(\mathbb T^2\times[0,T])$ and left an open problem whether it would be possible to construct dissipative solutions (controllable energy) below $\frac{1}{3}$ threshold. In this paper, we reslove this question and thereby obtain infinitely many strictly dissipative weak solutions in $C^γ(\mathbb T^2\times[0,T])$ for every $0<γ<\frac{1}{3}$. Moreover, we prove that the associated wild initial data are dense in the divergence-free subspace of $C^{γ'}(\mathbb{T}^2)$ for any $0<γ' <\frac{1}{3}$. The key new ingredient is a family of staircase traveling waves, which we combine with a Picard iteration coupled to the Newton–Nash scheme to control both the Reynolds stress and the kinetic energy. The construction also applies in every dimension $d\geq2$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2506.15396 ↗

For $N \in\mathbb Z_{\geq 7}$ we show that the simple minimal $\mathcal{W}$-algebra of $\mathfrak{so}_N$ at level minus one is isomorphic to the even subalgebra of the tensor product of the simple affine vertex superalgebra of $\mathfrak{osp}_{1|2}$ at level $\frac{N-6}{2}$ with $N-4$ free fermions. In particular when $N$ is even this minimal $\mathcal{W}$-algebra is strongly rational as conjectured by Arakawa-Moreau.

comments
14 pages, v2 is to appear in Bulletin of the London Mathematical Society
fields
Representation Theory, Quantum Algebra
pdf ↗ page arXiv:2506.15605 ↗

This paper investigates iterative methods for solving bilevel optimization problems where both inner and outer functions have a composite structure. We establish novel theoretical results, including the first analysis that provides simultaneous convergence rates for the Iteratively REgularized Proximal Gradient (IRE-PG) method, a variant of Solodov's algorithm. These rates for the inner and outer functions highlight the inherent trade-offs between their respective convergence behaviors. We further extend this analysis to an accelerated version of IRE-PG, proving faster convergence rates under specific settings. Additionally, we propose a new scheme for handling cases where these methods cannot be directly applied to the bilevel problem due to the difficulty of computing the associated proximal operator. This scheme offers surrogate functions to approximate the original problem and a framework to translate convergence rates between the surrogate and original functions. Our results show that the accelerated method's advantage diminishes under this translation.

comments
This version corrects constants in the backtracking step-size case of Theorems 2 and 4, the range of the backtracking parameter, and minor errors in proofs of the published version
journal
SIAM J. Optim. 36(2):1043-1074, 2026
fields
Optimization and Control
pdf ↗ page arXiv:2506.16382 ↗

We develop a feedback controller that minimizes the observability of a set of adversarial sensors of a linear system, while adhering to strict closed-loop performance constraints. We quantify the effectiveness of adversarial sensors using the trace of their observability Gramian and its inverse, capturing both average observability and the least observable state directions of the system. We derive theoretical lower bounds on these metrics under performance constraints, characterizing the fundamental limits of observability reduction as a function of the performance trade-off. Finally, we show that the performance-constrained optimization of the Gramian's trace can be formulated as a one-shot semidefinite program, while we address the optimization of its inverse through sequential semidefinite programming. Aircraft and satellite simulations demonstrate that the proposed controllers reduce adversarial observability while maintaining near-optimal performance.

comments
8 pages, 4 Figures
fields
Optimization and Control
pdf ↗ page arXiv:2506.19829 ↗

In this paper, we propose a method for computing eigenvalues of elliptic problems using Deep Learning techniques. A key feature of our approach is that it is independent of the space dimension and can compute arbitrary eigenvalues without requiring the prior computation of lower ones. Moreover, the method can be easily adapted to handle nonlinear eigenvalue problems.

fields
Numerical Analysis, Analysis of PDEs
pdf ↗ page arXiv:2507.03126 ↗

We introduce the exponentially fading memory (EFM) signature, a time-invariant transformation of an infinite (possibly rough) path that serves as a mean-reverting analogue of the classical path signature. We construct the EFM-signature via rough path theory, carefully adapted to accommodate improper integration from minus infinity. The EFM-signature retains many of the key algebraic and analytical properties of classical signatures, including a suitably modified Chen identity, the linearization property, path-determinacy, and the universal approximation property. From the probabilistic perspective, the EFM-signature provides a "stationarized" representation, making it particularly well-suited for time-series analysis and signal processing overcoming the shortcomings of the standard signature. In particular, the EFM-signature of time-augmented Brownian motion evolves as a group-valued Ornstein-Uhlenbeck process. We establish its stationarity, Markov property, and exponential ergodicity in the Wasserstein distance, and we derive an explicit formula à la Fawcett for its expected value in terms of Magnus expansions. We also study linear combinations of EFM-signature elements and the computation of associated characteristic functions in terms of a mean-reverting infinite dimensional Riccati equation.

fields
Probability
pdf ↗ page arXiv:2507.03700 ↗

In this paper, we construct integrable self-adaptive moving mesh schemes for multi-component modified short pulse and short pulse equations under periodic and one-end Dirichlet boundary conditions with nonzero boundary values by using the consistency condition with the hodograph transformation. The essential point is that the edge point $x_{0}$ of the hodograph transformation cannot be kept fixed when the boundary value is nonzero. We derive the evolution equation for $x_{0}$ and incorporate it into the semi-discrete moving mesh scheme. Under periodic boundary conditions, the resulting schemes involve an algebraic constraint corresponding to the integral condition of the continuous periodic problem, whereas under one-end Dirichlet boundary conditions they form ordinary differential systems. We also derive multi-soliton solutions in Pfaffian form for the proposed schemes, preserving the integrable structure at the semi-discrete level. Numerical simulations under periodic and one-end Dirichlet boundary conditions demonstrate that the proposed schemes achieve high accuracy even in regions with rapid variation, including the passage of solitons through the computational boundary, and remain stable throughout the simulated time interval.

comments
61 pages, 96 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2507.03880 ↗

This article generalizes the result of Burns et al (2022), to find an algorithm to find some elements generating a full-rank subgroup of the torsion-free part of Bloch group of a certain CM number field, and compute the rank of it.

fields
Number Theory, K-Theory and Homology
pdf ↗ page arXiv:2507.05792 ↗

Characterizing and calibrating physical qubits is essential for maintaining the performance of quantum processors. A key challenge in this process is the presence of crosstalk that complicates the estimation of individual qubit detunings. In this work, we derive optimal strategies for estimating detuning and crosstalk parameters by optimizing Ramsey interference experiments using Fisher information and the Cramer-Rao bound. We compare several calibration protocols, including measurements of a single quadrature at multiple times and of two quadratures at a single time, for a fixed number of total measurements. Our results predict that the latter approach yields the highest precision and robustness in both cases of isolated and coupled qubits. We validate experimentally our approach using a single NV center as well as superconducting transmons. Our approach enables accurate parameter extraction with significantly fewer measurements, resulting in up to a 50% reduction in calibration time while maintaining estimation accuracy.

fields
Mathematical Physics
pdf ↗ page arXiv:2507.10661 ↗

For every fixed positive integer $n$, we prove that it is undecidable whether a single noncommutative polynomial equation with scalar integer coefficients has a solution in $M_n(\mathbb N)$ or in $M_n(\mathbb Z)$. An integral range calculation for central polynomials yields a common reduction from integer Diophantine equations; the single-equation and finite-system problems are computably enumerable complete. The same polynomials have exact range $\mathbb Q I_n$ on rational, even nonnegative rational, arguments. Consequently, the single-equation and finite-system problems over $M_n(\mathbb Q)$ are computably many-one equivalent to Hilbert's tenth problem over $\mathbb Q$, unconditionally. The rational undecidability claims reported in 2026 by OpenAI and Zhi-Wei Sun imply rational-matrix undecidability, with at most $86$, $87$, and $88$ matrix variables in dimensions $1$, $2$, and at least $3$, respectively. An explicit Diophantine definition of $\mathbb Z$ in $\mathbb Q$ reported by the project coordinated by Elliot Glazer further gives completeness among computably enumerable problems. These consequences of recent arithmetic claims are stated conditionally.

fields
Logic, Number Theory
pdf ↗ page arXiv:2507.15265 ↗

Scaled Relative Graphs (SRGs) provide a novel graphical frequency-domain method for the analysis of nonlinear systems. However, existing SRG-based methods are limited to stable open-loop dynamics and can lead to false conclusions when applied to unstable Linear and Time-Invariant (LTI) components. In this paper, we identify the source of this pitfall and resolve it by introducing the extended SRG, which augments the SRG of an LTI system with the encirclement information of the Nyquist criterion. We show how the extended SRG can be used for stability and $H_\infty$-performance analysis of LTI systems and the computation of SRGs for unstable LTI systems. Building on these results, we derive graphical stability and incremental $L_2$-gain conditions for three canonical nonlinear feedback interconnections: the Lur'e system, the controlled Lur'e system, and an LTI plant with Lur'e controller. As a corollary, we derive a user-friendly generalized circle criterion that relates the $L_2$-gain directly to separation between the Nyquist curve and the critical disk from the classical circle criterion, requiring SRGs only for the proof, not its statement. The proposed approach is validated on several examples involving unstable LTI dynamics and nonlinearities, demonstrating applicability beyond the capabilities of existing SRG methods.

comments
Revised version of the paper previously titled "Scaled Relative Graph Analysis of General Interconnections of SISO Nonlinear Systems"
fields
Optimization and Control
pdf ↗ page arXiv:2507.15564 ↗

We provide a topological characterization of quivers whose path algebra satisfies a polynomial identity. This class includes the oriented cycle and acyclic quivers and, in the latter case, we describe the associated T-ideal. We introduce a generalization of Arnold's A-graded algebras, which we call locally A-graded algebras, and prove that they are also PI. We give an example of a quiver algebra satisfying a polynomial identity, even if the path algebra of the quiver does not.

comments
14 pages. Revised exposition with clarified definitions of paths and cycles and additional examples. Corrected the hypothesis of Proposition 4.3, revised Remark 5.2, and clarified the proof of Lemma 6.3 and the statement of Theorem 8.1. Minor corrections throughout and updated references. Main results unchanged
fields
Representation Theory, Combinatorics, Rings and Algebras
pdf ↗ page arXiv:2508.00662 ↗

This paper extends the weak solution theory for the 3D Navier-Stokes equations of Barker, Seregin and Sverak from a critical setting to a supercritical setting making sure to include a useful a priori energy bound as well as a statement about stability under weak-star convergence. Two applications of the a priori bound are then explored. The first provides a spatially local, short-time asymptotic expansion in the time variable starting at $t=0$ which, as a corollary, provides an upper bound on how fast hypothetical non-unique solutions to the Navier-Stokes equations can separate locally. The second establishes higher-order time regularity at a singular time and at spatial points positioned away from the singularity. This quantifies the degree to which the non-local nature of the pressure allows a far flung singularity to disrupt the time regularity at a regular point.

comments
45 pages. Fixed an error and addressed a gap
fields
Analysis of PDEs
pdf ↗ page arXiv:2508.00714 ↗

This paper is a sequel to arXiv:2310.0638. Let G be a split reductive group. We define the parabolic semi-infinite category on the Ran version of the affine Grassmanian Gr_{G,Ran}. We study the semi-infinite parabolic IC-sheaf in this category. We provide several descriptions of this object, one as certain colimit, another as an intermediate extension in certain category. We relate the global and local semi-infinite categories of sheaves. We also relate the intersection cohomology sheaf of the Drinfeld compactification of Bun_P with the semi-infinite parabolic IC-sheaf.

comments
129p, v3: minor corrections in Section 3 and Lemma 4.1.18
fields
Representation Theory
pdf ↗ page arXiv:2508.01527 ↗

This paper studies sparse elliptic random matrix models which generalize both the classical elliptic ensembles and sparse i.i.d. matrix models by incorporating correlated entries and a tunable sparsity parameter $p_n$. Each $n\times n$ matrix $X_n$ is formed by entry-wise multiplication of an elliptic random matrix by an elliptic matrix of Bernoulli($p_n$) variables, where $np_n$ tends to infinity at a sufficient rate, allowing for interpolation between dense and sparse regimes. The main result establishes that after appropriate normalization, the empirical spectral measures of these matrices converge weakly in probability to the uniform measure on a rotated ellipsoid in the complex plane as the dimension $n$ tends to infinity. Interestingly, the shape of the limiting ellipsoid depends not only on the mirrored entry-wise correlation structure, but also non-trivially on the sparsity limit $p=\lim\limits_{n\to\infty}p_n$.

comments
72 pages, 4 figures. Updated and corrected main result and least singular value bound
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2508.04891 ↗

We study $L^2$ to $L^p$ operator norms of spectral projectors for the Euclidean Laplacian on the torus in the case where the spectral window is narrow. With a window of constant size this is a classical result of Sogge; in the small-window limit we are left with $L^p$ norms of eigenfunctions of the Laplacian, as considered for instance by Bourgain. For the three-dimensional torus we prove new cases of a previous conjecture of the first two authors concerning the size of these norms; we also refine certain prior results to remove $ε$-losses in all dimensions. We use methods from number theory: the geometry of numbers, the circle method and exponential sum bounds due to Guo. We complement these techniques with height splitting and a bilinear argument to prove sharp results. We exposit on the various techniques used and their limitations.

comments
Final version, published by Ars Inveniendi Analytica
journal
Ars Inveniendi Analytica (2026), Paper No. 6, 49 pp
fields
Analysis of PDEs, Classical Analysis and ODEs
pdf ↗ page arXiv:2508.05573 ↗

For an exact symplectic manifold $M$ and a Legendrian submanifold $Λ$ of the contactification $M\times \mathbb{R}$, we construct the augmentation category (over a field of characteristic 2), a unital $A_\infty$-category whose objects are augmentations of the Chekanov-Eliashberg differential graded algebra. This extends the construction of the augmentation category by Ng-Rutherford-Shende-Sivek-Zaslow to contact manifolds of dimension greater than 3.

comments
25 pages. v5: corrected an error in the proof of invariance, and some typos. Final version, to appear in Journal of Symplectic Geometry
fields
Symplectic Geometry
pdf ↗ page arXiv:2508.06822 ↗

We present new upper and lower bounds on the minimum distance of certain generalized bicycle (GB) codes that go beyond the capabilities of techniques based on classical codes. These bounds are shown to capture the true minimum distance for specific subclasses within the GB family. In particular, we demonstrate the existence of two highly degenerate GB code families with parameters $[\![d^2+1,2,d]\!]_2$ for odd $d \geq 3$ and $[\![d^2,2,d]\!]_2$ for even $d \geq 4$, both having qubit connectivity of four, similar to that of surface codes. For the odd-distance family, we analyze the structure of low-weight logical Pauli operators and establish the existence of a fault-tolerant logical CNOT gate between the two logical qubits, achievable via a simple relabeling of data qubits. Next, using nearly self-inverse polynomials, we extend our results to construct an infinite class of connectivity-six GB codes with an improved rate. For GB codes based on these polynomials, we further present a technique to realize transversal logical CNOT gates via data-qubit permutations. We further construct syndrome extraction schemes for our connectivity four GB families that avoid reductions in minimum distance due to circuit-level faults propagating from check qubits to data qubits. Finally, we numerically evaluate the logical error rate performance of the mentioned connectivity four families of GB codes under circuit-level noise, obtaining thresholds comparable to those of rotated surface codes.

fields
Information Theory
pdf ↗ page arXiv:2508.09082 ↗

The sum formula for $q$-multiple zeta values is a well-known relation. In this paper, we present its generalization for the $q$-multiple zeta function.

fields
Number Theory
pdf ↗ page arXiv:2508.13254 ↗

Webs are graphical objects that give a tangible, combinatorial way to compute and classify tensor invariants. Recently, Gaetz, Pechenik, Pfannerer, Striker, and Swanson found a rotation-invariant web basis for $\mathrm{SL}_4$, as well as its quantum deformation $U_q(\mathfrak{sl}_4)$, and a bijection between move equivalence classes of $U_q(\mathfrak{sl}_4)$-webs and fluctuating tableaux such that web rotation corresponds to tableau promotion. They also found a bijection between the set of plane partitions in an $a\times b\times c$ box and a benzene move equivalence class of $U_q(\mathfrak{sl}_4)$-webs by determining the corresponding oscillating tableau. In this paper, we similarly find the oscillating tableaux corresponding to plane partitions in certain symmetry classes. We furthermore give a combinatorial map, defined on the span of the invariants of webs arising from certain symmetry classes, from $U_q(\sl_4)$ invariants to $U_q(\mathfrak{sl}_r)$ invariants for $r=2,3$.

fields
Combinatorics
pdf ↗ page arXiv:2508.16565 ↗

The joint use of graph structure and node-specific information is central to transductive node classification, yet a fundamental theoretical question remains: when does graph structure actually help? We provide the first deterministic, non-asymptotic, distribution-free answer to this question. We build on nuclear-norm graph clustering and generalized convex clustering. Our formulation of the latter incorporates node features, partial labels, and general convex loss functions, making it suitable for transductive node classification. We analyze each problem separately to characterize when graph structure alone, or node information alone, is sufficient for perfect recovery. We then formulate a unified convex optimization problem through a shared atomic norm representation and prove that combining the two sources expands the range of conditions under which perfect recovery is guaranteed beyond what either source alone can certify. This shows when node information can improve clustering and graph structure can improve classification.

comments
Accepted at NeurIPS 2026
fields
Optimization and Control
pdf ↗ page arXiv:2508.20231 ↗

We formalize in the Lean proof assistant the three papers on algebraic magnetism published in Semigroup Forum: "Algebraic magnetism", "Algebraic magnetism invariants of self-actions of diagonalizable monoid schemes" and "Algebraic magnetism: $X$-products of attractors via $\mathbb{F}_1$-geometry". We also prove further results and comment on the relation with other work in the literature. The description of this formalization and of these results forms in itself a survey of the theory, from the perspective opened by the formalization. The first main mathematical contribution consists of a Bialynicki-Birula decomposition for faces and of proofs of the existence of strongly fixed-point-reflecting atlases, of the finiteness of pure magnets and of the vanishing of the higher monoid cohomology of $\mathrm{A}(M)$ with quasi-coherent coefficients, three conjectures of "Algebraic magnetism". The case of algebraic stacks, where the analogue of the existence of fixed-point-reflecting atlases fails, is treated in joint work with Sylvain Brochard, in which the finiteness of pure magnets was first proved privately, by a comparable method. The second main contribution, for split reductive groups, is a description of the pure magnets and of the join-irreducible ones: besides the classical roots, they are the join-irreducible pure magnets equal to $(1-w)M$ for some $w$ in the Weyl group, which encode the components of attractors; a prime $p$ is a torsion prime of the group, in the sense of Steinberg, if and only if some join-irreducible Weyl magnet $(1-w)M$ has $w$ of $p$-power order.

comments
Supersedes the previous version
fields
Algebraic Geometry
pdf ↗ page arXiv:2509.04274 ↗

Quantum molecular dynamics (QMD) provides a high-fidelity physical framework for modeling atomic and molecular phenomena from first principles. However, its mathematical formulation requires solving iterative, high-dimensional electronic structure problems at every physical state step. Within the broader data-driven computational mechanics paradigm, we present a projection-based model order reduction framework for electronic structure calculation in QMD. By discovering a low-dimensional manifold of the electronic solution space within Kohn-Sham density functional theory, our approach projects the governing variational formulation onto an intrinsically reduced subspace. This avoids full-space iterative wavefunction optimization while preserving rigorous physical symmetries and state consistency. We demonstrate this methodology on a water molecule, demonstrating strong agreement with high-fidelity reference solutions across structural trajectories and thermodynamic observables through canonical coordinate alignment and structured manifold sampling.

fields
Numerical Analysis
pdf ↗ page arXiv:2509.07340 ↗

This paper proposes a new importance sampling (IS) method tailored to quasi-Monte Carlo (QMC) integration over $\mathbb{R}^s$. IS introduces a multiplicative weight that compensates for sampling from a proposal distribution rather than the target distribution. An unsuitable proposal, however, can yield an integrand that exhibits severe boundary growth and suffers from the curse of dimensionality, thus degrading QMC performance. Our approach is to design a weight function with the desired regularity and then construct a transport map realizing it as an IS proposal, thereby obtaining a transformed integrand amenable to QMC integration. We provide a rigorous analysis based on Fourier coefficients and apply it to lattice rule integration. Under suitable conditions, the proposed estimator achieves a fast convergence rate independent of the dimension $s$, making it suitable for high-dimensional problems.

fields
Numerical Analysis
pdf ↗ page arXiv:2509.07509 ↗

We investigate the isotropic $L_p$ Minkowski problem in $\mathbb{R}^n$ for $p<-n$. We prove that a smooth strictly convex solution $K$ is the unit ball if the second non-zero eigenvalue of the Hilbert-Brunn-Minkowski operator satisfies $λ_2(-L_K)\ge\frac{-p-1}{n-1}$. We also derive a lower bound for $λ_2(-L_K)$ in terms of concentric inner and outer ellipsoids and give improved bounds for origin-centred and origin-symmetric bodies. Combined with a weighted centroid identity for the polar body, these estimates yield an explicit $\varepsilon_n>0$ for which the unit ball is the only solution when $-n-\varepsilon_n\le p<-n$.

comments
Updated version. 21 pages. All comments are welcome
fields
Differential Geometry, Analysis of PDEs, Metric Geometry
pdf ↗ page arXiv:2509.08588 ↗

We give a new proof that the opposite of Joyal's disk category $\mathcal{D}_n$ is Berger's wreath product category $Θ_n = Δ\wr\cdots\wrΔ$. Our techniques continue to apply when the simplex category $Δ$ is replaced by Connes' cyclic category $Λ$ and some other crossed simplicial groups.

fields
Category Theory
pdf ↗ page arXiv:2509.11423 ↗

We study the Brauer groups of affine surfaces that are complements of singular hyperplane sections of smooth cubic surfaces over a field $k$ of characteristic $0$. We determine the Brauer group over the algebraic closure as a Galois module for all the possible singular hyperplane sections. For the case when the hyperplane section is geometrically the union of three lines, we give explicit examples where transcendental elements of order $2$ and $3$ exist over $\mathbb{Q}$. We end with an explicit example of an integral Brauer–Manin obstruction to the Hasse principle given by an element of order~$3$ on an affine cubic surface with singular boundary.

fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2509.16042 ↗

Inverse reinforcement learning (IRL) seeks to recover a reward function from observed behavior, but rewards are typically only partially identified: many reward–value pairs can induce the same behavior policy. We study this problem in the maximum-entropy, or Gumbel-shock, model under a broad class of statewise affine normalization constraints, with anchor-action constraints as a special case. This leads to Generalized Policy-to-$Q$-to-Reward (GenPQR), a modular approach to normalized reward recovery based on policy estimation and $Q$-evaluation via the Bellman equation; both components can be instantiated with off-the-shelf classification and regression methods. We establish modular finite-sample guarantees under general function approximation, with separate terms for policy-estimation and $Q$-function estimation error. We also give explicit bounds for GenPQR with fitted $Q$-evaluation. In experiments, GenPQR improves on DeepPQR in reward recovery. Our guarantees extend beyond anchor actions, accommodate large action spaces, and are not tied to a specific neural-network architecture or training procedure.

comments
Accepted to NeurIPS 2026
fields
Optimization and Control
pdf ↗ page arXiv:2509.21172 ↗

For a one dimensional analytically unramified Cohen-Macaulay local ring $R$, the blowup algebra of the canonical ideal is a module finite birational extension. The conductor of this extension always contains the conductor of $R$. We study the case when there is equality. This is the case where $R$ is far from being almost Gorenstein. We characterise such rings among Arf domains and numerical semigroup rings. As an application, we compute the cohomology annihilator ideal of an explicit family of rings and show it to be equal to the conductor ideal.

comments
15 pages, comments are welcome. Major changes in v3 as the central theme of the article is now on annihilation of cohomology
fields
Commutative Algebra
pdf ↗ page arXiv:2509.22966 ↗

In this paper, by exploiting mean value properties of $s$-harmonic functions, we introduce some monotonicity formulas in the nonlocal setting. Our approach is purely nonlocal and does not rely on the extension technique. As a byproduct we also establish interior nonlocal gradient estimates and a nonlocal analogue of the Bochner identity.

fields
Analysis of PDEs
pdf ↗ page arXiv:2509.25891 ↗

It is well known that for fibered links in $\mathbb{S}^3$ being strongly quasipositive and supporting a tight contact structure are equivalent notions (arXiv:math/0509499). In this note we analyze the relation between these two properties for non fibered links. A non fibered link (together with an incompressible Seifert surface) induces a natural partial open book (arXiv:2509.09615). We prove that strongly quasipositive links induce tight contact structures. We also show that, in contrast to the fibered case, the converse is not true, giving examples of links that are not strongly quasipositive but support tight contact structures.

comments
9 pages, 2 figures. Comments welcome! v2: Version accepted by Journal of Knot Theory and its Ramifications
fields
Geometric Topology
pdf ↗ page arXiv:2509.26183 ↗

Fermat's principle is fully generalized to the case where a smooth interface separates two cone structures -- Lorentz-Finsler lightcones -- representing wave propagation in a potentially inhomogeneous, anisotropic, time-dependent and discontinuous medium. The interface, wave source and receiver are assumed to be a hypersurface, a submanifold and a curve in the spacetime, respectively, of any causal character. For a trajectory to fulfill Fermat's principle -- i.e., to be a critical point of the arrival time functional -- its direction must change at the interface, obeying a precise condition that generalizes Snell's law of refraction when the wave crosses the interface, or the law of reflection when it remains in a single medium. Both laws are analyzed in detail to establish the conditions ensuring the existence and uniqueness of refracted and reflected trajectories, and to determine whether they actually minimize the arrival time. Applications to Zermelo's navigation problem and the determination of geodesics in discretized spacetimes are also emphasized.

comments
Slight reformulation of the Appendix to increase its generality. This version now matches the published version. 51 pages, 11 figures
journal
Nonlinear Analysis 276 (2027), 114322
fields
Differential Geometry, Mathematical Physics
pdf ↗ page arXiv:2509.26492 ↗

Monod proved that any continuous cohomology class of a semisimple Lie group $G$ can be represented by a measurable cocycle on the associated Furstenberg boundary, which we upgraded to an alternating cocycle. In the current paper we improve that result by showing that we can actually take a representing cocycle which is continuous on an explicit subset of generic tuples. We give an analogous result in the case of bounded cohomology. Finally, we exploit this characterization to prove the injectivity of the comparison map in degree $3$ for $\mathrm{Isom}^\circ(\mathbb{H}_{\mathbb{C}}^n)$, when $n \geq 2$, and in degree $4$ for $\mathrm{Isom}^\circ(\mathbb{H}^n_{\mathbb{R}})$, when $n \geq 2$.

comments
20 pages
fields
Group Theory
pdf ↗ page arXiv:2510.05333 ↗

Light-emitting reconfigurable intelligent surfaces (LeRISs) have recently emerged as a promising solution for providing the spatial awareness required for reliable millimeter-wave (mmWave) communication in programmable wireless environments (PWEs). However, existing LeRIS designs rely on the diffuse emission of light-emitting diodes, while LiDAR-assisted solutions require dedicated sensing modules that hinder their direct integration into RIS panels. In this paper, a vertical-cavity surface-emitting laser (VCSEL)-based LeRIS framework is developed to jointly support user localization, obstacle-aware mapping, and mmWave communication. Specifically, the narrow Gaussian beams and multimode operation of VCSELs are exploited to derive closed-form schemes for the joint recovery of the user position and orientation from received signal strength measurements. According to the provided simulation results, is shown that five VCSELs are sufficient for unique recovery, while this requirement is reduced to three dual-mode VCSELs under specific geometric conditions. Furthermore, the position error bound (PEB) is derived to characterize the achievable localization accuracy, while reflected-signal time-of-arrival measurements are employed to identify obstructed links and enable blockage-resilient LeRIS routing. As a result, the proposed framework achieves cm-level localization accuracy, reliable obstacle detection, and substantial spectral-efficiency and minimum-user-rate gains, thereby establishing VCSEL-based LeRISs as a solution for spatially aware and resilient PWEs.

fields
Information Theory
pdf ↗ page arXiv:2510.08071 ↗

Large reasoning models (LRMs) have achieved remarkable progress in complex problem-solving tasks. Despite this success, LRMs typically suffer from high computational costs during deployment, highlighting a need for efficient inference. A practical direction is to switch the LRM between thinking and non-thinking modes dynamically. However, such approaches often introduce additional reasoning errors and lack statistical guarantees for the performance loss, which are critical for high-stakes applications. In this work, we propose Probably Approximately Correct (PAC) Reasoning that controls the performance loss under the user-specified tolerance. Specifically, we construct an upper confidence bound on the performance loss and determine a threshold for switching to the non-thinking model. Theoretically, using the threshold to switch between the thinking and non-thinking modes ensures bounded performance loss in a distribution-free manner. Our experiments on reasoning benchmarks show that the proposed method can save computational budgets and control the user-specified performance loss.

comments
Accepted at NeurIPS 2026 (poster). Camera-ready version
fields
Statistics Theory
pdf ↗ page arXiv:2510.09133 ↗

The numerical approximation of the Boltzmann collision operator presents significant challenges because of its high dimensionality, quadratic nonlinearity, and nonlocal integral structure. In this work, we develop a Fourier Neural Operator (FNO)-based framework for learning finite time evolution operators associated with the spatially homogeneous Boltzmann equation and its simplified BGK model in different velocity space dimensions. The framework learns mappings between distribution functions in either sequence-to-sequence or point-to-point form and, once trained, enables rapid evaluation without repeated classical time evolution. To improve physical consistency, we introduce a conservative FNO (C-FNO) by augmenting the training loss with soft penalties for deviations in mass, momentum, and energy from the conservation law. Several numerical experiments are presented to demonstrate that the learned operators accurately reproduce the principal collision dynamics, while C-FNO generally reduces macroscopic drift relative to the standard FNO, highlighting its potential as a promising framework for physics-constrained operator learning in kinetic theory and other nonlinear integro-differential equations.

comments
Updated version accepted by J. Comput. Appl. Math
fields
Numerical Analysis
pdf ↗ page arXiv:2510.13047 ↗

We construct a covariant realization functor $\mathrm{Solid}^m(-)$ from the category of motives with modulus to the derived category of solid modules in the sense of Clausen-Scholze. For a smooth modulus pair $(X,D)$, the dual of $\mathrm{Solid}^m(X,D)$ recovers the Kelly-Miyazaki Hodge realization of $(X,D)$. Let $X$ be a smooth proper variety over a field, let $D\subset X$ be an effective Cartier divisor whose support has simple normal crossings, and let $U\subset X$ be an open subscheme. We compute $\mathrm{Solid}^m(\mathrm{Cone}(\underline{M}(U,D|_U)\to\underline{M}(X,D)))$ explicitly in terms of the formal completion along $X\setminus U$ of a model of $X$ of finite type over $\mathbb{Z}$.

comments
17 pages. v3 replaces the withdrawn v2. Section 4 is rewritten and no longer uses a global form of Ren's pro-solid comparison theorem: the needed statement for perfect complexes on schemes of finite type over Z is proved directly (Prop. 4.1), and the results over a field are obtained by base change from such a model. The formulas over a field in v1 do not hold in general (Rem. 4.3)
fields
Algebraic Geometry
pdf ↗ page arXiv:2510.13596 ↗

Given any vertex operator algebra $ V $ with an automorphism $ g $, we derive a Jacobi identity for an intertwining operator $ \mathcal{Y} $ of type $ \left( \begin{smallmatrix} W_3\\ W_1 \, W_2 \end{smallmatrix}\right) $ when $ W_1 $ is an untwisted $ V $-module, and $ W_2 $ and $ W_3 $ are $ g $-twisted $ V $-modules. We say such an intertwining operator is of $\left(\!\begin{smallmatrix} g\\ 1 \ g \end{smallmatrix}\!\right)$-type. Using the Jacobi identity, we obtain homogeneous linear differential equations satisfied by the multi-series $ \langle w_0, \mathcal{Y}_1(w_1,z_1) \cdots \mathcal{Y}_N(w_N,z_N) w_{N+1} \rangle $ when $ \mathcal{Y}_j $ are of $\left(\!\begin{smallmatrix} g\\ 1 \ g \end{smallmatrix}\!\right)$-type and the modules are $ C_1 $-cofinite and discretely graded. In the special case that $ V $ is an affine vertex operator algebra, we derive the ``twisted KZ equations" and show that its solutions have regular singularities at certain prescribed points when $ g $ has finite order. When $ V $ is general and $ g $ has finite order, we use the theory of regular singular points to prove that the multi-series $ \langle w_0, \mathcal{Y}_1(w_1,z_1) \cdots \mathcal{Y}_N(w_N,z_N) w_{N+1} \rangle $ converges absolutely to a multivalued analytic function when $ |z_1| > \cdots > |z_N| > 0 $ and analytically extends to the region $ z_i, z_i - z_j \neq 0 $. Furthermore, when $ N = 2 $, we show that these multivalued functions have regular singularities at certain prescribed points.

comments
49 pages, 1 figure. Minor corrections throughout. Changes made to Section 6 to clarify convergence result
fields
Quantum Algebra, Representation Theory
pdf ↗ page arXiv:2510.14860 ↗

Let $K$ be a non-archimedean local field and $\varphi : \mathbb{P}^1 \to \mathbb{P}^1$ a rational endomorphism of degree $d \geq 2$ over $K$. In the tame case ($p \nmid d$), we show that strict good reduction is equivalent to the existence of a nonempty Zariski open subset $U_k \subset \mathbb{P}^1_k \setminus \mathrm{PC}(\widetilde{\varphi})$ over which the canonical residual morphism is finite étale of degree $d$. The criterion separates two complementary local invariants of a normalized integral lift: $\mathrm{Res}(F,G)$ controls residual degree drop, while the fiber discriminants $\mathrm{Disc}(F_{n,x})$ control étaleness of the residual fibers once full residual degree is ensured. Consequently, for every finite $x \in \mathcal{O}_K$ with $\bar{x} \in U_k$, the extensions $K(X_n(x))/K$ are unramified for all $n \geq 1$. We introduce the orbital preimage tree $T_{O^+(x)} = \varinjlim_n X_\infty(\varphi^n(x))$, the colimit in $G_K$-sets along the forward orbit, and the orbital arboreal Galois image $\mathcal{G}_{O^+(x)} = \mathrm{Im}(G_K \to \mathrm{Aut}(T_{O^+(x)}))$. On the forward-invariant safe locus $U_k^{\mathrm{safe}} = \bigcap_{m \geq 0} \widetilde{\varphi}^{-m}(U_k)$, strict good reduction is captured by the bijectivity of the orbital reduction map $X_n(x_m) \to \widetilde{X}_n(\bar{x}_m)$. This canonical orbit-invariant framework connects with arboreal Galois representations (Boston-Jones, Jones, and others) and yields pointwise and orbit-level reformulations. Explicit examples over $\mathbb{Q}_p$ illustrate the criterion.

comments
v4: Incorporates corrections from the accompanying corrigendum (affine chart condition, orbital colimit description). 22 pages. Published in Res. Number Theory 12 (2026), article 60. doi:10.1007/s40993-026-00748-9
journal
Research in Number Theory 12 (2026), article 60
fields
Number Theory, Algebraic Geometry, Dynamical Systems, Group Theory
pdf ↗ page arXiv:2510.23097 ↗

We will focus on studying the ball measure of non-compactness $α(T)$ for various particular instances of embedding operators in sequence spaces. Our first main goal is to find necessary and sufficient conditions for an identity operator to be maximally non-compact. Next, we will focus on studying Lorentz sequence spaces $\ell^{p,q}$ and their basic properties. We will characterize the inclusions between Lorentz sequence spaces depending on the values of $p$ and $q$. Then we will try to determine exact values of the norms of the identity operators between these embedded spaces. Lastly, we will determine whether these identity operators are maximally non-compact by using our general theorems.

fields
Functional Analysis
pdf ↗ page arXiv:2510.24290 ↗

Let $\mathbb{F}_{q^n}$ be the finite field with $q^n$ elements. An element $α\in \mathbb{F}_{q^n}$ is $k$-normal over $\mathbb{F}_q$ if $α$ and its conjugates span an $\mathbb{F}_q$-subspace of dimension $n-k$. It is known that, for $q$ larger than a constant $c(n)$, a primitive $k$-normal element exists if and only if there exists a $k$-normal element free of binomials, but $c(n)$ is not explicit. We count the $k$-normal elements in affine subspaces of the form $β+\ker L_h$ and show that, when $h$ is an irreducible factor of the $\mathbb{F}_q$-order of $β$, all but at most one of them are $k$-normal. We also show that, when $β$ is free of binomials, these affine subspaces have degree $n$, so that character sum estimates over affine spaces apply to them. Combining these facts with a sieve, we make the equivalence above effective, with explicit lower bounds on $q$. As an application, we compute these bounds for $5\le n\le 8$ and give a complete characterization of the existence of primitive $k$-normal elements in $\mathbb{F}_{q^6}$ over $\mathbb{F}_q$.

comments
21 pages
fields
Number Theory
pdf ↗ page arXiv:2510.26972 ↗

We prove the existence of and classify basic $d$-tilting bundles consisting of line bundles on d-dimensional smooth toric Fano stacks of Picard number one or two. A $d$-tilting bundle is a tilting bundle whose endomorphism algebra has global dimension at most $d$. The classification is motivated by dimer models, where internal perfect matchings give rise to $2$-representation infinite algebras. The algebras of type $\widetilde{A}$ introduced by Herschend, Iyama and Oppermann are higher-dimensional analogues in the simplex case. The same principle leads to a new class of algebras of type $\widetilde{A}\widetilde{A}$. Upper sets provide a common framework for tilting bundles, toric non-commutative crepant resolutions (NCCRs), and cuts of higher-dimensional dimer-type quivers. In the Picard-number-one case, the bundles are in bijection with non-trivial upper sets in the Picard group, and their endomorphism algebras are precisely $d$-representation infinite algebras of type $\widetilde{A}$. In the Picard-number-two case, a first upper set determines the ambient toric NCCR, and a second selects an internal cut of its quiver. This gives a complete classification of such $d$-tilting bundles and realizes their endomorphism algebras precisely as $d$-representation infinite algebras of type $\widetilde{A}\widetilde{A}$. The resulting geometric models give a combinatorial description of $d$-APR tilting modules and show that both classes of algebras are closed under $d$-APR tilts.

comments
52 pages. Revised proofs and exposition, especially in Sections 4
fields
Algebraic Geometry, Rings and Algebras, Representation Theory
pdf ↗ page arXiv:2511.02641 ↗

Maximum distance separable (in short, MDS), near MDS (in short, NMDS), linear complementary dual codes (in short, LCD) and self-orthogonal codes play a pivotal role in algebraic coding theory, particularly in applications such as quantum communications and secret sharing schemes. Recently, the construction of non-generalized Reed-Solomon (in short, non-GRS) codes has emerged as a significant research frontier. This paper focuses on a class of $(\mathcal{L}, \mathcal{P})$-twisted generalized Reed-Solomon (TGRS) codes $\mathcal{C}_{k-1}\left(\boldsymbolα,\boldsymbol{v},\boldsymbolη\right)$ characterized by $\ell+1$ twists. By considering a special class of parity-check matrices derived from existing results, we derive the corresponding necessary and sufficient conditions or sufficient conditions for $\mathcal{C}_{k-1}\left(\boldsymbolα,\boldsymbol{v},\boldsymbolη\right)$ to be self-orthogonal, and then generalize the corresponding results given by Liu et al. (2021), Sui et al. (2021), and Zhang et al. (2025). As applications, leveraging these self-orthogonal structures, we can obtain several families of LCD MDS codes. Secondly, we provide a characterization of the NMDS property for the codes $\mathcal{C}_{k-1}\left(\boldsymbolα,\boldsymbol{v},\boldsymbolη\right)$, offering a partial solution to the open problem concerning general $(\mathcal{L}, \mathcal{P})$-TGRS codes posed by Hu et al. (2025). Finally, we rigorously prove that the codes $\mathcal{C}_{k-1}\left(\boldsymbolα,\boldsymbol{v},\boldsymbolη\right)$ are of non-GRS type when $2k > n>k+\ell+2$.

comments
31pages
fields
Information Theory
pdf ↗ page arXiv:2511.03398 ↗

We consider combinatorial multi-item markets and propose the notion of a $Δ$-regret Walrasian equilibrium, consisting of an allocation and item prices such that prices clear the market, the allocation is capacity-feasible, and the players' strategies lead to a total regret of at most $Δ$. Regret is the sum of the players' utility gaps relative to optimal bundles at the given prices. We derive a complete characterization for the existence of $Δ$-regret equilibria by introducing the concept of a parameterized social welfare problem, where only the capacity constraints binding at a prescribed allocation are retained. Our characterization then relates the achievable regret value to the associated duality/integrality gap of the parameterized social welfare problem at that allocation. For the special case of monotone valuations and upwards-closed strategy spaces this translates to regret bounds recovering the duality/integrality gap of the original social welfare problem. We also characterize weighted buyer and seller regret by configuration-LP gaps and establish a finite exact penalty enforcing market clearing. We further derive a slack-dependent price-adjustment bound whose uniform version is sharp for prescribed allocations. Finally, these structural results translate approximation algorithms for social welfare with guarantees relative to the configuration LP into algorithms computing low-regret Walrasian equilibria. We also derive lower bounds from integrality and duality gaps and computational complexity.

fields
Optimization and Control
pdf ↗ page arXiv:2511.09021 ↗

We present methods that provide all zeroes and extrema of a function that do not require differentiation. Using point process theory, we are able to describe the locations of zeroes or maxima, their number, as well as their distribution over a given window of observation. The algorithms in order to accomplish the theoretical development are also provided, and they are exemplified using many illustrative examples, for real and complex functions.

comments
Corrected the dominating measure to have both atomic and nonatomic parts. Fixed typos. Function extrema and zeroes; Optimization; Poisson point process; Random counting measures; Riemann's zeta function
fields
Optimization and Control
pdf ↗ page arXiv:2511.10293 ↗

In this paper, we study the necessary and sufficient conditions in the domain for Sobolev-type embedding of the space $W^{1,Φ(\cdot,\cdot)}(Ω)$ where $Φ(x,t):=t^{p(x)}+ a(x) t^{q(x)}\log^{r(x)}(e+t)$ with $1\leq p(x)\leq q(x).$ We have established subcritical embedding in bounded John domains under some regularity assumptions on exponents $p,$ $q,$ $r$, and $a$. Conversely, we have proved that if the embedding holds in any domain $Ω$ in $\mathbb{R}^n,$ then $Ω$ must satisfy the log-measure density condition.

fields
Functional Analysis
pdf ↗ page arXiv:2511.13286 ↗

We explain why on certain five-manifolds, topological 5d $\mathcal{N} = 2$ gauge theory of Haydys-Witten twist with gauge group $G$, is dual to that of Geyer-Mülsch twist with gauge group $^LG$, where $G$ is a real, compact Lie group with Langlands dual $^LG$. In turn, via their 2d and 3d gauged A/B-twisted Landau-Ginzburg model interpretations, we can show that (i) a Fukaya-Seidel-type $A_\infty$-1-category of an HW$_4$-instanton Floer homology of three-manifolds and (ii) a Fueter-type $A_\infty$-2-category of an HW$_3$-instanton Floer homology of two-manifolds, are dual to (i) an Orlov-type $A_\infty$-1-category of a novel holomorphic $^LG_{\mathbb{H}}$-flat Floer homology of three-manifolds and (ii) a Rozansky-Witten-type $A_\infty$-2-category of a novel holomorphic $^LG_{\mathbb{O}}$-flat Floer homology of two-manifolds, respectively. We also derive their Atiyah-Floer-type correspondences to symplectic categories. Our work, which demonstrates a mirror symmetry and Langlands duality of (higher) $A_\infty$-categories of Floer homologies, therefore furnishes purely physical proofs and gauge-theoretic generalizations of the mathematical conjectures by Bousseau [1] and Doan-Rezchikov [2], and more.

comments
78 pp. v4: Appendix added and further clarifications. Companion paper to [arXiv:2311.18302] and [arXiv:2412.20067]. Plenary talk at "International Congress of Basic Science 2025" and "Gauge Theory and String Geometry 2025". To appear in ATMP
fields
Algebraic Geometry, Differential Geometry, Geometric Topology, Symplectic Geometry
pdf ↗ page arXiv:2511.15953 ↗

Hierarchical Reinforcement Learning promises, among other benefits, to efficiently capture and utilize the temporal structure of a decision-making problem and to enhance transfer learning capabilities, but theoretical guarantees lag behind practice. In this paper, we propose a Feudal Q-learning scheme and investigate under which conditions its coupled updates converge and are stable. By leveraging the theory of Stochastic Approximation and the ODE method, we present a theorem stating the convergence and stability properties of Feudal Q-learning. This provides a principled convergence and stability analysis tailored to Feudal RL. Moreover, we show that the updates converge to a point that can be interpreted as an equilibrium of a suitably defined game, opening the door to game-theoretic approaches to Hierarchical RL. Lastly, experiments based on the Feudal Q-learning algorithm support the outcomes anticipated by theory.

journal
M. Manenti and A. Iannelli, Convergence and stability of Q-learning in Hierarchical Reinforcement Learning, Neurocomputing, vol. 710, p. 135319, 2027
fields
Optimization and Control
pdf ↗ page arXiv:2511.17351 ↗

We study the existence of polychromatic solutions of cubically nonlinear Maxwell equations in the whole space and with dispersive media, i.e., with a time delayed polarization. Due to the complex nature of the dielectric function, the frequencies are complex, resulting in a decay in time. The geometry is that of a waveguide in $x$ with the propagation direction being $y$ and the solutions are localized in $x$ and have a transverse magnetic polarization. These are often referred to as breathers. They are given as a Fourier series in $y$ and $t$ with the leading frequency $ω$ being an eigenvalue of a corresponding operator pencil on $\mathbb{R}$ (in the $x$ variable). Each term in the series corresponds to a different temporal decay rate or a different frequency. The series is constructed iteratively via a sequence of linear ordinary differential equations. Our general result provides the existence under some assumptions on the spectrum and on estimates of the resolvent of the corresponding linear operator. We also produce an example of a waveguide given by the interface of two spatially homogeneous physically relevant media for which these assumptions are satisfied. For such an interface setting the constructed solutions correspond to nonlinear polychromatic surface plasmons.

comments
41 pages, 6 figures; proof of Lemma 5.4 corrected (its statement has been slightly simplified); new assumption (B5) introduced; proofs of Lemma 5.3 and Lemma 5.5 improved slightly
fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2511.21467 ↗

We show that all self-maps of non-zero degree of $3$-manifolds not covered by $S^3$ and of Thurston geometric $4$-manifolds and their connected sums not diffeomorphic to $N\#(\#_{p\geq0}S^2\times S^2)\#(\#_{q\geq0}\mathbb C P^2)$, where $N$ is an $S^2\times\mathbb X^2$ or $S^3\times\mathbb R$ manifold, are $π_1$-injective. We thus determine when these maps induce $π_1$-isomorphisms. The results in dimension three were previously established by Shicheng Wang. We give a uniform group theoretic proof in all cases based only on the residual finiteness of the fundamental groups for the $π_1$-injectivity and then only on numerical invariants for the $π_1$-isomorphisms.

comments
14 pages; v2: final version, to appear in Manuscripta Mathematica
fields
Geometric Topology, Algebraic Topology, Group Theory
pdf ↗ page arXiv:2512.07238 ↗

In this paper, we discuss the validity of Liouville-type theorems involving the drifted Laplacian on complete, non-compact Riemannian manifolds endowed with a smooth vector field $X$. In particular, we prove new Liouville properties both for positive $X$-harmonic functions and for non-negative $X$-subharmonic functions which are in an $L^{p}$-space, $p\in(1,+\infty)$, with respect to any invariant measure for the operator. The main tool for the analysis is a local gradient estimate for positive solutions to the semilinear equation $Δ_{X}u=F(u)$, which is valid if $F$ satisfies certain structural conditions and the Bakry-Émery-Ricci curvature associated to $X$ is bounded below. On the one hand, this estimate is used in a novel way to deduce the Liouville property for positive solutions and, on the other hand, it is used to construct cut-off functions for the $X$-Laplacian that yields the $L^{p}$-Liouville results.

comments
30 pages. Added Section 5, concerning X-Laplacian cut-off functions and $L^p$-Liouville properties with respect to invariant measures. Substantial revisions to the Introduction. All comments are welcome!
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2512.07389 ↗

We consider the one-dimensional heat equation with a large, rapidly oscillating random potential, obtained by applying a polynomial of arbitrary Hermite rank to a stationary Gaussian process with long-range dependence. When the correlations decay slowly enough, the solution does not homogenise to a deterministic limit. We prove that it converges in law, as a random field, to a Feynman-Kac functional driven by a Hermite process, which is fractional Brownian motion for Hermite rank one and the Rosenblatt process for Hermite rank two. The proof rests on an identity which expresses the exponent of the Feynman-Kac formula as a continuous functional of the integrated potential, so that neither local times of fractional processes nor exponential moments with respect to the potential are needed. We also show that the limit has moments of every order for Hermite rank one, and for Hermite rank two with a negative second Hermite coefficient, whereas for a positive coefficient its mean is infinite, although it is finite almost surely. A numerical experiment illustrates the convergence of the integrated potential to the Rosenblatt law.

comments
v2: complete revision; extends the results to Hermite rank m >= 2; the results of v1 on rates of convergence, fluctuations and superdiffusion are withdrawn. 29 pages, 1 figure
fields
Probability
pdf ↗ page arXiv:2512.08496 ↗

We develop a projective-tensor-valued carré du champ for Malliavin-differentiable Banach-valued random elements and establish an associated integration-by-parts formula. The resulting dimension-free comparison principle bounds Gaussian approximation against twice Fréchet-differentiable test functions by the expected projective norm of a random covariance discrepancy. For processes on Skorokhod space equipped with the uniform norm, a smoothing argument converts this comparison into a quantitative bound in the bounded-Lipschitz metric, subject to explicit regularization errors. On Banach-valued Wiener chaos we express the carré du champ through contractions and obtain quantitative estimates in terms of contracted kernels. As a concrete application, we establish a quantitative functional Breuer–Major bound for the canonical polygonally interpolated partial-sum process, together with a corollary for the original Skorokhod step process. The estimate applies to the entire path in the uniform topology under explicit covariance conditions. We also record the trace-class specialization of the contraction bounds in Hilbert spaces.

fields
Probability, Functional Analysis
pdf ↗ page arXiv:2512.08919 ↗

In a separable Hilbert space, we study the minimization problem of a convex smooth function with Lipschitz continuous gradient whose evaluations are corrupted by random noise. To this end, we associate a stochastic inertial system that incorporates Tikhonov regularization with the optimization problem. We establish existence and uniqueness of a solution trajectory for this system. Then, we derive an upper bound on the expected value of an appropriate associated energy function given square-integrability of the diffusion $σ_X$ before focusing on the particular case where the parameter function multiplied by the Tikhonov term is given by $\frac{1}{t^r}$ for $0<r<2$. For this setting, we show a.s. convergence rates as well as convergence rates in expectation for the function values along the trajectory to an infimal value, the trajectory process to an optimal solution and its time derivative to zero under a stronger integrability condition on $σ_X$.

fields
Optimization and Control
pdf ↗ page arXiv:2512.15392 ↗

In this paper, we study the Integrated Communication and Control (ICAC) problem. Specifically, we investigate how messages can be transmitted from the controller/encoder to the observer/decoder through the control signal in Multiple-Input Multiple-Output (MIMO) vector-state Linear Quadratic Gaussian (LQG) systems under control constraints. We provide a computable capacity expression using semidefinite programming. We further show that it is possible to transmit data at a nonzero rate over an LQG system while maintaining the same optimal control cost as in the case where no information message are transmitted. Finally, we discuss how this framework generalizes communication over MIMO Gaussian channels with feedback, both with and without InterSymbol Interference (ISI).

fields
Information Theory
pdf ↗ page arXiv:2512.18535 ↗

We study sufficient conditions for stability and recurrence in a class of singularly perturbed stochastic hybrid dynamical systems. The systems considered combine multi-time-scale deterministic continuous-time dynamics, modeled by constrained differential inclusions, with discrete-time dynamics described by constrained difference inclusions subject to random disturbances. Under suitable regularity assumptions on the dynamics and causality of the associated solutions, we develop a family of composite nonsmooth Lagrange-Foster and Lyapunov-Foster functions that certify stability and recurrence properties by leveraging simpler functions related to the slow and fast subsystems. Stability is characterized with respect to compact sets, while recurrence is established for bounded open sets. The proposed framework is illustrated through several examples and applications, including the stability analysis of singularly perturbed switching systems with stochastic spontaneous mode transitions, feedback optimization problems with stochastically switching plants, and momentum-based feedback optimization algorithms with stochastic restarting.

fields
Optimization and Control
pdf ↗ page arXiv:2512.22806 ↗

Let $A$ be a finite-dimensional associative $k$-algebra with identity. The primary aim of this paper is to study the rationality properties of the group of all $k$-algebra automorphisms of $A$, as an affine algebraic group over an arbitrary field $k$. We investigate mainly the $R$-equivalence property of the identity component of $\mathrm{Aut}_{k}(A)$ over a perfect field $k$.

comments
23 pages
fields
Group Theory, Algebraic Geometry
pdf ↗ page arXiv:2512.24357 ↗

In this paper, we establish sharp two-sided heat kernel estimates for a large class of purely discontinuous symmetric Markov processes on closed subsets $F$ of $\mathbb{R}^d$, whose jump kernels blow up on a Borel subset $Σ$ of $F$. We assume that $F\setminus Σ$ is a $κ$-fat set and is dense in $F$, and additionally, in case of unbounded $F$, that the Assouad dimension of $F$ is strictly less than $d$. To the best of our knowledge, this is the first work establishing sharp two-sided heat kernel estimates for jump processes whose jump kernels blow up on part of the state space. The jump kernels under consideration take the form $J(x,y)=|x-y|^{-d-α}{\mathcal B}(x,y)$, where $α\in (0,2)$ and the function ${\mathcal B}(x,y)$ blows up at a subset $Σ$ of $F$. A fundamental obstacle is that the tails of the jump measures are not uniformly bounded, and hence standard techniques in heat kernel analysis do not provide a priori off-diagonal estimates. To overcome this difficulty, we develop a new approach based on weighted integral estimates for the heat kernel that are sensitive to both the blow-up behavior of the jump kernel and the geometry of $F\setminus Σ$. Examples of processes falling within our general framework include traces of isotropic $α$-stable processes in some unbounded $C^{1,\rm Dini}$ sets, processes in Lipschitz sets arising in connection with the nonlocal Neumann problem, and a large class of resurrected self-similar processes in the closed upper half-space.

comments
53 pages
fields
Probability, Analysis of PDEs
pdf ↗ page arXiv:2512.24807 ↗

We investigate a two-dimensional Hele-Shaw free-boundary problem with a nonlinear elastic interface, for both one-phase and two-phase scenarios. Using the paradifferential formulation, we demonstrate that the problem is locally well-posed in $H^s$ for $s\geq 2$ for arbitrary initial data. Furthermore, for the one-phase case and the stable two-phase case $(ρ^+ \leq ρ^-)$, we establish global well-posedness for small initial data in $H^s$ when $s> \frac{3}{2}$.

comments
39 pages, 1 figure, title changed
fields
Analysis of PDEs
pdf ↗ page arXiv:2601.01374 ↗

We present a universal concentration bound for sums of random variables under arbitrary dependence, and we prove that it is asymptotically optimal for broad families of marginals admitting a uniform integrable tail-quantile envelope. The bound follows directly from the subadditivity of expected shortfall, a property well known in the risk-measure literature. Our sharpness result relies on an explicit construction of asymptotically extremal couplings. We furthermore provide practical sufficient conditions -- based on convex transformation order comparisons with exponential and power-law envelopes -- under which the bound admits simple, explicit tail profiles.

comments
Will submit the results in an other longer paper and we want to avoid having to cite this paper. Anyway, we found out that these result had already been formulated by other authors before us (B. Wang, R. Wang, Extreme negative dependence and risk aggregation, Journal of Multivariate Analysis 136 (2015) 12–25. doi:10.1016/j.jmva.2015.01.006) so they are not of major interest anymore.
fields
Probability, Statistics Theory
pdf ↗ page arXiv:2601.03518 ↗

An identity Seidel switch of a graph is a vertex subset whose Seidel switch produces an isomorphic graph. We distinguish the elementary abelian group of switching operations from the family of identity switches of a fixed graph, which need not be a group. We obtain an edge-count condition for identity switches and deduce that every vertex-identity switch has degree half the number of remaining vertices. In particular, no graph of order at least two has every vertex as an identity switch. For a two-vertex switching set inducing an edge, we characterize the switches admitting an isomorphism that preserves the endpoint pair, in terms of automorphisms of the remaining induced subgraph. We establish modification results under this additional hypothesis and give explicit constructions of identity switches. Counterexamples show why edge-count conditions and unrestricted modification assertions do not suffice.

comments
14 pages; algebraic view of the Seidel switch
fields
Combinatorics
pdf ↗ page arXiv:2601.04530 ↗

Influence diagrams represent decision-making problems with interdependencies between random events, decisions, and consequences. Traditionally, they have been solved using tailored algorithms that determine the expected utility-maximizing decision strategy. Towards this end, most recent state-of-the-art solution approaches convert them into mixed-integer linear programming (MILP) models that can be solved using off-the-shelf MILP solvers. Computationally, these approaches are most efficient for influence diagrams that represent periodic (or sequential) decision processes, which can be cast as partially observable Markov Decision Processes. However, they are inefficient for problems that lack this periodic structure or whose influence diagrams have large state spaces. The efficient MILP formulation presented in this paper is specifically designed for influence diagrams that are challenging for earlier MILP formulations. Additionally, this formulation can be adapted to optimize conditional value-at-risk and to incorporate chance and logical constraints, thereby retaining the modeling flexibility of MILP-based methods. Finally, computational experiments on a range of problems from the literature are reported to show that the proposed formulation is much more efficient than earlier MILP formulations, particularly in problems which cannot be modeled as partially observable Markov decision processes and which lead to influence diagrams whose decision or chance nodes may have large state spaces.

fields
Optimization and Control
pdf ↗ page arXiv:2601.08460 ↗

We study bi-Lipschitz right-equivalence of holomorphic function germs $f:(\mathbb{C}^2,0)\to(\mathbb{C},0)$ via polar arcs and gradient canyons. For a polar arc $γ$ we consider the Newton polygon of $f_x(X+γ(Y),Y)$ and define its augmentation by adjoining the point $(0,\operatorname{ord} f(γ(y),y)-1)$. We prove that the resulting augmented Newton polygon is constant along each gradient canyon of degree $>1$ and is invariant under bi-Lipschitz right-equivalence. Moreover, its compact edges decompose into a topological part and a Lipschitz part: the latter encodes, through simple intercept relations, the second-level Henry-Parusiński type invariants. As applications, we obtain two numerical bi-Lipschitz invariants attached to a canyon: its polar multiplicity and, via the Koike-Kuo-Păunescu curvature formula, the total asymptotic Gaussian curvature concentrated in it.

comments
Revised version
fields
Complex Variables, Algebraic Geometry
pdf ↗ page arXiv:2601.12897 ↗

Given a smooth variety together with two smooth subvarieties, we construct, via two successive blowups, smooth varieties admitting small contractions. This generalizes Kawamata's example of small contraction in dimension 4. We also construct the flip of the contraction explicitly. As an application, from products of two del Pezzo surfaces we obtain smooth weak Fano fourfolds that admit small contractions with Picard number up to 10.

comments
31 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2601.13527 ↗

Recent years have witnessed a resurgence in using ReLU neural networks (NNs) to represent model predictive control (MPC) policies. However, determining the sufficient network complexity to ensure closed-loop guarantees remains a fundamental open problem. This involves a critical precision-complexity trade-off: undersized networks may fail to capture the MPC policy, while oversized ones may outweigh the benefits of ReLU network approximation. In this work, we project the MPC actions onto a tightened constraint set to satisfy the hard constraints, and establish a state-dependent Lipschitz continuity property for the optimal MPC cost function, which enables sharp convergence analysis of the closed-loop system. For the first time, we derive explicit bounds on ReLU network width and depth for approximating MPC policies with closed-loop guarantees. To reduce network complexity for the convergence to user-specified target sets, we propose a non-uniform error framework with a state-aware scaling function to adaptively adjust both the input and output of the ReLU network. Our contributions provide a foundational step toward certifiable ReLU NN-based MPC.

fields
Optimization and Control
pdf ↗ page arXiv:2601.16764 ↗

We consider time discretization for score-based diffusion models to generate samples from a learned reverse-time dynamic on a finite grid. Uniform and hand-crafted grids can be suboptimal given a budget on the number of time steps. We introduce Adaptive Reparameterized Time (ART), which controls the clock speed of a reparameterized time variable to redistribute computation along the sampling trajectory while preserving the terminal time, with the objective of minimizing the aggregate Euler discretization error. We derive a randomized companion ART-RL that recasts ART as a continuous-time reinforcement learning problem with Gaussian policies, and prove a two-directional bridge between the two: the deterministic ART optimum lifts to an optimal Gaussian policy, and conversely any optimal Gaussian policy must recover the ART control through its mean. This bridge turns continuous-time actor–critic learning into a principled, rather than heuristic, route to the deterministic timestep optimum. Within the official EDM pipeline, ART-RL improves FID on CIFAR–10 across a wide range of budgets; after one-time offline training, the distilled deterministic schedule transfers without retraining to AFHQv2, FFHQ, and ImageNet at no extra inference cost.

comments
12 pages. Accepted at NeurIPS 2026
fields
Optimization and Control
pdf ↗ page arXiv:2601.18681 ↗

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.

comments
v3: To appear at CSL 2027
fields
Category Theory, Logic
pdf ↗ page arXiv:2601.21843 ↗

We study a posteriori certification of semilinear diffusion–reaction problems on anisotropic simplicial meshes. Given a conforming finite element approximation, we bound its dual-norm residual by solving an auxiliary Crouzeix–Raviart problem and reconstructing an equilibrated Raviart–Thomas flux. Together with a coercivity estimate and a local derivative-Lipschitz bound, this gives a Newton–Kantorovich test for existence and local uniqueness in a computable energy-norm ball. We then use the verified radius to bound volume-type quantities of interest. The adjoint estimate accounts for the primal and adjoint residuals and retains explicit Taylor remainders for the nonlinear equation and, where relevant, the output functional. We also prove a conditional flux-mismatch consistency result on anisotropic mesh families. The CR–RT reconstruction and adjoint identities are established tools; here they provide a concrete low-order route to nonlinear solution and output certification. Numerical tests illustrate the bounds, but their double-precision evaluation does not constitute an interval-verified computation.

fields
Numerical Analysis
pdf ↗ page arXiv:2602.01636 ↗

Eldan's stochastic localization is a probabilistic construction that has proved instrumental to modern breakthroughs in high-dimensional geometry and the design of sampling algorithms. Motivated by sampling under non-Euclidean geometries and the mirror descent algorithm in optimization, we develop a functional generalization of Eldan's process that replaces Gaussian regularization with regularization by any positive integer multiple of a log-Laplace transform. We further give a mixing time bound on the Markov chain induced by our localization process, which holds if our target distribution satisfies a functional Poincaré inequality. Finally, we apply our framework to differentially private convex optimization in $\ell_p$ norms for $p \in [1, 2)$, where we improve state-of-the-art query complexities in a zeroth-order model.

comments
Fixed error in previous version
fields
Probability, Statistics Theory
pdf ↗ page arXiv:2602.03999 ↗

We study small perturbations of diffusion processes in $\mathbb{R}^d$ that leave invariant a finite collection of hypersurfaces. Each surface is assumed to be repelling for the unperturbed process, and the unperturbed motion on each of the surfaces is assumed to be ergodic. These surfaces separate the space into a finite number of domains, each of which carries an invariant measure of the unperturbed process. We describe the asymptotics of the densities of the invariant measures near the invariant surfaces. We then describe the asymptotic behavior of the perturbed process: at different time scales (depending on the size of the perturbation), metastable distributions are described in terms of linear combinations of the ergodic invariant measures of the unperturbed system. The coefficients in the linear combination depend on the time scale but are shown not to depend on the perturbation.

fields
Probability
pdf ↗ page arXiv:2602.07157 ↗

We study a Fast-Slow system of coupled two- and three-dimensional Navier-Stokes equations in which the fast component is perturbed by an additive fractional Brownian noise with Hurst parameter $\H>\frac{1}{3}$. Using rough path theory, we establish subsequential convergence in law of the slow component, with limiting dynamics depending on the Hurst parameter and the noise scaling. For $\H<\frac12$, an averaging regime yields a deterministic Navier-Stokes equation with an additional Itô-Stokes drift. Under a stronger noise scaling, corresponding to a Wong-Zakai approximation, and a centering condition on the quadratic fast dynamics, we obtain a Navier-Stokes equation driven by fractional transport noise. For $\H>\frac12$, the transport-noise limit holds in the Wong-Zakai regime without this centering condition, with integration understood in the Young sense.

comments
This version includes an improved Wong-Zakai result for the case H<1/2. Comments are welcome
fields
Probability, Analysis of PDEs
pdf ↗ page arXiv:2602.08680 ↗

The Keller cylinder DG ring encodes homotopies between DG ring homomorphisms $f_0, f_1 : A \to B$. Recently we discovered the higher cylinder DG rings $Cyl_q(B)$, which assemble into the simplicial cylinder DG ring $Cyl(B)$. For $q=1$ this recovers Keller's original construction. The sets $SHom_q(A,B)$ of DG ring homomorphisms $A \to Cyl_q(B)$ form the simplicial Hom set $SHom(A,B)$. Our main result is that when $A$ is a semi-free DG ring, the simplicial set $SHom(A,B)$ is a Kan complex. We prove several results about the fundamental groupoid $SHom_{\leq 1}(A,B)$, including invariance under quasi-isomorphism $B' \to B$.

comments
this version: 30 pages, one erroneous theorem removed
fields
Rings and Algebras, Category Theory, K-Theory and Homology
pdf ↗ page arXiv:2602.11943 ↗

Many objectives in machine learning and combinatorial optimization are non-concave. We introduce $γ$-weak $θ$-up-concavity, a first-order condition for nonnegative monotone functions in which a scaling function $θ$ lets the curvature change with the size of the solution. The resulting class strictly contains monotone DR-submodular functions and One-Sided Smooth (OSS) functions. It also contains functions whose marginal gains first increase and then decrease, and functions that vanish faster than any power of the norm at the origin. We construct a surrogate gradient from gradients along the segment from the origin to the current point and prove an upper-linearization inequality with a point-dependent approximation coefficient. Restricting actions to the closed convex hull of the coordinate-wise maximal feasible points makes this coefficient uniformly positive, with a value determined by the curvature parameters and the geometry of the feasible set. Standard reductions to linear optimization then give offline approximation algorithms and online algorithms with regret guarantees. The coefficient matches the optimal one for DR-submodular maximization and improves the best known coefficients for OSS maximization over matroid constraints whenever the OSS parameter is positive.

comments
Accepted to Neurips 2026
fields
Optimization and Control
pdf ↗ page arXiv:2602.13506 ↗

We extend the notion of class $\mathcal{A}$, previously defined for hypersurfaces of $\mathbb{S}^n\times \mathbb{R}$ and $\mathbb{H}^n\times \mathbb{R}$, where $\mathbb{S}^n$ and $\mathbb{H}^n$ denote the sphere and hyperbolic space, respectively, to hypersurfaces of a product $\mathbb{Q}_{c_1}^{k} \times \mathbb{Q}_{c_2}^{n-k+1}$, $2\leq k\leq n-1$, of two space forms with arbitrary constant curvatures $c_1$ and $c_2$. When $c_1$ and $c_2$ are not both equal to $0$, such a hypersurface is in class $\mathcal{A}$ if and only if it has a flat normal bundle when regarded as a submanifold of the underlying flat ambient space. We provide an explicit local construction of all hypersurfaces in class $\mathcal{A}$ that do not split in any open subset in terms of parallel families of hypersurfaces of the factors, and show how it simplifies for the hypersurfaces within this class that have a constant product angle function. We also show that hypersurfaces with constant mean curvature in class $\mathcal{A}$ are given in terms of parallel families of isoparametric hypersurfaces in each factor and a solution of a second order ODE. Finally, we classify hypersurfaces with constant mean curvature in class~$\mathcal{A}$ that have a constant product angle function.

comments
30 pages. Revised version. Significantly expanded Section 5 with a complete and rigorous proof of the classification of CMC hypersurfaces in class $\mathcal{A}$ with constant product angle function, correcting an error in the previous version
fields
Differential Geometry
pdf ↗ page arXiv:2602.16087 ↗

Modern AI models are not static. They go through multiple updates in their lifecycles. We propose to design Sequential Membership Inference (SeMI) attacks leading to tighter privacy audits by exploiting the sequence of models and injecting a target canary at a controlled insertion time. First, for empirical mean computation, we develop SeMI*, an optimal SeMI attack to identify the presence of a target inserted at a specific insertion step. We derive the power of SeMI* to show that accessing the model sequence yields more powerful MI attacks than scrutinising only the final model. SeMI* exhibits an isolation property. Its power depends on the statistics obtained right before and after insertion of the target. Leveraging this insight, we develop practical white-box (accessing model gradients) and black-box (accessing loss) SeMI attacks against models trained with (DP-)SGD. Across datasets and models trained with (DP-)SGD, our experiments show that SeMI attacks achieve higher power than snapshot-independent baselines, and yield tighter privacy audits thanks to (a) control over the insertion time and (b) observations across the model sequence. Code is available at https://github.com/Thomick/pysemi.

comments
Accepted at NeurIPS 2026. Camera-ready version. Code at https://github.com/Thomick/pysemi
fields
Statistics Theory
pdf ↗ page arXiv:2602.16596 ↗

A key contribution of this work is the derivation of convergence results for the semi-implicit time discretization in the general doubly degenerate setting. This paper presents a mathematical analysis of a doubly degenerate parabolic equation and its application to the Richards equation using a bounded auxiliary variable. We establish the existence of weak solutions using a semi-implicit time discretization combined with maximal monotone operator theory. The analysis is conducted within weighted Sobolev spaces, allowing for a rigorous treatment of the equation's strict degeneracy and strong nonlinearities. Unlike previous works that often rely on strict parabolicity or high regularity, we establish these results without imposing strictly positive lower bounds on the diffusivity. Furthermore, we prove that the Richards equation using the introduced auxiliary variable preserves the physical bounds of the saturation and demonstrate the unconditional linear convergence of the L-scheme linearization to the semi-discrete solution.

fields
Analysis of PDEs
pdf ↗ page arXiv:2602.19037 ↗

Transformers integrate information from multiple past positions through sparse attention patterns that copy from specific locations. We study how these patterns form during training in a high-order Markov-chain setting, where the next token depends on several groups of past positions with differing statistical importance. Learning proceeds in discrete stages, each marked by the emergence of a sparse attention pattern for the next most important group. The dynamics are initially competitive, with all attention heads focusing on the dominant pattern, but later become cooperative, with different heads specializing in distinct patterns. For a tractable surrogate, the dynamics reduce to those of a tensor factorization problem, enabling us to prove stagewise convergence. Empirically, the number of stages completed depends on training set size, suggesting a form of implicit complexity control through early stopping. Overall, we give a theoretical account of how structured attention patterns and head specialization emerge without an explicit curriculum.

comments
Published at ICML 2026. OpenReview: https://openreview.net/forum?id=vSRh1qU5sH. 55 pages, 21 figures. v3: revised proofs in the appendix, with explicit assumptions in Theorems 4 and 5
journal
Proceedings of the 43rd International Conference on Machine Learning (ICML 2026)
fields
Optimization and Control
pdf ↗ page arXiv:2602.19143 ↗

To leverage the redundancy between the electronic structure computed for various model parameters such as varying atomic positions, we present a data-driven modeling framework for Kohn-Sham Density Functional Theory that bypasses the explicit optimization of electronic wavefunctions. We sample \textit{a priori} representative atomic configurations and construct a low-dimensional basis that efficiently approximates the electronic structure subspace. Subsequently, we employ this reduced basis in an iterative solver for the electronic single particle density matrix, thereby enabling the efficient determination of ground state without iterative wavefunction optimization. We demonstrate the accuracy of our approach in a Born-Oppenheimer molecular dynamics of a water molecule, showing that the resulting simulations accurately reproduce key structural properties, such as bond lengths and bond angle, obtained from full first-principles molecular dynamics. This work highlights the potential of data-driven approaches to develop low-dimensional electronic structure representations for first-principles simulations.

fields
Numerical Analysis
pdf ↗ page arXiv:2602.22390 ↗

Let $V \subset \mathbb{R}$ be a finite set with $|V| = n $ and suppose we are given each pairwise distance independently with probability $p$. We show that if $p = (1+ε)/n$, for some fixed $ε>0$, then we can reconstruct a subset of size $Ω_ε(n)$, up to translation and reflection, with high probability. This confirms a conjecture posed by Girão, Illingworth, Michel, Powierski, and Scott. We also study a deterministic variant proposed by Benjamini and Tzalik. We show that if we are given $m$ distinct pairwise distances of a point set $V \subset \mathbb{R}$ with $|V|=n$, then we can reconstruct a subset of size $Ω(m/ (n \log n)) $, up to translation and reflection. Moreover, we show that this is optimal, which also disproves a conjecture posed by Benjamini and Tzalik.

fields
Combinatorics
pdf ↗ page arXiv:2602.23122 ↗

Concerning huge-scale aggregative convex programming of a linear objective subject to the affine constraints of equality and inequality and the quadratic constraints of inequality, convex and aggregatively computable, an algorithm is developed for its distributed computing. The consensus with single common variable is used to partition the constraints into multi-consensus blocks, and the subblocks of each consensus block are employed to partition the primal variables into multiple sets of disjoint subvectors. The global consensus constraints of equality and the original constraints are converted into the extended constraints of equality via slack variables to help initialize the algorithm. The augmented Lagrangian, the proximal point method with double proximal terms or single, the block-coordinate Gauss-Seidel method, and ADMM are used to update the primal and slack variable sequences; the descent models with built-in bounds are used to update the dual, motivated by the mathematical structures of the first-order characteristics of the update rules for the primal and slack. The feasibility conditions for the algorithm to produce optimal solutions are described and their realizations through precondition and parameter and initial values are outlined or specified. Under the feasibility conditions supposed, convergence of the algorithm to optimal solutions is argued and the rate of convergence, $O(1/k^{1/2})$ is estimated roughly. Issues requiring further explorations are listed.

comments
19 pages
fields
Optimization and Control
pdf ↗ page arXiv:2603.00557 ↗

A graph is perfectly divisible if every induced subgraph $H$ admits a partition $(A,B)$ of $V(H)$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. A graph is minimally nonperfectly divisible if it is not perfectly divisible but every proper induced subgraph is perfectly divisible. We prove that every $P_2\cup P_4$-free or diamond-free minimally nonperfectly divisible graph has no homogeneous set, and that every $2P_3$-free or claw-free minimally nonperfectly divisible graph has no clique cutset. We also study the relationship between perfect divisibility and its weighted analogue, perfect weight divisibility, defined for positive integral vertex weights. We prove that if a graph $H$ has no adjacent twins, then every $H$-free graph is perfectly divisible if and only if every $H$-free graph is perfectly weight divisible.

fields
Combinatorics
pdf ↗ page arXiv:2603.01967 ↗

We study the interplay between braid group theory and topological dynamics in three dimensions. While classical braid theory has been extensively applied to surface homeomorphisms to analyze fixed and periodic points, an analogous framework in three-dimensional manifolds has been lacking. In this work, we use loop braid groups, a three-dimensional generalization of classical braid groups, to investigate homeomorphisms of the $3$-ball that leave invariant a trivial link of finitely many circles. In our main theorem we relate matrix representations of loop braid groups, which are related to the Burau representation, to the abelianized generalized Lefschetz number. This result provides information on the existence of fixed points of such homeomorphisms and on their linking numbers with the invariant link. As an application, we obtain a lower bound for the number of periodic points of a given period. Our theorem establishes a three-dimensional analogue of a classical result for braids in the disk, and connects loop braid groups with Nielsen fixed point theory and topological dynamics in dimension three.

comments
21 pages, 4 figures
fields
Geometric Topology, Dynamical Systems
pdf ↗ page arXiv:2603.06233 ↗

A digraph consisting of a set of vertices $V$ and a set of arcs $E$ is called an interval digraph if there exists a family of closed intervals $\{I_u,J_u\}_{u \in V}$ such that $uv$ is an arc if and only if the intersection of $I_u$ and $J_v$ is non-empty. Interval digraphs naturally generalize interval graphs, by extending the classical interval intersection model to directed graphs. Several subclasses of interval digraphs have been studied in the literature-such as balanced, chronological and catch interval digraphs-each characterized by admitting interval representations that satisfy specific restrictions. Among these, interval nest digraphs are the ones that admit an interval representation in which $J_u$ is contained in $I_u$ for all vertices $u$ of $V$. In this work, we provide a complete characterization of interval nest digraphs in terms of vertex linear orderings with forbidden patterns, which we call nest orderings. This result completes the picture of vertex-ordering characterizations among the main subclasses of interval digraphs.

comments
Small mistake correction with respect to the published version. A necessary condition in a related paper was (wrongly) stated buy us as a characterization, we have now corrected that mistake
journal
Discrete Applied Mathematics 395 (2026), 337-344
fields
Combinatorics
pdf ↗ page arXiv:2603.08585 ↗

Efficiently locating rare targets requires balancing the exploration of novel space with the exploitation of local vicinities. While this tradeoff is well-documented in simplified environments, its behavior in realistic three-dimensional environments remains unclear. Here we analyze intermittent Lévy walks in three dimensions and show that search efficiency becomes strongly dependent on target geometry, with volume, surface area, and elongation governing performance across the Lévy spectrum. Against this geometric complexity, the Cauchy walk ($μ= 2$) emerges as a robust, near-optimal solution across a wide range of target geometries. Specifically, we prove that for convex targets of surface area $Δ$ in a domain of volume $n$, the optimal expected detection time scales as $n/Δ$, and that the Cauchy walk achieves this scaling up to polylogarithmic factors, while other Lévy strategies are suboptimal in different geometric regimes. Our findings provide a theoretical framework for biological movement patterns, including marine predator foraging and immune surveillance, and inform the design of efficient search algorithms for engineered systems such as autonomous nanoscale explorers.

comments
Published in Proceedings of the National Academy of Sciences (PNAS). Published version: https://doi.org/10.1073/pnas.2614625123
fields
Probability
pdf ↗ page arXiv:2603.10655 ↗

For intuitionistic propositional logic, Sandqvist's base-extension semantics defines a support relation parametrised by atomic bases, with validity identified as support in every base. Sandqvist's completeness theorem answers the global question: which formulae are valid? This paper addresses the local question: given a fixed base, what does support in that base correspond to? We show that support in a fixed base coincides with proof-search in a hereditary Harrop logic program with a quantifier over atoms, via an encoding of formulae as logic programming goals. The encoding is a variant of the Russell-Prawitz translation of the connectives, with quantification restricted to atoms, and it is obtained by reading the semantic clauses in continuation-passing style. So read, the universal quantifiers over base extensions and atoms in those clauses need not range over a completed totality: they are eigenvariables under a standard freshness discipline. Base-extension semantics thereby acquires an explicit computational content: support is proof-search. The result complements Sandqvist's global theorem with a local correspondence and makes the constructive character of the framework explicit.

comments
24 pages
journal
Journal of Logic and Computation 2026
fields
Logic
pdf ↗ page arXiv:2603.13018 ↗

An updated classification of two-dimensional algebras over an arbitrary base field is provided, along with the number of non-isomorphic such algebras over a finite field.

comments
A final version
fields
Rings and Algebras
pdf ↗ page arXiv:2603.15148 ↗

Fréchet means are a popular type of average for non-Euclidean datasets, defined as those points that minimise the average squared distance to a set of data points. We consider the behaviour of sample Fréchet means on normed spaces whose unit ball is a polytope; this setting is particularly important for semi-discrete data, but is rarely covered by existing literature on Fréchet means, which focuses primarily on manifolds and spaces with bounded Alexandrov curvature. We study the geometry of the set of Fréchet means over polytope normed spaces, with a focus on dimension and probabilistic conditions for uniqueness. In particular, we provide a geometric characterisation of the threshold sample size at which Fréchet means have a positive probability of being unique, and we prove that this threshold is at most one more than the dimension of our space. This geometric characterisation presents a novel framework for computing the unique Fréchet mean sample threshold, which we demonstrate in the case of the $\ell_1$, $\ell_{\infty}$ and tropical norms. In particular, we show that the $\ell_1$ sample threshold is always 3, but the $\ell_{\infty}$ and tropical sample thresholds grow at different rates with the dimension of our space.

comments
39 pages, 2 figures
fields
Probability, Metric Geometry, Statistics Theory
pdf ↗ page arXiv:2603.15785 ↗

The Solvability Complexity Index (SCI) provides an extensional limit-height formalism for recovering a target map $Ξ$ from finite samples of an evaluation interface $Λ\subseteq\mathbb C^Ω$ by finite-height towers of pointwise limits. We first give a foundational analysis of what this extensional framework does and does not determine. In second place, we give a concrete non-trivial bridge result from a comparable SCI object to the well known limit rank of Weihrauch theory.

comments
Important: [arXiv:2603.18955v2]: additional discussions about evaluation-induced topologies, Kihara-style piecewise-continuity reducibilities, and feasible real RAM models and their connection to the SCI [arXiv:2603.18955v3]: Short+focused version on main results; this version: densified revised version with additional examples, algebraic properties of general algorithms
fields
Logic, Spectral Theory
pdf ↗ page arXiv:2603.18955 ↗

We propose a principled framework for unsupervised domain adaptation under covariate shift in kernel Generalized Linear Models (GLMs), encompassing kernelized linear, logistic, and Poisson regression with ridge regularization. Our goal is to minimize prediction error in the target domain by leveraging labeled source data and unlabeled target data, despite differences in covariate distributions. We partition the labeled source data into two batches: one for training a family of candidate models, and the other for building an imputation model. This imputation model generates pseudo-labels for the target data, enabling robust model selection. We establish non-asymptotic excess-risk bounds that characterize adaptation performance through an "effective labeled sample size", explicitly accounting for the unknown covariate shift. Experiments on synthetic and real datasets demonstrate consistent performance gains over source-only baselines.

comments
62 pages, 6 figures. Python solvers and experiment scripts are available at: https://github.com/nathanweill/pseudolabel-uda-experiments
fields
Statistics Theory
pdf ↗ page arXiv:2603.19422 ↗

We formulate binary-quadratic induced structures for unary–binary operads by taking the arity-three part of the kernel of the substitution map for chosen induced binary operations. Our purpose is to identify all universal relations in this quadratic class; we make no claim that they generate the full kernel in every arity. For commutative associative algebras equipped with families of derivations, we determine these quadratic relations explicitly. In the noncommuting-derivation case they give the noncommuting multi-Novikov operad; imposing commutation of the derivations yields exactly the additional relations of the multi-Novikov operad. The one-derivation specialization recovers the usual Novikov operad. The calculations are self-contained at arity three and display how operator identities control induced binary-quadratic structures.

comments
18 pages. Comments welcome
fields
Category Theory, Rings and Algebras
pdf ↗ page arXiv:2603.19553 ↗

Perturbative van Kampen cumulant expansions of time-local generators of open quantum systems generically diverge at long times, while the reduced dynamics remains regular. We show that these divergences encode information sufficient to reconstruct an approximate nonperturbative dynamical map. Although their resummation remains divergent, disentangling the dynamics according to its van Hove limit resolves the divergence and exposes its dynamical origin: the map approaches isolated times at which it becomes noninvertible. For the weak-coupling unbiased spin–boson model, the reconstructed non-Markovian dynamics takes the disentangled form \begin{equation*} Φ=Φ_{\mathrm{GAD}}+Φ_{\mathrm{NS}}+Φ_{\mathrm{Khal}}, \end{equation*} separating generalized amplitude damping, exponentially damped nonsecular coherence mixing, and a projective, phase-selective Khalfin map. Thus, the onset of recurrent noninvertibility is the reduced-dynamical-map manifestation of the Khalfin transition from exponential to algebraic relaxation. Although the coherences acquire algebraic Khalfin tails, the distinguishability of quantum superposition states remains governed by an exponential decay law well after the Khalfin transition. Comparison with numerically exact TEMPO dynamics validates the procedure and shows that apparently complex non-Markovian dynamics can resolve into a small number of distinct, physically transparent dynamical processes.

comments
28 pages 7 figures. Published
journal
Davidovic 2026 J. Phys. A: Math. Theor.
fields
Mathematical Physics
pdf ↗ page arXiv:2603.25512 ↗

This paper presents a class of novel high-order fully-discrete entropy stable (ES) discontinuous Galerkin (DG) schemes with explicit time discretization. The proposed methodology exploits a critical observation from [4] that the cell averages of classical DG solutions with forward Euler time stepping satisfy an ``entropy-stable-like'' property. Building on this result, fully-discrete entropy stability is rigorously enforced through a simple Zhang–Shu-type scaling limiter [65] applied as a post-processing step, without modifying the underlying spatial discretization. Furthermore, the proposed methodology can simultaneously enforce multiple discrete cell entropy inequalities, a capability unavailable in existing ES DG schemes. High-order accuracy in time is achieved by using strong-stability-preserving multistep methods. Theoretically, we prove that the proposed scheme indeed maintains high-order accuracy and establish a Lax–Wendroff-type theorem showing that the limit of the numerical solutions, if it exists, satisfies the desired entropy inequality. Extensive numerical tests for scalar equations and systems, including the nonconvex Buckley–Leverett problem and extreme examples of Euler equations, demonstrate optimal accuracy, enforcement of multiple entropy conditions, and strong robustness.

fields
Numerical Analysis
pdf ↗ page arXiv:2603.27478 ↗

In this paper, the first globally convergent numerical method is developed for an $n-$Dimensional coefficient inverse problem for a wave-like equation with the unknown potential in the most challenging case when the Dirac $% δ-$ function is present in one of initial conditions for that equation and only a single location of the point source is used. Based on a Carleman estimate, convergence analysis is carried out. This analysis ensures the global convergence of the proposed numerical method, i.e. its convergence to the true solution is rigorously guaranteed regardless on the availabilty of a good first guess about this solution. A certain uniqueness theorem is proven as well. Extensive computational experiments with noisy data for both 2-Dimensional and 3-Dimensional cases demonstrate a high reconstruction accuracy.

comments
40 pages, 8 figures, submitted manuscript, preprint (not accepted yet)
fields
Numerical Analysis
pdf ↗ page arXiv:2603.27729 ↗

In his quest to exhibit a non-distributive lattice, Ernst Schröder considered 135 years ago a list of 990 equational laws on quasigroups, a non-associative generalization of groups. The laws of interest are analogues of associativity, such as $(x // y) * z = (y // x) \backslash\backslash z$, built from the multiplication $*$ and right/left conjugate-division operations, with the same three distinct variables on both sides. I determine all 114 equivalence classes of their conjunctions, and all implications between them. This includes as a small corner the non-distributive lattice identified by Schröder. Apart from 31 classes that are related to inverse properties (and weaker than total symmetry), and 3 that describe groups and their parastrophes, the remaining 80 are subject to the Four Quasigroups Theorem and quasigroups satisfying them are isotopes of Abelian groups. More than half of these describe (affine) modules over interesting rings.

comments
v1: 9 pages. v2: 37 pages with a description of all 114 structures
fields
Rings and Algebras
pdf ↗ page arXiv:2603.29909 ↗

We develop a new method for equality constrained optimization problems based on a sequential cubic programming framework. Each iteration utilizes a step decomposition based on the Jacobian of the constraints into a normal and a tangential component, the latter of which is found by solving a subproblem involving cubic regularization. The method incorporates second-order correction steps as necessary to ensure global convergence to second-order stationary points as well as local quadratic convergence. In addition, we show that the algorithm is the first to obtain worst case complexity guarantees on the order of $\mathcal{O}(ε_g^{-3/2})$ for the gradient of the Lagrangian, $\mathcal{O}(ε_H^{-3})$ in terms of second-order stationarity, and $\mathcal{O}(ε_c^{-1})$ in terms of the constraint violation. These are the best known complexity guarantees of any method for this class of problems.

comments
49 pages; Appendix C added
fields
Optimization and Control
pdf ↗ page arXiv:2604.02747 ↗

We study algorithmic matroid intersection coloring. Given $k$ matroids on a common ground set $U$ of $n$ elements, the goal is to partition $U$ into the fewest number of color classes, where each color class is independent in all matroids. It is known that $2χ_{\max}$ colors suffice to color the intersection of two matroids, $(2k-1)χ_{\max}$ colors suffice for general $k$, where $χ_{\max}$ is the maximum chromatic number of the individual matroids. However, these results are non-constructive, leveraging techniques such as topological Hall's theorem and Sperner's Lemma. We provide the first polynomial-time algorithms to color two or more general matroids where the approximation ratio depends only on $k$ and, in particular, is independent of $n$. For two matroids, we constructively match the $2χ_{\max}$ existential bound, yielding a 2-approximation for the Matroid Intersection Coloring problem. For $k$ matroids we achieve a $(k^2-k)χ_{\max}$ coloring, which is the first $O(1)$-approximation for constant $k$. Our approach introduces a novel matroidal structure we call a \emph{flexible decomposition}. We use this to formally reduce general matroid intersection coloring to graph coloring while avoiding the limitations of partition reduction techniques, and without relying on non-constructive topological machinery. Furthermore, we give a \emph{fully polynomial randomized approximation scheme} (FPRAS) for coloring the intersection of two matroids when $χ_{\max}$ is large. This yields the first polynomial-time constructive algorithm for an asymptotic variant of Rota's Basis Conjecture. This constructivizes Montgomery and Sauermann's recent asymptotic breakthrough and generalizes it to arbitrary matroids.

fields
Combinatorics
pdf ↗ page arXiv:2604.03735 ↗

We assess the descriptive complexity of *bisimilarity* or "equality of behavior" on a family of Markov decision processes over uncountable standard Borel spaces, namely *nondeterministic labelled Markov processes* (NLMP). We show that bisimilarity is analytic for processes with a uniform assignment of finitely-supported measures to each state and label. More precisely, we obtain that bisimilarity on the space of countable Kripke frames (or labelled transition systems) is classifiable by countable structures. We show that bisimilarity of well-founded ("terminating") processes is Borel. We also provide a lower complexity bound by reducing the relation of eventual equality of binary sequences, $E_0$, to the former. As a consequence, there is no countable fragment of basic modal logic with denumerable conjunctions that characterizes bisimilarity for processes of small rank. We finally apply the previous Borel-definability to study the well-founded part of discrete uniform processes over continuous spaces.

comments
37 pages (29pp with biblio + 8pp appendices), 3 figures. v2: Adapted to journal page limits. Addressed referee's remarks
fields
Logic
pdf ↗ page arXiv:2604.06443 ↗

We construct a causal and covariantly stable kinetic model whose spectrum at real wavenumbers $k$ reproduces any rest-frame stable dissipative dispersion relation $ω(k)$ via suitable initialization of the microscopic degrees of freedom. Macroscopic observables can therefore obey arbitrary linear evolution equations (including forms that would be acausal if taken as fundamental), while the underlying dynamics remains causal, and all apparent propagation is encoded in the initial data. This provides an explicit counterexample to the idea that microscopic causality alone constrains the analytic form of dispersion relations at real $k$. In particular, bounds on transport coefficients based solely on the analytic structure of $ω(k)$, such as the hydrohedron bounds, require additional assumptions about the region in the complex $k$-plane where $ω(k)$ corresponds to physical modes.

journal
Physics Letters B 883, 141131 (December 2026)
fields
Mathematical Physics
pdf ↗ page arXiv:2604.07031 ↗

Randomized sketching is currently introduced into every area of numerical linear algebra. In Krylov subspace methods, it allows runtime savings at the cost of small accuracy reductions. This work offers a different view on sketching in Krylov subspace methods by analyzing what subspace embeddings are obtained by arbitrary sketching matrices. The analysis gives rise to a deterministic sketching approach leveraging row subset selection techniques that yield subspace embeddings holding with probability 1. We propose deterministically sketched Krylov subspace methods for matrix functions, linear systems, and eigenvalue problems that show a similar performance to their randomly sketched counterparts.

fields
Numerical Analysis
pdf ↗ page arXiv:2604.07158 ↗

We derive the Euler (hyperbolic) hydrodynamic limit for the directed exclusion process (DEP), a one-dimensional conservative interacting particle system that preserves particle–hole symmetry while breaking left–right symmetry. The proof relies on an explicit multi-process coupling, which guarantees a strong form of attractiveness and macroscopic stability for the particle system. Further open questions about DEP are briefly discussed.

comments
In press
journal
Mathematical Physics, Analysis and Geometry
fields
Probability
pdf ↗ page arXiv:2604.08154 ↗

We introduce a dynamical analogue of the lifting problem for Galois covers of algebraic curves and find a negative solution for the collection of separable additive and semi-additive polynomials over $\overline{\mathbb{F}}_p$. We also explicitly compute the dimension of the space of linear conjugacy classes in $\mathcal{M}_{p^m}(\overline{\mathbb{F}}_p)$ which contain additive or semi-additive polynomials providing explicit counterexamples to Thurston Rigidity in positive characteristic.

comments
V2: reorganized for efficiency and clarity, added a discussion of a second family of wildly ramified maps -- the semi-additive polynomials. V3: fixed errors in the proofs of Theorem 5.4 and Proposition 6.4
fields
Number Theory, Dynamical Systems
pdf ↗ page arXiv:2604.08795 ↗

Under i.i.d. sampling, the maximum score estimator of Manski (1975) converges at the cube-root rate to a non-Gaussian limit, and under median independence alone no regular estimator attains the parametric rate Chamberlain (1986). We show that, under multiway dependence and low-level conditions, the estimator is asymptotically normal at a parametric rate in the smallest number of clusters and, when the cluster-level variance is non-degenerate, as fast as regular estimators such as probit. The result rests on a general theory for non-smooth M-estimators, under which a modified bootstrap is first-order valid given a consistent Hessian estimate. With two-way clustering a cube-root term can remain. We then develop two-scale non-standard asymptotics, in which the limit is a Gaussian vector plus an independent Chernoff-type vector and either term may dominate, along sequences of laws from a non-degenerate cluster-level variance to the degenerate case. Under high-level conditions, the symmetric bootstrap intervals for suitable scalar parameters control size uniformly over such classes of laws, asymptotically exactly where the Gaussian term dominates and conservatively otherwise.

fields
Statistics Theory
pdf ↗ page arXiv:2604.10232 ↗

This paper studies spherically symmetric sprays, i.e., sprays that are invariant under orthogonal transformations. We first establish a canonical form for such sprays, showing that their geodesic coefficients can be expressed as \(G^i = |y|α(r,s) y^i + |y|^2β(r,s) x^i\), where \(r = |x|^2\) and \(s = \langle x,y\rangle/|y|\). For projectively flat spherically symmetric sprays -- which are directly related to Hilbert's fourth problem on characterizing metrics whose geodesics are straight lines -- we derive a complete classification of those with isotropic curvature, and in particular, we obtain the explicit form of those with zero curvature. Furthermore, we characterize sprays of weakly isotropic curvature in this class by a system of partial differential equations. These results may provide a unified framework for understanding symmetry and curvature in spray geometry and may offer new insights into the metrizability problem in Finsler geometry.

comments
15 pages, 0 fugure
fields
Differential Geometry
pdf ↗ page arXiv:2604.11196 ↗

The so-called SAGA-LD algorithm is used for efficient sampling from high-dimensional distributions in machine learning. Its intricate dynamics resists standard approaches of Markov chain theory. We prove, using a model-specific method, that SAGA-LD converges to a limiting distribution and a law of large numbers holds.

comments
Several small corrections
fields
Probability
pdf ↗ page arXiv:2604.12815 ↗

This paper explores an integrated sensing and communication (ISAC) system with backscattering radio frequency identification (RFID) tags. In this setup, an access point employs communication beams to serve communication users while leveraging a sensing beam to interrogate RFID tags. Under the total transmit power constraint of the system, our objective is to design a joint sensing and communication beamforming codebook by considering the tag interrogation and communication requirements. To lay a foundation for the codebook design problem, we first study the beamforming design problem in the single-tag scenario and investigate two approaches: a two-stage zero-forcing-based design with optimized power allocation and a joint beamforming design that minimizes the total transmit power. Extending our study to the multi-tag scenario, we propose a site-specific beamforming codebook design. The proposed approach partitions the region of interest into angular sectors and jointly optimizes the sensing and communication beams for each sector. The simulation results show that the proposed beamforming designs can effectively mitigate the mutual interference between sensing and communication functionalities, thus enhancing the interrogation range of the tags while minimizing transmit power. Also, the efficacy of the proposed site-specific codebook design has been demonstrated in terms of interrogation success rate, offering a promising approach for ISAC backscattering systems.

comments
16 pages, 10 figures. Accepted in IEEE Transactions on Communications
fields
Information Theory
pdf ↗ page arXiv:2604.14689 ↗

The impossibility of simultaneously cloning non-orthogonal states lies at the foundations of quantum theory. Even when allowing for approximation errors, cloning an arbitrary unknown pure state requires as many initial copies as needed to fully learn the state. Rather than arbitrary unknown states, modern quantum learning theory often considers structured classes of states and exploits such structure to develop learning algorithms that outperform general-state tomography. This raises the question: How do the sample complexities of learning and cloning relate for such structured classes. We answer this question for an important class of states. Namely, for $n$-qubit stabilizer states, we show that the optimal sample complexity of cloning is $Θ(n)$. Thus, also for this structured class of states, cloning is as hard as learning. To prove this result, we relate stabilizer state cloning to a variant of the sample amplification problem for probability distributions that was recently introduced in classical learning theory. This allows us to obtain our cloning lower bounds in analogy to new sample amplification lower bounds for classes of distributions with an underlying linear structure. Our results provide a more fine-grained perspective on No-Cloning theorems, opening up connections from foundations to quantum learning theory and quantum cryptography.

comments
10 + 33 + 8 pages. Corrected small errors in classical sample amplification statements and proofs; new quantum cloning lower bound proof strategy that avoids an incorrect structured random purification claim in V1; new no-go theorems for structured random purification
fields
Statistics Theory
pdf ↗ page arXiv:2604.15269 ↗

Adversarial training of binary classifiers can be reformulated as regularized risk minimization involving a nonlocal total variation. Building on this perspective, we establish a characterization of the subdifferential of this total variation using duality techniques. To achieve this, we derive a dual representation of the nonlocal total variation and a related integration-by-parts formula, involving a nonlocal gradient and divergence. We provide such duality statements both in the space of continuous functions vanishing at infinity on proper metric spaces and for the space of essentially bounded functions on separable metric spaces. Furthermore, under some additional conditions we provide characterizations of the subdifferential in these settings.

comments
34 pages
fields
Analysis of PDEs, Functional Analysis, Optimization and Control
pdf ↗ page arXiv:2604.18540 ↗

We discuss some mathematical aspects of the Mori-Zwanzig projection operator formalism. The core of the Mori-Zwanzig formalism is the generalised Langevin equation, which is typically derived from the Dyson-Duhamel identity. We recall the derivation of the projection operator formalism for Mori's projection by means of semigroup theory, and we discuss where rigorous methods fail for the case of Zwanzig's projection. For bounded perturbations of the time-evolution operator (e.g. for Mori's projection), the Dyson-Duhamel identity coincides with the variation of constants formula. For unbounded perturbations (e.g. for Zwanzigs's projection), the Dyson-Duhamel identity should be considered an equation for the orthogonal dynamics, for which the existence of unique solutions has yet to be established. Then we recall that all properties of Mori's generalised Langevin equation follow directly from the well-posedness of Volterra equations, irrespective of the projection operator formalism. Further, we discuss the use of Mori's generalised Langevin equation as a coarse-grained model. Finally, we illustrate that the memory term is a coupling term that is not necessarily related to memory. To this end, we introduce projections onto subspaces of 'fast' and 'slow' variables that are associated with the spectral decomposition of skew-adjoint operators. For these projections, the memory term vanishes.

fields
Mathematical Physics
pdf ↗ page arXiv:2604.20453 ↗

The $q$-state Potts model is an archetypical model for various types of phase transitions. We consider it on the square grid and focus on the regime where it undergoes a discontinuous transition, that is $q>4$. At the transition point $T_c(q)$, there are exactly $q+1$ extremal Gibbs measures (pure phases): $q$ ordered (monochromatic) and one disordered (free). This work establishes for the first time the wetting phenomenon in a precise geometric form and in the entire regime of discontinuity $q>4$: at $T_c(q)$, between two ordered phases a disordered layer emerges and, in the diffusive scaling, its boundaries converge to a pair of Brownian motions conditioned not to intersect. This is starkly different from the subcritical ($T<T_c(q)$) behaviour. At $T_c(q)$, previous results (Bricmont–Lebowitz '87, Messager–Miracle-Sole–Ruiz–Shlosman '91) were limited to the construction and properties of the surface tension for large enough $q$. In a companion work, arXiv:2502.04129, we provide a detailed study of the Potts model under order-disorder Dobrushin conditions. That work also develops a ``renewal picture'' à la Ornstein-Zernike for a suitable percolation model, which plays a central part in our study of the Potts interfaces. The latter is the random-cluster representation of an Ashkin–Teller model (ATRC), and is related to the Potts model via a chain of couplings going through the six-vertex model. In the current work, we extend the analysis to a pair of interacting order-disorder interfaces forming the separation between the two ordered phases, and couple them to a pair of well-behaved random walks conditioned not to intersect. The construction of the coupling is based on rigorously deriving entropic repulsion between the two interfaces. We also prove convergence of interfaces in the FK-percolation model at $p_c(q)$ when $q>4$.

comments
58 pages, 18 figures. v2: typo fixing, cosmetic improvement. Comments welcome!
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2604.21669 ↗

For $G$ a finite group, one way to construct irreducible quandle representations over $\mathbb{C}$ of the conjugacy quandle $Conj(G)$ is by taking the product of an irreducible linear group representation of $G$ by what we call a quandle character of $Conj(G)$ (a quandle morphism into $\mathbb{C}^\times$ ). We show that these are all the irreducible quandle representations of $Conj(G)$ over $\mathbb{C}$ if and only if the Bogomolov multiplier $B_0(G)$ of $G$ is trivial. The Bogomolov multiplier is trivial for many classical groups, simple groups and with exceptions quasi-simple groups. We apply this to study the enveloping group of $Conj(G)$. If $G$ finite with trivial $B_0(G)$, we obtain that the enveloping group of $Conj(G)$ injects into $G\times \mathbb{Z}^{c_G}$ where $c_G$ is the number of the conjugacy classes of $G$. If moreover $G$ is perfect the injection is an isomorphism.

comments
Error in the first version (v1). We have noticed that the group of cohomology classes of symmetric 2-cocyles with values in C^* is isomorphic to the Bogomolov multiplier; we added this in the third version and made related minor changes
fields
Representation Theory, Group Theory
pdf ↗ page arXiv:2604.22078 ↗

We study linear quadratic dynamic games where players are uncertain about each other's control policies or goals and consequently seek to be strategically robust. Building on recent work on strategically robust and risk-averse game theory, we first formalize the problem of strategically robust linear quadratic dynamic games. We show that these can be rewritten as simple transformations of linear quadratic games in which each player chooses a controller in a fictitious game in which they are faced with an adversary who is penalized for deviating from the other players' policies. This formulation naturally induces a novel notion of dynamic equilibrium, which we call a strategically robust dynamic equilibrium. We establish existence and uniqueness (in the subgame-perfect sense) of such equilibria and show that the equilibrium policies are Markovian, linear, and can be efficiently computed via coupled backward Riccati equations. Through numerical simulations, including experiments in a network game, we illustrate the benefits of strategic robustness in designing robust and resilient decentralized control schemes. Our experiments also expose a "free-lunch" phenomenon in games in which robustness does not incur a corresponding loss in performance but can yield improvements in players' utilities and social welfare.

comments
6 pages, 5 figures, 2 tables. Accepted to the 2026 IEEE Conference on Decision and Control (CDC)
fields
Optimization and Control
pdf ↗ page arXiv:2604.22318 ↗

We study free Carrollian quantum field theories from an algebraic perspective and explore their implications for flat space holography. As explicit examples, we construct the electric and magnetic Carrollian Weyl algebras obtained from Carroll limits of the relativistic scalar field and analyze their states, including vacuum and thermal configurations. For the massive electric theory, we find a regular Carroll-invariant vacuum state and a regular KMS state, yielding a consistent Carrollian thermodynamic system. By contrast, the massless electric and magnetic theories are more subtle: depending on the quantization, they admit either no regular distinguished vacuum or only nonregular Carroll-invariant ground states, while still supporting nonregular thermal states. We further analyze alternative classes of states in the massless electric theory, including spatially homogeneous quasifree pure states and Sorkin–Johnston states. Motivated by these results, we discuss consequences for flat space holography. We construct a well-defined state relevant for Carrollian holography whose Hilbert-space representation factorizes into a standard Fock sector and a nonseparable zero-mode sector, thereby highlighting the role of infrared degrees of freedom in the boundary theory.

comments
46 pages + 9 pages appendix + references, 2 figures; v2: expanded section 5.2, minor improvements, added references; v3: Matches published version + Appendix B.3
fields
Mathematical Physics
pdf ↗ page arXiv:2604.22745 ↗

This paper presents a method for incorporating control analysis into design optimization for highly-maneuverable aircraft. By studying reachable sets for aircraft dynamics, we ensure that the optimizer will take the aircraft's controlled capabilities into account. We compute reachable sets of linear dynamics for computational efficiency, and account for aircraft trim points to factor in asymmetric magnitude bounds on the input signals. We demonstrate the proposed method in design optimization of a blended-wing-body aircraft. Considering its longitudinal dynamics, we optimize the aircraft based on its reachable sets to yield improvements in its controlled performance. When designing a reference tracking controller, we find up to 57% faster settling time with approximately 77% less control effort for the optimized model's nonlinear dynamics.

comments
34 pages, 13 figures, submitted to AIAA Journal
fields
Optimization and Control
pdf ↗ page arXiv:2604.26134 ↗

Local differential privacy (LDP) has emerged as a gold-standard framework for privacy-preserving data analysis. However, characterizing the optimal privacy-utility trade-off (PUT) and the corresponding optimal LDP channels remains largely fragmented, relying on problem-specific, case-by-case analyses. In this work, we develop a unified theoretical framework that systematically characterizes the optimal PUT and optimal LDP channels for general privacy-preserving statistical decision-making problems. We first identify key functional properties of Bayesian and minimax risks as functions of the LDP channel, including the data processing inequality (DPI), direct-sum quasi-convexity (or additivity), concavity, and symmetry invariance. Leveraging these properties, we reduce the optimization domain required to compute the optimal PUT. To this end, we reinterpret the existing result implying the one-to-one correspondence between maximal LDP channels under the Blackwell order and a finite-dimensional polytope, through an alternative convex geometric derivation. This result renders the optimal PUT computationally tractable via vertex enumeration or linear programming. Furthermore, when the underlying problem exhibits symmetries characterized by a transitive group action, we show that the optimal PUT can be computed by comparing finitely many values, rather than optimizing over a high dimensional polytope. Our framework applies broadly beyond risk minimization, encompassing the maximization of information-theoretic measures. We demonstrate the efficacy of our theoretical framework by recovering or strengthening several known results, and deriving exact analytic expressions for the optimal PUTs in specific tasks that were previously unaddressed.

comments
20 pages, 2 figures. Compared to v1, relevant references have been newly added
fields
Information Theory
pdf ↗ page arXiv:2605.02319 ↗

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

comments
45 pages Substantially revised and expanded. This version presents a 19-dimensional complete non-perfect Lie algebra with nilpotent radical and adds applications to automorphism groups of finite p-groups, including a solution to Problem 16.63 of the Kourovka Notebook for every prime p >= 7
fields
Rings and Algebras
pdf ↗ page arXiv:2605.04602 ↗

We study a class of bilevel optimization problems in which both the upper- and lower-level problems have minimax structures. This setting captures a broad range of emerging applications. Despite the extensive literature on bilevel optimization and minimax optimization separately, existing methods mainly focus on bilevel optimization with lower-level minimization problems, often under strong convexity assumptions, and are not directly applicable to the minimax lower-level setting considered here. To address this gap, we develop penalty-based first-order methods for bilevel minimax optimization without requiring strong convexity of the lower-level problem. In the deterministic setting, we establish that the proposed method finds a lifted $ε$-KKT point with $\tilde{O}(ε^{-4})$ oracle complexity. We further show that bilevel problems with convex constrained lower-level minimization can be reformulated as special cases of our framework via Lagrangian duality, leading to an $\tilde{O}(ε^{-4})$ complexity bound that improves upon the existing $\tilde{O}(ε^{-7})$ result when the lower-level Slater's condition holds. Finally, we extend our approach to the stochastic setting, where only stochastic gradient oracles are available, and prove that the proposed stochastic method finds a nearly lifted $ε$-KKT point with $\tilde{O}(ε^{-9})$ oracle complexity.

comments
NeurIPS 2026 Poster
fields
Optimization and Control
pdf ↗ page arXiv:2605.08006 ↗

At a smooth point, a generic holomorphic vector field vanishing there has index one. At an isolated hypersurface singularity, the corresponding generic GSV index is an invariant of the analytic germ. We study this invariant, denoted by $K$, and prove the sharp bound $K\ge1+(-1)^nτ$, where $n$ is the dimension and $τ$ the Tjurina number. We characterize equality by weighted homogeneity in odd dimensions; Liu and Zhang subsequently established the converse in even dimensions. Beyond equality, $K$ detects analytic information not determined by the Milnor and Tjurina numbers. We compute it on the normalization of a reduced plane curve and interpret its difference from the Euler characteristic of the Milnor fibre as a logarithmic Poincaré–Hopf index on a resolution. This gives a geometric explanation for a striking contrast: the difference is nonnegative for curves, but can be arbitrarily negative for surfaces. Our double-suspension theorem, $K(f+z^2+w^2)=K(f)$, carries these phenomena to every odd and every even dimension, respectively. In every dimension we construct singularities whose generic index exceeds the sharp bound by exactly two. We conjecture that an excess of one is impossible.

fields
Algebraic Geometry
pdf ↗ page arXiv:2605.09210 ↗

We prove that the oriented liquid-level function determines a full-dimensional convex polytope $P\subset\mathbb R^d$, $d\ge2$, and its relative density $δ\in(0,1)\setminus\{\tfrac12\}$. Uniqueness also follows from buoyancy surfaces at distinct densities accumulating at a non-half interior value. For polygons, fixed-density buoyancy data determine the normalized difference body, yielding uniqueness among centrally symmetric polygons at every density.

comments
16 pages, 2 figures
fields
Metric Geometry, Differential Geometry
pdf ↗ page arXiv:2605.09776 ↗

The expected number of coded symbols drawn from a linear code until a desired information symbol can be decoded is studied. This quantity is of interest in DNA data storage, where it is called the random access expectation. If the generator matrix of the code is binary and fully symmetric, the process of sampling symbols from the code is equivalent to the encoder of an LT code. Based on this observation, the random access expectation of binary fully symmetric codes under a peeling decoder is analyzed in the large blocklength limit. Asymptotically, a random access expectation, normalized by the number of information symbols, of $0.7869$ is achievable, while for a binary fully symmetric code under a peeling decoder it cannot be below $π/4\approx 0.7854$. The analysis is extended to the case where a set of information symbols needs to be decoded.

fields
Information Theory
pdf ↗ page arXiv:2605.10919 ↗

For a symmetric matrix $M$ over $\mathbb F_2$, it is known that its diagonal vector belongs to its column space. We prove the parity refinement that every solution of $Mx=\operatorname{diag}(M)$ satisfies $\operatorname{diag}(M)^Tx\equiv\operatorname{rank}(M)\pmod 2$. This extends the parity theorem for odd dominating sets to graph matrices with arbitrary binary diagonal labels. A self-contained rank-one update formula gives the changes caused by a single loop toggle and yields $\operatorname{nul} A(\overline G)=\operatorname{nul}(A(G)+I)+[\operatorname{rank}(A(G)+I)\text{ is odd}]$. For rooted trees, we augment Filmus's three classes of realizable boundary data with an explicit multiplicity recursion. The resulting formula computes the nullity of $A(T)+D_\varepsilon$ in a single traversal and gives a nonsingularity criterion. For complete rooted trees with eventually periodic labels indexed by height above the leaves, we obtain eventual periodicity of the boundary states and nullity formulas affine in powers of the branching degree on each eventual residue class. Constant labels give explicit closed forms.

comments
Some typos in the earlier version were fixed! The main theorems have been strengthened
fields
Combinatorics
pdf ↗ page arXiv:2605.11056 ↗

In this paper, we consider the efficient numerical minimization of Tikhonov functionals resulting from total-variation (TV) regularization of linear inverse problems. Since the TV penalty is non-smooth, this is typically done either via smooth approximations, which are inexact, or using non-smooth optimization techniques, which can often be numerically expensive, in particular for large-scale problems. Here, we present a numerically efficient minimization approach based on the recently proposed semismooth* Newton method, which employs a novel concept of graphical derivatives and exhibits locally superlinear convergence. The proposed approach is specifically tailored to TV regularization, suitable for large-scale inverse problems, and supported by strong mathematical convergence guarantees. Furthermore, we demonstrate its performance on two (large-scale) tomographic imaging problems and compare our results to those obtained via other state-of-the-art TV regularization approaches. Finally, an open-source Matlab implementation of the proposed method is made available online at https://github.com/HGfrerer/TVReg-2D-Semismoothstar-Newton.

comments
47 pages, 15 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2605.12041 ↗

We develop a rigorous evaluation of Dirac brackets for classical observables on the phase space of radiative gravitational modes at null infinity that naturally incorporates memory effects. Considering the Ashtekar-Streubel phase space, with boundary conditions in time given by vanishing {\it news} and purely electric {\it shear}, and taking into account the infinite dimensionality of the phase space, we identify the algebra of proper observables (understood as functions on phase space that can be associated with smooth symplectic flows). We show that the action of supertranslation charges generate the correct transformations on the shear. We also show that the conventional definition of the ``Goldstone mode'' adopted in the literature cannot be associated with a proper observable, but nevertheless there exists an infinite family of proper observables, which we call {\it Goldstone probes}, that are capable of measuring the Goldstone mode. We notice that there are no Goldstone probes constructed only out of the shear {\it or} the news, providing a possible explanation for why attempts to construct a (separable) Hilbert space with different memory states have failed so far. Finally, we derive formulas for distributional Dirac brackets between local shear and news, and show that they contain non-local corrections.

comments
73 pages, including 15 pages of appendices. In v3 we corrected some statements about the limiting behavior of sequences of Goldstone probes, fixed some typos and added two new references. Equivalent to the version published in JHEP
journal
J. High Energ. Phys. 2026, 66 (2026)
fields
Mathematical Physics
pdf ↗ page arXiv:2605.13804 ↗

This article establishes a bilinear embedding for second-order divergence-form operators with complex coefficients, characterized by the simultaneous presence of first-order terms and negative potentials. This work provides a further development of the theory initiated by Carbonaro and Dragičević for the homogeneous case, and recently extended by the second author in two papers where first-order terms and negative potentials were treated separately. We work in the general setting of arbitrary open subsets of $\mathbb{R}^d$ under Dirichlet, Neumann, or mixed boundary conditions. Our main contribution is the introduction of a unified notion of generalized $p$-ellipticity that extends all its predecessors and serves as the natural condition for the bilinear inequality. Methodologically, we overcome the rigidity of the Bellman-heat method on arbitrary open subsets by introducing a novel sequence-based approach that unifies and simplifies the previous techniques. As fundamental applications, we prove the boundedness of the $H^\infty$-calculus on $L^p$ and establish $L^p$-maximal regularity. Moreover, we show that this generalized $p$-ellipticity provides a sufficient condition for the $L^p$-contractivity and $L^p$-analyticity of the generated semigroup. Finally, we apply our theory to magnetic Schrödinger operators, characterizing the range of exponents $p$ for which the associated coefficient tuple satisfies the generalized $p$-ellipticity condition introduced here.

comments
In v2 we have slightly modified the presentation of our results and added the example of magnetic Schrödinger operators; 65 pages
fields
Analysis of PDEs, Classical Analysis and ODEs, Functional Analysis
pdf ↗ page arXiv:2605.14699 ↗

Stochastic optimization theory often assumes that gradient noise has uniformly bounded variance. However, this assumption can be inadequate even in simple settings; e.g., it does not hold for linear least squares regression. The Blum-Gladyshev ($\mathsf{BG}$-0) noise model instead allows the stochastic gradient variance to grow quadratically with the distance from the initialization and has recently been identified as the weakest known viable variance assumption. We study nonconvex stochastic optimization under $\mathsf{BG}$-0 noise and prove that normalized momentum converges with one stochastic gradient per iteration, reaching an $\varepsilon$-stationary point with the optimal $O(\varepsilon^{-6})$ complexity. We then show that, under mean-square smoothness, a variance-reduced normalized STORM method achieves the minimax optimal complexity of $O(\varepsilon^{-4})$. We further extend our analysis to the symmetric generalized smoothness framework, which captures objectives whose local curvature can scale with the gradient norm. To our knowledge, these are the first convergence guarantees for normalized methods in nonconvex stochastic optimization under $\mathsf{BG}$-0 noise without bounded domains.

journal
Neural Information Processing Systems, NeurIPS 2026
fields
Optimization and Control
pdf ↗ page arXiv:2605.15314 ↗

Most theoretical models of piezo-flexomagnetic nanostructures forcibly impose magnetic isolation at the structure-air interface, neglecting the external magnetic domain entirely. This mathematical compromise limits the model's capability to account for stray-field behavior in non-contact applications. To overcome this gap, our study proposes a fully coupled hybrid finite element formulation combining a 1D Timoshenko beam model with a 2D magneto-static problem, encompassing both the beam body and the surrounding air domain. By continuously mapping 1D structural kinematics into the 2D space to define the mechanically induced magnetic flux, and subsequently integrating the resulting 2D scalar potential back into 1D static generalized magnetic loads, this framework enhances the capability of the simple 1D beam model. The results present the distribution of an external magnetic flux in piezo-flexomagnetic structures and identify the material parameters driving this. Ultimately, the proposed computational method extends the boundary of a 1D beam model to an infinite-domain multiphysics environment.

comments
Accepted author manuscript. Published in Eur. J. Mech. A Solids. 31 pages, 12 figures, 3 tables
journal
European Journal of Mechanics - A/Solids (2026), 106422
fields
Numerical Analysis
pdf ↗ page arXiv:2605.19422 ↗

Neural operators are increasingly used as accelerators inside classical numerical methods, but it is rarely clear which architectural ingredients matter for which application. We answer this question for one important use case: the coarse-space correction inside a two-level preconditioner for discretised linear partial differential equations. We systematically vary four DeepONet-like architectures along two design axes: input discretisation (sampling versus integration against a basis) and source-term linearity. In doing this, we show that the favourable corner of this 2x2 design is occupied by a single architecture, the Neural Green's Operator (NGO), and that moving away from it produces predictable failure modes: highly non-normal preconditioned systems, breakdown of preconditioned conjugate gradients on self-adjoint problems, and stagnation on non-self-adjoint ones. Used as a coarse-space correction, the NGO matches the iteration count of an exact coarse solve on 2D diffusion and advection-diffusion problems. The principle generalises: integrating inputs against the basis used for the output is what allows a neural operator to serve as a Galerkin-type coarse-space correction.

fields
Numerical Analysis
pdf ↗ page arXiv:2605.19867 ↗

We are concerned with the semilinear biharmonic problem under Dirichlet boundary conditions \begin{equation*} \begin{cases} Δ^2 u=(u^+)^{p} &{\text{in}~Ω},\\[0.5mm] u \not\equiv 0 &{\text{in}~Ω},\\[0.5mm] u=\dfrac{\partial u}{\partial ν} = 0 &{\text{on}~\partial Ω}, \end{cases} \end{equation*} where $Ω\subset \mathbb{R}^4$ is a smooth bounded domain, $u^+ = \max\{u,0\}$, $ν$ denotes the outward unit normal and $p>1$ is sufficiently large. The basic concentration behavior of solutions satisfying the uniform energy bound is known. In this work, we first obtain refined asymptotic estimates for the peak heights, concentration scales and rescaled profiles of multi-spike solutions. Based on these estimates, we further analyze the generalized linearized eigenvalue problem and derive sharp bounds for the Morse and augmented Morse indices. Consequently, if the limiting $k$-spike configuration ${\mathbf{x}}_\infty$ is a nondegenerate critical point of Kirchhoff–Routh function $Ψ_k$, then \[ m(u_p)=k+n_+\big(D^2Ψ_k({\mathbf{x}}_\infty)\big) \] and $u_p$ is nondegenerate for all sufficiently large $p$ along the selected concentration subsequence. The absence of the maximum principle for the Dirichlet biharmonic operator on general domains poses main difficulties in both refined asymptotic analysis and the study of the generalized linearized eigenvalue problem. To address these difficulties, we employ Green's representation together with refined blow-up and spectral analysis.

fields
Analysis of PDEs
pdf ↗ page arXiv:2605.24338 ↗

Let $\mathcal{T}$ be a finite nonempty family of $3$-element sets, viewed as the triangles of a $2$-dimensional simplicial complex, and let $λ(\mathcal{T})$ be the smallest positive eigenvalue of its edge up-Laplacian $δ_{1,\mathcal{T}}^Tδ_{1,\mathcal{T}}$, where $δ_{1,\mathcal{T}}$ is the signed edge-triangle incidence matrix. We view $λ(\mathcal{T})$ as an analogue of the algebraic connectivity one dimension up, and study the extremal function $φ(t)=\max_{|\mathcal{T}|=t}λ(\mathcal{T})$. For every $n \geq 3$, we show that $λ(\mathcal{T}) \leq n-1$ whenever $|\mathcal{T}|<\binom{n}{3}$ and that $φ\left(\binom{n}{3}\right)=n$, attained only by the complete triple system on $n$ points. For every $n\geq 5$, we show that $φ(t) \leq n-1$ for all $\binom{n}{3} < t < \binom{n+1}{3}$. In particular, $φ$ is not monotone, while $\max_{s \leq t} φ(s)=\max\left\{n : \binom{n}{3} \leq t \right\}$. We also prove that $φ(t)=Θ(t^{\frac{1}{3}}).$ The proofs rest on two local bounds: $λ(\mathcal{T}) \leq d+2$ for every edge lying in exactly $d$ triangles of $\mathcal{T}$, and, in the spirit of Garland's local-to-global method, $λ(\mathcal{T}) \leq 1 + μ$ for every nonzero Laplacian eigenvalue $μ$ of every connected component of every vertex link. Applying Fiedler's inequality between algebraic connectivity and minimum degree to the link, the second bound gives rigidity: an edge lying in exactly $d$ triangles with $λ(\mathcal{T}) > d+1$ must lie in a complete triple system on $d+2$ points that shares no edge with the rest of $\mathcal{T}$. When $\mathcal{T}$ is the set of all triangles of a connected graph, the smallest positive eigenvalue of the Helmholtzian (edge Hodge Laplacian) is the minimum of $λ(\mathcal{T})$ and the algebraic connectivity, so both bounds apply to it.

comments
25 pages
fields
Combinatorics
pdf ↗ page arXiv:2605.27307 ↗

Let $\mathcal{H}(\mathbb{D})$ denote the space of analytic functions in the unit disc $\mathbb{D}=\{z\in\mathbb{C}:|z|<1\}$. For $0<p<\infty$ and $f\in\mathcal{H}(\mathbb{D})$, let $M_p^p(r,f)=\int_0^{2π}|f(re^{iθ})|^p \frac{dθ}{2π}$ and $M_\infty(r,f) = \sup_{|z|=r}|f(z)|$. For $0<p<q\leq \infty$, Hardy and Littlewood proved the prevalent inequality $$M_q(r,f)\le C(p,q)\frac{M_p(ρ,f)}{(ρ-r)^{\frac{1}{p}-\frac{1}{q}}}$$ for $0\leq r<ρ\leq 1$ and $f\in\mathcal{H}(\mathbb{D})$. In this paper, we obtain an improvement of this well-known inequality which is employed to characterize the symbols $g\in\mathcal{H}(\mathbb{D})$ such that the analytic paraproducts $T_gf(z)=\int_0^z f(ζ)g'(ζ)\,dζ$, $S_gf(z)=\int_0^z f'(ζ)g(ζ)\,dζ$ and $M_gf(z)=f(z)g(z)$, are bounded between two different mixed-norm spaces $A^{p,q}_ω=\{ g\in \mathcal{H}(\mathbb{D}): \int_0^1 M_p^q(r,g) ω(r)\,dr<\infty\}$ induced by a radial doubling weight $ω$. En route to the proof of these characterizations, we consider an open Carleson measure problem posed by Luecking and we solve it in a meaningful particular case.

fields
Complex Variables, Classical Analysis and ODEs, Functional Analysis
pdf ↗ page arXiv:2605.28080 ↗

This paper studies frames in Hilbert spaces generated by the orbits of finitely many vectors under a single operator, presenting new results on normal operators and multiplication operators as well as on operators composed of Jordan blocks. These results generalize existing results of Cabrelli, Molter, Paternostro and Philipp by means of techniques which deal with weighted interpolation, weighted composition operators, and Beurling–Lax theory related to shifts of finite multiplicity. Likewise, we discuss Carleson frames and construct counterexamples to a recent conjecture of Aldroubi, Cabrelli, Krishtal and Molter, showing that the relevant necessary condition is of density type rather than the Müntz–Szász condition. Moreover, by using the theory of weighted composition operators, we answer a question of Cheshmavar on frames produced by iterative multiplication. Finally, for orbits of infinitely many vectors the underlying model is a shift of infinite multiplicity which, by a theorem of Rota, is a universal operator; consequently, a complete description of such frames along these lines would encompass the Invariant Subspace Problem.

comments
26 pages, paper totally rewritten with several new results (see the abstract)
fields
Functional Analysis
pdf ↗ page arXiv:2605.29671 ↗

Dynamical systems reconstruction (DSR) aims to learn surrogate models that capture the dynamics underlying time-series data. Reliable scientific inference with these surrogates requires uncertainty estimates consistent with the learned dynamics. We expose a dynamic-probabilistic consistency (DPC) gap: optimizing finite-horizon probabilistic objectives can degrade the learned dynamics or decouple predictive uncertainty from the local tangent dynamics it should reflect. We isolate three mechanisms behind this gap: core collapse, noise masking, and blind uncertainty. Specifically, we show that open-loop rollout objectives can penalize covariance growth driven by the dynamics, encouraging optimization shortcuts that weaken local expansion. To mitigate this gap, we propose KAFFEE (Kalman-Aware Framework For Ergodic Emulation), a differentiable extended Kalman filter-based training framework that jointly learns dynamics and noise covariances by coupling filtered innovation likelihoods with covariance propagation through learned local Jacobians, while differentiating through the Kalman updates. On stochastic hyperchaotic Lorenz-96, KAFFEE mitigates the identified failure modes and improves both reconstruction of dynamical invariants and predictive scores relative to open-loop objectives. The DPC gap also appears when probabilistically adapting a DSR foundation model across 13 chaotic systems, where KAFFEE improves predictive likelihood over open-loop adaptation while preserving the pretrained model's long-term dynamics and enabling in-context Bayesian filtering.

comments
Accepted at NeurIPS 2026 (main track)
fields
Dynamical Systems
pdf ↗ page arXiv:2605.31547 ↗

We prove that the bilinear generating function for Wronskians of Hermite polynomials can be expressed as the classical Mehler kernel multiplied by a polynomial, thereby extending the result of Pupasov-Maksimov [Ann. Physics 363 (2015), 122-135, arXiv:1502.01778] for exceptional Hermite polynomials. We establish several properties of the polynomials appearing in this extended version of the Mehler formula and present four conjectures about them.

journal
SIGMA 22 (2026), 111, 19 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2606.02405 ↗

The paper is concerned with $α$-stable SDEs with singular time-inhomogeneous general drift. Our drifts satisfy e.g.\,a close to minimal possible critical Morrey class condition that covers local blow-ups of the type arising in some particle systems with strong attracting interactions. We develop detailed Sobolev regularity theory for the forward and backward equations, construct Feller propagator and prove weak existence and conditional uniqueness for the $α$-stable SDE.

comments
Fixed a few minor errors and typos
fields
Probability, Analysis of PDEs, Functional Analysis
pdf ↗ page arXiv:2606.02786 ↗

Despite the prevalence of nonautonomous systems in applications, their statistical properties are much less understood than in the autonomous setting. Building on recent results on response theory for nonautonomous systems, we study the approximation of equivariant families and of their linear response by Ulam-type finite-dimensional reductions. First, we show that coarse-graining procedures associated with the classical Ulam method, and more generally with suitable finite-element projections, such as those often associated with the Koopman/Kolmogorov operator-informed analysis of dynamical systems, provide rigorous approximation of equivariant families for sequential systems with memory loss. Second, for systems whose transfer operators are regularising, we prove that the linear response of the reduced finite-state Markov model converges to the projected linear response of the original system. We illustrate the results with numerical experiments on simple but representative time-dependent diffusive models. These results provide a rigorous foundation for the use of Markov approximations in the study of statistical properties of nonautonomous complex systems which almost invariably relies on finite-scale and finite-precision descriptions of their states and dynamics.

comments
Final version accepted in J. Computational Physics
fields
Dynamical Systems
pdf ↗ page arXiv:2606.02889 ↗

Predictive tasks constitute subprocedures within human–AI interactions (HAIs) involving professionals and AI systems. Complementarity occurs when an HAI outperforms a benchmark defined by its constituent agents. Existing formalizations, however, focus on a single human and a single AI, leaving multi-agent interactions insufficiently characterized. We introduce a tree-based mathematical framework for multi-agent complementarity. Ordered agent-role configurations decorate the leaves of rooted planar binary trees and local aggregation rules generate protocol outputs evaluated against either a best-average or a pointwise-min benchmark. We establish four results. First, under linear pooling, every protocol tree provides a bijective coordinate system for the interior of the simplex of global leaf weights. Arbitrary trees with the same ordered leaves admit output- and complementarity-preserving reparameterizations, realized locally through path-independent Tamari rotations. However, HAI constraints can violate admissibility preservation between equivalent protocols. Second, for regression under squared loss, we characterize complementarity through residual correction and derive optimal linear-pooling weights. We also characterize protocol-indifference loci under identical local parameters. Third, selector-based protocols cannot achieve complementarity relative to the pointwise-min benchmark, independently of task and loss. Fourth, in binary classification, HAIs cannot achieve complementarity under endpoint-monotone losses and the pointwise-min benchmark, with an analogous obstruction for multiclass cross-entropy. Numerical illustrations examine the main claims. We provide a mathematical foundation for analyzing multi-agent predictive subprocedures within HAIs, establishing a first step toward understanding how interaction, aggregation, and real-world constraints affect HAI performance.

comments
Improved exposition and manuscript organization, including a new figure outlining the paper's structure. Added a section examining how real-world constraints on human-AI interaction protocols affect admissibility and protocol equivalence under linear pooling. 28 pages, 8 figures
fields
Combinatorics
pdf ↗ page arXiv:2606.04779 ↗

We study whether a labeled tree can be recovered from the numbers of larger labeled trees that contract to it. We first characterize containment using the edge splits induced on a proposed survivor set and derive an exact formula for hosts with one marked display. We then study several displays in the same host. After contracting every edge invisible to all \(k\) displays of an \(n\)-vertex target, the remaining collision core has at most \(k(n-1)+1\) vertices. Once the coincidences and relative positions of the surviving labels are recorded, these bounded cores give a finite exact expansion of each collision count. We also prove that almost every sufficiently large labeled tree contains any fixed target, with an exponentially small exceptional proportion. We obtain an exact avoidance formula and generating function for star displays in which the center survivor is the largest label of the host. We call such displays top-centered. We derive fixed-star asymptotics and a coarse threshold for this restricted containment problem.

comments
30 pages, 4 figures, additions to mathematical content and updates to exposition, accepted for publication in Ars Combinatorica
fields
Combinatorics
pdf ↗ page arXiv:2606.07668 ↗

We prove a local higher integrability result for the gradient of \textit{a priori} Hölder continuous weak solutions to the parabolic double phase equation \[ \partial_t u - \operatorname{div} \left(|Du|^{p-2}Du + a(z)|Du|^{q-2}Du\right) = 0 \qquad \text{in } Ω_T. \] We work under a relaxed gap condition on the exponents $p$ and $q$. The coefficient $a$ is assumed to belong to the class $\mathcal{Z}^κ(Ω_T)$ for some $κ\in (0,\infty)$. The functions in this class satisfy a one-sided pointwise bound that controls how fast $a$ can grow away from its zero set, and the class contains the Hölder continuous functions. We also impose a \emph{mild almost increasing} condition on $a$, which motivates the introduction of a new mollification, which we call the \emph{slanted Steklov average}. For $u \in C^{0,γ,γ/q}_{\mathrm{loc}}(Ω_T)$ with $γ\in [0,1)$, our main result holds under the gap bound \begin{equation}\tag{G}\label{eq:G} 2 \le p \le q, \,\,\,\,\,\,\,\,\, (q-p)(q-2γ)\leq qκ\end{equation} The new gap condition \eqref{eq:G} is purely parabolic in nature and is stricter than the optimal gap relation associated with the Lavrentiev phenomenon for the elliptic double phase functional.

comments
42 pages, to appear in Advances in Calculus of Variations
fields
Analysis of PDEs
pdf ↗ page arXiv:2606.10590 ↗

The coefficients $A_n(α,β,ω)$ in the Maclaurin expansion $(1+ωz)^α(1-z)^{-β}=\sum_{n=0}^{\infty} A_n(α,β,ω)z^n$ are considered for $|ω|=1$ and $α,β\in(0,1]$. D. A. Brannan conjectured in a 1973 paper that $|A_n(α,β,ω)|\le A_n(α,β,1)$ for every positive odd integer $n$. The present author recently established the conjecture outside a small neighbourhood of $ω=-1$. The remaining range is treated here by combining compound Laplace integral representations with two types of local approximation: a Meijer $G$ function approximation for $n|\arg(-ω)|$ bounded, and a modified Watson approximation for the complementary range. The resulting lower bounds reduce the problem to numerical positivity checks for explicit functions on compact parameter sets. These computations verify the inequality for all $α,β\in(0,1]$ and all odd integers $n\ge5$, and hence, together with Brannan's result for $n=3$, complete the proof of his conjecture.

comments
Corrected Lemmas 6.1 and 6.2, allowing the dependence on ζto be eliminated analytically, so no numerical search for critical points in ζis needed. Independent optimization calculations were added to check the numerical infima, together with further checks of the Meijer G-function evaluations
fields
Classical Analysis and ODEs, Complex Variables
pdf ↗ page arXiv:2606.11621 ↗

Let $\mathbb F$ be either $\mathbb R$ or $\mathbb C$, and let $L$ be a nonempty extremally disconnected compact Hausdorff space. We show that $(X,C(L,\mathbb F))$ has the Bishop–Phelps–Bollobás property with $η(\varepsilon)=\varepsilon^2/2$ for every Banach space $X$ over $\mathbb F$. For each fixed $L$ and either scalar field, this bound is optimal uniformly over $X$.

comments
2nd version; the separability assumption on the domain is removed. The title is changed accordingly
fields
Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2606.12080 ↗

Analog in-memory computing enables highly parallel matrix-vector multiplications with reduced data movement, but the resulting operations are noisy, quantized, and affected by device- and circuit-level non-idealities. This paper studies approximate inverse preconditioning for Krylov subspace methods in a hybrid analog-digital architecture that combines a conventional digital processor with an analog in-memory computing (AIMC) unit. The digital host performs sparse products with the coefficient matrix and the precision-sensitive Krylov operations, while the AIMC unit performs preconditioner applications through analog crossbar matrix-vector multiplications. Since the realized preconditioner is inexact and application-dependent, the outer iteration is formulated as the flexible GMRES method. We show that analog execution changes the usual preconditioner design problem in the sense that a stronger digital preconditioner may be less effective after analog scaling, write noise, input/output perturbations, quantization, and clipping are taken into account. We use exact block inverses and sparse approximate inverses as reference constructions and develop a noise-matching criterion for Monte Carlo approximate inverse (MCAI) construction. We also study damping and nesting to improve robustness. Numerical experiments, in which analog matrix-vector products are simulated rather than executed on hardware, show that analog-aware choices of block size, damping, MCAI construction accuracy, and nesting are important for robust convergence.

comments
29 pages, 12 figures, 3 tables
fields
Numerical Analysis
pdf ↗ page arXiv:2606.17227 ↗

In this work, we investigate a chemotaxis-driven fish–mussel ecosystem model described by a coupled system of partial differential equations subject to homogeneous Neumann boundary conditions. Under suitable assumptions on the system parameters and initial data, we establish the global existence of classical solutions by employing semigroup methods together with a priori estimates. We also examine the possible blow-up behavior of solutions in a three-dimensional domain. To support the theoretical analysis, a finite element method is developed for the numerical approximation of the system, and convergence studies based on mesh refinement are carried out to verify the accuracy and stability of the proposed numerical scheme. Furthermore, numerical simulations illustrating the blow-up behavior of solutions in the computational domain are presented.

fields
Analysis of PDEs, Numerical Analysis
pdf ↗ page arXiv:2606.18695 ↗

We derive upper bounds for the Lagrangian capacities of Liouville domains with finite Gutt–Hutchings capacities and show that the Lagrangian capacity of a convex or concave toric domain of arbitrary dimension equals its diagonal. In particular, this completely settles the conjecture of Cieliebak-Mohnke on the Lagrangian capacity of ellipsoids. Our proof is based on an $S^1$-equivariant variant of the techniques of Fukaya and Irie, and does not use holomorphic curves with local tangency constraints, which would inevitably cause transversality issues. Moreover, we show that any extremal Lagrangian torus in an $2n$-dimensional ellipsoid must lie on the boundary. Applications of our results and techniques include include a proof of the fact that every monotone Lagrangian torus in the complex projective space has non-trivial intersections with the Clifford torus and the first computations of the Lagrangian capacities for many non-subcritical Weinstein domains in dimensions 4 and 6.

comments
v3: 63 pages, 5 figures. Added the result that every monotone Lagrangian torus in the complex projective space has non-trivial intersections with the Clifford torus and corrected a computational error in Section 8.2.3
fields
Symplectic Geometry, Geometric Topology
pdf ↗ page arXiv:2606.20051 ↗

The $(p,q)$-deformed generalized Weyl algebra is generated by variables $X, Y$ and $Z_p$ which satisfy the commutation relations $XY-qYX=h Y^sZ_{p}, XZ_p=pZ_pX$, and $Z_pY=pYZ_p$, with $s\in \mathbb{N}_0$ and where $p^s=1$. We investigate the problem of normal ordering arbitrary words in these letters with the help of Young diagrams, and we treat certain special cases explicitly. In particular, the connection to generalized Stirling numbers is considered in detail.

comments
23 pages
fields
Combinatorics
pdf ↗ page arXiv:2606.22585 ↗

We study moduli spaces of modular vector bundles on projective irreducible holomorphic symplectic manifolds of $K3^{[n]}$-type. Under suitable numerical assumptions, we exhibit connected components of these moduli spaces which are again irreducible holomorphic symplectic manifolds of $K3^{[n]}$-type. Moreover, the corresponding universal families induce derived equivalences with the original manifolds. This produces smooth components of moduli spaces of modular vector bundles on irreducible holomorphic symplectic manifolds of any even dimension.

comments
29 pages, comments welcome. Rewritten and expanded Appendix A; results unchanged
fields
Algebraic Geometry
pdf ↗ page arXiv:2606.23622 ↗

In this paper, we classify the hypersurfaces of $\mathbb{H}^2\times\mathbb{H}^2$ with constant sectional curvature. In contrast to the case of $\mathbb{S}^2\times\mathbb{S}^2$, the resulting examples for $\mathbb{H}^2\times\mathbb{H}^2$ exhibit greater diversity, and we construct a special example with non-constant product angle function. For $\mathbb{S}^2\times\mathbb{S}^2$, however, the product angle function of any constant sectional curvature hypersurface is identically zero. As a byproduct, we also classify the hypersurfaces of $\mathbb{H}^2\times\mathbb{H}^2$ with constant product angle function and constant mean curvature (or constant scalar curvature).

comments
48 pages. Comments are welcome
fields
Differential Geometry
pdf ↗ page arXiv:2606.24686 ↗

For Baker's Borel-rectangle measure $μ$ and $1\le p<\infty$, we classify the continuous vectors of each one-parameter translation group on $L^p(μ)$. For each $v\in\mathbb{R}^\mathbb{N}$, the continuous vectors form a projection band, which coincides with the whole space when $v$ has finite support, is trivial when $v\notin\ell^1$, and is nonzero and proper otherwise. We also establish in ZFC the isometric classification considered in [Isometric classification of the $L^{p}$-spaces of infinite dimensional Lebesgue measure, Banach J. Math. Anal. 20 (2026), no. 1, Paper No. 7], showing that both $L^p(μ)$ and the kernel of restriction to integer cubes are lattice isometric to $\ell^p(\mathfrak{c},L^p[0,1])$. When $v\in\ell^1\setminus c_{00}$, the continuous band and its disjoint complement have the same lattice-isometric structure, with the latter contained in the cube-restriction kernel.

fields
Functional Analysis
pdf ↗ page arXiv:2606.24718 ↗

We study the zero-threshold lifting problem for polynomial multiple correlation sequences with respect to the measure-theoretic pro-nilfactor. The structure theory for polynomial multiple averages implies that, at every positive threshold, positivity on the pro-nilfactor lifts to positivity in the original system, except on a set of zero upper Banach density. We demonstrate that this lifting property does not hold at the zero threshold. Specifically, we construct an ergodic system and two sets of positive measure for which the pro-nilfactor correlation is positive along a set of times with positive upper density, while the corresponding exact correlation vanishes on this set. This provides a negative answer to a question posed by Glasscock, Koutsogiannis, Le, Moreira, Richter, and Robertson. %\cite{GKLMMRR}. Additionally, we prove a corresponding rigidity property. For any ergodic system, any essentially distinct family of integer polynomials vanishing at the origin, and any tuple of non-negative bounded functions, the zero-threshold discrepancy set is not piecewise syndetic.

comments
16 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2606.25581 ↗

The gravitational field of a distant, isolated system is manifested by the conformally invariant Weyl tensor. Thus the conformal structure far from the system encodes the system's gravitational mass. It also encodes the causal structure, thereby linking it to the mass. For asymptotically anti-de Sitter (AdS) spacetimes, this link led to a novel positive mass theorem of Page, Surya, and the second author \cite{PSW} which did not rely on any traditional energy condition. Here we ask whether that theorem has a rigidity case. Specifically, we consider all null geodesics in an asymptotically AdS spacetime that depart from the Penrose conformal infinity, travel through spacetime, and return to conformal infinity. If all such geodesics from a given point refocus at an antipodal point at infinity, is the spacetime conformal to anti-de Sitter space? It is easy to answer the question if the asymptotically AdS spacetime either (i) obeys the null energy condition in 3 or 4 spacetime dimensions, or (ii) is static (in any dimension), and we give simple proofs in those cases. We then answer the question in the case of globally stationary, asymptotically AdS spacetimes, by applying the theory of magnetic geodesics on the Riemannian manifold-with-boundary obtained by quotienting by the stationary Killing vector field. The question has an analogue for asymptotically flat spacetimes, which we also discuss.

comments
Typos fixed, other minor revisions, assumptions in Theorems 3.1 and 4.4 clarified
fields
Differential Geometry
pdf ↗ page arXiv:2606.28689 ↗

We show that the Hankel flat extension formulation of the cactus algorithm is equivalent to a completion problem for multiplication tensors of Artinian Gorenstein algebras. The unknown Hankel moments are canonically identified with the undetermined tensor coefficients, and under this identification the symbolic multiplication matrices and their commutation equations coincide. This shows that the usual degree extension formulation is a coordinate realization of a variable extension problem with marked generators. We further use Borel-fixed and squat staircases to reduce the family of candidate basis shapes in the resulting algorithm.

comments
v2: only changes in (human) Acknowledgements
fields
Commutative Algebra
pdf ↗ page arXiv:2606.30600 ↗

We investigate matrices with entries in a number field such that some positive power has all its entries in the corresponding ring of integers. Our work generalizes previous results in several directions and we find applications to numerical semigroups.

comments
10 pages
fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2606.30876 ↗

We review the notion of homotopy of quantum master actions in geometric Batalin-Vilkovisky formalism. Then we construct new examples of such homotopies, coming from renormalization group flow and non-infinitesimal changes of gauge fixing. Finally, we use the field redefinitions given by these homotopies to construct spans of quantum master actions with isomorphic effective actions.

comments
45 pages; v2 - version published in Journal of Geometry and Physics. Corrected some typos and minor sign inconsistencies, clarified connection to the literature in Sections 4.2.3 and 6.1, added some missing references
journal
J. Geom. Phys., Vol. 232 (2027)
fields
Mathematical Physics, Differential Geometry, Symplectic Geometry
pdf ↗ page arXiv:2606.30965 ↗

We study binary classification tasks whose decision sets are given by definable sets in o-minimal expansions of the real field. Motivated by the cell decomposition theory of definable sets, we introduce traceable sets that isolate the analytical properties of definable sets used for fast approximation by ReLU neural networks. Under uniform bounds on the number of cells and a suitable extension assumption for the boundary functions, we prove that classifiers can be approximated in $L^p$ up to accuracy $\varepsilon>0$ by ReLU neural networks of size $\mathcal{O}(\varepsilon^{-p(n-1)/m})$, with depth independent of $\varepsilon$ and polynomially bounded weights. This establishes quantitative approximation rates for suitable definable collections in o-minimal structures using ReLU neural networks. Furthermore, the stated approximation rates are also derived for definable maps under similar geometric assumptions on their smoothness domains. We then obtain statistical learning rates for empirical risk minimization with hinge loss over the approximating ReLU neural network classes. For $N$ uniformly distributed samples, the predicted classifiers achieve expected misclassification error of order $N^{-m/(m+n-1)}$ up to an arbitrarily small polynomial loss.

fields
Logic, Functional Analysis
pdf ↗ page arXiv:2607.01266 ↗

We consider a mathematical model of a poroviscoelastic medium subject to frictional contact with a rigid obstacle, and study its numerical approximation. This model couples the Biot equations and contact conditions in the form of normal compliance and Coulomb friction. The resulting variational problem consists of a linear partial differential equation coupled to a nonlinear variational inequality. We propose and analyze a fully discrete numerical scheme for this problem, using conformal finite elements in space and the implicit Euler method in time. Existence and uniqueness of the discrete solution is established, and stability and a priori error estimates are derived. A numerical experiment is performed in which numerical error estimates are computed and compared to the theoretical results.

fields
Numerical Analysis
pdf ↗ page arXiv:2607.02030 ↗

For each integer $K\geq2$ when $n\geq4$, and for $K=2,3,4$ when $n=3$, we construct an almost-calibrated Lagrangian mean curvature flow $L_K(t)$ in $\mathbb{C}^{n}$, starting from initial data arbitrarily close to being special Lagrangian, which develops a finite-time Type II singularity at time $T$ with the explicit curvature blow up rate \[ \sup_{L_{K}(t)} |\mathbf{A}_{L_{K}(t)}| \sim (T-t)^{-K/2} \qquad \text{as } t\nearrow T . \] The tangent flow at the singularity is a transverse pair of cohomogeneity-one special Lagrangian cones, while the Type II blow-up limit is a smooth cohomogeneity-one special Lagrangian desingularization. This gives a quantitative construction of Type II blow-up for a fully nonlinear parabolic PDE arising from cohomogeneity-one Lagrangian mean curvature flow. Our construction is based on a modulation analysis around a shrinking family of cohomogeneity-one special Lagrangian desingularizations, using the perturbative spectral theory developed in the companion paper.

comments
114 pages, 1 figure. Comments welcome. Corrected minor errors and added Appendix B
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2607.03152 ↗

We develop a new approach to cross-intersection problems in extremal set theory. The method builds on the iterative procedure introduced by Kupavskii and Zakharov (2024) and the $t$-cover method. It provides a flexible framework for deriving extremal and stability results for cross $t$-intersecting families. Our approach applies to a variety of combinatorial objects. As an application, we prove a product version of the seminal Erdős–Ko–Rado theorem for sufficiently spread set systems. Two families $\mathcal{F}$ and $\mathcal{G}$ of $k$-subsets of $[n]$ are called cross $t$-intersecting if $|F\cap G|\geq t$ for all $F\in\mathcal{F}$ and $G\in\mathcal{G}$. We determine the families maximizing $\min\{|\mathcal{F}|, |\mathcal{G}|\}$ for large $n$ and all $t\ge2$, generalizing results of Mörs (1985) and Füredi (1995) for cross $1$-intersecting families. We then determine the families maximizing $|\mathcal{F}||\mathcal{G}|$ under the condition $\max\{|\cap_{F\in\mathcal{F}}F|,|\cap_{G\in\mathcal{G}}G|\}<t$ for large $n$. This improves the bound obtained by Frankl and Wang (2024), and provides a characterization of extremal configurations. For a family $\mathcal{F}$ of subsets of $[n]$, we introduce its $t$-diversity $γ_t(\mathcal{F})$, defined as the minimum number of sets from $\mathcal{F}$ not containing a fixed $t$-subset. This serves as a natural generalization of the important notion of diversity for $t=1$. We obtain a stability result via $γ_t$, and determine the maximum of $\min\{γ_t(\mathcal{F}),γ_t(\mathcal{G})\}$ for cross $t$-intersecting families $\mathcal{F}$ and $\mathcal{G}$. These yield new results for $t$-intersecting families, including a stability theorem towards a conjecture of Ellis, Keller and Lifshitz (2019), which may also be regarded as a $t$-intersection version, for large $n$, of an influential theorem of Frankl (1987).

fields
Combinatorics
pdf ↗ page arXiv:2607.03315 ↗

Tate produced a table for elliptic curves over local fields that beautifully summarises their arithmetic invariants in terms of the Kodaira type. We present an analogous set of tables for curves of genus 2. The invariants addressed include: reduction type of the minimal regular model, reduction type of the minimal regular model with normal crossings, Néron component group of the Jacobian, conductor exponent, valuation of the discriminant of a minimal Weierstrass model, and cluster pictures.

comments
minor changes, tables available at https://elviralupoian.github.io/genus2reductiontypes/
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2607.07558 ↗

A factorization exact for the continuous Laplace–rotation flow need not preserve time symmetry when implemented stage by stage on a Fourier grid. We analyze two explicit exact integrators (EEIs) for rotating Bose–Einstein condensates. For the seven-factor EEI, a constant-state Fourier coefficient proves that its fixed-grid logarithm has a nonzero quadratic defect on every centered even grid for any nonzero rotation vector. For a distinct five-operator EEI, a nonconstant-mode certificate proves the same obstruction on nonsingular coefficient branches whenever at least two rotation components are nonzero. In real-coefficient compact splitting, merging adjacent linear stages with fractions $c_j$ multiplies either defect by the strictly positive factor $κ=\sum_jc_j^2$; nominal high order therefore cannot be guaranteed uniformly at fixed grid. For the seven-factor implementation, the accumulated-response formula predicts $κ_4/κ_6\approx0.7606$ for nominal fourth- and sixth-order compact schemes (CS4/CS6). Scalar dipolar and spin-1 tests of that implementation verify the predicted amplitude ratio and reveal a crossover toward first-order compact behavior under time refinement. Pairing a forward linear half-step with its method adjoint around the exact nonlinear flow restores symmetry of the complete step; classical compositions then recover fourth and sixth order at fixed grid. The analysis provides explicit structural diagnostics and a direct structure-preserving repair.

comments
Replacement of the original manuscript "Admissible Discrete Linear Propagators for High-Order Time Splittings of Rotational Nonlinear Schrödinger Equations with Arbitrary Three-Dimensional Rotation"
fields
Numerical Analysis
pdf ↗ page arXiv:2607.07923 ↗

We establish a unified theory for exact dimensional reductions in network dynamical systems using Lie-Scheffers theory. For network dynamical systems with mean-field Lie-Scheffers structure, we prove that networks of $n$ nodes with local dimension $d$ can be exactly reduced from $nd$ dimensions to a fixed macroscopic system of dimension $md$, where $m$ is the number of fundamental solutions required by the nodal dynamics. Crucially, the superposition rule resulting from the Lie-algebraic structure allows the mean-field coupling to be expressed explicitly in terms of the macroscopic variables, yielding a closed self-consistent system independent of the network size $n$. This reduction collapses the high-dimensional network flow onto (typically) low dimensional invariant manifolds parameterized by $γ=d(n-m)$ independent constants of motion. We illustrate the theory on systems with mean-field Lie-Scheffers structure: ensembles of Riccati equations (recovering known reductions for the Kuramoto model and Theta neuron model), recently studied quasi-linear ODEs, as well as a new class of generalized Bernoulli equations; we explicitly derive the macroscopic flows and conserved quantities for each case. Thus, our theory rigorously explains known reductions and provides a systematic method to discover new ones.

fields
Dynamical Systems
pdf ↗ page arXiv:2607.12210 ↗

Scenario-based model predictive control (SBMPC) is a variant of model predictive control (MPC) that explicitly accounts for uncertainty by optimizing control actions over multiple predicted scenarios. However, its computational complexity increases rapidly with the number of scenarios and prediction horizon, limiting its applicability to real-time planning and control. This paper presents a learning-accelerated Alternating Direction Method of Multipliers (ADMM) algorithm for efficiently solving SBMPC problems by leveraging parallel computing and Moreau envelope learning, while maintaining high solution accuracy. We reformulate the SBMPC problems into consensus forms that can be decomposed via ADMM, separating the scenario-dependent dynamics from non-anticipativity constraints and enabling parallel updates across scenarios and time steps. Building on this decomposition, we utilize a learning-to-optimize scheme that leverages Moreau envelope learning of the cost function to accelerate the primal update in ADMM, thereby reducing computation time. The proposed framework is evaluated on a microgrid energy management problem subject to load and renewable generation uncertainties. Comparisons with IPOPT and MadNLP, two popular and modern nonlinear programming solvers, demonstrate substantial computational speedups while maintaining reliable closed-loop control performance.

fields
Optimization and Control
pdf ↗ page arXiv:2607.12775 ↗

Fast and accurate classical simulation of quantum systems is a central challenge in the design and control of quantum computers, but the highly oscillatory dynamics of these systems severely limit the efficiency of standard numerical methods. To address this, we adapt Filon quadrature for oscillatory integrals into two numerical methods, called Filon and Controlled Filon, for solving linear systems of ODEs with highly oscillatory solutions. We tailor both methods for efficient implementation in controlled quantum systems, and the Controlled Filon method additionally accounts for the oscillatory structure of the control pulses. We show by numerical experiments that these methods significantly reduce the computational cost of accurately simulating systems of superconducting transmon qubits by decreasing the number of timesteps needed to reach a given level of precision, with only a modest increase in the cost per timestep. For a realistic simulation of the dynamics of a CNOT gate, the Controlled Filon method is the most efficient method tested at every target accuracy, outperforming the best Hermite method by up to 6x and the Hermite method of the same order by up to 500x.

comments
26 pages, 4 figures, 3 tables
fields
Numerical Analysis
pdf ↗ page arXiv:2607.13580 ↗

We study linear and anti-linear operators on the Hardy space $H^2$ in connection with the Beurling lattice. First, in contrast to Sarason's result \cite{S1}, we show that no non-zero anti-linear operator leaves every shift-invariant subspace invariant. Then we completely characterize the class of conjugations, isometries, and invertible linear operators preserving the shift-invariant subspace structure in terms of weighted composition operators induced by disk automorphisms–combined with the canonical conjugation, isometric multiplication, and invertible Toeplitz operators, respectively. We also establish the existence and non-existence of conjugations that map shift-invariant subspaces to coinvariant subspaces. Finally, we construct a counterexample that rules out an analogous factorization for bounded linear operators preserving shift-invariance of closed images.

comments
Thoroughly revised. Comments are welcome
fields
Functional Analysis
pdf ↗ page arXiv:2607.13915 ↗

In parallel tempering, exchanging the positions of the replicas (swapping) and exchanging the assignment of dynamics to the replicas (switching) are often used interchangeably. We study the two descriptions as stochastic processes, for Markov species (the dynamics that are exchanged) and bounded measurable exchange rates. To guarantee the Markovianity of each process under the exchanges, switching records both the positions and the label that tracks which species each replica carries; swapping records only the positions. Driving both with one exchange clock places them on a common probability space and lets us write swapping as switching with the label forgotten. This relation holds pathwise at every time and, once decomposed over the label, yields an exact identity between their transition kernels. This characterisation lets us relate, in a precise way, where the two processes agree and where they differ. We describe mainly the relation between their decay rates at finite exchange rate, and between their distributions and observables at finite and infinite exchange rate. The relation between the Markovianity of the two is particularly interesting. At finite rate, switching needs the label to be Markov, while swapping is Markov on its own. In the infinite-rate limit this reverses: swapping becomes non-tight, while switching becomes Markov on the physical coordinates alone. We illustrate all these relations on a solvable benchmark of two Brownian motions with drift under a constant exchange rate. The rich behaviour already visible in this simple case, and developed throughout the paper, suggests that the swapping mechanism is of interest in its own right, beyond the balance conditions needed in parallel tempering.

fields
Probability
pdf ↗ page arXiv:2607.14266 ↗

As a continuation of our previous work, where bifurcations of periodic and antiperiodic orbits near an equilibrium were studied for autonomous differential delay systems with one or two delays, this paper investigates bifurcations of periodic and antiperiodic solutions for five classes of non-autonomous potential delay differential systems with multiple delays. By reformulating these systems as generalized Hamiltonian systems on Euclidean spaces, we apply the Hamiltonian bifurcation theory recently developed by the author to establish alternative bifurcation results of both Fadell-Rabinowitz and Rabinowitz type.

comments
Latex, 40 pages, published version
journal
J. Fixed Point Theory Appl. (2026) 28:89
fields
Dynamical Systems
pdf ↗ page arXiv:2607.14538 ↗

We introduce analogues of partial derivatives with respect to the generators of the enveloping algebras $U(gl(N))$ and their $q$-deformations, the so-called modified reflection equation algebras. Using these quantum partial derivatives, we introduce the corresponding differential algebras, define the quantum de Rham operator, and exhibit the Leibniz rule for its action. Our Leibniz rule differs from its classical analogue and stems from the construction of a quantum double. In the case of the algebra $U(gl(N))$, we present another form of the Leibniz rule that is more convenient for prolonging the differential calculus to certain extensions of this algebra. We then use analogues of the Cayley–Hamilton identity for the generating matrices of $U(gl(N))$ and of reflection equation algebras to construct projective modules over these algebras. For these projective modules, we introduce Grassmannian connections and define the corresponding Chern classes.

comments
Minor changes are made, some misprints are corrected. Accepted to Journal of Noncommutative Geometry
fields
Quantum Algebra
pdf ↗ page arXiv:2607.16480 ↗

The biperiodic Fibonacci word $\mathfrak{F}^{(a,b)}$ is the standard Sturmian word with directive sequence $(a,b,a,b,\dots)$. The words $\mathfrak{F}^{(a,b)}$ and $\mathfrak{F}^{(b,a)}$ are related by the morphism $σ_a\colon 0\mapsto 0^a1,\ 1\mapsto 0$ through the exact identity $\mathfrak{F}^{(a,b)}=σ_a\bigl(\mathfrak{F}^{(b,a)}\bigr)$. This identity gives the letter frequencies, the return words of both letters, the derived sequence with respect to the letter $0$, and the transport of palindromic prefixes from $\mathfrak{F}^{(b,a)}$ to $\mathfrak{F}^{(a,b)}$. The slope of $\mathfrak{F}^{(a,b)}$ has the continued fraction expansion $[0;a+1,\overline{b,a}]$, and the critical exponent equals $2+α/\min(a,b)$, where $α$ is the positive root of $t^2-ab\,t-ab=0$. The frequency of the letter $1$ and the return words of $1$ depend on the order of $a$ and $b$, whereas the critical exponent, the balance, the abelian complexity and the palindromic complexity do not.

comments
17 pages
fields
General Mathematics
pdf ↗ page arXiv:2607.16844 ↗

Recent works of Galligo, Najnudel, and Vu (2025) and Najnudel and Vu (2026) study repeated differentiation for polynomials of the form $P(z)=p(z^m)$, where $p$ is a deterministic polynomial of degree $n$ with real, non-negative roots, in the regime where $m$ and $n$ are large. If $m\gg \log(n)$ and the root distribution of $P$ converges to a compactly supported, radial probability measure $μ_0$, these works show that for $0\le t<1$, the root distribution of the $\lfloor nmt\rfloor$-th derivative of $P$ converges to a compactly supported probability measure $μ_t$ given by an explicit formula for its radial quantile function. We give a substantially simplified proof of this result and also extend the result from repeated differentiation to repeated applications of the differential operator $z^a(d/dz)^b$. Our proof is based on new, sharp estimates on the roots of polynomial with real, non-negative roots in terms of the coefficients of the polynomial. We also compute the limiting root distribution in the case when $m$ is fixed and $n$ tends to infinity. Then letting $m$ tend to infinity we obtain the same limit as before. Along the way, we prove a generalization of the free multiplicative law of large numbers that is of independent interest.

comments
19 pages, 2 figures, v2 includes a new result, Theorem 3.10, and remarks on its implications
fields
Probability, Mathematical Physics, Operator Algebras
pdf ↗ page arXiv:2607.16954 ↗

We study two classes of oscillatory Gegenbauer-type weight functions. One is $w_1(x)=(1-x^2)^{λ-1/2}\exp(iζx),x\in[-1,1]$, where $λ>-1/2$ is rational and $ζ\in\mathbb{R}\setminus\{0\}$ is a zero of the Bessel function $J_{λ-1}$. The other is $w_2(x)=x(1-x^{2})^{γ-1/2} \exp(\mathit{i}ηx), x\in[-1,1]$, where $γ$ and $η$ are chosen such that the corresponding orthogonal polynomials exist. By using the ladder operators established in recent work for monic orthogonal polynomials associated with Jacobi-type weight functions and three compatibility conditions, we derive two coupled difference equations for the three-term recurrence coefficients corresponding to $w_1$ and $w_2$, respectively. For $w_1$, and for $w_2$ where $γ=0$ and $η$ is a positive zero of $J_0$, or $γ=1/2$ and $η=mπ$ with $m$ denoting a nonzero integer, we determine the initial values for the recurrence coefficients and compute the first few terms via the difference equations. Then we conjecture general-$n$ symbolic forms for the recurrence coefficients and for $\textbf{p}(n)$, the coefficient of $x^{n-1}$ in the monic orthogonal polynomial of degree $n$. The case $λ=0$ in $w_1$ is treated separately, since the conjectured general-$λ$ forms degenerate here, yielding substantially different results. For $w_1$, we also derive a third-order difference equation satisfied by $\textbf{p}(n)$.

fields
Mathematical Physics
pdf ↗ page arXiv:2607.19797 ↗

Ivanov's theorem recovers the mapping class group of a surface from its curve complex. We study the analogous question for the essential-surface complex $\mathcal{ES}(E)$ of a knot exterior $E=E(K)$, equivalently Schultens's initial surface complex, organized around three questions: which combinatorial symmetries are geometric (the image), which homeomorphisms are invisible (the kernel), and how much of $E$ can be read off from the complex (reconstruction). Call a knot slope-separated if its exterior contains no closed and no meridional essential surface and at most one essential surface for each boundary slope. For such a knot every orientation-preserving mapping class acts trivially on $\mathcal{ES}(E)$, and the image of the action is $\mathbb{Z}/2$ exactly when the knot is amphichiral and has a nonzero boundary slope. Torus knots are determined among all knots by the complex decorated with surface types and boundary slopes, and for a connected sum of nonfibered prime knots the decomposing-annulus twist translates Banks's winding coordinate, so an infinite cyclic subgroup is visible. For two-bridge knots the problem is solved in a companion paper, whose results are surveyed here without proofs. The article is written as an entry point: the objects are first drawn in classical examples, the elementary structure theory (flag property, layering by boundary slope, finite but unbounded dimension, Kakimizu's complexes as full subcomplexes) is collected with proofs, and the article closes with a three-task formulation of the rigidity problem, a list of problems with their current status, and a worked two-bridge recipe.

comments
57 pages, 20 figures, 4 tables. v2: revised and expanded; Section 9 now surveys, without proofs, the results on two-bridge knots proved in the companion paper "Essential-surface complexes of two-bridge knots" (https://doi.org/10.5281/zenodo.24148271)
fields
Geometric Topology
pdf ↗ page arXiv:2607.20869 ↗

Cooperative multi-task semantic communication (CMT-SemCom) improves task execution performance by leveraging shared representations. However, as we demonstrated in [1], cooperative multi-tasking can be either constructive or destructive, depending on the semantic relationships among tasks. To ensure constructive cooperation, we propose a semantic-aware task clustering method for CMT-SemCom. We have formulated a sequential multi-stage optimization problem in which semantically aligned tasks are clustered once after a short initial training phase, and then end-to-end (E2E) joint training is conducted exclusively within the discovered groups. Specifically, the problem decomposes into two stages: (i) a semantic clustering problem leveraging hierarchical density-based spatial clustering, and (ii) an intra-cluster E2E CMT-SemCom learning problem. Simulation results demonstrate that the proposed framework effectively mitigates destructive cooperation and negative transfer, yielding accuracy gains compared to unclustered multi-tasking and individual training baselines.

comments
Accepted in IEEE GLOBECOM 2026
fields
Information Theory
pdf ↗ page arXiv:2607.21426 ↗

We present a new algorithm to determine whether a compact orientable surface properly embedded in a compact orientable 3-manifold is incompressible. As a special case, this provides a new algorithm to detect the unknot. The central technique is the use of hierarchies. Unlike previous algorithms, no challenging invariants need to be computed and no lengthy search procedures are required. This algorithm leads to a new proof that determining whether a compact orientable 3-manifold has incompressible boundary is in NP.

comments
v2: 61 pages, 14 figures. Sections 12-14 have been restructured, and several other corrections have been made. The main theorems and the main algorithm are unchanged
fields
Geometric Topology
pdf ↗ page arXiv:2607.23350 ↗

We study the stochastic differential equation \[ dX_t=a\bigl(b(t)-X_t\bigr)\,dt+\bigl(σ_0+σ_1\sqrt{φ_\eps(X_t)}\bigr)\,dZ_t^{(q,H)}, \qquad X_0=x_0, \] where $Z^{(q,H)}$ is a Hermite process of order $q\geq1$ and Hurst parameter $H\in(1/2,1)$, $b$ is a periodic target, $σ_0>0$, and $φ_\eps$ is a smooth positive function equal to $x+\eps$ on $[0,\infty)$. The equation is understood pathwise, in the sense of Young. We prove that it has a unique solution. We give lower bounds on the probability that the solution stays positive on $[0,T]$, for every $σ_1\geq0$: after a Lamperti-type change of variables, which makes the noise additive, a last-passage argument shows that the probability of reaching $0$ before $T$ is at most of order $\exp(-c\,Λ(m_0)^{2/q}/T^{2H/q})$, where $m_0$ is the smaller of the initial level and the minimum of the target and $Λ$ is the natural scale of the diffusion coefficient. For $q\le2$ and $σ_1=0$ we show that the solution reaches negative values with positive probability, so that no almost-sure positivity holds in that case. Finally, the solution at each time belongs to $\D^{1,\infty}$, with an explicit representation of its Malliavin derivative, and its law is absolutely continuous with respect to Lebesgue measure. The proofs of these two results are self-contained and rely on the additive form of the equation. Numerical experiments based on a wavelet-type simulation of Hermite processes illustrate the results.

comments
32 pages, 4 figures. v2: substantially revised. New result on the failure of almost-sure positivity for q <= 2; self-contained proof of Malliavin differentiability and absolute continuity; simplified moment bounds; simulations redone with a corrected normalisation of the simulated Hermite processes; references updated
fields
Probability
pdf ↗ page arXiv:2607.23548 ↗

In this expository-research article we present a rigorous geometric framework for analytical mechanics in the extended phase space, accommodating general constraints that may be non-linear in velocities. We prove that the space of virtual displacements and ideal constraint reactions depend strictly on the intrinsic geometry of the constraint manifold and are entirely invariant under the choice of analytical constraint equations. Furthermore, we show that the Lagrange equations of the second kind are derived through the covector covariance of the variational derivative operator under the embedding mapping of the configuration manifold.

fields
History and Overview, Mathematical Physics
pdf ↗ page arXiv:2607.24825 ↗

We introduce the category of d-spectral spaces, a bitopological analogue of the spectral spaces of Stone and Hochster. A d-spectral space is a bitopological space satisfying three conditions: the join of its two topologies is compact, it is d-sober in the sense of Jung and Moshier, and each of its two topologies is a coherent frame. We establish a dual equivalence between this category and the category of d-lattices satisfying the finitary cut rules. The constructions implementing the duality are the d-lattice of compact open sets of a d-spectral space and the d-spectrum construction for d-lattices. We further show that spectral spaces embed as a full subcategory of d-spectral spaces that is both reflective and coreflective. Finally, the patch space of a d-spectral space is d-Boolean, and its de Groot dual is again d-spectral, mirroring the classical spectral case.

comments
26 pages
fields
General Topology
pdf ↗ page arXiv:2607.26484 ↗

We prove that the inclusion of left-invariant forms into the Dolbeault complex of a compact nilmanifold $M$ endowed with a left-invariant complex structure $J$ induces an isomorphism in cohomology in every bidegree, settling a long-standing conjecture originating from a question of Console-Fino and Cordero-Fernández-Gray-Ugarte. As consequences, we show that small deformations of $J$ are still invariant, as conjectured by Hasegawa, and that Bott-Chern, Aeppli, and Frölicher invariants are computed by invariant forms and are independent of the lattice, settling a conjecture of Angella on Bott-Chern cohomology.

comments
25 pages, no figures. v2: Expanded and clarified proofs and exposition, with explicit polynomial degree bounds and a fuller treatment of deformations; main results unchanged
fields
Differential Geometry
pdf ↗ page arXiv:2607.26786 ↗

This note proves existence and uniqueness of strong solutions to a broad class of fourth-order quasi-linear parabolic equations in the class of Wiener spaces. It improves upon previous results in the literature, devoted to some special cases falling within the general framework developed here, in which uniqueness held true in a smaller class than the space where existence was proven. Gain of analyticity, as well as generalisations to higher-order equations and to propagation of higher regularities, are also discussed.

comments
V2: sections 4, 5.2 and 6 deeply revised
fields
Analysis of PDEs
pdf ↗ page arXiv:2607.27451 ↗

In this paper, we study a class of nonlinear Schrödinger equations (NLS) in a unified way. This class includes two important examples: the intermediate NLS (INLS) and the Calogero–Moser derivative NLS (CM-DNLS). Our main results are twofold. First, we prove small-data global well-posedness in $L^2(\mathbb{R})$ for a broad class of equations. This includes both focusing and defocusing CM-DNLS and the INLS for arbitrary choices of its parameters. Second, we prove small-data scattering in $L^2(\mathbb{R})$ under an additional assumption. This result covers both focusing and defocusing CM-DNLS and the INLS for specific choices of its parameters. Both the formulation of the problem, including the notion of solution, and the proofs rely crucially on a linear theory for Schrödinger equations with rough time-dependent potentials. This theory is also of independent interest, since we allow potentials so rough that the standard Duhamel formulation may not make sense. Our approach is perturbative and is built on the bilinear Strichartz estimate proved by Ozawa and Tsutsumi in 1998. In particular, our argument does not rely on integrability.

comments
33 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2608.01138 ↗

In this paper, we introduce the notion of adaptive strong monotonicity and establish a linear convergence of the recently proposed Generalized Proximal Point Algorithm (GPPA) for computing approximate solutions to nonmonotone inclusion problems in Hilbert spaces. We also investigate the Inexact Generalized Proximal Point Algorithm (IGPPA) in the presence of nondiminishing errors.

fields
Optimization and Control
pdf ↗ page arXiv:2608.01584 ↗

Let $\mathcal P_k=\mathbb F_2[x_1,\ldots,x_k]$, with $°x_i=1$, be the polynomial algebra equipped with the standard unstable action of the mod-$2$ Steenrod algebra $\mathcal A$. The Peterson hit problem asks for a minimal homogeneous set of $\mathcal A$-generators for $\mathcal P_k$, or equivalently for a homogeneous basis of the cohit space $Q\mathcal P_k=\mathcal P_k/\mathcal A^+\mathcal P_k = \mathbb F_2\otimes_{\mathcal A}\mathcal P_k$, where $\mathcal A^+ $ denotes the augmentation ideal of $\mathcal A$. The dimension of $(Q\mathcal P_k)_d$ therefore gives the number of generators required in positive degree $d$. Although solved in every degree $d$ for $k\leq 4,$ the problem remains open in general. As the number of variables $k$ and degrees $d$ increase, exact calculations involve increasingly large systems of Steenrod relations. Motivated by this difficulty, in this work, we establish explicit upper and lower bounds for $\dim_{\mathbb F_2}(Q\mathcal P_k)_d$ for arbitrary positive integers $k$ and $d$. Our method combines binary combinatorics and linear algebra with graph-theoretic and simplicial structures in the matrix of the generating Steenrod squares.

comments
26 pages. Abstract and Introduction rewritten for clarity. Added exact counts for all singleton columns and projected zero columns. Expanded the dual-spike lower bounds with a new explicit family from disjoint variable pairs. Added a new remark (Remark 2.3) clarifying the distinction between the evaluation hit matrix used in this work and classical Milnor matrices
fields
Algebraic Topology, Combinatorics
pdf ↗ page arXiv:2608.02623 ↗

In this work, we investigate permutation decoding for algebraic geometry (AG) codes arising from algebraic curves defined by separated polynomials. Using automorphisms of the underlying curves, we construct permutation automorphisms of the associated algebraic geometry codes and exploit the resulting orbit structure to determine information and check positions. We introduce a class of curves, called SAP curves (Separated Additive Polynomial curves), and investigate one-point AG codes defined on them. For these codes, we obtain permutation decoding sets that correct burst errors supported on coordinates associated with rational points sharing a common coordinate. We further identify a subclass of special SAP curves, including Hermitian curves, generalized Hermitian curves, and certain maximal curves, for which additional automorphisms yield more powerful decoding sets.

fields
Information Theory, Algebraic Geometry
pdf ↗ page arXiv:2608.03592 ↗

We study convex-concave minimax optimization problems with bilinear coupling of the form $\min_{x\in \mathcal X}\max_{y\in \mathcal Y} \; f(x)+\langle y,\mathbf{B}x\rangle-g(y),$ where the functions $f$ and $g$ have Hölder continuous (sub)gradients. This setting covers a broad range of regimes, from nonsmooth problems with bounded subgradient variation to smooth problems with Lipschitz continuous gradients; for a smooth component used in the coupling-induced regularizer, its Lipschitz-gradient constant is assumed to hold in the ambient space. We propose a sliding method that exploits the composite structure of the problem by querying the oracles associated with $f$, $g$, and the bilinear coupling operator at prescribed frequencies determined by their individual properties. The method is based on a recursive sliding scheme for monotone variational inequalities. We establish convergence guarantees under Hölder continuity and show how the resulting complexity bounds depend explicitly on the Hölder exponents, Hölder constants, strong convexity parameters, and spectral properties of the coupling matrix. Our analysis covers nonstrongly convex and partially strongly convex regimes. For stochastic function oracles, we prove componentwise Hölder guarantees with separate variance costs: a uniform expected-gap bound on bounded domains and, when both functions are strongly convex on their feasible sets, a restarted Lyapunov guarantee without an anchor noise floor. Numerical experiments reproduce the predicted Hölder exponents and confirm that the number of gradient evaluations required for each function separates according to its own smoothness level rather than the worse of the two. A tomographic benchmark shows runtime gains when gradient evaluations are more expensive than the additional matrix-vector products.

fields
Optimization and Control
pdf ↗ page arXiv:2608.03846 ↗

We give a local geometric criterion ensuring that the edge-connectivity of a hypergraph equals its minimum incidence degree: every locally finite connected simple $r$-uniform linear hypergraph with $r\ge3$ and nonnegative Lin–Lu–Yau curvature has this property. Among the various extensions of Ollivier–Ricci curvature to hypergraphs, we work with the equal-edges random walk on hypergraphs \cite{CoupetteEtAl2023}. Moreover, we show that both uniformity and linearity are essential: if either assumption is removed, there exist positively curved hypergraphs for which the gap between minimum incidence degree and edge-connectivity is arbitrarily large. For adjacent vertices in any locally finite simple hypergraph, the Ollivier–Ricci idleness function is concave and piecewise affine with at most three affine pieces, and is affine on $[1/2,1]$. In particular, $κ_{\LLY}=2κ_{1/2}$, which we use to verify positive curvature in the two families of examples.

comments
31 pages
fields
Combinatorics, Probability
pdf ↗ page arXiv:2608.06029 ↗

A graph $G$ is list $k$-critical if $G$ is not $(k-1)$-list-colorable, but every proper subgraph of $G$ is $(k-1)$-list-colorable. In this paper, we study the function $f_{\ell}(n,k)$ denoting the minimum number of edges in an $n$-vertex list $k$-critical graph, as well as the function $g_{\ell}(k) = \liminf_{n \rightarrow \infty} \frac 2n f_{\ell}(n,k) - k + 1$. We show that for all $k \geq 4$, every list $k$-critical graph on $n \geq k+2$ vertices has more than $(k-1+\frac 1{28})\frac n2$ edges, which implies that $g_{\ell}(k) \geq \frac{1}{28}$ for all $k \geq 4$. This is the first result showing that $\liminf_{k \rightarrow \infty} g_{\ell}(k) > 0$. We also show that $g_{\ell}(k) \geq \frac{1}{24}$ for all $k\geq 352$. As a corollary to our result, we obtain the following improvement to Brooks' theorem: For all $d \geq 3$, if $G$ has no $K_{d+1}$ subgraph and has maximum average degree at most $d+\frac 1{28}$, then $G$ is $d$-list-colorable. All of our results hold in the setting of correspondence coloring (DP-coloring) as well. As a corollary of our correspondence coloring result, we also show that for each $d \geq 3$, a minimal unsatisfiable anti-functional binary constraint satisfaction problem (CSP) with variable domains of size $d$ has a primal graph whose unique nontrivial component either contains $K_{d+1}$ or has average degree at least $d+\frac 1{28}$.

comments
16 pages, this version fixes many baby-induced typos
fields
Combinatorics
pdf ↗ page arXiv:2608.06757 ↗

We prove a sharp volume gap estimate: if an $n$-dimensional compact Kähler manifold $(X, ω)$ satisfies $\mathrm{Ric}(ω)\ge (n+1)ω$ and $X\not\cong \mathbb{P}^n$, then $\mathrm{vol}(X, ω)\le \frac{2n^n}{(n+1)^n}\mathrm{vol}(\mathbb{P}^n,ω_{\mathrm{FS}})=\frac{2^{n+1} \, π^n \, n^n}{(n+1)^n}$. Moreover $\mathrm{vol}(X, ω)= \frac{2^{n+1} \, π^n \, n^n}{(n+1)^n}$ occurs if and only if $(X, ω)$ is biholomorphically isometric to the Kähler-Einstein metric on the quadric hypersurface $Q^n$ or on the product $\mathbb{P}^1\times \mathbb{P}^{n-1}$. We also obtain sharp volume gap estimates for K-semistable toric log Fano pairs.

comments
29 pages. Comments are welcome! v2: minor revisions
fields
Differential Geometry, Algebraic Geometry, Metric Geometry
pdf ↗ page arXiv:2608.08193 ↗

This work revisits the key sufficient conditions on a ring $A$ that guarantee the existence of the exact sequence \[ H_3(\mathrm{SM}_2(A), \mathbb{Z})\to H_3(\mathrm{SL}_2(A), \mathbb{Z}) \to \mathcal{RB}(A) \to 0 \] and of the isomorphism \[ H_3(\mathrm{SL}_2(A), \mathrm{SM}_2(A); \mathbb{Z}) \simeq \mathcal{RP}_1(A). \] We show that there are rings which satisfy the relations above but do not satisfy the condition that -1 is an square, for example some rings $\mathbb{Z}[\frac{1}{m}]$ and finite local rings. In addition, we study the special case of non-dyadic local fields with characteristic not 2, obtaining a refined Bloch-Wigner exact sequence when -1 is not an square.

fields
K-Theory and Homology
pdf ↗ page arXiv:2608.08890 ↗

Let $X = \mathbb{P}^1 \smallsetminus \{0,1,\infty\}$ be the thrice-punctured line over a ring of $S$-integers $\mathcal{O}_{K,S}$ in a number field $K$. For any quotient $π_1^{\mathrm{mot}}(X,0) \twoheadrightarrow Π$ of Deligne–Goncharov's motivic fundamental group there is an associated Selmer scheme which parametrises $Π$-torsors with a mixed Tate motive structure. We give several descriptions of the motivic Selmer scheme which make it amenable to computations, using $\mathbb{G}_m$-equivariant cocycles of algebraic groups, Lie algebras, and complete Hopf algebras. We prove that the Selmer scheme is isomorphic to an affine space $\mathbb{A}^N_{\mathbb{Q}}$, and we construct coordinates realising this isomorphism. This is a key ingredient for making the motivic Chabauty–Kim method explicit in a general setting, without restrictions on the base field or the choice of fundamental group quotient.

comments
40 pages; minor revision
fields
Number Theory
pdf ↗ page arXiv:2608.11509 ↗

In this paper, we formalize a joint communication-control strategy optimization (JCCO) problem in multi-agent linear systems with quadratic costs, under the common-information-based (CIB) framework from decentralized stochastic control. For computational tractability, we focus on such JCCO problems with partially nested (PN) information structures (ISs). In particular, with a baseline communication protocol that leads to a PN IS, we establish a series of conditions under which the partial nestedness is preserved under the (additional) communication strategies to be optimized, while violating them may cause nonlinearity or non-existence of the optimal control strategies, with open-loop communication strategies. Under these conditions, we then develop a dynamic-programming-based approach to compute the optimal control strategies of JCCO with open-loop communication strategies, which yields a set of closed-form Riccati Equations. As a byproduct of independent interest, such an approach also offers a new way to solve decentralized linear-quadratic control with PN ISs and output feedback, under the CIB framework and the aforementioned conditions. Finally, we extend such an approach to JCCOs with closed-loop communication strategies, yielding a more tractable dynamic program than an infinite-dimensional CIB-belief-based one.

comments
Preliminary version accepted to IEEE CDC 2026; Sharpened the proof of Lemma IV.5
fields
Optimization and Control
pdf ↗ page arXiv:2608.13535 ↗

Let $R$ be a field and $A$ the endomorphism algebra of a finite direct sum of cyclic modules over a finite-dimensional commutative local principal ideal $R$-algebra. An explicit central quotient identifies the support $τ$-tilting poset of $A$ with the weak order on a symmetric group. The center of $A$, together with degree-zero Hochschild homology as a module over the center, recovers the truncated local algebra and the multiset of successive length gaps. Applied to centralizer matrix algebras, these results show that the support $τ$-tilting poset determines exactly the multiset of distinct-exponent counts of the primary blocks, whereas the center–Hochschild pair recovers their local algebras and gap multisets. Combined with the known classification, this characterizes derived equivalence by isomorphism of these algebra–module pairs. We also establish Morita reconstruction results in the string and gentle classes.

comments
29 pages
fields
Rings and Algebras
pdf ↗ page arXiv:2608.15460 ↗

Let $G$ be a graph together with a total order $\prec$ on its edges. We say that $\prec$ is realizable in $\mathbb{R}^d$ if there is a placement of the vertices of $G$ in $\mathbb{R}^d$ such that the Euclidean lengths of the edges induce exactly the order $\prec$. Almendra-Hernández and Martínez-Sandoval proved that every total order on the edges of the complete graph $K_n$ is realizable in $\mathbb{R}^{n-2}$. We show that the same is not true for the disjoint union of two complete graphs: for every $n\geq 3$ there is a total order on the edges of $K_n\sqcup K_n$ that is not realizable in $\mathbb{R}^{n-2}$, but is in $\mathbb{R}^{n-1}$. Thus, the realizability of an order on a disconnected graph is not determined by its restrictions to the connected components. We also study the extremal problem of maximizing the number of edges of an $n$-vertex graph all of whose edge-orders are realizable in $\mathbb{R}^d$, and show that for every fixed $d$ this maximum is $dn+o(n)$, with explicit bounds on the error term. On the real line we sharpen these bounds and show that a disjoint union of two cycles is realizable in $\mathbb{R}$ unless both cycles are triangles.

comments
v3: added references (Bilu-Linial 2005; Shepard 1962, Guttman 1968, Lingoes 1971) and corrected attributions; improved lower bound for R(K_n) via Maehara (1991), giving R(K_5)=3 and R(K_6)=4; added remark on arboricity. 23 pages, 3 figures
fields
Combinatorics
pdf ↗ page arXiv:2608.15853 ↗

Reflective Grounded Arithmetic (RGA) is a paracomplete arithmetic allowing direct expression of any general-recursive computation. Every RGA term is a program and truth is grounded evaluation, with a proof certificate at each universal quantifier. This paper shows, in a machine-checked Isabelle/HOL development, that such a system is powerful enough to carry out its own metamathematics. A fuel-indexed decider of RGA's grounded semantics and checkers for RGA's proofs are compiled primitive-recursive RGA terms. RGA proves internally that its decider never affirms 0 = 1, and that every well-formed term it affirms has an RGA proof accepted by a transparent test. RGA proves that, for each valid RGA proof, its conclusion is true. RGA proves that each grounded-true well-formed term is provable. RGA proves that no proof in either of two decided classes of RGA proofs derives 0 = 1. RGA's truth predicate also serves as a medium for proof by reflection, of the kind that adds nothing to the system. RGA derives disquotation for quantifier-free formulas as rules in every context, at a free variable, and proves, as one sentence, that whenever its normalizer for polynomials in one variable gives two terms the same normal form, the equation between them is true at every value of the variable. Each such polynomial identity then follows from that sentence by closed evaluation and disquotation, with no reflection rule. A companion paper proves Gödel's incompleteness theorems for RGA and its extensions.

comments
substantially revised; Goedel incompleteness theorems split into separate preprint 2611.13697; now 163 pages
fields
Logic
pdf ↗ page arXiv:2608.16140 ↗

Let $X$ be a metrizable space. We prove that the space of compatible metrics on $X$ is Borel in the space of continuous pseudometrics, equipped with the topology of uniform convergence, if and only if $X$ is $σ$-compact. These conditions are equivalent to complete metrizability of the space of compatible metrics; the same characterization holds for each component. For ultrametrizable $X$ and $R\subseteq[0,\infty)$ containing $0$ and arbitrarily small positive elements, we prove analogous results for compatible $R$-valued ultrametrics and their $R$-components, {with neighborhoods defined by agreement at every point pair where either ultrametric exceeds a positive $ε\in R$}. For the nonempty subspaces of complete compatible metrics and complete compatible $R$-valued ultrametrics, Borelness and complete metrizability are equivalent to compactness of $X$. The proofs use continuous families of metrics parametrized by trees or subsets of compact completions.

comments
32 pages. I have obtained results that cover theorems in Absolute Borel Complexity of Moduli Spaces of Ultrametrics (version 1). So, I revise the whole of the paper
fields
General Topology, Metric Geometry
pdf ↗ page arXiv:2608.16169 ↗

We identify the first failure of the $\lceil\log_2 t\rceil$ leaf-count bound for isometric embeddings of $t$-leaf trees under the maximum norm. Every tree with at most $31$ leaves attains the bound, but a $32$-leaf tree requires six dimensions. This answers a question of Fitzpatrick and Nowakowski and disproves a conjecture of Aksoy, Kılıç and Koçak. We explain this failure by showing how requirements within and between branches force an additional coordinate. For a family of three-branch trees, we prove that the leaf bound is attained exactly when the two larger branches have equal leaf counts; otherwise, one additional coordinate is necessary. We also prove that every tree embeds in $\lceil 1.162832\log_2 t\rceil$ dimensions, improving the coefficient of approximately $1.44042$ established in 2005. These results hold for arbitrary positive edge lengths and the entire metric realization. We also construct infinite families in which the excess persists under repeated leaf expansion. Both main theorems are formalised in Lean using only standard axioms.

comments
18 pages. Both main theorems are formalised in Lean using only standard axioms. The formalisation is available at https://doi.org/10.5281/zenodo.23664556
fields
Metric Geometry, Combinatorics, Functional Analysis
pdf ↗ page arXiv:2608.16288 ↗

We establish an asymptotic formula for squarefree polynomials over a finite field whose coefficients are in $\{0,1\}$. This resolves a function-field analogue of a conjecture of Erdős, Mauduit and Sárközy. More generally, we estimate the probability of a polynomial $\sum \varepsilon_it^i$ being squarefree, where $\varepsilon_i$ are random variables sampled according to measures on $\mathbb{F}_q$.

comments
26 pages, 0 figures
fields
Number Theory, Probability
pdf ↗ page arXiv:2608.17892 ↗

Suppose $p > 7$ is a prime number, and $F$ is a nonarchimedean local field of residual characteristic $p$ satisfying $F \neq \mathbb{Q}_p$. Generalizing results of Ghate–Le–Sheth, Le–Singh, and Huang, we show that any split, connected, reductive group $G$ over $F$ which is not a torus admits a smooth, irreducible, non-admissible mod $p$ representation. We use this to show that the functor of pro-$p$-Iwahori invariants does not induce an equivalence between the category of smooth mod $p$ $G$-representations generated by their pro-$p$-Iwahori invariant vectors and modules over the pro-$p$-Iwahori–Hecke algebra, contrary to what happens for $\mathrm{GL}_2(\mathbb{Q}_p)$.

comments
8 pages. v2: Updated to include the case of F/Q_p totally ramified
fields
Representation Theory, Number Theory
pdf ↗ page arXiv:2608.19570 ↗

We prove that the orbit equivalence class of every free ergodic probability-measure-preserving (pmp) action of a free group contains a totally weak mixing action. Equivalently, every ergodic treeable pmp equivalence relation of cost $n\in\mathbf{N}\cup\{\infty\}$ is generated by a free totally weak mixing action of $\mathbf{F}_n$. This answers a question of Miller and Tserunyan. The proof goes by considering a Polish space of edge slidings along a fixed mixing transformation and proving that for every $w\not=e\in\mathbf{F}_n$ the set of edge slidings that produce an action with $w$ weakly mixing forms a comeager set.

comments
6 pages, minor revisions
fields
Dynamical Systems, Group Theory, Logic
pdf ↗ page arXiv:2608.20165 ↗

A unit-area translation surface is called \emph{maximal} if it maximizes the length of its shortest saddle connection among all surfaces in the same stratum. We investigate whether a non-maximal translation surface can be continuously deformed into a maximal one while the systole increases strictly monotonically. Although such deformations do not exist in general due to the presence of local, non-global maxima of the systole function, we explicitly construct them for the family of so-called $2k$-gonal translation surfaces for any fixed $k \ge 2$. Furthermore, we generalize this construction to translation surfaces composed of mixed polygons. Specifically, we prove that any translation surface formed by gluing a combination of coherently aligned regular $2k$-gons with potentially varying values of $k$, provided every polygon side length equals the surface's systole, also admits a continuous, strictly systole-increasing deformation terminating at a maximal surface.

comments
24 pages, 14 figures
fields
Geometric Topology
pdf ↗ page arXiv:2608.20264 ↗

For a stochastic partial differential equation posed on a Gelfand triple and satisfying the fully local monotone conditions of Röckner, Shang and Zhang, we compute the logarithmic derivative of the law of the solution at a fixed time along a prescribed direction of the state space. The formula is intrinsic, expressed through the Hilbert-Schmidt Malliavin derivative $Φ_r = \mathcal{D}_r X(t)$ and the covariance $γ_t = \int_0^t Φ_r Φ_r^{*}\,\mathrm{d}r$ alone, so that neither the inversion of the first variation nor uniform Malliavin-Sobolev bounds on the Tikhonov family are needed. It follows from an integration-by-parts identity on a Hilbert space, a Moore-Penrose covering field on Wiener space and a trace formula for the Tikhonov limit, brought to the equation by the representation $Φ_r = Y(t,r)\mathcal{B}(r,X(r))$. The linearised theory is carried by $Φ$ and by its own Malliavin derivative $\mathcal{W} = \mathcal{D}Φ$, whose regularity is measured in the time-integrated quadratic energy that the dissipative structure of the linearisation produces, so that no operator norm of the first variation between the spaces of the triple occurs. The stochastic $p$-Laplacian and the two-dimensional Navier-Stokes equation are treated in detail; for the latter the dissipative, forcing and exponential-moment hypotheses are established together under trace-class additive noise and a smallness threshold on the noise covariance. A scalar reduction carries the identity beyond the variational class, to the law of a pairing $\langle u(t), \varphi\rangle$ for the singular equations of Bruned, Chandra, Chevyrev and Hairer, on the same Hölder triangle of moment exponents.

fields
Probability, Analysis of PDEs
pdf ↗ page arXiv:2608.21805 ↗

Let $A$ be a centralizer matrix algebra over an arbitrary field. We prove that a centralizer matrix algebra $B$ is derived equivalent to $A$ if and only if $B\simeq{\rm End}_A(T)^{\rm op}$ for some tilting $A$-module $T$ of projective dimension at most one. We classify the basic tilting $A$-modules and identify their poset with a product of right weak orders on symmetric groups. For a fixed primary block, mutations exchange adjacent entries of the gap word. The isomorphism classes of the resulting opposite endomorphism algebras are parametrized by left cosets of the stabilizer of this word. The quotient of its labeled mutation graph by the stabilizer action is a Schreier multigraph. We also characterize when the right weak-order orientation descends to the nonloop edges of this quotient.

comments
23 pages
fields
Representation Theory
pdf ↗ page arXiv:2608.21922 ↗

We study Fulton's universal Schubert polynomials through the cluster structure on the upper unitriangular group and representations of type $A$. The convex hull of the initial tropical vectors of standard-elementary monomials is unimodularly equivalent to a product of simplices, and right-regular multisegments index three integral geometric bases of the standard-elementary module. A recursive prefix-record condition characterizes those universal Schubert polynomials that are homogeneous under diagonal conjugation, coincide with the corresponding generic and dual canonical basis elements, and are extended cluster monomials. On this locus, cover forests give squarefree factorizations into cluster variables. Outside it, the initial Laurent expansion has a coefficient $-1$.

comments
78 pages, comments are welcome; v2. all conjectures are proved; Part 3 deleted
fields
Combinatorics, Representation Theory
pdf ↗ page arXiv:2608.29125 ↗

Let $M_d(X)$ denote the average number of rational preperiodic points among degree-$d$ polynomials over $\mathbb{Q}$ with vanishing $z^{d-1}$ coefficient, constant term $1$, and height at most $X$. We prove that, for every integer $d\ge2$, $M_d(X) \sim γ_d X^{-1}$ for an explicit constant $γ_d>0$. For $d\ge4$, the error term is $O_{d,\varepsilon}(X^{-2+\varepsilon})$ for every $\varepsilon>0$; for $d=3$ the error term is $O(X^{-3/2})$; and for $d=2$ the error term is $O(X^{-3/2}\log X)$.

comments
14 pages, improved exposition
fields
Number Theory, Dynamical Systems
pdf ↗ page arXiv:2608.29383 ↗

We show that in Einstein gravity a null-complete, non-static Bianchi I universe (homogeneous, spatially flat and anisotropic) violates the averaged null energy condition (ANEC) along every complete light ray outside at most four null directions, and along all of them if its total energy density, cosmological constant included, is ever positive. Along each complete ray the averaged null energy is at most $-J_p/(8πG)$, with equality whenever the integral converges, where $J_p$ is the squared expansion and shear accumulated by a thin bundle of light rays. With spatial sections $\mathbb{R}^3$ the achronal ANEC therefore leaves only Minkowski space, as for flat and open Friedmann models. Under the pointwise null energy condition, every null geodesic of a non-static Bianchi I universe is incomplete. The isotropic bounce of effective loop quantum cosmology has $J_p=1.478\,ω_B H_{\max}$ (light frequency at the bounce times largest Hubble rate), and at the same critical density the cheapest ray of a strongly anisotropic bounce pays four to five times as much. A Casimir-supported turning point on a three-torus has a deficit of the same order, but at Hubble rates well below the Planck scale its light rays circumnavigate the torus and are not achronal, so the achronal ANEC does not apply to them.

comments
26 pages, 2 figures, 2 tables; Supplemental Material with code as ancillary files. v4: rewritten and restructured, with a new title; statements are renumbered consecutively by type
fields
Mathematical Physics
pdf ↗ page arXiv:2608.29556 ↗

In this paper, we consider the Smagorinsky model for the Navier-Stokes equations within a virtual element framework. Under the standard assumption of small data, we prove the existence and uniqueness of a solution. Assuming more regularity to the solutions, we derive the known \del{suboptimal} convergence rates $h$, using $k>1$, for the a priori error estimates of the Smagorinsky model in two dimensional domains. We additionally prove that divergence-free virtual discretizations provide improved convergence orders, with weaker regularity assumptions than in the finite element literature. We conclude the paper with numerical results that corroborate the theory.

fields
Numerical Analysis
pdf ↗ page arXiv:2609.02433 ↗

The hypergraph Turán problem asks for the maximum asymptotic edge density of hypergraphs avoiding a forbidden family and the structure of near-extremizers. We prove that both encode arbitrary computation. Fix a universal Turing machine $\mathsf{U}$. For each fixed $r\ge3$, there is a rational $τ_r\in(0,1)$ and an effective map from binary words $β$ to finite families $\mathcal{F}_{r,β}$ of $r$-graphs such that $π(\mathcal{F}_{r,β})=τ_r$ if $\mathsf{U}$ does not halt on $β$, and $π(\mathcal{F}_{r,β})>τ_r$ otherwise. For $r=3$, a single forbidden $3$-graph $P_β$ suffices. For all sufficiently large fixed $r$, we construct finite families exhibiting a parallel structural dichotomy. Nonhalting gives a unique extremal limit and edit-distance stability around a fixed finite profile. Halting yields 2 nonempty compact phases with opposite signs of a continuous statistic depending only on $r$; each phase is homeomorphic to the full extremal limit space of $P_β$. Hence uniqueness, connectedness, and finite-profile stability are undecidable. Our ZFC-verifiable reductions also yield independence results for every consistent computably axiomatized extension of ZFC, even for single forbidden $3$-graphs. We further classify the complexity of exact density comparison, characterize densities attainable by effectively enumerated families, and establish Busy-Beaver growth of minimal witnesses and the absence of computable positive lower bounds on density gaps.

comments
proofs simplified; improved main result from finite family of r-graph to single 3-graph
fields
Combinatorics, Logic
pdf ↗ page arXiv:2609.04295 ↗

We explore the use of simulated data for training a model for protein annotation in crowded cryo-electron tomography volumes reconstructed from images collected at limited tilt angles and severely corrupted by the measurement operator. Firstly, we leverage the corruptions imposed by the forward model to generate domain-specific augmented paired views of the exact same scene for an invariance objective integrated into the LeJEPA self-supervised training framework. Secondly, we use additional information from the simulation pipeline such as the positions and identity of proteins in the simulated volumes to inform the architecture of the model and the loss function, so that semantic information is localised at protein positions in the resulting dense feature volume. The resulting model, CARNIVAL, is evaluated without finetuning on classification and detection tasks in real tomograms, using a benchmark dataset containing multiple protein types and two tomogram processing types. We show that CARNIVAL outperforms a state-of-the-art model trained using a contrastive objective on simulated data but without forward model-based paired views or privileged information.

comments
17 pages, 7 figures. Paper accepted to NeurIPS 2026 workshop Sim2Science: ML with Imperfect Scientific Models
fields
Optimization and Control
pdf ↗ page arXiv:2609.04325 ↗

In this paper, we relate multiplicities of Bernstein–Sato-type polynomials with respect to a function f to several singularity invariants. First, we introduce certain ``mod'' b-functions and show that they characterize the weight filtration on the localization of a simple algebraic holonomic D-module along f, and we provide an algorithm to compute them. Second, we show that they can be approximated by the multiplicities of roots of power b-functions (i.e., the b-functions with respect to powers of f). Furthermore, we give a sharp upper bound for the Hodge level of elements given by a certain sum of such multiplicities. Next, we give an effective asymptotic solution to the Gelfand problem by determining an explicit threshold after which every integer shift of a root of b_f(s) is a pole of the Archimedean zeta function of f. We also show that the order of these poles is equal to the nilpotency index of the logarithmic monodromy operator, which we further express as the limit of the multiplicities of roots of power b-functions. We define several filtrations, relating them to the weight and Hodge filtrations, based upon which we leave some open questions that we address in the affirmative in the case when f has a homogeneous isolated singularity, or it is a hyperplane arrangement, or a semi-invariant on a spherical variety. We give several immediate applications to our results, including a solution to a question of Torrelli on whether 1/f lies in the intersection complex of the hypersurface of f if and only if -1 is a simple root of b_f(s).

comments
53 pages; we removed the regularity assumption in the characterization of weight filtration and clarified that we mostly work in algebraic setting; we added Thom-Sebastiani results in Section 5.5 and a counterexample to Torrelli's question
fields
Algebraic Geometry, Commutative Algebra
pdf ↗ page arXiv:2609.05215 ↗

Tilings can be studied from the perspective of dynamical systems and ergodic theory. Some fundamental features of tiling spaces as topological dynamical systems, such as the continuity of the action by translation, the compactness with the tiling metric, and the minimality of the system generated by a repetitive tiling, are among the most frequently mentioned basic facts in the dynamical theory of aperiodic order. Nonetheless, despite their classical status, complete proofs of these facts, together with the preliminary material they rely on, to the best of our knowledge, are not available in the literature. The purpose of this survey is to give a self-contained, rigorous, and pedagogical treatment of these foundations with detailed preliminary material. We hope that this exposition will provide a useful reference and contribute to a clearer and more accessible understanding of the fundamentals of the theory of tiling dynamical systems.

comments
The metric was changed, since the proof of the triangular inequality was not clear. Minimality and transitivity were added, as well as more references
fields
Dynamical Systems
pdf ↗ page arXiv:2609.06310 ↗

We explore some methods to obtain cotorsion pairs and model category structures from a Frobenius pair. Specifically, we consider a type of Frobenius pair $(\mathcal{X},ω)$ in an abelian category $\mathfrak{C}$ for which there exists a nonnegative integer $m$ such that every object in the right orthogonal complement $\mathcal{X}^{\perp_1}$ of $\mathcal{X}$ under $\text{Ext}^1_{\mathfrak{C}}(-,\sim)$ has a special $ω^\wedge_m$-precover and a special $[ω^\wedge_m]^{\perp_1}$-preenvelope, where $ω^\wedge_m$ denotes the class of objects in $\mathfrak{C}$ with resolution dimension relative to $ω$ at most $m$. The cotorsion pairs and model structures obtained from these Frobenius pairs will involve the classes $\mathcal{X}$, $ω$, $\mathcal{X}^\wedge_m$, $ω^\wedge_m$, and their orthogonal complements, in the description of its cofibrant, fibrant and trivial objects. As applications of our results, we obtain several cotorsion pairs and model structures related to relative and absolute Gorenstein homological dimensions.

comments
36 pages. No AI used. More examples added in v2. Comments are welcome
fields
Category Theory
pdf ↗ page arXiv:2609.07522 ↗

We answer a question of Eskenazis, Mendel, and Naor by proving that the optimal universal scaling parameter in metric cotype $2$ for complete Alexandrov spaces of nonnegative curvature has order $n$. The upper bound follows from a dyadic application of the Lang–Schroeder inequality, and the lower bound follows from snowflake universality of $\mathcal{P}_2(\mathbb{R}^3)$.

comments
7 pages
fields
Functional Analysis, Metric Geometry
pdf ↗ page arXiv:2609.08754 ↗

A $k$-cut of an undirected graph is a minimal edge set whose removal leaves at least $k$ connected components, and its cost is the sum of its edge costs. Write $λ_k$ for the minimum cost of a $k$-cut. For fixed $k\ge2$ and $α\ge1$, we show that in any $n$-vertex graph with $n\ge k$ and nonnegative edge costs, the number of $k$-cuts of cost strictly below $αλ_k$ is $O(n^{\lceilαk\rceil-1})$. This implies an $O(n^{\lfloorαk\rfloor})$ bound for $k$-cuts of cost at most $αλ_k$, sharpening the $O(n^{αk})$ bound of Gupta, Harris, Lee and Li. For $k=2$, our strict bound resolves a conjecture of Henzinger and Williamson and an open question of Karger. The exponent $\lceilαk\rceil-1$ is optimal for $k$-cuts for every $k\ge2$ and $α>1$.

fields
Combinatorics
pdf ↗ page arXiv:2609.10255 ↗

Perhaps surprisingly, there are infinite types that can be exhaustively searched mechanically in finite time. We use ideas from topology to build plenty of them, referring to searchable types as compact types, and we use ordinals to measure their logical complexity. We consider two systems of ordinal notations under which a single notation denotes both a discrete ordinal and a compact one, with an embedding of the former into the latter whose image has empty complement. A boolean valued function decides which points in the image of the embedding are isolated and which are topological limit points. The first system consists of the traditional Brouwer codes and the second is an inductive-recursive universe generalizing them. The discrete ordinals so obtained are trichotomous, and the compact ones have the least element property for complemented subsets, but these two desirable properties cannot be fulfilled simultaneously in a constructive setting. The compact ordinals obtained from Brouwer codes further enjoy a boolean Leibniz principle, which has the notion of total separatedness as its topological counterpart. This extends previous work from Gödel's system T to intensional Martin-Löf type theory with univalent universes, and is formalized in Agda in the TypeTopology repository.

comments
84 pages. This version adds new constructive failures and several improvements. The Agda companion is that of TypeTopology commit hash 2e458aaa at github
fields
Logic, General Topology
pdf ↗ page arXiv:2609.10447 ↗

Anti-de Sitter (AdS) spacetimes are not globally hyperbolic, so boundary conditions are generally needed for well-defined dynamics. Ishibashi and Wald (IW) determined boundary conditions yielding well-posed dynamics with conserved positive energy for scalar, electromagnetic, and linearized gravitational fields, using nonlocal potentials and individual spherical harmonic modes. In this paper, we determine which IW conditions are local in the primary fields and which are AdS-invariant. In four spacetime dimensions, the standard AdS-invariant boundary conditions set the rescaled magnetic field to zero for electromagnetism and the rescaled magnetic Weyl tensor to zero for Einstein gravity on the conformal boundary. We generalize these standard boundary conditions by setting arbitrary linear combinations of the electric and magnetic fields, or the corresponding Weyl tensors, to zero, and we conjecture that these exhaust the local, AdS-invariant, conservative boundary conditions in AdS$_{1,3}$. Boundary conditions with non-AdS-invariance and in different spacetime dimensions are also studied. The AdS-invariant conditions in AdS$_{1,3}$ extend to Yang-Mills theory and nonlinear gravity in a general Fefferman-Graham setting. We construct phase spaces for these general boundary conditions. The covariant phase spaces for general conditions are naturally associated with Lagrangians containing Pontryagin terms and, in gravity, a Gauss-Bonnet term. In gravity, except for the standard boundary condition, no nontrivial asymptotic symmetries exist and all conserved charges such as ADM mass vanish identically, as in a closed universe. Spacetimes with Killing fields including AdS then exhibit linearization instability in the sense of Fischer and Marsden and Moncrief. For nonstandard boundary conditions, the modified symplectic structure yields new expressions for the entropy formula of black holes.

comments
32 pages, no figures; v2: significantly strengthened results on linearization instability of AdS$_{1,3}$, references added; v3: minor revisions
fields
Mathematical Physics
pdf ↗ page arXiv:2609.10805 ↗

Let $\mathfrak L$ be a Frobenius maximal parabolic subalgebra of $\mathfrak{sl}_n$. For any $F\in\mathfrak L^*$ for which the Kirillov form $B_F(x,y)=F([x,y])$ is non-degenerate, let $\widehat F$ denote the associated principal element. We prove that the multiplicities of the eigenvalues of $\operatorname{ad}_{\widehat F}$ on $\mathfrak L$ form a unimodal sequence symmetric about $\frac12$. We also prove that the multiplicities of the eigenvalues of $\operatorname{ad}_{\widehat F}$ on $\mathfrak{gl}_n$ form a unimodal sequence symmetric about $0$. The proof relates the ranked meander associated to $\mathfrak L$ to the order ideals of a related fence poset through Panyushev reduction. The known unimodality of the rank polynomial of the fence poset implies that of the meander, which in turn determines a good grading of $\mathfrak{gl}_n$ in the sense of Elashvili and Kac. We prove that this grading coincides with that induced by the principal element and that the pyramid associated to this grading may be filled in such a way that its good element $e$ lies in $\mathfrak L$. The two unimodality results then follow from the injectivity properties of $\operatorname{ad}_e$ coming from the good grading and the duality induced by the bilinear form $B_F$.

fields
Representation Theory, Combinatorics
pdf ↗ page arXiv:2609.10869 ↗

This paper introduces and studies the Multi-Objective Enterprise Doubly-Green Supply Chain Network Design (MOE-DGSCND) problem an extension of Green Multi-Objective Supply Chain Network Design (GSCND)[Olfat, L., e. a. (2022), Sreyneath, C. (2021)]. The problem studied here is a three-objective combinatorial optimization problem that simultaneously minimizes total cost f1, carbon dioxide emissions f2 and customer dissatisfaction f3 over binary decisions regarding which distribution centers to open and how to assign customer zones to open facilities. The problem generalizes the capacitated facility location problem CFLP and is known to be NP-hard [Garey, M. R. and Johnson, D. S. (1979)]. This paper formally specifies the decision variables objective functions and constraints and investigates three solution approaches using a single numerical instance (A) an exact weighted-sum integer linear programming ILP formulation solved with Python combinatorially and via PuLP (B) three Fully Polynomial Time Approximation Schemes (FPTAS) providing $1+ε$ approximate solutions for $ε:= 0.15$ and (C) two baseline heuristics for comparison. On an instance with eight customers and five candidate distribution centers the exact solver certifies the optimal sampled supported solutions across eight weight combinations while the FPTAS-based approaches complete within milliseconds compared to centiseconds for the exact ILP on this tiny non-stochastic instance.

comments
19 pages, 10 tables, 3 figures, 19 references
journal
American Journal of Operations Research, 16, 221, 2026
fields
Optimization and Control
pdf ↗ page arXiv:2609.11971 ↗

Let $R^\ast(n)$ be the minimum radius of a central circle externally tangent to nonoverlapping circles of radii $1,\ldots,n$. We prove that $R^\ast(n)=C_\ast n^2+o(n^2)$ and give finite linear programs that enclose $C_\ast$ with prescribed error. An exact angular comparison reduces the problem to marked points on a line with separation at least the geometric mean of each pair of marks. Concatenation with bounded joining cost and reassignment to the prescribed normalized radii prove existence of the limit. Balanced finite-word programs give a bracket of width $(1/k+1/r)/π$, before directed arithmetic error, using $k$ types and words of length $r$. We also obtain explicit geometric bounds. For the upper bound, we recover finite and countable reflected-block constructions by actual permutations, retaining all pair constraints. A coupled terminal-subset argument gives an explicit lower bound strictly above $1/8$. Together these give $C_{\rm term}+η_{\rm width}\le C_\ast\le U_4$. The lower endpoint comes from the terminal-subset argument, and the upper endpoint from the four-block construction; neither is asserted sharp. The finite-word scheme establishes computability; efficient high-precision evaluation and the structure of global optimizers remain open.

comments
9 pages. Updated the reference to Paper I and added a direct link and verification commands for the frozen companion archive in section 7. Mathematical results unchanged. Standalone proof supplements S1 (14 pages) and S2 (13 pages) are supplied as ancillary PDFs, with their TeX sources included
fields
Metric Geometry
pdf ↗ page arXiv:2609.13630 ↗

In this paper, we investigate the analytic properties of the Hardy-type operator $-Δ+ μH_0$ on the $d$-dimensional integer lattice graph $\mathbb{Z}^d$, where $μ\geq -1$ and $H_0$ is a critical Hardy potential at infinity–arising naturally from discrete Hardy inequalities. We derive sharp fixed-pole Green kernel estimates on $\mathbb{Z}^d$ and obtain a necessary and sufficient weighted summability condition characterizing the solvability of the nonnegative Poisson problem associated with this operator. Building upon this classification, we provide a complete characterization of the nonexistence of positive solutions to the semilinear elliptic inequality $$ -Δu + μH_0 u \geq W u^p \quad \text{in } \mathbb{Z}^d, $$ where $p > 0$, $d \geq 3$, $μ\geq -1$, and $H_0, W \in C(\mathbb{Z}^d)$ are strictly positive potentials satisfying the asymptotic behaviors $H_0(x) \sim |x|^{-2}$ and $W(x) \sim |x|^θ$ as $|x| \to \infty$, with $θ\in \mathbb{R}$.

comments
page 34
fields
Analysis of PDEs
pdf ↗ page arXiv:2609.13933 ↗

In this paper, we show that for every p>2, there is an orthonormal basis of spherical harmonics on the n-dimensional unit sphere which achieves the maximal Lp norm growth. More precisely, one basis achieves this growth for p up to the critical exponent 2(n+1)/(n-1), and another for p from the critical exponent up to infinity. The first basis is built from rotations of the real part of a highest weight spherical harmonic. The second is built from zonal harmonics whose poles are selected from a spherical design. In both cases, the selection uses the restricted invertibility theorem of Bourgain and Tzafriri. This extends earlier results of Bourgain and of the author (arXiv:1404.5016) on the 2-dimensional sphere for 2<p<=6 to all dimensions and all p>2, and improves the positive density subsequence there to a whole basis.

comments
v2: Title changed (v1: "Spherical harmonics with maximal Lp norm growth"). Main results unchanged. Presentation improved; added a remark on spherical designs and an open problem. References updated. 17 pages
fields
Classical Analysis and ODEs, Spectral Theory
pdf ↗ page arXiv:2609.14023 ↗

Let $G$ be a countable locally finite abelian group, and let \[ G_1\leq G_2\leq\cdots, \qquad \bigcup_{i\geq1}G_i=G, \] be any filtration of $G$ by finite subgroups. For $A\subseteq G$, let $\mathcal P(A)$ denote the set of all finite subset sums of elements of $A$, and let $2G:=\{2g:g\in G\}$. We prove that $|2G|=\infty$ if and only if for every filtration and every interval $[α,β]\subseteq[0,1]$, there exists $A\subseteq G$ such that the set of limit points of \[ \left( \frac{|\mathcal P(A)\cap G_i|}{|G_i|} \right)_{i\geq1} \] is exactly $[α,β]$. We also prove a positive-density result that does not require $|2G|=\infty$: if $G$ is infinite and $\mathcal P(A)$ has positive upper density along the given filtration, then there is an infinite set $B\subseteq \mathcal P(A)$ such that $B+B\subseteq \mathcal P(A)$. Combining this with the realization theorem, we show that, when $|2G|=\infty$, every interval $[α,β]$ with $0\leqα\leqβ\leq1$ and $β>0$ can be realized by a set $A$ with this additional property.

comments
V2: typos and misprints corrected; An open question added
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2609.14630 ↗

We study continuous-time and possibly high-dimensional stochastic control problems where drift coefficients and running reward functions are unknown. Due to these missing model primitives, we take the exploratory, reinforcement learning (RL) framework of Wang, Zariphopoulou, and Zhou(2020) with relaxed controls and entropy regularization. The objective is to develop theoretically grounded, efficient and scalable RL algorithms to learn both the optimal value functions (which also solve the exploratory HJB equation) and optimal exploratory feedback control policies. When the diffusion coefficients do not contain control, we employ probabilistic representations of both the optimal value function and its gradient based on an auxiliary state process depending only on the diffusion part of the original dynamics. With a delicate analysis on some properly defined mappings and their fixed points, this leads to the introduction of our policy iteration algorithms and their convergence. We demonstrate the performance of our algorithms through various numerical examples. Finally, we study a special control-dependent diffusion case where probability representation of the Hessian is called for.

comments
Revised version: clarified multidimensional notation, updated the high-dimensional numerical example and related-work discussion
fields
Numerical Analysis, Optimization and Control
pdf ↗ page arXiv:2609.14972 ↗

We give a Green-function proof of the stable Bernstein theorem in $\mathbb R^7$ for smooth, connected, complete, two-sided stable minimal hypersurfaces, thus resolving the last case of the stable Bernstein problem.

comments
47 pages. Improved exposition and simplified proofs. All comments are welcome
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2609.15720 ↗

In this paper, we resolve the convolution inequality problem posed by Naor and Schechtman in \cite[Question 6.1]{N-S2016} (see also \cite{Na2016}). More precisely, we establish the following strong convolution inequality on products of finite cyclic groups: For each $1\leq p<\infty$ there exists $c_{p}>0$ such that for every $n$, $m\in \mathbb{N}$ the following holds \[ \begin{split} &\sum_{\varepsilon\in \{-1,1\}^{n}}\sum_{x\in \Z}\left|E_{\{1,\cdots,n\}}f(x+\varepsilon)-E_{\{1,\cdots,n\}}f(x-\varepsilon)\right|^{p}\\ \leq& c^{p}_{p}\sum_{\varepsilon\in \{-1,1\}^{n}}\sum_{x\in \Z}\left|\varepsilon_{j}\left[E_{\{1,\cdots,n\}\setminus\{j\}}f(x+e_{j})-E_{\{1,\cdots,n\}\setminus\{j\}}f(x-e_{j})\right]\right|^{p}, \end{split} \] $E_{A}f(x)=\frac{1}{2^{n}}\sum_{δ\in \{-1,1\}^{n}}f\left(x+\sum_{j\in A}δ_{j}e_{j}\right)$ for every $A\subseteq \{1,\cdots,n\}$. The growth order we obtain here $c_{p}=O(p)$ as $p\to \infty$. For the endpoint $p=\infty$, we show by a counterexample that the strong convolution inequality fails for the $L_{\infty}$, and we prove that the appropriate endpoint for $p=\infty$ is the martingale $BMO$ space.

fields
Functional Analysis
pdf ↗ page arXiv:2609.15768 ↗

We introduce a new traffic flow model. The main idea is to describe acceleration effects in the Aw-Rascle-Zhang model through an additional driver-dependent equation, thereby allowing individual driver characteristics to evolve dynamically rather than being prescribed solely by the traffic density. The resulting system provides a hyperbolic description of traffic dynamics and admits an explicit analysis of its characteristic structure, Riemann problem, and entropy properties. To investigate the stability of the proposed model, we perform a Chapman-Enskog expansion up to second order and derive the corresponding diffusive and higher-order corrections. This analysis reveals how the stability properties depend on the underlying velocity and pressure functions. Several examples are presented to illustrate the theoretical results.

fields
Numerical Analysis
pdf ↗ page arXiv:2609.15934 ↗

Linear constraint systems (LCS) provide a compact algebraic language for nonlocal games and state-independent contextuality. In the binary case the Mermin–Peres square shows that inconsistent LCS can be solved by promoting variables to local Pauli operators, whereas a series of no-go results excludes analogous Pauli-, Clifford- and monomial unitary-based constructions at odd prime modulus. We first isolate the reason for this difference: for tensor-product quantum solutions, the obstruction to a classical solution of a LCS over $\mathbb{Z}_n$ decomposes into obstruction classes carried by the individual factors. As a consequence, a genuinely global obstruction cannot arise solely by tensoring locally unobstructed systems. The argument is specific to odd modulus; at even modulus the reordering phase need not vanish, as in Pauli-based examples. Given this distinction, we instead associate LCS to finite arrangements of rank-one projectors and resolutions of the identity in finite-dimensional vector spaces. Quantum solvability for such LCS is automatic and the search for a quantum-classical gap rests entirely on proving classical unsatisfiability of the underlying modular incidence problem of the arrangement. By relating such LCS with group-valued frame functions, we identify a family of examples in the work of [Harding, Jager, and Smith, Int. J. Theor. Phys. 44, 539 (2005)]. To establish the (non)existence of classically unsatisfiable LCS over $\mathbb{Z}_n$ with quantum solutions in all dimensions $d$ and for all $n\in\mathbb{N}$, we further construct explicit examples for the cases $d=n$ prime. Our main result thus positively resolves the existence problem of such LCS beyond the binary case: such systems exist if and only if $d\geq 3$ and $\gcd(n,d)>1$. Moreover, we establish the existence of LCS with a quantum-classical gap over finite fields if and only if $d\geq 3$ and $p\mid d$.

comments
20+10 pages, comments welcome; v2: added citations to closely similar results obtained in concurrent and previous works (Refs 6,42-44)
fields
Mathematical Physics
pdf ↗ page arXiv:2609.16490 ↗

In this paper we explore the world of $t$-sumfree sequences, primarily for $t=2$ and $t=3$. Starting with $t$ increasing positive integers, build an infinite sequence by choosing as the next entry the least positive integer that is not the sum of $t$ distinct previous values. The main open problem concerns the question of the conjectured ultimate periodicity of these sequences. We formulate a sufficient condition to prove that a conjectured preperiod and period are correct. We also prove periodicity for a considerable subclass of 2-sumfree and of 3-sumfree sequences. Finally, we present the results of extensive computations on 3-sumfree sequences.

comments
41 pages, 3 tables
fields
Number Theory
pdf ↗ page arXiv:2609.16843 ↗

The distance to the nearest wall provides a length scale in models of wall-bounded turbulence. Computing this distance accurately on highly stretched meshes is challenging because small near-wall cells restrict explicit pseudo-time steps and geometric singularities can induce spurious oscillations. To address these challenges, this paper presents a semi-implicit finite-volume scheme based on a scalar auxiliary variable (SAV) for solving the pseudo-time Eikonal equation on unstructured meshes. An upwind weighted least-squares reconstruction supplies the gradients used to evaluate the cell-averaged Eikonal residuals. The artificial-viscosity term is discretized using a two-point face flux whose coefficient vanishes as the regularized residuals in both adjacent cells tend to zero. The SAV update advances the semi-discrete system in pseudo-time by evaluating the residuals and viscosity coefficients explicitly and coupling the wall-distance averages and auxiliary variables implicitly. The analysis establishes unconditional energy stability under homogeneous Dirichlet conditions, permitting a grid-independent global pseudo-time step. The system's M-matrix structure guarantees nonnegative cell averages of the physical wall distance under a separate step restriction, while residual regularization and artificial viscosity preserve the formal order of spatial accuracy. Numerical tests confirm second-order spatial convergence for the quarter-cylinder case and demonstrate robust wall-distance computation on highly stretched meshes typical of Reynolds-averaged Navier–Stokes simulations. The SAV formulation is independent of the reconstruction scheme, providing a basis for extensions to higher-order finite-volume methods and other nonconservative scalar equations.

fields
Numerical Analysis
pdf ↗ page arXiv:2609.16885 ↗

We establish explicit sufficient conditions for multiplicity of positive solutions of the Hénon equation in the unit ball and for uniqueness in one dimension. In the Sobolev-subcritical range, a spherical harmonic function argument shows that the radial solution has Morse index greater than one and therefore differs from a ground state. In even dimensions, a degree-four perturbation in a symmetry and monotonicity cone yields a sufficient condition for nonradiality in the supercritical range. The one-dimensional uniqueness criterion follows from a comparison of weighted Dirichlet eigenvalues and a concavity estimate.

comments
12 pages, 1 figure
fields
Analysis of PDEs
pdf ↗ page arXiv:2609.18039 ↗

In this paper, we prove Koszul duality for symmetric algebras of connective complexes consisting of locally free sheaves of finite rank, which is not necessarily bounded below. As an application, we construct an equivalence between derived categories of derived loop spaces and the symmetric algebra of the tangent complex for arbitrary separated schemes of finite type over a field $k$ of characteristic zero. This can be regarded as a generalization of the classical duality between derived loop spaces and cotangent bundles by Kapranov in the smooth cases. We also give a geometrical interpretation of our equivalence in terms of derived formal stacks.

comments
29 pages. Revised formulations of equivalences
fields
Algebraic Geometry
pdf ↗ page arXiv:2609.18115 ↗

The BFKL equation describes how the density of gluons in a hadron grows with the collision energy. This evolution is often treated as a random walk in the logarithm of the gluon transverse momentum, but it has not been established that one set of positive step probabilities describes this walk in the size and the direction of the momentum, or that such probabilities exist beyond leading order. We show that one positive step density describes the evolution in the size and the direction of the momentum with no approximation at leading order, fixed coupling and zero momentum transfer, once the gluon density is rescaled by the size of its transverse momentum and its growth is divided out. The displacements of the resulting walk over separate, equal intervals of rapidity, the logarithm of the energy in units of a reference energy, are then independent and identically distributed, which makes the walk a Levy process. We also show that this description fails when the series in the coupling is cut at next-to-leading order, with the reference energy and the scale of the coupling both set by the product of the transverse momenta before and after an emission. The evolution averaged over directions then has no probability law at any fixed positive coupling and rapidity, because a negative correction growing as the squared logarithm of the momentum ratio outweighs the leading term when one momentum is much larger than the other. A positive step density for the averaged walk agrees with this truncated evolution to next-to-leading order and defines a random walk for every value of the strong coupling below one, so the failure comes from the truncation. The main message is that agreement with perturbation theory does not guarantee positive step probabilities, so an evolution equation summed to all orders and meant to describe a random walk must be tested for them.

comments
38 pages, 2 figures. v2: revised and restructured version. The ancillary reproduction archive is unchanged from v1, and its checksum list refers to the v1 source
fields
Probability
pdf ↗ page arXiv:2609.18269 ↗

We study the ε-capacity regions of mixed multiple-access channels (MACs) with general mixture and cost constraints by the information spectrum method. The starting point is a general formula for the ε-capacity region of general MACs with cost constraint, together with the random-coding and converse lemmas from which it is derived. For the quasi-static fading Gaussian MAC, with random fading coefficients and noise variance, we show that the ε-capacity region is the ε-outage capacity region, which gives the latter a Shannon-theoretic operational meaning. The direct part follows from the general formula, and the converse part from the strong converse property of the Gaussian MAC, which is stronger than the ε-strong converse, applied to each component. The ε-capacity regions coincide in all four scenarios of availability of channel state information (CSI), and the results extend to K users. With CSI at both terminals, variable-rate coding enlarges the 0-capacity region to the polymatroid whose rank function is the average of those of the components. For mixed MACs with general components and a countable parameter space, CSI at the receiver alone never enlarges the ε-capacity region, and the region with CSI at the transmitters is given by an information spectrum formula; unlike the Gaussian case, the regions with and without CSI at the transmitters may differ. For uncountable parameter spaces, only the formula for the region with CSI at both terminals survives in general. Parts II and III treat finite-alphabet mixed MACs and the strong converse for the K-user Gaussian MAC, respectively.

comments
30 pages, 2 figures
fields
Information Theory
pdf ↗ page arXiv:2609.18352 ↗

We study infinitesimally homogeneous affine manifolds with prescribed structure groups. First, for the real symplectic group $\operatorname{Sp}(2n,\mathbb R)$, we prove that the corresponding infinitesimally homogeneous structures are precisely flat torsion-free symplectic affine structures. Second, for \(\operatorname{U}(n)\times\{1\}\), whose \(G\)-structures are equivalent to almost contact metric data, we classify the torsion-free characteristic tensors and obtain the general torsional case by invariant deformation. The admissible torsion and inner-torsion parameters are governed by a single algebraic relation, and the horizontal distribution is contact precisely when a certain combination of these parameters does not vanish. We also describe the compatible connections and relate the torsion-free branches to trans-Sasakian geometry.

comments
20 pages
fields
Differential Geometry
pdf ↗ page arXiv:2609.19568 ↗

We introduce a new class of backward logarithmic orthogonal functions and generalized backward logarithmic orthogonal functions, constructed by applying a terminal-endpoint logarithmic mapping to generalized Laguerre polynomials. These functions are designed for backward spectral approximations of problems whose solutions exhibit weak singularities at the terminal endpoint. The proposed basis functions generate non-polynomial weighted approximation spaces with nodes naturally clustered near the singular endpoint, and therefore provide an effective framework for resolving algebraic and logarithmic endpoint singularities. We develop the basic approximation theory for these backward logarithmic orthogonal functions, including recurrence relations, derivative formulas, orthogonality, Sturm–Liouville characterization, mapped Laguerre–Gauss quadrature rules, weighted projection estimates, backward Lagrange interpolation estimates, inverse inequalities, and stability properties in weighted Sobolev-type spaces defined through a terminal logarithmic pseudo-derivative. A generalized version of the basis is also introduced by incorporating an algebraic scaling parameter, which improves the flexibility of the approximation space and allows singular factors to be represented more effectively. The error analysis and numerical results show that the proposed backward logarithmic basis is particularly suitable for weakly regular functions with terminal-endpoint singularities and can recover exponential or high-order convergence rates that are typically lost when usual polynomial approximations are applied directly.

comments
This paper has been withdrawn by the author. The work is part of an ongoing research project, and it was submitted without the required approval from the project. The withdrawal is not due to a mathematical error in the paper.
fields
Numerical Analysis
pdf ↗ page arXiv:2609.20901 ↗

We study real-analytic planar maps, that admit a real-analytic first integral with a non-degenerate extremum, in a neighbourhood of an elliptic fixed point. We prove that, if the map preserves an analytic area form, it is real-analytically and symplectically conjugate to a twist map, both in the resonant and in the non-resonant case. Using an example, we show that without the area-preservation assumption the conclusion fails. We then prove that a second, continuous, first integral is either a function of the first one or forces the map to be periodic, in which case the map is analytically (and, when area-preserving, symplectically) conjugate to its linear part. We illustrate our results, we study the McMillan map, and a planar map obtained from the Adler–Yamilov Yang–Baxter map.

comments
2nd version, corrected, rewritten and with two examples added
fields
Dynamical Systems
pdf ↗ page arXiv:2609.21417 ↗

We construct explicit families of maximal singular curves over finite fields. A maximal singular curve is a curve that attains the Aubry-Perret bound, which is the natural extension of the Hasse-Weil-Serre bound on the maximum number of rational points on a smooth curve over a finite field. Starting from a smooth elliptic or hyperelliptic curve $\tilde{C}$ over $\mathbb{F}_{q}$ ($q$ odd), we generate singular curves $C$ with non-split singularities or cusps. In our approach we use linear projections of geometric embeddings, and we apply Stöhr's embedding of hyperelliptic Gorenstein curves and the Rosa-Stöhr's theory of trigonal Gorenstein curves. Some of our models attain the Aubry-Perret bound, whenever their normalization is maximal, and the construction is applied to the Tafazolian and Tafazolian-Torres smooth maximal curves to produce the desired family. Finally, we determine the gonality over $\mathbb{F}_q$ of most of the curves we construct.

comments
32 pages, comments very much welcome at any time!!
fields
Algebraic Geometry
pdf ↗ page arXiv:2609.22557 ↗

We introduce a conformal Killing-Yano Ricci soliton, coupling conformal Ricci soliton geometry to conformal Killing-Yano 2-forms via the divergence of the form. In four-dimensional Lorentzian signature, the principal conformal structure is not preserved under non-trivial conformal deformation, so the associated form on local Kerr-NUT-(A)dS backgrounds is not closed. For Einstein backgrounds in any dimension and signature, integrability forces the form to be Killing for the background and conformal Killing for the necessarily Einstein soliton metric, with the conformal factor satisfying eigenvalue and Obata-type Hessian equations; the coupling fixes the Einstein constant. Vanishing coupling reduces the data to Killing data on the fiber; otherwise the soliton metric is Ricci-flat. Locally the background is a warped product. In the compact Riemannian case, the manifold is the round sphere. Explicit static spherically symmetric and BTZ constructions are given, with applications to exact geometries in general relativity.

comments
17 pages
fields
Differential Geometry
pdf ↗ page arXiv:2609.23424 ↗

We classify, up to based-ring isomorphism, the Grothendieck rings of strictly weakly integral fusion categories of rank six over $\mathbb C$. The dimension grading and the classification of integral Grothendieck rings of rank at most five reduce the problem to twelve candidate fusion rings. We exclude four of them using the twist trace and the induction pairing in the Drinfeld center. The remaining eight admit known categorifications. In particular, every such category has commutative Grothendieck ring and Frobenius–Perron dimension in $\{8,10,16,20\}$.

comments
V2: The exposition and proofs have been revised accordingly
fields
Quantum Algebra
pdf ↗ page arXiv:2609.23559 ↗

In this paper, we study modulated $(C,α)$-ergodic averages with operator-valued weights and their subsequential versions in the setting of semifinite von Neumann algebras. Our framework combines $(C,α)$-type modulation with operator-valued weights and extends both scalar-weighted and operator-valued weighted ergodic theories. We establish mean ergodic theorems and maximal inequalities for these averages on noncommutative $L_p$-spaces. We then study bilateral almost uniform and almost uniform convergence in noncommutative Orlicz spaces, including convergence along subsequences of density one when $α\geq 1$. A key ingredient in our approach is the introduction of the $p$-convexity condition on the underlying Orlicz function. This condition allows us to transfer appropriate maximal estimates from noncommutative $L_p$-spaces to establish bilateral uniform equicontinuity in measure at zero on the corresponding noncommutative $p$-convex Orlicz spaces. Together with the noncommutative Banach principle, this yields the desired pointwise convergence results. As an additional consequence of our $p$-convexity argument, we extend Rota theorem to a larger class of noncommutative Orlicz spaces associated with the $p$-convex Orlicz functions considered in this article.

comments
Updated Version
fields
Operator Algebras, Functional Analysis
pdf ↗ page arXiv:2609.23616 ↗

We revisit Frolov and Zelnikov's electrostatic Green function for a test charge in a multi-center Majumdar–Papapetrou spacetime, correcting its horizon-charge condition and extending the result to higher dimensions. In four dimensions, we derive the exact Dirichlet-to-Neumann map for a minimally coupled spectator Maxwell field with independently prescribed horizon potentials. The horizon flux charges obey a capacitance matrix with entries $C_{AA}=M_A+\sum_{B\ne A}M_AM_B/R_{AB}$ and $C_{AB}=-M_AM_B/R_{AB}$, where $M_A$ are center masses and $R_{AB}$ their separations. This matrix is a positive diagonal term plus a weighted graph Laplacian, yielding an exact common-mode/differential-mode decomposition of the field energy. The grounded Dirichlet Green function partitions a point charge's flux among infinity and the horizons through harmonic measures. We show that the diagonal condition imposed by Frolov and Zelnikov [Eq.~(4.14)] preserves only the total horizon charge, allowing redistribution between individual horizons. A corrected symmetric Green function preserving each horizon charge instead involves the inverse capacitance matrix. For two centers, the correction produces a finite, negative-semidefinite self-energy shift and an exact self-force difference, without additional ultraviolet subtraction. Finally, we extend the capacitance matrix, flux partition, and fixed-charge Green function to $D=n+3$ dimensions, where the graph weights contain the universal factor $π^{n/2}/Γ(n/2)$.

comments
10 pages, 3 figures; to appear in Eur. Phys. J. C
fields
Mathematical Physics
pdf ↗ page arXiv:2609.23921 ↗

In this paper, we study standard and distributionally robust $\mathcal{H}_2$ synthesis problem of a stabilizing state-feedback controller for discrete-time linear time-invariant systems. Without requiring a nonsingular disturbance controllability Gramian or a positive-definite control penalty, we establish that stationarity of a stabilizing gain in standard $\mathcal{H}_2$ synthesis is equivalent to global optimality and derive an exact Pythagorean identity for the performance difference. We then generalize the $\mathcal{H}_2$ synthesis problem by considering i.i.d. disturbances with zero mean and uniformly bounded second moments, and extend the stationarity-optimality equivalence to the corresponding distributionally robust $\mathcal{H}_2$ synthesis. Moreover, we show that every standard $\mathcal{H}_2$-optimal gain is simultaneously optimal for every such distributionally robust problem. Finally, we specialize the framework to Frobenius, Kullback–Leibler, and Wasserstein-2 ambiguity sets and obtain explicit characterizations of their worst-case covariances, which, in turn, provide performance certificates for a common optimal controller.

fields
Optimization and Control
pdf ↗ page arXiv:2609.24421 ↗

In this paper, we extend numerical schemes based on parameterized Young measures and linear programming to two space dimensions and apply them to the Kelvin-Helmholtz instability governed by the two-dimensional Euler equations of gas dynamics. We construct first-, second-, third-, fifth-, seventh-, and ninth-order Young-measure schemes and compare them with corresponding standard local Lax-Friedrichs (LLF) flux-splitting schemes and LLF schemes equipped with an entropy-based local characteristic decomposition (LLF-ELCD). We examine instantaneous and time-averaged density profiles, cumulative averages across spatial reconstruction orders, regional empirical density distributions, averaged density marginals, and several selection criteria for dissipative weak solutions. The numerical results reveal scheme-dependent flow patterns, particularly in the small-scale structures generated during the roll-up of the shear layers. At every reconstruction order considered, the Young-measure schemes yield the largest time-averaged physical entropy. By contrast, the LLF-ELCD schemes do not systematically yield larger entropy than the standard LLF schemes and therefore do not constitute a consistent maximum-entropy selection mechanism. The averaged density marginals of the Young measures are concentrated on several neighboring density states, and the later cumulative averages are closer for all Young-measure schemes. These results demonstrate the feasibility of the two-dimensional Young-measure formulation and show that the objective function in the linear-programming problem can act as an effective selection mechanism. The observed entropy preference is consistent with the local optimization of the expected physical entropy. It cannot be reproduced by merely incorporating entropy into a conventional numerical construction.

fields
Numerical Analysis
pdf ↗ page arXiv:2609.24479 ↗

Isoperimetric inequalities on the Boolean hypercube play a fundamental role in the analysis of Boolean functions. These inequalities have been established primarily for the uniform measure and for biased product measures, often through Fourier-analytic or inductive arguments. We develop a curvature-based semigroup framework to establish isoperimetric inequalities for measures with weakly dependent coordinates. In particular, we show that a Dobrushin-type condition, together with marginal boundedness of the distribution, implies the local Bobkov inequality, Talagrand's $L^1$--$L^2$ and variance–surface-area inequalities, the Kahn–Kalai–Linial inequality, and the Eldan–Gross inequality. Our results apply to zero-field Ising models with interaction matrix $J$ throughout the Dobrushin uniqueness regime $\|J\|_1<1$. The framework builds on discrete Bakry–Émery theory and gradient estimates and can also be extended to measures on Hamming slices or hypergrids.

comments
62 pages, 1 figure
fields
Probability
pdf ↗ page arXiv:2609.24687 ↗

A $\textit{magic-lined hypercube}$ (or, simply, $\textit{magic hypercube}$) of order $k$ and dimension $n$ is an arrangement of the numbers $1,\dots,k^n$ in a $k\times\cdots\times k$ ($n$-fold) grid such that every line of $k$ numbers parallel to a coordinate axis has the same magic sum. While such hypercubes exist for every order $k\ge 3$ and every dimension $n$, no magic-lined hypercube of order $2$ exists in any dimension $n\ge 2$. For hypercubes of order $2$, we thus relax the magic condition from lines to two-dimensional faces or planes. We call an arrangement of the numbers $1,\dots,2^n$ in a $2\times\cdots\times2$ ($n$-fold) grid \emph{magic-faced} if every $2\times2$ face has the same magic sum. We prove that a magic-faced hypercube of order $2$ exists in every dimension $n\ge0$, and that it is unique up to a certain natural set of transformations of size $2^n(n+1)!$ when $n$ is even and $2^n n\cdot n!$ when $n$ is odd. As an application, we recover and generalize the classical $4\times4$ Khajuraho magic square, give a new, conceptual answer to a question of Coxeter on the group acting on the $384$ ``most-perfect" $4\times4$ magic squares, and extend the picture to higher dimensions. In particular, we prove that, in dimension $n$, these most-perfect hypercubes form a single orbit under a certain natural action of the Weyl group $W(B_{2n})$.

comments
33 pages
fields
Number Theory, Combinatorics, Group Theory
pdf ↗ page arXiv:2609.26762 ↗

We study degenerations of orbits in varieties of chain complexes of projective modules. We show that degenerations are characterized in terms of certain admissible short exact sequences in the exact category of complexes of projectives, analogously to work from Riedtmann and Zwara. We then extend our study to the homotopy category. In this context, complexes of projectives with a given $g$-vector form an ind-variety, and we prove that degenerations of orbits are characterized by the existence of certain distinguished triangles in the category. This links to the algebraic definition of degeneration for triangulated categories introduced by Jensen, Su and Zimmermann.

comments
25 pages
fields
Representation Theory
pdf ↗ page arXiv:2609.28051 ↗

We present a tightened convergence analysis of clipped gradient descent on $(L_0, L_1)$-smooth functions, with quantitative constants. Building on the ideas of Koloskova et al (2023), we refactor several case disjunctions to reveal the central role of a control of the bias derived from fundamental properties of $\ell_2$-projection, simplifying proofs. We also extend the domain of validity from $η\leq 1 / (9 β)$ to $η< 1 /β$ where $β= L_0 + c L_1$ for clipping constant $c$, which matches the more traditional analysis of smooth functions. We strengthen the convergence criterion from $\left( \min_{t < T} \mathbb{E}[\lVert \nabla f(x_t) \rVert_2] \right)$ to $\left( \frac{1}{T} \sum_{t < T} \mathbb{E}[\lVert \nabla f(x_t) \rVert_2] \right)$ with matching speed, and lower the final achievable floor from $\mathcal{O}(\min(σ^2/c, σ))$ to the more precise $6 \min(σ^2 /c, 3 σ)$.

comments
v2 fixes several typos and clarifies some abuses of notations
fields
Optimization and Control
pdf ↗ page arXiv:2609.29458 ↗

The speed $v(λ)$ of the $λ$-biased random walk on a supercritical Galton–Watson tree without leaves is conjectured to be nonincreasing on $[0,m)$, where $m$ is the mean offspring. For non-constant offspring, monotonicity is known only for small bias: $λ\le 1/1160$, $λ\le 1/2$, and, when every vertex has at least $m_1\ge 2$ children, $λ\le m_1/(1+\sqrt{1-1/m_1})$. For offspring uniform on $\{2,3\}$ ($m=2.5$) the last bound is $2/(1+\sqrt{1/2})\approx1.1716$. We prove, with computer assistance, that $v$ is strictly decreasing on $[0,1.755]$ for this law. The proof has three parts. Aïdékon's speed formula gives $v=(R-λ)/(R+λ)$ for an explicit functional $R$, so $v$ decreases exactly when $R/λ$ does; we compare $R/λ$ at two biases directly, which avoids differentiating the conductance. A pathwise Lipschitz bound on the conductance in $λ$ turns that comparison into an inequality between expectations of explicit functions. A monotone sandwich of discretised laws gives two-sided bounds on the conductance law, and each $λ$-cell is checked in exact rational arithmetic over bounded floating-point error, with five cells re-checked in interval arithmetic; all reduction lemmas and an exact-integer certificate across $[1.17,1.755]$ are also formally verified in Lean 4. The method stops where the crude Lipschitz bound becomes too weak; sharper control of the derivative of the conductance is what the full range needs. Code and certificates are public.

code
github.com/samyama-ai/gw-speed-certificate ∎ Lean project (lean/lakefile.toml, lean/lean-toolchain) builds, no sorry at 7723b63, checked 2026-11-13 build details
comments
9 pages, 1 figure. v3 adds a Lean 4 + mathlib formalisation of all reduction lemmas and an exact-integer certificate covering [1.17, 1.755]. Code: https://github.com/samyama-ai/gw-speed-certificate
fields
Probability
pdf ↗ page arXiv:2609.29894 ↗

Let $1<m<n$, $q>0$, and $p\in\mathbb R$. We study positive $C^1_{\mathrm{loc}}$ weak solutions of \[-Δ_m u=u^p|Du|^q\qquad\text{in }\mathbb R^n.\] If $0<q<m-1$, we prove that every such solution is constant provided \[p+q-m+1<\frac{(m-1)(m-q)^2}{(n-m)(m-1-q)}.\] If $q\geqslant m-1$, the same conclusion holds for every $p\in\mathbb R$. For $0<q<m$, the proof uses an auxiliary function and reduces the main differential estimate to a lower bound for a function of one variable. An explicit construction and a local maximum-principle argument then prove constancy without differentiating across $\{|Du|=0\}$. When $m=2$, our result answers the natural Liouville problem left open by Bidaut-Véron, García-Huidobro and Véron for the whole range $0<q<1$. The case $q\geqslant m$ is handled by the related work of Bidaut-Véron.

fields
Analysis of PDEs
pdf ↗ page arXiv:2609.30006 ↗

A square is a word $xx$ with $x$ nonempty. We study the maximum number of distinct squares occurring in the rotations of a word of length $n$. Amit and Gawrychowski (SPIRE 2017) obtained an upper bound of $3.14n$. Charalampopoulos et al. (CPM 2026) improved the upper bound to $\lceil9n/5\rceil$ and gave a binary construction with at least $3n/2-O(\sqrt n)$ distinct squares for infinitely many $n$. They conjectured an upper bound of $3n/2$. Li and Song subsequently reported an improved upper bound of $5n/3$. We prove that a circular word of length $n$ containing $σ$ distinct letters has at most $\lfloor3(n-σ)/2\rfloor$ distinct squares. This settles the conjecture and establishes that the leading coefficient $3/2$ is optimal even for binary words. Our proof groups squares by their Lyndon roots and, for primitive words, uses a weighted count of circuits in the Rauzy graphs of the bi-infinite repetition of the word.

comments
13 pages, 2 figures. Revised title and exposition, clarified proofs, and updated references. The main theorem gives the alphabet-sensitive upper bound $\lfloor 3(n-σ)/2\rfloor$, where $σ$ is the number of distinct letters
fields
Combinatorics
pdf ↗ page arXiv:2609.32084 ↗

The loop group description of surfaces whose Gauss map is Lorentz harmonic is known for timelike surfaces of constant mean curvature in the flat Lorentzian 3-space, and for surfaces of constant Gaussian curvature in the 3-sphere. We carry out the corresponding construction for timelike surfaces in anti-de Sitter 3-space $\mathbb{H}^3_1\cong SL(2,\mathbb{R})$: those of constant mean curvature, whose Gauss map is harmonic for the conformal structure of the first fundamental form, and those of constant Gaussian curvature $K>-1$, $K\neq0$, whose Gauss map is then an immersion and is harmonic for the second fundamental form. For both classes we prove the harmonicity characterization, recover the surfaces from extended frames by Sym-Bobenko-type formulas, and solve the geometric Cauchy problem by the generalized DPW method, with potentials written explicitly in terms of the data and no normalization of the Gauss map. We then show that the two constructions differ only by a normalization: after the substitution $λ=ζ^2$ and a constant gauge, a constant mean curvature extended frame $\hat F$ is an extended frame of its Gauss map, and the maps $\hat F|_{λ=e^{4θ}}\exp(θe_3)\hat F|_{λ=1}^{-1}$ and $e_3\hat F|_{λ=e^{4θ}}e_3\exp(θe_3)\hat F|_{λ=1}^{-1}$, with $e_3=\mathrm{diag}(-1,1)$, are timelike surfaces of constant Gaussian curvature $1/\sinh^2θ$ and $-1/\cosh^2θ$ wherever the constant mean curvature surface is not flat. The first is the classical parallel surface, the second its polar surface. Explicit families, with extended frames and surfaces in closed form, illustrate the constructions.

comments
41 pages
fields
Differential Geometry
pdf ↗ page arXiv:2609.33504 ↗

We develop a transverse covering $L^2$ argument that both substantially simplifies the approach of Gan, He, Li, and Wu and improves their local smoothing estimates for Fourier integral operators with positive conic curvature in even spatial dimensions $n\geq 4$. We also investigate the limitations of wave packet density methods, showing that genuine geometric obstructions already arise in the Euclidean setting.

comments
Substantially simplified the arguments and strengthened the main result
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2609.34675 ↗

In this work, we provide a complete characterisation of Pitt's inequality for metaplectic operators. The symplectic geometry underlying a metaplectic operator distinguishes effective directions, along which its action is Fourier-type, from singular directions, along which concentration is preserved. For this reason, we adopt two complementary perspectives, thereby obtaining both an isotropic Pitt's inequality, emulating the classical theorem of Pitt, and an anisotropic inequality that adapts to the geometric features of the metaplectic group. As a by-product, we obtain Pitt's inequality for Fourier transforms along subspaces of $\rd$ and new quantitative time-dependent boundedness results for metaplectic operators on homogeneous Sobolev spaces, with applications to Schrödinger evolutions generated by quadratic Hamiltonians. Additionally, we derive logarithmic and entropic uncertainty principles for the metaplectic group. We show that the classical entropic uncertainty principle fails when both the effective and singular directions are present. In this case, a generally unbounded corrective entropy term accounts for the concentration-preserving directions and restores a meaningful lower bound. For quadratic Schrödinger evolutions, this correction follows the time-dependent geometry of the nondispersive directions and adjusts the uncertainty estimate accordingly.

comments
Journal feedback was implemented
fields
Classical Analysis and ODEs, Analysis of PDEs
pdf ↗ page arXiv:2609.34946 ↗

We establish convergence of minimizers for a minimal one dimensional atomic-scale model for relaxation in moiré materials to those of a one-dimensional continuum limit functional analogous to those commonly used in practice to model relaxation. The atomic-scale model consists of two periodic chains containing $N$ and $N+1$ atoms per common cell and is exactly moiré-periodic at the atomic scale. Its energy combines harmonic nearest-neighbor intralayer interactions with nonlocal interlayer interactions generated by an even $C^2$ pair potential with polynomial decay. The associated continuum energy couples linear elasticity to a periodic misfit potential, obtained by periodizing the pair potential, which penalizes unfavorable local stackings.

comments
Added numerical confirmation and proof of Gamma-convergence, 32 pages, 3 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2609.37943 ↗

Low-depth syndrome extraction for Calderbank-Shor-Steane (CSS) quantum low-density parity-check codes can be formulated as a proper ordered edge-coloring problem subject to quantum parity constraints. A proper edge-coloring of the CSS Tanner graph ensures that each data or ancilla qubit participates in at most one two-qubit gate per layer, but does not guarantee a valid interleaving of the X- and Z-check measurements as for every overlapping X/Z check pair, the number of shared data qubits on which the X interaction precedes the Z interaction must be even. The minimum number of colors in a proper ordered edge-coloring satisfying the quantum parity constraints equals the minimum two-qubit depth when each stabilizer check is measured with a single ancilla. We introduce local automorphism-aware syndrome compilation (LocalASC), which reduces the constraint system to edge-orbit variables under a subgroup of the Tanner graph automorphisms and lifts each feasible orbit assignment to the full graph. Although the $6$-layer degree lower bound is unattainable for the published weight-$6$ IBM bivariate bicycle codes, we show that this is not universal among two-block CSS codes. Among code instances for which the maximum check weight equals the maximum Tanner graph degree, LocalASC finds depth-optimal syndrome-extraction schedules for several two-block CSS codes with odd component weights, including instances with unequal odd weights. We also obtain lower-bound-saturating syndrome-extraction schedules for several quantum Tanner codes satisfying the same degree condition. To obtain the subgroups used by LocalASC without computing the full automorphism group of the Tanner graph, we construct translation subgroups for two-block group-algebra CSS codes over abelian groups. For quantum Tanner codes, we give conditions under which square-complex symmetries extend to Tanner graph automorphisms.

comments
Submitted for publication; v2: The LocalASC code and data are now publicly available at https://github.com/Simula-UiB/LocalASC
fields
Information Theory
pdf ↗ page arXiv:2609.40319 ↗

We prove that every event invariant under swaps has probability zero or one for either the free or the wired spanning forest on any connected, locally finite, infinite network. Applications include the constancy of the number of components and of the total number of excessive ends. For the free forest, these results resolve longstanding questions of Benjamini, Lyons, Peres, and Schramm [Ann. Probab. (2001), Question 15.7] on constancy of the component count and of Lyons, Morris, and Schramm [Electron. J. Probab. (2008), Question 7.7] on the zero-one law for one-endedness. In the latter case, we obtain the stronger conclusion that the total number of excessive ends is deterministic.

comments
7 pages, 1 figure
fields
Probability, Combinatorics
pdf ↗ page arXiv:2610.00938 ↗

The purpose of this note is to give conditional explicit formulas for the Galois action on real multiplication values of the Shintani–Faddeev modular cocycle. We assume the order 1 abelian Stark conjecture for real quadratic fields. We conclude this note by presenting our own conjecture about the Galois action. Numerical evidence for this conjecture is provided by the algorithm described in \hyperref[sec4]{Section 4} and the attached code.

fields
Number Theory
pdf ↗ page arXiv:2610.02419 ↗

We study mirror symmetry for a class of generalized complete intersection Calabi-Yau (gCICY) threefolds via variations of GIT. Our focus is on gCICY threefolds in $\mathbb{P}^1\times B$ with a $[3,-1]$ block, cut out by sections of $O(3)\boxtimes O_B(L)$ and $O(-1)\boxtimes O_B(L+R)$, where $B$ is a smooth projective fourfold and $2L+R=-K_B$. Auxiliary variables turn the generalized section into a relative variation of GIT, whose two phases are the gCICY threefold itself and the zero locus of a rank-3 bundle on $\mathbb{P}^2\times B$, and they are isomorphic or related by $\int_B L^4$ disjoint Atiyah flops. Over products of projective spaces, there are 18 Calabi-Yau threefold configurations with a $[3,-1]$ block. All of them except the non-Gorenstein case studied in the companion paper have toric phases with Gorenstein ambient spaces and nef partitions, so that after the variation of GIT their mirror symmetry reduces to Batyrev-Borisov duality. We analyze four examples with a $[3,-1]$ block and one outside this class in detail.

comments
Fixed typos and minor errors, improved exposition, and updated line bundle conventions
fields
Algebraic Geometry, Symplectic Geometry
pdf ↗ page arXiv:2610.03688 ↗

The eigenvalues of a large normal random matrix form a two-dimensional Coulomb gas. At fixed weight, the spectral droplet grows with the matrix rank, and its semiclassical density increment is harmonic measure. We freeze an $N$-eigenvalue configuration and sample $M$ further eigenvalues using the projection onto polynomials of degree less than $N+M$ that vanish at the frozen points. Their conditional law is an exact polynomial ensemble in the potential of the frozen charges. For a regular analytic droplet, we prove that the spatial distribution of the new eigenvalues converges to harmonic measure on the old boundary when $M/\log N\to\infty$ and $M/N\to0$. This convergence holds conditionally on the frozen spectrum, outside a set of frozen configurations whose probability tends to zero. The equilibrium process formed from orthogonal polynomials of degrees $N,\ldots,N+M-1$ has the same limit. An exact finite-rank identity relates polynomial moments of the conditional mean to fluctuations of the frozen spectrum, with a remainder from polynomial modes of degree $N+M$ and above.

comments
20 pages, 2 figures; v2 update acknowledgments
fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2610.03912 ↗

For positive matrices $A,B$ and $p,q>0$, the second author (2009) asked whether the inequality \[ \|A^pB^q+B^pA^q\|\leq \|A^{p+q}+B^{p+q}\| \] holds for every unitarily invariant norm. Despite a series of papers addressing this question, as well as recent intensive computational and AI-assisted investigations by Matthew Colbrook (2026, \cite{Col}), the problem remains open. It is a striking example of how an elementary scalar statement can become extremely difficult to handle in the noncommutative setting. Some partial positive results are known. In this note, we provide one more: the crossed-Heinz inequality holds for two-by-two matrices. This result also leads to a new and elegant characterization of the singular values of two-by-two matrices. In arbitrary dimension, we turn to the special case $p=q=1$, obtaining a series of eigenvalue estimates for the anticommutator $AB+BA$.

comments
This paper has been accepted for publication in the Bulletin of the Australian Mathematical Society
fields
Functional Analysis
pdf ↗ page arXiv:2610.04567 ↗

The ideal magnetohydrodynamic (MHD) system that governs a conducting plasma—the Maxwell equations together with the conservation laws of mass, momentum and energy—is the same local balance structure that describes hot accretion flows around black holes. We introduce a uniform four-dimensional spacetime dilation \[ Φ_L:\;(t',x',y',z')\mapsto (t,x,y,z)=(Lt',Lx',Ly',Lz'),\qquad L>1, \] and show that it is a smooth, orientation-preserving $C^\infty$ diffeomorphism of flat spacetime. Pulling the MHD conservation laws back through $Φ_L$, we prove that the closed ideal-MHD system is form-invariant (covariant), with the current density rescaling as $\bm j=\bm j'/L$, the magnetic diffusivity as $η'=η/L$, and external sources rescaled by $L$. The transformation realises three physically distinct effects on the perturbed flow: a \emph{linearization} to the tangent-space (linearised MHD) system, a \emph{movie slow-motion} dilation of dissipative and dynamical timescales, and an \emph{electron-microscope} magnification of small-scale structure. Taking the formal limit $L\to\infty$ localises the dynamics on a neighbourhood of a horizon: resistivity vanishes, the asymptotic time derivative freezes, and all transient multipolar structure of the infalling plasma redshifts away. The remaining stationary, axisymmetric, asymptotically flat electrovacuum is uniquely the Kerr–Newman geometry, so that the exterior of the compact object is characterised only by its mass $M$, angular momentum $J$ and charge $Q$. The result provides a local, conservation-law-based perspective on the black hole no-hair theorem that is complementary to the classical Israel–Carter-- Robinson theorems and to contemporary gravitational-wave and Event Horizon Telescope tests.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.04983 ↗

For a K-unstable toric variety, Székelyhidi's optimal test-function $Θ_{P}$ is a mysterious concave function over the moment polytope $P$, which gives the maximal destabilizer for K-stability, and encodes the limiting behavior of the divergent Calabi flow. As balanced norms quantize cscK metrics, we show that $Θ_{P}$ can be quantized by the maximal destabilizers for Chow-stability, which are given by the shortest GKZ vectors, i.e., the least norm point on the secondary polytope associated to the set $P\cap k^{-1}\mathbb{Z}^{n}$. The proof is via the $Γ$-convergence method. Properties and algorithms for general sGKZ vectors are given. It may provide a new method to detect the K-instability of Delzant polytopes.

comments
53 pages, 8 figures. language polishing
fields
Algebraic Geometry, Combinatorics, Differential Geometry
pdf ↗ page arXiv:2610.05179 ↗

We investigate two learning procedures and their relationship to the formation of equilibrium in potential mean field games (MFGs). The first one is a version of the fictitious play in which players observe directly the actions (controls) of other players and learn the distribution of the MFG through an update rules on controls. This leads to a new iterative procedure which converges for a wide class of potential MFGs of controls, even in the presence of common noise. On the other hand we also consider the learning procedure of a principal agent trying to solve a mean field control problem with only local gradient information. We prove that under very general assumption, the gradient descent of such agent converges to a solution of the associated potential MFG.

fields
Optimization and Control, Probability
pdf ↗ page arXiv:2610.06292 ↗

This paper investigates the preservation of three classes of Ehrhart properties under various operations on lattice polytopes. These operations include Cartesian products, lattice joins, lattice pyramids, free sums, Minkowski sums, Cayley sums, reflexive polarity, and integral dilations. Specifically, we consider the following properties frequently studied in Ehrhart theory: (i): Positivity of Ehrhart coefficients, including Ehrhart positivity and magic positivity. In particular, we present lattice point counting formulas for the polytopes generated by these operations. (ii): Coefficient properties of the $h^*$-polynomial, including symmetry, unimodality, log-concavity, ultra log-concavity, real-rootedness, and $γ$-positivity. (iii): Geometric properties, including the spanning property, the integer decomposition property, very ampleness, and the existence of unimodular triangulation, regular unimodular triangulation, and quadratic triangulation. We determine which properties are preserved under these eight operations, establishing preservation theorems or constructing explicit counterexamples. Furthermore, when a property is not preserved in general, we investigate sufficient or equivalent conditions for its preservation.

fields
Combinatorics, History and Overview
pdf ↗ page arXiv:2610.06338 ↗

The classical Descartes' rule of signs bounds the number of positive roots of a real polynomial in one variable by the number of sign changes of its coefficients. This bound only depends on the order of the exponents and on the signs of the coefficients, that is, on the oriented matroids of the exponent and coefficient matrices. We give a multivariate generalization of this rule to arbitrary fewnomial systems: for systems of $n$ real polynomial equations in $n$ variables with $n+k+1$ monomials, we obtain upper bounds for the number of nondegenerate positive solutions which only depend on sign conditions on the maximal minors of the coefficient matrix and of the exponent matrix and its liftings. For $k=1$ they are the Descartes rules of signs for circuits of Bihan–Dickenstein and Bihan–Dickenstein–Forsgård. Our approach starts from the Gale duality and the Khovanskii–Rolle argument of Bihan and Sottile, which reduce the problem to counting common zeros of iterated Jacobians in a polyhedron $Δ$. This polyhedron is a chamber of a hyperplane arrangement whose combinatorics is determined by the oriented matroid of the coefficient matrix. We bound the number of these zeros by the Bézout number minus the zeros forced in the other chambers by a topological degree, which we compute by a facet-count formula involving the signs of minors of a Gale dual matrix of the exponent matrix. This leads to a recursion over the flats of the arrangement, which ends on lines with the Descartes rules for circuits. In this way the coefficients enter the bounds through the combinatorics of the arrangement, and the exponents through sign conditions on minors. Restricting the recursion to coherent chambers gives weaker bounds in closed form, which generalize the Descartes rule for circuits as ``the Bézout number minus the coherent chambers''.

comments
48 pages, 1 figure. v3: added Section 11 and Remark 10.7
fields
Combinatorics, Algebraic Geometry
pdf ↗ page arXiv:2610.06435 ↗

Let $Z_N$ be the partition function of the Sherrington-Kirkpatrick model at inverse temperature $β>1$. Replica theory (Kondor near the critical temperature, Parisi and Rizzo at all temperatures) predicts that the probability that $N^{-1}\log Z_N$ exceeds its typical value by $δ$ decays like $\exp(-Naδ^{6/5})$ with an explicit $a$; Aronow and Lopatto recently proved bounds of this order. The exponent is the Legendre transform of the Parisi problem constrained to carry an atom $θ$ at zero. We show that the constrained minimum exceeds the equilibrium free energy by $c_βθ^5(1+o(1))$, where $c_β=\frac{9}{640}β^3ρ_β(0)^{-3}$ and $ρ_β(0)>0$ is the density at zero of the Parisi measure. With the fractional-moment formula this gives the exponent $\frac56(6c_β)^{-1/5}δ^{6/5}(1+o(1))$ as $N\to\infty$ and then $δ\to0$. The constrained minimizer has a marginal first positive contact, to leading order at $3θ/(2ρ_β(0))$ with an atom $θ/2$. This plateau calculus applies to every mixture with $ξ'''(0)=0$ whose Parisi measure accumulates at zero; a small field $h$ opens a gap of order $|h|^{2/3}$, and an atom of the Parisi measure at zero, present in every pure $p$-spin model with $p\ge3$, makes the rate leave zero linearly. Near criticality the constant tends to Kondor's value $9/5120$ and the marginal regime ends at a de Almeida-Thouless threshold. For the Sherrington-Kirkpatrick model at every $β>1$, a finite-step curvature inequality from an unrefereed preprint shows that every constrained minimizer either has an interval of positive contacts, all marginal, or has exactly two atoms, and that the marginal regime ends at a unique de Almeida-Thouless threshold $θ_c(β)$. The laws at every $β>1$ use that the Parisi measure accumulates at zero, a theorem of Lopatto also proved in earlier work of the author.

comments
v3: replaces v2, whose source files were those of v1; 112 pages, 4 figures, 1 table
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2610.06480 ↗

Let $p\in[1,\infty)$, and let $Ω\subset\mathbb R^N$ be a bounded open interval when $N=1$ or a bounded Lipschitz domain when $N\ge2$. For $γ\in\mathbb R\setminus\{0\}$ and $λ\in(0,\infty)$, consider the weak-type nonlocal functional \begin{align*} F_{λ,p,γ}(u;Ω):=λ^p \underset{\scriptscriptstyle |u(x)-u(y)|>λ|x-y|^{1+γ/p}} {\int_Ω\int_Ω}|x-y|^{γ-N}\,dy\,dx \end{align*} with $u:Ω\to\mathbb{R}$ measurable. We prove that, as $λ\to\infty$ for $γ\in(0,\infty)$ or as $λ\to0^+$ for $γ\in(-\infty,-1]$, $F_{λ,p,γ}(\cdot;Ω)$ converges, in the sense of $Γ$-convergence in $L^p(Ω)$, to \begin{align*} Ψ_{p,γ}^Ω(u) :=\begin{cases} C_{N,p,γ}^{\rm cell}\displaystyle\int_Ω|\nabla u|^p\,dx, &p\in(1,\infty)\ \hbox{and}\ u\in W^{1,p}(Ω),\\ C_{N,1,γ}^{\rm cell}|Du|(Ω), &p=1\ \hbox{and}\ u\in BV(Ω),\\ \infty,&\hbox{otherwise}, \end{cases} \end{align*} where the positive constants $C_{N,p,γ}^{\mathrm{cell}}$ are independent of $Ω$. We also establish the $Γ$-convergence of $F_{λ,p,γ}(\cdot;\mathbb R^N)$ in $L^1_{\mathrm{loc}}(\mathbb R^N)$ for all $γ\in\mathbb R\setminus\{0\}$, with the limit functional having an additional term when $(N,p,γ)=(1,1,-1)$. These results affirmatively answer [Open Problem~9.3, Rend. Lincei Mat. Appl. 2023] of Brezis and also the other problem by Brezis et al. in [Section~7C, Anal. PDE 2024].

comments
This version is a combination of the articles arXiv:2608.18414 and arXiv:2610.07001
fields
Classical Analysis and ODEs, Analysis of PDEs
pdf ↗ page arXiv:2610.07001 ↗

Let $x:M^n\to\mathbb{S}^{n+q}$ be a minimal immersion of a complete connected manifold with flat normal bundle, where $n\ge3$ and $q\ge2$. We prove that if the squared norm $S$ of the second fundamental form satisfies $S\le 2n$, then either $x(M)$ is contained in a fixed totally geodesic subsphere $\mathbb{S}^{n+1}$, or $x:M\to x(M)$ is a Riemannian covering onto a standard minimal product of three spheres with $S\equiv 2n$. We also prove that $x(M)$ is contained in a fixed totally geodesic subsphere $\mathbb{S}^{n+1}$ under the assumption $S+λ_2\le 2n+\frac{2n}{3n-2}$, where $λ_2$ is the second largest eigenvalue of the Gram matrix of the shape operators.

comments
33 pages
fields
Differential Geometry
pdf ↗ page arXiv:2610.07789 ↗

We prove that every cluster monomial of type A_n is log-concave and unimodal with respect to its Laurent expansion in a fan initial cluster. We derive a coefficient formula for laminar interval products arising from compatible diagonals in the polygon model. This gives partial affirmative answers to the log-concavity conjecture of Chen-Huang-Sun and the unimodality conjecture of Chen. Our result for cluster A-varieties also complements Shen's study on the supports of products of canonical basis elements for cluster X-varieties of type A_n.

comments
Minor typos are corrected. Any comments are welcome!
fields
Representation Theory, Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:2610.09312 ↗

We establish an almost-splitting theorem for spacetimes under timelike sectional curvature bounds in the spirit of the celebrated Riemannian result due to Cheeger and Colding. More concretely, we show that if a globally hyperbolic spacetime with timelike sectional curvature bounded below by a nonpositive constant close to zero contains a long maximizing timelike segment, then causal diamonds along that segment are close in the Lorentzian Gromov–Hausdorff sense of Minguzzi–Suhr to those in a product metric spacetime. Our result can be interpreted as a quantitative analogue of the Lorentzian splitting theorem for spacetimes with nonnegative timelike sectional curvature by Beem–Ehrlich–Markvorsen–Galloway. In contrast to the Riemannian setting, the timelike sectional curvature bound cannot be replaced by Ricci-flatness, as the small mass limit of the Schwarzschild exterior geometry shows.

comments
47 pages, 1 figure, incl. Appendix A discussing the small mass limit of exterior Schwarzschild
fields
Differential Geometry, Metric Geometry
pdf ↗ page arXiv:2610.10051 ↗

We extend the BDF2-type finite-element integrator proposed in [M. Aldé, M. Feischl, D. Praetorius; BDF2-type integrator for Landau-Lifshitz-Gilbert equation in micromagnetics: unconditional weak convergence to weak solutions. (Math. Comp., 2026, doi:10.1090/mcom/4210)] to the Landau-Lifshitz-Gilbert (LLG) equation with lower-order effective-field contributions and current-induced non-conservative torques arising in micromagnetic applications. To incorporate these additional terms while retaining a linear solve at each time step, we employ an implicit-explicit (IMEX) time splitting. Our main theorem proves unconditional weak convergence of the fully discrete approximations towards weak solutions of the LLG equation. The analysis removes the mild but artificial CFL-type restrictions required at the first and final time steps in [Aldé M., Feischl M., Praetorius D.; Math. Comp., 2026]. Furthermore, in the presence of the Dzyaloshinskii-Moriya interaction (DMI), the convergence is likewise unconditional and does not require the CFL-type restriction imposed in [G. Hrkac, C.-M. Pfeiler, D. Praetorius, M. Ruggeri, A. Segatti, and B. Stiftner. Convergent tangent plane integrators for the simulation of chiral magnetic skyrmion dynamics. (Adv. Comput. Math., 2019. doi: 10.1007/s10444-019-09667-z)]. Numerical experiments support the theoretical findings.

comments
51 pages, 14 figures. v2: The main result and the main proof remain unchanged; a more general anisotropy energy contribution has been included, some numerical experiments have been also extended, and minor details have been corrected
fields
Numerical Analysis
pdf ↗ page arXiv:2610.10291 ↗

We introduce a packing spectrum that interpolates between Hausdorff and packing dimensions through a family of metric outer measures. The construction assigns an independent scale label to each member of a countable covering and restricts local packing radii to a window determined by that label. The resulting spectrum is countably stable, satisfies the usual Hölder image bound, and is nondecreasing and locally Lipschitz below the packing endpoint, where a jump may occur. We establish Hausdorff product bounds involving the packing spectrum and upper intermediate dimensions, refining the classical Hausdorff–packing bounds. For nonempty analytic sets, we prove a converse characterization by compact product tests and a variational principle in terms of the local mass decay of compactly supported probability measures below the packing endpoint. Finally, we completely classify the possible spectra in each ambient dimension. Every admissible profile is realized by a compact binary digit set. For each realization, a single complementary digit set attains the product bounds at every parameter, and the uniform digit measure simultaneously attains the corresponding variational suprema.

comments
minor revisions and text clarify; comments welcome
fields
Metric Geometry
pdf ↗ page arXiv:2610.10375 ↗

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 $δ_a^-$ at every fixed $a$. If $m_a$ is the least such $m$, we prove that both $5^{-a}\log\log(1/δ_a^-)$ and $5^{-a}\log\log m_a$ tend to $5\logφ/(12e^γ)$, where $φ=(1+\sqrt5)/2$ and $γ$ 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.

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
fields
Number Theory
pdf ↗ page arXiv:2610.10578 ↗

We argue that the scattering amplitude of a single minus helicity gluon with arbitrarily many positive helicity gluons is topological. The amplitude is constant in chambers of kinematic space, its resonances are located at walls and its factorization is determined by wall-crossing. Yangian invariance dictates the amplitude to be determined by a 2d null Wilson loop that can be lifted into a positive and transverse 3d link. By reinterpreting wall-crossing and the Weinberg soft theorem as skein relations and Reidemeister moves of the subknots, we construct a state-counting description consisting of adding the `corners' of their HOMFLY-PT polynomials. Beyond the classical limit, we argue that this provides a conjectured but precise connection to topological field and string theory. The new formula is rigorously derived via a Lean-formalized dependency graph (DAG) as detailed in a companion paper, laying out the precise assumptions including Reidemeister III invariance. It is further tested exhaustively, including novel `star' kinematics where the amplitude and state count are shown to become Catalan numbers, in agreement with knot theory literature.

code
github.com/aguevara22/gluon-knot-lean ∎ Lean project (CORNER_LAWS_FOCUSED_20260912/lean/lakefile.toml, CORNER_LAWS_FOCUSED_20260912/lean/lean-toolchain) builds, no sorry at a6a5705, checked 2026-11-13 build details
comments
Lean formalization at https://github.com/aguevara22/gluon-knot-lean. v2: additional derivation, references added, minor rewording
fields
Mathematical Physics, Geometric Topology
pdf ↗ page arXiv:2610.10673 ↗

A lazy cellular automaton $τ:A^G\to A^G$ is determined by a finite neighborhood $S\subseteq G$ containing the group identity $e$, a pattern $p\in A^S$, and a writing symbol $a\in A\setminus\{p(e)\}$: its local rule is equal to the projection to $e$ except when it reads the pattern $p$, in which case it writes $a$. For a nonempty subset $T$ of the fiber $S_a:= p^{-1}(a)$, we introduce compatibility conditions on $p$ along the right translates $St$, $t\in T$. We show that, over every group, the existence of a compatible set is necessary for $τ$ to be non-idempotent, and that it is also sufficient whenever each element of $S_a$ normalizes the fiber $S_{p(e)}$. In particular, compatibility characterizes non-idempotence over abelian groups, which yields a test using $O(|S|^3)$ elementary operations, instead of an exhaustive search that is exponential in $|S|$. Finally, for every dihedral group $D_n$ with $n\geq 4$, we construct an idempotent lazy cellular automaton that admits a compatible set, showing that the normalization hypothesis cannot simply be dropped.

comments
12 pages
fields
Group Theory
pdf ↗ page arXiv:2610.11811 ↗

We study multiblock convex–concave saddle-point problems of the form $\min_x\max_y\{f(x)+H(x,y)-g(y)\}$, with separately charged partial-gradient oracles for all three objective components. We impose joint smoothness and strong convexity bounds on the functions $f$ and $g$, together with blockwise Lipschitz conditions on the partial gradients of $H$, so that the resulting oracle complexities reflect the smoothness and dependency parameters specific to each oracle. Under strong convexity, we develop a randomized lifted extragradient method that achieves linear convergence while providing simultaneous complexity guarantees for all oracles. The partial-gradient complexities for $f$ and $g$ exhibit the expected square-root dependence on the corresponding block condition numbers, whereas the coupling-gradient complexities depend on the associated curvature-normalized smoothness parameters. Finite-dimensional bilinear subclasses provide lower-complexity benchmarks within a randomized blockwise linear-span model. When strong convexity of $f$ and $g$ is not assumed, a regularization argument yields expected restricted-gap guarantees with accuracy dependence $\varepsilon^{-1/2}$ for the objective-gradient oracles and $\varepsilon^{-1}$ for the coupling-gradient oracles, up to logarithmic factors. Experiments show observed oracle savings and runtime improvements in regimes of poor objective conditioning.

fields
Optimization and Control
pdf ↗ page arXiv:2610.12656 ↗

The network simplex method is a classical algorithm for minimum cost flow problems formulated as linear programs, that has attracted recent interest from the optimal transport community. Indeed, discrete optimal transport is a subclass of minimum cost flow for which network simplex techniques compute exact solutions while leveraging the inherent problem sparsity. However, extending these approaches to other, nonlinear optimal transport formulations has yet to be thoroughly investigated. In this paper, we adapt the network simplex algorithm to unbalanced optimal transport. Our proposed framework is applicable to various unbalanced formulations, and can be implemented explicitly in the most common cases, including semi-unbalanced optimal transport. The resulting algorithms are memory-efficient, and perform competitively with existing approaches, as shown by our experiments on a range of transport and barycenter calculations.

comments
25 pages, 2 tables, 6 figures
fields
Optimization and Control
pdf ↗ page arXiv:2610.13847 ↗

Let $f(n)$ denote the number of isomorphism classes of groups of order $n$. The pioneering works of Higman (\emph{Proc. Lond. Math. Soc.}, 1960) and Sims (\emph{Proc. Lond. Math. Soc.}, 1965), with improvement by Newman and Seeley, establish that \[ \frac{2}{27}m^3-\frac{4}{9}m^2+Ω(m)\leq \log_p f(p^m)\leq \frac{2}{27}m^3+O(m^{5/2}). \] In the same paper in 1965, Sims speculated on improving the error term ($O(m^{8/3})$ at that time) in the upper bound. To show that $f(p^m)\leq \frac{2}{27}m^3+O(m^2)$ is now known as Sims' conjecture. Our first main result proves Sims' conjecture in a strong form as follows: \[ \log_p f(p^m)\leq \frac{2}{27}m^3-\frac{4}{9}m^2+O(m). \] Techniques developed to prove the above lead to progress on some well-known open questions in group enumeration in affirmative, including: (1) 2-group domination in finite group enumeration (Pyber, \emph{Eur. Congr. Math.}, 1996): Let $F(n)$ be the number of groups of order $\leq n$, and $F_2(n)$ be the number of $2$-groups of order $\leq n$. Then \[ \lim_{n\to\infty}\frac{F_2(n)}{F(n)} =1. \] (2) A question attributed to Higman and Erdős (see Blackburn–Neumann–Venkataraman, \emph{Cambridge Tracts in Maths.}, 2007) when $m$ is large enough: \[ \text{for } 1<n<2^m, f(n)<f(2^m). \] Our proof refines Sims' enumeration framework using graded Lie brackets, constraints on deeper commutator coordinates, and incidence and Fourier estimates for alternating forms. Normalisation by changes of generating bases then determines the quadratic term in the upper bound. We also prove that all but a $p^{-Ω(m^2)}$ fraction of groups of order $p^m$ have a central elementary abelian Frattini subgroup. The same presentation estimates give fixed-quotient extension bounds which, together with Pyber's prescribed-Sylow theorem and the concentration result, establish domination by $2$-groups of frattini class $2$.

comments
100 pages
fields
Group Theory
pdf ↗ page arXiv:2610.14509 ↗

We count the integral solutions of $x_1^2+x_2^2-x_3^2=D$ with $|x_3|$ of size at most $M$, for $M$ smaller than $\sqrt D$, using a smooth weight $Φ(x_3/M)$. Such solutions correspond to binary quadratic forms of discriminant $D$, and hence to geodesics in the hyperbolic plane. Under this correspondence, $x_3$ is small exactly when the geodesic passes close to the point $i$. We count these geodesics by the spectral theory of automorphic forms. Throughout, $θ=7/64$ is the Kim-Sarnak exponent. For non-square $D=f^2D_0$, with $D_0$ a fundamental discriminant, the geodesics are closed. We obtain an asymptotic formula with error $O(D^{\varepsilon}f^{1+θ}D_0^{2/3}M^{-1/2})$. The main inputs are the formulas of Duke-Imamoglu-Toth and Baruch-Mao for cycle integrals, the cubic moment bounds of Young and of Andersen-Wu, and a Hecke relation which reduces everything to the fundamental discriminant $D_0$. For $D\equiv 5 \bmod 8$ this counts all solutions, and the range $M\ge D^{1/2-1/1332}$ of Friedlander and Iwaniec improves to $M\ge D^{4/9+\varepsilon}$. For square $D=n^2$ the geodesics run from cusp to cusp, and Hecke theory reduces them to the single geodesic from $0$ to $\infty$. For every $n$ and both parities of $x_3$ we obtain an asymptotic formula with error $O(n^{1+θ+\varepsilon}M^{-1/2})$, which is non-trivial for $M\ge n^{71/96+\varepsilon}$. This improves the range $n^{5/6+\varepsilon}$ of the elementary method and confirms the corrected main term of the author's earlier work. This paper was written in collaboration with Claude (Opus 5.5, High; Fable 5.2 in the final stage), an AI model developed by Anthropic.

comments
v3: rewritten to be self-contained and readable for analytic number theorists (results unchanged): strategy overview, preliminaries on binary forms, hyperbolic geometry, spectral theory and L-functions, relation to theta functions. 63 pages, 5 figures, 6 tables. Written in collaboration with Claude (Anthropic; Opus 5.5, Fable 5.2), see Subsection 1.7. Numerical checks as ancillary files
fields
Number Theory
pdf ↗ page arXiv:2610.15706 ↗

For every $0<s<1$ we construct a compact $s$-Ahlfors regular set $K\subset\mathbb C$ for which harmonic measure of $\mathbb C\setminus K$ with pole at infinity is comparable to $\mathcal H^s|_K$. In particular, there is no dimension drop for harmonic measure in the domain $\mathbb C\setminus K$. The construction is $N$-adic and based on configurations close to the $N$-th roots of unity. Our construction with corrections to the first order gives the range $0<s<2/3$, while corrections of arbitrary finite order yield the full range $0<s<1$.

comments
33 pages. Revised manuscript and title
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.15759 ↗

We study particle approximations of maximum mean discrepancy (MMD) flows with the Coulomb kernel on the torus $\mathbb{T}^d$, $d\ge2$, driven by thermal noise of strength $τ\ge0$. For smooth, strictly positive initial and target densities and i.i.d. initial positions, we prove that the expected Wasserstein-2 distance between the empirical measure and the mean-field solution is at most of order $N^{-1/d}$ for $d\ge3$ and $\sqrt{(\log N)/N}$ for $d=2$, uniformly in time and in the temperature $τ\ge0$, including the deterministic case $τ=0$. At each fixed $τ>0$, we also prove propagation of chaos in total variation for any $k$-fold marginal distributions of particles, uniformly in time, with a bound of order $\sqrt{k/τ}$ times the empirical convergence rate. Our proof uses the modulated free-energy method of Bresch, Jabin, and Wang to reduce the particle convergence estimate to a relaxation estimate that controls the time integral of the mean-field velocity gradient uniformly in $τ\ge0$. Near zero temperature, where the smoothing effect of the noise degenerates, we obtain this estimate by recentering the dynamics at thermal equilibrium and using the damping generated by the Coulomb interaction.

comments
69 pages, 5 figures. Wasserstein-1 bounds strengthened to Wasserstein-2. Proofs and references updated
fields
Probability
pdf ↗ page arXiv:2610.15950 ↗

Small area estimation (SAE) traditionally borrows strength across domains through a prespecified working model. We introduce small area learning (SAL), a novel learner-agnostic framework that formulates SAE as a multi-target semi-supervised learning problem and treats outcome prediction as a nuisance task. Areas may differ through unrestricted covariate shift and structured conditional shift, with information shared through common and area-specific components. We develop estimators with and without cross-fitting, accommodating low-complexity and flexible learners and unifying synthetic, model-based, and semi-supervised estimators. For area means, we establish a unified asymptotic theory for these estimator families, characterizing conditions for consistency, asymptotic normality and providing variance estimators and confidence intervals without prescribing a particular learning algorithm. We extend the theory to settings with only aggregated population covariates and characterize the resulting aggregation bias. SAL reveals clearly a bias-variance trade-off: partial residual correction in classical estimators can reduce mean squared error, whereas full correction yields estimators robust to the misspecification of working models, potentially at higher variance. Simulations yield RMSE reductions of 34%-49% relative to direct estimation, with the best configuration varying across settings. The numerical studies also illustrate how shrinkage can produce overly optimistic confidence intervals at the expense of strong modeling assumptions.

comments
54 pages, 1 figure, 10 tables
fields
Statistics Theory
pdf ↗ page arXiv:2610.15953 ↗

A set $S$ of positive integers is $r$-large if every $r$-coloring of $\mathbb{N}$ contains arbitrarily long monochromatic arithmetic progressions with common difference in $S$. We prove that every $2$-large set is a set of nil-Bohr recurrence, i.e., it meets every nil-Bohr neighborhood of $0$. This proves a conjecture of the first author and gives a sharp answer to a question of Host, Kra, and Maass. Furthermore, we show that a piecewise syndetic set is $2$-large if and only if it is nil-Bohr recurrent. From this, we show that a small modification of a set constructed by the first author is $2$-large but not $3$-large, thereby disproving the $2$-large is large conjecture of Brown, Graham, and Landman. We also deduce that the family of $2$-large sets is not partition regular, thereby answering another question of Brown, Graham, and Landman. We also show that, for every fixed nil-Bohr neighborhood $B$ of $0$ and every $\varepsilon>0$, restricting the common difference to $B$ increases the extremal number for $k$-term arithmetic progressions by at most a factor of $1+\varepsilon$, provided $k$ is sufficiently large.

comments
20 pages, 1 figure, big update to include resolution of 2-large versus large. v4 has small changes in formatting and presentation
fields
Combinatorics, Dynamical Systems, Number Theory
pdf ↗ page arXiv:2610.16605 ↗

We establish a Weyl law for the codimension-one anisotropic volume spectrum on compact Riemannian manifolds. We then use this law to obtain equidistribution in the full Grassmannian bundle while keeping the ambient metric fixed. More precisely, on every closed connected smooth Riemannian manifold of dimension three through six, we construct smooth, embedded hypersurfaces stationary for anisotropies smoothly converging to area. The cumulative sum of their area measures, when lifted to the Grassmannian bundle, converges to the uniform measure.

comments
Comments are welcome
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2610.18599 ↗

We consider an infinite-horizon discounted dynamic programming (DP) problem for a countable-innovation belief-state model. The model is a surrogate for a linear-Gaussian dual control problem involving an unknown parameter vector and Gaussian observation noise. The surrogate preserves the first two moments of the Gaussian innovation and the resulting posterior second-moment structure. We allow unbounded belief and control spaces and nonnegative stage costs with quadratic growth in the posterior mean and covariance. Using a posterior-moment weight, we show that the Bellman operator is a contraction in a weighted sup-norm space. We characterize the optimal cost as the unique solution of the Bellman equation in this space, establish the existence of optimal stationary policies. We further prove weighted sup-norm convergence of value iteration, policy iteration, and optimistic policy iteration under vanishing approximation errors. The convergence results under vanishing approximation errors rely on general weighted sup-norm contraction properties and are applicable beyond the particular dual control problem considered here.

fields
Optimization and Control
pdf ↗ page arXiv:2610.18630 ↗

We prove the existence of unique solutions ${u\in H^1(0,T;L^2_γ(\mathbb{R}^n))\cap L^2(0,T;H^1_γ(\mathbb{R}^n))}$ of the transport equation $u_t=F\cdot\nabla u+f$ and the orthogonal dynamics equation ${u_t= Q_\text{Z} (F\cdot\nabla) Q_\text{Z} u+f}$, where $F$ is a time-independent vector field, $f$ is a forcing term, $P_\text{Z}=1-Q_\text{Z}$ is a Zwanzig projection (conditional expectation) on $L^2_γ(\mathbb{R}^n)$ defined by $P_\text{Z}h \propto \int h(\cdot ,y) ρ(\cdot,y)\rm{d}y$, and $γ$ is the standard Gaussian measure with density $ρ$. To this end, we develop a vanishing viscosity method based on the maximal regularity theory for the Ornstein-Uhlenbeck operator on $L^2_γ(\mathbb{R}^n)$. The following assumptions guarantee the existence and uniqueness of strong solutions: ${f\in H^1(0,T;L^2_γ(\mathbb{R}^n))\cap L^2(0,T;H^1_γ(\mathbb{R}^n))}$, ${g\in H^1_γ(\mathbb{R}^n)}$, $F\in W^{1,\infty}(\mathbb{R}^n,\mathbb{R}^n)$ and $\rm{ess\,sup}_{\mathbb{R}^n}\left(x\cdot F-\rm{div}F\right) < \infty$, where $g$ denotes the initial value function.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.18647 ↗

We construct Schauder bases of $L^p(\mathbb{R})$ with significant structural constraints on their elements. For every $1 \leq p< \infty$, we obtain bases of non-negative functions with basis constants arbitrarily close to one, as well as bases with positive biorthogonal functionals. For every $2 \leq p < \infty$, we construct Schauder bases consisting of translates of a single function, which can be chosen to extend to an entire function. When $p>2$, the translation parameters can be chosen from any prescribed unbounded subset of $\mathbb{R}$, a conclusion that fails for $p=2$. Finally, for $p>2$, the entire function generating the basis of translates can also be chosen non-negative.

fields
Functional Analysis
pdf ↗ page arXiv:2610.18709 ↗

We construct finite Gamma convolutions approximating the first hitting time of $1$ by a Bessel process of index $ν>-1$ started at the origin. The scale measure in the classical exponential representation of this law is obtained by squaring the positive half of a dilated modified Lommel polynomial orthogonality measure. Its Jacobi recurrence yields an $N$-factor Gamma convolution that uniquely matches the first $2N$ cumulants, the maximal number attainable in this class. From an exact Gaussian quadrature remainder we derive supergeometric convergence of the Laplace transforms on compact subsets of a common slit plane and geometric convergence of the distribution functions uniformly on the real line. The approximants have total Gamma shape $N(N+ν+1)$, and their Laplace transforms and negative moments decrease to those of the exit law.

fields
Probability
pdf ↗ page arXiv:2610.19233 ↗

In this paper, we completely investigate what the big finitistic projective dimension (resp., big finitistic flat dimension) pair, which abbreviates FPD pair (resp., FFD pair), of a commutative ring and of its formal power series ring can be. When the ring is Noetherian, both invariants increase by one. In general, for every \(n\ge0\) and every \(d\) with \(n+1\le d\le\infty\), the FFD pair \((n,d)\) can be realized; the FPD pairs \((n,d)\) can be realized when \(n\ge1\), also for \((0,1)\) and \((0,\infty)\). However, the FPD pair \((0,2)\) is impossible. For perfect coefficients, we prove that the existence of a commutative perfect ring \(R\) with \(\FPD(R[[x]])=3\) is equivalent to the continuum hypothesis. Under the continuum hypothesis, every finite integer \(n\ge2\) admits a commutative local perfect ring \(R\) with \(\FFD(R[[x]])=1\) and \(\FPD(R[[x]])=n+2\). And for each such \(n\), the existence of a perfect coefficient ring with projective value \(n+2\) does not imply the continuum hypothesis.

fields
Commutative Algebra
pdf ↗ page arXiv:2610.20060 ↗

We approximate the Darcy solution operator $(a,f)\mapsto u$, where $-\operatorname{div}(a\nabla u)=f$, by operator networks built only from heat-semigroup evaluations $e^{-tL_0}$ of a single fixed reference operator and pointwise products. The key obstacle is the variable-coefficient coupling $\nabla a\cdot\nabla u$. We show that it is produced by the heat product defect $[P_t(bu)-P_tb\,P_tu]/(2t)$, which converges quantitatively to $\nabla b\cdot\nabla u$. Inserted into a Laplacian-preconditioned Richardson iteration, this yields an explicit scheme of depth $O(\log(1/\varepsilon)/\log(1/q))$ whose $\dot H^1$ error is at most $\varepsilon$, uniformly over the coefficient class and $L^2$ data, with all parameters explicit. Each block is controlled in continuum operator norm, without Galerkin truncation. On the torus, band-limited inputs admit an exact pseudo-spectral realization on a grid of $O(1/(\varepsilon a_{\min}))$ points per direction, up to logarithmic and class-dependent factors. The argument extends by carre du champ calculus to strongly local Dirichlet spaces with a spectral gap and a Bakry–Emery bound $\mathrm{BE}(-K,\infty)$, with dimension-independent constants after spectral-gap normalization. On the torus we also obtain a $C^2$-type coefficient class and a refinement to Wiener classes of regularity $1+θ$, with product-defect rate $t^{θ/2}$. The factor $1/(2t)$ makes the proved scheme ill-conditioned at small $\varepsilon$.

comments
34 pages, 4 tables
fields
Numerical Analysis, Analysis of PDEs
pdf ↗ page arXiv:2610.20106 ↗

We study dual-inertial (DI) Bregman proximal methods for convex optimization via an exact representation of the signed energy drift between dual-coordinate and primal affine interpolation. For unrestarted DI, bounded one-sided directional curvature gives a last-iterate objective-gap rate $\mathcal{O}((1+\log N)/N^2)$ after $N$ iterations, which improves to $\mathcal{O}(N^{-2})$ under weighted summability. The energy balance also provides a computable acceptance test, which we use in two safeguards. The restart safeguard attains a global $\mathcal{O}(T^{-1})$ rate after $T$ proximal calls, including rejected trials. Under local quadratic growth and kernel regularity, it restarts only finitely often and eventually converges linearly. The non-restarting safeguard preserves the quadratic weight recurrence via dual substeps. Every fallback terminates without triangle scaling, yielding a $\mathcal{O}(N^{-2})$ rate in outer iterations and an $\mathcal{O}(T^{-1})$ rate in calls, which improves to $\mathcal{O}(T^{-2})$ when the cumulative fallback cost is $\mathcal{O}(N)$. Experiments on relative-entropy regression and nonnegative least squares illustrate the results.

fields
Optimization and Control
pdf ↗ page arXiv:2610.20420 ↗

Recently, Hilbert's Tenth Problem over the field $\mathbb Q$ of rational numbers was solved negatively by OpenAI based on a five-contact height estimate and a pole-parity construction. In this paper, we prove further that there is no algorithm to decide for any polynomial $P(x_1,\ldots,x_{48})$ with integer coefficients whether the equation $P(x_1,\ldots,x_{48})=0$ has solutions with $x_1,\ldots,x_{48}\in\mathbb Q$.

comments
57 pages. Reduce 86 variables to 48 variables
fields
Number Theory, Logic
pdf ↗ page arXiv:2610.20691 ↗

We prove that every real Lévy process of infinite variation is either abrupt or strongly eroded, resolving the conjectured geometric dichotomy on the smoothness of the convex hull of the graph of a Lévy path [Ann. Inst. H. Poincaré Probab. Stat. 60(4) (2024), 2352-2381]. We give counterexamples to the stronger point-hitting conjecture of Vigon. As applications, we classify convex-hull smoothness, Lipschitz-minorant contact sets and Burgers shock geometry.

comments
25 pages, short YouTube videos presenting the results: https://youtu.be/xWk_RV_JuSc?si=ITKFgS9ib39DonEK and their proofs: \href{https://youtu.be/SzlJq_Vi4xk?si=9TeAl5AjZw9BzFnJ
fields
Probability
pdf ↗ page arXiv:2610.20916 ↗

We develop a perturbation analysis of Feynman–Kac models, describing how local errors introduced at each step of the Feynman–Kac recursion propagate over time. Under general conditions on the potential functions and the Markov transitions, which are shown to hold for a large class of state-space models, we prove that the global error for any time horizon $T\geq 1$ is bounded by $C\,Δ_T\log(1+Δ_T^{-1})$, where $Δ_T$ is the largest local error; this bound holds both for the prediction and the updated models. These conditions require no Lyapunov function and no stability of the Markov transitions, and allow for non-compact state spaces: confinement is provided by the potential functions. Our perturbation bounds hold in total variation and in the Kolmogorov norm; for the latter, we extend the Hardy–Krause variation and the Koksma–Hlawka inequality to unbounded domains. Our perturbation theory is applied to derive time-uniform bounds for linearized Kalman filters, Euler schemes for partially observed diffusions and nudged state-space models, as well as high-probability error bounds, uniform over whole trajectories, for particle filters and, more generally, for mean field particle methods such as sequential Monte Carlo and diffusion Monte Carlo algorithms.

comments
84 pages (including a 33-page Appendix)
fields
Probability
pdf ↗ page arXiv:2610.21587 ↗

On pages 219–220 of Ramanujan's Lost Notebook appears an intriguing modular transformation whose integral representation is expressed in terms of the Riemann $Ξ$-function. In this paper, we establish a number field analogue of this identity. We also obtain an integral representation for the transformation formula associated with the functional equation of the higher power of the Dedekind zeta function recently studied by the present author and Maji. Interestingly, we recover Hardy's integral representation of the well-known Jacobi theta relation involving the Riemann $Ξ$-function. We further obtain a number-field analogue of the extended Ramanujan–Koshliakov formula established by Dixit.

comments
20 pages, Comments are welcome!
fields
Number Theory
pdf ↗ page arXiv:2610.21800 ↗

Hanson introduced the class of theories with bounded $k$-splitting, a higher-arity notion of stability, and proved an indiscernible extraction result for those theories assuming the existence of a $k$-ineffable cardinal. In this article, we show that the conclusion of Hanson's theorem is equivalent to the weaker assertion that there exists a weakly compact cardinal, as well as prove additional indiscernible extraction results for these theories in ZFC. Finally, we show that Hanson's construction of total bounded ultraimaginary Morley sequences in theories with bounded $k$-splitting follows from ZFC.

fields
Logic
pdf ↗ page arXiv:2610.22002 ↗

This paper investigates the influence of friction dynamics on heave-induced disturbance propagation using a coupled hydraulic-structural drilling model formulated as a semilinear interconnection of ordinary and hyperbolic partial differential equations (ODE-PDEs), and capturing spatially distributed memory effects in the drillstring-wellbore interaction. First, local and global existence and uniqueness results are established, and sufficient conditions for boundedness and input-to-state stability are deduced via a small-gain analysis. Subsequently, extensive numerical investigations are carried out, including harmonic excitation studies, nonlinear distortion analysis, spatial amplification investigations, mechanism-isolation experiments, parameter sensitivity analysis, and broadband simulations under realistic offshore sea-state excitation. The simulation results indicate that, whilst the hydraulic response is governed primarily by wave propagation phenomena, compressibility, and boundary reflections, the structural dynamics display substantially greater sensitivity to distributed friction effects. Furthermore, drillstring-wellbore friction is shown to have a relatively limited influence on well-posedness but a potentially significant impact on stability margins. These findings highlight the importance of accounting for coupled hydraulic-structural dynamics and distributed friction mechanisms when analysing, monitoring, and controlling offshore drilling systems.

comments
45 pages, 11 figures. Under review
fields
Dynamical Systems
pdf ↗ page arXiv:2610.22189 ↗

Let $\mathbf{f}$ be a Hida family of cusp forms over a standard (power series) Iwasawa algebra. We determine the pseudo-isomorphism class of the big Shafarevich-Tate group attached to $\mathbf{f}$ over a suitable imaginary quadratic field by describing all its higher Fitting ideals; this description is given in terms of the universal Kolyvagin system of Howard's big Heegner points. As a second contribution, we study the variation of the structure of the Shafarevich-Tate groups of the classical specializations of $\mathbf{f}$.

comments
Minor revision, submitted version; 38 pages
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2610.22226 ↗

We give a purely analytical proof of one-dimensional spectral stability of sufficiently strong shock layers for the full ideal-gas Navier–Stokes equations with constant viscosity and heat conduction. Earlier work reduced this question to a limiting problem and gave strong numerical evidence of stability through Evans function computation, but no proof. We prove stability for every adiabatic index $1<γ<3$ and for an explicit range of ratios of heat conduction to viscosity that contains all common gases.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.22660 ↗

We prove that $(α(n+\log n))_{n\ge1}$ has Poissonian pair correlation for Lebesgue almost every real $α$. This solves a Problem posed by Aistleitner, El-Baz and Munsch [Open Problem 2, Geom. Funct. Anal. 2021].

comments
Revised version
fields
Number Theory
pdf ↗ page arXiv:2610.22836 ↗

Let X be a compact complex manifold of dimension n, and suppose that X is deformation equivalent to a stable manifold. Then X is projective whenever n <=3. We also construct, for every n >=4, smooth families of compact complex manifolds over the unit disc such that every fiber over the punctured disc is a stable manifold, while the central fiber is a non-Kahler Moishezon manifold.

fields
Algebraic Geometry
pdf ↗ page arXiv:2610.23457 ↗

For an artinian complete intersection of forms of degree $d$, we prove that the multiplication by a general linear form is injective up to degree $\frac{3d-1}2$, independently of the number of variables. This is accomplished using algebraic and geometric properties of the union of two complete intersection curves and their general hyperplane sections. As a consequence, we solve, for any $d\ge 4$, the problem about the maximal variation of the hyperplane sections of a smooth hypersurface of degree $d$ posed by A. Beauville.

comments
One reference has been added and the condition on the field has been clarified
fields
Algebraic Geometry, Commutative Algebra
pdf ↗ page arXiv:2610.25521 ↗

In this paper, we study the global regularity for the one-dimensional hypo-viscous compressible Navier-Stokes equations in the critical Besov spaces, where the initial data are close to the constant equilibrium state. We introduce an effective velocity, constructed as a combination of the density and the velocity, which is used to capture the high-frequency behavior of $a$. By performing elaborate high-frequency and low-frequency estimates together with a bootstrap argument, we obtain global existence for $\frac{1}{2}\leβ<1$. In particular, when $β=\frac{1}{2}$, we also prove the system is well-posed in critical space. Furthermore, under an additional low-frequency assumption, we establish the optimal time decay rates.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.25889 ↗

We study transfer-time estimates for finite-dimensional bilinear quantum control systems driven by an unbounded scalar control, in both the state-to-state setting (complex projective space) and the unitary synthesis setting (special unitary group). Lower bounds are recalled and refined via spectral and chordal methods. The main contribution is constructive upper bounds: we associate with the system a coupling graph whose edges correspond to non-resonant drift couplings, and construct transfer protocols along spanning trees. In contrast with earlier results requiring full rational independence of the spectrum of the control operator, our estimates allow rational resonances; they incorporate, via explicit correction factors derived from the arithmetic of the spectral gaps, the efficiency of the averaging procedure and of the phase adjustments. As an application, we consider finite-dimensional truncations of the planar quantum rotator under a dipolar electric field, and show that the transfer time between any two modes tends to zero as the truncation dimension grows.

fields
Optimization and Control, Mathematical Physics
pdf ↗ page arXiv:2610.26205 ↗

In this paper, we study improved Sobolev and Moser–Trudinger–Onofri inequalities on the sphere under moment constraints, with particular emphasis on sharp leading constants and quantitative remainder terms. For the Sobolev inequality, we sharpen the almost sharp inequality of Hang and Wang [30] (Int. Math. Res. Not., 2022) to a sharp one at $p=2$ under vanishing moment constraints of orders $m=1,2,3$. We also prove a general failure principle: if the unconstrained sharp Sobolev inequality fails, then the corresponding sharp improved inequality under moment constraints fails as well. For the Moser–Trudinger–Onofri inequality, we sharpen the almost sharp inequalities of Chang and Hang [10] and Hang [29] (Comm. Pure Appl. Math., 2022) to a sharp improved inequality at the critical order $s=\frac{n}{2}$ under arbitrary finite-order moment constraints. We further investigate the best remainder constant. In contrast with the two-dimensional first-moment case of Gui and Moradifam [28] (Invent. Math., 2018), where the best remainder vanishes, we show that it is positive in several higher-dimensional regimes. We also obtain quantitative remainder estimates for general almost sharp improved Sobolev and Moser–Trudinger–Onofri inequalities, which in turn yield sharp inequalities at different scales. We further extend recent second-moment refinements to higher dimensions and higher orders. Finally, we obtain analogous results on sharpness, non-sharpness, and quantitative remainder estimates for improved Sobolev-type inequalities under symmetry constraints on general smooth closed manifolds.

comments
Originally submitted to a journal on September 17, 2026. v2: Added a note on related independent works and updated the references. Main results unchanged
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.26691 ↗

This paper investigates the distributed online bilevel optimization problem with time-varying inequality constraints. In this setting, a multi-agent network is confronted with a hierarchical decision-making task characterized by coupling between the inner and outer optimization levels. We first propose a communication-efficient single-loop distributed online primal–dual algorithm based on communication compression, which tracks both the inner-level solution and the Hessian-inverse-vector product using only one update per-round. We show that this algorithm achieves a dynamic network regret bound of $\mathcal{O}(T^{\max\{θ_1,1-θ_1\}}+T^{θ_1 } P_T+H_{1,T}+E_{1,T})$, where~$θ_1 \in (0,1)$, $P_T$ is the outer-level path variation, $H_{1,T}$ is the inner-level path variation, and $E_{1,T}$ is the gradient path variation alongside a network cumulative constraint violation bound of $\mathcal{O}(T^{1-θ_1/2})$, which is further reduced to $\mathcal{O}(T^{1-θ_1})$ under Slater's condition. Furthermore, to eliminate the dependence of regret on the inner-level and gradient path variation, we propose a novel adaptive multi-loop distributed online algorithm to control the inner-level approximation accuracy at each round. By dynamically adjusting the number of inner-level updates based on a gradient-norm tolerance condition, this algorithm yields an improved dynamic network regret bound of $\mathcal{O}(T^{\max\{θ_1,1-θ_1\}}+T^{θ_1 } P_T)$ which depends solely on the outer-level path variation while maintaining the same network cumulative constraint violation bound. Finally, numerical simulations verify the effectiveness of the proposed algorithms.

fields
Optimization and Control
pdf ↗ page arXiv:2610.26911 ↗

We study a geometric homology theory (GHT for short). Its chains are generated by smooth maps from compact oriented orbifolds with corners to a smooth space, and two kinds of chains are set to zero: those admitting an orientation reversing automorphism, and degenerate ones, which, together with their boundaries, factor through smooth maps to orbifolds of lower dimension. Bisecting the source of a geometric chain along a hypersurface transverse to its corners changes the chain only by the boundary of an explicit prism and by prisms over its faces; cutting a geometric cycle along a regular level set of a smooth function on the target does not change its homology class. Geometric chains also behave well under products and pullbacks along fibre bundles, which overcomes some of the combinatorial rigidity of singular chains. We prove that geometric homology is naturally isomorphic to singular homology with rational coefficients for every smooth space admitting a good cover, such as smooth manifolds, orbifolds and locally finite polyhedra, and also for orbifolds with corners. The proof uses cutting operators along level sets of functions on the target, realized by explicit prisms, instead of triangulations. For continuous maps into arbitrary spaces we conjecture the same statement, and prove it for Euclidean neighbourhood retracts in degrees at most one, with surjectivity in degree two. Without the relation killing degenerate chains the comparison fails for orbifold chains: the weighted projective plane $\mathbb{P}(1,1,p)$, $p\ge5$ prime, mapped to a point is a cycle that does not bound. Applications on Morse theory and the BV structure on geometric chains of moduli spaces of bordered Riemann surfaces, following Costello and Harrelson–Voronov–Zúñiga, are given.

comments
84 pages
fields
Geometric Topology, Algebraic Topology
pdf ↗ page arXiv:2610.28446 ↗

We prove bounds for scalar curvature integrals over geodesic balls on complete noncompact manifolds with nonnegative sectional curvature. In every dimension $n\ge3$, when the asymptotic volume ratio is close to one, we obtain upper and lower estimates with the sharp first-order coefficient and a quadratic remainder. The leading terms involve the asymptotic and local volume deficits, respectively. Rotationally symmetric examples show that both first-order coefficients are optimal and that a quadratic remainder is necessary in the upper bound. For dimensions three, four, and five we give estimates for any positive asymptotic volume ratio. When the center is a pole, we give an estimate in dimension three under nonnegative Ricci curvature and in every dimension $n\ge4$ under nonnegative sectional curvature. This estimate is sharp when the asymptotic volume ratio is at most $2^{-(n-1)}$.

comments
47 pages, improve the main results to arbitrary dimension $n\ge3$ compare to v1
fields
Differential Geometry
pdf ↗ page arXiv:2610.29596 ↗

Let $q$ be an odd prime power, let $d\ge3$ be odd, and let $S_j=\{ξ\in \mathbb F_q^d:ξ_1^2+\cdots+ξ_d^2=j\}$, where $j\ne 0$. We prove the sharp extension estimate ${L^{4(d+1)/(3d+1)}(S_j, dσ)\to L^4(\mathbb F_q^d,dc)}$ whenever $η_q((-1)^{(d-1)/2}j)=-1$, where $η_q$ is the quadratic character. This confirms the odd-dimensional spherical extension conjecture of Koh, Pham, and Vinh over every finite field of odd characteristic. Together with the known estimate in the complementary sign class, this determines the sharp ${L^p\to{L^4}}$ extension range for all nonzero-radius spheres in odd dimensions. We also apply the endpoint estimate to obtain sufficient conditions for the unique recovery of sparse signals from incomplete Fourier data.

comments
V2: typos and misprints corrected
fields
Number Theory, Classical Analysis and ODEs, Combinatorics
pdf ↗ page arXiv:2610.29664 ↗

We construct and describe the moduli stack $\mathrm{Isog}$ of isogenies between oriented elliptic curves. We show that $\mathrm{Isog}$ is a spectral Deligne-Mumford stack and a relative spectral algebraic space over $\mathcal{M}_{\mathrm{ell}}^{\mathrm{or}}$, and give a fiber product decomposition of $\mathrm{Isog}$ corresponding to a connected-étale factorization on oriented elliptic curves. In the process of proving these results, we construct a theory of duality and quotients for spectral abelian varieties and lift the rigidity theorem for morphisms of elliptic curves to the setting of spectral algebraic geometry.

comments
Removed an incorrect Nakayama lemma for maps and a now-irrelevant Nakayama lemma for modules; rewrote the proof of the deformation-of-0 theorem; other minor corrections
fields
Algebraic Topology, Algebraic Geometry
pdf ↗ page arXiv:2610.30376 ↗

We study the analytification and tropicalization of algebraic varieties over valued fields via Jun's spaces of hyperfield points. Our main new objects are a family of power-tropical hyperfields $H_n$ and their inverse limit $H$, recording at each level the class of a leading term modulo $n$-th powers of the residue field. They yield an enhanced tropicalization of the associated space $X(H)$, strictly finer than the Berkovich one exactly when the multiplicative group of the residue field is non-divisible: it specialises to the Berkovich analytification when the residue field is algebraically closed, to the real analytification of Jell-Scheiderer-Yu when it is real closed, and to a new $p$-adic analytification when it is $p$-adically closed. Over henselian valued fields of equicharacteristic $0$ we then construct a model-theoretic avatar of $X(H)$: the space $\widehat{X}_T$ of definable types orthogonal to the value group, which sharpens the geometry in the spirit of Hrushovski and Loeser and recovers their space over algebraically closed valued fields. We show that $\widehat{X}_T$ is strictly pro-definable, satisfies a model-theoretic Payne theorem, and definable compactness in such spaces satisfies a Heine-Borel type characterization. As an application, we analytify $p$-adic semi-algebraic sets and prove a strong density theorem for their tropicalizations, the exact $p$-adic counterpart of the real one of Jell-Scheiderer-Yu.

fields
Logic, Algebraic Geometry
pdf ↗ page arXiv:2610.30762 ↗

For a given matrix $ A $ in the real Schur form, the eigenvalue swapping algorithm is used to swap two adjacent diagonal blocks. In LAPACK, this operation is performed by the subroutine xLAEXC, which is based on a direct swapping algorithm proposed by Bai and Demmel in 1993. In this work, we propose a modified direct swapping algorithm for two $ 2 \times 2 $ blocks, replacing Householder QR with a pivoted Givens QR factorization. A thorough error analysis shows that the modified algorithm can achieve an error bound of the form $ O( \boldsymbol{u} \lVert A \rVert ) $ under mild assumptions, where $ \boldsymbol{u} $ is the unit roundoff. We present empirical evidence to illustrate the superior stability of our algorithm over existing approaches.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.30795 ↗

In this paper, we consider positive radial entire solutions of nonlinear elliptic equations with bounded positive coefficients and optimize the negative logarithmic derivative of the coefficient. For the scalar equation, we determine the exact, unattained defect threshold and establish quantitative gaps when the coefficient ratio is fixed. Near the threshold, we prove a sharp stability estimate and describe the loss of compactness through a profile decomposition in logarithmic radius, including a characterization of the possible diffuse energy and conditions that exclude it. We also show that the resulting profile configurations can be realized by suitable monotone coefficients. For unequal weighted elliptic systems, we obtain the corresponding sharp defect threshold and fixed-ratio gap, and analyze near-threshold sequences through local homogeneous limits and logarithmic spreading. A BV relaxation and smoothing argument further relates the relaxed and smooth optimization problems.

comments
59 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.31167 ↗

The regularity of solutions to the two-dimensional radiation transport equation plays a central role in understanding the behavior of scalar flux near geometric corners. In a previous study of Kaper's corner singularity problem, the physical transport kernel was decomposed into its principal inverse-distance singularity and a lower-order remainder, reducing the corner asymptotic analysis to the question of whether the scalar flux possesses sufficient continuity to justify differentiation of the associated singular potential. The required regularity, however, remained unresolved. In this paper, we establish a sharp modulus-of-continuity estimate for the scalar flux generated by the physical transport kernel and prove the estimate $ω_φ(h)=O\!\left(h\log(D/h)\right)$, which implies Dini continuity. This estimate yields absolute convergence of the fluctuation term arising in the differentiated principal potential and permits a rigorous differentiation formula for transport solutions. Using this regularity framework, we derive the fixed-angle asymptotic behavior of the scalar flux and its first derivatives near a rectangular corner. For every fixed interior ray, the gradient exhibits logarithmic growth, while the scalar flux admits an $r\log(1/r)$ correction with an explicitly identified coefficient determined by the corner values of the flux and source. The analysis shows that a rectangular corner does not generate a singularity stronger than the logarithmic first-derivative singularity already present in smooth-boundary transport theory. Numerical calculations on benchmark problems are consistent with the theoretical predictions. These results provide a rigorous resolution of the regularity issue underlying Kaper's corner singularity problem and establish a mathematical framework for corner asymptotics in two-dimensional radiation transport.

fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2610.32732 ↗

We consider the problem posed by Erdős and Rényi in $1961$ about the limiting distribution of the number of draws $T_{n,m}$ that a coupon collector needs to complete $m$ collections of $n$ distinct types of coupons, when $m$ increases with $n$. Although the limiting distribution was studied in earlier works, we give a simple and self-contained proof that relates it to the cutoff phenomenon for an absorbing Markov chain. We also provide an alternative expression for the cutoff window in terms of the Lambert $W$ function.

fields
Probability
pdf ↗ page arXiv:2610.33199 ↗

We study conditions under which a unital linear functional on a complex star algebra is multiplicative. We introduce a class of star algebras, called AC*-algebras, which captures certain algebraic properties of unital C*-algebras. Our main result characterizes positive characters on unital AC*-algebras through a nonvanishing condition on a distinguished subset of the algebra. This provides an algebraic counterpart to the Gleason-Kahane-Zelazko theorem and addresses questions concerning the characterization of characters by nonvanishing conditions. We apply the result to unital C*-algebras and self-adjoint function algebras whose real parts are sublattices. We further obtain a Banach-Stone-type theorem for realcompact spaces, characterizing homeomorphisms in terms of bijective invertibility-preserving linear maps between their algebras of continuous complex-valued functions.

fields
Functional Analysis
pdf ↗ page arXiv:2610.33579 ↗

We give a conic upper bound on the asymptotic rank of every weighted graph tensor over every field. If $W$ is the logarithmic edge-weight matrix of its dimension matrix $Q$, then $$ \operatorname{MaxCut}(W)\le\log_2\operatorname{\widetilde R}_{\mathbb F}(\mathsf{WT}(Q))\le U_{\operatorname{CP}}^Δ(W). $$ Here $U_{\operatorname{CP}}^Δ(W)$ maximizes $\sum_{1\le i<j\le n}W_{i,j}P_{i,j}$ over nonnegative symmetric zero-diagonal matrices $P$ such that $J-2P$ is copositive and $P_{i,j}\le P_{i,k}+P_{k,j}$ for all distinct vertices. The matrix $J$ is all-one, and copositivity means nonnegativity of the quadratic form on nonnegative vectors. Our starting point extends OpenAI's polynomial multiplication method and its subsequent arbitrary-field developments from three tensor legs to arbitrary order. We prove $$ \left\lfloor\frac{n^2}{4}\right\rfloor\le\log_2\operatorname{\widetilde R}_{\mathbb F}(\mathsf{GT}_2(K_n))\le\frac{n^2}{4}. $$ The edge exponent is at most $n/(2(n-1))$ and tends to the optimal value $1/2$, improving the previous Coppersmith–Winograd bounds and answering Question 1.3.1 of Christandl, Vrana, and Zuiddam. The bounds coincide for every even $n$. For every odd $m\ge3$, the theorem gives $\log_2\widetilde R_{\mathbb F}(\mathsf{GT}_2(C_m))\le m-1+1/(m+1)$, improving the previous cycle bound with a gap of only $1/(m+1)$ above the maximum cut. On weighted triangles, the program recovers the rectangular matrix multiplication curve of Uzna'nski and Amanov, van den Berg, and Zuiddam. The CP and semidefinite programs, with or without path constraints, all have value $9/4$ on the unweighted triangle, giving this upper bound a natural conic interpretation. Further applications give explicit bounds for complete multipartite graphs, split graphs, and wheels, including new cases of maximum-cut equality.

comments
82 pages, 5 figures, abstract shortened to meet arXiv requirements
fields
Combinatorics
pdf ↗ page arXiv:2610.34273 ↗

For the estimation of a normal mean in $\mathbb{R}^m$ under quadratic loss, Brown (1971) proved that a generalized Bayes estimator $δ_F$ with bounded drift is admissible if and only if a diffusion attached to the marginal $f^*$ of the prior $F$ is recurrent, and gave two radial tests: a sphere-average test for recurrence and a ray test for transience. He observed that both tests can be silent. We read his theory as the potential theory of the weighted Euclidean space $(\mathbb{R}^m,f^*\,dx)$ and ask what the modern theory of recurrence on weighted manifolds adds inside the zone where neither test applies. Three results. (A) If $f^*\,dx$ is doubling and supports a scale-invariant Poincaré inequality, the sphere test is already complete: recurrence, Brown's sphere test and the ball-volume test are equivalent, so geometric criteria can add decidable cases only on the inadmissible side. (B) They do add one. An explicit prior on $\mathbb{R}^3$ whose marginal is small along a lattice of circles at dyadic scales with spacing equal to the square root of the scale is doubling and Poincaré, silences both of Brown's tests, and is transient by the ball-volume test; its generalized Bayes estimator is inadmissible. (C) Outside the doubling-Poincaré class the zone is two-sided: similar circles placed on one surface per scale give an admissible estimator, decided by a flux bound along a non-spherical exhaustion, and a logarithmic product prior gives an inadmissible one, decided by product heat kernels. A comparison lemma shows that any positive weight with Lipschitz logarithm is, up to constants, the marginal of a prior, so that explicit weights may be used throughout.

comments
26 pages, 8 figures, 6 tables. v3: statements and proofs made precise after a Lean 4 formalization of part of the arguments; Section 2.4 now cites Sturm; new Appendix B on the formal verification; Lean sources in the repository
fields
Statistics Theory, Differential Geometry, Probability
pdf ↗ page arXiv:2610.34309 ↗

In this paper, we consider multiblock nonconvex and nonsmooth optimization without assuming bounded iterates or coercivity of the original objective. We propose the Controlled Block Proximal Linearized (CBPL) method, whose control potentials establish boundedness while retaining the original objective, constraints and variables. We prove finite length and whole-sequence convergence to an effective critical point of the original objective, where one limiting subgradient annihilates all effective feasible directions. We establish finite total variation of the original objective and block functions, summable original effective residuals, and finite termination and linear or sublinear convergence rates for the original objective values. Scale orthogonality further gives full original criticality and, for homogeneous balancing controls, summable absolute objective errors with an $o(1/K)$ best-iterate bound. We establish a complete degeneracy theory for graph-regularized nonnegative factorizations: scale criticality is equivalent to graph collapse, and full criticality eliminates graph action; our controls prevent this collapse while retaining genuine reconstruction changes. Furthermore, our proposed method provides the practical, simple, and effective schemes for these applications, combining guaranteed convergence with explicit closed-form updates that can be applied directly to solve the original problems. We apply CBPL to graph-regularized sparse nonnegative matrix factorization with $\ell_0$-constraints ($\ell_0$-GSNMF), graph-regularized sparse nonnegative canonical polyadic (CP) decomposition with $\ell_0$-constraints ($\ell_0$-GSNCP), and graph-regularized sparse nonnegative independent-core matrix tri-factorization with $\ell_0$-constraints ($\ell_0$-GSNMTF). Numerical experiments demonstrate effectiveness, convergence and structural control.

fields
Optimization and Control
pdf ↗ page arXiv:2610.34390 ↗

We prove action and spectral stability near finite-gap tori of the periodic Korteweg–de Vries equation under autonomous analytic Hamiltonian perturbations of size $\varepsilon$. The estimates are uniform over prescribed compact families, without small-amplitude or nonresonance assumptions, and allow nearby initial data with infinitely many open gaps. Assuming a strong solution and a uniform higher Sobolev bound on $[0,T_0/\varepsilon]$, we permit one-derivative loss in the perturbing Hamiltonian's normal gradient. For sufficiently small $\varepsilon$ and initial normal Birkhoff size $r_0$, the tangential action variations and weighted sum of normal actions are bounded by $C_δ(r_0^2+\varepsilon^{2δ})$, while the spectral-gap variation in $\ell^2$ is bounded by $C_δ(r_0+\varepsilon^δ)$, for every $0<δ<1/4$. A key ingredient is coercivity of the negative Hessian of the nonlinear KdV Hamiltonian on the full $\ell^2$ action space at every finite-gap action. We combine this with resonance analysis and corrected action observables evaluated along the solution. The hypotheses are verified for several local and nonlocal Hamiltonian perturbations.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34601 ↗

We study the twelve-vertex flag triangulation $T_{12}$ of $S^3$ and the Davis $4$-manifold $M(T_{12})$ associated with it. We prove that $T_{12}$ is, up to isomorphism, the unique flag triangulation of $S^3$ with twelve vertices in which every edge is contained in a square; this proves Milizia's Conjecture~6.31. We also prove a general criterion for the tangent Euler class of a Davis $4$-manifold to be bounded, and we verify it for $T_{12}$ by means of an explicit symmetric form. Since the Euler class takes the value $256$ on the fundamental class of $M(T_{12})$, the duality between bounded cohomology and simplicial volume gives $\|M(T_{12})\|>0$. This answers Milizia's Question~1.7.

comments
31 pages, corrected some typos. Comments are welcome
fields
Geometric Topology
pdf ↗ page arXiv:2610.34743 ↗

For $E\subset\mathbb{F}_p^d$, let $Δ(E)=\{Q_d(x-y):x,y\in E\}$, where $Q_d(z)=z_1^2+\cdots+z_d^2$. We introduce and study the problem of the existence of nondegenerate three-term geometric progressions in the distance set $Δ(E)$ when $d$ is odd. Let $M_{GP,d}(p)$ be the largest size of a set whose distance set contains no such progression. For every prime $p\geq7$ and every integer $m\geq0$, we prove \[ p^mM_{GP,1}(p)\leq M_{GP,2m+1}(p) \leq4p^mM_{GP,1}(p). \] For all sufficiently large primes $p$, we also prove \[ p^{m+\frac{7}{26}}\leq M_{GP,2m+1}(p) \leq Cp^{m+\frac{16}{25}}, \] where $C$ is an absolute positive constant.

comments
V2: typos and misprints corrected
fields
Number Theory, Classical Analysis and ODEs, Combinatorics
pdf ↗ page arXiv:2610.34758 ↗

Finite volume and discontinuous Galerkin methods evolve the discrete solution using space-time flux integrals over mesh faces, which typically depend on solutions to local Riemann problems. In the multidimensional Riemann problem setting, this integral is difficult to evaluate exactly because of complex wave interactions. In this work, we show that the exact space-time flux integral is a polynomial in the time step and face dimensions. This motivates a learning-based approach, as only the mapping from the initial states to the polynomial coefficients needs to be learned. We propose a structure-preserving, data-informed Riemann solver framework that uses a neural network trained on high-resolution simulation data to learn this mapping. Key structural properties, including consistency and mirror symmetry, are enforced by construction. Provided that the high-resolution simulations converge to the exact flux integrals and the network accurately predicts the coefficients, this framework yields near-exact flux integrals for use in numerical simulations. We demonstrate the framework using classical implosion and explosion problems for the two-dimensional Euler equations. In an unsplit MUSCL-Hancock scheme, the learned Riemann solver remains stable at a CFL number of 0.9, whereas the same scheme using the exact one-dimensional Riemann solver fails. Compared with the latter scheme at CFL=0.45, the learned scheme is slightly more accurate and requires approximately 30% less computational time.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.35265 ↗

We prove global well-posedness and regularization for the isotropic consensus-based optimization equation with initial probability measures of finite fourth moment. Under suitable weight decay assumptions, after any nonconstant consensus motion, both the density and the consensus trajectory become smooth, and all spatial Sobolev norms are locally bounded in time. The proof uses a Fourier commutator estimate, localization and iteration, followed by a nonlinear time bootstrap. Counterexamples show that smoothing can fail at a stationary consensus point. For non-Dirac initial data, we also prove positivity away from the consensus point and full support at every positive time in all dimensions.

comments
39 pages
fields
Analysis of PDEs, Optimization and Control
pdf ↗ page arXiv:2610.35266 ↗

A decision maker observes independent random variables sequentially and must stop at an overall maximum, with ties counted as wins. In this short note, we extend the $V$-sequence reduction of Allaart and Islas (2016) to arbitrary independent distributions, including atoms, which were not covered by the original reduction. We spread atoms over ordered intervals without increasing the optimal win probability, then apply the continuous reduction. The resulting comparison uses a common threshold and a common splitting probability at that threshold. It also recovers the sharp universal lower bound previously established by Hill and Kennedy (1992).

fields
Probability
pdf ↗ page arXiv:2610.35600 ↗

A string couples to a 2-form gauge potential whose local descriptions need not fit together as a single global form. Principal 2-bundles provide a geometric description of this gluing. However, we recover surface amplitudes and quantum partition functions, as well as local classical field dynamics, without the 2-bundle formalism. For surface amplitudes, differential characters preserve curvature and flat phases. Ordinary fake-flat crossed-module connections with a fixed flat quotient and a reference lift lead to abelian differential cocycles with local coefficients. In three-dimensional finite gauge theories with cohomological actions, Fourier transformation evaluates the 2-form field sum and gives a sum of ordinary finite-group gauge partition functions. A four-dimensional quadratic example gives a signature response that admits direct cochain evaluation although replacement by an ordinary finite-group gauge theory fails. Established bundle, operator, and module descriptions provide further comparisons for topological and index invariants and twisted-sheaf moduli. For finite-dimensional smoothly separable central crossed modules, an invertible local substitution removes a pure gauge 1-form from invariant classical actions for any adjustment, leaving an ordinary quotient connection and two tensor fields. One of these tensor fields can be separated globally from the remaining lift data after fixing the quotient connection and choosing a smooth bundle splitting. For compact or semisimple quotients, an equivariant splitting makes this separation compatible with the full gauge symmetry without changing the adjustment.

fields
Mathematical Physics, Differential Geometry
pdf ↗ page arXiv:2610.35669 ↗

We introduce the $(m,p,q)$-Lefschetz property for $(1,1)$-type endomorphisms of Hodge–Lefschetz modules, providing a framework for studying nef $(1,1)$-classes and characteristic classes of nef vector bundles on compact Kähler manifolds. Under a Hall–Rado type condition on nef twisted vector bundles, we prove Hodge–Riemann relations for products of top Chern classes and, in suitable bidegrees, for products of derived Schur classes. For products of nef $(1,1)$-classes, we show furthermore that the Hall–Rado type condition is equivalent to simultaneous Hodge–Riemann relations. Our proofs build on the purity theorem and descent lemma of Cattani, Kaplan, and Schmid. We extend the descent lemma to Schur classes of nef vector bundles. We also establish formal analogs for projective bundle modules over Hodge–Lefschetz modules, with applications to tautological classes and descent on matroid Chow rings.

comments
53 pages
fields
Algebraic Geometry, Combinatorics, Differential Geometry
pdf ↗ page arXiv:2610.37650 ↗

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 a companion paper.

comments
28 pages, 6 figures. 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
fields
Symplectic Geometry, Algebraic Geometry
pdf ↗ page arXiv:2610.37724 ↗

Hofbauer, Kon and Saito showed that a Lotka-Volterra interaction matrix $A$ with negative diagonal can be qualitatively permanent only if (C1) every cycle of length $\ge 2$ of $A$ is nonpositive and (C2) every negative cycle contains exactly one negative entry. They conjectured that these conditions are also sufficient, and proved this for $n\le 3$. We give a $5\times 5$ integer matrix with seven nonzero off-diagonal entries that satisfies (C1) and (C2) but is not qualitatively permanent. For an explicit integer growth vector, in which one species is an obligate consumer as the definition allows, the system has an interior equilibrium, and an asymptotically stable heteroclinic cycle on the boundary of the orthant attracts an open set of interior orbits. Adding non-interacting species gives counterexamples for every $n\ge 5$. The interactions form a one-way feedback loop together with a predator of two prey. The verification is elementary except for one heteroclinic connection, which lies in a face that is not Volterra-Lyapunov stable. For it we prove a connection lemma based on invasion graphs, which reduces the question to a smaller, stable face. The failure is robust. It persists under small perturbations, including weak additional interactions, so every sign pattern that satisfies (C1) and (C2) and contains ours is a counterexample, and it occurs for an open cone of growth vectors. For $n\ge 6$ there are also counterexamples in which every species grows when alone. Finally, we announce that the conjecture holds for $n=4$ and that, for $n=5$, four minimal sign patterns characterise its failure.

comments
22 pages, 3 figures. Ancillary files: four verification scripts (Julia, standard library only)
fields
Dynamical Systems
pdf ↗ page arXiv:2610.38374 ↗

Several chemical and biological systems produce spontaneous spirals in their dynamical behavior, such as the Belousov-Zhabotinsky reaction in chemistry and the slime mold Dictyostelium in biology. In a previous study, such spiral wave formation was accurately replicated with a computational spatial system known as the Ideal Storage Cellular Automaton Model (ISCAM). Here, a more detailed investigation is presented of the ability of this model to generate spontaneous spirals depending on its parameter values. A dynamical systems analysis is performed, and bifurcation diagrams, phase space diagrams, and snapshots of the model's spatial dynamics are presented for a range of parameter values. This analysis reveals that spiral waves can only be sustained in the system when the parameter values of the model fall well within the regime of a so-called Neimark-Sacker bifurcation.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.38710 ↗

Learning independence is fundamental to statistical inference and machine learning, yet learning independence between entire time series by a test remains challenging when only a single observation record is available. Existing guarantees often rely on structural or mixing assumptions, while stationarity and ergodicity alone do not permit consistent testing. In this work, we identify a class-level boundary governed by shared nontrivial Koopman eigenvalues, which represent common persistent oscillatory frequencies of the two processes. When no such eigenvalues are shared, we extend shift-based rank calibration with finite-window dependence witnesses and a data-adaptive threshold to construct a deterministic, weakly consistent test with finite-sample false-positive control, without quantitative mixing assumptions. Conversely, we show that no possibly randomized test can achieve vanishing false-positive probabilities under every independent jointly totally ergodic law while consistently detecting every dependent jointly totally ergodic law with a shared nontrivial eigenvalue. This impossibility already holds when the shared point spectrum is exactly the cyclic group generated by any single prescribed irrational eigenfrequency, identifying a spectral obstruction to universal learning of full-process independence.

fields
Statistics Theory
pdf ↗ page arXiv:2610.38999 ↗

In this paper, we show that any Kähler $C$-space of classical type has nonnegative cross quadratic bisectional curvature and positive dual cross quadratic bisectional curvature. As a consequence, such manifolds are Fano. This confirms a substantial part of a conjecture of Ni-Zheng (Conjecture 1.5 in \cite{NZ}).

comments
68 pages; a note is added; a minor modification of Lemma A.3 is made
fields
Differential Geometry
pdf ↗ page arXiv:2610.39012 ↗

We study generalized discrete fractal dimensions of sequences of finite connected graphs whose diameters tend to infinity. Using normalized shortest-path metrics and a general scale function, we define regularized energy dimensions for vertex probability measures and their optimized versions. We then establish a variational principle that identifies the optimized energy dimension with the supremum of ball-mass concentration dimensions. We also establish monotonicity in the moment order, stability under uniformly comparable measures, and upper bounds in terms of Rényi entropy growth and the upper mass dimension. Cluster estimates and explicit graph constructions show that local vertex concentration can lower the uniform energy dimension without changing the mass dimension. Finally, for uniformly Ahlfors-regular graph families, we obtain an integral criterion for energy boundedness and explicit formulas for the critical dimensions. These results clarify how global growth, local distance distributions, and the choice of scale function jointly determine discrete fractal dimensions.

fields
Combinatorics, Metric Geometry
pdf ↗ page arXiv:2610.39187 ↗

We study the Korteweg-de Vries equation on a bounded interval with boundary dissipation, and its spatial semidiscretization by a weighted cubic Hermite Galerkin method. A small nonlinear wave can be approximated by a linear discrete simulation in two orders: linearize first and then discretize, or discretize first and then linearize. Both orders lead to the same total error. They divide this error differently between linearization and discretization. The difference of the two divisions is what we call the ordering error. We show that it is quadratic in the size of the initial datum and carries a positive power of the mesh size, for all time. It can be used to assess the effect of a coarse-mesh correction for nonlinear problems. For the continuous problem, the solution map is analytic, and the semigroup of the linearized equation has Crandall-Pazy regularity with the exact index 3/2. For the weighted scheme, the discrete semigroups of the linearized equation inherit exponential stability, Kato smoothing and Crandall-Pazy regularity, with bounds uniform in the mesh size. The nonlinear solution maps are analytic, also uniformly in the mesh size. These properties give error estimates in which the error and the datum are measured in the same norm: in the energy norm, in $H_0^1$ and in $H^2$. On every interval $[t_0,\infty)$, $t_0>0$, same-norm convergence holds uniformly on balls at algebraic rates. The ordering error is of order $h^{1/6}$ times the square of the energy norm of the datum, uniformly for all $t\ge0$.

comments
36 pages. Ancillary files: the Lean 4 development for Theorems 4.1-4.4. Companion paper: arXiv:2611.12585
fields
Analysis of PDEs, Numerical Analysis, Optimization and Control
pdf ↗ page arXiv:2610.39269 ↗

For every bounded convex domain $Ω\subset\mathbb R^d$, $d\ge2$, we establish the following sharp inequality for torsional rigidity $$\frac{2(d+1)}{d}\int\limits_Ω\operatorname{dist}(x,\partialΩ)^2{\,\mathrm d} x\le T(Ω),$$ where $T(Ω)=4\int\limits_Ωu{\,\mathrm d} x$ and $-Δu=1$ in $Ω$, $u\in H_0^1(Ω)$. Moreover, equality holds if and only if $Ω$ is a ball.

comments
7 pages. Revised version. It is also proved that equality holds if and only if domain is a ball
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39666 ↗

After some personal recollections of Jean-Pierre Kahane, this paper gives a gentle introduction to the Gleason-Kahane-Zelazko theorem. The theorem states that a normalised complex-linear functional on a unital complex Banach algebra is multiplicative whenever it does not vanish on invertible elements. Neither continuity of the functional nor commutativity of the algebra is assumed. We give a detailed account of three proofs: the original argument of Gleason and, independently, Kahane and Zelazko; the polynomial proof of Roitman and Sternfeld; and a proof by the author. We explain the complex analysis behind each: a special case of Hadamard's factorisation theorem, a polynomial argument using the fundamental theorem of algebra, and the Polya-Saxer theorem on zero-free entire functions and their derivatives. The elementary entire-function lemma needed for the first proof is proved in full; the Polya-Saxer theorem is used without proof. We give full details of the algebraic argument common to the three proofs, which deduces multiplicativity from the preservation of squares, including the non-commutative case. We then discuss applications and counterexamples, and present an extension to Ransford's generalised spectra using the Roitman–Sternfeld argument. We conclude with a brief guide to the more recent literature.

comments
31 pages. Paper submitted to a volume in memory of Jean-Pierre Kahane
fields
Functional Analysis, History and Overview, Number Theory
pdf ↗ page arXiv:2610.39769 ↗

We provide an exact Egorov-type formula, given by a convergent expansion in the semi-classical parameter $\varepsilon > 0$, for the propagation of a certain class of analytic Wick observables with super-exponentially decaying coefficients, under the action of a time-dependent quadratic Hamiltonian. This work generalizes a result established by S. Breteaux for polynomial symbols, and includes the spatially cutoff $P(\varphi)_2$ model, as well as a variant of the Höegh-Krohn model.

comments
30 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2610.39806 ↗

Quantum chains of division rings yield counterexamples to the pure semisimplicity conjecture and hereditary artinian rings of every Coxeter type $\mathbb{I}_2(m)$ with $m \geq 4$. For a field element $q$ of multiplicative order $\ell \geq 2$, possibly infinite, the construction gives an extension $H \subseteq T$ with right dimension $2$ and left dimension $\ell$. If $\ell = \infty$, the associated triangular ring is right pure semisimple but neither left pure semisimple nor of finite representation type. Over $\mathbb{Q}$, the parameters $q = 2, 3, 4, \dots$ give pairwise Morita inequivalent counterexamples. If $\ell<\infty$, the ring is of finite representation type with Coxeter type $\mathbb{I}_2(\ell+2)$, and the right dimension sequence of ${}_HT_T$ is periodic with period $(1, 2, \ldots, 2, 1, \ell)$, where $2$ occurs $\ell-1$ times. Every finite $\ell \geq 2$ is realized by choosing $q$ to be a primitive $\ell$-th root of unity.

comments
Comments and discussion are welcome
fields
Rings and Algebras
pdf ↗ page arXiv:2610.39883 ↗

In contrast to Christ's theorem that the lacunary spherical maximal operator is bounded from $H^1(\mathbb R^d)$ to $L^{1,\infty}(\mathbb R^d)$ ($d\geq2$), we show that the lacunary bilinear spherical maximal operator $$ \mathcal B_{\mathrm{lac}}(f,g)(x) =\sup_{\ell\in\mathbb Z} \Bigl|\int_{\mathbb S^{2d-1}}f(x-2^\ell y)\,g(x-2^\ell z)\,dσ(y,z)\Bigr| $$ is not bounded from $H^1(\mathbb R^d)\times H^1(\mathbb R^d)$ to $L^{1/2,\infty}(\mathbb R^d)$ for any $d\geq1$. In particular, it is not bounded from $L^1(\mathbb R^d)\times L^1(\mathbb R^d)$ to $L^{1/2,\infty}(\mathbb R^d)$. More precisely, when the supremum is restricted to a suitable set of $N$ dyadic radii, the norm of the resulting operator from $H^1(\mathbb R^d)\times H^1(\mathbb R^d)$ to $L^{1/2,\infty}(\mathbb R^d)$ grows at least like $\log N$. For $d=1$ this answers the case $p=q=1$ of a question in Borges's survey. For every $k\ge3$ and $d\ge1$, a modification of the construction proves that the lacunary $k$-linear spherical maximal operator does not map $(H^1(\mathbb R^d))^k$ into $L^{1/k,\infty}(\mathbb R^d)$.

comments
Typos fixed
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.40100 ↗

The group $G = SL(n+2,\R)$ has a parabolic subgroup $P = MAN$ whose unipotent radical is a Heisenberg group. We study representations induced from a character of $P$, and using the Lie algebra action on the space of $K$-finite vectors we find the points of reducibility and the complementary series. We identify solutions to the conformally invariant systems of differential operators as subrepresentations.

comments
24 pages, version 2, revised the introduction and Section 5.4. No changes to the main result/proofs
fields
Representation Theory
pdf ↗ page arXiv:2610.40102 ↗

We establish algebraic upper bounds for the Lebesgue constants of multivariate polynomial interpolation on Leja-type lower grids in terms of the total number of nodes $N$. For fixed dimension $d\geq2$, write $q_d=d/(d-1)$. Disk Leja grids and their images under exterior conformal maps that extend holomorphically and injectively across the unit circle share the bound $O(N^{δ_d})$, with $δ_d=\tfrac12+q_d^{-1}\log_2(1+2^{q_d/2})$. This gives $δ_2\approx1.292481$ in two dimensions and $δ_3\approx1.448799$ in three dimensions. For $\mathfrak R$-Leja grids, we obtain $O(N^{β_d})$ with $β_d=1+q_d^{-1}\log_2(1+2^{q_d})$, which gives $β_2\approx2.160964$ and $β_3\approx2.291168$. Both bounds hold uniformly over all finite lower sets and choices of disk Leja sequences, with constants depending only on the dimension and the conformal maps.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.40177 ↗

This manuscript presents a proof of the Alon–Seymour–Thomas conjecture developed under the author's guidance using ChatGPT 6pro. More precisely, for every integer $h\geq3$, every $n$-vertex $K_h$-minor-free graph has a vertex set of size at most $16h\sqrt n$ whose deletion leaves every component with at most $2n/3$ vertices. The author has checked every formula and theorem by hand and used Codex to assist with writing (editing formulas, polishing the language, and typesetting). GPT 6.1 Sol (Max) was also used to check the proof repeatedly and to generate numerous examples for verification. The author takes full responsibility for the correctness of the proof.

comments
21 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.40270 ↗

We establish the leading asymptotic for the shifted correlations of divisor functions.

comments
Minor changes in the exposition
fields
Number Theory
pdf ↗ page arXiv:2610.40439 ↗

Let $A$ be a finite abelian group. A nowhere-zero $A$-flow of a graph can be changed along a cycle: going around the cycle, add a fixed non-zero element of $A$ to the value of every edge that points forward and subtract it from the value of every edge that points backward. The Cranston–Li–Su–Wang–Xu (2026) conjecture on the reconfiguration of nowhere-zero flows states that if $A$ has at least four elements, then in every graph in which all degrees are even, any two nowhere-zero $A$-flows are joined by a chain of such changes through nowhere-zero $A$-flows. It also states that, for every integer $k\ge 4$, the same holds for integer flows whose values are between $1$ and $k-1$ in absolute value, where each change adds a non-zero integer. We prove this conjecture. The proof is by induction on the number of edges. If a flow enters a vertex along one edge and leaves it along another edge with the same value, the two edges can be replaced by a single edge; this gives a smaller graph. The main step is to change every flow into a flow with such a pair of edges. For $A$-flows we do this when all degrees are at most $4$; repeatedly replacing a vertex of degree at least $6$ by a triangle, following Cranston et al., reduces the general case to this one. For integer flows, we show that, in a graph in which all degrees are even, any two nowhere-zero flows with values in the cyclic group $\mathbb{Z}_k$, $k\ge 4$, are joined by changes that add only $1$, $-1$, $2$ or $-2$, and that such changes lift to integer flows. All theorems of this paper are also proved in the Lean 4 proof assistant.

code
github.com/david44hello/papers_supporting_materials/tree/cranston-li-su-wang-xu-2026-conjecture-v2.00/cranston-li-su-wang-xu-2026-conjecture ∎ Lean project (cranston-li-su-wang-xu-2026-conjecture/lean/lakefile.toml, cranston-li-su-wang-xu-2026-conjecture/lean/lean-toolchain) builds, no sorry at 15495bd, checked 2026-11-13 build details
fields
Combinatorics
pdf ↗ page arXiv:2610.40863 ↗

We consider the focussing cubic Klein-Gordon equation on $\mathbb{R}^{3+1}$ in the radial setting. Foundational work by Nakanishi-Schlag gives a complete qualitative characterisation of the dynamics near the ground state $Q$, in particular revealing a threshold phenomenon, whereby a co-dimension one Lipschitz manifold separates finite time blow up from scattering solutions in forward time. Our aim in this paper is to derive an effective bound for the scattering norm $\|u\|_{L_t^3([0,\infty);L_x^6(\mathbb{R}^3))}$, for scattering energy class solutions $u$ with data sufficiently near $Q$ and close to the threshold manifold. This requires the development of an induction on energy strategy in a setting where an alternative to the usual Morawetz approach appears necessary.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.41718 ↗

Analysis of mathematical models in ecology and epidemiology often emphasizes asymptotic dynamics, such as stable equilibria, periodic orbits, and attractors. However, many biologically relevant trajectories exhibit long transient dynamics in which a relevant observable evolves slowly for an extended period before a comparatively rapid transition occurs. On finite time scales relevant to data collection, management, and intervention, such transient behavior can be more informative than the eventual asymptotic outcome. In this work, we study long-lasting and slowly varying transient dynamics in continuous-time systems through the framework of nonequilibrium transient centers. These centers are points in the state space near which the observable can remain nearly constant for a long time, even when the full state is not near an equilibrium. We develop finite-time escape criteria for identifying such centers and their reachable counterparts. These criteria provide practical conditions under which nearby trajectories can remain in a slow regime for a long period of time before eventually leaving it. We apply the theory to an epidemic model with delay of stability loss. In this model, trajectories may remain close to the disease-free manifold for a long time before the infectious population resurges. The framework developed here describes this behavior as slow evolution near a nonequilibrium transient center followed by finite-time escape from the slow regime.

comments
37 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2610.41930 ↗

We study a problem posed by Kardoš asking whether the truncation of every connected simple bridgeless cubic graph has strong chromatic index six. The truncation $T(G)$ is obtained by replacing each vertex of a graph $G$ with a triangle and attaching its three incident edges to distinct vertices of that triangle. Han and Cui established an affirmative answer for prism bases. We prove that the strong chromatic index is six whenever $G$ is a connected simple cubic graph that is bipartite or is both bridgeless and claw-free. Both proofs are constructive and use a common compatibility criterion for combining colourings of smaller pieces. The same equality holds for connected loopless cubic multigraphs in either class, with the sole exception of the $3$-bond, whose truncation is the triangular prism and has strong chromatic index nine.

comments
23 pages, 5 figures, 7 tables
fields
Combinatorics
pdf ↗ page arXiv:2610.41950 ↗

A grounded arithmetic counts a sentence true only when a terminating process establishes it; a sentence no such process settles has no value. Such a logic can state that an event happens, but not that it never happens under unbounded choice. This paper extends such a logic so that it can. The base is Reflective Grounded Arithmetic (RGA) with Inductive Grounded Arithmetic (IGA)'s least-fixed-point reading and ground induction. It adds a separate greatest-fixed-point former $ν$ with Park's coinduction rule, proves that one former cannot carry both ground induction and coinduction, and adds a dichotomy rule: the classical disjunction between a least-fixed-point atom and the greatest-fixed-point atom of its dual, under a derivable premise that the body's leaves are decided. The systems are sound for an explicit model reading every $ν$-body at its greatest fixed point, hence consistent; they agree with the least model where it has a value and prove sentences it leaves without one. The dichotomy trades the underivable hypothesis that an order is well-founded for the derivable one that its steps are decided, at the price of a change of model. With ground induction the dichotomy derives the omniscience rule of the sibling system OGA, so the system has no semantics whose certificates for universals are its own proofs; without the dichotomy it has one, though unsound for the least model. The systems prove, as single sentences, that every decided tree is well-founded or has an infinite branch given by a term, total in the new model; that random assignment terminates while its divergent twin runs forever; that a fair loop terminates and the alternating-bit protocol delivers every message; that open games are determined; that the termination gap in Nakata and Uustalu's trace semantics closes; and that Cinderella wins the bucket game at capacity three. Isabelle/HOL checks every result.

comments
major revision; now 89 pages
fields
Logic
pdf ↗ page arXiv:2611.00176 ↗

In this article, we define a new partial distance on hyperspaces consisting of closed balls, which is a partial metric in the sense of Matthews. We prove that these partial metric spaces are complete if and only if the metric spaces from which the corresponding ball spaces arise are complete. Finally, we compare the topology induced by the new partial distance with that induced by the classical Hausdorff distance.

comments
Reference [3] added, some minor corrections introduced
fields
General Topology
pdf ↗ page arXiv:2611.00249 ↗

We study the maximum order $v(k,θ)$ of a connected $k$-regular graph whose second largest eigenvalue is at most $θ$. For every real $θ\geq1$, we prove that \[ T(θ) =\limsup_{k\to\infty}\bigl(v(k,θ)-2k\bigr) =2\left\lfloor1+\frac{θ^2}{4}\right\rfloor. \] In particular, $T(θ)>2θ$ for every real $θ\geq4$, disproving the Yang-Koolen conjecture. We also determine $v(k,θ)$ for all sufficiently large $k$ on explicit intervals of $θ$. We prove a jump in the second largest eigenvalue above $1$. For each fixed $1\leqθ<2$ and all sufficiently large $k$, every connected $k$-regular graph of order at least $2k+2$ whose second largest eigenvalue is at most $θ$ is the crown graph. For $θ=\sqrt2$, we prove that $v(k,\sqrt2)=2k+2$ for every $k\geq13$. Finally, we give a new upper bound on $v(k,θ)$.

comments
16 pages; minor revisions
fields
Combinatorics
pdf ↗ page arXiv:2611.00591 ↗

We study stable regular solutions of the equation $-\operatorname{div}\bigg(\Big(A(x)\nabla u \cdot \nabla u\Big)^{p/2-1}A(x)\nabla u\bigg) = f(u)$ in $B_1 \subset \mathbb{R}^n$, where $p > 1$, $f \in C^1(\mathbb{R})$ is nonnegative, and $A$ is a locally Lipschitz, symmetric, uniformly elliptic matrix field. We prove that stable regular solutions satisfy an interior Hölder estimate for $n < p + 4p/(p - 1)$ when $p \ge 2$, and for $n < 5p$ when $1 < p < 2$. This extends the result of Cabré, Miraglio, and Sanchón [7] for the $p$-Laplace equation. Note that the constant in our Hölder estimate depends on the local $C^1$ norm of $A$, but not on its $C^2$ norm. Our approach is motivated by the interior regularity estimates of Cabré, Miraglio, and Sanchón [7] for the $p$-Laplace equation and by Erneta's [14] treatment of variable coefficients in semilinear elliptic equations.

comments
60 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.00730 ↗

We propose an approximate Hamiltonian dynamics for the Gross–Pitaevskii equation $i\hbarψ_t = -\frac{\hbar^2}{2m}Δψ+ V(x)ψ+ \hbar^2 λ|ψ|^2ψ$ with harmonic potential $V(x)$ and $x\in\mathbb{R}^d$. We do this by extending the Gaussian ansatz of Perez-Garcia et al.~(Phys.~Rev.~A 56, 1424 (1997)) to the semiclassical wave packets of Hagedorn. We derive the evolution equations for the wave packets from the Hamiltonian/symplectic perspective, rather than the Lagrangian/variational one taken by Perez-Garcia et al. We first show that these two perspectives yield identical evolution equations in the Gaussian case. We then derive the evolution equations for an arbitrary element of the semiclassical wave packets. Finally, we demonstrate the efficacy of the approximate dynamics with numerical experiments.

comments
12 pages, 5 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.01108 ↗

In this work, we investigate the impact of Doppler frequency shift on sub-terahertz low Earth orbit (LEO) satellite communications using OFDM transmission. To comprehensively evaluate the severity of the Doppler shift impact on sub-terahertz satellite-to-ground links, we first put together an evaluation framework that jointly accounts for major Doppler-induced and non-Doppler-induced signal impairments in such systems. We then compare and contrast three possible engineering approaches to deal with Doppler shift in such a communication system. Our study concludes that (i)~while just ignoring the Doppler effect in such high-frequency and high-mobility systems substantially compromises the performance and reliability, (ii)~most of the negative effects can be eliminated by implementing only a small set of low-complexity measures. We particularly show that even a single Doppler shift estimation over a 5-min-long satellite pass over the ground user location may be sufficient to ensure high performance throughout the entire connectivity period. Hence, while Doppler shift is an important effect to account for in sub-terahertz LEO satellite communications, it should not constitute a critical design challenge for these emerging systems.

fields
Information Theory
pdf ↗ page arXiv:2611.01264 ↗

We prove that the spectral gap of a Weil–Petersson random hyperbolic surface of genus $g$ with $n=n(g)\ge1$ labelled cusps converges in probability to $1/4$ as $g\to\infty$, for every sequence $n=o(\sqrt g)$. More precisely, for each fixed $0<\varepsilon<1/4$, there are constants $C_\varepsilon\ge2$ and $g_\varepsilon\ge3$, independent of $n$, such that the expected number of nonzero $L^2$ eigenvalues in $(0,1/4-\varepsilon]$, counted with multiplicity and including residual eigenvalues, is at most $C_\varepsilon(n+1)^2/g$ whenever $g\ge g_\varepsilon$ and $g\ge C_\varepsilon(n+1)^2$. This proves a conjecture of Shen and Wu. A matching lower bound shows that the count estimate is optimal up to constants for each fixed $\varepsilon$, and that $n=o(\sqrt g)$ is necessary for convergence of the gap to $1/4$. The proof combines volume estimates uniform in the cusp count with polynomial approximation and a positive trace on truncated surfaces.

fields
Differential Geometry
pdf ↗ page arXiv:2611.01477 ↗

We prove the $k$-quasi-planar graph conjecture for topological drawings. For every integer $k\ge 2$, a simple graph on $n\ge 3$ vertices admitting a drawing with no $k$ pairwise crossing edges has at most $1056(k-1)^2(n-2)$ edges. Thus the number of edges is linear in $n$, with an explicit quadratic dependence on $k$. The result allows multiple crossings between the same pair of edges, including edges with a common endpoint. The proof uses the double of a sphere with boundary to represent graph edges by closed geodesics on a hyperbolic surface. The endpoints of geodesic lifts induce partial orders of width at most $k-1$. A stability bound for greedy chain partitions, together with a counting argument over a triangulation, gives the stated edge bound.

comments
12 pages, 6 figure, Revision of v1
fields
Combinatorics
pdf ↗ page arXiv:2611.01509 ↗

Polyakov predicted that the classical Heisenberg model on $\mathbb{Z}^2$ has exponentially decaying correlations at every temperature, and proofs of this have recently been posted. We show that the massive phase survives small anisotropy. For every inverse temperature $β$ there is $δ(β)>0$ such that the $S^2$-valued model with couplings $\sum_iJ^iσ_x^iσ_y^i$ has exponentially decaying spin two-point functions, uniformly in finite subgraphs with free boundary conditions and in edge strengths up to $β$, whenever all $|J^i-1|\leδ(β)$. The same holds for aligned single-ion anisotropy and for nearly isotropic $O(n)$ models with $n\ge3$. Consequently, for the easy-plane model with couplings $σ^xσ^x+σ^yσ^y+λσ^zσ^z$, the onset of the Berezinskii-Kosterlitz-Thouless phase, proved by Garban and de Montgolfier for every $λ\in(-1,1)$, moves to zero temperature as $λ\uparrow1$. These results rest on the annulus crossing bound of Ding, Huang and Yang, used on one finite annulus where the anisotropy is a bounded perturbation, and on a sign-cluster argument with Ginibre's inequality for anisotropic planar energies. Explicit constants of another isotropic proof give decay for $β\le c |\log(1-λ)|^{1/2}$. For $n\ge4$ and $|J^i-1|\leδ$ with $δ$ small, at $β\le(1-\varepsilon)|\logδ|/(2π)$ spin one-point functions decay exponentially away from the boundary under every boundary condition, and two-point functions decay, both on the scale $e^{πβ+O(\sqrt{β\logβ})}$. This is the $O(4)$ threshold: for $n=4$ it matches the renormalization-group crossover to leading order; for $n\ge5$ it lies below the prediction. This part is conditional on estimates of a recent manuscript on the $O(4)$ model, which the proof transfers to anisotropic couplings at one scale; only odd observables transfer.

comments
23 pages, 2 figures
fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2611.01532 ↗

In this paper, we give verifications of the inductive Navarro-Alperin weight condition in [8] for the Suzuki and Ree groups at all primes.

comments
We added acknowledgments, supplemented references and some notations in Section 2, adjusted the order of some contents, and revised the descriptions of some proofs
fields
Representation Theory, Group Theory
pdf ↗ page arXiv:2611.01608 ↗

Let $A(x)=|A\cap[1,x]|$. For every integer $h\ge3$, every finite $B_h$ set $A_0\subseteq\mathbb N$, and every $0<c\le h^{-2/h}$, we construct an infinite $B_h$ set $A\subseteq\mathbb N$ containing $A_0$ such that $A(x)/x^{1/h}$ has upper limit $c$ and lower limit zero. This extends the range $0<c\le1/h$ obtainable from our first construction, which answered a question of Cilleruelo and Nathanson, later raised by O'Bryant, on the existence of a positive upper limit. For $h=3$, a positive upper limit disproves the assertion $A(x)=o(x^{1/3})$ in Szemerédi's Problem~186(d). The improved range follows from an integer lift of a modular construction of Gómez Ruiz and Trujillo Solarte, with large gaps between sums of distinct $r$-element multisets for each fixed $1\le r<h$. These gaps ensure that successive blocks can be adjoined by translation while preserving the $B_h$ property. The same prescribed limits can be attained inside every set of asymptotic density one containing $A_0$. Separately, we construct $2^{\aleph_0}$ extensions of $A_0$ that are maximal among all $B_h$ subsets of $\mathbb N$, have the prescribed limits, and avoid any prescribed finite subset of $\mathbb N\setminus A_0$. These maximal extensions can be chosen so that $\sum_{a\in A}a^{-1/h}$ diverges arbitrarily slowly.

fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2611.01871 ↗

In this paper we adopt a topological perspective to extend two theorems of classical infinitary logic to the infinitary logic of Keisler's general real-valued structures: the omitting types theorem and Scott's theorem. There the formulas need not be uniformly bounded, and no moduli of continuity are required, as they are in the metric extensions of the classical theorems; neither equality nor a metric is required. The omitting types theorem holds for every countable fragment, because the space of Henkin types of the fragment is Čech-complete. Scott's theorem characterizes every structure with countable sorts, among all structures, up to approximate equivalence, and the classes of this equivalence are Borel sets in the Polish space of structures on the natural numbers. With the monoid of surjections of the natural numbers in place of the group of permutations, we also prove López-Escobar's theorem for classical infinitary logic without equality.

fields
Logic
pdf ↗ page arXiv:2611.02247 ↗

The Euler equations of hydrodynamics describe the motion of an ideal incompressible fluid. Arnold observed that their solutions are geodesics on the group of volume-preserving diffeomorphisms of the fluid domain, equipped with the $L^2$ metric, so that the curvature of this group governs how nearby fluid motions separate. Sectional curvature takes both signs, and Ricci curvature, its average over all directions, is the natural measure of which sign prevails, but in infinite dimensions the sum defining it diverges. When the fluid domain is the flat torus, we define Ricci curvature through Zeitlin's finite-dimensional models, which approximate the Euler equations by geodesic equations on the matrix groups $SU(N)$. We compute the Ricci curvature of these models exactly and prove that, normalized by dimension, it converges as $N \rightarrow \infty$ to an explicit integral. The limit is strictly negative in every Fourier mode and decreases logarithmically with the wavenumber, the behavior conjectured in \cite{lichtenfelz2026ricci} for the sphere. We also show that the diameter of $SU(N)$ in the Zeitlin metric grows at most linearly in $N$.

comments
25 pages, 1 figure
fields
Differential Geometry, Mathematical Physics
pdf ↗ page arXiv:2611.02323 ↗

Predicting the highest packing fraction that disordered packing of bidisperse discs can achieve, $φ_{max}$, is an important unresolved problem. Such a predictive theory is hindered by the density dependence on the packing protocol and by ensuring disorder. In bidisperse packings, this is more complicated because $φ_{max}$ is not a number but a function of the disc species size ratio, $D$, and one of the disc species concentration, $p$. These difficulties have been overcome in monodisperse disc packings by using the cell order distribution (COD)~\cite{Bl21}. Focusing on size ratios that prohibit rattlers, a COD-based theory is constructed here. It introduces bidisperse statistical closure equations, which combine an explicit disorder criterion with consistent cell and edge statistics, and yields $φ_{max}(p,D)$ and structural predictions. The a-priori disorder-guaranteeing criterion proposed here ensures fast exponential a decay of the occurrence probability of ordered clusters with size. Using a constrained maximum-entropy analysis to ensure maximum disorder, the occurrence probabilities of all the possible cell and edge configurations are derived in terms of $p$ and $D$ and they are found to be binomial. All the results are assembled to yield an exact prediction of $φ_{max}(p,D)$.

comments
10 pages main text, containing 6 figures, plus 7 pages supplemental material
fields
Mathematical Physics
pdf ↗ page arXiv:2611.02805 ↗

We study strong positivity and Hodge–Riemann relations for real $(1,1)$-forms satisfying generalized $m$-positivity conditions. We prove that every good prefix, defined by the hyperbolicity cones of successive directional derivatives of the determinant, has a strictly strongly positive product and satisfies the Hodge–Riemann relations in every bidegree. Allowing factors on the boundaries of these cones, we show that the hyperbolicity cone of every nonzero prefix product equals the polarizing component of its natural exterior-algebra quotient. This gives the full mixed Hodge–Riemann relations for ordinary $m$-positive forms without a semipositivity assumption. We also prove the relations for weakly $(m,l)$-positive forms, defined by $(m-l)$-positivity on every codimension-$l$ subspace, when $p+q\le m$ and $\max\{p,q\}\ge l$. For $l=1$ and $m\ge2$, the associated $(m-1)$-th power map is a diffeomorphism from the weak $(m,1)$-positive cone onto the positive $(d-1,d-1)$-cone. For smooth closed forms satisfying the ordinary, weak $(m,l)$-positive, or good-prefix hypotheses pointwise, Dinh–Nguyên's method gives the corresponding hard Lefschetz theorems and Hodge–Riemann relations on the cohomology of compact Kähler manifolds. We also discuss numerical criteria, generalized Hessian equations, and intersection inequalities for generalized $m$-positive forms.

comments
39 pages; Several conjectures proved
fields
Algebraic Geometry, Differential Geometry
pdf ↗ page arXiv:2611.03124 ↗

The Thermodynamic Bethe Ansatz (TBA) procedure developed by Yang-Yang provides the free energy functional to be minimized via a variational problem. Their result not only gives the correct thermodynamics, but it also sets the framework for Generalized Hydrodynamics. Originally developed for quantum systems, this procedure has been recently successfully applied to (integrable) classical particle systems. However, this has never been done for classical field theories: no classical derivation has consistently accounted for solitons, breathers, radiation (dispersive modes), and their mutual interactions. We here derive the TBA equations for the Toda chain directly from its inverse scattering transform. This results in solitonic modes interacting with radiation, extending the soliton gas picture. We provide numerical verification of our equations against well established TBA equations in terms of particle modes. We expect the same procedure should apply to KdV, and pure radiative models as defocusing NLS and Sinh-Gordon, while we discuss current limitations in other models such as focusing NLS (and Ablowitz-Ladik) and Sine-Gordon.

comments
31 pages, 4 figures, 1 appendix
fields
Mathematical Physics
pdf ↗ page arXiv:2611.03857 ↗

Fix an odd prime $p$ and let $A$ be the mod $p$ Steenrod algebra. There is a normal sub-Hopf algebra $D$ of $A$, and we show that the cohomology of $A$ is $F$-isomorphic to the subalgebra of the cohomology of $D$ which is invariant under the $A$-action. We also show that the sub-Hopf algebras of $A$ with bounded profile function detect nilpotence in cohomology.

comments
30 pages
fields
Algebraic Topology
pdf ↗ page arXiv:2611.04013 ↗

In this paper, we propose a method based on rasterization in computer graphics for the integration of discontinuous functions accurately and efficiently on the GPU. The proposed method takes advantage of the massively parallel architecture of GPUs via a modified graphics pipeline, where discontinuities are encoded through geometric primitives and processed in the rasterization stage, and multisample anti-aliasing (MSAA) is used to improve integration accuracy across subdomain interfaces. We present both hardware- and software-based pipelines and compare their performance in terms of accuracy as well as computational effort on modern GPU hardware with adaptive quadrature on the CPU. For the tested hardware, at approximately comparable median relative error, the hardware pipeline is up to around $100\text{x}$ faster than adaptive quadrature, while the single- and double-precision software pipelines achieve up to $840\text{x}$ and $1200\text{x}$ speedups compared to their adaptive quadrature counterparts. We use the finite cell method as model problem, where cutcells represent discontinuous integrands at the interface of the physical and fictitious domains and demonstrate the performance of the proposed method using numerical benchmarks. The end-to-end finite cell solution runtime is reduced by a factor of $8.3$ to $9.5$ in the single-precision pipeline and by a factor of $62$ to $72$ in the double-precision pipeline at the prescribed integration settings. Therefore, results indicate that the rasterization-based integration method is a promising alternative for the accurate and efficient integration of discontinuous functions in demanding applications on the GPU.

comments
Withdrawn pending further internal review and approval by the authors.
fields
Mathematical Physics
pdf ↗ page arXiv:2611.05186 ↗

In [Pil07], Pillay showed that every imaginary in a proper pair of algebraically closed fields is interalgebraic with an imaginary of a certain algebraic form. In this paper, we establish an analogue for lovely pairs of pseudofinite fields. After naming countably many constants, we prove that every imaginary in lovely pairs of pseudofinite fields is interalgebraic with an imaginary of the same algebraic form as [Pil07] in the corresponding pairs of finite extensions of pseudofinite fields.

fields
Logic
pdf ↗ page arXiv:2611.05248 ↗

The Springer resolution of the nilpotent cone is used to give a geometric construction of the Springer correspondence by applying tools in the derived category of perverse sheaves, particularly the decomposition theorem. In this paper we continue earlier work of the authors on the extended Springer resolution, a map introduced by the first author that factors through the Springer resolution. Our first main result shows that applying the decomposition theorem to this map yields a sum of Lusztig sheaves in all Lie types, each corresponding to a triple of so-called minimal cuspidal datum. We also study the simple perverse sheaves that occur as summands of the resulting sheaf. Our second main result proves that every simple perverse sheaf corresponding to orbits that are Levi-regular must occur, generalizing earlier work in the type A setting to all Lie types.

fields
Representation Theory
pdf ↗ page arXiv:2611.05629 ↗

Over $\mathbb C$, we compute the integral Chow ring of $\mathcal A_3$, the moduli stack of principally polarized abelian threefolds. Along the way, we compute the integral Chow ring of $\mathcal M_3$, the moduli stack of smooth genus-three curves. The ring $\operatorname{CH}(\mathcal A_3)$ is generated by the Chern classes of the Hodge bundle, along with three classes supported on the locus of decomposable abelian varieties, subject to 16 relations. The ring $\operatorname{CH}(\mathcal M_3)$ is generated by the Chern classes of the Hodge bundle, with five relations. In particular, we find that the top Chern class of the Hodge bundle, $λ_3$, has order 504 on $\mathcal A_3$ and 252 on $\mathcal M_3$. For $\mathcal A_3$, this removes the factor of 4 from the bound $252\mid\operatorname{ord}(λ_3)\mid 1008$ of Ekedahl and van der Geer.

comments
45 pages. Macaulay2 computational supplement included in ancillary files. v2: Improved exposition and notation. Added Corollary 12.6
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.06014 ↗

Discretization of continuous probability distributions is an operation on the sample space, and the structure induced by this operation cannot generally be determined solely from information geometry. In our recent work on unavoidable canonical nonlinearity (UCN), we established a non-arbitrary connection between the transport cost associated with discretization and the information-geometric indistinguishability of continuous probability distributions. Through this transport-information correspondence, UCN quantifies the information-theoretic cost associated with discretization in terms of the expected Kullback-Leibler divergence between nearby continuous distributions characterized by the discretization geometry. In the original UCN construction, discretization is implemented by transporting the probability mass within each cell to its geometric centroid. The resulting transport-information correspondence, however, is derived under specific conditions involving the cell geometry, spatial coverage, and the vanishing-cell-scale limit. In this work, we generalize the local-map discretization framework by allowing an arbitrary representative point for each cell and establish an exact decomposition of the associated transport cost into contributions from the conditional covariance of the probability distribution and the displacement of the representative point from its probability-weighted centroid. Consequently, the resulting transport cost is exactly represented by the expectation of the associated Fisher-induced quadratic form, without requiring uniform cell geometry, complete coverage of the sample space, or an infinitesimal cell-scale limit. The proposed construction thus establishes an exact transport-information correspondence for finite-scale discretization using arbitrary collections of non-overlapping bounded sets.

comments
6 pages. The framework is extended to discretization to arbitrary representative points from the previous version. The choice of the Fisher metric for the case of discrete distributions is modified
fields
Information Theory
pdf ↗ page arXiv:2611.06059 ↗

We derive an individual-sequence analogue of Fano's inequality, replacing entropy by Lempel–Ziv (LZ) complexity and probability of error by empirical error frequency. In the setting considered, an arbitrary encoder maps a message to a channel input sequence $\{x_t\}$, the channel maps the input to an output $\{y_t\}$ in a completely arbitrary manner, and a block finite-state decoder produces an estimate of the channel input from the output. The individual-sequence Fano inequality lower-bounds the empirical symbol-error frequency in terms of the LZ complexity of the channel input conditioned on the channel output. This leads to a channel coding converse: reliable communication at a given rate is possible only if that rate does not exceed the individual-sequence LZ channel capacity, defined as the LZ mutual information maximized over channel inputs and minimized (worst-case) over a noise set. We also prove a matching achievability theorem for the class of \emph{symbol-wise invertible} channels, in which the channel output at each time $t$ is $y_t = f(x_t, v_t)$, $v_t$ being a `noise' variable, and $f(\cdot,v)$ is a bijection for every fixed $v$. This class includes group-additive channels $y_t = x_t \oplus v_t$ studied by Feder and coworkers. For such a channel, any rate below the LZ capacity is achievable via a randomized code (with shared randomness between encoder and decoder) with vanishing \emph{expected} per-message error frequency, simultaneously for every $v^n$ in a given noise set $\mathcal{N}$, provided $\mathcal{N}$ is closed under block permutations; this condition is satisfied by any noise set that depends on $v^n$ only via its type class with respect to such blocks. The achievability uses a universal decoder that requires no knowledge of the channel and no feedback.

comments
32 pages; submitted for publication
fields
Information Theory
pdf ↗ page arXiv:2611.06182 ↗

We study the incompressible porous media (IPM) equation, a model describing the motion of a fluid with variable density through a porous medium under the action of gravity. We prove that the stably stratified state, in which heavier fluid lies below lighter fluid, is nonlinearly stable: small perturbations decay over time and the fluid returns to equilibrium. Our result holds in the sharp Sobolev setting $H^s(\mathbb R^2)$ for every $s>2$: this threshold cannot be improved, since the equation is ill-posed in $H^2(\mathbb R^2)$. This result follows from a proof of global well-posedness at critical Besov regularity, with smallness required only in a norm invariant under the natural scaling of the equation. We also prove optimal decay rates for suitably localized initial data. The main difficulty is that the stabilizing effect of stratification acts only in some directions, while the nonlinear transport acts in all of them. Reaching the sharp regularity threshold requires two main novelties. First, we rewrite the equation in \emph{isopycnal coordinates}, which follow the level sets of the density: in these coordinates the transport becomes one-dimensional, and the anisotropic stabilizing mechanism can be exploited at minimal regularity. Second, we establish new \emph{anisotropic commutator estimates} which allow us to control the remaining nonlinear terms. Finally, we show that the estimates obtained in isopycnal coordinates can be transferred back to the original variables.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.06241 ↗

Motivated by the study of prime binomial ideals with Cohen–Macaulay quotients and linear resolutions, we introduce nearly determinantal matrices, a class of matrices obtained by repeating variables from the preceding rows in the last row. We characterize the primality of their ideals of $2$-minors in terms of an associated directed graph with row labels. For every prime case, we prove that the quotient is a normal Cohen–Macaulay domain and determine its graded Betti numbers. Finally, a prime ideal in this family has a linear resolution if and only if the matrix has three rows or two columns.

comments
Comments are welcome
fields
Commutative Algebra, Combinatorics
pdf ↗ page arXiv:2611.06571 ↗

We present LeanVOA, a Lean 4 library for the theory of vertex operator algebras (VOAs), together with a companion book that sets each formalized result next to its textbook statement. The library constructs the Moonshine module $V^\natural$ and proves, with no hypotheses, the Conway-Norton moonshine conjecture for every automorphism of $V^\natural$ (Borcherds' theorem), along Borcherds' route through the Monster Lie algebra. It identifies $\mathrm{Aut}\,V^\natural$ with a formal model of the Monster taken from the AxiomMath library for the classification of finite simple groups, given one named hypothesis that is a theorem of that library, so that moonshine holds for every element of the Monster. It also formalizes Zhu's modular invariance, Huang's tensor categories with the Verlinde formula, the Gannon-Rayhaun classification of $c=1$ VOAs, and classical freeness of the boundary admissible $L_k(\mathfrak{sl}_2)$ (Arakawa-Dai) and of the minimal models $M(2,2m+3)$ (van Ekeren-Heluani). It also contains new results: graded first-order rigidity of all Virasoro minimal models and of $L_k(\mathfrak{sl}_2)$ at every admissible level; classical freeness of $L_{-3/2}(\mathfrak{sl}_3)$, and of the other members of the Deligne series under stated assumptions; and a proof that graded unitarity of the boundary admissible $L_k(\mathfrak{sl}_2)$ implies that of the minimal models $M(2,2n+1)$. The library declares no axiom of its own. This note announces release v1.05.

code
github.com/Fedor-Popov/Lean_VOA ∎ Lean project (lakefile.toml, lean-toolchain) is too large to build within the check's time limit at 013a799, checked 2026-11-12 build details
comments
5 pages. Lean library, book and short version: https://github.com/Fedor-Popov/Lean_VOA (release v1.05)
fields
Quantum Algebra
pdf ↗ page arXiv:2611.06616 ↗

We prove a lower bound of $Ω_d((\log N)^{d-1/2})$ for the worst-case combinatorial discrepancy of $N$-point sets with respect to anchored boxes in every fixed dimension $d\ge3$. Together with Nikolov's upper bound of the same order and Wei's planar lower bound, this settles Tusnády's problem: the discrepancy of axis-parallel boxes is $Θ_d((\log N)^{d-1/2})$ in every fixed dimension $d\ge2$. The proof combines smoothed product test functions, sampling discretization, and an entropy argument for conditioned Gaussian vectors. The matching upper and lower bounds are also formalized in Lean 4.

comments
35 pages. Brownian sheet application. Lean 4 formalization at https://doi.org/10.5281/zenodo.24000482
fields
Classical Analysis and ODEs, Combinatorics
pdf ↗ page arXiv:2611.06998 ↗

We prove that, with high probability, the Erdős–Rényi random graph $G(n,p)$ is reconstructible up to isomorphism from the multiset of its rooted induced 2-neighborhoods whenever $p\geq n^{-3/4}(\log n)^3$. Together with the non-reconstructibility result of Johnston, Kronenberg, Roberts and Scott, our result locates the second reconstruction transition at the scale $p=n^{-3/4}$ up to polylogarithmic factors, resolving a question they posed. Our proof relies on a global rigidity argument exploiting 5-cycle constraints.

comments
26 pages
fields
Probability
pdf ↗ page arXiv:2611.07890 ↗

In this paper, we first prove Appleton's conjecuture on the uniqueness of noncollapsed steady solitons constructed in \cite{Appleton}. We also classify non-Ricci-flat $κ$-noncollapsed cohomogeneity one steady gradient Ricci solitons in dimension four and five. After passing to a finite cover, in dimension four, they must be the Bryant soliton or Appleton's noncollapsed 4d steady soliton; in dimension five, they must be the Bryant soliton or solitons constructed by Ivey–Dancer–Wang.

comments
59 pages. The acknowledgement is added
fields
Differential Geometry
pdf ↗ page arXiv:2611.08206 ↗

It is well known that for SDEs with non-Lipschitz coefficients, the Euler scheme can fail to converge in an Lp sense. It is also widely observed that convergence fails only due to rare explosive trajectories, that distort the expectation. In this work we demonstrate that almost any method of removing these rare explosive trajectories leads to convergence in a suitable strong and weak sense. We apply this framework to coefficients that grow faster than linearly at infinity and Lennard-Jones type coefficients that explode like a reciprocal power on a compact set.

fields
Probability, Numerical Analysis
pdf ↗ page arXiv:2611.08208 ↗

Many social processes unfold in rounds, such as elections, meetings or turns of a game, in which individuals update synchronously. We show that this round structure can turn a regular oscillation into chaos. In Katriel's differential equations, two-stage contagion (adoption after two contacts with adopters) combined with population turnover produces bistability and relaxation oscillations, but no chaos. From the elementary reactions we derive a deterministic map $F_τ$ for a large population updated in rounds of length $τ$: each individual makes at most one transition per round, events compete as exponential risks, and adoptions take effect from the next round. Katriel's equations are recovered as $τ\to0$. For short rounds the map follows the relaxation cycle, and the phase of successive outbreaks obeys a circle homeomorphism, which excludes chaos. As the rounds lengthen, this circle map loses invertibility and the invariant curve breaks down; once a round lasts about two mean adoption times, comparable to the duration of an outbreak, the attractor is chaotic, while Katriel's equations remain on a periodic relaxation cycle. With the probability $p$ of adoption after a single contact as bifurcation parameter, the map goes from extinction through a window of chaos to a stable equilibrium; for $β/γ=46$, $μ/γ=0.002$, $γτ=5.5$ the window is $0.023\le p\le0.056$, bounded by the invasion threshold and by a boundary crisis, whereas Katriel's equations oscillate for $0.022<p<0.41$. Chaos is supported by the Lyapunov spectrum (Kaplan–Yorke dimension $1.81$), the correlation dimension, the 0-1 test, ordinal-pattern complexity, saddle periodic orbits and a horseshoe of the phase map. One-stage contagion, $p=0$ and permanent adoption showed no chaos.

comments
29 pages, 12 figures, 8 tables; includes Supplementary Material (7 pages, 5 figures, 3 tables)
fields
Dynamical Systems
pdf ↗ page arXiv:2611.08353 ↗

The goal of this paper is to investigate the following question: what geometric restrictions does the existence of a transitive family of constant mean curvature hyperspheres impose on a Riemannian metric on $\mathbb S^n$? The notion of a transitive family can be made precise through the theory of Zoll families developed by Ambrozio, Marques, and Neves. Within this framework, we partially extend their local rigidity theorem for even conformal factors on $\mathbb S^3$ to every dimension $n\ge4$, assuming each hypersphere in the minimal Zoll family has the area of a round equator. Moreover, we give a partial answer to the following generalized version of a question posed by Bryant: must a metric on $\mathbb S^n$, conformal to the round metric and admitting a Zoll family of hyperspheres with a common nonzero constant mean curvature, have constant sectional curvature? Finally, we investigate inverse problems following ideas of Hangan and prove a rigidity result about metrics for which the canonical geodesic spheres have constant mean curvature.

comments
44 pages, minor typos corrected
fields
Differential Geometry
pdf ↗ page arXiv:2611.08423 ↗

The Stone-Weierstrass theorem obtains every continuous function on a compact space as a uniform limit of functions built from a separating family by finitely many operations. We extend the theorem to every separable metric space, and in particular to every Polish space, by admitting countable suprema and infima according to weights computed from the construction. For a countable, uniformly bounded separating family whose supremum metric makes the space separable, the functions so built are exactly the bounded Lipschitz functions, and their uniform limits are exactly the bounded uniformly continuous functions. The theorem was discovered, and first proved, in infinitary real-valued logic, where the weights are the a priori bounds of formulas and the uniform approximation is equivalent to an approximate form of Beth's definability theorem, which carries Reggio's correspondence from compact spaces to separable metric spaces. The same bounds draw an exact line between the two forms of definability when the values of the coordinates in the models of the implicit definition form a set separable for the supremum metric: an implicitly defined predicate has an explicit definition precisely when the defining function is Lipschitz, and admits uniform approximation by sentences precisely when that function is uniformly continuous. We also give a purely topological-analytic proof of the theorem.

fields
Logic, Functional Analysis, General Topology
pdf ↗ page arXiv:2611.08901 ↗

Using annular webs and Kazhdan-Lusztig mu-coefficients, we disprove Guralnick's absolute boundedness conjecture for first cohomology.

comments
40 pages, many figures, Lean verification available, comments welcome
fields
Representation Theory, Combinatorics, Group Theory
pdf ↗ page arXiv:2611.09114 ↗

For a Haar unitary matrix $U_N$ of size $N$, we prove that the first absolute moment of $\operatorname{tr}(\operatorname{Sym}^k U_N)$ tends to zero as $\min(N,k)\to\infty$. This settles the random matrix version of Harper's beyond square-root conjecture formulated by Wang and Xu, with no restriction on $k/N$. The proof is elementary and self-contained, combining exact weighted trace moments with a Gaussian change of measure. It also connects the result to the critical chaos model studied by Soundararajan and Zaman, also known as holomorphic multiplicative chaos.

comments
8 pages. Minor corrections and reformulations, some remarks added or corrected
fields
Number Theory, Probability
pdf ↗ page arXiv:2611.09753 ↗

We investigate the large-time behavior of nonnegative solutions to the time-fractional nonlinear diffusion equation $\partial_t^α(u-u_0) = Δu^m$, $0<α<1$, $m>0$, in a bounded domain with the homogeneous Dirichlet boundary condition. We prove that the rescaled solution $t^{\fracα{m}}u$ converges as $t\to\infty$ to an asymptotic profile $S$ characterized by $-ΔS^m = u_0/Γ(1-α)$. Moreover, we show that $t^αu^m$ converges to $S^m$, which admits an explicit representation in terms of the Green function and the initial datum. In contrast to the classical case $α=1$, the asymptotic profile depends explicitly on the initial datum.

comments
30 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.09858 ↗

In this paper, we consider arbitrary regular local ring $S$ and an ideal $J\subset S$ whose minimal primes are cohomologically complete intersection. In Section 2, using the Mayer-Vietoris spectral sequence, we construct examples of local cohomology modules $H^i_J (S)$, whose set of associated primes is finite, where minimal primes satisfy the `Dropping Condition'. As a special case, we show that when minimal primes of $J$ are part of a specific regular system of parameters satisfy the `Dropping Condition', the set of associated primes of $H^i_J (S)$ is finite. In Section 3, we prove the main result without the `Dropping Condition' and as a special case, we show that when minimal primes of $J$ are part of a specific regular system of parameters, the set of associated primes of $H^i_J (S)$ is finite. These examples of local cohomology modules include the cases whose associated primes can contain prime number $p$, but still the set is finite.

comments
8 pages, minor changes in the presentation, comments are most welcome
fields
Commutative Algebra
pdf ↗ page arXiv:2611.10064 ↗

Stochastic bilevel optimization provides a general framework for many machine learning applications, such as hyperparameter learning, data reweighting, language model alignment, and actor-critic reinforcement learning. However, most existing bilevel optimization methods treat matrix-valued gradients as flattened vectors and perform optimization in the resulting vectorized space, ignoring the matrix structures common in modern neural networks. Moreover, the lower-level (LL) problem curvature can induce significant spectral imbalance in the upper-level (UL) geometry. Such limitations of existing bilevel optimization methods motivate us to develop BiMuon, a geometry-aware stochastic bilevel optimization method that integrates implicit hypergradient estimation in bilevel optimization with Muon-style orthogonalized updates at the UL. To our knowledge, BiMuon is the first stochastic BLO method with Muon-style orthogonalized matrix updates and an $O(ε^{-4})$ iteration-complexity guarantee, matching the best-known rates achieved by Muon-type methods based on matrix parameterizations. To improve computational and parallel efficiency for models with multiple matrix parameters, we further study BiMuon for blockwise diagonal matrix approximation and derive a relative stepsize allocation rule based on UL progress and blockwise LL sensitivity. We evaluate BiMuon on representation learning and blockwise bilevel optimization, providing empirical support for our methods.

fields
Optimization and Control
pdf ↗ page arXiv:2611.10188 ↗

The commuting graph (CG) of a finite-dimensional Lie algebra over a field of characteristic zero forgets the linear structure, and a non-trivial center creates redundant vertices. We introduce linear structure graphs (LSGs), whose vertices are the nonzero vectors of a vector space and whose edge set is stable under linear operations. Each vertex generates a finite ascending sequence of subspaces, which defines its LSG-height; this height governs connectivity. We characterize LSGs of height at most 1 and show that the CG of a Lie algebra with trivial center has height at most 1 if and only if the algebra is a commutative transitive Lie algebra (CTLA). The reduced commuting graph (RCG) restricts the CG to a complement of the center; it is well defined up to LSG-isomorphism, preserves the connectivity, diameter and number of components of the CG, and is compatible with direct sums. Finally, we characterize almost abelian Lie algebras (AALAs) by their RCGs.

comments
32 pages, no figure
fields
Rings and Algebras, Combinatorics
pdf ↗ page arXiv:2611.10788 ↗

For any simple graph $G$ of order $n$, write its chromatic polynomial in the rising factorial basis as $P(G,x)=\sum_{j=0}^{n}(-1)^{n-j}c_j(G)x^{\langle j\rangle}$, where $x^{\langle j\rangle}=\prod_{i=0}^{j-1}(x+i)$ for $j\ge1$ and $x^{\langle 0\rangle}=1.$ Brenti (1992) introduced the $τ$-polynomial of $G$ and its augmented version, defined by $$τ(G,x)=\sum_{j=0}^n c_j(G)x^j~~~\text{and}~~~\overline τ(G,x)=\sum_{j=0}^n j!c_j(G)x^j.$$ He asked whether $τ(G,x)$ is always real-rooted and whether the coefficient sequence of $\overline τ(G,x)$ is always log-concave. In this paper, we prove that for every integer $d\ge4$, there exists an integer $h_d\ge3$ such that $c_2(G)^2<c_1(G)c_3(G)$ for every connected $d$-regular graph $G$ of girth at least $h_d$. For such graphs, the coefficient sequences of both polynomials fail log-concavity at $j=2$, and thus both polynomials have nonreal roots by Newton's inequalities. This gives counterexamples to both questions among connected regular graphs of arbitrarily large girth.

fields
Combinatorics
pdf ↗ page arXiv:2611.11056 ↗

The Rankin constant $γ_{n,k}$ measures the largest discriminant of a densest rank $k$ sublattice of a lattice in $\R^n$ over all such lattices of rank $n$ and their exact values are mostly open. For a general lattice $L\subset \R^n$ of rank $n$, the problem of determining its Rankin invariant $γ_{n,k}(L)$ is to find the discriminant of such a densest sublattice. There are no general formulas to compute the discriminant of any arbitrary rank $k$ sublattice. This paper specializes to the case of ideal lattices arising from ideals of number fields, and provides two approaches to study Rankin constants: first, we propose a systematic approach to approximate the minimum discriminant by introducing subideal lattices and proving a closed-form formula to compute $γ^{ideal}_{n,k}(L)$, the ideal Rankin invariant of the ideal lattice. Subsequently, we establish necessary conditions on the underlying number field for the existence of an ideal lattice admitting an optimal subideal lattice with a prescribed minimum discriminant. Secondly, we consider ideal lattices with arbitrary sublattices. We improve the current known bounds of the Rankin constants $γ_{5,2}$, $γ_{7,2}$ and $γ_{9,2},γ_{9,3},γ_{9,4}$, and provide an algebraic construction of the lattice that was used in these dimensions.

fields
Number Theory
pdf ↗ page arXiv:2611.11190 ↗

We strictly improve the Körner-Marton lower bound $\frac14\log \frac{9}{5}$ on the asymptotic rate of trifferent codes. We obtain this improvement by constructing non-perfect $(9,3)$-hash codes with rate above $\log(9/5)$ and then applying the Tetra-code construction, which gives $R_3\ge\frac14R_{9,3}$. More generally, for every $q\ge4$, we prove $R_{q,3}>B_{q,3}+\frac1{250000}$. We also extend the method to $(p,2,3)$-list recovery. For every $q\ge4$ and $0\le p<\frac{q-2}{12(q-1)}$, we prove $R_q^{\mathrm{LR}}(p)>B_q^{\mathrm{LR}}(p)$. Here $B_{q,3}$ and $B_q^{\mathrm{LR}}(p)$ denote the respective probabilistic lower bounds. For every fixed $0\le p<1/18$, the rate improvement is bounded below by a positive constant independent of $q\ge4$. For every fixed $0\le p<1/12$, we also obtain a positive rate improvement independent of $q$ for all sufficiently large $q$.

comments
18 pages
fields
Information Theory
pdf ↗ page arXiv:2611.11262 ↗

For bounded coherent complexes over the Raynaud ring, we establish natural Dieudonné isomorphisms between Ekedahl's biduality pieces $A_f^2$ and $A_{\SSpart}^1$, the nilpotent and semi-simple torsion of the Illusie–Raynaud cœur, and the corresponding parts of the finite torsion $t^1$ of Ekedahl's diagonal cohomology. In bidegree $(0,i+1)$, this torsion measures the non-smoothness of the $i$th flat Artin–Mazur formal group; hence all such groups are smooth for Mazur–Ogus varieties. For a smooth projective surface $S$, we describe the three possible dual pairs via the Galois module $\NS(\bar{S})[p^\infty]$ and the local-local and local-étale parts of the finite Picard quotient.

comments
14 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.11269 ↗

Instability phenomena are ubiquitous in multi-fluid flows. For binary fluid mixtures, phase separation may occur under specific conditions, in which a homogeneous state becomes unstable and spontaneously segregates into different phases, leading to the formation of distinct patterns. Furthermore, when a heavier fluid is superposed over a lighter one in a gravitational field, the fluid interface can be sensitive to perturbations that trigger the Rayleigh–Taylor (RT) instability, i.e., the lighter fluid penetrates upward into the heavier fluid against gravity. We investigate such instability phenomena and the inhibiting conditions for incompressible, immiscible two-phase flows with unmatched densities, within the framework of a diffuse-interface model, which is called the Abels–Garcke–Grün (AGG) model. More precisely, we adopt energy methods to establish several stability/instability conditions for the perturbed system of the AGG model, which is obtained by slightly perturbing the equilibrium profile $(\mathbf{0},\overline{\varphi})$, where $\overline{\varphi}=\overline{\varphi}(x_3)$ depends solely on the vertical coordinate $x_3$. Notably, for a constant equilibrium profile $\overline{\varphi}=α\in(-1,1)$ satisfying $Ψ''(α)<0$, we establish a threshold for stability and instability of the phase-separation problem. Similar stability results are also established for the perturbed system with $\overline{\varphi}$ satisfying the RT instability condition in the presence of gravity. In particular, if the phase-separation condition fails and $\partial_{x_3}\overline{\varphi}$ is a constant, a larger value of $\partial_{x_3}\overline{\varphi}$, a greater interfacial thickness and a higher surface energy density contribute to inhibiting RT instability.

comments
44 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.12298 ↗

We study the $θ$-intermediate dimension of the minimal set of the classical $C^{1+δ}$ Denjoy map, an orientation-preserving diffeomorphism of the circle not conjugate to a rigid rotation. This follows on from work of Kra and Schmeling, who showed how the box and Hausdorff dimensions may differ, depending on the Diophantine properties of the rotation number. The $θ$-intermediate dimension interpolates between these two dimensions. We use the well-understood gap structure of the irrational rotation map to develop a covering strategy to get upper bounds on the lower $θ$-intermediate dimension, and use results of Banaji to show that these upper bounds are sharp for $θ$ in an interval.

comments
41 pages, 4 figures
fields
Dynamical Systems, Number Theory
pdf ↗ page arXiv:2611.12323 ↗

The nontrivial zeros of the Riemann zeta function lie at the heart of analytic number theory. Through the explicit formulas, they govern the distribution of prime numbers: the closer all nontrivial zeros lie to the critical line $\Re(s)=\frac12$, the more uniformly the primes are distributed. The Riemann Hypothesis-asserting that all nontrivial zeros satisfy $\Re(s)=\frac12$-is equivalent to the optimal error bound $O(\sqrt{x}\log x)$ in the Prime Number Theorem. Beyond number theory, the zeros of $ζ(s)$ and its derivative $ζ'(s)$ are deeply intertwined: the horizontal distribution of $ζ'$-zeros near the critical line encodes information about the spacing of consecutive $ζ$-zeros. This paper establishes some results concerning the nontrivial zeros of the Riemann zeta function.

comments
There is an error in the proof of main results.
fields
Number Theory
pdf ↗ page arXiv:2611.12438 ↗

Let $d\geq 2$. For each $j\in \{1,\dots,d\}$, let ${\ell}_{j}\geq 1$ and $m_{j}\geq 2$ be integers, and let $a_{j}$ be a nonzero real number. We prove that the oscillatory integral operator \begin{equation*} T_{{\ell}_{1},\dots,{\ell}_{d},m_{1},\dots,m_{d}}f(x):=\int_{\mathbb{R}^{d}} e^{\dot{\imath} \left(a_{1}x^{{\ell}_{1}}_{1}y^{m_{1}}_{1}+\dots +a_{d}x^{{\ell}_{d}}_{d}y^{m_{d}}_{d} \right)}f(y)dy,\;\;\; x\in \mathbb{R}^{d}, \end{equation*} satisfies the restriction estimate \begin{equation*} \|T_{{\ell}_{1},\dots,{\ell}_{d},m_{1},\dots,m_{d}} f\|_{L^{2}(\mathbb{S}^{d-1})}\lesssim \|f\|_{L^{2}(\mathbb{R}^{d})}, \end{equation*} whenever \begin{equation*} \mathcal{U}:= \min{\left\{ \min_{1\leq j\leq d}{\frac{m_{j}}{{\ell}_{j}}},\,\min_{1\leq k\leq d}{\frac{d-1}{\sum_{j\neq k} \frac{\ell_{j}}{m_{j}}+\frac{2}{m_{k}}}}\right\}}>1, \end{equation*} and we necessarily have $\mathcal{U}\geq 1$.

fields
Analysis of PDEs, Functional Analysis
pdf ↗ page arXiv:2611.12463 ↗

We prove Motohashi's conjecture on primes of the form $u^2+v^2+1$, with Iwaniec's corrected constant. Let $b$ denote the characteristic function of the positive integers representable as a sum of two squares. Then, as $x\to\infty$, \[ \sum_{p\le x}b(p-1) =κ\Spr\frac{x}{(\log x)^{3/2}} +O\!\left(\frac{x}{(\log x)^{3/2}\sqrt{\log\log x}}\right), \] where $κ$ is the Landau–Ramanujan constant and $\Spr=\prod_{p\equiv3\,({\rm mod}\,4)}\bigl(1-1/(p(p-1))\bigr)$. The proof combines auxiliary prime factors with a mean square estimate for bilinear sums. We obtain the minor arc bound through harmonic switching and high moments, replacing arithmetic divisibility conditions by independent projective lines. We remove the auxiliary weights using Selberg's sieve.

comments
44 pages
fields
Number Theory
pdf ↗ page arXiv:2611.12467 ↗

Wolfe's method computes the point of minimum Euclidean norm in the convex hull of finitely many points. The method is parameterized by an insertion rule and it has been an open problem whether Wolfe's original rule guarantees a polynomial number of iterations (De Loera, Haddock, and Rademacher; STOC'18). We resolve this question by proving an exponential lower bound. In fact, we establish a tight connection to the simplex method for linear programming that allows us to transfer many lower bounds for simplex pivot rules to corresponding insertion rules of Wolfe's method. These include not only Wolfe's linopt rule via Dantzig's pivot rule, but also many other classical, randomized and history-based rules. As a corollary, we obtain the first exponential example for the Lawson-Hanson algorithm for nonnegative least squares, as well as PSPACE-hardness of deciding whether the linopt rule ever uses a given point.

comments
v2: Lean formalization archived at https://doi.org/10.5281/zenodo.24136107; author emails; minor corrections
fields
Optimization and Control
pdf ↗ page arXiv:2611.12680 ↗

We study local Fréchet regression for responses taking values in a metric space and predictors on a product of spheres of possibly different dimensions. We propose local constant and local linear estimators with factor-specific bandwidths and establish uniform convergence rates. We select sphere factors by comparing cross-fitted prediction risks for the full and leave-one-factor-out models. The procedure consistently recovers the active factor set, and the selected local constant and local linear estimators attain the same uniform convergence rates as if the active factor set were known. For univariate Wasserstein responses supported on a common compact interval, the uniform rate holds without an entropy condition on the response space. Simulations with scalar and spherical responses and analyses of vessel speeds and drifter speed distributions illustrate the methods.

comments
64 pages, 4 figures, 8 tables; supplementary material included
fields
Statistics Theory
pdf ↗ page arXiv:2611.13240 ↗

Vehicle traffic congestion is a persistent feature of urban transportation systems around the world. Importantly, congestion is in part a consequence of human decision-making: car traffic is reduced when people choose modes of transportation such as metro trains, buses, or trams, over cars, and it is amplified when there is a persistent social bias towards driving. The underlying feedback loop in which traffic levels influence transportation mode choices, which in turn affect traffic levels themselves, is poorly understood and we study its consequences in the presented work using a compartmental modeling approach. We first consider a simplified model of only car traffic and show that it predicts a hysteresis between congested and uncongested states, which is consistent with broader literature on on traffic modeling. Next, we add buses and trains to the model as alternative transit modes, confirm the existence of hysteresis in this generalization, and derive the relative trip completion rates of each mode. Finally, to account for decision-making, we take the demand rates for the different transit modes to be dynamic, closing the feedback loop between mode choice and utilization. This redistributes demand for each mode of transportation, highlighting that traffic conditions may be a key aspect of mode choice. Furthermore, our model predicts that increasing public awareness of congestion can be an effective control strategy to increase utilization of public transit. However, car-centric social norms must be sufficiently small, or car use is instead amplified.

comments
6 pages, 5 figures, submitted to ECC 2027 Conference
fields
Dynamical Systems
pdf ↗ page arXiv:2611.13265 ↗

Decision making in multi-robot systems often involves discrete decision variables, leading to NP-hard combinatorial optimization problems that must be solved within seconds for near real-time implementation. Denoising diffusion has emerged as a powerful tool for such problems, but existing approaches face a trade-off: Model-Based Diffusion (MBD) incorporates diffusion in sampling-based optimization (SBO) without training but only over continuous spaces, while existing diffusion-based combinatorial solvers operate over discrete spaces but require offline training. To this end, we propose Discrete Model-Based Diffusion (Discrete MBD), a training-free SBO method that directly optimizes discrete variables by approximating categorical reverse transition distributions through Monte Carlo sampling. We establish a finite-step lower bound on the probability of finding a global minimizer and show that this bound converges to one as the number of denoising steps increases. Extensive experiments on generic integer programs and heterogeneous multi-robot coalition formation and scheduling demonstrate that Discrete MBD outperforms SBO baselines in nearly all settings while achieving solution quality competitive with that of mixed-integer programming and reinforcement learning methods at a fraction of their computational cost.

comments
11 pages, 3 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.13382 ↗

In this note, we give a new proof of the uniqueness of generalized chordal and radial conformal restriction measures for $c\le 1$, where the $c<-2$ case is unproved before. Our approach (called the SLE arc test) is inspired by the completely conformally invariant (CCI) measure introduced by Lawler and Werner (2000), and also by Cai's recent Green's function test for the Brownian loop catcher (2026).

comments
18 pages. Minor changes on the last version
fields
Probability
pdf ↗ page arXiv:2611.13809 ↗

For a Tychonoff space $X$ and $p\in\{d,β,R,τ,σ,a\}$ let $M_p(X)$ be the space of discrete, compactly supported, Radon, $τ$-additive, $σ$-additive or finitely additive signed measures on $X$, regarded as a subspace of $M(βX)=C(βX)^*$ with the weak$^*$ topology, and let $M^+_p(X)$, $U_p(X)$ and $P_p(X)$ be its subsets of nonnegative measures, measures of norm at most one, and probability measures. In the companion paper it was shown that $M_p(X)$ is $C$-embedded in $M_q(X)$ iff it is $C^*$-embedded iff it is $G_δ$-dense. We show that $G_δ$-density of $Q_p(X)$ in $Q_q(X)$ is the same condition for all $Q\in\{M,M^+,U,P\}$, and that $C^*$-embedding of $Q_p(X)$ in $Q_q(X)$ implies $G_δ$-density, while the converse fails for $Q\in\{M^+,U,P\}$. We prove that $M^+_p(X)$ is $C^*$-embedded in $M^+(βX)$ iff $P_p(X)$ is $C^*$-embedded in $P(βX)$, that pseudocompactness of $P_p(X)$ implies pseudocompactness of all its powers, and that the unit ball $U_R(X)$ is $C^*$-embedded in $U(βX)$ iff $P_R(X)$ is pseudocompact. If $βX$ is $κ$-metrizable (e.g., a product of metrizable compact spaces or a compact group), then pseudocompactness of $P_p(X)$ and the $C^*$-embeddings of $P_p(X)$, $U_p(X)$ and $M^+_p(X)$ in $P(βX)$, $U(βX)$ and $M^+(βX)$ are equivalent to the $C$-embedding of $M_p(X)$ in $M(βX)$. Consequently, $P_τ(X)$ is pseudocompact for every pseudocompact dense subspace $X$ of a Tychonoff cube. This gives a space $X$ for which $P_τ(X)$ is pseudocompact while the space $P_R(X)$ of Radon probability measures is not, and answers a question of the first author.

comments
20 pages; companion paper to "C-embeddings of spaces of signed measures"
fields
General Topology
pdf ↗ page arXiv:2611.13857 ↗

Self-orthogonality and divisibility are two fundamental properties of linear codes, and the relationship between them has long been of interest. Huffman and Pless (2003) showed that every binary \(4\)-divisible code is Euclidean self-orthogonal, that a ternary code is Euclidean self-orthogonal if and only if it is \(3\)-divisible, and that a quaternary code is Hermitian self-orthogonal if and only if it is \(2\)-divisible. The general case remained open for a long time. In 2024, Li and Heng settled the odd-characteristic case, proving that every \(p\)-divisible code over \(\F_{p^m}\), with \(p\) odd, that contains the all-one vector is Euclidean self-orthogonal. In this paper we treat the even-characteristic case: we prove that every \(4\)-divisible code over \(\F_{2^m}\) containing the all-one vector is Euclidean self-orthogonal. We also prove that, for every prime \(p\), every \(p\)-divisible linear code over \(\F_{q^2}\), where \(q=p^m\), that contains the all-one vector is Hermitian self-orthogonal. In addition, we generalize the Hermitian criterion to the Galois self-orthogonal case, proving that any $p$-divisible linear code over $\gf_{q^r}$ that contains the all-one vector is $\ell$-Galois self-orthogonal for \(\ell\in\{1,\dots,r-1\}\). These criteria make the construction of self-orthogonal codes from divisible codes simple and efficient. As applications, we recover the known Euclidean and Hermitian self-orthogonality of generalized Reed–Muller codes and obtain several infinite families of new Euclidean and Hermitian self-orthogonal codes, which give rise to infinite families of quantum codes with excellent parameters.

comments
26 pages
fields
Information Theory
pdf ↗ page arXiv:2611.13963 ↗

Wireless federated learning (FL) suffers from two coupled bottlenecks: statistical heterogeneity across clients and communication-constrained model synchronization over unreliable wireless links. Instead of focusing on algorithmic design and/or wireless resource optimization, this paper provides a systematic study of pinching antenna (PA)-empowered FL for heterogeneous wireless networks and develops a unified communication-and-learning framework. Specifically, we integrate a segmented waveguide-enabled pinching antenna (SWAN) architecture with a heterogeneity-robust FL algorithm based on client variance reduction and dual quantization, so as to jointly mitigate communication bottlenecks and client drift. On this basis, we further develop a two-stage SWAN-assisted downlink protocol and formulate fairness-oriented uplink optimization problems for PA positioning, bandwidth allocation, and quantization design. Efficient solution frameworks are then derived for the resulting downlink and uplink optimization problems. Experimental results show the superiority of the proposed design in convergence speed and final accuracy under non-independent and identically distributed data and communication bottlenecks.

fields
Information Theory
pdf ↗ page arXiv:2611.13987 ↗

The time to solution of an iterative solver depends on the number of iterations and the cost per iteration. This paper develops algorithms that reduce both for elliptic problems discretized with high-order continuous finite elements on distributed GPUs, implemented in a unified matrix-free code supporting CUDA, HIP and SYCL. A distributed direct fast-diagonalization (FD) Poisson solver provides exact solutions on tensor-product meshes with direction-wise grading and coefficients varying along one coordinate direction. Its tensor data remain distributed, moved between slab layouts using collective transposes or kept in place by a Schur-complement approach. A two-level hybrid Schwarz preconditioner with FD cell solves (HS-FD) is extended to 2:1 hanging-node octrees with exact local cell inverses, while a p-multigrid preconditioner with Chebyshev–Jacobi smoothing (CJ-pMG) resolves hanging-node constraints at every level within fused kernels. Both approaches exploit FP32, where cell shapes and coefficients allow, within an FP64 conjugate-gradient iteration, adaptively select replicated or distributed coarse levels, support block solves for multiple right-hand sides and determine all parameters from the operator without case-specific tuning. Comparisons with Jacobi-preconditioned conjugate gradients (Jacobi PCG), MFEM, nekRS and deal.II span uniform, graded and octree meshes, layered coefficients, and four applications across NVIDIA, AMD and Intel GPUs. The direct solver is two to three orders of magnitude faster than Jacobi PCG on uniform meshes. HS-FD converges in 11 iterations for the generalised Poisson problem on octree meshes across 8 to 1024 MI250X graphics compute dies. These results provide practical guidelines for solver selection based on mesh structure and coefficient characteristics.

comments
69 pages (26 pages main manuscript, 43 pages Supplementary information)
fields
Numerical Analysis
pdf ↗ page arXiv:2611.14041 ↗

We study the equivariant geometric quantisation of a non-compact hypertoric orbifold of complex dimension $2n$ by compact symplectic cuts. When the defining arrangement has a non-empty bounded base region and the fixed lift is integral, we prove that, at every positive regular integral level $d$, the space of sections on the cut is the sum of the fibre-rotation weight spaces of weight at most $d$ in the original quantisation. The higher cohomology of the cut pre-quantum line orbibundle vanishes, so its equivariant index is the character of its actual section space. Using the moment polyptychs introduced in a companion paper (arXiv:2610.37724), we give an orbifold Kawasaki-Riemann-Roch localisation formula for this character. We also compute it as a weighted lattice-point sum: a residual weight $x$ occurs at level $d$ if and only if the arrangement slack function satisfies $\mathcal{S}(x) \leq d$, with multiplicity $\binom{d - \mathcal{S}(x) + n}{n}$. The examples compare these calculations in rank one, including a cut with an orbifold point, and in rank two, for smooth cuts that are not toric.

comments
28 pages, 5 figures. Part II of two; Part I is arXiv:2610.37724. v2: references added, minor corrections
fields
Symplectic Geometry
pdf ↗ page arXiv:2611.14090 ↗

We construct asymptotically good codes by evaluating Siegel modular forms at superspecial points on congruence towers of Siegel modular varieties. For every genus $g\ge2$ and every fixed weight $w\ge g+1$, the construction gives such a family in sufficiently large characteristic, over a finite field which is independent of the level of the tower. The towers can be chosen so that this field is $\mathbb{F}_{p^2}$. We give an explicit lower bound for the asymptotic rate. The lower bound for the relative minimum distance follows from the Pieri formula on the space of flags in the Hodge bundle and an intersection argument along its strata. We also prove that, for $p\ge5$ and $0\le w\le p+1$, the kernel of evaluation in every genus consists precisely of the multiples of the ordinary Hasse invariant. For $g=2,3$, the geometry of the supersingular locus gives explicit bounds for the relative minimum distance and recovery sets whose sizes are bounded independently of the level.

comments
26 pages, v2:Acknowledgments added
fields
Number Theory, Information Theory, Algebraic Geometry
pdf ↗ page arXiv:2611.14125 ↗

For coprime positive integers $m,n$ and $k\ge1$, we study the symmetric functions $e_k[-X^{m,n}Y]\cdot1$ arising from the elliptic Hall algebra action. We identify their $ω_X$-transforms with the normalized bigraded Frobenius characteristics computed by Boixeda Alvarez–Hameister–Ma for the torus-equivariant Borel–Moore homology of the positive parts of homogeneous affine Springer fibers. We introduce cyclic LLT polynomials and determine their monomial expansions, yielding explicit monomial formulas for these elliptic Hall algebra expressions in terms of cyclic parking functions. These results extend the affine Springer fiber identity and monomial formula of Carlsson–Mellit from integral slopes to arbitrary positive rational slopes.

comments
Updated reference
fields
Combinatorics, Algebraic Geometry
pdf ↗ page arXiv:2611.14177 ↗

We present linear codes with parameters [88,8,64]_7, [90,8,65]_7, [98,7,75]_8, [97,8,72]_8, [44,7,31]_9, [97,8,71]_7, [85,6,67]_8 and [78,8,56]_7. Each has a minimum distance one larger than the lower bound listed in Grassl's tables of best known linear codes; codes with parameters [89,8,64]_7, [96,8,71]_8, [95,8,70]_8, [94,8,69]_8, [77,8,55]_7 and [86,6,68]_8 follow. Seven of the eight codes are obtained from a quasi-cyclic code and a vector that is constant on each block, by Construction X with a repetition code. The remaining one, the [90,8,65]_7 code, is obtained from the first by appending two coordinates. The parameters and all weight counts were obtained by exhaustive enumeration, and a short program that repeats these computations is included.

comments
12 pages, 1 table. Ancillary files: verification program and generator matrices. v2: three more codes and two more derived codes added. Codes and programs archived at doi:10.5281/zenodo.24098667 doi:10.5281/zenodo.24098671 doi:10.5281/zenodo.24098673 doi:10.5281/zenodo.24112842 doi:10.5281/zenodo.24112844 doi:10.5281/zenodo.24132260 doi:10.5281/zenodo.24132262 doi:10.5281/zenodo.24136306
fields
Information Theory
pdf ↗ page arXiv:2611.14433 ↗

Competing risks arise when individuals may experience multiple mutually exclusive event types. Competing events are frequently treated as censoring and analysed using Kaplan–Meier (KM) methods, which overestimate real-world event risks. While the existence of KM overestimation is well known, its determinants, magnitude, and inferential properties remain poorly characterised. We develop a nonparametric framework that treats competing risks overestimation as a statistical quantity in its own right. We show that competing event frequency alone is insufficient to characterise KM overestimation and develop an event ordering theory describing how temporal event allocation influences overestimation. Based on these results, we derive a closed-form Total Overestimation Diagnostic (TOD) that quantifies total KM overestimation directly from routine survival analysis output. We establish exact error equivalence results for both cause-specific and total overestimation. In particular, Product Limit Error Equivalence shows that inference for TOD reduces exactly to ordinary overall survival estimation. Simulation experiments validate the theoretical results and show that independent censoring primarily affects precision rather than overestimation magnitude. Across six benchmark competing risks datasets, cause-specific overestimation is characterised by both total overestimation and temporal event allocation. These results provide a practical framework for assessing competing risks relevance and determining when cumulative incidence methods should be preferred to naïve KM risks. The proposed framework transforms competing risks overestimation from a qualitative warning into a measurable quantity that can be routinely quantified, interpreted, and incorporated into reporting practice.

comments
Submitted to Statistics in Medicine
fields
Statistics Theory
pdf ↗ page arXiv:2611.14457 ↗

We show that every projective clone homomorphism from a closed function clone containing the automorphism group of a countable homogeneous Ramsey structure $Δ$ in a finite relational language is uniformly continuous. This answers, for such structures, open questions previously raised by Barto, Bodirsky, Marimon, Pongrácz, and the second author in several papers (Bodirsky, Pinsker, Pongrácz, J. Symb. Log. 2021; Barto, Pinsker, SIAM J. Comput. 2020; Marimon, Pinsker, arXiv:2512.01086). Consequently, the polymorphism clone of a first-order reduct $Γ$ of $Δ$ admits a projective clone homomorphism if and only if $Γ$ primitively positively interprets all finite structures; in other words, this ability of $Γ$ is characterised by the absence of non-trivial identities in its polymorphism clone, a purely algebraic condition.

comments
10 pages
fields
Rings and Algebras, Logic
pdf ↗ page arXiv:2611.14490 ↗

We give three principal results on weighted order ideals, cluster coefficients, and block-statistic enumerators. First, in the rank-two annular exchange model, the frozen row $(2,-3)$ yields the specialized polynomial $1+q^2$, which is not unimodal. Its interpretation as a single-lamination counterexample to Theorem 14 of Kang, Lee and Lim (European Journal of Combinatorics, 2026) depends on identifying this row with the shear coordinates of a bridging curve in the same triangulation. We discuss this geometric correspondence using published annular examples; it is not established by the algebraic calculation or formalized in Lean. Second, the same polynomial fails log-concavity, and the frozen row $(1,-2)$ gives the full-support polynomial $1+2q+7q^2+10q^3+9q^4+4q^5+q^6$, likewise violating log-concavity. These calculations provide obstructions relevant to their Conjecture 1, subject to the same geometric identification. Third, for arbitrary finite skew Young diagrams, we prove the block-statistic identity of Kahane's Conjecture 4.7 (arXiv:2607.11225v2), using an explicit correction of the root convention. The proof uses commuting tableau-transfer matrices, a connected-block inverse kernel, and finite polynomial differential equations, with companion Lean 4/Mathlib formalizations. As a consequence, we obtain a bivariate block refinement that is coefficientwise nonnegative in $t-1$ after a common monomial shift in $q$.

code
github.com/adamtilepe/Annular_Obstructions_and_Skew-Shape_Block_Identities ∎ Lean project (lakefile.toml, lean-toolchain) does not build at e4727e4, checked 2026-11-13 build details
comments
Complete Lean 4 formalization available at this GitHub repository: https://github.com/adamtilepe/Annular_Obstructions_and_Skew-Shape_Block_Identities
fields
Combinatorics
pdf ↗ page arXiv:2611.14506 ↗

We solve the problem of Duffin and Schaeffer (1952) of characterizing those sequences of real frequencies which generate Fourier frames. Equivalently, we characterize the sampling sequences for the Paley-Wiener space. The key step is to connect the problem with de Branges' theory of Hilbert spaces of entire functions. We show that our description of sampling sequences permits us to obtain a classical inequality of H. Landau as a consequence of Pavlov's description of Riesz bases of complex exponentials and the John-Nirenberg theorem. Finally, we discuss how to transform our description into a working condition by relating it to an approximation problem for subharmonic functions. By this approach, we determine the critical growth rate of a nondecreasing function $ψ$ such that the sequence $\{\lamdda_k\}){k\in \Bbb Z}$ defined by $λ_k + ψ(λ_k)=k$ is a sampling.

code
github.com/joaquimortega/MR1923965 ∎ Lean project (lakefile.toml, lean-toolchain) builds, no sorry at c95e3eb, checked 2026-11-13 build details
comments
This is a corrected version produced after formalizing in Lean the published version. There is a correction of a mistake in the proof of Theorem 2 (ii) and fixing of minor typos. You can find the formalized version in https://github.com/joaquimortega/MR1923965/
journal
Ann. of Math (2), Vol. 155 (2002), no. 3, 789--806
fields
Complex Variables, Classical Analysis and ODEs
pdf ↗ page arXiv:math/0005092 ↗

Get each issue by email →