Paperlane

no. 9 · from the archive← Wed 4 Nov archive Fri 6 Nov →

Thursday, 5 November 2026

594 papers in 32 fields

Combinatorics49

Haussler's covering lemma (JCTA 1995) gives the sharp $(C/δ)^d$ metric-entropy bound for binary VC classes under normalized $\ell_1$ distance. We prove a sharp global dynamic analogue for bounded real-valued classes in normalized $\ell_p$, for every $1\le p<\infty$. Writing $d=\operatorname{sfat}_{\varepsilon/32}(\mathcal F)$, we obtain a global dynamic cover of size at most $(C/\varepsilon^p)^d$ for every horizon and $0<\varepsilon<1/2$. Here a single family of deterministic causal experts, fixed independently of the instance sequence, covers every target on every sequence. For $0<\varepsilon<1/4$, a matching worst-case lower bound $(c/\varepsilon)^{pd}$ holds already for binary classes on one fixed sequence, even with real-valued experts. The constants are universal, independent of $p$. For $p=2$, this resolves the horizon-independent sequential $\ell_2$ covering problem of Rakhlin, Sridharan, and Tewari (PTRF 2015) in a stronger global form. For $p=1$, it gives the sharp $(C/δ)^{\operatorname{Ldim}(\mathcal H)}$ global dynamic covering bound for binary classes, resolving questions of Alon, Ben-Eliezer, Dagan, Moran, Naor, and Yogev (STOC 2021) and Malliaris and Moran (Trans. AMS 2024). Our proof combines rank-decreasing correction schedules and accurate sampled prefixes with exact continuations after target identification. Shared-parent routing distributes these continuations among eligible prefixes, eliminating the logarithmic overhead.

comments
53 pages. Sharp asymptotic bounds unchanged. Strengthened fixed-class lower-bound construction, expanded technical overview, and clarified proofs
fields
Combinatorics
pdf ↗ page arXiv:2610.29898 ↗

We prove that every finite simple graph $G$ with maximum degree at least $750$ satisfies $χ(G)\le\max\{ω(G),Δ(G)-1\}$. The proof starts with a random partial colouring and completes it on large cliques using a list-colouring condition that remains valid as the rest of the graph is coloured. Disjoint stars provide the required colours. We estimate the number of stars that can be chosen after the clique colours have been exposed, while keeping their endpoint set fixed. A common exponential-moment argument reduces intervals of packing sizes to endpoint comparisons. More detailed neighbourhood estimates handle the remaining vertices. The final probability inequalities are verified by directed rational and interval arithmetic.

comments
55 pages: 24 pages of main text and references; 31 pages of appendices
fields
Combinatorics
pdf ↗ page arXiv:2611.05423 ↗

A graph is said to be $H$-free if it contains no subgraph isomorphic to $H$. The generalized Turán number $\mathrm{ex}(G, H)$, a natural extension of the classical Turán number, is defined as the maximum number of edges in an $H$-free spanning subgraph of $G$. For any integer $\ell\geq 2$, let $C_{2\ell}$ denote the even cycle of length $2\ell$. So far, extensive studies of the generalized Turán number for the hypercube $Q_{n}$ have been conducted. The $k$-ary $n$-cube is an important family of graphs with many favorable properties, such as regularity and vertex-transitivity. It generalizes the hypercube and reduces to the hypercube when $k=2$. In this paper, we investigate the generalized Turán number $\mathrm{ex}(Q^{k}_{n}, C_{2\ell})$ of $Q^{k}_{n}$ for all even integers $k\geq 4$ and integers $\ell\geq 2$, generalizing the result for $Q_{n}$ [J. Graph Theory 16 (1992) 273-286] from $k=2$ to $k\geq 4$.

fields
Combinatorics
pdf ↗ page arXiv:2611.05433 ↗

We further develop the theory of quantum stabiliser codes and its links with graph theory and finite geometry. We prove that an [[n,k,d]]_p stabiliser code over a finite field with p elements, p prime, gives rise to a graph on n-k vertices together with two disjoint independent sets of size k. Its edges are weighted with elements of a finite field of size p. If k=0, such codes are known as graph states. Second, we view stabiliser codes as so-called quantum sets of lines in projective space, allowing us to determined their minimum distance geometrically. We describe two geometrical operations to obtain new quantum sets of lines from given quantum sets of lines. As an application, we list the number of stabiliser codes up to equivalence, for given small parameters.

fields
Combinatorics, Information Theory
pdf ↗ page arXiv:2611.05489 ↗

A bicirculant is a regular graph that admits an automorphism having two vertex-orbits of the same size. A bicirculant can be described as follows. Given an integer $m \ge 1$ and sets $R, S, T \subseteq \mathbb{Z}_m$ such that $R=-R$, $T=-T$, $0 \not\in R \cup T$ and $0 \in S$, the graph $B(m;R,S,T)$ has vertex set $V=\{u_0,\dots,u_{m-1},v_0,\dots,v_{m-1}\}$ and edge set $E=\{u_iu_{i+j}| \ i \in \mathbb{Z}_m, j \in R\} \cup \{v_iv_{i+j}| \ i \in \mathbb{Z}_m, j \in T\} \cup \{u_iv_{i+j}| \ i \in \mathbb{Z}_m, j \in S\}.$ Some of the well known bicirculants include the generalized Petersen graphs and Cayley graphs of dihedral groups. In 1983, Brian Alspach proved that the only non-hamiltonian generalized Petersen graphs are $G(m,2)$ where $m \equiv 5 \pmod 6$. In a recent paper we conjectured that this is the only exception among regular connected bicirculants of degree at least two, and we have verified the conjecture for bicirculants with $|S|\le 3$. Results of Alspach, Chen and Dean imply that the conjecture also holds for all bicirculants with $m$ even and $\gcd(m,S)=1$. In this paper, we show that the conjecture holds for all bicirculants with $|S| \geq 4$ and $\gcd(m,S)>1$ such that $R\cup T$ contains an element that is not coprime to $\gcd(m,S)$ and, if $m$ is odd, is also not divisibile by $\gcd(m, S)$ or $R \cap T$ contains an element that is coprime to $\gcd(m,S)$.

comments
20 pages, 4 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.05531 ↗

Independence atom is a key concept in relational database theory. In the present paper, we prove that the maximum possible size of a non-redundant set of independence atoms on $n$ attributes is asymptotically $(1+o(1))\binom{n}{\floor{n/2}}$. It turns out that this problem is closely related to two extremal set theory problems, the Katona-Tarján question on ``V''-free families of subsets of $[n]$ for the lower bound, and Kleitman's bound on union-free families for the upper bound.

fields
Combinatorics
pdf ↗ page arXiv:2611.05568 ↗

The chromatic index $χ'(H)$ of a hypergraph $H$ is the smallest number of colors needed to color its edges so that no two adjacent edges share the same color. The chromatic index is trivially bounded below by the maximum degree $Δ(H)$, and when $χ'(H)= Δ(H)$, we say that $H$ is Class 1. It is well known that almost every 2-graph is Class 1, and we extend this result to 3-graphs. We show for $n^{-2/3-1/200}\leq p \leq 0.99$ that the $3$-uniform binomial random hypergraph $H\sim H_{n,p}^{(3)}$ is Class 1 with high probability. We also show that this result doesn't hold for uniformities above $3$. For a broad range of $p$, when $k \geq 4$ and $k \nmid n$, the hypergraph $H \sim H_{n,p}^{(k)}$ is with high probability not Class 1.

fields
Combinatorics
pdf ↗ page arXiv:2611.05622 ↗

The diameter graph of a finite set $S\subset\mathbb{R}^d$ has vertex set $S$ and two points are adjacent when their distance equals $\operatorname{diam} S$. In this paper we study the following question: given $k$ and $d$, is there a constant $c=c(k,d)$ such that from every finite point set $S\subset\mathbb{R}^d$ one can remove at most $c$ points so that the subgraph of the diameter graph induced by the remaining points is $k$-colorable? Brass conjectured that such a constant exists for $d=3$ and $k=3$. We prove this conjecture by showing that at most one point needs to be removed. We also answer a question of Dol'nikov, showing that for every positive integer $m$, there exist a finite point set $S\subset\mathbb{R}^3$ in which every subset of smaller diameter has less than $(|S|-m)/2$ points.

comments
16 pages, 4 figures
fields
Combinatorics, Metric Geometry
pdf ↗ page arXiv:2611.05631 ↗

Let $Q_p^d$ be the random subgraph of the $d$-dimensional binary hypercube obtained by retaining each edge independently with probability $p$. A long-standing folklore conjecture states that the emergence of the giant component in $Q_p^d$, at $p\approx 1/d$, is accompanied by the emergence of cycles of linear length. We confirm this conjecture and determine the order of the longest cycle near the phase transition. Specifically, for every sufficiently small constant $\varepsilon>0$, we show that if $p=(1+\varepsilon)/d$, then with high probability the longest cycle of $Q_p^d$ has length $Θ(\varepsilon^2 2^d)$. The dependence on $\varepsilon$ is optimal up to constant factors.

fields
Combinatorics, Probability
pdf ↗ page arXiv:2611.05634 ↗

We show how the group of Sprugnoli arrays on three elements can be used to define families of polynomials that are orthogonal on two intervals, and we indicate how the group can be extended in the hierarchy of Sprugnoli groups to yield families of orthogonal polynomials with more complex supports. In particular, we examine the defining three term recurrences and the Jacobi matrices of these families of orthogonal polynomials, while detailing the Sprugnoli matrix structure of the coefficient matrices of the polynomial families. We also consider integral representations of the principal moments on the defining intervals. Sprugnoli arrays are shown to relate to periodic recurrences where the parameters remain cyclically constant.

comments
27 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.05673 ↗

This paper initiates a systematic study of objects in convex geometry and toric algebraic geometry arising from status quo systems in social choice theory. Our main application is to classify all cones arising from a large class of status quo systems that are smooth or simplicial.

comments
17 pages; 7 figures; 2 tables; comments welcome!
fields
Combinatorics, Algebraic Geometry
pdf ↗ page arXiv:2611.05745 ↗

We extend cyclotomic Euler–Mahonian factorization to colored permutation groups for two inversion statistics: Biagioli–Zeng length and the inversion number of the underlying unsigned permutation. At a primitive $m$th root and rank $n=mk+i$, each normalized enumerator is a Hadamard product of a rank-$i$ colored enumerator and a weighted rank-$k$ type-B enumerator. Separate color variables are retained. The type-B factors agree for the two statistics, yielding equidistribution modulo the rank jointly with descent number, major index and negative-entry number. We also determine their exact changes under positive fixed-point insertion and obtain rational kernels retaining descent and major index. These kernels mark arbitrary fixed-point numbers and give derangement expansions at every inversion weight. Signed specializations recover type-A and type-B identities and give colored flag-major refinements. Inverse statistics and color-sum subgroups admit related insertion formulas.

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

Let $\mathcal{C}_k$ be the doubly-extended Reed–Solomon code with parameters $[q+1, k, q-k+2]_q$. We give a complete characterization of when its codewords of a fixed weight form $q$-ary 2-designs. The main ingredient is an exact criterion showing that the number of $r$-subsets of $\mathbb{F}_q^*$ with a prescribed product is independent of that product if and only if $\gcd(r, q-1)=1$. Applying this criterion to the minimum-weight codewords of $\mathcal{C}_k$, we prove that they form a $q$-ary 2-design if and only if $\gcd(k-1, q-1)=1$. We further establish a propagation result for MDS codes showing that the $q$-ary 2-design property at minimum weight implies the same property at every nonzero weight. Consequently, $\mathcal{C}_k$ holds $q$-ary 2-designs at all nonzero weights if and only if $\gcd(k-1, q-1)=1$.

comments
6 pages
fields
Combinatorics, Information Theory
pdf ↗ page arXiv:2611.05861 ↗

Epstein's put-or-take-a-square game is an impartial combinatorial game in which a player may, in each turn, add or subtract the largest square not exceeding the current integer. We study E. P. Stein numbers, the positions from which both legal moves lead directly to positive squares, and prove the following asymptotic formula for the counting function $S_2(X)$ of these positions: \[ S_2(X)=\frac{1}{π^2}X^{1/4}\log X+O(X^{1/4}). \]

comments
18 pages, 4 figures, 1 table
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2611.05898 ↗

Let $M$ be the adjacency matrix of a looped simple graph over $\mathbb{F}_2$ and let $t=\operatorname{diag} M$. We study the one-vertex lift with adjacency matrix $\left(\begin{smallmatrix}M+tt^T&t\\t^T&0\end{smallmatrix}\right)$. A looped circle graph is called stable if its lift is a circle graph. We prove that stability is equivalent to the existence of a pseudo-orientable bouquet realizing the given looped circle graph. We then obtain a finite excluded toggle-minor characterization by applying two rooted constructions to the known excluded pivot-minors for circle graphs. An exact enumeration yields $22$ minimal toggle-equivalence classes: one of order $5$, twelve of order $6$, and nine of order $7$. The enumeration is accompanied by independently checkable linear-algebra and minor certificates. Finally, we prove $q(G^\dagger;y)=yq(G;y)$ for the vertex-nullity interlace polynomial of every looped simple graph, and derive quasi-tree counting and real determinant formulas.

comments
25 pages; computational data and verification certificates included as ancillary files
fields
Combinatorics
pdf ↗ page arXiv:2611.05961 ↗

The odd and even symmetric Dellac numbers are the specializations $a_n=f_n(0)$ and $e_n=f_n(1)$ of the Randrianarivony–Zeng family $f_n(s)=2^{-n}D_n(s)$. Using a finite Stieltjes-fraction truncation, we establish the sharp congruence $v_3(a_n)=1$ for $n\ge2$ and obtain explicit congruences modulo $81$ for both sequences. We also establish universal eventual periodicity modulo arbitrary positive integers. For every integer $s\ge0$ and $k\ge1$, we give and analyse formulas for the \emph{least} eventual period of $f_n(s)$ modulo $3^k$ and its \emph{least starting index}. The period is governed by five linear factors in $s$; the onset follows a nine-class formula modulo $9$. In particular, for $k\ge3$ the even symmetric Dellac period is three times the odd period and begins one index earlier. The proofs combine a finite Stieltjes-fraction certificate, a graded $3$-adic pole expansion, and an explicit finite top-degree certificate over $\F_3$. Finite integer-arithmetic checks supplement the proofs. We also record the connection with the type-$B$ homogenized Linial arrangement.

comments
19 pages
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2611.05962 ↗

This paper investigates coherent configurations on 3-uniform hypergraphs constructed from strongly regular graphs. We establish that the hypergraph preserves the automorphism group of the original graph and induces a nonhomogeneous Schurian coherent configuration. Using the case of Petersen graph, we obtain a configuration with two fibers and thirteen basic relations. We further determine their valencies and nonzero intersection numbers, together with the corresponding adjacency matrix multiplication identities.

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

We view a $k\times n$ Latin rectangle as $n$ points in the grid $[n]^k$. Each symbol gives one point, whose coordinates are the columns it occupies. The rectangle is balanced when these points are pairwise equidistant in the $\ell_1$ metric. Its imbalance measures the distance from this ideal. We study the minimum imbalance from three sides. Constructively, we use a simulated annealing that moves symbols within rows and only penalises column clashes. Against the reference table of Voboril et al. (2025), it improves 33 of the 51 non-square values for $8\le n\le 13$, by up to 39.4%, and matches the rest. A cheap invariant, the row group, certifies that none of the 33 new rectangles is isotopic to rows of a group table, so the earlier column-swapping local search cannot reach any of them. Exactly, a computer-assisted branch and bound proves that the minimum imbalance of a $3\times 9$ rectangle is $56$. Díaz et al. found this value, but its optimality was open. A sharper pruning bound, derived from the identity $I=2\sum(d-t)^+$, reduces the search tree by a factor of $2.4$ to $3.3$ on the instances with $k\ge3$ that we solve. Asymptotically, the minimum imbalance is $Θ(n^3)$ for every fixed $k$. A pigeonhole argument gives a lower constant of order $k\,4^{-k}$, and random rectangles give an upper constant of order $\sqrt k$. For $k=2$, the limit of $\min I/n^3$ exists, a permuton attains it, and it lies between $4/375$ and $0.1196$. Perfect balance is an $\ell_1$-equilateral problem, so it forces $k=Ω(n/\log n)$ rows. For $2\times n$ rectangles, single two-minute annealing runs improve five of the seven six-hour MIP upper bounds for $14\le n\le 20$. Finally, the Lean 4 kernel checks every rectangle reported in this paper against a 74-line specification that imports only Lean's core library. We also prove the pigeonhole lower bound in Lean with Mathlib.

fields
Combinatorics
pdf ↗ page arXiv:2611.06003 ↗

A signed graph $(G,σ)$ is a graph $G$ with a signature $σ$ labeling each edge with a positive or negative sign. Two signatures of $G$ are switching equivalent if one is obtained from the other by sequentially changing the signs of all edges in an edge-cut. The frustration index of a signed graph $(G, σ)$ is the minimum number of negative edges among all signatures switching equivalent to $σ$. A signed graph is critically $k$-frustrated if it has frustration index $k$, and the removal of any edge decreases its frustration index. A critically $k$-frustrated signed graph is prime if it is irreducible and contains no two edge-disjoint negative cycles. Steffen and Naserasr et al. asked if there are only finitely many prime critically $k$-frustrated signed graphs for any positive integer $k$. The cases $k\leq 3$ were proved to be true by Cappello et al., and later, the cases $k=4$ and $5$ were verified by Z. Wang. In this paper, the author proves the conjecture by a topological argument.

fields
Combinatorics
pdf ↗ page arXiv:2611.06017 ↗

A long-standing and far-reaching conjecture of Cameron and Praeger (1993) asserts that no non-trivial block-transitive $6$-$(v,k,λ)$ designs exist. Huber (2010) reduced the Steiner case ($λ=1$) to a single infinite family of possible exceptions, where the automorphism group is $G=\PGaL(2,p^e)$ acting on the points of the projective line, with $p\in\{2,3\}$ and $e$ an odd prime power. In this paper, we resolve this final case. By combining orbit-stabiliser analysis for the action of specific involutions in $\PGaL(2,p^e)$ with the modular arithmetic constraints derived from the design parameters, we prove that no such Steiner 6-designs can exist for any admissible $q$. This completes the proof that the Cameron-Praeger conjecture is true for the important case of non-trivial Steiner 6-designs.

fields
Combinatorics, Group Theory
pdf ↗ page arXiv:2611.06081 ↗

A geodesic $P$ of a connected graph $G(V,E)$ is called a maximal geodesic if there exists no geodesic $P'$ in $G$ that contains $P$ as its sub-path. The geodesic transversal problem determines a subset $S\subseteq V(G)$ such that every possible maximal geodesic of $G$ includes at least one vertex of $S$. Such a set with minimum number of elements is called a gt-set and its cardinality is the gt-number of $G$. In this paper, we establish a general result, called the Geodesic Transversal lemma which provides a lower bound for the gt-number of an arbitrary graph $G$ in terms of the gt-number of its induced subgraphs. Using this lemma, we determine the gt-number of Butterfly and Hypercube networks.

fields
Combinatorics
pdf ↗ page arXiv:2611.06107 ↗

Extending a result of Thomassen, we prove that for every choice of positive integers $K\geq k$ there exist a $K$-strong digraph which has two disjoint sets $S,T$ each of size $k$ so that the only linkage from $S$ to $T$ in $D$ is the one whose existence follows from Menger's theorem.

fields
Combinatorics
pdf ↗ page arXiv:2611.06140 ↗

In this paper, we use permutations of the vertices of hypergraphs that preserve their adjacency matrices defined in banerjee 2021. These permutations form a group which lies between the automorphism group and the full symmetric group $S_n$ where $n$ is the number of vertices. Using elements from that group which are not automorphisms, we construct cospectral non-isomorphic hypergraphs. We use hypergraph structure coming from finite projective planes to show existence of infinitely many families of such hypergraphs. Also this method is very specific to uniform hypergraphs with uniformity greater than or equal to 3, i.e not applicable to graphs.

fields
Combinatorics
pdf ↗ page arXiv:2611.06199 ↗

In [Combinatorica 1996], Reed, Robertson, Seymour and Thomas proved Younger's conjecture dating back to 1973 that states that directed cycles have the Erdős-Pósa property. Specifically, they showed that every directed graph $D$ contains either $k$ arc-disjoint cycles or a set of at most $f(k)$ arcs that intersect every directed cycle. The function $f$, depending only on $k$, is however notoriously large–in fact, not even elementary. The first improvement on this function was only very recently provided by Hatzel, Kreutzer, Milani, and Muzi [FOCS 2024] who showed that $f$ can be taken to be an exponential tower of height $8$. In this work, we improve this function to $O(k^4)$ in the case where the digraph is Eulerian. This also answers an open question by Wahlström [Springer Monographs in Mathematics 2018] who asked explicitly when Eulerian digraphs have a polynomial Erdős-Pósa property. The only other known result about Erdős-Pósa on Eulerian digraphs is a result from Seymour [Combinatorica 1996] who showed that $f(k)=k$ when the Eulerian digraph admits a linkless embedding in 3-space, and such an equality is not possible for general Eulerian digraphs. We also complement our positive result, by showing that the result of Seymour cannot be extended to give a linear bound ($O(k)$) on general Eulerian digraphs, by showing that even on Eulerian digraphs the lower bound for the Erdős-Pósa property is $Ω(k \log k)$.

fields
Combinatorics
pdf ↗ page arXiv:2611.06250 ↗

We give three explicit unit-distance graphs in the plane with chromatic number 5 whose vertices lie in small disks: a graph with 773 vertices inside an open disk of radius 3/2, one with 5713 vertices inside an open disk of radius 5/4, and one with 8168 vertices inside an open disk of radius 23/20. The smallest examples previously reported for these radii have 11725, 11725 and 31171 vertices. All coordinates are exact elements of Q(sqrt3, sqrt5, sqrt11). In each case 5-chromaticity is certified by an explicit 5-colouring and a DRAT proof that no 4-colouring exists. The 773-vertex graph is vertex-critical.

comments
6 pages, 4 figures; ancillary files contain the graphs, 5-colourings and an exact verification script
fields
Combinatorics
pdf ↗ page arXiv:2611.06269 ↗

Supertoken graphs \(F^s_{k\times1}(G)\), also known as generalized token graphs, model configurations of \(k\) distinguishable tokens on a graph \(G\), with at most \(s\) tokens at each vertex. We study structural and metric properties of these graphs in terms of the base graph. For regular \(G\), we characterize when \(F^s_{k\times1}(G)\) is regular. We show that bipartiteness is inherited from \(G\) and characterize it for complete base graphs. For \(s\ge2\), we characterize connectedness and show that \(t\)-vertex-connectivity of \(G\) implies \(t\)-vertex-connectivity of the supertoken graph. We obtain exact diameter formulas in several regimes, including complete graphs and stars, and derive lower bounds and a conjectured formula for odd cycles. We also determine the clique number, give bounds and equality conditions for the chromatic number, and characterize planarity for complete base graphs.

fields
Combinatorics
pdf ↗ page arXiv:2611.06275 ↗

A digraph is $k$-quasi-transitive if the endpoints of every directed path of length $k$ are adjacent. In this paper, we prove that every strong non-bipartite $k$-quasi-transitive digraph of diameter at least $k+2$ is Hamiltonian when $k\ge7$ is odd. Moreover, combined with the known even case, for $k\ge6$, we also prove that a strong bipartite $k$-quasi-transitive digraph of diameter at least $k+2$ is Hamiltonian if and only if it has a cycle factor. These answer two problems posed by Alva-Samos and Hernández-Cruz affirmatively [Journal of Graph Theory \textbf{96} (2021) 310–325].

fields
Combinatorics
pdf ↗ page arXiv:2611.06310 ↗

In 1989, Gyárfás conjectured that the vertex set of every $r$-edge-coloured complete graph can be partitioned into at most $r$ monochromatic paths. The case $r=2$ follows from a theorem of Gerencsér and Gyárfás, and Pokrovskiy proved the conjecture for $r=3$. Recently, Li and Wang disproved the conjecture for all sufficiently large $r$, leaving open the smallest number of colours for which it fails. We show that this number is four. For every integer $n\geq118$, we construct a four-edge-colouring of $K_n$ in which every monochromatic path partition contains at least five paths. We also construct, for every integer $n\geq60$, a four-edge-colouring of $K_{n,n}$ in which every monochromatic path partition contains at least eight paths, disproving Pokrovskiy's conjectured bound $2r-1$ for balanced complete bipartite graphs when $r=4$.

fields
Combinatorics
pdf ↗ page arXiv:2611.06362 ↗

We introduce and study \emph{constant-sum gap partitions}: for a fixed nonnegative integer $C$, these are partitions $λ=(λ_1,\ldots,λ_k)$ whose successive differences $d_i=λ_{i+1}-λ_i$ satisfy $d_i+d_{k-i}=C$ for all valid $i$. We derive the generating function for this family, treating partitions of odd and even length separately, and compute it explicitly for $C=0, 1,2,3,4$. We then construct explicit bijections between constant-sum gap partitions with $2m+1$, respectively $2m$, parts and partitions into odd, respectively even, parts in which parts below the largest part have bounded multiplicity, together with an exact weight relation between a partition and its image. Finally, we give a geometric characterization of constant-sum gap partitions in terms of their Ferrers diagrams: removing a prescribed, linearly growing number of cells from each row renders the diagram symmetric about its middle row, for both the odd- and even-length cases.

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

We develop normalized abacus combinatorics for affine type \(C\). We also give explicit product formulas for the number of Scopes classes at every level and every positive depth in affine types \(A\) and \(C\).

comments
40 pages, comments welcome;
fields
Combinatorics
pdf ↗ page arXiv:2611.06419 ↗

We study balanced cycles in regular multipartite tournaments. A cycle in a $c$-partite tournament is $k$-balanced if it contains exactly $k$ vertices from each partite class. We prove that there exists an absolute integer $r_0$ such that every regular $c$-partite tournament with each partite class size of $r\ge r_0$ contains a $k$-balanced cycle for every $1\le k\le r$ when $c=3$ or $c\ge5$, and for every $2\le k\le r$ when $c=4$. In particular, our result confirms three conjectures of Volkmann and Winzen for large regular multipartite tournaments. We also confirm Yeo's conjecture on the existence of $(p,q)$-cycle factors for large regular $c$-partite tournaments $G$ with $c\ge4$, where a $(p,q)$-cycle factor is a pair of vertex-disjoint cycles of lengths $p$ and $q$ spanning $G$.

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

Let $d_1,\dots,d_m$ be directions in $\mathbb{R}^k$, where $k\ge 2$. A multiset $X$ of $n$ points of $\mathbb{R}^k$ projects to the $m$ multisets of numbers $\{\{x\cdot d_j : x\in X\}\}$, or equivalently to the $m$ sorted lists of these numbers. How many directions are needed for these projections to determine every multiset of $n$ points? Two simple bounds are known in every dimension: more than $(k-1)\log_2 n$ directions are always needed, and $(k-1)n+1$ directions in general position always suffice. In the plane much more is known: Matousek, Privetivy and Skovron showed that almost every choice of $O(\log n \log\log n)$ directions suffices. Whether anything similar holds in higher dimensions was left open by Dym, Wellershoff, Tsoukanis, Levy and Balan. We observe that two lemmas of Hair and Sahai, proved for list recovery of random linear codes, answer that question, and by tightening their argument we show that in every dimension almost every choice of $(4k-2)\ln(2n)\ln(k\log_2 2n)+k+1$ directions suffices. For $k\le 10$ this beats the linear bound once $n$ is larger than about 100: for example, 144 directions suffice for multisets of 1000 points in the plane, and an exact computation lowers this to 133. Letting some of the random blocks in their argument fail removes a factor $\log k$: almost every choice of $O(k\log n\log\log n)$ directions suffices, uniformly in $k$ and $n$. We also show that $2k-1$ directions never determine three points, so that the logarithmic lower bound is not tight; that every $m$ directions in the plane fail on some pair of multisets of size $O(1.78^m)$, improving the bound $O(1.80^m)$ of Matousek, Privetivy and Skovron; and that for each $k$, $m$ and $n$, either almost every choice of $m$ directions works or almost none does.

comments
28 pages, 5 figures
fields
Combinatorics, Information Theory
pdf ↗ page arXiv:2611.06470 ↗

We study the maximum number ${\rm SM}(n)$ of stable matchings in an instance with $n$ men and $n$ women. Karlin, Oveis Gharan, and Weber (STOC 2018) proved the first single-exponential upper bound; their argument gives ${\rm SM}(n)\le 2^{17n}$ for sufficiently large $n$. Palmer and Pálvölgyi (FOCS 2021) improved this bound to $3.55^n+O(1)$. We prove that ${\rm SM}(n)<2.81^n$. This brings the exponential base closer to $2.28$, the base of the best known lower bound. More precisely, we bound the number of stable matchings in each instance in terms of each person's number of stable partners, where a stable partner is someone matched to that person in at least one stable matching. Our proof assigns each person a weight determined by this number and uses these weights to bound the number of stable matchings by induction.

fields
Combinatorics
pdf ↗ page arXiv:2611.06494 ↗

Let $G$ be a finite group and $H$ be a subgroup of $G$. In our earlier work, we proved that the quasi-strongly regular Cayley graph $Γ_H(G)$ is integral whenever $H$ is normal in $G$, and raised the question of whether the converse also holds. In this paper, we answer this question affirmatively. We prove that if $Γ_H(G)$ is integral, then $H$ must be a normal subgroup of $G$. Consequently, $Γ_H(G)$ is integral if and only if $H\lhd G$. Our proof uses the irreducible representations of $G$ and the dimensions of their $H$-fixed subspaces. For a non-normal subgroup $H$, we construct a two-dimensional invariant subspace of a suitable representation operator and show that the corresponding eigenvalues are irrational.

comments
10 pages
fields
Combinatorics, Group Theory
pdf ↗ page arXiv:2611.06581 ↗

We study Motzkin paths satisfying the red-blue rule introduced by Wu, Eu, Ku and Shih. We answer their Question 8.5 and exhibit two new Baxter structures. Let $\mathcal M_m$ denote the set of such paths of length $m$ and $a_m=|\mathcal M_m|$. We give a combinatorial proof of \[ a_{2n-1}=\mathrm{A005802}(n),\qquad a_{2n}=\mathrm{A216947}(n) \qquad (n\geq 1). \] For the odd subsequence, we construct a bijection with $1234$-avoiding permutations which sends the initial up and terminal down runs to the initial decreasing runs of a permutation and its inverse. The boundary correspondence arising from this bijection further identifies red-blue Motzkin paths of length $2n$ with $1234$-avoiding permutations of length $n+1$ in which $1$ occurs to the left of $2$. We establish parallel binomial decompositions of this restricted permutation class and of $2$-colored noncrossing set partitions. The two decompositions have the same binomial coefficients, and their respective cores are explicitly in bijection with non-intersecting triples of lattice paths, a classical Baxter family. This establishes the even identity. Moreover, we construct a second bijection between odd-length red-blue Motzkin paths and $1234$-avoiding permutations. Under this bijection, splitting a path at its ground-level blue horizontal steps corresponds to the skew decomposition of the associated permutation.

comments
51pages,8 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.06599 ↗

We study the problem of determining the maximum number of stable matchings. This classical counting problem was posed by Knuth and has been studied for five decades. We obtain a new $2.999^n$ upper bound on the number of stable matchings with $n$ men and $n$ women. This improves the best-known previous result by Palmer and Pálvölgyi. This result gets much closer to the well-known lower bound $\frac{2.28^n}{\text{poly}(n)}$. We refine their entropy-based framework by capturing broader structural relationships among stable matchings. To capture these relationships, we introduce new frameworks, including cones and supports. This establishes the $3.332^n$ bound. We also exploit relationships among local structures and use a charging argument to improve the bound to $2.999^n$.

comments
56 pages, 12 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.06604 ↗

Concepts of avoidable paths and inherent two-rooted graphs were recently introduced for the case of induced subgraphs. In this paper, we translate this framework to the setting of not necessarily induced (NNI) subgraphs, where the structural constraints, as well as conclusions, are significantly relaxed. We develop a new sufficient condition for inherence, and use it to provide complete characterizations of inherent two-rooted paths and forks. We show that for these families, the obvious necessary condition for inherence from the induced case is sufficient in the NNI setting. To complement these results, we introduce two general methods for proving non-inherence and apply them to demonstrate the non-inherence of several classes of two-rooted trees. Keywords: subgraph, two-rooted graph, two-rooted tree, avoidable two-rooted graph, inherent two-rooted graph

fields
Combinatorics
pdf ↗ page arXiv:2611.06636 ↗

The classical Gyárfás-Sumner conjecture asserts that for any fixed forest $F$, any graph $G$ not containing $F$ as an induced subgraph, with bounded clique number $ω(G)$, has bounded chromatic number $χ(G)$. Recently, Nguyen, Scott, and Seymour proved that every such graph has chromatic number at most $|G|^{o(1)}$. We improve this bound to a polylogarithmic one $(\log |G|)^{O(1)}$.

fields
Combinatorics
pdf ↗ page arXiv:2611.06699 ↗

We study graphs admitting a strictly matched involution, i.e., graphs for which a strictly matched involution exists. A strictly matched involution of a graph $G$ is a self-inverse graph automorphism $f$ with the properties that the fixed point set of $f$ induces a complete subgraph in $G$ and, for the vertices that are no fixed points, every vertex is connected to its image under $f$ by an edge. Andres, Huggan, Mc Inerney, and Nowakowski (2019) determined upper and lower bounds for the number $A(n)$ of graphs admitting a strictly matched involution on $n$ vertices. We improve the upper bound and we compute the exact values for the number $A(n)$ for all $n\leq11$. Furthermore, we use combinatorial enumeration techniques and a decomposition lemma to determine the number $C(n,m)$ of graphs admitting a strictly matched involution with $n$ vertices and $m$ edges for several infinite classes of pairs $(n,m)$.

comments
27 pages, 5 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.06703 ↗

In this paper, we provide an infinite family of counterexamples to Tokareva's conjecture on sums of two bent functions. The conjecture states that every Boolean function in an even number of variables $n$ of algebraic degree at most $n/2$ can be written as the sum of two bent functions. We show that for every $n=2^k\geq 8$, the symmetric function $F_n=1+σ_2+σ_4+σ_6+\cdots+σ_{n/2}$ has degree $n/2$ and cannot be written as a sum of at most two bent functions. Here $σ_j$ is the elementary symmetric Boolean polynomial of degree $j$. Furthermore, we show that the eight-variable member of this family can be represented as the sum of exactly three bent functions. Using the connection between bent-sum decompositions and derivatives of bent functions, we also obtain an infinite family of balanced Boolean functions that cannot be derivatives of bent functions.

comments
18 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.06744 ↗

We prove Conjecture 4 of Chan, Chang, Gao, Kisfaludi-Bak, Le, and Zheng (SoCG 2026): for every fixed integer $r\ge0$, the radius-$r$ neighbourhoods of a unit-cube graph in $\mathbb{R}^3$ have bounded VC-dimension. Our bound is $2^{2^{O(r)}}$, independent of the number of vertices. The main ingredient is a VC-dimension bound for reachability through arbitrary fixed-length sequences of three-dimensional generalized dominance relations. Its proof uses groups ordered in two coordinates, with neighbouring groups acting as barriers that preserve this invariant when one layer is removed. Combining these bounds with the existing interval-representation framework, we obtain a Las Vegas algorithm that, for every fixed integer $Δ\ge1$, decides whether a graph given by $n$ cube centres has diameter at most $Δ$ in expected $O_Δ(n^{2-\varepsilon_Δ})$ time, for an explicit constant $\varepsilon_Δ>0$. Finally, for every integer $r\ge7$, we construct unit-cube graphs with rational centres whose radius-$r$ neighbourhoods have VC-dimension $Ω(r^3)$.

comments
30 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.06747 ↗

Let $B_k$ denote the book consisting of $k$ triangles sharing a common edge. We prove that there exist absolute constants $ρ>0$ and $N$ such that, for every pair of integers $n,k$ with $n\ge N$ and $2\le k\le ρn$, writing $n=5q+r$ with $0\le r<5$, \[ \operatorname{ex}(n,C_5,B_k)=q^{\,5-r}(q+1)^r, \] with the balanced complete $C_5$-blow-ups as the only extremal graphs. The linear order of this range is best possible since for all sufficiently large $n$, the formula fails whenever $k\ge0.14n$.

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

Let $M(m,n)$ and $N(m,n)$ denote the numbers of partitions of $n$ with crank $m$ and rank $m$, respectively. Ji and Zang proved that the crank sequence $(M(m,n))_{|m|\le n-1}$ is unimodal for every $n\ge44$. Bringmann, Man, and Rolen subsequently established the unimodality of the rank sequence $(N(m,n))_{|m|\le n-2}$ for every $n\ge39$. Ji and Zang also conjectured that $(M(m,n))_{|m|\le n-71}$ is log-concave for every $n\ge72$, and that $(N(m,n))_{|m|\le n-72}$ is log-concave for every $n\ge73$. In this paper, we prove both conjectures.

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

We give an $O_H(n^5)$-time algorithm to test whether an $n$-vertex labeled tour graph has a full immersion isomorphic to a labeled tour graph $H$. A labeled tour graph is a connected $4$-regular graph whose edges are labeled by binary vectors of fixed length. To obtain a full immersion, a vertex may be removed only by pairing up its four incident edges and "splitting off" both pairs, summing the labels within each pair. Even for one-bit labels, no polynomial-time algorithm was previously known for arbitrary fixed $H$. Our main tool is of independent interest: we give an algorithmic min-max theorem that, in particular, characterizes the maximum number of odd-length circuits in a rooted circuit decomposition of an Eulerian graph. Our results have implications for vertex-minors, whose study is motivated by applications in quantum networking, connections with graph minor theory, and the goal of developing an irrelevant vertex technique for dense graphs. For vertex-minors, circle graphs play the same role as planar graphs do for graph minors. As a corollary of our main theorem, we obtain a fixed-parameter tractable algorithm for apex-vertex-minor testing in $k$-apex circle graphs. We also prove an irrelevant vertex theorem for such graphs of large rank-width. More broadly, our results are essential to forthcoming work of three of the authors proving a structure theorem for graphs with a forbidden vertex-minor. There, our min-max theorem plays the role of both the algorithmic $A$-paths and Two Paths Theorems.

fields
Combinatorics
pdf ↗ page arXiv:2611.06776 ↗

A graph class $\mathcal{C}$ is monadically dependent if one cannot interpret all graphs in vertex-colored graphs from $\mathcal{C}$ using a fixed formula of first-order logic. We prove that every monadically dependent graph class has almost bounded merge-width, thereby confirming a conjecture of the first and the last author [STOC '25]. Our proof is algorithmic and the witnessing decompositions in the form of merge sequences can be computed in nearly-cubic time. This is a step towards the proof of fixed-parameter tractability of model checking first-order logic on monadically dependent graph classes, which is achieved in a companion paper.

fields
Combinatorics, Logic
pdf ↗ page arXiv:2611.06804 ↗

The \textit{boxicity} of an undirected graph $Γ$, denoted as $\operatorname{box}(Γ)$, is the smallest non-negative integer $d$ such that $Γ$ can be represented as the intersection graph of axis-parallel rectangular boxes in $\mathbb{R}^d$. The \emph{power graph} of a group $G$, denoted as $\operatorname{Pow}(G)$, is an undirected graph whose vertex set is the group itself, with two elements being adjacent if one is a power of the other. We determine the exact boxicity of power graphs of finite nilpotent groups. For a cyclic group of order $n=\prod_{i=1}^{r}p_i^{e_i}>1$, where the $p_i$ are distinct primes, we prove that its power graph has boxicity $\sum_{i=1}^{r}e_i-\max_i e_i$. For a finite nilpotent group $G$, let the number of noncyclic odd Sylow subgroups be denoted by $t(G)$. If $G$ has odd order or if $G$ has a cyclic Sylow $2$-subgroup, then $\operatorname{box}(\operatorname{Pow}(G))=\operatorname{box}(\operatorname{Pow}(\mathbb{Z}_{\operatorname{exp}(G)}))+t(G)$, where $\operatorname{exp}(G)$ denotes the \emph{exponent} of a group $G$. When the Sylow $2$-subgroup is noncyclic, and the odd part is nontrivial, the boxicity equals this value or one more, and we characterise precisely when each of these values is attained. The boxicity of power graphs of arbitrary finite groups and the exact boxicity of the comparability graph of the Boolean lattice were posed as open questions in Discrete Mathematics, 349(7):115017, 2026. As a consequence of our results, we answer the latter question completely and the former question partially, by computing the exact boxicity of the power graphs of nilpotent groups.

comments
28 pages
fields
Combinatorics, Group Theory
pdf ↗ page arXiv:2611.06816 ↗

A fault-tolerant (FT) connectivity oracle for an $n$-vertex graph $G=(V,E)$ determines whether $G- F$ is connected for any query set $F\subseteq E$. When the number of failures is unrestricted, prior constructions exhibited a sharp contrast between randomization and determinism: randomized oracles use only $\widetilde{O}(n)$ space [Duan and Pettie, SICOMP 2020], whereas no deterministic construction was known to improve upon storing $G$ explicitly, requiring $Θ(n^2)$ bits in the worst case. The promise that $F\subseteq E$ is essential for subquadratic space: allowing arbitrary queries $F\subseteq V\times V$ forces quadratic space. For queries containing at most $f$ failures, Khanna, Konrad, and Putterman [SODA 2027] recently constructed deterministic oracles using $\widetilde{O}(\sqrt{f}n)$ space that also report approximate distances with polylogarithmic stretch. Their result improves upon the classical $O(fn)$ space bound for deterministic connectivity oracles [Pătraşcu and Thorup, FOCS 2007], but offers no space savings over storing $G$ when $f=Θ(n^2)$. We present the first deterministic connectivity oracles with subquadratic space for failure sets of unrestricted size, using $\widetilde{O}(n^{7/4})$ space. We also establish the first polynomial separation between deterministic and randomized connectivity oracles, proving that every deterministic oracle requires $\widetildeΩ(n^{3/2})$ bits in the worst case. For queries containing at most $f$ failures, we obtain deterministic connectivity oracles using $\widetilde{O}(f^{2/5}n)$ space, improving the dependence on $f$ in the bound of Khanna et al., and prove a lower bound of $\widetildeΩ(f^{1/4}n)$ bits.

fields
Combinatorics
pdf ↗ page arXiv:2611.06857 ↗

A conjecture of Frankl proposed in the 1980s states that for $n\ge2d$, every Sperner family $\mathcal{F}\subseteq 2^{[n]}$ of VC-dimension at most $d$ has at most $\binom{n}{d}$ members. We prove this conjecture for every fixed $d$ and large $n$, and show that equality holds only when $\mathcal{F}$ is $\binom{[n]}{d}$ or $\binom{[n]}{n-d}$.

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

Given graphs $F$ and $H$, the induced Ramsey number $r_{\mathrm{ind}}(F,H)$ is the smallest integer $n$ for which there exists a graph $G$ on $n$ vertices such that every red-blue colouring of $E(G)$ contains either a blue induced copy of $F$ or a red induced copy of $H$. A conjecture of Kohayakawa, Prömel and Rödl asserts that, for every fixed graph $F$, this number is polynomial in $v(H)$. We prove this conjecture, showing that there is an absolute constant $C > 0$ such that $$r_{\mathrm{ind}}(F,H) \leq v(H)^{Cv(F)^2}$$ for all graphs $F$ and $H$. The proof combines a variant of a random geometric construction of Kohayakawa, Prömel and Rödl with the hypergraph container method.

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

Optimization and Control32

We present Scaly, an open-source optimizing compiler for optimal control, written in Python, that generates fast C code. Scaly provides a modeling language embedded in Python for the parametric optimization problems that arise in model predictive control and moving horizon estimation, and computes the sparse derivatives that standard optimization solvers need. Scaly accepts general nonlinear programs but applies optimizations specific to optimal control, which preserve the repeated structure of a problem, such as the stages of a horizon, through differentiation down to the generated loops. The generated C depends only on the C math library and never allocates memory dynamically. On three benchmark problems, Scaly evaluates the Hessian of the Lagrangian up to 26 times faster than CasADi, with smaller binaries and build times that stay nearly constant with the horizon. With the same solver, Scaly shortens the solver time per control step on every benchmark, by a factor of up to 9.

fields
Optimization and Control
pdf ↗ page arXiv:2610.41762 ↗

Montanari's incremental approximate message passing (IAMP) algorithm [FOCS 2019; SIAM J. Comput., 2025] and the zero-temperature formulation of El Alaoui, Montanari and Sellke (AMS) [Ann. Probab., 2021] find a $(1-\varepsilon)$ approximation to the maximum Sherrington-Kirkpatrick (SK) energy in $C(\varepsilon)N^2$ operations for fixed accuracy, with probability tending to one as $N\to\infty$, under their respective full-support and access-model assumptions. However, it was unknown whether this approximation could be achieved with work polynomial in both $N$ and $1/\varepsilon$, together with quantitative guarantees at finite dimension. Under the same assumptions as AMS, we introduce grouped IAMP with exact Gaussian query outputs (GEG-IAMP), which is the first SK approximation algorithm with total work polynomial in $N$ and $1/\varepsilon$ and a finite-size guarantee above a dimension threshold polynomial in $1/\varepsilon$ and $\log(1/α)$. More precisely, for every $α\in(0,1/2)$, it returns a $(1-\varepsilon)$ approximation with probability at least $1-α$ whenever $N\ge \mathsf{K}\varepsilon^{-2}\log^2(e/\varepsilon)\log(\mathsf{K}/α)$, using $O(N^2/\varepsilon)$ work and $O(N^2)$ storage. GEG-IAMP replaces the Onsager correction by Reeves's coupling construction [arXiv:2508.10782] and groups Euler-Maruyama steps into $O(1/\varepsilon)$ matrix-vector products. We also prove a relative guarantee for AMS IAMP with $O(N^2\varepsilon^{-3}\log^2(e/\varepsilon))$ work but a sufficient dimension exponential in inverse accuracy. By returning a fixed configuration below its dimension threshold, GEG-IAMP also provides an asymptotic fully polynomial randomized approximation scheme (AFPRAS), with an additive error independent of dimension.

fields
Optimization and Control, Probability
pdf ↗ page arXiv:2611.05446 ↗

Generalized disjunctive programming (GDP) describes process design alternatives with Boolean variables, disjunctions, and logical propositions, and fixing one configuration leaves a subproblem in the continuous variables. Conventional GDP methods require explicit equations, which a simulator may not expose, and mixed-integer nonlinear programming (MINLP) reformulations can be intractable for nonconvex models. The external-variable reformulation turns configuration choice into an optimization over an integer lattice whose objective is the subproblem value, which derivative-free optimization (DFO) can search while the GDP model continues describing the alternatives. We pair GDP models with surrogate DFO methods and the direct-search method NOMAD and compare them with discrete steepest descent (D-SDA), logic-based and MINLP solvers, and enumeration on nine process models, 21 test functions, a pharmaceutical flowsheet simulated in PharmaPy, and a catalytic distillation column with 100,947 configurations. On the largest reactor network, the surrogate methods MISO and RBFOpt reach the reference in nine or ten of ten runs with about 30 subproblem solves, whereas logic-based methods solve nearly one subproblem for each admissible configuration and most D-SDA descents end at one local minimum. In the flowsheet example, where GDP solvers do not apply, RBFOpt and MISO find the best of 36 simulated configurations in every run with 20 evaluations. For the catalytic column, D-SDA and MISO reach the best known design with 100 evaluations, whereas MINLP solvers find no design within 15% of it and global solvers return contradictory certificates. This search pays off when the configuration space is too large to enumerate, has deceptive local minima, or has MINLP reformulations that fail, and enumeration or a direct reformulation is simpler for small algebraic models.

fields
Optimization and Control
pdf ↗ page arXiv:2611.05508 ↗

In this paper, we provide tight lower bounds for minimizing high-order Hölder-smooth and uniformly convex functions when their orders match. Specifically, we consider functions whose $p^{th}$-order derivatives are Hölder continuous with degree $ν$ and parameter $H$, and that are uniformly convex with degree $q$ and parameter $σ$. When these orders match, namely, $q = p + ν$, we show that any deterministic algorithm with access to derivatives up to order $p$ requires $Ω\left(\left(\frac{H}σ\right)^{\frac{2}{3(p+ν)-2}}\log\frac{Δ_0}ε\right)$ oracle calls to reduce an initial optimality gap of $Δ_0$ to $ε$. This matches the corresponding upper bound and establishes a higher-order uniformly convex counterpart to Nesterov's classical first-order lower bound for strongly convex functions. Rather than directly generalizing Nesterov's classical quadratic-chain construction, we develop a multiscale phase-wise construction that preserves previous oracle responses while maintaining global Hölder smoothness and uniform convexity. Our result resolves the matched case left open by existing lower bounds for the two asymmetric regimes.

fields
Optimization and Control
pdf ↗ page arXiv:2611.05527 ↗

Relevance propagation, which redistributes a network's prediction backward through the layers, is usually treated as a heuristic. We show that it is the solution of a single variational problem: Layer-wise Relevance Propagation (LRP) is the divergence-free flow on the active computational graph of zero relative entropy to the backward transition law of the forward activation flow; for a non-negative reference, this is a relative entropy between Markov measures on backward paths. The rules LRP$_0$, LRP$_{z^+}$ and LRP$_{α,β}$ follow from this principle by the choice of a reference, and are instances of one rule, LRPN$_{α,β}$, whose weights may vary from node to node, for instance with the node's activity, in the spirit of Hebb's principle. The principle rests on a measure-theoretic formalization of feed-forward networks as directed acyclic graphs of Filippov operators, which covers piecewise-smooth and discontinuous architectures (e.g. hard-routed Mixture-of-Experts) with a Clarke-Filippov generalized-gradient calculus; it also characterizes backpropagation as the adjoint equation of a Lagrangian relaxation. On networks of ReLU and max-pooling nodes, LRP$_0$ is Gradient$\times$Input, with an explicit jump across a kink where LRP$_{z^+}$ stays continuous. Taking the entropy edge by edge yields a new rule, Sinkhorn Relevance Propagation. Aggregated over an input region, the flow of a non-negative reference tells, with exact accounting, which hidden units carry its evidence, the conditioned flow being a Schrödinger bridge. On VGG-16, the conservation identities hold to round-off, and the rules are told apart by the sign of their maps, the share of the output left to the bias nodes, faithfulness, localization and class dependence; on ConvNeXt-Tiny, LRPN$_{α,β}$ conserves the output and its Hebbian weights give the highest ABPC of the rules tested.

comments
41 pages, 17 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.05594 ↗

Dantzig-Wolfe reformulation strengthens the linear relaxation of a mixed-integer program by convexifying a chosen set of constraint families, and every candidate costs a column generation run. The choice is hard when families strengthen the bound only together, because a search that adds one family at a time then stops at the linear relaxation. The classical inequalities of lot sizing, network design and facility location rest on such zero-marginal groups. We prove that when each evaluation convexifies at most $s$ of $k$ families, any method that observes only bounds needs a covering number of evaluations, of order $k^w$, to find a hidden group of $w$ families, also on actual Dantzig-Wolfe relaxations. A prediction that misses $e$ members reduces the cost to $Θ(k^e)$, through one staged search that does not need to know $e$, so the evaluations a prediction saves measure what the predictor knows. We study two sources of predictions. A one-pass lookahead at an optimal LP dual is provably blind to groups whose families share no variable, and a language model reads the names and text of the model. JointDW verifies the prediction of the language model with the staged search and interleaves it with the lookahead at a bounded loss. Groups that strengthen the bound only jointly appear in a quarter of the MIPLIB-NL models whose bound can be improved. There the strongest language models identify them about as often as the lookahead, their predictions rest on the names for textbook models, and reasoning about doubles the accuracy of the same model. On larger models with distracting families, the lookahead finds the group in one evaluation of three families. Language models given only the text seldom name it, while one reasoning model given every coefficient names it in all but one answer and then needs fewer evaluations than the lookahead for pairs of families.

comments
23 pages, 4 figures, 15 tables. Code and data: https://github.com/junbolian/JointDW
fields
Optimization and Control
pdf ↗ page arXiv:2611.05726 ↗

Given a set of terminals in $\mathbb{R}^d$ and an integer $k\ge0$, the Euclidean bottleneck Steiner tree problem (EBSTP) asks for a tree spanning the terminals with at most $k$ Steiner points that minimizes its longest edge. Although the planar case has been widely studied, exact optimization methods for arbitrary dimension remain scarce. We develop two exact mixed-integer second-order cone programming (MISOCP) formulations for the EBSTP: a single-commodity flow formulation and a formulation with connectivity cuts. Both formulations share a geometric core based on edge-conditional second-order cone constraints and are strengthened by problem-specific preprocessing, edge-dependent big-$M$ constants, symmetry-breaking constraints, constructive upper bounds, and new global lower bounds on the optimal value. We establish the correctness of the formulations and prove the validity of all strengthening techniques. Computational experiments on 1050 benchmark instances in dimensions $d\in\{2,3,4\}$, with up to $50$ terminals and $9$ Steiner points, show that the single-commodity flow formulation consistently outperforms the formulation with connectivity cuts, with an advantage { in solved instances} that grows with dimension. The proposed global lower bounds substantially strengthen the root relaxation, while the single-commodity flow formulation provides the most robust exact solution method across all test sets. These results establish the single-commodity flow formulation as an effective exact approach for the EBSTP in arbitrary fixed dimension.

fields
Optimization and Control
pdf ↗ page arXiv:2611.05733 ↗

This paper asks whether an optimal decision can be separated from the physical dynamics on which it acts. It studies this question through minimum-energy barrier crossing in scalar bistable systems. It characterizes the finite-horizon optimal feedback and shows that, as the horizon grows, it converges to a law that doubles and reverses the drift while it opposes crossing, and switches off once the barrier is passed. In physical coordinates, this law inherits the plant's nonlinearity, entangling decision and dynamics. We show that a plant-specific translation of state, input, and time maps every double well in the considered class to the same unit-rate linear world model, allowing a downstream decision stage to use a single plant-independent control primitive. This separation generally loses optimality at finite horizons because the translation does not preserve the physical control energy. Nevertheless, we prove that the excess physical energy of the layered controller vanishes as the horizon grows and that its limiting feedback reproduces the asymptotic optimum exactly. Thus, translation and optimization generally do not commute at a finite horizon, but commute in the asymptotic limit.

fields
Optimization and Control
pdf ↗ page arXiv:2611.05736 ↗

Pontryagin's Maximum Principle is said to be "normal" for the problem at hand when it has a solution (maximizer u*) that explicitly involves the problem's cost function, making the maximum principle helpful (while in the opposite situation it is of no help). The aim of the present paper is, for Lagrange optimal control problems without state constraints, to identify classes of problems for which the Principle is normal. General conditions are introduced that guarantee normality, and classes of problems that satisfy these conditions are identified. Such classes include problems for which the constrained (by bounds on the control values) "augmented" reachable set, with cost along an upward vertical axis, has a convex lower-boundary function and the optimal terminal state lies in the relative interior of the reachable state set, with the terminal constraint within the affine hull of that set. Such classes include problems for which the constrained (by bounds on the values of the control signal) "augmented" (with the cost value along an upward "vertical axis") reachable set has a "convex" lower boundary for which the optimal terminal state lies in the relative interior of the set of reachable states. Special attention is given to Lagrange steering problems: sufficient conditions are obtained on a nested sequence of sub-classes of such problems, culminating with the class of steering problems with scalar control signal and linear time-invariant (LTI) state dynamics and objective integrand, for which normality is guaranteed whenever all eigenvalues of the state dynamics matrix A are real (e.g., if A is symmetric or triangular or the system is overdamped) or have small enough imaginary parts; simple 2 x 2 examples show that, in contrast with the situation in the finite-dimensional case, this property does not extend to arbitrary A matrices.

fields
Optimization and Control
pdf ↗ page arXiv:2611.05743 ↗

We study the component-oracle complexity of finding approximate local minima of nonconvex finite sums under mean-squared averaged smoothness with parameter $L$ and a $ρ$-Lipschitz average Hessian. Each query returns the value, gradient, and one Hessian-vector product of a component. We show that the complexity in the high-accuracy regime $\varepsilon\le c_0L^2/(nρ)$ is $\tildeΘ(n^{3/4}L^{1/2}ρ^{1/4}Δ\varepsilon^{-7/4})$ for a sufficiently large initial gap $Δ$. We attain the upper bound by adapting the inverse solver and eigenvector routine of FastCubic to averaged smoothness. Our lower bound assigns the bridge edges of a nested chain to random components; a replicated spectral construction gives the same bound for unrestricted randomized algorithms. Under individual smoothness, a factor of $n^{1/4}$ remains for $\varepsilon\le cL^2/(n^2ρ)$, up to logarithmic factors. In the complementary low-accuracy regime, we propose PathVR, which uses $\tilde O(n+\sqrt{n}LΔ\varepsilon^{-2})$ queries and matches a lower bound from dense weak hiding.

comments
30 pages, 2 tables
fields
Optimization and Control
pdf ↗ page arXiv:2611.05807 ↗

Firms using large language models under fixed budgets must decide which model to call and whether to retry a failed task. Because a call's charge is revealed only after completion, one long response can exhaust the remaining budget and leave later tasks unserved. Our objective is to maximize the number of tasks solved before service stops. We develop a contextual bandit policy, ADP-HT, which learns each model's task-specific success probability and constructs conservative cost estimates from coarsened response-length labels on a quantile grid with $2^K$ intervals. The policy weighs predicted success against these costs, adjusting the cost penalty to realized spending and the budget available per remaining task. Under calibration, local regularity, and grid-coverage conditions, we bound the excess allowance in the policy's conservative cost estimates. At a fixed sample size, increasing $K$ reduces the discretization term but increases the estimation allowance. At the tightest tested budgets, ADP-HT solves more than twice as many MATH500 and GPQA tasks as the best implemented baseline. It achieves the highest mean cumulative score at ten of fourteen RouterBench budgets. On LiveCodeBench, it outperforms a deployed commercial router in both default and cost-saving modes at the three lowest test budgets.

fields
Optimization and Control
pdf ↗ page arXiv:2611.05835 ↗

Temporal-difference (TD) learning underlies many prediction and control algorithms, but can diverge when combined with off-policy learning, bootstrapping, and function approximation. TD with Regularized Corrections (TDRC) is theoretically sound and practically simple, but existing convergence theory covers only the one-step case under i.i.d. sampling, while the Huber Bellman-error formulation has not been extended to TDRC or eligibility traces. In this work, we establish convergence of constrained TDRC($λ$) with diminishing stepsizes and non-i.i.d. off-policy data, for state-dependent and history-dependent $λ$-parameters. We also propose TDRC($λ$)-Huber, which preserves the TDRC($λ$) fixed point while reducing sensitivity to large Bellman errors. For both algorithms, we apply an ODE-based weak-convergence method from stochastic approximation theory. For the nonlinear mean dynamics of TDRC($λ$)-Huber, we give an integral small-gain condition that guarantees uniqueness and global asymptotic stability of the target equilibrium. We then establish convergence of the constrained algorithm, derive computable sufficient conditions for convergence, and identify a regularization-based convergence mechanism shared by linear TDRC($λ$) and TDRC($λ$)-Huber. When the mean TD matrix is positive stable, both constrained algorithms converge under sufficiently strong regularization without requiring positive definiteness.

comments
66 pages, 1 figure. Submitted to the Journal of Machine Learning Research
fields
Optimization and Control
pdf ↗ page arXiv:2611.05869 ↗

In this paper, we study a general forward-backward splitting approach for monotone inclusion problems that simultaneously accommodate set-valued, monotone Lipschitz continuous, and cocoercive operators. Weak convergence is established under a general setting. Strong convergence is obtained when both the maximally monotone operators are linear relations and the monotone Lipschitz continuous and cocoercive operators are linear. When the set-valued operators are normal cones to closed linear subspaces, we derive an explicit characterization of limit points of generated sequences using a new technique. Numerical experiments on a quadratic minimization problem with multiple-set split feasibility constraints are presented to illustrate the theoretical results.

fields
Optimization and Control
pdf ↗ page arXiv:2611.05884 ↗

Attracting features toward learned in-distribution (ID) regions is an intuitive strategy for out-of-distribution (OOD) detection, but does such attraction improve detection? We investigate this question using class-conditioned Hamiltonian dynamics as a controlled testbed and identify an attraction-ranking mismatch: improving individual class-affinity scores need not improve the relative ordering of ID and OOD samples. Our analysis separates misalignment between the driving field and the detection score from ranking failure that persists even when they are aligned. An exact AUROC decomposition and a local boundary analysis identify relative score changes at the ID-OOD ranking boundary as the source of first-order AUROC change under regularity conditions. Experiments demonstrate that a score-aligned rule can improve performance on a held-out source validation split yet consistently degrade it after transfer, even without a single winning-class change. A separate perturbation study finds that near-boundary relative score changes track the direction of small AUROC changes in the tested settings. Finally, centroid approximation and shared scales connect the zero-step score to a static centroid family that includes the existing CTM detector. Together, these results explain why class attraction is insufficient to justify feature refinement and motivate evaluating its effect on the ranking boundary.

comments
24 pages
fields
Optimization and Control
pdf ↗ page arXiv:2611.06021 ↗

We study accelerated proximal gradient methods with general stepsizes for convex composite multiobjective optimization, in which every objective is the sum of a smooth convex term and a proper closed convex extended-valued term, and the proximal subproblem retains a separate offset for each objective. The momentum coefficient may depend on the computed trajectory. For a two-parameter root momentum rule we prove boundedness, weighted square summability of the displacements, a merit-function rate of $o(k^{-2})$, and displacement decay of $o(k^{-1})$ whenever the first parameter converges to a value in $(0,1)$; the second parameter need not converge or have bounded total variation. The analysis is organized as a chain of basic estimates, an energy identity, coefficient asymptotics, and auxiliary lemmas that are reused in every regime. For the critical parameter $α=3$ we establish the finite bound $u_0(x^N)\le 2\ell R/[N(N+3)]$, square summability of the displacements, displacement decay $O(1/N)$, and convergence of the full sequence to a weak Pareto point. The remaining little-o question at $α=3$ is shown to be exactly the vanishing of a nonnegative critical energy, so it is separated from the large-$O$ estimate rather than left as a missing step. For $1<α<3$ we give the rate $O(N^{-(α-1)})$ and for every $α>0$ the qualitative conclusion $u_0(x^k)\to0$, $F_i(x^k)\to c_i$, and $\sum_k D_k/k<\infty$. A table summarizes the rate picture over the whole positive range of $α$, and a JOS1 experiment illustrates the predicted little-$o$ separation.

fields
Optimization and Control
pdf ↗ page arXiv:2611.06125 ↗

Foil windsurfing is a sport in which competitors fine-tune their setup to optimize performance under varying environmental conditions. However, such adjustments are typically guided by intuition. This paper presents a methodology for improving hydrofoil design using computational fluid dynamics. First, structured light scanning was used to obtain the geometry of a conventional hydrofoil. Subsequently, five derived designs have been explored, inspired by advancements in airplane wing design. Following this, a preliminary design was selected, and a design of experiments approach was implemented. Generated simulation data were used to train a machine learning surrogate, which is ultimately used in the multi-objective design optimization. While the surrogate-based approach yielded promising results, it was limited to exploring a restricted set of design parameters. To overcome this constraint, additional improvements were attained through adjoint optimization, demonstrating that comparable performance can be achieved with a distinctly different hydrofoil design. Finally, the conventional design was refined through adjoint optimization. Notably, adjoint optimization yielded a 15% increase in efficiency. The results suggest that both proposed approaches can produce novel hydrofoil designs capable of outperforming the original configuration under specific conditions; however, due to its inherent flexibility, the adjoint approach with realistic constraints offers more freedom in the design exploration process.

comments
36 pages
journal
Ocean Engineering 347 (2026) 123943
fields
Optimization and Control
pdf ↗ page arXiv:2611.06183 ↗

We resolve the open problem of deriving an exact, closed-form algebraic formula for the calmness modulus of $\mathcal{C}^2$ convex constrained feasible set mappings $\mathcal{F}(b) := \{ x \in \mathbb{R}^n \colon f_t(x) \le b_t, \, \forall t \in T \}$ under right-hand side perturbations at a given pair of the graph $(\bar{b}, \bar{x})$. First, under the condition $0_n \in \mathrm{int}\left(\mathrm{conv}\left\{ \nabla f_t(\bar{x}) ,\; t \in T(\bar{x}) \right\}\right)$, we prove that the calmness modulus coincides with the inverse distance from the origin to the boundary of the nominal subdifferential. Second, for general $\mathcal{C}^2$ convex systems where the previously mentioned interior condition does not hold, we introduce a second-order admissibility filtering over the active indexes. We show that this filtered family, $\mathcal{D}^0_2(\bar{x})$, yields an exact characterization of the calmness modulus relying solely on nominal data.

fields
Optimization and Control
pdf ↗ page arXiv:2611.06224 ↗

This paper studies a continuous-time probabilistic control problem for stochastic systems in which the feedback law assigns a probability distribution over control inputs. The control is modelled as a law-dependent Poisson-refresh process: it is held constant between refresh times and resampled at Poisson times from a feedback rule depending on the current state and state law. The closed-loop system is therefore formulated as a jump–diffusion for the joint state–control process. The objective is to design the sampling rule by comparing the realised closed-loop system with a prescribed reference description. The cost separates two local terms: a relative-entropy penalty for the instantaneous refresh kernel and a state-side drift-mismatch cost. The state-side term is evaluated at the realised control value and is motivated by a frozen-control Girsanov identity. Under global Lipschitz, moment, and uniform ellipticity assumptions, we prove well-posedness of the closed loop and a dynamic programming principle on the joint state–control law space. For linear data and admissible mean-dependent affine-Gaussian refresh rules, the full joint law need not remain Gaussian, but the first and second moments of the joint state–control process close exactly. This yields a deterministic reduced control problem on moment space, with an explicit running cost, a reduced Hamiltonian, and a verification theorem.

comments
Submitted to Applied Mathematics & Optimization (Springer Nature)
fields
Optimization and Control
pdf ↗ page arXiv:2611.06252 ↗

We consider linear conic problems whose cone is a product of truncated quadratic modules, the sum-of-squares (SOS) side of the moment-SOS hierarchy. A floating-point solution is turned into an exact rational certificate in three steps: rounding, repair of each block residual by a constant, and absorption of the constants along a recession direction of the problem. The repair relies on strict partitions of unity in the quadratic modules. We characterize their existence, relate the canonical one to the analytic center of the dual pseudo-moment cone, Christoffel-Darboux polynomials and Pell equations, and we derive closed-form rational partitions for balls and boxes. The loss incurred by the certification is the optimal value of a recession problem, equal to a support function of the masses of the dual feasible pseudomoments. The method is illustrated on polynomial optimization, volume computation and positivity of polynomials along D-finite trajectories.

fields
Optimization and Control
pdf ↗ page arXiv:2611.06315 ↗

The paper introduces a novel control notion, twofold controllability, which consists of the joint optimisation of the initial state and the distributed control input in a controlled dynamical system, with the aim of reaching a prescribed target state within a given time interval. We show that the resulting problem is well-posed, derive the corresponding optimality conditions, and provide an explicit formulation of its solution. The proposed approach ensures the reachability of any target state independently of the Kalman rank condition. We show that incorporating the additional control component enlarges the set of states reachable with a fixed control cost. At the same time, the average energy required to reach target vectors on the unit sphere decreases. Furthermore, we analyse the asymptotic behaviour as the cost of controlling the system through the initial state tends to infinity. Particular attention is paid to the case in which the controllability Gramian is singular and the classical notion of controllability does not hold. The theoretical results are illustrated by numerical examples, including ones arising from the semi-discretisation of the heat and wave equations with boundary control.

fields
Optimization and Control
pdf ↗ page arXiv:2611.06401 ↗

We determine the optimal logarithmically homogeneous self-concordant barrier parameter for the three-dimensional power cone. Although several self-concordant barriers for this cone have been constructed, its optimal barrier parameter had remained unknown. For a power cone with exponent $c\in(0,1)$, we prove that the optimal parameter is $\frac{3}{1+\min\{c,1-c\}}$. Except at $c=1/2$, this value is strictly smaller than the parameter $3-2\min\{c,1-c\}$ of Chares' conjectured barrier. At $c=1/2$, the optimal parameter equals $2$, in agreement with the optimal barrier parameter of the second-order cone. The proof combines a sharp lower bound for arbitrary logarithmically homogeneous self-concordant barriers with an explicit barrier attaining the bound.

comments
25 pages, 1 figure
fields
Optimization and Control
pdf ↗ page arXiv:2611.06404 ↗

This paper studies constrained defined contribution (DC) pension management under a two-factor financial market model. The pension participant is allowed to invest in cash, two nominal bonds, an inflation-linked bond, and a stock index. Moreover, they can also purchase term life insurance to manage pre-retirement death risk. Unlike traditional literature, we consider a pension member restricted to a general non-empty, closed, and convex trading constraint set that includes no short-selling, no borrowing, and portfolio-mix constraints as special cases. Such restrictions reflect common limits on pension-account trading. To solve the problem, we construct a family of unconstrained artificial markets, in which the original trading constraints are satisfied by adjusting the drift terms of the risky assets. Using a duality transformation, we derive the Lagrangian dual problem and propose a reparameterized neural network method to compute lower and upper bounds on the primal value function. We calibrate our model with U.S. data using a Kalman filter method, and find that our method produces a smaller duality gap than the benchmark methods. We also compare the constrained results with the unconstrained explicit solution and find that trading constraints substantially change wealth accumulation, portfolio strategies, and insurance demand. This highlights that unconstrained solutions may provide misleading guidance for pension management in practice.

fields
Optimization and Control
pdf ↗ page arXiv:2611.06495 ↗

Job scheduling is an NP-hard optimization problem with clear industrial relevance. In practice, distributing work across a team is not only about meeting deadlines or improving productivity; it also affects fatigue, stress, and employee well-being. Variational Quantum Algorithms (VQAs) provide a promising way to address these problems through QUBO formulations, although their scalability on near-term NISQ hardware is still limited by Hilbert-space growth and barren plateaus. In this work, we simulate a VQA for a realistic Multi-Skill Resource-Constrained Project Scheduling Problem (MS-RCPSP), including worker capacities, skill matrices, task priorities, deadlines, and calendar stability during rescheduling. To keep the problem within a near-term circuit size, we use a temporal batch decomposition that solves one day at a time, propagates the remaining workload, and combines it with a logarithmic binary encoding that keeps every batch at or below 30 qubits. Because the ground state of a QUBO Hamiltonian is a computational basis state, entanglement is not required to represent the solution, raising the question of whether it helps or hinders ansatz training. We address this question by comparing the linear and brick-wall entangling topologies of a hardware-efficient ansatz with an entanglement-free reference that has the same number of parameters and by training every configuration with COBYLA and with Adam using SPSA gradient estimation. For the instance and initialization studied, the entanglement-free reference produced feasible schedules under both optimizers. With COBYLA, it produced the feasible schedule closest to the required workload at a fraction of the simulation cost of the entangled topologies, indicating that entanglement did not improve the solutions found by the VQA.

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

We study extended stochastic Riccati equations (ESREs) arising in constrained continuous time mean variance portfolio selection with random market coefficients. Reflected Markovian diffusions are introduced to model factor dynamics in a bounded state space, naturally leading to homogeneous Neumann boundary conditions. A logarithmic transformation converts the extended stochastic Riccati equations into quadratic backward stochastic differential equations (BSDEs) driven by the reflected factors. We establish their probabilistic representation through semilinear parabolic Neumann problems and prove existence and uniqueness of bounded continuous viscosity solutions. Existence is obtained through stability and comparison arguments for quadratic BSDEs, whereas uniqueness is established by combining a Kobylanski-type transformation with a viscosity comparison principle adapted to the Neumann boundary setting. We further develop a Deep BSDE method combining reflected-path simulation, geometry-aware boundary treatment, and efficient evaluation of the constrained Hamiltonian. Numerical experiments demonstrate the effectiveness of the method, providing a mesh-free framework for high-dimensional constrained portfolio problems with Neumann boundary.

fields
Optimization and Control
pdf ↗ page arXiv:2611.06538 ↗

Thermally tuned devices pose a basic control problem. A heater on one edge of a thin plate must hold a small element at an unknown optimal temperature, and the only signal available is the device's own performance. Boundary measurements of {such} an unknown performance objective can be used to tune a diffusion process without reconstructing its spatial state. This paper studies a dual-mode extremum-seeking controller for this setting, modeled as a semilinear diffusion equation on a square with nonuniform boundary actuation. The implementation contains two scalar states and exploits the leading attenuation and \rev{$π/4$} phase \rev{lag} of the diffusion response, a property shared by every periodically heated surface. It requires neither numerical plant coefficients nor the sign of the input gain. An energy estimate first establishes exponential stability of a coupled linear diffusion and controller model. A local bound on the remaining reaction and cost nonlinearities then yields stability and disturbance estimates for the averaged system. Complete kernel and boundary-trace arguments justify a change of coordinates that compares the implemented and averaged trajectories for all time. The resulting practical stability guarantee concerns the field, input bias, and sensitivity estimate, and is unaffected by a constant cost offset under corresponding filter initialization. At fixed dither amplitude, the residual state bound decreases with the inverse square root of frequency, while the ultimate cost bound decreases with its inverse. A thermal optical-filter example illustrates the predicted trends and the conservatism of the sufficient conditions.

fields
Optimization and Control, Analysis of PDEs
pdf ↗ page arXiv:2611.06591 ↗

The goal of these notes is to provide a unified and rigorous introduction to robust sequential decision-making. We offer a self-contained introduction to the main results in the field. After a concise introduction to MDPs we introduce robust MDPs with general uncertainty sets, before focusing on rectangular models of uncertainty. We make a significant effort to show connections between robust MDPs and several other popular models for sequential decision-making: MDPs with uncertain rewards, Multi-Objective MDPs and Pareto optimality, MDPs with time-varying uncertain parameters, non-rectangular robust MDPs, stochastic games, distributionally robust MDPs, and risk-averse MDPs. Having all these results in one place, within a single unifying formalism, will hopefully be useful for researchers who want to start working on this topic. The exposition combines operator and fixed point approaches, convex optimization (more specifically, duality in saddle-point problems), and game-theoretic arguments. The latter identifies robust MDPs with a certain type of two-player game; this helps build useful intuition, especially when constructing counterexamples.

fields
Optimization and Control
pdf ↗ page arXiv:2611.06672 ↗

Gradient descent is a fundamental algorithm in machine learning and statistical inference. Performance estimation provides a systematic framework for obtaining sharp convergence bounds through semidefinite programming. We study the worst-case performance of constant-stepsize gradient descent over the class of $L$-smooth functions satisfying the $μ$-Polyak–Łojasiewicz (PŁ) inequality. We formulate the $N$-step objective-gap analysis as a semidefinite programming (SDP) relaxation based on pairwise smoothness constraints and pointwise PŁ inequalities. Since an exact interpolation condition for smooth PŁ functions is not currently available, the resulting SDP provides a valid upper bound on the true worst-case performance. We solve a reduced SDP retaining only consecutive-pair smoothness constraints analytically for every horizon $N$ and every stepsize $t\in(0,2/L)$. The solution exhibits three stepsize regimes. For $0<t\leq 1/L$ and $1/L<t\leq \sqrt{3}/L$, the reduced and full pairwise SDPs have the same optimal value, and the one-step SDP contraction factor tensorizes to a geometric $N$-step rate. For $\sqrt{3}/L<t<2/L$, the reduced-SDP value is nongeometric in the horizon: an initial transient phase is followed by eventual geometric decay. The resulting asymptotic contraction factor is tight for the full pairwise SDP and strictly improves the bound obtained by recursively applying the one-step estimate. Explicit primal and dual feasible solutions certify the results, with numerical SDP experiments guiding their construction. Our results show that analyzing several iterations together can give a better convergence bound than repeatedly applying the sharp one-step SDP bound in the Regime III.

fields
Optimization and Control
pdf ↗ page arXiv:2611.06713 ↗

There is a large body of work on distributed optimization for problems in Euclidean space. However, many existing algorithms and analyses do not directly transfer to problems defined on smooth manifolds. Therefore, in this paper we propose a distributed asynchronous optimization algorithm for problems on Riemannian manifolds. The algorithm we develop is a parallelized form of Riemannian block coordinate descent in which all agents can compute and communicate asynchronously. We assume only "partial asynchrony", namely that all delays in computations and communications obey some finite bound. We relax common assumptions by requiring neither convexity of the objective nor compactness of the manifold. Under mild conditions, we prove that agents' iterates drive the Riemannian gradient of their objective to zero, and we derive a rate of convergence for the norm of the gradient. Under different communication delays and numbers of agents over a finite horizon, we empirically show that our algorithm achieves a suboptimality of up to 730 times smaller than that of a synchronous baseline algorithm in an example simulation.

comments
20 pages, 5 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.06722 ↗

We consider the deterministic oracle complexity of finding a $(δ,ε)$-Goldstein stationary point of a Lipschitz function under constraints. The problem is posed in $\mathbb{R}^d$, where $d$ denotes the dimension; constraints are specified either by a closed feasible set or by a single explicit inequality. For closed feasible sets that are star-shaped with respect to an interior ball, including all convex bodies, we use a resisting-oracle construction to show that every deterministic algorithm needs $Ω(ε^{-2})$ objective-oracle calls in the worst case when $d\gtrsimε^{-2}$ and $δ\lesssimε$. For explicit inequalities satisfying uniform Goldstein constraint qualification and strict feasibility, finding Goldstein KKT stationary points requires exponentially many oracle calls in $d$ in the worst case, even at fixed stationarity accuracy. This exponential dependence holds under dimension-independent constraint regularity and strict-feasibility bounds, with a sufficiently small neighborhood radius and complementary slackness error. The result covers common constraints such as ball and box constraints and also allows nonconvex feasible regions. For convex coercive constraints with a Slater point, the resisting-oracle argument also gives an $Ω(ε^{-2})$ oracle-call bound in the same dimension and radius regime while allowing a larger complementary slackness error. These results hold for all deterministic algorithms using a local oracle, whether or not the returned point was queried. Each constructed objective has a strictly feasible global minimizer; the lower bounds therefore concern the information required to find stationary points, not their existence.

comments
26 pages, 1 figure
fields
Optimization and Control
pdf ↗ page arXiv:2611.06739 ↗

We revisit the optimization of entanglement holding times in memory-based quantum repeaters for maximizing entanglement swapping throughput under different fidelity constraints - strict, probabilistic, and mean. We consider two heterogeneous quantum links that are equipped with single or multiple memories and differ in decoherence rates, memory capacities, entanglement attempt rates and success probabilities, as well as classical communication latencies. Efficient models are developed to estimate the expected entanglement throughput and the probability density functions of the conditional wait time to swap. The models are then used to satisfy different fidelity requirements by optimizing the maximum holding times for the two links. Finally, our proposed model and approach are validated with a discrete-event quantum network simulator.

comments
8 pages, 2 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.06823 ↗

The best classical optimizer for a continuous black-box problem depends on its budget and landscape. Existing routers decide from the dimension and budget, past improvement or features fitted to one benchmark, and few test an optimizer's implicit assumptions online. AMM (Adaptive Multi Mode) routes a known budget among quasi-Newton, trust-region, coordinate, multistart and evolution-strategy optimization engines with online probes of curvature, plateaus, separability, kinks, basins and fractal structure. Each probe has a default, a dimension-by-budget validity range and a cost charged to the budget. In its pre-registered development loop on bbob, 32 of 36 predictions held over the last 16 confirmations. AMM was then tested once on held-out bbob instances 101-110 (D=2-40, 10*D-1000*D) against up to seven competitors. It has the highest target share in 382 of 600 function-dimension-budget cells (236 outright, 146 tied) and, by a descriptive posterior rule, is credibly behind in 35, mostly at 10*D and 30*D. At every budget it also leads the controls built from its own engines (the best engine alone, the best engine per dimension and budget, and a greedy schedule), narrowly at 10*D and 30*D, and nevergrad's NgIohTuned. In pre-registered runs its lead over IPOP-CMA-ES holds under affine and box transformations, on box-constrained bbob and, pooled, on rotated f2-f4, but rotating the separable f3 and f4 removes most of the lead there. On held-out MA-BBOB its final share at 2000*D is level with IPOP-CMA-ES's and its anytime area lower. We published AMM as an open-source Python package (pip install amm-optimizer; https://github.com/BjBodner/amm-optimizer).

comments
29 pages, 8 figures, 19 tables. Code: https://github.com/BjBodner/amm-optimizer
fields
Optimization and Control
pdf ↗ page arXiv:2611.06879 ↗

We consider stochastic optimal control problems in which the state is constrained to a proper cone. Specifically, we consider risk-neutral, risk-averse, and risk-seeking formulations within a single entropic-risk framework. We investigate classes of problems whose Bellman operator preserves affine functions and characterize their optimal value functions and feedback policies for both finite-horizon and time-average infinite-horizon problems. Additionally, we establish convergence and state-bound results under finite-step cost observability. Moreover, we demonstrate an exact connection between entropic-risk optimal control on proper cones and deterministic infsup control for systems whose dynamics and stage costs are affine in the disturbances. In addition, we provide examples of classes of systems for which explicit solutions can be obtained.

fields
Optimization and Control
pdf ↗ page arXiv:2611.06887 ↗

Analysis of PDEs29

We study the approximation of the no-flux McKean-Vlasov equation on a bounded convex domain by a whole-space equation with quadratic confinement of strength $λ^{-1}$ outside the domain. For a smooth bounded interaction kernel and a common bounded initial density with square-integrable gradient, we establish an $O(λ^{1/4})$ approximation rate. The estimate controls the $L^2$ density error uniformly on every finite time interval and the gradient error in space-time $L^2$. Without interaction, a spectral gap independent of $λ$ yields the $O(λ^{1/4})$ rate uniformly in time for the density error and uniformly over all unit time intervals for the gradient error. With interaction, we construct a counterexample showing that even weak convergence can fail to be uniform in time.

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

This paper continues the study initiated in \cite{GuJevnikarYang2026b} of fractional Hartree equations with zero capacity singular sets. We are concerned here with the critical case, i.e. \[ (-Δ)^s u=\left(\int_{\mathbb{R}^N\setminusΓ} \frac{u^{2_{μ,s}^*}(y)}{|x-y|^μ}\,d y\right)u^{2_{μ,s}^*-1} \quad\text{in }\mathbb{R}^N\setminusΓ, \] where $N\ge2$, $s\in(0,1)$, $μ\in(0,N)$ and $2_{μ,s}^*$ is the critical exponent associated to this class of problems. We prove symmetry and monotonicity with respect to the singular set $Γ$. The Kelvin transforms centered at regular points provide sufficient decay at infinity for both the transformed solutions and their associated Hartree coefficients, without imposing global integrability assumptions. Combined with a moving plane argument and a comparison estimate in critical Lebesgue spaces, this allows the moving plane method to cover the full interaction range.

comments
27 pages, comments are welcome
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.05525 ↗

We prove quantitative stability of quadratic optimal transport maps from arbitrary log-concave sources to bounded targets. If the source $ρ$ is isotropic on $\mathbb R^d$ and the targets $μ$, $ν$ are supported in a common ball of radius $R$, their Brenier maps satisfy \[ \lVert T_μ-T_ν\rVert_{L^2(ρ)} \leqslant 17d^{2/3}R^{2/3}W_2(μ,ν)^{1/3}. \] The one-third exponent is optimal for $d\geqslant2$. The proof combines a linear stability estimate for Brenier potentials in a weighted norm with a matching weighted reverse Poincaré inequality. The weight is chosen in terms of the negative log-density of the source to account for its tails. We also show that the best dimensional constant in map stability is at least of order $d^{1/3}$.

comments
15 pages with AI use statement
fields
Analysis of PDEs, Functional Analysis, Probability
pdf ↗ page arXiv:2611.05534 ↗

Spatial heterogeneity in diffusion is a fundamental feature of excitable media, yet its effect on FitzHugh Nagumo dynamics remains mathematically challenging. We establish stability of solutions with respect to perturbations of the diffusion coefficient, providing a rigorous account of how changes in the medium affect the evolution of the system. Specifically, we prove a continuous dependence result ensuring that small perturbations in diffusion produce small variations in the corresponding solutions. The proof adapts the method of contracting rectangles to variable diffusion, yielding a framework for controlling and comparing solutions associated with different diffusion profiles. This result provides a rigorous link between heterogeneous and homogeneous FitzHugh Nagumo systems and justifies constant-diffusion approximations when the diffusion coefficient is close to a constant. Our analysis advances the understanding of FitzHugh Nagumo dynamics in heterogeneous media by establishing robustness with respect to spatial variations in diffusion.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.05770 ↗

This paper studies a mass supercritical Schrödinger system with partial confinement: $$ \begin{cases} -Δu_1+|y|^2u_1 =λ_1u_1+μ_1u_1^3+2βu_1u_2^2,\qquad x\in\R^3,\\ -Δu_2+|y|^2u_2 =λ_2u_2+μ_2u_2^3+2βu_1^2u_2,\qquad x\in\R^3, \end{cases} $$ subject to the mass constraints $ \int_{\R^3}u_1^2\dd x=a_1$, $\int_{\R^3}u_2^2\dd x=a_2,$ where $x=(y,z)\in\R^2\times\R$, the parameters $μ_1,μ_2,β$ are positive, and $λ_1,λ_2\in\R$ are unknown Lagrange multipliers. The masses satisfy $(a_1,a_2)=\eps(ρ_1,ρ_2)$ for a fixed vector $ρ=(ρ_1,ρ_2)\in (0,\infty)^2$. For all sufficiently small $\eps>0$, we establish the existence of a positive normalized solution $u_\eps^-$ at a mountain pass level on the full product mass sphere. This level coincides with the infimum of the energy over the negative part of the Pohozaev set. The main difficulty arises from the lack of compactness due to partial confinement. To overcome this difficulty, we develop a compactness argument that preserves the two independent mass constraints and show that every minimizing sequence for this infimum admits a strongly convergent subsequence after suitable common translations along the unconfined axial direction. We further establish the asymptotic relation $\eps E(u_\eps^-)\to m_0(ρ)$ as $\varepsilon\to0$, where $m_0(ρ)>0$ denotes the infimum of the free energy under the corresponding Pohozaev constraint. In addition, we derive the asymptotic behavior of the kinetic and potential energies. The solution obtained here is distinct from the normalized ground states constructed by Jia et al. [Discrete Contin. Dyn. Syst., 40(2020), 2739-2766] through local minimization for sufficiently small masses.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.05805 ↗

We formulate and study a mathematical model of a thermoforming process involving two interdependent thermoelastic membranes coupled with equations governing heat transfer. These membranes interact with each other through means of elastic forces and thermal transfer which determines changes in elastic properties and further deform the membranes. The two thermoelastic membranes lead to a pair of implicit obstacle problems which are modeled both as a 2-membrane problem or a pair of quasi-variational inequalities. Mathematically, the primary model couples an elliptic two membrane problem with associated nonlinear elliptic equations describing temperature distribution. We show, under physically relevant conditions, the existence of solutions via a fixed point approach that involves reformulation of the problem to improve regularity of solutions.

comments
2 figures
fields
Analysis of PDEs, Optimization and Control
pdf ↗ page arXiv:2611.05819 ↗

We study observability and stabilization for the whole-space Grushin heat equation $$ \partial_t u-Δ_γu=0,\qquad Δ_γ:=Δ_x+|x|^{2γ}Δ_y,\qquad (t,x,y)\in(0,T)\times\mathbb{R}^n\times\mathbb{R}^m,\quad γ>0. $$ For product sets $E=E_1\times E_2$, we identify three observability regimes in which thickness, distance from the degeneracy set $\{x=0\}$, and local density near that set play different roles. (i) In the subcritical regime $0<γ<1$, the observability inequality holds for every $T>0$ if and only if both $E_1$ and $E_2$ are thick; hence $T_{\min}(E)=0$. (ii) At the critical exponent $γ=1$, if $E_2=\mathbb{R}^m$ and $E_1\subset\mathbb{R}^n$ is thick, we determine the exact minimal observable time: $$ T_{\min}(E)=\frac{a_{\mathrm{ess}}(E_1)^2}{2n},\qquad a_{\mathrm{ess}}(E_1):=\operatorname*{ess\,inf}_{x\in E_1}|x|. $$ Thus, the threshold depends on the essential distance of $E_1$ from the degeneracy set. (iii) In the supercritical regime $γ>1$, we consider $n=1$, $E_2=\mathbb{R}^m$ and thick sets $E_1\subset\mathbb{R}$. If $a_{\mathrm{ess}}(E_1)>0$, observability fails for every $T>0$, so that $T_{\min}(E)=+\infty$. If $a_{\mathrm{ess}}(E_1)=0$, observability depends on the density of $E_1$ near $0$, measured by $$ D_{E_1}(r):=\log\!\left(\frac{2r}{|E_1\cap(-r,r)|}\right),\qquad L_{E_1}:=\limsup_{r\downarrow0}r^2D_{E_1}(r). $$ If $L_{E_1}=0$, then $T_{\min}(E)=0$; if $0<L_{E_1}<\infty$, a finite sufficient observation time exists. Moreover, observability at time $T$ requires $$ \limsup_{r\downarrow0}r^{2(1+γ)/(γ-1)}D_{E_1}(r)\le C_{T,γ}. $$ In contrast, for every $γ>0$, exponential and complete stabilizability hold if and only if both $E_1$ and $E_2$ are thick. The stabilization criterion is therefore independent of $γ$.

comments
44 pages
fields
Analysis of PDEs, Optimization and Control
pdf ↗ page arXiv:2611.05821 ↗

We study a $2\times2$ hyperbolic system with anti-located control and observation. It is well known that the system can be stabilized with a delayed output-feedback control and that, unfortunately, this design is arbitrarily sensitive to small errors in the transport velocity. It was recently proved that adding a second-order diffusion term to the system restores robustness. We show that the same phenomenon occurs with a fourth-order diffusion term: the maximal spectral abscissa of the closed-loop system converges, as the diffusion parameter goes to zero, to the explicit value $-\ln(2)$, and the resulting stability margin is robust to small perturbations of the transport velocity. This additional term leads to a quartic characteristic equation whose roots have no tractable closed-form expression. We develop an asymptotic classification of its four roots and use it to obtain a first-order expansion of the transfer function with an explicit error bound. Combining this expansion with a topological degree argument, we show that $-\ln(2)$ is in fact the exact limiting value of the spectral abscissa, extending to the fourth-order case the sharpness result previously available only for second-order diffusive terms.

fields
Analysis of PDEs, Optimization and Control
pdf ↗ page arXiv:2611.05845 ↗

Let $n\ge5$ and $u$ be a positive singular solution of $Δ^2u=u^{(n+4)/(n-4)}$ in a punctured ball. A long-standing question is where or not $ -Δu>0$ in the punctured ball. In this paper we show that the answer is negative. More precisely we construct a positive singular solution whose singularity at the origin is nonremovable, while its lower limit there is zero. On a normal subspace, $-Δu$ converges to a strictly negative constant. The spherical minimum has order $r^β$, where $2<β<4$, and the spherical Harnack ratio is unbounded. The proof uses balanced planar polygons, finitely many exterior parameters and a countable gluing construction.

comments
49 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.05998 ↗

We study the insulated conductivity problem with two unit spherical inclusions embedded in a bounded domain in $\mathbb{R}^n$ with $n\ge3$. The gradient of solutions may blow up as the distance between the two inclusions goes to zero. We introduce bispherical coordinates and expand the solution in spherical harmonics. Then we use the maximum principle to give a new proof of the optimal gradient estimate obtained by Dong-Li-Yang.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.06016 ↗

In this paper, we study the Klein-Gordon-Schrodinger system in four spatial dimensions. We consider a constrained minimization problem associated with the corresponding stationary system and establish the existence of a positive radial minimizer. We further investigate the asymptotic behavior and qualitative properties of minimizers. As an application, we analyze the dynamics of solutions with initial data in a potential well and prove that such solutions either blow up in finite time or exhibit unbounded growth in the energy norm as time tends to infinity. Since the minimizers lie on the boundary of the potential well, we also establish the strong instability of the associated standing waves.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.06094 ↗

We construct a nonzero divergence-free initial velocity on $\mathbb{R}^3$ and a continuum of pairwise distinct suitable Leray–Hopf solutions of the unforced three-dimensional Navier–Stokes equations on a common time interval. The initial datum is axisymmetric, smooth away from the origin, and belongs to every $L^{\mathfrak q}$ with $1\leq \mathfrak q<3$, but not to $L^3$. All the solutions attain this datum strongly in $L^2$, are smooth at positive times, and satisfy both the global and local energy equalities through time zero. The same family belongs simultaneously to every $L^{\mathfrak p}_tL^{\mathfrak q}_x$ with $1\leq \mathfrak p\leq\infty$, $2\leq \mathfrak q\leq\infty$, and $2/\mathfrak p+3/\mathfrak q>1$. The same solutions also belong to the critical Lorentz space $L^\infty_tL^{3,\infty}_x$. This endpoint is sharp for uniqueness in the Leray–Hopf class within the Lorentz scale. The proof is entirely analytic and uses a cascade through geometrically separated Gaussian swirls. We establish growth for the time-dependent viscous linearization and determine the sign of its complete quadratic stress, including the interaction of the reference velocity with the second variation. The integrated stress generates a controlled perturbation at the next larger spatial scale. At each finite cutoff, a prescribed terminal coordinate selects an initial perturbation whose physical $L^2$ norm tends to zero as the cutoff is removed. Uniform energy, moment, and transfer estimates yield the common strong initial trace while preserving a nonzero observable at a fixed positive time.

comments
113 pages, 2 figures (4 panels)
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.06117 ↗

We consider the 3-D rotating magnetohydrodynamic (MHD) equations. The combination of rotation and background magnetic field leads to the occurrence of dispersive magneto-Coriolis waves in the linearized equations. We establish a t ^{-1} decay estimate for waves with dispersion relation $σ$($ξ$) = $ξ$ \_3 h(|$ξ$|) under suitable assumptions on h, and show that this includes magneto-Coriolis waves. Then we apply these dispersive estimates to the nonlinear rotating MHD equations and obtain an improved lower bound on the lifespan of solutions.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.06200 ↗

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 ↗

We develop a variational and functional-analytic framework for continuum-kinematics-inspired peridynamics with simultaneous nonlocal interactions among multiple points. We encode the finite-difference data of each interacting simplex in a simplicial deformation gradient. For nondegenerate simplices in three dimensions, the gradient, its cofactor, and its determinant encode the associated continuum-kinematics-inspired peridynamic line, area, and volume changes, respectively. This unified representation leads to a class of simplicial hyperelastic energies with general, possibly nonadditive, constitutive dependence on the affine deformation of an interacting simplex, thereby extending the original continuum-kinematics-inspired peridynamic framework. To describe interactions occurring at different scales and over different simplex geometries, we introduce radial- and shape-weighted nonlocal spaces. Their multipoint seminorms control two-point energies induced by the edge marginals of the interaction measure. This comparison yields nonlocal Poincaré inequalities and fractional Sobolev embeddings. We establish existence of equilibrium configurations by two complementary mechanisms. Particle-wise averaged convexity yields weak lower semicontinuity of the associated energy functionals. Under stronger assumptions on the edge marginals, fractional compactness gives existence for nonconvex energy densities. These results provide a mathematical foundation for simplicial and continuum-kinematics-inspired peridynamic models.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.06242 ↗

Uniqueness of a non-negative radially symmetric solution with non-increasing profile to the Hardy-H{é}non elliptic equation with sublinear absorption \\ ____________ $Δ$v(x) + |x|\textsuperscript{$σ$}v(x) - v\textsuperscript{1/m}(x)=0, ______ x$\in$___\textsuperscript{N}, \\ is established in the range N$\ge$1, m>1 and $σ$$\in$(max{-2,-N},0). Consequences of this result are the uniqueness (up to scaling) of the non-negative extremal function to a Caffarelli-Kohn-Nirenberg inequality and the uniqueness of a non-negative radially symmetric self-similar solution with nonincreasing profile to a parabolic Hardy-H{é}non equation with quasilinear diffusion. The proof relies on ordinary differential equations techniques, which can be used thanks to the radially symmetric setting, and requires in particular a delicate analysis of the well-posedness and continuous dependence in view of the non-Lipschitz nonlinearity and the singularity of |x|\textsuperscript{$σ$} at the origin.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.06276 ↗

In this paper, we are concerned with the construction of global solutions to the Cauchy problem for the one-dimensional non-isentropic compressible Navier-Stokes-Poisson equations, as well as the precise description of their large-time behavior. While results for small initial data are well-established, the case of large initial perturbations remains less satisfactory. Even for constant transport coefficients, only the Nishida-Smoller type solutions have been obtained so far. In this work, we will provide a complete resolution of this problem. The key idea involves revealing favorable hidden identities of the potential force and a new representation for the specific volume, which enables us to derive uniform upper and lower bounds on this quantity. Moreover, this strategy extends to compressible viscous single-ion flow under the Boltzmann relation; notably, this new method for deriving lower and upper bounds on the specific volume also applies to the Navier-Stokes equations. The proof relies on a domain decomposition technique and some new dissipative structures to close the nonlinear energy estimates.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.06309 ↗

This paper investigates the persistence of spatial analyticity for solutions to the dispersion-generalized periodic Korteweg-de Vries equation $$\partial_tu-\partial_x|D_x|^αu+u\partial_xu=0,\qquadα\ge2.$$ For real-valued initial data $u_0\in G^{σ_0,s}(\mathbb T)$, with $σ_0>0$ and $s\ge-α/4$, we prove that the corresponding global solution satisfies $$u\in C([-T,T];G^{σ(T),s}(\mathbb T)),\qquadσ(T)=\min\left\{σ_0,\frac cT\right\},$$ for every $T>0$. As a consequence, our result improves the lower bound for the radius of spatial analyticity established by Himonas, Kalisch, and Selberg (2017) for $2\leα<4$, including the classical periodic KdV equation, and establishes a unified $T^{-1}$ lower bound for the analyticity radius for every $α\ge2$. The main novelties are twofold. First, we introduce a normal form reduction at the level of the Gevrey energy, which reveals an additional cancellation in the cubic Gevrey commutator and separates it into a non-accumulating boundary correction and a quartic remainder. Second, we establish a global-in-time periodic $L_{t,x}^4$ estimate for the non-polynomial phase $k|k|^α$, valid for every real $α\ge2$. Together, these ingredients yield a refined almost conservation law and the $T^{-1}$ lower bound for the radius of spatial analyticity.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.06313 ↗

Nonlocal diffusion operators with a drift term naturally arise in models such as moving coordinate systems induced by climate change. This paper systematically studies several concepts of generalized principal eigenvalues (GPEs) for such operators. We allow the dispersal kernel to be heterogeneous and non-symmetric, and remove the standard global upper bound on the kernel (thereby covering the case of heavy-tailed dispersal kernels). To overcome the analytical difficulties brought by this more general setting, we establish a new Harnack-type inequality for non-compactly supported kernels, and apply homogenization and cut-off approximation techniques to derive two-sided bounds for the domain approximation limit of GPEs. Furthermore, under the almost periodic setting, we prove that the GPEs defined through different admissible test function spaces (e.g., \(C^1\) spaces with bounded derivatives and uniformly continuous function spaces in the viscosity sense) are completely coincident. This characterization reveals a fundamental unification: the limit result of principal eigenvalues under domain approximation by Coville and Hamel coincides exactly with the explicit variational formula by Du, Fang, and Ni, thereby bridging two previously independent theoretical results.

comments
34 pages
fields
Analysis of PDEs, Classical Analysis and ODEs
pdf ↗ page arXiv:2611.06316 ↗

We study the Cauchy problem for the parabolic Hardy–Hénon equation $\partial_tu=Δu^m+|x|^σu^p$ with slow diffusion $m>1$ and a potential which is singular at the origin, $-2<σ<0$, in dimension $N\ge3$. Above the Fujita exponent, global and blowing-up solutions coexist, and we show that the spatial decay of the initial data decides between them. The second critical exponent turns out to be the decay rate of an explicit singular steady state. Data decaying more slowly blow up in finite time, whatever their size, while faster decaying data which are small in a weighted supremum norm give rise to global solutions. At the critical decay, and in the range where the singular steady state exists, we construct bounded stationary barriers with exactly critical tail by gluing the singular steady state to regular steady states. We deduce that the critical amplitude separating global existence from blow-up lies between the amplitude of the singular steady state and an explicit constant. We also show that data lying below a proper fraction of the singular steady state produce global bounded solutions, and that the singular amplitude itself is attained by global solutions whenever a Joseph–Lundgren type condition fails. Conjectures and open problems complete the picture.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.06318 ↗

We consider the Lane-Emden problem $-Δu=|u|^{p-1}u$, $p>1$, in bounded domains of a half-cylinder $ω\times(0,+\infty)$, with Dirichlet conditions on the relative boundary and Neumann conditions on the boundary of the cylinder. In flat cylinders $ω\times(0,L)$ this problem admits, for every $p>1$, one-dimensional solutions with any prescribed number $m$ of nodal regions. We study the stability of these domains, as critical points of a related energy functional, with respect to volume-preserving deformations of the domain. We prove that, for $p$ large, the flat cylinders are stable as soon as their height exceeds a threshold growing linearly in $p$, while, for $p$ close to $1$, both stability and instability occur, with explicit thresholds depending on $m$ and on the first nontrivial Neumann eigenvalue of $ω$. These results rely on a detailed analysis of the one-dimensional profiles: we describe their asymptotic behaviour, and that of the first eigenvalue of the associated linearized operator, as $p\to1^+$ and $p\to+\infty$, we obtain expansions of the amplitude with explicit constants, and we prove global comparison results with respect to $p$, some of which are new also for positive solutions.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.06339 ↗

We analyze the unusual microstructure resulting from the cubic to orthorhombic phase transformation in the shape-memory alloy ${\rm Ti}_{76}{\rm Nb}_{22}{\rm Al}_{2}$. This seems to represent an approximate experimental realization of a deformation having a finite number of incompatible deformation gradients, which has been known to exist only as a theoretical possibility. Because the middle eigenvalue $γ$ of the transformation strain is very close to 1, the phase transformation in this alloy takes place via nucleation of exact austenite-martensite interfaces rather than, as usual for other alloys, by classical austenite-martensite interfaces separating the austenite from a finely-twinned laminate of martensite. According to the moving mask approximation of Della Porta this leads to the question whether a microstructure can be formed from the set $H$ of the twelve matrices ${\mathbf V}_i$ on the martensite energy wells that are rank-one connected to the identity, even though these matrices are mutually incompatible. We show that when $γ=1$ and the transformation is volume preserving, such a microstructure is possible that does not deform the grain boundary. This is a consequence of $H$ forming a degenerate $T_{12}$ configuration in the sense of Kirchheim. In fact there are such microstructures supported on just 8 of the 12 matrices in $H$. However there is no deformation satisfying the same boundary condition whose gradient belongs to $H$ almost everywhere. An additional prediction, confirmed experimentally, is that the macroscopic deformation gradient equals the identity everywhere. We also analyse the approximate compatibility of the ${\mathbf V}_i$. Although mutually incompatible, they are nearly compatible, with some pairs much more nearly compatible than others, these pairs corresponding to interfaces that are more frequently observed.

comments
50 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.06383 ↗

We establish the Kato square root property for fractional elliptic operators $L = -\operatorname{div}^α(μ\nabla^α\cdot)$ of order $2α\in (0,2)$ on $\mathbb{R}^d$, built from the Riesz fractional gradient and divergence, with bounded, measurable and uniformly elliptic complex coefficients $μ$. More precisely, we show that the domain of $L^{1/2}$ coincides with the distributional fractional Sobolev space $\mathrm{S}^{α,2}(\mathbb{R}^d)$ and that $\|L^{1/2} u\|_{\mathrm{L}^2} \simeq \|\nabla^αu\|_{\mathrm{L}^2}$, with constants that are locally uniform in $α$. As a consequence, we recover the Kato square root property for elliptic operators $-\operatorname{div}(μ\nabla\cdot)$ in the limit $α\to 1$, and we obtain continuity of the square root with respect to the parameter $α$. The proof follows the second-order approach to the Kato problem. Its two new ingredients are nonlocal off-diagonal estimates of polynomial order for the resolvents of $L$, and a construction of $T(b)$-test functions that circumvents the nonlocality of $\nabla^α$ by factorizing it through Riesz potentials.

comments
41 pages
fields
Analysis of PDEs, Functional Analysis
pdf ↗ page arXiv:2611.06391 ↗

We investigate positive solutions with both components nontrivial for systems of Hammerstein integral equations associated with a general $2\times2$ matrix of Green's kernels, thereby extending the decoupled (diagonal) case to systems with cross-coupling. Such systems arise from boundary value problems in which the unknowns may be coupled both in the differential equations and in the boundary conditions, a setting that has received considerably less attention than the decoupled case. Using a component-wise Krasnosel'skiĭ compression–expansion fixed point theorem in product cones, we derive existence and non-existence criteria. A multiplicity result guaranteeing at least two positive solutions is also obtained, by means of the fixed point index in cones. As an application, we consider radially symmetric solutions for an elliptic system on an annulus with coupled Robin boundary conditions.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.06536 ↗

This paper investigates the time-asymptotic stability of the one-dimensional full compressible Navier-Stokes-Poisson equations, assuming that the corresponding quasi-neutral Euler equations admit a generic Riemann solution consisting of a shock, a contact discontinuity, and a rarefaction wave. It is proved that there exists a unique global-in-time solution, which converges in $L^\infty$ norm, as time goes to infinity, to the ansatz composed of a viscous shock with a time-dependent shift, a viscous contact wave, and an inviscid rarefaction wave. The main difficulty arises from the non-conservative lower-order source terms induced by the electric potential in the momentum and energy equations, which significantly complicates the proof of the existence of individual waves (especially the viscous shock) and the derivation of the relative entropy estimates. To overcome this, we make full use of the Poisson equation satisfied by the electric potential, and combine the weighted relative entropy method with the $a$-contraction method with shifts to close the estimates within the $H^2$-perturbation framework.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.06560 ↗

The analysis of cross-diffusion systems with nonsymmetric and indefinite diffusion matrices often relies on the existence of entropies, that is, Lyapunov functionals whose dissipation often yields gradient estimates. We propose a general strategy for constructing entropies for two-species cross-diffusion systems, based on the assumption that the mobility matrix is symmetric, in accordance with Onsager's reciprocal relations. The symmetry condition leads to a linear hyperbolic equation in two variables, which can be reformulated as a linear transport system along the eigendirections of the diffusion matrix, related to the approach of Jenssen and Kogan for hyperbolic conservation laws. Positive solutions to this system yield a family of entropies parametrized by two arbitrary functions of one variable. Sufficient conditions for their existence on (possibly unbounded) characteristic rectangles are given, the mechanisms that may prevent the existence of an entropy are identified, and systems without any entropy structure are presented. The general construction recovers known entropies for models arising in physics and biology and provides new ones. For systems with an arbitrary number of components, we derive sufficient conditions for the existence of separable entropies and give a rank criterion for the uniqueness of entropies (up to affine functions). Cross-diffusion systems without symmetry of the mobility matrix are also discussed.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.06578 ↗

For every $p>1$, we prove that a nontrivial solution of \begin{equation*} -Δ_pu=f(x,u,\nabla u) \end{equation*} in a planar domain, with $|f(x,s,ξ)|\leq C(|s|^{p-1}+|ξ|^{p-1})$, vanishes neither on an open set nor to infinite order at a point. This allows us to prove unique continuation properties of axially symmetric solutions to $p$-Laplace equations in higher dimensions $N\geq3$, with axially symmetric $p$-harmonic functions as a particular case. Unlike in our previous work, the analysis is based here on the regularity and quasiconformal properties of the whole stress field $|\nabla u|^{p-2}\nabla u$ in the plane, taking into account the more delicate regularity theory for $p>2$. This allows us to prove Liouville-type and bubble profile decomposition results for critical problems in dimensions $N\geq3$ and in the whole range $1<p<N$, under some symmetry conditions.

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

In this paper, we develop a theory of evolution dynamics in a Banach bilateral $\mathbb{H}$-algebra and establish a well-posedness theory for the Cauchy problem of evolution equations with quaternionic variables. First, we study the geometric properties of slice structures of Banach bilateral $\mathbb{H}$-modules. By employing different slice structures, we construct some noncommutative Banach bilateral $\mathbb{H}$-subalgebras which are compatible with the slice regularity of the functions involved. Moreover, through the quaternionic sliced geometric path integral over Banach bilateral $\mathbb{A}$-module, an integral representation of the solution to the homogeneous Cauchy problem with quaternionic variables is obtained in a quaternionic $σ$-ball, and for the first time, a local existence and uniqueness theorem is established for $σ$-analytic solutions. Then the local $σ$-analytic solution is extended to the entire quaternionic spherical sectorial region, thereby proving a global existence and uniqueness theorem for the Cauchy problem. Based on it, the notion of an evolution system in a quaternionic $\mathbb{H}$-algebra is introduced and its core properties are established. In addition, the global existence and uniqueness theorems are obtained under hyperbolic-like and parabolic-like conditions. Finally, the structure of Banach bilateral $\mathbb{H}$-modules and $\mathbb{H}$-algebras is lifted to Banach bilateral $\mathbb{A}$-modules and $\mathbb{A}$-algebras, and a well-posedness theory for evolution equations in this setting is developed. This reveals, from a new perspective, the universality of well-posedness for the Cauchy problem under the generic noncommutative $\mathbb{A}$-algebraic structures.

fields
Analysis of PDEs, Complex Variables
pdf ↗ page arXiv:2611.06721 ↗

This paper is a companion to Part I: Construction of Self-Similar Solutions with Admissible Stress and Flat Remainder (arXiv:2609.35406). Part I constructs approximately self-similar flow profiles with a singular stress in divergence form. The associated velocity becomes unbounded as $t\uparrow 1$. Here, localized oscillatory pulses cancel this stress contribution through their averaged quadratic momentum flux. Successive corrections preserve the velocity growth and leave a smooth external force $f\in C^\infty$. This gives a local solution of the three-dimensional incompressible Navier-Stokes equations with forcing $f$. Its velocity satisfies $\limsup_{t\uparrow 1}\|u(t)\|_{L^\infty}=\infty$. Together, the two papers present a readable and accessible account of OpenAI's Finite Time Blowup for Navier-Stokes. We claim no original mathematical contribution.

comments
105 pages, 6 figures. This article gives a self-contained account of the pulse correction part of OpenAI's paper. We claim no original mathematical contribution
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.06869 ↗

Probability26

In this paper, we study the graph shotgun assembly problem in the labeled lattice model, as introduced by Mossel and Ross (2019). We start with a $d$-dimensional lattice of length $n$, where the color of each vertex is sampled i.i.d. from a distribution $π$. Then, we ask whether it is possible to reconstruct the coloring of the lattice given the coloring of each subgrid of length $k$. While previous work by Ding and Liu (2023) and Demidovich, Panichkin, and Zhukovskii (2023) identified the reconstruction threshold when $π$ is uniform, we examine the non-uniform case. This paper establishes a sufficient condition for the impossibility of reconstruction for $d \geq 2$ using information-theoretic arguments. Our negative result matches the known threshold in the uniform case.

comments
13 pages
fields
Probability, Combinatorics
pdf ↗ page arXiv:2611.05532 ↗

We study the random-cluster model on locally treelike graphs at low temperatures. This is a model of dependent percolation parametrized by an edge probability $p \in (0,1)$ and a clustering weight $q \in [1,\infty)$, generalizing independent Bernoulli percolation ($q=1$) and closely related to the classical ferromagnetic Ising and Potts spin systems at integer $q$. For $q>2$, at parameter $p$ below the tree uniqueness threshold $p_{\mathsf u}(q,d)$, it is expected that sampling is easy and local Markov chains mix rapidly on all graphs with degree bounded by $d$. On typical graphs, the same is predicted at $p>p_{\mathsf s}(q,d)$, where $p_{\mathsf s}(q,d)$ is a second uniqueness transition point on the $d$-regular wired tree. Our result confirms this prediction for random regular graphs, showing that the random-cluster Glauber dynamics mix in time $O(n^{1+o(1)})$ on a random $d$-regular graph for all fixed $q>2$ and $p>p_{\mathsf s}$. For comparison, the best prior sampling results for these models that held for all $p>p_{\mathsf s}$ required $q\gtrsim \log d$ \cite{BGPZ26}. The key difficulty is that simply utilizing the contraction of cavity messages on $d$-regular trees does not suffice to cover the entire regime $q>2$. To address this issue, motivated by \cite{LS26}, we develop a careful bootstrap argument to show the shrinkage of disagreement under grand coupling. The core ideas of the proof were generated using GPT-6 and the Pharos system; the proof was then refined and simplified by the author.

comments
37 pages
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2611.05794 ↗

Let $X,X_1,X_2,\ldots$ be i.i.d.\ random vectors in $\mathbb R^d$, where $d\ge1$ is fixed. Assume that $\mathbb{E} X=0$, $\mathbb{E} XX^\top=I_d$ and $\mathbb{E}\|X\|^3<\infty$. We prove a Cramér type moderate deviation theorem for a multivariate self-normalized radius statistic, that is, for every $a_n=o(n^{1/6})$, \[ \sup_{0\le x\le a_n} \left|\frac{\mathbb{P}(U_{n,+}\ge x)}{\mathbb{P}(χ_d\ge x)}-1\right|\to0, \] where $χ_d$ is the Euclidean norm of a standard normal vector in $\mathbb{R}^d$ and \[ U_{n,+}^2=S_n^\top A_n^+S_n, \qquad S_n=\sum_{j=1}^nX_j, \qquad A_n=\sum_{j=1}^nX_jX_j^\top. \] Here $A_n^+$ denotes the Moore–Penrose inverse. We further prove that the same result holds for the corresponding Hotelling $T^2$ statistic. This work closes the moment gap between the previously known finite $(3+δ)$ moment condition for Hotelling moderate deviations and the finite third moment boundary. Our proof adopts a geometric approach. Truncation at the finite-third-moment scale yields a truncated covariance matrix whose concentration error is negligible relative to the target \(χ_d\) tail. Uniform projected self-normalized moderate deviations are then averaged over directions and, after a whitening map with a ridge term, become a spherical cap transform of the radial distribution. A local Abel inversion recovers the radial tail, and deterministic comparison removes the ridge and the truncation.

comments
25 pages, 2 figures
fields
Probability, Statistics Theory
pdf ↗ page arXiv:2611.05822 ↗

We establish an abstract criterion for large deviations of invariant measures when the deterministic dynamics has a single globally attracting equilibrium. Deterministic regularisation and attraction yield an endpoint estimate for long controlled paths of bounded action, uniformly over each fixed bounded initial set. This allows the finite time Freidlin-Wentzell uniform LDP on bounded initial sets to be combined directly with stationary exponential norm estimates. The proof requires neither a separate exponential tightness argument nor a Dembo-Zeitouni uniform LDP, and imposes no decay condition on differences between controlled trajectories. Finite path approximation identifies the quasipotential as the good rate function. We also establish a variational criterion based on the Boué-Dupuis representation that derives exponential estimates from bounds for controlled outputs, without requiring their convergence. Uniform controlled terminal moments yield estimates uniform in time, which pass to Krylov-Bogoliubov invariant measures. Together, these results establish stationary LDPs in four regimes: two-dimensional Navier-Stokes equations with possibly unbounded, globally Lipschitz, uniformly positive scalar amplitudes and vanishing noise correlation; reaction-diffusion systems without the additional restriction linking noise growth to reaction strength; Allen-Cahn equations with opposite boundary values and globally Lipschitz, uniformly nondegenerate multiplicative space-time white noise on intervals of arbitrary length; and Burgers equations with fixed covariance $(-Δ)^α$, $0\leqα<1/2$. For Burgers, we also obtain Gaussian norm estimates.

comments
65 pages
fields
Probability, Analysis of PDEs
pdf ↗ page arXiv:2611.05830 ↗

We prove that the centered height function of the Airy$_β$ line ensemble converges for each $β>0$, under rescaling of space and time variables, towards the Gaussian free field in the half-plane. The conformal structure for GFF involves the spatial change of coordinate $x\mapsto \sqrt{-x}$. The $β$--dependence is isolated in the field rescaling by $\sqrtβ$. For the proofs we study the asymptotic expansions of the moments of Laplace transforms of the Airy$_β$ line ensemble developed in our previous work with Xu.

comments
47 pages, 9 figures
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2611.05852 ↗

We study occupation measures associated with stochastic approximation recursions within the ordinary differential equation (ODE) method. Under Lyapunov conditions ensuring that the limiting ODE has a globally exponentially stable equilibrium, we establish that the continuous-time occupation measures associated with the piecewise linear interpolation of the iterates converge almost surely in the $2$-Wasserstein topology to the Dirac mass at the equilibrium, the unique invariant probability measure of the limiting semiflow. The choice of the $2$-Wasserstein distance is naturally aligned with our continuous- and discrete-time Lyapunov drift analysis. We also consider two discrete-time sequences of occupation measures, induced by the algorithmic time scale and the iteration count, respectively, and we establish their almost sure convergence to the same invariant measure in the $2$-Wasserstein distance. We then derive corresponding convergence rates in expectation, providing a nonasymptotic complement to the almost sure results. These expectation bounds also imply some tail probability estimates. Finally, we verify that our results apply to a canonical class of linear recursions.

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

Functional Non-Central Limit Theorems (NCLTs) are derived, in the functional spectral domain (see RuizMedina, 2022), for square integrable transformations, mapping an H_{1}-valued Gaussian stationary functional sequence into a nonlinear H_{2}-valued sequence, where H_{1} and H_{2} are separable Hilbert spaces. Linear and nonlinear operator-based scalings are considered, leading to different limit LRD Hermite functional processes. Under bounded linear operator scalings, an infinite-dimensional version of Theorem 5.3.1 in Pipiras and Taqqu (2017) is obtained, involving a functional reduction theorem, extending Theorem 5.3.3 in Pipiras and Taqqu (2017). Alternatively, when an operator-valued exponent based nonlinear scaling is applied, we pay attention to the LRD dominant set at each active output direction, in the leading chaos. Both scaling scenarios allow the derivation of NCLTs under similar settings of conditions.

fields
Probability
pdf ↗ page arXiv:2611.06011 ↗

We derive maximal mean-square adiabatic estimates for finite-dimensional stochastic Schrödinger equations with Hamiltonian-proportional Wiener noise. For deterministic $C^2$ Hamiltonians whose eigenvalues have constant multiplicities and do not cross on $[0,1]$, we construct a unitary stochastic adiabatic intertwiner driven by the same Wiener process as the exact propagator. A commutator argument, Itô calculus, and Doob's maximal inequality yield an explicit bound for the expected supremum of their squared operator-norm difference on a selected initial eigenspace. Under uniform coefficient bounds, the physical noise scaling $α=σT^{-γ}$, where $T$ is the total evolution time and $σ\geq0$ and $γ\geq0$ are fixed, gives maximal mean-square error $O(T^{-2}+σ^4T^{-4γ}+σ^2T^{-(2γ+1)})$. Consequently, adiabatic convergence holds for every $γ>0$ as $T\to\infty$, while $γ\geq1/2$ recovers the deterministic $O(T^{-1})$ bound for the root-mean-square maximal error. For fixed nonzero physical noise amplitude, the estimate leaves convergence unresolved.

fields
Probability
pdf ↗ page arXiv:2611.06029 ↗

Understanding how self-sustaining chemical reaction networks can emerge from simple molecules is an important question in chemical approaches to the origin of life. Reflexively autocatalytic and food-generated (RAF) sets provide a mathematical framework for investigating this question. This line of research goes back to the early work of Kauffman on autocatalytic reaction networks and was subsequently developed through the probabilistic framework of Mossel and Steel. Further contributions by Hordijk, Steel, and collaborators extended the theory to more heterogeneous forms of catalysis, including reaction-dependent probabilities or power-law distributions of catalytic activity. We introduce a stochastic model that combines heterogeneous molecular catalytic activity with reaction-dependent molecule-reaction compatibility. By assigning random catalytic weights to molecules and incorporating compatibility through an explicit formulation of catalysis probabilities, our model provides a concrete and flexible setting that captures both sources of heterogeneity while remaining mathematically tractable. We establish novel and general criteria for RAF formation and nonformation. We further demonstrate that classical phase-transition criteria need not remain valid in the presence of reaction-dependent catalysis. For heavy-tailed catalytic weights, we identify and rigorously quantify an additional phase transition. In models with finite-mean catalytic weights, RAF formation and nonformation are governed by a catalytic intensity parameter. For infinite-mean weights, however, we show that RAFs may emerge with probability tending to one even when the catalytic intensity parameter tends to zero.

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

Deep learning-based super-resolution (SR) can reconstruct fine-scale Earth-observation fields from coarse observations, but reconstruction accuracy alone does not provide a calibrated rule for identifying reliable spatial regions. Conformal Mask Calibration (CMC), built on conformal risk control, converts a spatial uncertainty score into a trust mask and controls the expected worst-case local distortion under exchangeability. However, its fixed threshold can become miscalibrated in Earth-observation streams affected by seasonality and episodic events. We propose $\textit{CARM}$ (Conformal Adaptive Risk Masking), a statistical framework for adaptive spatial risk control under temporal distribution shift. CARM maintains experts with heterogeneous update rates and aggregates their threshold proposals online using an asymmetric surrogate loss, balancing rapid adaptation to distribution changes against stability during relatively stationary periods. All updates are causal and use only mature feedback available after a fixed delay, allowing CARM to operate with any SR model that provides a spatial uncertainty score. We prove that the time-averaged mask-conditioned risk converges to at most $α$ at an $O(1/T)$ rate, without distributional assumptions and for any choice of aggregation weights across experts. On a daily South China Sea chlorophyll-$\textit{a}$ SR stream, CARM reduces the empirical violation rate from $43.49\%$ to $9.38\%$ and the moving-average exceedance frequency from $47.29\%$ to $1.22\%$ at $α=0.10$, while retaining a non-trivial trusted region. Experiments on ERA5 wind and OSTIA sea-surface temperature further show consistent relative improvements across multiple SR backbones.

fields
Probability
pdf ↗ page arXiv:2611.06151 ↗

Random spherical eigenfunctions for the Lalplace-Beltrami operator are well understood and their local behavior, after renormalization, is described by Berry's random wave model. In this paper we construct a family of random fields on the sphere $\mathbb{S}^{3}$, identified with the group $SU(2)$, endowed with a sub-Riemannian structure. These fields are random eigenfunctions for the sub-Laplacian and they are constructed from matrix elements of unitary irreducible representations of $SU(2)$. We prove that the local behavior of such fields is the same as the Berry-Heisenberg random field on the Heisenberg group introduced in [10].

fields
Probability
pdf ↗ page arXiv:2611.06218 ↗

We consider a system of $N$ parallel, homogeneous servers, each with finite capacity $C$. Jobs requiring one unit of capacity arrive according to a Poisson process with total rate $Nλ$ and have exponential service times with rate $μ$. We study a decentralized random–retrial policy with $d$ attempts: upon arrival, a job is assigned to a uniformly chosen server; if the server is full, the job is reassigned to another uniformly chosen server, for at most $d$ attempts; if all $d$ attempts fail, the job is rejected. In the mean-field limit, we prove that the stationary blocking probability is characterized by the unique solution of a fixed-point equation involving the Erlang-B loss function, and we establish global convergence of the fluid model to this equilibrium. We also compare the mean-field stationary blocking probability with the analogous quantity in the power-of-$d$ model under the same parameters $(C,λ,μ)$. For the same $d$, we show, via coupling techniques, that the blocking probability under power-of-$d$ is always less than or equal to the blocking under retrial-of-$d$; but if we consider $d$ and $\tilde d$ with $\tilde d>d$, then the retrial-of-$\tilde d$ policy achieves a strictly lower blocking than the power-of-$d$ policy when $ρ=λ/μ$ is sufficiently large. Moreover we show that for some specific cases, like $C=2$, $d=2$ and $\tilde d=3$, it occurs for all $ρ>0$, not only for $ρ$ sufficiently large. We complement the analysis with simulations that estimate the load level above which retrial-of-$\tilde d$ outperforms power-of-$d$ in terms of blocking.

fields
Probability
pdf ↗ page arXiv:2611.06267 ↗

We study the critical Brownian loop soup on the metric graph $\widetilde{\mathbb Z}^d$. Using a new unified approach, we determine the one-arm probability up to multiplicative constants in all dimensions $d\ge3$. In particular, at the upper critical dimension $d_c=6$, we show that the one-arm probability is comparable to $r^{-2}(\log r)^{\frac12}$, and moreover, with high probability a box of radius $r$ contains on the order of $\log r$ macroscopic clusters, each with volume of order $r^4(\log r)^{-\frac12}$. For $d\ne6$, we recover the one-arm estimates of Cai and Ding, $r^{-(d-2)/2}$ for $d=3,4,5$ and $r^{-2}$ for $d>6$ (arXiv:2406.02397; Probab. Theory Relat. Fields, 2025), and the three-dimensional estimate of Drewitz, Prévost and Rodriguez (Probab. Theory Relat. Fields, 2026). Our proof adapts the entropy method of Dewan and Muirhead (Probab. Theory Relat. Fields, 2023) to the loop-soup setting. This yields a renormalization inequality for the one-arm probability, from which we derive the upper bounds. Independently, Rodriguez, Shi, and Zhang (arXiv:2611.05357) have recently used a closely related entropy approach to recover the one-arm estimates for $d>6$ and improve the upper bound for $d=6$. They also announce the same sharp one-arm estimate for $d=6$ in forthcoming work.

comments
44 pages
fields
Probability
pdf ↗ page arXiv:2611.06298 ↗

We prove that the hydrodynamic limit of the asymmetric Brownian energy process (ABEP) is the viscous Burgers equation. We also prove the hydrodynamic limit of the dynamic ABEP which leads to a nonlinear equation for the macroscopic tail-energy potential. Both processes are related to the Brownian energy process (BEP) through invertible, non-local transformations involving discrete tail energies, which can be thought of as the microscopic equivalent of a transformation of Cole-Hopf type. Our main tool is a general micro-to-macro result showing that, under suitable conditions, such microscopic tail transformations induce corresponding transformations of the limiting density profiles. Combining this result with the fact that the hydrodynamic limit of BEP is the heat equation, we obtain the limiting profiles of ABEP and dynamic ABEP as explicit nonlinear transformations of solutions of the heat equation.

fields
Probability
pdf ↗ page arXiv:2611.06361 ↗

This work proves existence of contours independent of probability level for exact quantile integrals of strictly positive real-analytic densities. Explicit constructions cover five broad distribution families and yield a finite-interval representation of Black-Scholes implied volatility using forward functions.

fields
Probability
pdf ↗ page arXiv:2611.06459 ↗

This paper investigates the small inertia limit of the distribution-dependent stochastic Cucker–Smale equation with the full velocity alignment source term, which serves as the mean-field equation for the stochastic Cucker–Smale model. Inspired by the idea of Hottovy et al. \cite{Hottovy2015} to rearrange SDEs via integration by parts, we repeatedly perform integration by parts on independent copies of our equation. Then we define a global position correction and a quadratic remainder, both with uniformly bounded tails. Applying the Aldous criterion, we obtain tightness of the position correction, which in turn yields tightness of the position process. Subsequently, using the averaging method on the fast time scale, the quadratic functional can be decomposed into the equilibrium average, local quadratic fluctuations, and exponential transients. Then, the Poisson–Lyapunov equation is employed to prove the convergence of the time integral. Finally, under various suitable assumptions, we obtain the weak convergence of the laws of the approximating processes to the law of the solution of the small-inertia limit equation, along with the identification of the limiting process, and also the convergence rate of strong $L^1$-convergence. The extra noise-induced drift term can be expressed as the solution of a contraction-type Fredholm equation. This paper is complementary to the deterministic particle limit work of \cite{Carrillo2021,Choi2021} .

fields
Probability
pdf ↗ page arXiv:2611.06511 ↗

This paper is devoted to the study of the joint tails of local times at two distinct sites for branching random walks (BRWs). Our principle results establish a general Green-function criterion for two-sided exponential tail bounds with a common spatial factor given by a three-point Green function convolution, and further identify a strict inequality that must be satisfied by the corresponding exponential constants. In particular, we verify this criterion for subcritical BRWs on finitely generated groups, for critical BRWs on non-elementary hyperbolic groups, and for critical BRWs on $\mathbb{Z}^d$ with $d\geq 5$. As applications, we revisit the growth rate of visited sites on spheres in hyperbolic groups obtained by Sidoravicius et al. [Commun. Pure Appl. Math. 2023], and also establish lower bounds for the probabilities of visiting finite sets in Euclidean lattices.

comments
31 pages
fields
Probability
pdf ↗ page arXiv:2611.06561 ↗

A unified approach for studying the linear eigenvalue statistics (LES) of generalized patterned random matrices was developed in Kumar, Maurya, Saha (2026). In this paper, as a continuation, we develop a unified method for studying the time-dependent LES of generalized patterned random matrices with independent process entries such as Brownian motion and Ornstein-Uhlenbeck process. We prove that if the limiting moment sequence of the LES of the generalized patterned random matrix with independent standard Gaussian entries is M-determinate, then under some minimal assumption on the link function, the time-dependent LES converges to a deterministic real-valued process.

comments
14 pages. Comments are welcome
fields
Probability
pdf ↗ page arXiv:2611.06686 ↗

We study the one-arm probability of the discrete random-walk loop soup on $\mathbb{Z}^4$ at small positive intensity. Using the small-loop crossing and macroscopic attachment estimates of Gao, we prove that the expected capacity of the origin cluster formed by loops contained in a box grows at most as the square of the logarithm of the box radius. Consequently, there are constants $α_0,c,C,β>0$ such that, for $0<α\leα_0$, \[ cαR^{-2}[\log(R+2)]^{βα} \le \mathbb{P}_α(0\leftrightarrow B_R^c) \le CαR^{-2}[\log(R+2)]^2. \] The interval $(0,α_0]$ is strictly subcritical. The upper bound rests on a simultaneous capacity estimate for neighborhoods of loop ranges, followed by an expansion over chains in which sufficiently small intermediate loops have been removed. A deterministic bound on the variation of the surviving scale sequences makes the expansion summable. The positive logarithmic-power lower bound is already known from work of Chang and Sapozhnikov; we give a proof using macroscopic attachments and a layer-cake argument, with constants uniform at small intensity. In particular, the one-arm exponent equals two, and the logarithm of its correction has order $\log\log R$, for every fixed intensity in this interval. We also derive polynomial tail exponent one for the cardinality and capacity of the full cluster, determine their positive moment thresholds, and give an application to random wires.

comments
50 pages, 5 figures
fields
Probability
pdf ↗ page arXiv:2611.06691 ↗

A $(d+1)$-state lattice is the smallest complete one-step approximation of a $d$-dimensional Brownian market. Its centered quadratic increments must lie in the span of the traded innovations. We study the resulting Gamma-to-Delta aliasing through the linear operator $\mathcal{A}_ξ(H)=\mathbb{E}[(ξ^\top Hξ-\operatorname{tr} H)ξ]$, $H\in\operatorname{Sym}_d$, for centered isotropic innovations $ξ$. For quadratic claims this operator is exactly the difference, scaled by $\sqrt{h}/2$, between the lattice's replicating exposure and its price-sensitivity Delta. Applying the lattice replication rule to a Brownian market adds the tracking-error variance $hT|\mathcal{A}_ξ(H)|^2/4$ relative to ordinary discrete Delta hedging. We prove that the smallest worst-case aliasing over all minimally complete lattices is $\sqrt{d-1}$, uniquely attained by the equal-probability regular simplex. For positive-semidefinite and rank-one unit-Frobenius Gamma classes, the sharp minimax value is instead $(d-1)/\sqrt{d}$, with the same unique optimizer. We also describe the corresponding orthogonal quadratic residual in nonminimal markets and the leading implementation error for smooth claims.

comments
20 pages
fields
Probability
pdf ↗ page arXiv:2611.06692 ↗

We establish universal logarithmic laws for extreme least singular values of random row submatrices and for the global stability of real phase retrieval near its injectivity threshold. Let $A_m\in\mathbb{R}^{N_m\times m}$ have i.i.d. entries distributed as a centered, variance-one real subgaussian random variable with a bounded Lebesgue density, and suppose $N_m/m\toγ>1$. For integers $0\le r_m\le N_m-m$, let $M_{m,r_m}(A_m)$ be the minimum least singular value over all row submatrices of $A_m$ with $m+r_m$ rows. Writing $k_m=r_m+1$, we prove that whenever $k_m\log m=o(m)$, $(k_m/m)\log M_{m,r_m}(A_m)$ converges in probability to $-h(γ)$, where $h(γ)=γ\logγ-(γ-1)\log(γ-1)$. This covers both fixed and moderately growing surplus. The limiting rate is universal within the stated class of entry distributions. For real phase retrieval from $N_m=2m-1+r_m$ amplitude measurements, let $L_{A_m}$ denote the optimal lower Lipschitz constant of the map $x\mapsto|A_mx|$, with signals identified up to sign, and let $κ_{\mathrm{ph}}(A_m)=\|A_m\|_{\mathrm{op}}/L_{A_m}$ be its scale-invariant global condition number. In the same surplus regime, $(k_m/m)\log L_{A_m}$ and $(k_m/m)\logκ_{\mathrm{ph}}(A_m)$ converge in probability to $-\log 4$ and $\log 4$, respectively. Although these measurements determine every signal up to sign almost surely, the condition number grows exponentially in dimension for fixed surplus and exceeds every fixed power of $m$ throughout the stated regime, with probability tending to one. These conclusions quantify the distinction between uniqueness and uniform stability under measurement noise. All stated limits also hold almost surely on any common probability space, without requiring independence across dimensions.

comments
28 pages
fields
Probability
pdf ↗ page arXiv:2611.06736 ↗

In classical optimal transport, the equivalence of optimality, convex gradient structure, and cyclical monotonicity is a central paradigm. Known counterexamples to this equivalence rely on carefully constructed costs. In contrast, we show that this equivalence can fail in martingale transport in dimension ${d \ge 2}$: already for the canonical martingale Benamou-Brenier problem and irreducible marginals we have the strict inclusions \[ \text{optimality} \;\subsetneq \; \text{(Bass) convex gradient structure} \;\subsetneq\; \text{martingale cyclical monotonicity}\, . \] However, under the stronger assumption of strict irreducibility, we establish that these three notions coincide. Understanding when the gradient structure guarantees optimality is also of practical relevance, since algorithms based on the Bass gradient representation are used in financial model calibration. All our counterexamples are based on the following phenomenon: for $d\ge2$, there exist two one-step martingales $X,Y$ with the same initial and terminal laws, and a convex function $ψ$ such that \[ 0=\mathbb E\big[\mathbb E[ψ(Y_1)\mid Y_0]-ψ(Y_0)\big] < \mathbb E\big[\mathbb E[ψ(X_1)\mid X_0]-ψ(X_0)\big] <\infty. \]

fields
Probability
pdf ↗ page arXiv:2611.06758 ↗

We study the number of infinite clusters in the $2dp$-neighbor graph on $\mathbb Z^d$, $d\ge2$, in which every vertex independently selects $\lfloor 2dp\rfloor$ of its nearest neighbors uniformly at random, and one more with probability $2dp-\lfloor 2dp\rfloor$. The model has negatively correlated edges and, for $1\le2dp\le2d-1$, neither finite energy nor insertion or deletion tolerance. We prove that the undirected graph has at most one infinite cluster for every $p\in [0,1]$, and that in the planar case the same holds for forward and strong forward clusters of the directed graph when $p\in[1/2,1]$. We further exhibit a second phase transition: for $p\ge(d+1)/(2d)$ the open cluster of the origin is almost surely the whole lattice, and for $p>(d+1)/(2d)$ any two vertices of a box are connected inside the box of twice the size with probability exponentially close to one. In particular, the percolation function is continuous but not analytic on the supercritical interval $(p_c,1]$. Finally, we prove that the full-coverage phase transition at $p_f = (d+1)/2d$ is of order $2^d$.

comments
25 pages, 6 figures
fields
Probability
pdf ↗ page arXiv:2611.06800 ↗

How well can two independent random samples from a metric measure space be matched while preserving pairwise distances? Concretely, given two independent copies, each of $n$ points sampled from the space, what is their typical metric distortion as finite $n$-point metric spaces? We prove that the space $[0,1]$ equipped with the uniform measure already exhibits a rich behavior. We show that with high probability the distortion of the two independent samples is $n^{2/3}$ up to polylogarithmic factors. The lower bound reflects two competing obstructions. A bijection that maps points close to their original positions or their reflections in $[0,1]$ must expand the smallest gaps, in both directions. On the other hand, we show that large displacement from both the identity and reflection itself forces large distortion. Balancing these obstructions yields the lower-bound exponent $2/3$. For the upper bound, we construct a partial matching of the points that maps each gap between consecutive points of length $d\lesssim n^{-4/3}$ to a pair at distance $\widetilde{O}(dn^{1/3})$, with analogous control in the reverse direction. We then use a delicate multiscale oscillation construction to extend this partial matching to a low-distortion bijection.

comments
47 pages, 9 figures. Includes a six-page technical overview explaining the main ideas and proof techniques
fields
Probability, Combinatorics, Metric Geometry
pdf ↗ page arXiv:2611.06845 ↗

The degree distribution is among the most basic summaries of a network, yet no functional limit theorem for the empirical degree distribution of graphon models has been available, even for dense, bounded graphons, for which only finite-dimensional results were known. We study the empirical degree distribution of sparse $L^p$ graphon models, allowing unbounded kernels and hence heavy-tailed degrees. For graphons whose latent expected degrees have a density, we prove a finite-dimensional central limit theorem whenever $nρ_n/\log n\to\infty$ and $nρ_n^{2+β}\to0$, where $ρ_n$ is the sparsity level and the kernel has $2+β$ moments for some $β>0$; the limiting covariance coincides with that of the dense case. Under additional local regularity, we establish a functional central limit theorem on compact intervals in the interior of the support. Under tail regularity and a stronger sparsity condition, we prove that uniformity extends to unbounded intervals. We also show that uniform limits fail at atoms of the degree distribution, for instance in stochastic block models. The analysis rests on an exact multilinear representation of the conditional degree distribution, which identifies its Hoeffding decomposition without Edgeworth expansions, combined with a lattice version of Billingsley's tightness criterion and moment inequalities of Efron-Stein type.

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

We consider a random growing graph model with two \emph{types}, or \emph{communities}, that belongs to the class of preferential attachment models. Starting from an initial graph $G_0$ in which each node has a type, the graph $G_{n+1}$ is generated by addition of a new node, which attaches through an edge to a node $v$ of $G_n$. The probability of attaching to $v$ depends on the communities of both the new node and $v$, and is proportional to $\operatorname{deg}_n(v)^γ$, where $γ\in[0, 1]$. We establish a convergence result for the limiting proportion of vertices of each degree and in each community in a certain regime of the parameter $γ$. To this end, we first use stochastic approximation techniques to reduce the convergence problem to the study of a non-linear evolution equation. We then use a probabilistic coupling approach to investigate the long-time behavior of the unique solution to this evolution equation. We emphasize that the techniques previously used to handle the single-community case cannot be extended directly to our setting. Indeed, the associated continuous-time embedding is not a multitype branching process in the usual sense, since the transition rates at any given time $t$ depend on the entire graph structure at that time.

fields
Probability
pdf ↗ page arXiv:2611.06904 ↗

Mathematical Physics25

We introduce a graph invariant obtained from Pauli decompositions of Hamiltonians derived from local graph neighborhoods. Given a rooted h-hop neighborhood, we construct a local adjacency operator, embed it into a common Hilbert space dimension, and define its Pauli-support set as the collection of Pauli strings appearing with nonzero coefficients. For periodic graphs, we prove invariance under lattice-compatible graph equivalence and establish converse results under root-separation hypothesis. The framework naturally extends to Lie closures, commutants, and Cartan-type structures generated by the associated Pauli supports. We further discuss extensions to aperiodic graphs with finite local complexity and make connections to cut-and-project models of quasicrystals and notably, Penrose tilings. From a quantum information perspective, the resulting invariants provide a operator-theoretic description of graph-based Hamiltonians and offer a new mechanism for comparing graph-based quantum systems through Pauli-support data.

comments
25 pages, 6 figures, 1 table
fields
Mathematical Physics, Operator Algebras
pdf ↗ page arXiv:2609.14209 ↗

Quantum speed limits bound the time required for a given state to evolve into a given subspace of the Hilbert space under specific energy constraints. We prove that for several standard orthogonalization time bounds, the unique spectral measure associated with the initial vector that saturates the bound is a sum of two Dirac measures. Furthermore, we constrain the families of spectral measures that come arbitrarily close to these bounds and construct examples with measures which are purely absolutely continuous and purely singular continuous with respect to the Lebesgue measure. As a complementary perspective, we discuss the geometric intuition behind quantum speed limits provided by the numerical range of the evolution operator.

comments
23 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.05462 ↗

We study the spectral theory of the massive scalar kinetic operator on spherical space forms $Γ\backslash S^{3}$, where $Γ$ is a finite subgroup of $\mathrm{SO}(4)$ acting freely on $S^{3}$. Using the Peter-Weyl theorem and Molien series we compute the spectrum of the Laplace-Beltrami operator on $Γ\backslash S^3$ directly from representation theory, obtaining the eigenvalues and their multiplicities for all lens spaces $L(p,q)$ and for each ADE-class of finite subgroups of $\mathrm{SU}(2)$, which includes homogeneous lens spaces, prism spaces and quotients by the binary tetrahedral, octahedral and icosahedral groups, the last also known as the Poincaré homology sphere. For homogeneous quotients by subgroups of even order, we construct the meromorphic continuation of the spectral zeta function of the massive kinetic operator and obtain the general zeta-regularized determinant in closed form. The determinant is expressed as a finite sum of polylogarithms, valid for all real mass, and depends on $Γ$ only through its order and a finite set of parameters which we call twist coefficients fixed by the dimensions of the $Γ$-invariant subspaces. As a complementary approach, we express the heat trace of the kinetic operator on spherical space forms in terms of Jacobi theta functions, whose modular properties relate the spectral zeta function to geometric data, the volume and closed geodesic lengths of $Γ\backslash S^3$. We find that the spectral zeta function admits a rapidly convergent expansion in the heavy mass sector in terms of modified Bessel functions, and provides an independent check on the determinant. This framework extends to quotients of higher-dimensional manifolds directly, which we outline for future work.

comments
64 pages plus appendices, in preparation for submission to the Journal of Mathematical Physics
fields
Mathematical Physics
pdf ↗ page arXiv:2611.05490 ↗

Quantum mechanics is inherently geometric in that the pure states form a curved complex manifold and the Schrödinger evolution defines a Hamiltonian flow on this space. Geometry identifies constraints on flows on quantum state-space that hold independently of their microscopic realization. We uncover such universal behavior in families of geodesic paths on the quantum state-space using the Raychaudhuri-Ehlers equations. We show that the complex structure leads to tidal anisotropy in the curvature, and for Hilbert space dimension $N\geq3$, complete point-emitted geodesic bundles necessarily develop shear and undergo direction-selective focusing at finite distance. We give these geometric results an information-theoretic interpretation in terms of fidelity susceptibility and quantum Fisher information. For ground-state manifolds constrained by physical parameters, we resolve the tidal curvature into Berry-curvature-dependent ambient tides and contributions from extrinsic bending within the full ambient state space. We further relate extrinsic bending to variations in the unitary generator of motion along intrinsic geodesics. We present exact many-body geometric results for the transverse-field XY spin chain. The product structure of the ground state leads to an exact cancellation of the ambient tide, including its Berry-curvature enhancement, by extrinsic curvature contributions. At the zero-field Ising point, we obtain exact results at finite size and show that the shear source for anisotropy-directed motion is entirely extrinsic relative to the full many-body state-space. For the metric in the thermodynamic limit, the geodesic families exhibit repeated $A_2$ fold catastrophes inside the ferromagnetic phase. Our framework thus separates universal state-space effects from those of physical restrictions and exposes their consequences in a paradigmatic many-body system.

comments
43 pages, 6 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.05499 ↗

The transition from rough to frozen phases in models of random surfaces is expected to be governed by the Pokrovsky-Talapov law, which predicts a $\varepsilon^{3/2}$-type singularity of the macroscopic height profile (limit shape), as the distance $\varepsilon$ from the frozen phase (facet) is sent to zero. This has been proved so far only in exactly solvable cases, notably the classical, determinantal, 2D dimer model. In this paper we prove the validity of the Pokrovsky-Talapov law for a non-integrable 2D dimer model on the hexagonal lattice, whose Gibbs weight depends upon a weak plaquette interaction among dimers. Our proof is based on a multiscale analysis (constructive fermionic Renormalization Group), which allows us to identify two different regimes with distinct scaling properties and to explain the universality of the Pokrovsky-Talapov exponent $3/2$, in contrast with the interaction-dependent critical exponents characterizing the rough phase. The first regime, corresponding to smaller distances, is characterized by an effective quadratic dispersion relation, while the second comes with an effective linear dispersion relation, typical of Luttinger liquid behavior. As a byproduct of our construction, we control the scaling limit of the interacting dimer model uniformly in the distance from the frozen phase.

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

The Stroh sextic formalism, developed by Stroh, offers a compelling framework for representing the equilibrium equations in anisotropic elasticity. This approach has proven particularly effective for studying multilayered structures and time-harmonic problems, owing to its ability to seamlessly integrate physical constraints into the analysis. By recognizing that the Stroh formalism aligns with the canonical Hamiltonian structure, this work extends its application to Biot's poroelasticity, focusing on scenarios where the solid material is incompressible and there is no fluid pressure gradient. The study introduces a novel Hamiltonian-based approach to analyze such systems, offering deeper insights into the interplay between solid incompressibility and fluid-solid coupling. A key novelty lies in the derivation of canonical equations under these constraints, enabling clearer interpretations of reversible poroelastic behavior. However, the framework assumes perfectly drained conditions and neglects dissipative effects, which limits its applicability to fully realistic scenarios involving energy loss or complex fluid dynamics. Despite this limitation, the work provides a foundational step toward understanding constrained poroelastic systems and paves the way for future extensions to more general cases, including dissipative and nonlinear regimes.

journal
Mathematics, 2025, 13 (9), 143
fields
Mathematical Physics
pdf ↗ page arXiv:2611.05554 ↗

Considering the ideal limit where the speed of light is infinite, or more precisely where the permittivity and permeability of the vaccuum are both zero, we construct a new type of electromagnetic circuit that we name an EM-loop circuit. These consist of wires having very high permittivity (E-wires) and wires having very high permeability (M-wires). These are threaded together by coils, the E-wire loops and M-wire loops. Some of the loops are terminal loops, pierced by an applied magnetic flux (for E-wire loops) or an applied displacement field (for M-wire loops) that are outside the vacuum since it does not support these fields. The response is the net flux of displacement field through a cross section of each E-wire terminal loop and the net magnetic flux through a cross section of each terminal M-wire loop. To calculate this response, the fields at the internal loops (those that are not terminal loops) are eliminated from the equations.It turns out that the response is governed by a new class of function pairs - dual Herglotz functions. Superpositions of a special class of EM-loop circuits, termed fundamental, allow us to realize any pair of dual Herglotz functions. Thus, we have obtained a complete characterization of the response functions of EM-loop circuits.

comments
19 pages, 6 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.05606 ↗

We prove a liquid vapor phase transition for a quantum system of particles in the continuum. The system is the quantum version with Boltzmann statistics of the point particles model introduced in by Lebowitz, Mazel and Presutti.

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

It is shown that a level $k$ Abelian lattice Chern-Simons theory with continuum time and a spatial square lattice, which is a topological field theory on the latticized plane and torus, when quantized on a spatial cylinder reduces to chiral edge excitations, exactly localized on the two boundaries and carrying two commuting lattice versions of the level-$k$ $U(1)$ Kac-Moody algebra of opposite chirality. The algebras are represented on a Fock space in the noncompact theory and by a finite Weyl algebra in the compact one. We also observe that the theory has a natural framing of Wilson loops which exhibits the correct framing anomaly.

comments
5 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.05663 ↗

We translate the spectral gap-closing criterion for multi-dimensional monotone quasiperiodic Schrödinger operators into a concrete dynamical protocol and verify it by large-scale numerics. For a non-principal label we construct a sampling function whose leading eigenfunction weight at the origin vanishes; a local bump then drives the residual weight through zero. The height of a weighted oscillatory time average of the origin-to-localization-center correlator exhibits a deep minimum precisely at the closing, while the site-control label remains featureless and orders of magnitude larger. The signature is robust and maps directly onto superconducting-circuit and photonic platforms.

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

Data-driven methods can recover compact equations, yet the physical dependence of their coefficients across operating conditions often remains unresolved. Dimensionless groups can explain this variation, but selecting relevant groups from the many dimensionally admissible combinations remains challenging. Here, we introduce a knowledge-guided framework for dimensionless learning, called π-former. It learns patterns of variable association and exponent assignment from a corpus of 1,288 established dimensionless groups. Under exact dimensional constraints, the model proposes interpretable basic groups whose combinations are optimized against observations. Across seven physical problems, the framework identifies predictive dimensionless coordinates within seconds. Integration with equation discovery further expresses condition-dependent coefficients through these coordinates, recovering established physical scalings in multi-condition simulations. Applied to experimental measurements of evaporation-driven wetting, the framework discovers dimensionless coordinates and uses them to construct a unified trajectory equation. The resulting model generalizes to held-out conditions across liquids and initial volumes, outperforming existing empirical models. These results establish dimensionless learning as a transferable bridge between accumulated scientific knowledge and data-driven equation discovery, enabling artificial intelligence to uncover physically meaningful laws from observations.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.05780 ↗

Measured voltage and current waveforms may be represented in a reference frame whose frequency differs from the physical fundamental frequency. Reactive-power readouts calculated from such frequency-shifted coordinates may change if their readout operators are not transformed consistently. This paper presents a frequency-frame covariance formulation for finite-spectrum, zero-mean periodic waveforms with complete harmonic information over one physical period. A necessary and sufficient covariance condition is derived, requiring the readout operator to transform consistently with the waveform representation. Consequently, frequency-dependent harmonic weights must be evaluated at physical harmonic orders rather than relative frame labels. In particular, the derivative/Iliovici readout equals a relative-derivative contribution plus an explicit reference contribution. The formulation also separates readout-operator errors from errors caused by changes in the physical components retained by waveform projections. Three analytical cases illustrate conditional carrier recovery for a memoryless resistor, physical-frequency weighting at relative zero in an RLC branch, and the possibility that an exact reactive-power scalar can coexist with a substantial waveform error after projection. The scope is deterministic calculation consistency in frequency-shifted coordinates rather than instrument measurement uncertainty.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.05913 ↗

We formulate condensation compatible with a specified separable generalized gauging operation in a unitary (2 + 1)-dimensional defect realization. Compatibility is a coherent reversible crossing of the full condensate algebra, retaining charged channels and the marked condensation interface. The resulting composite network determines the transported condensate, the induced operation, and a commuting square of specified walls. For connected gauging data, compatibility admits a central matching description that retains the transported condensate and its algebra identification on the specified wall. The specified unit may absorb a nontrivial parent anyon algebra; strong connectedness appears only as the transparent-unit specialization. We distinguish original vacuum insertions, vacuum branches after unit absorption, and the full vacuum algebra of the final phase, and we prove a complete Higgs criterion that incorporates the parent algebra absorbed by the specified unit. In the toric-code example of a non-invertible subgroup gauging we classify the compatible condensations for the fixed operation, exhibit two inequivalent crossings of the same parent condensate that lead to different final phases, and analyse a pure condensation operation in which the specified unit absorbs the parent electric condensate and produces additional final vacuum operators. The transparent-unit case recovers reverse-condensation transport and the vacuum-overlap formula, and the three complete Higgs conditions appear as a corollary of the general criterion.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.06104 ↗

We express the stochastic limit (weak-coupling limit) of a quantum system interacting with its environment as the limit of solutions to a parametrized family of quantum stochastic differential equations (QSDEs). We prove the convergence of such solutions in the case where the driving processes may be non-Markovian and the system may be infinite-dimensional with unbounded Hamiltonian. We achieve this by imposing a particular condition on the n-point functions of the driving process which we verify for annihilation, creation, and gauge operators on a bosonic Fock space with sufficient mixing. Additionally, we include not only the usual fast-evolving system Hamiltonian which is averaged out in the limit, but also a slow-evolving system Hamiltonian which survives the limit. We also relax the requirement for the fast-evolving Hamiltonian to have a purely discrete spectrum allowing accumulation points under some circumstances. Moreover, our convergence mode for the processes is convergence of all time-centered n-point functions which is stronger than the typical semigroup convergence for the stochastic limit.

fields
Mathematical Physics, Operator Algebras
pdf ↗ page arXiv:2611.06202 ↗

Coarse-grained models of protein conformational dynamics use $\mathrm{C}_α$ geometry to describe the probabilities of regular helices, ordered turns and disordered conformations. To test how much of this order arises from local chain elasticity, we connect discrete Hasimoto frame transport to neighboring bending mismatch, deriving a curvature-product torsion interaction and a six-parameter generalized von Mises density. Fitted on 194 chains from the ATLAS molecular dynamics database and tested on 1744 sequence-nonredundant proteins, this baseline reduces negative log-density loss from 1.490 to 1.160 nats, torsion-sign error from 12.26 to 2.15 percentage points, and helix-fraction error from 21.84 to 10.41 points. Ablations and circular-moment projections against reference generative models motivate extensions to anisotropic stiffness and two partition-function-weighted elastic states, further lowering test loss to 0.790 nats and helix error to 1.65 points. The fixed hierarchy also improves predictions across 72 trajectories of peptides $\mathrm{Fs}$ and $(\mathrm{AAQAA})_3$ and miniprotein $\mathrm{HP35}$ spanning varied starting conformations and force fields. Remaining angular errors in these trajectories are associated with atomic context at shared bends, as bend-matched peptide frames adopt opposite torsion signs with distinct hydrogen-bond patterns and a proline-containing $\mathrm{HP35}$ turn remains at negative torsion. Introducing a bilinearly coupled $\mathrm{C}_α$--$\mathrm{N}$ orientation angle largely reparameterizes the existing bend-dependent harmonics, with an empirical $L^2$ Gram projection placing 96.7\% to 99.6\% of its added coefficient-function squared norm within the original six-function span. These results link discrete Hasimoto elasticity to statistical backbone potentials and clarify the scope and limits of local $\mathrm{C}_α$ geometry.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.06363 ↗

Starting from the nonlinear Fokker-Planck equation (NFPE), we establish the fluctuating hydrodynamics for quantum fluids. We also investigate the corresponding stochastic thermodynamics and derive the associated fluctuation theorems. We then apply this framework to both fermionic and bosonic systems. For the ideal Fermi gas, we study the electrical conduction and reveal a resistance proportional to the product of temperature and the density of states at the Fermi surface. For bosonic fluids, we analyze the relaxation time characterizing the critical slowing down phenomenon and identify three distinct scaling behaviors corresponding to the non-interacting, repulsive interaction, and attractive interaction regimes. Overall, this work provides a experimentally verifiable phenomenological description for the dynamics of quantum fluids and demonstrates the applicability of the nonlinear Fokker-Planck equation in characterizing such systems.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.06485 ↗

We exhibit a classical link between higher Lax integrability and generalized symmetries in a non-Lorentzian higher semi-holomorphic Chern–Simons theory on $M\times\mathbb CP^1$. The equations of motion determine a spectrally dependent flat higher connection on $M$ whose Laurent coefficients organise an infinite hierarchy of conserved quantities. We construct a spectral family of classical $(d_M-2)$-form symmetry line defects associated with the Lax connection, establish an action-preserving deformation law, and exhibit suitable gauge-invariant probes on which the induced transformations act nontrivially.

comments
7 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.06507 ↗

In quantum many-body physics and quantum field theory, it is often assumed that gapped systems remain gapped under sufficiently weak local perturbations. However, to what extent this assumption holds is elusive, except for some special systems. In this work, we examine the stability of energy gap of macroscopic quantum matter that is only subject to two physically natural conditions, locality and translation invariance. We first show that in any spatial dimension, there are gapped local Hamiltonians with a unique ground state and an unstable gap, i.e., they become gapless under certain arbitrarily weak local perturbation in the thermodynamic limit. We then prove that for both spin and fermionic systems in one dimension, such Hamiltonians with an unstable gap must not only break translation invariance but also be fine-tuned. We further show that in any dimension greater than one, there are fine-tuned local translation invariant Hamiltonians with a unique ground state and an unstable gap. These results greatly sharpen our understanding of the fundamental problem of the stability of quantum phases of matter. We also discuss implications of our results on, for example, anyon superconductivity and higher-form symmetries.

comments
5 pages + supplemental material
fields
Mathematical Physics
pdf ↗ page arXiv:2611.06528 ↗

We discuss a model of a soft waveguide described by Schrödinger operator whose potential is a twisted straight channel of non-circular profile. We show that a compactly supported twist makes the operator subcritical, the property being expressed in terms of a Hardy-type inequality. On the other hand, a periodic twist raises the essential spectrum and its local slowdown may give rise to isolated eigenvalues below the essential spectrum threshold.

comments
20 pages
fields
Mathematical Physics, Spectral Theory
pdf ↗ page arXiv:2611.06558 ↗

We provide a counterexample to the weak Gibbs and regularity conjectures. The example is a spin-one system on the square lattice with a translation-invariant nearest-neighbor interaction. At high temperatures and high on-site field strengths, it has a unique KMS state that does not have the weak Gibbs or regularity properties.

comments
19 pages, 2 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.06617 ↗

We consider $N$ bosons in two dimensions interacting via point interactions, modeled by the TMS Hamiltonian. We prove that their ground state energy has the asymptotic behavior $-e^{C N }$ for large $N$, for an explicit constant $C$ related to the sharp constant in the Ladyzhenskaya-Gagliardo-Nirenberg inequality. Such asymptotic behavior was predicted in the physics literature, based on a variant of the mean-field approximation.

comments
13 pp
fields
Mathematical Physics
pdf ↗ page arXiv:2611.06669 ↗

In this paper, we study the generalized Brézin–Gross–Witten model using its BKP integrability. By virtue of the formula for connected $n$-point functions of tau-functions of the BKP hierarchy obtained by Wang and the first-named author, we prove that the normalized generalized BGW correlators are strictly concave for fixed genus and fixed total degree. As applications, we establish the strict Schur-concavity and derive upper and lower bounds for these correlators. We also prove the strict monotonicity of normalized ordinary BGW correlators, which resolves a conjecture by Guo–Norbury–Yang–Zagier.

fields
Mathematical Physics, Algebraic Geometry
pdf ↗ page arXiv:2611.06675 ↗

Many exact solutions of two-dimensional lattice models rest on an analytic family of weights satisfying the Yang-Baxter equation. The hard-hexagon model was solved in this way, while the neighbouring hard-square model has no known closed form. We determine the height alphabets that encode hard squares without hidden heights, and there are exactly two connected ones, the occupation variables themselves and the four heights of Andrews, Baxter and Forrester. Hard hexagons is integrable on both, but no analytic Yang-Baxter family of face weights passes through hard squares at nonzero activity on either. The difference lies in the exclusion rule, which for hard squares turns a few Yang-Baxter equations into polynomial identities that force auxiliary weights to vanish. A closed form for hard squares is not excluded, but a solution by this route would have to leave these encodings or go beyond a single analytic family through the model. Encodings with hidden heights remain open.

comments
24 pages, 2 figures. Ancillary script anc/verify_certificates.py, also at https://github.com/gabrielortegaproyectos/hard-square-yang-baxter-obstruction (doi:10.5281/zenodo.23892182)
fields
Mathematical Physics
pdf ↗ page arXiv:2611.06780 ↗

We reformulate two-dimensional conformal field theory (2d CFT) in the language of noncommutative geometry. To this end, we introduce automorphic forms for the von Neumann algebraic quantum group $\mathrm{SL}^+_b(2,\mathbb{R})$. A quantum measure space is a von Neumann algebra equipped with a weight. We study such spaces carrying a weight-preserving action of $\mathrm{SL}^+_b(2,\mathbb{R})$. We argue that every unitary bosonic 2d CFT with central charge $c=1+6(b+b^{-1})^2>1$ is equivalent to a quantum measure space with an action of $\mathrm{SL}^+_b(2,\mathbb{R})\times\mathrm{SL}^+_b(2,\mathbb{R})$. In this dictionary, Virasoro primary operators are quantum automorphic forms and their scaling dimensions correspond to the spectrum of a quantum Laplace operator. The Virasoro crossing equations express associativity of multiplication on the quantum measure space. For compact theories, the algebra is a type III$_1$ factor. Liouville CFT is realized as $\mathrm{SL}^+_b(2,\mathbb{R})$ acting on itself by left and right translations. Virasoro boundary conditions correspond to quantum measure spaces with an action of a single copy of $\mathrm{SL}^+_b(2,\mathbb{R})$. When the boundary spectrum is discrete, these are noncommutative counterparts of compact hyperbolic surfaces. The formulation accommodates models both with and without extended chiral algebras. It bridges the Virasoro conformal bootstrap with categorical and von Neumann algebraic approaches to 2d CFT.

fields
Mathematical Physics, Number Theory, Quantum Algebra
pdf ↗ page arXiv:2611.06907 ↗

Mutually unbiased bases (MUBs) describe complementary quantum measurements: certainty in one basis gives no information about the others. In dimension six, triples of MUBs are known, but whether a fourth basis could exist remained unresolved for over three decades. OpenAI recently reported a proof that none exists. Here we use the topology of the space of complex Hadamard matrices, which describe transitions between MUBs, to characterize all sets in dimension six. We prove that every mutually unbiased triple belongs to a two-parameter family or is a single isolated triple built from the Fourier matrix. Since none of them extend to a fourth basis, this also proves that no four MUBs exist. Our proof rests on a new topological result that all order-six complex Hadamard matrices except Tao's form a connected space. Connectedness reduces the classification of triples to finitely many overlapping four-dimensional phase balls. We certify with interval arithmetic that these balls cover the space and for every pair of MUBs represented in a ball, we then determine all third bases that extend it. Dimension six is now the first non-prime-power dimension in which all sets of MUBs are classified.

fields
Mathematical Physics, Combinatorics
pdf ↗ page arXiv:2611.06917 ↗

Number Theory22

Bloch's identity $\int_γη(f,g)=D_E((f)\diamond(g))$, relating the regulator of a $K_2$-symbol on an elliptic curve $E/\mathbb{Q}$ to the elliptic dilogarithm of the diamond product of the divisors, is transmitted in the Mahler-measure literature with $γ$ generating the anti-invariant subgroup $H_1(E,\mathbb{Z})^-$ and factor $1$ (e.g. Lalin-Ramamonjisoa, Thm. 6). We observe that, when $E(\mathbb{R})$ has one connected component ($Δ<0$), this reading is incompatible with the published intersection-product normalization (Brunault, Proposition 19): the anti-invariant subgroup then has index $2$ in the regulator quotient $H_1(E,\mathbb{Z})/H_1(E,\mathbb{Z})^+$. The correct statement -- factor $1$ for the quotient generator, hence factor $ι(E)\in\{1,2\}$ for the subgroup generator, with $ι(E)=1\iffΔ>0$ -- follows from Brunault's formula by an elementary index computation. We document the phenomenon twice: on 11.a3 by proved values (a Siegel-unit anchor from [Zheng, arXiv:2609.26119]; the diamond side by Brunault and Bertin), and on 20.a4 by high-precision computation of both integrals against the $q$-series for $D_E$ (subgroup/quotient ratio $2$ to $13$ digits). We also show that Touafek's Theorem 2 (involving a $Δ<0$ curve) mixes two independent normalizations (subgroup versus quotient, and a $(2π)^{-1}$ prefactor versus the bare diamond value), and we identify the two-part reinterpretation making its printed formulas mutually compatible. In the cases we have checked, no Mahler-measure or $D_E$-identity is affected: the main theorem of Lalin-Ramamonjisoa (conductor $17$, $Δ>0$) and Bertin's proved exotic relations stand untouched, and Touafek's final $D_E$-relation is not contradicted and is numerically supported, though its printed derivation retains the gap described in the text. A systematic audit is beyond the scope of this note.

comments
12 pages. Verification script and run log included as ancillary files; companion code archive at https://github.com/huiminZheng-collab/boyd-conductor11 and https://doi.org/10.5281/zenodo.21820650 (scripts for the 11.a3 curve). Research carried out with the assistance of the AI system Kimi (Moonshot AI); see the declaration in the article
fields
Number Theory
pdf ↗ page arXiv:2611.05420 ↗

Let $X^e \colon \mathbb{N} \to \{\pm 1\}$ be the random, completely multiplicative function whose values at the primes $(X^e(p))_{p \text{ prime}}$ are independent and uniformly distributed on $\{ \pm 1 \}$. Let $X=X^eμ^2$. We determine the order of magnitude of \[ \mathbb{E} \Bigg[ \bigg| \frac{1}{\sqrt{x}}\sum_{n \le x} X^e(n) \bigg|^{2 q} \Bigg]\quad \text{ and }\quad \mathbb{E} \Bigg[ \bigg|\sum_{n \le x} \frac{X(n)}{\sqrt{n}} \bigg|^{2 q} \Bigg] \] for $q\in [0,1]$, showing that a transition from better-than-square-root cancellation to growth like a power of $\log x$ occurs when $q$ crosses $1/2$. In particular, the first absolute moments are of order $(\log\log x)^{3/4}$. The proof proceeds by comparing these sums to integrals of random Euler products, which are then studied by analogy with Gaussian multiplicative chaos integrals. The main difficulty lies in proving the lower bound at $q=1/2$, for which we also adapt arguments from the study of random walks.

comments
49 pages, 1 figure
fields
Number Theory, Probability
pdf ↗ page arXiv:2611.05492 ↗

Let $p>7$ be a prime, let $n>1$, and let $F$ be a nonarchimedean local field of residue characteristic $p$ not equal to $\mathbb{Q}_p$. For every extension $E$ of the residue field of $F$, we construct an irreducible smooth $E$-representation of $\mathrm{GL}_n(F)$ which is not admissible. When $E$ is countable, we also construct such representations without a central character and with nonscalar endomorphisms.

comments
21 pages. Comments welcome
fields
Number Theory, Representation Theory
pdf ↗ page arXiv:2611.05552 ↗

Let $A_k(n)$ and $B_k(n)$ be the numbers of ordered $k$-tuples of partitions with designated summands, respectively with designated summands and all parts odd, of total size $n$. Using an exact description of the generating function of designated partitions after a $3$-dissection, we classify for every $e$ the values of $k$ for which $A_k(3n+2)$ is divisible by $3^e$: this happens exactly when $k\equiv0$ or $-5\pmod{3^e}$ if $e\le4$, and when $3^e\mid k$ if $e\ge5$. We obtain the corresponding exact $3$-adic and several $2$-adic results for $B_k$ and for $A_k$ along the progressions $4n+3$, a recursion for the classes $3^b(3n+s)$, and for $k=2$ the congruences $A_2(12n+10)\equiv 27f_1^4f_6^3/f_2\pmod{81}$ in generating-function form. We relate the numbers $A_k(n)$ modulo $3$ and $9$ to overpartitions, sums of squares and triangular numbers, give group-action proofs of some of the congruences, and close with several conjectures supported by computation.

comments
20 pages
fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2611.05623 ↗

Let $f\colon \mathbb{P}^n\to \mathbb{P}^n$ be a dominant endomorphism defined over a number field $K$. We show that there is a finite extension $L/K$ such that every proper closed subset of $\mathbb{P}^n$ misses at least one grand $(f,L)$-orbit. Equivalently, $(\mathbb{P}^n,f,K)$ is strongly dense orbit transversal (S-DOT): every set containing exactly one representative of each grand $(f,L)$-orbit is Zariski dense in $\mathbb{P}^n$.

comments
11 pages
fields
Number Theory, Algebraic Geometry, Dynamical Systems
pdf ↗ page arXiv:2611.05679 ↗

Let $K$ be a number field, let $S$ be a finite set of places of $K$ containing the archimedean places, and let $\mathcal{O}_{K,S}$ denote the ring of $S$-integers of $K$. We prove that multiplication is positive-existentially definable in $(\mathcal{O}_{K,S},0,1,+,\mid)$ if and only if the unit group $\mathcal{O}_{K,S}^\times$ is infinite. This extends a 1977 theorem of Lipshitz for rings of integers to rings of $S$-integers. One of the key ingredients is a uniform bound for unit equations due to Evertse, Schlickewei and Schmidt, which we use to recover multiplication on the unit group.

comments
18 pages
fields
Number Theory, Logic
pdf ↗ page arXiv:2611.05687 ↗

We revisit Yu's second moment formula for incomplete Eisenstein series and give uniform bounds for secondary terms appearing in this formula. We use these bounds to improve results on distribution of integer points on the light cone corresponding to an indefinite quadratic form, as well as intrinsic Diophantine approximation on ellipsoids, and counting holonomy vectors of saddle connections of Veech surfaces.

fields
Number Theory
pdf ↗ page arXiv:2611.05764 ↗

Let $d\geq 3$ and consider the generic family of monic normalized polynomials $f_{\mathbf{t}}(z)=z^d+t_1z^{d-2}+t_2z^{d-3}+\cdots+t_{d-2}z+t_{d-1}$, where $\mathbf{t}=(t_1,\ldots,t_{d-1})$. Given pairwise distinct starting points $α_1,\ldots,α_d\in\bar{\mathbb{Q}}$ and a target point $β\in\bar{\mathbb{Q}}$, we show that the set of parameters $\boldsymbolλ\in\mathbb{A}^{d-1}(\bar{\mathbb{Q}})$ for which $β$ belongs to the forward orbit of every $α_i$ under $f_{\boldsymbolλ}$ is not Zariski dense in $\mathbb{A}^{d-1}$.

fields
Number Theory
pdf ↗ page arXiv:2611.05785 ↗

Fix an $m\times n$ matrix $A$; twisted Diophantine approximation studies how well we can approximate the affine form $A {\bf q}-{\bf b}$ by an integer $m$-vector, depending on the choice of $m$-vector ${\bf b}$. We report on two companion papers in twisted Diophantine approximation, covering two setups: asymptotic and uniform. The asymptotic paper gives an exact Khintchine-type Lebesgue zero–one law, a null–conull criterion for badly approximable shifts, and Hausdorff-measure tests yielding exact power-law dimensions under a critical divergence condition. The uniform paper computes Hausdorff dimensions of sets of uniformly approximable vectors. It also gives Hausdorff zero–full laws, uniform-exponent spectra, and a sharp escape-of-mass bound. In both cases the results are established for arbitrary approximation functions from suitable regularity classes, and the arguments use a homogeneous lattice count involving all successive minima to record clustering in every independent direction.

comments
15 pages, 3 figures
fields
Number Theory
pdf ↗ page arXiv:2611.05824 ↗

We construct a Rankin-Selberg integral for the non-split quasi-split unitary group $SU_{2,2}$ and prove that it is Eulerian. We then compute the local integral at inert places where all data are unramified, and show that it represents the local adjoint $L$-function of $SU_{2,2}$.

comments
It may contain some typos
fields
Number Theory
pdf ↗ page arXiv:2611.05854 ↗

We establish p-adic formulas for the eigenvalues of Frobenius in the case of the family of hyperkloosterman sums. The deformation equation in this case has maximal unipotent monodromy, and the interplay of Frobenius and the differential equation plays an important role in establishing p-adic analytic formulas for the eigenvalues.

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

Zagier's polylogarithm conjecture predicts that special values of Dedekind zeta functions can be expressed in terms of polylogarithms at algebraic arguments. For imaginary quadratic fields, Zagier and Gangl refined it by lifting both sides to complex values modulo rational multiples of a power of $2πi$. In previous work, the author extended their enhanced zeta values from ideal classes to ray classes by means of the Shintani $L$-function of two variables and formulated the enhanced polylogarithm conjecture for ray classes. In this article, we prove this conjecture in weight two. More precisely, we establish a Galois-equivariant equality between the enhanced partial zeta values of ray classes and the enhanced dilogarithms of elements of the rational Bloch groups of the corresponding ray class fields. These elements are constructed explicitly, starting from the Eisenstein class of Doran and Kerr on the square of a CM elliptic curve and contracting it with the graphs of complex multiplication.

comments
31 pages
fields
Number Theory
pdf ↗ page arXiv:2611.06002 ↗

We prove the existence of a sequence in $[0,1)$ with Poissonian pair correlation (PPC) and optimal-order star discrepancy $D_N^*=O((\log N)/N)$, and further give a deterministic construction by applying a conditional-expectation rule to a nested dyadic random model. We also show that PPC imposes no universal discrepancy decay rate: for every positive sequence $ρ_N\to0$, there exists a PPC sequence with $D_N^*/ρ_N\to\infty$. Under suitable regularity and growth assumptions, we realize prescribed discrepancy asymptotics, including $D_N^*\sim c_βN^{-β}$ for every $0<β<1$, with $c_β>0$. We further construct a PPC sequence satisfying $D_N^*\asymp(\log N)/N$ for all sufficiently large $N$.

fields
Number Theory, Probability
pdf ↗ page arXiv:2611.06041 ↗

Andrews and Newman \cite{andrewsnewmanI} introduced and studied ``mex,'' function for an integer partition $λ$ of a positive integer $n$. The related function $σ^{\mathrm{mex}}(n)$ was subsequently defined, and its generating function and other properties have been studied by several authors. In this article, for a positive integer $\ell \geq 2$, we define the minimal excludant of an $\ell$-regular partition $λ$ of a positive integer $n$. We then define $σ_\ell^{\mathrm{mex}}(n)$, the sum of the minimal excludants over all $\ell$-regular partitions of $n$, and obtain explicit generating functions for $σ_\ell^{\mathrm{mex}}(n)$ in the cases $\ell = 2$ and $\ell = 3$, expressed as eta-quotients. We prove that the sequence $σ_\ell^{\mathrm{mex}}(n)$ is weakly increasing for every $\ell$, and we obtain Hardy–Ramanujan type asymptotic formulas for $σ_2^{\mathrm{mex}}(n)$ and $σ_3^{\mathrm{mex}}(n)$ as $n \to \infty$. Additionally, we completely determine the parity of $σ_2^{\mathrm{mex}}(n)$, showing that it is odd precisely at generalized pentagonal numbers, and we use this characterization to compute the density of $n$ for which $σ_2^{\mathrm{mex}}(n)$ is odd versus even. Finally, for $σ_3^{\mathrm{mex}}(n)$, we prove that it is odd infinitely often, and we establish a quantitative lower bound, showing that the number of such $n$ up to $X$ grows at least like $\log \log X$.

comments
First draft of the paper
fields
Number Theory
pdf ↗ page arXiv:2611.06072 ↗

We prove that anisotropy of nonsingular hermitian and skew-hermitian forms over central simple algebras with involution is preserved under scalar extension to every finite Galois extension of odd degree coprime to the index of the algebra. In characteristic two, the same conclusion holds for generalized quadratic forms over algebras with involution of the first kind, with no nonsingularity assumption on their polar forms. The main tool is an isometry-level descent theorem. For a cyclic extension of odd prime degree, every anisotropic nonsingular form over a division algebra with involution, of rank smaller than the extension degree and with Galois-invariant isometry class, descends to an anisotropic form over the base field. Unlike descent results for Witt classes, this theorem descends the form itself. A bounded-rank reduction, based on injectivity of the Witt-group restriction map, derives the cyclic anisotropy theorem from this descent result; a regularization argument removes the nonsingularity assumption on polar forms in characteristic two, and the Feit-Thompson theorem extends the result to arbitrary finite Galois extensions of odd degree.

fields
Number Theory
pdf ↗ page arXiv:2611.06177 ↗

Let C: y^d = f(x) be a smooth projective superelliptic curve over Q, where d >= 3 is odd, f(x) in Q[x] is separable of degree n >= 3, and gcd(d,n) = 1. Let J = Jac(C) be its Jacobian. We study the rational torsion subgroup J(Q)_tors through the interaction of ramification geometry, Galois actions, reduction at primes of good reduction, and the geometry of divisors. First, we describe the subgroup R_d contained in J[d] generated by the ramification-point differences and determine its Galois-invariant subgroup explicitly in terms of the sizes of the Galois orbits of the roots of f. This yields a precise description of the rational d-torsion classes arising from ramification, without assuming that they account for all of J(Q)[d]. Second, we establish criteria based on the orders of reduced Jacobians that can prove the vanishing of the full rational torsion subgroup. Finally, we derive geometric constraints on divisor classes represented by effective divisors of degree smaller than the genus, including a restriction arising when distinct effective divisors represent the same class. Explicit examples illustrate how the Galois-theoretic and reduction-theoretic methods can be combined to study rational torsion on odd superelliptic Jacobians.

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

The de Bruijn–Newman constant $Λ$ is the transition time beyond which all zeros of the heat-deformed Riemann $ξ$-function are real. We develop a computer-assisted collision-exclusion method and obtain the bound $Λ<156821/10^6=0.156821$, in the normalisation of Polymath. The proof combines the published finite-height verification and the starting inequality $Λ\leq1/5$ with a compact-interior continuation theorem, five stable prime-polynomial Gram sources, certified moving-index recovery, a balanced real-jet transfer and a uniform Euler-product barrier at infinity. The resulting closed time-band exclusion, together with uniform remote reality, forces strictness at the proposed endpoint. The finite certificate uses 664,505 structural Fourier coefficients, 44,182 closed torus boxes, 184 separator moments and 17,385 separator rectangles. We isolate a Cauchy–Schwarz obstruction intrinsic to the four-prime source family, explaining the narrow feasibility margin of the certified endpoint. We state the proof-to-certificate interface and distinguish the present unconditional logical claim from other recent, as yet unrefereed, computational bounds.

comments
35 pages
fields
Number Theory
pdf ↗ page arXiv:2611.06245 ↗

We provide a general construction of infinite Hopf-Galois extensions from a direct system of finite Hopf-Galois extensions. We then apply this framework to extensions generated by division points on elliptic curves. Specifically, for a number field $K$ and an elliptic curve $E/K$ of rank at least $1$ with $P\in E(K)$ of infinite order, we consider for each integer $n\geq 2$ the extension $L_n=K(Q_n)$, where $Q_n\in E(\overline{K})$ is such that $nQ_n=P$. We show that the finite-level extensions $L_n/K$ need not be Hopf-Galois, and we give sufficient conditions for them to be so. We then prove that the infinite extension $L_\infty=\bigcup_{n\geq 2}L_n$ of $K$ is potentially Hopf-Galois, meaning it becomes Hopf-Galois after a finite extension of the base field.

comments
17 pages, Comments are welcome
fields
Number Theory
pdf ↗ page arXiv:2611.06253 ↗

Writing multiple $q$-zeta values as sums over partitions, a conjecture of Bachmann, proved by Hirose, Maesaka and Watanabe by means of a recursion, says that polynomials in the parts and multiplicities can be replaced by polynomials in the multiplicities alone. We make this replacement explicit, derive from it bounds on weight and depth that make Bachmann's conjecture effective, and provide a closed formula for the Drop1 operator of Hirose, Maesaka, Seki and Watanabe.

comments
2^5 pages, 1 figure, comments are welcome
fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2611.06301 ↗

The RSA cryptosystem has been studied extensively and its insecurity in specific scenarios is well known. For instance, a sufficiently small private key allows to factorize the modulus $N$ and break the system. Attacks like this are often based on lattice reduction for finding small roots of polynomials, but high lattice dimensions can make it difficult to achieve the theoretically proved bounds in practice. In this paper, we adapt a sieve technique originally developed for deterministic integer factorization and apply it to RSA parameters. The sieve allows for an asymptotically significant reduction of the private key search space, and can be used to decrease the bounds for the polynomial roots. We also provide a square-root speed-up of the best currently known runtime bound for factoring semiprime $N=pq$ with small prime difference $q-p$.

comments
12 pages, short version of the paper
fields
Number Theory
pdf ↗ page arXiv:2611.06427 ↗

Let $N=pq$ be a semiprime and let $\ell\nmid N$ be an odd prime. For $a\ne0$ modulo $\ell$, put $H_a(N;\ell)=\{ax+Nx^{-1}:x\in\F_\ell^*\}$. For a primitive root $γ$, the size of $H_γ(N;\ell)\cup H_{γ^2}(N;\ell)$ is determined by the Frobenius trace of $Y^2=(X^2-1)(X^2-γ)$. We study the resulting trace-selection problem through finite certificates, a congruence modulo $8$, and a GRH-conditional positive-density family from the CM specialization $γ=2$. Independently of this conditional result, we obtain a deterministic factorization algorithm from the residue-known coefficient lattice of Harvey and Hittmeir (\emph{Math. Comp.}, 2022). The actual babystep index is a nondegenerate quadratic image modulo each selected prime divisor of the auxiliary modulus. After a computable translation, every such image avoids a fixed set of $(\ell-χ(-1))/4$ residues. This forbidden set is optimal among translated sets that must handle both square classes of the leading coefficient. Gauss reduction, a nearby lattice-vector selection, arbitrary-point multipoint evaluation, and the unrestricted large-order algorithm of Harvey and Hittmeir (arXiv, 2026) give the bit-complexity bound $N^{1/5}\exp(-(\log(4/3)/50+o(1))\log N/\log\log N)$. Its secondary factor is asymptotically smaller than every fixed negative power of $\log N$, improving the general bound of Harvey and Hittmeir (\emph{Math. Comp.}, 2022) and the balanced-semiprime bound of Gao et al.\ (arXiv, 2025).

fields
Number Theory
pdf ↗ page arXiv:2611.06580 ↗

We prove that every positive rational number is a sum of distinct unit fractions with denominators of the form $g-h$, where $g$ is a Golomb prime and $h$ is a fixed nonzero integer, as long as the necessary congruence conditions are satisfied. Golomb primes, introduced by Golomb in 1955, are a natural analogue of the primes. Erdős showed that the relative density of Golomb primes among the primes up to $N$ is about $1/\log\log N$, so they form a sparse subset of the primes. Our result is an analogue of Bloom's result on unit fraction representations using shifted primes, for this sparse subset of the primes. A key ingredient in our proof is a Siegel–Walfisz-type theorem for Golomb primes in arithmetic progressions, which we also prove here.

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

Algebraic Geometry19

Rotation representations are foundational in fields such as computer graphics, robotics, and machine learning, where precise and efficient modeling of 3D orientations is critical. This paper comprehensively investigates diverse representations of the special orthogonal group $SO(3)$, such as Euler angles, axis-angle vectors, quaternions, rotation matrices, exponential maps, and emerging continuous and probabilistic methods, evaluating their mathematical formulations, continuity, susceptibility to gimbal lock, computational efficiency, storage requirements, interpolation properties, and composition operations, while integrating detailed algebraic insights with practical applications in fields like animation, pose estimation, inertial navigation, 3D shape registration, and neural networks. Empirical evidence highlights quaternions' dominance due to their compactness and computational efficiency, while alternatives like 6D continuous representations and matrix Fisher distributions provide enhanced continuity and uncertainty modeling. Future research could explore hybrid methods and thorough large-scale evaluations to help build a solid foundation for improving rotation representation techniques.

comments
Keywords: Rotation representations, $SO(3)$, quaternions, continuity, gimbal lock, 3D shape registration
fields
Algebraic Geometry, Optimization and Control
pdf ↗ page arXiv:2605.08086 ↗

We prove Fujita's advanced generalized Mukai conjecture for smooth complex Fano varieties. Our starting point is the existence of independent two-point Gromov–Witten correspondences. We show that there are finitely many unsplit families of rational curves whose chains connect $X$. We use these families to bound the anticanonical degrees throughout the successive minimal horizontal construction, so every family in that construction is unsplit. Fujita's contraction theorem and inductive classification then give the required list of varieties.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.05452 ↗

Building on aspects of a recent diagrammatic field-theory programme for quantum error correction put forward by the first-named author (arXiv:2607.08911), we construct exact finite-dimensional codes from twisted cyclic and argyle quiver moduli on the projective line. A regular fibre of the node-labelled cyclic Hitchin map records the ways to distribute simple spectral zeroes among the arrows with prescribed degrees. The Hilbert space spanned by these allocations is a Young permutation module. Root monodromy acts on its Specht factors and leaves their multiplicity spaces noiseless. Resetting the Specht factor therefore recovers the encoded state for every channel in the monodromy noise model. We prove that the largest Kostka multiplicity is the optimal dimension of a subspace code correcting the full monodromy algebra, even among codes spanning several isotypic blocks. Quantizing an argyle master space recovers the cyclic sheet space as a weight sector of a tensor power, with the identification preserving monodromy. For the balanced three-cycle with $t$ zeroes per arrow, the multiplicity of a partition $(a,b,c)$ of $3t$ is $1+\min(a-b,b-c)$. The optimal logical dimension is thus $t+1$, attained uniquely by the block indexed by $(2t,t)$. At $t=1$ we give explicit codewords for a qubit on six sheets. The commuting right action generates its full logical algebra, yielding errors outside the monodromy model that leave the measured footprint statistics unchanged yet require different recoveries. We also compute collision-parity ranks, give a higher-rank Grassmannian example, and derive a conditional criterion for recovery across splitting types.

comments
34 pages, 2 figures, 4 tables
fields
Algebraic Geometry, Combinatorics, Representation Theory
pdf ↗ page arXiv:2611.05526 ↗

We study a bounded-degree form of a motivic Vojta inequality for pure André motives, arising from a question of Kato. We verify this inequality for infinitely many non-CM elliptic curves with unbounded stable Faltings height. The point is that ramification at the finite poles of the $j$-invariant gives the required discriminant bound.

comments
24 pages. Comments would be appreciated
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.05672 ↗

We construct a cohomology theory $H_A(-)$ canonically attached to any 1-dimensional commutative group scheme A over a connective $E_\infty$-ring. The additive group in characteristic zero gives 2-periodic de Rham cohomology, the multiplicative group gives topological periodic cyclic homology, and an elliptic curve gives elliptic cohomology. The construction extends to the G-equivariant setting for an algebraic group G, yielding in the elliptic case a theory of equivariant elliptic cohomology on algebraic varieties with G-action that takes values in sheaves on the stack of G-bundles. Over the complex numbers, and for G connected reductive, this lifts Grojnowski's theory from the moduli space of G-bundles to the stack. The key player is the category of perfect complexes on A with 0-dimensional support, equipped with the convolution product induced by the group law of A. It plays the role of a categorified circle and is used to define a loop space $L_A^G(X)$, whose structure sheaf gives rise to $H_A^G(X)$ after periodization. Sheaves on $L_A^G(X)$ equivariant under loop rotation provide a category of coefficients for $H_A^G(-)$ in the same way that D-modules provide coefficients for de Rham cohomology. At the point X = *, the theory also gives rise to an $E_\infty$-ring spectrum (or sheaf thereof) $K_A$, which recovers complex K-theory for $A = \mathbf{G}_m$, and the sheaf $\mathcal{O}^{top}$ of topological modular forms for the universal elliptic curve.

comments
210 pages
fields
Algebraic Geometry, Algebraic Topology, Representation Theory
pdf ↗ page arXiv:2611.05707 ↗

Let $X$ be a smooth complex projective variety and $D$ a reduced simple normal crossings divisor. We prove that, given a complete curve of negative $(K_X+D)$-degree, through its general points there is a rational curve whose normalization meets $D$ in at most one point. The proof uses ordinary weighted jets of a smooth family constructed from $(X,D)$, a positive parameter line bundle, and an intersection calculation on a ruled surface. We obtain an explicit degree bound depending on a projective embedding. We apply this construction to a cyclic cover compactification associated with a smooth Campana orbifold $(X,\sum_i(1-1/m_i)D_i)$. If its anticanonical divisor is big, we show that there is a covering family of free divisible Campana rational curves with fixed numerical class and contact data. In Picard number one case, the orbifold is Campana rationally connected.

comments
38 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.05809 ↗

Let $X\subset\PP^{M-1}$ be a smooth hypersurface of degree $d<M$, and let $\Ku(X)$ be its Kuznetsov component, the orthogonal complement of the line bundles $\OO_X,\dots,\OO_X(M-d-1)$ in the derived category. We prove that $\Ku(X)$ determines $X$ for every smooth quartic in $\PP^{4k+1}$, $k\geq1$; together with earlier work, this gives categorical Torelli for every smooth hypersurface of degree $d<M$ with $d\nmid M$. The same algebraic reconstruction proves the classical generic Torelli theorem for these quartics, which completes generic Torelli for smooth hypersurfaces whose degree does not divide $M$, cubic surfaces excepted. When $d$ divides $M$, the Kuznetsov component is a Calabi–Yau category, as for cubic fourfolds, where categorical Torelli is known to fail. We show that, apart from cubic fourfolds, such a hypersurface has a number of Fourier–Mukai partners bounded by a constant depending only on $d$ and $M$, and that categorical Torelli holds in sufficiently large degree, in every dimension. The main tool is a deformation theorem: when geometric deformations surject onto the second Hochschild cohomology of the Kuznetsov components, an equivalence deforms together with the hypersurfaces, so statements proved for general hypersurfaces extend to all smooth ones.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.05915 ↗

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 $\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 $\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
42 pages. Macaulay2 computational supplement included in ancillary files
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.06014 ↗

For every ideal of minors of a generic complex matrix, we determine all roots and their multiplicities in the Bernstein-Sato polynomial. These roots lie in explicit rational intervals indexed by the rank strata. Every nonintegral root is simple, whereas the multiplicity of each integral root equals the number of labels producing that root. We deduce the strong motivic monodromy conjecture, including the inequality relating pole orders to root multiplicities; for minors of size $r$, the largest possible root multiplicity over all matrix dimensions is $\lfloor\sqrt{4r-1}\rfloor$. Keywords. Bernstein-Sato polynomial, determinantal ideal, root multiplicities, strong monodromy conjecture.

comments
24 pages
fields
Algebraic Geometry, Commutative Algebra
pdf ↗ page arXiv:2611.06030 ↗

A $\mathbb{Q}$-homology quadric is a smooth compact complex surface which has the same $\mathbb{Q}$-homology as a quadric surface, that is, the product of two $2$-dimensional spheres. It is called fake if it is minimal and not rational. Among them are the fake quadrics which are isogenous to a product of complex curves. In this paper, we determine the parity of the intersection forms of all fake quadrics isogenous to a product of unmixed type. In particular, we show that there are fake quadrics with odd intersection forms.

fields
Algebraic Geometry, Complex Variables, Geometric Topology
pdf ↗ page arXiv:2611.06077 ↗

We prove that a finite surjective post-critically finite self-map of a variety in characteristic zero remains post-critically finite on every preperiodic integral effective divisor after passing to its periodic image with its return map. Iterating this result proves PCF all the way down. A detailed report on AI usage is contained in the manuscript.

comments
PALOMAR-2026-10-30-000004 v1
fields
Algebraic Geometry, Dynamical Systems, Number Theory
pdf ↗ page arXiv:2611.06106 ↗

We consider the comparison between a Milnor fibre of a function $f$ and its section by the zero locus of a second function $s$ in a general ambient variety $\mathcal{X}$. We give a formula that generalizes those of Lê and Siersma, expressing the difference of their Euler characteristics as a sum of local contributions associated with the critical points of the restriction of $s$. We provide an algebraic formula in the case that $\mathcal{X}$ is {smooth of pure dimension outside $f^{-1}(0)$}, and show some applications and examples.

comments
Comments very welcome!!
fields
Algebraic Geometry, Geometric Topology
pdf ↗ page arXiv:2611.06340 ↗

We provide an algorithm for enumerating ordinary K3 surfaces over a fixed finite field based on Taelman's theorem. We use this algorithm to prove that there exist no K3 surfaces without rational points over $\mathbb{F}_q$ for every prime power $q\geq 13$. For elliptic K3 surfaces, we give a geometric proof of this non-existence without computer assistance. On the other hand, we also provide explicit pointless K3 surfaces over $\mathbb{F}_q$ for every prime power $q\leq 11$.

comments
28 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.06366 ↗

In this article, we use Wu's method to prove Budur's multi-variable $n/d$-conjecture for completeness.

comments
11 pages
fields
Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:2611.06398 ↗

We determine the universal constant in the large-genus asymptotic expansion of super Weil-Petersson volumes. The argument adopts the uniform-transport strategy for shifted theta intersection numbers. The uniform large-genus theorem for normalized BGW numbers of Guo-Norbury-Yang-Zagier determines the amplitude at a simpler endpoint. The result is $C=π^{-9/2}$. We give a proof of the Griguolo-Papalini-Russo-Seminara conjecture for fixed boundary lengths and fixed descendant degrees. The boundary formula is uniform when the sum of the lengths is $o(\sqrt g)$, and we exhibit an obstruction at the $\sqrt g$ scale. We also compute the first four inverse-genus coefficients by two exact recursive methods and derive general polynomial structure results. Finally, we show that, for each fixed genus, the super Weil-Petersson volume divided by $n!$ is a polynomial in the number $n$ of marked points.

fields
Algebraic Geometry, Mathematical Physics, Differential Geometry
pdf ↗ page arXiv:2611.06621 ↗

A prolongation variety of a polynomial differential system $S$ is an algebraic variety defined by the equations of $S$ and their derivatives up to a given order. We compute the geometric degree of the prolongation varieties associated with the system $x_1'=x_2^2$, $x_2'=x_1^2$ in terms of the prolongation order, thereby proving a conjecture stated by Gleb Pogudin in Section 2, Question 6 of "Some Open Problems in Differential Algebra". Our approach is motivated from the beginning by doing computational experiments in OSCAR in order to find the number of solutions of a zero-dimensional system using algebraic Thomas decomposition. The result will follow from a coprimality condition on a family of polynomials with integer coefficients, which is verified by showing that their roots satisfy a strong interlacing property. Finally, we propose an extension of the conjecture for the systems $x_1'=x_2^n$, $x_2'=x_1^n$ with $n>2$.

comments
31 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.06638 ↗

Let $G$ be a connected reductive group with Borel subgroup $B$, flag variety $\mathcal B=G/B$, and Weyl group $W$. We define the \emph{Hessenberg functor} on the geometric Hecke category by microlocalizing along the diagonal in $\mathcal B\times\mathcal B$ and pushing forward along the Springer map. It induces the \emph{Hessenberg character} of the Iwahori–Hecke algebra, with values in graded $W$-representations. On Kazhdan–Lusztig basis elements indexed by smooth elements of $W$, this character recovers the cohomology of the associated regular semisimple Hessenberg varieties. We identify the Hessenberg functor with the microlocalization of Lusztig's character functor and compute the Hessenberg character using Lusztig's nonabelian Fourier pairing. More generally, for families of Hessenberg schemes defined by pure-dimensional $B$-stable closed cones in the tangent space $T_{eB}\mathcal B$, we show that monodromy on the intersection cohomology of regular semisimple fibers factors through $W$. When the cone is the tangent cone of a Schubert variety, we give a local condition at $eB$ under which the same character formula computes the graded $W$-character of this intersection cohomology. Combined with the methods of Precup and Sommers, our character formula can be used to compute the graded $W$-characters of all regular semisimple Hessenberg varieties in all Lie types of rank at most ten, including all exceptional types. These computations also motivate positivity and unimodality conjectures for Hessenberg varieties and Lusztig varieties in types $B$, $C$, and $D$, together with positivity conjectures for their partial flag versions.

comments
45 pages
fields
Algebraic Geometry, Combinatorics, Representation Theory
pdf ↗ page arXiv:2611.06852 ↗

We study $G$-Mori fibre space models of $G$-del Pezzo surfaces, focusing on surfaces over non-closed fields. We construct explicit examples of birationally rigid sextic del Pezzo surfaces and give a negative answer to a generalization of Kollár's question on birational rigidity and field extensions: a sextic del Pezzo surface of Picard rank $1$ can fail to be birationally rigid over its ground field but become birationally rigid after an algebraic field extension. We interpret this phenomenon in terms of the failure of injectivity of natural maps in nonabelian Galois cohomology induced by the inclusion of automorphism groups into birational automorphism groups. We also show that finite pliability is unbounded: for every integer $d\geqslant2$, we construct a sextic del Pezzo surface of index $3$ over a field of characteristic zero whose pliability is exactly $3^d+1$.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.06861 ↗

In this paper, we develop an explicit calculation of ordinary topological Euler characteristics of the coarse moduli spaces underlying Hassett spaces in the minimal all-light chamber and the Deligne-Mumford compactification. For genus $g\ge2$, we organize the calculation through a decomposition indexed by stabilization graphs and their decorations. The Burnside-Lefschetz formula allows us to compute the resulting contributions, taking into account graph symmetries and their fixed loci. The calculation in genus two illustrates the method explicitly and, in the Deligne-Mumford case, recovers the generating function of G. Bini, G. Gaiffi, and M. Polito (arXiv:math/9806048), with the corrections of G. Bini and J. Harer (arXiv:math/0506083), providing a check on the construction. We also carry out the calculation in genus three in an appendix. Together with an elementary genus-one calculation based on collision partitions and rational necklaces, these formulas yield complete asymptotic expansions as the number of labeled markings tends to infinity. The passage from all-light to ordinary Euler characteristics is governed by the universal change of variables $Φ(z)=(2-z)e^z-2$, which we derive by a direct wall-crossing argument. For arbitrary fixed genus $g\ge2$, the same framework identifies the leading contribution of rational trivalent graphs and gives the ordinary asymptotic scale $n!(e-2)^{-n}n^{(3g-5)/2}$. The leading constants are the symmetry weights of these graphs; we derive their generating function, recurrence, and large-genus behavior. We also determine the asymptotic ratio of all-light to ordinary Euler characteristics, answering a question of S. Kannan, S. Serpente, and C. H. Yun (arXiv:2207.02800).

comments
63 pages; 11 figures; 7 tables
fields
Algebraic Geometry, Mathematical Physics, Combinatorics
pdf ↗ page arXiv:2611.06862 ↗

Numerical Analysis19

The method of regularized Stokeslets (MRS) is widely used to model fluid-structure interactions of microscopic bodies in viscous environments. Specifically, MRS computes the fluid velocity generated by regularized forces distributed on an immersed body, which in turn defines a system of ordinary differential equations with which to evolve the body so that the no-slip condition is enforced. To accurately model material properties such as elasticity and bending rigidity, the resulting ODE system is often stiff and, therefore, computationally expensive to solve with explicit time-integration methods. Here we demonstrate the potential of linearly implicit Rosenbrock (ROS) time integration methods to greatly reduce the computational time required to solve such ODE systems. We focus on the classic model problem of the swimming of a flexible filament driven by preferred curvature forcing. Our findings indicate that, compared to previous MRS simulations, the increased stability of ROS methods allows for speed-ups between twenty and two thousand times over explicit Runge-Kutta (ERK) methods. Moreover, we present approximate scaling laws for this speedup as a function of the key model parameters (bending rigidity and slenderness) at the root of numerical stiffness. Lastly, beyond the basic ROS approach, we discuss several additional strategies that further improve performance.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.05428 ↗

Schwarz waveform relaxation (SWR) is a parallel-in-time iterative method for the solution of evolution problems and belongs to the class of Parallel-in-Time algorithms that have received increasing attention over the past three decades. For parabolic problems, SWR converges linearly over long time intervals and exhibits superlinear convergence on short time intervals. Since the introduction of optimized variants (OSWR) nearly three decades ago, determining the optimized Robin parameter when OSWR is applied on bounded time windows has remained an open problem. We introduce here a new analytical approach that, for the first time, yields a closed-form expression for the optimal Robin parameter in the transmission conditions for the one-dimensional heat equation with two overlapping subdomains. The resulting formula explicitly characterizes the dependence of the optimal parameter on the iteration number, the overlap size, and the length of the time window. Beyond resolving this long-standing optimization problem, our analysis provides a framework that can be extended to more general settings, including higher-dimensional problems, multiple subdomains, and higher-order transmission conditions.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.05576 ↗

Reconstruction of three-dimensional vascular structures from a limited number of X-ray projections is a severely underdetermined and ill-conditioned inverse problem. This work presents a unified matrix-free computational framework for evaluating iterative numerical methods for sparse-view cone-beam tomography. Forward and backprojection are implemented from ray-voxel intersection lengths computed with the Amanatides-Woo traversal algorithm, avoiding explicit construction of the large sparse system matrix. We systematically compare ART, SART, SIRT, gradient descent (GD), and Krylov subspace methods, including Conjugate Gradient, LSQR, and GMRES. The common matrix-free operators and geometry are used for all methods, allowing consistent comparisons under matched conditions. Particular emphasis is placed on gradient scaling using scalar step sizes, Jacobi preconditioning, and diagonal Hessian majorization, together with L1, Tikhonov, and total variation regularization. Numerical experiments use five three-dimensional coronary vessel models reconstructed from ten simulated X-ray projections under noise and scattering conditions, and are extended to real X-ray projections of a static thin-vessel phantom. Performance is evaluated in terms of convergence, computational cost, volumetric overlap, contrast-to-noise ratio, vessel diameter and centerline errors, and projection consistency at an unseen viewing angle. The results show that total-variation-regularized gradient descent with diagonal majorization provides the best overall reconstruction performance within the investigated computational budgets. By contrast, the tested Krylov implementations achieve limited geometric recovery despite higher computational cost. These findings emphasize the importance of appropriate gradient scaling and regularization for stable and computationally efficient sparse-view tomographic reconstruction.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.05645 ↗

We present discrete Poincaré and Bogovskii operators for the common finite element discretizations of the de Rham complex of arbitrary polynomial order. We first discuss how such operators arise from a decomposition of the finite element spaces into a lowest order component and a remainder. This results in a fast algorithm for computing grad, curl, and div potentials. We then introduce a nonlocal Poincaré operator on contractible domains, which generalizes existing constructions based on cone operators to arbitrary order by integrating over cones against extended test forms. This requires developing commuting extension operators, which turn out to be related to rational forms. We also show how the nonlocal construction is modified to obtain a discrete Bogovskii operator preserving homogeneous boundary conditions. We further discuss how the ideas of the construction fit into the theory of finite element systems.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.05698 ↗

Efficient two-grid solvers for high-contrast parametric elliptic problems require coarse spaces that capture error components poorly reduced by local smoothing. As these components vary with the problem parameters, repeatedly constructing parameter-adaptive coarse spaces can be computationally expensive. We propose a coarse-space learning method based on finite-step errors generated by additive Schwarz smoothing. For each training parameter, proper orthogonal decomposition (POD) of smoothed-error snapshots in the discrete energy inner product defines a reference coarse space. A continuous-coordinate neural generator is then trained using a basis-invariant, whitened subspace loss, enabling the prediction of parameter-adaptive coarse spaces on unseen grids. We establish discrete perturbation estimates relating coarse-space discrepancies to the associated nonsymmetric two-grid operators and derive conditional finite-step Krylov residual-polynomial bounds without assuming stationary energy contraction. Numerical experiments on high-contrast interface problems, moving-interface Darcy flow, and nonlinear Forchheimer flow demonstrate effective solver performance across varying parameters and grid resolutions. On the finest static test grid, with approximately 264 times as many degrees of freedom as the training grid, the learned spaces achieve FGMRES iteration counts close to those of parameter-specific POD references and comparable to GenEO spaces, while substantially reducing repeated coarse-space construction costs.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.05837 ↗

We construct an infinite family of rectangular \(T\)-meshes whose conformality-vector-space dimension is constant over all structurally similar geometric realizations, although the meshes are not diagonalizable. For every integer \(d\ge 2\), the construction has \(2(d+2)\) \(\Tl\)-edges and intersection graph \(K_{d+2,d+2}\). Every \(\Tl\)-edge contains at least \(d+2\) vertices, so no edge is vanishable under the usual vertex-count criterion for bidegree \((d,d)\) and smoothness \((d-1,d-1)\). We prove that the conformality-vector space is one-dimensional throughout the structural similarity class. Its generator is the outer product of two vectors of barycentric interpolation weights, extended by four zero coordinates. Non-diagonalizability follows by examining the last edge in any proposed diagonalizing ordering. Thus, for the geometric structural similarity class specified here, diagonalizability is not a necessary condition for dimensional absolute stability.

comments
14 pages,1 figure
fields
Numerical Analysis
pdf ↗ page arXiv:2611.05923 ↗

We study magnetic Bloch eigenvalue problems for two-dimensional magnetic Schrödinger operators with nonuniform periodic magnetic fields and periodic scalar potentials, and develop a hybrid Fourier-finite difference discretization. A Landau-type gauge is constructed by solving a periodic Poisson equation. Under the integer magnetic flux condition, the magnetic Bloch boundary conditions are incorporated through shifts of Fourier-mode indices. The method combines link-variable-based covariant central differences in the $x$-direction with a Fourier pseudospectral discretization in the $y$-direction, yielding a Hermitian discrete Hamiltonian. The resulting eigenvalue problems are solved using a LOBPCG method. Under appropriate regularity assumptions, we establish a fully discrete consistency residual estimate of order $O(h_1^2+N_2^{-s})$. With suitable spectral separation and eigenspace dimension-preserving conditions, error estimates of the same order are derived for isolated eigenvalues and their associated eigenspaces. Numerical experiments show second-order convergence in the finite difference direction and rapid error reduction with increasing Fourier resolution, and illustrate band degeneracies and eigenstate distributions in nonuniform periodic magnetic fields.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.05950 ↗

In this paper, we propose a class of efficient, linear and decoupled adaptive variable time step schemes for the anisotropic phase field dendritic crystal growth model. The main difficulty is twofold: the gradient dependent anisotropic coefficient and the strongly nonlinear terms make unconditional energy stability difficult to achieve, and on nonuniform meshes the discrete energy dissipation law, which is straightforward to establish on uniform meshes, has to be reestablished under varying step sizes. To overcome these difficulties, two linear stabilizers and a time dependent auxiliary variable with relaxation are introduced and incorporated into a second-order generalized BDF-type operator, with the spatial derivatives discretized by the Fourier spectral method. The proposed schemes are energy stable for arbitrary positive adjacent step ratios, so that no restriction on the step ratio is imposed, and only two linear equations together with a few algebraic equations, which are solved independently in Fourier space, need to be solved at each time step. Moreover, the schemes are naturally compatible with energy based time adaptive strategies. The associated adaptive strategy reduces the number of time steps by $24.6\%$--$86.6\%$ in comparison with uniform time stepping, and numerical experiments on fourfold and sixfold dendritic growth in two dimensions and on three-dimensional growth confirm the accuracy, efficiency and stability of the proposed schemes.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.05977 ↗

Geometric multigrid methods for conforming finite element discretisations classically require a nested mesh hierarchy, forcing coarse meshes to be conforming, which is unsuitable for general domains. In order to eliminate this geometric constraint, we introduce and analyse a family of multilevel auxiliary space preconditioners. At the first level, a conforming Lagrangian discretisation on a fine simplicial mesh is preconditioned by a non-conforming polytopal discretisation posed on an arbitrarily agglomerated coarse mesh. At the subsequent levels, the coarse problem is solved by a geometric multigrid method for that polytopal discretisation on further agglomerated meshes, so that the whole hierarchy is generated from the fine mesh by agglomeration alone. We consider two polytopal discretisations, a symmetric interior penalty discontinuous Galerkin method and a hybrid high-order method. The prolongation operator at the first level is an element-wise interpolation onto the fine mesh followed by nodal averaging, preceded in the hybrid high-order case by a local potential reconstruction. For point-Jacobi and vertex-star patch additive Schwarz smoothers, we prove that the condition number of the preconditioned system is bounded by $O((H/h)^3)$, where $H/h$ is the coarsening ratio, and by $O((H/h)^2)$ for the DG variant with penalty proportional to $H/h$. Numerical experiments in two and three dimensions, on structured and unstructured meshes with agglomerates generated by automatic clustering algorithms, confirm the robustness of the preconditioners.

comments
28 pages, 1 figure, 3 tables
fields
Numerical Analysis
pdf ↗ page arXiv:2611.06012 ↗

In this work, we investigate the inverse coefficient problem of determining an unknown coefficient in a diffusion equation from a single boundary flux measurement. More precisely, assuming that the domain is cylindrical, we develop a unified theoretical and numerical framework for the stable reconstruction of a space-time-dependent coefficient, by reformulating the inverse problem as a nonlinear equation. The inherent nonlinearity of the problem is transferred to an auxiliary nonlinear equation, enabling the application of techniques and concepts from nonlinear analysis. By combining representation formulas with regularity properties of solutions to diffusion equations, we extend to nonlinear inverse problems an approach that has so far been restricted to linear ones. The theoretical reconstruction procedure is complemented by a numerical analysis of the proposed method, including convergence and error estimates, as well as numerical experiments. The proposed reconstruction algorithm is directly inspired by the theoretical framework.

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

We develop a flux-matched Poisson iteration for solving generated Jacobian equations with second boundary conditions. In each step, it solves a fixed shifted Poisson problem with a Neumann-type boundary condition. Near a smooth regular solution with positive $C^{1,1}$ densities, we prove that the iteration has local geometric convergence in $C^{2,α}$ on smooth connected Riemannian domains. The iteration is then discretized using a spectral Galerkin method, with local convergence proved for the Fourier-Jacobi scheme on spherical caps. Optical numerical experiments support these estimates and demonstrate useful imaging performance beyond the local convergence theory.

comments
24 pages, 7 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.06153 ↗

In this paper, we analyze a first-order convex-splitting mixed finite element scheme for the Cahn–Hilliard–Navier–Stokes system, tracking explicitly how the error constants depend on the interface width $ε$. Due to the strong nonlinear coupling inherent in the CHNS system and the singular dependence of the Cahn–Hilliard equation on $ε$, conventional energy-based analyzes often lead to severe dependence of the error constants on $ε^{-1}$, and may even result in exponential growth. Such dependence significantly limits the applicability of the resulting error estimates in the small-interfacial-thickness regime. To overcome this difficulty, we develop a robust parameter error analysis framework with respect to interfacial thickness $ε$. In particular, by introducing $H^{-1}$ approximation properties for the Ritz projection and the Ritz and Stokes quasi-projection operators, together with spectral-type estimates for the discrete perturbed Cahn–Hilliard operator, we effectively control the singular terms arising from the interfacial thickness parameter in the error analysis. Compared with the classical results, which address only the Allen-Cahn or Cahn-Hilliard equation, we adopt a three-term discrete Gagliardo-Nirenberg inequality analysis technique and achieve a substantial reduction in the degree of polynomial dependence for the coupled system. Numerical experiments are presented to verify the effectiveness of the theoretical results and to demonstrate the robustness of the method for different parameters of interfacial thickness.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.06174 ↗

We study the uniaxial perfectly matched layer (UPML) problem for the Helmholtz equation in two and three dimensions and establish wavenumber-explicit stability estimates at high wavenumbers. For the full-space UPML problem, we prove the optimal stability estimate with the inf-sup constant satisfying $μ_\infty\eqsim k^{-1}$ for sufficiently large $k$ if the absorption function $σ\in W^{1,\infty}$ is a piecewise-power function of order at least one for which $\|σ'\|_{L^\infty(\{t:0<σ(t)\leqδ_*\})}\leq \varepsilon_*$, where $\varepsilon_*$ and $δ_*$ depend only on the PML parameters. Using this stability estimate, we obtain the optimal inf-sup estimate $μ_L\eqsim k^{-1}$ for the truncated UPML problem. These estimates further yield preasymptotic error estimates for a linear continuous interior penalty finite element method (CIP-FEM). Numerical simulations confirmed the theoretical predictions and demonstrated the effectiveness of CIP-FEM under high-wavenumber conditions.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.06288 ↗

In this paper,we consider a stable numerical method for the Stokes-Biot model. We adopt the standard formulation of the Stokes equations coupled with the mixed formulation of the Biot system involving the additional total pressure variable. We construct the semi-discrete scheme on polygonal meshes by employing weak Galerkin finite element methods for spatial discretization. It is convenient to incorporate the interface conditions into the semi-discrete scheme via the edge-based degrees of freedom. Furthermore, we give a fully discrete scheme based on the backward Euler method. We establish the well-posedness of these two schemes and provide a rigorous error analysis. Finally, we present some numerical examples to verify the convergence and stability of our algorithm under a wide range of some physical parameters.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.06335 ↗

We develop an arbitrary Lagrangian–Eulerian continuous Galerkin finite element method for two-dimensional fully nonlinear free-surface potential flow. An isoparametric finite element method computes the interior potential on the current fluid domain, while a residual-based Dirichlet–Neumann flux drives the surface evolution. The residual-based flux satisfies a global discrete balance inherited from the interior variational formulation. When combined with compatible mesh motion, surface projection, and quadrature, this balance yields conservation of the discrete fluid volume at the semi-discrete level. An optional volume-conserving sixth-order surface dissipation controls high-frequency oscillations, and the surface equations are advanced with fourth-order Runge–Kutta integration, updating the mesh and interior solution at every stage. Numerical experiments confirm the expected spatial convergence for linear free-surface waves and demonstrate reduced mesh sensitivity for nonlinear waves over flat and curved bottoms. A rotating-wavemaker example further illustrates the treatment of moving solid boundaries.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.06408 ↗

Quantum-inspired numerical methods for partial differential equations represent discretized fields and operators as quantics tensor trains (QTT), so that their cost depends on how compressible the problem is rather than on the number of unknowns. Global spectral formulations in this setting have so far relied on Fourier bases, restricted to periodic problems, or on collocation, which does not preserve the variational structure exploited by tensor-network solvers. We introduce a QTT Chebyshev–Galerkin method that assembles and solves global spectral systems directly in compressed form, without forming the underlying arrays. Starting from the weak formulation, the method handles coupled elliptic systems with variable coefficients, smoothly mapped geometries, and mixed Dirichlet–Robin boundary conditions, and yields symmetric positive-definite systems suited to variational tensor-network solvers. Parameters and random inputs enter as additional coordinates, so the same construction returns the solution over an entire parameter space in a single solve. In linear elasticity, the method retains spectral convergence and reaches errors below $10^{-8}$ on a three-dimensional benchmark, beyond those attained by QTT finite differences and Q2/Q4 FEniCSx finite elements over the tested range. A six-parameter cantilever design study covering $1.7\times10^{7}$ designs is solved in a single 92~s run, and a stochastic problem with ten random coordinates is represented with $2.4\times10^{6}$ times less memory than its full coefficient array.

comments
27 pages, 11 figures, 3 tables. Code and data: https://doi.org/10.5281/zenodo.23931798
fields
Numerical Analysis
pdf ↗ page arXiv:2611.06552 ↗

We analyze a geometric multigrid method on locally refined mesh hierarchies for non-local variational problems, focusing on the integral fractional Laplacian. For newest-vertex-bisection-generated hierarchies, we prove uniform contraction of the multigrid iteration independently of the refinement level, the smallest local mesh size, and the polynomial degree in the finite element discretization. The proof is based on an abstract Hilbert-space framework, a strengthened Cauchy–Schwarz estimate obtained from a near-/far-field decomposition of the non-local bilinear form, and a multilevel stable decomposition independent of the discretization parameters. Numerical experiments underline the theoretical findings.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.06577 ↗

We establish Sobolev–Poincaré inequalities for piecewise $W^{2,p}$ functions in two and three dimensions over families of general polytopic (including shape-regular simplicial and Cartesian) meshes, allowing for degenerate facets. The proposed inequalities feature control by either the broken Hessian or, more naturally for general fourth-order problems, the broken Laplacian. Important tools in their derivation are a Helmholtz decomposition in Banach–Sobolev spaces and Sobolev–Poincaré inequalities for piecewise $W^{1,p}$ functions; we avoid the use of any inverse inequality. We provide estimates with fairly general Lebesgue exponents. Applications to the stability analysis of nonconforming discretizations for second- and fourth-order, linear and nonlinear problems are exhibited.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.06646 ↗

Operator inference (OpInf) provides a nonintrusive framework for learning projection-based reduced-order models directly from data, but its standard formulations do not explicitly account for the fact that boundary actuation changes the admissible solution space of a PDE. This paper develops and evaluates a boundary-consistent, lifting-based OpInf formulation for nonlinear PDEs with time-varying inhomogeneous boundary conditions. The proposed approach decomposes the state into a known lifting component that satisfies the prescribed boundary conditions and a homogeneous component represented in a POD basis. Substituting this decomposition into the governing dynamics reveals a boundary-consistent reduced model structure in which the learned dynamics includes bilinear state-input and quadratic input-input interactions for quadratically nonlinear PDEs. The resulting operators are inferred from data, preserving the nonintrusive character of OpInf while guaranteeing boundary condition satisfaction by construction. Numerical experiments on boundary-actuated heat, Burgers, and lid-driven cavity problems show that the lifted formulation improves boundary compliance and can enhance prediction accuracy, solver stability, and computational efficiency, although these gains vary across problems and reduced model dimensions. Overall, this study establishes lifting as a principled extension of OpInf for boundary-actuated PDEs, clarifies when and how this formulation improves performance, and indicates that standard OpInf can remain an effective alternative in certain regimes.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.06665 ↗

Functional Analysis17

In this paper, we investigate structural properties of the parallel sum of set-valued operators in a real Hilbert space, with particular emphasis on monotonicity, maximal monotonicity, and paramonotonicity. We examine the decomposition-invariance property of the parallel sum of two paramonotone operators and provide a direct proof based on monotonicity and the equality of admissible decompositions. This approach establishes the required orthogonality relations without invoking the Attouch–Th{é}ra Duality duality framework. We also revisit the classical maximal-monotonicity property of the parallel sum and present an alternative graph-based derivation involving an auxiliary shifted operator. Furthermore, we study the parallel sum of a set-valued operator and the normal cone operator associated with a closed linear subspace. Explicit characterizations of its values, domain, and range are presented, and a decomposition-independent representation is obtained under paramonotonicity through the orthogonality of the underlying subspaces. These results provide a unified and self-contained treatment of selected properties of parallel sums and clarify the role of paramonotonicity in their structural behavior.

fields
Functional Analysis
pdf ↗ page arXiv:2611.05523 ↗

Fofana spaces, introduced in the framework of Wiener amalgam spaces, can be viewed as generalizations of Morrey spaces. These spaces have attracted considerable attention in recent years and have found applications in the study of partial differential equations. In this paper, we investigate their variable-exponent counterparts. More specifically, we describe Calderón's, first and second, complex interpolations of Fofana spaces with variable exponent, as well as the corresponding interpolation spaces of their preduals. Our results recover, as special cases, those already known for (classical) Fofana and Morrey spaces.

comments
13 pages, no figure
fields
Functional Analysis
pdf ↗ page arXiv:2611.05628 ↗

Let $G$ be a finite simple $d$-regular graph, $d\geq 3$, whose second largest adjacency eigenvalue satisfies $λ_2(G)\leq (1-δ)d$, where $0<δ\leq 1$. We prove that the Poincaré constant satisfies $$γ(G,\|\cdot\|_X)\lesssim \frac{qCK}δ$$ whenever $X$ is a real Banach space with a $K$-unconditional Schauder basis and cotype $q$ with constant $C$. This constant compares the mean distance over all vertex pairs with the mean distance across edges. For real Banach lattices the bound is $O(qC/δ)$. The proof estimates where a random walk first leaves each coordinate level set. As a consequence of the bound, if $n$-vertex graphs in a fixed-degree expander family embed with bounded distortion into spaces with bounded $C,K$, then $q$ must grow at least as fast as $\log n$. This order is attained in $\ell_q^n$.

comments
11 pages
fields
Functional Analysis, Combinatorics
pdf ↗ page arXiv:2611.05649 ↗

We establish BMV-type results and prove the positivity-preserving property and uniqueness of support-normalized spectral shift functions of arbitrary order for semibounded operators with relatively Schatten-von Neumann perturbations. We also derive correlation inequalities in the relative Hilbert-Schmidt case. These results build on a new positivity-preserving property for the trace of a higher-order operator derivative along a relatively Schatten direction and are obtained using methods of multilinear operator integration and approximation.

comments
44 pages
fields
Functional Analysis, Mathematical Physics, Analysis of PDEs, Operator Algebras, Spectral Theory
pdf ↗ page arXiv:2611.05879 ↗

For $p\in[1,2]$, we prove uniform moment estimates for weighted sums \[ \sum_{j=1}^mζ_jw_j|\langle{\bf v}_j,y\rangle|^p \] of independent subgaussian random variables $ζ_j$, where the unit vectors $\{{\bf v}_j\}_{j=1}^m$ and nonnegative weights $\{w_j\}_{j=1}^m$ form an isotropic frame. This allows us to obtain optimal sampling discretization of $L_p$ norms for each fixed $p\in[1,2]$. Namely, for an $N$-dimensional space $X_N$ of bounded functions satisfying $\|f\|_\infty\le\sqrt {KN}\,\|f\|_{L_2}$ for every $f\in X_N$, we show that $m\ge C\varepsilon^{-2}KN\log(2N)$ independent samples $ξ^1,\ldots,ξ^m$ provide the discretization \[ (1-\varepsilon)\|f\|_{L_p}^p \le\frac1m\sum_{j=1}^m|f(ξ^j)|^p \le(1+\varepsilon)\|f\|_{L_p}^p \quad\forall f\in X_N \] with probability at least $1-\exp(-c\frac{m\varepsilon^2}{KN})$. This implies a corresponding weighted discretization result that, for $1<p<2$, improves Talagrand's bound on the dimension $m$ needed to embed $N$-dimensional subspaces of $L_p$ into $\ell_p^m$ with distortion at most $1+\varepsilon$, giving $m\le C\varepsilon^{-2}N\log(2N)$.

fields
Functional Analysis, Probability
pdf ↗ page arXiv:2611.05930 ↗

In this article, we prove two compactness parabolic extrapolation theorems for linear operators and their commutators on parabolic weighted Lebesgue spaces. As applications, we show that $b\in\mathrm{PCMO}$ (parabolic CMO space) if and only if $b\in L_\mathrm{loc}^1$ and the commutator $[b,I_α^{γ+}]_k$ is compact from $L^r(ω^r)$ to $L^q(ω^q)$ for any $k\in\mathbb{N}$, $1<r<q<\infty$ with $\frac{1}{r}-\frac{1}{q}=α\in(0,1)$, and $ω\in A_{r,q}^+(γ)$ (parabolic Muckenhoupt class), where $I_α^{γ+}$ is the parabolic fractional integral. Several other equivalent characterizations of the space $\mathrm{PCMO}$ are also given. Our approach combines the unweighted compactness for mixed commutators, a local lower estimate for $[b,I_α^{γ+}]_k$, and both a quantitative Uchiyama-type description and the equivalence with $\inf_T\{\|[\cdot,I_α^{γ+}]_k-T\|_{L^r\to L^q}^\frac{1}{k}\}$ of $\mathrm{dist}_{\mathrm{PBMO}}(\cdot,\mathrm{PCMO})$, where the infimum is taken over all compact operators $T:L^r\to L^q$. Finally, we establish two parabolic weighted Fréchet–Kolmogorov compactness criteria, which further induce a parabolic interpolation theorem of compactness.

fields
Functional Analysis, Analysis of PDEs, Classical Analysis and ODEs
pdf ↗ page arXiv:2611.05933 ↗

We establish conversions in both directions between geometric and descriptor representations of linear port-Hamiltonian systems on infinite-dimensional Hilbert spaces. For the geometric-to-descriptor conversion, we represent the possibly multivalued inverse Dirac relation by a skew-adjoint operator on enlarged Hilbert spaces, retaining the original operator-domain restrictions. The construction accommodates internal and external ports. We show that the conversions preserve trajectories and the power balance. An incompressible Kelvin–Voigt solid illustrates the results.

fields
Functional Analysis
pdf ↗ page arXiv:2611.06080 ↗

Two elements $a,b$ in a normed space are parallel if $\|a+γb\|=\|a\|+\|b\|$ for some $|γ|=1$; they form a triangle equality attaining (TEA) pair if $\|a+b\|=\|a\|+\|b\|$. For finite-dimensional complex $C^*$-algebras other than $\mathbf M_2(\mathbb C)$ and $\mathbb C\oplus_\infty\mathbb C$, bijective linear maps on these algebras preserving parallel or TEA pairs are scalar multiples of isometries. For unital abelian algebras with spectra containing at least three points, preservation in both directions gives the same conclusion. We obtain corresponding results for type I factors, simple type I $C^*$-algebras, and unitarily invariant operator spaces under additional continuity and finite-rank hypotheses. All results for $C(X)$ and $B(H,K)$ hold over both real and complex fields.

fields
Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2611.06187 ↗

We first show that a regularizer on $\mathbb{R}^d$ that is continuous, symmetric, and amplitude-equivariant is of the form $g=q^γ$ with $γ>0$, where $q$ is continuous and absolutely homogeneous; we call the set of such $q$ the CH class, whose convex members are the seminorms. Within the CH class, we single out two configurations of interest for regularization: the quasi-norms, which are exactly the positive-definite members of the family, and the quasi-seminorms with null space control, which are the composition of a quasi-norm with a linear map that sets the null space. We then propose a universal parametrization of the class by conic splines, the continuous functions that are linear on each cone of a polyhedral fan. Specifically, we show that the polyhedral CH functionals are exactly the symmetric non-negative conic splines, and that these admit a stable nodal representation in a basis of conic B-splines. Finally, we determine the rates of approximation: the conic spline interpolant converges at the second-order rate $h^2\asymp n^{-2/(d-1)}$, in the $L_\infty$-norm on the hyper-sphere when the angular profile is twice differentiable, and in the $L_1$-norm when its spherical Hessian variation is bounded, which covers the polyhedral members of the class. The rate is sharp, already for the Euclidean norm. The planar case is worked out in full, with the trigonometric hat functions as basis and an $\ell_1$-norm of second differences as regularity index.

fields
Functional Analysis
pdf ↗ page arXiv:2611.06212 ↗

We study commutators $[(-Δ_θ)^{\fracε{2}},M_x]$ involving fractional Laplacians on quantum Euclidean spaces associated with arbitrary real antisymmetric matrices $θ$. For $d\geq2$ and $-\frac d2<ε\neq 0<1$, we characterize critical weak Schatten class membership of $[(-Δ_θ)^{\fracε{2}},M_x]$ for any $x$ as a tempered distribution by Sobolev spaces, with equivalent corresponding norms. We also establish precise asymptotics of singular values for $[(-Δ_θ)^{\fracε{2}},M_x]$. For this purpose, we extend the Cwikel estimates and the required asymptotics of singular values to arbitrary real antisymmetric matrices, and we also establish a systematic approximation theory of tempered distributions on quantum Euclidean spaces.

fields
Functional Analysis
pdf ↗ page arXiv:2611.06405 ↗

Kramar and Kramar Fijavž proved that a commutator $Y=AB-BA$ of two complex square matrices is nilpotent whenever $Y$ commutes with an iterated commutator $δ_Y^{k}(A)$, where $δ_Y(T)=YT-TY$, and asked whether this result can be generalized to bounded operators on infinite-dimensional spaces. We show that for $k\geq 2$ such a commutator need not be quasinilpotent. On the other hand, for every $k$ it is quasinilpotent whenever it is compact, or more generally whenever it is a Riesz operator or $AY-YA$ is compact. Moreover, its Riesz projection at any non-zero isolated point of its spectrum always has infinite rank.

fields
Functional Analysis
pdf ↗ page arXiv:2611.06423 ↗

We study the half weight ($N=\half$) analogue of the Bers quasiform on a Schottky group $Γ$ of genus $g$: the Poincaré series $S_\eps(x,y)=\sum_{\gt\in\Gt}j(\gt,x)/(γx-y)\,(dx\,dy)^{1/2}$ over a lift $\Gt\subset\mathrm{SL}_2(\C)$ of $Γ$. The $\Ng:=2^{g}$ lifts give $\Ng$ trivial $α$-holonomy even spin structures $\Lg$. The remaining $2^{2g}-\Ng$ spin structures are not treated in this paper. We prove, on an open set (H) of Schottky parameters and more generally whenever the critical exponent of $Γ$ is below $\half$ (any genus $g\ge 1$) the following: absolute and locally uniform convergence on $Ω_0\timesΩ_0$, where $Ω_0$ is the full region of discontinuity including the point $\infty$ (treated in homogeneous coordinates); invariance without Eichler-type defect; skew-symmetry; a simple pole on the diagonal as the only singularity; $H^0(\Sg,\Lg)=0$; and hence identification of $S_\eps$ with the Szegő kernel of $\Lg$. At genus one the kernel is computed explicitly and the relations between lifts and theta characteristics are determined. We further prove that the diagonal coefficient defines a projective connection that differs from the Bergman projective connection by a quadratic differential constructed from $θ[δ](0)$, a residue-reconstruction formula for half-differentials with poles of any order, an expansion in the Schottky multipliers, and a formula for the free fermion stress tensor.

fields
Functional Analysis
pdf ↗ page arXiv:2611.06446 ↗

We construct nonisomorphic separable real Banach spaces whose multiplicative Lipschitz distance is one. Building on OpenAI's graph-space construction, we arrange two sequences of graph spaces into countably many blocks and form two spaces that differ by a single additional block. This block distinguishes their linear structures: one space contains a complemented copy of $\ell_1(c_0(\ell_2))$, whereas the other does not. By mapping the additional block to increasingly late positions and rearranging the remaining blocks, we obtain homeomorphisms whose Lipschitz constants and those of their inverses tend to one, while both spaces and their norms remain unchanged.

comments
66 pages
fields
Functional Analysis
pdf ↗ page arXiv:2611.06493 ↗

We construct a separable complex Banach space whose underlying real space has the alternative Daugavet property, although the complex space fails the Daugavet property, thereby answering an open question posed by Kadets, Martin, and Paya in 2006.

comments
Submitted for publication. Comments are welcome
fields
Functional Analysis
pdf ↗ page arXiv:2611.06532 ↗

We give negative answers to the AP-to-BAP and BAP-to-MAP questions for dual Banach spaces. More precisely, there is a separable Banach space $V$ with the metric approximation property (MAP) such that $V^*$ has the approximation property (AP) but no bounded approximation property (BAP). There is also a separable MAP space $X$, isomorphic to $\ell_1$, whose dual has BAP but no MAP. This resolves a longstanding open question explicitly stated in \cite{Oja2010}. The constructions rely on a finitely generated group without Property A and a quantitative estimate for optimal bounded approximation constants of projective tensor products.

comments
26 pages
fields
Functional Analysis
pdf ↗ page arXiv:2611.06579 ↗

We investigate the spectral and boundedness properties of the inverse Ornstein–Uhlenbeck operator $\mathcal{A}^{Q,B}$ and its associated semigroup in $L^p$ spaces with respect to the inverse Gaussian measure. We establish strong continuity and contractivity of this semigroup in $L^p$ for $p \in [1, \infty)$, and obtain a complete characterization of the spectrum of $\mathcal{A}^{Q,B}$. For $p \in (1, \infty)$, the spectrum is independent of $p$, consists entirely of eigenvalues and exhibits a spectral gap. For $p=1$, the spectrum is instead the left half-plane. Furthermore, we discuss ultracontractivity and hypercontractivity properties of the semigroup.

comments
17 pages
fields
Functional Analysis
pdf ↗ page arXiv:2611.06826 ↗

Let $T\in\mathcal{B}(X)$, where $X$ is a complex Banach space. We introduce the spaces $\mathcal{I}_s(T)$, defined by independently chosen preimages under the powers of $T$ with exponential growth bounds, and study algebraic radial decompositions involving $\mathcal{H}_r(T)$, $\mathcal{K}_s(T)$, and $\mathcal{I}_s(T)$. We prove that every algebraic decomposition $X=\mathcal{H}_r(T)\oplus\mathcal{I}_s(T)$ is topological and that $\mathcal{I}_s(T)=\mathcal{K}_s(T)$. This removes the closedness assumption in the radial decomposition theorem of Koliha and Poon. We also prove that, for $0\leq a\leq b$, the closedness of $\mathcal{I}_b(T)$ and $\mathcal{H}_a(T)+\mathcal{I}_b(T)$ implies $\mathcal{I}_b(T)=\mathcal{K}_b(T)$. We establish finite-defect and circular spectral criteria and characterize the Cantor–Bendixson derivatives of the spectrum, Browder spectrum, and Drazin spectrum in terms of radial decompositions and quotient restrictions. As applications, we obtain new characterizations of generalized Drazin, generalized Drazin–Riesz, generalized Drazin–meromorphic, and $g_z$-invertible operators in terms of radial subspaces.

comments
24 pages
fields
Functional Analysis, Operator Algebras, Spectral Theory
pdf ↗ page arXiv:2611.06831 ↗

Information Theory17

The 2-switch operation for reducing the number of short cycles in Tanner graphs of LDPC codes has been utilized in some works. If this operation is appropriately applied to a 2-induced matching in a bipartite graph, then it surely preserves the bipartiteness of the graph. With a 2-induced matching, we have only one choice for applying this type of change to the graph. Using 3-induced matchings creates more potential and flexibility to apply certain changes to the Tanner graph. We present a necessary and sufficient condition for the existence of a 3-induced matching in bipartite graphs with girth at least 6. A 3-induced matching helps us to have more choices for applying a change to a bipartite graph while surely preserving the bipartiteness of the graph and keeping the degree sequences unchanged. Among all changes that we consider, we select the best change for reducing the number of cycles of length 6. The eigenvalues of subgraphs are used to reach a 3-induced matching, and a condition in some steps can be checked to ensure that the subgraph has at least one 3-induced matching. We present some numerical results regarding the steps at which the condition that guarantees the existence of a 3-induced matching is checked.

fields
Information Theory, Combinatorics
pdf ↗ page arXiv:2611.00082 ↗

Let $X$ be a uniform random bit string and $Y$ be obtained by flipping each bit of $X$ independently with probability $p$. Let $C$ be a random bit obtained as a function of $Y$. We show that $\mathbf{I}(C:X)\le \mathbf{I}(Y_1:X)$ for all $p\in[0,1]$, which resolves a conjecture posed by Courtade and Kumar in 2013.

comments
17 pages, 2 figures
fields
Information Theory, Combinatorics
pdf ↗ page arXiv:2611.05430 ↗

In this paper, three operations on Gibbs probability measures are studied: renormalization, normalized log-linear combination, and nesting. The resulting measures are shown to be Gibbs probability measures with explicit expressions for their objective functions, reference measures, and regularization factors. These measures are further characterized as unique solutions to optimization problems involving linear combinations of the original objective functions, subject to either relative entropy regularization or relative entropy constraints. When the reference measures are probability measures, geometric interpretations of these three operations are established involving Pythagorean identities and exponential geodesics.A central result is the equivalence between nesting and normalized log-linear combinations of Gibbs probability measures. These results are then applied to supervised machine learning with Gibbs algorithms, which are represented by Gibbs probability measures. In this context, either through nesting or log-linear combinations, Gibbs algorithms trained on local datasets are used to form new Gibbs algorithms trained upon the aggregation of all local training datasets. Interestingly, the parameters of such operations, determine the weights of each training data point on the aggregated dataset. %Operations on local Gibbs probability measures are shown to control the contributions of training data. This observation is leveraged for achieving: (a) exact machine unlearning in centralized, decentralized, and federated learning systems; and (b) centralized-equivalent performance, in the sense of producing algorithms trained on the aggregation of all local datasets in decentralized and federated learning .

comments
Submitted to the IEEE Transaction on Information Theory
fields
Information Theory
pdf ↗ page arXiv:2611.05544 ↗

We show exact signal recovery in generative compressed sensing for feedforward neural networks with piecewise-linear activations and a final sigmoid activation, with no assumption of expansivity. Consider a ReLU network of depth $d$ with a sigmoid final activation, whose input layer, of dimension $k$, is the narrowest, and let $K$ be the geometric mean of the widths of its layers. We show that, with high probability, all signals of the range whose entries lie in $[δ, 1 - δ]$ are uniformly recovered from $m \gtrsim k(d \log(K/k) + \log(1+\log(1/δ)))$ measurements.

comments
9 pages
fields
Information Theory
pdf ↗ page arXiv:2611.05626 ↗

In the hotplug coded caching model, $K$ users fill their caches of size $M$ as a function of $N$ files, but only an unknown subset of $A<K$ users is active in the delivery phase. We recently showed that (i) under uncoded placement, offline users cause a strict load penalty at intermediate memory sizes, so that coded placement is needed; and (ii) for $AM\leq N$, every classical scheme with row-wise placement, including the scheme of Gomez-Vilardebo (GV), can be embedded in a Reed-Solomon code, which removes the penalty. In this note, we show that every point of the scheme of Yu, Maddah-Ali and Avestimehr (YMA) for a classical system with $A$ users is achievable in the hotplug model for every $K\geq A$. Each user is associated with a hyperplane and each file with a homogeneous polynomial; each user caches the restriction of the polynomial to its hyperplane, and the subfiles seen by the active users are the values of the polynomial at the points where their hyperplanes meet. This is a projective Reed-Muller code, which reduces to the Reed-Solomon code when each subfile is cached by one user. We then show, by an existence argument, that every classical scheme whose cache is a linear compression of the Maddah-Ali-Niesen cache and whose correctness holds for generic coefficients can also be embedded over a sufficiently large field; this includes the interference elimination (IE) schemes of Tian and Chen. These embeddings complement the Reed-Solomon one, which allows any row-wise placement and any delivery. Together with past work, our results show that every point attained by a GV, YMA or IE scheme ($N\leq A$ for IE), and every corner point of the linear tradeoff for $A=N=3$, is achievable in the hotplug model with a load that does not depend on $K$. Whether the optimal hotplug tradeoff depends only on $A$ remains open, but these results support a positive answer.

comments
companion paper to arXiv:2611.03045
fields
Information Theory
pdf ↗ page arXiv:2611.05772 ↗

We develop a Bayesian information-theoretic framework for proving functional inequalities for log-concave measures. Motivated by Klartag and Ordentlich, we establish a unified equivalence between $Φ$-Sobolev inequalities and Bayesian estimation lower bounds: for a large class of smooth convex $Φ$, a log-concave measure $μ$ satisfies a $Φ$-Sobolev inequality with constant $C>0$ if and only if for $X\simμ$, any $t>0$, and any real-valued measurable $f$, the Bayes risk of estimating $f(X)$ under the $Φ$-Bregman loss from the Gaussian additive observation $Y_t=\sqrt tX+G, G\sim N(0,I_n)$ is at least a $1/(1+Ct)$-fraction of that of the trivial estimator. Combining it with direct information-theoretic arguments, such as testing-to-estimation reductions, we obtain old and new functional inequalities: - For the Poincaré inequality, corresponding to $Φ(x)=(x-1)^2$, we give a simple static information-theoretic proof that the Poincaré constant of an isotropic log-concave measure on $\mathbb{R}^n$ is $O(n^{1/2})$, first proven via stochastic localization in the seminal work of Lee and Vempala. - For the log-Sobolev inequality, corresponding to $Φ(x)=x\log x$, we prove that all smooth $K$-subgaussian log-concave measures $μ$ satisfy $C_{\mathrm{LS}}(μ)\lesssim K^2n^{1/4}$, surpassing the recent state-of-the-art bound of $O(K^2n^{1/2})$ by Bizeul. In parallel and independent work, OpenAI claimed the optimal bound $O(K^2)$ in their October 6, 2026 release of 722 papers. - Finally, we give a Bayesian reformulation of the common structure of the three recent proofs of the Kannan–Lovász–Simonovits conjecture, a dimension-free Poincaré bound for isotropic log-concave measures [BK26; BKL26; SZ26]. Tools from the study of the "low-degree MMSE" in computational complexity of statistical inference motivate and recast key steps and quantities of these proofs.

fields
Information Theory, Probability, Statistics Theory
pdf ↗ page arXiv:2611.05831 ↗

Large language models (LLMs) compress text far better than classical compressors, but LLM-based compressors are slow, particularly during decompression. We argue that their decoding time has two fundamentally different sources. Execution redundancy, such as per-token host transfers, CPU-side coding, and token-by-token encoding, is work that the coded output does not require and can be removed without changing a single output bit. Sequential dependency, one model call per decoded token, is inherent to lossless decoding and cannot be removed by better execution, only traded for more calls or for more bits. We remove execution redundancy with a GPU-resident pipeline whose block-parallel encoding is made lossless in half precision by batch-invariant kernels, speeding up arithmetic coding by up to 5.8x in encoding and 3.0x in decoding without changing its compression rate. We then study the two ways of trading sequential dependency, speculative dual-model coding (SDMC) and multi-token single-model coding (MSMC), characterize the compression cost of predicting several tokens from a shared prefix, and identify the workloads in which fewer model calls are worth that cost.

comments
14 pages, 7 figures, 4 tables. Code: https://github.com/Angie-Yan/LLM-based-Data-Compression
fields
Information Theory
pdf ↗ page arXiv:2611.05871 ↗

Channel sounding in Wi-Fi multiple-input multiple-output (MIMO) systems must balance channel state information (CSI) accuracy against CSI acquisition overhead. Device mobility causes channel aging, while autoregressive CSI prediction introduces errors that accumulate over sounding intervals. However, standardized statistical channel models cannot fully capture the environment-specific channel dynamics encountered in physical artificial intelligence (AI) applications, motivating the use of Sionna-based ray tracing to evaluate CSI prediction under device mobility and evolving propagation geometry. This paper develops a dynamic sounding framework that integrates autoregressive CSI prediction with signal-to-interference-plus-noise ratio (SINR)-constrained interval selection. A Transformer with rotary position embedding that converts device positions into CSI sequences predicts CSI across multiple subcarriers for beamforming updates between sounding exchanges. We formulate sounding-interval selection as a predicted average-throughput maximization problem under per-stream SINR lower-bound constraints, including CSI acquisition and processing overhead. A prediction-error perturbation analysis provides the SINR bounds, and cumulative-sum enumeration globally solves the finite single-variable problem. Actual SINR feasibility holds whenever the prediction errors satisfy the bounds. Ray-tracing experiments assess channel prediction, trajectory transfer, and autoregressive prediction errors. In single-STA Wi-Fi 7 link-level simulations, predicted-CSI beamforming improves mean goodput by 67.3%, 112.7%, and 119.1% over stale CSI for linear, circular, and cosine trajectories, respectively.

fields
Information Theory
pdf ↗ page arXiv:2611.05970 ↗

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 the transport-information correspondence, the UCN quantify the information-theoretic cost due to discretization as the expected Kullback-Leibler divergence between nearby continuous distributions associated with 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 introduce an alternative local-map discretization scheme in which the probability mass within each cell is transported to its own probability-weighted centroid. This change in the representative-point selection enables an exact expression for the transport cost of each cell in terms of the covariance matrix of its conditional probability distribution and the Fisher metric of the underlying continuous family. We establish an exact correspondence between the resulting transport cost and 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 generalizes the transport-information correspondence to finite-scale discretization using arbitrary collections of non-overlapping bounded convex sets.

comments
6 pages
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 with vanishing 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
31 pages; submitted for publication
fields
Information Theory
pdf ↗ page arXiv:2611.06182 ↗

Underwater acoustic communication faces challenges such as limited available bandwidth and complex channel environments, which impose demanding requirements on efficient image transmission and reliable reconstruction. To address these challenges, this paper proposes a generative image communication framework based on cross-modal semantic successive refinement. At the transmitter, text descriptions, compact bottleneck features, and visual side information compressed by residual vector quantization are transmitted. At the receiver, text and bottleneck features are first fused to predict a base estimate of the intermediate visual representation. The received RVQ indices are then used to recover supplementary visual information and perform residual correction, followed by image reconstruction using a one-step Pixel Mean Flow model. During training, a CLIP-based text-image semantic consistency constraint is introduced to preserve the semantic correspondence between generated results and the original text descriptions. During transmission, protection resources are allocated according to the importance of different information branches and RVQ quantization stages. Simulations using COCO 2017 images and measured underwater acoustic channel records from Watermark show that text and bottleneck features provide complementary semantic and structural conditions, RVQ visual side information further improves reconstruction quality, and layered unequal error protection helps improve recovery at low SNRs. Code-rate allocation experiments reveal a tradeoff between the reliability of fundamental conditions and visual-detail reconstruction under a limited visual-feature coding budget, providing guidance for allocating protection resources in underwater acoustic image transmission.

fields
Information Theory
pdf ↗ page arXiv:2611.06205 ↗

Can independent components be recovered when all of them are Gaussian? Yes, if their variances change across environments; but how many environments, and how many samples as the number of components $d$ grows? We answer both for the joint diagonalization of $K$ covariances. Each component has a signature, its variances across the environments. Separating component $j$ costs the Riesz 2-energy $E_j$ of this signature, a sum, over the other components, of inverse pairwise Fisher informations. For Gaussian sources no estimator in $O(d)$ beats $cE_j/(n+E_j)$ at any $n$ and $d$, and above an explicit sample size a spectral estimator attains $E_j/n$ up to a constant, for every mixing and without the signatures (given a lower bound on the pairwise information). Since signatures live in $K-1$ dimensions, the rate obeys a dimension law: $d^2/n$, $d\log d/n$ and $d/n$ for $K=2$, $3$ and $K\ge4$ well-spread environments. What counts is the dimension the signatures span, not their number, and $\log d$ well-designed environments make $d\log d$ samples suffice. Projecting the covariances onto one linear combination pays $d^2/n$ at first order instead. In simulations up to $d=1000$ the predictions hold and joint diagonalization with $K\ge4$ attains the rate once $n/d$ is in the hundreds; on task fMRI the energy says which components are hard to separate.

fields
Information Theory
pdf ↗ page arXiv:2611.06228 ↗

We determine the exact zero-error memory-rate tradeoff for secure coded caching with three users and any number $N\ge2$ of independent files. Each user recovers its requested file, while its cache and the broadcast jointly reveal no information about the complete tuple of unrequested files. For $N\ge4$, two converse inequalities establish the optimality of the known achievable points and the memory-sharing segments between them. For $N=3$, two additional bounds identify a new corner at $(M,R)=(3/2,2)$, where memory and rate are measured in file units. An explicit linear code over $\mathbb{F}_3$ attains this corner and reduces the rate by one quarter of a file relative to memory sharing between the known points. The converse links the information held by cache pairs and triples to delivery under repeated and distinct requests. Its equality conditions guide the construction: users cancel the keys to recover their requested files, while uniform masking protects the complete tuple of unrequested files.

comments
34 pages, 2 figures
fields
Information Theory
pdf ↗ page arXiv:2611.06311 ↗

Neural joint source-channel coding (JSCC) enables efficient image transmission over noisy channels, yet distortion-optimized approaches often produce blurry reconstructions. While diffusion priors can enhance visual fidelity, their iterative sampling incurs substantial decoding latency. To address this limitation, we propose OSD-JSCC, an SNR-adaptive JSCC framework with a single diffusion step. Specifically, OSD-JSCC transmits pretrained variational autoencoder (VAE) latents through an SNR-conditioned JSCC codec and incorporates two key designs. First, we introduce a stochastic diffusion-state interface that enables the JSCC decoder to predict a Gaussian diffusion state rather than a clean latent, while extracting image-specific semantic tokens. The sampled diffusion state preserves spatial structure and provides a good initialization for one-step refinement, whereas the semantic tokens, together with an SNR token, guide the reconstruction process. Second, we develop SNR-conditioned feature modulation and adaptive timestep selection to jointly adapt latent transmission and diffusion refinement to varying channel conditions. Furthermore, we adopt a three-stage training strategy with low-rank adaptation (LoRA) to efficiently adapt the pretrained diffusion prior to the JSCC task. Extensive experiments on Kodak and CLIC2020 demonstrate that OSD-JSCC achieves superior perceptual quality and decoding efficiency. Compared with existing diffusion-based JSCC baselines, OSD-JSCC reduces LPIPS by approximately 43% on Kodak and 53% on CLIC2020, while achieving up to a 50.6$\times$ reduction in decoding latency.

comments
6 pages, 5 figures. Code: https://github.com/tangshunpu/OSD-JSCC
fields
Information Theory
pdf ↗ page arXiv:2611.06437 ↗

In this paper, we propose a threshold-triggered energy-accumulate-then-act backscatter communication system with retransmission under imperfect feedback detection. Under this system, harvested energy is accumulated across transmission blocks, and the backscatter device switches among different operation modes, including energy harvesting, initial transmission, and retransmission, according to its stored energy and decoded feedback. To characterize the resulting dynamics, the joint evolution of the packet-buffer and stored-energy states is modeled, based on which an embedded Markov chain is constructed to derive the steady-state energy distribution at the beginning of each update cycle. Subsequently, the average age of information (AAoI) is derived from the statistics of the inter-update interval and its correlation with the preceding packet system time, while the packet loss rate (PLR) caused by imperfect feedback detection is also obtained. Simulation results validate the analytical results and reveal that retransmission reduces PLR but may either improve or degrade AAoI, depending on packet-generation energy, data transmission rate, and feedback power. Moreover, lower feedback power shrinks the AAoI-favorable region of retransmission at low transmission rate, whereas the opposite trend emerges at higher rate.

fields
Information Theory
pdf ↗ page arXiv:2611.06499 ↗

Many modern engineering applications require distributed problem-solving in which multiple nodes in a network cooperate to achieve a common optimization objective. Numerous distributed optimization and learning algorithms rely on consensus-based distributed coordination to ensure network-wide agreement via iterative local interactions. In these algorithms, the accuracy, frequency, and reliability of information exchange among network nodes directly influence system performance, including convergence behavior, training delay, and model accuracy. This tutorial article adopts a bottom-up approach to present the fundamentals of consensus averaging and distributed optimization methods, and highlights the impact of network connectivity, information flow, and communication uncertainty on network cooperation and optimization performance. Building on these theoretical insights, we discuss key design principles for communication-constrained distributed learning across diverse network topologies and review common approaches to communication-efficient learning, particularly in wireless networks. Despite substantial progress, further efforts are needed to bridge the gap between theory and practice and fully realize the potential of cooperative and networked intelligence.

comments
20 pages, 3 figures, to appear in IEEE JSAC
fields
Information Theory
pdf ↗ page arXiv:2611.06524 ↗

Erasures are used to model faults at a subset of known locations in various platforms used to construct fault-tolerant quantum computers. Beyond the utility in erasure recovery, efficient decoders for erasures are useful to both understand error decoders and as a subroutine for error decoding. Classical expander codes, which belong to the family of low-density parity-check (LDPC) codes, can be equipped with the Peeling decoder which works in linear time. Our main result is the algorithm Small-Set-Peeling, a quantum generalization of the classical Peeling decoder for erasures, that applies to quantum expander codes (Tillich, Zémor, IEEE T-IT 2013; Leverrier, Tillich, Zémor, FOCS 2015). This decoder can correct up to $D-1$ erasures, where $D$ is the (design) distance of the code and, importantly, is the first decoder that is guaranteed to do so in linear time. Combining with the erasure-conversion algorithm Small-Set-Find (Krishna, Livni-Navon, Wootters, SODA 2024), our result also implies the existence of a novel graph-local linear-time decoder for Pauli errors.

fields
Information Theory
pdf ↗ page arXiv:2611.06818 ↗

Dynamical Systems16

Mahler showed that for every irrational $α$ and every base ${b\geq 2}$, there is a single positive integer $n$ such that every digit in $\{0, \dots, b-1\}$ occurs infinitely often in the base-$b$ expansion of $nα$. Furstenberg later observed that dynamical methods can be used to give a different proof. Building on this perspective, we give generalizations of Mahler's theorem in two directions: the multipliers are a syndetic subset of certain multiplicative semigroups, and analogous versions hold in higher dimensions. Our main tool is IC-rigidity, a type of rigidity which is a hybrid of topological and measurable constraints.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.05607 ↗

We determine the normal forms of real planar polynomial differential systems of degree at most four with three prescribed pairwise disjoint invariant circles, covering all configurations of their centers. None of the prescribed circles is a limit cycle in the concentric case or in the coaxial case with three distinct centers, where the pairwise radical axes coincide. When exactly two centers coincide, or when the three centers are distinct and collinear and the circles are non-coaxial, we give necessary and sufficient conditions for all three circles to be algebraic limit cycles, which are necessarily hyperbolic. For non-collinear centers, we give explicit necessary and sufficient conditions for all three circles to be periodic orbits and for all three to be hyperbolic algebraic limit cycles. Each of the four configurations with non-collinear centers is realized by a coprime quartic polynomial differential system with three hyperbolic circular limit cycles.

comments
28 pages, 1 figure
fields
Dynamical Systems
pdf ↗ page arXiv:2611.05696 ↗

We study the Lebesgue measure of wandering continua and related invariant sets in Julia sets, using the hyperbolic area method recently developed by Ye. For entire functions of finite type, we show that a wandering continuum of positive area must escape to infinity uniformly. For infinitely renormalizable unicritical polynomials, we show that almost every point in the renormalization core (the intersection of the orbits of little Julia sets) is recurrent and contained in the postcritical set. The main tool is a conservativity theorem: if $f$ is injective on a forward invariant measurable subset $E$ of the Julia set, then $f|_E$ is conservative and almost every point of $E$ is recurrent and contained in the postsingular set.

comments
10 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2611.05949 ↗

We prove that every $C^1$ collapsed Anosov flow on a closed three-manifold with non-virtually-solvable fundamental group is accessible. No transitivity or nonwandering assumption is required, and the collapsing map need not satisfy the strong-collapse conditions. We also prove that every three-dimensional collapsed Anosov flow for which no positive iterate is a discretized Anosov flow is accessible.

comments
31 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2611.06210 ↗

We consider arbitrary holomorphic families of endomorphisms of a complex projective space. We prove that the existence of an equilibrium web implies the holomorphic motion of all repelling cycles contained in the Julia set, i.e., the support of the unique measure of maximal entropy. Together with previous results of Berteloot, Bianchi, Brévard, Buff, and Dupont, this completes the extension of the stability-bifurcation theory to arbitrary families of holomorphic endomorphisms. The same conclusions also hold for holomorphic families of polynomial-like maps of large topological degree.

fields
Dynamical Systems, Complex Variables
pdf ↗ page arXiv:2611.06211 ↗

We prove a Dolgopyat-type estimate for the twisted transfer operators of a class of two-dimensional partially hyperbolic endomorphisms of the torus, not necessarily skew-products. The twist satisfies a quantitative transversality condition on the cotangent dynamics of the associated three-dimensional extension which, in the skew-product case, is related to Tsujii's notions of transversality and partial captivity conditions. We use the main estimate to prove higher order expansions in the central and mixing local limit theorems for the two-dimensional base, including the case of several ergodic absolutely continuous invariant measures, and we prove exponential decay of correlations for the associated three-dimensional circle extensions, with a partially hyperbolic base.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.06314 ↗

We study mixed random-quasiperiodic cocycles whose one-step laws evolve along an ergodic environment. Under mixed-base ergodicity, bounded logarithmic growth, and stationary-value uniqueness, which we characterize by relative quasi-irreducibility, we prove exponential quenched deviations for finite-time directional growth. A renewal example shows that, in general ergodic environments, annealed exponential deviations can fail despite quenched exponential concentration. This obstruction motivates us to consider a fixed finite-state irreducible aperiodic Markov environment, where we establish annealed exponential deviation estimates uniform over a relative neighborhood of a reference sampling kernel in the bounded mixed-base-ergodic class at each fixed tolerance. These estimates yield local Hölder continuity of the maximal Lyapunov exponent near a stationary-value-unique kernel with a simple top exponent. Under common matrix and inverse bounds, the continuity applies to synchronized Wasserstein perturbations with fixed translation marginals and continuous matrix fields, or to ordinary Wasserstein perturbations with uniform Hölder regularity in the phase. As an application, suitable frequency-support and noise-nondegeneracy conditions yield Hölder energy dependence for moving-law Schrödinger cocycles with continuous potentials.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.06379 ↗

Dooge asked whether hydrology has laws at the catchment scale. We ask whether a low-dimensional system built under physical laws can match the accuracy of neural networks that outperform process-based models on the same inputs. Three laws constrain a lumped catchment model. Conservation makes it a flux-connected storage network, dissipation fixes the sign of every flux and aggregation determines how the unresolved composition enters the fluxes, through effective laws over threshold distributions and a memory of the forcing. These laws admit four kinds of refinement. A parsimonious model under them, CaRT (11 parameters per catchment), is refined in a loop assisted by AI agents. Each refinement addresses an observed deficit through a hypothesis from the literature. The result, CaRT+, has fourteen states, 35 parameters per catchment and no daily neural network. Most refinements follow from aggregation over thresholds or from variables that carry no water but modulate fluxes. On 602 British and 593 US gauged catchments, single CaRT+ models reach median Nash-Sutcliffe efficiencies of 0.863 and 0.765 in held-out years. A stateful LSTM reaches 0.869 and 0.751 and an entity-aware LSTM 0.862 and 0.754, while three-seed LSTM ensembles remain ahead of the CaRT+ ensemble by 0.003-0.012 in median paired NSE. On 505 drier Australian gauged catchments unused in development, single CaRT+ models reach 0.778 against 0.762 and 0.753 for the two LSTMs. The results suggest that catchment-scale laws exist as laws of form, with the constitutive families shared and only their parameters learned.

comments
61 pages, 12 figures, 13 tables, plus 19 pages of Supporting Information
fields
Dynamical Systems
pdf ↗ page arXiv:2611.06382 ↗

We study the planar central configurations of four equal positive masses under homogeneous interactions with force exponent $A>2$. For $2<A\le 3$, we prove that there are exactly four types of configurations up to similarity and relabeling: the square, the centered equilateral triangle, a unique nontrivial concave kite, and a unique collinear configuration. Combined with known results for $A>3$, this completes the classification for all $A>2$ and gives an affirmative answer to Problem 11 of Albouy, Cabral, and Santos. We also establish the nondegeneracy modulo rotation of these configurations and determine their Morse indices, confirming Hampton's Conjecture 2. Our proofs are based on analytic arguments and exact algebraic calculations.

comments
34 pages
fields
Dynamical Systems, Combinatorics
pdf ↗ page arXiv:2611.06465 ↗

Phase locking in oscillator networks depends critically on the interaction strengths between coupled units. In many applications, however, these couplings are uncertain, state dependent, or time varying. We derive rigorous conditions for phase locking in Kuramoto-type networks when each coupling strength is known only within prescribed bounds. Building on a convex formulation of the nonlinear fixed-point equations, we obtain edge-wise error bounds for arbitrary feasible approximations that hold uniformly over all admissible couplings. These bounds yield sufficient conditions for the existence of phase-locked states with prescribed phase-difference limits. We illustrate the framework for AC power grids with uncertain voltage magnitudes and adaptive oscillator networks with state-dependent couplings. For the latter, the bounds can be further tightened by exploiting the state dependence of the couplings.

fields
Dynamical Systems, Optimization and Control
pdf ↗ page arXiv:2611.06466 ↗

Largest-angle bisection (LAB) repeatedly divides a triangle by bisecting its largest angle. Although this procedure is known to preserve nondegenerate triangle shapes, less is known about the distribution of shapes across the resulting refinement tree. We show that its long-term behavior is governed by a distinction between pure and mixed branches. A branch that eventually selects only one of the two children may approach an exceptional family of shapes. By contrast, every branch that changes children infinitely often converges in shape to a right-isosceles triangle. This follows from a projective Lyapunov function that is non-increasing at every refinement and decreases strictly whenever the selected child changes. Consequently, a random branch converges to the right-isosceles shape with probability one, and the proportion of triangles near that shape tends to one across complete refinement levels. Largest-angle bisection therefore produces statistical regularization even though exceptional branches remain present.

comments
17 pages
fields
Dynamical Systems, Numerical Analysis
pdf ↗ page arXiv:2611.06492 ↗

We introduce natural expansiveness, a notion of expansiveness for non-invertible dynamical systems which is defined by using the natural extension. We show that every expansive homeomorphism or flow, every positive expansive endomorphism and every positive expansive semiflow without end points is naturally expansive. Moreover, we prove that the suspension of a naturally expansive endomorphism is naturally expansive. This gives examples of naturally expansive semiflows which are neither positive expansive nor restrictions of expansive flows. Then we extend natural expansiveness and the topological pressure to semiflows which are not necessarily continuous, by using a pseudosemimetric $d_ρ$. We introduce the notion of $d_ρ$-conjugacy, and we prove that every regular impulsive semiflow is $d_ρ$-conjugate to a continuous semiflow. As an application, we obtain the existence and uniqueness of equilibrium states for regular impulsive semiflows.

comments
23 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2611.06565 ↗

A stretched wire driven near its fundamental frequency can leave the plane of the driving force and whirl. At larger amplitudes the whirl becomes modulated, reverses its direction, and becomes chaotic. Three models of this motion are in common use: the geometrically exact string equations; a two-mode model -- the Kirchhoff-Carrier equation with one transverse mode in each plane; and the averaged equations for the slow amplitudes of those two modes. We integrate all three under similar conditions and compare them along the route to chaos, which starts with a Hopf bifurcation of the steady whirl and passes through period doublings to chaotic attractors organized by a Shil'nikov homoclinic orbit. The small parameter of the averaging, the ratio $\varepsilon = c/ω_1$ of the modulation rate to the fundamental frequency, runs from 0.005 to 0.02. Qualitatively the three models agree in the sequence of bifurcations, the coexisting attractors, the return maps and the Lyapunov exponents. Quantitatively, averaging places each local bifurcation $0.7\varepsilon$ to $1.2\varepsilon$ higher in the scaled detuning. The geometrically exact and two-mode models agree with each other to within 0.002 at the local bifurcations for $\varepsilon \le 0.01$. The Shil'nikov ratio, which decides whether chaos accompanies the homoclinic orbit, agrees among the three models to within 1.5% for $\varepsilon \le 0.01$, yet the homoclinic bifurcation itself moves by about $\varepsilon$ at the lower damping and by 6 to 9 times $\varepsilon$ at the higher; the difference is set by how quickly the return of the homoclinic loop changes with detuning.

comments
38 pages, 7 figures, 4 tables. Run data and MATLAB code: doi:10.5281/zenodo.23931253. Submitted to Journal of Sound and Vibration
fields
Dynamical Systems
pdf ↗ page arXiv:2611.06567 ↗

We study the dynamics of a delayed three-cell central pattern generator network using return-map analysis and a phase-reduced description derived from generalized FitzHugh-Nagumo oscillators. The phase model captures the emergence and stability of synchronous, pacemaker, and traveling-wave rhythms and provides a systematic, computationally efficient framework for characterizing the network dynamics beyond direct return-map calculations. We conduct extensive two-parameter analyses of both the full and phase-reduced models, revealing rich multi-rhythmic dynamics and transitions among coexisting rhythmic states. The close agreement between the two descriptions establishes phase reduction as an efficient and reliable framework for characterizing the dynamical organization of delayed neural oscillator networks.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.06836 ↗

We prove that the full Kolakoski shift—namely, the subshift of all smooth sequences over the alphabet $\{1,2\}$---is topologically transitive. Consequently, we demonstrate the existence of a smooth sequence whose factors are invariant under both reversal and bitwise complementation. As a further application, we prove the existence of arbitrarily long smooth words containing an equal number of occurrences of the symbols $1$ and $2$, providing evidence in support of Keane's conjecture. Our approach leverages the hierarchical structure of the full Kolakoski shift to reimagine the shift action in terms of a self-similar semigroup, which allows techniques from group theory and combinatorics to be applied.

comments
17 pages, 6 figures
fields
Dynamical Systems, Group Theory
pdf ↗ page arXiv:2611.06878 ↗

Let $F(x,y)=(f(x),g(x,y))$ be a continuous triangular map of the unit square and let $z=(x_0,y_0)$ be a point such that $ω_f(x_0)$ is a periodic orbit $\{p_0,\dots,p_{m-1}\}$ of $f$. Then $ω_F(z)=\bigcup_{i}\{p_i\}\times M_i$ for nonempty compact sets $M_i$, and we ask which $m$-tuples $(M_0,\dots,M_{m-1})$ occur. For $m=1$ the answer is a theorem of Kolyada and Snoha. We show that a tuple occurs if and only if there are continuous surjections $M_i\to M_{i+1}$, indices modulo $m$, whose composition around the cycle is chain transitive. This is a cyclic version of classical facts due to Dowker and Friedlander, Sharkovsky, Hirsch, Smith and Zhao, and Kolyada and Snoha. It yields two necessary conditions: no $M_i$ is one of the exceptional sets of Kolyada and Snoha, and there are continuous surjections $M_0\to M_1\to\dots\to M_{m-1}\to M_0$. We prove that these conditions are also sufficient when every $M_i$ has uncountably many connected components, and when every $M_i$ has countably many components of which only finitely many are nondegenerate. In particular the sections of one $ω$-limit set need not be homeomorphic. Every tuple satisfying the two conditions falls into one of these cases or into a single remaining class, in which the sections have countably many components and infinitely many of them are nondegenerate; that class is studied in a companion paper.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.06889 ↗

Differential Geometry11

We investigate Bernstein theorem for the affine maximal type equation \begin{equation*} \sum_{i,j=1}^nf^{ij}(D^a)_{ij}=0,\qquad D=\det(f_{ij}),\qquad a\neq0, \end{equation*} under completeness of the Calabi metric. In dimension two, we prove that every smooth strictly convex solution on a convex domain is a quadratic polynomial whenever $a\notin[-\tfrac23,-\tfrac13]$, resolving a conjecture of Sun and Xu [25]. For every $n\geq2$, we also construct explicit non-quadratic Calabi complete solutions on convex domains for all $a\in[-\tfrac n{n+1},-\tfrac1{n+1}]$. These examples show that the rigidity range is sharp in dimension two.

comments
18 pages, any comments are welcome
fields
Differential Geometry
pdf ↗ page arXiv:2611.05891 ↗

In this paper, we investigate the superposition of two minimal Darboux transformations in Euclidean three-space. A four-dimensional permutability diagram for transformations of isothermic surfaces yields the common minimal transform for distinct nonzero parameters and an explicit formula for its Gauss map. This formula determines the planar ends over regular umbilic-free points of the seed: an end is embedded when the two transformed Gauss maps coincide away from the seed value and has multiplicity 3 when all three values coincide. We illustrate this criterion with the Enneper surface and the catenoid. For the catenoid, suitable parameters give complete surfaces of finite total curvature, and we determine the numbers and multiplicities of their planar ends from the parameters and initial values. In the family with multiplicity-3 ends, the remaining initial-value parameter realizes, up to rotation, the López–Ros deformation.

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

In every dimension $n \ge 3$, we show there exist Lagrangian mean curvature flows that develop neck pinch singularities such that the mean curvature remains uniformly bounded. This follows from a related result that, under a structural assumption on the singularity formation, the mean curvature at small scales near the singularity can be bounded by the Lagrangian angle at outer scales with suitable weights. Applying this result to a subset of the finite-time Lagrangian mean curvature flow singularities constructed in the companion paper [arXiv:2607.03152] and the infinite-time Lagrangian mean curvature flow singularities constructed by Tsai, Wood, and the second-named author [arXiv:2401.02228] then gives examples of both finite-time and infinite-time singularity formation with uniformly bounded mean curvature.

comments
27 pages, comments welcome
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2611.06248 ↗

We study the equality case of the inequalities between the Lyapunov spectrum and the Harder–Narasimhan slopes of a semi-simple local system with non-expanding cusp monodromy over a finite-area hyperbolic surface. This gives a nonlattice-transversality alternative of the monodromy group. On the other hand, we generalize Filip's Assumptions A and B to give classes of polarized variation of Hodge structures that achieve the equality. As an application, we recover the thinness of C-32 in $\mathrm{Sp}_6\mathbb{R}$. Besides, we provide an upper bound, called average Cartan spectrum, that dominates the Lyapunov spectrum and study its rigidity.

comments
65 pages,including a declaration of AI use, comments are very welcome
fields
Differential Geometry, Algebraic Geometry, Dynamical Systems
pdf ↗ page arXiv:2611.06388 ↗

We give an alternative proof of Alexandrov's theorem about constant weighted mean curvature hypersurfaces in the anti-Gaussian space, due to the authors and Johne-Silini independently, via a Reilly-type formula approach. Moreover, we establish a sharp Heintze-Karcher-type inequality for hypersurfaces in manifolds with a generalized substatic condition, together with its rigidity in Euclidean space with density.

fields
Differential Geometry
pdf ↗ page arXiv:2611.06406 ↗

Let $(C_{f},0) \subset (\mathbb{C}^{n},0)$ be a germ of an irreducible holomorphic curve, given implicity by $f(x)=0$ if $n=2$ and by $f(x)=g(x)=0$ if $n=3$, and parametrised by $γ:(\mathbb{C},0) \rightarrow (\mathbb{C}^{n},0)$. We define the contact invariants $\operatorname{Iso}_{f}$ and $\operatorname{Iso}_γ$ for $f$ and $γ$, respectively, which count the number of isotropic points that appear after a generic deformation of the curve. We first consider the case where the curve is regular and establish a relation between those invariants and the number of vertices, inflection points and the zero-torsion points (for $n=3)$ that emerge from the deformation of the curve. Furthermore, we consider a germ of a singular curve with an isolated singularity and relate the number of isotropic points with the Milnor number of $f$

fields
Differential Geometry
pdf ↗ page arXiv:2611.06440 ↗

In this paper, we investigate Ricci solitons in the para-Kenmotsu setting with respect to a $\varphi$-related metallic semi-Riemannian metric arising from the underlying almost paracontact metric structure, under the assumption that the potential vector field is pointwise collinear with the Reeb vector field. We first establish the relation $\tS=S+2nβ\bigl(g-η\otimesη\bigr)$ between the Ricci tensors of the original metric $g$ and the $\varphi$-related metallic metric $\tg$. We then show that the Ricci soliton equation implies that the original metric $g$ is of $η$-Einstein type. By combining this condition with the contracted Bianchi identity, we obtain a rigidity result implying $f=0$, $λ=\frac{2n}{C}$, $S=-2ng$, and consequently $\tS=-\frac{2n}{C}\tg$. Thus, every Ricci soliton in this setting whose potential vector field is pointwise collinear with the Reeb vector field is necessarily trivial, and both $g$ and $\tg$ are Einstein. Finally, we provide two five-dimensional para-Kenmotsu examples: one realizing the resulting trivial Einstein Ricci soliton and another showing that failure of the required Einstein condition prevents the existence of such a soliton.

comments
12 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.06535 ↗

We develop a geometric method for studying $C^{2N}$-compactness of positive solutions to the constant $Q_{2N}$-curvature equation on closed Riemannian $n$-manifolds, for every integer $N\ge1$ and every dimension $n>2N$. Assuming the GJMS operator is invertible, its Green function is positive, and the positive mass condition holds, we establish sharp dimension ranges for the compactness of the set of all positive solutions with prescribed positive constant $Q_{2N}$-curvature. The largest dimension for compactness is $24$ for $N=1$ ([21]), $2N+20$ for $N=2,3$ ([11]), $2N+19$ for $N=4,5$, $2N+18$ for $N=6,7,8$, $2N+17$ for $9\le N\le17$, and $2N+16$ for all $N\ge18$. The constructions in [4,5,33,11] for $N=1,2,3$ and in the companion paper [12] for $N\ge4$ give noncompact examples in every dimension exceeding the corresponding compactness bound. We show that these $L^{\infty}$-unbounded examples can be chosen to satisfy the same operator and mass hypotheses, proving sharpness within this class. Our method relates the Pohozaev quadratic forms to the Hessian $D^2\mathscr{F}(g_c)$, where $\mathscr{F}$ is the volume-normalized total $Q_{2N}$-curvature functional and $g_c$ is the standard round metric on $\mathbb{S}^n$. The ambient metric argument of [12] supplies an explicit formula for $D^2\mathscr{F}(g_c)$ on transverse-traceless tensors. The York decomposition projects metric perturbations onto this space. The scalar–vector–tensor decomposition represents the Pohozaev quadratic forms by explicit finite-dimensional matrices. We prove that these matrices are positive definite throughout the stated dimension range, a crucial step in establishing compactness.

comments
64 pages
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2611.06551 ↗

We study the Gromov-Hausdorff stability of round spheres under perturbations of Perelman's nu-entropy. We show that in dimension two almost maximal entropy, together with an area normalisation, implies Gromov-Hausdorff closeness to the round two-sphere. In contrast, in dimensions at least three, we construct smooth metrics on the sphere whose entropies converge to that of the round sphere, but which remain a definite Gromov-Hausdorff distance away from it. These metrics can be chosen conformal and uniformly bi-Lipschitz equivalent to the round metric, with the same volume as the round sphere. Finally, in dimension three, we contrast this Gromov-Hausdorff instability with a dynamical stability result: metrics with nu-entropy above that of the round shrinking cylinder converge exponentially fast to round metrics under the volume-normalised Ricci flow.

fields
Differential Geometry
pdf ↗ page arXiv:2611.06678 ↗

We study when the number of spinors satisfying the same generalised Killing equation for a symmetric endomorphism field $W$ forces local realisation as a Euclidean hypersurface. Let $N=2^{\lfloor n/2\rfloor}$ be the rank of the complex spinor bundle. We show that in dimension $n\geq4$, if the complex dimension of the solution space exceeds $N/2$, then the metric and $W$ satisfy the Gauss–Codazzi equations. This is proved in the smooth category by combining the curvature defects into a single bivector and bounding the dimension of its kernel on spinors, using algebraic curvature symmetries to handle exceptional cases. Examples obtained from non-flat four-dimensional hyperkähler manifolds show that this threshold is sharp for every $n\geq4$. In dimension three, the Heisenberg group carries the maximal number of common solutions while failing the Euclidean Gauss equation. Further, in the real analytic category, we use existing extension theorems for Einstein metrics and parallel spinors to extend all common solutions to parallel spinors on a single local Ricci-flat ambient manifold. Using Wang's counts of parallel spinors, we obtain an independent proof of the sharp threshold for real analytic data.

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

We establish uniqueness of Ricci flows with non-negative sectional curvatures and scaling invariant curvature bounds, assuming that the induced distance functions converge to the same initial distance function up to isometry. In the compact case, restricting the size of the initial singular set, we also establish uniqueness under suitable weaker conditions.

comments
30 pages, comments welcome!
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2611.06814 ↗

Logic9

For nearly sixty years, refinements of the Bell-Kochen-Specker theorem have concentrated on finite configurations, combinatorics and robustness; once a configuration is fixed, contextuality is witnessed by the inconsistency of a finite family of Boolean constraints. We study the theorem instead with infinitary real-valued logic and a model existence game. We axiomatize, in real-valued $L_{ω_1ω}$, the lattice of closed subspaces of a separable infinite-dimensional complex Hilbert space together with a quantum probability measure. In the standard models the theory recovers Gleason's theorem. Once the axiom that the measure is $\{0,1\}$-valued is adjoined, the theory has no models, standard or nonstandard, although every finite set of its axioms has one; a model existence game converts this infinitary inconsistency into finite inconsistent sets of interval commitments on the values of sentences. Over the standard models, the subsets of $[0,1]$ that formulas define through the values of the measure are exactly the $σ$-projective sets, the members of the least class containing the Borel sets and closed under complements, countable unions and projections along $\mathbb{N}^\mathbb{N}$; the classification is proved in ZFC. For a specified strategy in the game, the plays that complete the parity argument for the eighteen-ray configuration of Cabello, Estebaranz and García-Alcaine record the geometric identities between the occurrences of a ray in different contexts, and the use that the measure makes of them. Probabilities are tracked up to rational tolerances, and $σ$-additivity along a named basis selects the four-dimensional block in which the argument takes place. The refinement is thus not a smaller Kochen-Specker set but a finer analysis of the logical form of the obstruction.

fields
Logic
pdf ↗ page arXiv:2611.05656 ↗

We present an algebraic study of extensions of the implication–negation fragment $\mathrm{IPC}_{\to,\neg}$ of intuitionistic propositional logic. Such extensions by inference rules correspond to subquasivarieties of the variety $\var{Ho}$ of Hilbert algebras with zero. We describe the lattice of such extensions of $\mathrm{IPC}_{\to,\neg}$ by means of its generators: it is isomorphic to the lattice of upsets of a countable poset, and in particular it is completely distributive. Consequently, $\var{Ho}$ is not Q-universal, in contrast to several other varieties related to $\mathrm{IPC}$. Nevertheless, this lattice is very complex: at each suitably defined height it has intervals containing continuum many quasivarieties which are not varieties. To the best of our knowledge $\mathrm{IPC}_{\to,\neg}$ is the only natural fragment of intuitionistic logic known to combine a completely distributive lattice of extensions with continuum many non-axiomatic extensions.

fields
Logic
pdf ↗ page arXiv:2611.05928 ↗

For a cone of reals $x$, the reals of $\mathrm{HOD}^{L[x]}$ are precisely the reals in $Q_3$, or equivalently, the set of reals in $M_1$, the minimal proper class mouse with a Woodin cardinal. We show that if $z$ is any real coding $M_1|δ^{+M_1}$, then $z$ is the base of such a cone (so $M_1^{\#}$ is such a base). We also establish a kind of optimality for this result, by identifying a real $x$ such that $M_1\subseteq L[x]$ but $\mathbb{R}\cap\mathrm{HOD}^{L[x]}\not\subseteq M_1$, although there is a base for the cone in a generic extension of $L[x]$. We prove analogous results for $M_{2n}(x)$ for all $n$, with the optimality result holding for all $n$.

fields
Logic
pdf ↗ page arXiv:2611.06032 ↗

The halting problem asks whether a program eventually halts, with unrestricted resources. Engineering systems instead certify bounded halting: given a program, an input, and a step budget T, decide whether the program halts within T steps. This paper studies two of its uses. First, it defines an exact finite-budget problem, placing the simulated program and the checker on the same unit-cost timescale, so the checker can be embedded in an adversarial program. A diagonal argument with explicit additive overhead shows that no fixed deterministic checker decides every instance within any fixed fraction of T below one, for large T. In the nondeterministic case, T bounds the branch depth allowed for a stable observable decision. Second, bounded-halting instances give adversarial tests for finitary universality, since a universal model must support arbitrary finite computations as T grows. The tests check resource growth with T, the absence of a fixed deliberation bound, and later access to intermediate data. They separate a fixed model with extendable external resources, a model family that grows with T, and a larger system built around a fixed component. For machine-learning systems, this identifies the resource growth a universality claim assumes and whether it fails for deployed models.

comments
9 pages, 1 table
journal
S. Salishev, CYBERNETICS AND PHYSICS, VOL. 15, NO. 2, 2026, 234-242
fields
Logic
pdf ↗ page arXiv:2611.06303 ↗

Under $\mathfrak p=\mathfrak c$, Cantor space contains a weak $λ$-set that is not a $λ$-set. This answers the consistency question of de Oliveira Rodrigues, dos Santos Ronchim, and Szeptycki. The hypothesis $\mathfrak p=\mathfrak c$ is compatible with the failure of the continuum hypothesis. The construction combines the finite-unions form of Hindman's theorem with Bell's characterization of $\mathfrak p$ in terms of $σ$-centered forcing. The increasing enumerations of the infinite members of the constructed space form an unbounded family under eventual domination. This makes the countable set of finite subsets of $ω$ a witness to the failure of the $λ$-property.

comments
7 pages
fields
Logic, General Topology
pdf ↗ page arXiv:2611.06312 ↗

We show that, over a valued field $K$ with $1$-h-minimal theory $\operatorname{Th}(K)$, two Cartesian products of balls must be equal up to translation and coordinate permutation in order for there to exist a definable surjective isometry between them. For this purpose, we introduce a notion of relative dimension for cuboids in $K^n$ that is computed combinatorially and relates to the notion of dimension for definable sets in Hensel minimal theories when $K$ has infinite residue field.

comments
6 pages. Planned for publication. To be used in an upcoming article by Cluckers, Halupczok and Vermeulen
fields
Logic
pdf ↗ page arXiv:2611.06413 ↗

We study the relation between the existence of escaping (or hyperimmune) functions and weak 1-genericity using computability over ideals. We prove in particular the existence of an $\mathcal{I}$-escaping function which does not $\mathcal{I}$-compute any weakly $\mathcal{I}$-generic set whenever $\mathcal{I}$ is a countable Turing ideal closed under the existence of diagonally non-computable functions.

comments
15 pages
fields
Logic
pdf ↗ page arXiv:2611.06439 ↗

We describe the group of strongly additive automorphisms of the differential field $\mathbb T$ of transseries as a non-trivial semidirect product. We show that this group is torsion-free and has trivial center, and that many naturally arising differential subfields of $\mathbb T$ are definably closed in $\mathbb T$.

comments
59 pp
fields
Logic, Rings and Algebras
pdf ↗ page arXiv:2611.06520 ↗

``Emergence'' refers to the fact that different mathematical languages and theories seem to be required to describe scientific theories that operate at different spatial and temporal scales. Highly circumscribed, special cases of emergence have been investigated using many different formal tools, including coarse-graining (over space and / or time), renormalization, dimension reduction, broken symmetry, and various formulations of causality. Here we extend the mathematics of model theory to unify and extend these earlier investigations. As a preliminary application of our framework, we investigate canonical examples of emergence, including the emergence of genetics from chemistry, of psychology from neurobiology, and of different forms of collective behavior from the laws governing their constituent parts. By exploiting the power of model theory we also uncover many aspects of emergence that were previously obscured. In particular, we uncover some of the rich hierarchical structure that relates different scientific fields. For example, we show that scientific fields can be related via a collection of multiple partial orders, all defined over the same set. On the other hand, under an alternative relation among scientific fields, one which allows cycles, we show that it is possible that the set of all of scientific fields must collapse into a single scientific field. Going forward, these investigations point to the formal tools that might need to be developed in order to arrive at a deeper understanding of this emergent hierarchy of scientific reality.

comments
52 pages, 44 pages main text, 3 figures
fields
Logic
pdf ↗ page arXiv:2611.06641 ↗

Metric Geometry8

In this paper, we first exhibit an example which answers negatively to a question posed by Herron et al. in 2008. That is, there is a rectifiably connected open set in a proper geodesic metric space so that it is Gromov hyperbolic with respect to the quasihyperbolic metric, and its Gromov boundary endowed with a visual metric is naturally bilipschitz equivalent to its metric boundary, but it is not uniform. Moreover, two positive answers are given under additional hypotheses. It is shown that a metric space is uniform if and only if it is Gromov hyperbolic and the natural map between its Gromov closure and its metric completion exists and satisfies a relatively quasisymmetric condition. Both bounded and unbounded cases are in our considerations via two different uniformization theorems developed recently by Bonk et al. and the first author, respectively. Finally, we characterize uniform metric spaces with uniformly perfect boundaries in terms of Gromov hyperbolicity and Teichmüller's displacement property.

comments
44 pages,3 figures
fields
Metric Geometry, Complex Variables
pdf ↗ page arXiv:2611.05416 ↗

A finite set of points in $\mathbb{R}^d$ is isosceles if every three of its points form an isosceles triangle. Erdős asked in 1946 for the largest size $\mathrm{iso}(d)$ of an isosceles set in $\mathbb{R}^d$. The answer was known for $d\le 8$, the last cases being due to Ionin. We prove that $\mathrm{iso}(d)=\binom{d+1}{2}+1$ for $9\le d\le 21$ and $\mathrm{iso}(22)=276$, and that the extremal set is unique: for $d\le21$ it is the set of midpoints of the edges of a regular simplex together with its centroid, and for $d=22$ it is the McLaughlin configuration together with its centre. For $10\le d\le22$ every isosceles set with more than $\binom d2+3$ points is a two-distance set or a spherical two-distance set together with its centre, and the number $\binom d2+3$ is attained. The proof combines Blokhuis' decomposition of isosceles sets into mutually orthogonal two-distance sets, for which we give a short self-contained proof (the key step is a special case of Gallai's theorem on edge colourings without rainbow triangles), with the recent determination of the maximum two-distance sets in $\mathbb{R}^d$ for $9\le d\le22$ and with the known maximum sizes of spherical two-distance sets. In dimension nine this gives only $\mathrm{iso}(9)\le47$, and the exact value $46$ requires an additional argument about eight-dimensional two-distance sets with at least $44$ points. We also show that $\mathrm{iso}(23)=\max\{g(23),278\}$, where $g(23)$ is the largest size of a two-distance set in $\mathbb{R}^{23}$, so that $278\le\mathrm{iso}(23)\le575$.

comments
15 pages, 1 table
fields
Metric Geometry, Combinatorics
pdf ↗ page arXiv:2611.05421 ↗

We study the relationship between the large-scale geometry of a geodesic metric space and the slimness of its geodesic polygons. We show that if there is a uniform constant $δ$ such that every geodesic polygon in an unbounded geodesic metric space is $δ$-slim, then the space has asymptotic Assouad–Nagata dimension one. We further consider graphs of bounded valency and allow the slimness constant of an $n$-gon to grow logarithmically with $n$. More precisely, under an explicit logarithmic bound on the slimness of geodesic $n$-gons, we prove that the graph has asymptotic Assouad–Nagata dimension one. Thus, sufficiently strong logarithmic control on the slimness of geodesic polygons forces one-dimensional large-scale geometry. We also obtain two criteria for graphs, outside the hyperbolic setting, to have asymptotic Assouad–Nagata dimension one. In particular, these criteria show that one-dimensional large-scale geometry can be detected from quantitative restrictions on the slimness of geodesic polygons, without requiring the space to be hyperbolic.

comments
12 pages
fields
Metric Geometry
pdf ↗ page arXiv:2611.05429 ↗

We prove a homotopical Euclidean isoperimetric inequality for Lipschitz maps from the unit n-sphere into metric spaces admitting a bounded bicombing, which includes CAT(0)-spaces and normed vector spaces. To do so, we first refine the second-named author's Euclidean isoperimetric inequality for singular Lipschitz chains to this setting. Then, we show that a singular Lipschitz chain filling induces a Lipschitz map filling of almost the same volume or less, by adapting a strategy seen in work of Gromov and others.

comments
10 pages
fields
Metric Geometry, Differential Geometry
pdf ↗ page arXiv:2611.05513 ↗

This paper introduces a class of non-homogeneous self-similar constructions, called $ω$-substitution graph system, in which the interface vertices are determined by an infinite sequence $ω.$ The associated graph sequences naturally form compact metric measure spaces, and under suitable assumptions on $ω$, we establish their convergence in the Gromov-Hausdorff-Prokhorov sense. We determine the Hausdorff and box-counting dimensions of the limiting space. We further prove that the discrete Hausdorff dimension of the graph sequence coincides with the Hausdorff dimension of its scaling limit. As a direct application of the scaling limit, asymptotic formulas are derived for a class of generalized Wiener indices, which include the classical Wiener index and Kirchhoff index as special cases. Finally, closed-form expressions for these indices are also obtained.

fields
Metric Geometry
pdf ↗ page arXiv:2611.05960 ↗

We construct explicit, nonlattice periodic point configurations in dimensions $10$, $11$ and $12$ with stealth center density $1/24$ and unit-density stealth radius $2\cdot24^{-1/n}$. These values exceed those of duals of the current record lattice packings, without claiming to exceed all possible lattices. The construction uses the $24$ sign rows of an order-$12$ Hadamard matrix and their antipodes, projected onto $n$ coordinates. For an arbitrary, not necessarily binary, equally weighted motif with marked period $2\mathbb{Z}^n$, we prove a sharp $2n$-point lower bound for a raw stealth radius at least one and classify equality by antipodal Hadamard configurations. We deduce bounded-complexity optimality, sharp optimality among binary motifs in dimensions $10$--$12$, and local maximality under simultaneous perturbations of the motif and the marked period shape. A divisibility argument excludes ordinary equally weighted periodic formal duals. Statements are confined to their indicated classes; no global optimality among arbitrary-period configurations is asserted.

fields
Metric Geometry, Probability
pdf ↗ page arXiv:2611.06148 ↗

We build on a recent proof of the universal optimality of the planar hexagonal lattice. We extend this result to demonstrate that, up to Euclidean motion, the hexagonal lattice is the only periodic configuration with this property.

comments
11 pages, 31 references
fields
Metric Geometry
pdf ↗ page arXiv:2611.06278 ↗

We consider real monic polynomials with simple complex critical points. Critical values of such polynomial $p$ can be considered as vertices of the uniquely defined polygon, symmetric with respect to the $x$-axis. The inverse image of this polygon is a tree-like system of ovals that touch each other externally in critical points. This system of ovals will be called the geometrical code of $p$. Let $a_1+i\cdot b_1,\ldots,a_n+i\cdot b_n$, $a_1<a_2<\ldots<a_n$ and $b_i>0$, $i=1,\ldots,n$, be the set of critical points of our polynomial $p$ in the upper halfplane, and $c_1+i\cdot d_1,\ldots,c_n+i\cdot d_n$ be their images. The order of numbers $c_k$ and the list of signs of numbers $d_k$ will be called the algebraic code of $p$. In our experimental work we study geometrical and algebraic codes of the 7-th degree polynomials and the relations between them.

comments
7 pages, 9 figures
fields
Metric Geometry
pdf ↗ page arXiv:2611.06695 ↗

Quantum Algebra8

This note harmonizes two classical topics: minimal modular extensions of braided fusion categories and the Galois action on modular fusion categories. Their common generalizations are Galois-modular extensions, which always exist when a braided fusion category $\mathcal{B}$ is pseudounitary. Each extension induces a Galois action on the simple objects of $\mathcal{B}$. Up to integral equivalence, the Galois-modular extensions of $\mathcal{B}$ form a torsor over an explicit group of homomorphisms from $\mathrm{Gal}(\overline{\mathbb{Q}}/\mathbb{Q})$ to the invertible objects of order dividing two in the symmetric center $\mathcal{E}$ of $\mathcal{B}$. If $\mathcal{E}$ is Tannakian and $\mathcal{B}$ has a minimal modular extension, all minimal modular extensions induce one canonical Galois action. We prove that many facts about the modular data of modular fusion categories extend to pseudounitary premodular fusion categories as well via the Galois action.

comments
18 pages, 3 figures, comments welcome
fields
Quantum Algebra
pdf ↗ page arXiv:2611.05677 ↗

We study the chiralization of Poisson–Lie theory through graded symplectic geometry. We compare Courant deformations and classical $r$- and $R$-matrix constructions, obtaining integrable hierarchies and free field realizations. We give a variational description of the obstruction to Lie conformal bialgebra compatibility and recover Liberati's obstruction in the Virasoro case. We also introduce a vertex bialgebra analogue of quantized universal enveloping algebras and construct explicit quantizations to all orders of Cartan type Lie conformal bialgebra structures on $\operatorname{Cur}(\mathfrak{sl}_2)$. These results contribute to the first author's broader programme of developing shifted symplectic chiralization as a geometric method for constructing chiral analogues of Poisson-Lie structures via $n$-shifted symplectic geometry, and exploring its connections with AKSZ theory and quantization.

comments
Comments are welcome!
fields
Quantum Algebra, Mathematical Physics, Symplectic Geometry
pdf ↗ page arXiv:2611.06031 ↗

We establish a relative $C_1$-cofiniteness criterion for $C_2$-cofiniteness of finite group orbifolds. For permutation actions on a simple, self contragredient, $C_2$-cofinite vertex operator algebra of CFT type, it suffices to check a single relation for a derivative of the conformal vector in the Virasoro vertex operator algebra. This reduces the problem to a calculation depending only on the central charge and tensor degree. An exact calculation then proves cofiniteness for a family of nonsolvable permutation orbifolds without restricting the central charge.

fields
Quantum Algebra
pdf ↗ page arXiv:2611.06201 ↗

Let $\mathcal A_q$ be the Kronecker quantum cluster algebra with principal coefficients. We construct an explicit algebra homomorphism from the whole quantum group ${U_{q^{1/2}}}( {\widehat {\mathfrak{sl}_2}} )$ to $\mathcal A_q$, whose images together with either of the two frozen variables generate $\mathcal A_q$. As an application, we obtain algebra homomorphisms from the split $\imath$quantum groups of affine $\widehat {\mathfrak{sl}}_2$ to $\mathcal A_q$. Moreover, we explicitly determine the images of the positive and negative real and imaginary root vectors of ${U_{q^{1/2}}}( {\widehat {\mathfrak{sl}_2}} )$ in terms of quantum cluster variables.

comments
25 pages
fields
Quantum Algebra, Representation Theory
pdf ↗ page arXiv:2611.06256 ↗

We prove that a braided fusion category with property F is weakly integral, provided it admits a pivotal structure whose left categorical dimensions are positive on the intersection of its Müger center and its adjoint subcategory. In particular, the converse implication in the property F conjecture holds for modular fusion categories and pseudounitary braided fusion categories. We also show that the positivity condition holds for every pivotal braided fusion category if and only if every braided fusion category over $\mathbb C$ admits a pivotal structure.

comments
21 pages, comments welcome!
fields
Quantum Algebra
pdf ↗ page arXiv:2611.06505 ↗

We construct simple coherent classes and compute their normalized difference operators for the two-node quiver Coulomb branch with gauge group $GL_1\times GL_2$ and $m-1$ framing columns at the second node. The first magnetic charge is fixed at zero. For every $m\geq1$, every support $(n,-1)$ with $n\geq1$, and every integral electric twist, we prove that termwise saturation of the matter Koszul complex gives the simple intermediate extension. A graded normalization formula expresses its localization on every stratum as a finite binomial shuffle sum. The resulting operators satisfy bar symmetry, positive bubbling order, paired root-residue cancellation, and integral Laurent polynomial action. For $m=4$, we construct the derived boundary correction on $(2,-2)$, retaining the nonsemisimple odd-electric boundary object, and compute all electric twists. Finally, matter Euler divisibility proves triangular uniqueness on arbitrary fixed rank-two magnetic supports inside the actual integral Coulomb image. A pole-free counterexample shows why residue conditions alone do not give this uniqueness. Existence on general deeper mixed-sign supports remains open.

comments
58 pages
fields
Quantum Algebra, Algebraic Geometry
pdf ↗ page arXiv:2611.06509 ↗

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

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.0)
fields
Quantum Algebra
pdf ↗ page arXiv:2611.06616 ↗

We give an explicit formula for elements $H_{2k}$ of conformal weight $2k$, $k\ge1$, in the universal Virasoro vertex operator algebra $V$ at every central charge, such that $H_{2k}(0)H_{2l}\in TV$ for all $k,l\ge1$. Modulo translation, the kernel of $H_4(0)$ is generated by $[H_{2k}]$ in each positive even weight and is zero in positive odd weights. The formula uses a realization on differential polynomials by possibly infinite-order differential operators in a completion of the Weyl algebra, together with the inverse of the identity plus a nilpotent operator on each weight space. A Koszul-type exactness argument for the classical KdV flows proves conservation; uniqueness and the Jacobi identity give commutativity. The classical limit recovers the normalized Gelfand–Dickey densities. Explicit low-weight elements and exact symbolic verifications illustrate the construction.

fields
Quantum Algebra
pdf ↗ page arXiv:2611.06767 ↗

Statistics Theory8

We study a Bayesian linear mixed model whose random effects follow a scale mixture of normal distributions with an arbitrary mixing distribution, a class that contains the Student-t, slash, contaminated normal, normal-generalized inverse Gaussian and Laplace laws. Conditionally conjugate priors lead to a three-block Gibbs sampler that alternates between the variance components, the latent precision weights, and the regression coefficients together with the random effects. Using a drift function built from fractional powers, we give sufficient conditions for geometric ergodicity of this chain, which involve a moment of the mixing distribution of some order larger than 1/2 and its behaviour near the origin. An equivariance of the sampler under rescaling of the design then shows that the conditions hold for all the families above, including Student-t random effects with any degrees of freedom, for every random-effects design matrix, full rank or not, with the rank entering only the conditions on the priors of the variance components. Together with posterior moment bounds, geometric ergodicity justifies Monte Carlo standard errors and effective-sample-size stopping rules for the regression coefficients and the log-variance components. Simulations examine these procedures at practical run lengths: joint confidence regions need a correction for the number of batches, and under sequential stopping their observed coverage remains slightly below the nominal level. We illustrate the methods with longitudinal beta-HCG measurements from early pregnancies, in which the latent weights reveal larger between-subject variability among abnormal pregnancies.

comments
35 pages, 4 figures, 8 tables. Code: https://github.com/rolandodelacruz74/smnlmm-gibbs
fields
Statistics Theory
pdf ↗ page arXiv:2611.05600 ↗

We study the query complexity of sampling from smooth distributions on $\mathbb R^d$ using first-order oracles. For $d$-dimensional strongly log-concave targets with condition number $κ=2$, we prove that any randomized sampler requires $\exp({Ω(\log^{1/3} d)})$ queries even from a constant warm start. This rules out polylogarithmic dimension dependence and strictly separates strongly log-concave sampling from Gaussian sampling. For targets with $L$-smooth potentials satisfying an $α$-log-Sobolev inequality with $κ= L/α$, we prove an $Ω(κ)$ query lower bound for $d\gtrsim\log^2κ$. This shows that log-Sobolev sampling is strictly harder than strongly log-concave sampling. Our proofs construct instance-dependent tests that target samples typically pass but outputs of algorithms making few queries typically fail. For strongly log-concave targets, we embed a sequence of hidden Gaussian into high-degree tensor polynomial with smooth gates, forcing any algorithm to uncover the layers sequentially. The log-Sobolev construction hides a constant fraction of the target mass in angular caps while controlling the log-Sobolev constant via delicate estimates.

fields
Statistics Theory
pdf ↗ page arXiv:2611.05813 ↗

Tikhonov regularization, kriging, and Gaussian-process regression share the same algorithm because, for a linear inverse problem with a Gaussian prior and Gaussian noise, the minimum-mean-square-error (MMSE) estimator is the solution of a regularized least-squares problem. We show that this equivalence survives the passage from vectors to generalized functions: the regularized least-squares estimators become generalized splines, and the Gaussian random vectors become generalized Gaussian processes (GGPs) on the dual of a nuclear space. A whitening operator $\mathrm{L}: \mathcal{S} \to L_2$ specifies both the native Hilbert space $\mathcal{H}_\mathrm{L} \subset \mathcal{S}'$ of the splines and a family of GGPs, which solve a stochastic differential equation subject to boundary conditions. We prove that the Gaussian spaces of these processes are congruent to the core $\mathrm{L}^\ast(L_2)$ of the native space, and that their MMSE estimators from finitely many linear measurements are generalized splines. Our framework extends the classical correspondences of Kimeldorf-Wahba, Parzen and Kailath in two respects: our estimators form a broader class that includes generalized functions, and we give a proper Bayesian treatment of the case where the null space of $\mathrm{L}$ is non-trivial. The framework gives a precise meaning to statements such as ``fractional splines are the optimal estimators of fractional Brownian motion,'' and it provides a rigorous Bayesian formulation of infinite-dimensional linear inverse problems.

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

We propose a nonparametric test of return asymmetry based on the realized quadratic covariation between a cumulative return path and its square using high-frequency data. Our null hypothesis is that the volatility path is independent of the Brownian motion driving returns. Under this null and a martingale condition, the infill limit of the statistic is conditionally Gaussian given the volatility path, with a conditional variance determined by integrated variance. Studentization by a feasible variance estimator yields an asymptotically standard normal statistic without specifying a parametric model for volatility. Simulations under Heston and Bates dynamics show near-nominal per-window size, quantify power gains from independent-window aggregation, and assess sensitivity to jump removal and volatility-dependent drift. An application to 165 U.S. stocks over 1998–2025 finds that rejections concentrate in negative asymmetry, consistent with the leverage effect.

comments
We propose a new nonparametric test of return asymmetry based on the realized quadratic covariation between a cumulative return path and its square using high-frequency data
fields
Statistics Theory
pdf ↗ page arXiv:2611.06368 ↗

We give a polynomial-time $(\varepsilon, δ)$-edge-differentially private algorithm that releases a synthetic graph approximately preserving all cut values of a nonnegative weighted input graph $G$. Our algorithm outputs a nonnegative weighted graph $H$ such that, with probability at least $1-β$, simultaneously for all $S\subseteq V$, \[ \left|w_G(S,V\setminus S)-w_H(S,V\setminus S)\right| \leq γw_G(S,V\setminus S) + O\left(\frac{n}{γ\varepsilon} \log^7 \frac{n}{δβγ\varepsilon}\right). \] For fixed $γ, \varepsilon$ and $δ= β= n^{-10}$, the additive error is $n \operatorname{polylog} n$, improving upon the previous efficient bound of $n^{13/12 + o(1)}$. Furthermore, we establish an $Ω(n/γ\varepsilon)$ lower bound for the relevant parameter regime, showing that our result is tight up to polylogarithmic factors. Our algorithm uses a log-det-regularized SDP to generate fractional queries for multiplicative-weights updates and certify accuracy for all cuts. The privacy analysis charges privacy loss only fractionally per mechanism call, based on the amount of mass on edge coordinates retired from subsequent iterations. Our synthetic graph release yields improved error bounds for several downstream tasks in private graph analysis including correlation clustering, Max-Cut, Max-$k$-Cut, constrained cut problems and hierarchical clustering. Most notably, for unweighted complete-graph correlation clustering, we achieve the optimal $\widetilde O(n)$ additive error while reducing the best previously known approximation ratio for this additive error from several thousand to $1.387$. We also provide a formalization of our results in Lean.

fields
Statistics Theory
pdf ↗ page arXiv:2611.06670 ↗

The maximum mean discrepancy (MMD) test is a popular nonparametric test on general domains. Two lines of work have studied its optimality through structurally different approaches. The first, a convolution approach on $\mathbb{R}^d$, uses translation-invariant kernels with a shrinking bandwidth and is minimax optimal over Sobolev balls under $L^2$-separation; the second, a regularization approach on general measurable spaces, uses spectral regularization of the kernel covariance operator and is minimax optimal over Hellinger- and $χ^2$-separated alternatives. In this paper, we study the regularization approach over Sobolev balls under $L^2$-separation, which reveals the connection between the two approaches. We show that, with a translation-invariant kernel on $\mathbb{R}^d$, both are ways of meeting a single condition on the kernel's spectral density: the spectral regularized discrepancy captures the $L^2$-separation $Δ$ of a Sobolev alternative of smoothness $s$ as soon as the regularization parameter $λ$ is below the spectral density on frequencies up to $Δ^{-1/(2s)}$. A kernel with a shrinking bandwidth $h$ meets this condition with $λ\asymp h^d$, and under this coupling the constant regularizer, which gives the MMD test itself, attains the Sobolev minimax rate. This explains, from a spectral perspective, the need for a shrinking bandwidth in the convolution approach. With a non-constant spectral regularizer, our analysis requires the bandwidth to shrink only when the spectral density decays faster than any polynomial, as for the Gaussian kernel. Thus, for Matérn and Laplace kernels, a fixed bandwidth with $λ\to 0$ attains the Sobolev minimax rate. Finally, an adaptive test over a grid of bandwidths and regularization parameters is minimax optimal, up to a $\log\log$ factor, over both classes without prior knowledge of the smoothness.

comments
40 pages
fields
Statistics Theory
pdf ↗ page arXiv:2611.06778 ↗

We study the fundamental limits of jointly estimating the signal amplitude and the atmospheric phase distortion in complex-valued multi-look coherent imaging, where the measurements are corrupted by multiplicative speckle and additive Gaussian noise, all looks share a known Gaussian sensing matrix, and both parameters belong to structured classes. By analyzing a constrained maximum likelihood estimator, we establish an upper bound on the joint minimax risk that holds uniformly over the admissible parameter classes, while oracle reductions and Fano-type arguments yield worst-case lower bounds over the admissible parameter classes. These results quantify the effects of structural complexity, signal and measurement dimensions, the number of looks, and the noise level, and establish matching minimax rates in several settings, with a remaining gap for phase estimation at low noise when the measurement dimension exceeds the signal dimension. We also construct a two-stage estimator for signal recovery under arbitrary diagonal sign distortions in the real-valued analogue. Under additional conditions, it recovers the signs up to a global sign with high probability and yields a uniform signal risk bound without a distortion-complexity term. Numerical experiments illustrate the dependence of the joint, signal, and phase errors on the model parameters and provide further support for the theoretical analysis.

fields
Statistics Theory
pdf ↗ page arXiv:2611.06784 ↗

We study natural exponential families whose generalized variance, the determinant of the covariance matrix, is log-affine in the natural parameter. Without any assumption on the natural parameter domain, we show that every such family is regular and that it is Gaussian when its generalized variance is constant. Consequently, a sample of size $n>d$ in $\mathbb{R}^d$ comes from a non-degenerate normal law exactly when the conditional expectation of the sample generalized variance given the sample mean is a positive constant. Every non-Gaussian family puts mass on a facet of its convex support, and, as for a Poisson count, its height above that facet takes only integer multiples of a fixed step. More generally, its displacement away from any exposed face that carries mass has nonnegative integer coordinates in a suitable basis. A local inequality between third and fourth cumulants singles out the Poisson–Gaussian families and yields a complete classification of the infinitely divisible ones. Geometrically, a semi-flat Kähler tube, whose potential has constant Hessian determinant, is flat if some multiple of its metric is projectively induced near a point.

comments
41 pages, no figures
fields
Statistics Theory, Probability
pdf ↗ page arXiv:2611.06885 ↗

Representation Theory7

Let $\mathscr{F}_n$ be the subcategory of finite-dimensional representations of the quantum loop algebra of $\mathfrak{sl}_{n+1}$ whose simple modules are indexed by multisegments consisting of intervals $[a,b]$, where $a,b$ are integers and $0<b-a\le n$. We define the co-standard module associated to a multisegment $\mathbf{s}$ to be the tensor product of the Kirillov–Reshetikhin modules, associated to the first node of the Dynkin diagram of $\mathfrak{sl}_{n+1}$, given by the segments of $\mathbf{s}$. Under a suitable (and necessary) restriction on $n$, we show that its socle is isomorphic to the simple module given by the Zelevinsky dual $\mathbf{s}^\dagger$ of $\mathbf{s}$. We then define an involution $Φ$ of the Grothendieck ring $\mathcal{K}(\mathscr {F}_n)$ and prove that it maps the class of a simple module to the class of the simple module given by its Zelevinsky dual. We also show that on suitable subcategories $Φ$ is induced by an exact autoequivalence reversing tensor products, and we give a $t$-analogue of the multiplicity identity in the quantum Grothendieck ring. Motivated by the determinantal formula for alternating snake modules, we realize $\mathcal{K}(\mathscr {F}_n)$ explicitly inside a polynomial ring in variables indexed by intervals, and, in the spirit of Macdonald's ninth variation of Schur functions, we show that the fundamental modules correspond to analogues of the elementary symmetric functions and the Kirillov–Reshetikhin modules to analogues of the complete homogeneous symmetric functions. This is compatible with $Φ$ and the classical involution $ω$, and we prove that alternating snake modules give a family of Schur positive symmetric functions extending the skew Schur functions.

comments
35 pages; comments are welcome
fields
Representation Theory, Quantum Algebra
pdf ↗ page arXiv:2611.05588 ↗

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 ↗

Let \(\mathfrak{g}\) be any finite-dimensional complex simple Lie algebra, let $h^\vee$ be its dual Coxeter number, and let \(e\) be its highest-root vector which is a minimal nilpotent element. In this paper, using a result of Bavula on invariants of commuting locally nilpotent derivations, we show that \[ U(\mathfrak{g})_f \cong \mathcal{D}^+_{h^\vee-2}\otimes \mathcal{D}_1\otimes U(\mathfrak{g},e), \] where the first factor is a polynomial Weyl algebra of rank $h^\vee-2$, the second factor is a Laurent Weyl algebra of rank one, and $U(\mathfrak{g},e)$ is the finite $W$-algebra associated with $\mathfrak{g}$ and $e$. As an application, we prove that if $M$ is a simple infinite-dimensional $\mathfrak{g}$-module with the minimal GK dimension on which $f-1$ acts locally nilpotently, then $M\cong P\otimes V$ for some simple $\mathcal{D}^+_{h^\vee-2}\otimes \mathcal{D}_1$-module $P$ and some finite-dimensional simple $U(\mathfrak{g},e)$-module $V$. We also give a new proof of the Skryabine quivalence and Petukhov's birational decomposition of the quotient division ring of $U(\mathfrak{g})$.

fields
Representation Theory
pdf ↗ page arXiv:2611.05855 ↗

It is well known that gentle algebras are closed under derived equivalence. However, it is easy to verify that they are not closed under stable equivalence. We prove that the classes of quadratic monomial, almost gentle and string almost gentle algebras are closed under stable equivalence. In fact, in each of these cases, stable equivalence is characterized by isomorphism after deleting all nodes and removing semisimple direct summands. The underlying isomorphism theorem gives a positive answer to Martínez-Villa's question on selfinjective-free algebras for these classes. We also prove that the nonprojective simple modules form the unique weakly simple-minded system of a quadratic monomial algebra. Consequently, every stable equivalence of Morita type involving such an algebra lifts to a Morita equivalence when neither algebra has semisimple direct summands. Finally, we describe the effect of node deletion on stable categories of Gorenstein-projective modules and singularity categories, and give combinatorial descriptions of the equivalences for almost gentle algebras using marked configurations.

fields
Representation Theory
pdf ↗ page arXiv:2611.05889 ↗

Let $p\geq 5$, and let $F/\mathbb{Q}_p$ be a nontrivial finite totally ramified extension. We construct a non-admissible smooth irreducible representation of $\mathrm{GL}_2(F)$ over $\overline{\mathbb{F}}_p$. The construction uses representations of $\mathrm{GL}_2(\mathcal{O}_F)$ on which the first principal congruence subgroup acts nontrivially, together with a deformation of a diagram indexed by $\mathbb{Z}$.

fields
Representation Theory, Number Theory
pdf ↗ page arXiv:2611.06056 ↗

Let $A$ be a representation-infinite finite-dimensional algebra over an algebraically closed field $k$. We prove that for every infinite cardinal $κ$ there is an indecomposable $A$-module $M$ with $\dim_k M=κ$. Over algebraically closed fields, this settles Simson's conjecture, also called the third Brauer–Thrall conjecture, that every representation-infinite finite-dimensional algebra has indecomposable modules of arbitrarily large cardinality. To construct these modules, we extend Bongartz's representation embedding from finite-dimensional Kronecker modules without a simple injective summand to such modules of arbitrary dimension. The extended functor commutes with direct sums and filtered colimits and preserves the dimension of infinite-dimensional modules. Applying it to the indecomposable Kronecker modules of every infinite dimension constructed by Göbel and Simson yields the required $A$-modules.

code
github.com/haruhisa-enomoto/third-brauer-thrall-conjecture ∎ Lean project (docbuild/lakefile.toml, docbuild/lean-toolchain) builds, no sorry at 465fa8e, checked 2026-11-05 build details
comments
24 pages, comments welcome! full Lean formalization of main results are available at https://github.com/haruhisa-enomoto/third-brauer-thrall-conjecture
fields
Representation Theory, Rings and Algebras
pdf ↗ page arXiv:2611.06325 ↗

We describe Arthur packets for the split reductive group $\mathrm{G}_2$ over a $p$-adic field and compute their stable and endoscopic character distributions. The construction uses the twisted Aubert duality recently studied by Cheng–Kaletha. We identify the corresponding Xu packets on $\mathrm{PGSO}_8$ and their triality-twisted characters. We also extend the result to long-root and short-root Arthur packets corresponding to unitary generic representations of $\mathrm{PGL}_2$.

comments
35 pages, comments are welcome!
fields
Representation Theory, Number Theory
pdf ↗ page arXiv:2611.06742 ↗

Geometric Topology5

We show that every bounded discrete harmonic function with respect to the cotangent Laplacian on a Delaunay triangulation of the Euclidean plane is constant; equivalently, the cotangent-weighted triangulation has the Liouville property. Our main theorem establishes this property for a more general class of connected weighted geometric graphs in the plane. Furthermore, we show that a planar Delaunay triangulation with cotangent weights could be transient but is recurrent if edge lengths are uniformly bounded.

comments
17 pages, 4 figures
fields
Geometric Topology, Combinatorics, Probability
pdf ↗ page arXiv:2610.39242 ↗

We give three explicit finite-volume hyperbolic Coxeter lattices in dimension four whose adjoint trace fields are not totally real. They are the reflection groups of the Ma–Zheng polytopes $P_{11,6}$, $P_{11,7}$, $P_{11,8}$. The obstruction is contained in two cyclic products of the doubled unit-normal Gram matrix $A=2G$. Those products recover elements $s=\sqrt5$ and $u$ satisfying $$ (s-1)u^2+2(s-3)u+s-7=0. $$ After the embedding $s\mapsto-\sqrt5$, this quadratic has discriminant $8(1-\sqrt5)<0$. The cyclic-product field therefore has a complex place. Vinberg's identification of that field with the adjoint trace field and the Emery–Mila total-reality obstruction imply that the three lattices are not pseudo-arithmetic. Torsion-free orientation-preserving finite-index subgroups yield orientable noncompact finite-volume hyperbolic $4$-manifolds with the same obstruction. Exact computations check the census data and provide independent field and finite-volume certificates. A pinned Lean~4 development verifies the radical identity and the number-field obstruction. It also checks the lattice and manifold implications conditional on explicit geometric and literature hypotheses.

code
github.com/sashakolpakov/PseudoArithmetic ∎ Lean project (formal/lakefile.toml, formal/lean-toolchain) builds, no sorry at 9d5ce11, checked 2026-11-05 build details
comments
20 pages; GitHub repository at https://github.com/sashakolpakov/PseudoArithmetic
fields
Geometric Topology, Group Theory
pdf ↗ page arXiv:2611.05795 ↗

We construct a counterexample to the Putman–Wieland conjecture in genus $3$ and discuss some of its consequences.

comments
19 pages
fields
Geometric Topology, Algebraic Geometry
pdf ↗ page arXiv:2611.06357 ↗

Beginning with Kuperberg's work on unknot recognition, several fundamental decision problems in 3-manifold topology have been shown to be in coNP assuming the generalized Riemann hypothesis. In this note, we explain how recent developments around the quasi-Riemann hypothesis yield unconditional versions of these results, leading for example to the first unconditional proof that 3-sphere recognition is in coNP.

comments
11 pages
fields
Geometric Topology
pdf ↗ page arXiv:2611.06705 ↗

We give invariants of pairs $(M,Γ)$ consisting of a closed connected oriented three-manifold and an oriented framed ribbon graph embedded in $M$ colored by a the Drinfeld center of a unimodular chromatic category $\mathcal C$. This invariant generalizes the chromatic spherical and renormalized Reshetikhin-Turaev invariants of three-manifolds. We use Heegaard-Graph diagrams which represent the pair $(M,Γ)$ and use the data of a unimodular chromatic category and objects of the Drinfeld center to construct the invariant. We define a ribbon graph associated to embedded framed links to obtain an invariant of pairs $(M,L)$. We show that if $L$ is the empty link, then the invariant recovers the chromatic spherical invariant, and if $M$ is the three-sphere, then the invariant recovers the renormalized Reshetikhin-Turaev invariant from the Drinfeld center. The relationship is proven by recovering a chromatic structure for the center induced by that from $\mathcal C$. The main theorem of the paper demonstrates that if the graph is a link $L$ colored by a generator in the Drinfeld center, then we recover the chromatic spherical invariant of the surgery manifold $M(L)$, contributing to a proof of the relationship between the chromatic spherical and renormalized Reshetikhin-Turaev invariants for unimodular chromatic categories, generalizing a recent result for unimodular Hopf algebras by Reina. To this end, we give a Heegaard diagram for $M(L)$ coming from the Heegaard-Link diagram representing the pair $(M,L)$.

comments
34 pages, comments welcome!
fields
Geometric Topology, Quantum Algebra
pdf ↗ page arXiv:2611.06708 ↗

Group Theory5

We classify the conjugator length functions of Bestvina-Brady groups. We show that the conjugator length function, when non-trivial, grows as a linear or quadratic polynomial. In fact, we give explicit criteria on the defining graph to determine the precise degree of the polynomial. The proof generalises ideas of Bridson, Riley, and Sale by exploiting the framework developed by Chang and the authors to classify the Dehn functions of Bestvina-Brady groups.

comments
14 pages, 1 figure. Comments welcome! No AI tools were used for this project
fields
Group Theory
pdf ↗ page arXiv:2611.05619 ↗

We introduce the notion of systolic complexes with almost flat intervals. They constitute a subclass of fit systolic complexes and arise naturally in the study of graphical C(3)--T(6) small cancellation complexes. We prove that their Assouad–Nagata dimension is bounded above by a universal constant. As consequences, we obtain universal bounds on the Assouad–Nagata dimension of tame simply connected graphical C(3)--T(6) small cancellation complexes and of finitely generated groups defined by graphical C(3)--T(6) small cancellation presentations. In the appendix, we observe that the proof of finiteness of asymptotic dimension for buildings due to Dymara and Schick also yields finiteness of their asymptotic Assouad–Nagata dimension.

comments
21 pages, 5 figures, comments welcome!
fields
Group Theory, Metric Geometry
pdf ↗ page arXiv:2611.05763 ↗

Let $P$ be a $p$-group that acts faithfully and coprimely on a finite group $H$. A classical result of D.\ S.\ Passman, in the form proved by I.\ M.\ Isaacs, asserts that there exists an element $x\in H$ such that $|C_P(x)|\le (|P|/p)^{1/p}$. In this paper, we study the corresponding question for the action of $P$ on the conjugacy classes of $H$. We show that for every odd prime $p$ the analogue of Isaacs' bound fails for classes. On the other hand, we prove that if $H$ is solvable, then there always exists a conjugacy class $c$ of $H$ whose stabilizer in $P$ has order at most $|P|^{1/2}$, and that this bound is best possible for every prime $p$. As a consequence, there always exists an irreducible character of $H$ whose inertia group in $P$ has order at most $|P|^{1/2}$. The proof proceeds via a result on linear actions of $p$-nilpotent groups, and in the quasiprimitive case it relies on a classification of Holt and Yang and on computer calculations.

comments
24pp
fields
Group Theory
pdf ↗ page arXiv:2611.05904 ↗

In his famous ``testamentary letter'' Galois formulated several results without proof. Among them he claimed --- here we express it in modern terms --- that the projective special linear group $PSL(2,p)$ has a subgroup of index $p$ only for $p\le 11$. Nowadays this result is seen as a corollary of the complete enumeration of all subgroups of $PSL(2,p)$ obtained by Gierster in 1881. In this paper we attempt to give a proof that uses only methods available to Galois.

comments
7 pages, 3 figures
fields
Group Theory, History and Overview
pdf ↗ page arXiv:2611.06054 ↗

Let $p$ be an odd prime, let $G$ be a finite $p$-solvable group, and let $\varphi\in\IBr_p(G)$ have vertex $Q$. We prove that $\varphi$ has at most $|Q:Q'|$ lifts to ordinary irreducible characters, establishing Cossey's conjecture for odd primes.

fields
Group Theory
pdf ↗ page arXiv:2611.06903 ↗

Classical Analysis and ODEs4

In this paper, we prove boundedness on $L^p(\mathbb{R}^{n+1})$, $1<p<\infty$, of polynomial Carleson operators along the paraboloid with phase belonging to a class $Y$ of homogeneous polynomials. For $n,d\ge 2$, let $\mathcal{P}^{n,d}$ denote the class of all real-valued homogeneous polynomials in $n$ variables of degree $d$. We may take the class $Y$ to be an arbitrary linear subspace $Y \subseteq \mathcal{P}^{n,d}$ such that $\dim Y \le M_{n , d}$, where $M_{n , d}$ is a constant depending only on $n$ and $d$. The main novelty of our result is that we may allow a large collection of homogeneous polynomials of the same degree, in contrast to earlier results that relied on distinct degree assumptions. The heart of our proof is a $TT^*$ method, and the derivation of new estimates for oscillatory integral kernels involving interactions between homogeneous polynomial phases and the paraboloid.

fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.05931 ↗

The Siler model describes mortality from birth to old age as the sum of a declining immaturity hazard, a constant background hazard, and an increasing senescence hazard. No standard closed form is available for its remaining life expectancy, which must therefore be evaluated by numerical integration. We show that Siler remaining life expectancy at age $x$ is a Poisson mixture of Gompertz-Makeham remaining life expectancies, that is, a Poisson-weighted average of life expectancies in models with only a constant background hazard and an exponentially increasing senescence hazard. All components share the senescence hazard. Their background hazards increase from one component to the next by the rate at which immaturity mortality declines. The Poisson mean is the immaturity hazard that remains to be accumulated after age $x$. This representation yields an exact series of generalized exponential integrals with a closed-form bound on the truncation error. Replacing the background hazard by its discounted counterpart also gives the Laplace transform of the remaining lifetime. The mixture bounds the life expectancy lost to immaturity mortality: up to a term below the reciprocal of $a_2+b_1$, this loss equals the probability of an immaturity death times the life expectancy with the immaturity hazard removed. In annual Siler fits to Swedish female mortality, we estimate that the loss at birth fell from 4.3 years in 1900 to less than 0.01 years in 2020, which accounts for 15% of the gain in life expectancy at birth over the period.

comments
11 pages, 4 figures, 1 table. Code and data: https://github.com/scpatricio/siler-poisson-mixture
fields
Classical Analysis and ODEs, Probability
pdf ↗ page arXiv:2611.06376 ↗

Can the complete macroscopic spectrum of return times determine the Hausdorff dimension of the corresponding set of initial points? We classify all common lower and upper macroscopic intermediate-dimension spectra of zero-density integer sets and realize every admissible spectrum on a full-dimensional family of zero-frequency orbits under logarithmic-power bounds on inverse-branch contraction. For first-return branches with stretched-exponential contraction $e^{-n^δ}$, $0<δ<1$, complete spectrum levels exhibit a sharp zero/full dimension transition at the counting endpoint $δ$. At the critical exponent, exact laws $N_y(t)\sim c_0t^δ(\log t)^β$ yield zero dimension for $β\le0$ and full dimension for $β>0$, even with the complete spectrum fixed. An explicit two-branch intermittent interval map realizes this transition through genuine first returns. Above the critical exponent, imposing an exact counting law and a complete spectrum does not reduce the dimension of an intrinsic mean-energy level in an affine return tower. For nonlinear branches, we obtain quantitative bounds and an exact conditional-pressure formula under thermodynamic regularity assumptions, verified for an explicit non-affine family.

comments
2 figures
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.06416 ↗

We show that any discrete-time filtration can be embedded into a dyadic filtration, realized via a non-classical measure-preserving map. This embedding makes it possible to reduce certain problems involving vector-valued martingales to the case of Haar martingales. Some applications of this result will also be discussed.

comments
19 pages
journal
Mathematische Nachrichten, 2026
fields
Classical Analysis and ODEs, Probability
pdf ↗ page arXiv:2611.06426 ↗

Commutative Algebra4

Let $S$ be a minimally four-generated numerical semigroup that is nearly Gorenstein but not almost symmetric, and let $R=k[S]$ over an arbitrary field $k$. We prove that the defining ideal of $R$ has four or five minimal generators when $R$ has Cohen–Macaulay type two, and exactly six when it has type three. Thus the total Betti sequence over the four-variable polynomial presentation ring is one of $$(1,4,5,2),\quad (1,5,6,2),\quad (1,6,8,3),$$ and all three possibilities occur. The type-three argument uses a canonical-ideal exact sequence, a chain-level comparison on $\operatorname{Tor}$, and a codimension-three Gorenstein reduction. The resulting classification gives an affirmative answer, over every field, to Moscariello and Strazzanti's Question 4.3 on four-generated nearly Gorenstein numerical semigroups that are not almost symmetric.

comments
20 pages
fields
Commutative Algebra
pdf ↗ page arXiv:2611.05788 ↗

Let $f\in\Q[x_1,\ldots,x_n]$ have affinely independent exponent vectors. We prove that its test ideals agree with the reductions of its multiplier ideals at all nonnegative real exponents for every sufficiently large prime in one arithmetic progression. The progression depends only on the support of $f$.

comments
9 pages
fields
Commutative Algebra, Algebraic Geometry
pdf ↗ page arXiv:2611.05914 ↗

We prove the intersection product formulas of Gaffney and Gassler for polar multiplicities and Segre numbers over arbitrary Noetherian local rings. For equidimensional and universally catenary rings, we give a geometric refinement of the Principle of Specialization of Integral Dependence, in which the maximal dimension of the images of exceptional components mapping into the hypersurface determines a precise Segre number that strictly increases.

fields
Commutative Algebra, Algebraic Geometry
pdf ↗ page arXiv:2611.06370 ↗

We introduce nearly determinantal matrices and study their ideals of $2$-minors. We classify nearly determinantal matrices whose ideals of $2$-minors are prime. Furthermore, we characterize those nearly determinantal matrices whose ideals of $2$-minors are prime and Cohen–Macaulay with linear resolutions.

comments
Comments are welcome
fields
Commutative Algebra, Combinatorics
pdf ↗ page arXiv:2611.06571 ↗

Rings and Algebras4

We develop a unified homology theory for directed partial orders (DPOs) and lattice-ordered positive cones on fields of characteristic zero. With the underlying field and its operations fixed, we define order?carrying spaces independently by topological conditions, establish a bijection with DPO positive cones, and characterize lattice orders by intersections of minimal open neighborhoods. A unified comparison theorem identifies graded Ext for region ideals with sheaf cohomology and multiplicative Tor with the reduced singular homology of truncated regions, giving a topological interpretation of the existence and preservation of reduced decompositions. We obtain canonical cohomological obstructions to lattice ordering, prove that a coefficient module for positive multiplication is flat if and only if the multiplier has a positive inverse, and show that every strict extension of positive cones on the same field produces a nonzero first Tor obstruction. Finally, we place the concrete lattice recently constructed by Bao-Zhang within this framework.

comments
34 pages. Preliminary version
fields
Rings and Algebras, Commutative Algebra, Algebraic Topology
pdf ↗ page arXiv:2611.06261 ↗

Let $F$ be a field. We study weak polynomial identities for pairs $(A,V)$ where $A$ is the first Weyl algebra over $F$ and $V$ is either a Lie subalgebra (under the usual Lie bracket) of $A$, or simply a vector subspace of $A$. Sometimes the weak identities of $(A,V)$, when $V$ is a Lie algebra, are called identities of representations of Lie algebras. Our starting point is the description of finite dimensional Lie algebras $L$ that can be embedded into the first Weyl algebra; this description was given by Rausch de Traubenberg, Slupinski and Tanasă in 2006. First we assume that $F$ is algebraically closed field of characteristic 0, and describe a finite basis of the weak identities of the pair $(A,L)$ where $L=\mathfrak{sl}_2$. In order to obtain such a basis we invoke theorems by Razmyslov and by Trishin concerning the identities of infinite dimensional irreducible representations of $\mathfrak{sl}_2$. Afterwards we consider $L$ as a filiform Lie algebra together with its concrete realisation inside the first Weyl algebra. We produce a finite basis of weak identities of the pair $(A,L)$, assuming $F$ to be infinite. Finally we study the weakest form of identities for $(A,V)$ where $A$ is the $n$-th Weyl algebra and $V$ is just a vector space - its canonical generating vector subspace. We deduce a basis of the weak identities in this case as well, once again assuming $F$ to be an infinite field, with no restriction on its characteristic. The same result was recently obtained by Dotsenko and Lopatin in characteristic $0$ by different methods. Our methods are combinatorial, we also use the theory developed by Razmyslov, and the representations of the symmetric and the general linear groups and their duality. We employ the characteristic-free description of the invariants of the symplectic group given by De Concini and Procesi.

comments
17 pages
fields
Rings and Algebras, Representation Theory
pdf ↗ page arXiv:2611.06305 ↗

We determine the high-degree restricted first cohomology of the positive subalgebra of the rank-one contact algebra in characteristics five and seven, with parabolically induced coefficients. In degrees from twice the characteristic through four times the characteristic minus three, each characteristic has six nonzero homogeneous components, of total dimension thirteen. The constituents include Frobenius twists of the natural horizontal module, represented by Cartier cocycles. PBW duality converts the calculation into bounded-degree homology, where the coefficient action couples the natural and cubic relation coordinates. The resulting modules determine the high-degree part of the coefficient cohomology used in the Lyndon-Hochschild-Serre term $E_2^{0,1}$ for extensions of induced contact modules. In particular, extensions from the Steinberg induced modules vanish in these degrees.

comments
36 pages
fields
Rings and Algebras, Representation Theory
pdf ↗ page arXiv:2611.06396 ↗

Let $RG$ be the group ring of an arbitrary group $G$ over an associative and commutative ring $R$ with identity. In this paper, we provide necessary and sufficient conditions for $RG$ to be Jordan nilpotent of index $n \geq 2$. In particular, we establish a connection between the study of Jordan nilpotency in group rings and the study of Lie nilpotency in these algebras. We also classify the Jordan nilpotency of $RG$, over rings of arbitrary characteristic, up to the index $6$.

fields
Rings and Algebras
pdf ↗ page arXiv:2611.06587 ↗

Algebraic Topology3

In this article, we introduce Borel–Moore and uniformly finite versions of magnitude homology and path homology for locally finite graphs by allowing possibly infinite chains subject to local finiteness and boundedness conditions. In both settings, we construct magnitude–path spectral sequences extending the spectral sequence studied by the author. Their E^1-pages are given by the corresponding magnitude homologies, their E^2-pages contain the corresponding path homologies on the p-axis, and they converge to coarse homology and uniformly finite homology, respectively, in the sense of Nowak–Yu. Moreover, the E^{r+1}-page is invariant under r- homotopy, whereas the homology to which the spectral sequence converges is invariant under coarse equivalence. Thus the spectral sequences interpolate between small-scale and large-scale geometry. We also show that the Borel–Moore and uniformly finite magnitude homologies are products and restricted products, respectively, of ordinary magnitude homology groups with a fixed initial point. Hence the E^1-page is assembled from pointwise magnitude-homological data, providing a mechanism for combining local information into global large-scale invariants. As applications, we establish Mayer–Vietoris sequences for magnitude homology, path homology, the associated spectral-sequence pages, and coarse and uniformly finite homology. We also show that diagonality of ordinary magnitude homology implies degeneration at the E^2-page, yielding isomorphisms between path homology and the corresponding coarse homology. Finally, we discuss applications to Cayley graphs of graph products, including right-angled Artin groups and right-angled Coxeter groups.

comments
30 pages. Comments welcome
fields
Algebraic Topology
pdf ↗ page arXiv:2611.05972 ↗

For a quiver $Q$, we introduce and study $Q$-operads (or operads over $Q$), defined as a special sort of $\mathbf{fc}$-multicategories or virtual double categories, in which the directions of the arrows of $Q$ encode the permitted input orderings. In this higher operadic framework, we construct the bar–cobar adjunction and develop a theory of Koszul duality and homotopy algebras, together with compatibility results under changes of quiver. We treat dg categories and their left modules, right modules, and bimodules as algebras over quiver-operads. We prove that these operads are Koszul and that their resolutions govern the corresponding $A_\infty$ categories and modules. We also categorify Sagave's notion of derived $A_\infty$ algebras and introduce modules over derived $A_\infty$ algebras and categories. Finally, we explain that restriction along a folding of quivers constructs diagonal $A_\infty$ bimodules, while extension along an inclusion of quivers realizes two-sided bar models of derived tensor products.

comments
44 pages, 10 figures
fields
Algebraic Topology, Category Theory, Quantum Algebra
pdf ↗ page arXiv:2611.06165 ↗

Persistence diagrams do not naturally live in a Hilbert space. Carrière, Cuturi, and Oudot embedded them in kernel methods through the Sliced Wasserstein kernel, built from the Sliced Wasserstein distance $\mathrm{SW}_1$, which is conditionally negative definite (CND). We study the projected ($\mathrm{SW}_p$) and reflected ($\mathrm{RW}_p$) Sliced Wasserstein distances for every order $p\ge1$, and compare them with the $p$-Wasserstein distance $d_p$ and with a reflected variant $d_p^r$, in which projection onto the diagonal is replaced by reflection across it. We show that $2^{1/p}d_p\le d_p^r\le 2d_p$ with sharp constants, so that $d_1^r=2d_1$ and $d_p^r$ inherits the stability of $d_p$, although it is a metric only for $p=1$. The distances $\mathrm{SW}_1$ and $\mathrm{RW}_1$ are CND metrics, and $\mathrm{RW}_1$ gives rise to a new positive definite kernel, stable with respect to $d_1$. For $p>1$, neither $\mathrm{SW}_p$ nor $\mathrm{RW}_p$ satisfies the triangle inequality, and rigorous interval-arithmetic certificates prove that $\mathrm{SW}_2$ and $\mathrm{RW}_2$ are not CND; numerical experiments suggest that the CND property fails for every $p$ above some $p^*\in(1,1.2]$. On diagrams with at most $N$ points, $\mathrm{SW}_p$ and $\mathrm{RW}_p$ are metrically equivalent to $d_p$ and $d_p^r$, with sharp upper constants. On an orbit recognition benchmark, the kernels built from $\mathrm{SW}_1$ and $\mathrm{RW}_1$ reach about 85% accuracy, outperform the persistence scale space kernel, perform on par with the persistence weighted Gaussian kernel, and are about one percentage point below the kernel built from $\mathrm{SW}_2$, which is not positive definite.

comments
50 pages, 7 figures, 10 tables
fields
Algebraic Topology
pdf ↗ page arXiv:2611.06619 ↗

Complex Variables3

We study holomorphic flexibility properties of the strongly commuting variety of a complex semisimple algebraic group $G$. We prove that the smooth locus of the strongly commuting variety of $G$ is Oka-$1$. We also prove that the smooth locus of the commuting variety of a semisimple complex Lie algebra is Oka-$1$, and that it contains a Zariski dense open subset which is algebraically elliptic.

comments
30 pages
fields
Complex Variables, Algebraic Geometry, Representation Theory
pdf ↗ page arXiv:2611.05905 ↗

We consider the binomial differential equation $$ ff'-a(f'')^2=be^{2c},$$ where $a(z)$, $b(z)$, $c(z)$ are polynomials such that $b(z)\not\equiv 0$ and $c(z)$ is non-constant. In this paper, we determine all entire solutions of this equation.

comments
13 pages, no figures
fields
Complex Variables
pdf ↗ page arXiv:2611.06292 ↗

Using a property of the Hilbert transform, we prove a measure theoretic result concerning the extensions of atomic singular inner functions to the circle. Various alternative proofs are presented using the mean value theorem for harmonic functions and a well-known property of Blaschke products. Using the main result, we establish several facts concerning atomic singular inner functions and their logarithms.

comments
12 pages
fields
Complex Variables, Classical Analysis and ODEs
pdf ↗ page arXiv:2611.06877 ↗

General Topology3

Given a category $\mathsf{C}$ of lattices, we introduce the category $\mathsf{C^{Cap}}$, a pointfree version of the category $\Cap$ of convergence approach spaces, that contains $\Cap$ coreflectively, as well as the category $\mathsf{C^{Conv}}$, of pointfree convergence spaces introduced by Goubault-Larrecq and Mynard, both reflectively and coreflectively. We investigate pointfree counterparts of pseudo-approach, pre-approach, and approach spaces along two natural axes—depth and adherence-determinedness—which coincide in the spatial case but diverge in general lattices, and we determine when the point–powerset adjunction restricts to these subcategories. Unlike in $\mathsf{C^{Conv}}$, the category $\mathsf{Ap}$ of approach spaces finds a natural analog $\mathsf{C^{Ap}}$ in $\mathsf{C^{Cap}}$ and "index theory" translating traditional topological or metric results into generalizing inequalities can be conducted. We illustrate this with a result involving measure of continuity and measure of compactness.

comments
30 pages
fields
General Topology, Category Theory
pdf ↗ page arXiv:2611.05621 ↗

Wilker-type properties record how a compact set can be split along a binary open cover, and they are precisely the continuity conditions for the union operation on open lattices, governing the topology of power and function spaces. We give a unified treatment of the four properties $\W$, $\Ww$, $\Wi$ and $\Win$. We prove that $\Wi$ and $\Win$ are hereditary for arbitrary subspaces, whereas $\W$ and $\Ww$ are hereditary only for closed subspaces; all four are preserved by continuous retracts, and $\Ww$, $\Wi$, $\Win$ are finitely additive over topological sums. For KC-spaces $\Ww$ and $\Wi$ coincide, and spaces whose compact subspaces are Hausdorff belong to $\Win$. Using Kovár's compact KC-space $M_0$ and its variant $\QQ^{+}$, we obtain countably infinite compact KC-spaces in $\Wi\setminus\W$, showing $\Wi$ is strictly weaker than $\W$. Conversely, we construct compact $T_1$ spaces whose product fails $\Ww$, proving the classes $\Ww$ and $\Wi$ are not reflective. We further show Vietoris constructions need not preserve $\Wi$, and prove that $\Ok(M_0)\cong \Ck(M_0,\Sier)$ is not sober and fails property~$S$. Open problems are collected at the end.

comments
19pages,
fields
General Topology
pdf ↗ page arXiv:2611.06060 ↗

In this paper, we introduce the concepts of ~`\emph{rough weighted ideal-$τ$-convergence}' and ~`\emph{rough weighted ideal-$τ$-cluster point}' of a net in locally solid Riesz spaces. We also compare these concepts with key findings from the works of Lahiri $\&$ Das (2007/2008), Das (2012) and Aytar (2008), as follows: [(i):] The set of \emph{ideal-cluster points} of a sequence in a topological space is closed, [(ii):] The set of \emph{ideal-cluster points} of a net in a topological space is closed, [(iii):] The set of \emph{rough ideal-cluster points} of a sequence in a norm linear space is closed. We demonstrate that, generally, the set of ~`\emph{rough weighted ideal-$τ$-cluster points}' of a net in a locally solid Riesz space may not satisfy the aforementioned results, which implies that it may not be closed. This suggests that this set exhibits new characteristics, which we will discuss here. Ultimately, our characterization demonstrates that these new concepts can help identify an ideal that is maximal and effectively represent any closed $τ$-neighborhood of $θ$ within these spaces.

comments
16 pages, 0 figures
fields
General Topology
pdf ↗ page arXiv:2611.06217 ↗

Spectral Theory3

Let $G$ be a connected graph on at least two vertices, and let $δ(i)$ be the sum of the degrees of the neighbours of a vertex $i$. The \emph{neighbourhood second Zagreb matrix} $\NF(G)$ has $(i,j)$-entry $δ(i)δ(j)$ if $i\sim j$ and $0$ otherwise; its spectral radius is denoted by $\rNF(G)$. We prove that $\rNF(G)\geρ(G)^{5}$, where $ρ(G)$ is the adjacency spectral radius, with equality if and only if $G$ is regular or bipartite semiregular, and we use this to show that the same graphs are exactly the extremal graphs of a Berman–Zhang–type upper bound. We sharpen the estimates $\demin^{2}ρ(G)\le\rNF(G)\le\demax^{2}ρ(G)$ by means of the extreme edge weights of $\NF(G)$, give sharp upper bounds in terms of the maximum degree $\dmax$, the maximum neighbourhood degree sum $\demax$, the size $m$ and the clique number $ω(G)$, and determine the extremal graphs for bipartite graphs and trees. For every connected unicyclic graph $G$ of order $n\ge3$ we prove $32=\rNF(C_n)\le\rNF(G)\le\rNF(\Sp n)$, where $\Sp n$ is the triangle with $n-3$ pendant edges at one vertex, with equality only for $C_n$ and only for $\Sp n$, respectively. Finally, we give bounds in terms of the first Zagreb index and for the neighbourhood second Zagreb energy; for lower energy bounds, the extremal graphs are described completely.

comments
23 pages
fields
Spectral Theory, Combinatorics
pdf ↗ page arXiv:2611.06091 ↗

The spectral gap, the energy separating the ground state from the first excitation, governs many quantum phenomena, yet it is far harder to compute than the ground state. We propose a mathematically rigorous method for extracting the gap from imaginary-time evolution in infinite-dimensional Hamiltonians, where the first excitation typically marks the edge of a continuous spectrum. We show that a gap is not automatically detected: detection depends on how the initial state and observable couple the ground state to excitations at the bottom of the continuum. When this coupling follows a power law, the gap is recovered together with a logarithmic correction whose coefficient yields the exponent of the spectral density near the edge of the continuum, which reflects the physics of the excitations. We confirm both predictions numerically for an exactly solvable model. Our results offer a new numerical approach to many-body quantum physics, in which both the gap and the threshold exponent are obtained merely at the cost of a ground-state calculation.

fields
Spectral Theory
pdf ↗ page arXiv:2611.06454 ↗

We consider discrete Schrödinger operators with periodic (possibly complex valued) potentials $Q$ on periodic graphs. Using a system of spectral invariants obtained in \cite{S26}, we investigate the sets of isospectral potentials on periodic graphs. In particular, we show that the Floquet spectrum of the Schrödinger operators on the hexagonal lattice and on the Kagome lattice generically (with respect to perturbations of $Q$) determines the potential $Q$ uniquely up to the obvious symmetries (translations and rotations) in the periodic graph.

comments
28 pages, 2 figures
fields
Spectral Theory, Mathematical Physics
pdf ↗ page arXiv:2611.06820 ↗

Category Theory2

We lift Mundici's equivalence between MV-algebras and abelian $\ell$-groups with a strong unit to the topological setting. To this end, we prove that, for every topological MV-algebra, the associated Mundici group can be endowed with a topology that extends the topology of the MV-algebra and makes it into an abelian topological $\ell$-group. Among such topologies there is a finest one; we identify this topology as the topological-group reflection of the bounded-stage final topology, and construct an explicit zero-neighbourhood base in terms of the original MV-algebra topology. Using this topology, we establish a topological Mundici adjunction that restricts to an equivalence between topological MV-algebras and Mundici-fine abelian topological $\ell$-groups with a strong unit. Here, Mundici-fine means that the group topology is the finest $\ell$-group extension of its unit-interval topology. We also identify extremal $\ell$-group extensions under additional hypotheses, and establish a quasitopological correspondence clarifying the distinction between separate and joint continuity.

comments
61 pages
fields
Category Theory, General Topology, Rings and Algebras
pdf ↗ page arXiv:2611.05786 ↗

E-graphs are a powerful algorithmic technique for automated equational reasoning but have resisted a conceptual understanding independent of issues of presentation and implementation. We propose an operational semantics for e-graphs based on the fundamental category-theoretic concepts of diagrams, limits, and initial functors. We illustrate the formalism through numerous example calculations and establish its soundness and completeness. Technical prerequisites are kept to a minimum in the main text; less standard elements of the mathematical theory are developed in two appendices.

fields
Category Theory
pdf ↗ page arXiv:2611.05924 ↗

General Mathematics2

For a second-order recurrence with positive integral coefficients, the slow length of an integer is the largest index at which it can occur when the initial terms range over positive integers. Spiro conjectured that, among a finite set of relatively prime recurrence pairs, a pair is slowest infinitely often precisely when its growth constant is strictly less than the square of the smallest growth constant. We study the equality case. For $T_m=\{(m-1,m),(m^2-1,m^2)\}$, the larger-growth pair attains the maximal slow length, with ties allowed, on $Θ_m(\log x)$ integers up to $x$ whenever $m\ge3$, whereas for $m=2$ its complete set of slowest integers is $\{1,2,25\}$. We give certificates for the infinite examples and prove a bounded-seed theorem that limits the possible initial pairs at each critical index.

comments
18 pages. Comments welcome!
fields
General Mathematics
pdf ↗ page arXiv:2611.05424 ↗

In this paper, we present a comprehensive study of perfectly balanced musical sets, also known in the literature as vanishing sums of roots of unity, in the particular case of order $2pq$. Starting from the well-established result concerning the decomposition of such sets as an integer linear combination of regular polygons, we first provide an algebraic formalization that allows to explicitly construct all these sets. We then propose six different decompositions of each set into regular polygons. Moreover, by investigating their combinatorial enumeration, we derive a formula for the exact number of these sets for a given order $2pq$, and describe their distribution and cardinality for the particular case of order $6p$. One of the main results concerns the duality that can be established between these sets. In particular, we prove that every non-periodic minimal perfectly balanced set of order $2pq$ can be combined with another one to produce a self-complementary $2p$-periodic set, and the reciprocal also holds. Finally, we demonstrate that the modulus of the discrete Fourier transform coefficients of dual sets are related. All these results shed new light on the distribution of perfectly balanced sets of order $2pq$ and suggest new mathematical questions in a more general case.

fields
General Mathematics
pdf ↗ page arXiv:2611.05441 ↗

K-Theory and Homology2

We extend the method of Van Woerden \cite{woerden} to totally real and CM number fields to obtain an upper bound for the number of $\GLo-$equivalence classes of perfect forms. Moreover, by considering appropriate barycentric subdivisions of the Voronoi tessellation, we extend these estimates to the number of $\GLo$-orbits of $k$-dimensional faces of the Voronoi tessellation. As a consequence, we improve the asymptotic order of the bounds for the torsion part of $K_m(\rint)$ obtained by Soulé \cite{soule_hermitian_bounds} and Houriet \cite{Juliet_PHD}. We emphasise the improvement of the general bound for $F=\mathbb Q$, unchanged since Soulé's work, and the independence of the discriminant exponent from the field degree for totally real and CM fields.

fields
K-Theory and Homology, Geometric Topology
pdf ↗ page arXiv:2611.06300 ↗

$A_\infty$-algebra is a chain complex equipped with a coherent multiplicative structure, i.e. a multiplication which is commutative up to (higher) chain homotopy. Similarly $A_\infty$-module over such algebra is equipped with its coherent action. These notions are used to represent cohomological information contained in topological multiplicative structures. One of the key tools of the theory are minimal models, which are useful in cohomological computations. In this thesis author presents certain sufficient conditions for a morphism of $A_\infty$-modules to induce a morphism of their minimal models.

comments
12 pages
fields
K-Theory and Homology
pdf ↗ page arXiv:2611.06851 ↗

Operator Algebras1

In this paper, we show that the usual Hausdorff–Young inequalities for locally compact quantum groups such as the quantum \(E_q(2)\), the real quantum \(az+b\), and the extended quantum \(SU_q(1,1)\), where \(0<q<1\), are sharp. Moreover, there are no group-like projections with finite Haar weight in these locally compact quantum groups. We obtain a sharp Hausdorff–Young inequality for Kahng's skew-matrix quantum groups; the optimal constant is strictly less than one for \(1<p<2\); at \(p=2\), Plancherel gives equality, and these quantum groups have no nonzero group-like projections with finite Haar weight.

fields
Operator Algebras, Functional Analysis
pdf ↗ page arXiv:2611.05863 ↗

Symplectic Geometry1

We obtain new constraints on the topology of Lagrangian submanifolds in the standard symplectic vector space $\mathbb{C}^n$ using Floer theory on the based loop space, generalizing a theorem of Fukaya-Irie. In particular, we show that non-trivial connected sums of closed, spin, aspherical manifolds of even dimensions do not admit Lagrangian embeddings into $\mathbb{C}^n$. A feature of the proof is that the obstructedness of the Floer theory is used to constrain the fundamental group of the Lagrangian.

comments
21 pages
fields
Symplectic Geometry, Algebraic Topology, Geometric Topology
pdf ↗ page arXiv:2611.06574 ↗

Revised papers230

We prove that the image of period map is algebraic, as conjectured by Griffiths.

comments
This version is withdrawn due to a fundamental gap in the proof that cannot be repaired within the original approach. A new approach is developed in arXiv:2611.04471
fields
Algebraic Geometry
pdf ↗ page arXiv:1608.06029 ↗

In this paper we give new bounds on the bisection width of random 3-regular graphs on $n$ vertices. The main contribution is a new lower bound of $0.103295n$ based on a first moment method together with a structural analysis of the graph, thereby improving a 27-year-old result of Kostochka and Melnikov. We also give a complementary upper bound of $0.139822n$ by combining a result of Lyons with original combinatorial insights. Developping this approach further, we obtain a non-rigorous improved upper bound with the help of Monte Carlo simulations.

comments
Minor numeric changes with respect to the previous version
fields
Probability, Combinatorics
pdf ↗ page arXiv:2009.00598 ↗

Our goal is to construct mathematical operations that combine indeterminism measured from quantum randomness with computational determinism so that non-mechanistic behavior is preserved in the computation. Formally, some results about operations applied to computably enumerable (c.e.) and bi-immune sets are proven here, where the objective is for the operations to preserve bi-immunity. While developing rearrangement operations on the natural numbers, we discovered that the bi-immune rearrangements generate an uncountable subgroup of the infinite symmetric group (Sym$(\mathbb{N})$) on the natural numbers $\mathbb{N}$. This new uncountable subgroup is called the bi-immune symmetric group. We show that the bi-immune symmetric group contains the finitary symmetric group on the natural numbers, and consequently is highly transitive. Furthermore, the bi-immune symmetric group is dense in Sym$(\mathbb{N})$ with respect to the pointwise convergence topology. The complete structure of the bi-immune symmetric group and its subgroups generated by one or more bi-immune rearrangements is unknown.

comments
17 pages
fields
Logic, Group Theory
pdf ↗ page arXiv:2009.03996 ↗

We study the Loewner evolution whose driving function is $W_t = B_t^1 + i B_t^2$, where $(B^1,B^2)$ is a pair of Brownian motions with a given covariance matrix. This model can be thought of as a generalization of Schramm-Loewner evolution (SLE) with complex parameter values. We show that our Loewner evolutions behave very differently from ordinary SLE. For example, if neither $B^1$ nor $B^2$ is identically equal to zero, then the set of points disconnected from $\infty$ by the Loewner hull has non-empty interior at each time. We also show that our model exhibits three phases analogous to the phases of SLE: a phase where the hulls have zero Lebesgue measure, a phase where points are swallowed but not hit by the hulls, and a phase where the hulls are space-filling. The phase boundaries are expressed in terms of the signs of explicit integrals. These boundaries have a simple closed form when the correlation of the two Brownian motions is zero.

code
github.com/ewaingwynne/complex-sle ∎ Lean project (lakefile.toml, lean-toolchain) builds, no sorry at ef459fe, checked 2026-11-05 build details
comments
49 pages, 12 figures; published in AOP; Lean verification available at https://github.com/ewaingwynne/complex-sle
fields
Probability, Complex Variables
pdf ↗ page arXiv:2203.07313 ↗

We introduce metric mean dimension to characterize the complexity of continuous flows with infinite topological entropy and derive some of their elementary properties. The main results of this paper are as follows: $(1)$ We prove that different types of measure-theoretic $ε$-entropies of ergodic measures have the same divergent rate, and establish analogous variational principles for metric mean dimension in terms of the measure-theoretic $ε$-entropies of continuous flows. $(2)$ We introduce the measure-theoretic metric mean dimension of invariant measures and link it to metric mean dimension via a classical-type variational principle. $(3)$ Using the Carathéodory-Pesin structure, we introduce Bowen metric mean dimension on subsets and establish the variational principle for Bowen metric mean dimension of any non-empty compact subset. Furthermore, we show that the Bowen metric mean dimension of the set of generic points of an ergodic measure is bounded by the divergent rate of the upper and lower Brin-Katok $ε$-entropies.

comments
With many changes, 36 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2203.13058 ↗

The purpose of this paper is to present a general method for forcing on $ω_2$ and $ω_3$ with finite conditions, while preserving all cardinals and some fragments of $\mathrm{GCH}$. This method is based on the technique of forcing with finite symmetric systems of elementary submodels, and improves earlier versions of this forcing by including models of two types. We will present several applications of the pure side condition forcing and variants thereof, by adding a Kurepa tree on $ω_2$, a club subset of $ω_2$ that avoids infinite sets from the ground model, a function bounding every canonical function below $ω_3$ on a club, and a simplified $(ω_2,1)$-morass.

comments
68 pages
fields
Logic
pdf ↗ page arXiv:2210.12741 ↗

We investigate the superconformal index of a three-dimensional $SU(2)$ ${\mathcal N}=2$ supersymmetric QCD with $N_f=4$ flavors. This theory confines with the breaking of a global symmetry. We obtain the index of this theory by integrating out a flavor from the theory with $N_f=6$ flavors. The superconformal index of the theory vanishes for generic values of the flavor fugacities. However, the specific choice of fugacities allows us to describe the flavor symmetry-breaking phenomenon.

comments
12 pages, v2: 14 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2303.00482 ↗

Starting with a trivial periodic flow on $\mathbb{S}M$, the unit tangent bundle of a genus two surface, we perform a Dehn-type surgery on the manifold around a tubular neighborhood of a curve on $\mathbb{S}M$ that projects to a self-intersecting closed geodesic on $M$, to get a surgered flow which restricted to the surgery region is ergodic with respect to the volume measure. The surgered flow projects to a map on the surgery track that can be taken to be a linked twist map with oppositely oriented shears which generates the ergodic behavior for sufficiently strong shears in the surgery.

comments
corrected an error in appendix; minor edits in section 2
fields
Dynamical Systems, Symplectic Geometry
pdf ↗ page arXiv:2307.08126 ↗

We investigate the convergence of time-averages of continuous functions along partial orbits for continuous dynamical systems on compact metric spaces. Unlike the classical focus of ergodic theory on convergence almost everywhere, our study emphasizes convergence at every point, motivated by problems in number theory. To this end, we consider a sequence having a uniform behavior property in the natural numbers. We also define and study two structural properties of dynamical systems along such partial orbits: minimal mean Lyapunov stability and minimal mean attractability. Our main result shows that if a continuous dynamical system is both minimally mean Lyapunov stable and minimally mean attractable along a given uniformly behaved sequence, and is minimally uniquely ergodic, then the time-average of any continuous function along the corresponding partial orbit converges to the space average at every point.

comments
31
fields
Number Theory, Dynamical Systems
pdf ↗ page arXiv:2311.16928 ↗

We prove time-pointwise quantitative unique continuation estimates for the evolution operators associated to (fractional powers of) the Baouendi–Grushin operators on the cylinder $\mathbb{R}^d \times \mathbb{T}^d$. Spectral inequalities are deduced, relating for functions from spectral subspaces associated to finite energy intervals their $L^2$-norm on the whole cylinder $\mathbb R^d\times\mathbb T^d$ to the $L^2$-norm on so-called thick subsets of $\mathbb R^d\times\mathbb T^d$. As a byproduct, we also obtain results on exact and approximate null-controllabilty for the corresponding evolution systems. This extends and complements results obtained recently by the authors and by Jaming and Wang.

comments
32 pages
journal
Pure Appl. Analysis 7 (2025) 733-770
fields
Analysis of PDEs, Optimization and Control, Spectral Theory
pdf ↗ page arXiv:2401.17782 ↗

The compact Riemannian manifolds $\mathcal{M}$ and $\mathcal{N}$ for which the trace operator from the first-order Sobolev space of mappings $\smash{\dot{W}}^{1, p} (\mathcal{M}, \mathcal{N})$ to the fractional Sobolev-Slobodeckiĭ space $\smash{\smash{\dot{W}}^{1 - 1/p, p}} (\partial \mathcal{M}, \mathcal{N})$ is surjective when $1 < p < \dim \mathcal{M}$ are characterised. The traces are extended using a new construction which can be carried out assuming the absence of the known topological and analytical obstructions. When $p \ge \dim \mathcal{M}$ the same construction provides a Sobolev extension with linear estimates for maps that have a continuous extension, provided that the known analytical obstructions to such a control are not present.

comments
68 pages, revised version
fields
Analysis of PDEs, Functional Analysis
pdf ↗ page arXiv:2403.18738 ↗

We establish global existence, smoothness, and physical energy bounds for solutions to the incompressible Navier-Stokes equations on $\mathbb{R}^d$ ($d \ge 3$) under a scaling-critical smallness condition in the homogeneous Fourier-Besov spaces $\mathscr{X}_p(\mathbb{R}^d)$, defined as the weak space $F \dot{B}^{\frac{d}{p'}-1}_{p,\infty}(\mathbb{R}^d)$ for $1 < p \le \infty$ and $F \dot{B}^{-1}_{1,1}(\mathbb{R}^d)$ at the endpoint $p = 1$. By combining the nonassociative algebra of Riesz convolutions and spaces of functions dominated by Fourier-Caloric flows $\mathscr{V}(λ)$ with a Littlewood-Paley dyadic atomic decomposition, we prove that the Catalan Picard series converges globally whenever $\|\widehat{u^0}\|_{\mathscr{X}_p(\mathbb{R}^d)} < Cν$. This threshold reaches the sharp boundary of well-posedness prior to norm inflation, strictly improves upon the classical Fujita-Kato $\dot{H}^{\frac{d}{2}-1}(\mathbb{R}^d)$ condition, and admits explicit multiscale Schwartz initial data with arbitrarily large $\dot{H}^{\frac{d}{2}-1}(\mathbb{R}^d)$ and $H^k(\mathbb{R}^d)$ norms. Furthermore, we demonstrate that for positive times, the velocity and pressure fields admit an analytic extension to the complex domain $\mathbb{C}^d$, forming a smooth curve of entire vector fields of order two. Finally, for arbitrary initial data outside the critical ball, we employ fractional Riesz convolutions $*_α$ ($0 < α< 1$) to derive an explicit lower bound $T_{\max}(u^0) > 0$ on the lifespan of smooth, order-two entire solutions, establishing a sharp dichotomy between global continuation via viscous re-entry into the critical ball and a scaling-invariant lower blow-up rate.

fields
Analysis of PDEs, Complex Variables, Functional Analysis
pdf ↗ page arXiv:2405.07929 ↗

$k$-Contact geometry is a generalisation of contact geometry to analyse field theories. As a main goal, we develop an approach to $k$-contact geometry based on distributions that are distributionally maximally non-integrable and admit, locally, $k$ commuting supplementary Lie symmetries: the $k$-contact distributions. More specifically, we investigate the existence of Reeb vector fields for $k$-contact distributions, $k$-contact Lie groups are defined and studied, and, after analysing compact manifolds, a Weinstein conjecture for a product of $k$ compact contact manifolds is discussed. Polarisations for $k$-contact distributions are introduced and it is shown that a polarised $k$-contact distribution is locally diffeomorphic to the Cartan distribution of the first-order jet bundle over a fibre bundle of rank $k$. We relate $k$-contact manifolds to presymplectic and $k$-symplectic manifolds on fibre bundles of larger dimension and define types of submanifolds in $k$-contact geometry. We study Hamilton–De Donder–Weyl equations on $k$-contact Lie groups. A theory of $k$-contact Hamiltonian vector fields is developed, and we describe characteristics of Lie symmetries for first-order partial differential equations in a $k$-contact Hamiltonian manner. We use our techniques to analyse Hamilton–Jacobi and Dirac equations, types of Engel and Goursat distributions, physical problems, and control systems. The work also presents introductory results so as to make it more self-contained.

comments
68 pp. A correction on the classical statement and proof of the $k$-contact Darboux theorem accomplished. New results on generalised Weinstein conjectures and Darboux theorems for $k$-contact manifolds in a distributional approach. Misprints and minor technical issues fixed. Version under evaluation in Journal of Physics A
fields
Differential Geometry, Mathematical Physics, Analysis of PDEs
pdf ↗ page arXiv:2409.11001 ↗

In the absence of a de Rham decomposition theorem for geometries with torsion, we develop and unify ways to view a geometry with parallel skew torsion as the total space of a locally defined, not necessarily unique Riemannian submersion with totally geodesic fibers. We complete and extend the Cleyton-Swann classification of irreducible such geometries and characterize the cases where the stabilizer of the torsion is larger than the holonomy. As a byproduct, we obtain structure results on Gray manifolds, nearly parallel G$_2$-manifolds and Sasaki manifolds with reducible holonomy.

comments
42 pages. v2: 40 pages, revised version
fields
Differential Geometry
pdf ↗ page arXiv:2409.14421 ↗

Capacity sharing networks are typical heterogeneous communication networks widely applied in information and communications technology (ICT) field. In such networks, resources like bandwidth, spectrum, computation and storage are shared among various communication services. Meanwhile, the issue of network congestion is always a prominent challenge. To handle network congestion essentially needs to solve the load balancing of networks. In this paper, for capacity sharing networks, we formulate their load balancing problem as a maximum multi-commodity flow problem. For such a problem, always a large-scale linear programming, the column generation algorithm is a commonly used and crucial method to solve it. In each iteration, this algorithm involves solving a linear programming subproblem and determining whether to terminate or generate a new column for inclusion in the subproblem. This iterative procedure of solving and checking continues throughout the algorithm. Nevertheless, since the checking subproblem is NP-hard, its solution significantly impacts the overall efficiency of the algorithm. In this paper, we innovatively convert the checking subproblem into a single-constrained shortest path (SCSP) subproblem. By exactly solving the SCSP subproblem, we can obtain the optimal solution to the checking subproblem with same or less computing time. Experimental results demonstrate that our algorithm achieves computational efficiency comparable to heuristic algorithms while outperforming other state-of-the-art algorithms by at least an order of magnitude.

comments
We request withdrawal due to errors in this preprint. Algorithm 1, lines 22 and 25, omit transmission-cost coefficients, undermining the stopping test and finite-termination guarantee as written. Section V-B2 incorrectly claims optimality for ViLBaS, contradicting Table IV. These algorithmic and interpretive claims require correction
fields
Optimization and Control
pdf ↗ page arXiv:2411.00555 ↗

The Bethe-Hessian matrix, introduced by Saade, Krzakala, and Zdeborová (2014), is a Hermitian matrix designed for applying spectral clustering algorithms to sparse networks. Rather than employing a non-symmetric and high-dimensional non-backtracking operator, a spectral method based on the Bethe-Hessian matrix is conjectured to also reach the Kesten-Stigum detection threshold in the sparse stochastic block model (SBM). We provide the first rigorous analysis of the Bethe-Hessian spectral method in the SBM under both the bounded expected degree and the growing degree regimes. Specifically, we demonstrate that: (i) When the expected degree $d\geq 2$, the number of negative outliers of the Bethe-Hessian matrix can consistently estimate the number of blocks above the Kesten-Stigum threshold, thus confirming a conjecture from Saade, Krzakala, and Zdeborová (2014) for $d\geq 2$. (ii) For sufficiently large $d$, its eigenvectors can be used to achieve weak recovery. (iii) As $d\to\infty$, we establish the concentration of the locations of its negative outlier eigenvalues, and weak consistency can be achieved via a spectral method based on the Bethe-Hessian matrix.

comments
39 pages, 1 figure. Added further details on the semisimplicity of the outlier eigenvalues of the non-backtracking operator. The main results remain unchanged
fields
Statistics Theory, Combinatorics, Probability
pdf ↗ page arXiv:2411.02835 ↗

There is a rich literature on clustering functional data with applications to time-series modeling, trajectory data, and even spatiotemporal applications. Existing methods are classified into two categories of global clustering that assigns an identical membership over the whole domain, and local clustering that allows multiple memberships based on the sub-domains. Classical literature has typically focused on global clustering that may struggle with degenerate clustering or produce numerous spurious clusters for high-dimensional functions. In contrast, a limited number of local clustering approaches have been proposed that are not scalable to high-dimensional functions and have limited theoretical guarantees. Focusing on basis expansions for high-dimensional functions, we propose a novel global-local framework that partitions coefficients into exclusive subsets and imposes independent Dirichlet process priors on each subset. The proposed framework reduces the total number of possible clustering configurations compared to local clustering and therefore provides greater scalability, while simultaneously providing enhanced flexibility compared to global clustering by relaxing the assumption of identical clustering for all elements in the high-dimensional function. Moreover, the proposed method incorporates spatially correlated errors to provide better model fitting and shows posterior consistency properties that asymptotically recover the true density of random functions. An efficient Markov chain Monte Carlo algorithm is developed for implementation. Extensive simulations involving images illustrate the improved scalability, clustering, and function estimation under the proposed method compared to classical approaches. We apply the proposed approach to a spatial transcriptomics application where the goal is to infer clusters of genes with distinct spatial patterns of expressions.

fields
Statistics Theory
pdf ↗ page arXiv:2412.09792 ↗

In a wide range of applications, we are required to rapidly solve a sequence of convex multiparametric quadratic programs (mp-QPs) on resource-limited hardwares. This is a nontrivial task and has been an active topic for decades in control and optimization communities. Observe that the main computational cost of existing solution algorithms lies in addressing many linear inequality constraints, though their majority are redundant and removing them will not change the optimal solution. This work learns from the results of previously solved mp-QP(s), based on which we propose novel methods to reliably trim (unsolved) mp-QPs via constraint removal, and the trimmed mp-QPs can be much cheaper to solve. Then, we extend to trim mp-QPs of model predictive control (MPC) whose parameter vectors are sampled from linear systems. Importantly, both online and offline solved mp-QPs can be utilized to adaptively trim mp-QPs in the closed-loop system. We show that the number of linear inequalities in the trimmed mp-QP of MPC decreases to zero in a finite timestep, which also can be reduced by increasing offline computation. Finally, simulations are performed to demonstrate the efficiency of our trimming method in removing redundant constraints.

comments
Accepted by IEEE Transactions on Automatic Control
fields
Optimization and Control
pdf ↗ page arXiv:2412.11098 ↗

We consider fully non-linear stochastic optimal control problems with measurable coefficients and (local) uniformly elliptic diffusion. Using the theory of $L^p$-viscosity solutions, we show existence of an $L^p$-viscosity solution $v\in W_{\rm loc}^{2,p}$ of the Hamilton-Jacobi-Bellman (HJB) equation, which, in turn, is also a strong solution (i.e. it satisfies the HJB equation pointwise a.e.). We are then led to prove verification theorems, providing necessary and sufficient conditions for optimality. These results allow us to construct optimal feedback controls and to characterize the value function as the unique $L^p$-viscosity solution of the HJB equation. To the best of our knowledge, these are the first results for fully non-linear stochastic optimal control problems with measurable coefficients. We use the theory developed to solve a stochastic optimal control problem arising in economics within the context of optimal advertising.

comments
Accepted for publication on SIAM Journal on Control and Optimization
fields
Optimization and Control, Probability
pdf ↗ page arXiv:2502.02352 ↗

Markovian open quantum systems are described by the Lindblad master equation $\partial_tρ=\mathcal{L}(ρ)$, where $ρ$ denotes the system's density operator and $\mathcal{L}$ the Liouville super-operator, which is also known as the Liouvillian. For systems with a finite-dimensional Hilbert space, it is a fundamental property of the Liouvillian that the real parts of all its eigenvalues are non-positive. Analogously, for infinite-dimensional Hilbert spaces, the Liouvillian as a map on trace-class operators only has spectral values with non-positive real parts. The usual arguments for these properties are indirect, using that $\mathcal{L}$ generates a quantum channel and that quantum channels are contractive. We provide a direct algebraic proof based on the Lindblad form of Liouvillians. Subtleties for infinite-dimensional systems are highlighted. For example, unbounded operators can then be eigenvectors of the adjoint Liouvillian with positive eigenvalues, corresponding to a physical instability of the system. As an illustrative application of the algebraic approach, we prove that a strict minimum can be imposed on the dissipative gap of any unital Markovian spin-$s$ or fermionic many-particle system by adding simple local dissipators. The added dissipators comprise Pauli or generalized Pauli Lindblad operators for spin systems and Majorana Lindblad operators for fermionic systems.

comments
19 pages, 2 figures; added argument for infinite-dimensional Hilbert spaces; added an application of the algebraic approach, showing how to impose a strict minimum for the dissipative gap of any Markovian spin-s or fermionic system with normal Lindblad operators by adding certain single-site dissipators; further minor improvements; published version
journal
J. Phys. A: Math. Theor. 59, 415202 (2026)
fields
Mathematical Physics
pdf ↗ page arXiv:2504.02256 ↗

We study from a mathematical point of view the nanoparticle model of a magnetic colloid, presented by G. Klughertz. Our objective is to obtain properties of stable stationary structures that arise in the long-time limit for the magnetic nanoparticles dynamics following this model. In this article, we present a detailed study of two specific structures using techniques from the calculus of variations. The first, called the spear, consists of a chain of aligned particles interacting via a Lennard-Jones potential. We establish existence and uniqueness results, derive bounds on the distances between neighboring particles, and provide a sharp asymptotic description as the number of particles tends to infinity. The second structure, the ring, features particles uniformly distributed along a circle. We prove its existence and uniqueness and derive an explicit formula for its radius.

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

We characterize the sample-path structure of the two-dimensional stochastic heat equation at criticality. The main theorems provide a complete, pathwise description of its semimartingale characteristics and establish explicit, exact formulas for the covariation measure. The proof derives an asymptotic expansion for the covariation measures of regularized approximate solutions by integrating techniques from quantum-solvable operators into stochastic integration theory.

fields
Probability
pdf ↗ page arXiv:2504.21791 ↗

We introduce new asymptotic formulas for the exponential moments of rescaled additive functionals of two-dimensional Brownian motion, extending the analysis to parameter regimes that go beyond the subcritical case underlying distributional limits. As an application, we develop a probabilistic-analytic approximation for the two-dimensional Laplacian with a singular perturbation at the origin. This method describes the perturbed Laplacian by combining analytic characteristics of the Kallianpur-Robbins and Kasahara-Kotani laws.

fields
Probability
pdf ↗ page arXiv:2504.21796 ↗

We study the asymptotics of the set $S(d)$ of possible prime orders of $K$-rational points on elliptic curves over number fields $K$ of degree $d$ as $d$ tends to infinity. Assuming some conjectures on the sparsity of newforms of weight $2$ and prime level with unexpectedly high analytic rank, we show that $\max S(d) \le 3d + 1$ for sufficiently large even $d$ and $\max S(d) = o(d)$ for odd $d$. This gives a significant (but conjectural) improvement on the currently best known upper bound $\max S(d) \le (3^{d/2} + 1)^2$ due to Oesterlé.

comments
32 pages. v2: dealt with reviewer suggestions and comments, extended range of strange primes table to 2*10^5
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2505.14109 ↗

Representation results for absolutely continuous curves $μ:[0,T]\to \mathcal{P}_p(\mathbb{R}^d)$, $p>1$, with values in the Wasserstein space $(\mathcal{P}_p(\mathbb{R}^d),W_p)$ of Borel probability measures in $\mathbb{R}^d$ with finite $p$-moment, provide a crucial tool to study evolutionary PDEs in a measure-theoretic setting. They are strictly related to the superposition principle for measure-valued solutions to the continuity equation. This paper addresses the extension of these results to the case $p=1$, and to curves $μ:[0,+\infty)\to\mathcal{P}_1(\mathbb{R}^d)$ that are only of bounded variation in time: in the corresponding continuity equation, the flux measure $ν\in\mathcal{M}_{loc}([0,+\infty)\times\mathbb{R}^{d};\mathbb{R}^{d})$ thus possesses a non-trivial singular part w.r.t. $μ$ in addition to the absolutely continuous part featuring the velocity field. Firstly, we carefully address the relation between curves in ${\rm BV}_{loc}([0,+\infty);\mathcal{P}_1(\mathbb{R}^d))$ and solutions to the associated continuity equation, among which we select those with minimal singular (contribution to the) flux $ν$. We show that, with those distinguished solutions it is possible to associate an `auxiliary' continuity equation, in an augmented phase space, solely driven by its velocity field. For that continuity equation, a standard version of the superposition principle can be thus obtained. In this way, we derive a first probabilistic representation of the pair $(μ,ν)$ solutions by projection over the time and space marginals. This representation involves Lipschitz trajectories in the augmented phase space, reparametrized in time and solving the characteristic system of ODEs. Finally, for the same pair $(μ,ν)$ we also prove a superposition principle in terms of BV curves on the actual time interval, providing a fine description of their behaviour at jump points.

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

Quantum relays are central to both quantum communication and distributed quantum computing, enabling long-distance transmission and modular architectures. Unlike classical repeaters, quantum repeaters preserve coherence without amplifying quantum information, relying on entanglement swapping and quantum error correction to overcome loss and decoherence. In this work, we investigate the transmission of quantum information via quantum relay channels. Our three-terminal relay model captures the trade-off between repeater-assisted and repeaterless communication strategies. Specifically, we propose a partial decode-forward strategy, in which quantum ``message system" consists of two components. The first component is decoded by the relay and then sent to the destination receiver, whereas the second component is decoded by the destination receiver without the relay's help. We analyze both entanglement-assisted and unassisted scenarios. As a special case, the full decode-forward strategy is recovered, with the relay decoding, re-encoding, and forwarding the entire message. Our framework allows for different entanglement topologies between the transmitter, the relay and the destination receiver, recovering known results on entanglement-assisted and unassisted communication. Furthermore, we discuss the interpretation of coding with quantum side information. These findings provide a foundation for designing secure, efficient, and reliable quantum networks and for realizing practical quantum repeaters and long-range quantum key distribution.

comments
8 + 5 pages, 4 figures, comments are welcome
fields
Information Theory
pdf ↗ page arXiv:2507.06770 ↗

The aim of the paper is to define noncommutative cluster structure on several algebras ${\mathcal A}$ related to marked surfaces possibly with orbifold points of various orders, which includes noncommutative clusters, i.e., embeddings of a given group $G$ into the multiplicative monoid ${\mathcal A}^\times$ and an action of a certain braid-like group $Br_{\mathcal A}$ by automorphisms of each cluster group in a compatible way. For punctured surfaces we construct new symmetries, noncommutative tagged clusters and establish a noncommutative Laurent Phenomenon.

comments
111 pages, 47 figures, AMSLaTeX, some results, e.g., Theorem 1.4 is updated, misprints corrected, referenses added
fields
Representation Theory, Algebraic Geometry, Combinatorics, Quantum Algebra
pdf ↗ page arXiv:2507.20393 ↗

We study the biregular and birational geometry of degree 6 del Pezzo surfaces with Picard number 1, defined over an arbitrary perfect field. Using Galois cohomology techniques, we obtain an explicit description of cocycles for such surfaces and describe the Severi-Brauer varieties associated with them, recovering the biregular classification of sextic del Pezzo surfaces. We then compute the automorphism groups of such surfaces, describe their closed points in general position and investigate the structure of Sarkisov links at such points and the corresponding birational models, answering a question of M. Rost. Using this description, we show that degree 6 del Pezzo surfaces are the only solid surfaces that admit infinite pliability. We also find a system of generators and relations for the groups of birational transformations of such surfaces and use it to construct nontrivial quotients of these groups, including free groups on uncountable sets.

comments
Generalized Theorem B; Corrected some minor mathematical errors; Corrected some typos; Corrected the title
fields
Algebraic Geometry
pdf ↗ page arXiv:2507.21737 ↗

We give a min-max characterization of all of the weighted Dirac eigenvalues, and show that the weighted eigenvalues and eigenspaces of Dirac operators are continuous with respect to weak $L^p$ convergence of the weight, for any $p>n$. Moreover, we establish a comparison result for such weighted eigenvalue problems including the case of nontrivial harmonic spinors.

comments
37 pages
fields
Spectral Theory
pdf ↗ page arXiv:2508.07591 ↗

Considering the so-called Simpson system on smooth projective varieties, defined over an algebraically closed field of characteristic $0$, whose canonical bundle is ample, we provide a new proof of the stability of this Higgs bundle, which in turn yields another proof of the Miyaoka-Yau inequality. When equality holds, we prove that the discriminant class of the Simpson system is numerically trivial and that this Higgs bundle is curve semistable. This result follows from a study of the relations between weak ampleness, numerically effectiveness for Higgs bundles that ``feel'' the Higgs field and (semi)stability. Moreover, we obtain another proof of the algebraic hyperbolicity of these varieties which provides a lower bound on a positive real constant related to this property; to best of our knowledge, this is the first and only result of this type. We conjecture that a similar lower bound holds for smooth projective varieties whose canonical bundle is ample.

comments
To appear on Mediterranean Journal of Mathematics
fields
Algebraic Geometry
pdf ↗ page arXiv:2508.12062 ↗

We study a lattice fermion model with antiferromagnetic interactions on the three-dimensional cubic lattice. The hopping term of the Hamiltonian has a Weyl-type dispersion. We prove that the model has reflection positivity. Moreover, by relying on the property, we prove the existence of the antiferromagnetic long-range order at low temperatures in a strong coupling regime.

comments
29 pages, final version to appear in Journal of Statistical Physics
fields
Mathematical Physics
pdf ↗ page arXiv:2508.12421 ↗

Unlike conventional imaging modalities, such as magnetic resonance imaging, which are often well described by a linear regression framework, coherent imaging systems follow a significantly more complex model. In these systems, the task is to estimate the unknown image ${\boldsymbol x}_o \in \mathbb{R}^n$ from observations ${\boldsymbol y}_1, \ldots, {\boldsymbol y}_L \in \mathbb{R}^m$ of the form $ {\boldsymbol y}_l = A_l X_o {\boldsymbol w}_l + {\boldsymbol z}_l, l = 1, \ldots, L,$ where $X_o = \mathrm{diag}({\boldsymbol x}_o)$ is an $n \times n$ diagonal matrix, ${\boldsymbol w}_1,\ldots, {\boldsymbol w}_L \stackrel{\text{i.i.d.}}{\sim} \mathcal{N}(0,I_n)$ represent speckle noise, and ${\boldsymbol z}_1, \ldots, {\boldsymbol z}_L \stackrel{\text{i.i.d.}}{\sim} \mathcal{N}(0,σ_z^2 I_m)$ denote additive noise. The matrices $A_1, \ldots, A_L \in \mathbb{R}^{m \times n}$ are known forward operators determined by the imaging system. Here, $m$ can be less than $n$, which makes the linear model ill conditioned, and we collect $L$ measurements of the whole setup and try to quantify the loss. The fundamental limits of conventional imaging systems have been extensively studied through sparse linear regression models. However, the limits of coherent imaging systems remain largely unexplored. The goal of this paper is to close this gap by showing, for the first time in the literature, that the minimax risk of estimating ${\boldsymbol x}_o$ scales as $\frac{\max\{σ_z^4,\, m^2,\, n^2\}\, k \log n}{m^2 n L},$ where the parameter $k$ quantifies the effective complexity of the image class.

comments
63 pages. Revised to correct typos. The original arXiv version (Nov 18, 2025) contained all current theoretical results. No AI was used to develop or prove these results; AI assisted only with text editing. During revision, AI was additionally used as a mock reviewer to help verify proof correctness. It identified a few minor issues, which the authors subsequently corrected
fields
Statistics Theory, Information Theory
pdf ↗ page arXiv:2508.18503 ↗

Polymatroids provide a suitable combinatorial framework for enumerating components of discriminants of polynomial systems, a generalization of classical discriminants introduced by Gelfand, Kapranov, and Zelevinsky for multivariate polynomials. We explore the relations among polymatroids, their induced matroids, and principal partitions, following works of Fujishige and Narayanan. We obtain a sufficient condition for a polymatroid contraction to commute with taking the induced matroid. We establish a correspondence between different classes of polymatroids and critical values of their principal partitions. Three new conjectures about discriminants of polynomial systems are formulated.

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

We define a class of smashing localisations which we call compactly central and classify compactly central localisations of the category of spectra and of the category of $p$-local spectra. In both cases the compactly central localisations are those finite localisations which correspond to closed subsets of the Balmer spectrum with quasicompact complement. In particular, the finite chromatic localisation $L_n^f$ is compactly central. We generalise our results to the category $D(X)$ for $X$ a quasicompact quasiseparated scheme with an ample family of line bundles. Analogously to spectra, we show that compactly central localisations of $D(X)$ correspond to closed subsets of $X$ with quasicompact complement. This includes any scheme which is quasiprojective over an affine base.

comments
Version 2 significantly rewritten and expanded. Results in sections 2-3 renumbered; section 4 added. Sections 1-3 correspond to the published article, with the same numbering. 60 pages
journal
Topology and its Applications 395 (2027) 110014
fields
Algebraic Topology
pdf ↗ page arXiv:2509.07344 ↗

We consider positive one-dimensional solutions of a Lane-Emden relative Dirichlet problem in a cylinder and study their stability/instability properties as the energy varies with respect to domain perturbations. This depends on the exponent $p >1$ of the nonlinearity and we obtain results for $p$ close to 1 and for $p$ large. This is achieved by a careful asymptotic analysis of the one-dimensional solution as $p \to 1$ or $p \to \infty$, which is of independent interest. It allows to detect the limit profile and other qualitative properties of these solutions.

fields
Analysis of PDEs
pdf ↗ page arXiv:2509.09648 ↗

This paper studies the landscape of the simultaneous blind deconvolution and phase retrieval (BDPR) problem via a structured low-rank tensor recovery framework. Since the complicated sensing structure makes direct landscape analysis technically challenging, we introduce a tractable tensor sensing surrogate that preserves the essential low-rank structure. We first analyze its population risk, characterize the global landscape on the unit sphere, and establish local linear convergence of Riemannian gradient descent (RGD) under mild conditions. We then extend the analysis to tensor sensing under a tensor restricted isometry property (TRIP), establishing local geometric and RGD convergence guarantees, and quantify robustness to measurement noise. Our theoretical results are further supported by extensive numerical experiments. These findings offer insights into the optimization landscape of the surrogate tensor sensing problem, thereby providing guidance for studying and solving the original BDPR problem.

comments
Revised version; 30 pages, 6 figures, plus 31 pages of supplementary material
fields
Information Theory
pdf ↗ page arXiv:2509.10834 ↗

A classical theorem of Micallef says that if $F \colon (Σ, g) \to \mathbb{R}^4$ is a stable minimal immersion of an oriented $2$-dimensional complete Riemannian manifold (that is parabolic) into $\mathbb{R}^4$, it is necessarily holomorphic with respect to some parallel orthogonal complex structure on $\mathbb{R}^4$. We generalize this theorem by replacing $\mathbb{R}^4$ with $\mathbb{R}^{2 + 2k}$ for any codimension $2k$, under the additional hypothesis that the normal bundle $N Σ$ is equipped with a complex structure that is compatible with the induced metric and parallel with respect to the induced connection. This is a necessary assumption for such a theorem to hold (as it is a consequence of the conclusion), and it is automatically satisfied in the classical case $k=1$. We also briefly discuss possible further generalizations of such a result to other calibrations and to Smith maps.

comments
16 pages. Version 2: corrected minor typos and clarified exposition in response to review report. Final version to appear in the Transactions of the American Mathematical Society
fields
Differential Geometry
pdf ↗ page arXiv:2509.22155 ↗

We prove observability estimates for the Schrödinger equation posed on the equilateral triangle in the plane, under both Neumann and Dirichlet boundary conditions. No geometric control condition is required on the rough localization functions that we consider. This is the first result of this kind on a non-toric domain in the compact setting. Our strategy is to exploit Pinsky's tiling argument to deduce this result from observability estimates on rational twisted tori. These are obtained via propagation of singularities, adapting arguments from Burq and Zworski. The later require Strichartz estimates on such twisted rational tori, that we derive from Zygmund inequalities in the same geometric setting, also providing the sharp constant. Strichartz estimates on the equilateral triangle are also derived from this analysis.

fields
Analysis of PDEs, Optimization and Control
pdf ↗ page arXiv:2509.24642 ↗

We study discounted infinite-time mean field forward-backward stochastic differential equations (FBSDEs) and the associated elliptic master equations, which were introduced in [20] as mathematical tools for solving discounted infinite-time mean field games. We first establish stability and flow properties, identify the backward decoupling field with the spatial derivative of the equilibrium value function, and prove that the value function is a viscosity solution of the master equation. Under additional smoothness and quantitative stability assumptions, we construct its Lions-derivative and the required higher-order derivatives using variational results from a companion paper [21]. These results show that the value function is a classical solution of the elliptic master equation. We also prove that the value function is the unique displacement-monotone regular solution.

fields
Probability, Optimization and Control
pdf ↗ page arXiv:2510.03707 ↗

We prove distributional results for mixed character sums \begin{equation*}\sum_{n\le x }χ(n)e(nθ),\end{equation*} for fixed $θ\in [0,1]$ and random character $χ\pmod q$, as well as for a fixed character $χ$ and randomly sampled $θ\in [0,1].$ We present various applications of our results. For example, we construct Littlewood polynomials with large Mahler measure and $L_1$ norm, thus establishing new records in the Mahler and Newman problems. We also prove asymptotics for the $L_{2k}$ norms of well-known Turyn polynomials as $k\to\infty$, refuting a conjecture of Günther and Schmidt. An important ingredient in our work is a general way of dealing with "log-integrability" problems.

comments
42 pages; v2: added a remark about Newman's problem and fixed some minor inaccuracies; v3: significant changes in Section 9, corrected minor errors throughout and updated acknowledgements
fields
Number Theory, Classical Analysis and ODEs, Complex Variables, Probability
pdf ↗ page arXiv:2510.06161 ↗

The paper presents variational formulae for entropy-like functionals, including Segal and Rényi entropies, for normal states on semifinite von Neumann algebras. The considered functionals are of the form $τ(f(h))$ where $τ$ is a normal faithful semifinite trace on this algebra, $h$ is a positive selfadjoint operator from $L^1(\mathscr{M},τ)$, and $f$ is an appropriate convex or concave function. The results cover both finite and semifinite algebras, and the obtained formulae generalise known results, in particular, those concerning relative entropy. Moreover, the connection between quantum entropies and the structure of abelian subalgebras is highlighted, providing new interpretations in the context of quantum information theory.

fields
Operator Algebras, Mathematical Physics, Functional Analysis, Quantum Algebra
pdf ↗ page arXiv:2510.07605 ↗

In this paper we study the even monic degree-8 cuboid polynomial $P_{a,u}(t)$ introduced by R. A. Sharipov in the first-cuboid specialization of his cuboid equations. For nonzero integers $a,u$ with $u^2\neq a^2$ we prove that $P_{a,u}(t)$ is irreducible in $\mathbb{Z}[t]$ (equivalently, in $\mathbb{Q}[t]$), thus confirming Sharipov's irreducibility conjecture in this two-parameter case. Over $K=\mathbb{Q}(\sqrt2)$ we have a factorization $P_{a,u}(t)=H_-(t)H_+(t)$ into two conjugate quartics. We show that reducibility of either $H_\pm$ would force the discriminant of a certain quadratic in $S=t^2$ to be a square in $K$, which in turn implies (via $τ=(au/Δ)^2$, where $Δ=u^2-a^2$) the existence of a rational point $(y,v)\in\mathcal{C}(\mathbb{Q})$ on the genus-one quartic $\mathcal{C}: v^2=16y^4+136y^2+1$ with $y^2=τ$. We give an explicit isomorphism $\overline{\mathcal{C}}\simeq E$ with the elliptic curve $E: Y^2=X(X-8)(X-9)$, which has conductor $48$ and Mordell-Weil rank $0$. Enumerating $E(\mathbb{Q})$ and tracing back to $\mathcal{C}(\mathbb{Q})$ rules out the only possible values $τ\in\{0,1/4\}$, and hence excludes any further factorization of $H_\pm$ in $K[t]$. A quadratic Galois descent then yields the irreducibility of $P_{a,u}(t)$ over $\mathbb{Q}$ and $\mathbb{Z}$.

comments
A complete proof of the first perfect cuboid conjecture (Sharipov's first conjecture)
fields
General Mathematics
pdf ↗ page arXiv:2510.11768 ↗

In this paper, we establish a derived Torelli Theorem for twisted abelian varieties. Starting from this, we explore the relation between derived isogenies and classical isogenies. We show that two abelian varieties of dimension $\geq 2$ are derived isogenous if and only if they are principally isogenous over fields of characteristic zero. This generalized the result for abelian surfaces and completely solves the question raised in [arXiv:2108.08710].

comments
50 pages; final version
fields
Algebraic Geometry
pdf ↗ page arXiv:2510.22612 ↗

Shallow free surface flows are often characterized by both subdomains that require high modeling complexity and subdomains that can be sufficiently accurately modeled with low modeling complexity. Moreover, these subdomains may change in time as the water flows through the domain. This motivates the need for space and time adaptivity in the simulation of shallow free surface flows. In this paper, we develop the first adaptive simulations using the recently developed Shallow Water Moment Equations, which are an extension of the standard Shallow Water Equations that allow for vertically changing velocity profiles by including additional variables and equations. The model-specific modeling complexity of a shallow water moment model is determined by its order. The higher the order of the model, the more variables and equations are included in the model. Shallow water moment models are ideally suited for adaptivity because they are hierarchical such that low-order models and high-order models share the same structure. To enable adaptive simulations, we propose two approaches for the coupling of the varying-order shallow water moment equations at their boundary interfaces. The first approach dynamically updates padded state variables but cannot be written in conservative form, while the second approach uses fixed padded state variable values of zero and reduces to conservative form for conservative moment equations. The switching procedure between high-order models and low-order models is based on a new set of model error estimators, originating from a decomposition of the high-order models. Numerical results of a dam break and of the collision of a dam-break wave with a smooth wave for different friction parameter values yield accurate results, while achieving speedups up to 40 percent compared to a non-adaptive model with fixed modeling complexity.

comments
31 pages, 7 Figures
journal
Verbiest, R., Koellermeier, J. Model-Adaptive Simulation of Hierarchical Shallow Water Moment Equations in One Dimension, Comput. Math. Appl., 221, 135-158, 2026
fields
Numerical Analysis
pdf ↗ page arXiv:2510.25351 ↗

Strongly regular graphs are regular graphs with a constant number of common neighbours between adjacent vertices, and a constant number of common neighbours between non-adjacent vertices. These graphs have been of great interest over the last few decades and often give rise to interesting groups of automorphisms. In this paper we take a reverse approach, and leverage strong classification results on rank four permutation groups to classify the strongly regular graphs which yield such groups as a group of automorphisms.

comments
27 pages
fields
Group Theory, Combinatorics
pdf ↗ page arXiv:2510.25410 ↗

Bilevel optimization is a central tool in computational imaging for high-dimensional hyperparameter tuning; prominent applications include learning data-adaptive regularizers and optimizing forward operators in variational regularization. However, due to the nested nature of the problem, exact gradients with respect to the parameters (so-called hypergradients) are not available: the precision of the hypergradient is linearly related to the computational cost, thus requiring algorithms which can solve the problem without unnecessary precision. In learned-regularizer pipelines, the inner reconstruction solver is typically run for a fixed number of iterations, leaving the hypergradient accuracy uncontrolled and existing convergence theory inapplicable. In this work, we analyze the schedules that practitioners actually run: we prove convergence of inexact stochastic bilevel optimization and establish rates under both decaying accuracy and step size schedules, showing that, with optimal configurations, convergence occurs at an $O(k^{-1/4})$ rate in expectation. This is the optimal rate of nonconvex stochastic gradient descent and matches single-loop stochastic bilevel methods; with warm-started inner solves, total costs also agree up to constants. Experiments on image denoising and inpainting with convex ridge regularizers and input-convex neural networks confirm our analysis: decreasing step sizes improve stability, accuracy scheduling is more critical than step size strategy, and adaptive preconditioning (e.g., Adam) further boosts performance, particularly for input-convex neural networks. In a budget-matched comparison with four state-of-the-art single-loop methods, accuracy-scheduled stochastic gradient descent and its Adam variant attain the highest test peak signal-to-noise ratio.

comments
10 pages + 6 pages supplementary material. Submitted to IEEE Transactions on Computational Imaging
fields
Optimization and Control
pdf ↗ page arXiv:2511.06774 ↗

We study observable dynamics of generic continuous interval maps. We prove that, for a residual subset of $C([0,1])$, the global Milnor, statistical, and physical attractors coincide with the non-wandering set. Thus, for a typical interval map, the asymptotic dynamics detected by Lebesgue-almost every initial condition recovers all recurrent dynamics. The common attractor is a robust Cantor set of zero Hausdorff dimension. Moreover, every invariant probability measure has a basin of zero Lebesgue measure. We also present examples showing that, outside the generic setting, positive topological entropy may occur outside the global Milnor attractor, and the three attractors need not coincide.

fields
Dynamical Systems
pdf ↗ page arXiv:2511.09718 ↗

We introduce a new direct multilevel method for solving general nonsingular complex square linear systems admitting a suitable block partition, using a regular smoother and an arbitrary but equal number of pre- and post-smoothings. Through careful analysis of the error propagation operator, we cluster the spectrum of this operator. This allows us to write a direct K-cycle version of the method.

comments
23 pages, 3 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2511.12298 ↗

Decentralized air traffic management systems offer a scalable alternative to centralized control, but often assume high levels of cooperation. In practice, such assumptions frequently break down since agents, each representing an airspace sector, may operate independently and prioritize local objectives. We address the problem of sector overload in decentralized air traffic management by proposing a regulated decentralized protocol that models self-interested behaviors based on best response dynamics. Each agent adjusts the departure times of its assigned flights to reduce its own congestion, without requiring centralized joint optimization. A tunable cooperativeness factor models the degree to which each agent accounts for overload in other sectors, while a minimal admissibility rule prevents local updates from creating new overloads. We show that this regulatory restriction is sufficient to guarantee finite-time convergence of best response dynamics to a pure Nash equilibrium under partial cooperation. In addition, we identify a sufficient condition under which an overload-free solution corresponds to a global minimizer of the potential function. Numerical experiments using one month of European flight data demonstrate that the proposed algorithm substantially reduces overload even with only minimal cooperation, achieving performance close to a centralized global mixed-integer optimizer and exceeding a centralized first-come-first-served baseline while requiring substantially less computation than centralized optimization. We further evaluate departure delay and fairness to quantify the operational cost of overload mitigation.

fields
Optimization and Control
pdf ↗ page arXiv:2511.13770 ↗

We consider the problem of Adaptive Neyman Allocation for the class of AIPW estimators for estimating the average treatment effect in a design-based setting, where potential outcomes and covariates are deterministic. As each subject arrives, an adaptive procedure must select both a treatment assignment probability and a pair of linear predictors to be used in the AIPW estimator. Our goal is to construct an adaptive procedure that minimizes the Neyman Regret, which is the difference between the variance of the adaptive procedure and an oracle variance which uses the optimal non-adaptive choice of assignment probabilities and linear predictors. While previous work has drawn fruitful connections between Neyman Regret and online convex optimization for the Horvitz–Thompson estimator, one of the central challenges for the AIPW estimator is that the underlying optimization is non-convex. In this paper, we propose Sigmoid-FTRL, an adaptive experimental design which addresses the non-convexity via simultaneous minimization of two convex regrets. We prove that under standard regularity conditions, the Neyman Regret of Sigmoid-FTRL converges at a $\sqrt{d/T}$ rate, where $d$ is the dimension of the covariates and $T$ is the number of subjects in the experiment. We establish that this $T$ dependence is optimal by proving a $T^{-1/2}$ lower bound on the Neyman Regret for any adaptive design under our regularity conditions. Finally, we establish a central limit theorem and a consistently conservative variance estimator which facilitate the construction of asymptotically valid Wald-type confidence intervals.

fields
Statistics Theory
pdf ↗ page arXiv:2511.19905 ↗

We present a simple construction of a random Schrödinger operator subject to a magnetic field with a regularity as low as $0^-$-Hölder and a Gaussian white noise electric potential on a two-dimensional bounded box. This construction is based on the exponential Ansatz introduced in [HL15] and leverages the semigroup approach developed in [HL24]. The proposed construction enables us to generalise an asymptotic result for the bottom of the spectrum of the two-dimensional continuous Anderson Hamiltonian, first proved in [CvZ21], to the magnetic case. Our choice of potential not only covers the case of a uniform magnetic field, but also those which would break translational invariance.

comments
Accepted version for publication in Electron. J. Probab
fields
Probability, Mathematical Physics, Spectral Theory
pdf ↗ page arXiv:2511.22162 ↗

Understanding how singularities behave under small perturbations is a central theme in singularity theory. In this paper, we study separable families $f_s=f_0+ρ(s)\varphi$ of analytic function-germs on a germ of a complex analytic space $(X,0)$, and we give sufficient conditions for them to admit a topological trivialization. Our results extend previous work by the third author and collaborators, moving from abstract triviality to the embedded setting. As an application, we obtain new instances of topological stability, including a class of $μ$-constant deformations. These findings provide a new perspective on the long-standing $μ$-constant conjecture, one of the major open problems in the field.

comments
3 figure, v2 solves a problem with a false lemma, comments very welcomed!
fields
Algebraic Geometry, Geometric Topology
pdf ↗ page arXiv:2511.23185 ↗

Let $K$ be a large field such that $K[\sqrt{-1}]$ is not algebraically closed and $F/K$ a function field in one variable. Extending techniques and results from earlier work with Becher and Dittmann, we show that every valuation ring on $F$ containing $K$ is existentially definable in the language of rings with parameters from $F$. As a consequence, using a known reduction technique, we obtain the undecidability of the existential theory of $F$ in the language of rings with appropriately chosen parameters.

comments
preprint, 22 pages. Introduction and proof of Theorem 4.3 rewritten
fields
Number Theory, Logic
pdf ↗ page arXiv:2512.04896 ↗

We study simple extensions of pointed finite tensor categories, that is, tensor categories $\mathcal{C}$ admitting an abelian decomposition $\mathcal{C} \cong \mathcal{D} \oplus \mathcal{M}$ where $\mathcal{D}$ is a pointed tensor subcategory and $\mathcal{M}$ is semisimple with a unique simple projective object. Such categories provide a natural generalization of near-group categories. Our results concern the braided case. We prove that every non-degenerate braided non-semisimple near-group category is a braided simple extension of $\operatorname{sRep}(W\oplus W^*)$ with non-trivial braiding for which $\operatorname{sRep}(W)$ is Lagrangian, and any braided non-semisimple near-group category $\mathcal{C}$ arises canonically as an extension of a non-degenerate braided tensor category with a Lagrangian subcategory $\operatorname{sRep}(W)$ and $\operatorname{Rep}(K)$, where $K$ is the Picard group of a symmetric subcategory determined by the unique simple projective object of $\mathcal{C}$.

comments
V2: Added subsection 3.3, corrected Theorem 2 and the results in section 4.3 from the published version (in Comm. In Algebra), a new proof to Theorem 1
fields
Category Theory
pdf ↗ page arXiv:2512.12556 ↗

Many engineering tasks require solving families of nonlinear constrained optimization problems, parametrized in setting-specific variables. This is computationally demanding, particularly if solutions have to be computed across strongly varying parameter values, e.g., in real-time control or for model-based design. Thus, we propose to learn the mapping from parameters to the primal optimal solutions and to their corresponding duals using neural networks, giving a dense estimation in contrast to gridded approaches. Our approach, Optimality-Informed Neural Networks (OptINNs), combines (i) a KKT-residual loss that penalizes violations of the first-order optimality conditions under standard constraint qualification assumptions, and (ii) problem-specific output activations that enforce simple inequality constraints (e.g., box-type/positivity) by construction. This design reduces data requirements, allows the prediction of dual variables, and improves feasibility and closeness to optimality compared to penalty-only training. Taking quadratic penalties as a baseline, as previously proposed for this problem class in the literature, our method simplifies hyperparameter tuning and attains tighter adherence to optimality conditions. We evaluate OptINNs on different nonlinear optimization problems ranging from low to high dimensions and compare them with equally sized neural networks trained using the quadratic-penalty method. On small problems, OptINNs match a quadratic-penalty baseline in primal accuracy while additionally predicting dual variables with low error. On larger problems, OptINNs achieve lower constraint violations, lower primal error, and lower errors in the predicted costs. These results suggest that embedding feasibility and optimality into the network architecture and loss can make learning-based surrogates more accurate, feasible, and data-efficient for parametric optimization.

comments
Under review, 28 pages, 10 figures
fields
Optimization and Control
pdf ↗ page arXiv:2512.20270 ↗

This study investigates the nth-level Prabhakar fractional derivative, a generalization encompassing some well-known fractional derivatives. We establish its fundamental properties, particularly its relationship with the corresponding Prabhakar fractional integral. Furthermore, we develop Mikusinski-type operational calculus for this derivative, providing a framework for solving differential equations involving this operator. To illustrate its application, we present analytical solutions of two problems: a fractional order ordinary differential equation and the time fractional heat equation, both of which include the nth-level Prabhakar derivative.

fields
Analysis of PDEs
pdf ↗ page arXiv:2512.21273 ↗

In this paper we first establish the theory of a magnetic Sobolev space $H^1_A(\mathcal{G},\mathbb{C})$ on metric graphs $\mathcal{G}$ and prove the self-adjointness of the associated magnetic Schrödinger operator. Then, in this setting, we investigate the existence and multiplicity of normalized solutions to nonlinear magnetic Schrödinger equations on compact metric graphs and on noncompact metric graphs with localized nonlinearities or nonlinearities acting on whole metric graphs, covering the mass-subcritical, mass-critical, and mass-supercritical cases.

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

In this paper we study a family of one-dimensional stationary cubic nonlinear Schrödinger (NLS) equations with periodic potentials and linear part displaying Dirac points in the dispersion relation. By introducing a suitable periodic perturbation, one can open a spectral gap around the Dirac-point energy. This allows to construct standing waves of the NLS equation whose leading-order profile is a modulation of Bloch waves by means of the components of a spinor solving an appropriate cubic nonlinear Dirac (NLD) equation. We refer to these solutions as Dirac solitons. Our analysis thus provides a rigorous justification for the use of the NLD equation as an effective model for the original NLS equation.

comments
41 pages, 4 Figures. Various typos corrected and short comments added, as well as additional figures. Introduction and the beginning of Section 5 have benn slightly expanded. Keywords: Dirac solitons, Dirac points, NLS equations, NLD equations, standing waves, periodic Schrödinger operators
fields
Analysis of PDEs, Mathematical Physics, Functional Analysis
pdf ↗ page arXiv:2512.24089 ↗

We investigate several classes of submanifolds of almost quaternionic skew-Hermitian manifolds $(M^{4n}, Q, ω)$, including almost symplectic, almost complex, almost pseudo-Hermitian and almost quaternionic submanifolds. In the torsion-free case, we realize each type of submanifold considered in the theoretical part by constructing explicit examples of submanifolds of semisimple quaternionic skew-Hermitian symmetric spaces.

comments
29 pages, final version
journal
Ann Glob Anal Geom 70, 15 (2026)
fields
Differential Geometry
pdf ↗ page arXiv:2601.03094 ↗

Cluster-randomized trials (CRTs) are used to evaluate group-level interventions and can collect multiple outcomes capturing complementary dimensions of benefit and risk. Investigators typically seek a single global summary of treatment effect, yet existing methods largely focus on single-outcome estimands or rely on model-based procedures with unclear causal interpretation or limited robustness. We develop a unified potential outcomes framework for generalized treatment effects with multiple outcomes in CRTs, accommodating both non-prioritized and prioritized outcome settings. The proposed cluster-pair and individual-pair causal estimands are defined through pairwise contrast functions and explicitly account for informative cluster size. We establish nonparametric estimation via weighted clustered U-statistics and derive efficient influence functions to construct covariate-adjusted estimators that integrate debiased machine learning with U-statistics. The resulting estimators are consistent and asymptotically normal, attain semiparametric efficiency bounds under mild regularity conditions, and admit analytically tractable variance estimators that are consistent under cross-fitting. Simulations and an application to a CRT for chronic pain management illustrate the practical utility of our proposed methods.

fields
Statistics Theory
pdf ↗ page arXiv:2601.13428 ↗

The Marcinkiewicz–Zygmund theorem is a fundamental result in probability theory that establishes rates of convergence in the strong law of large numbers (SLLN). Although numerous extensions have been developed for dependent sequences, many classes of processes, particularly those exhibiting strong dependence, remain unexplored. In this paper, we present a Marcinkiewicz–Zygmund-type SLLN for a class of mixed moving average processes, which form a large and flexible class of stationary infinitely divisible processes. In contrast to the classical case, where moments determine the asymptotic behavior, the present setting additionally involves key objects that characterize both dependence and marginal distributions.

comments
48 pages
fields
Probability
pdf ↗ page arXiv:2601.14748 ↗

In this paper, we study the Łojasiewicz-Simon gradient inequality for the mathematical model of grain boundary motion. We first derive a curve shortening equation with time-dependent mobility, which guarantees the energy dissipation law for the grain boundary energy, including the difference between orientations of the constituent grains as a state variable. Next, we discuss the Łojasiewicz-Simon gradient inequality for the grain boundary energy. Finally, we give applications of the inequality to the energy.

comments
33 pages, 1 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2601.19226 ↗

In this paper, we establish the existence of probabilistically strong, measure-valued solutions for the stochastic incompressible Navier–Stokes equations with additive and transport noise. Considering the vanishing viscosity limit, we prove the convergence of these solutions to probabilistically strong, dissipative weak solutions to the stochastic incompressible Euler equations with additive and transport noise. Introducing the concept of energy-variational solutions in the stochastic context we are able to treat the nonlinearities without changing the probability space. This resolves the open problem of constructing, in three dimensions, probabilistically, strong solutions of the stochastic Euler equations as vanishing-viscosity limits on the prescribed stochastic basis. In addition, the constructed solutions satisfy the energy inequality and general $L^2$ initial data is treated.

fields
Analysis of PDEs
pdf ↗ page arXiv:2601.22073 ↗

We use a difference Lax form to construct simultaneous integrals of motion of the fourth Painlevé equation and the difference second Painlevé equation over fields with finite characteristic $p>0$. For $p\neq 3$, we show that the integrals can be normalised to be completely invariant under the corresponding extended affine Weyl group action. We show that components of reducible fibres of integrals correspond to reductions to Riccatti equations. We further describe a method to construct non-rational algebraic solutions in a given positive characteristic. We also discuss a projective reduction of the integrals.

comments
Extended introduction with motivation for the arithmetic study of Painlevé equations and comparison of our normalisations with the literature. Made minor further changes including fixing of typos
fields
Mathematical Physics
pdf ↗ page arXiv:2602.09298 ↗

Leveraging channel state information from multiple Wi-Fi bands has the potential to improve delay resolution for ranging and sensing when wide contiguous spectrum is unavailable. However, non-contiguous spectrum access reshapes the spectral window, producing sidelobes and secondary peaks that can mask closely spaced multipath components. Prior work either designs the bands, which fixed Wi-Fi channelization does not allow, or addresses only the first multipath component. To characterize these secondary peaks, multipath delay estimation is studied in Wi-Fi-compliant multiband settings using channel state information. For a two-path model with unknown complex gains and delays, the Cramér-Rao lower bound for delay separation is derived and analyzed, confirming the benefit of larger frequency aperture at every separation considered, while revealing pronounced, separation-dependent oscillations driven by gap geometry and coupling of the two multipath components. Increasing aperture sharpens the mainlobe but also intensifies sidelobes and multipath interference, yielding competing peaks and a dominant peak shifted from the true delay. For the single-path matched filter, this shift is a deterministic offset governed by the slope of the autocorrelation function (ACF) of the allocation at the separation. A closed-form expression is derived for this offset, predicting it to within 21 ps for the analyzed channel combinations. Since the spectrum allocation enters both the bound and the offset, the impact of its gaps can be assessed for any legal aggregation before a measurement is taken.

comments
17 pages, 9 figures, 5 tables. v2: revised and extended version with new title; added co-authors M. Mohorčič and C. Fortuna
fields
Information Theory
pdf ↗ page arXiv:2602.18086 ↗

Physical-layer characteristics, such as channel state information (CSI) and transmitter noise induced by hardware impairments, are often uniquely associated with a transmitter. This paper investigates transmitter anonymity at the physical layer from a signal design perspective. We consider an anonymous communication problem where the receiver should reliably decode the signal from the transmitter but should not make use of the signal to infer the transmitter's identity. Transmitter anonymity is quantified using a Kullback-Leibler divergence (KLD)-based metric, which enables the formulation of explicit anonymity constraints in the precoder design. We then develop a transceiver design that preserves reliable communication under spatial multiplexing while preventing transmitter identification. The proposed framework employs a partitioned equal-gain combining (P-EGC) scheme that leverages receiver diversity without requiring transmitter-specific CSI. Simulation results demonstrate anonymity-reliability tradeoffs across different signal-to-noise ratios (SNRs), numbers of data streams, and alias selection methods. Moreover, the results reveal opposite trends of anonymity with respect to transmitter-dependent noise variations in the low-SNR and high-SNR regimes.

comments
To appear in IEEE Transactions on Communications
fields
Information Theory
pdf ↗ page arXiv:2602.20874 ↗

We determine the minimal width of $p$-adic neural networks with the universal approximation property for continuous $\mathbb Q_p$-valued functions on compact open subsets with respect to the $L_q$ norms and the $C_1$ norm, where the activation function is a natural $p$-adic analogue of the ReLU function.

comments
19 pages, comments welcome!
fields
Number Theory
pdf ↗ page arXiv:2603.00064 ↗

We study a Dirichlet–Ferguson process $ζ$ on a general phase space. First we reprove the chaos expansion from Peccati (2008), providing an explicit formula for the kernel functions. Then we proceed with developing a Malliavin calculus for $ζ$. To this end we introduce a gradient, a divergence and a generator which act as linear operators on random variables or random fields and which are linked by some basic formulas such as integration by parts. While this calculus is strongly motivated by Malliavin calculus for isonormal Gaussian processes and the general Poisson process, the strong dependence properties of $ζ$ require considerably more combinatorial efforts. We apply our theory to identify our generator as the generator of the Fleming–Viot process and to describe the associated Dirichlet form explicitly in terms of the chaos expansion. We also establish the product and chain chain rule for the gradient and an integral representation of the divergence. Finally we give a short direct proof of the Poincaré inequality and establish a sharp reverse Poincaré inequality, similarly to the one in Schulte and Trapp (2024) for the Poisson process.

fields
Probability
pdf ↗ page arXiv:2603.07104 ↗

We prove a version of de Rham and Hyodo-Kato flip-flopping for dual towers of rigid analytic spaces including those coming from dual basic local Shimura varieties. The main tool are comparison theorems expressing the two cohomologies as pro-étale cohomology of corresponding relative period sheaves that, by definition, satisfy pro-étale descent. As an application, we show that de Rham and Hyodo-Kato cohomologies of finite level coverings of the Drinfeld space of any dimension $d$ over $K$ are admissible as representations of $\mathbb{GL}_{d+1}(K)$.

comments
Postreferee version. Comments welcome
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2603.07869 ↗

The coexistence of sparsity and clustering (non-vanishing average fraction of triangles per node) is one of the few structural features that, irrespective of finer details, are ubiquitously observed across large real-world networks. This fact calls for generic models producing sparse clustered graphs. Earlier results suggested that sparse random graphs with independent edges fail to reproduce clustering, unless edge probabilities are assumed to depend on underlying metric distances that, thanks to the triangle inequality, naturally favour triadic closure. This observation has opened a debate on whether clustering implies (latent) geometry in real-world networks. Alternatively, recent models of higher-order networks can replicate clustering by abandoning edge independence. In this paper, we mathematically prove, and numerically confirm, that a sparse random graph with independent edges, recently identified in the context of network renormalization as an invariant model under node aggregation, produces finite clustering without any geometric or higher-order constraint. The underlying mechanism is an infinite-mean node fitness, which also implies a power-law degree distribution. Further, as a novel phenomenon that we characterize rigorously, we observe the breakdown of self-averaging of various network properties. Therefore, as an alternative to geometry or higher-order dependencies, node aggregation invariance emerges as a basic route to realistic network properties.

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

A quantum channel is defined as being completely positive (CP) and trace preserving (TP). While not every quantum channel is invertible or reversible, every quantum channel admits various kinds of generalized inverses such as the Moore-Penrose inverse and the Drazin inverse. A generalized inverse of a quantum channel may not itself be a quantum channel: it often fails to be CP. However, generalized inverses still play an important role in quantum error mitigation. Here, because it is often desirable for the generalized inverse of a quantum channel to be at least TP, the Drazin inverse, which is TP, is favoured over the Moore-Penrose inverse, which is not in general TP. In this paper, we take a categorical perspective on generalized inverses of quantum channels. This allows us to give a simple proof of the fact that the Drazin inverse of a quantum channel is always TP. It also allows us to show that for unital quantum channels, the Drazin inverse is also unital. We then generalize this result to dagger Drazin inverses, which allows us to show that for unital quantum channels, the Moore-Penrose inverse is both TP and unital as well. This opens the door to new applications of both the Drazin inverse and Moore-Penrose inverse in quantum information theory and, in particular, in quantum error mitigation.

comments
In Proceedings QPL 2026, arXiv:2611.04069
journal
EPTCS 456, 2026, pp. 128-143
fields
Category Theory
pdf ↗ page arXiv:2603.13946 ↗

We study the structure of an LA-group identifying its underlying VB-group with a representation up to homotopy. We show that the Lie algebroid structure is determined by a complementary action up to homotopy of the Lie algebra of units. We identify the equations that the representation and the action need to verify in order to assemble into an LA-group, establishing an equivalence between LA-groups and LA-matched pairs. As an application, we catalog some extreme examples of representations and actions and comment on their integrability.

fields
Differential Geometry, Category Theory
pdf ↗ page arXiv:2603.15858 ↗

Port-Hamiltonian energy balance and Koopman approximation describe different aspects of nonlinear dynamics. This paper distinguishes exact observable identities, measure-dependent Galerkin projections, constrained surrogate identification, and certification of a controller on the nonlinear plant. Conservative weak skewness requires compatible measure and boundary conditions. Dissipative positivity belongs to the metric bracket; it does not generally make the projected first-order dissipative derivation positive. We give an explicit fixed-metric compatibility condition and a constant–Hamiltonian dictionary obstruction, and state the assumptions under which surrogate certificates imply plant bounds. A reproduced pendulum experiment illustrates the practical gap: its learned controller admits an exact shaped-energy certificate on the nonlinear plant, although its fitted quadratic storage is not a plant Lyapunov function and its archived residual-norm diagnostic is uninformative. These conclusions use the specified plant structure; they are not generic finite-data guarantees. The bracket, projection, and Lyapunov arguments are positioned relative to existing structured identification and residual-aware control methods.

comments
23 pages, 3 figures. Corrected and updated references; clarified mathematical assumptions and the distinction between surrogate and nonlinear-plant guarantees; expanded technical discussion and examples
fields
Dynamical Systems
pdf ↗ page arXiv:2603.17849 ↗

This paper addresses the energy dispatch of a virtual power plant comprising renewable generation, energy storage, and thermal units under uncertainty in renewable output, energy prices, and energy demand. The nonlinear dynamics and multiple sources of uncertainty render traditional stochastic model predictive control (MPC) computationally intractable as the dispatch horizon, scenario set, and asset portfolio expand. To overcome this limitation, we propose a novel controller that seamlessly integrates MPC with time series aggregation and distributed optimization, simultaneously reducing the temporal, asset, and scenario dimensions of the problem. The resulting controller provides a rigorous performance guarantee through theoretically validated bounds on its approximation error, while leveraging dual information from previous MPC iterations to adaptively optimize the temporal aggregation. Numerical results show that the proposed controller reduces runtime by over 50% relative to traditional stochastic MPC and, crucially, restores tractability where the full-scale dispatch model proves intractable.

fields
Optimization and Control
pdf ↗ page arXiv:2603.19106 ↗

József Suták (1865–1954), a Piarist priest, \emph{gymnasium} teacher and from 1912 full professor of geometry at the University of Budapest, is scarcely more than a footnote in the history of Hungarian mathematics. His name survives mainly because he co-signed, with Lipót Fejér, the acceptance of John von Neumann's 1926 dissertation on the axiomatic construction of set theory. Drawing on his printed works, on the records of the Budapest Faculty of Philosophy and of the Catholic Saint Stephen Academy, and on a hitherto unknown part of his personal papers, this article reconstructs his career. It follows his Hungarian translation of Bolyai's \emph{Appendix} (1897), his empiricist lecture on the axioms of geometry (1898), his papers on the logical problems of set theory (1911) and on the axiomatic construction of projective geometry (1914), and his later differential-geometric work. It analyses his appointment in 1911/12, when the faculty preferred him to Frigyes Riesz and Alfréd Haar, and his role as chairman of the admissions committee in implementing the numerus clausus after 1920. The answer to the title's question is twofold: as a mathematician, Suták is largely rightly forgotten; for the history of Budapest mathematics and its university, he is not.

fields
History and Overview
pdf ↗ page arXiv:2603.22196 ↗

Fréchet regression, or conditional Barycenters, is a flexible framework for modeling relationships between covariates (usually Euclidean) and response variables on general metric spaces, e.g., probability distributions or positive definite matrices. However, in contrast to classical barycenter problems, computing conditional counterparts in many non-Euclidean spaces remains an open challenge, as they yield non-convex optimization problems with an affine structure. In this work, we study the existence and computation of conditional barycenters, specifically in the space of positive-definite matrices with the Bures-Wasserstein metric. We provide a sufficient condition for the existence of a minimizer of the conditional barycenter problem that characterizes the regression range of extrapolation. Moreover, we further characterize the optimization landscape, proving that under this condition, the objective is free of local maxima. Additionally, we develop a projection-free and provably correct algorithm for the approximate computation of first-order stationary points. Finally, we provide a stochastic reformulation that enables the use of off-the-shelf stochastic Riemannian optimization methods for large-scale setups. Numerical experiments validate the performance of the proposed methods on regression problems of real-world biological networks and on large-scale synthetic Diffusion Tensor Imaging problems.

fields
Optimization and Control
pdf ↗ page arXiv:2604.03566 ↗

We study the Hodge-completed derived Hodge-to-de Rham spectral sequence of integral projective complex curves. We prove E2-degeneration whenever every singularity is analytically quasihomogeneous, without a local complete intersection (lci) hypothesis. An explicit lci counterexample shows that the converse fails in general. For lci curves, E2-degeneration bounds the total Milnor-Tjurina defect by the dimension of the space of global Kahler one-forms modulo torsion, and hence by the genus of the normalization. This yields a converse for lci curves whose global Kahler one-forms are all torsion, including those with rational normalization. We also establish the converse for locally planar curves. An example with elliptic normalization shows that the numerical defect bound alone is not sufficient for E2-degeneration, even when equality holds.

comments
43 pages. Substantially revised. A counterexample disproves the general lci converse claimed in v1; corrected converse statements are established under additional hypotheses. The locally planar characterization remains valid, with a revised proof. The Hochschild-to-cyclic claims have been removed. Junxiao Wang has joined as coauthor, and the title and abstract have been revised
fields
Algebraic Geometry
pdf ↗ page arXiv:2604.05825 ↗

We introduce principal and canonical linkage for relative ideals of a numerical semigroup $S$ and study their interaction modulo translation. On normalized $S$-reflexive ideals, a principal link followed by a canonical link acts by addition of the canonical ideal $K$. The resulting mixed components have paths as their underlying simple graphs, and their even liaison classes are chains under inclusion. If $r(K)$ is the positive reduction number of $K$, every even class has at most $r(K)$ elements and every mixed component has at most $2r(K)$ vertices. For components with a loop, the bound improves to $r(K)$. For semigroups of type two, we compute the even class of a given ideal from its occupied and gap blocks along arithmetic progressions and prove that the largest even class has exactly $r(K)$ elements. This equality can fail in type three. Both component bounds are sharp, and explicit families of embedding dimension three give components of unbounded size with and without loops.

comments
14 pages. Substantially revised, with a new title and new results on mixed liaison classes, including sharp bounds in terms of the reduction number of the canonical ideal
fields
Commutative Algebra
pdf ↗ page arXiv:2604.14478 ↗

We consider deterministic finite-horizon optimal control problems with a fixed initial state. We introduce an on-line policy iteration method, which, starting from a given policy, however obtained, generates a sequence of cost-improving policies and corresponding trajectories. Each policy produces a trajectory, which is used in turn to generate data for training the next policy. The method is motivated by problems that are repeatedly solved starting from the same initial state, including discrete optimization and path planning for repetitive tasks. For such problems, the method is fast enough to be used on-line. Under a natural consistency condition, we show that the sequence of costs of the generated policies is monotonically improving for the given initial state (but not necessarily for other states). We illustrate our results with computational studies from combinatorial optimization and 3-dimensional path planning for drones and a robot arm in the presence of obstacles. We also discuss briefly a stochastic counterpart of our algorithm. Our proposed framework combines elements of rollout and policy iteration with flexible trajectory-based policy representations, and applies to problems involving a single as well as multiple decision makers. It also provides a principled way to train neural network-based policies using trajectory data, while preserving monotonic cost improvement.

fields
Optimization and Control
pdf ↗ page arXiv:2604.15004 ↗

This paper develops and analyzes a computationally efficient receding horizon control (RHC) strategy for steering two-dimensional Navier–Stokes flows to prescribed reference trajectories. The control is represented by a finite linear combination of localized actuators supported within a prescribed control subdomain. At the continuous PDE level, we establish local exponential stabilization in the $L^2$-norm and suboptimality of the actuator-based RHC scheme for weak solutions. Direct implementation requires the repeated solution of high-dimensional finite-horizon optimal control problems. To reduce this computational cost, we combine RHC with model order reduction based on proper orthogonal decomposition (POD). A common POD space constructed from state snapshots reduces the state and adjoint equations and accelerates the online optimization, while the resulting controls are applied to the full-order discretized dynamics. Numerical experiments for two flow configurations of increasing complexity examine the influence of actuator layouts, prediction horizons, viscosity, and POD dimension. The numerical results demonstrate substantial reductions in computational cost while maintaining closed-loop stabilization in the tested configurations.

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

We propose a novel variational method to compute a highly accurate global signed distance function (SDF) to a given point cloud. To this end, the jump set of the gradient of the SDF, which coincides with the medial axis of the surface, is explicitly taken into account through a higher-order variational formulation that enforces linear growth along the gradient direction away from this discontinuity set. The eikonal equation and the zero-level set of the SDF are enforced as constraints. To make this variational problem computationally tractable, a phase field approximation of Ambrosio-Tortorelli type is employed. The associated phase field function implicitly describes the medial axis. The method is implemented for surfaces represented by unoriented point clouds using neural network approximations of both the SDF and the phase field. Experiments demonstrate the method's accuracy both in the near field and globally. Quantitative and qualitative comparisons with other approaches show the advantages of the proposed method.

fields
Numerical Analysis
pdf ↗ page arXiv:2604.16512 ↗

Travelling waves of mean-field particle systems are usually studied through the partial differential equation satisfied by the mean-field limit. We develop a different and entirely probabilistic set of tools. The wave profile is characterised as the solution of a distributional fixed-point equation for a tagged particle seen in the frame of the wave, and that equation is solved by relating it to a linear one --- a smoothing transform --- whose solutions are the martingale limits of a branching random walk. We apply this approach to a range of models, recover some known results and obtain a number of new ones. We first study models where particles evolve according to independent Lévy processes and, at Poisson epochs synchronise randomly selected pairs of particles (the lower of the two moves instantaneously to the position of the higher of the two). We characterise the speeds and travelling waves for all such models. In particular, this covers the case where the Lévy process is a continuous-time random walk with an arbitrary jump distribution; previously, only exponentially distributed jumps had been treated. We also consider a variant in which, instead of synchronising, the lower of the two particles jumps up by a random amount, drawn independently at each jump. This model is motivated by the so-called power-of-2 systems from queueing theory. Finally, we consider a new model where updates are given by the mixture of synchronisation and power-of-2: each update is a random value but the resulting position of the lower particle is capped by that of the higher one. In all cases, we characterise the speed, the travelling waves and their tail behaviour; the probabilistic nature of our approach makes the tail analysis particularly tractable.

fields
Probability
pdf ↗ page arXiv:2604.16956 ↗

We study resonances for the semiclassical magnetic Laplacian in the full plane with a compactly supported magnetic field in the framework of semiclassical complex scaling and black box scattering theory. Assuming that the magnetic field is locally constant, we prove the existence of semiclassical resonances near the Landau levels with exponentially small imaginary parts. We also prove that resonances emerge from a magnetic step discontinuity along a curved interface or a non-degenerate magnetic well, and in the vicinity of anharmonic Landau levels if the field has an isolated zero.

comments
26 pages, two figures. Amended: the main theorems and body of the paper remain unchanged; the revision added estimates, in the appendix, on the Tang-Zworski Theorem for energies near the threshold
fields
Mathematical Physics, Analysis of PDEs
pdf ↗ page arXiv:2604.17854 ↗

We address short-wave asymptotics for one class of quasi-linear second-order PDE systems involving the cross-diffusion described by the so-called Patlak-Keller-Segel law. It is common to employ these equations for modeling the predator-prey community with the prey-taxis, which means the interactions of two species of particles or cells through which the species called "predators" is capable of moving directionally while searching for the other species called "prey." However, we suppose the predators to be sensitive not to the prey density but to a cue produced by the prey. Additionally, the production of the cue is assumed to be sensitive to the intensity of an external field, which is independent of the community state. This is what we call the external signal. It can be due to the spatiotemporal inhomogeneity of the environment arising from natural or artificial reasons. We assume that the external signal takes a general short-wave form and construct a complete formal asymptotic expansion for the short-wave solutions (modulo solving a chain of the so-called slow systems) with no restrictions on the spatial dimension or kinetics of inter- or intra-specific reactions. Further, we apply the short-wave asymptotic to studying the stability or instability induced by the external signal following Kapitza's theory for the upside-down pendulum. Applying the general results to some special classes of external signals, we get examples of suppressing the taxical transport, examples of the robustness of the species equilibrium to the signal up to a very strong stabilization or, oppositely, destabilization and blurring the borderline in the parametric space between the areas of stability and instability of this equilibrium.

comments
34 pages, 2 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2604.20469 ↗

We derive first-order (in the stepsize) bounds on the bias in Wasserstein distances of the invariant measure of stochastic gradient kinetic Langevin dynamics with minimal assumptions on the stochastic gradient noise. These bounds sharpen existing non-asymptotic guarantees for stochastic-gradient MCMC methods and provide a quantitative resolution of a previously open problem on invariant measure accuracy. The main technical ingredients are new Gaussian convolution inequalities controlling the Wasserstein-$p$ distance between a Gaussian convolved with a mean-zero perturbation and the Gaussian itself. We anticipate that these inequalities will be of independent interest beyond the present application. To complement the theory, we illustrate the benefits of stochastic gradient sampling methods on a one-dimensional model, a Bayesian logistic regression example and a Bayesian random-effect model including comparison with pseudo-marginal MCMC methods.

comments
50 pages, 2 figures
fields
Numerical Analysis, Probability
pdf ↗ page arXiv:2604.24632 ↗

We study the root-averaged density of states for the Anderson model on the Bethe lattice in the strong-disorder regime. Here the density of states means the root-averaged spectral measure, not a finite-volume eigenvalue counting limit. We assume that the single-site distribution has compact support and has a locally analytic density on an interval $I^\sharp$ containing a given interval $I$. Combining the random-walk expansion on the tree with a complex-analytic argument for the single-site Stieltjes transforms, we prove that the scaled averaged diagonal resolvent has a holomorphic continuation to a complex neighborhood of $I$ for all sufficiently large $λ$. By the Stieltjes inversion formula, the root-averaged density of states measure is absolutely continuous on the scaled energy window $λI$, and its density is real analytic and has a finite-order strong-disorder expansion there. In the scaled form $E=λξ$, the leading coefficient is the local density of the single-site distribution. All odd coefficients vanish, and the higher coefficients are finite sums determined by occupation profiles of short closed walks on the tree. For the uniform single-site distribution, we compute the first nonzero correction term explicitly.

comments
19 pages, 1 figure
fields
Mathematical Physics
pdf ↗ page arXiv:2605.00478 ↗

We study expressibility in infinitary languages of the modal operators associated with satisfiability of sentences of these languages in submodels and extensions of models. We give a syntactic criterion for expressibility in finitary predicate languages, show that in many cases infinitary languages are closed under the operator associated with submodels, and that this is so in any language with a purely monadic signature. Finally, we prove that in finitary or strongly compact languages, the operator associated with extensions, though can be inexpressible by a single sentence, is always expressible by a universal theory, in striking contrast with the submodel case.

fields
Logic
pdf ↗ page arXiv:2605.02725 ↗

The rigorous stability analysis of high-order implicit-explicit linear multistep (IELM) methods for nonlinear parabolic equations by using discrete energy arguments is a long standing open issue due to their non-A-stability property. A novel semi-generating function approach combined with a global discrete energy analysis is suggested for the stability and convergence of general IELM methods in solving nonlinear parabolic equations. Inspired from the Grenander-Szegő theorem for Toeplitz matrices, the semi-generating function approach is used to handle the three groups of discrete coefficients via three complex polynomials on the unit circle. A unified theoretical framework is then presented to establish the unconditional stability of IELM methods if the minimum eigenvalue of composite convolution kernels for the implicit part is properly large and the spectral norm bound of composite convolution kernels for the explicit part is properly small. An indicator, called implicit-explicit controllability intensity, is then introduced to evaluate the degree of controllability of the implicit part over the explicit part. Some of the existing IELM methods, up to fifth-order time accuracy, are revisited and compared by computing the associated implicit-explicit controllability intensities such that one can choose an IELM method or proper parameter to maintain the unconditional stability for a specific nonlinear parabolic model. We also propose a new parameterized class of IELM methods, up to the ninth-order time accuracy, which satisfy the a priori settings of our theory and have a large value of the implicit-explicit controllability intensity by choosing a proper parameter so that they would be well suited for a wide class of nonlinear parabolic problems.

comments
41 pages, 3 tables, 33 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2605.05619 ↗

We propose an adaptive proximal gradient method for minimizing the sum of two functions, where one is a simple convex function, and the other belongs to one of the three classes: nonconvex smooth, convex nonsmooth, or convex smooth. The key feature of the method is an adaptive step size that accumulates historical gradient mapping norms in the denominator. Without any modification or knowledge of problem parameters, the method converges across all three problem classes under mild bounded-iterates and bounded-variance assumptions, with rates matching those of the proximal gradient method up to logarithmic factors, in both deterministic and stochastic settings. For the convex setting, we further propose an accelerated variant. It retains a similar near-optimal convergence rate for the nonsmooth case and achieves an improved rate of order $\widetilde{O}\big(1/t^2 + σ/\sqrt{t}\big)$ for the smooth case, which is optimal up to logarithmic factors. Notably, we develop new techniques for controlling the effect of stochastic noise, which are applicable across all three problem classes in the stochastic setting and enable a simplified analysis.

fields
Optimization and Control
pdf ↗ page arXiv:2605.05944 ↗

We study a stochastic optimal control problem for jump-diffusion systems whose drift coefficient is piecewise Lipschitz continuous and exhibits threshold-induced discontinuities. Such dynamics naturally arise in applications with intervention policies triggered by safety levels, notably in insurance surplus management with dividend payments and capital injections. These features place the problem outside the scope of classical stochastic maximum principle (SMP) results, which rely on global smoothness assumptions. We establish both necessary and sufficient optimality conditions for this class of control problems. Our approach combines a Sobolev-type representation of the first variation process with smooth approximations and Ekeland's variational principle. As application, we study an optimal premium adjustment and reserve management policies for an insurance whose surplus is modelled by threshold-based dividend and capital injection policies.

comments
34 pages, 3 figures
fields
Optimization and Control
pdf ↗ page arXiv:2605.06176 ↗

Policy-gradient methods need a scalar reward, yet for many tasks no formula captures what we want, while judging which of two outcomes is better is easy. We study reinforcement learning that receives only such comparisons - no reward function, no reward model - in multi-step tasks. Groups of trajectories start from a shared state, and each action is credited by how its reward-to-go compares with those of other trajectories at the same time step. We show the expected update is policy gradient with reward-to-go replaced by its win rate against the population still running at that time, weighted by the chance an opponent is still running; in deterministic environments the update ranks actions by true value and the optimal policy is stable, whereas under stochastic outcomes it prefers actions that win more often rather than those with higher mean. Label noise near ties or from position bias leaves the expected update unchanged; only noise that also flips clear comparisons halves the signal. A critic trained from the same comparisons removes the state confound without changing the expected update. In a pre-registered study over six environments with ten seeds per claim, comparisons cost no detectable performance relative to scalar returns at the same granularity, learning a reward model from the same comparisons is not better, and ten percent of comparisons suffice when spent on a few time points with all pairs. With real LLM judges, comparisons are 7-10 points more accurate than pointwise scores, and the gap grows with the stronger judge. Trained end-to-end with an LLM judge on a requirement the hand-written reward omits, policies satisfy it in all five seeds but land far less often than with oracle comparisons, because the judge is near chance on the near-tied failures dominating early training. Comparisons do not close the gap to PPO with scalar rewards on HalfCheetah.

fields
Statistics Theory
pdf ↗ page arXiv:2605.06375 ↗

A finite presentation < X | R > of a finite group is called `just finite' if removing any relation from R results in a presentation for an infinite group. It has been an open question (Kourovka Notebook, Problem 21.10) whether every finite group admits such a presentation. We resolve this conjecture in the affirmative.

comments
Significant assistance was provided by the AI co-mathematician tool developed by Google DeepMind. v2: 7 pages, incorporates referee's comments and improvements. Accepted by the Journal of Group Theory
fields
Group Theory
pdf ↗ page arXiv:2605.10402 ↗

Balanced and well-balanced subsets of the set of positive roots of compact Lie algebras arise naturally in problems related to Hermitian and spin geometry. In this paper we compute the maximal and minimal size of well-balanced subsets in all simple root systems.

comments
13 pages. v2: 14 pages, minor revisions
fields
Representation Theory, Combinatorics, Rings and Algebras
pdf ↗ page arXiv:2605.11219 ↗

The aim of these lecture notes, based on lectures given by the second author at the CIME school in Cetraro, is to illustrate a range of ideas surrounding higher Teichmuller spaces of Riemann surfaces with marked boundaries through explicit and computationally tractable examples. After reviewing the classical Teichmuller space of hyperbolic Riemann surfaces with boundary and its combinatorial description in terms of Thurston shear coordinates on a fat-graph, we explain how the bordered cusped Teichmuller space arises as a confluent limit when two boundary components in the Riemann surface collide via the so-called chewing-gum move giving rise to a candle cake. We then revisit these constructions from the Fock-Goncharov perspective, explaining snake calculus for transport matrices in PSL_n(R) and explain how the chewing gum move is the inverse of amalgamation. Rather than focusing on formal proofs, our goal is to illustrate the underlying theorems and constructions in a concrete and intuitive way.

comments
56 pages, 48 figures. Typos corrected
fields
Geometric Topology, Mathematical Physics
pdf ↗ page arXiv:2605.12572 ↗

We study Riemannian manifolds carrying a metric connection with parallel, skew-symmetric and closed torsion, which we call in short PSCT manifolds. We prove that PSCT manifolds always locally split into a product of well-understood factors, allowing a complete local classification. Further, we investigate various $G$-structures of PSCT type, with a focus on almost Hermitian structures and their possible Gray–Hervella classes.

comments
27 pages. v2: add/update citations
fields
Differential Geometry
pdf ↗ page arXiv:2605.13227 ↗

We explicitly describe the set of gaps and the Weierstrass semigroup at a totally ramified place of degree one on a generalized Kummer extension defined by the affine equation $y^m = f(x)$ over $K$, an algebraic extension of $\mathbb{F}_q$, where $f(x)\in K(x)$ and $K$ is not required to contain a primitive $m$-th root of unity. For the different totally ramified places of degree one, our description takes a unified form. Then we provide a necessary and sufficient condition for the Weierstrass semigroup at a totally ramified place of degree one to be symmetric. Furthermore, we investigate the minimal generating set of the Weierstrass semigroups at many totally ramified places of degree one. We not only explicitly describe the minimal generating set, but also provide functions whose coefficients of pole divisors lie in the minimal generating set. Finally, we apply our results to generalized Kummer extensions with the same multiplicities, as well as function fields of GGS curves and subcovers of the BM curve.

fields
Algebraic Geometry
pdf ↗ page arXiv:2605.14583 ↗

We prove that the maximum eigenvalue of the (both signed and unsigned) Laplacian of level $k$ Kikuchi graph of any graph $G$ with $m$ edges is at most $m+k$. This confirms four recent conjectures of Apte, Parekh, and Sud. As applications, we obtain that tensor products of one and two qubit product states achieve an approximation ratio of $5/8$ for Quantum Max Cut and $5/7$ for the XY Hamiltonian. Moreover, combining our bounds with the algorithms analyzed by Apte, Parekh, and Sud, yields efficient algorithms achieving an approximation ratio of $0.614$ for Quantum Max Cut and $0.674$ for the XY Hamiltonian. Finally, we also make modest progress on Brouwer's conjecture and improve Lew's bound on the sum of the top-$k$ eigenvalues of a Graph Laplacian.

comments
Addressed reviewer comments and fixed typos
fields
Combinatorics
pdf ↗ page arXiv:2605.14994 ↗

We study two new parameters for finite posets motivated by the problem of efficiently determining the set of successors of a given element. A plane map of a poset $P=(X,\leq)$ is an injective mapping of $X$ into the Cartesian plane $\mathbb{R}^2$. Given two different points $a$ and $b$ in the plane, we say that $b$ dominates $a$ if $a<b$ coordinatewise. We say that an element $x$ of $P$ is tight in a plane map $μ$ if the following holds: $x<y$ in $P$ if and only if $μ(y)$ dominates $μ(x)$. Note that, by definition, every 2-dimensional poset admits a map such that every element of the poset is tight. For any poset $P$, we define the mapability of $P$, $\mathrm{dmap}(P)$, to be the maximum number of elements that are tight in a single map, and we define the atlas thickness of $P$, $\mathrm{at}(P)$, to be the size of the smallest collection of maps such that every element is tight in at least one map of the collection. We relate these parameters to the classical notions of dimension and width: for every poset $P$, we show that $\mathrm{dim}(P) \le 2\mathrm{at}(P) \le \mathrm{width}(P)+1$. On the other hand, there exists a sequence of posets $(P_n)_{n \ge 1}$ such that the atlas thickness of $P_n$ is doubly exponential in the dimension of $P_n$. On the computational side, we prove that it is NP-complete, for a given poset $P$, to compute the mapability of $P$ and to decide whether $\mathrm{at}(P) \le 2$. In contrast to the latter, we show that computing the mapability of a poset is fixed-parameter tractable with respect to the natural parameter.

comments
Has appeared in Proc. 34th International Symposium on Graph Drawing and Network Visualization
fields
Combinatorics
pdf ↗ page arXiv:2605.20877 ↗

We study the problem of sampling weighted partial triangulations of a convex polygon with $n+2$ sides. We consider the distribution $π_{n,λ}$ under which each partial triangulation $σ$ is assigned probability proportional to $λ^{|σ|}$, where $λ>0$ is a model parameter and $|σ| \in \{0,\dots,n-1\}$ denotes the number of diagonals in $σ$. This model belongs to a broad class of weighted geometric partition problems that include lattice triangulations and dyadic tilings, and is closely related to several classical combinatorial structures, including the full triangulations of a convex polygon and the associated Catalan structures. Our main result is a simple exact sampling algorithm for $π_{n,λ}$ with expected running time $O\big((\min\{n,n\sqrtλ\}+1)\log n\big)$, which is optimal up to the logarithmic factor.

fields
Combinatorics
pdf ↗ page arXiv:2605.21921 ↗

This paper addresses the challenge of obtaining strong optimality guarantees in constrained nonsmooth nonconvex optimization under mild regularity conditions, namely local Lipschitz continuity and existence of directional derivatives. While standard methods typically ensure weak stationarity notions, achieving directional (d-)stationarity remains nontrivial. We show that a random direction exploration step is sufficient to attain d-stationarity. The proposed approach augments any feasible base method with one additional randomized exploration step per iteration, which samples a direction and step size and accepts the candidate based on a function value comparison. The resulting scheme guarantees that all accumulation points are d-stationary almost surely, independently of the behavior of the underlying method. Moreover, under conditions on the base method, it preserves convergence rates of the base method, as established for the difference-of-convex algorithm (DCA), prox-linear-type schemes, and interpolated normalized gradient descent (INGD). The theoretical results are complemented by numerical experiments illustrating the effect and guarantees of the exploration step.

fields
Optimization and Control
pdf ↗ page arXiv:2605.22045 ↗

Clifford codes are a natural generalization of quantum stabilizer codes based primarily on representation theory. This class of codes has previously been extended to the setting of quantum subsystem codes. We formulate a two-fold generalization of Clifford codes, for both the hybrid classical and quantum information and projective representation theory settings. This leads to new classes of hybrid subspace and subsystem Clifford codes. We extend the fundamental representation theoretic quantum error correction theorem to include these codes, based on the operator algebra quantum error correction framework. We also discuss several examples throughout the presentation, of both stabilizer and non-stabilizer type.

comments
Updated to final version to appear in Journal of Physics A: Mathematical and Theoretical
fields
Operator Algebras, Representation Theory
pdf ↗ page arXiv:2606.02531 ↗

We introduce a class of continuous time finite horizon mean field games where the objective function of the representative player depends on a hidden state, in addition to position, control, and the population distribution. While acting on the position dynamics, the agent has the option to pay for seeing the hidden state. We connect the original formulation of our model with a mean field model of optimal control with discretionary stopping, characterize solutions, and give a simple explicitly solvable example. For a class of $N$-player games with compatible information structure, we show that approximate Nash equilibria can be constructed starting from a solution to the limit model.

fields
Optimization and Control, Probability
pdf ↗ page arXiv:2606.09784 ↗

We propose a model for evaluating the performance of wireless communication networks beyond the ubiquitous full-buffer assumption, under which every transmitter is always active. The network is represented by N interacting queues arranged on a torus, with homogeneous arrival rate and service rates depending on the activity of neighboring interferers. More precisely, each queue is associated with a transmitter-receiver pair, and its service rate is given by the Shannon capacity, which depends on the corresponding Signal-to-Interference-plus-Noise Ratio (SINR). Since interfering transmitters only emit when their queue is non-empty, the SINR, and hence the service rate, improves when neighboring queues are empty. We first derive the stability region of the system. To investigate the stationary regime, we introduce two mean-field approximations. The first one is obtained from a finite K-replica system, for which we prove propagation of chaos as K goes to infinity. The second one describes a queueing system evolving in a suitably chosen environment. We derive quantitative estimates comparing these two approximations. Finally, we prove that the original interacting queueing system converges exponentially fast to stationarity.

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

Several useful concepts of almost frames or Riesz bases of Hilbert spaces gave us the motivation to review the theory of C*-module frames and C*-module Riesz bases for Hilbert C*-modules, searching for similar useful structures. We give a survey of the background in C*-module frame theory, summarizing and particularly extending or correcting earlier results. The concepts of near-Riesz bases, pseudo-frames, pseudo-Riesz sequences, and pseudo Riesz bases of Hilbert C*-modules are introduced and equivalently related to (semi-)C*-Fredholm properties of their synthesis operators. The notion of the excess of a C*-module frame is introduced, taking values in related C* algebras. Indicators for possible erasures of frame elements are described with the aim to preserve robustness of frames. Introducing a new notion of pseudo-Riesz-Weyl sequences in the standard Hilbert C*-module $l_2(A)$ we reverse the found correspondence by assuming the associated synthesis operator of a Bessel sequence to be (upper semi-)C*-Weyl. Furthermore, we deduce from the invariance of (upper semi-)C*-Fredholm and C*-Riesz-Weyl properties of synthesis operators with respect to ''compact'' perturbations the perturbation invariance of the respective classes of module Bessel sequences.

comments
We joined two further sections from the first version and worked on the presentation of the content, adding explanations, historical remarks and references. [The first two versions are still available on the arxiv.]
fields
Functional Analysis
pdf ↗ page arXiv:2606.16597 ↗

We study the Samuelson area condition for planar Lagrangian \(2\)-webs formed by tangent lines. For the tangent line family \(L_t:y=tx+h(t)\), where \(h\) is smooth and \(h''\neq0\), let \(Ψ(u,v)=L_u\cap L_v\) for \(u\neq v\), and let \(J_Ψ\) be its Jacobian. Domitrz and Zubilewicz (2024) proved that these webs do not satisfy the Samuelson condition. We study the Jacobian as the two tangents coalesce. In web coordinates, the Samuelson condition is equivalent to \(\partial_u\partial_v\log|J_Ψ|=0\). We show that \(J_Ψ\) has a simple zero along \(u=v\) and that \[ \partial_u\partial_v\log|J_Ψ(u,v)| =\frac{1}{(v-u)^2}+R_h(u,v), \] where \(R_h\) extends smoothly across the diagonal. The double pole therefore prevents the Samuelson condition from holding near the envelope. We also give a direct local proof of this failure for webs formed by two separated smooth line families with varying slopes.

comments
12 pages, 1 figure. Revised to clarify the relation to the work of Domitrz and Zubilewicz (2023, 2024) and to include a smooth local proof for separated line families
fields
Differential Geometry
pdf ↗ page arXiv:2606.22260 ↗

At the core of most socio-technical systems lies a scarce resource that is allocated among agents: highway lanes, public transit, road space, water rights, energy access, grid capacity, user attention, pollution rights, etc. With further automation of the underlying allocation processes, control engineers are increasingly tasked with making decisive assumptions regarding what society wants. In practice to date, design choices are largely driven by industry norms and conventions rather than a result of conscientiously responsible and ethical design. In this paper, we look at tools available to control engineers to design systems in a more principled manner in order to match the societal mandate. We consider three control design paradigms: online feedback optimization, control of Markov decision processes, and model predictive control. Beginning with aggregating individual agents' preferences into control design objectives, subsequently ensuring and certifying the fulfillment of those specifications, we argue that the feedback nature of control systems enables appropriate allocation of the shared resources in ways hitherto unparalleled.

fields
Optimization and Control
pdf ↗ page arXiv:2606.23931 ↗

Covariate selection in Generalized Linear Models (GLMs) is a fundamental problem in statistics, as including irrelevant predictors might lead to overfitting and poor interpretability, while omitting relevant ones might result in biased estimates. Most Bayesian approaches to variable selection -- including spike-and-slab priors and continuous shrinkage priors -- have key limitations, e.g., (i) are based on non fully conjugate formulations, (ii) are restricted to a linear model, or (iii) lack posterior consistency guarantees for the variable selection procedure and model parameters. In this work, we propose a fully Bayesian hierarchical and conjugate framework for covariate selection in GLMs, applicable to any distribution in the exponential family, based on modeling a binary inclusion indicator that directly encodes covariate inclusion in the linear predictor. In our approach, variable selection and parameter estimation are performed simultaneously, incorporating both sources of uncertainty in posterior inference. Consequently, our methodology provides a valid post-model Bayesian selection procedure. We present theoretical guarantees of the proposed fully conjugate Bayesian variable selection for GLMs, establishing posterior consistency of both the inclusion indicators and the active regression coefficients. We derive an efficient Gibbs Sampling algorithm with a corresponding R package implementation. We validate the proposed method on synthetic and real-world datasets, demonstrating competitive predictive and inferential performance.

comments
New introduction, reorganization of numerical results, and minor changes to the Proof of Theorem 1 (Section B - Supplementary material). 27 pages (without Supplementary Material)
fields
Statistics Theory
pdf ↗ page arXiv:2606.24357 ↗

We introduce $n$-almost symmetric Datalog and study $n$-almost symmetric linear arc monadic Datalog. We characterize the finite relational structures whose constraint satisfaction problem is solved by this Datalog fragment as those that can be primitive positively constructed from the transitive tournament on $n+2$ vertices. We also give characterizations in terms of a certain homomorphism duality (which we call $n$-fixed unfolded caterpillar duality) and in universal-algebraic terms (the existence of $k$-absorptive operations and of operations forming an elevator chain of length $n+1$). This article generalizes the results from Bodirsky and Starke about symmetric linear arc monadic Datalog.

fields
Rings and Algebras
pdf ↗ page arXiv:2606.24711 ↗

In [8], a non-Archimedean analogue of the space of translation-invariant even valuations on convex sets was introduced. In [7], motivated by a further analogy with the classical theory, this space was equipped with two multiplicative structures, the product and the convolution. Both structures satisfy Poincare duality and the (non-mixed) hard Lefschetz theorem. In this paper, we formulate a conjecture concerning a more general mixed versions of the hard Lefschetz theorem and the Hodge-Riemann relations. We prove the non-mixed Hodge-Riemann relations in degree 1 for the product and, equivalently, in codegree 1 for the convolution.

comments
40 pages; details added; other minor changes
fields
Metric Geometry
pdf ↗ page arXiv:2606.25641 ↗

There has been significant recent progress in algorithms for approximation of Nash equilibrium in large two-player zero-sum imperfect-information games and exact computation of Nash equilibrium in multiplayer strategic-form games. While counterfactual regret minimization and fictitious play are scalable to large games and have convergence guarantees in two-player zero-sum games, they do not guarantee convergence to Nash equilibrium in multiplayer games. Recently, an approach has been presented for exact computation of Nash equilibrium in multiplayer imperfect-information games that solves a quadratically constrained program based on a nonlinear complementarity problem formulation derived from the sequence-form game representation. This formulation was solved using Gurobi's nonconvex quadratic solver, which employs spatial branch-and-bound to iteratively refine variable bounds by solving convex relaxations of bilinear terms. During presolve, Gurobi introduces auxiliary variables and, in some cases, binary variables, leading to an internal mixed-integer quadratically constrained program. This approach was demonstrated to outperform prior algorithms from the Gambit software suite and quickly solve three-player Kuhn poker after removal of dominated actions; however, the algorithm was not able to solve the full version of the game within 24 hours. In this paper, we derive finite bounds on slack and multiplier variables in the nonlinear complementarity formulation. These bounds can strengthen the convex relaxations used within spatial branch-and-bound. We compare uniform corollary bounds with finer proposition-based bounds on full three-player Kuhn poker. All eight bounded configurations return numerically verified equilibria in under 17 seconds, while the unbounded formulation finds no feasible solution within 300 seconds. The finest bounds do not consistently yield the fastest computation.

comments
arXiv admin note: substantial text overlap with arXiv:2509.25618
fields
Optimization and Control
pdf ↗ page arXiv:2606.25997 ↗

Temporal (or time-evolving) networks provide a natural framework for modeling complex systems with time-dependent interactions, where understanding the evolution of community structures is a central challenge. While random walk-based approaches to community detection in static networks are well established through the spectral analysis of associated transfer operators, extending these ideas to temporal networks is nontrivial due to the inherent time-dependence of the underlying dynamics. In this work, we develop a general framework for community detection in temporal networks that is based on multi-view canonical correlation analysis (mCCA). We show that the proposed formulation admits a spectral characterization via a time-reversible random walk on an augmented space-time network, providing a clear dynamical interpretation of temporal communities as metastable structures of the process. Furthermore, we analyze key spectral properties of the resulting transfer operators and the interplay between spatial and temporal effects, which allows us to distinguish between structural features and artifacts induced by the snapshot coupling. Finally, we derive a reduced-order model, which preserves the essential spectral properties while significantly improving computational efficiency. We show that the proposed approach effectively detects communities in temporal networks and captures their evolution.

journal
Journal of Physics: Complexity, Volume 7, Number 4, 045008 (2026)
fields
Dynamical Systems
pdf ↗ page arXiv:2606.27850 ↗

Many combinatorial designs ask for equal distribution of given symbols across the entries of a matrix. The paramount examples are Latin squares, where each symbol from $\{1,\dots,n\}$ appears once per row and column of an $n\times n$ matrix. Frequency rectangles extend this to $λn \times μn$ matrices with repeated symbols under controlled column and row frequencies. In this more general setting, we examine structural properties of pairwise reflection-symmetry, which requires that, on every pair of columns, each ordered symbol pair $(p,q)$ occurs as often as its reversal $(q,p)$. This order-balance is precisely what makes head-to-head comparisons unbiased, i.e., no symbol gains a systematic advantage from the position it occupies relative to another, a fairness demand arising for instance when scheduling tournaments or laying out comparative trials. Existence of such objects for odd $λ$ turns out to be remarkably more subtle than for even $λ$. After showing that existence holds also for sufficiently large odd $λ$, we initiate the search for the smallest possible value of $λ$ in this setting. We obtain the insight that a per-column multiplicity of $λ=1$ can be achieved if and only if $n$ is a power of two. We complement the existence results with a direct product construction and add several further observations on the property. Finally, we propose and evaluate a quadratically constrained integer program to computationally search for these objects. The resulting experiments reveal that many of them possess an underlying group-theoretic structure which, as we conjecture, may even be unavoidable in certain settings.

comments
18 pages, 2 figures; Julia source code provided as ancillary file
fields
Combinatorics
pdf ↗ page arXiv:2606.28315 ↗

In this paper, we establish several finiteness and boundedness theorems for compact positive monotone symplectic manifolds endowed with special Hamiltonian actions, called GKM$_3$, which generalize smooth toric varieties. Specifically, we prove that, for fixed dimension and Euler characteristic, there are only finitely many complex cobordism classes of such spaces. Moreover, modulo lattice transformations, the moment map image can be embedded into a box of explicitly bounded size, and all Chern numbers satisfy quantitative bounds. In particular, this yields a bound on the volume of the underlying symplectic manifold, analogous to the one obtained by Kollár-Miyaoka-Mori for Fano varieties. As a byproduct of our results, we also obtain that there are finitely many combinatorially maximal, labeled, reflexive GKM$_3$ graphs of valency $n$ and with $χ$ vertices.

comments
41 pages. Improved explicit bound on the moment map box (Thm. B, Cor. 4.15, Rem. 4.16, Cor. 1.7); new Prop. 3.7, Cor. 3.8 and Prop. 5.7 giving chi-independent bounds under unimodality of Betti numbers and large index; expanded introduction, references updated
fields
Symplectic Geometry
pdf ↗ page arXiv:2606.28768 ↗

Endo-Pajitnov manifolds are compact non-Kähler manifolds which generalize the Inoue surfaces $S_M$ to higher dimensions. In this paper, we compute their Dolbeault cohomology, show that they satisfy the Hodge decomposition at the level of dimensions and prove that they are rigid with respect to small deformations.

comments
12 pages; v2: added Section 5, replaced some details of the main proof, fixed small errors
fields
Differential Geometry
pdf ↗ page arXiv:2606.29408 ↗

In this paper, we show that for any $S$-unimodal map $T$ on $[0,1]$ with a non-flat critical point the Lyapunov exponent exists for Lebesgue almost every point and is equal to a constant $λ_T$. Moreover, $λ_T=0$ if and only if $T$ admits neither an absolutely continuous $T$-invariant probability measure with positive entropy nor a strictly stable periodic orbit. Consequently, if an $S$-unimodal map with a non-flat critical point is infinitely renormalizable or non-statistical then for Lebesgue almost every $x\in [0,1]$ the Lyapunov exponent along the orbit of $x$ exists and is equal to $0$. A key ingredient is the following result of independent interest. If an $S$-unimodal map with a non-flat critical point has no periodic attractor then for Lebesgue almost every $x\in [0,1]$ the lower Lyapunov exponent along the orbit of $x$ is non-negative. This shows that, in the absence of periodic attractors, exponential contraction cannot occur along the orbit of Lebesgue almost every point.

comments
26 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2607.04187 ↗

We investigate two-dimensional steady subsonic Euler flows with a contact discontinuity in infinitely long nozzles. An Euler–Lagrange transformation reduces the problem to a scalar quasilinear elliptic equation in divergence form on a fixed strip, with discontinuous coefficients and the contact discontinuity conditions incorporated into the weak formulation. By solving this elliptic problem, we establish existence, uniqueness, and regularity of the flow on the maximal interval of wall amplitudes containing the straight-nozzle configuration. These results apply to general piecewise smooth subsonic upstream data and dispense entirely with the monotonicity, convexity, and small-perturbation assumptions imposed in earlier studies. In particular, the contact discontinuity curve is of class $C^{2,α}$. We further investigate the downstream asymptotic behavior and show, under the corresponding decay assumptions on the nozzle walls, that the convergence rate of the flow matches that of the walls.

fields
Analysis of PDEs
pdf ↗ page arXiv:2607.04804 ↗

We prove that for every Cayley graph $\mathcal{G}$ over any finite abelian group $G$, there is a weighted Cayley graph with $O(\log |G|)$ generators that is a spectral sparsifier for $\mathcal{G}$. This bound is optimal. Applying our bound to the group $G = \mathbb{F}_2^n$, yields, as a corollary, $O(n/\varepsilon^2)$-sized code sparsifiers for $\mathbb{F}_2$-linear codes, improving on the work of Khanna, Putterman and Sudan (SODA'24) who obtained a similar result with an additional $\mathrm{polylog}(n)$ loss. Our proof is strongly inspired by a recent work of Reis and Rothvoss for the construction of $\ell_1$-sparsifiers. Following their work, the abelian Cayley sparsification problem can be reduced to establishing a lower bound for the volume of a certain natural convex body. This volume bound follows from a short, elementary argument that relies on character symmetry.

comments
Minor typos fixed
fields
Combinatorics
pdf ↗ page arXiv:2607.08261 ↗

We study causal inference under outcome interference for sequential, observational settings. Specifically, we consider settings where the binary outcomes over N units are Markovian across T time steps. At each time step, the outcomes of N units have dependencies captured through an Ising model; each outcome is also impacted through an external field capturing the effects of its treatment as well as latent confounders. Similar to panel data literature, these latent confounders are modeled to have a low-rank factor structure. Our data is a single sample from this high-dimensional distribution. To estimate causal quantities of interest, we provide a computationally efficient method based on Maximum Pseudo-Likelihood Estimation (MPLE) for learning the model parameters. Under mild assumptions, we establish non-asymptotic consistency for parameter estimation and show this translates to faithful estimation of causal quantities of interest after sampling from the learned model. We demonstrate the efficacy of the method through synthetic experiments as well as a real-world case-study investigating causal effects of vaccine rates on COVID-19 death rates within US counties nationwide.

comments
Camera-ready version accepted at NeurIPS 2026
fields
Probability
pdf ↗ page arXiv:2607.14940 ↗

We extend the Pila-Zannier strategy to Drinfeld modules: we prove analogues of the Manin-Mumford theorem for a product of two Drinfeld modules of equal rank, and of the André-Oort theorem for a product of two Drinfeld modular curves. In characteristic zero, several steps of this strategy rest on $o$-minimality, which has no counterpart over a function field; we replace the counting step by the rigid analytic Pila-Wilkie theorem of Binyamini-Kato, and this appears to be its first arithmetic application. The functional transcendence input, namely an analogue of the Ax-Lindemann theorem in both settings, is established here by an independent point counting argument.

comments
minor technical corrections
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2607.19952 ↗

We discuss the question of when a homology or cohomology class with twisted integer coefficients of a manifold $X$ is realised by a submanifold. While this question is classical in nature, providing an answer requires relatively modern techniques from parametrised homotopy theory. More specifically, we introduce cobordism classes twisted by a coefficient system and then define a twisted Thom space $\operatorname{M^\mathrm{tw}O}(n)$ over $\operatorname{BO}(1)$, which serves as the classifying object for this cobordism theory under a twisted Pontryagin-Thom construction. As a result, a twisted homology class is realisable if and only if its Poincaré dual is the image of the twisted Thom class in $\operatorname{M^\mathrm{tw}O}(n)$ under a parametrised map $X \to \operatorname{M^\mathrm{tw}O}(n)$ over $\operatorname{BO}(1)$. By showing that $\operatorname{M^\mathrm{tw}O}(n)$ is parametrised homotopy equivalent to the unbased homotopy orbits of $\operatorname{MSO}(n)$ under the orientation-reversing involution, we are able to construct its parametrised Postnikov tower to derive obstructions to realisability. We conclude by giving the first known examples of non-realisable integer homology classes in non-orientable manifolds.

comments
more details appear in the thesis of the second author; comments are welcome
fields
Algebraic Topology, Geometric Topology
pdf ↗ page arXiv:2607.24462 ↗

The problem of finding lower and upper bounds on multivariate homogeneous polynomials is both difficult and important given its applications to questions ranging from dynamical stability in complex potential landscapes to data analysis. From the standpoint of tensor eigenvalue theory, the question is equivalent to finding the smallest and the largest eigenvalues of the coefficient tensor corresponding to the given polynomial. Standard approaches outlined in the literature amount to running nonlinear iterations in search for the optimal rays along which the growth of the polynomial is fastest or slowest. Unlike the case of matrices (or their corresponding multivariate quadratic forms) convergence of such algorithms for higher-rank tensors is capricious due to the complex topography of polynomial objective functions. In this essay, a very different strategy, inspired by quantum-mechanical variational methods, is introduced for finding bounds on polynomials. The original polynomial is replaced by an operator acting in a suitably chosen (large) space of states, such that in an appropriate "classical" limit this operator approaches the original polynomial expression made of commutative variables. As a result, approximating the smallest and largest eigenvalues of the coefficient tensor, and thus finding bounds on polynomials, amounts to diagonalizing the resulting quantum operator, represented as a large matrix, and then inspecting the smallest and largest eigenvalues of this matrix. This approach is then successfully applied to standard test examples from tensor eigenvalue literature and other problems of interest in mathematical physics including Strichartz-type inequalities.

comments
v3: expanded version, accepted for publication
fields
Mathematical Physics, Analysis of PDEs, Numerical Analysis
pdf ↗ page arXiv:2607.25445 ↗

We continue the study of Phase Retrieval in the Quantum Information setting in the style of \cite{liu2023phase}, in a manner which is more general in two primary ways: (a) Instead of only pure states we consider also states (and positive semidefinite operators) of bounded rank, as is done in Quantum Tomography; (b) We consider general super operators instead of only quantum channels. We show that in order to have phase retrieval with respect to positive semidefinite operators of bounded rank, it suffices to discriminate between perfectly distinguishable pairs (i.e. those with orthogonal supports). From this we prove that phase retrievability is always Lipschitz stable with respect to the trace norm, and then we use the Fuchs-van de Graaf inequalities to deduce stability with respect to the Bures–Wasserstein distance (thus generalizing the known stability results for phase retrieval in Frame Theory). For Hermitian-preserving super operators taking values in block-diagonal matrices, we characterize phase retrievability in terms of conditions inspired by the classical complement property from Frame Theory.

comments
31 pages
fields
Functional Analysis
pdf ↗ page arXiv:2607.26474 ↗

The most general class of multipoint inhomogeneous boundary-value problems for systems of linear ordinary differential equations of arbitrary order $r\geq 1$ is investigated, whose solutions belong to a given Sobolev space $W_p^{n+r}$, where $n\geq 0$ and $1\leq p\leq \infty$. The boundary conditions in these problems contain Caputo derivatives of fractional or integer orders, which may exceed the order of the differential system equations. Constructive sufficient conditions are established under which the solutions of these problems are continuous with respect to a parameter from an abstract metric space in the Sobolev space $W_p^{n+r}$.

comments
This manuscript has been published in the Complex Analysis and Operator Theory journal
journal
Complex Anal. Oper. Theory 20 (2026), Paper No. 173, 14 pp
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2607.28267 ↗

The fundamental groups of compact 3-manifolds are known to be residually finite. Feng Luo conjectured that a stronger statement is true, by only allowing finite groups of the form $\mathrm{PGL}(2,R)$, where $R$ is a finite commutative ring. In earlier work, this conjecture was disproven in full generality. The conjecture arose in the context of orientable connected compact 3-manifolds which are geometrizable. By constructing explicit faithful linear representations using rings with nilpotent elements, we demonstrate that the conjecture holds for six of the eight Thurston model geometries, namely all but $\mathbb{S}^3$ and $\widetilde{\mathrm{SL}_2}$. In the case of $\mathbb{S}^3$, the conjecture holds if we replace $\mathrm{PGL}(2,R)$ with $\mathrm{GL}(2,R)$. A spherical counterexample for the projective variant is the Poincaré homology sphere $Σ(2,3,5)$. In the case of $\widetilde{\mathrm{SL}_2}$, the conjecture fails to hold for both the projective and non-projective variants; a counterexample is provided by the Brieskorn sphere $Σ(2,3,7)$.

comments
18 pages
fields
Geometric Topology
pdf ↗ page arXiv:2608.01532 ↗

We study sets of (measurable) returns in countable groups $G$, namely sets of the form $\{g\in G:μ(A\cap T_gA)>0\}$ arising from measure-preserving actions. Extending a result of Bergelson, we show that sets of returns in $G\times G$ contain subsets of the form $B\times B$, where $B$ is large with respect to suitable notions of largeness that remain meaningful even for non-amenable groups. As a consequence, if $G$ is amenable, then every sufficiently large subset $A\subseteq G\times G$ satisfies $B\times B\subseteq AA^{-1}$ for some large set $B\subseteq G$. We also investigate when sets of returns in $G$ contain product sets $BB$ with $B$ large. In contrast with the Cartesian-product phenomenon above, this problem is considerably subtler in non-abelian groups and is closely connected to `symmetric correlation functions', namely functions of the form $g\mapsto μ(T_g^{-1}A\cap T_gA)$. We use this connection to show that, for broad classes of amenable groups - including finitely generated nilpotent groups and certain solvable non-nilpotent groups, every sufficiently large set $A\subseteq G$ contains a large subset $B$ satisfying $BB\subseteq AA^{-1}$. Finally, we establish polynomial analogues of these results for finitely generated nilpotent groups, extending earlier work of Bergelson and Ruzsa.

comments
A gap in the proof of positivity of square averages in finitely generated nilpotent groups was fixed, and the appendix answers a question posed in an earlier version of the article
fields
Dynamical Systems, Combinatorics, Group Theory
pdf ↗ page arXiv:2608.02873 ↗

We prove here several tightness results for such quantum inequalities as 1) the comparison of operator norm and product norm of $d$-local hamiltonians, 2) Bohnenblust–Hille inequality for $d$-local hamiltonians, 3) for quantum Fourier entropy-influence conjecture. We give a deterministic prove of the sharpness of Bohnenblust–Hille exponent. We also discuss the quantum Aaronson–Ambainis conjecture in a special case of anti-commuting Pauli strings.

comments
28 pages, several typos were corrected
fields
Analysis of PDEs
pdf ↗ page arXiv:2608.04411 ↗

In this paper we discuss the historical role played by Prof. Giovanni Giorgi (1871-1950) in the development of operational methods in mathematical physics. In the literature, the analysis of the scientific contributions of Giorgi is discussed in many historical papers mainly about the $MKSΩ$-system and its contributions in the field of electrical engineering. Starting from the obituary written by Prof. Dario Graffi (1905-1990), here we analyze in detail the contributions given by Giorgi in mathematical physics, especially in the framework of the studies started by Heaviside (1850-1925) in order to obtain a symbolic representation of the solutions of differential equations emerging in physical problems. \\ Moreover, we underline the little known contribution of Giorgi to the analysis of derivatives of any real order, namely fractional derivatives, according to the present notation. \\ The main aim of this note is to underline the historical relevance of Giorgi in the mathematical foundations of operational methods in relation to the solutions of concrete problems emerging in applied physics.

fields
History and Overview
pdf ↗ page arXiv:2608.15575 ↗

In classical information theory, a source is modeled by a single, precisely known probability distribution. However, in the increasingly complex communication networks full of unanticipated, nonstationary, and heterogeneous random events, the assumption of precise and well-defined probability distributions to describe random variables appears somewhat idealized. Therefore, it is important to characterize the uncertainty of distributions of source messages, subject to relaxing the assumption of deterministic probability models for analyzing information sources in information theory. Based on the nonlinear expectation theory, a novel axiomatical system that extends classical probability theory, this paper investigates the information sources whose distributions themselves are uncertain, and refers to them as uncertain-distribution sources. We generalize the fundamental concept information entropy to nonlinear information entropy, which describes the measurement of the amount of information contained in a uncertain-distribution source. By using the strong law of large numbers under sublinear expectation, we establish a nonlinear source coding theorem, which not only shows that the nonlinear information entropy is the upper bound for the infimum of achievable coding rate of uncertain-distribution sources under the maximum error probability criterion, but also determines a cluster point of the coding rate of uncertain-distribution sources under the minimum error probability criterion. Our findings reveal that the introduction of nonlinear expectation theory allows for a more comprehensive understanding of information sources.

comments
6 pages, 2 figures
fields
Information Theory
pdf ↗ page arXiv:2608.16543 ↗

We consider a fundamental problem of \emph{mixedness testing}: Given $n$ copies of an $N$-qubit state $ρ$, determine whether $ρ= \mathbb{I}_d/d$ or $\|ρ-\mathbb{I}_d/d\|_1 \geq \varepsilon$ with high probability, where $d = 2^N$. In particular, we focus on performing this task with simple single-qubit measurements, i.e. measurements that are prepared independently on each qubit. We provide a nearly complete picture of single-qubit mixedness testing by showing that its copy-complexity is $\tildeΘ\left(\sqrt{10}^N/\varepsilon^2\right)$. To establish our lower bound, we introduce a new measurement-dependent lower bound framework for adaptive single-copy state certification. For the upper bound, we present a randomized Pauli basis measurement protocol, which relies on a new primitive for computationally efficient uniformity testing of correlation-concentrated distributions on the Boolean hypercube. In conjunction, we provide lower and upper bounds for mixedness testing with fixed Pauli measurement protocols.

comments
Added determinstic Pauli mixedness testing results, fixed typos
fields
Information Theory
pdf ↗ page arXiv:2608.18839 ↗

Quadratic moment-based quasi-posteriors depend on a weighting matrix governing both the contributions of moment conditions and the scale of posterior uncertainty. We propose curvature-calibrated quasi-Bayesian (CCQB) updating, which iteratively evaluates the inverse of the estimated moment covariance (or long-run covariance) at the center of the resulting fixed-weight quasi-posterior. A two-part stopping rule monitors changes in the center and Monte Carlo error in estimating it. Under local regularity conditions, the ideal calibration map is contractive, and its fixed point is root-N consistent. The calibrated quasi-posterior and the sampling distribution of its center have the inverse Godambe information matrix as their root-N-scale covariance. Simulations show substantial gains over identity weighting. Further iteration has little effect in linear designs but improves calibration for some parameters in nonlinear settings, although nominal coverage is not uniformly achieved. An application to longitudinal childhood wheeze data illustrates the method under within-subject dependence.

fields
Statistics Theory
pdf ↗ page arXiv:2608.19634 ↗

In this paper, we establish a necessary and sufficient criterion for a finite-dimensional semisimple algebra over an algebraically closed field of characteristic $0$ to admit a regular quantum commutative decomposition. We apply this characterization to group algebras and show that a finite group algebra admits such a decomposition if and only if the underlying group is a peak group, that is, a finite group whose irreducible character degrees have a greatest element with respect to divisibility. We investigate the structure of peak groups and establish several criteria for their solvability in terms of the prime divisors of their largest irreducible character degree. In particular, we show that several important classes of groups are peak groups, while supersolvability alone does not imply the peak property. Finally, we show how to construct a peak group from any finite group.

comments
14 pages
fields
Rings and Algebras
pdf ↗ page arXiv:2608.21936 ↗

Let $Ω\subset\mathbb C$ be a bounded John domain and set $δ(z)=\text{dist}(z,\partialΩ)$. For $1<p<\infty$ and $α>\text{dim}_A(\partialΩ)-2$, we establish a norm equivalence between $\int_Ω|g|^pδ^α\,dA$ and $\int_Ω|g'|^pδ^{α+p}\,dA$ for analytic functions $g$ on $Ω$, with a point-evaluation term fixing the additive constant. The estimate of the derivative term is local and holds on every proper planar domain, whereas the converse follows from a distance-weighted Poincaré inequality on John domains. Taking $α=mp-2$ yields the corresponding comparison between the $m$-th and $(m+1)$-st derivatives. For $m\ge2$ the boundary-dimension condition is automatic, so the only dimension-sensitive case is the comparison between $\int_Ω|f'|^pδ^{p-2}\,dA$ and $\int_Ω|f''|^pδ^{2p-2}\,dA$ when $1<p<2$. We show that this restriction is sharp within the class of quasidisks by using self-similar Rohde snowflakes. We also construct, for every $s>1$, an inward-cusp $s$-John domain on which the comparison fails, showing that the ordinary John condition cannot in general be weakened.

comments
15 pages, 2 figures
fields
Complex Variables, Functional Analysis
pdf ↗ page arXiv:2608.23940 ↗

Explicit sequences of forms with the Hilbert series predicted by Fröberg's conjecture are difficult to construct beyond the almost complete intersection case. Over a field of characteristic zero, we prove that six forms of degree $d\ge4$ in four variables cannot have the predicted series if each is divisible by a power of a linear form with exponent at least $(15d+91)/16$. A power of the product of six quadric cones gives a nonzero element of the inverse system in a degree where the predicted series vanishes. This obstruction implies that every fixed-order Taylor truncation of the homogeneous Rogers–Szegő polynomial at $q=1$ fails to complete five powers of linear forms to the predicted series in all sufficiently large degrees. As a fixed-degree counterpart, we use exact certificates to prove the conjecture for any number of general quintics or septics; together with known results, this establishes the equal-degree conjecture in four variables for $1\le d\le9$.

comments
11 pages. v4 adds an obstruction for six forms with high-multiplicity linear factors and an application to Rogers-Szego truncations; includes exact certificates for quintics and septics
fields
Commutative Algebra
pdf ↗ page arXiv:2608.24797 ↗

Let $M$ be a Weil-Petersson random hyperbolic surface of genus $g$, and let $Γ\subset \mathbb{Z}^{2g}$ be a lattice of prime index $q$. We study the distribution of primitive closed geodesics in homology classes mod $Γ$ in the large genus limit. Averaging over all lattices of index $q$, with $q \to \infty$, we compute all the centered moments of the corresponding weighted counting functions, and exhibit a transition between Poisson and Gaussian regimes (depending on whether $\frac{X}{q\log X}$, the expected number of primitive geodesics in a given homology class mod $Γ$, tends to $λ>0$ or $\infty$). We also study the unnormalized variance $G_M(X,Γ)$ of the counts among homology classes, and show that as $X \to \infty$, averaged over all lattices of prime index $q$, it is asymptotic to $X\log X$ in the large genus limit. These results are analogous to phenomena arising in the distribution of primes in arithmetic progressions.

comments
23 pages. v2: minor corrections and slightly improved exposition
fields
Number Theory, Geometric Topology
pdf ↗ page arXiv:2608.26311 ↗

In the Pearson random walk, the direction of the i-th step is a random variable uniformly distributed on the unit sphere of R^d, and its length is a non-negative random variable. We prove that, when d goes to infinity, the Euclidean norm of the walk converges almost surely to the Euclidean norm of the vector of step lengths, whose joint law is arbitrary. Further, we investigate the same convergence result in a more general framework, where both the number and the lengths of the steps depend on the dimension. The results in the present paper can be applied to approximate the distribution of some classical Pearson random walks, for example, in the Dirichlet case.

fields
Probability
pdf ↗ page arXiv:2609.05195 ↗

We study the projected power method for permutation synchronization: recovering $n$ unknown permutations of $m$ objects from pairwise relative permutations, observed independently with probability $p$ and independently corrupted by uniform permutations with probability $1-π_0$. Our main theorem establishes uniform one-step contraction for all estimates with optimally aligned block-error fraction at most $1/2-ε$, for fixed $ε>0$, including measurement-dependent estimates. When $np\ge C_0\log(n)$ and $m=o(npπ_0^2)$, one update contracts the error by a factor $O(m/(npπ_0^2))$, up to a floor of $O(e^{-c\min\{m\,npπ_0^2,\,npπ_0\}} + \log(n) / n)$. Thus, every initialization in this majority basin achieves $o(1)$ error after one update and maintains it uniformly over subsequent iterations. A reference-block spectral initializer enters the basin with probability $1-o(1)$, yielding end-to-end almost-exact recovery. If additionally $\min\{m\,npπ_0^2,\,npπ_0\} \ge C\log(n)$ for sufficiently large $C$, the method achieves exact recovery in finitely many iterations. We also establish prescribed-block recovery under weaker conditions for measurement-independent estimates and extend the guarantees to independent permutation-valued corruptions with uniform mean and to partial permutations with common visible support.

fields
Information Theory, Optimization and Control
pdf ↗ page arXiv:2609.09502 ↗

We establish global classical well-posedness for the four-dimensional repulsive Vlasov–Poisson system, for every nonnegative \(f_0\in C_c^1(\mathbb{R}^8)\). We also prove global well-posedness for Vlasov equations with power-law interactions for \(d\ge4\). For every \(0<α<3\), we treat both attractive and repulsive interactions with arbitrary nonnegative, compactly supported bounded initial data. Neither result requires a smallness assumption on the initial data. For attractive interactions, a virial argument yields finite-time breakdown for negative-energy solutions when \(3\leα<d+1\). The global existence proofs combine estimates along characteristics, analysis in Lagrangian coordinates, and Serre's compensated integrability.

fields
Analysis of PDEs
pdf ↗ page arXiv:2609.09512 ↗

We prove that the Gromov–Hausdorff space is homeomorphic to the real Hilbert space $\ell^2$. We construct a continuous assignment of full-support probability measures that is equivariant under isometries and finite-dimensional local approximations that control all pairwise distances. These approximations yield the absolute retract property for all metrizable spaces. We also prove that any countable family of continuous maps from compact metrizable spaces can be approximated, with respect to a prescribed open cover, by maps whose images form a discrete family.

comments
118 pages, 10 figures
fields
Metric Geometry, General Topology
pdf ↗ page arXiv:2609.09639 ↗

In this paper, we prove several results concerning the function theory of complete Hermitian manifolds with vanishing Chern curvature, which we refer to as complete Chern-flat manifolds. First, we show that any complete simply connected Chern-flat manifold is elliptic in the sense of Gromov. Moreover, it is biholomorphic to a complex Lie group if the torsion has polynomial growth. We also construct examples of complete Chern-flat manifolds with torsion of exponential growth, but the underlying complex manifolds do not admit any complex Lie group structures. Next, we obtain sharp upper bounds on the dimensions of holomorphic functions of polynomial growth on complete Chern-flat manifolds, without any growth assumption on the torsion. Finally, we prove that any complete Chern-flat manifold admitting polynomial-growth holomorphic functions that form a local holomorphic coordinate system at some point is biholomorphic to complex Euclidean space. These results generalize our previous work, where we assume that the torsion has sublinear growth. Our approach combines Cauchy estimates with nilpotent analysis along the orbits of holomorphic flows generated by parallel unitary frames on such manifolds.

comments
In this version, we remove "II" from the original title, improve the exposition, and add new examples (Example 1.8) related to Theorem 1.2
fields
Differential Geometry
pdf ↗ page arXiv:2609.10159 ↗

Let \(X\) be a log del Pezzo surface with cyclic quotient singularities and \(\mathcal{X}\) its canonical stack. We define the categorical genus of \(\mathcal{X}\) as half the rank of its antisymmetric numerical Euler pairing. Using Serre duality and inertial Riemann–Roch, we compute \[ g_{\mathrm{cat}}(\mathcal{X})=1+\frac{1}{2}\sum_j w_j(\ell_j-1), \] where \(w_j\) and \(\ell_j\) are the local widths and Gorenstein indices of the singularities, and identify the local contributions with twisted sectors of age less than one. We determine how categorical genus changes under general \(\mathbb{Q}\)-Gorenstein deformation and express the resulting decrease in terms of the smoothable \(T\)-content. When \(X\) admits a toric \(\mathbb{Q}\)-Gorenstein degeneration, the categorical genus of a general deformation agrees with Tveiten's mutable genus, given by the residual interior lattice points of the corresponding Fano polygon. Under additional hypotheses, we recover this genus formula through the singularities of compactified mirror curves.

comments
47 pages, 6 figures
fields
Algebraic Geometry
pdf ↗ page arXiv:2609.13102 ↗

We study the computational complexity of finding fixed points of set-valued contractions. We first formulate a computational problem for Nadler's fixed-point theorem, PROJECTED-NADLER, and prove that it is CLS-complete by showing its equivalence to CONTINUOUS-LOCALOPT. We then establish a stronger converse to Nadler's theorem, which can be applied as a tool to analyze the convergence rate of the set-valued basic iteration procedure. Finally, we reduce the large-margin triplet stationarity problem to PROJECTED-NADLER. Combining the argument for CLS-hardness of exact triplet stationarity problem [Yan et al. 2025] with the CLS-hardness of approximate KKT points of quadratic programs [Fearnley et al. 2025], we obtain CLS-completeness of large-margin triplet stationarity at any prescribed accuracy.

comments
58 pages, 4 figures
fields
General Topology
pdf ↗ page arXiv:2609.14101 ↗

We study quantitative propagation of chaos for mean-field forward-backward stochastic differential equations with interactions through the empirical measures of the forward states, backward values, and diagonal martingale integrands. Our main contribution is to introduce an intermediate-particle comparison method that transfers forward propagation of chaos estimates to the backward system while controlling the full matrix of martingale integrands. Using this method, we establish sharp rates for the backward values and diagonal martingale integrands, with order $m^2/n^2$ in squared Wasserstein distance and order $n^{-1}$ in smooth weak metrics for each fixed $m$. Explicit examples provide matching lower bounds, showing the optimality of these rates. We also establish coupling estimates, including a squared Wasserstein bound of order $m/n$ with dimension-independent constants under suitable assumptions.

comments
58 pages. This paper was written entirely by the authors. AI-assisted tools were used only for language polishing and grammatical correction, and not for generating scientific content
fields
Probability
pdf ↗ page arXiv:2609.15798 ↗

Guo, Kang and Zwaneveld conjectured that colouring the \((d+1)\)-clique blowup of a graph with defect \(d\) requires as many colours as colouring the graph properly. Norin and Steiner refuted this, proved that the two chromatic numbers differ by at most a factor of two, and asked for the exact constant; the best separation known was \(11/10\). We prove that the constant is exactly two for every fixed defect \(d\ge 2\). Every rational ratio in \([1,2)\) is attained, by graphs whose clique number and fractional chromatic number equal the defective parameter: the separation is invisible to the standard lower bounds. The engine is an exact transfer theorem: a weighted list-colouring obstruction spread over an arbitrary auxiliary graph yields prescribed defective and ordinary chromatic numbers; Kneser graphs then give sharpness. A 29-vertex graph with defective parameter four and chromatic number five answers Norin's Barbados question at the smallest possible defect and palette.

comments
9 pages, 2 figures. Revised version establishing the optimal separation factor of two for every fixed defect at least two, an exact transfer theorem, and a 29-vertex counterexample
fields
Combinatorics, Optimization and Control
pdf ↗ page arXiv:2609.17557 ↗

Let $(\mathcal{M},d_{\mathrm{GH}})$ denote the Gromov-Hausdorff space. We prove that every nonempty compact metric space is isometrically embeddable into $(\mathcal{M},d_{\mathrm{GH}})$, answering a question of Iliadis. The corresponding result was previously known for finite metric spaces and several larger classes. However, the general compact case remained open. More precisely, let $D>0$ and let $K$ be a nonempty compact metric space with diameter at most $D$. On a fixed Cantor space, we associate a metric to each $1$-Lipschitz function from $K$ to $[0,D]$ so that the Gromov-Hausdorff distance between any two resulting spaces is exactly the uniform distance between the corresponding functions. The resulting spaces have diameter at most $76D$. As a consequence, the subspace of $\mathcal{M}$ represented by Cantor spaces is itself isometrically universal for compact metric spaces. We also construct finite approximations of these spaces, obtain an exact formula for the Gromov-Hausdorff distance between the finite models, and derive uniform approximation and covering estimates.

comments
15 pages
fields
Metric Geometry
pdf ↗ page arXiv:2609.21469 ↗

This paper studies the element-wise convergence behavior of subspace iteration. All results are established for both \(\mathbb{F}=\mathbb{R}\) and \(\mathbb{F}=\mathbb{C}\). For a diagonal matrix \(Λ=\mathrm{diag}(λ_1,\ldots,λ_n)\) with \(|λ_1|>\cdots>|λ_n|>0\), we analyze the modulus of each entry of the iterative matrix sequence generated by subspace iteration, both without and with the Rayleigh–Ritz procedure. Under mild assumptions on the initial matrix \(X\in\mathbb{F}^{n\times m}\), we first derive exact asymptotic expressions for \(|Q_k(i,j)|\) in the subspace iteration without the Rayleigh–Ritz procedure: entries with \(i\neq j\) decay as \(|λ_{\max\{i,j\}}/λ_{\min\{i,j\}}|^k\), and the deviation of \(|Q_k(j,j)|\) from \(1\) decays as \(\max\{|λ_j/λ_{j-1}|,|λ_{j+1}/λ_j|\}^{2k}\), with explicit coefficients determined by the LU factorization of \(X\). Similar conclusions could also be established for upper triangular matrices. For the Rayleigh–Ritz variant, we obtain element-wise asymptotic formulas for the normalized Ritz vectors \(Z_k\). Specifically, for \(|Z_k(i,j)|\), off-diagonal entries with \(i\geq m+1\) decay as \(|λ_i/λ_j|^k\), off-diagonal entries with \(i\leq m\) decay as \(|λ_{m+1}^2/(λ_iλ_j)|^k\), and the deviation of \(|Z_k(j,j)|\) from \(1\) decays as \(|λ_{m+1}/λ_j|^{2k}\). These results give an element-wise description of the convergence behavior of subspace iteration. After an orthogonal or unitary change of basis, the results could be further generalized.

comments
Compared with the previous version, this version includes some refinements to the mathematical proofs
fields
Numerical Analysis
pdf ↗ page arXiv:2609.21540 ↗

We study the challenging problem of distribution-free sequential changepoint detection for independent observations with unknown and \emph{completely unrestricted} pre- and post-change laws. For over two decades, the primary existing solution for this problem has employed Vovk's conformal test martingales and associated e-detectors, which control the probability of false alarm (PFA) and the average run length (ARL) respectively. The majority of these works focus on validity, with statistical efficiency usually left for simulations. We develop a comprehensive theory of how conformal p-values behave under non-exchangeable data with a changepoint at an unknown time $T$. We use this to analyze the post-change growth and resulting detection delays and find that the standard existing methods are provably suboptimal for PFA and ARL control, and can lead to delays that are $Ω(T)$ and $Ω(\sqrt{\text{ARL}})$ respectively. We construct new conformal e-processes and e-detectors with learned scores and a fixed, distribution-independent betting dictionary. For any distribution pair with positive finite KL divergence, our methods asymptotically achieve $\log T/\mathrm{KL}$ delay for PFA control and $\log\mathrm{ARL}/\mathrm{KL}$ delay (with a sharp leading constant of 1), which are both proven to be minimax optimal in a suitable double-array framework. Simulations illustrate the large empirical benefits of our new approach.

comments
69 pages, 6 figures;
fields
Statistics Theory
pdf ↗ page arXiv:2609.27179 ↗

We give a machine-checked proof, in Lean 4, of the universal property of multi- centered blowups: given a finite family Z of closed subschemes of a scheme X, presented on each chart by ideals, there is a scheme BlZ X over X, terminal among X-schemes on which every member of the family becomes an effective Cartier divisor. To the best of our knowledge this is the first formalisation of blowups, single- or multicentered, in any theorem prover. The proof is organised around the universal property of the multicentered dilatation of a ring. The comparison isomorphisms on overlaps, the cocycle identity, and the independence of the chosen presentation are obtained from the uniqueness part of this universal property. We give the exact theorem statement as formalized, the proof architecture, and the main new mathematical ingredients, together with the corresponding Lean code.

fields
Algebraic Geometry
pdf ↗ page arXiv:2609.28489 ↗

We prove moment and mixed-tail inequalities for decoupled homogeneous chaoses of arbitrary fixed order generated by independent, centered, bounded random variables with coordinate-dependent second-moment bounds. The estimates hold for arbitrary real rectangular coefficient tensors and are expressed through weighted slice and partition norms. A Bennett-type logarithmic correction sharpens the contribution of the largest coefficient to these bounds. The proof combines a comparison with sums of sparse exponential variables with an elementary replication argument. We also extend the results to diagonal-free non-decoupled chaoses and sparse sub-exponential inputs. As an application, we establish conditions under which sparse Khatri–Rao random projections approximately preserve norms and inner products for finite collections of tensors. For a sparse random relation containing a planted dense block, we prove matching upper and lower bounds on the required projection dimension, demonstrating the sharpness of the logarithmic correction.

comments
31 pages
fields
Probability, Statistics Theory
pdf ↗ page arXiv:2609.28875 ↗

Let $\mathcal I$ be an admissible ideal on $\mathbb N$. Zhou, Liu, Liu, and Lin asked whether every regular space with a $σ$-hereditarily closure-preserving $\mathcal I$-$sn$-network is $\mathcal I$-$sn$-metrizable. The answer is affirmative for every admissible ideal. The proof rests on a local countability theorem. If $y_n\to_{\mathcal I}x$ and $\{n\mid y_n\ne x\}\in\mathcal I^+$, then every point-discrete family of $\mathcal I$-sequential neighborhoods of $x$ is countable. In a $T_1$ space, this applies in particular to every HCP family. If no $\mathcal I$-convergent sequence to $x$ has $\mathcal I$-positive support away from $x$, then $\{x\}$ is an $\mathcal I$-sequential neighborhood. It follows that every space with a $σ$-point-discrete $\mathcal I$-$sn$-network is $\mathcal I$-$snf$-countable. This conclusion, together with the characterization theorems of Ge and of Zhou, Liu, Liu, and Lin, settles Problem 5.2. The countability bound cannot in general be strengthened to finiteness. A countable Rudin–Keisler antichain of free ultrafilters gives an admissible ideal for which local HCP-finiteness fails. Every $P^{-}$ ideal has local HCP-finiteness. Preservation theorems for Fubini products, heterogeneous Fubini sums under cross-row Katětov absorption, and suitable increasing unions extend local HCP-finiteness beyond the $P^{-}$ class. They apply to the finite Fubini powers of $\mathrm{Fin}$, Katětov's first limit-stage ideal $\mathrm{Fin}^ω$ and its finite successors, the tree-derived rank-$ω$ ideal $\mathcal H_{<ω}$, and the inductive-limit ideal $\mathrm{Fin}_ω$. Every listed example other than $\mathrm{Fin}$ fails $P^{-}$.

comments
33 pages
fields
General Topology, Logic
pdf ↗ page arXiv:2609.30317 ↗

We investigate the use of neural network solvers for infinity and $p$-Laplace problems, which are fundamental in nonlinear analysis and have practical applications. Our approach employs Physics-Informed Neural Networks (PINNs) and Deep Operator Networks (DeepONets) to address computational challenges associated with large $p$ values, ranging from $2$ to $1000$, on various 2D and 3D domains. Our method offers advantages over traditional physics-based solvers, especially in three dimensions where mesh-based solvers become very costly for these problems. We also establish conditional convergence results for PINN approximations of both problems and a universal approximation result for DeepONet on the parametric $p$-Poisson problem. We demonstrate the effectiveness of these neural network solvers through numerical experiments and compare their performance with conventional methods.

fields
Numerical Analysis
pdf ↗ page arXiv:2609.30809 ↗

We give an explicit quasi-isometry from the flip graph of triangulations $\mathscr{F}_{g,n}$ to the $ε$-thick part of Teichmüller space equipped with the Teichmüller metric, by mapping each ideal triangulation to the hyperbolic surface whose shearing coordinates along that triangulation are all equal to zero. Extending this construction, we obtain a quasi-isometry $Q$ from the hexagon graph $\mathscr{H}_{g,n}$ to the augmented Teichmüller space $\overline{\operatorname{Teich}}_{g,n}$ equipped with the Weil-Petersson metric, and we estimate its width, that is, the Hausdorff distance between $Q(\mathscr{H}_{g,n})$ and $\overline{\operatorname{Teich}}_{g,n}$. By bounding the Weil-Petersson distance along grafting rays, and by using an analogue for ideal triangulations of Wolpert's upper bound on the Weil-Petersson distance to a stratum, we show that the width is at most of order $\sqrt{(g+n)\log(g+n)}$. We also provide an explicit projection from any point in $\overline{\operatorname{Teich}}_{g,n}$ to the thick part of boundary strata, maintaining simultaneous control over the Weil-Petersson distance and the shearing coordinates.

comments
72 pages, 9 figures
fields
Geometric Topology
pdf ↗ page arXiv:2609.31278 ↗

The pseudo-parabolic term $u_{xxt}$ serves as a canonical example of higher-order viscosity that provides effective regularization while capturing the refined physical mechanism. How it alters the dynamics of prototype equations remains a fundamental issue, which is not yet fully understood. The goal of this paper is to show that this term induces a sharp transition in traveling wave structure, via studying the pseudo-parabolic Fisher-KPP equation $$ u_t - τu_{xxt} = D u_{xx} + u(1-u). $$ We completely characterize how the parameter ratio $τ/D$ acts as a critical switch: it preserves the monotonic structure of classical traveling waves when $τ/D \leq 1$, yet it triggers a qualitative shift to oscillatory traveling waves when $τ/D > 1$. Numerical simulations support these findings. The threshold $τ/D=1$ thus captures the dual role of the pseudo-parabolic term: it acts as a structure-preserving viscosity when small, but when large it reflects dominant capillary hysteresis, generating the oscillations that explain the saturation overshoot, a phenomenon that contradicts classical diffusion models yet is widely observed in two-phase flow.

comments
The authors request withdrawal due to critical errors in Sections 6 and 7. Specifically, the proof regarding non-monotonic traveling waves is flawed and the corresponding numerical simulations are incorrect, which invalidates the main conclusions
fields
Analysis of PDEs
pdf ↗ page arXiv:2609.34368 ↗

Classical statistical theory is insufficient to explain the successes of general-purpose AI models, because it depends on handcrafted inductive biases that it cannot justify. No Free Lunch (NFL) theorems force any learner that beats chance on some environments to underperform on others. We might hope that past experience informs which environments to expect, but NFL applies equally to meta-learning. Thus, any method that makes meaningful predictions necessarily begins with an inductive bias external to the data. Choosing to bias toward short programs yields Solomonoff induction (SI), whose performance is competitive against all computable learners - albeit up to "constants" that become large when comparing against specialized methods that exploit background information. We therefore relativize SI to an information vantage point, biasing toward short programs with access to all preexisting information. This reframes the inductive bias: instead of seeking some absolute notion of simplicity, we favour accessibility with respect to our vantage point. An algorithm can only outpredict the relativized SI to the extent that its code contains additional information about the data, and no algorithm can generate such information. While SI is incomputable and hence not a practical algorithm, it provides a formal optimum for inference in the limit of infinite compute, and there is evidence to suggest that frontier AI systems roughly approximate it. Thus, the only known answer to meta-NFL is rooted in algorithmic information theory, which we should expect to play a fundamental role in explaining the generalization behaviour of modern (and future) AI systems.

comments
Published at NeurIPS 2026 Position Paper Track
fields
Information Theory, Statistics Theory
pdf ↗ page arXiv:2609.34458 ↗

We classify the simultaneous half-bandwidths $p,q$ of a symmetric oscillatory matrix $A$ and its inverse. At order $n\ge2$, the possible pairs are $(1,n-1)$, $(n-1,1)$, and all pairs with $2\le p,q\le n-1$. Let $e_k(A)$ be the least positive integer $m$ for which all minors of order $k$ of $A^m$ are positive, and let $e(A)=\max_{1\le k<n}e_k(A)$. Put $a=\min\{p,q\}$ and $b=\max\{p,q\}$. At every feasible pair of actual half-bandwidths, \[ \max_A e(A)= \max\left\{\left\lfloor\frac n2\right\rfloor, n-a-\left\lfloor\frac{\max\{n-p-q,0\}}{b}\right\rfloor\right\}. \] We also determine the maximum of $\sum_{k=1}^{n-1}e_k(A)$ for every pair. When $p+q\ge n$, one realization maximizes all $e_k$ simultaneously. Write $A=U^TΔU$, with $U$ unit upper triangular and totally nonnegative, and $Δ$ positive diagonal. Let $\ell(U)$ be the least number of elementary upper bidiagonal factors with positive parameters whose product is $U$. At fixed $(p,q)$, its minimum is $\max\{n-1,p+q-1\}$. One symmetric integer matrix of determinant one simultaneously attains this minimum, the maximum exponent, and the maximum exponent sum. We prove $\ell(U^{r+1})-\ell(U^r)=\#\{k:1\le k<n,\ e_k(A)>r\}$ for every integer $r\ge\lfloor(n-1)/2\rfloor$, with the starting point optimal. With $δ=\ell(U)-n+1$, the exponent sum satisfies $δ\le n(n-1)/2-\sum_{k=1}^{n-1}e_k(A) \le\lfloor(n-1)/2\rfloorδ$, with both constants sharp. The lower deficit bound is attained at every admissible factor count. Within the symmetric class, a total sum of $n(n-1)/2$ characterizes basic matrices. In the basic oscillatory class, without a symmetry assumption, a positive integer vector $(f_1,\ldots,f_{n-1})$ is realizable if and only if $f_k\le\max\{k,n-k\}$ and $f_k+f_{n-k}\ge n$ for $1\le k<n$, and $\lvert f_{k+1}-f_k\rvert\le1$ for $1\le k<n-1$. Explicit factor orders realize every such vector.

comments
32 pages, 0 figures. Added the exact maximum exponent in the sparse bandwidth range and a sharp cutoff for factor-count increments
fields
Rings and Algebras
pdf ↗ page arXiv:2609.35846 ↗

We show that the canonical embeddings of the Jiang–Su algebra $\mathcal Z$ into the universal unital free product $\mathcal Z \ast_{\mathbb C}\mathcal Z$ are not approximately unitarily equivalent. This answers a question appearing in one of the $99$ problems list of Schafhauser, Tikuisis, and White. By contrast, we prove that any two such embeddings into a selfless $\mathrm{C}^\ast$-algebra are strongly asymptotically unitarily equivalent.

comments
v2: 21 pp, minor changes, added uniqueness of embeddings in the purely infinite case
fields
Operator Algebras
pdf ↗ page arXiv:2610.02174 ↗

We construct degree-three isogenies of Hesse elliptic curves over an arbitrary field of characteristic different from three, which correspond to a step of the cubic arithmetic-geometric mean. As an application, we describe the Serre-Tate canonical lift of an ordinary elliptic curve in characteristic three by the 3-adic cubic arithmetic-geometric mean. We also discuss the relations of the Hesse curves with complex and finite hypergeometric functions.

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

Uncertainty quantification (UQ) for random partial differential equations (PDEs) is ubiquitous in computational science and engineering. However, classical spectral solvers for this class of problems face the curse of dimensionality, and existing neural solvers often ignore the stochastic structure that makes moments and calibration tractable. We introduce a stochastic separable physics-informed neural network, dubbed S$^{2}$-PINN, that represents the solution $u(t,\mathbf{x},\mathbf{Z})$ of a random PDE with a learnable Gaussian spatial dictionary, Fourier temporal features, and a generalized polynomial chaos (gPC) stochastic basis, coupled by a low-rank Canonical Polyadic (CP) tensor decomposition core. The method is trained with a hybrid strong-form and gPC-projected residual loss. Our theoretical analysis establishes that the separable class is dense in $L^2$ under mild conditions, and the projected residual corresponds exactly to a stochastic Galerkin constraint. Furthermore, we show that mini-batch projection coefficients are logarithmically dependent on the number of gPC modes, and that the orthogonality penalty controls the conditioning of the learned spatial dictionary. Using four manufactured random PDE benchmarks, we show that S$^{2}$-PINN outperforms nine baselines in terms of mean and variance accuracy, as well as calibration, while using significantly fewer parameters. Further evaluations on non-manufactured Poisson and Darcy problems, a stochastic Navier–Stokes problem, a diffusion scaling study of higher random dimensions, and two stochastic inverse problems reveal the generalization capabilities of the proposed structure. Together, these results support stochastic separability as an effective design principle for physics-informed neural UQ. The code for the experiments can be found in https://github.com/DMax1314/s2pinn

fields
Mathematical Physics
pdf ↗ page arXiv:2610.03303 ↗

Let $S$ be a closed oriented surface of genus at least $2$. Let $X$ be a $(2,1)$-dimensional anti-de Sitter spacetime homeomorphic to $S\times[-1,1]$ with smooth, spacelike, strongly convex boundary. By Gauss' formula, the induced metric on each of the two components of $\partial X$ has curvature $K<-1$. In this paper we address the inverse problem. We show that, for any two smooth metrics $h_-, h_+$ on $S$ with curvature $K<-1$, there exists a unique, smooth anti-de Sitter metric on $X:=S\times [-1,1]$ with respect to which the boundary is locally strongly convex and has induced metric isotopic to $h_-$ on its past component and isotopic to $h_+$ on its future component. Existence has already been proven by Tamburelli. We use this result to solve affirmatively a conjecture of Mess: given any two measured laminations $l_-, l_+\in\mathcal{ML}_S$ that together fill $S$, there exists a unique $(2,1)$-dimensional, globally hyperbolic, maximal, Cauchy compact (GHMC) anti-de Sitter spacetime such that the measured bending laminations of the past and future boundary components of its convex core are respectively $l_-$ and $l_+$. Here, existence has already been proven by Bonsante–Schlenker.

comments
48 Pages; 3 Figures; Expanded introduction and slightly improved presentation; GenAI used only for proofreading earlier drafts and generating figures
fields
Differential Geometry
pdf ↗ page arXiv:2610.05506 ↗

The minimum solid angle of a simplex is shown to be a shape measure in any dimension. While this has been known in dimensions two and three, the higher-dimensional generalization is new. We prove inequalities between the minimum solid angle of a non-degenerate simplex and its fullness. Up to dimension-dependent constants, the fullness is bounded from above by the minimum solid angle, and it is bounded from below by the square of the minimum solid angle. The exponents are optimal for three and higher dimensions. This work therefore generalizes the minimum angle condition. We also review several simplex shape measures and their relationships.

comments
16 pages. Submitted. Comments welcome
fields
Metric Geometry, Numerical Analysis
pdf ↗ page arXiv:2610.05883 ↗

Nash–Williams's orientation theorem converts undirected edge-connectivity into directed connectivity. We extend it to prescribed outdegrees modulo $q$, whose residues must sum to the number of edges modulo $q$. For integers $q,k\ge1$, every such prescription has a realization with at least $k$ edges in each direction across each nontrivial cut if the graph is $(2q+2k-2)$-edge-connected or contains $q+2k-1$ edge-disjoint spanning trees. The method combines a cycle-space approximation bound with rounding that preserves the imbalance across every cut. Fractional spanning-tree packing gives an exact criterion: every compatible prescription has a strongly connected realization if and only if the fractional packing number exceeds $q$. This yields a polynomial-time recognition test. With no directed connectivity requirement, $q$ disjoint spanning trees suffice, proving Hasanvand's prescribed-residue conjecture. For every odd prime $p$, this proves the conjectured statement that the union of $p$ graphic bases over the field with $p$ elements is an additive basis. For every integer $p\ge5$, the theorem and the counterexamples of Han, Li, Wu and Zhang give the exact edge-connectivity threshold $4p+2$ for a modulo-$(2p+1)$ orientation. We also show that every six-edge-connected graph has circular flow number strictly below three, as conjectured by Li, Thomassen, Wu and Zhang. For three-flow-critical graphs on $n$ vertices and $m$ edges, we improve the previous general bound $m\le4n-10$ to $m\le3n-6$, and to $m\le3n-7$ when $n\ge5$. Further applications include Seymour's six-flow theorem, star decompositions, antisymmetric flows, and signed modular orientations.

comments
31 pages, Major revision
fields
Combinatorics
pdf ↗ page arXiv:2610.07034 ↗

We build on EndoWake, an endogenous wake model that links the wind speed at every grid cell to its upwind neighbors by linear constraints, so that wake field, siting decisions and project constraints share one mixed-integer model. Its four parameters are calibrated once on the single wake of a Reynolds-averaged Navier-Stokes (RANS) simulation, and a graphics processing unit (GPU) scores over a million layouts per second per wind direction. At Lillgrund, we compare searches guided by EndoWake and by PyWake under a RANS judge that no search calls: the fidelity of a wake model is not the quality of the layouts optimized under it. Two diagnostics separate a directional quadrature error between the sampled wind directions from a spatially localized surrogate bias off each wake edge, not reported before to our knowledge; at random directions, five paired starts detect no difference between the pipelines. The main result puts the speed to use: EndoWake ranks the moves of a local search on the GPU, and PyWake confirms every accepted move. On twenty unseen starts, with one GPU and thirty CPU processes, screen-and-confirm reaches similar mean gains to a search on PyWake alone, 7.9 times faster at one wind speed and 14.9 times faster on the annual energy (3.0 and 4.7 with a proof of local optimality charged to the timed search); on a second site it keeps its speed, and its local optima fall slightly short of those of PyWake alone. Code and data are deposited on Zenodo.

comments
v3 (November 2026): states the fixed wake expansion rate of Section 7 and its effect; the inflow along an empty domain; formal terms in the abstract; minor corrections. v2 (October 2026): formal terms replace the metaphors of v1; new comparisons with TOPFARM and on a second site (Horns Rev 1). The replication package (doi:10.5281/zenodo.22017446) includes all the code. 40 pages, 5 figures
fields
Optimization and Control
pdf ↗ page arXiv:2610.07844 ↗

For every integer $N\ge4$, we construct a fixed smooth, non-locally-conformally-flat metric on the $n$-dimensional unit sphere $\mathbb S^n$ for which the constant $Q_{2N}$-curvature equation admits an $L^\infty$-unbounded sequence of positive solutions. The construction applies for $n\ge2N+20$ when $N=4,5$, $n\ge2N+19$ when $6\le N\le8$, $n\ge2N+18$ when $9\le N\le17$, and $n\ge2N+17$ when $N\ge18$. For each $L \in \mathbb{N} \cup \{0\}$, the metric can be chosen arbitrarily close to the round metric in the $C^L$ norm. It can also be chosen to have a coercive GJMS operator, a strictly positive Green function, and positive Green function mass wherever the Weyl tensor and its covariant derivatives through order $\lfloor(n-2N-4)/2\rfloor$ vanish. Together with the known cases $N=1,2,3$, this establishes noncompactness at every order and proves the sharpness of the companion compactness ranges under the same operator and mass hypotheses. The construction relies on our formula for the fixed-volume Hessian of total $Q_{2N}$-curvature in transverse-traceless (TT) directions at closed Einstein metrics with $\mathrm{Ric}=(n-1)g$. For every $N \in \mathbb{N}$ and $n>2N$, this Hessian is represented by a degree-$N$ polynomial in the Lichnerowicz Laplacian, extending Matsumoto's formula for $n=2N$. For the metric perturbations generated by a fixed algebraic Weyl tensor, the quadratic reduced energy with fixed bubble center is a positive multiple of this Hessian restricted to a four-dimensional TT space. Differentiation in the bubble scale yields a finite matrix whose exact sign analysis establishes the required indefiniteness in the stated dimension ranges. After continuation to real $n$, this matrix changes from negative definite to indefinite at $n_N=2N+a_*+c_*N^{-1}+O(N^{-2})$ as $N\to\infty$, with $a_*\approx16.2018$ and $c_*\approx13.5128$, explaining the eventual bound $n\ge2N+17$.

comments
58 pages, 1 figure
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2610.07992 ↗

Image characterization relates coding budgets to the probability carried by source cells and their output images. At second order, refining a cell can reveal unavailable information, while a change of reference measure can alter the relevant likelihood fluctuations. We establish image bounds that account for both effects. A finite-block partition theorem bounds the cost of merging component images by the joint conditional information spectrum of their label. It preserves continuous second-order profiles when that cost is negligible on the square-root blocklength scale. For reconstruction constraints, cell-dependent reference measures retain the actual distortion deficits in a single likelihood. A Gaussian evaluation gives matching second-order rates for Heegard–Berger coding with one uninformed decoder in the strict both-active regime, common reconstruction under a joint agreement and distortion criterion, and two-stage refinement with side information absent at the first decoder. A structured binary source illustrates partition stability even when its global density and conditional-divergence deficits are linear in blocklength. Posterior-mass images also sharpen extraction after a public refinement by charging its residual information rather than its alphabet size. These results preserve the joint constraints and the observations available for choosing the local coding experiment.

comments
Draft manuscript
fields
Information Theory
pdf ↗ page arXiv:2610.09472 ↗

This is a continuation of our previous paper on toric gravitational instantons. We develop a systematic theory of compact simply-connected Einstein four-manifolds with toric symmetry. Applications include (1) The construction of simply-connected positive Einstein four-manifolds with arbitrarily large $b_2$. Our method is based on local gluing combined with a global virtual counting argument. The key idea involves a particular design of rod structures to enable a gluing construction and restrict possible degenerations. (2) A topological characterization of algebraically special toric Einstein metrics in terms of $b^+_2 \leq1$. This uses special curvature identities for $W^+$ in the toric setting. (3) Uniqueness, up to scaling and isometry, of toric Einstein metrics on four-manifolds admitting an algebraically special Einstein metric. (4) Diffeomorphism classification of compact toric Einstein four-manifolds in terms of an improved Hitchin-Thorpe inequality $χ\geq3|τ|$. (5) Smooth compactness of simply connected toric Einstein four-manifolds with bounded Euler number. In particular, our construction recovers all the classical toric Einstein metrics, including the Page and Chen-LeBrun-Weber metrics, starting from the round sphere through moduli spaces of conical Einstein metrics.

comments
152 pages. Exposition improved and some arguments clarified. Moved Appendix C to the main text. Added a new Appendix C on a general compactness theorem for toric Einstein metrics. Removed the Appendix D on the discussion on the variational framework since it is not relevant to the main results
fields
Differential Geometry, Mathematical Physics, Analysis of PDEs
pdf ↗ page arXiv:2610.10425 ↗

We propose a continuous policy-value iteration framework for infinite-horizon stochastic control problems, in which the policy evolves through Langevin-type dynamics driven by the gradient of the in-homogeneous Hamiltonian, while the value function is updated simultaneously and continuously along the iteration, avoiding directly solving its corresponding PDE at each step. The iteration scheme enjoys policy improvement under suitable regularity and admissibility assumptions and we show the exponential contraction of the joint policy-value dynamics in Wasserstein-2 distance under the Lipschitz condition in expectation via the inhomogeneous synchronous coupling and verify these conditions for linear-quadratic problems. Numerical experiments on linear-quadratic models and the optimal consumption-investment problems in an incomplete market factor model illustrate the policy improvement, convergence toward optimal policies, and the effect of decaying exploration noise.

fields
Optimization and Control
pdf ↗ page arXiv:2610.10744 ↗

This is the second paper in a series that reads the dividing lines of Shelah's classification theory as properties of bipartite quantum observables. For an observable of two independently prepared systems, Alice's and Bob's, we study its idealized responses: the expectation values of Alice's limiting preparations, as functions of Bob's preparations, which serve as probes, with Bob's system idealized first. We show that the observable is NIP, that is, no sequence of Alice's preparations lets Bob's probes realize every finite pattern of high and low values at a fixed positive gap, exactly when all idealized responses are of the first Baire class, pointwise limits of sequences of continuous functions; they then form a separable Rosenthal compactum. Because Alice can mix preparations, this compactum is convex, and hereditary separability forces it to be metrizable, so that NIP observables occupy three of the four topological classes defined by metrizability and Todorčević's trichotomy. Comparisons of photon numbers, of positions and of events in spacetime realize these three classes, and trees of preparations realize the seven minimal families of the Argyros–Dodos–Kanellopoulos heptachotomy. For the ferromagnetic transverse-field Ising model at positive temperature, the finite-volume magnetizations with offset longitudinal fields form a stable family when the spontaneous magnetization vanishes, and a family whose closure is first countable but not hereditarily separable when it does not.

fields
Functional Analysis
pdf ↗ page arXiv:2610.12908 ↗

We study uniqueness of parabolic motions in the Newtonian $N$-body problem using strong stable manifolds and direct action comparisons. Fix a minimal normalized central configuration $c$, with no nondegeneracy assumption. In McGehee coordinates, every parabolic motion with this limiting configuration has a tail on the outgoing strong stable manifold. Its local graph yields a smooth velocity field on a truncated cone, selecting a collision-free parabolic motion that stays in the cone and is unique among all such cone-confined motions. For free-time minimizing rays, an explicit renormalized action excess gives a no-exit estimate, hence uniqueness from a smaller cone without a confinement assumption. Together with known existence results, these cone theorems imply that every $c$-parabolic motion has a tail that is a $c$-parabolic geodesic ray. Globally, we propagate the stable graph backward and compare the excess on its regular branches. An endpoint differential formula and Sard's theorem imply that the configurations admitting more than one such minimizing ray form a Lebesgue-null set. The uniqueness proofs combine local dynamics and variational comparisons without using differentiability of a global Hamilton–Jacobi solution.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.14972 ↗

We prove a regularity lemma for polynomials with fixed degree $d$ and any number of standard Gaussian input variables. Following modern approaches to the Szemer{é}di regularity lemma, we deduce our results from a general formulation of the regularity lemma using ultraproducts. Along the way, we give a direct combinatorial proof of the celebrated ``fourth moment theorem'' of Nualart and Peccati, which characterizes the asymptotically Gaussian polynomials inside degree-$d$ Gaussian chaos as those such that $\mathbb{E} p^2 \to 1$ and $\mathbb{E} p^4 \to 3$. We apply the regularity lemma to obtain a short proof of the robust Borell inequality of Mossel and Neeman.

fields
Probability
pdf ↗ page arXiv:2610.16180 ↗

We prove global well-posedness in the Schwartz space and establish long-time asymptotics for the focusing coupled Kundu–Eckhaus (CKE) equation. For data with no discrete spectrum or real-axis spectral singularities, we analyze the associated matrix Riemann–Hilbert problem by the Deift–Zhou nonlinear steepest descent method. A quantitative local expansion of the full matrix factor near the stationary point identifies the unitary factor in the leading vector term. We combine an estimate for the full matrix coefficient at infinity with exact mass identities. This gives joint error estimates for the gauge-equivalent coupled nonlinear Schrödinger solution, the cumulative mass, and the gauge phase. These joint estimates yield an explicit asymptotic formula for CKE radiation with an $O(t^{-1}\log t)$ remainder, uniformly for $x/t$ in compact subsets of $\mathbb R$. We also compute the reflection coefficient and the unitary endpoint factor to visualize the asymptotic solution.

comments
v2: added novel results
fields
Mathematical Physics, Analysis of PDEs
pdf ↗ page arXiv:2610.16564 ↗

By equipping the category $\mathcal{M}$ of modules over a finite dimensional algebra with the action of a finite tensor category $\mathcal{C}$, we introduce a subcategory $\mathcal{PM}$ satisfying numerous remarkable properties: it is generating and cogenerating, functorially finite, closed under Auslander–Reiten translations (i.e. precluster tilting), and it computes the finitistic dimension. Through a functor category perspective, $\mathcal{PM}$ is identified with the $\mathcal{C}$-module functors that are projective, and we also prove a $\mathcal{C}$-equivariant version of the Auslander(--Solberg) correspondence. As examples, we show that $\mathcal{PM}$ contains only finitely many indecomposable modules for some tensor product algebras. For some family of 1-Iwanaga–Gorenstein algebras introduced by Geiss–Leclerc–Schröer, we show that $\mathcal{PM}$ is exactly the subcategory of $τ$-locally free modules.

comments
v2: Added reference to companion paper. v1: Comments more than welcomed!
fields
Representation Theory, Category Theory, Quantum Algebra
pdf ↗ page arXiv:2610.17646 ↗

We resolve an open problem posed by Tao related to the Toeplitz square peg conjecture. We prove that four simple closed polygonal curves in the cylinder, each winding once in the positive direction, jointly inscribe a square whenever the alternating sum of their $\int y\, dx$ integrals vanishes. The proof reduces the problem to the non-displaceability of a pair of Lagrangian tori, which we establish using Lagrangian Floer homology.

comments
9 pages, 4 figures. Updated references
fields
Symplectic Geometry
pdf ↗ page arXiv:2610.21076 ↗

Let $T$ be the tetragonal disphenoid whose four congruent faces are isosceles triangles with sides $2,\sqrt3,\sqrt3$, so that the dihedral angles are $π/2$ along one opposite pair of edges and $π/3$ along the remaining four. By Smyth's theorem $T$ contains three embedded minimal disks meeting $\partial T$ orthogonally; the symmetry group $D_{2d}$ of $T$ fixes one and interchanges the other two. We identify all three completely. The distinguished disk is a patch of $\textbf{Schwarz's $\mathrm{P}$ surface}$ and the congruent pair are patches of $\textbf{Schwarz's $\mathrm{D}$ surface}$, with exact areas \[ \operatorname{Area}(Σ^{*}_{A}) = \frac{K\!\left(\tfrac14\right)} {K\!\left(\tfrac34\right)} = 0.781700961348056\ldots, \] \[ \operatorname{Area}(Σ^{*}_{B}) = \frac{K\!\left(\tfrac34\right)} {2\,K\!\left(\tfrac14\right)} = 0.639630785585503\ldots \] in the normalization $\operatorname{Vol}(T)=2/3$, inradius $r_T=\sqrt2/4$. In particular $2\,\operatorname{Area}(Σ^{*}_{A})\operatorname{Area}(Σ^{*}_{B})=1$, which we show is the Bonnet relation for the adjoint pair $(\mathrm{D},\mathrm{P})$. The proof is a reversal of the usual strategy: rather than uniformizing the Gauss map, we identify Smyth's three Plateau contours as the $\textit{tetrahedral four edges}$ and the $\textit{octahedral four edges}$ --- classically solved by $\mathrm{D}$ and $\mathrm{P}$ respectively --- and then conjugate. Both areas agree with Surface Evolver computations of Ken Brakke to all $15$ reported digits. We also show that all twelve corners of the three disks are midpoints of edges of $T$, each of the six midpoints being used twice, and that $T$ is precisely the alcove of the affine Weyl group $\widetilde{A}_{3}$, confirming a remark of Gandy, Cvijović, et al. (1999).

comments
28 pages, 4 figures
fields
Differential Geometry, Classical Analysis and ODEs
pdf ↗ page arXiv:2610.22013 ↗

This is the third paper in a series that reads the dividing lines of Shelah's classification theory as properties of bipartite quantum observables. Here we study simplicity through two countable structures with simple unstable theories: the Rado graph, and the symplectic space of labels of Pauli strings of finite support, in which addition records the products of the strings and the symplectic form records their commutation. In the second structure, forking characterizes the logical errors of stabilizer codes: an error undetectable by the checks of a code is logical exactly when its type over the stabilizer labels and a complete set of logical-operator labels forks over the stabilizer labels, and the independence theorem becomes a rule for gluing syndromes. A two-valued relation between countable sets of labels defines a diagonal bipartite observable, whose real-valued theory describes Alice's probability mixtures of labels and their expected responses at Bob's probes. Mixing changes the classification: if the relation has the independence property, this theory has the tree property of the second kind. For the observable of the symplectic form, actual mixtures of checks witness this property for the response itself; for the observable of the Rado graph, every array that witnesses it for a quantifier-free formula in Bob's probe contains idealized preparations, which lie outside the original structure.

comments
24 pages. Third paper of the series "Classification of Bipartite Observables" by the same authors
fields
Logic
pdf ↗ page arXiv:2610.22205 ↗

Stochastic gradient Langevin dynamics (SGLD) has a discretization error of first order in the step size $h$, even with the full gradient. We study the stochastic gradient Leimkuhler–Matthews (SGLM) integrator, which has the same cost as SGLD, one stochastic gradient per step, and reuses each Gaussian vector in consecutive steps. With the full gradient, SGLM is the Leimkuhler–Matthews (LM) integrator, whose discretization error for the invariant distribution is of second order. For a potential strongly convex outside a ball, we prove the bound $\mathcal O(\frac{1}{Nh} + Σ^2 h^2 + h^4)$ on the mean square error (MSE) of time averages of SGLM over $N$ steps, where $Σ$ bounds the variance of the gradient noise. The proof uses a modified class that absorbs the non-Markovian part of SGLM. The discretization error enters this bound as $h^4$ and the MSE bound of SGLD as $h^2$, while a larger batch reduces only the term $Σ^2 h^2$ in both bounds. In Bayesian logistic regression on MNIST, SGLM has a smaller estimated MSE than SGLD. The coefficient of $h$ in the numerical bias of SGLM is given explicitly by the covariance of the gradient noise and the continuous Poisson equation. The coefficient for SGLD contains in addition the Hessian of the potential, which comes from the discretization error. Through Riesz representors, the coefficients of the numerical bias determine the coefficients of the Wasserstein-1 errors of SGLM and SGLD.

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

Foraging recruitment is modeled as a contagion: an agent that finds a resource triggers a linear-threshold cascade on the group's communication network. Because activation is degree-normalized, crowding shuts the cascade off, so the swarm aggregates on a resource and then disperses to explore again. Acting on the cascade moves agents in space, and that motion rewires the network, so recruitment and exploration are one coupled process; removing this coupling alone abolishes the self-limitation. Recruitment spreads only within a connectivity window, bounded below by percolation onset and above by degree-blocking. The swarm self-organizes to the near-critical edge of this window -- self-organized quasi-criticality: recruitment sits near but below the critical point without settling onto a clean, size-invariant critical state, and the activity spectrum has a finite correlation time (Lorentzian-like, not 1/f), consistent with local rather than global criticality. Recruitment raises harvest up to 2.7x over solitary search on sparse, clustered resource fields and loses (down to 0.37x) on abundant or uniform ones; because resources generically aggregate, the favourable regime is the common one. The empirically motivated Levy search and the resource field it exploits are both least-committal: the search a maximum-caliber walk, and the field a maximum-entropy point process whose generic, aggregation-set sign is clustered (attractive). The search exponent that maximizes harvest tracks the field's fractal dimension (a heavier-tailed, more ballistic search for more strongly clustered fields). These are one coupled mechanism: heavy-tailed Levy exploration crosses the field's sparse voids while recruitment cascades exploit its clusters, so one maximum-entropy geometry binds exploration and recruitment into a single self-organizing cycle.

comments
21 pages, 19 figures (7 main + 12 SI), 1 tables, Code and data: https://github.com/galenwilkerson/collective-foraging-cascades
fields
Mathematical Physics
pdf ↗ page arXiv:2610.24865 ↗

Let $Q_{p,q}(t)\in\mathbb{Z}[t]$ be Sharipov's even monic degree-$10$ second cuboid polynomial, with coprime positive integers $p\ne q$. We prove that $Q_{p,q}(t)$ is irreducible over $\mathbb{Q}$, and hence over $\mathbb{Z}$. More generally, the normalized associated quintic $P_s(x)$ and its composition $P_s(t^2)$ are irreducible over $\mathbb{Q}$ for every $s\in\mathbb{Q}\setminus\{0,\pm1\}$. The proof reduces linear and quadratic factors to rational points and horizontal conjugate pairs on one fixed genus-$2$ curve. A certified rank upper bound for its Jacobian, together with an exact divisor calculation, gives a rank-one annihilating differential at the prime $3$. For the quadratic-factor case, the symmetric coordinates of a horizontal pair lie on an explicit double cover of an elliptic quartic. All rational affine points on this model are $3$-adically integral and reduce to six smooth residue classes. The pulled-back differential is a unit in each class, proving that six displayed points form the complete list. Their coordinates exclude every admissible parameter. A negative real root of the irreducible quintic then supplies the additional degree argument required for irreducibility of the degree-$10$ polynomial. The rank computation and all exact arithmetic certificates are specified explicitly for reproduction.

comments
A complete proof of the second perfect cuboid conjecture (Sharipov's second conjecture)
fields
General Mathematics
pdf ↗ page arXiv:2610.25319 ↗

Let \[κ_{A_4} = \frac{35 π}{1458 \sqrt{3}} \prod_{p \equiv 1 \pmod{3}} \left(1 - \frac{1}{p}\right)^3 \left(1 + \frac{3}{p} \right) \prod_{p \equiv 2 \pmod{3}} \left(1 - \frac{1}{p^2} \right)^2\] and $N_{A_4}(X)$ be the number of $A_4$-quartic fields of discriminant up to $X$. We establish the asymptotic formula \[N_{A_4}(X) = κ_{A_4} X^{\frac{1}{2}} \log X + O_{\varepsilon} \left(X^{\frac{1}{2}} (\log \log X)^{3+\varepsilon} \right).\] As part of our proof, we also establish that the average size of the $2$-torsion of the class group of cyclic cubic fields is bounded. As an application of our theorem, we obtain the consequence that the number of tetrahedral holomorphic cuspidal newforms of weight 1 of level $N$ is $O_{\varepsilon}(N^{\varepsilon})$ on average.

comments
51 pages, comments welcome! (Submitted version; also proved a lower bound for the number of tetrahedral cuspidal newforms of level up to $N$, as well as other expository improvements)
fields
Number Theory
pdf ↗ page arXiv:2610.26510 ↗

Let $r>2$ and let $p,q\in(0,\infty)$ satisfy $r^{-1}=p^{-1}+q^{-1}$. We prove that every $T\in \mathcal{S}_r(\mathcal H)$ is a single commutator $T=[A,B]$ with $A\in \mathcal{S}_p(\mathcal H)$ and $B\in \mathcal{S}_q(\mathcal H)$. Combined with L. G. Brown's theorem for $1 \leq r \leq 2$, this completely resolves the Pearcy–Topping problem for Schatten ideals. We also obtain simultaneous operator and Schatten norm bounds for the factors.

comments
Substantial Revision
fields
Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2610.27024 ↗

A Hadamard matrix is a square matrix with entries $\pm 1$ whose rows are mutually orthogonal. Hadamard matrices are conjectured to exist at every order divisible by $4$; for approximately the last twenty years, the smallest open case of this conjecture was order 668. In August 2026, Alpöge, Voinov and Reynolds-Haertle announced Hadamard matrices at the twelve orders below $2000$ at which none was known. In this paper we verify and analyse the claimed matrices. We survey results on the existence of Hadamard matrices and list the $85$ orders up to $10\,000$ at which no Hadamard matrix is currently known. In pursuing this work we constructed Hadamard matrices at sixteen orders that were open in the published literature. We conclude with a list of open problems.

comments
Updated to reflect 10 additional orders closed since our initial upload
fields
Combinatorics
pdf ↗ page arXiv:2610.27175 ↗

In this paper, we establish sharp gradient stability of the $L^{p}$-Poincaré inequality with explicit constants on bounded convex domains for any $1<p<\infty$. These estimates control the distance to the optimizers in the strongest possible norm with the optimal stability exponent $\max\{2,p\}$, exhibiting the same phenomenon initially observed by Figalli and Zhang [FZ22a] for the $L^p$-Sobolev inequality. In the case $1<p<2$, we also establish a sharp upper bound gradient stability estimate with an explicit constant and the optimal exponent $p$, matching the exponent obtained by Ignat and Zuazua [IZ26]. By extending the lower stability estimate to general bounded domains with $C^2$ boundary, we are able to confirm the conjecture posed by Fleckinger-Pellé and Takáč [FPT02, Section 8]. Finally, we apply the stability inequality to obtain positive fundamental gap estimates in terms of the inradius for the Dirichlet $p$-Laplacian.

comments
37 pages; added a global upper gradient stability bound for 1<p<2, updated references
fields
Analysis of PDEs, Spectral Theory
pdf ↗ page arXiv:2610.27281 ↗

In this paper, we provide the exact formula for the $\mathrm{v}$-number of powers of the edge ideal of a cubic circulant graph $C_{2n}(a,n)$ with $1\le a<n$.

comments
There is an error in the formula in Theorem 4.13; it needs to be corrected
fields
Commutative Algebra
pdf ↗ page arXiv:2610.27545 ↗

Amplituhedra are semi-algebraic sets of fundamental importance in particle physics. Their discovery initiated the field of Positive Geometry. We settle a central conjecture in this field: we show that the $m=2$ amplituhedron is a positive geometry. Our main new tool is a Hodge-theoretic criterion for being a positive geometry, connecting the work of Brown–Dupont with the original setup of Arkani-Hamed–Bai–Lam.

comments
31 pages, 3 figures. Comments welcome!
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.27903 ↗

Cutting planes (cuts) remove fractional solutions from mixed-integer linear programs (MILPs) without excluding any feasible integer solutions, making them a key ingredient in modern MILP solvers. Current state-of-the-art solvers rely on fine-tuned handcrafted cut strategies, which, despite their effectiveness, remain inherently static and can be suboptimal. More recently, learning-based approaches have been proposed to design adaptive cut strategies; however, most of these methods are based on neural networks, offering limited interpretability and providing no guarantees of convergence. In this paper, we propose \emph{Genetic Programming and Statistics-based Cut Selection} (GPSCS), the first learning-based framework that explicitly generalizes handcrafted cut selection heuristics into a fully interpretable policy. First, a genetic programming model evolves a symbolic scoring function that ranks candidate cuts using features derived from the cuts and the solving context. Second, a lightweight statistics-based mechanism adaptively determines the number of top-ranked cuts to add at each separation round by detecting significant score dropouts. We evaluate GPSCS within the SCIP solver on seven classes of synthetic and real-world benchmark instances, with a strong emphasis on generalization: evaluation instances are on average 41 times harder than those used for training. Experimental results show that GPSCS improves average solving time by $6\%$ compared to SCIP's default cut selection strategy and achieves a two-fold speedup over both a recent neural-network-based approach and a no-cut baseline, demonstrating strong robustness and generalization across heterogeneous MILP families.

fields
Optimization and Control
pdf ↗ page arXiv:2610.29311 ↗

We establish eventual strict log-concavity and quantitative level-set curvature bounds for the Fisher-KPP equation $u_t=Δu+u-u^2$ in $\mathbb R^N$, $N\geq2$, with nontrivial, nonnegative, smooth compactly supported initial data. Specifically, there exist $T>1$ and $c>0$ such that $D_x^2\log u(t,x)\leq-(c/t)e^{-2(\sqrt2-1)t}\mathrm{Id}$ for all $t\geq T$ and $x\in\mathbb R^N$. Consequently, after a single waiting time, the solution has exactly one critical point, which is a nondegenerate global maximizer, and every positive level set below the maximum is smooth, closed, and strictly convex with positive principal curvatures. Moreover, for levels in any fixed closed interval $K\subset(0,1)$, the principal curvatures are uniformly bounded below by $(1-C\log t/t)/(2t)$ for all sufficiently large $t$. The proof combines one-sided second angular derivative estimates for the fixed-front region, absorptive comparison in the invaded interior, leading-edge barriers and blow-up arguments through the diffusive scale, and uniform Gaussian amplitude estimates in the exterior.

comments
44 pages, 1 figure. Revised and shortened version
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.30702 ↗

We prove the all-exp property for the Traveling Salesman Problem with the $2$-opt neighborhood, and for $(3,2,2)$- and $(2,3,2)$-Maximum Constraint Assignment with the flip neighborhood. The all-exp property states that infinitely many instances have an initial solution from which every sequence of improving moves to a local optimum, and hence every run of local search, has exponential length. For the Traveling Salesman Problem, the all-exp property was previously known for every $k$-opt neighborhood with $k \ge 3$, so our result for $2$-opt completes the picture for all $k$-kopt neighborhoods. In $(p,q,r)$-Maximum Constraint Assignment, each constraint involves at most $p$ variables, each variable occurs in at most $q$ constraints, and each domain has size $r$. Decreasing any of the parameters of $(3,2,2)$ or $(2,3,2)$ yields a problem in which every sequence of improving flips has polynomial length, so both Maximum Constraint Assignment results are tight. All three results settle long-standing open problems. Our proofs build on a common construction idea, which reveals a close connection between the local-search dynamics of the three problems.

comments
37 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.31513 ↗

A thrackle is a drawing of a graph in the plane in which every pair of edges meets exactly once, either at a common endpoint or at a proper crossing. Conway conjectured that every thrackle has at most as many edges as vertices. We give a short proof that every thrackle on $n\ge4$ vertices has at most $\lfloor4(n-1)/3\rfloor$ edges. The proof combines Pammer's computer-assisted verification of the conjecture for graphs on at most twelve vertices with a discharging argument in suitable plane and projective-plane embeddings. We also give bipartite plane graphs showing that the coefficient $4/3$ is best possible under the local hypotheses used in the proof.

comments
6 pages
fields
Combinatorics, General Topology, Geometric Topology
pdf ↗ page arXiv:2610.31589 ↗

We give a complete characterization of the kernels $Ω\in \Lup^1(\mathbb S^{d-1})$ for which the rough singular integral $\T_Ω$ and its associated maximal operator $\M_Ω$ satisfy pointwise bounds in terms of $\Int_1(|\nabla \cdot|)$ and $\M_1(|\nabla \cdot|)$, respectively, where $\Int_1$ is the Riesz potential and $\M_1$ is the fractional maximal operator. We show that these bounds hold if and only if $Ω$ belongs to the homogeneous dual Sobolev space $\dot \W^{-1,\infty}(\mathbb S^{d-1})$. This characterization yields both a PDE characterization and a geometric characterization of the pointwise bounds. In the Lebesgue scale, we show that, for $d\geq 3$, every rough operator associated to a mean-zero kernel $Ω\in\Lup^{d-1,\infty}(\mathbb S^{d-1})$ satisfies these pointwise bounds, and that the exponent $d-1$ is sharp. In dimension $d=2$, we use complex-analytic methods to establish a new pointwise bound in terms of the complex derivatives $\bar\partial f$ and $\partial f$, which are valid for every mean-zero $Ω\in\Lup^1(\mathbb S^1)$. As a consequence, we obtain new Sobolev bounds for rough singular integrals in the plane.

comments
v2. Added additional detail in Section 2 and references
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.31888 ↗

In this article we give an algorithm to produce infinitely many explicit quadratic twists of a given elliptic curve over $\mathbb{Q}$ with a rational point and fixed root number. Moreover, under the Parity Conjecture (or other technical hypotheses), for each $n\geq 1$, we produce explicit multi-quadratic extensions $L_n$ of $\mathbb{Q}$, of degree $2^n$, such that the growth in rank from $\mathbb{Q}$ to $L_n$ is at least $\max\{2n+2^{n-1}-1,\,2^n-1\}$ when the root number of $E$ is $-1$, and at least $\max\{2n,\,2^{n-1}+2n-2\}$ when it is $+1$. As a result, assuming Parity, we exhibit elliptic curves over $\mathbb{Q}$ and extensions of degree $2^n$ where the rank after base-extension is greater than or equal to $32+\max\{2n,\,2^{n-1}+2n-2\}$ or $30+\max\{2n+2^{n-1},\,2^n\}$.

comments
In this version we incorporate a suggestion by Andrej Dujella. Our thanks to him for his suggestions, which improves Theorem 1.2, part 4(c)
fields
Number Theory
pdf ↗ page arXiv:2610.31925 ↗

Let $T(q,p)=\langle x,y\mid x^p=y^q\rangle$, where $p,q>1$ are relatively prime, and let \[ R=\Hom(T(q,p),\mathrm{SL}_2(\mathbb C)). \] We compute the integral homology of the singular locus of $R$. We show that this locus has complex dimension $2$ and is a disjoint union of $μ=(p-1)(q-1)$ smooth affine surfaces, each homotopy equivalent to the two-dimensional sphere. Consequently, \[ H_0(\Sing R;\Z)\cong H_2(\Sing R;\Z)\cong\Z^μ, \] and all remaining homology groups vanish. Thus both nonzero Betti numbers equal the first Betti number of the Milnor fiber of the plane curve singularity $z^p+w^q=0$, namely its Milnor number $μ$.

comments
9 pages, 1 figure
fields
Geometric Topology, Algebraic Geometry, Group Theory, Representation Theory
pdf ↗ page arXiv:2610.32064 ↗

This paper is the first to study the continuous-time mean-variance portfolio selection problem with no-shorting constraints in a Markov regime-switching market using reinforcement learning (RL). The main challenge stems from the interaction between random regime shifts and portfolio non-negativity constraints, which typically causes the coupled Hamilton-Jacobi-Bellman (HJB) equations to lose smoothness across different state regions. Additionally, directly imposing no-shorting constraints on randomized policies disrupts their analytically tractable Gaussian structure, complicating both exploratory modeling and reinforcement learning. To address these challenges, we propose an auxiliary exploratory approach that limits the policy to a Gaussian distribution and applies the no-shorting constraint solely to its mean. We explicitly characterize the optimal policy for this auxiliary problem and demonstrate that, by appropriately selecting the exploration variance, its optimal mean policy exactly matches the optimal policy of the original constrained mean-variance problem. Building upon this analytical framework, we develop a model-free reinforcement learning algorithm that learns the optimal portfolio policy directly from trajectory data. Numerical experiments support the theoretical results and show that the proposed method can effectively recover the optimal no-shorting portfolio in a regime-switching market.

fields
Optimization and Control
pdf ↗ page arXiv:2610.32301 ↗

Let $G$ be an $H$-free graph. A non-edge $e$ of $G$ is called an $H$-saturating edge of $G$ if $G+e$ contains a copy of $H$. For an integer $p\geq 4$, let $W_p:=K_1\vee C_{p-1}$, and let $F_{p}:=K_1\vee P_{p-1}$. Let $f_H(n,m)$ denote the minimum number of $H$-saturating edges of an $n$-vertex $H$-free graph with exactly $m$ edges, and let $\operatorname{ex}(n,H)$ denote the Tur{á}n number. In this paper, for each fixed integer $k\geq 3$, we determine the exact value of $f_{W_{2k+1}}(n,\operatorname{ex}(n,F_{2k})+1)$ and show that $f_{W_{2k}}(n,\operatorname{ex}(n,F_{2k-1})+1)=\left(\frac{2}{33}+o(1)\right)n^2.$ Moreover, we characterize the corresponding extremal graphs.

fields
Combinatorics
pdf ↗ page arXiv:2610.33041 ↗

Previous studies have indicated that the local defocusing nonlinear Schrödinger equation (NLSE) is modulationally stable. Therefore, superregular solitonic solutions characterizing the nonlinear evolution of modulational instability under weak localized perturbations do not exist. In this work, we study the nonlinear stage of the modulation instability of a condensate in the framework of the defocusing nonlocal NLSE. By using the dressing method and Joukowski transformation, we systematically derive the general $N$-solitonic solution of the defocusing nonlocal NLSE, and the explicit expressions for one-solitonic, two-solitonic and superregular two-solitonic solutions are provided. Then dynamics of these solutions is also examined. We find that these solutions show a much wider variety than those in the local NLSE, such as the one solitonic solution composed of two interacting wave components and the two-solitonic solution containing four wave components. Finally, the accuracy and noise robustness of the analytical solutions are confirmed by numerical simulations. Such results advance the theory of superregular solitonic solutions in nonlocal systems and offer new physical understanding of wave propagation in nonlocal nonlinear media.

comments
24 pages, 7 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.33560 ↗

We construct a coercive, locally Lipschitz, semialgebraic function on $\mathbb R^2$ for which BFGS with Armijo–Wolfe line search converges to a non-Clarke-stationary point from a nonempty open set of initial points and inverse-Hessian estimates. This disproves the almost-sure stationarity assertion in the 2013 challenge of Lewis and Overton. The construction and proof combine analytical arguments with computer-assisted verification of explicit inequalities.

code
github.com/LexiaoLai/Nonsmooth-BFGS-Nonstationary ∎ Lean project (lakefile.toml, lean-toolchain) builds, no sorry at 73f5282, checked 2026-11-05 build details
comments
23 pages, 2 figures. Verification code and Lean formalization: https://github.com/LexiaoLai/Nonsmooth-BFGS-Nonstationary
fields
Optimization and Control
pdf ↗ page arXiv:2610.34087 ↗

We provide sharp estimates on the number of vertices needed to approximate the Euclidean unit ball $B_d\subset\mathbb R^d$ with relative symmetric-difference volume error at most $\varepsilon\in(0,1)$. We show that the minimum vertex budget $N_\varepsilon(d)$ satisfies $$\log N_\varepsilon(d)\asymp d\log\left(1+\frac1{\varepsilon\sqrt d}\right).$$ In particular, $\exp(O(\sqrt d/\varepsilon))$ vertices suffice for every $\varepsilon\in(0,1)$ and all sufficiently large $d$. We also prove that achieving a fixed error $\varepsilon\in(0,1)$ requires at least $Ω\bigl((\tfrac{1+\varepsilon}{2\sqrt\varepsilon})^{d-1}\bigr)$ facets, an exponential number in $d$. We extend our vertex approximation result to Gaussian symmetric-difference error, and give a positive answer to the question of De, Nadimpalli, and Servedio about subexponential vertex complexity for approximating Euclidean balls. We also disprove a Macbeath-type extremality principle for unrestricted vertex approximation. Whereas the ball uniformly maximizes the inscribed approximation error among all convex bodies (Macbeath, 1951), we show that approximating the hypercube $[-1,1]^d$ to relative error $\varepsilon$, with $δ:=1-\varepsilon$, requires $N\ge\fracδ{2}\exp(Ω(δ^2d/\log^2(2/δ)))$ vertices whenever $d\ge16\log(2/δ)$. Thus, when $d$ is large, the cube is harder to approximate than the ball in this sense. Finally, we determine the sharp dimensional order of the classical Laguerre-Delone triangulation number, showing that $\mathrm{ldel}_{d-1}=Θ(d^{-1/2})$ as $d\to\infty$. This improves both the upper bound of Ludwig, Schütt, and Werner and the lower bound of Böröczky by a factor of order $\sqrt d$. By classical asymptotic approximation theorems (Ludwig, 1999), this improvement applies to every convex body in $\mathbb R^d$ with $C^2$ boundary and positive Gaussian curvature.

comments
71 pages, 1 figure, 1 table. v2: exposition and references revised for a broader audience
fields
Metric Geometry
pdf ↗ page arXiv:2610.34651 ↗

Dereziński and Gérard constructed the Gaussian $β$-Markov path space of a free Bose field in a form equivalent to the Araki–Woods representation, which suits nonequilibrium statistical mechanics with a quantum-field environment, but only for one-particle Hamiltonians with a spectral gap. We extend this construction, together with the equivalence to the Araki–Woods representation, to one-particle Hamiltonians without a spectral gap. For one-particle Hamiltonians joined by isometric embeddings that intertwine their spectral measures and test spaces, as for nested momentum lattices, and for compatible regularizers, the path spaces form a projective system whose limit carries the time translations and the reflection, which gives a quasi-local construction. The extension is intended for constructive quantum field theory at positive temperature and equilibrium statistical mechanics, for instance in the problem of the absence of Bose–Einstein condensation of quasiparticles whose number is not conserved.

comments
20 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2610.34783 ↗

Let $V_{g,n}$ be the Weil–Petersson volume of the moduli space of hyperbolic surfaces of genus $g$ with $n$ cusps. The fixed-$n$ large-genus expansion of Mirzakhani and Zograf has correction terms polynomial in $n$ of degree $2i$ at order $g^{-i}$, and is no longer asymptotically ordered by powers of $1/g$ when $n$ is of order $\sqrt g$. We prove an asymptotic expansion in powers of $1/g$, uniform in $n\ge0$. For $n\ge1$, its coefficients are analytic in a density parameter on a neighborhood of a compact interval, including the limits $n/g\to0$ and $n/g\to\infty$. Its explicit leading term contains no undetermined constant and has relative error $O(1/g)$; truncation at a sufficiently small multiple of $\sqrt g$ gives relative error $O(\mathrm{e}^{-a\sqrt g})$ for some $a>0$. For fixed $n$ this confirms Zograf's conjecture that the constant in the Mirzakhani–Zograf asymptotics is $1/\sqrtπ$. We also determine, at every cusp density, the asymptotic profiles of the volume ratios $V_{g,n}/V_{g-1,n+2}$ and $V_{g,n+1}/(2gV_{g,n})$ and, in all degrees, the asymptotic ratios of adjacent coefficients of the one-boundary volume polynomial; this answers two questions of Mirzakhani. The proof deforms mixed $κ_1$--$ψ$ intersection numbers into pure $ψ$ intersection numbers along a family whose recursion has nonnegative coefficients, determines the overall constant through Painlevé I without assuming that the Weil–Petersson genus expansion is resurgent, and recovers individual volumes by Gaussian and Poisson coefficient extraction. As an application, the spectral gap of a Weil–Petersson random surface with $n$ cusps tends to zero in probability whenever $n/\sqrt g\to\infty$; this removes the restriction $n/g\to0$ from a theorem of Shen and Wu.

comments
112 pages, no figures. Updated authorship, affiliations and funding; revised exposition and added a link to the accompanying Lean formalization repository. An earlier version (Zenodo v1) was published on 16 October 2026: https://zenodo.org/records/23414478
fields
Differential Geometry, Algebraic Geometry
pdf ↗ page arXiv:2610.35492 ↗

The Maxwell graph of a directed acyclic graph records the extrema of its iterated basin and hill boundaries. Their unweighted counts need not satisfy Morse inequalities, and the reduction can change homology. We assign multiplicities using the reduced homology of lower and upper order links and retain every vertex with nonzero local homology. This modified reduction preserves both hierarchies, the local groups, and the homology of all sublevel and superlevel order complexes. Its Morse numbers satisfy the weak and strong Morse inequalities over any field. We give explicit formulas in low dimensions and for complete layered graphs. We also construct local Morse numbers for path homology and prove agreement with the reachability construction on complete layered graphs, including those without transitive arrows. Counterexamples distinguish the homology theories and show that local Morse degrees need not equal vertex depths. A comparison with discrete-gradient methods explains the role of auxiliary choices.

comments
25 pages
fields
Algebraic Topology, Combinatorics
pdf ↗ page arXiv:2610.36372 ↗

We study degree $1$ minimisers $u: (Σ,g) \to S^2$ for a Baby-Skyrme model with a Sacks-Uhlenbeck regularisation term $E^α(u) = \frac{1}{2} \int_Σ (1+\vert \nabla u \vert^2)^{α+1} -1 dv_g$ and establish convergence of degree $1$ minimisers to a simple bubble tree as $α\to 0$. We also obtain a new no-neck result for the classical Sacks-Uhlenbeck energy $E^α$.

comments
Minor corrections
fields
Analysis of PDEs, Mathematical Physics, Differential Geometry
pdf ↗ page arXiv:2610.37457 ↗

We investigate the structure of degree $1$ minimisers of a Baby-Skyrme energy of maps $u:Σ\to S^2$ regularised by a Sacks-Uhlenbeck perturbation, and we establish quantitative convergence rates to a simple bubble tree consisting of a single degree $1$ bubble and a constant base map.

comments
Minor corrections
fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2610.37499 ↗

Many equivalence relations of mathematics (Green's relations on a semigroup, orbit relations of group actions, conjugacy) are defined by transforming a morphism on its two sides. We put them in one framework. A \emph{comparison datum} produces a category, the \emph{comparison category}, whose arrows are the allowed transformations, and two morphisms are related when they can be compared in both directions. Its \emph{normal form} is a Grothendieck construction, so every such relation is mutual reachability for an action; Green's relations and orbit relations are worked out in detail from it. If the way morphisms are transported is an arbitrary function, every relation occurs, so the real constraint is the \emph{regularity} of the transport. For completely functorial data we show that the relations obtained contain Green's relations, congruences, conjugacy and twisted conjugacy, we describe them on finite groups through double cosets, and we prove a dichotomy on nil monoids.

comments
AI-generated from an initial draft and supervision by the author. 11 pages
fields
Category Theory
pdf ↗ page arXiv:2610.38143 ↗

We introduce a new framework for stochastic variational inequalities with oblique reflections generated by non-symmetric matrix coefficients. The loss of symmetry fundamentally changes the structure of the reflected dynamics: besides the dissipative component, it produces a genuinely gyroscopic component describing rotational effects that are invisible to the associated energy forms. To capture this hidden component, we consider planar obstacle problems and we lift the dynamics to an extended phase-space system, where the dissipative and gyroscopic mechanisms are naturally separated. This leads to a new notion of solution, for which we establish existence and uniqueness. The resulting framework allows for genuinely rotated reflections, which can lead to angle-controlled rotations.

comments
30pp., submitted for publication
fields
Probability
pdf ↗ page arXiv:2610.38381 ↗

Let $\mathcal{S}_χ$ be a cuspidal representation of $\mathrm{GL}_2(q)$. A subset $S \subseteq \mathrm{GL}_2(q)$ is $t$-intersecting if $\dim_{\mathbb{C}}\{v \in \mathcal{S}_χ: g_1v = g_2v\} \geqslant t$ for any $g_1, g_2 \in S$. For $q = p^f$, where $p$ is an odd prime, $f \geqslant 2$, and $1 \leqslant t < p$ is an integer, we determine the maximum size of an $t$-intersecting subset when $χ(-1) = -1$, and when $χ(-1) = 1$ with $t \leqslant 2$. The proof combines explicit fixed-space dimensions, attaining subgroup constructions, and weighted spectral bounds for normal Cayley graphs.

fields
Combinatorics
pdf ↗ page arXiv:2610.38472 ↗

We study pointwise estimates for positive, $C^4$-solution $u$ to the fourth-order Hénon equation \[ Δ^2 u = |x|^σu^p \quad \text{in } \mathbf R^n \setminus \{0\} \] with $n \geq 5$, $p>1$, and $σ>-4 $. In an earlier work published in J. Anal. Math. 140 (2020) 371-394, Z. Guo, X. Huang, L. Wang, and J. Wei established the following pointwise estimate \[ -Δu \geq \frac 2{n-4} \frac{|\nabla u|^2}u + \sqrt{\frac {n(n-4)}{n^2-4}} u^\frac{n}{n-4} \quad \text{in } \mathbf R^n \setminus \{0\} \] for radial solutions to the critical, fourth-order Lane-Emden equation, namely $σ= 0$ and $p=(n+4)/(n-4)$. Inspired by this interesting result, we establish a similar pointwise inequality \[ -Δu \geq \frac 2{n-4} \frac{|\nabla u|^2}u + \sqrt{\frac 2{p+1- \frac 8{n(n-4)}}} |x|^{\frac σ2} u^\frac{p+1}2 \quad \text{in } \mathbf R^n \setminus \{0\} \] for radial solutions to the fourth-order Hénon equation in $\mathbf R^n \setminus \{0\}$ for any $σ\geq 0$ and $p \geq (n+4 + σ)/(n-4)$. We also show that the constant $2/(n-4)$ is sharp and that the thresholds $σ\geq 0$ and $p \geq (n+4 + σ)/(n-4)$ are necessary. As in our previous study on the case of $\mathbf R^n$, our proof is also based on the Bernstein technique via the maximum principle, hence appears to be simpler and more constructive. However, to avoid possible singularity at the origin, we develop a Bernstein technique in one-dimensional space, which is capable of handling equations in punctured spaces.

comments
23 pages, 1 table
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39134 ↗

We derive analytic expressions for observable dynamics under the fully quantized trilinear Hamiltonian, governing quantum three-wave mixing and parametric amplification. Starting from a coherent pump and vacuum signal and idler, the calculation reorganizes the Heisenberg expansion into resummed depletion and return profiles, yielding directly evaluable expressions for all 1st-, 2nd- and 3rd-order correlations. The construction uses no parametric approximation or fitted parameters. Representative numerical benchmarks show errors of order $10^{-12}$ throughout the entire pump depletion, and below $10^{-3}$ across dozens of depletion-and-back-conversion cycles, up to the first total collapse of the oscillation. The first-depletion treatment additionally provides 4th-order correlations, accommodates bright squeezed-pump inputs and reveals phenomena important to future optical quantum technologies. The framework can be extended to higher moments.

comments
6 pages, 3 figures, plus 111 pages of Supplemental Material. MATLAB code and Python notebooks included as ancillary files
fields
Mathematical Physics
pdf ↗ page arXiv:2610.39387 ↗

By Gilmer's splitting lemma, the linking form of a rational homology sphere that bounds a 4-manifold is the orthogonal sum of a metabolic summand and a summand presented by a form of the rank of the intersection form. The lemma underlies Gilmer's slice genus theorem and the rank criteria of Murakami-Yasuhara and Gilmer-Livingston for nonorientable surfaces and the 4-dimensional clasp number. We show that the lemma and these results, as stated, are false. For each prime $p \equiv 3 \pmod 8$ we construct knots bounding smooth Möbius bands, and knots bounding smooth punctured tori with clasp number one, whose linking forms have no such summand of rank at most two. We then determine what remains true: the lemma holds up to Witt equivalence and for cube-free orders, and its conclusions about summands hold away from exceptional primes and for orientable surfaces of genus at least two. Finally, we find the optimal Witt-class bound for the topological nonorientable 4-genus.

fields
Geometric Topology, Mathematical Physics, Algebraic Topology
pdf ↗ page arXiv:2610.40183 ↗

We prove that the three-dimensional chiral $\Z_p$ Clifford quantum cellular automata of Haah and of Sun–Yang–Wang–Tantivasadakarn–Chen are, for every odd prime $p$, not finite-depth quantum circuits, even after tensoring with arbitrary ancillary degrees of freedom and composing with translations. Previously such statements were known only inside the Clifford category. As a consequence, the group of three-dimensional QCA modulo stabilized circuits and translations is not finitely generated. The key ingredient is a new invariant of invertible subalgebras, which we conjecture to be the square of the total quantum dimension of the hosted anyon theory, modulo rational squares.

comments
v2: reference added
fields
Mathematical Physics, Quantum Algebra
pdf ↗ page arXiv:2610.40235 ↗

We investigate the structure of kernels of finite-rank perturbations of truncated Toeplitz operators. By realizing a perturbed truncated Toeplitz operator on a model space as a suitable matrix-valued truncated Toeplitz operator on an enlarged model space, we identify its kernel with a coordinate projection of the kernel of an associated block Toeplitz operator. This realization enables us to transfer the nearly $S^*$-invariant structure of Toeplitz kernels to the perturbed truncated setting. More precisely, for a perturbation of rank at most $n$, we show that the kernel of the perturbed truncated Toeplitz operator is nearly $S^*$-invariant with defect at most $2n+1$. We then extend the method to truncated Toeplitz operators on multiband spaces. In this setting, a perturbation of rank at most $n$ again preserves the finite-defect nearly $S^*$-invariant structure of the kernel, with the explicit upper bound $2n+2$ for the defect.

comments
31 pages, updated version. Comments are welcome:)
fields
Functional Analysis
pdf ↗ page arXiv:2610.40295 ↗

Recently, Krukowski characterised the Euclidean Fourier transform in terms of its behaviour with respect to differentiation. For locally compact abelian groups, he obtained a characterisation based on the behaviour of the Fourier transform under translation. Each of these results assumed that the operator (to be characterised) is an integral transform (with a kernel satisfying suitable regularity conditions), paired with a normalisation. In this paper, we obtain analogous results for the group Fourier transform on the Heisenberg group. Here, the differentiation property is formulated in terms of the behaviour of the group Fourier transform with respect to the left-invariant vector fields, and the shift property is on its behaviour under right translation. Both of these characterise the group Fourier transform on the Heisenberg group, once paired with a normalisation. Our results assume that the transform is continuous linear, and do not require it to be an integral transform a priori.

comments
20 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.40508 ↗

We confirm a conjecture of the first author [SODA'26] on a strong form of pseudo-telepathy for Khot's $d$-to-$1$ games: for every $d\geq 4$, every $ε>0$, and every $k\in\mathbb N$, there is a $d$-to-$1$ label-cover game of classical value less than $ε$ that admits a perfect quantum strategy using finite-dimensional shared entanglement with measurement contexts of radius at least $k$. As a consequence, there exist graphs whose quantum chromatic number $χ_q$ is $3$ and whose classical chromatic number $χ$ is arbitrarily large. This is the first super-exponential $χ_q$ vs. $χ$ gap, and it improves on the exponential lower bounds of Brassard, Cleve, and Tapp [Phys. Rev. Lett. '99], who produced graphs for which $χ\geq 1.1397^{χ_q}$, and Lalonde, who recently achieved $χ\geq 1.1546^{χ_q}$. To prove the conjecture, we proceed as follows. We start with a ``stretched'' version of the Mermin-Peres magic square, obtained by spacing out its equations and linking them with additional long equation wires. This operation increases the radius of the initial measurement contexts of a perfect quantum strategy for the game, while preserving classical unsatisfiability. We then apply parallel repetition to make the classical value small, and we turn the system into a pseudo-telepathic multi-layered Kneser hypergraph via a PCP construction of Dinur, Guruswami, Khot, and Regev [STOC'03]. Finally, we feed the resulting hypergraph into the reduction of Fei, Minzer, and Wang from hypergraph colouring to $4$-to-$1$ games, we establish quantum completeness of this reduction, and we show that it preserves context radius.

comments
Added an informal overview of the proof (Section 2)
fields
Combinatorics, Operator Algebras
pdf ↗ page arXiv:2610.40571 ↗

We study sample covariance matrices formed from vectors $q_i = Σ^{1/2}u_i \in \mathbb{R}^M$, $1 \leq i \leq N$, where $u_1, \ldots, u_N$ are independent, centered, isotropic random vectors whose coordinates may not be independent. We assume that the random vectors $q_i$ satisfy a concentration bound for their quadratic forms $q_i^T A q_i$. Under this assumption and a regular right edge condition on $Σ$, we establish edge universality and obtain the Tracy-Widom law for the largest eigenvalue of the sample covariance matrix after appropriate centering and scaling. In particular, for log-concave ensembles, our result removes the unconditionality assumption imposed in existing edge universality results~\cite{BX}, resolving the question that originally motivated our work. The concentration assumption also allows us to extend the result beyond the log-concave class.

fields
Probability, Mathematical Physics, Statistics Theory
pdf ↗ page arXiv:2610.41416 ↗

Equivariant Ehrhart theory was introduced by Stapledon (2011) and has since been extensively studied. A central question is whether the numerator in a certain rational function expression for the equivariant Ehrhart series is both a polynomial and effective. In this paper, we propose a modification of the denominator in the rational function expression for the equivariant Ehrhart series of rational polytopes. For rational simplices and rational cross-polytopes whose vertices have coordinates that are reciprocals of integers, we show that the resulting numerator is a polynomial and is effective.

comments
17 pages, 1 table, no figures. We are withdrawing Chapters 5 and 6 due to errors
fields
Combinatorics, Representation Theory
pdf ↗ page arXiv:2610.41529 ↗

A proper coloring $\varphi$ of a graph $G$ is called proper conflict-free if, for every non-isolated vertex $v$, some color appears exactly once in its open neighborhood $N_G(v)$. For a nonnegative integer $k$, a graph $G$ is proper conflict-free $(\mathrm{degree}+k)$-choosable if, for every list assignment $L$ satisfying $|L(v)|\ge d_G(v)+k$ for each $v\in V(G)$, there exists a proper conflict-free coloring $\varphi$ of $G$ with $\varphi(v)\in L(v)$ for each $v\in V(G)$. We prove that every connected graph other than the $5$-cycle $C_5$ with maximum average degree less than $8/3$ is proper conflict-free $(\mathrm{degree}+2)$-choosable. This improves the maximum average degree bound $18/7$ of Kashima, Škrekovski and Xu, and removes the assumption $g(G)\ge7$ from the $8/3$ theorem of Qi, Song and Cao. We also show that the $(\mathrm{degree}+2)$ list-size bound is best possible for graphs with maximum average degree arbitrarily close to $8/3$ from below. As an immediate consequence, our theorem implies that every planar graph of girth at least $8$ is proper conflict-free $(\mathrm{degree}+2)$-choosable.

fields
Combinatorics
pdf ↗ page arXiv:2610.41668 ↗

In 2001, Berenstein and Zelevinsky presented a polyhedral model for the problem of computing tensor-product multiplicities for semisimple Lie algebras. We provide explicit linear equations and inequalities for Berenstein–Zelevinsky (BZ) polytopes of type-$\mathrm{G}_{2}$ Lie algebras. We prove that the denominator of a type-$\mathrm{G}_{2}$ BZ polytope divides $180$, and that this bound is sharp, while the quasi-period of the Ehrhart quasipolynomial of such a polytope is always a divisor of $6$. We also show that BZ~polytopes of type-$\mathrm{G}_{2}$ Lie algebras can fail to satisfy Ehrhart positivity, in contrast to a conjectured property of BZ polytopes for all classical types.

comments
35 pages, 10 figures. Version 2 corrects typos and improves exposition
fields
Combinatorics
pdf ↗ page arXiv:2610.42038 ↗

For parabolic Ahlfors regular sets, we show that the bilateral weak geometric lemma (BWGL), bilateral approximation by unions of planes (BAUP), and corona decompositions by $Lip$(1,1/2) graphs (whose defining functions need not have half-order time derivatives in BMO) are equivalent. These geometric conditions do not imply the strong geometric lemma. A key tool is a parabolic version of Reifenberg's theorem for sets with holes, which we prove here. As an application of these geometric results, we prove that a parabolic Ahlfors $(n+2)$-regular measure $μ$ on $\mathbb{R}^{d+1}$, $1\leq n\leq d-1$, is parabolic uniformly rectifiable if its support satisfies any of these equivalent conditions and the parabolic Riesz transform is bounded on $L^2(μ)$.

comments
84 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.42142 ↗

Motivated by combinatorial identities arising in the study of operator splitting methods and their description in terms of bipartite rooted trees, we establish a connection between operator splitting methods and the theory of combinatorial Hopf algebras. We show that the inclusion-exclusion expansion of the elementary weight of a rooted tree over its rooted subforests can be interpreted as the antipode of Schmitt's Hopf algebra of graphs. This interpretation recovers known identities for operator splitting and partitioned Runge-Kutta methods from general properties of the antipode. We further show that adjoint operator splitting methods can be described algebraically through the antipode and the canonical involution of the original method. The resulting framework also yields new combinatorial identities and connects the analysis of geometric numerical integrators with the theory of incidence Hopf algebras.

fields
Combinatorics
pdf ↗ page arXiv:2611.00145 ↗

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
Corrected data of reference [6]
fields
General Topology
pdf ↗ page arXiv:2611.00249 ↗

We characterize the uniform computational strength of finding (one-way or two-way, directed or undirected) Eulerian paths in countable graphs. In the one-way case, for both directed and undirected graphs, this problem is Weihrauch-equivalent to $\mathsf{lim}\times\mathsf{C}_{\mathbb{N}}'$, where $\mathsf{C}_{\mathbb{N}}'$ is the jump of closed choice on the natural numbers. This refines the proof-theoretic strength of the existence of a one-way Eulerian path given by the reverse mathematics framework. The $\mathsf{C}_{\mathbb{N}}'$ component comes entirely from the difficulty of choosing a starting vertex: with a valid start prescribed, the problem is equivalent to $\mathsf{lim}$, which also characterizes the degree of the two-way directed/undirected Eulerian path problem. We also study the complexity of orienting the edges of a graph while preserving the existence of a one-way/two-way Eulerian path. In the one-way case, this problem is not computable, and we prove that $\mathsf{lim}_2<_{\mathrm{W}}\mathsf{OrientEP}<_{\mathrm{W}}\mathsf{C}_{2}'\sqcap\mathsf{Sort}_2$ and $\mathsf{OrientEP}\not\le_{\mathrm{W}}\mathsf{C}_{\mathbb{N}}$. On the other hand, valid orientations are uniformly computable for two-way paths and for one-way paths with a prescribed valid starting vertex.

fields
Logic, Combinatorics
pdf ↗ page arXiv:2611.00818 ↗

We study some geometric aspects behind the Hodges matrix appearing in the context of scattering amplitudes for the $\mathcal N=8$ supergravity. Through a vector bundle construction, we show that the Hodges matrix gives rise to a canonical rational map from the two-step flag variety to symmetric matrices, called the $\textit{Hodges map}$. This construction allows to define the amplitude geometrically: its vanishing locus is a divisor - the $\textit{MHV gravity divisor}$. Inspired by the Hodges map, we introduce the notion of Hadamard ratio of two varieties. In the case relevant to gravity, this is the ratio of two Grassmannians, which we call the $\textit{pentad variety}$, connecting it to the pentad constraint from algebraic statistics. Moreover, we show that the pentad variety is closely related to the combinatorial algebraic geometry of Martin's affine slope variety, and the phirotopes of Below, Krummeck, and Richter-Gebert.

comments
Comments welcome
fields
Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:2611.00864 ↗

The most important features that distinguish fluid flow in the atmosphere and ocean are the effects of rotation and stratification, which are described by the Boussinesq equations with rotation. This paper examines the stability threshold at high Reynolds number $\mathbf{Re}$ for the 3D Boussinesq equations with rotation near Couette flow and a vertical stratified temperature. For the zero modes, the combined effects of rotation and stratification sustain velocity-temperature oscillations with frequencies bounded away from zero. In the stable rotational regime, rotation suppresses the linear growth associated with the lift-up effect, while stratification sustains oscillations in the double zero modes. Although the zero modes dynamics are not fully dispersive, we exploit the structure of the oscillatory phases and cancellations in the equations to obtain a modified energy estimate for the entire zero modes system. Combining this estimate with enhanced dissipation and inviscid damping of the nonzero modes, we establish a bound for the stability threshold, with order $\mathbf{Re}^{-2/3}(1+\log\mathbf{Re})^{-1-a_0}$ for any fixed $a_0\in(0,1/2)$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.00964 ↗

Recently, Thangavelu introduced the Strichartz Fourier transform on the Heisenberg group. Around the same time, Krukowski characterised the classical Fourier transform on various settings, assuming a priori that the map is an integral transform, based on structural properties and a normalisation. In this paper, we obtain analogous results for the Strichartz Fourier transform, without assuming the characterised map is an integral transform. The spectral property is formulated jointly for the sublaplacian and central vector field, and the translation property uses a twisted form of left translation. The joint spectral property, the twisted translation property and a normalisation at one explicit test function, together characterise the transform on each ray of the Heisenberg fan. The twisted translation property, paired with a Dirac delta property, gives another characterisation. We characterise the radial kernel on each ray by a Laguerre-type differential equation. This gives a characterisation of the Hankel transform.

comments
20 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.01128 ↗

The purpose of this paper is to investigate the finite-order entire solutions of the following Fermat-type partial differential-difference equations: \begin{align*} (P_1(z)f(z+c))^{m_1}+\left(P_2(z)f(z)+\sideset{}{_{j=1}^m}{\sum} Q_j(z)\partial_{z_j}(f(z))\right)^{m_2}=P(z), \end{align*} \begin{align*} (P_1(z)f(z))^{m_1}+\left(P_2(z)f(z+c)+\sideset{}{_{j=1}^m}{\sum} Q_j(z)\partial_{z_j}(f(z))\right)^{m_2}=P(z) \end{align*} and \begin{align*} \left(\sideset{}{_{j=1}^m}{\sum} Q_j(z)\partial_{z_j}(f(z))\right)^{m_1}+\left(P_1(z)f(z+c)+P_2(z)f(z)\right)^{m_2}=P(z), \end{align*} in $\mathbb{C}^m$, where $m_1,m_2\in\mathbb{N}$ such that $m_1+m_2>2$, $c=(c_1,c_2,\ldots,c_m)\in\mathbb{C}^m$, $P(\not\equiv 0)$, $P_1$, $P_2$ and $Q_i\;(i=1,2,\ldots,m)$ are polynomials in $\mathbb{C}^m$ such that $P(z)$ is irreducible in $\mathbb{C}^m$. The results established in this paper generalize those of Xu et al. \cite{Xu-Luo-Cao-2025} from $\mathbb{C}$ to $\mathbb{C}^m$.

comments
24 pages
fields
Complex Variables
pdf ↗ page arXiv:2611.01931 ↗

We study how many split cuts are needed to reach the integer hull, and how large split closures can be. In every fixed dimension, a rational pure-integer polyhedron admits a polynomial-time constructible split proof of its integer hull with polynomial total encoding length; consequently, its full split rank is polynomial in the input length. This establishes the split-rank conjecture of Basu, Conforti, Di Summa, and Jiang for pure-integer polyhedra in fixed dimension. Central to our approach is a preservation result: in arbitrary pure-integer dimension, an inequality whose violating points map, under an affine map with integer coefficients, into the interior of a planar lattice-free polyhedron has a polynomial split proof retaining every point satisfying it. Whereas Chvátal–Gomory closures have polynomial-size inequality descriptions in fixed dimension, split closures need not: tetrahedra of input length $Θ(\log N)$ can have split closures with at least $2N-1$ facets, yet extension complexity $Θ(\log N)$. For the system $x=f+Rs$, $s\ge0$, $x\in\mathbb Z^2$ of input length $L$, the split closure has an exact extended formulation with $O(L)$ inequalities and auxiliary variables; this bound is tight. Separation over the split closure is polynomial-time in fixed total dimension. Finally, on mixed-integer feasible rational polytopes with fixed integer dimension $p$ and arbitrary continuous dimension, we optimize a primitive integral objective on the integer variables using $O_p(G+1)$ split cuts. Each cut removes a current optimal LP vertex, and the algorithm returns an optimal LP vertex that is mixed-integer feasible. $G$ is the integrality gap of the LP relaxation, rounded down.

fields
Optimization and Control
pdf ↗ page arXiv:2611.02169 ↗

We construct compact convex bodies whose boundaries contain a nontrivial geodesic segment and are strictly convex elsewhere. The construction applies if sectional curvature is constant near a point, or if a normal Jacobi operator has a simple maximal eigenvalue. This implies existence of such bodies in any three-dimensional manifold. A further argument to show existence in dimension four.

fields
Differential Geometry
pdf ↗ page arXiv:2611.02355 ↗

For the planar $n$-body problem with homogeneous strong force potentials, given an arbitrary pair of normalized collision-free configurations $(a, b)$, we prove that for any positive energy $h$, there are infinitely many $h$-energy scattering orbits between $a$ and $b$.

comments
The title was incomplete in the previous version and it is fixed now. 17 pages, no figure. Comments are welcome!
fields
Dynamical Systems
pdf ↗ page arXiv:2611.02781 ↗

We study Hodge–Riemann relations for ordinary, sequential, and weak $m$-positive real $(1,1)$-forms in complex dimension $d$. For ordinary $m$-positive forms, we prove the fully mixed relations in every permitted bidegree without assuming semipositivity, generalizing results by Xiao. As a generalization of ordinary $m$-positivity, sequential $m$-positivity is defined by the hyperbolicity cones of successive directional derivatives of the determinant. We formulate a generalized mixed Hodge–Riemann conjecture for this condition and prove several cases beyond the scalar inequalities supplied by hyperbolicity. We prove strict strong positivity for good prefixes with at most three repeated blocks after the first factor. We also consider weak $m$-positivity which corresponds to the pointwise subsolution condition for the complex $m$-Hessian equation. In this setting, we prove the Hodge–Riemann relations for $p\neq q$ and in several diagonal cases, and show that the associated power map induces a pointwise diffeomorphism onto the cone of positive $(d-1,d-1)$-forms. Using Dinh and Nguyên's $L^2$ globalization method, we pass from the pointwise relations to cohomology classes on compact Kähler manifolds. Finally, we propose conjectures on a numerical criterion for sequential positivity and on solvability of the generalized $m$-Hessian equation.

comments
47 pages
fields
Algebraic Geometry, Differential Geometry
pdf ↗ page arXiv:2611.03124 ↗

This paper is concerned with inverse homogenisation problems that aim to identify microstructure features of a body from macroscopic measurements. The unknown microstructure is assumed to vary macroscopically in one spatial direction and affects the effective tensor in an elliptic partial differential equation that governs the behaviour of the body on the macroscale. We establish the well-posedness of the PDE-constrained minimisation problems that model the task of identifying the microstructure, derive first-order necessary optimality conditions, and prove the convergence of a gradient-projection algorithm for the studied problem class in an infinite-dimensional setting. We moreover demonstrate that recently obtained results on generalised differentiability properties of solution maps of bilateral obstacle problems make it possible to set up and analyse a novel semismooth Newton method in the considered situation. The functional analytic setting that we use for our investigation is chosen such that it covers various elliptic PDEs simultaneously (classical second-order equations, bi-Laplace problems, linear elasticity, etc.) and explicitly exploits the problem structure to obtain global convergence guarantees for the studied solution algorithms in terms of the Lipschitz constants of the involved operators. Our analysis is accompanied by numerical experiments which show that the new semismooth Newton approach requires far less expensive projection evaluations than the gradient-descent method and, thus, offers a significant speedup.

fields
Numerical Analysis, Analysis of PDEs, Optimization and Control
pdf ↗ page arXiv:2611.03372 ↗

For fixed Hilbert–Schmidt operators $A,B$ and a standard Gaussian array $G$, the algebraic principal ideal generated by $AGB$ almost surely equals a deterministic ideal obtained by multiplying the square tails of $s(A)$ and $s(B)$. In fixed coordinates, the corresponding singular-value comparisons hold simultaneously for all nonincreasing square-summable diagonal weights. We characterize the numerical arrays with this uniform realization property on any two prescribed rank flags by rectangular operator-norm upper bounds and Hilbert–Schmidt lower bounds; the optimal universal upper dilation is two. A family of strictly positive factors reflects every inclusion of principal ideals if and only if its tail-rank profiles have no common eventual upper bound. Otherwise, every local flag region contains a common fibre whose input ideals form a copy of $\mathcal P(\mathbb N)/\mathrm{Fin}$ as a sublattice. For a specified family of operator-valued Gaussian chaoses, Wick composition with one fixed random operator yields principal ideals that recover these inclusion relations. The random ideal identities hold almost surely for each fixed parameter choice.

comments
26 pages
fields
Probability
pdf ↗ page arXiv:2611.03495 ↗

We prove a sharp magnetic improvement of the family of weighted inequalities on the upper half-space $\mathbb{R}^{N+1}_+$ that interpolate between the Hardy inequality and the trace Hardy inequality. The magnetic potentials are of Aharonov-Bohm type, $\mathbf{A}(x)=|x|^{-1}\boldsymbol{a}(x/|x|)$, where the tangential field $\boldsymbol{a}$ may be singular on a closed subset of the sphere. We compute the sharp constant explicitly: it is given by the constant of the corresponding nonmagnetic inequality, evaluated in a virtual dimension that depends on the first eigenvalue of the magnetic Laplacian on the sphere. In particular, the magnetic trace Hardy constant strictly exceeds its Euclidean value whenever this eigenvalue is positive. The proof rests on a ground state representation of the deficit, which also shows that the sharp constant is not attained in the energy space. As a consequence, we obtain the sharp Hardy inequality for the fractional powers $(-Δ_{\mathbf{A}})^σ$, $0<σ<1$, of the magnetic Laplacian: the constant is the same on smooth functions supported away from the singular set and on the form domain of $(-Δ_{\mathbf{A}})^σ$, and it is not attained. Examples include the planar Aharonov-Bohm potential with nonintegral flux and, in dimension three, the Aharonov-Bohm potential and the Dirac monopole.

comments
35 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.03860 ↗

For arbitrary index set $I$, we determine the center and characterize factoriality for mixed $q$-Gaussian von Neumann algebras $Γ_Q(\cH_\R)$ associated with real symmetric matrices $Q=(q_{ij})_{i,j\in I}$ satisfying $|q_{ij}|\le1$ through the strict graph we introduced in this article. Two vertices $i$ and $j$ of $I$ are joined by an edge in the strict graph if and only if $|q_{ij}|<1$. Let $S$ denote its isolated vertices. We prove that $Γ_Q(\cH_\R)$ is a factor if and only if $q_{ii}=-1$ for every $i\in S$, no two-vertex component $\{a,b\}$ satisfies $q_{aa}=q_{bb}=-1$, and no nonempty finite subset $A\subseteq S$ satisfies $\prod_{j\in A\setminus \{k\}}q_{jk}=1$ for every $k\in I$. We also determine the laws of some central elements.

comments
16 pages
fields
Operator Algebras
pdf ↗ page arXiv:2611.05064 ↗

Let $V$ be a complete valuation domain of rank 1, and let $Γ$ be its value group. We investigate the power series ring $V[[t]]$, and finally answer the long standing question of when this ring is coherent. Specifically, we prove that it is coherent if and only if $V$ is almost maximal, and either $Γ= \mathbb{R}$ or $Γ$ is discrete. Furthermore, we demonstrate that the weak Hilbert-syzygy identity $w. dim V [[X]] = w. dim V + 1$ holds if and only if $V[[X]]$ is a coherent ring.

fields
Commutative Algebra
pdf ↗ page arXiv:2611.05246 ↗

Get each issue by email →