Paperlane

no. 7 · from the archive← Mon 2 Nov archive Wed 4 Nov →

Tuesday, 3 November 2026

1605 papers in 32 fields

Combinatorics112

Given a connected weighted graph G=(V, E, w) and a forest F of G, the goal of partial inverse min-max spanning tree problem is to change the weight function as little as possible, so that there is a min-max spanning tree with respect to the new weight function containing F. In this paper, we study this problem under the weighted sum Hamming distance. We take the alternative set of the maximum edge weight in F with respect to the optimal weight function as a key factor, and further consider the case of this problem under the restriction of this factor. On this basis, a polynomial time algorithm with time complexity O(|V|^4) is proposed to solve this problem.

fields
Combinatorics
pdf ↗ page arXiv:2611.00094 ↗

Koolen, Hayat and Iqbal asked for the connected graphs whose distance matrix has exactly three distinct eigenvalues, the middle one being $0$. The examples they gave, namely the Johnson graphs, the Hamming graphs and the halved cubes, are distance-regular. In this note, we show that the distance spectrum of such a graph is $\{ρ,0,-c\}$ with integers $c\ge2$ and $c\midρ$. For $c=2$ the graphs are exactly the cocktail party graphs, and for $c=3$ they are exactly the Cartesian product $K_3\,\square\,K_3$ of two triangles, the Petersen graph and its complement. We also show that such a graph need not be transmission-regular: Seidel switching the lattice graph $K_6\,\square\,K_6$ with respect to a line and the triangular graph $T(11)$ with respect to a maximal clique of size $10$ gives graphs on $36$ and $55$ vertices with distance spectra $\{54,0^{(26)},(-6)^{(9)}\}$ and $\{81,0^{(45)},(-9)^{(9)}\}$. Among the graphs of diameter $2$ obtained by switching a strongly regular graph with smallest eigenvalue $-2$ with respect to one part of an equitable partition, these two are the only ones that have exactly three distance eigenvalues and are not transmission-regular. We also observe that the transmission-regular graphs with exactly three distinct distance eigenvalues, the smallest one being $-3$, are exactly the complements of the strongly regular graphs with smallest eigenvalue $-2$ other than the cocktail party graphs.

comments
11 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.00126 ↗

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 ↗

Families $\mathcal A_1,\ldots,\mathcal A_m\subseteq\binom{[n]}k$ are cross-intersecting if every member of one family meets every member of each other family. A family is nontrivial if its members have no common element. For $n>2k$ and $m\ge3$, we determine the maximum sum of the sizes of $m$ nonempty, nontrivial cross-intersecting families. We prove the sharp bound \[ \sum_{i=1}^{m}|\mathcal A_i| \le \max\bigl\{m\,h(n,k,1),\ g(n,k)+3(m-1)\bigr\}, \] where \[ h(n,k,1)=\binom{n-1}{k-1}-\binom{n-k-1}{k-1}+1 \] and \[ g(n,k)=\binom nk-2\binom{n-k}k -\binom{n-k-1}{k-1}+\binom{n-2k+1}k. \] We also characterize all equality cases. Two types of extremal configurations arise: copies of a maximum nontrivial intersecting family, and copies of a specific three-member nontrivial intersecting family together with its full cross-intersecting companion. The proof applies a known restricted lexicographic comparison to obtain the weighted bound for shifted families, and uses local generator reductions for critically shifted families. These reductions exploit shiftedness after removing the common core of a section, while preserving nontriviality and the required shadow relations between sections.

fields
Combinatorics
pdf ↗ page arXiv:2611.00148 ↗

Let $n>2k$ and $k\ge4$. The largest size of an intersecting family of $k$-subsets of $[n]$ with covering number at least three is \[ g_1(n,k)=\binom{n-1}{k-1}-3\binom{n-k-1}{k-1}+\binom{n-k-2}{k-1}+\binom{n-2k}{k-1}+3, \] attained by a unique family up to isomorphism. We prove that every other maximal intersecting family $\mathcal F$ with covering number three satisfies \[ |\mathcal F|\le M(n,k)=\max\{q(n,k),g_2(n,k)\}, \] where \begin{align*} q(n,k)&=\binom{n-1}{k-1}-3\binom{n-k-1}{k-1}+\binom{n-k-3}{k-1}+\binom{n-2k+1}{k-1}+3,\\ g_2(n,k)&=g_1(n,k)-\binom{n-k-3}{k-3}+1. \end{align*} This bound is attained for every $n>2k$ and $k\ge4$, so $M(n,k)$ is the second largest distinct size. For $k=4$, $g_1(n,4)=13n-69$ and $M(n,4)=12n-61$. For $k\ge5$, we have $M(n,k)=q(n,k)$ when $2k<n\le3k-2$ and $M(n,k)=g_2(n,k)$ when $n\ge3k-2$; the two terms coincide only at $n=3k-2$. We also classify all families attaining $M(n,k)$ that admit a critically shifted labeling, including additional nonisomorphic families at $n=2k+1$. The proof combines local replacements with an inverse-shift estimate and gives a new proof of the known maximum and its uniqueness.

fields
Combinatorics
pdf ↗ page arXiv:2611.00149 ↗

Given a finite subset $A\subseteq\mathbb{Z}$ and a multiset of non-zero integers $Λ=\{λ_1, \ldots, λ_k\}$, the dilate sum \[Λ\cdot A:=λ_1\cdot A+λ_2\cdot A+\cdots+λ_k\cdot A =\{λ_1a_1+\cdots+λ_ka_k: a_1, \ldots, a_k\in A\}.\] For a non-zero real number $r$, say that $Λ_2$ $r$-dominates $Λ_1$ if we can partition some of the elements of $Λ_2$ into blocks summing to the elements of $r\cdotΛ_1$. Then for all finite subsets $A\subseteq\mathbb{Z}$, $Λ_2\cdot A$ contains a translate of $r\cdot(Λ_1\cdot A)$, and hence $|Λ_1\cdot A|\le|Λ_2\cdot A|$ for all $A$. In a recent paper, Kravitz (arXiv:2606.27087) proves the converse: if $Λ_2$ does not $r$-dominate $Λ_1$ for any $r$, then there exists a finite set $A$ satisfying $|Λ_1\cdot A|>|Λ_2\cdot A|$. For example, $\{2, 3, 5, 7\}$ does not contain two disjoint subsets with a sum ratio of 7, and so there exists a finite $A\subseteq\mathbb{Z}$ for which $|A+7\cdot A|>|2\cdot A+3\cdot A+5\cdot A+7\cdot A|$. We extend Kravitz's method to apply it to multiple inequalities and multiple sets, showing that for multisets $Λ_{i,j}$ with $1\le i\le k$ and $1\le j\le\ell$, there exist finite sets $A_1, \ldots, A_\ell\subseteq\mathbb{Z}$ such that for all $1\le i<k$ \[|Λ_{i,1}\cdot A_1+\cdots+Λ_{i,\ell}\cdot A_\ell| >|Λ_{i+1,1}\cdot A_1+\cdots+Λ_{i+1,\ell}\cdot A_\ell|\] provided there do not exist indices $1\le i_1<i_2\le k$ and a non-zero scalar $r$ such that $Λ_{i_2,j}$ $r$-dominates $Λ_{i_1,j}$ for all $1\le j\le\ell$. Along the way, we resolve the analogue of Nathanson's Problem 1 for his Theorem 4 (arXiv:1604.08940), as well as the problems in Section 1.4.3 of Kravitz's paper.

comments
11 pages
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2611.00217 ↗

We prove that for any valuation $\varphi$ of lattice polytopes in ${\mathbb R}^m$, which is quasi-polynomial with respect to ${\mathbb Z}^m$-translations, and any lattice polytope $P$, the function $\varphi(nP)$ is quasi-polynomial in $n$.

comments
17 pages
fields
Combinatorics, Algebraic Geometry
pdf ↗ page arXiv:2611.00313 ↗

In the online carpooling problem, edges on $n$ vertices arrive one at a time and must be oriented immediately, so as to keep the difference between the indegree and the outdegree of every vertex small. We give a randomized online algorithm which bounds the largest absolute difference over the first $T$ edges by $O((\log T)^{1/3})$ with high probability on every input sequence fixed in advance. This proves a conjecture of Kulkarni, Reis and Rothvoss and matches the known worst case lower bound. The algorithm keeps the law of the discrepancy vector dominated in the convex order by a Gaussian measure, and forces the endpoint with the smaller discrepancy to receive the edge whenever the two discrepancies are far apart. In the analysis we show that a vertex of discrepancy $D$ is preceded by a set of $O(D)$ vertices with total discrepancy $Ω(D^2)$.

comments
14 pages, 2 figures
fields
Combinatorics, Probability
pdf ↗ page arXiv:2611.00388 ↗

The notion of a fixed point, applied by Blecher and Knopfmacher to integer partitions, can be considered as a permutation statistic. Here we apply two related permutation statistics, excedance and deficiency, to integer partitions. Using analytic and combinatorial techniques, we establish several generating functions and make connections to partition concepts including Dyson's crank statistic, overpartitions, and the Rogers–Ramanujan partitions.

comments
11 pages, 3 figures, 5 tables
fields
Combinatorics
pdf ↗ page arXiv:2611.00435 ↗

For fixed $p\in(0,1)$, we prove that the maximum number of vertices in an induced subgraph of $G(n,p)$ from a given class is concentrated on two consecutive integers, unifying and extending several earlier results. We require that the class contain arbitrarily large graphs and that every sufficiently large $k$-vertex member have a vertex of degree $o(k)$ whose deletion leaves a graph in the same class. This condition holds for empty graphs, trees, forests, planar graphs, graphs of bounded maximum degree, degeneracy or treewidth, graphs excluding a fixed complete bipartite subgraph (including graphs containing no cycle of length four), and many other graph classes.

fields
Combinatorics, Probability
pdf ↗ page arXiv:2611.00437 ↗

The pfaffian number of a graph $G$, denoted by $\mathrm{pf}(G)$, is the minimum integer $k$ such that the generating function of perfect matchings of $G$ can be written as a linear combination of $k$ pfaffians of signed adjacency matrices. The Galluccio-Loebl-Tesler Theorem states that $\mathrm{pf}(G) \leq 4^g$, where $g$ is the orientable genus of $G$. We generalize this theorem by relating the pfaffian number of a graph to another graph parameter: the symbolic pfaffian number, denoted by $\mathrm{spf}(G)$. Namely, we prove that $\mathrm{pf}(G) \leq 2^{\mathrm{spf}(G)}$. Our proof is based on linear algebra arguments and does not depend on topological properties of graphs. As a consequence of our generalization, we conclude that $\mathrm{pf}(K_{2n}) = 2^{\mathcal{O}(n \log n)}$, an improvement on the previous upper bound of $4^{\mathcal{O}(n^2)}$ based on the genus. We also consider lower bounds for $\mathrm{pf}(G)$ related to $\mathrm{spf}(G)$. In particular, we show that the graphs with $\mathrm{pf}(G) = 4$ are the graphs with $\mathrm{spf}(G) = 2$. On the other hand, we show that our main result is strictly more general than a previous generalization by Norine.

comments
20 pages, 3 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.00468 ↗

A recent OpenAI preprint claims a deterministic algorithm that counts the satisfying assignments of a $k$-CNF formula in time $2^{O_k(n\log\log n/\sqrt{\log n})}$, and $2^{O(n/\sqrt{\log n})}$ at bounded clause density, which would refute the Exponential Time Hypothesis. The headline bound is proved by tensor contraction; the body develops an interpolation algorithm with the weaker exponent $n(\log\log n)^2/\sqrt{\log n}$. This note does four things. First, it explains the interpolation algorithm in plain terms. Second, it asks how large $n$ must be for the bounds to bite. The preprint states no constants, so we treat the hidden constant $C$ as a parameter: the general bound beats the $2^n$ of brute force only beyond $n\approx 10^{32}$ for $C=2$, $10^{126}$ for $C=3$ and $10^{3517}$ for $C=10$. We then extract the constants from the tensor-contraction proof: for every input with $m$ clauses at bounded density, the running time it certifies stays above $2^n$ unless $\log_2(n+m)>10^9$, and on random 3-CNF at the satisfiability threshold unless $\log_2 n>5\times10^{11}$. So the bounds are subexponential as $n\to\infty$, but the proof certifies no speed-up over brute force for any input of bounded density that could ever be written down. Third, for the clause-product form of the interpolation algorithm we prove limits in a cost model matching the preprint's evaluation. By a short algebraic lemma, polynomial cost needs components of $O(\log^3 n)$ variables with per-point evaluation, or primal treewidth $O(\log^2 n)$ with dynamic programming over the groups. So the scheme costs $2^{Ω(\sqrt{\mathrm{tw}})}$ at treewidth $\mathrm{tw}$, $2^{Ω(\sqrt n)}$ with high probability on random 3-CNF above clause density 3, and $2^{Ω(n^{1/3})}$ even on trivially countable path formulas. We explain why the preprint's sharper routes escape these limits. Fourth, we report experiments.

fields
Combinatorics
pdf ↗ page arXiv:2611.00517 ↗

Let $A$ be the adjacency matrix of a finite graph $Γ$. We say that vertex $u$ of $Γ$ is sedentary if for some constant $C>0$, $|\exp(itA)_{u,u}|\geq C$ for all $t\in\mathbb{R}$. In this paper, we investigate vertex sedentariness in walk-regular graphs with a focus on Cayley graphs and, more generally, vertex-transitive graphs. In particular, we define the necklace polynomial of an integral graph and use this notion to characterize sedentariness in integral walk-regular graphs. As an application, we use basic tools from algebraic number theory to show that an integral Cayley graph on a group of odd order is sedentary and provide a lower bound on its sedentariness. We also give sufficient conditions such that a unitary Cayley graph over a finite ring is sedentary. Furthermore, we characterize the existence of twin vertices in Cayley graphs and vertex-transitive graphs, and completely determine the occurrence of sedentariness, perfect state transfer and pretty good state transfer in vertex-transitive graphs with twins. Finally, we prove that if $Γ(G,S)$ is a nonempty, integral, normal Cayley graph, then for any prime $p$ with $\gcd(p, |G|)=1$, there is at least one eigenvalue of $Γ(G,S)$ which is not a multiple of $p$. This generalizes a result of Arnadottir and Godsil, which states that an integral normal Cayley graph of odd order possesses an odd eigenvalue.

comments
29 pages, 1 figure
fields
Combinatorics
pdf ↗ page arXiv:2611.00567 ↗

In 2018, Goddard and Henning conjectured that every planar triangulation on at least four vertices has two disjoint total dominating sets. It was proved by Francis, Illickan, Jose, and Rajendraprasad in 2024. As a strengthening of this result, Goddard and Henning also conjectured that every planar triangulation with at least four vertices has a proper $4$-coloring with color classes $C_1,C_2,C_3,C_4$ such that $C_1\cup C_2$ and $C_3\cup C_4$ are total dominating sets. In this paper, we disprove this conjecture: for every $n\ge 36$ there is a planar triangulation with $n$ vertices without such a coloring. As another strengthening of the result by Francis, Illickan, Jose, and Rajendraprasad, they conjectured that every near-triangulation has a $4$-coloring, not necessarily proper, in which every vertex $v$ sees at least $\min \{ \operatorname{deg}(v),3 \}$ colors on its neighbors. We prove this conjecture for all planar triangulations.

comments
12 pages, 3 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.00572 ↗

We study the maximum order $v(k,θ)$ of a connected $k$-regular graph whose second largest eigenvalue is at most $θ$. For every real $θ\geq1$, we prove that \[ T(θ) =\limsup_{k\to\infty}\bigl(v(k,θ)-2k\bigr) =2\left\lfloor1+\frac{θ^2}{4}\right\rfloor. \] In particular, $T(θ)>2θ$ for every real $θ\geq4$, disproving the Yang-Koolen conjecture. We also determine $v(k,θ)$ for all sufficiently large $k$ on explicit intervals of $θ$. We prove a jump in the second largest eigenvalue above $1$. For each fixed $1\leqθ<2$ and all sufficiently large $k$, every connected $k$-regular graph of order at least $2k+2$ whose second largest eigenvalue is at most $θ$ is the crown graph. For $θ=\sqrt2$, we prove that $v(k,\sqrt2)=2k+2$ for every $k\geq13$. Finally, we obtain two new upper bounds on $v(k,θ)$.

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

We prove complete entropy contraction for homogeneous Lorentzian laws and derive subgaussian matrix concentration and sharp functional inequalities for every matroid. Uniform retention of $\ell$ out of $r$ particles contracts matrix entropy by the optimal universal factor $\ell/r$, in every finite matrix dimension and positive field, including repeated labels. The matrix Laplace comparison retains matrix variance and arbitrary Hermitian offsets. It gives subgaussian bounds for arbitrary Hermitian observables with bounded exchange differences, and Chernoff and Bernstein bounds for basis sums. Every unit-edge matroid basis graph satisfies the cube's small-set and Gross inequalities, with equality classified and optimal universal complete entropy-decay rate four. Its spectrum lies in $\{0,2\}\cup[3,\infty)$, with binary direct-factor contrasts spanning the eigenspace at two. We classify extremal down-up eigenfunctions, resolving Alaniz Pintos's degree-one conjecture and the equality problem for the Feder–Mihail walk. For degree at least two, every matrix entropy extremizer extends uniquely from its two-particle marginal. Equality depends only on the normalized pair law, with noncommutativity confined to mutually exclusive labels. We classify power-entropy extremizers for $1<p<2$ and give a fourth-order criterion for affine equality. Retained-level Gibbs reconstruction has sharp dimension-independent stability. For multiaffine laws whose generating polynomial and complement are Lorentzian, we determine the exact simultaneous all-field quantum marginal and matrix Hölder regions and classify the sharp half-marginal fields. Connected sharp laws are determinantal through rank three; stable nondeterminantal examples exist in every higher rank.

comments
66 pages; no figures
fields
Combinatorics
pdf ↗ page arXiv:2611.00626 ↗

We prove Bergeron's Hook-Components and Coefficient-Length conjectures for the Vandermonde polarization module and full diagonal harmonics in every rank and number of alphabets. Hook-label characters are elementary skewings of the alternating character, and the maximal Schur length in label $μ$ is $n-μ_1$. We compute character and dimension polynomials of diagonal coinvariants in every bosonic–fermionic superspace for $D\ge3$, $n\ge\max\{D,2D-6\}$, answering Church–Ellenberg–Farb's character and dimension questions. For augmented commutative algebras in characteristic zero, we construct natural two-Schur presentations and filtered free resolutions with one Schur generator in each homological degree. For polynomial algebras, specialization to orthogonal idempotents identifies the first unstable correction for every nonempty tail $τ$ and degree $D>|τ|$. The stable threshold $n\ge D+τ_1$ is sharp when the row dimension is at least $\ell(τ)$. First parabolic algebras recover finite jets, their multiplication and their maps. Selected-label lifts give uniform Vandermonde generation through degree $D$ for $D\ge3$, $n\ge2D-3$, and disjoint-label products generate every first occurrence for positive integral row weights. Constructive degree reflection determines all two-column moment homology and generates its first syzygies from degree $n+1$; two-column Vandermonde generation reduces to degree $n-1$. Invariants and harmonics separate through the character range and through degree $n$ in two alphabets. The hook identities also give the fully graded sign component of the $t=0$, $(1,2)$-superspace Theta conjecture.

comments
65 pages; no figures
fields
Combinatorics
pdf ↗ page arXiv:2611.00629 ↗

We show that every $K_h$-minor-free graph with $n$ vertices has a balanced separator of size $O(h\sqrt{n})$ for any parameter $h \in \mathbb{N}$, resolving the conjecture posed by Alon, Seymour, and Thomas [AST90] in 1990. The proof is elementary, building on the combinatorial framework by Le [Le26]. A key new idea of the proof is the existence of a short hitting walk on vertex expanders: given $k$ large (not necessarily disjoint) subsets of vertices, there is a walk of length $O(k/ψ(G))$ hitting every subset, where $ψ(G)$ is the vertex expansion. This technical result substantially improves on an analogous lemma by Alon, Seymour, and Thomas [AST90] in an important parameter setting, where the previous lower bound [Kot00] does not apply.

fields
Combinatorics
pdf ↗ page arXiv:2611.00663 ↗

On the set of unweighted directed graphs on $n$ vertices, the union of graphs is defined as the union of their arc sets. A mapping of graphs is said to be additive if it preserves the union operation. In this paper, a characterization of additive mappings of unweighted directed graphs preserving a fixed value $k \geq 3$ of the cycle length is obtained.

fields
Combinatorics
pdf ↗ page arXiv:2611.00702 ↗

For an integer $k\ge2$, let $C(k,k)$ denote the oriented cycle formed by two internally vertex-disjoint directed paths of length $k$ with the same initial and terminal vertices. We extend a problem of Picasarri-Arrieta and Rambaud [European J. Combin. 122 (2024)] on subdivisions of $C(k,k)$ to digraphs with several vertices of out-degree one. Following the sharp result of Chen et al. [arXiv:2610.38574v1 (2026)] for at most one such vertex, we determine the exact digirth threshold when at most $r\ge4$ such vertices are permitted. Specifically, for all integers $k\ge2$ and $r\ge4$, every digraph of minimum out-degree at least one, with at most $r$ vertices of out-degree one and digirth at least $r(k-1)+1$, contains a subdivision of $C(k,k)$.

comments
14 pages, 3 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.00720 ↗

We determine the automorphism groups of direct products of finite connected twin-free bipartite graphs whose factors are different from $K_2$. The product is generally disconnected, so the problem requires both the automorphism groups of its components and a criterion for component isomorphism. We retain the order of the bipartition classes and use the fibre product over $K_2$. An edge-relation construction, together with McKenzie's strict refinement theorem, yields unique fibre-prime factorization and a coordinate description of every specified isomorphism. After refining the original factors, component isomorphism classes are described by intersections of factor-symmetry orbits with a set of admissible labels. The stabilizer of a label acts faithfully as the fullautomorphism group of its component. These data determine the full automorphism group, including products with repeated or fibre-composite factors. For products of fibre powers of one prime graph, we compute the component groups and express their multiplicities through a subset-sum polynomial. We also obtain an explicit semidirect product for a mixed product with one nonbipartite factor and explain its relation to known stability results. An application recovers the known double-cover groups of bipartite generalized Petersen graphs.

fields
Combinatorics
pdf ↗ page arXiv:2611.00775 ↗

We introduce the congruent quotient matrix along with its inequalities on inertia and demonstrate that these inequalities are the essence of the discrete nodal domain theorem, the bounds on nodal counts, and Fiedler's characterization on tree eigenvectors. Using these techniques, we also extend the existing bounds for the number of nodal domains and nodal counts.

fields
Combinatorics, Spectral Theory
pdf ↗ page arXiv:2611.00789 ↗

A self-avoiding walk (SAW) on a vertex-transitive graph $G$ is a path that visits no vertex more than once; a trail is a path that traverses no edge more than once. The number of $n$-step self-avoiding walks (respectively, trails) starting at a given vertex has order $μ(G)^n$ (respectively, $μ_{\text{T}}(G)^n$), where $μ(G)$ is called the connective constant and $μ_{\text{T}}(G)$ is the trail constant. It is immediate that $μ=μ_{\text{T}}$ if $G$ either has degree $3$ or less, or is a tree. We prove a necessary and sufficient condition for the strict inequality $μ< μ_{\text{T}}$ if $G$ has degree $4$ or more and is not a tree, and in addition $G$ possesses a so-called height function. This condition is satisfied whenever the height function is transitive. The core of the proof is a pattern theorem for graphs possessing height functions, and this is achieved using an unpublished argument for ${\Bbb Z}^d$ by Hammersley, reported by Janse van Rensburg et al. (J. Stat. Phys. 85, 1996, 103–130). Some ancillary results are included concerning SAWs on the line graph of $G$.

fields
Combinatorics, Mathematical Physics, Probability
pdf ↗ page arXiv:2611.00816 ↗

In 2013, Freitas, Nikiforov and Patuzzi (EJLA, 2013) proposed the problem of determining the maximum signless Laplacian spectral radius of an $n$-vertex $F$-free graph. Recently, Yuan, Zhai and Zhang (LAA, 2026) determined the maximum signless Laplacian spectral radius of graphs without wheels of sufficiently large order. In this paper, we consider the problem of forbidding a single wheel $W_{2k+1}=K_1\vee C_{2k}$. We show that, for every fixed integer $k\ge 3$ and sufficiently large $n$, the unique extremal graph maximizing the signless Laplacian spectral radius among all $n$-vertex $W_{2k+1}$-free graphs is $K_k\vee(K_2\cup(n-k-2)K_1)$.

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

Let $G$ be a graph with edge set $E(G) = \{e_1, \ldots, e_m\}$, and let $\mathcal{H} = (H_1, \ldots, H_m)$ be an $m$-tuple of graphs. The edge corona $G\diamond\mathcal{H}$ is obtained from the disjoint union of $G,H_1,\ldots,H_m$ by joining both end vertices of each edge $e_j$ to every vertex of $H_j$ for $1\leq j\leq m$. In this paper, we investigate Laplacian perfect pair state transfer and Laplacian pretty good pair state transfer on edge coronas. We establish necessary and sufficient conditions for the existence of Laplacian perfect pair state transfer. We also derive sufficient conditions for the non-existence of Laplacian perfect pair state transfer. Further, we identify conditions under which the absence of Laplacian perfect pair state transfer guarantees the existence of Laplacian pretty good pair state transfer. Additionally, we develop constructions based on Cartesian product and tensor product to obtain a few more infinite families of edge coronas admitting Laplacian pretty good pair state transfer. Finally, we investigate the existence of Laplacian pretty good pair state transfer on the edge corona of complete graphs.

comments
NA
fields
Combinatorics
pdf ↗ page arXiv:2611.00866 ↗

We study entry and position statistics in alternating permutations and standard Young tableaux using linear extensions and generating functions. For alternating permutations, we give explicit formulas for the mean and variance of the first entry and of the position of any fixed value. For standard Young tableaux, we express the sum of the lower-left entries as the number of tableaux of an associated skew shape. For two-row shapes, we determine the distribution of the entry in each cell of the second row, and for the shape $(n,n)$ we give a closed formula for its sum over all tableaux, which recovers a limit formula of Stanley. Through a bijection of Lewis, the results for the shape $(n,n)$ describe the entries of a random $321$-avoiding down-up permutation of even length.

comments
24 pages, 10 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.00872 ↗

A subset $C$ of the vertex set of a graph $Γ$ is said to be an $(a,b)$-regular set if $C$ induces an $a$-regular subgraph and every vertex outside $C$ is adjacent to exactly $b$ vertices in $C$. A $(0,1)$-regular set is called a perfect code. Let $G$ be a finite group and let $α\in\operatorname{Aut}(G)$ be such that $α^2=\mathrm{id}$. Let $ω_α(G)=\{α(g^{-1})g:g\in G\}$. For a subset $S\subseteq G$ satisfying $α(S)=S^{-1}$ and $S\capω_α(G)=\emptyset$, the generalized Cayley graph of $(G,α)$ with respect to $S$ is the graph with vertex set $G$ in which two distinct elements $g,h\in G$ are adjacent if and only if $α(g^{-1})h\in S$. In this paper, we prove two main results. First, let $H$ be an $α$-invariant subgroup of a finite group $G$, and let $P$ be an $α$-invariant Sylow 2-subgroup of $H$. We show that $H$ is a perfect code of $(G,α)$ if and only if $P[H,α]$ is a perfect code of $(G,α)$, where $[H,α]=\langle h^{-1}α(h):h\in H\rangle$. Second, we consider finite groups $G$ possessing a cyclic subgroup $A$ of index 2 that is invariant under an involutory automorphism $α$. We show that $ω_α(G)$ is a subgroup of $A$. Using this result, we give a complete characterization of all pairs $(a,b)$ for which an $α$-invariant subgroup $H$ of $G$ is an $(a,b)$-regular set of $(G,α)$. In particular, our characterization applies to all finite groups possessing a characteristic cyclic subgroup of index 2, for every involutory automorphism $α$.

comments
13 pages
fields
Combinatorics, Group Theory
pdf ↗ page arXiv:2611.00893 ↗

For a simple graph $G$ with $n$ vertices, its $w$-polynomial is defined by \begin{align*} \sum_{q\geq0}P(G;q)x^q =\frac{w(G;x)}{(1-x)^{n+1}}, \end{align*} where $P(G;x)$ is the chromatic polynomial of $G$. This polynomial was introduced by Brenti in 1992. In this paper, we prove Conjecture~6.7 and the $w$-assertion of Conjecture~6.5 posed by Brenti, Royle and Wagner in 1994. The first states that $w(C_n;x)$ has only real zeros for $n\ge 5$. The second assertion states that if $G\cap H$ is complete and both $w(G;x)$ and $w(H;x)$ have only real zeros, then $w(G\cup H;x)$ has only real zeros.

fields
Combinatorics
pdf ↗ page arXiv:2611.00912 ↗

Let $\cS(k,q)$ be the point-line geometry whose points and lines correspond to one-dimensional and two-dimensional subcodes of $q$-ary simplex codes of dimension $k$, respectively. We determine the complete distance relation and the diameter of its collinearity graph. For two points whose representing vectors have different sets of zero coordinates there is a common neighbour. If the representing vectors have the same zero set, then a common neighbour exists precisely when $(q-1)q^{k-2}$ of their non-zero coordinate ratios can be selected so that their product is one. To prove this, we use a generalization of Hall's result for finite abelian groups. Applying the Erdős–Ginzburg–Ziv theorem, we establish that the above product condition holds for $k\ge3$, which implies that the diameter is two. If $k=2$, then the diameter is one when $q=2$, two when $q=3$ and three when $q\ge4$.

fields
Combinatorics
pdf ↗ page arXiv:2611.00916 ↗

Possibly the most enduring lower-bound record for kissing numbers in dimensions greater than $8$ (excluding $24$) is $$ κ_{16}\geq 4320. $$ This lower bound is attained by a shell of the famous Barnes–Wall lattice, which was discovered in 1959. Besides this configuration, at least one alternative $4320$-point kissing arrangement is currently known. Recently, it was noticed that all these configurations can be described in terms of the so-called quaternionic construction, a general type of construction that was instrumental in explaining the geometry of the $841$-point kissing arrangement in ${\mathbb R}^{12}$. We give a simple generalization of quaternionic constructions in ${\mathbb R}^{16}$ obtained from record configurations. They are parameterized by three Latin cubes of order $4$, six permutations of $3$-element set, and are all infinitesimally jammed. Computer-aided counting shows that there are $4\,072\,728\,621$ isometry classes in this family of $4320$-point kissing arrangements.

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

For integers $n>k\ge1$ with $nk$ even, let $m(n,k)$ be the maximum size of a graph of order $n$ with a unique $k$-factor. In 1964, Hetyei and in 1984, Hendry [\emph{J. Combin. Theory Ser. B} \textbf{37} (1984), 53–63] proved $m(n,1)=n^2/4$ for even $n$ and $m(n,2)=\lfloor n(n+1)/4\rfloor$, respectively. In 2000, Johann [\emph{J. Graph Theory} \textbf{35} (2000), 227–243] showed that $m(n,k)=nk/2+\binom{n-k}{2}$ for $k>n/2$ and $kn$ even and $m(n,k)=n^2/4+(k-1)n/4$ for $n=2kq$, where $q$ is a positive integer. Later, Volkmann [\emph{Combinatorica} \textbf{24} (2004), 531–540] proved $m(n,k)=k^2+\binom{n-k}{2}$ for $n/3\le k<n/2$ and $kn$ even, and he determined $m(n,3)$. In this paper, we determine $m(n,k)$ for all admissible pairs, proving the size conjecture posed by Volkmann. We also prove that every extremal graph with $2\le k\le n-2$ has a universal vertex whose neighbors in the unique factor are precisely its degree-$k$ vertices. In particular, this result confirms Volkmann's structural conjecture.

comments
15 pages, 0 figues
fields
Combinatorics
pdf ↗ page arXiv:2611.00950 ↗

We prove that every graph $G$ with independence number at most two contains a strong immersion of $K_{χ(G)}$. This strengthens Dahlke's theorem for weak immersions and establishes the Lescure–Meyniel conjecture for this class of graphs.

fields
Combinatorics
pdf ↗ page arXiv:2611.00956 ↗

The lattice of wide subcategories of a tube is isomorphic to the lattice of noncrossing partitions of type B. We prove that through this categorification of noncrossing partitions, Kreweras complement is taking left perpendicular categories. With the help of this categorification and weighted projective lines, we obtain an inclusion from the lattice of noncrossing partitions of type B_n to a lattice of affine type A_n which preserves Kreweras complement.

fields
Combinatorics, Category Theory, Representation Theory
pdf ↗ page arXiv:2611.00966 ↗

Let $\varphi=(1+\sqrt5)/2$. The four-point set $\{0,\varphi,\varphi^2,\varphi^3\}$ is classical: up to a dilation it consists of the two endpoints and the two crossing points on a side of the regular pentagram (Euclid, Elements XIII.8), and, by the identity $\varphi^2=\varphi+1$, its six pairwise differences are $1,\varphi,\varphi^2,\varphi^3$, with multiplicities $1,2,2,1$. We write this configuration as the golden quadruple $S=(F, F-a, F-b, F-a-b)$, where $u>0$, $a=\varphi u$, $b=\varphi^2u$ and $F>a+b$, and study its extremal and rigidity properties. We prove that it is maximal and unique: no five distinct real numbers have all their positive differences in $\{u,\varphi u,\varphi^2u,\varphi^3u\}$ (indeed, not even in the whole set $\{u\varphi^n:n\in\mathbb{Z}\}$), and every four-element set with this property is a translate of $S$. We prove that the golden ratio is forced: $\varphi$ is the only ratio $x>1$ for which some four-point set of reals has the four-term progression $\{c,cx,cx^2,cx^3\}$ as its set of distinct differences. For the analogous quadruple with base $x>1$, $x\neq\varphi$, the failure is measured by two closure residues, $(x^2-x-1)u$ and $x(x^2-x-1)u$, which along Fibonacci quotients equal $\pm u/F_n^2$ and $\pm F_{n+1}u/F_n^3$. Finally, the cosine sum $C_S(t)=\sum\cos(2πd t)$ over the six differences equals $8\cos^2(πa t)\cos^2(πb t)-2$; it is not periodic, but it is almost periodic in the sense of Bohr, with explicit almost periods $F_n/u$. For an arbitrary scale $K>0$ the golden ladder $ν_n=K\varphi^{-n}$ realises the construction with $u=ν_{203}$, so that the differences are $ν_{200},\dots,ν_{203}$; we evaluate it for $K=\sqrt{c^5/(Gh)}$. We state explicitly what is classical and what is new, in relation to difference sets, Golomb rulers, Sidon sets, Fibonacci numbers, quasicrystals and almost periodic functions.

comments
23 pages. Lean 4 formalization and Polish version: https://doi.org/10.5281/zenodo.23798809
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2611.00973 ↗

A mutual-visibility set in a graph $G$ is a set $S$ of vertices such that any two vertices of $S$ are connected by a shortest path with no internal vertex in $S$, and the mutual-visibility chromatic number $χ_μ(G)$ is the minimum number of mutual-visibility sets needed to partition $V(G)$. Babu, Di Stefano and Lakshmanan showed that it is NP-complete to decide whether $χ_μ(G)\le 2$ for graphs of diameter four. We show that the problem remains NP-complete for graphs of diameter $d$, for every fixed $d\ge2$; diameter two is the smallest diameter for which the problem is non-trivial. The proof rests on a reformulation of $χ_μ(G)\le 2$ for diameter-two graphs as the $2$-colourability of an associated hypergraph, and on a reduction from $2$-colourability of $3$-uniform hypergraphs without short cycles.

comments
8 pages, 1 figure
fields
Combinatorics
pdf ↗ page arXiv:2611.01012 ↗

In this paper, we first give a sharp sufficient condition on degree sum for a connected graph to have a spanning tree whose maximum of degree sum of two adjacent vertices are bounded. These improve some previous results on the spanning tree with bounded maximum degree. Next, we also use our main result to study the generalized rainbow connection of graphs. In particular, we give some degree sum conditions for a connected graphs to have a bounded (1,2)- rainbow connection number.

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

We prove that every claw-free perfect graph $G$ satisfies $\ch(G)=χ(G)=ω(G)$. More strongly, if $S$ is a clique of simplicial vertices of $G$ and $k\geω(G)$, every proper precoloring of $S$ extends to a proper coloring of $G$ from arbitrary lists of size $k$ on $V(G)\setminus S$. The proof has three coloring steps: a mixed-list theorem for cobipartite graphs, a precoloring-extension theorem for elementary graphs built on Galvin's kernel method and a homogeneous-pair exchange argument, and a polynomial method (Combinatorial Nullstellensatz) argument for graphs of interval type in which a Vandermonde factor is transferred across each incomplete pair. The three coloring steps are assembled along the structure theorems of Chvátal–Sbihi, Maffray–Reed and Chudnovsky–Seymour, using double clique cutsets for composition. As a consequence, every perfect line graph is chromatic-choosable, recovering the theorem of Peterson and Woodall. Our precoloring extension theorem also resolves a conjecture posed by Chudnovsky and Seymour.

comments
33 pages, 8 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.01068 ↗

Graph neural networks are often trained on small graphs and deployed on larger ones, raising the question of which graph information must be preserved for combinatorial optimization values to transfer across sizes. We establish size-transfer guarantees for normalized graph optimization values using finite collections of energy features. For affine objectives, including MAX-CUT, coloring defect, and independent-set density, differences in task value are controlled by discrepancies in normalized scalar energy probes on all bounded-degree graphs. For general Lipschitz objectives, such as those with balance penalties, an additional representation error appears; this error vanishes on hyperfinite graph families but can remain bounded away from zero on expanders. Thus, at fixed degree bound, state space, Lipschitz constant, and target accuracy, a finite energy representation independent of graph size suffices universally for affine tasks and asymptotically for general Lipschitz tasks on hyperfinite families. These results yield prediction guarantees under explicit conditions on encoder accuracy, readout stability, and representation coverage, together with statistical generalization bounds. Theoretically, we prove Shapley-Folkman bounds with sharp parameter dependence, including a dimension-free $\ell_2$ regime, and realize the resulting energy features with a fixed-weight message-passing network using random node initialization on bounded-treewidth graphs. Experiments with exact solvers and trained models test the resulting transfer guarantees.

fields
Combinatorics
pdf ↗ page arXiv:2611.01069 ↗

In the setting of abelian groups, Haussler's packing lemma implies that any subset of bounded $\operatorname{VC}$-dimension can be approximated by one of a small number of representative translates. While this exact statement is provably false under the weaker hypothesis that $A$ has bounded $\operatorname{VC}_2$-dimension, we show that in $\mathbb{F}_p^n$ a similar statement does hold after localization to cosets of subspaces depending on the individual translates. More precisely, given $ε>0$ and $A\subseteq \mathbb{F}_p^n$ with $\operatorname{VC}_2(A)<k$, we show that there exist $r\leq ε^{-O_{k,p}(1)}$ and $g_1,\ldots, g_r\in \mathbb{F}_p^n$ with the property that for every $x\in \mathbb{F}_p^n$, there is a partition $\mathcal{C}_x$ of $\mathbb{F}_p^n$ into cosets of (possibly distinct) subgroups, each of index at most $\exp(ε^{-O_{k,p}(1)})$, and a subcollection $Ω_x\subseteq \mathcal{C}_x$ whose union has size at least $(1-ε)|\mathbb{F}_p^n|$, such that on each $C\in Ω_x$, the translate $A-x$ looks like one of $A-g_1,\ldots, A-g_r$, in the sense that $|((A-x)Δ(A-g_{i_{x,C}}))\cap C|<ε|C|$ for some $1\leq i_{x,C}\leq r$. We also prove a second version of this result in which each partition $\mathcal{C}_x$ is the set of cosets of a single subgroup $H_x$ of quasipolynomial index but where the bound on $r$ is a quadruple exponential.

comments
24 pages
fields
Combinatorics, Logic
pdf ↗ page arXiv:2611.01101 ↗

The graph parameter ${\mathrm N}(G)$ is the maximum nullity among all combinatorially symmetric matrices associated to a graph $G$. The zero forcing number ${\mathrm Z}(G)$ is a well-known upper bound for ${\mathrm N}(G)$, and a zero forcing set of $G$ is exactly a set that intersects each fort of the graph. So the zero forcing number can be defined as the size of a minimum set that intersects every fort of $G$. This paper provides a similar characterization of ${\mathrm N}(G)$ that is purely combinatorial, using a connection to matroid theory and collections of forts that are compatible in a certain sense. We provide several examples highlighting subtle differences among compatible collections of forts and how they relate to full spark matrices and matroids associated to $G$.

comments
23 pages, 5 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.01102 ↗

Two-hop distance labelings were introduced in 2002 by Cohen, Halperin, Kaplan, and Zwick with hubs of two kinds: vertices of the graph, or, in their Steiner variant, arbitrary objects carrying arbitrary real values. On no family is the value of that freedom known. We determine it on $\ell_1$ products of betweenness-free metrics, those with no point between two others, a class containing every Hamming graph. The freedom is worth nothing when the factors have at most three letters, while from four letters on the largest saving is polynomial in the size of the product, attained on products of positively weighted stars. The $d$-dimensional hypercube is the two-letter case, and labeling it takes $(5/2+o(1))^d$ entries even with arbitrary hubs, matching the vertex-hub optimum of Goldberg, Razenshteyn, and Savchenko. Every lower bound here comes from one semidefinite program on a single factor, whose value $Λ$ never exceeds the rate that vertex hubs already achieve on the Hamming graph; where $Λ$ meets that ceiling, the freedom is worth nothing, and the ceiling is met exactly up to three letters.

comments
33 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.01106 ↗

We extend the non-backtracking Laplacian for graphs, introduced by Jost, Mulas and Torres, to hypergraphs. The operator is defined on the permutations of the edges and is normalized by the number of edges through which a non-backtracking walk can continue. We show that it satisfies a symmetry that generalizes the graph case, and that it can be obtained from the random walk Laplacian of a directed graph by rescaling if and only if all edges have the same cardinality. Moreover, we show that, up to copies of the eigenvalue $1$, its spectrum can be computed from a much smaller matrix indexed by the incidences of the hypergraph, and we use this reduction to bound the remaining eigenvalues away from $1$.

fields
Combinatorics, Spectral Theory
pdf ↗ page arXiv:2611.01121 ↗

A plane hypermap with a boundary is a connected graph embedded in the plane with a distinguished face, and whose inner faces are properly face-bicolored. We say that such hypermaps are k-alternating if the colors of the faces adjacent to the distinguished face alternate at most 2k times when going counterclockwise. Eynard and Orantin, in [EO2005], have found a universal expression for the generating functions of k-alternating hypermaps as a surprisingly simple function of the generating function of 1-alternating hypermaps. In this article, we will provide combinatorial formulas for k-alternating hypermaps using specific subclasses of hypermaps in which each vertex can either be connected to a previously marked vertex, called accessible, or connected to all other vertices in what we call a blob. In particular, this method will allow us to derive the results from [EO2005] from a combinatorial perspective, and we anticipate that it will lead to the computation of asymptotics for hypermaps in future work. This article is naturally a sequel to, and most importantly a generalization of, the results in [BEL26], which deals essentially with the case of 1- and 2-alternating hypermaps.

comments
40 pages, 18 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.01148 ↗

Using probabilistic methods, we establish universal cumulant lifting criteria for Stieltjes and Hamburger moment sequences. In the Stieltjes case, we characterize coefficientwise Hankel total positivity after convolution with every initial moment sequence by requiring each once-shifted cumulant sequence to be Stieltjes. We also prove equivalence with the numerical moment property at every nonnegative intensity. In the Hamburger case, we use twice-shifted cumulants to obtain coefficientwise-positive leading Hankel determinants, a degree bound, an explicit highest-degree component, and drift invariance. We work with formal series and require neither exponential moments nor moment determinacy. We establish composition, binomial-convolution, and substitution results, and apply them to implicit equations and autonomous differential equations, tree and forest families, and lognormal compound-Poisson moments in a unified approach. From known moment sequences, we obtain general coefficientwise Hankel-totally positive families containing the classical Bessel, Lah, and Laguerre polynomials. We not only give new proofs of coefficientwise Hankel-total positivity of many combinatorial polynomials, but also prove coefficientwise Hankel total positivity for the component polynomials of functional digraphs confirming a conjecture of Sokal and establish fixed-shape Schläfli–Gessel–Seo polynomials positivity supporting another conjecture of Sokal.

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

The Modified Randomized Greedy (MRG) algorithm [Tinhofer (1984), Aronson-Dyer-Frieze-Suen (1995)] is a classical greedy algorithm for finding approximate maximum matchings. MRG repeatedly picks a uniformly random unmatched vertex and matches it to a uniformly random unmatched neighbor, if one exists. Since 1991, the best upper bound on its approximation ratio has been $2/3$, given by the Bomb graphs of [Dyer and Frieze (1991)]. We improve this bound to $0.6569$ on general graphs and $0.6607$ on bipartite graphs. Our constructions consist of copies of small gadgets, with specified vertex classes joined completely. We track each algorithm by counting gadget copies with each possible configuration of remaining vertices. Wormald's differential equation method [Wormald (1995)] shows that these counts, scaled by the size parameter of the construction, converge to a deterministic trajectory known as the \textit{fluid limit}, which is described by ordinary differential equations. This fluid limit approximation holds while the relevant vertex classes have positive density, and so we devise a separate counting argument determines the contribution from the end of the run. Furthermore, we apply our framework to Random Decision Order (RDO), in which vertices are processed in uniformly random order and choose unmatched neighbors according to fixed adversarial preferences. On bipartite graphs, we determine the exact limiting ratio on the Double-Bomb family of [Tang-Wu-Zhang (2020)]. Its minimum is $31/48$, confirming their numerical estimate of about $0.646$.On general graphs, we improve their upper bound of $5/8$, given by the paw graph, to $0.5946$ on a new family. Finally, we give one possible explanation for why $2/3$ seemed to be optimal for MRG in the concluding remarks.

fields
Combinatorics
pdf ↗ page arXiv:2611.01177 ↗

This paper classifies hereditary properties of k-uniform hypergraphs according to bounds in the weak hypergraph regularity lemma first developed by Chung. Specifically, we prove the bounds must grow at a constant, polynomial, exponential, or tower rate. This generalizes work in the 3-uniform case by the second author.

comments
Contains some overlap in definitions and background with the paper on the 3-uniform case, which this paper generalizes (arXiv:2404.01293)
fields
Combinatorics, Logic
pdf ↗ page arXiv:2611.01203 ↗

Chow associated with every finite multigraph $G$ a symplectic matroid $\GraphS{G}$ on the signed edge set $E\sqcup E^{*}$, whose restrictions to transversals are frame matroids of signed graphs, and Sarvepalli asked which of these matroids are representable. For a connected graph containing a cycle, we show that every isotropic representation of $S(G)$ admits an incidence-flow normal form. The remaining representation conditions are expressed through its admissible minors. Consequently, if $\GraphS{G}$ is $\F$-representable, then the bridgeless part of $G$ has a nowhere-zero $(\F,+)$-flow. In characteristic other than two, $\GraphS{G}$ is representable if and only if every non-loop edge on a cycle has a parallel mate. In characteristic two, we characterize the loopless graphs without two vertex-disjoint cycles by the existence of a nowhere-zero $(\F,+)$-flow, and we show that rigidly linked short cycles, and hence subdivisions of the prism, are obstructions. For $3$-connected simple graphs this gives a complete answer: $\GraphS{G}$ is $\F$-representable if and only if $\F$ has characteristic two, $G$ has no two vertex-disjoint cycles, and either $|\F|>2$ or $G\cong K_5$. In particular, the matroid of the Petersen graph is representable over no field. Finally, the admissible corank–nullity polynomial of an arbitrary symplectic matroid is intrinsic and satisfies a three-term contraction identity. For graphical symplectic matroids, this becomes a deletion-contraction recursion that closes up once marked vertices are allowed, and polynomials built from enveloping matroids agree with it exactly for sheltering envelopes.

fields
Combinatorics
pdf ↗ page arXiv:2611.01241 ↗

Starting from a positive integer, repeatedly halve the current value, rounding up or down. Which resulting sequences have terms that add to the starting integer? A simple balance identity turns the rounding choices into hyperbinary expansions, in which each power of two occurs at most twice. This correspondence gives exact counts by length and an injection into the expansions counted by Stern's diatomic sequence. We characterize equality in the resulting bound by the binary digits of the odd part of the integer. We also determine the unique longest partition and give a short recursive counting algorithm. When the required total is allowed to vary, the chain counts eventually equal Stern's number, and we determine the exact threshold. A direct proof shows that the counts of hyperbinary expansions in the three length classes modulo three differ by at most one. For sufficiently long halving partitions, the counts by length first weakly increase and then weakly decrease, although the full sequence need not do so.

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

We compute the resonance varieties of the Orlik–Solomon algebras of Schubert matroids. Previously known results have been largely confined to matroids of rank $3$, and the Schubert matroids give a family of nontrivial examples of arbitrary rank. We give an expression for the cohomology of the Orlik–Solomon algebra that we show holds for Schubert matroids as well as for simple, complex-realizable rank-$3$ matroids that do not support multinets. Our proof introduces a family of matroids for which the Orlik–Solomon algebra is isomorphic to an exterior Stanley–Reisner algebra.

comments
19 pages. Comments welcome!
fields
Combinatorics
pdf ↗ page arXiv:2611.01246 ↗

We study the maximum number of $t$-cliques in graphs with maximum degree at most $D$ and matching number at most $M$, with no restriction on the number of vertices. For $t\ge 3$, we determine this maximum whenever $D\ge 2M-1$ and characterize all extremal graphs when the maximum is positive. Up to isolated vertices, these are complete or complete split graphs for $D\ge 2M$, while $K_{2M}$ is uniquely extremal when $D=2M-1$. We also derive a general upper bound from the Chvátal-Hanson edge theorem and refine it for even $D$. For fixed even $D$ and $3\le t\le D+1$, every extremal graph consists, apart from isolated vertices, of copies of $K_{D+1}$ together with a remainder whose order is bounded independently of $M$. When $D/2$ divides $M$, this remainder is empty and the extremal graph is unique. This structure yields an eventual recurrence, reducing the determination of all extremal values and graphs to finitely many matching bounds.

fields
Combinatorics
pdf ↗ page arXiv:2611.01259 ↗

The existence of limiting threshold densities for random hypergraph $2$-colourability and random NAE-$k$-SAT was conjectured in earlier work, including Achlioptas and Moore [RANDOM 2002] and Coja-Oghlan and Panagiotou [STOC 2012]. We prove these conjectures for all $k\geq 3$. We also show that $α^{\mathrm{2-col}}_k \leq α^{\mathrm{NAE}}_k$ for each $k\geq 3$.

fields
Combinatorics
pdf ↗ page arXiv:2611.01338 ↗

A graceful labeling of a tree with $m$ edges is a bijection from its vertices to $\{0,1,\ldots,m\}$ whose edge differences are pairwise distinct. The Graceful Tree Conjecture asserts that every tree admits such a labeling; equivalently, the smallest graceful tree containing a given $m$-edge tree has $m$ edges. For this embedding problem, Sethuraman, Ragukumar and Slater proved that fewer than $4m$ edges suffice, while Sethuraman and Ragukumar observed that in practice fewer than $2m$ appear to suffice. We prove the latter bound for every tree. For any root of height $h$ with $t_h$ vertices at maximum distance, we construct a graceful tree containing the original tree with exactly $M=2m-h-t_h+1$ edges; in particular, $2m-\operatorname{diam}(T)$ edges suffice. The construction completes a cyclic reflection of van Bussel's level labeling without increasing its span; each original edge difference $d$ is replaced by $M+1-d$. Unused vertex labels and missing edge differences are indexed by the same intermediate-level positions, allowing an explicit attachment rule that preserves the tree property. The best root for this construction is computable in linear time. Because every graceful supertree labeling restricts to a range-relaxed labeling, a uniform supertree bound of $(2-\varepsilon)m+O(1)$ would imply such a range-relaxed bound for all trees.

comments
11 pages, 3 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.01340 ↗

We design the first fully polynomial-time randomized approximation scheme ($\mathsf{FPRAS}$) to estimate the mixed volume of $n$ arbitrary compact convex sets in $\mathbb{R}^{n}$ specified by weak membership oracles. This disproves a longstanding conjecture of Gurvits (2009). $\textbf{AI Disclosure}$ The main ideas were generated entirely by GPT 6 Astra. The purpose of this paper is to provide a human-written exposition of the algorithm.

fields
Combinatorics, Probability
pdf ↗ page arXiv:2611.01368 ↗

For each nonempty finite simple graph, we study five full multivariate partial-twuality polynomials defined using matrix ranks and coranks over $\mathbb{F}_2$. Over an arbitrary coefficient field $K$, we give a necessary and sufficient criterion for nontrivial factorization in the Laurent polynomial ring by additive separation of the exponent function across a nontrivial vertex partition. For $\bullet\in\{τ,δτ,τδ,δτδ\}$, the full multivariate partial-$\langle\bullet\rangle$ polynomial is irreducible in $K[z^{\pm1},\mathbf{u},\mathbf{v}]$ if and only if the graph is connected. For $δ$, we characterize the connected graphs whose polynomials are reducible by a condition on the parities of vertex degrees and of the numbers of common neighbors, and determine their irreducible factors. For each operation, the corresponding polynomial is irreducible in $K[z,\mathbf{u},\mathbf{v}]$ if and only if the graph is connected and at least one state has zero $z$-exponent. In particular, the full multivariate partial-$\langleδ\rangle$ polynomial is irreducible in $K[z,\mathbf{u},\mathbf{v}]$ if and only if the graph is connected and bipartite.

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

For every integer $p\ge2$, we construct a globally well-defined positive odd sequence $Q_p$ satisfying, after an explicit finite initial block, $Q_p(n)=Q_p(n-Q_p(n-1))+Q_p(n-Q_p(n-2))-(-1)^n$. Its binary block words admit the exact factorization $U_{p,k}=(A_k\overline{A}_{k+1})^{p-1}A_{k+2}$, producing exactly $2p-1$ alternating signed arches per natural block. The elementary word heights converge uniformly to the Gaussian isoperimetric profile $\varphi\circΦ^{-1}$. For each fixed $p$, this yields an explicit dyadic limiting profile with $2p-1$ sign transitions and a sharp relative-error constant $Λ_p=b_p/2$, where $b_p$ is determined by $b_p((3p-1)/2+Φ(-b_p))=\varphi(b_p)$. We determine all zeros and parity crossings in sufficiently large dyadic blocks. For $p\ge3$, there are exactly $2p-1$ transverse even-index zeros, whereas the three-arch case $p=2$ exhibits an alternating four/six-zero pattern. An ordered frequency factorization gives exact dyadic histograms, moments, total-variation distances, and extremal multiplicities. The limiting frequency generating function $z^3/(2-z)$ is universal, although the highest finite multiplicities depend on $p$. Finally, the summatory function has main terms $N^2/4+(N/2)\log_2N$, an explicit parameter-dependent log-periodic term of order $N$, and remainder $O_p(N/\sqrt{\log N})$.

comments
48 pages, 12 figures. The three-arch member Q_2 is OEIS A401334. Reproducibility archive: https://doi.org/10.5281/zenodo.23593788
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2611.01453 ↗

For $n\ge2$, a good slope of a permutation $f$ of $\mathbb{Z}_n=\mathbb{Z}/n\mathbb{Z}$ is an element $m\in\mathbb{Z}_n$ for which $x\mapsto f(x)+mx$ is a permutation. We prove the sharp upper bound $\varphi(n)$ on the number of good slopes, where $\varphi$ is Euler's totient function. We classify and count the equality cases for prime powers and products of two distinct odd primes. Non-affine equality cases exist for every composite $n\ge6$. We also prove the sharp bound $p_0-1$ for the size of a set of good slopes with invertible differences between distinct elements, where $p_0$ is the least prime divisor of $n$. Finally, we establish gap results below $\varphi(n)$ and apply our bounds to a construction of quantum Latin squares due to Ball and Simoens.

comments
31 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.01465 ↗

For every fixed integer $k\ge2$, we prove that every simple graph on $n$ vertices drawn in the plane with no $k$ pairwise crossing edges has at most $C_kn$ edges, where $C_k$ depends only on $k$. We allow any finite number of proper crossings between two edges, including edges with a common endpoint. For $n\ge3$, removing a small disk around each vertex turns the drawing into a family of arcs on a sphere with $n$ boundary circles. Each arc joins two different boundary circles, and different edges have different unordered pairs of endpoint circles. The arcs are therefore essential and pairwise nonhomotopic, with endpoints allowed to move along their boundary circles during a homotopy. Any family of pairwise intersecting lifts to the universal cover projects to distinct graph edges that cross pairwise. Its size is consequently at most $k-1$. Beeker and Lazarovich's theorem on surface patterns then bounds the number of arcs. Their estimate is linear in the size of a triangulation, and an explicit triangulation of the $n$-holed sphere has linearly many edges and triangles.

comments
6 pages, 1 figure
fields
Combinatorics
pdf ↗ page arXiv:2611.01509 ↗

The edge-connectivity $κ(G)$ of a graph $G$ is the minimum number of edges whose removal disconnects $G$, and it is bounded above by the minimum degree $δ(G)$. We classify all connected locally finite simple graphs with nonnegative Bakry–Émery curvature satisfying $κ(G)<δ(G)$. All such graphs are infinite. Consequently, every finite connected simple graph with nonnegative Bakry–Émery curvature satisfies $κ(G)=δ(G)$, confirming a conjecture of Chen, Koolen, and Liu.

comments
19 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.01535 ↗

This short paper presents the interesting relation between integer sequence A319433 in https://oeis.org and the maximum degrees of the family of finite linear Jaco graphs $J_n(x)$ where $n = 1,2,3,\dots$. The result first appeared as a conjecture. Subsequently, a proof through AI-assisted mathematical reasoning came to the fore. Appropriate clarity remarks follow in the main text. It appears that $\textit{Golden ratio}$-like floor function plays an important role in the analysis of the graph structural properties of the family of finite linear Jaco graphs.

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

The study of extremal problems for set mappings was initiated by Erdős and Hajnal in 1958. Alon and Caro, and later Caro, Patkós, Tuza and Vizer, studied related problems for edge mappings of graphs. For a graph $G$ with $n$ vertices and $m$ edges, let $g_0(G)$ be the minimum integer $N$ such that every mapping $f:E(K_N)\to E(K_N)$ satisfying $f(e)\cap e=\varnothing$ for every $e\in E(K_N)$ admits a copy $G^*$ of $G$ in $K_N$ with $f(e)\notin E(G^*)$ for every $e\in E(G^*)$. Gishboliner, Jin and Sudakov conjectured that $g_0(G)=O(n+m/\sqrt n)$. In this paper, we disprove this conjecture by constructing a family of graphs. We then prove that $g_0(G)=O(n+m^{3/4})$. Furthermore, for every $n\ge2$ and $m$ satisfying $\lceil n/2 \rceil\leq m\leq \binom{n}{2}$, there exists a graph $G_*$ with $n$ vertices, $m$ edges and no isolated vertices satisfying $g_0(G_*)=Ω(n+m^{3/4})$. Thus the upper bound is best possible in terms of $n$ and $m$.

fields
Combinatorics
pdf ↗ page arXiv:2611.01577 ↗

We study the 2-connected subgraphs of minimally 3-connected graphs whose contraction preserves 3-connectedness. We show that every minimally 3-connected graph that is not a wheel or a complete bipartite graph $K_{3,n}$ contains a contractable 2-connected induced subgraph that is a cycle, a fan, a $K_{2,n}$ or a $K_{3,n}$. In addition, these subgraphs satisfy certain degree restrictions. We show that none of these four families can be discarded since for each one of the four families, there exists a minimally 3-connected graph containing a contractable induced 2-connected subgraph in that family and none in the other three families. Reversing the contraction process gives a new construction for 3-connected graphs using edge addition, expansions into prescribed 2-connected subgraphs and $Y$-sum.

comments
11 pages, 5 figures, submitted to Journal of Graph Theory
fields
Combinatorics
pdf ↗ page arXiv:2611.01588 ↗

We give a computer-assisted proof that the rectangle covering number, or Boolean rank, of every polygon slack matrix of order 35 through 40 is nine. The upper bound is due to Goucha, Gouveia, and Silva; the new contribution is the matching lower bound. A hypothetical covering by eight rectangles yields a saturated inclusion cycle between two antichains on eight coordinates. An exact maximal-chain identity bounds its length and assigns a nonnegative penalty to each inclusion edge. The equality case is excluded combinatorially, leaving at most 39 lower vertices. For orders 35 through 39, symmetry reductions and a shadow bound leave fifteen finite exclusions, each supported by a checked reverse-unit-propagation refutation. The main text presents the mathematical reductions and their dependencies; the accompanying supplement gives the complete cycle parameters, encodings, and certificate record. The previously known equality for orders 41 through 55 is cited directly.

comments
Includes supplementary material. Computational certificates and verification materials are available at https://doi.org/10.5281/zenodo.23837747
fields
Combinatorics
pdf ↗ page arXiv:2611.01674 ↗

For an integer \(k\ge 3\), let \(T_k(3)\) be the least positive integer \(N\) such that, for any \(3\)-coloring of \([1,N]\), there exists a monochromatic solution to \(x+(k-1)y=z\). In this paper, we prove that \(T_k(3)=k^3+2k^2-2\) for all \(k\ge 3\). In the notation \(s_a(3)\) of the first author, with \(a=k-1\), this says that \(s_a(3)=a^3+5a^2+7a+1\) for all \(a\ge 2\), which confirms the conjecture proposed in 2020. Note that every solution to \(x+(k-1)y=z\) is also a solution to \(x_1+\dots+x_k=x_{k+1}\). So the theorem also gives a new proof of the upper bound in the three-color theorem of Boza, Marín, Revuelta and Sanz, using only this restricted equation. The lower bound is an explicit recursive coloring. For the upper bound, we fix one set \(\Xmin\) of \(33\) polynomials in \(k\), together with the \(144\) polynomial identities \(z=x+(k-1)y\) that hold among them, and we show that no \(3\)-coloring of \(\Xmin\) avoids a monochromatic identity. Since every relation is an identity in \(k\), a single argument covers all \(k\). The argument is a case analysis with \(62\) cases and depth \(8\), and it uses only two elementary rules. It is written out in full in an appendix and has been checked by an independent program. The set \(\Xmin\) is critical, that is, removing any one of its elements makes it \(3\)-colorable. It is also a critical subset of minimum size of the \(51\)-element set from which it was extracted. Finally, we describe the rigid structure shared by all extremal colorings of \([1,k^3+2k^2-3]\).

fields
Combinatorics
pdf ↗ page arXiv:2611.01714 ↗

Let $A=(a_{ij})$ be a nonnegative row-stochastic or column-stochastic $n\times n$ matrix of rank at most $k$, where $1\le k\le n$. Write $n=qk+s$, where $0\le s<k$. The author conjectured in 2018 that, for every permutation $σ$ of $\{1,\ldots,n\}$, $\prod_{i=1}^n a_{i,σ(i)}\le q^{-q(k-s)}(q+1)^{-(q+1)s}$. We prove this bound and classify all equality cases.

fields
Combinatorics
pdf ↗ page arXiv:2611.01763 ↗

The classical cactus theorem of Dinitz, Karzanov and Lomonosov from 1976 states that the minimum edge-cuts of a connected graph are displayed by a cactus. For vertex-separations, Tutte's theorem gives an exact cactus-decomposition for connectivity $2$, but exact cactus-decompositions fail for higher connectivity. Extending earlier approximate cactus-decomposition results for connectivities $3$ and $4$ by Carmesin and Kurkofka [FOCS 2023] and Kurkofka and Planken [SODA 2026] to all connectivities, we prove that for every $k\in\mathbb{N}$ there is a constant $d=d(k)$ such that every $k$-connected graph $G$ admits a cactus-decomposition displaying $k$-separations such that every $k$-separation of $G$ has edit-distance at most $d$ to a displayed separation. Our proof develops tools that may be useful beyond this result. The first is a three-dimensional version of the classical corner-diagram method, which we use to show that triples of crossing $k$-separations have a controlled two-dimensional behaviour. The second is a covering-space approach for studying local crossing patterns from a global perspective. Third, we advance the theory of flowers, which originated in matroid theory.

fields
Combinatorics
pdf ↗ page arXiv:2611.01772 ↗

A perfect 1-factorisation (P1F) of $K_{2n}$ is a partition of its edges into $2n-1$ perfect matchings, any two of which form a Hamiltonian cycle. Exhaustive classification is known only up to $K_{16}$. We present a method for the exhaustive generation, up to isomorphism, of perfect 1-factorisations with a non-trivial automorphism group, which reduces the search tree far enough to make $K_{18}$ and beyond feasible. It combines two ideas. For automorphism groups of order greater than 2, classical results of Ihrig on the automorphisms of P1Fs are used as tools that reject almost all prescribed cycle types without search. For the order-2 case, which dominates, candidates are recalculated from inherited compatibility lists, in the spirit of Gill and Wanless, with an outer loop over two further rows that keeps those lists small, and Ihrig's results restrict the first factor. As the numerical proof of the method we compute all 10,710 P1Fs of $K_{18}$ with a non-trivial automorphism group; before, only six were known.

comments
4 pages. Submitted to the Australasian Journal of Combinatorics. data: Zenodo DOI 10.5281/zenodo.22238984; code: https://github.com/LeAndr-Graph/P1F-Census
fields
Combinatorics
pdf ↗ page arXiv:2611.01807 ↗

The Wiener index $W(G)$ of a connected graph $G$ is the sum of the distances between all unordered pairs of vertices. A vertex $x$ is a Šoltés vertex if $G-x$ is connected and $W(G-x)=W(G)$. We construct an infinite family of graphs in which the proportion of Šoltés vertices is strictly greater than $(\sqrt{21}-3)/3=0.5275\ldots>1/2$ and decreases to this value from $2/3$. The family is also described by a generalized Pell equation and starts from a $12$-vertex example of Akhmejanova et al. (Discrete Appl. Math. 325 (2023) 37-42). We also show that the construction remains valid after adding edges among certain vertices.

fields
Combinatorics
pdf ↗ page arXiv:2611.01808 ↗

Let $A$ be the adjacency matrix of $G\sim G(n,1/2)$, let $D=\operatorname{diag}(A\mathbf{1})$, and let $Λ_G=\mathbb{Z}\langle A,D\rangle\mathbf{1}$. We prove $\Pr[Λ_G\ne\mathbb{Z}^n]\le n^{-3/20+o(1)}$. Thus two dependent graph operators generate the entire vertex lattice from the constant vector, simultaneously over every prime field. Adjacency alone has a modulo-two rank obstruction for every simple graph of order greater than one, even though its rational word span is typically full. The proof first constructs words containing at most two adjacency operations whose integer span contains $Δ_G^3\mathbb{Z}^n$, where $Δ_G$ is the product of the pairwise differences between distinct degree values. This confines all possible arithmetic obstructions to a finite prime range on a single event. We then remove the remaining obstructions using conditional alternating forms, symmetric random-matrix code estimates, and uniform counts of degree-graded invariant subspaces. We connect the integer lattice to graph reconstruction through pointed moments. Saturation forces every pointed orthogonal AD intertwiner to be a vertex permutation. The short-word construction also shows that a fixed polynomial-size family of ordinary caterpillars, of diameter at most seven and order $O(\sqrt{n\log n})$, identifies almost every graph among all finite simple graphs. For nonsaturated full-rank lattices, we give an exact description of the moment fibre by admissible unimodular overlattices; at index two, the only possible ambiguity is a specified four-vertex Godsil–McKay switch.

fields
Combinatorics
pdf ↗ page arXiv:2611.01838 ↗

In 1959, Tutte proved that a matroid can be realised by a graph if and only if it does not have a minor isomorphic to $U_{2,4}$, $F_7$, $F_7^*$, $M^*(K_5)$ or $M^*(K_{3,3})$. In this paper, we extend this theorem to determine when it is possible to find a graphic realisation $G$ of a matroid $M$, subject to a list of additional constraints of the following form: a subset $F$ of the elements of $M$ must induce a connected subgraph of $G$. We prove that a connected matroid with such constraints—called a `constraint matroid'---is realisable as a graph satisfying those constraints if and only if it does not contain as a minor one of the constraint matroids from a given list: that is, the original $5$ matroids of Tutte, a further $9$ sporadic constraint matroids, and two well-behaved infinite families. Matroids realisable as graphs appear famously in Whitney's planarity criterion: Carmesin proved an extension of Whitney's planarity criterion to the embeddability of local simply connected $2$-complexes into $\mathbb{R}^3$. An application of our theorem is an extension of this theorem beyond the simply connected regime.

comments
49 pages, 15 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.01841 ↗

We construct infinite $B_h$ sets that repeatedly attain the density scale of finite $B_h$ sets. For every integer $h\geq2$ and every finite $B_h$ set $F$ of positive integers, we obtain an infinite $B_h$ set $A\supseteq F$ such that $$ \limsup_{x\to\infty}\frac{A(x)}{x^{1/h}}=\frac1h, \qquad \liminf_{x\to\infty}\frac{A(x)}{x^{1/h}}=0. $$ The key is to preserve density while preventing additive relations between successive blocks. A positional encoding of the finite-field moment curve has $q$ elements in an interval of length $O_h(q^h)$, while, for each $1\leq r<h$, sums arising from distinct $r$-element multisets are separated by more than $q$. This separation allows whole blocks to be appended to a prescribed finite set without a further dilation. In particular, our result gives a negative answer to a problem posed by Szemerédi \cite{szemeredi}.

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

In the maximum-weight degree-bounded forest problem, we are given a graph with nonnegative edge weights and a degree upper bound on each vertex. The objective is to find a maximum-weight forest satisfying the degree bounds. We show that this problem admits a simple $2$-approximation via the greedy algorithm. This already improves over the best-known guarantees obtained via a reduction to weighted $3$-matroid parity, and sets a baseline to improve upon. Our main result is an $\frac{8}{5}$-approximation algorithm for the maximum-weight degree-bounded forest problem. For the special case of uniform degree bounds, our algorithm achieves an approximation ratio of $\frac{3}{2}$. It computes two sets of edges, each of which we then restrict to a feasible solution in an optimal way, and finally returns the better of the two resulting solutions. To obtain the initial two edge sets, we first relax the degree bounds and leverage an algorithm by Lau and Singh [JACM'15] for degree-bounded spanning trees, and second we relax the forest constraints and employ an algorithm for maximum-weight $b$-matchings.

comments
to appear in SOSA 2027
fields
Combinatorics
pdf ↗ page arXiv:2611.01875 ↗

Let $m(k,b)$ denote the minimum number of edges in an intersecting $k$-uniform hypergraph in which every $(k-1)$-set of vertices is disjoint from at least $b$ edges, with $m(k,b)=+\infty$ if no such hypergraph exists. Duke and Erdős [Congressus Numerantium (1980)] asked whether $m(k,k)=o(k^4)$ is possible. In this paper, we answer this question affirmatively and determine the order of growth of $m(k,k)$ by proving that $k^2+1\leq m(k,k)\leq Ck^2$ for all sufficiently large $k$, where $C$ is an absolute constant. More generally, we show that $m(k,b)=Θ(kb)$ for all sufficiently large odd $k$ and every integer $b$ with $k\leq b\leq (k-1)(k-3)/2$, where the implied constants are independent of $k$ and $b$.

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

Motivated by the recent asymptotic formula for the moment of the alternating sum of parts in partitions by Craig and Li, we study the moment of the alternating sum of parts in compositions. We establish closed formulas for this moment using techniques involving generating functions, matrix diagonalization, Krawtchouk polynomials, differential equations, and Faà di Bruno's formula. Our result is connected with some known integer sequences in the OEIS and admits a combinatorial interpretation by coin flipping.

fields
Combinatorics
pdf ↗ page arXiv:2611.01919 ↗

We establish new relationships among several fundamental measures of real-world networks, including the average clustering coefficient, the global clustering coefficient, the average shortest-path length and degree centrality, closeness centrality, betweenness centrality and ksi-centrality. We further develop the theory of $j$-neighborhood centrality, which encompasses degree centrality and ksi-centrality as special cases.

fields
Combinatorics
pdf ↗ page arXiv:2611.01957 ↗

The well-known Erdős-Hajnal conjecture states that for any graph $H$, there is a constant $c=c(H)>0$ such that every $n$-vertex graph $G$ with no induced copies of $H$ contains a clique or an independent set of size at least $n^{c}$. In this paper, we prove that the Erdős-Hajnal conjecture holds for every path.

comments
28 pages, 1 figure
fields
Combinatorics
pdf ↗ page arXiv:2611.01963 ↗

The path-width of a matroid is the minimum, over all orderings of its ground set, of the maximum value of its connectivity function on an initial segment. For any two connected rooted matroids whose roots are neither loops nor coloops, we form the 2-sum of each with a third such rooted matroid by identifying their roots and deleting the common element. The two original rooted matroids are equivalent when these sums agree on whether their path-width is at most two for every choice of the third rooted matroid. We prove that the two rooted matroids are equivalent if and only if this agreement holds for thirteen fixed graphic or cographic rooted matroids. They distinguish exactly twenty equivalence classes, and, moreover, there exists no family of twelve fixed connected rooted matroids that can guarantee this. Using these classes, we show that the tree in the canonical tree decomposition of an excluded minor for path-width at most two has diameter at most ten edges. For a connected matroid given by a tree decomposition using 2-sums, we give an exact recurrence to decide whether its path-width is at most two and to construct an ordering of width at most two when possible. Moreover, we derive a formula for the path-width of parallel extensions that gives complete binary excluded-minor lists in ranks three, four and five, containing two, four and eleven isomorphism classes, respectively.

fields
Combinatorics
pdf ↗ page arXiv:2611.01969 ↗

Let $G$ be a finite abelian group. The Erdős-Ginzburg-Ziv constant $\mathsf{s}(G)$ is the smallest positive integer $\ell$ such that every sequence over $G$ of length at least $\ell$ contains a zero-sum subsequence of length $\exp(G)$. The short zero-sum constant $η(G)$ is defined similarly, with the requirement that the zero-sum subsequence is nonempty and has length at most $\exp(G)$. It is known that $\mathsf{s}(G)\ge η(G)+\exp(G)-1.$ A conjecture proposed by W. Gao in 2003, which has been widely studied in zero-sum theory, predicts that $$ \mathsf{s}(G)=η(G)+\exp(G)-1 $$ for every nontrivial finite abelian group $G$. In this paper, we prove that this conjecture fails for the group $C_2^7\oplus C_6$.

fields
Combinatorics
pdf ↗ page arXiv:2611.01972 ↗

In 1993, Cao and Hong posed the problem of characterizing graphs whose second largest adjacency eigenvalue is greater than $1/3$ and less than $(\sqrt5-1)/2$. Subsequent work extended the question to the non-strict bound. We give a complete structural characterization of connected graphs $G$ with $|V(G)|\ge2$ satisfying $λ_2(G)\le(\sqrt5-1)/2$. Their complements are described by disjoint unions of graphs from an explicit family with least adjacency eigenvalue at least $-(1+\sqrt5)/2$, possibly together with a cone or a thin or thick spider constructed from disjoint unions of members of the same family, subject to explicit numerical inequalities. This provides a positive characterization of the class, going beyond the classical result of Cvetković and Simić that the bound $λ_2\le(\sqrt5-1)/2$ admits only finitely many minimal forbidden induced subgraphs.

comments
20 pages, 2 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.02005 ↗

We study the problem of guarding a set of straight lines in the plane by selecting a minimum-cardinality set of points such that every line contains at least one selected point. This problem is known to be strongly NP-hard \cite{megiddo}. We investigate approximation algorithms for the problem and analyze their performance guarantees under various structural assumptions on the underlying line arrangement. In particular, we present approximation schemes based on set-cover techniques, relaxation methods, and properties of maximal lines. We establish constant-factor bounds on the approximation ratio for several classes of arrangements and derive relationships between the guarding number and the incidence parameters of the arrangement. Connections with Dirac-type incidence results are also explored.

comments
21 pages, no figures
fields
Combinatorics
pdf ↗ page arXiv:2611.02046 ↗

Let $\mathsf D(G)$ denote the Davenport constant of a finite abelian group $G$, the maximal length of a minimal zero-sum sequence over $G$. Gao and Geroldinger conjectured that every minimal zero-sum sequence of length $\mathsf D(G)$~\cite[Conjecture~6.1]{GG99} and every zero-sumfree sequence of length $\mathsf D(G)-1$~\cite[Conjecture~4.1]{GG06} contains an element of order $\exp(G)$. We disprove both conjectures by proving a density-one theorem: for every fixed finite abelian group $H$ of exponent $M=2^ap^b$, where $a\ge2$, $b\ge1$, and $p$ is an odd prime, the set of integers $r\ge0$ for which $G_r=C_2^r\oplus H$ admits a minimal zero-sum sequence of length $\mathsf D(G_r)$ with no term of order $M$ has natural density one.

comments
5 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.02063 ↗

We prove the Conway–Guttmann formula for the generating function of $k$-convex polyominoes by semi-perimeter, for every $k\ge2$. A decomposition according to the two diagonal directions reduces the enumeration to convex polyominoes satisfying a one-bend condition in one diagonal direction. Splitting these polyominoes at the right endpoint of the top row leaves an initial part followed by columns whose vertical intervals decrease by inclusion. Ordered forests describe the initial part and retain the row information needed to determine when column extensions first exceed the prescribed bound. A first-passage calculation, together with a sum over initial parts already above the bound, gives the required generating function. The argument includes the case $k=2$.

comments
31 pages, 4 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.02072 ↗

The Naples parking functions are a major generalization of the classical parking functions, where cars have more options to park because they are allowed to check (and possibly park) backward up to a fixed number of spots before driving forward as in the classical case. In a previous work, using involutions we established an injection from the Naples parking functions to a special set of obstructed parking functions, which we referred to as \textit{left obstructed}, thereby immediately obtaining a crude upper bound on the former set. We continue that work here by identifying the image of this injection, providing a characterization of Naples parking functions as a certain (smaller) set of obstructed parking functions, which we will refer to as \textit{long left obstructed}. We also derive a formula for the number of left obstructed parking functions. These combined allow us to improve the upper bound on the Naples parking functions. In addition, we demonstrate how lower bounds for this set can be obtained. As will become clear, the long left obstructed parking functions have certain combinatorial features that are useful in estimating the cardinality of the set, which are not obvious from solely looking at Naples parking functions.

comments
13 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.02098 ↗

A family of perfect matchings on the same vertex set is said to have the Kotzig property if the union of any pair of matchings forms a Hamilton cycle. Kotzig famously conjectured that, when $n$ is even, the complete graph on $n$ vertices can be decomposed into $n-1$ perfect matchings with the Kotzig property. A closely related conjecture of Wormald states that, for fixed $d \ge 3$, whp a random $d$-regular graph contains $d$ perfect matchings with the Kotzig property. Recently, the first and third authors considered a version of these problems for the binomial random graph $G(n,p)$ and proved that, for every fixed $k$, there is $C=C(k)$ such that whp $G(n,C\log n/n)$ contains $k$ perfect matchings with the Kotzig property. We strengthen this result by showing a hitting time version: for every fixed $k$, whp the hitting time in the random graph process for finding $k$ edge-disjoint perfect matchings with the Kotzig property is the same as the hitting time for a graph with minimum degree $k$. This is a generalisation of the celebrated result of Bollobás and Frieze for even $n$ establishing the hitting time for $k$ edge-disjoint Hamilton cycles. The proof uses several ideas. We first design a coupling, via a randomised algorithm, of the random graph at the hitting time with $k$ almost-independent perfect matchings and a set of random reservoir edges, which may be of independent interest. We then prove various statistical properties of these matchings, in particular concerning the cycle structure of the $2$-factors formed by pairs of matchings. This includes a novel concept of ``shuffledness'', which we establish through a careful exposure argument and a concentration inequality for random permutations. Finally, we show that the initial $2$-factors can be merged into Hamilton cycles, using the random reservoir edges, by analysing certain Pósa-type rotations via branching processes.

comments
24 pages, 4 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.02128 ↗

For a degree sequence d on n vertices with M edges, let G(d) be the number of simple graphs and D(d) the number of loopless digraphs with in-degree = out-degree = d. We conjecture that G(d) >= sqrt(D(d)) exp(-C n log(2+M/n)) for every graphical d, a single inequality across all densities, and prove it up to an extra factor log n: G(d) >= sqrt(D(d)) exp(-C n log n log(2+M/n)) for every graphical d. The proof compares pairs of graphs with Eulerian digraphs by alternately colouring closed trails; the failure of injectivity is measured exactly, shared edges cancel against 2-cycles, and parity is handled by merging trails and by a parity argument on Eulerian circuits of odd components. No asymptotic enumeration and no bound on the maximum-entropy multipliers is used. When the maximum-entropy edge probabilities lie in [delta, 1-delta], the same method gives the conjecture itself, G(d) >= sqrt(D(d)) exp(-C n log n / delta). Combined with the exact identity G(d) = exp(g*(d)) pi(d), where pi(d) is the probability that the maximum-entropy beta-model has degrees exactly d, and a van der Waerden-type bound for D(d), this shows that uniformly random graphs with degree sequence d are close in the normalized cut metric to their beta-model whenever M >> n log n log(M/n), at every density, with no tameness and no cap on the degrees. We also record the conjecture in the sparse regime and, with constant 1/2+o(1), in the dense tame regime, from the asymptotic enumerations of McKay-Wormald and Barvinok-Hartigan.

comments
15 pages
fields
Combinatorics, Probability
pdf ↗ page arXiv:2611.02191 ↗

Let $G$ be a simple graph on $N$ nodes and $M$ edges, with minimum degree at least $2$. We prove that the non-backtracking Laplacian of $G$ has at least $2M-2N+2c+2b$ real eigenvalues, counted with algebraic multiplicity, where $c$ is the number of connected components of $G$ and $b$ is the number of bipartite ones. More precisely, at least $M-N+2c$ of them lie in $[0,1)$ and at least $M-N+2b$ lie in $(1,2]$. We show that the bound $2M-2N+2c+2b$ is sharp, and that a connected $d$-regular graph attains it if and only if it is strictly Ramanujan, i.e., every adjacency eigenvalue $μ\ne\pm d$ satisfies $|μ|<2\sqrt{d-1}$. For completeness, we also show that the non-backtracking Laplacian has at most $2M-2c-2b$ real eigenvalues.

fields
Combinatorics, Spectral Theory
pdf ↗ page arXiv:2611.02194 ↗

We define a quasisymmetric analogue of the Bruhat order on indexed binary forests using the multiplicity-free Monk rule for forest polynomials. For the finite window $\mathcal{P}_n$ of forests supported in $[1,n]$, we construct an explicit partition into saturated chains terminating at the top rank, proving that $\mathcal{P}_n$ is strongly Sperner. We also recover the known Catalan ballot formula for its rank numbers. For principal lower intervals, we prove that $[\varnothing,F]$ is a lattice if and only if it is Boolean, and characterize this property by the avoidance of a bent corner in $F$, a path of three internal vertices that changes direction. This gives a forest analogue of the pattern-avoidance characterization of Boolean principal Bruhat intervals. We also conjecture that every principal lower interval is shellable, providing computational evidence and proving the conjecture for a family of hook intervals.

comments
32 pages, 17 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.02210 ↗

Let $Λ_n$ be the set of all eigenvalues of $n\times n$ standardized Laplacian matrices, and let $S_n\subseteqΛ_n$ be the polygon introduced in 2005, with upper vertices $λ_0=0,\dots,λ_{n-1}=1$. It is now known that $Λ_n=S_n$, and that $Λ_n$ is convex, if and only if $n\le4$. We study how $Λ_n$ leaves $S_n$ near an edge $[λ_m,λ_{m+1}]$, $2(m+1)<n$. First, we prove a switching law for matrices having a boundary point of $Λ_n$ as a simple eigenvalue: an explicit switching function on the arcs, built from the left and right eigenvectors and the outward normal, forces maximal weight where positive and zero weight where negative; intermediate weights occur only where it vanishes. Second, we perturb the weights of the arcs $k\to k+m+1$ in the circulant digraph (arcs $k\to k+s$, $1\le s\le m$, plus these arcs with weight $τ$) that realizes the point $λ_m+τ(λ_{m+1}-λ_m)$. At second order, the first Fourier harmonic of the perturbation moves the eigenvalue beyond the line of the edge if and only if $τ<τ^*_m=\sin(πm/n)/(2\cos(π/n)\sin(π(m+1)/n))$. For even $n$ and $m$, the point with $τ=τ^*_m$ is the vertex of $S_{n/2}$ lying on this edge, and digraphs with these arcs only at even $k$ give an explicit eigenvalue path that leaves $S_n$ at $λ_m$ and, in all computed cases, ends at this vertex. Third, we give a conjectural, numerically supported picture of $\partialΛ_5$: beyond each edge of $S_5$ not incident to $0$ or $1$, $Λ_5$ forms a cap bounded by four algebraic arcs, which leaves the edge tangentially at its endpoint adjacent to $0$ or $1$ and rejoins it at $τ^*_1=(3-\sqrt5)/2$; the rest of the edge lies on $\partialΛ_5$. In computations for $n\le8$, a cap returns to its edge smoothly at $τ^*_m$, at a corner at $τ^*_m$, or at a corner beyond $τ^*_m$.

comments
10 pages, 2 figures
fields
Combinatorics, Rings and Algebras, Spectral Theory
pdf ↗ page arXiv:2611.02249 ↗

In this paper, we study the lattice tilings of $\mathbb{Z}^n$ by the symmetric limited magnitude error balls $\mathcal{B}(n,t,k,k)$, which play a crucial role in flash memory applications. Using generating functions and complete Bell polynomials, we derive an explicit formula for the $r$-th Q-polynomial associated with $\mathcal{B}(n,t,k,k)$. Then, an ideal-theoretic characterization of the lattice tiling condition is developed: for an odd prime $p$ dividing $|\mathcal{B}(n,t,k,k)|$ exactly once, a lattice tiling would force a certain polynomial to lie outside a certain ideal of $\mathbb{F}_p[Y_1,\dots,Y_{\frac{p-1}{2}}]$. Applying this criterion yields congruence conditions on the dimension $n$ that rule out lattice tilings; for $2\le t\le10$ and $1\le k\le10$, a systematic Maple computation over all primes $3\le p\le29$ excludes, on average, $35.65\%$ of all dimensions, with a maximum of $76.69\%$. Finally, we obtain two infinite families of parameters $(n,t,k)$ for which no lattice tiling exists: no lattice tiling exists if $k\equiv4\pmod9$ and the base-$3$ addition of $t$ and $n-1-t$ produces exactly one carry; and no lattice tiling of $\mathbb{Z}^n$ by $\mathcal{B}(n,n-1,k,k)$ exists if $k\equiv8\pmod9$ and $n\equiv2,4\pmod6$. Their sizes are also estimated.

fields
Combinatorics
pdf ↗ page arXiv:2611.02394 ↗

Let \(F\) be the net, consisting of a triangle with one distinct degree-one vertex attached to each of its vertices. A graph is \(F\)-saturated if it contains no copy of \(F\), but adding any missing edge creates one. Zhao, You and Zhang determined the minimum number of edges and conjectured that the minimum graph is unique at every sufficiently large even order. We prove that for every even \(n\ge12\), there are exactly four minimum \(n\)-vertex \(F\)-saturated graphs up to isomorphism, each with \(3n/2\) edges. Three additional families therefore disprove their even-order uniqueness conjecture. Two have no universal vertex, that is, no vertex adjacent to every other vertex. We also construct a ten-vertex minimum graph with fifteen edges outside the four families, proving that the threshold twelve is optimal. The key structural step forces a pendant triangle, meaning a triangle with two vertices of degree two, in every even-order minimum graph above order ten. We classify the graphs containing such a triangle and bound the order of all remaining extremal configurations by ten.

comments
29 pages,1 figures;
fields
Combinatorics
pdf ↗ page arXiv:2611.02399 ↗

Local occupancy can be used to bound the expected size of a hard-core independent set. The framework of locally stationary distributions shows that for triangle-free graphs, despite slow mixing at the relevant fugacity parameter, standard Glauber dynamics can be used to find sets close to the local occupancy guarantee. We improve the application of this framework to the hard-core model by replacing a conditional mixing argument with a more direct approach based on a short sequence of single-site updates that, from every initial configuration, achieves the required occupancy inequality. In general graphs, naive conditional mixing estimates or certain problematic structures in the neighborhood can in principle incur running time cost exponential in the maximum degree $Δ$. We design short update sequences that, via our relaxed criterion, yield running times polynomial in $Δ$ for graphs with a hereditary bound $b$ on the density of $K_{t,t}$ subgraphs in neighborhoods. Our methods handle the case where $t$ and $b$ can grow with the maximum degree, and the resulting algorithm attains the random graph shattering threshold when they grow sufficiently slowly. That is, we give improved local occupancy parameters and a short update sequence analysis which together show that Glauber dynamics finds independent sets of size $(1-o(1))n(\logΔ)/Δ$ in time polynomial in $n$ and $Δ$ whenever $t$ and $b$ are constant or grow suitably slowly. In a similar regime, we also establish that the (correspondence) chromatic number is at most $(1+o(1))Δ/\logΔ$ which improves upon prior results by a factor of at least $4$ in the case $t\ge 4$.

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

We propose a way of generating matroids by randomly picking indicator vectors, and since we will see that it mostly gives uniform matroids, which are transversal, we then look at randomly generated transversal matroids. In both models we also investigate threshold phenomena of certain monotone increasing properties. Non-monotone properties of transversal matroids will also be investigated. Moreover, we are going to see how to spot circuits of a transversal matroid from its bipartite graph presentation. In the last Chapter, we have a survey of the characterization of transversal matroids that admit acyclic bipartite presentations. We will also investigate when we can simplify a presentation for a transversal matroid.

comments
PhD dissertation, York University, 2026
fields
Combinatorics
pdf ↗ page arXiv:2611.02586 ↗

The largest eigenvalue of the adjacency matrix $A(G)$ of a graph $G$ is called the spectral radius $ρ(G)$ of $G$. If $S$ is a vertex cut of a connected graph $G$, then $c(G-S)$ denotes the number of connected components of $G-S$. The toughness $t(G)$ of a graph $G$ is defined as $t(G) = \min\left\{\frac{|S|}{c(G-S)}: S \subset V(G), \text{ and } c(G-S) > 1\right\}$. A graph \( G \) is \( t \)-tough if \( |S| \ge t c(G - S) \) for every proper subset \( S \subset V(G) \) satisfying \( c(G - S) > 1 \). Combining the toughness and spectral conditions, we provide spectral radius and size conditions for the existence of $k$-factors in 1-tough balanced bipartite graphs. This settles a problem posed by Chen, Fan and Lin in [Discrete Appl. Math. {\bf 355} (2024), 223–231].

fields
Combinatorics
pdf ↗ page arXiv:2611.02615 ↗

We consider $l$-Euler trails and $l$-Euler circuits in finite $k$-uniform directed multihypergraphs, where $k\geq 2$ and $1\leq l<k$. Let $D$ be such a directed multihypergraph. The notions of $l$-connectivity and $l$-balance are defined in terms of the $l$-tails and $l$-heads of its hyperarcs. It is shown that $D$ is $l$-Eulerian if and only if $D$ is $l$-connected and $l$-balanced. Moreover, $D$ is $l$-semi-Eulerian if and only if $D$ is $l$-connected and has exactly two states with unequal $l$-indegrees and $l$-outdegrees, one with $l$-outdegree one greater than its $l$-indegree and the other with $l$-indegree one greater than its $l$-outdegree. The proofs are based on an $l$-transition digraph and the classical Euler theorem for directed multigraphs. The corresponding conditions for $k$-uniform multihypergraphs are also obtained in terms of their orientations. For a given orientation, an expected linear-time algorithm is provided to determine whether an $l$-Euler trail or an $l$-Euler circuit exists and to construct one when it does.

fields
Combinatorics
pdf ↗ page arXiv:2611.02742 ↗

Let $F$ be a fixed graph. A graph $G$ is $F$-irregular if any two distinct vertices of $G$ belong to a different number of subgraphs of $G$ isomorphic to $F$. In this paper, we settle the strong conjecture about $F$-irregular oriented graphs (Dovzhenok, Lukashenko, and Filiuta, 2026) for the case of tournaments. Specifically, we prove that for every tournament $T$ of order $n \ge 3$, there exists an infinite family of $T$-irregular oriented graphs. Our proof is constructive. For $n \ge 4$, it is based on the vertex cloning method, and the underlying graphs of the constructed $T$-irregular oriented graphs are inherently $K_n$-irregular.

fields
Combinatorics
pdf ↗ page arXiv:2611.02760 ↗

We prove that for every continuous action of a compact group on a discrete set, each finite-color template admits a coloring from arbitrary lists of the same size whose stabilizer is contained in a conjugate of the template stabilizer. Consequently, the ordinary and list parameters coincide whenever the ordinary parameter is finite. In particular, we answer the question of Ferrara, Flesch and Gethner negatively for finite graphs, and establish the finite case of the conjecture of Kwaśny and Stawiski whenever a distinguishing edge coloring exists. We also show that every closed locally compact permutation group with infinite motion on a countably infinite set admits continuum many inequivalent distinguishing colorings from arbitrary 2-element lists. Using compact kernels and finite bases, we extend ordinary and list equality to countable graphs with countable automorphism groups and prove that one additional list color suffices for connected locally finite graphs. Using this multiplicity and a construction fixing all vertices of infinite degree, we prove that \(D'_\ell(G)\le 2\) for every countable connected graph with infinite edge motion, settling the list infinite edge-motion conjecture of Kwaśny and Stawiski.

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

The Alon–Frankl–Lovász theorem states that every $q$-colouring of the edges of the complete $r$-uniform hypergraph on $n$ vertices contains a monochromatic matching of size $\lfloor(n+q-1)/(r+q-1)\rfloor$. For fixed uniformity $r$ and number of colours $q$, we prove a stability theorem: every colouring whose largest monochromatic matching has size at most $n/(r+q-1)+o(n)$ differs from a threshold extremal colouring on only $o(n^r)$ edges. We also give a necessary and sufficient structural characterization of all extremal colourings for sufficiently large $n$. The proofs combine rigidity of fractional covering weights with an extension argument for prescribed matchings. These results answer, for sufficiently large orders, the stability and extremal-colouring questions posed by Gishboliner, Glock, Michaeli and Sgueglia.

fields
Combinatorics
pdf ↗ page arXiv:2611.02885 ↗

We construct explicit two-sided lossless expanders whose binary adjacency matrices have full rank, and use them to obtain explicit asymptotically good quantum LDPC codes whose specified X- and Z-check matrices have full row rank and satisfy small-set soundness, or confinement, on a linear range. Our lossless expanders are a variant of those of Hsieh, Lubotzky, Mohanty, Reiner, and Zhang, with a free action of a finite 2-group. Under such an action, injectivity and surjectivity of the adjacency matrix are detected on a fixed-size matrix indexed by vertex orbits. Adding a sparse factor to the gadget at the middle vertices of a single type then enforces full rank, with a controlled loss in expansion. To obtain the 2-group action, we observe that reducing the generators of the Lubotzky-Phillips-Sarnak Ramanujan graphs modulo powers of 2, instead of modulo an odd prime, gives Ramanujan Cayley graphs on finite 2-groups. This construction may be of independent interest. Plugging two such expanders into the balanced product of Lin and Hsieh gives the quantum codes, since full rank of the input graphs is inherited by the check matrices. Our construction supplies the code family sought by Hong, Guo, and Lucas. Applying their analysis, within their framework and under their dynamical assumptions, gives quantum memories whose free-energy density is analytic at every positive temperature and whose guaranteed lifetime is $exp(Ω(N))$ at sufficiently low fixed positive temperature, where N is the blocklength. This improves the previously guaranteed stretched-exponential timescale.

comments
32 pages, 1 figure
fields
Combinatorics, Group Theory
pdf ↗ page arXiv:2611.02963 ↗

Using a combination of spectral techniques and combinatorial counts, we prove a number of non-existence results for putative distance-regular graphs with classical parameters, focusing on the case $b=2$. Among those, the case $(d,b,α,β)=(d,2,1,2^d-2)$ passed all known feasibility conditions and required a deeper combinatorial analysis, from which nonexistence has been derived whenever $d \ge 9$. In doing so, we constructed a new family of regular graphs with four distinct eigenvalues which would have been local graphs in such a distance-regular graph.

fields
Combinatorics
pdf ↗ page arXiv:2611.02986 ↗

A $\textit{diamond}$ is a graph obtained by removing an edge from the complete graph on four vertices. A graph is $\{P_7, \text{diamond}\}$-$\textit{free}$ if it contains no induced subgraph isomorphic to a seven-vertex path or a diamond. Schiermeyer (2020) asked whether there is a constant $c$ such that $χ(G)\leqω(G)+c$ for every $\{P_7, \text{diamond}\}$-free graph $G$. We answer this question affirmatively by proving $χ(G) \leq ω(G)+3$. Moreover, the bound is optimal.

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

Mordell's problem asks for the largest product of squared pairwise distances among $n$ points in the complex plane with a prescribed sum of squared distances from the origin. When this sum equals $n$, the maximum for $2\le n\le5$ is known to be $n^n$, attained precisely by the $n$th roots of unity up to rotation and relabeling. For $n\ge6$, Chalk showed that a regular polygon together with its center gives a larger product than the regular $n$-gon. We prove that for $6\le n\le9$ the maximum is $(n-1)^{n-1}r_n^{n(n-1)}$, where $r_n=\sqrt{n/(n-1)}$. Up to the same symmetries, the unique maximizer consists of the origin and the vertices of a regular $(n-1)$-gon of radius $r_n$. For six points, algebraic elimination reduces the proof to an exact comparison of stationary values. For seven points, we compare all twelve classes in a published classification of equilibria. For eight and nine points, rigorous interval arithmetic establishes an inequality for every admissible pair. Summing over pairs gives the sharp global bound, and the equality conditions determine the configuration. An explicit ten-point comparison and a known instability result together exclude Chalk's configuration for every $n\ge10$. For each $n$ from two through eight, Mordell's problem and the minimum-diameter problem studied by Bateman and Erdős have a common optimal configuration.

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

We study affine arrangements of an even number $n$ of lines and pseudolines with many triangles. For simple ones, Blanc's bound limits the number of triangular faces to $\lfloor n(n-5/2)/3\rfloor$. Adapting the Bartholdi-Blanc-Loisel doubling to the even case, we construct an infinite series of arrangements of $n=6\cdot2^t+2$ ($8,14,26,50,\ldots$) straight lines with two triple points and $(n(n-5/2)+1)/3$ triangles, one more than the simple bound allows. We obtain exhaustive enumerations of triangle-maximal pseudoline arrangements, simple or not, for even $n\le12$. For $n=6,8,10,12,14$ the maximum number of triangles, for both lines and pseudolines, is $7,15,25,38,54$; for $n=8,12,14$ every optimal arrangement has multiple points. All optimal arrangements for even $n\le12$ are realizable by straight lines, except two arrangements of 10 pseudolines, which are not stretchable. For the odd value $n=11$, no arrangement with $33$ triangles exists even with multiple points. We also obtain even arrangements by adding a line to odd ones. For $n\equiv2\pmod 6$ this again gives one triangle more than the simple bound, in pseudolines up to $n=44$ and in straight lines for $n=20$ and $n=32$. Doubling these pseudoline arrangements gives members of the series $18\cdot2^t+2$ and $30\cdot2^t+2$ with the same excess, up to $n=146$ and $n=242$, respectively; those with $n=38$ and $n=74$ are realizable by straight lines. These results lead us to conjecture that an arrangement of an even number $n$ of pseudolines has at most $\lfloor n(n-2)/3\rfloor-\lfloor n/6\rfloor$ triangles.

comments
72 pages, 19 figures, 8 tables. Code, enumeration outputs and certificates: https://github.com/parpalak/nonsimple-arrangements
fields
Combinatorics
pdf ↗ page arXiv:2611.03096 ↗

Jiang and Zhu [J. Combin. Theory Ser. B, 137 (2019) 112–117] asked whether every $k$-choosable graph is $(km+1:m)$-choosable for every positive integer $m$. We answer this question negatively by constructing a graph with chromatic number and choice number $k$ that is not $(km+1:m)$-choosable for every $k\ge3$ and $m\ge10$. More generally, for integers $k\ge3$, $m\ge2$, and $t\ge0$, satisfying $m>8t+ε$, where $ε\in\{0,1\}$ is the parity of $m$, we construct such a graph that is not $(km+t:m)$-choosable. This also answers negatively the equivalent question of Xu and Zhu [SIAM J. Discrete Math., 36 (2022) 2585–2601] asking whether the strong fractional choice number of every graph is at most its choice number. This also indicates that, for each $k\ge3$, the supremum of the strong fractional choice numbers of graphs with choice number $k$ is at least $k+1/8$. When $t=0$, our construction yields counterexamples to multiplication for every $k\ge3$ and $m\ge2$. In particular, it yields a $3$-choosable graph on $91$ vertices that is not $(6:2)$-choosable, answering a question of Dvořák, Hu and Sereni [ Adv. Comb. (2019), Paper No. 5].

fields
Combinatorics
pdf ↗ page arXiv:2611.03151 ↗

The oriented diameter of a bridgeless graph is the minimum diameter of its strong orientations. Erdős, Pach, Pollack and Tuza proved that every connected graph of order $n$ and minimum degree $δ\ge 2$ has diameter at most $3n/(δ+1)-1$, which is sharp up to an additive constant. Cochran and Wang conjectured that the oriented diameter obeys the same bound up to an absolute additive constant. We prove this conjecture: every bridgeless graph of order $n$ and minimum degree $δ$ has a strong orientation of diameter at most $3n/(δ+1)+10^{17}$. Thus the bound of Erdős, Pach, Pollack and Tuza for the diameter carries over to the oriented diameter, with only the additive constant changed; in particular, the coefficient $3$ is best possible.

comments
35 pages, 2 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.03169 ↗

We study weighted edge coloring, where each edge of a graph $G$ has a weight in $(0,1]$, and colors are assigned so that the incident weight of each color at every vertex is at most one. The objective is to minimize the number of colors, denoted by $χ'_w(G)$. This generalizes classical edge coloring (all weights are one) and bin packing ($G$ is a star). Two natural lower bounds are the maximum weighted degree $Δ_w(G)$ and the maximum local bin-packing number $\mathrm{bp}(G)$: the maximum, over vertices, of the minimum number of unit bins needed to pack the incident weights. We have $\lceilΔ_w(G)\rceil\le\mathrm{bp}(G)\leχ'_w(G)$. How closely these local lower bounds approximate the global optimum is a longstanding open problem. Our main result establishes an asymptotic weighted analogue of Vizing's theorem: every simple graph admits a coloring using at most $(1+o(1))\mathrm{bp}(G)$ colors. Thus local bin packings can be made globally consistent with asymptotically vanishing relative loss, even in nonbipartite graphs. Our local-to-global rounding framework coordinates feasible local packing distributions into a partial coloring, leaving only $o(\mathrm{bp}(G))$ uncolored weight at every vertex. For bipartite multigraphs, we prove $χ'_w(G)\le(2+o(1))Δ_w(G)$, establishing the Chung–Ross conjecture [SICOMP'91] asymptotically. For loopless multigraphs, we obtain the exact bound $χ'_w(G)\le3\lceilΔ_w(G)\rceil$. Both leading coefficients are optimal, giving weighted analogues of the classical Kőnig–Shannon bounds. Further upper and lower bounds show that the classical factor-$3/2$ separation does not persist with the local bin-packing benchmark. We also disprove the exact weighted-degree conjecture of Feige and Singh [ESA'08]. Our upper bounds have polynomial-time algorithms, and their existence statements are formalized in Lean 4.

comments
94 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.03190 ↗

Erdős, Rubin and Taylor asked whether every $(a,b)$-choosable graph is $(am,bm)$-choosable for all positive integers $a,b,m$. Dvořák, Hu and Sereni disproved this by constructing a $4$-choosable graph that is not $(8,2)$-choosable, and asked whether a $3$-choosable graph can fail to be $(6,2)$-choosable. As a weakening, Li and Zhu asked whether every $k$-choosable graph is $(kb+1,b)$-choosable for all positive integers $k,b$. Equivalently, Xu and Zhu asked whether $\operatorname{ch}_f^s(G)\le\operatorname{ch}(G)$ for every graph $G$. Here $\operatorname{ch}(G)$ is the choice number of a graph $G$, and $\operatorname{ch}_f^s(G)$ is the strong fractional choice number of $G$, which is defined as the infimum of the real numbers $r$ such that $G$ is $(a,b)$-choosable for all positive integers $a,b$ with $a/b\ge r$. In this paper, we prove that, for all integers $t\ge0$ and $b\ge7t+2$, there is a planar graph $G$ with choice number three that is not $(3b+t,b)$-choosable. For $(b,t)=(2,0)$, our construction gives an affirmative answer to the question of Dvořák, Hu and Sereni. This family answers the questions of Li and Zhu and of Xu and Zhu negatively, and shows that the supremum of $\operatorname{ch}_f^s(G)-\operatorname{ch}(G)$ over graphs of choice number three is at least $1/7$. We further prove that, for all integers $k\ge4$, $t\ge0$ and $b\ge3t+2$, there is a graph $G$ with $\operatorname{ch}(G)=k$ that is not $(kb+t,b)$-choosable. For every $k\ge4$, this establishes the stronger lower bound $1/3$ on the supremum of $\operatorname{ch}_f^s(G)-\operatorname{ch}(G)$. The latter construction also produces simpler versions of the counterexamples of Dvořák, Hu and Sereni. It is worth mentioning that the core gadgets in both constructions are very simple. The former is an eight-vertex graph, and the latter is the six-vertex wheel $W_5$.

comments
8 pages, 3 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.03236 ↗

Agreement expansion asks whether local assignments to faces of a poset that usually agree on a sampled common face must agree with a single global function on most faces. Agreement expansion is exact (approximate) if local assignments need to exactly (approximately) agree with the global function. We suggest a new proof technique for agreement expansion that enables agreement expansion in settings which were previously beyond reach, such as: exact agreement expansion for Grassmannian posets (before only simplicial complexes support exact agreement expansion); agreement expansion based on assignments to top faces of the a complex (before agreement expansion is generally proven only for assignments to low dimensional faces); agreement expansion from one-sided spectral expansion (before, two sided spectral assumption was needed in general settings). Specifically, for down-closed simplicial and Grassmannian complexes, we prove an exact agreement theorem between any two layers assuming one-sided spectral expansion in links of singletons. As an application, we show that full bases of every rank-$k$ matroid admit exact agreement with soundness $O(k^2/[h(k-h)])$ when tested through $h$-element independent sets. We also obtain exact agreement on Grassmannian posets under one-sided spectral expansion, with stronger soundness under a local distance guarantee. Our key proof ideas center around non-polarity of the distributions of local assignments, probed via a random exposure of elements.

fields
Combinatorics
pdf ↗ page arXiv:2611.03261 ↗

In an American-style crossword puzzle, the grid must be connected, 180-degree symmetric, and have minimum word length 3. Ferland and Pratt construct $n\times n$ crossword grids with many clues satisfying these conditions and prove their construction is maximal when $n\equiv 1$ or 3 $\pmod{4}$. In this paper, we explore American-style crosswords in which the minimum word length is 4. Jacobs computed the maximal $15 \times 15$ grid with minimum word length 4. In this paper, we construct grids with a maximal number of clues for all $n \not \equiv 0 \pmod{5}$.

comments
based on Schnitzer's undergraduate thesis; comments welcome
fields
Combinatorics
pdf ↗ page arXiv:2611.03364 ↗

The Komlós conjecture was a long-standing open problem in discrepancy theory until it was recently solved in a flurry of AI developments. We give a motivated exposition of an elementary proof of the conjecture due to Karingula and Lovett, as well as a counterexample to the strong Komlós conjecture due to Kintali, aiming to introduce the ideas in a gentle and explained manner in order to ease the understanding of the proofs. We conclude with several problems which remain open.

comments
30 pages, 5 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.03427 ↗

A graph is even-degenerate if we can order its vertices as $v_1,\dots,v_n$ so that the number of edges from $v_i$ to $v_1,\dots,v_{i-1}$ is even for all $i>2$. We show that the probability $G(n,p)$ is even-degenerate is $e^{-Ω(n/\log\log n)}$, which is only a factor of $\log\log n$ away, in the exponent, from the trivial lower bound $2^{-O(n)}$.

comments
9 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.03444 ↗

Suppose an optimization problem is randomly restricted, independently on each variable, and re-optimized after the restriction is revealed. For multilinear objectives, every fixed solution is unbiased after rescaling, but re-optimizing introduces an upward bias. We bound this excess, the hindsight gain, over products of arbitrary compact local domains in Euclidean unit balls. For interactions $A=(A_e)_e$ among $r$ distinct variables and independent random weights $ζ_i$, the gain is at most $O_r(\|A\|_F M^{(r-1)/2}σ_{\max})$, where $\|A\|_F^2$ is the sum of squared coefficients, $M=\sum_i\mathbb{E}ζ_i^2$, and $σ_{\max}^2=\max_i\mathrm{Var}(ζ_i)$; only second moments are needed. Under uniform retention with probability $p$, we sharpen this to $O_r(p^{r-1/2}\sqrt{1-p}\,n^{(r-1)/2}\|A\|_F)$, which is tight for every fixed $r$ and $p\in(0,1)$. Our proof combines a comparison principle along a single support direction with tensor projection, vector contraction, and repeated thinning. Applications: (i) For fixed arity and alphabet size, solving the subproblem induced by $O(\varepsilon^{-2})$ sampled variables estimates a dense Max-$r$CSP optimum within $\pm\varepsilon n^r$, and this sample size is optimal. (ii) The same approach estimates MaxCut and the distance to bipartiteness within $\pm\varepsilon n^2$ using $O(\varepsilon^{-4})$ nonadaptive queries and $O(\varepsilon^{-2})$ examined vertices, both optimal. (iii) We answer a question of Yufei Zhao: vertex percolation at rate $p$ preserves the max-cut fraction whenever $p\,e(G)/v(G)\to\infty$, and this condition is sharp. (iv) For bounded $r$-local quantum Hamiltonians of fixed local dimension, $O(\varepsilon^{-3})$ uniformly sampled particles suffice to estimate the ground-state energy within $\pm\varepsilon n^r$, improving the previous $O(\varepsilon^{-6}\log(1/\varepsilon))$ bound.

fields
Combinatorics
pdf ↗ page arXiv:2611.03468 ↗

The Harary–Hill conjecture states that the crossing number $\ucr{K_n}$ of the complete graph $K_n$ is $Z(n):=\frac{1}{4}\lfloor\frac{n}{2}\rfloor\lfloor\frac{n-1}{2}\rfloor\lfloor\frac{n-2}{2}\rfloor\lfloor\frac{n-3}{2}\rfloor$ for all $n\ge 3$. In October 2026 OpenAI uploaded to GitHub a proof of this conjecture. The proof is very short, but it relies on polynomial methods that are not part of the standard techniques used by many combinatorialists, and it is written with very little motivation or explanation. Since we found the proof very hard to follow, we decided to write this paper, which contains a complete proof of the conjecture written for mathematicians who are more familiar with combinatorics than with polynomial methods. In fact we prove a more general result on rotation systems of $K_n$, from which the Harary–Hill conjecture easily follows. Namely, we show that for every rotation system $Π$ of $K_n$ the number of $4$-vertex subsystems of $Π$ realizable as drawings of $K_4$ with one crossing, plus three times the number of non-realizable $4$-vertex subsystems of $Π$, is at least $Z(n)$. The statement and proof of our result are purely combinatorial and do not involve drawings at all.

fields
Combinatorics
pdf ↗ page arXiv:2611.03515 ↗

We show that $n \times n$ permanents can be computed with $O^*{(2-\varepsilon)^n}$ arithmetic operations over every commutative ring, for $\varepsilon = 10^{-40}$. This solves a problem stated in Knuth's The Art of Computer Programming. Our algorithm implements the classical Binet–Minc identity with dynamic programming and careful bookkeeping. It also gives algebraic branching programs of size $O^*{(2-\varepsilon)^n}$.

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

Optimization and Control110

Curves and interfaces play a central role in computer vision and image processing, and Euler's elastica energy is one of the most successful tools to model and manipulate them. The elastica energy is usually computed through a level-set or a phase field representation of the curve, in which the curvature term makes the energy nonlinear, non-convex and, in the level-set case, non-differentiable, so that its minimization is notoriously difficult. In this paper, we propose a new formulation of the elastica model based on a binary representation of curves. The key ingredient is a very simple formula for the curvature: if $φ$ is the $\pm1$ binary function associated with a curve $Γ$, then along $Γ$ the curvature is given by $-\frac{1}{C_0ε}\left(R_ε*φ\right)+O(ε)$, where $R_ε$ is a radial kernel supported in a ball of radius $ε$ and $C_0$ is an explicit constant. No derivative of $φ$ is involved and the convolution is evaluated by FFT. The resulting energy is a weighted total variation, so that formally the new formulation is a generalization of the well-known ROF model; a phase field type model is obtained from the same curvature formula. Combining FFT with the split Bregman iteration, which for the present problem coincides with an augmented Lagrangian method (ALM), we obtain efficient algorithms whose subproblems are either linear systems solved by conjugate gradient or explicit pointwise formulas. Numerical experiments on the inpainting of binary images are presented to demonstrate the effectiveness of the proposed algorithms.

fields
Optimization and Control
pdf ↗ page arXiv:2611.00110 ↗

Implicit priors given by Gaussian denoisers successfully regularize a wide range of inverse problems in approaches such as plug-and-play (PnP), regularization by denoising (RED) and score-based methods. Such a prior depends on the noise level, and how it selects among signals consistent with the data remains largely uncharacterized. To put implicit and explicit priors on the same footing, we define the prior-force family $W_t=t^{-1}(D_t^{-1}-I)$ of any Gaussian denoiser $D_t$ at noise variance $t>0$ (inverse in the graph sense), the normalized denoising residual as an operator on clean signals. At a common effective prior weight, the equilibrium equations differ only in their prior terms: PnP uses $W_t$, RED/score-based methods the score force (the normalized residual as an operator on noisy inputs), and maximum a posteriori (MAP) estimation the MAP force (the negative log-prior gradient). For the minimum mean-square error (MMSE) denoisers of a prior $π$, we compare the corresponding energies at three levels. Without observation, raising the noise level favors PnP minima that retain more posterior variance. On signals consistent with the data, the leading-order PnP energy for separated modes is the proximal hull of the MAP energy, which lets PnP select signals between modes; modes of equal data fit are ranked by peak height at small noise levels and by mass at large ones. For recovery, $W_t$ at the truth bounds the local bias, and an oracle noise level balances this bias against denoiser error. These results show that the noise level is a parameter of the prior rather than a step size. Experiments with exact priors support these predictions, including the mixture components that PnP selects on unseen data.

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

Constrained variational inequalities (VIs) provide a general framework for modeling and solving complementarity and equilibrium problems with functional constraints. In this paper, we propose a parameter-free accelerated operator sliding (PFAOS) method for solving monotone VIs with convex smooth constraints. For a single constraint, PFAOS achieves an operator evaluation complexity of $\mathcal{O}(1/\varepsilon)$ and a constraint gradient evaluation complexity of $\mathcal{O}(1/\sqrt{\varepsilon})$, without requiring prior knowledge of the Lipschitz constant of the VI operator or the smoothness constant of the constraint function. We further extend PFAOS to multiple constraints by incorporating a primal-dual hybrid gradient update, yielding a multi-constrained PFAOS (MC-PFAOS) method that preserves the same evaluation complexities. Finally, numerical experiments are conducted on large-scale games with coupling constraints to validate the efficiency and effectiveness of the proposed algorithms.

fields
Optimization and Control
pdf ↗ page arXiv:2611.00229 ↗

Low-rank adaptation (LoRA) enables parameter-efficient fine-tuning but can suffer from redundant basis directions. Constraining the basis factor to the Stiefel manifold addresses this redundancy through orthonormality. Landing methods allow temporarily infeasible iterates to explore a neighborhood of the manifold while progressively restoring orthogonality without per-step retractions. To improve optimization efficiency while retaining this flexibility, we introduce ProLand (Product-space Landing), a retraction-free optimizer that combines coordinated factor updates with Muon-style spectral directions. By designing the updates in the space of the represented weight increment, ProLand separates objective optimization from orthogonality restoration, supporting efficient feasibility recovery. This coordinated construction also enables Muon-style directions to guide objective optimization while preserving that separation. Experiments cover four GLUE validation tasks on DeBERTa-v3-base and seven language benchmarks on Qwen2.5-3B, Llama-3.2-3B, and Moonlight-16B-A3B across multiple adapter ranks. Across these 11 tasks, ProLand achieves the highest average score among the compared methods in every tested encoder and decoder model-rank configuration.

comments
40 pages, 6 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.00236 ↗

We consider the optimal control problem of an elliptic PDE with random diffusion under pointwise box constraints on the control. The constraints make the optimality conditions nonsmooth, with an active set that is not known in advance, and the random diffusion couples the state and the adjoint across all stochastic modes. To design a solution algorithm for this problem, we rely on the Fenchel duality viewpoint. Fenchel duality absorbs the box constraint into the objective and yields an exact reduced problem in the elliptic adjoint variable alone. After a stochastic Galerkin–finite element discretization, eliminating the state leaves a strongly monotone, piecewise smooth equation, which we solve directly by a matrix-free semismooth Newton method with the box projection retained exactly and with no outer iteration, penalty or smoothing parameter. Next, we introduce and analyze a current-set preconditioner, which adds the active-set correction of the current Newton step to a mean-diffusion reference operator and is inverted exactly by a rank-1 update. For implementation, we use a cheaper preconditioner that keeps only a fraction of free control values. Numerical experiments show second-order convergence of the state, and Newton and PCG counts that stay bounded under mesh refinement and growth of the stochastic dimension.

fields
Optimization and Control, Numerical Analysis, Spectral Theory
pdf ↗ page arXiv:2611.00246 ↗

Bernstein polynomial approximation of continuous functions has a slower rate of convergence as compared to other approximation methods. ``The fact seems to have precluded any numerical application of Bernstein polynomials from having been made. Perhaps they will find application when the properties of the approximant in the large are of more importance than the closeness of the approximation.'' -- has remarked P.J. Davis in his 1963 book Interpolation and Approximation. This paper presents a direct approximation method for nonlinear optimal control problems with mixed input and state constraints based on Bernstein polynomial approximation, in which the dynamic and path constraints are imposed at the Bernstein coefficients (control points). We provide a rigorous analysis showing that, under convergence assumptions on the control polygons, the proposed method yields consistent approximations of time continuous optimal control problems and can be used for costate estimation of the optimal control problems. In particular, multipliers satisfying a relaxed Karush Kuhn Tucker system of the resulting nonlinear program, scaled by the quadrature weight, approximate the costate and the multipliers of the optimal control problem. Owing to the structure of the Bernstein differentiation matrix, the discrete transversality conditions are contained in the relaxed Karush Kuhn Tucker system, and no additional closure conditions need to be added to it. This result leads to the formulation of the Covector Mapping Theorem for Bernstein polynomial approximation.

fields
Optimization and Control
pdf ↗ page arXiv:2611.00250 ↗

Several polynomial systems arising in systems and control have been shown to exhibit a partially linear structure, which allows them to be reformulated as a multiparameter eigenvalue problem (MEP). In this work, we show how such MEP formulations can be leveraged to obtain refined information about the solution set of the polynomial system. We demonstrate, in the setting of single-input single-output $\mathcal{H}_2$-norm model order reduction, how the Thom–Porteous formula can be used to derive an exact count of the complex solutions of the critical equations derived from Walsh's theorem. We prove, under suitable genericity assumptions, that their set of complex solutions is finite and that all solutions occur without multiplicity. Moreover, we derive an explicit formula for the total number of complex solutions as a function of the model orders. Throughout, we provide a self-contained and application-oriented exposition of the algebro-geometric tools required for our analysis, with the aim of making them accessible to the broader engineering community.

comments
31 pages, 1 figure, 1 table. Comments welcome!
fields
Optimization and Control, Algebraic Geometry
pdf ↗ page arXiv:2611.00258 ↗

This paper studies finite-sum convex optimization with convex function constraints, where both the objective $f(x)=\frac{1}{m}\sum_{i=1}^m f_i(x)$ and the constraint mapping $g(x)=\frac{1}{n}\sum_{j=1}^n g_j(x)$ may have a large number of components. We propose a variance-reduced anchored constraint extrapolation method (VaRAn-ConEx), which combines stochastic component sampling with primal–dual extrapolation for nonlinear function constraints. Relative to stochastic approximation schemes such as ConEx, VaRAn-ConEx~method reduces gradient complexity by using epoch-wise full-gradient correction and variance-reduced estimators for both the objective and constraint components. In the semi-finite case where $n=1$, the method attains gradient complexities $O(\sqrt m/ε)$ under constant steps and $O(m/ε^{1/2}+1/ε^{3/2})$ under nonconstant steps. In the fully finite-sum case, we establish boundedness of the Lagrange multiplier sequence and derive convergence and gradient-complexity bounds for constant and nonconstant step-size policies. Under these policies, we then prove similar gradient complexity with $m$ replaced by $\max\{m,n\}$. We also show acceleration when the finite-sum objective $f$ is strongly convex, irrespective of components $f_i$.

fields
Optimization and Control
pdf ↗ page arXiv:2611.00317 ↗

In this paper, we consider a class of possibly nonmonotone finite-sum composite inclusions in which evaluating all components or updating all coordinates at every iteration can be computationally expensive. We develop two optimistic gradient frameworks that combine variance reduction with randomized block-coordinate updates. The first framework applies under a blockwise average Lipschitz continuity condition and the existence of a weak-Minty solution. It achieves an $\mathcal{O}(1/k)$ convergence rate for the expected squared residual, and its iterates converge almost surely under mild additional conditions. The second framework relies on a backward-forward reformulation under average co-coercivity and co-hypomonotonicity. It achieves faster $\mathcal{O}(1/k^2)$ and $o(1/k^2)$ rates for the expected squared residual, as well as $o(1/k^2)$ almost-sure rates. For both frameworks, we provide a generic condition on the stochastic estimator that covers mini-batch, loopless SVRG, and a generalized JacSketch-type estimator, and we derive the corresponding oracle complexities under importance-based block sampling. In particular, in highly heterogeneous regimes, the L-SVRG and JacSketch variants attain $\mathcal{O}\big(n + n^{2/3}ε^{-2}\big)$ and $\mathcal{O}\big(n + n^{2/3}ε^{-1}\big)$ oracle complexities for the nonaccelerated and accelerated methods, respectively. Numerical experiments illustrate the effects of variance reduction and block-coordinate sampling, and compare the proposed methods with existing baselines.

comments
4 pages and 3 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.00334 ↗

We study the dynamic purification of a continuously monitored quantum harmonic oscillator coupled to a thermal bath, where the control is the quadrature measurement angle of up to two detectors with prescribed strengths and efficiencies. Within the Gaussian regime, the conditional state covariance obeys a deterministic Riccati equation, and we ask what purity can be reached and sustained by manipulating the angle in time, in analogy with rapid-purification protocols for qubits. We propose, analyze, and compare constant-rate, greedy, vibrational, and variational monitoring strategies on the basis of sustained purity starting from the thermal bath state, and quantify to what extent they are able to maintain higher purity levels compared to lab-fixed or phase-locked detectors. We highlight structural features, operational limits, and optimal protocols from each strategy and study how model parameters shape control performance. We observe that in the absence of measurement-frame anisotropy, the time-dependent strategies achieve higher but similar performance. Once this symmetry is broken, their performances diverge, either improving or worsening depending on the relative timescales of oscillator dynamics, thermalization, and measurement.

comments
24 pages, 13 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.00410 ↗

The Gromov-Wasserstein problem is an extension of the regular optimal transport problem that is adapted for pairs of distributions residing in incomparable spaces. Broadly speaking, given a pair of metric measure spaces, the Gromov-Wasserstein problem seeks couplings between these spaces that minimize the distortion between the metric evaluations. In this note we record the fact that the Gromov-Wasserstein distance between finite metric spaces is NP-Hard to compute. Our argument relies on a reduction from the Hamiltonian Cycle Problem, and it builds on ideas in Vayer's thesis and Ryner et. al's work that draw connections between the 2-Gromov-Wasserstein and the Quadratic Assignment Problem. During the preparation of this manuscript we learned of the appearance of Breitung et. al's work, whose result essentially supersedes ours. We hope this note serves as a useful companion whose proof is, hopefully, more elementary and easier to understand.

comments
12 pages
fields
Optimization and Control, Metric Geometry
pdf ↗ page arXiv:2611.00479 ↗

Constraint qualifications (CQs) and regularity conditions (RCs) play a fundamental role in establishing global iteration and oracle complexity results for first-order methods on solving functional constrained optimization problems. Various conditions have been proposed and employed in the literature, with their validity established for different classes of applications. However, the use of different conditions across existing studies makes it difficult to directly compare their theoretical results and underlying assumptions. In this report, we systematically review several widely used CQs and RCs and investigate their relationships. In particular, we establish implications among these conditions and identify cases in which the implications are strict, thereby clarifying their relative strengths. Our results provide a unified perspective on existing regularity assumptions and offer guidance for selecting appropriate conditions in the complexity analysis of first-order methods.

fields
Optimization and Control
pdf ↗ page arXiv:2611.00526 ↗

This work aims to study the stochastic optimal control problems of controlled stochastic differential systems driven by both Brownian motions and fractional Brownian motions via dynamic programming principle. The stochastic Hamilton-Jacobi-Bellman equation is obtained. Different from the classical case, the obtained stochastic Hamilton-Jacobi-Bellman equation is a backward stochastic partial differential equation driven by both fractional Brownian motions and standard Brownian motions, whose solution is a pair of random fields. For linear quadratic optimal control problem this backward stochastic partial differential equation is explicitly solved by relating it to a backward stochastic Riccati equation.

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

We propose and analyze an adaptive proximal alternating direction method of multipliers (ADMM), based on Jacobi-type updates, for linearly constrained separable nonconvex composite optimization problems. The objective consists of two block-separable functions, one continuously differentiable and weakly convex, and the other convex and Lipschitz continuous. The proposed method is adaptive to all problem parameters and allows inexact solutions of the block proximal subproblems. At each iteration, we solve all block subproblems in parallel, then apply a novel test to decide whether to update the Lagrange multiplier and/or the penalty parameter. Without any rank assumptions on the constraint matrices, we establish an ${\cal O}(ε^{-3})$ iteration-complexity bound for obtaining an approximate first-order stationary point. This matches the best-known complexity for cyclic proximal ADMM methods and improves the existing complexity of Jacobi-type schemes in this general nonconvex setting. Numerical experiments on a nonconvex quadratic program illustrate the proposed method's computational benefits.

fields
Optimization and Control
pdf ↗ page arXiv:2611.00570 ↗

Conditional-Value-at-Risk (CVaR) optimization is a fundamental tool in portfolio selection, yet its nonsmooth loss structure poses a challenge for the existing theory of stochastic gradient methods including associated Langevin algorithms. In particular, the positive-part loss and the softmax portfolio parametrization lead to stochastic gradients that need not be globally Lipschitz continuous, but rather discontinuous, where available non-convex stochastic gradient Langevin dynamics (SGLD) guarantees often exhibit an unfavorable exponential dependence on the problem dimension. In this article, we develop a non-asymptotic analysis of SGLD for a regularized CVaR portfolio optimization problem. We exploit the geometric structure of the CVaR objective to establish linear growth, convexity-at-infinity, and one-sided Lipschitz properties of the stochastic gradient without imposing density assumptions on the asset losses that are typical in previous works. Crucially, the constants appearing in the aforementioned structural conditions are shown to be independent of the number of assets. Moreover, we establish a convergence bound in Wasserstein-2 distance with rate $\mathcal{O}(λ^{1/4})$ and a finite-time guarantee for the expected excess risk. Our analysis, together with the dimension-independent constants in the structural conditions, leads to an excess risk bound that depends linearly on the number of assets. Numerical experiments with simulated Gaussian portfolios exhibit the predicted dimension dependence. Computational comparisons with alternative stochastic optimization methods further illustrate the practical efficiency of SGLD for the optimization problem under consideration. Finally, we extend the framework to a broader class of non-convex stochastic optimization problems with discontinuous stochastic gradients.

fields
Optimization and Control, Probability, Statistics Theory
pdf ↗ page arXiv:2611.00578 ↗

Attention is the computational core of large language models, yet the verifiers that bound how far an attention head's output can move under input perturbations give no guarantee on how loose their bounds are. A weak certificate therefore cannot be told apart from a fragile model. We develop a conic programming theory of attention certification that supplies this guarantee. We prove that the difficulty lies not in the softmax but in the bilinear interaction of a varying query with the keys. This interaction makes certification NP-hard over boxes and inapproximable once the attention logits can move by a constant amount. A fixed query or listed token substitutions, by contrast, make the exact worst case efficiently computable. An exponential cone moment relaxation then certifies a head with an error bounded quadratically in the perturbation radius by computable quantities, an order that cannot be improved. We also show that relaxations that treat a network one operation at a time, linear bound propagation among them, pay on second-order terms a sum of per-operation maxima instead of one coupled maximum. Computational results on GPT-2 indicate that the theory carries over to a trained model. Against exact worst cases with the query fixed, the certificate attains the predicted second-order accuracy. It is tighter than linear bound propagation on every head, and the looseness of bound propagation tracks the predicted per-operation excess.

comments
56 pages, 5 figures, 6 tables. Code and data: https://github.com/chimera1001/conic-attention-cert
fields
Optimization and Control
pdf ↗ page arXiv:2611.00585 ↗

Automated configuration of mixed-integer programming (MIP) solvers largely relies on black-box optimization. Each trial requires an expensive solver run and provides only a scalar outcome, so tuning can require many such evaluations. Human experts take a different approach. They inspect solver logs, identify performance bottlenecks, and adjust the parameters that address them. We propose Log-Driven Semantic Tuning (LDST), which uses a large language model (LLM) to automate this process. LDST extracts compact diagnostics from solver logs, uses the LLM to propose sparse edits to the current best configuration based on parameter meanings and observed solver behavior, and validates each proposal before execution. A regime-adaptive objective selects the tuning signal according to the information available from a time-limited run, while a log-based completion signal estimates completion time from branch-and-bound tree growth recorded in ordinary solver logs, so that solved and unsolved runs share one time scale. On 215 instances from five benchmark sets, LDST reduces geometric-mean loss by 43.9% on easy instances and 16.7% on intermediate instances relative to the best of SMAC3, RBFOpt, and random search. In both regimes, LDST achieves a lower loss with 10 proposals than any of these baselines achieves with 50. Configurations that LDST tunes on a single instance also transfer better than baseline configurations to unseen instances of the same family.

comments
34 pages, 8 figures, 28 tables. Code and data: https://github.com/Zhengzhong-You/LDST
fields
Optimization and Control
pdf ↗ page arXiv:2611.00621 ↗

ALDER, a single-loop augmented-Lagrangian damped extragradient method, is proposed for smooth nonconvex–concave minimax problems with nonlinear coupled inequality constraints. Within an augmented-Lagrangian framework, ALDER combines prediction–correction steps for the primal variables with explicit projected-and-relaxed multiplier updates in a single loop. The penalty parameter is fixed throughout each run, eliminating inner-loop subproblem solves and iterative penalty updates. We establish uniform boundedness of the relaxed multiplier sequence and, under an extended Mangasarian–Fromovitz constraint qualification, boundedness of the projected output multiplier. Building on these bounds, we show that ALDER finds an $\varepsilon$-KKT point within $\mathcal{O}(\varepsilon^{-7/2})$ complete first-order oracle evaluations in the strongly concave setting and $\mathcal{O}(\varepsilon^{-4})$ in the concave setting. These bounds improve upon the best known complexity bounds for multi-loop algorithms for this problem class, achieved by FAL, by removing a $\log(1/\varepsilon)$ factor, while retaining a single-loop update structure.

fields
Optimization and Control
pdf ↗ page arXiv:2611.00691 ↗

Sequential subspace optimization (SESOP) minimizes the objective exactly over a few directions built from past iterates. It needs no problem constants, is accelerated on smooth convex functions and behaves like an accelerated method in experiments. This led to the conjecture that it is accelerated in the strongly convex case without knowing the strong convexity parameter. We show that the conjecture fails in the worst case. For every subspace method whose memory forgets slowly, namely a window of recent gradients and steps together with cumulative sums with subexponential weights, we construct a counterexample: acceleration requires a window of length of order $\sqrtκ$, where $κ$ is the condition number. SESOP and the plane form of conjugate gradients are therefore not accelerated. Memories that forget fast avoid this obstruction. Pairs of geometric filters give accelerated methods with logarithmic memory or only two stored vectors. They need neither the strong convexity parameter nor the smoothness constant, never restart the iterate and restart their memory at most $O(\logκ)$ times. Finally, the method with fixed activation times remains asymptotically accelerated on functions with Lipschitz Hessian even when each subproblem is solved by a single Newton step.

fields
Optimization and Control
pdf ↗ page arXiv:2611.00727 ↗

This paper investigates discrete-time stochastic recursive games driven by fractional noises, in which the cost functional is defined through a backward stochastic difference equation. By introducing discrete-time adjoint equations, we establish a maximum principle and the verification theorem for open-loop Nash equilibria in non-zero sum and zero sum stochastic recursive game problems. The effectiveness of our theorem is demonstrated through applications to two different linear-quadratic stochastic recursive games and a portfolio selection problem with a recursive utility functional.

fields
Optimization and Control
pdf ↗ page arXiv:2611.00740 ↗

Topology optimization has become an indispensable design tool in the aerospace, automotive, and mechanical engineering industries. Yet bringing a new problem from its description to an optimized result remains slow, expert-dependent, and unreliable: the workflow spans many manually connected stages, each new problem requires solver code to be written and debugged manually, and such code often fails or yields incorrect results. We present Agent4FreeFem, a pipeline driven by a large language model that turns a natural-language problem description into a set of verified optimization results without manual solver-code development or debugging. The pipeline keeps the problem definition unmodified, localizes errors using independent sources of evidence, and completes constrained repairs automatically, thereby providing efficient end-to-end automation, autonomous execution, and verifiable results. We evaluated Agent4FreeFem on a suite of single-physics and coupled multiphysics problems. Every case passed runtime verification and finished within the repair budget of each stage.

comments
23 pages, 10 figures, 8 tables
fields
Optimization and Control
pdf ↗ page arXiv:2611.00803 ↗

We study the finite-horizon optimal dividend problem in a renewal risk model with unrestricted dividend payments, examining how claim-size distributions determine barrier optimality. Under general assumptions on a fixed interclaim-time distribution, we prove that exponential claims admit a globally optimal barrier for every positive safety loading, positive discount rate and finite horizon. Conversely, within the class of claim-size distributions with continuous nondecreasing hazard, every nonexponential law admits one fixed premium–discount pair for which no barrier is globally optimal at any sufficiently long horizon. These results establish, within this distribution class, an equivalence between exponentially distributed claims and the existence of a globally optimal barrier for every parameter combination in the stated range. Numerical examples compare exponential and Gamma claims with the same mean and illustrate how the claim-size distribution changes the structure of dividend decisions.

fields
Optimization and Control
pdf ↗ page arXiv:2611.00827 ↗

We consider the minimization of a smooth function subject to box constraints and partitioned cardinality constraints (PCC): the variables are divided into groups and, within each group, at most a prescribed number of variables may be non-zero. This class contains bound-constrained minimization, cardinality-constrained minimization and bound-constrained mathematical programs with complementarity constraints. We introduce the Telescopic Method, which alternates iterations of a bound-constrained method on the faces of the feasible set with inexpensive one-dimensional "escaping" tests that exchange a variable of the current face by a currently null one within the same group. We prove, without constraint qualifications and without requiring global solutions of subproblems, that every limit point of the generated sequence is B-stationary, i.e., it satisfies the first-order condition defined by the tangent cone of the feasible set. This guarantee is obtained with exchanges of a single variable, whatever the number of non-null entries of the limit point, because B-stationarity for this class of problems decomposes into conditions on single variables. On the 60 bound-constrained mathematical programs with complementarity constraints of the test set of Kirches, Larson, Leyffer and Manns, the method found approximately B-stationary points in all the problems. Applications to separable regression, sparse polynomial approximation and portfolio selection are described and tested numerically.

comments
31 pages, 8 tables, 1 figure
fields
Optimization and Control
pdf ↗ page arXiv:2611.00897 ↗

We study finite-horizon optimal switching with affine rewards in a consumption-investment model with finitely many occupational regimes. Directed shortest-path costs yield the exact natural borrowing limit. A dual transformation reduces the control problem to a one-dimensional system of variational inequalities with interconnected obstacles. Convexity and a distributional waiting inequality give local spatial $C^{1,1}$ regularity and smooth fit, including destination ties. These estimates establish strong duality and recover optimal consumption, investment, and switching strategies. A reflected backward stochastic differential equation representation yields a set-based integral formula without prescribed boundary geometry. Every connected component of the spatially regular locus is a maximal smooth graph over time. Exact examples exhibit disconnected contact sets, temporal boundaries under strict triangle costs, and a corner in an individual boundary component under additive route costs. A convergent time discretisation completes the analysis.

comments
43 pages, 4 figures. Python code reproducing the figures and diagnostics is provided as ancillary files
fields
Optimization and Control
pdf ↗ page arXiv:2611.00900 ↗

In this paper, we prove that explicit and implicit Euler discretizations yield monotone brackets for the lower Lyapunov exponent of positive switched systems. We establish convergence of the implicit bound for every Metzler family. For the explicit bound, we derive convergence criteria in reducible systems from a face formula for the uniform lower exponent on an invariant cone. The formula takes the minimum of the rates on faces that meet the cone nontrivially and are preserved by at least one mode, using only their preserving modes. For individually irreducible modes, we prove O(h) discretization errors, where h is the step size, and show that this order is sharp in general. At interior two-mode chattering optima with an irreducible optimal mixture, we obtain one-sided first-order bounds. We also construct a three-mode example in which the explicit bound converges while finite polytope lower bounds remain capped strictly below the true exponent. We prove convergence of fixed-antinorm Gripenberg brackets under individual irreducibility as the step and tolerance decrease and the search depth increases appropriately. Finally, we obtain independently verified continuous-time brackets by exact rational checks, with lower bounds that remain valid at smaller steps.

comments
41 pages
fields
Optimization and Control
pdf ↗ page arXiv:2611.00901 ↗

Direct incorporation of dose-volume constraints into inverse radiotherapy planning leads to large mixed-integer optimization problems that accurately represent clinical requirements but are computationally challenging. We develop and evaluate a quantum-inspired approach for automated dose-volume-constrained intensity-modulated radiation therapy (IMRT) and intensity-modulated proton therapy (IMPT) planning. Clinical requirements are formulated as mixed-integer optimization problems, with binary variables representing dose-volume constraint violations. Patient-specific dose-influence matrices are generated at the photon control-point and proton spot levels, and intensities are optimized using Quantum-Inspired Hamiltonian Descent (QIHD). We evaluate QIHD on eight clinical cases: four IMRT (two prostate, one head-and-neck, and one liver) and four IMPT (two lung, one prostate, and one liver). The IMRT formulations contain 27,621 to 112,565 variables and are solved in 5 to 32 minutes, while the IMPT formulations contain 69,861 to 221,342 variables and are solved in 11 to 35 minutes on an NVIDIA RTX 4060 GPU. QIHD produces dose distributions satisfying clinical protocols without manual intervention. In comparison, a CPU implementation of Gurobi fails to solve most tested mixed-integer formulations within several hours. These results demonstrate the computational feasibility of GPU-accelerated QIHD for automated photon and proton treatment planning. Prospective clinical validation and implementation of decomposed subproblems on quantum hardware remain future directions.

fields
Optimization and Control
pdf ↗ page arXiv:2611.00989 ↗

This paper establishes an entropy-regularized reinforcement learning (ERRL) framework for the continuous-time consumption-investment problem under a regime-switching market model with general utility functions. By incorporating randomized exploratory policies and Shannon entropy regularization into the stochastic optimal control formulation, we derive closed-form representations for the optimal exploratory consumption and investment strategies. Specifically, the optimal investment strategy follows a multivariate Gaussian distribution, whereas the optimal consumption strategy takes the form of a Gibbs measure—which specializes to a Gamma distribution under logarithmic utility and a non-standard exponential distribution under power utility. Crucially, our theoretical analysis reveals that the classical deterministic optimal decisions correspond to the mode—rather than the mean—of these exploratory distributions. Furthermore, we establish the convergence of the exploratory value function to its classical unregularized counterpart as the temperature parameter vanishes. For algorithmic design, we develop a continuous-time q-learning framework grounded in a novel continuous-time q-function, prove the policy improvement theorem, and establish martingale characterizations for both on-policy and off-policy learning. We find that parameterizing the actor network based on theoretical distribution families can help accelerate convergence and enhance numerical stability. Furthermore, numerical experiments across regime-switching environments provide empirical support for our theoretical findings, demonstrating stable loss convergence as well as the monotonicity and concavity of the learned value functions.

fields
Optimization and Control
pdf ↗ page arXiv:2611.01046 ↗

We investigate a sufficient framework for determining the success or failure of finite-time tracking in pursuer–evader dynamics. To this end, we design a nonsmooth coupled multi-agent system by adopting a previously established pursuer–evader model from the existing literature, which characterizes asymptotic tracking success and failure, as the backbone. We then provide appropriate sufficient conditions, expressed in terms of initial data, system parameters, and kernel functionals, under which some pursuers can successfully track evaders within a finite time, while others fail to do so. In particular, we show that the pursuer–evader subsystem associated with the pursuers that successfully track the evader, together with the corresponding evaders, exhibits finite-time stability.

fields
Optimization and Control
pdf ↗ page arXiv:2611.01054 ↗

A player's impatient valuation of an infinite stream of stage payoffs is a weighted average with nonincreasing weights. Such valuations generalize geometric discounting and allow imprecise or heterogeneous time preferences. For a stochastic game \(Γ\) and a profile \(u\) of impatient valuations, let \(Γ_u\) be the induced game. We ask when approximately optimal or equilibrium behavior can be chosen to vary continuously and stably with \(u\). We show that this robustness is governed by the corresponding uniform long-run payoff property: the uniform value in the adversary case, and uniform approximate equilibrium payoffs in the equilibrium case. In finite state spaces, the latter is equivalent to the usual existence of a uniform equilibrium payoff. In the two-player zero-sum case, if \(Γ\) has a uniform value, then the value of \(Γ_u\) varies uniformly continuously with \(u\), and for every \(\varepsilon>0\) there is a uniformly continuous mapping assigning to each \(u\) an \(\varepsilon\)-optimal strategy in \(Γ_u\). Hence this holds for every finite two-player zero-sum stochastic game. In the non-zero-sum case, uniform approximate equilibrium payoffs imply a finite cover of the valuation-profile space by neighborhoods on each of which a single strategy profile is a robust \(\varepsilon\)-equilibrium. For sunspot, correlated, and extensive-form correlated equilibria, uniform approximate equilibrium payoffs are equivalent to the existence, for every \(\varepsilon>0\), of a uniformly continuous mapping assigning to each valuation profile a robust \(\varepsilon\)-equilibrium on a neighborhood of that profile. Consequently, every finite stochastic game admits uniformly continuous robust extensive-form correlated \(\varepsilon\)-equilibrium selections.

fields
Optimization and Control
pdf ↗ page arXiv:2611.01151 ↗

In this paper, we establish sharp lower bounds for Gaussian approximation of Polyak-Ruppert averaged stochastic gradient descent with polynomially decreasing step sizes. For every fixed exponent $γ\in(1/2,1)$, a single one-dimensional smooth, strongly convex example has approximation error with the limiting variance of order $n^{1/2-γ}+n^{γ-1}$ in Kolmogorov and convex distances. This matches the existing upper bound throughout the range of $γ$. The nonlinear bias contributes $n^{1/2-γ}$ even when the Gaussian reference uses the finite linearized variance. We also derive a lower bound of order $n^{-(1-γ)/2}$ for the relative mean error of estimating the limiting variance from one SGD trajectory, uniformly over a scalar quadratic family. With the limiting variance known, achieving approximation error $\varepsilon$ on this example takes order $\varepsilon^{-4}$ iterations for the best choice $γ=3/4$. Achieving both Gaussian approximation and relative mean variance-estimation errors at most $\varepsilon$ uniformly over the model class requires at least order $\varepsilon^{-6}$ iterations for every fixed $γ$.

fields
Optimization and Control, Statistics Theory
pdf ↗ page arXiv:2611.01155 ↗

Operators choosing among decision rules, such as when a battery charges or where an idle taxi goes, rank them by estimated long-run value. A standard estimator, linear temporal-difference (TD) learning, fits values from one stream of correlated observations. Large fits often use an adaptive optimizer, such as adaptive moment estimation (Adam), with fixed averaging rates. We show that these rates can change what is estimated, not just how fast: the same observations drive the updates and the optimizer's step-size scaling, moving the fit away from the intended TD value. The shift differs across rules, so it need not cancel in a comparison, and more data only makes a wrong ranking look more certain. Our remedy refits the same data at a second averaging rate that halves the effective gain, the number to which the leading shift is proportional. Twice the new fit minus the original removes that shift. In New York taxi and battery models calibrated to real data, common optimizer settings leave the selected rule unchanged but order close rules wrongly and misstate its value. Our remedy corrects nearly every wrong ordering, with one extra fit when the shift is moderate and two when it is larger.

comments
64 pages, 1 figure, 5 tables; includes an electronic companion with proofs and supplementary experiments
fields
Optimization and Control, Statistics Theory
pdf ↗ page arXiv:2611.01216 ↗

We study approximate Nash equilibria in nonatomic congestion games, with the goal of understanding how much the social cost can change when the equilibrium condition is relaxed. We consider $ε$-approximate Nash equilibria ($ε$-NE), in which each player uses a strategy whose cost is at most $1 + ε$ times the minimum available cost. We compare the social costs of $ε$-NE and exact Nash equilibria. This lets us quantify, for example, how much a navigation app can reduce total travel time when drivers tolerate routes slightly slower than the fastest available route. For degree-$d$ polynomial latencies in both general nonatomic congestion games and single-commodity routing games on series-parallel networks, we give tight lower and upper bounds on the relative change in social cost from an exact Nash equilibrium to any $ε$-NE, with matching instances for every $ε$. For small $ε$, the largest possible relative reduction and increase in general congestion games are both $Θ(\sqrt{dε})$, independently of the number of resources and populations. In contrast, on series-parallel networks of depth $h$, the largest possible relative reduction is $Θ(hε)$, while the largest possible relative increase is known to be $ε$. For the classes of games we study, these results give a tight and quantitative characterization of the possible changes in social cost and establish a separation between general and series-parallel networks.

fields
Optimization and Control
pdf ↗ page arXiv:2611.01234 ↗

We introduce Lehmer branch-and-price, an exact algorithm for bin packing and cutting stock problems built on the Lehmer transform, the ratio of Mellin transforms of item weights at consecutive orders. The transform maps each bin, a finite multiset of item weights, to a smooth increasing curve, and so gives the discrete problem a continuous representation on which the tools of analysis, such as convexity, exponential families and smoothing, can act. Read along this curve, the problem yields an explicit dual solution, a monotone representation of the dominance order, a family of constructive heuristics with first fit decreasing as its limit, and an integer identity that tells when the linear relaxation can decide an instance and when only a perfect packing can improve the best solution known. Lifted from items to patterns, the transform gives entropic column generation, a new form of column generation that bounds the relaxation from both sides at every iteration without solving the pricing problem exactly, maximizes a smoothed dual at an explicit rate, and measures by an entropy how much the relaxation leaves undecided. We show that the proposed algorithm outperforms the state-of-the-art methods on the standard benchmark in both the number of instances solved and the computational time.

comments
38 pages, 1 figure, 8 tables. Code: https://github.com/chimera1001/lehmer-bp
fields
Optimization and Control
pdf ↗ page arXiv:2611.01251 ↗

Control Barrier Functions (CBFs) offer a powerful theory for enforcing safety in dynamical systems. Yet, applying this framework to complex systems is challenging when subsystems are feedback-interconnected and operate at different timescales. Such structures arise naturally in multiphysics systems and in control architectures where physical plants interact with optimization, estimation, and control algorithms. In many of these settings, safety involves only part of the system, motivating the design of reduced-order certificates. Inspired by singular perturbation theory, we establish sufficient conditions, involving separation between slow and fast dynamics, under which a reduced-order safety certificate can be lifted to the full interconnected system. Specifically, we construct a composite CBF ensuring forward invariance of a lifted subset of the original safe set. We also show that the certified safe set expands monotonically as the tuning parameter accelerating the fast dynamics is reduced. Numerical results validate the approach on two robotic systems: a planar 2-DoF manipulator with motor dynamics and a 6-DoF UR10e manipulator controlled by a suboptimal optimization algorithm.

fields
Optimization and Control
pdf ↗ page arXiv:2611.01266 ↗

When intervention targets are uncertain, learning causal relationships and identifying directly perturbed variables become a joint task. We develop an exact mixed-integer program based on optimized parent-set scores (PS-MIP) for joint graph and intervention-target estimation in linear Gaussian structural equation models under stochastic hard interventions. The method can incorporate candidate-edge restrictions and partial target knowledge when available. For each random variable, PS-MIP evaluates candidate sets of direct causes, or parent sets, by optimizing the likelihood parameters and compatible target patterns, retaining both the score and a minimizing target pattern. A global mixed-integer program then selects parent sets subject to acyclicity. Under stated conditions, this reduction preserves the joint objective and reconstructs the graph, targets, and likelihood parameters. Because the local scores are precomputed, PS-MIP replaces a direct large bilinear mixed-integer program with a linear selection problem; empirically it certifies global optimality on far more instances than the direct formulation (126 of 180 versus 34) and is often orders of magnitude faster. On synthetic data, PS-MIP achieves favorable false-discovery–true-discovery trade-offs relative to several benchmark algorithms for causal discovery with unknown intervention targets, along with strong intervention-target recovery in denser settings. An exploratory study on real data from a controlled physical system further demonstrates recovery beyond simulation.

fields
Optimization and Control
pdf ↗ page arXiv:2611.01267 ↗

Distributed zeroth-order optimization has gained increasing attention in applications where exact gradients are computationally expensive or unavailable. However, the iterative exchange of local decision variables makes distributed networks vulnerable to inference attacks. While differential privacy provides a rigorous framework for privacy protection, conventional approaches generally require additional random noise, which inevitably affects optimization accuracy. In this paper, we investigate whether the randomness inherent in zeroth-order estimation can itself provide privacy protection. We develop a distributed zeroth-order gradient descent method that integrates consensus updates with a ball-uniform two-point gradient estimator. Our theoretical analysis shows that our algorithm attains standard convergence guarantees in both online and offline optimization settings. We then characterize the relevant probability distributions of the associated privacy mechanism, and establish differential privacy guarantees for both the online and offline optimization settings. These results reveal the potential of intrinsic zeroth-order randomness for privacy protection.

fields
Optimization and Control
pdf ↗ page arXiv:2611.01373 ↗

Benign landscapes provide a geometric explanation for the success of iterative methods on nonconvex problems arising in data science. The landscape is benign if every local minimizer is global and every other critical point is a strict saddle. For methods that avoid strict saddles, convergence to a critical point therefore implies convergence to a global minimizer. For smooth stochastic optimization, a common strategy for establishing such landscapes proceeds in two steps: $(i)$ establish benign geometry for the population objective—which is often easier to analyze—and $(ii)$ transfer this geometry to the empirical objective using concentration of gradients and Hessians. Recent work has extended saddle-point avoidance guarantees to weakly convex nonsmooth optimization through the notion of active strict saddles. We show, however, that benign population geometry need not transfer to empirical objectives in this setting. Specifically, for robust phase retrieval with Gaussian measurements—a well-studied and highly structured problem—the population objective is benign. Nevertheless, the empirical objective has sharp spurious local minima with probability bounded away from zero as the sample size tends to infinity. This asymptotic probability lower bound is independent of the dimension.

comments
71 pages, 2 figures, 1 table
fields
Optimization and Control
pdf ↗ page arXiv:2611.01384 ↗

The three-phase time minimization transportation problem partitions the origin-terminal links into three sets used in consecutive phases and minimizes the sum of the phase shipment times. Optimal solutions may leave a phase idle, as in the main example of the original study. We require every phase to carry a positive integer quantity while leaving the split of the total requirement across phases free. Discarding idle solutions from the original algorithm does not, in general, solve this variant. We prove that the optimum is attained by fixing one witness link in each of two phases and deciding the third phase by a single network flow computation, with the optimal Phase-3 time of each witness pair located by binary search. The resulting exact algorithm is strongly polynomial. It extends to any fixed number of phases, whereas, when the number of phases is part of the input, even non-idle feasibility is strongly NP-complete; feasibility alone is fixed-parameter tractable in the number of phases via known rainbow-matching results. We also characterize the minimum time of each phase. On the main example, non-idleness raises the optimum from 38 to 41. On 3,650 random instances with up to $50\times50$ links the algorithm took at most 50.2 seconds, and non-idleness raised the optimal value in 41% of the 2,250 instances with equal phase sizes; on 90 sampled instances it was faster than a mixed integer programming solver on 80 with a direct formulation and on 65 with a tighter threshold formulation.

comments
44 pages (37-page main article and 7-page supplement), 0 figures; reproducibility code and data included as ancillary files
fields
Optimization and Control
pdf ↗ page arXiv:2611.01387 ↗

We study a dynamic two-way matching market in which agents of heterogeneous types arrive over time, wait to be matched according to a compatibility network, and abandon the system if their random patience expires. The decision maker collects match rewards and pays holding and abandonment costs, and seeks to maximize the expected net value over a finite horizon. We evaluate policies by their approximation ratio against a fluid benchmark, the optimal value of a linear-programming relaxation that upper bounds the expected net value of every policy. Under a general position gap (GPG) condition, which requires the unique optimal dual solution of this linear program to remain optimal under small perturbations of the arrival rates, we propose a longest-queue policy. The policy first uses this dual solution to identify a set of good match types and a set of critical agent types. Upon each arrival, it considers only good matches and matches the arrival to the critical partner with the longest queue subject to availabilities. In the high-volume regime, in which arrival rates are scaled by s, we prove that the policy attains an approximation ratio of at least 1-O(1/s) at every scale s >= 1 and every horizon T >= 1, so the ratio tends to 1 as s goes to infinity.

comments
39 pages, 4 figures
fields
Optimization and Control, Probability
pdf ↗ page arXiv:2611.01431 ↗

This paper studies dual path following for a quadrotor carrying a three-degree-of-freedom arm. The center of mass of the combined system must follow a vehicle path and the end effector must follow a second path, while the arm respects its joint limits and avoids its singular postures. The vehicle and the arm are mechanically coupled, so one controller must handle both paths. With the center of mass and the end-effector path coordinates as outputs, and a dynamic extension of the thrust, the system admits a normal form without internal dynamics. We characterize the states where this normal form fails. We formulate the transverse feedback linearizing controller as a quadratic program that relaxes only the speed of the end effector along its path and imposes safety and actuator limits as inequality constraints. The program reduces to a scalar problem with a closed-form solution. If it remains strictly feasible for all time, the feedback is locally Lipschitz, both paths are invariant and attractive, and every constraint holds. In the physics engine Drake, the controller resolves a conflict between the two speed references by slowing the end effector while both paths remain invariant. By contrast, a cascade with a safety filter leaves both paths. Code and animations are available at https://gradslab.github.io/am_dual_pf-/

comments
8 pages, 3 Figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.01442 ↗

Designing simple appointment systems that under uncertainty in service times, try to achieve both high utilization of expensive medical equipment and personnel as well as short waiting time for patients, has long been an interesting and challenging problem in health care. We consider a robust version of the appointment scheduling problem, introduced by Mittal et al.\ (2014), with the goal of finding simple and easy-to-use algorithms. Previous work focused on the special case where per-unit costs due to under-utilization of equipment/personnel are homogeneous i.e., costs are linear and identical. We consider the heterogeneous case and devise an LP that has a simple closed-form solution. This solution yields the first constant-factor approximation for the problem. We also find special cases beyond homogeneous costs where the LP leads to closed form optimal schedules. Our approach and results extend more generally to convex piece-wise linear costs. For the case where the order of patients is changeable, we focus on linear costs and show that the problem is strongly NP-hard when the under-utilization costs are heterogeneous. For changeable order with homogeneous under-utilization costs, it was previously shown that an EPTAS exists. We instead find an extremely simple, ratio-based ordering that is 1.0604 approximate.

comments
Full version of APPROX 2019 paper
fields
Optimization and Control
pdf ↗ page arXiv:2611.01478 ↗

The probabilistic gradient estimator (PAGE) alternates randomly between an accurate gradient refresh and a cheap recursive correction. This third expository note on recursive variance reduction explains the algorithm and gives a self-contained convergence proof for smooth nonconvex optimization. A Lyapunov function combines objective decrease with estimation error, turning the refresh probability into an explicit contraction parameter. The resulting expected oracle complexity is $O(n+\sqrt n\,ε^{-2})$ for finite sums and $O(ε^{-3})$ for online problems, with the other problem parameters fixed. Initialization, refreshes, and both evaluations in each gradient difference are counted. The presentation is pedagogical and makes no claim of a new algorithm or convergence rate.

fields
Optimization and Control
pdf ↗ page arXiv:2611.01523 ↗

Homogeneous gradient functions have widespread significance, including applications in maximum energy subspace selection and retrieval problems. Euler's homogeneous function theorem specifies how the potential associated with a positively k-homogeneous gradient field can be recovered directly from the field itself. We use Euler's theorem to build on GradNets and propose a homogeneous gradient network architecture that is guaranteed to correspond to the gradient of a homogeneous function. Then, we describe how monotone homogeneous GradNets universally approximate the gradients of k-homogeneous convex functions. The inductive bias of homogeneous GradNets enables them to outperform baseline ICNNs by up to 7dB in our max energy subspace projection experiment and by up to 13% higher accuracy, 98% fewer parameters, and 70% fewer FLOPS in our amortized inner product search experiment.

fields
Optimization and Control
pdf ↗ page arXiv:2611.01530 ↗

This paper proposes a novel mixed-order inertial primal-dual dynamical system with general time-scaling and Tikhonov regularization coefficients, together with implicit Hessian damping, for solving convex optimization problems with linear equality constraints in Hilbert spaces. The proposed dynamical system incorporates slowly vanishing viscous damping and is developed based on a time-dependent Tikhonov-regularized Lagrangian. Under suitable assumptions, we establish fast convergence rates for the objective residual, the feasibility violation, and the primal-dual gap using a Lyapunov analysis. Moreover, we prove that the generated primal-dual trajectory converges strongly to the minimum-norm primal-dual solution. Numerical experiments illustrate the theoretical results and indicate improved convergence performance relative to the comparison dynamical systems.

fields
Optimization and Control
pdf ↗ page arXiv:2611.01538 ↗

Distributionally robust optimization (DRO) provides a principled framework for making decisions under uncertainty when the underlying distribution may be incorrectly specified. A widely used approach builds on ideas from optimal transport (OT) as a means of measuring differences between distributions. However, this depends on these distributions residing in the same space. In certain settings, the reference data distribution we have and the space on which we make our decision may be different, which renders classical OT techniques impossible. In this paper, we provide a new DRO formulation in which ambiguity sets are defined through the Gromov-Wasserstein distance, which is an extension of OT to pairs of distributions residing in incomparable spaces. We show that several seemingly unrelated optimization formulations, including conditional value-at-risk minimization, group distributionally robust optimization, robust graph $k$-median, and $k$-median with outliers, can be recovered as special cases of our formulation. We describe the computational aspects of solving the proposed formulation based on the doubly-nonnegative relaxation. Last, we illustrate the framework through experiments on clustering over incomparable spaces and stochastic graph $k$-median.

fields
Optimization and Control
pdf ↗ page arXiv:2611.01557 ↗

Every linear program can tolerate small changes to its costs and still yield a solution of the original problem. The size of this tolerance measures how robust an optimal decision is to noise or numerical error, and how much regularization the problem can support. Classical sensitivity analysis can determine this tolerance only from an optimal solution. This paper provides a priori lower bounds on two measures of this tolerance -- the optimality gap and the $\infty$-norm stability radius -- for the $n$-by-$n$ linear assignment problem over the Birkhoff polytope. The bounds derive from a smoothed analysis, which adds Gaussian noise with standard deviation of at least $σ$ in every direction to an arbitrary base cost. At every fixed confidence level, uniformly over the base cost, both quantities are at least of order $σ/(n\sqrt{\log n})$. The radius bound is asymptotically sharp. Under isotropic noise, the worst case occurs when every assignment has equal cost, and in this case, a scaled stability radius converges in distribution to a standard exponential variable.

comments
17 pages, 3 figures
fields
Optimization and Control, Probability
pdf ↗ page arXiv:2611.01584 ↗

Fast online optimization is essential for nonlinear model predictive control (NMPC) on resource-limited aerial platforms. This paper presents an analytical-derivative NMPC solver for quadrotor trajectory tracking. For the state-affine translational model with held thrust and attitude commands, fourth-order Runge–Kutta integration yields an exact discrete-time prediction map. Forward–backward difference equations provide the gradient and exact Hessian of the finite-horizon cost condensed over the input sequence. These derivatives drive a nested optimal-control-based direction recursion, while a shifted warm start reuses the preceding solution. The resulting solver addresses the unconstrained tracking problem without a general-purpose nonlinear programming package. Gazebo experiments show comparable tracking accuracy to iLQR and two acados SQP configurations, with mean solver-time speedups of $1.97$--$2.30$. In onboard flight tests, the mean solver time is $0.3121$\,ms, corresponding to speedups of $3.37$--$5.77$ over the same baselines. The largest measured solver time is $3.7754$\,ms within a $20$-ms control period. These measurements cover the numerical solver and exclude estimation, communication, and command publication.

fields
Optimization and Control
pdf ↗ page arXiv:2611.01628 ↗

Adaptive methods such as Adam are the most commonly used methods for training neural networks, but their long-time behavior is not as well understood as that of non-adaptive methods. This is particularly true in the mean-field limit, where the dynamics of infinitely many neurons are described as a distribution over parameters which satisfies a self-consistency condition. In this paper, we study a deterministic continuous-time model of Adam in the mean-field setting. Under a condition relating the averaging rates of the momentum and second-moment variables, the size of the gradients, and a regularization parameter, we prove that the distribution of parameters converges to the set of equilibria. This condition extends the range known for finite-dimensional models, and we show that it is sharp. Under an additional Lojasiewicz-type inequality for distributions, we prove that individual parameter trajectories converge and obtain quantitative rates for this convergence. We verify the qualitative convergence assumptions for a regularized two-layer neural network. We also show that adding noise to the momentum prevents the system from approaching these equilibria and rules out many free-energy type Lyapunov functionals. Finally, numerical experiments illustrate the energy estimates, give evidence of persistent oscillations outside the sufficient parameter range, and compare the observed decay with the predicted rates.

fields
Optimization and Control
pdf ↗ page arXiv:2611.01658 ↗

We develop rank, identifiability, and noise-conditioning results for compact input–output predictors in multirate data-driven predictive control. The inverse of a square zero-input response matrix used in an existing compact-lifting construction is shown to be undefined under its observability and minimal-polynomial assumptions. We derive exact replacements using rank-complete data, characterize all predictor extensions, and establish the minimum-norm and minimax Euclidean noise properties of the canonical Moore–Penrose extension. A joint predictor is identified directly from mixed experiments with arbitrary initial states. Deterministic perturbation bounds quantify reconstruction errors through informative singular-value margins, while a positive-definite reduced weighting preserves the nominal quadratic cost. Sampling-rate observability and event-triggering analyses identify additional conditions needed for reconstruction and stability guarantees.

fields
Optimization and Control
pdf ↗ page arXiv:2611.01665 ↗

We study adapted finite-variation tracking of fractional Brownian motion under quadratic loss and proportional adjustment costs. For $H\in(0,1)$, \[ V_λ(T;a,b,σ)\underset{λ\downarrow0}{\sim}κ_HT a^{(1-H)/(1+H)}(λb)^{2H/(1+H)}σ^{2/(1+H)}. \] The positive long-run cell value $κ_H$ is unchanged by full past information. A bounded full-past reset correction yields finite-horizon bounds and continuity in $H$. The Brownian value is $κ_{1/2}=\frac12(\frac32)^{2/3}$. Coupling local paths with their filtrations gives a local limit, which we verify for Gaussian Volterra targets. Every asymptotically optimal control has the same leading tracking–variation cost split. Primal and dual bounds quantify the cell value. For $H<1/2$, we construct a positive-factor approximation and relate factor resolution to horizon length.

comments
47 pages, 2 figures
fields
Optimization and Control, Probability
pdf ↗ page arXiv:2611.01727 ↗

We study how a fixed model family determines expected minimax regret in adaptive LQG control. The family is compact and affine, with partial observation and unknown noise covariances. We quantify how information from residual covariances and input responses can vanish relative to differences between optimal control laws. This relation yields matching bounds that classify regret as bounded, logarithmic, sublinear polynomial or linear. Polynomial exponents are rational. For real algebraic model and cost data, a terminating procedure determines the regret class and the exact exponent of polynomial growth before data collection. A causal policy attains these rates using model estimation and bounded probes, reselecting model sets from observations without a supplied common stabilizer. For costs with fixed positive definite output and input weights, polynomial exponents are at most one half.

comments
23 pages, no figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.01739 ↗

Convex regression provides a flexible nonparametric estimation framework while incorporating appropriate shape information. However, its standard least-squares formulation has $O(n^2)$ supporting-hyperplane constraints creating a computational bottleneck as the sample size $n$ increases. We study a $K$-nearest-neighbor (KNN) localized relaxation for convex regression where we for each sample, we only maintain the $K$ nearest hyperplane constraints. Under mild regularity conditions, we establish statistical guarantees for our modified estimator in every fixed dimension $d\ge2$. In particular, for $d>4$, the population risk of our modified problem can be shown to have equivalent convergence rates as the original least square convex regression estimator of $\widetilde O(n^{-2/d})$ using neighborhoods sizes (i.e. $K=K_n$) of order $\widetilde O(n^{2(d-1)/(2d-1)})$ for general convex functions and $\widetilde O(n^{(d+1)/(d+2)})$ for strongly convex functions. To corroborate our theory, we implement iterative optimization methods to compare the prediction accuracy of the KNN relaxation with those of the full estimator across synthetic convex benchmarks. Our experiments demonstrate that KNN prediction risk approaches the full-estimator prediction risk at neighborhood sizes matching the theoretical scale.

comments
37 pages, 4 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.01744 ↗

The Herfindahl–Hirschman Index (HHI), a standard measure of market concentration, is widely used to quantify competitive balance in sports tournaments. To enable comparisons over time or across leagues, both its minimum and maximum should be known. The minimum is usually trivial. Our paper provides results on the maximum HHI in incomplete round-robin tournaments, where the set of matches is represented by a regular but not complete undirected graph. We prove that the lower bound of maximum HHI is reached when the tournament consists of independent round-robin groups, while the upper bound of maximum HHI is reached when the set of matches is represented by a bipartite graph. Maximising HHI is computationally difficult even for highly structured graph types corresponding to real-world tournaments, where the teams are partitioned into pots and play the same number of matches against opponents from every pot. The complexity of the problem does not depend on the scoring system or the number of opponents from a pot.

comments
43 pages, 4 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.01750 ↗

This monograph introduces discrete-time mean field games with finite state and action spaces, emphasizing optimization formulations and learning algorithms. Starting from Markov decision processes and finite-player stochastic games, it develops the notion of mean field Nash equilibrium, establishes existence and uniqueness results under suitable assumptions, and explains how mean field equilibria yield approximate equilibria in large finite-player games. Building on the linear programming formulation of Markov decision processes, occupation measures and primal-dual formulations connect equilibrium computation with mathematical optimization. The monograph presents fixed-point iterations, fictitious play, online mirror descent, and optimization-based methods, discussing their convergence properties and limitations. Numerical examples illustrate crowd motion, traffic routing, epidemic management, and the computation of multiple equilibria. It combines examples, theoretical results, and implementable algorithms, with bibliographic notes providing connections to the broader literature.

fields
Optimization and Control
pdf ↗ page arXiv:2611.01754 ↗

In modern recommender systems, users are often presented with products whose outcomes are random. The values of such products depend on their entire outcome distributions and on users' attitudes toward risk, making them difficult to evaluate using traditional product-level recommendation methods. We propose \textsc{IncVNM}, an interactive recommender system that incrementally learns a user-specific von Neumann–Morgenstern (VNM) utility function from ordinal click feedback generated during ordinary webpage browsing. At each interaction, \textsc{IncVNM} converts the click order within a displayed product list into pairwise comparisons between outcome distributions and updates the nominal utility by minimizing its deviation from the previous estimate while incorporating the newly observed pairwise comparisons. To close the interaction loop, an entropy-regularized sampling policy balances exploitation of the learned utility against exploration for additional preference information. We evaluate \textsc{IncVNM} in a rolling-window experiment with different response-error probabilities and show that it substantially outperforms the expected-return, mean–variance, discounted-UCB, and distribution-aware BPR baselines.

fields
Optimization and Control
pdf ↗ page arXiv:2611.01786 ↗

We consider unconstrained minimization of a possibly nonconvex function $f:\mathbb{R}^n\to\mathbb{R}$ whose $p$th derivative is Lipschitz continuous, with $p\geq3$, when derivative information is available only through order $p-2$. The unavailable tensors $\nabla^{p-1}f$ and $\nabla^pf$ are reconstructed from central finite differences of $\nabla^{p-2}f$. Since the two reconstructions have different point-query costs, we use a block length $m$ for the order-$p$ approximation and a subblock length $\ell\leq m$ for the order-$(p-1)$ approximation. The latter is transported between consecutive reconstruction points using the stored order-$p$ approximation. This leads to an adaptive regularization method that does not require prior knowledge of the Lipschitz constant. We prove finite termination at an $ε$-approximate first-order stationary point and derive an explicit bound on the number of bundled order-$(p-2)$ oracle queries. For $m=(p-2)n^2$ and $\ell=(p-2)n$, the accuracy-dependent term has dimension–accuracy scaling $n^{3/p}ε^{-(p+1)/p}$. Thus the method retains the $ε^{-(p+1)/p}$ dependence of full order-$p$ regularization while using derivatives only through order $p-2$. Within the dense reconstruction framework considered here, using separate block and subblock lengths gives dimension dependence of order $n^{3/p}$, compared with $n^{4/p}$ when a common length is imposed.

fields
Optimization and Control
pdf ↗ page arXiv:2611.01819 ↗

We study exact mixed-integer reformulations of a finite horizon Markov decision process (MDP) with transition revenues defined by local submodular revenue maximization problems. We start with the dual linear programming formulation of the MDP, where local optimal revenues appear in the objective function and the constraints describe the state probabilities from the initial state. We combine the dual formulation with the binary variables of the local problems and obtain an exact mixed-integer nonlinear formulation with bilinear terms. We use the submodular inequalities and an exact McCormick linearization to obtain an equivalent mixed-integer linear formulation. We also use the dual structure to conduct a sensitivity analysis of the MDP optimal value with respect to changes in the local revenue coefficients. Based on local incumbent revenues and upper bounds, this sensitivity analysis evaluates the effect of local optimality gaps on the global MDP optimality gap, without solving every local revenue maximization problem to optimality.

fields
Optimization and Control
pdf ↗ page arXiv:2611.01863 ↗

We present recent developments in Halpern Peaceman-Rachford (HPR) methods for solving large-scale linear programming problems. We first introduce the semi-proximal HPR framework and summarize its convergence guarantees, together with its connections to Halpern PDHG and ergodic Peaceman-Rachford iterations. To improve practical performance, we develop adaptive restart and penalty parameter update strategies. We then describe several computational enhancements, including GPU-based preprocessing, diagonal scaling, reusable execution plans for sparse matrix-vector multiplication, and sieving techniques. We further discuss multi-GPU parallelization and lossless model storage and loading for handling large-scale instances. These developments form the foundation of HPR-LP, a GPU-accelerated solver for large-scale linear programming.

comments
19 pages, 2 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.01872 ↗

We present recent developments in Halpern Peaceman–Rachford (HPR) methods for solving large-scale convex composite quadratic programming problems. Within a unified HPR framework applied to the restricted Wolfe dual, we develop several algorithmic variants based on different choices of the semi-proximal operator $\mathcal{T}_1$ for the joint dual subproblem. Specifically, an sGS-based construction leads to a sequential $w$--$y$--$w$ update scheme, while a block-linearized construction eliminates cross-block coupling and enables parallel dual updates. To improve the latter, we further introduce a coupling-aware construction that exploits a second spectral moment to obtain a tighter row majorizer. We extend the framework to convex quadratically constrained quadratic programming through factor-based second-order cone reformulations. Additional computational enhancements include equality Gram scaling and asynchronous CPU polishing. We establish convergence results under fixed metrics and discuss practical adaptive strategies.

comments
19 pages
fields
Optimization and Control
pdf ↗ page arXiv:2611.01887 ↗

The Broximal Point Method (BPM) of Gruntkowska et al. (2025) comes with strong guarantees for convex optimization: under convexity alone, it terminates after finitely many steps and converges linearly in function value, with bounds that do not depend on the condition number or on any other regularity property of the objective. Each iteration, however, requires the exact minimization of the objective over a ball, which is generally intractable. As a first step toward implementable variants, we study the method when these subproblems are solved only approximately. We introduce and analyze Inexact BPM, which replaces the exact broximal point by an approximation and makes no assumption on how this approximation is obtained. Under summable or sufficiently small errors, we bound the number of iterations needed to reach a neighborhood of the set of minimizers, and these bounds remain independent of the regularity of the objective. Under the weaker requirement that the errors stay below the ball radius, we prove sublinear convergence in function value for the exact broximal points underlying the perturbed iterates, valid until the target neighborhood is reached, and we recover linear rates under bounded sublevel sets or strong convexity.

comments
18 pages, 2 figures, 2 tables
fields
Optimization and Control
pdf ↗ page arXiv:2611.01933 ↗

Each food bank within the national Feeding America network faces the challenge of distributing donated food equitably across the food-insecure population it serves while minimizing food storage and waste over a multi-period planning horizon. Donated food supply is highly stochastic, and distribution to beneficiaries is done by autonomous local agencies whose capacities are uncertain and vary over time. Based on our long-standing partnership with a regional food bank in the southeastern United States, we address the equitable and effective distribution of food donations to charitable agencies over a finite planning horizon under uncertain capacity and supply. We derive structural properties of this problem and use them to develop efficient heuristics. An extensive numerical study evaluates the performance of the heuristics relative to a stochastic dynamic programming benchmark, which suffers from the curse of dimensionality. One heuristic consistently provides near-optimal solutions and can be easily implemented by food banks. Our results also apply to other problems involving the equitable and effective distribution of scarce resources under stochastic capacity and supply.

fields
Optimization and Control
pdf ↗ page arXiv:2611.01947 ↗

Reverse and forward Kullback–Leibler (KL) divergences provide complementary supervision in on-policy distillation: reverse KL refines the student's active token rankings, and forward KL allocates mass to teacher-supported candidates. At student-generated prefixes, we form a four-observation matrix by treating the student and teacher as both candidate sources and evaluators. The diagonal self-observations measure uncertainty, while source-centered cross-observations recover the two KL objectives. We establish an exact identity equating the Fisher inverse-metric coupling of their logit gradients with the sum of these contrasts, yielding a common local descent direction for distinct positive distributions. Observation-coordinated on-policy distillation (OC-OPD) uses observations to set preferences, closed-form bargaining to coordinate gradients, and distributional discrepancy to scale the update. Across three heterogeneous student settings (non-thinking generation, thinking generation, and base-model initialization), OC-OPD achieves strong gains in mathematical reasoning and transfers effectively to out-of-distribution scientific question answering and code generation. Our code is publicly available at: https://github.com/RuoranXu/OC-OPD.

fields
Optimization and Control
pdf ↗ page arXiv:2611.01965 ↗

Convergence properties of general electrical networks with grounded nonlinear capacitors at the nodes and nonlinear inductors and resistors at the edges are studied. It is shown how, under appropriate conditions, for every initial condition there exists a unique equilibrium to which the system converges asymptotically. Partial extensions to networks with terminals or current sources are also provided. For RC networks this is compared with the use of an alternative storage function based on the co-content functions of the resistors.

comments
12 pages
fields
Optimization and Control
pdf ↗ page arXiv:2611.01998 ↗

We study the problem of estimating the global treatment effect in randomized experiments under interference, where a unit's outcome may depend on the treatment assignments of other units. We adopt a minimax framework, allowing an adversary to select an outcome function from a class of functions that satisfy bounded outcomes and bounded interference. We derive minimax-optimal static estimators that are robust to a wide range of interference structures, parameterized by a scalar $δ$ controlling the maximum influence of one unit's treatment on another's outcome. Under large interference, we observe two regimes. When the treatment and control groups are equally sized, the minimax-optimal static estimator is the zero estimator. When one of the two groups is larger, the minimax-optimal static estimator is a "half-zero" estimator, in which the outcomes of the smaller group are ignored, and the estimator only considers the outcomes of the larger group.

fields
Optimization and Control
pdf ↗ page arXiv:2611.02048 ↗

We study finite-horizon reinforcement learning with a safety constraint on the probability of reaching a failure set. In contrast to the well-studied safe reinforcement learning literature, we consider problems where the probability of reaching the failure set is vanishingly small, but the consequences of reaching the failure set are catastrophic. Direct simulation and estimation of the optimal policy is naturally ineffective when the failure probability is extremely small. Moreover, on a real system the controller can only choose actions, and this is not enough to make failures frequent. In contrast to the rare event simulation literature, our goal is not to estimate the probability of the rare event occurrence, but to upper bound it such that the failure constraint is satisfied. Thus, instead of sampling failures, we use the large deviations principle. We define a damage variable that on exceeding a certain threshold indicates failure. We study the cumulant generating function (CGF) as its positive root provides an upper bound on the failure probability via Cramer's theorem. We extend this approach to Markov decision processes with hitting times through state-action CGFs, and give finite-horizon and state-dependent versions of the bound. The state-action CGFs do not depend on the policy and can be estimated from regular transitions, so the bound can be checked for any policy a priori. This gives a policy improvement algorithm in which every policy satisfies the failure constraint with high probability.

fields
Optimization and Control, Probability, Statistics Theory
pdf ↗ page arXiv:2611.02055 ↗

This paper investigates the cumulative prospect theory (CPT)-based shortfall risk measure where the value (utility) function and the distortion (probability weighting) functions are ambiguous. We propose a worst-case CPT-based shortfall risk measure where the capital requirement is based on the worst-case value function and distortion functions from an ambiguity set constructed with user-specific information (e.g., preference between risky and certain lotteries) and well-known general information such as the S-shape of the value functions. When the underlying random loss is discretely distributed and parameters in pairs of lotteries remain undetermined, we demonstrate that the worst-case value function and the distortion functions have a piecewise linear structure. Based on this observation, we develop an adaptive preference elicitation approach extended from the well-known polyhedral method to simultaneously elicit the distortion functions and the positive and negative parts of the value function by solving a sequence of mixed-integer linear programs. Based on the elicited distortions, we design new queries to construct a feasible set of the holistic value functions. The proposed framework iteratively shrinks the ambiguity set through designed queries, yielding a computationally implementable robust CPT-based shortfall risk measure. To examine the in-sample and out-of-sample performance of the elicited CPT-based preference functions and the resulting preference robust shortfall risk measure, we conduct numerical experiments under an S-shaped value function and inverse S-shaped distortion functions and report the corresponding results.

fields
Optimization and Control
pdf ↗ page arXiv:2611.02059 ↗

We study how many split cuts, which include the Gomory mixed-integer cuts, are needed to reach the integer hull, and how large split closures can be. In every fixed dimension, a rational pure-integer polytope 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 bounded 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 integer-affine map, into the interior of a planar lattice-free polyhedron has a polynomial split proof retaining every point already 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 two-row 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, for mixed-integer feasible rational polytopes with fixed integer dimension $p$ and any continuous dimension, we maximize a primitive integral objective on the integer variables with $O_p(G+1)$ split cuts, each removing a current optimal LP vertex, until an optimal vertex is mixed-integer feasible; here $G$ is the integrality gap of the LP relaxation, rounded down.

fields
Optimization and Control
pdf ↗ page arXiv:2611.02169 ↗

Rapid growth in data center electricity demand, driven by artificial intelligence (AI) training and inference, is expected to increase stress conditions for power grids. Operational flexibility from data centers offers a near-term lever to relieve such stresses. Existing models of data center flexibility tend to bundle economic incentives with physical constraints, obscuring the tradeoff between economic willingness to shift load and technical limitations to do so. This paper proposes a temporal-redispatch focused framework that decouples data center demand flexibility into two independently parameterized dimensions: (1) systematic flexibility, capturing the economic environment through penalties for temporal shifting of data centers' scheduled demand, and (2) operational flexibility, capturing the physical envelope through the demand shifting time window and the limit on shifted data center demand. The framework relies on a direct current optimal power flow (DC-OPF) linear program which enables annual parametric analysis at hourly resolution. The framework is studied using a synthetic grid mimicking the Texas transmission system populated with the 2026 Adjusted Forecast from ERCOT (Electric Reliability Council of Texas). Results show that operational flexibility imposes a physical lower bound on unsatisfied demand that no economic incentive can overcome; longer shifting windows and higher limits on shifted data center demand reduce operational cost with different impacts on grid utilization; and, temporal redispatch shaves system-wide net load peaks while partially compensating for localized transmission bottlenecks that emerge under modeled coal retirement scenarios.

fields
Optimization and Control
pdf ↗ page arXiv:2611.02228 ↗

We study online newsvendor learning with bounded demand, censored observations, and convex nonlinear shortage costs. Because stockouts can conceal the shortage magnitudes needed by gradient-based algorithms, we use randomized ordering to construct unbiased subgradient estimates. We characterize admissible randomization distributions within this framework and develop an online inventory policy that combines the resulting subgradient estimates with gradient-based updates. Our regret analysis quantifies the cost of randomization via the estimation variance and an additional loss term. We characterize the randomization distributions that minimize this objective. For piecewise-linear shortage costs, the optimal distribution is computed through a linear-time recursion; for costs with bounded curvature density, it is characterized by a scalar ordinary differential equation. The policy achieves expected regret of $O(T^{2/3})$ against the best fixed order in hindsight over $T$ periods. Under independent demand and suitable curvature of expected losses, the bound improves to $O(\sqrt{T})$. Matching minimax lower bounds establish rate optimality over the corresponding classes with a fixed marginal-cost bound. Both rates extend to nonperishable inventory under uniformly positive conditional expected demand. Numerical experiments on synthetic and retail data show improvements over alternative policies using censored observations.

comments
30 pages of main text and 4 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.02267 ↗

We prove a new sufficient condition for small-time global exact controllability of finite-dimensional control-affine systems. It points out that, under a natural Lie algebra rank condition, quadratic Lie brackets are the only possible obstacles to controllability. This result extends to infinite-dimensional settings such as the global approximate controllability of diffeomorphisms. It also allows us to interpret recent results in PDE control theory.

fields
Optimization and Control
pdf ↗ page arXiv:2611.02293 ↗

To conserve propellant, Distributed Space Systems (DSS) can leverage environmental forces to produce low cost relative forces, such as atmospheric drag in Low Earth Orbit (LEO). This work maximizes this strategy by developing robust, closed-form algorithms for optimal "hybrid" control, defined here as complementing the magnitude and directionality deficiencies of differential drag with the superior control authority of propulsive maneuvers within the same control window. The use of drag introduces a significant source of dynamic uncertainty to the control problem, primarily from inaccurate atmospheric density modelling. This paper develops a robust control architecture that periodically re-solves the remaining drag maneuver plan in a diminishing horizon policy, rejecting operational and navigation errors while retaining the cost savings offered by differential drag. The approach is built upon reachable set theory, a control analysis technique that provides conditions for optimality for Linear Time Variant (LTV) systems with norm-like cost functions and optimally decouples hybrid control into separate propulsive and differential drag sub-problems. The optimality conditions are leveraged to prove the asymptotic Lyapunov stability of ideal reachable set-based control solutions and derive error bounds on this stability. A covariance analysis on the primary sources of error in hybrid control determines that the dominating source of uncertainty is the atmospheric density model. This conclusion allows the bounds on Lyapunov stability to be completely met by simply conditioning the atmospheric density value used in the control solutions. The derived Lyapunov stability bounds and performance of the algorithm are demonstrated experimentally in high fidelity full-force orbital simulations of the upcoming Space Weather Reconfigurable Multiscale Experiment (SWARM-EX) mission.

journal
Proceedings of the 2024 IEEE Aerospace Conference, Big Sky, Montana, March 2-9, 2024
fields
Optimization and Control
pdf ↗ page arXiv:2611.02321 ↗

This work extends a reachable set theory approach for fuel-optimal control to incorporate convex and non-convex state, time, and magnitude constraints. The solver is designed from a new set of optimality conditions, derived by reformulating a single reachable set into multiple time-ordered, step-wise reachable set waypoint sub-problems, where a waypoint is the state reached after a given maneuver. Non-convex constraints are satisfied at each waypoint, preserving convexity at each sub-problem without needing to convexify the full control problem, enabling the computationally efficient identification of constrained optimal maneuvers, and guaranteeing a user-defined bound on constrained cost. To produce an optimal maneuver plan, the solver rolls out constrained trajectories until the remaining unconstrained solution adheres to the problem constraints. The fuel-optimal control problem considered by this work is broadly applicable to many fields and particularly significant to Distributed Space Systems (DSS). Multi-agent guidance and propulsive control techniques, often for small spacecraft at close separations, require guarantees of collision avoidance, efficient maneuvering to preserve a restricted fuel payload, and numerically-simple algorithms functional under on-board computational processing limitations. The proposed solver offers both user-defined bounds on constrained maneuver optimality and enhanced computational efficiency to directly address these challenges, and these capabilities are demonstrated comparatively against baseline solvers from the literature through Monte Carlo analysis on a variety of relevant DSS scenarios. Overall, this work enables the benefits of reachable set theory, namely computational efficiency and provable optimality, to be extended to control problems of higher fidelity.

journal
Proceedings of the 2025 IEEE Aerospace Conference, Big Sky, Montana, March 2025
fields
Optimization and Control
pdf ↗ page arXiv:2611.02322 ↗

This paper presents a residual-constrained topology optimization framework that controls interface transition bandwidth without requiring external density filters. The steady conserved Allen–Cahn (AC) equation is formulated as an equality residual constraint and solved via a mass-weighted Augmented Lagrangian Method (ALM) coupled with the Method of Moving Asymptotes (MMA). A closed-form chemical potential projection eliminates the constant residual mode, ensuring algebraic compatibility with external volume targets. Variational sensitivity analysis reveals a symmetric-plus-rank-one Jacobian that yields matrix-free sensitivities without additional adjoint PDE solves, reducing residual sensitivity overhead to only 0.11% of the state elasticity solve time in 3D. Systematic 2D benchmarks confirm that interface bandwidth is governed intrinsically by reaction–diffusion parameters across mesh refinements. While diffuse interfaces incur a continuous compliance elevation (1.4%--12.3%), a volume-preserving 0/1 post-processing audit across 48 benchmark cases demonstrates that this gap stems primarily from intermediate-density penalization: binarized AC-ALM designs achieve equal or superior stiffness in 45 configurations (averaging 1.2% stiffer than SIMP). Simultaneously, single-node hinges and strut fragmentation are substantially suppressed compared to unregularized baselines. Three-dimensional benchmarks further demonstrate practical spatial viability for complex structures.

comments
43 pages, 14 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.02375 ↗

We extend a finite-state Mean Field Game model of dynamic ticket pricing to allow overselling, stochastic cancellations, and terminal penalties for unresolved negative inventory. Cancellations generate upward inventory transitions, producing a bidirectional inventory process coupled with firms' pricing decisions. We formulate the representative-firm control problem and the population consistency conditions, and prove existence of a selected Markovian mean field equilibrium under the stated assumptions, including a compact price set and an explicit tie-breaking rule. Numerical experiments show that the quadratic terminal penalty can generate an endogenous soft-boundary mechanism that discourages progressively deeper overselling. Under a low-cancellation stress case, linear penalties more strongly reduce the prevalence of terminal overselling, whereas quadratic penalties reduce its conditional depth and lower-tail severity. A time-varying cancellation experiment suggests that anticipated future inventory recovery can support lower early prices and greater temporary overbooking exposure. Under the adopted demand normalization, stronger mean-field coupling is associated with lower equilibrium prices and slower inventory depletion. Together, these results provide a tractable framework for analyzing pricing and overbooking incentives in competitive ticket markets with cancellations.

fields
Optimization and Control
pdf ↗ page arXiv:2611.02402 ↗

Stopping decisions made in parametrization coordinates need not certify physically accurate estimates. We establish conditional stopping guarantees for a folded parametrization of reduced Stokes vectors, including partial linear polarization. For strongly convex physical objectives on the bounded-intensity inner sheet, normalized first derivatives and one radial lower-curvature test give an explicit objective-gap bound with sharp tolerance orders $\varepsilon^{4/3}+ν^2$. The guarantee requires neither prior localization near an optimum nor a positive-semidefinite head Hessian. Its information basis is an exact recovery identity: one signed radial curvature restores the physical-gradient component lost at the fully linearly polarized fold, without stationarity or knowledge of the physical Hessian. For a nominal quadratic model, an outward-rounded implementation certifies a gap of at most $10^{-6}$ for 8,861 of 9,284 stored endpoints; it rejects all 295 historical false successes and 128 accurate endpoints. The full 128-fractional-bit pass takes 7.32 seconds and includes 52 scalar curvature evaluations. Controlled fits and released observations distinguish stopping certification from local fold diagnosis and subsequent coordinate repair. Twenty shared-network fits contain no saved near-fold negative-curvature candidates, and direct physical solvers are cheaper on the tested quadratics.

comments
49 pages, including Supplementary Information
fields
Optimization and Control
pdf ↗ page arXiv:2611.02421 ↗

We study direct subgradient methods for nonsmooth sample average approximation (SAA). Subgradient descent and Nesterov acceleration with constant step sizes attain polynomial and geometric rates matching their smooth counterparts. After $O(\log n)$ full-batch updates, where $n$ is the sample size, the computed solution has the same first-order expansion and limiting distribution as an SAA solution, even when the iterates do not converge. A bound on subgradient increments transfers population regularity to the sample objective, controls the algorithmic trajectory, and identifies the leading random term. The bound covers convex piecewise linear scenario costs, including two-stage stochastic linear programs with fixed recourse. Moreau smoothing displaces the population solution at first order and changes the limiting distribution of the computed solution. An explicit shift of the residual removes the first-order displacement and improves the expansion remainder. For sparse decisions, restricted increment bounds give convergence, support recovery, and expansions for proximal subgradient descent and iterative hard thresholding.

comments
87 pages
fields
Optimization and Control
pdf ↗ page arXiv:2611.02534 ↗

Approximating Minkowski sums of matrix ellipsoids by a single matrix ellipsoid provides a tractable description of noise bounds for controller design from noisy data. Existing linear matrix inequality (LMI) conditions can be used to compute such approximations, but directly solving the resulting optimization problems can be computationally expensive. This paper develops an efficient method for finding a minimum-volume outer matrix ellipsoid under these LMI conditions. Although the corresponding problem for ordinary vector-valued ellipsoids is convex, the objective function in the matrix-valued case is nonconvex. We find that the problem admits an equivalent convex reformulation, which resolves this difficulty. We first eliminate the matrix variables using equivalent LMI transformations and objective monotonicity, leaving one positive scalar variable per matrix ellipsoid in the sum. We then show that the objective becomes convex after a logarithmic change of variables. The resulting problem contains neither LMI constraints nor matrix variables and can therefore be solved efficiently. Numerical experiments confirm that the proposed method is substantially faster than the LMI-based method. An application to data-driven control further illustrates the tradeoff between guaranteed control performance and computation time.

comments
8 pages, 6 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.02553 ↗

We study a joint optimal decision of portfolio, consumption, and annuitization for a pension-plan manager who balances retirement consumption benefits against the cost of maintaining the solvency of pension account. The pension sponsor provides costly capital injection to prevent negative wealth. Annuity purchases are irreversible, and injected funds remain in the liquid account and earn interest. Using the Legendre transform, we derive a semi-explicit solution to the associated free-boundary problem and verify the optimality of the resulting strategies. We identify an endogenous annuity-income threshold separating injection-active and injection-inactive regions and characterize six policy regimes arising from the interplay between capital injections and consumption constraints. Compared with the no-injection benchmark, capital injections delay annuitization, alter the structure of the annuitization boundary, and permit positive holdings in risky assets even at zero liquid wealth. Numerical results further reveal that cheaper annuities may increase the expected capital contributions required from the pension sponsor.

fields
Optimization and Control
pdf ↗ page arXiv:2611.02558 ↗

We study distributionally robust optimization problems constrained by semilinear elliptic PDEs. Uncertain nonnegative loads enter the PDE through $m$ intensity parameters, and damage is measured by integrating a nondecreasing convex function of the solution. We prove that, for coercive operators satisfying a positivity-preserving lattice condition, a nondecreasing concave reaction $g$ makes the damage nondecreasing, convex, and supermodular in the load intensities. Under nonnegative loading and $g(0)=0$, concavity is also necessary for these properties to hold for all admissible operators and damage functions. For Wasserstein uncertainty sets based on a weighted $\ell_1$ distance and $N$ observations, we show that at most $m+1$ nested stress corners are needed per observation. These corners form a set of at most $N(m+1)$ points that does not depend on the Wasserstein radius and supports a worst-case distribution for every radius. We compute the exact robust value by checking $λ=0$ and at most $Nm$ positive breakpoints, and we construct a worst-case distribution that moves each observation to a chain corner and splits at most one observation between two adjacent corners. We apply the results to a convex remediation-planning problem with Monod biodegradation. Numerical experiments show that the method requires far fewer PDE solves than enumerating all corners. Finally, a counterexample shows that supermodularity can fail for the fractional $p$-Laplacian when $p>2$.

comments
27 pages, 1 figure, 6 tables
fields
Optimization and Control, Analysis of PDEs
pdf ↗ page arXiv:2611.02573 ↗

We study the classical Local Stochastic Extragradient method (Local SEG) for monotone variational inequalities under intermittent communication, where devices perform several local oracle calls between synchronization rounds. For affine monotone mean operators, including nonsymmetric bilinear saddle systems, we prove that equal device averaging commutes pathwise with both stages of the stochastic extragradient update. Local trajectories may therefore drift apart while their mean follows a centralized stochastic-extragradient recursion driven by averaged noise. The identity remains valid when individual oracle realizations are nonlinear and query dependent. Under conditionally centered oracle errors that are conditionally independent across devices within each stage, the reduction yields a restricted weak-gap rate that uses the local sequential depth for deterministic progress and the aggregate oracle budget across devices for variance reduction. When every device makes at least two local oracle calls per communication round, the bound contains no additional mixed client-drift term and is also attained by a terminal-only aggregation schedule. An affine Gaussian lower bound matches the depth and sample dependences before statistical saturation for distributed zero-respecting algorithms; its statistical component applies to arbitrary randomized algorithms. A complementary lower bound for feasible distributed zero-respecting methods shows that bounded geometry and query-dependent noise can create an additional communication-locality obstruction. These results delineate the exact-averaging regime of unconstrained affine Local SEG and a complexity boundary that arises under active feasibility constraints.

fields
Optimization and Control
pdf ↗ page arXiv:2611.02598 ↗

We prove local null controllability for a parabolic equation coupled to an elliptic equation on a bounded interval. The drift depends on the elliptic variable, and a single control acts through the Neumann condition at the left endpoint. For every positive control time and every locally Lipschitz drift function, sufficiently small initial data in $L^\infty$ can be driven to zero by an $L^\infty$ boundary control. To construct the control, we extend the linear equation to a larger interval using an even extension of the initial datum and an odd extension of the drift. A distributed $L^2$ control in the added interval then gives a boundary control on the original interval. A heat kernel estimate bounds the derivative trace needed for this construction. We obtain the nonlinear result by a set-valued fixed point argument.

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

We completely describe the dynamics of the Douglas–Rachford (DR) method for solving affine subspace feasibility. We characterise the affine hull of the resulting iterates, and we show how the corresponding search space's dimension is an explicit function of the number of distinct nontrivial principal angles. This dimension can be much smaller than the ambient dimension, helping to explain why extrapolation can be so effective. Using this characterisation, we extend the Lyapunov surrogate method (LSM) to higher extrapolation orders and prove that it recovers the DR limit exactly from finitely many iterates. We show that LSM and a least-squares extrapolation (LeSE) share the affine search spaces used by the generalized minimal residual method (GMRES) applied to the DR fixed-point equation (DR-GMRES). The dimension characterisation gives bounds on the number of steps required for exact recovery by all three methods. We develop adaptive implementations that estimate the search-space dimension from differences between successive DR iterates and use this estimate to select the extrapolation order. Numerical experiments show how ill-conditioning affects recovery accuracy, and we identify cases where adaptive extrapolation runs faster than DR-GMRES.

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

We disprove a three-step error estimate for the Broyden–Fletcher–Goldfarb–Shanno {(BFGS)} method with exact line searches. We construct a globally strongly convex function $F\in C^\infty(\mathbb R^3)$ and a single nonterminating trajectory $x_k\to0$ for which $\limsup_{k\to\infty}\|x_{k+3}\|/(\|x_{k+2}\|\|x_k\|)=+\infty$. The Hessian of $F$ lies between $\tfrac12 I$ and $\tfrac32 I$ everywhere, and $F(x)-\tfrac12\|x\|^2$ is compactly supported with all derivatives vanishing at $0$. The proof first constructs point-gradient pairs satisfying the exact BFGS step identities. A five-step cycle produces a large three-step quotient and restores an invariant plane for the actual updated matrix, allowing the cycle to be repeated with arbitrarily small gradient errors. Disjoint smooth corrections to a quadratic then realize all the pairs by one objective. Strong convexity identifies the prescribed points with the unique exact line-search minimizers. Thus smoothness and strong convexity do not imply the proposed product estimate, even for an objective that agrees with a quadratic to every order at its minimizer.

comments
25 pages, 1 table
fields
Optimization and Control
pdf ↗ page arXiv:2611.02719 ↗

The apportionment problem is to allocate a fixed number of seats among regions in proportion to their populations. In this paper, we propose an inverse optimization approach to evaluate how fairly an observed apportionment treats each region. It is well known that every divisor method can be formulated as a separable discrete convex minimization problem. We introduce a weighted divisor method, in which a nonnegative weight is assigned to each region, as the forward problem. Then we formulate an inverse optimization problem that finds the weight vector closest to the all-one vector in the $\ell_1$-norm such that the observed apportionment is optimal for the forward problem. We show that the optimal weight vector is always unique and has a closed-form expression as the median of three values that depend on a single parameter. Based on this result, the inverse optimization problem is reduced to a one-dimensional monotone equation, and it can be solved in $O(n \log n)$ time, where $n$ is the number of regions. We also apply the proposed approach to the apportionment of the single-member districts of the House of Representatives of Japan.

comments
21 pages
fields
Optimization and Control
pdf ↗ page arXiv:2611.02720 ↗

A staged search must decide which candidate to advance next and when to stop. Some observations only inform later decisions; others can be kept as results. We formulate these choices as a staged Pandora's box with a designated set of collectable stages. For independent finite-stage candidates with bounded readings and positive bounded own-history costs, an exact covered-call recursion gives the reservation index, the optimal value and the loss of every advance or stop; advancing an index-maximal candidate while its index exceeds the incumbent is optimal. The representation recovers classical single-stage search, nested inspection and the all-collectable Markov setting, and prices changes in the problem: enlarging the collectable set or lowering costs raises the value by an explicit covered-call overshoot. Resumption can be valuable even when future reward laws do not change, but has no value for deterministic readings. With information sharing across candidates, no rule using only their separate remaining-reading laws is universally optimal, and making an intermediate reading collectable can change which candidate is inspected first. Under a coherent joint path law with own-history costs, an approximate-planning bound controls the recomputed index's regret by changes in untouched candidates' local values; a common-component specialization bounds those changes through predictive total-variation dispersion. Exact finite-law experiments check the representation, the loss accounting and the bounds.

fields
Optimization and Control
pdf ↗ page arXiv:2611.02722 ↗

We consider a system of coupled first-order Hamilton–Jacobi–Bellman equations arising in continuous-time heterogeneous agent models with recursive utility, a class of models that has attracted increasing attention in macroeconomics. The first part of the paper establishes a comparison principle for the system when preferences exhibit early resolution of uncertainty. A key ingredient in the proof is an ordinally equivalent transformation of the recursive utility representation. In the second part, we develop semi-Lagrangian schemes and iterative algorithms for solving the associated nonlinear discrete systems. For preferences exhibiting late resolution of uncertainty, we establish a first-order error estimate for the semi-Lagrangian approximation. Numerical experiments demonstrate that the proposed methods yield results consistent with those obtained using the previously developed finite difference schemes.

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

Angle rigidity theory provides a theoretical basis for characterizing the geometric shape of graphs embedded in the plane under angle constraints, and establishing global convergence of angle-based network localization algorithms. The related references, however, are largely restricted to graphs generated by triangulation or bilateration ordering, which are sufficient but not necessary for angle rigidity. This paper addresses this challenge by focusing on establishing the equivalence between angle constraints and bearing constraints. The conditions for cycle compatible frameworks (with possibly non-generic configurations) to be angle fixable are provided. Moreover, it is shown for the first time that Laman graphs equivalently characterize minimally globally angle rigid graphs, implying that a Laman graph is the simplest graph that allows a generic embedding in the plane to be uniquely determined by subtended angles. As an application, a distributed algorithm for angle-based sensor network localization is proposed, which guarantees global convergence under a much milder network topology condition than those in the literature.

fields
Optimization and Control, Information Theory
pdf ↗ page arXiv:2611.02764 ↗

This paper introduces a reinforcement learning-based approximate dynamic programming approach to optimize the deployment of Walker-type satellite constellations under uncertainties, including launch failures and satellite malfunctions. We formulate the problem as a Markov Decision Process that incorporates low-injection orbit launches, continuous low-thrust orbit raising, and variable satellite loads. We adopt the offline approximate value iteration solution method, using linear function approximation with basis functions and action pruning strategies to substantially reduce the computational and memory requirements for finding optimal decision policies. Preliminary results demonstrate convergence to policies with low expected costs and deployment times, both of which are lower than those of a rolling-horizon baseline, showcasing a novel application of approximate dynamic programming in space logistics.

journal
3rd Conference on AI in and for Space (SPAICE 2026), European Space Agency (ESA), Oct 2026, Noordwijk, Netherlands
fields
Optimization and Control
pdf ↗ page arXiv:2611.02809 ↗

Dynamic regret measures an online learner against a moving comparator, and standard analyses assume the learner may move freely at every round. We study what happens when it may not: the learner is given a hard budget $S$ on its total movement $\sum_t \|x_t - x_{t-1}\|$. Our main result is that a movement budget creates a feasibility barrier. On a domain of diameter $D$ with $G$-Lipschitz convex losses, for every comparator path length $P_T \in [D, DT]$ we exhibit a deterministic adversary that forces $R_d = Ω(GDT)$ on every budget-feasible algorithm whenever $S \le c P_T$ for a universal constant $c>0$. This barrier is caused by the budget rather than by a volatile environment: for fixed $D$, it applies when $P_T = o(T)$, where the unconstrained minimax rate $Θ(G\sqrt{D(D+P_T)T})$ is sublinear, so the same instances are learnable with an unbounded budget and unlearnable without one. Conversely, projected online gradient descent with a budget-aware step size is budget-feasible and attains $o(GDT)$ once $S = ω(D + P_T)$. Thus the critical movement scale is $D+P_T$: linear regret is unavoidable below a sufficiently small constant multiple of $P_T$, while sublinear regret is achievable when $S/(D+P_T)\to\infty$ in the learnable regime. The construction rests on a distinction we make explicit: what makes a comparator expensive to track under a movement budget is the distance it forces the learner to travel, not its path length. Above the threshold we give a budget-dependent upper bound and identify the tight minimax rate in this region as an open problem rather than claiming a product law. Experiments support the predicted transition location and the $1/S$ decay.

comments
Accepted at NeurIPS 2026 FMTS Workshop
fields
Optimization and Control
pdf ↗ page arXiv:2611.02812 ↗

Multiproduct pipelines transport refined products to delivery stations in sequential batches, and their detailed scheduling must meet market demand while respecting nonlinear hydraulic constraints. Retaining the full hydraulic nonlinearity yields a mixed-integer nonlinear program that is computationally intractable, while the linearization commonly adopted for solver-based optimization degrades hydraulic accuracy without resolving the heavy computational burden. This paper develops an action-decoupled proximal policy optimization (PPO) framework that efficiently produces detailed schedules while preserving hydraulic fidelity. The scheduling process is cast as a semi-Markov decision process (SMDP) with flexible action durations. To handle the discrete-continuous hybrid action space, a cascaded dual-actor architecture decouples the discrete operating duration from the continuous flow decisions, eliminating the gradient interference that destabilizes conventional coupled-action policies and thereby yielding high-quality schedules far more efficiently. Validated on a real-world multiproduct pipeline in China and benchmarked against a single-actor baseline and a linearized MILP solved by Gurobi, the proposed framework achieves delivery accuracy close to the exact optimum while substantially improving flow rate stability and substantially reducing solution time.

comments
23 pages, 7 figures, 7 tables
fields
Optimization and Control
pdf ↗ page arXiv:2611.02823 ↗

In this work, we study graph splitting algorithms for feasibility problems involving closed and convex sets whose intersection may be empty. We characterize their minimal displacement vector, which is known to be the limit of the differences between successive iterates, in terms of a least-squares problem measuring disagreement between the sets according to the graph structure. We then specialize to closed affine subspaces, proving strong convergence of the shadow sequence to a solution of such a least-squares problem whenever one exists. Our analysis extends classical Douglas-Rachford results on best approximation pairs to graph splitting algorithms.

fields
Optimization and Control
pdf ↗ page arXiv:2611.02825 ↗

We show that the Frank-Wolfe method is an approximation of Broximal Gradient Descent (BroxGD), and hence of the ball-proximal method. For constrained minimization, the ball-proximal method minimizes the objective over the intersection of the feasible set with a ball around the current iterate. Linearizing the objective gives BroxGD, but the intersection can remain difficult to handle even when linear minimization over the feasible set alone is cheap. We therefore replace the intersection by a smaller copy of the feasible set, obtained by shrinking it toward the current iterate so that it lies inside the ball. Minimizing the linear model over this smaller set gives exactly Frank-Wolfe, with the shrinking factor as its step size. We examine what this approximation preserves and what it can lose. For smooth convex objectives on compact convex sets, Frank-Wolfe retains a linear-model decrease guarantee that gives it and BroxGD a common convergence proof, recovering the classical $O(1/k)$ bound. Among compact convex regions inside the ball chosen before the gradient is known, the smaller copy is the smallest that preserves the same linear-model decrease guarantee. Nevertheless, Frank-Wolfe can achieve much less linear-model decrease than BroxGD at the same radius. A simplex example illustrates the sparsity gained by restricting the region, while a family of triangles shows how Frank-Wolfe can lose the distance decrease guaranteed by BroxGD. We also give a computable test for recovering the distance guarantee and a refinement procedure that terminates after finitely many oracle calls on polytopes.

fields
Optimization and Control
pdf ↗ page arXiv:2611.02942 ↗

In receding-horizon games, self-interested players repeatedly solve a finite-horizon generalized Nash equilibrium problem (GNEP) and apply its first-stage actions. Ensuring stability of the resulting closed-loop system, however, is a challenging task that requires careful design of the players' strategies or additional constraints. We propose a stability filter that minimally modifies the variational equilibrium of the finite-horizon GNEP to enforce a prescribed decrease of a quadratic Lyapunov function. For receding-horizon games with linear dynamics, quadratic costs, and polyhedral coupling input constraints, whose associated GNEP is strongly monotone, we show that a filter always exists such that a closed-loop equilibrium exists, the filter is always feasible, does not intervene when the equilibrium already satisfies the decrease condition, and that renders the closed loop globally exponentially stable. Moreover, the filtered strategy is an $ε$-generalized Nash equilibrium, with $epsilon$ vanishing exponentially along closed-loop trajectories.

fields
Optimization and Control
pdf ↗ page arXiv:2611.02953 ↗

We study proportional-integral multiplier feedback for inequality-constrained optimization using the Fischer-Burmeister complementarity residual. We construct explicit dynamics and characterize gain-dependent stability and convergence rates. For a single active constraint, we derive exact local stability and decay-rate conditions, including a tradeoff between continuous-time convergence and discretization costs. For strongly convex objectives with affine constraints, we establish global convergence and characterize geometric conditions for uniform exponential stability. Numerical experiments compare feedback structures and computational costs.

fields
Optimization and Control
pdf ↗ page arXiv:2611.02991 ↗

This paper proposes a cooperative game-theoretical framework for the financial settlement of real-time deviations in Community-Based Local Energy Markets (CB-LEMs). The real-time settlement process is modeled as a transferable-utility cooperative game, and the resulting Real-Time Local Energy Market (RTLEM) game is shown to be superadditive and balanced. We analyze two game-theoretical allocation mechanisms, the Shapley value and the nucleolus, and evaluate their efficiency, individual rationality, coalitional rationality, and temporal-aggregation properties. We subsequently compare these mechanisms with a settlement rule based on proportional imbalance responsibility. The three mechanisms are efficient and individually rational, but only the nucleolus is guaranteed to satisfy coalitional rationality for every RTLEM instance. The proposed framework is demonstrated using real-world data from a residential energy community in Amsterdam, showing the trade-offs among the three allocation mechanisms in terms of surplus distribution, coalitional stability, interpretability, and computational requirements.

fields
Optimization and Control
pdf ↗ page arXiv:2611.03030 ↗

We study optimal consumption and investment for an investor who receives labor income until a fixed retirement date, can raise the income rate irreversibly at a constant price per unit of income flow, and cannot borrow against future income. A pathwise argument shows that no income is purchased during a final period before retirement whose length depends only on the interest rate and the price. Before this period the dual problem has two free boundaries: a lower one generated by the borrowing constraint and an upper one, at which income is purchased, that escapes to infinity as the final period begins. The analysis of this problem is our main mathematical contribution. During the final period it is a single obstacle problem, which we solve, together with the regularity of its free boundary, by established methods. Before that period a partial hodograph transformation straightens both free boundaries and turns the problem into a quasilinear parabolic equation with oblique boundary conditions on a fixed interval. Comparison principles, explicit barriers and regularity theory for quasilinear equations then give existence, uniqueness and smoothness. Transforming back and gluing the two constructions yields global regularity: both free boundaries are infinitely differentiable and the value function is a classical solution at every positive wealth level. A dual budget process verifies optimality. We also derive coupled Volterra integral equations for the free boundaries, prove exponential convergence to the perpetual problem under a scalar condition, and find numerically a purchase threshold that is U-shaped in the time to retirement.

comments
52 pages, 7 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.03076 ↗

We classify real and complex state-space models (SSMs) with linear transitions, distinguishing fixed-basis diagonal equivalence from input-output equivalence and tracking coefficient-conditioning windows under coordinate changes. We characterize diagonal equivalence through commuting transition families whose members are diagonalizable over the chosen field. With time-shared token-local matrix maps, we identify this class's state-mediated kernels with unnormalized scalar-mode linear attention with multiplicative masks. Mamba 3's multiple-input, multiple-output (MIMO) construction lifts one value per local interface; SSD-MIMO routes independent values for local retrieval rank above one. HybridMamba combines Mamba 1's per-coordinate decay, Mamba 2-style heads and Mamba 3's complex rotations and two-endpoint writes, mixing real and rotating state blocks with different decay laws. They recover Mamba 1-3 single-input, single-output (SISO) configurations as exact special cases. On five large H100 bfloat16 workloads, our fused GPU kernels improve geometric-mean training time over official Mamba 1/3 in matched SISO recoveries, with Mamba 2 near parity at SSM-core scope. Memory tradeoffs depend on the baseline and metric: saved-for-backward versus peak allocation. In small-model multi-token recall experiments, both designs outperform Mamba 1-3 on the hardest tier; higher routing ranks perform best in gated or phase-diverse configurations. In single-seed language models with about 500M parameters, both improve on Mamba 1/2 in test loss at 2B tokens, but the routing gains do not translate into lower language-model loss. Our best configurations approach Mamba 3 SISO through 10B tokens while remaining behind it and Mamba 3 MIMO in language-model loss.

comments
81 pages, 6 figures, 33 tables. Code: https://github.com/d-rochau/OrbitSSM
fields
Optimization and Control
pdf ↗ page arXiv:2611.03101 ↗

The wealth thresholds at which a household switches between renting and owning depend on its preferences, but the dates at which some owner sells or every renter buys do not. In our finite-horizon model, a household chooses consumption, a portfolio, and costly tenure changes while rents, ownership expenses, and transaction costs vary over time on announced dates. When financial markets span house-price risk, these dates are those of a deterministic minimum cost schedule for housing, discounted at the risk-adjusted housing carry and computed from a scalar reflected equation. Preferences, housing services, and labor income only locate the thresholds inside these timing windows, and house-price coefficients enter the dates only through the carry, because financial hedging offsets the exposure of the home. When owning costs at least as much as renting, the windows concern selling, and an anticipated selling surcharge closes the selling window before the surcharge peaks and keeps it closed for years afterwards. We also establish strong duality and the regularity of the thresholds and compute them by integral equations. Numerically, the windows disappear when short sales or borrowing are restricted but do not move with the preferences we vary under an uninsurable increase in the ownership cost.

comments
63 pages, 10 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.03202 ↗

Whether social influence makes a crowd wiser or more biased hinges on who yields to others and who holds firm. Such heterogeneous susceptibilities to social influence, together with the influence network, determine the weight each agent's initial estimate carries in the collective estimate, known as social power. This paper studies susceptibility optimization for maximizing the wisdom of crowds under the Friedkin-Johnsen model. Minimizing the squared collective bias over susceptibilities leads to a nonconvex problem. To overcome this nonconvexity, we develop a social power reformulation and realization framework, which decomposes the problem into two stages: first characterizing the social power that minimizes the collective bias, then determining the susceptibilities that induce such social power. Social power reformulation yields a quadratic program over the probability simplex. Under uniform-sign biases, the optimal social power concentrates on the least biased agents and immediately determines the optimal susceptibilities; under mixed-sign biases, its geometry enables a linear-time construction algorithm. For social power realization, we introduce the notions of susceptibility realizability and establish necessary and sufficient conditions for them, under which we derive all optimal susceptibilities in closed form using the Laplacian pseudoinverse and eigenvector centrality. These results yield a unified algorithm that solves the original problem globally, with worst-case complexity cubic in the number of agents when realizability holds. Finally, we develop a fully distributed implementation with linear communication complexity, illustrating how collective intelligence can emerge from local interactions.

comments
15pages, 7 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.03240 ↗

Policy iteration is a classical method for successively improving control policies in optimal control and reinforcement learning. In this paper, we propose a policy iteration framework that refines receding-horizon control (RHC) and model predictive control (MPC) policies online by iteratively updating the terminal cost. We first develop the framework for the linear quadratic regulator (LQR) problem. We show that the Riccati map is a contraction in the Thompson metric on an explicitly constructed invariant order interval. Using this property, we prove convergence of approximate policy iteration for finite-horizon RHC, where the terminal cost is given by an approximate value function. From an initial terminal cost, we then construct a robust invariant order interval within which the RHC policy is refined online. We extend the analysis to constrained MPC and present a constructive algorithm for safely updating the terminal ingredients, which guarantees recursive feasibility and asymptotic stability of the closed loop throughout the iterations. These results connect classical Riccati theory with approximate policy iteration and provide a principled pathway toward learning MPC terminal ingredients. A numerical example illustrates the proposed method.

comments
16 pages
fields
Optimization and Control
pdf ↗ page arXiv:2611.03401 ↗

We develop a variational framework for second-order, frictionless (Newtonian) dynamics in metric spaces, extending the metric theory of curves of maximal slope from gradient flows to evolutions with inertia. The construction rests on three pillars, mirroring the first-order theory. First, we introduce a class of second-order absolutely continuous curves, characterized by a geometric–variational inequality on families of tangent geodesics, and define a metric notion of acceleration. Second, we define curves of Newtonian motion as the curves achieving equality in an energy inequality involving an upper gradient–Hessian pair, which in Hilbert spaces is equivalent to Newton's equation $\ddotγ= -\nabla E(γ)$. Third, we propose a two-step predictor–corrector minimizing movement scheme and show that its discrete interpolants satisfy approximate versions of these inequalities. Under extendability and interceptor conditions on geodesics—which are satisfied, for instance, by geodesically uniformly complete, locally compact spaces with curvature bounded below—and under suitable regularity assumptions on the energy, we prove that the scheme converges, up to subsequences, to a curve of Newtonian motion. As an illustration, we recover the linear wave equation as a curve of Newtonian motion driven by the Dirichlet energy. This paper is complemented by the companion paper [Fornasier, Klemenc, Scagliotti, "A Lions Lift Framework for Gradient and Newtonian Evolutions in Wasserstein spaces"], which specifies and adapts the results to the Wasserstein metric space $(\mathcal{P}_2,W_2)$ through Lions lift, which explains Vlasov equations as Newtonian flows on spaces of probability measures.

fields
Optimization and Control
pdf ↗ page arXiv:2611.03443 ↗

As control engineering is applied to increasingly complex systems, learning-based control, which uses empirical data to reduce the reliance on first-principles models, has emerged as a promising paradigm. However, such approaches must cope with nonlinear and stochastic dynamics, the absence of state measurements, and scarce data, while ensuring safe operation under constraints, which requires rigorous uncertainty quantification. Whereas existing methods treat these challenges in isolation, this article proposes a Bayesian framework that jointly addresses them. A prior in state-space form is updated from input-output data using particle Markov chain Monte Carlo methods, yielding a representation of joint uncertainty over dynamics and latent states. Building on this representation, a validation procedure is developed that provides probabilistic guarantees for constraint satisfaction under arbitrary causal control laws. For control synthesis, a formulation penalizing the conditional value-at-risk of the constraint function is proposed, together with an adaptive calibration mechanism that adjusts the performance-robustness trade-off to achieve a desired robustness level. The probability of successful certification is characterized theoretically. The framework is extended to a receding-horizon setting, where posterior updates from new measurements allow the controller to progressively reduce uncertainty and improve performance. The approach is demonstrated on the optimal control of a vertical farm.

comments
15 pages, 4 figures, 2 tables. Submitted to Automatica. Code available at https://github.com/TUM-ITR/PosteriorScenarioPlanning.jl
fields
Optimization and Control
pdf ↗ page arXiv:2611.03466 ↗

Convexity has three equivalent descriptions: support by affine functions, monotonicity of the subdifferential, and increasing secant slopes. We weaken all three by one distortion with parameter $γ\in(0,1]$, which multiplies positive changes by $γ$ and divides negative ones by $γ$. The resulting classes are the convex functions at $γ=1$ and, for $γ<1$, are distinct and nested, with the parameter dropping by at most a square along the chain. For proper lower semicontinuous functions in these classes, the effective domain is convex, local minimizers are global, and the function is locally Lipschitz on the relative interior of its domain. The classes separate offline from online optimization over compact convex sets with efficient projection, with access to function values and bounded support vectors. A smooth member of any class can be minimized to additive accuracy $\varepsilon$ with $\mathrm{poly}(1/\varepsilon)$ first-order queries and projections. Online, with nonpositive losses and $α$-regret measured against $α$ times the best fixed point, a polynomial-time algorithm achieves $γ$-regret $O(\sqrt T)$ on the largest class. For every fixed, effectively specified $γ\in(0,1)$ and every $α\in(γ,1]$, no randomized polynomial-time algorithm has sublinear expected $α$-regret unless $\mathbf{NP}=\mathbf{RP}$, already for smooth concave polynomial losses in the smallest class, each minimized by one linear optimization. Thus, unless $\mathbf{NP}=\mathbf{RP}$, $γ$ is the exact online coefficient of each class, while the offline coefficient is one.

fields
Optimization and Control
pdf ↗ page arXiv:2611.03472 ↗

Overactuated multirotors can produce the same wrench with many rotor-speed combinations, some of which leave the vehicle unable to change its wrench quickly, e.g., to reject a gust. Readiness barriers keep this ability, the readiness, above a floor, but only in continuous time; with sampled commands and varying speed-controller delays, the available robustness bound covers less than one millisecond. We remove this limit by exploiting the structure of the problem: each rotor responds monotonically and in closed form to its own torque, so the speeds reachable under uncertain switching times lie in a cheaply computed box, and the lowest readiness over that box sits at a corner known in advance. This yields a Lipschitz-free test that a command keeps the readiness above its floor until the next sample, plus a fallback torque that keeps the vehicle on a certified plan. In hexarotor simulations with 2–40~ms delays and $\pm2$~ms jitter, the filter never violated the floor. At $10\pm2$~ms, it matched a delay-compensating predictor within the design envelope and cost 2–30\% more tracking error beyond it, where the predictor alone violated the floor in 2 to 16 of 16 missions.

comments
This work has been submitted to the IEEE for possible publication
fields
Optimization and Control
pdf ↗ page arXiv:2611.03490 ↗

We propose accelerated proximal gradient methods for composite optimization problems on the quadratic Wasserstein space of probability measures, including Kullback–Leibler divergence minimization. The objective function consists of a smooth geodesically convex functional and a possibly nonsmooth regularizer that is convex along generalized geodesics. The convexity and smoothness conditions on the smooth component are imposed only on the feasible set. As a preliminary result, we establish the equivalence between geodesic convexity of the smooth functional on the feasible set and convexity of its Hilbert-space lift on the corresponding feasible set. Assuming exact proximal steps, we prove an $O(k^{-2})$ convergence rate for the objective gap when the smooth component is geodesically convex and accelerated linear convergence when it is geodesically strongly convex. We also describe particle approximations of these algorithms.

fields
Optimization and Control
pdf ↗ page arXiv:2611.03524 ↗

Best subset selection is a central problem in statistical regression, drawing increasing attention from the broader optimization and machine learning communities. Solving the hard L0 sparsity constraint directly has been computationally challenging; as a result, most existing work proposes formulations which do not enforce the constraint, but instead use a mix of L0/L1/L2 penalties to encourage sparsity. Modern methods for solving such penalized formulations are tractable for p = 100,000, but give up direct control over sparsity. In this paper, we propose a two-stage proximal gradient descent-based approach which both enforces the sparsity constraint and incorporates L1/L2 penalties, leveraging GPUs for computational acceleration to find approximate solutions. Our method, ParaDeAl, offers the user the ability to select the problem hyperparameters, solves all configurations in parallel, and obtains solutions up to 15x faster than the best state-of-the-art CPU competitors while achieving almost identical test accuracy for the same support size for large (p > 100,000) synthetic and real-world datasets.

comments
35 pages (56 with appendices), 9 tables (20), 4 figures (6)
fields
Optimization and Control
pdf ↗ page arXiv:2611.03529 ↗

We study dynamical unbalanced optimal transport for nonlinear control-affine systems in which the control input affects both the transportation of mass and its growth or decay. This phenomenon arises naturally in controlled transport-reaction systems such as cancer treatment, and distinguishes the problem from standard unbalanced optimal transport, where transport and mass variation are typically independent. To address this problem, we combine classical relaxed-control theory with a weighted superposition principle to obtain an infinite-dimensional linear programming reformulation over weighted trajectories. Under suitable convexity and compactness assumptions, we show that this relaxation is tight. Based on the relaxation, we derive a Kantorovich dual formulation in terms of Hamilton-Jacobi-Bellman inequalities, and establish strong duality over smooth subsolutions. We then utilize the dual formulation to characterize reachability of the system, namely, when a given terminal measure is reachable from a given initial measure. In addition, tractable sufficient conditions for reachability are provided. Finally, we develop an augmented-Lagrangian algorithm based on the dual formulation for numerical computation of the optimal transport plan. The framework is illustrated on a phenotype-structured cancer treatment problem in which therapy simultaneously drives phenotypic adaptation and population growth or death.

fields
Optimization and Control
pdf ↗ page arXiv:2611.03573 ↗

Online matching with stochastic rewards is a generalization of online bipartite matching in which an attempt to match an online arrival to an offline resource may fail with some probability. Each arrival allows at most one attempt and the success probabilities of its edges are revealed when it arrives. Greedy is 0.5-competitive, which is the best possible for deterministic algorithms. While better competitive ratios are known in several special cases, beating 0.5 for arbitrary probabilities has remained open. We show that, against the adaptive offline benchmark and for arbitrary probabilities, a randomized Perturbed Greedy algorithm is at least 0.591-competitive in the unweighted setting and at least 0.531-competitive with vertex weights. The perturbation functions combine Greedy with scaled versions of the classic exponential function.

fields
Optimization and Control
pdf ↗ page arXiv:2611.03598 ↗

The feasibility pump (FP) is among the most widely used primal heuristics for mixed-integer linear programming. It alternates between rounding an LP-feasible point and projecting the rounded point back onto the feasible region of the LP relaxation. Recent pump-based heuristics compute the projection with the primal–dual hybrid gradient method (PDHG), which is scalable on modern GPUs. They pose it as a linear program, which needs auxiliary variables and constraints for general integers. Once the projection runs on the GPU, the constraint-propagation rounding (CPR) of FP~2.0 takes a large share of each iteration. For the projection, we propose PDFP, a custom first-order method that solves the pump's projection problem directly, without auxiliary primal variables or constraints. We prove that it keeps the accelerated linear rate of restarted Halpern PDHG. For the rounding, we propose a new procedure that is more efficient than CPR and, under certain assumptions, still returns a CPR rounding. It also chooses rounded values by constraint violation, which can produce feasible roundings where nearest rounding cannot. Finally, our pump runs two independent trajectories concurrently on one GPU through CPU–GPU synchronization. This exploits the variance in trajectory length and lets the pump terminate sooner on average. Computational experiments on MIPLIB~2017 instances show early, promising results: these contributions speed up the discovery of the first incumbent solution. The code is publicly available at https://github.com/MIT-Lu-Lab/PDFP.

code
github.com/MIT-Lu-Lab/PDFP repository not found
fields
Optimization and Control
pdf ↗ page arXiv:2611.03629 ↗

Semidefinite programming (SDP) is an important class of convex optimization problems with wide applications in practice. In this paper, we study a solution-selection question for first-order methods for solving SDPs: Can a first-order method provably select a strictly complementary solution when one exists, and a maximally complementary solution otherwise? We propose Triangular Log-Det PDHG (TriLog-PDHG), a primal-dual hybrid gradient method equipped with a triangular log-determinant Bregman kernel. We show that TriLog-PDHG converges to a KKT point for any fixed positive shift and to a maximally complementary solution for every sufficiently small positive shift. When a strictly complementary solution exists, the unshifted method provably selects a strictly complementary KKT point and enjoys a global linear convergence rate. Under the same condition, we further develop an averaged and adaptively restarted variant that accelerates convergence. Numerical experiments on classical examples and SDPLIB instances illustrate the complementarity-selection and convergence properties predicted by the theory.

fields
Optimization and Control
pdf ↗ page arXiv:2611.03638 ↗

Analysis of PDEs106

We investigate the partial regularity of viscosity solutions to fully nonlinear elliptic equations of the form $F(D^2u, x) = f(x)$ in previously unexplored settings: (i) When $F$ is non-differentiable with respect to $D^2u$. (ii) When either $F$ or $f$ lacks Dini continuity in $x$. In the first scenario, we introduce a tangent operator property for $F$ such that, for a fixed point $x_0$ and a given matrix $M_0$, $F(M, x_0)$ is tangential to a convex or concave operator at $M_0$. We establish partial $C^{2,α}$ regularity for equations exhibiting this property. In the second scenario, we establish new partial $W^{2, \text{VMO}}$ regularity provided that the oscillation of $F$ in $x$ under the $L^n$-norm is of order $o(\log^{-1}(1/r))$. We address the Hausdorff dimensions of the singular sets of solutions for equations of the form $F(D^2u)=f(x)$ with data $f$ in $W^{1,n}$. Additionally, we demonstrate that the tangent operator property holds for various classes of equations, including nondifferentiable twisted elliptic equations, infimum of $C^1$ equations, semiconvex equations, and piecewise differentiable equations. Finally, we tackle the issue of smooth enveloping and obtain partial regularity of solutions for three subclasses of Isaacs equations.

comments
54 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.00137 ↗

This paper studies the phase transition from an isotropic to a nematic liquid crystal driven by controlled cooling, motivated by the manufacturing of next-generation pharmaceutical drugs. Using the non-isothermal Ericksen model for liquid crystals with a variable degree of orientation, we formulate the problem as a stiff, quasilinear system of parabolic partial differential equations. We establish a consistent thermodynamic framework, prove the well-posedness of the system, and conduct a rigorous asymptotic and numerical scaling analysis of the moving phase boundary in a cylindrical cell subjected to bottom-wall convective cooling. Our analysis identifies a critical sample thickness that separates two distinct physical regimes. Below this threshold, the transition follows the cooling dynamics and the material remains quasi-isothermal. Above the thickness threshold, bulk thermal diffusion governs the dynamics, imposing a dominant thermal delay characterized by a concave quadratic propagation front. These results demonstrate that scaling from laboratory characterization to industrial production fundamentally alters the spatial thermal history of the material, providing a predictive mathematical framework to optimize cooling protocols for kinetic arrest.

comments
25 pages, 8 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.00273 ↗

The study of regularity and solvability of partial differential operators on non-compact manifolds requires the construction of adapted functional spaces. In this work we introduce $\mathcal{S}(\mathfrak{M}\times\mathbb{R}^n)$, the Schwartz space on the product of a homogeneous space $\mathfrak{M}$ and the Euclidean space $\mathbb{R}^n$. We characterize $\mathcal{S}(\mathfrak{M}\times\mathbb{R}^n)$ and its topological dual by employing discrete Fourier analysis in terms of eigenfunction expansions associated with a class of anisotropic elliptic operators on $\mathbb{R}^n$. We provide a characterization via partial Fourier coefficients and via full coefficients, that is, with respect to both components of $\mathfrak{M} \times \mathbb{R}^n$ simultaneously, which is achieved by studying the Fourier analysis on $\mathfrak{M}$. Our results provide new tools for the analysis of operators in this broader setting. As an application, we investigate the global existence and regularity of solutions for a class of partial differential equations on $\mathfrak{M}\times \mathbb{R}^n$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.00302 ↗

We study the full nonlinear mean-field Landau–Lifshitz–Bloch equation in micromagnetics arising from Garanin's spin-polarisation model [D. Garanin. Fokker-Planck and Landau-Lifshitz-Bloch equations for classical ferromagnets. Phys. Rev. B, 55 (1997)] prior to the usual near-equilibrium reduction. The equation combines a singular inverse-Langevin potential with a mobility whose longitudinal component degenerates at saturation, together with exchange, anisotropy, and the nonlocal whole-space stray field. The natural state space is the closed unit ball $|m|\leq 1$. For any $H^1$ initial data satisfying $|m_0|\leq1$, including saturated data of infinite free energy, we construct global weak solutions and derive instantaneous separation from saturation $|m|=1$. This restores uniform parabolicity and yields the thermodynamic formulation and exact energy identity for positive times. We further establish a quantitative low-temperature limit to the Landau–Lifshitz–Gilbert equation and prove convergence of global trajectories to a single equilibrium. A spectral Curie-type threshold characterises the stability of the paramagnetic state and yields exponential relaxation above the threshold. Finally, for uniformly separated data we prove strong well-posedness, including global strong solutions in one- and two-dimensional domains, and exponential stability of non-degenerate equilibria, with a small-data global theory in three dimensions.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.00365 ↗

We study the persistence of the Meissner state in the three-dimensional magnetic Ginzburg–Landau model with a spatially dependent pinning term. Factoring out the equilibrium profile associated with the pinning term reduces the problem to the analysis of a weighted Ginzburg–Landau functional. In the extreme type-II regime, we construct locally minimizing vortexless configurations for applied fields extending far beyond the first critical field. We obtain quantitative estimates showing that these configurations remain close, up to gauge transformations, to a Meissner-type state determined by a weighted London problem. We also prove the uniqueness, up to gauge transformations, of the locally minimizing Meissner-type branch within a quantitatively controlled class of local minimizers. A central difficulty is to derive elliptic estimates that remain uniform in the Ginzburg–Landau parameter in the presence of the resulting spatially dependent weight. Under a small-BMO assumption on this weight, we obtain the required regularity and extend to the three-dimensional pinned setting the metastability picture previously established for the homogeneous model.

comments
35 pages
fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2611.00398 ↗

In dimensions three and above, we establish bilinear Strichartz estimates for Schrödinger operators with potentials using perturbative arguments and Morawetz estimates. Our approach does not require smallness of the potential. As part of the analysis, we also establish endpoint versions of the bilinear Christ-Kiselev lemma.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.00454 ↗

We analyze the asymptotic behavior of several mean field games of controls. First, in the time-dependent case, we examine the behavior of solutions to discounted mean field games of controls as the discount factor $λ$ tends to infinity. Next, we study three stationary models of mean field games of controls, finding that solutions to the first-order discounted problem and the second-order ergodic problem can be obtained from solutions to the second-order discounted problem by taking $ν\to 0$ and $λ\to 0$, respectively. Finally, we investigate the long-time average behavior of solutions to the time-dependent system with no discount, finding that solutions converge to the solution to the second-order ergodic problem as $T \to \infty$.

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

We consider a coupled fractional Schrödinger system with trapping potentials under a total-mass constraint, in which both the intraspecies and the interspecies interactions are attractive. For every fractional order $s\in(0,1)$ and dimension $N\ge1$, we obtain a complete classification of the existence and non-existence of minimizers: minimizers exist if and only if both intraspecies coefficients lie below the single-component critical mass and the interspecies coupling coefficient lies below an explicit critical threshold $β^*$, and no minimizer exists otherwise. The threshold $β^*$ is characterized by means of an auxiliary intensity function, which yields a lower bound for the energy functional without invoking a new coupled Gagliardo–Nirenberg inequality. As the coupling coefficient approaches $β^*$, we analyze the concentration behavior. In the one-dimensional half-Laplacian case, the two components are shown to blow up at a common zero of the trapping potentials and, after rescaling, to converge to the same fractional ground-state profile, with the mass ratio determined explicitly by the intraspecies coefficients and the critical mass. For polynomial trapping potentials whose flattest common zero has order $q_0\in(0,1)$, the sharp blow-up rate is established, and both components concentrate simultaneously at the flattest common minimum.

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

We investigate the nonlinear stability of monotone traveling shock waves arising in the generalized Korteweg-de Vries-Burgers equation with a power-law flux, focusing on the cubic and quartic cases p=3 and p=4, respectively, in the presence of both dissipative and dispersive effects. Since shocks connecting distinct end states destroy the integrable structure of the equation, we introduce a slowly varying reference connection to establish global well-posedness for the Cauchy problem in an affine Sobolev space. A key ingredient in the stability analysis is to establish a new two-sided comparison estimate for the derivative of a monotone shock-wave profile. After a monotone coordinate transformation, this estimate allows the viscous dissipation to be compared with the natural vanishing weight arising in a shifted Poincare inequality. Together with an $L^\infty$ bootstrap controlling the higher-order relative-flux terms, this yields a global $L^2$-contraction property modulo a time-dependent shift for sufficiently small $H^1$ perturbations in the admissible parameter regimes. We obtain exponential decay of the shock profile and show asymptotic convergence to the shifted shock in $L^q(\R)$, $2<q\leq \infty$, with vanishing shift velocity.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.00595 ↗

We consider a generalized Oseen evolution operator arising from time-dependent rigid motions in 3D exterior domains. Hishida and the present author established the regularity theory of the evolution operator by use of the $L^q$-$L^r$ smoothing estimates with a weight function $(1+|x|)^α$. The objective of this paper is to develop the weighted $L^q$-$L^r$ estimates globally in time. These estimates are applied to the study of the large time behavior of the Navier-Stokes flow around a time-periodic solution in weighted spaces.

comments
41 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.00649 ↗

We study stable regular solutions of the variable-coefficient equation $-\operatorname{div}((A(x)\nabla u\cdot\nabla u)^{p/2-1}A(x)\nabla u)=f(u)$ in $B_1\subset\mathbb{R}^n$, where $p>1$, $f\in C^1(\mathbb{R})$ is nonnegative, and $A$ is a locally Lipschitz, symmetric, uniformly elliptic matrix field. We prove quantitative interior Hölder estimates for $n<p+4p/(p-1)$ when $p\ge2$, and for $n<5p$ when $1<p<2$. We also obtain interior energy estimates and higher integrability of the gradient in every dimension. These estimates are given in terms of $\|u\|_{L^1(B_1)}$, with constants depending only on $n,p$, the ellipticity bounds, and a local $L^\infty$ bound for $DA$, but not on $f$ or higher derivatives of $A$. These results extend the corresponding interior estimates of Cabré, Miraglio, and Sanchón for the $p$-Laplace equation to this variable-coefficient setting. The proof uses weighted Hessian estimates to control coefficient errors and a comparison between radial and full gradient energies.

comments
59 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.00730 ↗

In [F.P. Duda et al., Meccanica, 2021] the new theory for constituent migration in solids with microstructure was developed. We consider the one-dimensional version of the basic system of this theory with generally non-zero kinetic modulus and the particular diffusivity of the "fast diffusion" type. We obtain exact traveling wave solutions for this system, and analyze several unconstraint and constraint limiting cases. We show that in unconstraint cases of Allen-Cahn type, i.e. for two independent variables, the system demonstrates broader set of possible regimes; in the constraint limit only CH-type process remains.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.00778 ↗

Let $Ω\subset\mathbb R^n$, $n\ge3$, be a bounded uniformly convex $C^{3,γ}$ domain, where $0<γ<1$. We study the limit as the positive Robin parameter $α\to\infty$. For the $2$-Hessian torsion problem, let $U$ be the admissible Dirichlet solution. For all sufficiently large $α$, we obtain a unique admissible Robin solution $u_α$ and establish the optimal-order estimate \[ \|u_α-U\|_{C^{2,γ}(\overlineΩ)} \le Cα^{-1}. \] Moreover, $-\sqrt{-u_α}$ has a uniform positive lower bound on its Hessian, and hence $\sqrt{-u_α}$ is strictly concave. For the normalized eigenvalue problem, let $(λ_D,\varphi_D)$ be the normalized negative admissible Dirichlet eigenpair, and assume $\varphi_D\in C^{2,γ}(\overlineΩ)$. For all sufficiently large $α$, there is a unique normalized negative admissible Robin eigenpair $(λ_α,\varphi_α)$, which satisfies \[ \|\varphi_α-\varphi_D\|_{C^{2,γ}(\overlineΩ)} +|λ_α-λ_D|\le Cα^{-1}. \] The Hessian of $-\log(-\varphi_α)$ also has a uniform positive lower bound. The main analytic tool is a uniform Hölder estimate for linear Robin problems, with an $α^{-1}$ gain for $C^{2,γ}$ boundary data. A normalized augmented inverse removes the scaling kernel in the eigenvalue problem. A Schur-complement argument combines the $C^2$ convergence with boundary geometry to prove convexity up to the boundary and anisotropic Hessian lower bounds at the scale ${\rm dist}(x,\partialΩ)+α^{-1}$. The convergence rate $O(α^{-1})$ for the Robin solution functions is optimal even in $C^0$, as follows from their boundary conditions.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.00836 ↗

We study global compact finite propagation (GCFP) for the wave equation $u_{tt}=\operatorname{div}(A(x)\nabla u)$ on $\mathbb{R}^d$, that is, the property that a disturbance starting in a compact set cannot reach spatial infinity in finite time. For smooth strictly positive matrices $A$ we show that GCFP implies $\int_1^\infty a_*(r)^{-1/2}\,dr=\infty$, where $a_*(r)$ is the minimum over the sphere of radius $r$ of $\langle Aω,ω\rangle$; the proof uses the equivalence of GCFP with completeness of the Riemannian metric $A^{-1}$, of which we prove the necessary direction for the cosine family of the Friedrichs extension. We also prove that the analogous divergence condition with $a^*(r)$, the maximum over the sphere, is sufficient, and that this holds for measurable coefficients $A\in L^1_{\mathrm{loc}}$ with $A\ge I$. Finally, we construct a locally bounded measurable matrix with $a_*=a^*$ for which GCFP holds although the integral converges, so the necessary condition is not stable under the loss of continuity.

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

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 ↗

This paper establishes the time-decay rates toward the rarefaction wave and the viscous contact wave for the one-dimensional Jin–Xin relaxation system under the $L^1$ integrability condition of the initial perturbation. In the case of a strictly convex flux, we employ a decomposition method to derive a logarithmic $L^1$ estimate related to a conjecture proposed by Liu\cite{liu2001lp}. Furthermore, a time-weighted $L^2$ method yields the optimal decay rate toward the rarefaction wave. Regarding the case where the flux is partially linearly degenerate, by employing a similar \(L^1\) estimate and time-weighted \(L^2\) method, along with a refined estimate of the nonlinear wave interactions, we obtain the corresponding decay rate toward the composite wave. The decay estimates are obtained without smallness assumptions on the initial perturbations or the wave strength.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.00969 ↗

We study separation points of the nonstationary Stokes system in a half-space with zero initial data and localized boundary data $ψ(x')φ(t)\mathbf e_j$, $1\le j\le n$, where $ψ$ is supported in the closed unit ball. A separation point is a boundary point outside $\operatorname{supp}ψ$ where a component takes both signs on positive-measure sets in every sufficiently small adjoining space-time neighborhood. By evaluating the spatial convolutions appearing in the solution formula of the Stokes system via confluent hypergeometric functions, we obtain explicit formulas for the first normal derivatives of tangential components, the second normal derivative of the normal component, and tangential pressure derivatives at the boundary. For normal data, suitable Hölder regularity and strict log-concavity of $φ$ yield a unique separation point for each tangential component at every point of its coordinate axis outside the ball, and exactly two for the normal component at each sufficiently distant boundary point. We prove monotonicity and large-distance asymptotics of their temporal coordinates and quantitative temporal vanishing estimates for the normal derivatives. For tangential data in $n\ge3$, we prove the existence and uniqueness of separation points of tangential and normal components, including at fixed spatial points while $φ$ is positive. We derive spatial asymptotics at large distance and time from data moments and, under a geometric condition, supporting faces of $\operatorname{supp}ψ$. We characterize tangential pressure-gradient signs for both tangential and normal data, locating favorable and adverse regions near the boundary. For radial $ψ$, additional assumptions yield existence, uniqueness, and asymptotics of pressure-gradient zeros and zero curves, including those governed by the zero of the Caputo half-derivative of $φ$.

comments
133 pages, 13 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.00998 ↗

Global classical existence for general large data in the three-dimensional repulsive relativistic Vlasov–Poisson system has long been an open problem. We give an affirmative answer: every nonnegative $C^1$ initial datum satisfying \[ f_0(x,p)+|\nabla_{x,p}f_0(x,p)|\lesssim\langle x\rangle^{-a}\langle p\rangle^{-b},\qquad a>1,\quad b>3, \] generates a unique global classical solution. No smallness or symmetry is assumed. The result covers finite and infinite mass and energy, including infinite kinetic energy density. The power thresholds are sharp for general pure-power bounds ensuring finite density and an absolutely convergent Coulomb field. The proof rests on two new mechanisms: local energy recovery for a population selected by energy growth, and a corrected moment–action closure based on nonnegative transverse interactions. The argument also yields global classical solutions of the nonrelativistic equation in the same initial class, allowing infinite mass with polynomial velocity tails of any order $b>3$.

comments
43 pages. Comments welcome
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01004 ↗

We prove that the ground state of the mass-critical Hartree equation is unique up to phase rotations and translations and nondegenerate in every dimension $d\ge3$. This makes the recent conditional $L^2$ classification of minimal-mass blow-up and non-scattering solutions unconditional; we also give a direct $H^1$ proof of the finite-time blow-up classification. We further establish a global quadratic stability estimate for the sharp Hartree interpolation inequality. For the optimal stability constant, we rule out vanishing of minimizing sequences and describe their possible loss of compactness.

comments
49 pages, comments are welcome
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01013 ↗

This paper investigates an inverse temporal source problem for a variable-exponent time-fractional diffusion equation with time-dependent diffusion coefficients. By the perturbation method, the model is equivalently transformed into a constant-order fractional diffusion equation with a convolution perturbation term. Existence, uniqueness, and energy estimates of strong and weak solutions to the forward problem are established, and for a separable source term the uniqueness and Lipschitz stability of the temporal source function are proved using local integral observations. A numerical reconstruction algorithm combining Tikhonov regularization with the conjugate gradient method is developed with a convergence error estimate, and numerical experiments verify its effectiveness and stability for different variable-exponent functions, noise levels and source functions. Since fractional advection–diffusion models describe the turbulent transport of airborne pollutants, the method is also applicable in atmospheric science for recovering the emission history of a pollution source from sparse measurements.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01019 ↗

We prove the asymptotic stability of the least-energy harmonic map $W:\mathbb R^2\to S^2$ for the harmonic map flow under small, sufficiently decaying, non-symmetric perturbations. Solutions exist globally and are asymptotically described by a modulation of $W$ plus a remainder that converges to zero as $t\to\infty$. The modulation parameters associated with scaling, rotation, and translation remain close to their initial values and converge to finite limits. The proof relies on an inner-outer gluing decomposition and the analysis of a non-local equation governing the modulation parameters.

comments
96 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01021 ↗

The mathematical content that follows dates from 9 March 2016. I began writing it in early December 2014, whilst I was visiting Scuola Normale Superiore in Pisa, Italy. I would like to thank Luigi Ambrosio, Andrea Malchiodi, Carlo Mantegazza e Gérard Tronel who, between January 2015 and March 2016, read this version of the manuscript and some earlier drafts. Their feedback and constant support have been a source of encouragement. The manuscript has been at rest since March 2016. Neither its content nor its status will undergo changes in the future; it asks merely to be considered through the eyes of that moment. Paris, October 23, 2026, Alberto Farina

comments
The manuscript dates from 9 March 2016
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01024 ↗

We study the vanishing heat conductivity limit of radially symmetric stationary solutions to the non-isentropic compressible Navier–Stokes equations in the exterior of a ball under an inflow boundary condition. A distinctive feature of this singular limit is the formation of a far-field layer whose transition region moves toward spatial infinity as the heat conductivity tends to zero. We establish the existence and uniqueness of stationary solutions with the uniform estimates with respect to the heat conductivity and analyze the corresponding limiting problem. The limiting solution generally fails to attain the prescribed far-field density and temperature separately, although its pressure at infinity agrees with the prescribed far-field pressure. We show that this discrepancy gives rise to a far-field layer, derive its explicit representation, and identify its characteristic spatial scale. Finally, we prove that the stationary solution is uniformly approximated over the entire exterior domain by the superposition of the limiting solution and the far-field layer.

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

In this paper, planar nonisentropic vortex sheets of the two-dimensional Euler equations under the stability condition are studied via nonlinear geometric optics, focusing on the interaction induced by a small-amplitude, high-frequency incident wave impinging on a planar vortex sheet. It is found that there exist three asymmetric critical incident angles at which resonance occurs, leading to a significant amplification of the reflected and refracted oscillatory waves. Moreover, by refining the asymptotic expansion, we deduce that the leading profiles of the highly oscillatory waves are described by initial-boundary value problems for Burgers transport equations, while the leading profile of the contact discontinuity front satisfies an initial value problem for a Hamilton–Jacobi-type equation, which reduces to a forced linear transport equation on one resonant branch. These results extend the resonant amplification mechanism from the isentropic setting to the nonisentropic Euler flow and reveal the asymmetric influence of entropy variations on the nonlinear evolution of compressible vortex sheets.

comments
30 pages
fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2611.01036 ↗

We study the one-dimensional nonlinear half-wave equation with a logarithmically renormalized point interaction. The nonlinearity is focusing and cubic, which is mass-critical. We establish well-posedness in the energy space using a new method for unconditional uniqueness that requires no auxiliary Strichartz assumption. We reveal the mechanism by which the point interaction affects ground states. The free critical mass is the sharp threshold: fixed-mass ground states exist and are orbitally stable below it, whereas at and above it the constrained energy is unbounded from below. We also prove a near-critical rigidity result showing that bounded energy concentrating sequences converge to free ground states after rescaling.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01041 ↗

We review the eleven open questions in Appendix H of Farina's manuscript on entire solutions of the Allen-Cahn equation (dated March 9, 2016).

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01088 ↗

We study attainment of the best constant in \begin{equation*} \int_{\mathbb R^{m+n}} \bigl(|\nabla_xu|^2+|x|^2|\nabla_yu|^2+a|u|^2\bigr) \geq S_a\left(\int_{\mathbb R^{m+n}} (1+|x|^2)^{n/(Q-2)}|u|^q\right)^{2/q}, \end{equation*} where \(m,n\geq1\), \(Q=m+2n\), \(q=2Q/(Q-2)\), and \(a>0\). Using annular interpolation and a transverse-average recurrence with \(L^q\) contraction \(2^{-m/q}\), we decompose bounded sequences into finite, Grushin and Euclidean profiles. Energy and critical mass split, with a power bound in the number of profiles on the remaining mass. We prove compactness of normalized minimizing sequences modulo \(y\)-translations under \(S_a<\min\{S_G,a^{n/Q}S_E(1)\}\), where \(S_G\) and \(S_E(1)\) are the tangent constants. The strict-binding set is empty or an open interval; we prove nonemptiness for \(n=1\) and even \(m\geq6\). At finite positive endpoints of a nonempty binding interval, we characterize attainment by first-order binding gaps. We obtain a finite critical-profile decomposition of Palais–Smale sequences with a remainder vanishing in energy.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01094 ↗

We study viscous, non-resistive magnetohydrodynamics on $\mathbb R^d$, $d\in\{2,3\}$. For every fixed magnetic exponent $s>d/2$ and every velocity exponent $q<s-1$, we prove norm inflation at the origin in $H^q\times H^s$. Arbitrarily small divergence-free Schwartz data generate classical solutions whose magnetic $H^s$ norm becomes arbitrarily large at arbitrarily small positive times, while the velocity remains arbitrarily small in $H^q$ throughout the observation interval. Together with endpoint local well-posedness, this identifies $q=s-1$ as the sharp lower velocity threshold for fixed $s>d/2$. The construction uses a symmetric pair of high-frequency velocity packets and a fixed low-frequency magnetic profile. A Fourier component of their stretching interaction has a fixed sign and gains the power $K^{s-1-q}$ on a short diffusive time scale. Subtracting an exact reference flow and using endpoint Besov estimates controls the full nonlinear remainder. Quantitative higher-order estimates ensure existence through the observation time and yield the uniform smallness of the velocity in the target norm.

comments
This is a readable PDE research paper generated by ChatGPT under the author's guidance
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01124 ↗

For PDE systems in three spatial dimensions, firstly, a review of the various types of global conservation laws --- volumetric, surface-flux, circulatory --- is given using vector calculus, and their corresponding local forms --- divergence, curl, gradient --- are explained. Secondly, an extension of each type of conservation law to moving domains is presented, where the domain --- volume, surface, curve --- is transported by a prescribed velocity field. This provides a generalization of Reynolds' transport theorem known for material domains in which the velocity field is the fluid velocity. The main results are illustrated by numerous physical examples taken from gas dynamics, fluid flow, nonlinear acoustics, chemotaxis, plasma dynamics, and also Maxwell's equations, which do not involve any physically specified velocity field. As an additional main result, an extension of the multiplier method for finding local conservation laws of divergence-type is presented for local curl-type and gradient-type conservation laws on both static and moving domains.

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

These notes cover the material of two courses given at SISSA, Trieste, in the academic years 2023-2024 and 2025-2026, together with some material from courses taught in other recent years. The original idea behind these courses emerged from conversations with Andrea Causin and Margherita Solci about the somewhat elusive notion of `multiscale behaviour', which arises in the study of variational problems involving one or more small parameters. Two main mechanisms govern their asymptotic behaviour: concentration and oscillations. Their description is often associated with the emergence of a characteristic `scale', quantifying either the speed of concentration or the period of an optimal oscillation. These mechanisms may originate from different variational principles and may occur separately, coexist, compete, or interact, thus providing a natural interpretation of the term `multiscale'. This perspective inspired the informal title of the courses, which also became the title of these notes. The natural framework for these analyses is $Γ$-convergence. However, these notes are not intended as a general introduction to this now well-established theory. We provide only a brief account of the techniques relevant to our purposes, referring the reader to the author's book chapter {\em A Handbook of $Γ$-convergence}. For a broader introduction to $Γ$-convergence, and in particular to its topological properties, the standard reference is Dal Maso's monograph {\em An Introduction to $Γ$-convergence}.

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

Classical Stein–Tomas restriction controls a Fourier transform on a curved surface, but the estimate changes when its values lie in a Banach space. We determine the sharp Lorentz threshold at the critical exponent $4/3$: for coefficients in $\ell_D^{4/3,q}$, the optimal Gaussian restriction constant grows like $(1+\log D)^{|3/4-1/q|}$. A multiscale wave-packet construction proves sharpness, including the delicate index $q=2$. The same threshold holds for fractional Gaussian noise, while Gaussian type and cotype alone do not distinguish the positive and negative cases. As a dispersive consequence, we establish a sharp Lorentz-channel spacetime estimate for linear capillary waves.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01232 ↗

The method of $a$-contraction with shifts builds on the relative entropy method of Dafermos and DiPerna and allows both viscous shocks and rarefaction waves to be studied directly at the level of the solution. This unified framework led to the resolution of Matsumura's long-standing conjecture on the time-asymptotic stability of a viscous shock in composition with a rarefaction. Kang, Vasseur, and Wang established this stability for the one-dimensional compressible barotropic Navier-Stokes system. Their result was subsequently extended to composite planar waves for general $n\times n$ viscous systems in arbitrary spatial dimensions. The present paper is a companion to that work. Here we prove the estimates on viscous shock profiles needed to apply $a$-contraction with shifts, including derivative estimates that go beyond the standard bounds. We also give a streamlined account of the main ideas of the method by focusing on a single viscous shock for a general one-dimensional system.

comments
24 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01258 ↗

For the Baouendi-Grushin operator $\mathscr L_γ= Δ_x + |x|^{2γ}Δ_y$ in $\R^{m+k}$, with $γ>0$, we prove that the time integral of the heat kernel with pole at the origin equals $C_{γ,Q}\, N_γ^{2-Q}$, where $N_γ$ is the gauge and $Q$ the homogeneous dimension. When $γ\not=1$ no closed form of the heat kernel is known. After a partial Fourier transform in $y$, the time integral of the heat kernel becomes the Green function of an anharmonic oscillator, which solves a generalized modified Bessel equation, and the gauge appears when the inverse Fourier transform is computed as a Hankel transform. In particular, the heat flow provides a new proof that $C_{γ,Q}\, N_γ^{2-Q}$ is a fundamental solution of $-\mathscr L_γ$ with pole at the origin.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01336 ↗

We establish cases of equality for the Polya-Szego inequality of the logarithmic p-Laplacian.

comments
All comments are welcome
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01366 ↗

We consider the reduced Bresse–Gurtin–Pipkin system with one temperature, obtained from the full Bresse–Gurtin–Pipkin thermoelastic beam system by neglecting one of the two temperature variables. This system was left essentially open in a recent work of Dell'Oro, where only a conjecture on its exponential stability condition was formulated. By combining the spectral analysis recently developed by Dell'Oro, Pata and Vasylyeva for the abstract Gurtin–Pipkin heat equation with the resolvent estimate framework of Dell'Oro for Bresse systems, we prove that the associated contraction semigroup is exponentially stable if and only if two explicit stability numbers, depending on the structural constants of the beam, both vanish. The proof is based on a spectral characterization of the infinitesimal generator in a half-plane containing the imaginary axis, an analysis of its spectrum on the imaginary axis, sharp upper bounds for the resolvent, and the Gearhart–Prüss theorem. In particular, we confirm the conjecture of Dell'Oro and provide a rigorous spectral analysis of the reduced system. The same method yields the exponential stability characterization of the corresponding reduced Bresse–Maxwell–Cattaneo system, and can be adapted to other reduced Bresse-type models.

comments
39
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01381 ↗

We study how the global attractor of a dissipative evolution equation with memory depends on the memory kernel when the kernel concentrates, while preserving its total mass, towards a Dirac mass at the origin. The mass-preserving rescaling is the structural feature that prevents the effective elastic coefficients from degenerating in the limit, so that the memory-dependent dynamics reduces formally to a memoryless damped system with unchanged elastic coefficients. For a coupled nonlinear suspension bridge system with past history, taken as a concrete model, we establish uniform-in-parameter dissipativity and uniform-in-parameter exponential stability of the associated linear semigroup. These uniform estimates yield uniform quasi-stability, uniform exponential attraction, finite-time convergence of the semigroups, and uniform Hölder continuity with respect to the perturbation parameter. We deduce upper semicontinuity of the global attractors, and, under an additional structural stability hypothesis on the limit attractor, lower semicontinuity as well. The analysis separates the general continuity mechanism, which applies to a broad class of memory kernels and dissipative systems, from the model-specific verification, which exploits the coupled bridge structure.

comments
35
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01388 ↗

We prove a logarithmic Sobolev inequality for the massive two-dimensional sine-Gordon model throughout the subcritical range $0<β<8π$. For fixed mass, volume and arbitrary real coupling, the constant has a positive lower bound independent of the lattice spacing. When the dimensionless coupling is small, the lower bound is also uniform in volume and approaches the Gaussian constant as the coupling tends to zero. This extends the known range $β<6π$ and gives a rate of entropy decay for the reversible Langevin dynamics that remains positive as the cutoff is removed. The proof follows the Polchinski flow to a positive physical scale, where the Hamiltonian is a bounded perturbation of a uniformly convex one. For interactions invariant under constant field shifts, spatial differences bound their curvature by the gradient energy. For the oscillating part, we compare Gaussian integration with an average in which the original cosine phase fluctuates independently of the remaining variables. We estimate the comparison error at an intermediate scale, then differentiate the remaining Gaussian density. This preserves both phase damping and spatial decay without assuming bounds on second derivatives of the incoming local terms. The resulting strict gain between scales closes the estimates for every fixed $β<8π$.

comments
27 pg
fields
Analysis of PDEs, Probability
pdf ↗ page arXiv:2611.01403 ↗

We establish quantitative $L^1$ instability for the two-dimensional Navier–Stokes equations near a self-similar three-vortex collapse as viscosity tends to zero. For every $0<γ<\frac12$ and $t_0\in(0,1)$, we construct solutions that are $O(ν^{1-γ})$-close in $L^1(\mathbb{R}^2)$ at $t_0$ but exhibit order-one $L^1$ separation in a shrinking neighborhood of the collapse point at times approaching collapse as $ν\to0$. By time translation, we also obtain pairs of solutions with initial $L^1$ distance $O(ν^{1-γ})$ that develop order-one separation at a fixed positive time. In both constructions, the solutions have the same viscosity and total circulation and are uniformly bounded in $L^1(\mathbb{R}^2)$. The proof exploits the amplification of small time delays, the fast speed of the vortex centers near collapse, together with sharp inviscid approximation estimates for the Navier–Stokes equations established in~\cite{Ga11,NguyenCollapse}.

comments
20 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01433 ↗

For 3-D quadratic quasilinear wave equations in exterior domains with homogeneous Dirichlet boundary conditions and small initial data of size $\varepsilon>0$, the authors of two papers [M. Keel, H. Smith, C.D. Sogge, Amer. J. Math. 122 (2000), no. 4, 805-842; J. Amer. Math. Soc. 17 (2004), no. 1, 109-153] have shown that the lifespan ${\bar T}_{\varepsilon}$ of smooth solutions satisfies ${\bar T}_{\varepsilon}=\infty$ or ${\bar T}_{\varepsilon}\ge e^{C/\varepsilon}$, depending on whether the null condition holds or not, respectively. However, for the corresponding 2-D problem in exterior domains, it remains a difficult and unsolved problem to determine the precise lifespan $T_{\varepsilon}$ of smooth solutions. In our previous papers, we have established that $T_{\varepsilon}=\infty$ holds when both the first and second null conditions are satisfied; and that $T_{\varepsilon}\ge\frac{C}{\varepsilon^2}$ holds when the first null condition is violated. In this paper, we will prove $T_{\varepsilon}\ge e^{C/\varepsilon^2}$ when the first null condition holds but the second null condition is violated. Combining these results, we have systematically established sharp estimates for the lifespan $T_{\varepsilon}$ of 2-D quadratic quasilinear wave equations in exterior domains with homogeneous Dirichlet boundary conditions. Moreover, our series of results for quasilinear wave equations in 2-D exterior domains are consistent with the corresponding results for the classical Cauchy problem.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01471 ↗

We establish the long-time behavior of solutions $U$ to first-order Hamilton-Jacobi equations in the Wasserstein space $\mathcal{P}_2(\mathbb T^d)$. For a class of Hamiltonians with quadratic growth, including non-convex ones, we prove that there exist a unique ergodic constant $λ$ and a solution $V$ of the associated ergodic problem such that $U(t,m)-λt$ converges to $V(m)$, uniformly on $\mathcal{P}_2(\mathbb T^d)$, as $t\to+\infty$. Finally, we provide applications to mean field control problems and zero-sum differential games.

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

We study radial solutions of the planar scalar field equation $$ -Δu+u=λu\,e^{u^2}, \qquad 0<λ<1, $$ whose nonlinearity has critical Trudinger–Moser growth. These solutions describe standing waves of the two-dimensional nonlinear Schrödinger and Klein–Gordon equations. Motivated by Tang's recent uniqueness result for radial bound states with power nonlinearities in higher dimensions, we investigate the validity of the corresponding uniqueness theory at critical exponential growth. We show that the Serrin–Tang criterion and two structural hypotheses in Tang's analysis fail in this setting. We establish a pairing principle for the shooting problem, prove that Tang's variation conditions force the nodal count to be non-decreasing, and show that any two radial ground states intersect. We also derive a second-order expansion of the Liouville bubble arising at large initial heights and compute the corresponding flux correction. These asymptotics yield formal predictions for the first zero and the nodal structure at large heights. Our results suggest that the ground state is unique, whereas nodal radial bound states, if they exist, occur in pairs, contrary to the uniqueness phenomenon for power nonlinearities.

fields
Analysis of PDEs, Functional Analysis
pdf ↗ page arXiv:2611.01575 ↗

Under suitable spatial decay assumptions on the initial data, we establish precise asymptotic expansions of the velocity and magnetic fields for two-dimensional incompressible MHD flows at each positive time. We identify in the far-field profile the hexagonal pattern previously discovered for the 2D Navier-Stokes equations by L. Brandolese \cite{Bra22}, characterized by six equally spaced directions of faster decay for each component of $u(x,t)-u_0(x)$. Surprisingly, the corresponding contribution to the magnetic field vanishes identically, owing to an exact cancellation associated with the antisymmetric structure of the magnetic nonlinearity. Thus, at order $|x|^{-3}$, the hexagonal structure appears only in the velocity field.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01579 ↗

We develop an axiomatic approach to the boundary Harnack principle on diameter-uniform domains in proper doubling metric measure spaces. Under critical-density and upper-contraction assumptions, we establish a scale-invariant one-sided boundary comparison between nonnegative supersolutions and positive solutions and Hölder continuity of quotients of positive solutions. Our framework does not require linearity or rectifiable curves. Applications include classical elliptic equations, spectral fractional Laplacians, harmonic functions on fractals, and Pucci operators.

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

We study the equivariant Chern–Simons gauged Landau–Lifshitz equation in $\mathbb R^2$. For equivariance index $m\ge2$ and a potential $V\in C^{3,1}([0,2])$ satisfying $V(0)=V'(0)=0$, we first establish local well-posedness for the Cauchy problem at the $H^2$ level, with the sphere constraint written in the natural affine space $u-\vec n\in H^2$. For nonnegative $V$ we then consider an $m$--equivariant ground state of $H_ω=E+ωM$, $ω>0$. Under a constrained nondegeneracy condition for the polar Hessian, the conserved energy and mass give orbital stability in $H^1$. A Gustafson–Shatah type continuation argument, in which the Chern–Simons feedback is treated as a tame nonlocal zeroth-order perturbation, upgrades this conditional stability to global $H^2$ existence for all $H^2$ initial data sufficiently close to the ground state orbit in $H^1$. For the quadratic potential we also verify the nondegeneracy condition in a nonempty interior near-BPS regime approaching the self-dual point $(κ,ω)=(1,0)$. This yields a concrete family of globally defined orbitally stable ground states.

comments
80 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01596 ↗

We establish a logarithmic Sobolev inequality for complete $C^{1,1}$ immersed submanifolds of dimension $m\ge2$ in Cartan–Hadamard manifolds with sectional curvature at most $-b^2$. The inequality retains the Euclidean sharp constant after subtraction of $(m-1)^2b^2$ from the Fisher and mean-curvature energy; this coefficient is maximal for a lower bound uniform over $b\ge0$. For immersed surfaces, we prove both a finite-domain critical exponential inequality and a global Ruf-type inequality with a positive $L^2$ term. Both have potential $|H|^2-b^2$, exponent $16π$ and an absolute multiplicative constant, and follow from one geometric heat-kernel comparison. The exponent and curvature coefficient are optimal. We classify Gaussian equality in the logarithmic inequality and geometric equality in the higher-dimensional Nash consequence. All inequality constants are independent of the codimension.

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

In this work we address a class of Mean-Field Game (MFG) systems on the flat torus $\mathbb{T}^{d}$ in which individual agent incentives arise from macroscopic, distribution-dependent objectives governed by the Wasserstein-2 ($W_{2}$) distance. Taking the first variation (Lions derivative) of the Wasserstein-based macroscopic functional yields a coupled forward-backward system of Hamilton–Jacobi–Bellman (HJB) and Fokker–Planck (FP) equations featuring a nonlocal coupling driven by the Kantorovich optimal transport potential. As a primary case study, we formulate a large-scale attacker-defender attrition model aimed at protecting High-Value Units (HVUs). By defining population-wise attrition rates via the $W_{2}$ metric and casting the defense strategy as a Pareto-optimal McKean–Vlasov control problem, we derive a concrete HJB–FP system with a Kantorovich potential coupling. We prove the local-in-time existence of classical solutions for this system using Schauder's fixed-point theorem. Finally, we compute the MFG dynamics by combining the Sinkhorn algorithm with ResNet-based Physics-Informed Neural Networks (PINNs), and simulate two-dimensional attacker-defender engagements across diverse attrition parameters, control costs, and multi-HVU configurations.

comments
43 pages, 12 Figures, Keywords: Mean-Field Games, Optimal Transport, Kantorovich Potential, Wasserstein Distance, Attrition Models, Physics-Informed Neural Networks
fields
Analysis of PDEs, Optimization and Control
pdf ↗ page arXiv:2611.01616 ↗

On every unit-volume flat complex three-torus, we construct a solution of the volume-preserving conformal Chern–Calabi flow with a finite-time Chern Type-I singularity at any prescribed point. The full spatial supremum has an exact asymptotic coefficient, and prescribed rescalings converge to a complete nonflat radial shrinking solution. The positive part of Chern scalar curvature can remain arbitrarily small throughout the flow, as can each prescribed subcritical spatial curvature norm. We determine the punctured terminal metric, its one-point completion and unique nonflat tangent cone, and the terminal energy asymptotics. We also exclude Chern Type-II under a logarithmically improved critical weak $L^3$ bound on Chern scalar curvature, and prove a separate scale-invariant integral criterion involving first Chern–Ricci curvature. The constructed singular solutions satisfy both criteria.

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

Building on finite-time convergence results for geometric matrix hydrodynamics, we establish global spectral exactness for Zeitlin's approximation of the two-dimensional Euler equation on the sphere linearized about polynomial zonal vorticities. By separating each azimuthal block into a skew-adjoint transport operator and a compact perturbation, we obtain a dimension-uniform estimate $\|K_N-K\|=O(N^{-1})$ and the sharper fixed-block estimate $\|K_{N,m}-K_m\|=O(N^{-2})$. These bounds, together with strong-resolvent convergence of transport, yield exact approximation of the isolated spectrum off the imaginary axis: algebraic multiplicities are preserved, Riesz projections converge in norm, and spurious off-axis spectral limits are excluded. Every algebraically simple off-axis eigenvalue has an $O(N^{-2})$ approximation error. For eigenvalues of higher multiplicity we establish second-order convergence of arithmetic means of eigenvalue clusters and $O(N^{-2/α})$ individual eigenvalue bounds, where $α$ is the maximal Jordan-block size. For any prescribed positive growth margin, the numbers of unstable and stable eigenvalues beyond that margin are eventually correct. The argument combines an exact matrix-harmonic coordinate recurrence, uniform bounds for high azimuthal modes, and resolvent factorizations involving compact operators. An explicit degree-three zonal equilibrium has a rigorously enclosed simple unstable eigenvalue, providing a concrete instance of the quantitative theory.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01664 ↗

In this paper, we study generalized principal eigenvalues of the spatially periodic cooperative nonlocal operator $\mathcal{L}\boldsymbol{\varphi}=\mathcal{J}*\boldsymbol{\varphi} -\boldsymbol{\varphi}+A(x)\boldsymbol{\varphi}$ and their applications to noncooperative KPP systems. In the periodic setting, we characterize the existence of a classical principal eigenvalue and explicitly construct and classify Radon measure solutions to the associated eigenproblem when a positive continuous principal eigenfunction does not exist. On the whole space, we consider two notions of generalized principal eigenvalues defined through positive test functions and characterize them through a family of weighted periodic spectral values and Dirichlet approximations. For large spatial periods, we identify the spectral limits through a scalar Hamilton–Jacobi cell problem and, under additional assumptions, derive leading-order corrections and eigenfunction concentration results. For small spatial periods, we characterize the limits by an averaged operator and obtain refined expansions for specific classes of kernels, including formulas for the difference between the two whole-space generalized principal eigenvalues. Finally, we apply the spectral theory to establish extinction and persistence criteria for the associated noncooperative KPP systems, characterize spreading speeds along rays by a Freidlin–Gärtner-type formula, and study their asymptotic behavior as the spatial period tends to infinity or zero.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01667 ↗

We study charged-particle dynamics under a non-Lipschitz velocity-dependent force with magnetic and damping effects, focusing on continuation through zero velocity and chaos in the velocity direction. For a time-independent directional force and fixed parameters, we introduce a $C^1$ regularization. When an unregularized trajectory reaches zero velocity in finite time, inner rescaling yields convergence to a reference orbit within the regularization ball, while the regularized trajectories converge locally uniformly outside it to a unique continuation. For the directional dynamics, stereographic projection yields a parameterized Euclidean system. By choosing the skew-symmetric magnetic part, we obtain a nonautonomous parameterized center manifold reduction with a prescribed finite Taylor jet. Under an additional factorization assumption, the reduced dynamics admits Shilnikov homoclinic orbits and associated chaos.

fields
Analysis of PDEs, Dynamical Systems
pdf ↗ page arXiv:2611.01699 ↗

In this paper we consider the problem of identifying the bottom-boundary of an ocean basin, particularly in the coastal region where shallow-water theory applies. In particular we develop an observer-based approach of identifying the bottom-boundary profile from measurements of the free-surface. In particular, we prove that the true profile can be obtained by minimising the long-time observation-error as computed from the observer equations associated with a class of linear dispersive shallow water-wave models. We provide an explicit easy-to-implement observer design guaranteeing convergence. Numerical simulations indicate the same optimisation problem can recover the true profile for the nonlinear versions of same dispersive water-wave models.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01738 ↗

We consider solutions $u, v:Ω\rightarrow\mathbb{R}^{N}$ of the Euler-Lagrange equations associated to the variational integral $\int_Ωf(\nabla u)dx$, where $Ω$ is an exterior domain in $\mathbb{R}^{2}$ e.g., the complement of a disk or a half plane, and the density $f$ is of linear growth. Among other things we show that $u|_{\partialΩ}=v|_{\partialΩ}$ together with the boundedness of $u-v$ yields that $u=v$ on the entire domain.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01780 ↗

We mainly consider entire solutions $u: \mathbb{R}^2 \rightarrow \mathbb{R}$ of the Euler -- Lagrange equation for a variational integral with density $g(|\nabla u|)$ of linear growth. Assuming a Lehto-type condition at infinity, we show that either $\nabla u$ is a constant vector or the image of $\nabla u$ is the whole plane with the possible exception of at most one point. This result is extended to certain energy densities of nearly linear growth. Moreover, we slightly generalize the Bernstein result of Moser.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01784 ↗

We construct global weak solutions to the isentropic compressible Navier-Stokes and Navier-Stokes-Poisson systems in the unit disk under no-slip boundary conditions, allowing vacuum and unbounded densities for sufficiently small initial energy. Such solutions particularly possess uniform $L^{q_0}$ density bounds for some $q_0>4γ$, beyond the natural energy class. Our analysis combines Green function representations with the mean-value property of harmonic functions to isolate a pressure-generated harmonic component of the effective viscous flux and obtain a purely interior potential representation valid for both systems. These results complement Perepelitsa's half-space theory (Arch. Ration. Mech. Anal. 212 (2014), pp. 709-726) and our recent half-plane work (arXiv:2601.11852, 2026), treating bounded-domain geometry and Poisson coupling with nonnegative initial density.

comments
24 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01792 ↗

We study Fisher-KPP equations on regular trees with reactions periodic in a Busemann coordinate or in distance from a vertex or a bi-infinite geodesic. For nonzero finitely supported data, we characterize the spectral threshold between uniform extinction and persistence, including critical extinction. We establish Bramson corrections for Busemann step data at positive, zero and negative speeds and, above the periodic extinction threshold, for the largest Busemann coordinate and radial level positions of finitely supported solutions. When the periodic spectral minimum is nonpositive but the geodesic spectral threshold is positive, we construct a smallest positive stationary solution with exponential transverse decay, prove uniqueness under an exponential bound, and determine longitudinal spreading with its logarithmic correction. We also classify positive stationary solutions depending only on distance from the geodesic and prove existence and stability results for moving and stationary fronts.

comments
171 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01842 ↗

The global boundedness problem for three-dimensional chemotaxis-fluid systems with nonlinear diffusion presents substantial analytical challenges, particularly in the near-linear diffusion regime. Indeed, the porous-medium and p-Laplacian diffusion operators approach the classical Laplacian as $m\searrow1$ and $p\searrow2$, and the extra a priori control afforded by nonlinear structures becomes increasingly difficult to exploit. This difficulty is reflected in the porous-medium setting, where establishing boundedness throughout $m>1$ required a sequence of substantial developments spanning more than a decade (2010-2024). For the p-Laplacian case, despite significant progress, the problem remained open in the near-linear range $2<p\le p^*(\approx2.01)$, due to the saturation of classical Moser-type iterations as $p\searrow2$. In this paper, we establish global bounded strong solutions for a three-dimensional chemotaxis-Stokes system with p-Laplacian slow diffusion and signal consumption. Our approach departs from the conventional $L^q$-iteration framework and develops a weighted energy method that directly exploits the coercive structure of the nonlinear diffusion operator. A weighted Rellich identity yields density estimates. To control the resulting boundary contribution on general smooth domains, we first use tangential differentiation along the boundary to lower its order, and then apply a trace-embedding estimate. Combined with a high-gradient/low-gradient decomposition, these estimates allow us to control the mixed chemotactic terms and close the coupled estimates for the density, signal, and fluid. The resulting estimates hold throughout $2<p\le 3$, thereby resolving the previously open range $2<p\le p^*$. Together with existing results for $p>p^*$, our work establishes boundedness throughout the entire slow-diffusion range $p>2$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01847 ↗

We study the long-time behavior of solutions to the Korteweg-de Vries equation on a Y-junction, a metric graph consisting of one incoming and two outgoing half-lines joined at a vertex. We first identify vertex conditions of separating-derivative type, together with a balance between the nonlinear coefficients and the coupling parameters, under which the problem is globally well-posed in $L^2$ for arbitrarily large data. This regime coincides with the one in which the explicit solitary waves of the junction, recently constructed by Mugnolo, Noja and Seifert (2025), exist. Using virial inequalities in the spirit of Muñoz and Ponce (2019), we then establish decay, in the sense of liminf, of the $L^2$ norm of the solution in time-dependent regions far from the solitons. In the strongly dominated linear region, which moves away from the vertex, the three edges decouple and the decay holds for every admissible choice of parameters. In the weakly dominated linear region, which stays close to the vertex, the topology of the graph produces boundary contributions at the vertex, and the decay is obtained under an algebraic condition on the coupling parameters that makes these contributions cancel. Finally, we discuss adaptations to general star graphs.

comments
22 pages, 4 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01856 ↗

In this paper, we study the endpoint regularity of weak solutions to the inhomogeneous Rivière system $$ -Δu=Ω\cdot\nabla u+f \qquad\text{in }B_1\subset\mathbb R^2, $$ with an antisymmetric potential $Ω\in L^2$ and a local Hardy drift term $f\in h^1$. We construct a continuous solution in $W_0^{1,2}$, which fails to belong to $W^{2,1}$ in every neighborhood of the origin, even when $\|Ω\|_{L^2}$ is arbitrarily small. Smooth truncations further show that the corresponding uniform interior $W^{2,1}$ estimate fails even for smooth solutions and coefficients. Thus, the $L\log L$ assumption ensuring local $W^{2,1}$ regularity cannot in general be replaced by componentwise local Hardy data.

comments
13 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01877 ↗

We study singularities, cut loci and controllability for time-dependent contact Hamilton–Jacobi equations. A contact version of Arnaud's theorem identifies the superdifferential graph of an evolved profile with the contact Hamiltonian image of the differential graph of its positive Lax–Oleinik regularization. This representation defines intrinsic singular characteristics and determines their initial velocity through a minimum-energy selection on the space-time superdifferential. The curves are continuous and locally $1/2$-Hölder, but they need not be locally Lipschitz. The exponent $1/2$ is optimal even for a quadratic Hamiltonian. The intrinsic characteristic issued from a cut point is singular at every later time in the short-time interval. We also establish the contact Lax–Oleinik commutator identities, which identify the superlevel and sublevel sets of the cut time with the corresponding terminal momentum graphs through bi-Lipschitz maps. For reachable terminal data we characterize the associated calibrated sets, and we describe all continuous initial data that reach a prescribed semiconcave profile. The proofs use Herglotz' variational principle and short-time estimates for contact fundamental solutions.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01911 ↗

This paper addresses the global existence and large-time decay of solutions to the two-dimensional compressible Prandtl equations in Sobolev spaces. We study small perturbations around a monotone shear flow and establish global weighted Sobolev estimates together with precise time-decay rates for the solutions. The main difficulties are that the normal velocity causes a loss of one tangential derivative, the variable density gives rise to nonstandard boundary and shear-flow coupling terms, and the global-in-time argument requires sufficiently strong decay to close the time-weighted energy estimates. To overcome these difficulties, we combine the cancellation method introduced by Masmoudi and Wong~\cite{MW2015} with the good-quantity approach developed by Paicu and Zhang~\cite{PZ2021}, together with weighted shear-flow estimates and a careful treatment of the natural boundary structure. Under suitable assumptions on the density perturbation, the shear flow, and the function $f(t)$ describing the outer tangential flow, we prove the global-in-time well-posedness of solutions in weighted Sobolev spaces. In this sense, the present result may be viewed as a Sobolev-space counterpart of the recent analytic-framework result obtained by Chen, Huang and Li (J. Funct. Anal. 286 (2024), 110322)~\cite{CHL2024} for the two-dimensional compressible Prandtl-type equations, while requiring a weaker time-decay assumption on the density perturbation.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01925 ↗

While the asymptotic stability of rarefaction waves for the compressible Navier–Stokes equations has been well established since the pioneering works of Matsumura–Nishihara \cite{MatsumuraNishihara1986} and Liu–Xin \cite{LiuXin1988}, the classical $L^2$ energy method yields only qualitative convergence in $L^\infty(\R)$ as $t\to\infty$ without any explicit decay rate. In this paper, we establish for the first time a standalone \(L^4\) energy estimate for perturbations of a weak rarefaction wave in the one-dimensional isentropic compressible Navier–Stokes system, thereby obtaining the first explicit algebraic time-decay rates for this model. Specifically, for small initial perturbations in $H^2(\R)$ and small wave strength $δ$, we prove that $(v-V,u-U)$ decays in $L^4(\R)$ at the rate \[ \|(v-V,u-U)(t)\|_{L^4}\le C\bigl(\|(v_0-V(0),u_0-U(0))\|_{H^2}+\sqrtδ\bigr)(1+t)^{-1/8}, \] where \((V,U)\) denotes the smooth rarefaction wave, while the relative Riemann invariants \(z_\pm\) of the perturbed system decay in \(L^\infty(\R)\) at the rate \((1+t)^{-1/6}\). The proof relies on a new local quartic energy estimate for \(z_\pm\) and \(z_\pm-Q\), where \(Q=μ(v)v_x-μ(V)V_x\), as well as a nonlocal half-space wave-interaction functional for corrected characteristic modes and a weighted higher-order derivative energy estimate coupled at the scale of the one-dimensional Nash inequality.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.01956 ↗

The Lane-Emden system is an important model case of Hamitonian elliptic systems. We here consider the zero-Dirichlet problem in a half-space for arbitrary powers $p,q\ge1$. We prove that any nonnegative classical solution that is nondecreasing in the normal direction is necessarily trivial. No bound at infinity of any kind is assumed and this extends the known scalar monotonicity theorem. We also obtain the same conclusion for the scalar equation $-Δu=f(u)$ when $f\in C^1([0,\infty))$ is nonnegative, $f(0)=0$, $f\not\equiv0$, and $f(s)/s$ is nondecreasing for $s>0$. This relaxes the convexity and $C^2$ regularity requirements on $f$ in previous works. To prove these results we introduce a new method, completely different from the normal convexity approach from previous works, which relies on a delicate combination of techniques and could be applied to more general systems. Our basic tool is a suitable average of the linear interpolant between the solution and its normal limit on each finite strip. We next use stability estimates, combined with an energy argument for the scalar equation, or a contraction argument relying on Bessel potentials and the Schur test for the system. Increasing the strip height then forces the solution to vanish.

comments
24 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.02113 ↗

We revisit a standard space–time variational formulation of the scalar wave equation in the setting of differential forms. For this, we use as spatial operator the nonnegative, self-adjoint (relative) \emph{Hodge–Laplacian} on a bounded Lipschitz domain. Its spectral decomposition reduces the wave problem in any form degree to the same family of scalar ordinary differential equations that underlies existing space-time analysis. We illustrate how this can be used to transfer results from the scalar wave equation with Dirichlet boundary conditions to other wave-type problems. In particular, we connect the framework to perfectly electrically conducting Maxwell problems.

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

This paper establishes radial symmetry and uniqueness of magnetic skyrmions as global minimizers of the simplest local micromagnetic energy. The strategy is to show that any radial critical point with strictly decreasing out-of-plane component is the unique minimizer in the class of general degree-one maps with the prescribed limit at infinity. To this end, we identify a class of null Lagrangians that is sufficiently flexible to contain a calibration, giving a uniform lower bound for the energy that is uniquely saturated on the critical point. Our arguments provide a blueprint for proofs of symmetry and uniqueness of minimizers in vectorial variational problems under topological constraints.

comments
38 pages, 2 figures
fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2611.02141 ↗

We study the long-time behavior of the kinetic Cucker-Smale model under initial data with unbounded support in both position and velocity. Such data invalidate classical diameter-based flocking arguments and make sustained spatial cohesion difficult to establish. We prove an estimate for spatial characteristics under a finite spatial second moment and a sufficiently high velocity moment, without any requirement on coupling strength. We also prove weak flocking, i.e. control of spatial variance and integrability of velocity fluctuations in time. Under stronger assumptions on the initial tails, we establish uniform propagation of spatial exponential moments of explicitly determined order, a substantially stronger conclusion than bounded spatial variance. These estimates lead to explicit stretched-exponential rates of velocity alignment and convergence of the centered spatial distribution toward a limiting profile. Another contribution is the construction of countably atomic solutions that show optimality of the decay exponent in the spatial-tail-limited class. Together, the results clarify how initial phase-space tails govern spatial confinement and quantitative flocking for kinetic distributions without compact support.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.02232 ↗

In this paper, we study the optimal constant $C(p,γ)$ in a planar two-weight Hardy inequality relating the gradient and Hessian of a scalar potential, posed by Maz'ya in [14, Problem 3.11]. For every $1\le p<\infty$, we prove \[ \lim_{γ\toγ_c} 2^{p/2}|γ-γ_c|^p C(p,γ)=1, \qquad γ_c=1-\frac2p. \] The proof reduces the curl-free constraint to an angular minimization problem and yields qualitative rigidity of almost extremizers for $p>1$. Moreover, we determine the sharp constant in the radial class for every $1\le p<\infty$ and $γ\neγ_c$, thereby resolving the radial case of Maz'ya's problem. We also show that the radial inequality remains valid at $γ=γ_c$, with the same sharp constant \[ C_{\rm rad}(p,γ) =\left[1+\left(γ-1+\frac2p\right)^2\right]^{-p/2}. \] For general, not necessarily radial, potentials, we identify explicit parameter regions where this constant remains sharp and establish two sufficient criteria for symmetry breaking. The exact transition remains open for $p\ne2$. In the quadratic case, we recover the known sharp constant and derive a decomposition of its deficit. At the critical exponent, we obtain an exact remainder identity for the logarithmic Hardy inequality, whose classical constant remains sharp among radial potentials. The logarithmic inequality fails at $p=1$.

comments
35 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.02328 ↗

We consider the time-dependent biharmonic nonlinear Schrödinger equations with and without a mixed dispersion. We find the sharp threshold of blow-up and global existence for the biharmonic nonlinear Schrödinger equations without a mixed dispersion by establishing the modified cross-constraint variational method. Building on this work, we prove that the standing waves are strongly unstable without further assumptions on the frequency. The main new ingredients of which require us to provide a comparison of two variational problems, improved the method in Zhang [Comm PDEs, 2005, 30: 1429-1443]. In the latter part of the paper, we study the biharmonic nonlinear Schrödinger equations with a mixed dispersion, which destroys the scaling invariance. The single variational approach is utilized to obtain the sharp threshold of blow-up and global existence, and strong instability of standing waves.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.02354 ↗

We consider the critical Hénon equation $-Δu=|x|^αu^{(N+2+2α)/(N-2)}$ in $\mathbb{R}^N$, $N\ge3$. Gladiali, Grossi, and Neves (\emph{Advances in Mathematics}, 2013) constructed nonradial continua bifurcating at $α_k=2(k-1)$, $k\ge2$, and conjectured that these continua are confined to the even parameters. Jiang and Xiong (2026) disproved this conjecture by obtaining nonradial solutions in punctured neighborhoods of $α_k$ for even $k>(N-2)/2$. We prove that positive nonradial finite-energy entire solutions exist for every $α>2$ in every dimension $N\ge3$. The proof introduces a global variational construction by direct minimization on a monotonicity cone on the Emden–Fowler cylinder. Angular and axial order restore compactness in every finite $L^r$, $r>2$, despite Sobolev supercriticality, and invariance of the linear resolvent yields the full equation. This constructs a solution at each prescribed parameter without continuing local bifurcation branches. The solutions have Newtonian decay, are invariant under $O(N-1)\times O(1)$ and the Kelvin transform, and have energy strictly below the radial level. We also obtain a second solution for every $α>6$ in even dimensions, nonvertical branches at every $α_k$ with $k\ge2$ even without dimension restrictions, a cubic energy law, and rigidity near $α=0$ under bounded cylindrical amplitude.

comments
This work was first announced on October 15, 2026, on Zenodo (https://doi.org/10.5281/zenodo.23384720)
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.02420 ↗

We study positive classical solutions of the polyharmonic Hénon–Lane–Emden system $(-Δ)^m u=|x|^αv^p$, $(-Δ)^m v=|x|^βu^q$ in $\mathbb{R}^n$, where $m\ge2$, $p,q\ge1$, $pq>1$, and $α,β\ge0$. We prove that there is no such solution whenever $\frac{n+α}{p+1}+\frac{n+β}{q+1}>n-2m$, in every dimension and without any assumption on the behavior of the solutions at infinity. Combined with an existence result of Villavert, this proves the polyharmonic Hénon–Lane–Emden conjecture of Phan for $m\ge2$: for these exponents and weights, a positive classical solution exists if and only if $\frac{n+α}{p+1}+\frac{n+β}{q+1}\le n-2m$. The proof has two parts. We first show that positivity forces $(-Δ)^i u>0$ and $(-Δ)^i v>0$ for $1\le i\le m-1$. For $m$ even this needs $pq>1$, and explicit radial examples show that it fails when $pq<1$ and when $p=q=1$. The system is then equivalent to a weighted integral system with a Riesz kernel of order $2m$. For such integral systems we prove the corresponding Liouville theorem for every Riesz order $μ\in(1,n)$, adapting a recent argument for the second-order case that combines a localized virial identity with an interval comparison along source layers.

comments
This research was initially deposited on Zenodo on October 9, 2026 (https://doi.org/10.5281/zenodo.23268558)
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.02448 ↗

We study steady axisymmetric Navier–Stokes flows with swirl in the circular cylinder $\mathcal C_L=(0,L)\times B_2(0,1)$ with the no-slip condition on the stationary lateral wall. For the leading Euler velocity $(u_e^0,w_e^0,θ_e^0)=(1,0,r K(r))$, where $K(r)=H(r^2)$ is a prescribed smooth radial function, we construct and justify a Prandtl expansion as $\varepsilon \to 0$ for sufficiently small fixed $L$. The expansion accounts for both axial and azimuthal boundary layers, including the case of a Blasius leading axial profile with nonzero swirl. Weighted estimates at the symmetry axis and coupled remainder estimates yield a uniform velocity error bound.

comments
62 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.02492 ↗

A nonlinear scalar field equation is studied, which takes the form \begin{equation*} - \triangle{u}=g(u) \ \textrm{in} \ R^{N}, \quad \quad u \in E, \end{equation*} where $E$ is a suitable Banach space.. The nonlinear term $g(s)$ has subcritical growth at infinity. Near $s=0$, the nonlinear term $g(s)$ grows like $s^q$ for any $q>0$ if $N=2$ and for any $q \in (0,\ (N+2)/(N-2))$ if $N\ge 3$. Through the technique of adding one dimension of space, by mountain pass theorem and symmetric mountain theorem, we prove the multiplicity of radial solutions if $N\ge 2$ and the multiplicity of nonradial solutions if $N\ge 4$. Unlike [1] and [2], the proof presented here does not rely on any decomposition results. During the treatment for $N=2$, we provide a new proof for certain Gagliardo-Nirenberg type inequality on $R^2$, which is originally due to [3]. Based on this inequality we get a Trudinger-Moser type inequality involving gradient norm through Taylor expansion. Eventually we construct a special path to obtain the least energy level for solutions. [1] J. Mederski, Nonradial solutions of nonlinear scalar field equations. Nonlinearity 33 (2020), 6349–6380. [2] L. Jeanjean, S.S. Lu, Nonlinear scalar field equations with general nonlinearity. Nonlinear Anal. 190 (2020), 111604. [3] D.E. Edmunds, A.A.Ilyin, Asymptotically sharp multiplicative inequalities. Bull. London Math. Soc. 27 (1995) 71–74.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.02524 ↗

We study the three-dimensional incompressible Navier–Stokes equations on the torus with multiplicative Itô noise which is driven by a single Brownian motion and acts only through the vertical velocity component. Such a noise is strongly degenerate: An infinite-dimensional part of the velocity field is not forced at all. We show that it nevertheless has a regularizing effect. For a linear noise, strong solutions whose initial data have no unforced part are global with probability tending to one as the noise intensity grows. For a suitable nonlinear noise, the same holds for arbitrary $\mathrm{H}^1$ data, together with smallness of the space-time $\mathrm{L}^6$-norm of the vertical velocity. As a deterministic counterpart, we give a self-contained proof that a quintic damping of the vertical component yields global regularity, and the same argument shows that, under the linear noise, blow-up can only occur if the vertical velocity leaves $\mathrm{L}^6_{t,x}$.

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

We establish an exponential stabilization result for two-dimensional periodic gravity-capillary water waves of finite depth with constant vorticity, using an external pressure localized on the free surface. The pressure is prescribed as the product of a nonnegative cut-off function and the time derivative of the surface elevation and serves as a feedback control. To prove the main result, we derive the energy dissipation identity and estimate the time integral of the energy relative to the flat Couette flow, by means of the multiplier method and periodic Pohozaev identities. A remaining lower-order term led by the vorticity is removed by a compactness argument based on unique continuation for the linearized equations. Under a condition relating the cut-off to gravity and surface tension, the relative energy decays exponentially on any interval on which a regular solution remains uniformly small in Sobolev norms. We do not assume the evenness on the solution and smallness on the vorticity.

comments
25 pages. Comments are welcome
fields
Analysis of PDEs, Optimization and Control
pdf ↗ page arXiv:2611.02570 ↗

We study curvature flows for the dual Orlicz–Minkowski problem for strictly convex capillary hypersurfaces in the Euclidean half-space. The prescribed function has the form $φ(h)G(X)$, where $X=\nabla h+hν$ and $G$ may be nonradial and nonhomogeneous. For acute contact angles, the evenness assumption together with either of the two integral conditions yields a smooth weighted-volume-preserving flow for all $t>0$ and a smooth solution to the dual Orlicz–Minkowski equation. Without the evenness assumption, two strict spherical-cap barriers yield the same conclusions for an unnormalized flow, whose limiting hypersurfaces solve the dual Orlicz–Minkowski equation with $c=1$. A uniform strict monotonicity condition under rescaling ensures uniqueness for $c=1$ and convergence of the unnormalized flow in any $C^k$ norm at an exponential rate. The problem considered here includes the capillary $L_p$-Minkowski and $L_p$ dual Minkowski problems as special cases.

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

The scattering problem for the three-dimensional nonlinear Klein-Gordon equation \begin{align*} u_{tt}-Δu+u=\pm u^3 \end{align*} is studied. It was shown that the scattering operator $\mathbf{S}$ for the equation is well-defined on a neighborhood of 0 in the Sobolev space $\mathcal{H}^{1/2}:=H^{1/2}(\mathbb{R}^3) \oplus H^{-1/2}(\mathbb{R}^3)$, and that if $Φ_-$ is sufficiently small in $\mathcal{H}^{1/2}$ and belongs to $\mathcal{S} \oplus \mathcal{S}$, then $\mathbf{S}Φ_-$ is also in $\mathcal{S} \oplus \mathcal{S}$, where $\mathcal{S}=\mathcal{S}(\mathbb{R}^3)$ is the Schwartz space. In the present paper, however, we prove that for any non-zero real-valued $Φ_-\in\mathcal{S}\oplus\mathcal{S}$ whose $\mathcal{H}^{1/2}$-norm is sufficiently small, the corresponding solution $u$ satisfies \[ U(-t) \,{}^t(u(t),\partial_t u(t)) \not\to \mathbf{S}Φ_- \quad(t\to+\infty) \] in the weighted Sobolev space $H^{1,3}(\mathbb{R}^3)\oplus H^{0,3}(\mathbb{R}^3)$ although $U(-t)\,{}^t(u(t),\partial_t u(t))$ converges to $\mathbf{S}Φ_-$ in $H^{1,σ}(\mathbb{R}^3)\oplus H^{0,σ}(\mathbb{R}^3)$ for any $σ<3$. Here, $U(t)$ denotes the free Klein-Gordon evolution group.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.02707 ↗

For $n\geq2$ and $θ\in(0,π/2)$, we study the long-time existence and asymptotic behavior of an even normalized capillary $L_p$ dual Minkowski flow in the Euclidean half-space $\overline{\mathbb{R}^{n+1}_+}$. When $pq\geq0$, the flow exists for all positive time and the evolving hypersurfaces converge smoothly along a sequence of times tending to infinity to a stationary solution of the normalized problem. If $p\neq q$, a dilation of the limit solves the unnormalized problem.

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

We introduce a notion of quasiconvexity for integrands defined on the bundle of linear maps between the tangent spaces of two smooth, connected and complete Riemannian manifolds $(M,g)$ and $(N,h)$, naturally extending the classical Euclidean notion. For continuous integrands, we prove that this Riemannian quasiconvexity is equivalent to the sequential lower semicontinuity of the associated functional $$ F(u,Ω)=\int_Ωf(du)\,dμ_g $$ with respect to the weak$^*$ convergence in $W^{1,\infty}(Ω,N)$, in the intrinsic sense adopted in the paper, for every bounded open subset $Ω\subseteq M$. We then establish the Riemannian analogues of the Acerbi–Fusco theorems for Carathéodory integrands satisfying the corresponding growth conditions, for every $1\leqslant p\leqslant+\infty$, with respect to the weak and weak$^*$ notions of convergence considered here.

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

We justify the anelastic approximation and establish a convergence rate for local strong solutions to the isentropic compressible Navier-Stokes equations in a three-dimensional bounded domain, with ill-prepared initial data and vorticity-slip boundary conditions. When the Mach and Froude numbers vanish at the same rate $ε$, the system converges to an anelastic system with nonconstant hydrostatic density. Compared with the incompressible limit, the balance between singular pressure and gravity generates a variable-coefficient acoustic operator and additional commutators. To overcome these difficulties, we introduce the pressure perturbation adapted to the hydrostatic balance and establish weighted acoustic and vorticity estimates, yielding uniform-in-$ε$ estimates. We then use the weighted Helmholtz decomposition and time-averaging technique to prove the strong convergence of solenoidal component of the momentum and obtain an error bound controlled by $ε$ and the initial error in the projected momentum. Our analysis reveals the weighted cancellation mechanism that applies to singular limits around a class of nonconstant equilibria.

comments
33 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.02831 ↗

Reliable environmental monitoring and groundwater protection heavily rely on the ability to reconstruct full pollutant concentration fields from sparse, partial field measurements. In porous media, dissolved contaminants are transported by groundwater flow while undergoing hydrodynamic dispersion and complex chemical or biological reactions. To address practical contamination challenges, this work investigates the reconstruction of pollutant distributions using water samples collected at discrete locations in unsaturated or saturated soils via sampling tubes equipped with ceramic tips. While these suction samplers provide critical local data, they inherently capture only a fraction of the subsurface environment, leaving wide areas unmonitored. Motivated by this real-world monitoring procedure, we propose steady and time-dependent advection-diffusion-reaction models to simulate contaminant transport. Our main contribution is a generalized unique continuation result demonstrating that, under appropriate physical and mathematical assumptions, two concentration fields coinciding on a non-empty observation region must match throughout the entire space-time domain, even when originating from different source configurations. We investigate this problem from both theoretical and numerical perspectives, backing our mathematical uniqueness results with numerical simulations that validate the efficiency and practical utility of our approach. The theoretical proofs combine regularity properties away from source singularities with unique-continuation principles for parabolic and elliptic partial differential equations, providing a robust framework for environmental risk assessment and site remediation.

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

We continue the study of fundamental solutions for equations involving Kolmogorov-Fokker-Planck operators with rough local or non-local diffusions. Here we consider possibly unbounded lower order terms, such as drifts and potentials. We prove existence and uniqueness of weak solutions and of an appropriate notion of fundamental solution for a wide class of kinetic equations. This is based on kinetic transfer of regularity and anisotropic embeddings.

comments
Comments welcome. 33 pages
fields
Analysis of PDEs, Classical Analysis and ODEs, Functional Analysis
pdf ↗ page arXiv:2611.02886 ↗

We study global minimizers in $\mathbb{R}^d$ of the free energy $\mathcal{E}_κ=\mathcal{W}+κ\mathcal{U}$, where $\mathcal{W}$ is a power-law interaction energy with mild repulsion and $\mathcal{U}$ is the porous-medium internal energy with exponent $m>1$. In a range of exponents that we call the strict simplex regime, results of Lim–McCann and Davies–Lim–McCann show that $\mathcal{W}$ is minimized, uniquely up to rigid motions, by equal point masses at the vertices of a regular unit $d$-simplex. Diffusion excludes such atomic minimizers for every $κ>0$. We prove that uniqueness nevertheless persists: for every fixed $m>1$ and all sufficiently small $κ>0$, the free energy has a unique global minimizer up to rigid motions. After a suitable rigid motion, this minimizer is invariant under every symmetry of the simplex, and its support splits into $d+1$ clusters near the vertices, each of mass exactly $1/(d+1)$; in particular, it is not radially symmetric when $d\geq2$. The clusters have width of order $κ^{1/(d(m-1)+2)}$, which is also the exact order of the quadratic Wasserstein distance from the minimizer to the atomic simplex measure. Rescaled at this scale, the clusters converge in $L^1$ and $L^\infty$ to explicit Barenblatt-type profiles supported on ellipsoids determined by the Hessian of the simplex potential. For $d\geq2$ these ellipsoids are spheroids flattened along the directions of the vertices; when the repulsive exponent exceeds two, their aspect ratio equals $(d+1)^{-1/2}$, independently of all other parameters. At the endpoint $(4,2)$ of this regime in dimensions $d\geq2$, where the zero-diffusion minimizer is not unique, we show instead that vanishing diffusion selects the uniform spherical shell.

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

We study Fisher-KPP equations on hyperbolic space with reactions periodic in a Busemann coordinate or in the distance from a point or a geodesic. We determine spectral thresholds for extinction and persistence, including critical extinction from $L^2$ data, and characterize the signed speeds of horospherical fronts. In the hyperbolic plane, we construct a smooth periodic reaction admitting a positive stationary solution that decays away from a geodesic, and determine the spreading speed along the geodesic. For constant linear growth, we obtain logarithmic level positions with bounded error for balls, horoballs and geodesic tubes.

comments
63 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.02923 ↗

We construct smooth, strictly positive solutions of the three-dimensional cut-off Boltzmann equation with very hard potentials whose densities become unbounded in finite time. A main ingredient is a new velocity weight that is Gaussian on a ball and has a polynomial tail of fixed order. We establish coercive estimates for the linearized collision operator and bilinear estimates for the collision term, with constants independent of the radius of the Gaussian region. Combining these weighted estimates with an imploding solution of the compressible Euler equations, we develop an energy framework that controls the Boltzmann solution up to the blow-up time. The initial data agree with a constant Maxwellian outside a bounded spatial region and have finite relative entropy.

comments
113 pages, 1 figure
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.02970 ↗

We study positive solutions \(Q\in H^1(\mathbb R^N)\) of \[-ΔQ+Q=(I_α*Q^p)Q^{p-1},\] where \(I_α\) is the Riesz potential of order \(α\), \(N\ge1\), \(0<α<N\), \(p>1+α/N\), and \((N-2)p<N+α\). We prove that every such solution is radially symmetric and strictly decreasing about some point. For \(p\ge2\), we establish uniqueness up to translations and show that the real linearized operator has Morse index one and kernel spanned by \(\partial_1Q,\ldots,\partial_NQ\). The symmetry proof uses the method of moving planes. Uniqueness follows from nondegeneracy and compactness through a continuation argument.

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

We study the stochastic Schrödinger equation $ i\partial_t u_{\varepsilon} = H_{\varepsilon} u_{\varepsilon} $ with $ H_{\varepsilon} = -Δ+ V(x/\varepsilon) $, where V is a stationary ergodic sub-Gaussian field with exponential mixing. We establish the optimal algebraic error rate $ \varepsilon^{d/2} $ in $ L^2(Ω; L^2_x) $ for every $ d\ge1 $, prove it sharp by a matching lower bound when $ \widehat{R}(0)>0 $, and upgrade the convergence of Zhang–Bal from convergence in probability to almost sure convergence. We further establish a Gaussian fluctuation central limit theorem with explicit covariance. The limiting fluctuation satisfies $ i\partial_t \mathcal{G} = (-Δ+ \bar{V})\mathcal{G} + \sqrt{\widehat R(0)}\,\dot W(t,x) $, a linear random Schrödinger equation driven by additive space-time white noise, where $ \bar{V} = \mathbb{E}[V] $ is the effective potential.

comments
32 pages
fields
Analysis of PDEs, Probability
pdf ↗ page arXiv:2611.03014 ↗

In this note we examine the positive preserving properties, or the lack thereof, for Green's operators of elliptic differential operators on smooth, closed Riemannian manifolds. We will obtain the existence of elliptic differential operators on closed manifolds whose lowest eigenvalue is not simple, and the existence of a large family of elliptic differential operators on closed manifolds that only have signed eigenfunctions associated with the lowest eigenvalue. That is, we will see that there is both "good news" and "bad news" when one studies the positivity preserving properties of Green's operators associated with higher order elliptic differential operators on smooth, closed Riemannian manifolds and the eigenproblem for higher order elliptic differential operators on smooth, closed Riemannian manifolds.

comments
7 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.03037 ↗

The compressible Euler-Poisson system describes the full evolutionary processes of inviscid compressible gases, including compression, expansion, fluid motion, equilibrium states and gravitational collapse, under the combined effects of self-gravitation, pressure and inertial forces. It constitutes the fundamental macroscopic mathematical model for describing stellar structures, nebular evolution and gravitational collapse of gaseous celestial bodies. The system comprises mass conservation, momentum conservation, energy conservation laws coupled with the Poisson equation. Following the research in \cite{huang2022}, this paper investigates the quantitative relations among the relative perturbation amplitude of initial velocity, critical time and collapse time for gaseous stars undergoing gravitational collapse within the framework of the pressureless Euler-Poisson system. The closed-form formulas are verified against direct numerical integration, the accuracy of the asymptotic power law is quantified, and the relation between the two time scales is examined.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.03061 ↗

We consider a family of nonlinear Schrödinger equations with odd-power nonlinearities and fractional dispersion in an energy-critical/supercritical regime. For a family of Gaussian measures supported on high-regularity spaces, we show that the flow immediately evolves these measures to ones that are mutually singular with respect to their initial distributions. In the cubic case, the threshold for singularity exactly corresponds to the energy scaling for the equation. In particular, we establish singular evolution of Gaussian measures under the flow of the energy-critical cubic NLS on the 4-dimensional torus.

comments
27 pages
fields
Analysis of PDEs, Probability
pdf ↗ page arXiv:2611.03065 ↗

We solve the kinetic Kato square root problem for the whole-space Kolmogorov operator $$H_A=\partial_t-X\cdot\nabla_Y-\operatorname{div}_X(A\nabla_X)$$ on \(\mathrm L^2\) with Lebesgue measure, where \(A\) is a bounded measurable complex uniformly accretive matrix depending on all variables. We define its realization through a sesquilinear form and identify the square-root domains of the resulting maximal accretive operator and its adjoint with the intrinsic Sobolev space defined by one velocity derivative and half a derivative along the transport flow. The homogeneous norm equivalences depend only on the dimension and the coefficient bounds. The energy also controls a position derivative of order one third. The proof uses second-order resolvents and localized affine testing. A regularized transport symmetrizer gives hidden coercivity, while comparison with a positive Rockland operator supplies intrinsic smoothing. Commutator and dyadic approximation estimates remove the smoothing before a Carleson argument is applied. We also obtain uniform shifted square-root estimates and bounded velocity, transport and position Riesz transforms.

fields
Analysis of PDEs, Functional Analysis
pdf ↗ page arXiv:2611.03104 ↗

Under a minimal tail condition, local weak solutions to a class of nonlinear nonlocal parabolic equations modeled on the fractional heat equation possess continuous spatial derivatives.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.03122 ↗

We consider a damped forced nonlinear Klein-Gordon Schr\''{o}dinger (KGS) system known as the parametric KGS system with Yukawa coupling. We prove the regularity of the global attractor for this infinite-dimensional dynamical system, i.e. that the global attractor is included into a smaller Sobolev space than the energy space. We prove that this global attractor has finite fractal dimension, without any assumption on the decay of the forcing terms.

journal
Discrete and Continuous Dynamical Systems - Series S, 2026, 26, pp.288-302
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.03129 ↗

We consider a damped forced nonlinear Klein-Gordon Schr {ö}dinger (KGS) system known as the parametric KGS system with Yukawa coupling where the space variable belongs to R 2 . We prove the existence of a global attractor in dimension 2. Moreover we prove that this global attractor is regular and has finite fractal dimension.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.03134 ↗

We study the Cauchy problem for the two-dimensional inhomogeneous incompressible Magnetohydrodynamic equations with density-dependent viscosity and vacuum. For initial data with positive mass, finite second moment of density, and zero total momentum, we establish the existence and uniqueness of global strong solutions when the viscosity is sufficiently close to one in $L^\infty$. The smallness threshold may depend on the initial data, while no separate smallness condition is imposed on the initial velocity or magnetic field. We obtain uniform-in-time bounds for the density second moment and its $H^1\cap W^{1,q}$ norm, where $q>2$. Moreover, for every $η\in(0,1)$, $\|\sqrtρu(\cdot,t)\|_{L^2}+\|b(\cdot,t)\|_{L^2}$ decays at the rate $t^{-η/2}$, and the $H^1$ norms of $\nabla u$, $P$, and $\nabla b$ decay at the rate $t^{-(1+η)/2}$. The proof combines a velocity decomposition based on Hardy-space estimates with magnetic-field integrability and time-weighted energy estimates.

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

In this paper, we extend the analysis of homogeneous fractional Sobolev inequalities in the paper by A.D. Nguyen, J. I. Dıaz, and Q.-H. Nguyen (2020). We combine their subcritical proof with the first author's adaptation to the supercritical case to provide a short interpolation-based proof for the critical case.

fields
Analysis of PDEs, Functional Analysis
pdf ↗ page arXiv:2611.03185 ↗

We establish the existence of solutions to the Neumann problem for the Hessian equation on a smooth, bounded strictly static convex domain in hyperbolic space. The boundary condition determines a unique compatibility constant, and admissible solutions are unique up to a multiple of the static potential. As an application, we give a direct analytic proof of some weighted geometric inequalities for the static convex domain in hyperbolic space.

comments
45 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.03206 ↗

We prove smooth solvability of the Dirichlet problem for quaternionic Monge–Ampère equations on smooth relatively compact domains in ${\mathbb H}^m/Γ$, where $m\ge2$ and $Γ$ is a discrete additive subgroup: for a smooth positive density, the existence of a smooth strictly plurisubharmonic subsolution guarantees the existence and uniqueness of the smooth admissible solution. The technique of the proof is a simple adaptation from the Ph.D. Thesis of Jingyong Zhu [25] in 2017, supervised by Xinan Ma, which is a joint work of Ma and Zhu. The claim [22, Theorem A.1] by OpenAI on Sogge's local smoothing conjecture is a special case of our theorem.

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

Although the classical Yudovich theory guarantees global existence and uniqueness of two-dimensional Euler solutions with bounded vorticity, their higher-order norms may still grow in time. This raises a fundamental question: how much dissipation we need to ensure global stability and decay? While the full Laplacian dissipation is sufficient, the stabilizing effect of weaker, anisotropic dissipation is considerably more subtle. In this paper, we investigate the global stability and long-time decay of the two-dimensional incompressible Navier-Stokes equations with fractional horizontal dissipation $Λ_1^{2s}u$, where $s<1$. A central challenge is to recover sufficient decay of the second velocity component, whose weak dissipation obstruct the closure of conventional anisotropic energy estimates. Previous work by Wang-Wu-Zhu [arXiv:2601.16110] resolved this difficulty whereas the spatial weighted energy functionals must be used when $s$ approaches $1$. The main purpose of our manuscript is to remove this restriction. We introduce a hierarchy of carefully designed time-weighted anisotropic energy functionals which captures the interplay between horizontal fractional dissipation and the decay of velocity components. Under such initial assumptions, the characteristics of anisotropic dissipation is presented more straightforwardly, which also reveals the more essential intrinsic structure of fluid stability.

comments
29 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.03224 ↗

We prove persistence of $C^2$ boundary regularity for patch solutions of the two-dimensional aggregation transport equation, in contrast with the known $C^2$ ill-posedness of Euler vortex patches. More generally, we consider transport equations with kernels of the form $L(\nabla N)$, where $N$ is the fundamental solution of the Laplacian and $L$ is a linear map. We show that $C^2$ regularity persists for every $C^2$ initial patch if and only if $L$ is a scalar multiple of the identity. Our approach builds on the curvature formulation introduced by Kiselev and Luo.

comments
15 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.03258 ↗

We establish mathematical foundations for optimal spatiotemporal vector fields governing continuous score-guided probability flows over bounded submanifolds $M \subset SE(3)$ on the Special Euclidean group $SE(3) \cong \mathbb{R}^3 \times SO(3)$. Modeling dynamic density evolution via a score-perturbed Lie-algebraic continuity equation under zero-flux boundary conditions, we resolve the non-local score drift singularity $s(g,t) = \nabla_{SE(3)} \log ρ(g,t)$ as $ρ\rightarrow 0^+$ via weighted parabolic flux dissipation bounds. Using left-invariant exponential group mollifiers, we derive boundary-preserving DiPerna–Lions commutator estimates tracking structure constants $\{c_{ij}^k\}$. Second, interpreting the optimality system as a 7D space-time elliptic operator $L_{7D} = -Δ_{SE(3)} - \partial_t^2$ with zero-order corner compatibility on $\partial M \times \{0,T\}$, we establish Agmon–Douglis–Nirenberg $W_p^2(Q_T)$ shift estimates tracking Lie algebra constants, boundary geometry $\|\partial M\|_{C^2}$, and Ricci curvature $\|Ric_{SE(3)}\|_{L^\infty}$, yielding a full $C^\infty(\overline{Q}_T)$ Schauder bootstrap expansion. Third, we extend this system to non-cooperative Markov Mean-Field Games (MFGs) on $SE(3)$, establishing score-guided Nash equilibria via Schauder–Tychonoff fixed points. Crucially, the constant diagonal Ricci curvature $Ric_{SE(3)} = \mathrm{diag}(0,0,0,1/2,1/2,1/2)$ from $SO(3)$ induces a sharp Bochner–Weitzenböck spectral gap boost $λ_1(-Δ_{SE(3)}) \ge λ_1(-Δ_{\mathbb{R}^3}) + 1/2 > 0$. This positive rotational curvature enhances the Lie-algebraic Poincaré coercivity constant, demonstrating that intrinsic group curvature stabilizes score-guided flows against dispersion and expands the critical Nash uniqueness horizon $T_{SE(3)}^*$ beyond flat Euclidean limits.

comments
20 pages
fields
Analysis of PDEs, Differential Geometry, Optimization and Control, Probability
pdf ↗ page arXiv:2611.03278 ↗

Stationary Hamilton-Jacobi equations generally admit many weak KAM solutions. The question is how to select one weak KAM solution that reflects a meaningful physical principle. In this paper, we propose a selection principle for Hamilton-Jacobi equations arising from the large deviation principle of general drift-diffusion processes on $\mathbb{R}^n$ based on the exponential asymptotics of invariant measures. We first characterize the Aubry set as the finitely many equilibria of the drift, using an action estimate from the orthogonal decomposition of the drift. For any boundary data on the Aubry set compatible with the Peierls barrier, we construct the unique coercive weak KAM solution with these boundary data, which is also the maximal locally Lipschitz viscosity solution. The Freidlin-Wentzell graph formula then provides the boundary data on the Aubry set that select the unique weak KAM solution. The selected solution is exactly the rate function in the large deviation principle for invariant measures in the zero noise limit. We also show that this rate function is the vanishing viscosity limit, to which the viscous approximations converge locally uniformly. Finally, under additional regularity assumptions, we show that the long-time and zero-noise limits commute for suitably prepared initial densities.

comments
54 pages
fields
Analysis of PDEs, Dynamical Systems
pdf ↗ page arXiv:2611.03292 ↗

We extend the classification (Lin and Zhang, Ann. Inst. H. Poincaré Anal. Non Linéaire \textbf{27}, 2010) to finite-mass singular Liouville systems with sufficiently small positive singular exponents. For symmetric, entrywise nonnegative, irreducible and invertible coupling matrices, every solution whose mass vector lies near a fixed compact subset of the regular mass surface is radial about the singular point and is uniquely determined by its component masses up to dilation. We also establish nondegeneracy modulo dilation. To overcome the failure of the moving-plane argument for positive exponents, we use compactness and a local reduction based on integral identities. The results also hold for nonzero nonnegative exponent vectors and for small mixed-sign vectors satisfying an explicit integral inequality.

comments
35 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.03456 ↗

We classify isolated singularities of $p$-Laplace and $k$-Hessian Lane–Emden systems on their Serrin critical curves without radial symmetry. Our approach reconstructs a radial profile from the source measures through a truncated Wolff potential, providing a nonlinear counterpart of spherical averaging. For upper inequalities at equal powers, we determine the sharp joint logarithmic lower bound on the zero-mass singular branch. A radial pair attains this bound while both normalized components oscillate between zero and infinity. For exact systems at equal powers, we obtain a common second-order profile with a shared phase and a sharp two-term logarithmic expansion of the component difference. At unequal powers, we establish power–logarithmic asymptotics with explicit leading constants. These asymptotics hold uniformly in direction.

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

We characterize a class of possibly degenerate nonlinear reaction-cross-diffusion systems with size exclusion as (non-metric) gradient flows in continuity-equation format driven by entropy. We then establish a connection between these systems and discrete reaction networks by proving an EDP-type lower limit inequality for the associated gradient systems. In the non-degenerate case, we show a chain rule identity that allows us to identify minimizers of the corresponding energy-dissipation functional as weak solutions to the PDE system. In conjunction with the lower limit, this yields an alternative proof of existence of weak solutions and their approximability by solutions to the proposed discrete ODE systems. Finally, we generalize our results to models including drift terms by extending the established framework to tilted energy landscapes.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.03491 ↗

We study orthonormal Strichartz estimates at the critical coefficient exponent $q/2$ for fractional Schrödinger propagators. The proof for $d\geq3$ combines annular Schatten estimates with a frequency summation argument based on potential duality and Littlewood–Paley theory. In dimension two, a trace computation supplies the annular estimate needed for the global estimate. We also construct a counterexample to the global estimate with spatial $L^\infty$ and coefficients in $\ell^{q/2}$, even with a weak time norm.

fields
Analysis of PDEs, Functional Analysis
pdf ↗ page arXiv:2611.03527 ↗

We provide the first mathematical construction of the non-Abelian Yang-Mills-Higgs measure on a two-dimensional torus by implementing Parisi and Wu's ``stochastic quantisation'' procedure. We use a specific gauge covariant (but non-Markovian) approximation to the previously constructed associated Langevin dynamics and develop a covariant paracontrolled calculus for it. This allows us to obtain short-time control over times that are much longer than what the cubic nonlinearity naïvely suggests. When combined with the decay properties of the Yang-Mills-Higgs action under the deterministic gradient flow, as well as a quantitative measure of how the noise pushes the dynamic away from Yang-Mills connections, this is good enough to yield uniform-in-time bounds. We finally show that there exists a renormalisation under which our gauge covariant approximation converges to the Langevin dynamics (modulo gauge transformation) and that the latter is topologically irreducible and strong Feller. It therefore admits a unique invariant measure, providing the sought-after construction. Our construction is non-perturbative and works in particular for any fixed values of the coupling constants.

comments
350 pages, 3 figures
fields
Analysis of PDEs, Mathematical Physics, Probability
pdf ↗ page arXiv:2611.03640 ↗

We propose and study a first-order hyperbolic approximation of the nonlinear Schrödinger (NLS) equation in $N$ spatial dimensions. This is an extension of the recently-proposed 1D hyperbolic NLS model. We study the structure and properties of the hyperbolic approximation and their relation to those of the original system. We show that the N-dimensional hyperbolic system exactly conserves analogs of the mass, energy, and momentum, and that it possesses stationary solutions that are closely related to those of NLS. The hyperbolic system is also shown to admit plane-wave solutions that share some stability properties with those of NLS, and that relaxation can shrink the focusing low-wavenumber modulational instability band as well as introduce a high-wavenumber instability band not present in NLS. We also show that solutions of the hyperbolic system converge to solutions of NLS in the relaxation limit. We present an adaptive-mesh finite volume discretization of the hyperbolic system and demonstrate its effectiveness in handling simulations, including those with geometric obstacles or non-periodic boundary conditions. The effectiveness of the numerical scheme is demonstrated through examples including a Bose-Einstein condensate, line soliton instability, and superflow past a cylinder.

comments
27 pages, 12 figures
fields
Analysis of PDEs, Numerical Analysis
pdf ↗ page arXiv:2611.03642 ↗

Probability71

We study a growing random graph in which each new vertex chooses a uniformly random parent, joins that parent with probability $r\in(0,1]$, and independently joins each of the parent's current neighbors with probability $p\in(0,1)$. Let $p_c$ be the unique solution of $p_c e^{p_c}=1$. For $0<p<p_c$, we prove that the empirical degree distribution converges in probability to the stationary distribution $π$ of an explicit reset-and-growth Markov chain. Its upper tail satisfies $π((y,\infty))\sim C_{p,r}y^{-κ}$, where $C_{p,r}>0$ and $κ>0$ solves $p^κ+pκ=1$. This confirms predictions from physics (Lambiotte, Krapivsky, Bhat and Redner, \textit{Physical Review Letters}, 2016). We further show that for every fixed radius $\ell$ and $p<p_c$, the empirical distribution of induced rooted $\ell$-neighborhoods converges to the invariant law of a graph-valued reset-and-growth Markov process. We give an explicit construction of the limiting graph using a marked ancestral genealogy. Its root component is almost surely finite for $r<1$, and infinite with exactly one end for $r=1$. Moreover, for every $0<p<1$, both the fixed-vertex degrees and the maximum degree grow on the scale $t^p$, and the vertex of maximum degree is eventually unique and persistent.

comments
48 pages, 5 figures. Comments are welcome
fields
Probability
pdf ↗ page arXiv:2611.00123 ↗

We examine a population that evolves according to a biparental Moran model with two distinct types of individuals. Each individual's type is determined by the allele they carry at one biallelic locus, which is transmitted in a Mendelian way. This type influences the individual's mating preferences. We investigate two specific mating patterns: (i) where the type determines the level of attractiveness, and (ii) where the type dictates the level of homogamous choosiness. In both scenarios, one type has an advantage over the other. Assuming an initial proportion b of individuals are of the advantaged type, we give an explicit formula for the asymptotic proportion of the population's genome that originates from these advantaged ancestors under an infinite population size approximation. Our results enable a comparison of the relative strengths of homogamous choosiness, attractiveness, and viability selection in terms of genome transmission, and prove notably that viability selection is always more efficient than both forms of reproductive selection.

fields
Probability
pdf ↗ page arXiv:2611.00161 ↗

We develop Stein's method, with explicit constants throughout, for the discrete Bessel distribution: the law of a Poisson variable given its difference from an independent Poisson variable. The Bessel family is characterized by a birth-death operator with quadratic death rate $n(n+k)$ and as the exact fixed-point set of a centered quadratic-bias transform, and we prove a dependency expansion of Arratia-Goldstein-Gordon type: two joint moments of a column array control the total-variation distance from the conditioned row sum to a matched Bessel law. Applied to the row-constrained Fisher-Yates ensemble on $2\times c$ contingency tables -- independent Bernoulli or capped-Poisson entries conditioned on the row-sum difference, column sums free -- this yields a limit theorem -- which upgrades to the entire conditioned table at the same two-moment error -- a completely explicit enumeration estimate, and an exact divide-and-conquer sampler with certified acceptance. The entire apparatus -- operator, expansion, enumeration, sampler -- generalizes to $r\times c$ tables, where conditioning on all successive row differences produces a hyper-Bessel law. Verification scripts are included as ancillary files.

comments
46 pages. Numerical verification code included as ancillary files
fields
Probability, Combinatorics
pdf ↗ page arXiv:2611.00263 ↗

We develop Stein's method for the negative binomial law and for the hyper-negative-binomial law, the law of the smallest row total of an array of independent geometric variables given the differences of the row totals, with every constant explicit. The main instrument is a comparison of two biasings of the approximated variable, which cancels the rate term exactly at the matched parameter. We provide total variation bounds for sums of independent geometric variables at drifting parameters, for sums of dependent geometric variables (the Arratia-Goldstein-Gordon theorem with geometric summands and the Poisson law as an endpoint), and for Poisson mixtures; the exact conditional law of negative-binomial counts given their differences, with the Bessel law as its Poisson limit; and a dependency expansion for the column direction of a contingency table. A final section verifies every bound numerically, with one script per result.

comments
45 pages. Ancillary files: a Python verification suite (NumPy only), one script per result, run with python3 run_all.py
fields
Probability, Combinatorics
pdf ↗ page arXiv:2611.00275 ↗

We give an exact asymptotic expansion of the occupation probabilities $a(n,k)$ of the harmonic descent chain, introduced by D. Aldous, as $n\rightarrow\infty$ with $k\in\mathrm{o}(\sqrt{n})$. In addition, we extend the recent results of Brandenberger et al. by giving a bound on the rate of convergence of sequences defined recursively by $x_n = \frac{1}{H_{n-1}}\sum_{i=1}^{n-1}\frac{x_i}{n-i}$ for more general initial conditions. This result enables the application of an existing central limit theorem, also by Brandenberger et al., to statistics of the critical beta-splitting tree which satisfy our more general initial conditions.

fields
Probability
pdf ↗ page arXiv:2611.00347 ↗

We prove stability of continuous-time causal and bicausal optimal transport problems when both marginals converge in adapted Wasserstein distance along common vanishing time shifts. The marginal laws, filtrations, and costs may all vary, while the limit remains the original causal or bicausal transport problem. This allows for time discretization and the approximation of transport problems between non-degenerate scalar fractional stochastic differential equations by their Wong–Zakai schemes. We further establish sufficient conditions so that the synchronous coupling is optimal for the bicausal transport problem between scalar fractional stochastic differential equations under continuous, nonnegative submodular costs of polynomial growth. This result covers all Hurst parameters \(H\in(0,1)\) up to an additional order-preserving commutator condition on the corresponding coefficients for the rough regime \(H\in(0,1/2)\).

comments
23 pages
fields
Probability
pdf ↗ page arXiv:2611.00353 ↗

For every dimension $d\ge1$, we determine the probability that a prescribed point in $\mathbb R^d$ belongs to the convex hull over $[0,1]$ of a standard Brownian motion starting at the origin or of a Brownian bridge from $0$ to $0$. We obtain explicit one-dimensional integral formulas involving only standard special functions. For example, in dimension three the Brownian-motion absorption probability $p_3^B(r)$ for a prescribed point at distance $r>0$ from the origin is \[ p_3^B(r) =\frac{r}{\sqrt2\,π^{3/2}} \int_0^\infty \left(\fracπ{2\sqrt{1+v^2}}-1\right) \mathrm{e}^{-r^2(1+v^2)/4} (K_1-K_0)\!\left(\frac{r^2(1+v^2)}4\right)\,\mathrm{d} v, \] where $K_ν$ denotes the modified Bessel function of the second kind. For each fixed dimension $d\ge1$ and each prescribed nonzero point in $\mathbb R^d$, we derive precise asymptotics of the non-absorption probabilities for the convex hulls of Brownian motion on $[0,T]$ and a Brownian bridge from $0$ to $0$ over the same interval, as $T\to\infty$. The corresponding probabilities are asymptotic to explicit positive constants times $T^{-1/2}(\log T)^{d-1}$ and $T^{-1}(\log T)^{d-1}$, respectively. We also consider the first time $τ_d$ at which the growing convex hull of a standard Brownian motion in $\mathbb R^d$ absorbs a prescribed point at distance one from the origin. We determine the Mellin and Laplace transforms of $τ_d$ explicitly. Although $\mathbb E[τ_d]=\infty$ in every dimension, we prove \[ \frac{\logτ_d-2d}{2\sqrt d} \xrightarrow{\mathrm d}N(0,1), \qquad d\to\infty. \] In particular, $τ_d^{1/d}\to\mathrm{e}^2$ in probability, as $d\to\infty$. Surprisingly, the same limit holds for $S_d^{1/d}$, where $S_d$ is the first time at which the Brownian convex hull contains the entire unit ball.

comments
36 pages
fields
Probability
pdf ↗ page arXiv:2611.00381 ↗

The understanding of the behaviour of critical lattice models in two dimensions has made immense progress in the past couple of decades, with conformal invariance as its conjectured end goal. We consider here the critical random-cluster model (or FK-percolation) on a large class of graphs --- namely bi-periodic isoradial graphs --- with cluster-weight~$q \in [1,4]$. Following up on the establishment of rotational invariance at criticality in \cite{Rotation}, we prove that the large scale behaviour of these models is asymptotically the same on all such graphs. These include the critical homogeneous models on the square, triangular and hexagonal lattices.

comments
29 pages, 12 figures
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2611.00425 ↗

Let $\mathbf{A} \sim \mathbb{C}\mathcal{W}_p(I,m)$ and $\mathbf{B} \sim \mathbb{C}\mathcal{W}_p(I,n)$ be two independent complex Wishart random matrices. In this work, we investigate the asymptotic distribution of the largest eigenvalue $θ_{\max}$ of the random matrix $\mathbf{J} = (\mathbf{A}+\mathbf{B})^{-1}\mathbf{B}$. The high-dimensional regime is potentially unbalanced in the sense that, as $p \to \infty$, $m$ may grow faster than $p$, whereas $n$ grows proportionally to $p$. The asymptotic behavior of $θ_{\max}$ is characterized by means of a Riemann-Hilbert (RH) problem for Jacobi polynomials with modified Jacobi weights. We establish the type 2 Tracy–Widom asymptotic distribution of $θ_{\max}$. This provides an alternative, RH-based proof of the corresponding result of Johnstone [Ann. Statist. 36 (2008), 2638-2716] in the balanced regime, and establishes a conjecture of Jiang [Probab. Theory Relat. Fields 144 (2009), 221-246] in the unbalanced regime. In addition, we obtain an explicit correction of order $p^{-2/3}$ to the Tracy–Widom approximation, with a remainder of order $\mathcal{O}(p^{-1})$, and show exponential decay, as a function of $p$, of the upper tail of the distribution of $θ_{\max}$.

comments
64 pages, 8 figures
fields
Probability
pdf ↗ page arXiv:2611.00577 ↗

We study the block Anderson Hamiltonian \(H_L=λΨ_L+\mathcal V\) on the discrete torus \((\mathbb Z/L\mathbb Z)^d\), \(d\geq2\), where \(Ψ_L\) is the nearest-neighbor Laplacian and \(\mathcal V\) consists of independent \(W^d\times W^d\) GOE blocks. In the weak-disorder limit \(λ\to\infty\), we establish an entrywise local law, a spatial scaling limit for the squared resolvent entries, time-averaged dynamical delocalization, and lower bounds on the localization length of most bulk eigenfunctions. Particularly, we allow the block size to be fixed or grow above a polylogarithmic threshold. In sufficiently large polynomial volumes, the dynamical estimates hold for \(C_δ(λ+W/λ)\leq T\leq λ^{1+κ_d^{\rm BA}-δ}\), with a dimension-dependent exponent \(κ_d^{\rm BA}>0\), and the spreading scale is \(\sqrt{(λ^3+λW)T}\). This identifies a transition at \(W\asympλ^2\) between \(λ^{3/2}\sqrt T\) and \(\sqrt{λWT}\). The proof combines Gaussian moment estimates with deterministic stability of a matrix Dyson equation. A partial Bloch transform handles fixed blocks, while scalar reduction controls growing blocks. A Feshbach–Schur reduction of the block \(T\)-equation separates a single scalar diffusion mode from the stable internal cell modes. A renewal expansion and exact cell counting give a positive representation of the diffusion coefficient and control the fourth moment uniformly across the block-size transition. Notably, our argument does not require an enumeration of Feynman diagrams.

comments
117 pages, 2 figures. A short video overview is available: https://youtu.be/CLAtq3mPhNU?si=so7PnIZfMknlsqvS
fields
Probability, Mathematical Physics, Analysis of PDEs
pdf ↗ page arXiv:2611.00598 ↗

The minimum spanning arborescence (MSA) with a fixed boundary, defined on weighted directed graphs, is the directed analogue of the minimum spanning tree (MST). The behaviour of the MSA has been of recent interest and is known to be quite different from that of its undirected counterpart. On the complete directed graph, and for edge weights given by i.i.d. random variables with a broad class of distributions, we prove a Central Limit Theorem for the weight of the MSA with appropriate scaling. While the scaling for the CLT is similar to MST case explored by Janson, the centering required ($1$ as opposed to $ζ(3)$ for Uniform$[0,1]$ weights) and the limiting variance of the Gaussian ($1$ as opposed to $6ζ(4)-4ζ(3)$ for Uniform$[0,1]$ weights) are notably different.

comments
32 pages, 8 figures
fields
Probability, Combinatorics
pdf ↗ page arXiv:2611.00698 ↗

We identify the limit free energy of spherical vector spin glasses by a variational formula. The covariance function need not be convex. Using the global symmetry of the spin configurations, we introduce a family of constraint measures that gives a disintegration of the original spin distribution. We first identify the limit free energy of each constrained model and then apply the Laplace method to recover that of the original model.

comments
53 pages
fields
Probability
pdf ↗ page arXiv:2611.00710 ↗

We consider simple random walk on the sequential affine preferential attachment graphs with fixed parameters $m\ge2$ and $δ\ge0$. We prove the walk has total-variation cutoff, and for every fixed $\varepsilon\in(0,1)$, \[ t_{\mathrm{mix}}^{(n)}(\varepsilon) =\frac{\log n}{νd} +O_{\mathbb P}\!\left(\sqrt{\log n}\right), \] where $ν>0$ is the walk speed and $d>0$ is the entropy per level of harmonic measure on the Pólya–point tree, the local weak limit of the graph. Thus cutoff occurs at the entropic time. Entropic cutoff was previously established for a range of random graph models including configuration models under mild degree assumptions and on Erdős–Rényi random graphs for typical starting points. We extend the harmonic-measure approach to preferential attachment, accounting for its age-dependent structure and hubs of polynomial degree. The local weak limit, the Pólya–point tree, provides a more tractable setting for analyzing the walk. The proof combines regeneration estimates on the local limit tree, a quantitative graph–tree coupling on the mixing-time scale, and control of hub excursions. We show that shortly before the cutoff time its distribution is close in total variation distance to a measure with small $L^\infty$ distance from stationarity. When $m\ge2$, the spectral gap is bounded away from zero with high probability which completes the upper-bound coupling argument.

fields
Probability
pdf ↗ page arXiv:2611.00717 ↗

We compute the limit of free energy of 2-spin spherical vector spin glasses with possibly non-convex interaction and couplings satisfying a finite fourth-moment assumption. The couplings need not be Gaussian. The limit is given by a logarithmic-determinant variational formula, equivalently by a finite-dimensional matrix Dyson equation, and its zero-temperature limit yields the ground-state energy. The limiting formulas depend only on the covariance of the couplings. We also study fluctuations: at an interior minimizer, an explicit variance bound transfers the limiting law of a logarithmic linear statistic to the free energy. For Gaussian couplings, this yields Gaussian fluctuations. At a boundary minimizer, assuming a simple regular edge with GOE Tracy-Widom fluctuations and a one-edge reduction, we transfer the edge fluctuations to the free energy.

comments
34pages
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2611.00747 ↗

In this paper, we study the conditional location of $X_T$ given the local time profile $L_T(\cdot)$ for two non-Markovian self-interacting processes: the polynomially self-repelling motion (PSRM) and the true self-repelling motion (TSRM). For TSRM, our novel approach yields a new proof of Dumaz's clever burglar result [Dumaz 2012].

comments
20 pages, 1 figure
fields
Probability
pdf ↗ page arXiv:2611.00854 ↗

We develop a new dual approach, which can be used to establish sharp $L^p$ bounds for orthogonal differentially subordinate martingales. The method rests on the construction of a certain special function enjoying appropriate majorization properties and a novel differential condition.

fields
Probability, Analysis of PDEs, Classical Analysis and ODEs
pdf ↗ page arXiv:2611.00932 ↗

We develop a functional-analytic theory of convergence for non-symmetric generalized Dirichlet forms defined on a sequence of Hilbert spaces $H_n$ converging to a limit space $H$ in the sense of Kuwae-Shioya, with the principal applications concerning $L^2$-spaces over varying reference measures $μ_n \to μ$. Extending Mosco's variational convergence for Dirichlet forms to the non-symmetric setting via a functional controlling the off diagonal values of the forms, we introduce a notion of generalized convergence of non-symmetric Dirichlet forms and show it to be equivalent to strong convergence of the associated resolvents, to weak convergence of the co-resolvents, and to strong graph convergence of the infinitesimal generators. A version of the Trotter-Kato theorem in the Kuwae-Shioya framework yields the corresponding equivalence for $C_0$-contraction semigroups. As applications, we give sufficient conditions for the generalized convergence of elliptic and sectorial $a_{i,j}$-forms with changing speed measures, both on $\mathbb{R}^d$ and in infinite dimensions over a Gelfand triple, and deduce weak convergence of the laws of the associated right processes under tightness of the path measures.

comments
83 pages, 71 references
fields
Probability, Analysis of PDEs, Functional Analysis
pdf ↗ page arXiv:2611.00975 ↗

In 2014, with D. Aerts we proposed a solution to the hard problem of Bertrand's paradox by means of a universal average over different ways of randomizing an entity. In his recent monograph, N. Shackel raises objections concerning the approximation by cellular densities, the restrictions used in their construction, the apparently trivial limit of their averages, the choice of a second-order probability law, and the dependence of the result on the naming of chords. We revisit these objections using the invariance-based formulation of the universal average. The first objection is well taken, and the approximation argument is repaired: an explicit sequence of bivalent cellular densities provides weak approximation of any prescribed probability measure, with an error bound for intervals. We show that any second-order selection law invariant under rearrangements of equal-length cells has the same uniform barycenter, independently of the particular densities and weights employed. For cellular densities, this conclusion holds exactly at every finite resolution. Thus, non-uniqueness of the second-order law does not prevent uniqueness of the resulting average within the indifferent class. Finally, we prove that no probability measure can be invariant under both these rearrangements and arbitrary changes of interval lengths. The reference geometry therefore cannot be obtained by averaging alone: it must be supplied by the physical modelization of the randomized entity. These results clarify the scope, and the limitations, of our original distinction between the easy and hard problems of Bertrand's paradox.

comments
10 pages
fields
Probability
pdf ↗ page arXiv:2611.00981 ↗

In this paper, we study averaging principles for stochastic KdV equations perturbed by a fast oscillating term generated by a stochastic reaction-diffusion equation in $H^s(\mathbb{R})$, $ s\geq 0$. When dealing with multilinear estimates of the nonlinear terms in the stochastic KdV type equation, two kinds of workspace are both effective. The classical workspace can help us prove the averaging principle in the $L_ω^2$ sense, but it has more restrictions on the noise kernel and the conservation structures. When we use a new workspace without homogeneous low frequency restrictions, only the regularity conditions and the $L_x^2$ conservation structure is needed. Correspondingly, because there is no moment estimate of the solution, we can only prove the perturbed equations converge to an averaging equation in the probability sense. Our works may have important reference value, because it not only provides a new perspective to handle dynamical problems of stochastic dispersive model, but also compare it with the classical method.

comments
42 pages
fields
Probability, Analysis of PDEs
pdf ↗ page arXiv:2611.01051 ↗

Thorin's class coincides with the smallest class of probability laws on $\mathbb{R}$ that contains all gamma laws and their reflections, while being closed under convolution and weak convergence. In particular, all Thorin laws are self-decomposable. This paper proves an alternative characterization of Thorin's class in terms of what we call the hyperbolic Bochner-Bernstein property. This property corresponds to the notion of hyperbolically completely monotone Laplace transforms on the positive half line, but extended to the real-valued setting. Using the new characterization, it is shown that Thorin's class is closed under multiplication with independent random variables admitting hyperbolically completely monotone densities, which partly settles an open question raised by Bondesson and allows for proving that a large class of possibly skewed real-valued distributions is in Thorin's class. As particular examples, we apply the closure property to show that Johnson's S\textsubscript{U} distribution and the Pearson type IV distribution are in Thorin's class for all parameter choices.

fields
Probability
pdf ↗ page arXiv:2611.01058 ↗

We study the number of non-Pareto points in two high-dimensional models: a homogeneous Poisson point process and a fixed-size sample of independent uniform points in the unit cube. A point is non-Pareto if some other sample point is coordinatewise less than or equal to it. As the dimension grows on the logarithmic scale of the intensity or sample size, the asymptotic behavior exhibits a surprising sequence of transitions: from Gaussian to stable fluctuations, back to Gaussian, then to a Poisson limit at the sparsity threshold, followed by the eventual disappearance of non-Pareto points. We identify the critical thresholds, normalizations, and limiting laws in both models. Notably, the return to Gaussianity occurs while the stability index remains strictly below $2$ and is driven by a change in the dominant fluctuation mechanism. Moreover, in part of the returning Gaussian regime, the natural normalization is the square root of the expected count rather than its standard deviation. At the stable–Gaussian transition, the two mechanisms can coexist, giving rise to a sum of independent stable and Gaussian random variables.

fields
Probability
pdf ↗ page arXiv:2611.01096 ↗

We study the well-posedness and the large time stability of the Langevin equation in the presence of potentials and dissipative damping together with additive white noise. While the confining potential is assumed to be smooth, the nonlinear damping is allowed to have either polynomial growth or singular behaviors. We construct novel Lyapunov functions and determine the corresponding parameter regimes that lead to global well-posedness or finite-time explosion. These Lyapunov functions also allow for deriving quantitative mixing rates toward equilibrium. Our results extend existing ergodic theory established for the instance of nonlinear damping satisfying suitable integrability conditions.

comments
49 pages
fields
Probability
pdf ↗ page arXiv:2611.01187 ↗

Let $(S_n)$ be the one-dimensional elephant random walk with memory parameter $p\in(3/4,1)$ and first-step probability $q=\mathbb{P}(S_1=1)\in[0,1]$. Set $a=2p-1$, and let $f_{q,a}$ denote the density of the almost-sure limit of $S_n/n^a$. We prove that the last return time $T_0=\sup\{m\geq0:S_m=0\}$ satisfies: $\mathbb{P}(T_0\geq n)\sim f_{q,a}(0)\sqrt{\frac{8}{π(2a-1)}}n^{-(a-1/2)}$. Reflection gives $f_{q,a}(0)=f_{1,a}(0)$, so the constant is independent of $q$. For future walks started from admissible states $(n,x_n)$ with $x_n/\sqrt n\to z$, we establish functional convergence of the centered martingale-normalized paths to a time-changed Brownian motion. Uniform control of late hitting times then gives the eventual-return kernel $2Φ(-\sqrt{2a-1}|z|)$, uniformly on bounded scaled windows, where $Φ$ is the standard normal distribution function. The same last-visit asymptotic holds uniformly for nonempty deterministic targets $F_n\subseteq[-r_n,r_n]\cap\mathbb{Z}$, $r_n=o(\sqrt n)$, held fixed during each trajectory. Conditionally on $T_0\geq n$, we identify the joint limit of $S_n/\sqrt n$, the next return divided by $n$, and the last return divided by the next return. The last ratio converges to $A^{-1/(2a-1)}$, independently of the other two limiting coordinates, where $A$ has the arcsine distribution on $(0,1)$.

comments
21 pages, 1 figure
fields
Probability
pdf ↗ page arXiv:2611.01279 ↗

General sufficient conditions, in terms of stochastic Euler products, are given for a realization of a point process to have finite excess or finite deficiency in the Paley-Wiener space.

comments
12 pages
fields
Probability, Complex Variables, Functional Analysis
pdf ↗ page arXiv:2611.01347 ↗

These lecture notes give a broad introduction to financial derivatives at the level of a Masters program in quantitative finance. Topics include forward and futures contracts, no-arbitrage bounds and put-call parity, the binomial model, the fundamental theorems of asset pricing, Brownian motion and Itô calculus, the Black-Scholes model, the Greeks, variance swaps, local and stochastic volatility models including Heston, and static hedging of barrier options. Each chapter ends with exercises, and complete solutions, including Python code for the computational exercises, are provided in an appendix. The notes are open source: the LaTeX source is available at https://github.com/mattlorig/intro-financial-derivatives, and readers are invited to submit corrections and additions.

comments
232 pages. Source and PDF releases at https://github.com/mattlorig/intro-financial-derivatives (DOI: 10.5281/zenodo.23849183)
fields
Probability
pdf ↗ page arXiv:2611.01355 ↗

In graphical two-choice allocation, vertices are bins, and each arriving ball must be placed irrevocably at one endpoint of a uniformly random edge. The objective is to keep the maximum-minus-minimum load gap small at every time. On cycles, endpoint-local monotone rules incur polynomial gaps at long time horizons, whereas global rules can achieve polylogarithmic gaps. We prove a joint exponential-moment inequality for the orthogonal contrasts of a binary partition tree, controlling all contrasts along a root-to-leaf path simultaneously. Applied to the Bansal–Feldheim strategy, it improves the gap on every $κ$-edge-connected $d$-regular graph from $O((d/κ)\log^4 n\log\log n)$ to $O((d/κ)\log^3 n\log\log n)$. We give an explicit strategy on the $n$-cycle with expected gap $O(\log^2 n)$ uniformly over deterministic times and exponential tails at each such time. An Euler-tour projection yields $O(\bar d\log^2(2M))$ for every connected graph with $M$ edges and degree-proportional capacities. For lower bounds, we introduce a stochastic cut workload: the expected largest normalized overload forced by the requests, plus an indivisibility term. For every online integral strategy, the supremum over time of the expected gap is at least one sixth of this benchmark. Regular rings of cliques attain $Ω((d/κ)\log n)$ along an explicit family, improving the prior additive lower bound. With unequal capacities, the workload need not control the gap: one family has constant relative cut slack, bounded workload and gap $Ω(\log\log n)$; another has workload at most $20$ but forces gap $Ω(\log n)$ even for clairvoyant fractional allocations that remain irrevocable.

comments
28 pages, 5 figures
fields
Probability
pdf ↗ page arXiv:2611.01369 ↗

The main result of this paper is an upper bound on the correlations of multiplicative functionals of determinantal point processes. In particular, for the sine process, the correlations of a multiplicative functional associated with a rapidly decaying function decay quadratically. It follows that the spectral density of such functionals belongs to the Sobolev space $H_1$.

comments
18 pages
fields
Probability, Dynamical Systems, Functional Analysis
pdf ↗ page arXiv:2611.01379 ↗

We prove precise large deviations for the symmetric elephant random walk with random step sizes. When the distribution of $|Z_1-1|$ is subexponential, we first show that, for each fixed$p\in[0,1]$, there exists a positive number sequence $b_n\to\infty$ such that \[ \mathbb P(S_n>x)\sim \mathbb P(S_n<-x)\sim \frac n2\overline F(x) \] uniformly for $x\ge b_n$, where $\overline F(x)=\mathbb P(|Z_1-1|>x)$. This existence result requires no moment assumptions and does not specify the growth rate of $b_n$. For $p\in[0,3/4]$, we further give explicit sufficient conditions on $b_n$ under Weibull-type and lognormal-type tail conditions with a regularly varying factor $x^γL(x)$, where $γ\in\mathbf R$ and $L$ is a positive measurable slowly varying function. Analogous results hold with $\mathbb P(|Z_1|>x)$ and non-strict tails.

comments
19 pages,
fields
Probability
pdf ↗ page arXiv:2611.01440 ↗

In this paper, we establish $p$-Wasserstein bounds and Cramér-type moderate deviations for the multi-dimensional elephant random walk in the diffusive and critical regimes. Using a Gaussian convolution estimate with random covariance and the recursions for the conditional covariance, we obtain $W_{p,2}(\mathcal L(\widehat T_n),N(0,I_d))\le C_{a,d}pL_n$, where $\widehat T_n$ is normalized by its exact covariance and \[ L_n\asymp \begin{cases} n^{-1/2}\log n,&a\le1/3,\\ n^{-3(1/2-a)},&1/3<a<1/2,\\ (\log n)^{-3/2},&a=1/2. \end{cases} \] Consequently, we obtain radial Cramér-type moderate deviations for $x=o(L_n^{-1/3})$. We also determine the covariance bias under the uncorrected normalization and establish the corresponding Wasserstein bounds, lower bounds and moderate deviation estimates. The dimension and the model parameters are fixed.

comments
16 pages
fields
Probability
pdf ↗ page arXiv:2611.01443 ↗

Let $Z_{i,n}$ be the population at time $n$ descended from one particle at time $i$ in a branching process in a varying environment. Under two-sided bounds on products of offspring means, an integrable uniform second-moment tail condition, and nondegeneracy and unit positive-support gcd of all weak limits, we prove $\mathbb{P}(Z_{i,n}=k)\le C(n-i+1)^{-2}$ uniformly in $0\le i<n$ and $k\ge1$, and obtain a local limit theorem as $n-i,k\to\infty$ with $k\le L_0(n-i)$, without third-moment assumptions. These results extend the classical local probability estimates for critical Galton–Watson processes to varying environments.

fields
Probability
pdf ↗ page arXiv:2611.01455 ↗

We study polynuclear growth (PNG) on the half-line with Poisson nucleations in the bulk and at the boundary. For every nonnegative boundary nucleation rate, we construct stationary measures and jointly stationary couplings under a common graphical environment, with profiles pinned at the origin. We realize these couplings as a measurable stationary PNG horizon and prove convergence to the half-space stationary horizon under Kardar-Parisi-Zhang (KPZ) scaling. The horizon convergence includes its base profile and positive representing measure, together with joint profile convergence at every prescribed finite parameter list. We also prove convergence of the height evolution from general upper-semicontinuous initial profiles to the half-space KPZ fixed point. The associated passage field converges locally uniformly to the half-space directed landscape, jointly with evolutions from finitely many initial profiles driven by the same environment. The convergence results cover the critical boundary window and every fixed subcritical boundary rate, including zero. All fixed subcritical rates produce the same limiting laws.

comments
48 pages, 6 figures, comments are welcome
fields
Probability, Mathematical Physics, Functional Analysis
pdf ↗ page arXiv:2611.01475 ↗

We consider independent long-range bond percolation on $\mathbb{Z}^d$ in which $x$ and $y$ are joined with probability $1-e^{-βJ(x-y)}$. Let $d\ge2$ and let $J$ be invariant under coordinate permutations and sign changes, positive on nearest-neighbour pairs, and satisfy $\liminf_{n\to\infty} n^d\sum_{\|x\|>n}J(x)=0$. We prove that there is no infinite cluster at the critical parameter. Together with Berger's theorem for heavy tails, this gives continuity of the phase transition for $J(x)\asymp\|x\|^{-d-α}$ for every $α>0$ except $α=d$, in every dimension $d\ge2$, and for every exponentially decaying kernel satisfying these hypotheses. Previously the fast-decaying case was known for nearest-neighbour and uniform finite-range kernels, in $d=2$ for finite-range and exponential kernels, and in high dimension for sufficiently spread-out kernels. The proof adapts a recent renormalization argument for nearest-neighbour percolation on $\mathbb{Z}^3$ that is driven by a gluing inequality conjectured by Kozma and Nitzan. Long edges enter in two places: they can jump over the surfaces that a nearest-neighbour path must cross, and they let a cluster outside a box enter it from far away. We control the first with thick outer faces and the tail condition, and the second by measuring entrances through the total edge weight between a cluster and a box rather than through the number of boundary vertices.

comments
13 pages, 3 figures
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2611.01490 ↗

This paper is concerned with the connection between parabolic equations with memory (MPEs, for short) and backward stochastic differential equations (BSDEs, for short). To provide a probabilistic representation of MPEs, we introduce a new class of BSDEs, called BSDEs with memory (MBSDEs, for short). The main feature of MBSDEs is that, at the current time $s$, the generator depends not only on the current value $Y^{t,x}(s)\equiv Y^{s,X^{t,x}(s)}(s)$ but also on the future path $r\mapsto Y^{r,X^{t,x}(s)}(r)$, $r\in[s,T]$. This structure reveals a fundamental difference from classical BSDEs: in the classical setting, the time and space variables are coupled and inseparable, whereas in MBSDEs they are completely independent. We prove the well-posedness of these MBSDEs and show that their adapted solutions provide a probabilistic representation for the solutions of MPEs. Furthermore, under a monotonicity condition, we establish a comparison principle for one-dimensional MBSDEs, which enables us to develop a viscosity solution theory for MPEs. This generalizes the celebrated nonlinear Feynman–Kac formula of Peng [25] and Pardoux–Peng [22] to the case with memory, in both the classical and viscosity solution senses.

fields
Probability
pdf ↗ page arXiv:2611.01591 ↗

The Rudvalis shuffle removes the top card and reinserts it uniformly at random in one of the bottom two positions. Hildebrand proved the classical upper bound $O(n^3\log n)$, and Wilson later proved the sharp lower coefficient $1/(8π^2)$, establishing the correct order but leaving the leading upper constant, cutoff, and the cutoff profile open. We prove that the full labelled shuffle has total-variation cutoff at \[ \frac{n^3\log n}{8π^2} \] with a window of order $n^3$. The upper bound is obtained by writing one deterministic rotation of the shuffle as a nonnormal sweep of adjacent averaging projections, comparing that sweep to a weighted interchange generator, and controlling the entire regular-representation heat trace. The key sharp-window ingredients are heat-kernel smoothing through the Octopus Inequality, zero extension of deletion-harmonic ordered-tuple functions, a representation-theoretic multiplicity payment, and a sectorwise entrance estimate that disposes of all large Young-diagram deficits. For the profile, an exact complex one-card eigenfunction yields a deck statistic whose surviving first Fourier mode converges to a Gaussian shift. A matching full-deck $L^2$ bound then shows that this one-dimensional Gaussian likelihood ratio asymptotically exhausts all remaining information, giving the exact total-variation profile.

fields
Probability
pdf ↗ page arXiv:2611.01597 ↗

Resetting a process, that is, restarting it from its initial position at random times, changes the probability that it leaves an interval through one end rather than the other. We show that the direction of this change is governed by how the exit time depends on the exit side, and we express this through classical stochastic orders. For random walks and birth-death chains we determine when resetting more intensively always moves the exit probability in the same direction, and we show that this can fail: we give an explicit chain in which the direction reverses twice over time, and bound the number of such reversals spectrally. We also show how the direction depends on the starting point. In the continuum limit we obtain the corresponding results for diffusions with drift.

comments
24 pages, 2 figures
fields
Probability
pdf ↗ page arXiv:2611.01756 ↗

We prove convergence to critical Gaussian multiplicative chaos for characteristic-polynomial measures of complex iid matrices. Let $A_N=N^{-1/2}(ξ_{ij})$, with a fixed law satisfying $\mathbb Eξ=\mathbb Eξ^2=0$, $\mathbb E|ξ|^2=1$, and finite moments of every order; no density is assumed. On each fixed disk $\{|z|\le r\}$, $0<r<1$, expectation-normalized determinant measures at power $2\sqrt2$, multiplied by $\sqrt{\tfrac12\log N}$, converge to critical chaos with a fourth-cumulant covariance correction. The normalized height-deficit marked measure converges to the product of this spatial limit and the standard Rayleigh law. Convergence holds jointly with centered averages of the $\sqrt2$-scaled original logarithmic field against finitely many smooth compactly supported bulk tests, and with the two-sided near-critical curve at powers $q=2\sqrt2-2λ/\sqrt{\log N}$. On fixed compact parameter intervals, the curve converges in law in the uniform weak topology; all limiting coordinates use the same Gaussian field. The limiting curve is an explicit deterministic profile times the same critical measure.

comments
263 pages
fields
Probability
pdf ↗ page arXiv:2611.01794 ↗

We study the Laplace transform of the time of ruin in the classical Cramér–Lundberg model with claims having an Erlang distribution of shape parameter 2. We derive an integro-differential equation with two boundary conditions. For every positive discount rate, we show that its characteristic polynomial has one negative root and two distinct positive roots. Boundedness excludes the growing exponential term and yields a representation of the transform as a sum of two decaying exponentials. We construct a finite-dimensional matrix reduction of the convolution chain. For a model parameter set, we obtain exact expressions for the ruin probability, the mean time of ruin, and higher moments, including the third moment at zero initial surplus. We prove analyticity in the discount rate and justify the resulting moment series. We consider the analytic continuation of the representation to negative discount rates separately. For Erlang claims with an arbitrary positive integer shape parameter, we establish a closed linear system and the asymptotics of the root continuing the zero root at zero discount.

comments
16 pages, 0 figures
fields
Probability
pdf ↗ page arXiv:2611.01886 ↗

We study ruin models with the surplus invested in a risky asset and Erlang-distributed claims: non-life insurance, annuity payments and the mixed model. Assuming that the integro-differential equation for the survival probability has a classical twice continuously differentiable solution, we prove that this solution satisfies a linear ordinary differential equation. We construct explicit annihilating operators and write the coefficients of the reduced equation in closed form through binomial coefficients (for the mixed model with equal shape parameters). A converse criterion is obtained: a bounded solution of the reduced equation satisfies the integro-differential equation if and only if the residual vanishes at zero initial capital together with its derivatives of order below that of the annihilator. The exponent of the power branch at infinity is determined by the parameters of the risky asset alone and does not depend on the shape parameter. For the mixed model we classify the fundamental set of solutions: the exponentially growing modes are excluded by boundedness. The connection coefficient of the power branch is nonzero by a known power-law lower bound for the ruin probability, and in the annuity model by the reduced equation and the boundary condition at zero. Hence the ruin probability has power-law asymptotics with a positive constant for all shape parameters and all positive exponents, and a complete asymptotic expansion up to a multiplicative constant in all three models. For non-life insurance with Erlang claims of order two the expansion coefficients are computed by an explicit recurrence.

comments
34 pages, 0 figures
fields
Probability
pdf ↗ page arXiv:2611.01892 ↗

We establish quantitative stability and well-posedness for degenerate Fokker–Planck equations with Sobolev-regular and possibly fully degenerate diffusion coefficient. For two classes of rough drifts, stability estimates imply uniqueness, and existence is proved under suitable conditions. First, for anisotropic drifts with partial fractional Sobolev regularity, we prove both existence (as probability densities, essential for the probabilistic interpretation via superposition) and quantitative stability without imposing any growth conditions, covering the full range of fractional exponents and extending previous Lagrangian-flow results. Second, for drifts whose distributional gradients are given by singular integrals (e.g., Biot–Savart velocity fields from $L^1$ vorticity), we obtain stability estimates that allow the diffusion matrix to be time-space dependent and possibly degenerate, removing the prior restrictions of identity diffusion or bounded coefficients. Our results also recover the pure transport regime as a limiting case.

comments
47pages, no figures
fields
Probability
pdf ↗ page arXiv:2611.01894 ↗

Let $T \to \infty$, let $τ$ be uniformly distributed on $[T,2T]$, and let $σ= σ(T)$ be a deterministic real part approaching $1/2$ from the right. We establish the convergence in law of the recentered maximum of $\log|ζ(σ+ \mathrm{i}τ+ \mathrm{i} h)|$ over $I_θ = \smash{[ - (\log T)^θ,(\log T)^θ]}$, for every fixed $θ> 0$. Under explicit conditions on the displacement $σ- 1/2$, the recentered maximum converges to a Gumbel distribution with scale parameter $1/(2\sqrt{1 + θ})$. The recentering is an exact upper quantile of the one-point law of the associated Haar field $F_{h}^{\mathrm{H}} = \Re\sum_{p^{j}\leq X}U_{p}^{j}/(jp^{j(σ+ \mathrm{i} h)})$, where the $U_{p}$ are independent and uniformly distributed on the complex unit circle. The positive constant in the limiting distribution is characterized by a Gaussian process describing the limiting microscopic increments of the Haar field around a high point. The result is established without the Riemann hypothesis.

comments
60 pages, 1 figure
fields
Probability, Number Theory
pdf ↗ page arXiv:2611.01905 ↗

We study the prevalence of hyperuniformity and spatial rigidity among translation- invariant ergodic simple point processes of fixed intensity, in a topology controlling local second moments. Hyperuniform processes are dense but meagre. We prove that intermittent hyperuniformity is residual: the number variance exhibits hyperuniform behavior along some sequences of radii and hyperfluctuating behavior along others. Maximal rigidity is also residual. Thus generic processes are maximally rigid but not hyperuniform. A local-to-global principle reduces the proofs to cross-section constructions for an arbitrary fixed essentially free ergodic $\mathbb{R}^d$-action. We also prove that processes admitting revival sequences form a residual set and exhibit near-quadratic variance along suitable van Hove sequences.

comments
65 pages, 0 figures, comments are welcome!
fields
Probability
pdf ↗ page arXiv:2611.01975 ↗

We consider irreducible reversible Markov chains whose nonzero off-diagonal transition probabilities are bounded below by $ε>0$ and whose reversible measure satisfies $m_-\le m(x)\leκm_-$. Under the Bakry–Émery curvature condition $\mathrm{CD}(K,\infty)$, with $K\in\mathbb{R}$, we establish Wang's log-Harnack inequality $$ P_t(\log f)(x)\le\log P_tf(y) +\frac{C\mathrm{dist}(x,y)^2}{\int_0^t e^{2Ks}\mathrm{d} s}, $$ for bounded positive $f$ bounded away from zero and all $x,y\in V$, where $C$ is a constant dependent only on $\varepsilon$. Building upon this inequality, we further prove volume doubling property: let $K_-:=\max\{-K,0\}$ $$ \mathrm{Vol}(B(o,2R))\le C_0\exp\!\bigl(C_1\sqrt{K_-}\,R\bigr) \mathrm{Vol}(B(o,R)),\qquad R>0, $$ where $C_0,C_1$ depend only on $ε,κ$. If $d$ is the maximum combinatorial degree of the support graph, we further prove under $\mathrm{CD}(0,\infty)$ the sharp volume growth bound $\mathrm{Vol}(B(o,R))\le m_-CR^{\lfloor d/2\rfloor}$ for all $o$ and $R\geq 1$.

comments
40 pages, 2 figures
fields
Probability, Combinatorics, Differential Geometry
pdf ↗ page arXiv:2611.02010 ↗

We establish a dimension-free long-time reverse transportation, respectively Harnack inequality for the underdamped Langevin dynamics with non-convex potential. Specifically, we prove that for any two initial points $z,z'$ and $P_t$ the underdamped Langevin semigroup, it holds \begin{equation} \mathrm{KL}(δ_z P_t|δ_{z'}P_t) \leq C\mathrm{e}^{-χt}|z-z'|(\mathcal{R}\vee|z-z'|) \end{equation} for all $t>δ$ where $δ>0$ is arbitrarily small and $C=C(δ),\mathcal{R},χ>0$ are dimension free constants. In particular, our proof extends recent results which are restricted to either the convex underdamped or the non-convex but overdamped setting.

fields
Probability
pdf ↗ page arXiv:2611.02020 ↗

The relaxation of the discrete nonlinear Schrödinger equation is known to slow down dramatically when the energy density $\varepsilon$ exceeds a critical value $\varepsilon_c$, where the system enters a condensed phase. Replacing the Hamiltonian dynamics by Brownian motion on the microcanonical surface of $N$ sites at fixed mass and energy, we prove rigorous upper and lower bounds on the equilibration time $τ_{\mathrm{eq}}$, which is governed by the first non-zero eigenvalue $λ_1$ of the Laplacian on this surface. In the condensed phase the equilibration time is stretched exponential, not exponential, in the system size. The upper bounds on $λ_1$ come from trial functions: of one occupation for $\varepsilon<\varepsilon_c$, where the problem reduces to a Sturm-Liouville equation, and of two occupations for $\varepsilon>\varepsilon_c$, where they cross the bottleneck through which the condensate moves between sites. The lower bounds on $λ_1$ come from a Bochner-Reilly argument, with a vector field that compensates the concavity of the boundary. As a result, $τ_{\mathrm{eq}}=O(1)$ for $\varepsilon<\varepsilon_c$, while for $\varepsilon>\varepsilon_c$, asymptotically in $N$, $(\sqrt{2}-1)\sqrt{\varepsilon-\varepsilon_c}\leq\lnτ_{\mathrm{eq}}/\sqrt{N}\leq\sqrt{\varepsilon-\varepsilon_c}$. We conjecture that the left-hand bound is sharp and the right-hand one is not.

comments
49 pages, 6 figures, preprint format
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2611.02025 ↗

We study the asymptotic behavior of a critical decomposable multi-type Galton-Watson process with immigration whose offspring mean matrix is triangular with diagonal entries 1. Under second-order moment conditions on the offspring and immigration distributions, we establish a functional limit theorem for the sequence of appropriately scaled processes, and describe the limit process as independent squared Bessel processes and some linear combinations of their iterated integral processes. Our work completes and extends some results of Foster and Ney (1978) for some strongly critical decomposable multi-type Galton-Watson processes with immigration.

comments
38 pages
fields
Probability
pdf ↗ page arXiv:2611.02069 ↗

We compare four simple shuffles with one adhesion parameter $p$: a card-weighted sticky riffle, a block-weighted riffle, a midpoint-interpolation shuffle, and a correlated-label inverse riffle. Independent surviving contacts create contiguous blocks; no force or energy constants are fitted. We give polynomial upper bounds with explicit dependence on $p$, common adjacency-survival lower bounds, and a sharper information lower bound for interpolation. For fixed deck size $n\ge4$, the mixing time diverges as $Θ((1-p)^{-1})$ for the three cut-first models, but as $Θ((1-p)^{-2})$ for the correlated-label model. The latter distinction comes from whether one or two additional contact breaks are needed to escape cyclic rotations. For even $n$, unglued interpolation retains the lower bound $Ω(\sqrt n\log n)$ and upper bound $O(n^{5/2}\log n)$. We distinguish proved bounds from conjectured scales, recover classical riffle cutoff under sufficiently small perturbations, and explain precisely where established results on clumpy shuffles apply. The fixed-parameter asymptotic orders of the new cut-first families and their possible cutoff remain unresolved.

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

Borgs, Chayes, Cohn and Zhao developed a limit theory for sparse graphs based on $L^p$ upper regularity with $p>1$, where Holder's inequality controls small sets. We develop the analogous theory in the Orlicz class $L\log L$, replacing Holder by the Young-Fenchel inequality for $Ψ(u)=(1+u)\log(1+u)-u$ and $Ψ^*(v)=e^v-1-v$. We prove a weak regularity lemma for upper $Ψ$-regular graphons with $4^{O(1/\varepsilon^2)}$ parts, using the modular $\intΨ$ as the energy; that upper $Ψ$-regular sequences have cut-metric convergent subsequences; that convergent sequences with $L\log L$ limits are upper $Ψ$-regular; and that $L\log L$ balls are cut-metric compact. The class strictly contains every $L^p$ class with $p>1$, and we give sparse $W$-random graphs that are upper $Ψ$-regular but not upper $L^p$ regular for any $p>1$. For graphs with a given degree sequence we prove, by Stein's method of exchangeable pairs with switchings, that if the average degree tends to infinity, the density to zero and the degree profile converges in $L^1$ to $\varphi$, uniformly random graphs converge in the normalized cut metric to $\varphi\otimes\varphi$, with no condition on the maximum degree; the sequence is upper $Ψ$-regular when $\varphi\in L\log L$. We also show that the maximum-entropy $β$-model is entrywise Chung-Lu when $d_{\max}^2=o(M)$, and that cut-closeness to it follows from a lower bound $e^{-o(M)}$ on its probability of having the prescribed degrees. Finally, $Ψ$ is the large deviation rate function of sparse Erdos-Renyi graphs up to a factor $1+O(1/\log\frac1p)$.

comments
16 pages
fields
Probability, Combinatorics
pdf ↗ page arXiv:2611.02187 ↗

We prove that the multivariate Berry–Esseen inequality for sums of independent random vectors holds with the same constant in every dimension. For independent centered random vectors $X_1,\ldots,X_n\in\mathbb{R}^d$ whose covariance matrices sum to $I_d$, we show that the distance between the distribution of their sum and $N(0,I_d)$, measured uniformly over convex sets, is at most $C_0\sum_{i=1}^n\mathbb{E}\|X_i\|_2^3$ for a universal constant $C_0$. The bound requires only finite third moments and holds uniformly in the dimension, the number of summands, and their distributions. It also yields the corresponding bound for independent and identically distributed vectors. In particular, $C_0$ can be chosen to be $980$.

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

We determine the joint moments of real powers of the absolute value of characteristic polynomials in the circular beta ensemble, for every $β>0$. At fixed distinct prescribed points, the Fisher–Hartwig formula holds for every exponent greater than $-1$, with explicit constants and a relative error bounded by a negative power of the matrix size $N$. For approaching points in the same integrable range, the error is bounded by a negative power of $Nδ_N$, provided that $Nδ_N\to\infty$ and the sum of the absolute values of the negative exponents is less than two. Here $δ_N$ is the minimum distance between the prescribed points; this range includes every integrable pair of root exponents. For $q>0$ at the critical relation $pq^2=2β$, we prove the Keating–Wong asymptotic for the $p$th moment of the integral of the $q$th absolute power of the characteristic polynomial, for every real $p>1$. The leading asymptotic extends to every complex spatial weight in $L^p$. The proofs combine the recursion for orthogonal polynomials on the unit circle with conditional expectation identities for Gaussian multiplicative chaos and quantitative estimates for approaching singularities.

comments
141 pages
fields
Probability
pdf ↗ page arXiv:2611.02205 ↗

This paper studies a class of \textbf{exponentially age-preferential random growth graphs} $G(m,β)$: at each time $n$ a new vertex $v_n$ is added, and $m$ edges are drawn to existing vertices independently, with the probability that a target $v_k$ is chosen proportional to $e^{βk}$ ($β>0$), so that the graph's growth strongly favors ``young'' vertices. We systematically investigate two fundamental probabilistic problems of this model and supply the proof details: (1)~\textbf{Recurrence}: when $β>0$, the simple random walk on $G$ is recurrent with probability $1$ (Theorem~\ref{thm:rec}); (2)~\textbf{Infinite collisions}: for every $β>0$, two independent simple random walks on $G$ meet infinitely often with probability $1$ (Theorem~\ref{thm:icp}). The core of the proof is the following: by the Borel–Cantelli lemma combined with the \textbf{memoryless property} of exponential weights, $G$ is almost surely ``sausage-like'' --- there exist infinitely many bottlenecks consisting of exactly $m$ parallel edges; the cascade of bottlenecks makes the effective resistance diverge, yielding recurrence; the renewal process $\{T_k\}$ constructed at the bottleneck times has i.i.d.\ stationary increments with finite moments of every order for the first-passage times, and combined with a moderate-deviation estimate we verify Peres' Green-function criterion for infinite collisions.

fields
Probability
pdf ↗ page arXiv:2611.02329 ↗

We study Metropolis-Hastings kernels whose proposal kernels are reversible with respect to a reference measure, and establish sufficient conditions for such kernels to inherit a nonzero right spectral gap from their proposal kernel. Our conditions require the importance weight of the target relative to the reference measure to be bounded above, but do not require it to be bounded away from zero. Our approach combines a localized Holley-Stroock argument, which yields a local Poincare inequality, with a Lyapunov drift condition. As our main application, we analyze the preconditioned Crank-Nicolson (pCN) algorithm for sampling from measures on a Hilbert space that are absolutely continuous with respect to a Gaussian reference measure. Under local boundedness and quasiconvexity assumptions on the potential, we establish a dimension-independent $L^2$-spectral gap for this Metropolis-Hastings algorithm, thereby covering cases in which the local Lipschitz condition used by Hairer et al. (2014) is not satisfied.

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

For a fixed $q\in(0,1)$, can a set of positive Lebesgue measure avoid every translated and dilated copy of $\{q^n:n\ge1\}$? OpenAI's release of October 6, 2026 shows that it can, with a compact subset of $[0,1]$ whose measure is arbitrarily close to one. We give a detailed exposition of the proof, using only finite probability and basic measure theory. The proof removes a small open set intersecting every copy, obtained from a random construction: fair random choices, attached to the cells of nested grids, route each point down a finite tree, and at the leaf reached a further random choice removes the point with probability $p$. The removed set therefore has expected density $p$, however large the tree, while the branching gives each copy many independent chances to intersect it. Each chance depends on only part of the tree, so its outcome changes at only a controlled number of dilations, and a union bound over finitely many representative dilations then covers every dilation. We also relate the proof to the earlier random-cell arguments going back to Kolountzakis (Bull. London Math. Soc. 29 (1997), 415–424) and to recent work on two-fold sumsets (arXiv:2607.03584) and on Rajchman measures (arXiv:2609.04456), and we show how the method of conditional expectations makes the construction deterministic.

comments
37 pages
fields
Probability, Analysis of PDEs
pdf ↗ page arXiv:2611.02454 ↗

For $0<κ<8$, we prove a uniform dimension transformation theorem for SLE in natural time: on a single probability-one event, Hausdorff and packing dimensions of every time set are multiplied by $d=1+κ/8$, and the same holds for lower and upper box dimensions of every bounded time set. The result applies to self-similar SLE with stationary increments, chordal SLE in the half-plane, and chordal SLE in bounded piecewise $C^1$ Jordan domains. In the last case, the box-dimension conclusion holds under a positive-angle endpoint hypothesis. We also establish boundary-inclusive local Hölder continuity of every order below $1/d$ for chordal SLE in natural time and identify the exact local dimension $d$ of the natural occupation measure on compact time intervals.

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

We derive total variation bounds for the Schrödinger–Föllmer sampler when the target density vanishes at the boundary of its support. This boundary behavior produces a terminal-time singularity in the drift near the boundary. We first prove a base estimate under a single quantitative hypothesis, finiteness of the relative Fisher information, without assuming boundedness or Lipschitz continuity of the drift. We then combine this estimate with a mixture regularization, thereby reducing the problem to determining the growth rate of the regularized Fisher information. For densities with an exact polynomial vanishing order on the boundary of a smooth bounded domain, we determine this growth rate and its leading constant. Orders above one yield the square-root rate in the number of steps, with a logarithmic loss at order one. For orders between one half and one, the rate exponent decreases continuously from one half toward one third. Finite mixtures of triangular kernel densities fall into the linear case.

fields
Probability
pdf ↗ page arXiv:2611.02542 ↗

We establish an invariance principle for long-memory linear processes with power-law coefficients under sublinear expectations. Under truncated-moment and capacity-tail conditions, we construct these processes on a canonical space and prove weak convergence in continuous path space of their linearly interpolated, normalized partial sums. The limiting sublinear law is represented as an upper expectation over stochastic integrals with a fractional Brownian moving-average kernel and predictable volatility controls, driven by a two-sided classical Brownian motion. When variance uncertainty vanishes, the limit reduces to the classical fractional Brownian limit. The proof combines a multidimensional Rosenthal inequality, coefficient approximation, and the invariance principle for independent and identically distributed random variables to establish finite-dimensional convergence. Tightness follows from second-moment increment bounds. Uniform approximation on compact sets then extends the convergence from bounded Lipschitz to bounded continuous test functions.

fields
Probability
pdf ↗ page arXiv:2611.02610 ↗

For Dirichlet Liouville Brownian motion associated with a subcritical Gaussian multiplicative chaos measure on a bounded planar domain, we study the response of finite spectral blocks under Cameron–Martin perturbations of the underlying Gaussian free field. For each fixed $0<γ<2$, we prove that, almost surely, all unordered eigenfunction-product measures in every finite simple spectral block are linearly independent. This strengthens the corresponding diagonal independence statement and implies surjectivity of the joint eigenvalue and eigenframe response map. We use this transversality to construct real-analytic local deformations that preserve a prescribed finite block of eigenvalues while varying its eigenframe. We then identify the least Cameron–Martin energy required to realize a given infinitesimal angular response, expressing it through a positive Schur complement of the response operator. Finally, on finite-dimensional Gaussian slices, we derive the conditional law associated with the local isospectral leaf and compare the induced slice metric with the full Cameron–Martin minimum. The results provide a local geometric description of spectral flexibility for Liouville Brownian motion.

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

How does a computational problem transition from easy to hard? In the hard-core model, approximate counting and sampling are polynomial-time tractable up to tree uniqueness, but worst-case intractable at any constant relative distance above it unless $\mathsf{NP}=\mathsf{RP}$. We quantify the transition from polynomial to exponential mixing for classical Glauber dynamics. On $n$-vertex graphs of maximum degree $d\ge3$, at fugacity $λ=(1+δ)λ_{\mathrm c}(d)$ with sufficiently small $δ\ge0$ that may vanish with $n$, its worst-case mixing time has the form $\exp\{Θ(nδ^2/d)\}n^{1+Θ(1)}$. The upper bound is degree-uniform, and the matching lower bound holds for every fixed $d$. Annealing gives approximate counting with the same running-time upper bound at fixed accuracy. For general sampling and counting algorithms, we establish a robust fine-grained reduction from SAT without assuming a lower bound on SAT's running time. For any fixed $d\ge3$ and $0<γ<1$, a sampling or approximate-counting algorithm running in $\exp\{O((nδ^2/d)^{1-γ})\}\operatorname{poly}(n)$ time along any one suitable inverse-polynomial distance sequence $δ=δ(n)$, yields a randomized SAT algorithm running in $\exp\{\widetilde O(s^{1-γ})\}$ time on inputs of binary length $s$. This power-saving transfer identifies $nδ^2/d$ as the analogue of SAT input length for hard-core sampling and counting at relative distance $δ$ above criticality: beating the Glauber exponent by a fixed power through any sampling or counting method would yield a corresponding power improvement for SAT. At criticality, we establish $O(\sqrt{n/d})$ spectral independence, optimal in $n$ at fixed degree, and degree-uniform Glauber mixing in $\widetilde O(n(n/d)^{1+1/(d-2)})$ time, improving the previous $\widetilde O(n^{4+4/(d-2)})$ bound.

fields
Probability
pdf ↗ page arXiv:2611.02702 ↗

We develop a theory of generalized Wishart processes within the framework of $G$-expectation, with $G$-Dyson Brownian motion and the $G$-Wishart process as two typical examples. In contrast to the classical setting, we show that $G$-Dyson Brownian motion may exhibit collisions and provide a sufficient condition ensuring the non-collision of the eigenvalues of generalized Wishart processes. We then derive the equations governing the high-dimensional limits of the empirical spectral measures under $G$-expectation, leading to the corresponding semicircle law for $G$-Dyson Brownian motion and Marchenko–Pastur law for the $G$-Wishart process.

comments
51 pages
fields
Probability
pdf ↗ page arXiv:2611.02728 ↗

We study the Euclidean injective norm of inhomogeneous random tensors with independent entries. For Gaussian tensors, we establish optimal two-sided bounds for the expected norm, with constants depending only on the tensor order. These bounds describe the interplay between variance accumulation along fibres and the contribution of the largest individual entries. In the matrix case, our result is consistent with the characterizations in~\cite{LVHY18}. We then extend the analysis to sparse Gaussian tensors with arbitrary amplitudes and activation probabilities. The expected norm is characterized by the expected largest absolute entry and the largest fibre standard deviation after truncating amplitudes at this scale. Our proofs combine geometric chaining with estimates for averaging over the random support.

fields
Probability
pdf ↗ page arXiv:2611.02813 ↗

We study McKean-Vlasov equations driven by an isotropic $2s$-stable L{é}vy noise, $s\in(0,1)$, whose solutions may have no finite mean, with coefficients that are Lipschitz with respect to a bounded Wasserstein-type distance. When the jump noise is additive, we prove strong well-posedness for every initial law and every $s$, without any moment assumption, and propagation of chaos at the rate $N^{-1/2}$ for kernel interactions. When the size of the jumps depends on the law, we prove the same results for $s>1/2$, and we show by an example that uniqueness fails for every $s<1/2$. The value $s=1/2$ thus separates well-posedness from non-uniqueness; the critical case itself remains open. These results answer, for stable noise, the question of uniqueness without moments raised by Jourdain, M{é}l{é}ard and Woyczy{ń}ski and by Cavallazzi.

comments
Submitted to ALEA Latin American Journal of Probability and Mathematical Statistics
fields
Probability
pdf ↗ page arXiv:2611.02859 ↗

The replacement of the classical derivative in the governing equation of a continuous-time Markov process with finite state space by a fractional derivative of arbitrary order $α>1$ produces solutions that are mathematically incompatible with the theory of stochastic processes.

comments
AI software is not used at all. Delft University of Technology, report 20260421 on https://www.nas.ewi.tudelft.nl/people/Piet/TUDelftReports.html
fields
Probability, Mathematical Physics, Dynamical Systems, Functional Analysis
pdf ↗ page arXiv:2611.02954 ↗

For directed polymers in random environment, we provide a short and mostly self-contained proof of the local limit theorem in the full weak disorder phase, including the critical inverse temperature $β_c$. That is, the point-to-point partition function is well approximated by the product of two independent point-to-line partition functions (one starting from each endpoint of the system) multiplied by the simple random walk transition kernel. The approximation is valid in the $L^p$ sense for an optimal range of $p$. The result is new at $β=β_c$ and for $p>2$, and in all cases the proof is significantly simpler, technically and conceptually, than what can be found in the literature. As a consequence of the result we establish an invariance principle for the polymer measure with fixed end-point, valid for all $β\in [0,β_c]$.

comments
16 pages
fields
Probability
pdf ↗ page arXiv:2611.02998 ↗

Consider the hyperbolic Gaussian analytic function (GAF) \begin{equation*} F_{\mathbb{D}}(z)=\sum_{n=0}^{\infty }ξ_{n}z^{n},\qquad |z|<1, \end{equation*} where the $ξ_{n}$ are independent standard complex Gaussian variables. Peres-Virág theorem tells that the distribution of the zeros of $F_{\mathbb{D}}(z)$ is provided by a Determinantal Point Process (DPP). We prove that $F_{\mathbb{D}}(z)$ is the only GAF whose zeros are determinantal with a Hermitian kernel, up to multiplication by a zero-free holomorphic function and a one-to-one holomorphic change of variable, with a \ non-degeneracy condition imposed to exclude trivial cases. The proof identifies a geometric property of GAF's with (local) determinantal zeros: the metric defined by the first intensity must have constant curvature $-4$.

comments
19 pages
fields
Probability, Complex Variables, Functional Analysis
pdf ↗ page arXiv:2611.03118 ↗

We establish a near-optimal upper bound $\exp(\exp(CN^{1+o(1)}))$ for the $N$-th moment of the critical two-dimensional stochastic heat flow, improving on the bound $\exp(\exp(CN^{2}))$ of Gu, Quastel, and Tsai. Near-optimality follows from the lower bound $\exp(\exp(cN))$ of Ganguly and Nam. These estimates establish the exponential scale of the ground-state energy of the two-dimensional $N$-body delta-Bose gas predicted by Rajeev's conjecture, up to a vanishing error in the exponent. As a further step toward this conjecture, we derive, for each fixed $N$, a formula for the ground-state energy in terms of the bottom of the spectrum of a principal operator.

fields
Probability, Mathematical Physics, Functional Analysis
pdf ↗ page arXiv:2611.03191 ↗

We identify the limit of the free energy of the Hopfield model with independent symmetric Bernoulli patterns, for every temperature and loading ratio. A Hubbard-Stratonovich transformation reduces the problem to that of identifying the limit free energy of a bipartite spin glass with $\pm 1$ and spherical spins. One key difficulty is that the patterns, which become the coupling coefficients in the bipartite model, are Bernoulli instead of Gaussian, and the limit free energy is sensitive to the law of these coefficients. We show that the model is in fact equivalent to one involving Gaussian patterns and also subject to a finite number of Bernoulli random fields. We then solve this model by adapting the techniques recently introduced to identify the limit free energies of spin glasses with either $\pm 1$ or spherical spins.

comments
37 pages
fields
Probability
pdf ↗ page arXiv:2611.03306 ↗

For every $α\in(1/4,1)$, we construct a heterogeneous medium $ξ$ such that the diameter of the level sets of the solution to the F-KPP equation is of order $t^α$ along a sequence of times tending to infinity. This is a natural continuation of a series of recent works establishing logarithmic lower bounds as well as linear asymptotics for the diameters of the respective level sets in random and deterministic heterogeneous media. Both results assume $\supξ> 2\infξ$; we also show that the diameter can diverge in the critical regime $\supξ=2\infξ$. A key ingredient is an estimate for branching Brownian motion with fixed time horizon $t$ and branching rate $1$ on the negative half-line and $2+t^{-η}$ on the positive half-line. This estimate exhibits a saturation transition: for $η<1/2$ the polynomial and logarithmic corrections to the extremal position depend on $η$, whereas for $η\geq1/2$ the extremal position becomes independent of $η$, up to an additive constant.

comments
48 pages, 5 figures
fields
Probability, Analysis of PDEs
pdf ↗ page arXiv:2611.03332 ↗

This paper establishes uniform local asymptotics for the first-passage time below zero and the stopped maximum of a Lévy process with negative drift and a locally regularly varying Lévy measure. We show that their probabilities of lying in distant intervals are asymptotic to the expected first-passage time multiplied by the corresponding Lévy masses, uniformly over interval widths bounded away from zero, including unbounded intervals. Although the two local events have asymptotically equivalent probabilities, their conditional overlap vanishes for fixed-width intervals. Nevertheless, we establish conditional concentration of the first-passage time and stopped maximum around their deterministic linear relation on scales dominating the fluctuations of the centered process. We further prove conditional functional limit theorems yielding a single-step process with random jump time on the original time scale and a deterministic linear descent on the accelerated scale. Finally, we identify the joint limiting distribution of the unscaled pre-passage position and terminal overshoot, distinguishing continuous passage from passage by a downward jump.

comments
40 pages, 1 figure
fields
Probability
pdf ↗ page arXiv:2611.03385 ↗

We identify the algebraic principal ideal generated by a Gaussian product of two Hilbert–Schmidt operators. Its deterministic generator is obtained by multiplying the square tails of their singular-value sequences; in a fixed diagonal basis, one probability-one event gives the identity for all decreasing square-summable weights. For the induced operation on principal ideals, we prove an order dichotomy for arbitrary families of strictly positive probes. A family jointly determines every inclusion if and only if its tail stable-rank profiles have no common eventual upper bound. Equivalently, each prescribed countable input system admits one probe from that family reflecting all inclusions. If the condition fails, one common fibre contains a copy of $\mathcal P(\mathbb N)/\mathrm{Fin}$ preserving finite sums and intersections. Its generators are continuously parametrized and arbitrarily close in Hilbert–Schmidt norm, while their deterministic output ratios tend to one at any prescribed rate. The order dichotomy follows from a bound on all probes that lose one noninclusion and a separated block construction under a scalar tail budget. Further consequences include generic separation under every positive summable envelope and exact cardinal thresholds for joint detection and single-probe separation.

comments
16 pages
fields
Probability
pdf ↗ page arXiv:2611.03495 ↗

We consider mixing for a scalar advected by random vector fields, such as solutions to stochastic fluid equations. Our main abstract result is that contraction in expectation of a negative Sobolev norm of the scalar (negative-regularity mixing) is stable under perturbations of the joint scalar-velocity process. We apply the result in three settings: mixing for a hyperviscous Boussinesq-type system where the scalar actively drives the velocity, mixing for a passive scalar advected by two-dimensional Navier-Stokes driven by smooth-in-time stochastic forcing, and a black-box proof that negative-regularity mixing implies enhanced dissipation.

fields
Probability, Analysis of PDEs, Dynamical Systems
pdf ↗ page arXiv:2611.03519 ↗

In this paper, we prove that the uniform spanning tree of $\mathbb Z^4$, seen from the origin, converges locally to an infinite spatial Brownian Kesten tree: a Brownian spine onto which independent spatial Brownian trees are grafted at a constant rate. The convergence holds jointly for the intrinsic metric, the volume measure and the Euclidean positions of the vertices, after rescaling these quantities by suitable constant multiples of $n^{-1}$, $n^{-2}(\log n)^{1/3}$ and $n^{-1/2}(\log n)^{-1/6}$, respectively, under the local rooted spatial Gromov-weak topology. The rescaled space-time occupation measure converges to that of infinite canonical super-Brownian motion. We also identify the limiting law of the rescaled intrinsic-ball volume and obtain sharp first-moment asymptotics.

comments
42 pages
fields
Probability
pdf ↗ page arXiv:2611.03582 ↗

We show that enriching a non-convex multi-species Hamiltonian by a uniform Ruelle probability cascade implies synchronization of the joint overlap array without an additional regularizing perturbation. In particular, we show that any limit point of the overlap array is a deterministic non-decreasing function of a uniform Ruelle probability cascade.

comments
11 pages
fields
Probability
pdf ↗ page arXiv:2611.03587 ↗

Mathematical Physics69

Understanding when quantum many-body systems rapidly converge to thermal equilibrium is a central problem in quantum statistical mechanics. While spatial locality provides powerful tools for systems with an underlying geometry, fully connected models require estimates that accommodate interactions between every pair of spins. We study Gibbs-state preparation for two-local quantum Hamiltonians on arbitrary interaction graphs, including fully connected systems, via Lindblad dynamics that satisfies Kubo–Martin–Schwinger (KMS) detailed balance. Our approach is based on a quantum analogue of the classical Dobrushin condition, which controls the influence of local perturbations on the rest of the system. Using the quantum Wasserstein distance of order $1$, we quantify how these perturbations propagate under the dynamics and derive contraction estimates in a high-temperature regime controlled by the maximum total interaction strength per site. These estimates require no assumptions on spatial geometry or graph growth and yield mixing times logarithmic in the system size and the inverse error tolerance, uniformly over all initial states.

fields
Mathematical Physics
pdf ↗ page arXiv:2610.40361 ↗

Characterizing local Hamiltonians that host interesting many-body states as eigenstates has been an important problem in quantum many-body physics. For matrix product states (MPS), there is a well-known construction of parent Hamiltonians that have the MPS as the frustration-free ground state. However, recent results on quantum many-body scars have shown that such a construction does not exhaust all possible Hamiltonians that have the MPS as an eigenstate. In this work, we develop an exhaustive construction of generalized parent Hamiltonians that have a given translation-invariant MPS as an eigenstate. These go beyond the conventional projector-based construction of frustration-free parent Hamiltonians, where each local Hermitian term has the MPS as an eigenstate, by allowing non-Hermitian telescoping terms that cancel out with periodic boundary conditions (PBC). We derive a local tensor equation that establishes a correspondence between inequivalent classes of generalized parent Hamiltonians, i.e., those that cannot be related using linear combinations with frustration-free Hamiltonians, and the MPS transfer matrix spectrum. We illustrate the connection to intrinsic physical properties, including non-Abelian symmetries and zero correlation length, and further extend this construction to block-injective MPS. Our framework hence provides a systematic bridge between generalized parent Hamiltonians and the local structure of quantum states.

comments
5+18 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.00203 ↗

A local action is given for Kodaira–Spencer gravity by solving a constraint on the complex structure deformation of a Calabi–Yau threefold in terms of a $(1,1)$ form as the new gravity field. The gauge algebra becomes a genuine $L_{\infty}$ algebra based on a Courant algebroid, while the gravity field and its linearized gauge transformations coincide with those of double field theory. On a real three-dimensional slice, the free action reduces to the Fierz–Pauli action for massless spin-2 plus the Kalb–Ramond action for a B-field. Non-linearly, the theory carries parity-odd interactions with three derivatives, and it is gauge invariant without a level-matching constraint, in this sense defining an unconstrained double field theory. The full theory is encoded in a cyclic $L_{\infty}$ algebra, for which a double copy interpretation is given.

comments
28 pages, produced in collaboration with Claude
fields
Mathematical Physics
pdf ↗ page arXiv:2611.00213 ↗

We consider nearest-neighbour interactions on spin-1/2 chains. We find the full set of integrable models of this form and apply a numerical algorithm to determine the "closest" integrable model for a given Hamiltonian. This allows us to define a model-independent distance to integrability. We show that standard measures of chaos interpolate between integrable and chaotic values with increasing values of this distance. However, there is a large variation across models and the distance to integrability provides additional information not directly provided by these diagnostics.

comments
8 pages, 4 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.00233 ↗

We study the phase-space dynamics and multicomponent wave-packet structures of the Dunkl anharmonic oscillator (Kerr medium). Starting from the time-evolved state, we derive analytical expressions for the Dunkl-Husimi $Q$-function and a normalized angular Husimi profile. The Dunkl parameter modifies the coherent-state excitation weights and the parity-dependent phase accumulation, producing angular anisotropy and asymmetric phase-space separation. For the half-integer deformation $μ=0.5$, the dynamics generate asymmetric multicomponent Husimi patterns with unequal peak heights and an early reconstruction at $t=π/λ$. For the deformation $μ=1.0$, the Husimi distribution exhibits broadening while retaining its multimodal structure and unitary evolution. At the fundamental nonlinear revival time, the wave packet is reconstructed for the selected parameter ratio. The standard Kerr dynamics are recovered in the limit $μ\rightarrow 0$.

comments
17 pages, 4 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.00280 ↗

We study the two fourth-order quantum superintegrable systems in the Euclidean plane that separate in polar coordinates and whose angular potentials are determined by the general four-parameter sixth Painlevé transcendent. One system has an oscillator radial term and the other an extended-Coulomb radial term. For both systems we give the fourth-order quantum integral explicitly, derive the cubic symmetry algebra and its Casimir, and construct a deformed-oscillator realization. At fixed energy the two algebras are specializations of the Heun–Racah algebra. Their structure functions contain the same quartic angular factor, determined by the Painlevé~VI parameters, while different radial factors distinguish oscillator and Coulomb dynamics. The Coulomb integral is obtained by transforming the Cartesian Hermitian symmetry at the operator level. The lower-order terms generated by the polar coordinate change are essential for commutation with the Hamiltonian. The two quantum systems are also related by the Levi-Civita transformation and coupling-constant metamorphosis, which gives a direct correspondence between their Painlevé parameters, algebras, Casimirs and representations. Earlier exceptional-Jacobi models arise at special rational parameter values, whereas the results here apply to the full four-parameter Painlevé~VI family. We also compare the quantum results with the corresponding classical Poisson algebras.

comments
27 pages
fields
Mathematical Physics, Classical Analysis and ODEs
pdf ↗ page arXiv:2611.00322 ↗

We study the spectral stability of soliton solutions of the parametrically driven and damped nonlinear Schrödinger (PDDNLS) equation with power-law nonlinearity $|Ψ|^{2κ}Ψ$ in $N$ dimensions. We identify two families of stationary solutions, $Ψ_\pm$, whose existence is determined by two conditions: one involving the nonlinearity exponent~$κ$ and the spatial dimension~$N$, and another involving the forcing amplitude~$r$ and the damping coefficient~$ρ$. By linearising around these solutions and introducing a convenient parametrisation through~$\varepsilon$, we reduce the stability problem to a dissipationless eigenvalue problem for two Schrödinger-type operators, $L_0$ and $L_1$. We prove that $Ψ_-$ is always unstable, while for $Ψ_+$, we carry out a complete spectral analysis by decomposing the problem into angular momentum sectors $\mathcal{S}_l$. We show that modes with $l \geq 2$ generate no instabilities and that no complex quadruplets arise on~$\mathcal{S}_1$. We also derive an analytical instability criterion on $\mathcal{S}_l$ by combining a Vakhitov–Kolokolov-type argument with a local analysis that determines the direction of the eigenvalue splitting near the origin. In addition, we uncover new phenomena at both small and large values of $κ$ that were not investigated in earlier one-dimensional studies. Numerical stability diagrams for $N = 1, 2, 3$ are presented.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.00346 ↗

The dynamics of the nonlinear Dirac equation (NLDE) under the influence of dissipation and parametric forcing exhibit complex phenomenologies, including soliton destruction and chaotic transitions, which have been extensively observed in numerical simulations. However, a rigorous analytical understanding of the underlying instability mechanisms in the subcritical regime has remained open. In this work, we provide a theoretical answer to these numerical findings by establishing the spectral instability of the fundamental soliton solution. Our methodology relies on a three-step approach linking local asymptotic analyses with global topological arguments. First, we characterize the generalized null space at the critical parameter ($λ_c$), revealing the onset of instability through the splitting of the zero eigenvalue within a parity-dependent subspace. Second, in the non-relativistic limit ($λ\to 0$), we use a Lyapunov–Schmidt reduction to reduce the linearized Dirac's operators into a Pöschl–Teller Schrödinger operator, thereby identifying the instability source as a unique real pair of discrete eigenvalues in the restricted problem. Third, we extend these local results to the entire subcritical domain using a topological continuation argument, which tracks the invariance of the spectral parity in a subset of the complex plane. These analytical results rigorously confirm the instability of the soliton, providing the mathematical mechanism for the wave collapse observed in the driven-damped system.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.00373 ↗

We revisit the Segawa–Suzuki spectral mapping theorem for abstract Szegedy-type quantum walks from a block-encoding viewpoint. Retaining both eigenspaces of the involution underlying the chiral symmetry yields a natural two-by-two block representation in which the usual discriminant operator and its counterpart form the diagonal blocks. The non-endpoint spectral mapping theorem then follows from an elementary Schur decomposition, substantially simplifying the original proof by avoiding its invariant-subspace decomposition and approximate-eigenvector arguments. The same framework establishes the result for the spectrum, point spectrum, and Fredholm essential spectrum and gives a direct block-theoretic description of the endpoint inherited and birth eigenspaces. We illustrate the construction with a one-dimensional split-step quantum walk.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.00498 ↗

We study a real scalar field nonminimally coupled to curvature on a fixed Ellis wormhole background. The scalar perturbation decouples at linear order, and the substitution $ x=a \tan z $ reduces its static radial equation to a trigonometric Pöschl-Teller problem. This yields the exact threshold spectrum $ ζ_{n\ell}=(n+\ell+1)^2/2 $, closed-form Gegenbauer profiles, and an exact count of negative radial eigenvalues in each angular sector. The s-wave thresholds are zero-energy resonances at which the growth rate rises linearly, whereas the $ \ell \geq1\ $ threshold states are square integrable and the growth rate rises as a square root. At the first threshold we also obtain the next-order term, $ σa=(π/4)g-(3π/16)g^2+O(g^3) $ with $g=2ζ-1 $. For a probe field with quartic self-interaction, we show that no nontrivial spherical static solution exists for $ζ\leq1/2 $ and derive local branch expansions near the s-wave thresholds. Numerical evolutions are consistent with saturation on the nodeless branch. These nonlinear results refer to the probe-field model; they do not establish the existence or stability of fully backreacted scalarized wormholes.

comments
9 pages, 4 figures, 1 table. Ancillary files contain the numerical codes
fields
Mathematical Physics
pdf ↗ page arXiv:2611.00541 ↗

Geophysical flows are routinely decomposed into mean flow and waves, and the procedure used determines how the motion is divided between the two. Ideally, the wave and mean motions of interest evolve on distinct timescales, in which case they can be separated by taking an infinite-time average over all wave periods. Individual waves average away, while exactly resonant interactions contribute to the averaged dynamics because they are steady on the fast timescale. We generalize this averaging to finite windows, yielding a family of decompositions that additionally retain near-resonant interactions whose phases do not fully cancel over the time window. Such averaging necessarily invokes a choice of reference frame; the same flow averaged in two frames may yield mean flows differing by a drift. The averaging formulation developed here enables us to express Stokes drift through resonant and near-resonant interactions, confirming the intuition that it is a slow quantity generated by fast waves and revealing a coherent near-resonant contribution generally present in Stokes drift calculated over finite time from broadband wave fields. We use the fast-wave evolution underlying the exact average to define both the wave reference frame, in which the fast phase is steady, and a wave-frame average. We cast familiar Eulerian and Lagrangian averages and this wave-frame average in a common form to further illustrate how the chosen frame determines which motions enter the mean. This view of averaging provides a common basis for comparing decompositions and choosing among them according to the physical processes one seeks to isolate.

comments
45 pages, 9 figures. Submitted for peer review
fields
Mathematical Physics
pdf ↗ page arXiv:2611.00644 ↗

We study the large-$N$ asymptotics of ratios of Lukyanov integrals for fixed real coupling $b\geq1$. Our approach uses their biorthogonal ensemble structure and vector Riemann–Hilbert techniques. Under stated analytic hypotheses, we derive the logarithmic ratio through its constant term, which is expressed by a Fredholm determinant. The expansion is locally uniform in the real parameter $α$ and is formulated separately for even and odd particle numbers. We verify the hypotheses for the correction defined by the physical ground-state thermodynamic Bethe ansatz. The relation to quantum-field-theoretic one-point functions is discussed separately.

comments
52 pages, 2 figures
fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2611.00662 ↗

In this note we present a detailed computation of the BPS states from M2-branes wrapping 2-cycles in local Calabi-Yau manifolds, at the level of brane quantization. For the cases of local Calabi-Yau threefolds, the supersymmetric quantum mechanics is the 1d $\mathcal{N}=4$ non-linear sigma model. We achieve systematic, physical interpretations of refined Gopakumar-Vafa (GV) invariants, first for the curve classes with fixed geometric genus, and then for curves whose geometric genus jumps. The BPS states of 5d $\mathcal{N}=1$ superconformal field theories are interpreted from the local geometries, which are presented in a number of case studies. In particular, we compute the refined GV invariants for generalized conifolds, local CY3 giving 5d $\mathcal{N}=1$ gauge theories and a singularity whose crepant resolution contains a singular divisor. For the cases of local Calabi-Yau fourfolds, we point out the supersymmetric quantum mechanics is of type $\mathcal{N}=2B$. We set up the framework for studying M2-branes wrapping 2-cycles, and discuss a few cases of M2-brane wrapping genus-0 curves with this new approach.

comments
66 pages, 1 figure
fields
Mathematical Physics
pdf ↗ page arXiv:2611.00687 ↗

The Lane-Emden Equation is a class of nonlinear differential equations commonly used to model phenomena in astrophysics and mathematical physics, such as stellar structure and thermal behavior in polytropic gas spheres. This study presents a novel hybrid framework that integrates Physics-Informed Neural Networks (PINNs) with boosting methods to enhance the accuracy and robustness of solutions for Lane-Emden type differential equations. Standard PINNs leverage physical laws encoded within the loss function, but their predictive performance can be constrained by optimization challenges and approximation errors. To address this, we introduce a post-processing boosting stage where the residual errors from the PINN prediction are modeled using some regression algorithms - including LightGBM, Random Forest, XGBoost, and Support Vector Regression (SVR). The outputs from these boosted models are aggregated to generate a corrected, high-fidelity prediction. The proposed methodology is systematically validated through quantitative metrics and comparative analysis against the standard PINN baseline. The results demonstrate that the boosted PINN framework significantly reduces prediction error, and improves generalization, offering a powerful and flexible approach for solving scientific and engineering problems governed by differential equations.

comments
24 pages, 25 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.00701 ↗

Learning in a neural network takes place on a high dimensional, non-convex loss landscape, the Hessian curvature of which dictates the learning dynamics. Despite its high dimensionality, the large number of architectural symmetries explains some of the geometric of this landscape, in particular flat directions, i.e. near-zero modes of the Hessian. These architectural symmetries have therefore been suggested as an organizing principle of deep learning. It remains an open question, though, wether there are additional organizing principles in the remaining degrees of freedom in the learning dynamic. Here we identify task-dependent contingent symmetries as such an additional organizing principle. We show that non-flat learning directions emerge due to explicit breaking of these contingent symmetries. We isolate this symmetry in an analytically solvable minimal model. Furthermore, we show that, by tuning an L2 penalty, signatures of the symmetry breaking become measurable. As a consequence of the same mechanism, adding noise to the data drives the model through a sequence of broken symmetry recoveries in the form of Baik-Ben-Arous-Péché (BBP) transitions. We demonstrate analytically for linear and numerically for deep linear networks that the contingent symmetry group remains explicit, and that the symmetry-breaking mechanism identifies which Hessian modes carry task-specific information. These signatures are measurable without a symmetry-group description and, hence, offer a route to study symmetry breaking as a more general principle in nonlinear networks and other learning systems.

comments
31 pages, 7 figures;
fields
Mathematical Physics
pdf ↗ page arXiv:2611.00745 ↗

We prove a representation theorem for finite series-parallel viscoelastic networks composed of springs and spring-pots of a common order $0<α<1$. The associated complex shear modulus, expressed in an appropriately chosen auxiliary variable, is rational and admits a finite partial-fraction representation with simple poles on the negative real axis and negative residues. Its reciprocal admits an analogous representation with positive residues and a possible additional pole at the origin. Inverting the corresponding Laplace transforms gives finite fractional Prony representations of the relaxation modulus and creep compliance with non-negative amplitudes. These results provide a rigorous proof of a corrected version of the Mainardi-Spada conjecture for this network class. A six-element network illustrates the construction.

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

Lieb-Robinson bounds formulate emergent causality in quantum many-body dynamics. In this Letter, we study interacting bosonic systems with long-range interactions, in which both the standard assumptions of short-range interactions and uniformly bounded local energy scales are absent. We derive upper and lower bounds whose effective light-cone exponents are governed by a nontrivial interplay between the decay exponent $α$ and the bosonic interaction order $p$. The propagation protocol concentrates bosons within blocks, creating a mediating sublattice with amplified interactions. For $p\ge4$ and $2d<α\le2d+1$, the resulting exponents coincide, determining the optimal leading light-cone power. The upper bound includes $α=2d+1$ with arbitrarily small exponent loss, using a fixed-$k$ extension of the bounded-interaction result. Our results reveal that the interplay between long-range couplings and unbounded bosonic degrees of freedom gives rise to a richer light-cone structure than in either long-range bounded systems or short-range bosonic systems alone.

comments
10 pages, 1 figure; Supplementary Material: 75 pages, 6 figures, 1 table
fields
Mathematical Physics
pdf ↗ page arXiv:2611.00776 ↗

The non-Hermitian nature of black hole quasinormal modes (QNMs) can give rise to remarkable spectrum instability. Such instability is naturally characterized by the pseudospectrum for the operator. However, conventional pseudospectrum analyses permit arbitrary operator perturbations that may not correspond to physically admissible modifications. In this work, we introduce the structured pseudospectrum into black hole perturbation theory. We construct two physically motivated perturbation spaces based on effective field theory and the Rezzolla–Zhidenko parametrization, and get their structured pseudospectra using two distinct norms. Our numerical results show that imposing physical constraints substantially reduces the accessible spectrum instability, especially for higher overtones. More importantly, at sufficiently small perturbation scales $\varepsilon$, the structured pseudospectrum around isolated QNMs exhibits approximately elliptical contours with preferred directions that depend on both the mode and the perturbation space, revealing an anisotropic structure beyond the familiar circular behavior of the conventional pseudospectrum.

comments
21 pages, 5 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.00853 ↗

We characterize the exact error-exponent trade-off in binary quantum hypothesis testing with a rejection option for faithful states on a finite-dimensional Hilbert space. The probabilities of rejection under the two hypotheses are required to vanish exponentially, with exponents at least $K$ and $L$. We show that a quadruple $(a,b,K,L)$ of positive error and rejection exponents is achievable if and only if it satisfies three single-letter conditions: two conditions involve Petz–Rényi quantities and coincide with the converse bound conjectured to be tight by Ji and Regula; the third involves the $α$--$z$ Rényi quantities on the triangle $\max\{α,1-α\}\le z\le1$. The proof combines a sector decomposition inside Schur–Weyl blocks, an explicit one-shot measurement construction, and an exact minimax argument.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.00931 ↗

The exact thermodynamics of the XX spin-1/2 chain with arbitrary Hermitian boundary fields is constructed via fusion techniques. The rigorous result shows that (1) each end with a nonzero transverse field contributes $+\frac12T\ln2$ to the low-temperature free energy, whereas strictly diagonal and free ends contribute no such linear term; (2) each nondiagonal end has a characteristic temperature $T_B$, which scales as $T_B\propto h_\perp^2/J$ in the weak-field regime. For $T\ll\min\{J,T_B\}$, the boundary entropy approaches a deficit of $\frac12\ln2$ relative to a diagonal end. As the transverse field tends to zero, the boundary crossover scale vanishes and the low-temperature expansion becomes nonuniform. The present result provides a clear benchmark not only for the boundary thermodynamics of open boundary quantum integrable systems, but also for dot defects in quantum critical systems.

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

We study superintegrable Hamiltonian systems in terms of Poisson projection chains and their (spectral) equivalence. We compare two reduction constructions: (i) the cotangent bundle $T^*(G/A)$, $A=Z_G(γ)$, with the magnetic symplectic form defined by the orbit $G\cdot γ\cong G/A$, and (ii) the left-right Hamiltonian reduction of $T^*G$ that gives spin Calogero-Moser type systems. We prove that the two resulting chains are equivalent on an open set of regular points of principal orbit type: the phase spaces, the intermediate Poisson manifolds and the base spaces are identified compatibly with the projections. In particular, both constructions give the same commuting Hamiltonians.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.00992 ↗

We formulate a canonical quantum curve conjecture $\widehat HΨ_*=0$ for spectral curves of positive genus. Here $Ψ_*$ is the non-perturbative wave function associated with Eynard–Orantin topological recursion, specialized at the \emph{canonical vanishing point}, a distinguished zero of the closed non-perturbative partition function. The operator $\widehat H$ is obtained by Weyl quantization of $H(x,y)$, with $\widehat x=x\cdot$ and $\widehat y=\hbar\partial_x$, together with quantum corrections to its coefficients. These corrections depend only on closed moduli and $\hbar$ and vanish classically. Whenever a geometric definition is available, we conjecture that the corrected coefficients are suitably normalized Wilson-loop expectation values. When a corresponding refined theory exists, we conjecture a relation between the canonical vanishing point and the closed Nekrasov–Shatashvili free energy. We prove the quantum curve conjecture for Weierstrass curves and the mirror curves of canonical bundles of smooth projective toric weak del Pezzo surfaces, including local $\mathbb P^2$. For the local surfaces considered here, we relate the canonical vanishing point to a derivative of the closed NS free energy. For local $\mathbb P^2$, we also identify the corrected coefficient with a suitably normalized, geometrically defined NS Wilson-loop expectation value.

comments
42 pages
fields
Mathematical Physics, Algebraic Geometry
pdf ↗ page arXiv:2611.00997 ↗

Non-conservative active driving breaks detailed balance in non-Gaussian jump-diffusions, obscuring the connection between external protocol work, housekeeping dissipation, and free-energy differences. Here, we establish exact finite-time fluctuation relations for driven Markov jump-diffusions—encompassing infinite-activity Lévy processes—by comparing path probabilities under the forward and current-reversed dual dynamics relative to the instantaneous steady state (ISS). We derive a trajectory-level decomposition of total entropy production that cleanly separates transient state relaxation, housekeeping heat, and external protocol driving. When the ISS takes a Gibbsian form, gauge-tilting the dual path measure yields an Active Jarzynski equality, $\langle\exp[-(W+Δs_{\mathrm{act}})]\rangle_{π_0}=e^{-ΔF}$, which incorporates active housekeeping entropy $Δs_{\mathrm{act}}$ alongside mechanical work $W$ and coexists with the conventional Jarzynski equality. Under protocol reversal, this dual framework further reveals an Active Crooks relation, where the asymmetry between forward and reverse work distributions is governed by the conditional exponential average of active dissipation. Our results provide a framework for recovering free-energy differences in driven jump-diffusions with Gibbsian instantaneous steady states and for characterizing active irreversibility through trajectory statistics.

comments
8 pages, 2 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.01009 ↗

We propose an approximate Hamiltonian dynamics for the Gross–Pitaevskii equation $i\hbarψ_t = -\frac{\hbar^2}{2m}Δψ+ V(x)ψ+ \hbar^2 λ|ψ|^2ψ$ with harmonic potential $V(x)$ and $x\in\mathbb{R}^d$. We do this by extending the Gaussian ansatz of Perez-Garcia et al.~(Phys.~Rev.~A 56, 1424 (1997)) to the semiclassical wave packets of Hagedorn. We derive the evolution equations for the wave packets from the Hamiltonian/symplectic perspective, rather than the Lagrangian/variational one taken by Perez-Garcia et al. We first show that these two perspectives yield identical evolution equations in the Gaussian case. We then derive the evolution equations for an arbitrary element of the semiclassical wave packets. Finally, we demonstrate the efficacy of the approximate dynamics with numerical experiments.

comments
11 pages, 5 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.01108 ↗

We investigate effects of longitudinally varying nonlinearity on periodically distributed amplification systems in optical fibres. Emphasis is made on configurations in which the nonlinear coefficient exponentially grows or decays along the propagation distance, while the group-velocity-dispersion (GVD) coefficient is held constant. Such systems are of practical relevance to the design of highly efficient nonlinear devices, including broadband light sources and advanced amplification schemes, where precise management of the interplay between the GVD, nonlinearity, and gain is essential. Adopting the known generic integrability condition, we derive exact analytical expressions for the evolution of the optical field in the presence of the tailored nonlinearity profiles and periodically distributed gain. The resulting periodic wavetrain solutions and their long-wave limit in the form of bright and dark solitons provide insight into the controlled enhancement or suppression of nonlinear effects under realistic amplification conditions. The robustness of these solutions is examined by introducing finite perturbations and directly evaluating their effects on the corresponding intensity profiles. The structural stability of solutions against deviations from the integrability condition is demonstrated too. Outcomes of this study contribute to a deeper understanding of the nonlinear pulse dynamics in engineered gain-managed fibres and offer guidance for the development of novel optical systems, where the spatial distribution of the nonlinearity is exploited to optimise the performance.

comments
To be published in Physics Letters A
fields
Mathematical Physics
pdf ↗ page arXiv:2611.01159 ↗

We develop a density-functional theory for the Pauli-Fierz Hamiltonian of nonrelativistic quantum electrodynamics in the spirit of the convex-analytic formulation of Lieb. We consider finitely many electrons, subject to external scalar and vector potentials, coupled to the full continuum of massless transverse photons with an ultraviolet cutoff. The natural basic variables are the standard electron density and a combined current density, the sum of the paramagnetic current density and a field-induced current density generated by the quantized vector potential. We prove representability results for these density-current pairs and show that the mixed-state constrained-search functional attains its infimum and coincides with the Lieb functional obtained by convex conjugation. Since arbitrarily soft photons purify mixed states at a negligible energy cost without changing their density and combined current density, the pure-state Levy-Lieb functional equals the Lieb functional and is therefore convex, even though its infimum need not be attained. In addition, we establish the zero-coupling limit, which recovers the mixed-state Vignale-Rasolt functional of current-density-functional theory. Finally, we consider the long-wavelength (dipole) limit and show that the limiting functional can be written as a constrained search for the well-known length-gauge dipole Hamiltonian.

code
github.com/xyzw/qedft_pf_pub ∎ Lean project (gpt_lean/lakefile.toml, gpt_lean/lean-toolchain) is too large to build within the check's time limit at 03fa937, checked 2026-11-03 build details
fields
Mathematical Physics
pdf ↗ page arXiv:2611.01208 ↗

A sharp interface can retain material and structural information about an unresolved fluid transition zone. We formulate a local thermodynamic framework for isotropic surfaces carrying constituent surface mass densities and a thickness descriptor. The distinction between densities of additive contents and internal descriptors determines the area conjugate, reversible surface stress, and Gibbs-Duhem relation. A volume-per-area thickness has a pressure-like conjugate, a mechanical work contribution, and a separate evolution equation. Independent, constrained, and rapidly equilibrating thicknesses require different kinematics and reductions. Material storage can be retained without retaining surface inertia. The balances and entropy production specify admissible exchange and structural relaxation. For a moving surface patch, an available-free-energy identity accounts for mechanical power and for the contributions of material and structural fluxes across its boundary. Equilibrium reduction retains the production and transport needed to follow the reduced state. An explicit mass-thickness free energy has a positive-definite material Hessian and gives coupled adsorption, expansion, compression, and dissipative relaxation. Pressure response yields conditional restrictions on reduced states and demonstrates that distinct independent and constrained states can share an entire pressure-tension curve. Geometric thickness realizations and finite-rate transfer are treated with their associated mechanical and balance requirements. The framework separates state selection, constitutive closure, reduction, and identification from observations.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.01227 ↗

We study the infinite-dimensional Lindblad generator $L_ε=D[a^2-α^2]+εD[a]$, describing a dissipative cat qubit subject to single-photon loss. For sufficiently large $α$ and sufficiently small $ε>0$, we identify a two-dimensional spectral subspace near zero and establish an upper bound on the slow decay rate that decreases exponentially with $α^2$, uniformly in $ε$. This proves exponential suppression of bit-flip errors.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.01296 ↗

A bipartite state is absolutely positive partial transpose (APPT) if it remains PPT under every global unitary transformation, and absolutely separable if it remains separable. For every qutrit–qudit system $\mathbb{C}^3\otimes\mathbb{C}^n$, $n\ge3$, we prove that the maximum purity is the same for absolutely separable and APPT states and equals $\max\{(3n+8)/(3n+2)^2,\,3/(8n)\}$. The maximizing ordered spectrum is unique and contains exactly two distinct eigenvalues: the larger one has multiplicity one for $3\le n\le8$ and multiplicity $n$ for $n\ge9$. We also derive, in terms of the purity, an upper bound on the minimum partial-transpose eigenvalue achievable by global unitary transformations, and characterize all states for which the bound is attained. These results confirm the inscribed-polytope purity conjecture of Ahiable, Kothakonda, and Winter for all qutrit–qudit systems. They also give a lower bound, sharp over explicit purity ranges, on the global depolarizing noise needed for absolute separability or APPT.

comments
20 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.01306 ↗

For $m\otimes n$ systems with $n\ge m\ge3$, we determine the exact maximum purity of absolutely positive partial transpose (APPT) states and the unique maximizing ordered spectrum when $n\ge2m^2-4$ for even $m$ or $n\ge2m^2-m-4$ for odd $m$. Under these dimension assumptions, absolutely separable states have the same maximum purity, attained at the same unique ordered spectrum. The proof uses an outer polytope defined by two linear head–tail inequalities, each comparing a sum of the largest eigenvalues with a sum of the smallest. Under explicit multiplicity assumptions, we derive an exact matrix criterion for APPT membership of full-rank spectra with three distinct eigenvalues. For every $m\ge10$, this criterion gives explicit APPT boundary spectra at $n=4m-2$ and $n=4m$ that disprove both cases of the maximum purity conjecture of Ahiable, Kothakonda, and Winter. We also determine the exact completely absolutely separable (CAS) purity maximum and its unique maximizing ordered spectrum in every bipartite dimension. We prove that the inner APPT polytope consists entirely of absolutely separable spectra. The resulting linear sufficient condition for absolute separability strictly improves the reduction-map and eigenvalue-ratio tests. Finally, we compute the exact relative volumes of the CAS set and an outer polytope defined by a single head–tail inequality. Under the uniform measure on spectra, the CAS, absolutely separable, and APPT volumes have the same asymptotic order $\sqrt n\,e^{-κ_m n}$ for every fixed $m\ge2$, with explicit $κ_m>0$.

comments
34 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.01492 ↗

We derive an Eynard-Orantin topological recursion for intersection numbers involving Norbury's $Θ$-class together with $ψ$-classes and higher $κ$-classes. These intersection numbers encode higher Weil-Petersson volumes of moduli spaces of super Riemann surfaces. The resulting recursion is a higher-$κ$ deformation of the topological recursion associated with the Bessel curve, which encodes the Brézin-Gross-Witten model.

comments
13 pages
fields
Mathematical Physics, Algebraic Geometry
pdf ↗ page arXiv:2611.01497 ↗

We present a systematic study of the mathematical theory of the generalized Brézin-Gross-Witten (BGW) theory using methods from statistical physics. We prove the multidifferentials of the generalized BGW theory are given by the Eynard-Orantin topological recursion in a generic background with general coupling constants. Furthermore, we characterize the transition between the Witten-Kontsevich model and the generalized BGW theory. This approach yields a new proof of the Okuyama-Sakai conjecture, further elucidating the deep structural connections between these two fundamental models.

comments
53 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.01507 ↗

We study the problem of learning a finite-range quantum Hamiltonian on an $n$-qubit $D$-dimensional lattice from copies of its Gibbs states at a known inverse temperature $β$ or its thermal metastable states. Existing efficient algorithms at arbitrary temperature have sample guarantees with an $e^{\poly(β)}$ dependence, leaving open whether the exponent can be made linear in $β$. We achieve this improvement: for $β\ge1$, our algorithm learns all Hamiltonian coefficients to $\ell_\infty$-error $ε$ with probability at least $1-δ$ using $\tO\bigl(e^{O(β)}ε^{-2}\log(n/δ)\bigr)$ copies and total time $\tO\bigl(n e^{O(β)}ε^{-2}\log(n/δ)\bigr)$. The measurements act on individual copies and are supported on balls of radius $O\bigl(β^2+β\log(1/ε)\bigr)$. Our sample complexity achieves the optimal exponential order in $β$, with optimal $ε^{-2}$ dependence up to logarithmic factors. Building on the stationarity-test framework \citep{Bergamaschi2026Stationarity}, we prove a unified Fisher-information coercivity bound showing that errors in the candidate Hamiltonian produce a detectable signal with only an $e^{-O(β)}$ loss in sensitivity. The key is a smooth frequency filter whose bandwidth remains independent of temperature, together with sharper estimates relating this signal to the Hamiltonian coefficients. For thermal metastable states, the guarantee holds under local drift $ζ\le e^{-Cβ^{2D+1}}$, for a geometry-dependent constant $C>0$, and above an accuracy floor $\tO(e^{O(β)}ζ)$. The argument applies to both Gibbs and thermal metastable states and, combined with local measurements and projected stochastic gradient descent (SGD), yields both learning guarantees.

comments
43 pages, 1 table
fields
Mathematical Physics
pdf ↗ page arXiv:2611.01520 ↗

Polyakov predicted that the classical Heisenberg model on $\mathbb{Z}^2$ has exponentially decaying correlations at every temperature, and a proof of this has recently been posted. We show that the massive phase survives small anisotropy. For every inverse temperature $β$ there is $δ(β)>0$ such that the $S^2$-valued model with couplings $\sum_iJ^iσ_x^iσ_y^i$ has exponentially decaying spin two-point functions, uniformly in finite subgraphs with free boundary conditions and in edge strengths up to $β$, whenever $|J^i-1|\leδ(β)$ for $i=1,2,3$. For the easy-plane model with couplings $σ^xσ^x+σ^yσ^y+λσ^zσ^z$ this shows that the onset of the Berezinskii-Kosterlitz-Thouless phase, proved by Garban and de Montgolfier for every $λ\in(-1,1)$, moves to zero temperature as $λ\uparrow1$: in free-boundary limits, correlations decay exponentially for every $β\le c |\log(1-λ)|^{1/2}$. The physical prediction is of order $|\log(1-λ)|$. The same holds for aligned single-ion anisotropy, which includes a confining potential $\varepsilon\sum(σ^z)^2$, and for nearly isotropic $O(n)$ models with $n\ge3$. The proof keeps the sign-cluster argument of the isotropic proof, using Ginibre's correlation inequality for anisotropic planar energies, and uses the rotation symmetry only on one finite annulus, where the anisotropy is a bounded perturbation of the Hamiltonian.

comments
9 pages, 2 figures
fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2611.01532 ↗

The periodic table of topological insulators and superconductors emerges from two distinct approaches: boundary Anderson localization and momentum-space K-theory. Connecting these approaches physically requires deriving the boundary sigma-model topological terms from the underlying fermion theories. We develop an index-theoretic framework for minimal massless boundary Dirac models in the eight real Altland–Zirnbauer classes. Its central ingredients are an elliptic cylinder operator interpolating between two sigma-field textures, a quotient index defined by the cylinder's graded Clifford symmetry algebra, and an index theorem identifying its protected zero-mode index with the relative homotopy class of the endpoint textures. To establish this correspondence, we deform the cylinder texture while preserving the kernel's index class and localize the obstruction to a Clifford defect. An exact oscillator-kernel calculation fixes the generator normalization. A field-independent congruence and a common regularization provide a real antisymmetric Pfaffian representative whose sign transport is related to the cylinder mod-two index by Witten's spectral-flow argument. This yields the nontrivial $\mathbb{Z}_2$ theta weight for one minimal physical module. Combining complex-parent anomalies with physical Clifford multiplicities and real-target periods also gives the real-class Wess–Zumino terms with unit spherical level. The framework thus provides an operator-level connection between boundary Dirac theories and the sigma-model topological terms associated with the periodic table.

comments
28 pages, 1 figure
fields
Mathematical Physics
pdf ↗ page arXiv:2611.01619 ↗

Can a reduced neuron model reproduce first-spike latency scaling while changing how a stimulus initiates sustained firing? We compare a piecewise-linear planar Neurosimilator with its three-dimensional parent. Both exhibit logarithmic latency dependence over the investigated input intervals, with different fitted coefficients. The mechanisms differ. In the parent, sustained spiking and a stable resting focus coexist in a spiking–rest bistability regime. An abrupt step accesses spiking, while slow stimulation can retain rest at the same final input. Its step-induced firing threshold is therefore an operational basin-access threshold below the saddle-node limit point, not a loss of equilibrium stability. In the planar model, the resting equilibrium instead reaches a switching boundary while its subthreshold eigenvalues remain negative. We derive the planar latency law from this boundary approach. The model generates repetitive excursions without an imposed reset and admits exact trajectories within six switching regions. Similar measured latency scaling thus coexists with different mechanisms of access to firing. Validating a reduced model's mechanism of excitability requires examination of stimulus protocol and attractor access alongside equilibrium structure and spike timing.

comments
8 pages, 5 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.01632 ↗

Thermodynamic control seeks to realize desired functions at minimal thermodynamic cost, yet existing frameworks remain largely confined to slow driving regimes or state-to-state transport. Here we establish a thermodynamic optimal-control theory for Markov jump processes (MJPs) and chemical reaction networks (CRNs) that accommodates objectives over both states and reaction fluxes beyond slow-driving limit. By deriving the thermodynamic Hamilton–Jacobi–Bellman equation, we demonstrate that the optimal dynamics take the form of a perturbed generalized-gradient flow driven by the value function. A convex representation of the entropy-production rate via generalized means identifies its Legendre–Fenchel dual as the dissipation function. The resulting dynamics shares the thermodynamic structure of CRNs and admits an information-geometric characterization. We further derive a thermodynamic Pontryagin equation by recasting the control problem in terms of thermodynamic forces, providing a complementary description of optimal trajectories and clarifying connections to thermodynamic optimal transport. Our results establish a thermodynamic and geometric foundation for controlling MJPs and CRNs beyond mere transport, opening avenues for optimizing biological processes and finite-time thermodynamic operations in far-from-equilibrium regimes.

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

Physical restrictions on operations can make quantum coherence inaccessible. Quantifying off-diagonal density matrix elements in a chosen basis alone does not reveal which information is hidden by each restriction. To distinguish their effects, we describe physical restrictions through subalgebras of accessible observables. The associated trace-preserving conditional expectations unify two reconstruction principles: each gives both the maximum-entropy state compatible with the accessible data and the closest state in the corresponding subalgebra in relative entropy. We apply this framework to anyonic systems to separate the contributions from local-charge superselection and non-Abelian fusion rules. We prove that the charge-line severing map is the conditional expectation onto the local-product subalgebra. It is completely positive and quantum-trace-preserving, and uniquely reconstructs a state in this space from all local-product expectation values. The hierarchy of measurement restrictions then separates total bipartite coherence into three nonnegative contributions: coherence between local charges, inaccessible fusion information, and conventional coherence. The first two decompose the anyonic charge entanglement and distinguish the effects of local-charge superselection from the remaining fusion information. Finally, we relate basis-independent measures of anyonic coherence to entanglement. For pure anyonic states with vacuum total charge, the optimized total and correlated coherence equal the total and conventional relative-entropy entanglement, respectively.

comments
15 pages and 1 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.01749 ↗

Tensors are higher dimensional generalisations of vectors and matrices. Tensor networks are a diagrammatic representation of complicated relations between tensors, and tensor contraction is the evaluation of a tensor network analogous to matrix multiplication. Tensor networks and tensor contraction are ubiquitous in computer science, physics, and applied mathematics. Most existing tensor contraction algorithms are focused on finding an optimal contraction order of the tensors' bonds. However, finding the optimal order is an NP-hard problem. It is equivalent to another possibly more straightforward but still NP-hard problem of finding the treewidth of the line graph of the tensor network. While in general finding the optimal bond-by-bond contraction order is hard, in many practical cases there is no need to find an optimal order. This observation leads to the core innovation of this thesis, which is a new tensor contraction paradigm that uses graph theoretic operations to produce an equivalent tensor network whose line graph has lower treewidth than the original tensor network, before applying the bond-by-bond contraction algorithm. We call these graph theoretical operations \textit{rewrite preprocessing}, and we name the algorithms that apply rewrite preprocessing before regular bond-by-bond contraction \textit{Tensor Contraction with Graph Operation}. There are many possible ways to perform rewrite preprocessing; in this thesis, we focus on the graph operations of ZX calculus, a diagrammatic language for quantum circuits. Ample numerical simulations have been performed to demonstrate the effectiveness of our proposed method.

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

In this paper, we study nonlocal metrics on smooth positive probability densities on a closed manifold, induced by symmetric jump kernels and density-dependent mobilities. First, we introduce the density-variation operator to express the density derivatives of the Dirichlet form and kinetic energy. Second, we construct density and velocity-field representations of the tangent space and prove their isometric equivalence. We use the generator's pseudoinverse to derive Levi-Civita connections and covariant differentials in both representations. Third, we establish mechanical Hamiltonian dynamics in both tangent representations; an action principle and Legendre duality identify the Hamilton–Jacobi and covariant Newton equations; smooth negative gradient flows admit a zero-energy Hamiltonian lift. Entropy diffusion, nonlocal mean-field equations, Keller–Segel dynamics, and a nonlocal Vlasov equation illustrate the resulting calculus. For geometric-mean mobility, the Hopf–Cole transformation of the nonlocal Schrödinger bridge system and the Madelung transformation of the nonlocal Schrödinger equation yield hyperbolic and trigonometric phase energies, respectively. At zero momentum, both recover the metric kinetic energy to second order.

comments
39 pages
fields
Mathematical Physics, Differential Geometry, Dynamical Systems, Probability
pdf ↗ page arXiv:2611.01979 ↗

Both quantum and classical logics have several mutually non-equivalent and non-isomorphic models as has repeatedly been proved in the literature. Yet, several authors have recently come with criticisms of this result. In this paper, we show that the criticisms are either unfounded or wrong.

comments
13 pages, 2 figures
fields
Mathematical Physics, Logic, Quantum Algebra
pdf ↗ page arXiv:2611.02070 ↗

We prove the future $C^0$-inextendibility of a broad subclass of ingoing Vaidya spacetimes with positive mass function satisfying the weak energy condition, building on methods introduced and developed by Sbierski for the Schwarzschild spacetime.

comments
34 pages, 10 figures
fields
Mathematical Physics, Differential Geometry
pdf ↗ page arXiv:2611.02133 ↗

Detection times are routinely recorded in quantum experiments. We show that, under natural covariance and consistency requirements, the observables describing these times cannot be algebraically localized in any bounded spacetime region, even when the records themselves are localized. This challenges the identification of algebraic localization with the physical localization of measurements and shows why microcausality alone does not establish non-signalling for measurements in quantum field theory.

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

We develop a geometric formulation of classical and quantum dynamics in which projective Hilbert space is taken as the primary state space and classical configuration and phase spaces arise as submanifolds of localized quantum states. The Fubini-Study metric induces the Euclidean metric on these submanifolds, while the tangential component of Schrödinger evolution reproduces Hamiltonian and Newtonian dynamics. We then extend the construction to stochastic motion. Brownian dynamics on the localized classical manifold is lifted to a common stochastic unitary evolution in projective Hilbert space; under homogeneity, isotropy, and independence assumptions, the corresponding Hermitian increments have Gaussian Unitary Ensemble statistics. This yields a random-matrix Schrödinger dynamics whose transition probabilities depend only on Fubini-Study distance. Through the embedding of localized states, the classical Gaussian transition law becomes the Born rule in projective state space. Measurement outcomes are identified with first arrival at detector-defined finite-resolution equivalence classes, while each realized state-space evolution remains linear and unitary. The framework is applied to classical emergence, macroscopic stabilization, double-slit experiments, composite systems, and entangled states. A spatially local Caldeira-Leggett-type system-environment model is also shown, under explicit thermal, symmetry, Ohmic, and coarse-graining assumptions, to generate the Brownian family required by the stochastic lift. The remaining open problem is to establish the range and universality of this mechanism for realistic many-body measuring environments.

comments
240 pages. Forthcoming monograph
fields
Mathematical Physics
pdf ↗ page arXiv:2611.02138 ↗

We prove a nonlinear adiabatic theorem for the repulsive Gross-Pitaevskii (GP) equation with a time-dependent trapping potential $V(x,t)$. If either (i) $V(\cdot,t)$ is smooth, subquadratic in space and with uniformly bounded spatial derivatives of order $\geq 2$, or (ii) $V(\cdot,t)$ is a uniformly bounded perturbation of a fixed non-negative potential which is asymptotically $|x|^m, m\geq 2$, then the GP equation has a global solution, which remains uniformly close to the instantaneous minimizer of the time-independent GP functional, provided the initial condition is a ground state. In fact, we show that the existence of a solution of the GP equation is the real bottleneck: If existence is assumed, then adiabaticity holds under very minimal assumptions.

comments
33 pages. Comments are welcome!
fields
Mathematical Physics, Analysis of PDEs
pdf ↗ page arXiv:2611.02231 ↗

A (non-standard) quantum deformation of the Lorentz algebra $\mathfrak{so}(1,3)$ is used to construct novel time-dependent Hamiltonian systems on the (anti-)de Sitter spacetimes in $(1+1)$-dimensions. The specific deformation considered here contains, among others, the non-standard quantum deformation of $\mathfrak{sl}(2, \mathbb{R})$ and that of the `book' algebra $\mathfrak{b}_{2}$ as quantum subalgebras. The guiding idea is to apply the theory of Poisson–Hopf deformations of Lie–Hamilton systems to the Lorentz deformation, giving rise to a broad family of time-dependent deformed systems that share the same deformed Poisson–Hopf Lorentz algebra symmetry. In particular, this approach provides Hamiltonian vector fields expressed in terms of certain projective canonical variables, which, in turn, are related to the usual Beltrami variables via a canonical transformation. Under this construction, it is shown that the underlying Lorentizan spaces possess constant curvature $κ$ and the quantum deformation parameter $z$ can be identified with $κ$, such that the cosmological constant is $Λ=-z\equiv -κ$. Therefore, we deal with the anti-de Sitter, de Sitter and Minkowskian spaces for $z>0$, $z<0$ and $z=0$ (the undeformed case), respectively. Finally, as applications, we study time-dependent deformed oscillators on the (anti-)de Sitter spaces in detail, as well as time-dependent deformed Bateman and generalised coupled Caldirola–Kanai Hamiltonians.

comments
41 pages, 2 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.02242 ↗

We study the transport properties of Bose-Hubbard-type Hamiltonians. Kuwahara, Vu, and Saito proved sharp bounds on (i) particle transport and (ii) the Lieb-Robinson velocity for initial states with controlled boson density. We provide simpler and shorter proofs for both results using a new set of methods. For (i), boson transport, we use a class of weighted extended particle number operators that directly enables closing the associated differential inequalities. For (ii), the Lieb-Robinson bounds, we develop a bosonic version of the Chen-Lucas path expansion technique and recover the sharp velocity bound $t^{d-1}$ up to logarithmic corrections, where $d$ denotes the lattice dimension. We also extend the transport bounds (i) to long-range hopping with a power-law exponent $α>d$. The range $α\in (d,d+1)$ corresponds to an algebraic light cone for boson transport and has not been previously covered.

comments
28 pages, no figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.02263 ↗

We consider a system of two bilinear discrete equations with four parameters. It defines a certain discrete dynamical system. Each of its solutions is represented as a pair of sequences. It is proved that for arbitrary initial data all terms of both sequences are Laurent polynomials in the initial data with integer coefficients. This property is called the Laurent property. The proof relies on an established connection between the system and the Somos-5 equation. It is shown that both components of the solution satisfy the same equation with the same parameters. To prove the main theorem, the strong Laurent property for the Somos-5 equation is used, which makes it possible to control negative powers of the initial data. An analogue of this property is obtained directly for the system under study. As corollaries, sufficient conditions for the integrality of solutions are found. An example of a pair of integer sequences illustrating the theorem on the strong Laurent property is given.

comments
Submitted to The Bulletin of Irkutsk State University. Series Mathematics
fields
Mathematical Physics
pdf ↗ page arXiv:2611.02309 ↗

We study 3-tensors satisfying the ``zipper condition,'' which play an important role in tensor network approaches to two-dimensional topological order. In our previous work, we identified the 4-tensors appearing in these approaches with bi-unitary connections in the Jones theory of subfactors in operator algebras. These bi-unitary connections give rise to subfactors of finite index. We prove that, when the associated subfactor has finite depth, the 3-tensors satisfying the zipper condition correspond precisely to the quantum $6j$-symbols, also known as $F$-symbols, of the unitary multi-fusion category arising from the subfactor. This realization of quantum $6j$-symbols differs from their realization through a flat bi-unitary connection arising from the higher relative commutants of a subfactor.

fields
Mathematical Physics, Operator Algebras, Quantum Algebra
pdf ↗ page arXiv:2611.02582 ↗

Current methods of deriving ultrastiff isotropic metamaterials require heuristics or topology optimization, which are highly inefficient and limited by human input. To circumvent this, Physics Informed Neural Networks are applied to analytical equations to systematically solve for plate orientations in closed cell lattices. Following a standardized procedure, the plate orientations were modelled and assembled into geometries resembling quasi random foams for validation via finite element simulations. Closed cell 6-plate geometries were also additively manufactured using LAPIS and experimentally characterized. The results indicate that a minimum of 6 plates is required to constitute an ultrastiff isotropic lattice, 7 plates would return the established plate Cubic Octet structure while 8 to 10 plate geometries did not show significant differences in properties. Despite the introduction of some plate bending due to sub-optimal plate placement strategy, relative stiffness of the PINNs lattices adheres closely to the Hashin Shtrikman upper bound, 90 percent of Hashin Shtrikman upper bound at a relative density of 0.4, and the lattices maintain near isotropic behaviour, achieving a Zener ratio of 0.95 at a relative density of 0.1. Benchmarking results show that specific stiffness of PINNs lattices is higher than the majority of isotropic architectures reported in the literature.

comments
41 pages, 5 figures, 2 tables
fields
Mathematical Physics
pdf ↗ page arXiv:2611.02622 ↗

In the self-dual limit of Yang-Mills theory on Euclidean AdS$_4$ studied by Heuveline, Ruzziconi, Sheta and Strominger, the boundary condition of the second-order action becomes vacuous, but the boundary equation of the first-order action is non-trivial. We show that, with this equation, the vacuum is the only saddle with a real gauge field when both fields are smooth up to the conformal boundary, for any compact gauge group. In particular, the self-dual solutions of Sarioglu and Tekin (2009) are not saddles; we also correct their charges, which omitted a surface term at the conformal boundary. Complex saddles and singular limits remain open.

comments
20 pages, 2 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.02655 ↗

This work investigates the appropriate initial condition for tsunami propagation that allows replacing a kinematic system with its corresponding static formulation, where the bottom is fixed at its final earthquake-induced deformation. Using the two-dimensional (2D) nonlinear shallow-water equations (NSW) and a 2D dispersive $abcd$-Boussinesq system, we prove that for the NSW system, the appropriate initial free-surface condition is exactly the final bottom deformation. For the Boussinesq model, this condition is obtained by first applying a \textit{ Boussinesq filtering operator} to the bottom profile. Furthermore, for both models, we establish an error estimate between the kinematic and static solutions that depends linearly on the earthquake rise time. This result provides a rigorous mathematical explanation for the errors observed in previous numerical tsunami simulations. As a direct consequence, the error vanishes as the bottom motion becomes instantaneous. We validate the theoretical results using an Okada solution for the seabed deformation. In particular, both the NSW model and the passive approach, which initializes the free surface with the unfiltered bottom deformation, overestimate the amplitudes of the tsunami waves relative to the linear potential theory for the configurations considered.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.02708 ↗

We consider the one-dimensional random operator \[ (H_{λ,ω}u)(n) = \sum_{m\ne n}\frac{u(m)}{|n-m|^r} +λω_nu(n), \] where the random variables $ω_n$ are independent and uniformly distributed on $[-1,1]$ (i.e., \mbox{$ω_n\stackrel{\mathrm{i.i.d.}}{\sim}\operatorname{Unif}[-1,1]$}). For every $λ>0$ and $r>3/2$, we prove that $H_{λ,ω}$ almost surely has pure point spectrum and admits an orthonormal eigenbasis $\{ψ_j\}$ satisfying \[ \sum_{n\in\bbZ}(1+|n|)^{2τ}|ψ_j(n)|^2<\infty \qquad \text{for every }j\text{ and }0\leτ<r-\frac32. \] These conclusions establish spectral localization, thereby rigorously confirming the prediction of earlier analytical and numerical studies in the physics literature, which identified $r=3/2$ as the marginal exponent.

comments
51 pages, 1 figure
fields
Mathematical Physics, Dynamical Systems, Probability
pdf ↗ page arXiv:2611.02724 ↗

We study correlators of the Jacobi Unitary Ensemble $\mathbf J(p,q,α,β,N)$ of Hermitian matrices with spectrum in an arbitrary real interval $[p,q]$. For $(p,q)=(0,1)$, Gisonni, Grava and Ruzza expressed the large-$N$ expansion of the correlators $\langle\prod_j \mathrm{tr}\,X^{λ_j}\rangle$ through triple monotone Hurwitz numbers. We extend this genus expansion to arbitrary $p,q$ with $α/N$ and $β/N$ fixed. Using the Frobenius characteristic map and the idempotent basis of the center of $\mathbb C[\mathfrak S_n]$, we also obtain an explicit formula for the Schur–Selberg type integral $\int_{(p,q)^N}χ_λ(x)\,Δ^2(x)\prod_a (q-x_a)^β(x_a-p)^α\,\mathrm{d}^Nx$ in terms of irreducible characters of the symmetric group and content products. As consequences, we describe the zero-mean ensemble, and we recover, term by term in the genus expansion, the polygon-gluing formula for the Gaussian Unitary Ensemble in the limit $c_A=c_B\to\infty$. Structurally, passing from $[0,1]$ to $[p,q]$ leaves the hypergeometric weight of the associated 2D Toda tau function unchanged and only changes the specialization of its second set of times.

fields
Mathematical Physics, Combinatorics, Probability, Representation Theory
pdf ↗ page arXiv:2611.02795 ↗

Predicting the highest packing fraction that disordered packing of bidisperse discs can achieve, $φ_{max}$, is an important unresolved problem. Such a predictive theory is hindered by the density dependence on the packing protocol and by ensuring disorder. In bidisperse packings, this is more complicated because $φ_{max}$ is not a number but a function of the disc species size ratio, $D$, and one of the disc species concentration, $p$. These difficulties have been overcome in monodisperse disc packings by using the cell order distribution (COD)~\cite{Bl21}. Focusing on size ratios that prohibit rattlers, a COD-based theory is constructed here. It introduces bidisperse statistical closure equations, which combine an explicit disorder criterion with consistent cell and edge statistics, and yields $φ_{max}(p,D)$ and structural predictions. The a-priori disorder-guaranteeing criterion proposed here ensures fast exponential a decay of the occurrence probability of ordered clusters with size. Using a constrained maximum-entropy analysis to ensure maximum disorder, the occurrence probabilities of all the possible cell and edge configurations are derived in terms of $p$ and $D$ and they are found to be binomial. All the results are assembled to yield an exact prediction of $φ_{max}(p,D)$.

comments
10 pages main text, containing 6 figures, plus 7 pages supplemental material
fields
Mathematical Physics
pdf ↗ page arXiv:2611.02805 ↗

We construct an explicit small model for the $\infty$-groupoid of null-concordances of higher gauge curvatures by algorithmically trivializing their nonlinear Bianchi identities. More precisely, for a finite-type Sullivan minimal Bianchi algebra equipped with positive integer weights, we organize weighted potentials and higher gauge parameters at each fixed curvature into an $\infty$-groupoid whose gauge transformations are linear in the parameters. We prove that this model is naturally equivalent to the $\infty$-groupoid of null-concordances through an intermediate total-form model, with explicit projection and section maps and simplicial homotopies. When nonempty, its connected components form a torsor for the degree-zero cohomology of an associated weighted gauge complex, and its higher homotopy groups are computed by the higher cohomology of this complex.

comments
34 pages. Comments are welcome
fields
Mathematical Physics, Algebraic Topology, Differential Geometry
pdf ↗ page arXiv:2611.03064 ↗

Symmetry-enforced gaplessness is a phenomenon in which a quantum system is forced to be gapless due to its global symmetry. Previous works have mainly focused on anomalous symmetries. Another approach, using symmetry spans, which specify two embeddings of a common symmetry into two larger symmetries, was proposed by the authors. In this work, we show that a symmetry span can enforce gaplessness even when both larger symmetries are invertible and non-anomalous: each alone admits a trivially gapped phase, but because the embeddings differ by a twist associated with a symmetry-protected topological phase, the symmetry they generate admits no gapped phase with finitely many ground states. We present such a span of a finite group and $\mathrm{U}(1)^2$ in 1+1 dimensions, with continuum realizations and a lattice Hamiltonian, with a finite-dimensional local Hilbert space and finitely many parameters, that is gapless in any region of its parameter space. We also discuss a 2+1-dimensional example and spans of only finite symmetries.

comments
12 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.03164 ↗

We study density and current fluctuations in a one-dimensional gas of run-and-tumble particles (RTPs), whose intrinsic velocities switch between two opposite values at a constant rate. We consider particles with and without pair interactions, including regularized Riesz gases, and also obtain corresponding results for Brownian particles. By linearizing the Dean-Kawasaki (DK) equations around a homogeneous stationary state, we compute density correlations and the variance of the integrated current through the origin. For repulsive Riesz interactions decaying as $1/|x|^s$ with $s>0$, this variance grows at long times as $t^{1/2}$ for $s>1$, but as $t^{s/(1+s)}$ for $0<s<1$. Starting from the same DK description, but retaining the Poisson statistics of direction reversals, we derive a macroscopic fluctuation theory (MFT) for RTPs with smooth pair interaction potential, which allows to compute the large time large deviation of the time integrated current. We show that, in the absence of interactions, the MFT saddle point equations can be solved explicitly using a generalized Cole-Hopf transform. This allows to recover and generalize previous results for the current distribution obtained by microscopic calculations, for RTPs with annealed or quenched step initial conditions. Beyond these distributions, MFT allows to compute the optimal density histories producing a prescribed current through the origin. We find that these density profiles, for both RTPs and Brownian particles, exhibit a nontrivial space-time structure. We also study stationary current fluctuations on an interval connected to reservoirs. Finally, we analyze the MFT equations perturbatively in the interaction. In both the infinite-line and reservoir geometries, we obtain explicit first-order corrections to the current generating functions for short-range interacting RTPs and Brownian particles.

comments
78 pages, 5 figures
fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2611.03187 ↗

In my previous work (arXiv:2609.07810) \cite{Aydiner_2026}, I derived a second-order equation of motion for open thermodynamic systems from the First Law of Thermodynamics and established its dynamical equivalence with mechanical oscillators and electrical RLC circuits. In the present study, I independently recover the same mathematical structure of the equation of motion from a mesoscopic model of particle transfer between two reservoirs connected by a channel. Starting from collective momentum balance, particle conservation, and reservoir chemical-potential response, I derive the inertial–dissipative–restoring dynamics and obtain explicit expressions for its effective coefficients in terms of the physical parameters of the system. The resulting equation predicts distinct damping regimes, characteristic relaxation time scales, and resonance under periodic driving. The natural frequency and resonance conditions are explicitly determined by the physical parameters of the particle-transfer system. In the slow-transport limit, the model recovers the conventional Onsager-type linear flux–force relation. The independent emergence of the same dynamical structure from two distinct physical approaches provides theoretical support for the previously proposed thermodynamic equation of motion. By identifying the physical mechanisms underlying its effective coefficients, the present study strengthens the physical foundations of the proposed framework and supports the possibility of describing open thermodynamic systems within a common dynamical framework shared with mechanical and electrical systems.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.03235 ↗

We show that treating a paraxially propagating electric field as a spinor provides a natural way to include geometric phase in beam propagation models. Importantly, by exploiting differences in the way geometric phase and dynamical phase accrue during propagation, we show that spatial variations in the former can have surprising and rather remarkable consequences for beam dynamics. As an example, we design a beam with a centroid that is predicted to follow a curved path through free space, a prediction we subsequently validate in experiment. The model presented herein does not contradict existing propagation models, but rather shows how to leverage the extra degree of freedom afforded by the spinor angle to make new predictions.

comments
11 pages, 4 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.03275 ↗

We establish Anderson localisation for random capacitance operators and quantify concentration of individual modes of finite capacitance matrices for clusters of subwavelength high-contrast resonators. The underlying geometry is fully periodic in dimensions $d=2,3$, with one resonator per cell, and the inverse material factors are independent and uniformly distributed. We retain the full capacitance interaction, whose coefficients decay exponentially with lattice separation. Under coordinate reflection symmetry, spectral and dynamical localisation hold near the upper spectral edge for every fixed positive disorder strength. At weak disorder $W$, we obtain an explicit localisation window of energy width proportional to $W$; prescribed positive intervals are localised at sufficiently large disorder. A variational boundary comparison and a material-variable eigenvalue-spacing estimate transfer localisation from truncated matrices to individual modes of the finite capacitance matrix. In a bounded sample of cell size $\varepsilon$, with probability tending to one, all except for $O(\varepsilon^{1-d}\log(1/\varepsilon))$ modes in the localisation interval concentrate within radii $O(\varepsilon\log(1/\varepsilon))$. The estimates are uniform for the contrast-dependent capacitance family at small contrast. We also prove a common limiting density of states for the truncated and finite matrices and illustrate concentration numerically.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.03286 ↗

Prototype magnetic neuromorphic systems, in essence, are based either on ferromagnetic or antiferromagnetic materials as key elements for conventional neuromorphic setups. In this work, we propose a novel neuromorphic system based on a ferromagnetic disk and a ferroelectric layer coupled via the magnetoelectric effect. We study a magnetoelectrically coupled ferromagnetic–ferroelectric oscillator as a candidate element for neuromorphic devices. A local reduction of conservative Landau–Lifshitz dynamics identifies a magnetic coordinate–momentum pair, which is coupled to an inertial ferroelectric polarization mode. We derive the action–angle description of the resulting double-well–harmonic-oscillator Hamiltonian, obtain the quartic-well frequency map and Fourier coefficients in terms of elliptic functions, and establish monotone in-well twist. In the autonomous two-degree-of-freedom model, isoenergetic nondegeneracy supports KAM confinement on regular compact domains. Periodic electric forcing introduces a third effective frequency, although the harmonic magnetic sector leaves the unperturbed resonance loci parallel. An explicitly specified nonlinear magnetic extension produces transverse resonance intersections. We calculate leading resonant widths and local homoclinic splitting, and derive a damping-dependent splitting threshold for a stated scalar reduction. These results identify analytical structures relevant to transport and explain possible polarization-based electrical readout. Establishing Arnold diffusion in the coupled model requires additional connecting-orbit analysis or controlled long-time evidence; neither a diffusion law nor Nekhoroshev stability of the driven model is inferred from the present finite-time calculations.

comments
21 pages, 6 figures,
fields
Mathematical Physics
pdf ↗ page arXiv:2611.03297 ↗

We develop a supersymmetric spectral description of stochastic FitzHugh–Nagumo dynamics motivated by an effective antiferromagnetic neuromorphic model. A local normal-form reduction of the adopted tangential Néel-vector dynamics relates magnetic control parameters to fast activation and slow recovery coordinates. Freezing the recovery variable yields a one-dimensional Fokker–Planck equation with a quartic potential, whose similarity-transformed generator admits an exact supersymmetric factorization. The first nonzero relaxation eigenvalue is determined by the ground state of the partner operator; in the weak-noise bistable regime, it is approximated by the sum of the two interwell Kramers rates. Projecting the similarity-transformed probability density onto the two lowest modes defines a normalized auxiliary two-state amplitude. We derive its localized-basis coherence in terms of both the time-dependent basin populations and their equilibrium weights. Its maximum corresponds to equal normalized amplitude weights, which generally differ from equal basin populations. The fixed-recovery example exhibits a pronounced coherence pulse during monotonic relaxation without a spike. Conversely, the illustrated deterministic spiking trajectory repeatedly leaves the bistable domain and passes through regions with insufficient barrier separation, restricting the validity of the localized two-state approximation. These results connect stochastic relaxation spectra to an occupation-based coherence diagnostic and delimit its application to neuromorphic spiking. The diagnostic characterizes an auxiliary amplitude representation of classical stochastic dynamics and does not by itself establish microscopic quantum coherence.

comments
11 pages, 4 figures,
fields
Mathematical Physics
pdf ↗ page arXiv:2611.03312 ↗

The binary perceptron problem asks for a length-$n$ sign vector in the intersection of $\lfloor αn\rfloor$-many independent random Gaussian half-spaces. A striking feature of this model is strong freezing: at every constraint density $α> 0$, all but a vanishing fraction of solutions are isolated -- $Ω(n)$-far from all others, in Hamming distance. Such solutions are believed to be algorithmically inaccessible. Nevertheless, efficient algorithms find solutions at some constraint densities $α$. One possible resolution of this apparent contradiction is that the solution space also contains rare well-connected structures, and that algorithms succeed by locating them. Gong, Huang, Li and Sellke (FOCS 2026) proved this for stable algorithms, by showing that such algorithms cannot locate isolated solutions with probability more than $\approx 0.84$. In this work, we study online algorithms, which receive the columns of the constraint matrix one by one and sign each irrevocably upon arrival. This is a widely used class of algorithms in discrepancy minimization, and it includes the algorithm of Jo and Lee (2026), which has one of the best provable guarantees for the binary perceptron. We prove that at any constraint density, any online algorithm outputs an isolated solution with probability $o(1)$. Our proof is based on the observation that the signs an online algorithm has already fixed can be completed to at most one isolated solution, so a successful algorithm must choose the unique correct sign for each of the last few columns. Using the exchangeability of these columns, we show that such an algorithm must match a suffix-parallel baseline, which signs each of them as if it were the next column to arrive. We then use an anti-concentration argument to show that such a baseline rarely produces a unique completion.

comments
33 pages, 5 figures
fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2611.03397 ↗

We prove propagation estimates for extensive fermionic many-body interactions with polynomial time growth, no loss of spatial decay, and an optimal threshold for the polynomial spatial exponent. More precisely, we construct local representatives of evolved fermionic many-body interactions on metric spaces with polynomial volume growth of order $d_{\mathrm{vol}}$ and suitable cell partitions. For the even Hamiltonian interaction $Φ_u$ and the even interaction $Ψ$ being evolved, we assume bounds, uniform in the site, on sums of term norms over finite supports $X$ containing a given site, with weights $e^{κ|X|}(1+\operatorname{diam}X)^a$ and $e^{κ|X|}(1+\operatorname{diam}X)^p$, respectively. Here $a>d_{\mathrm{vol}}$, $0\le p\le a$, $κ$ is sufficiently large, and the Hamiltonian bound is uniform in time. We construct local representatives whose interaction norms with weight $e^{c(1+|t-s|)^{-b}|X|}(1+\operatorname{diam}X)^p$ grow at most polynomially in $|t-s|$, for suitable $c,b>0$. In particular, $p=a$ is allowed: the Hamiltonian need not decay faster than the interaction being evolved. The threshold $a>d_{\mathrm{vol}}$ is optimal in general: uniform polynomial time bounds at $p=a$ fail for $0<a\le d_{\mathrm{vol}}$, even for smooth time-dependent two-site interactions. Polynomial time growth permits integration against filters with sufficiently many finite absolute moments, including those used in quasi-adiabatic constructions and quantum belief propagation. We derive consequences for filtered interactions and the dynamics they generate, providing dynamical estimates for perturbation theory with extensive perturbations, including gap stability, the principle that local perturbations perturb locally (LPPL), adiabatic theory, and response theory. All results also hold for quantum spin systems.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.03441 ↗

In this work we show that standard results in quantum tomography, which are typically proven in the context of Hilbert spaces, can analogously be established in the theory of Schwartz spaces. In particular, we will see that quantum states are equivalently characterized by their Wigner function, the characteristic of their Wigner function, and the probability distributions for a family of linear combinations of position and momentum. Physically, the latter can be understood as the evolution of its probability distribution in position over time under, for example, free or harmonic evolution. The result is obtained with techniques that are more accessible to a physicist audience, and shows that, at least for tomography results, the full structure of Hilbert spaces is not necessary.

comments
14 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.03521 ↗

The present work develops a Koopman–von Neumann (KvN) formulation of contact Hamiltonian dynamics on the Hilbert space defined by the contact volume. The resulting generator includes the divergence correction required for unitary evolution. We establish symmetry and, for complete contact Hamiltonian vector fields, essential self-adjointness and a strongly continuous unitary evolution; we also describe covariance under contactomorphisms. For completely integrable contact systems with complete flows, it is possible to recover an invariant direct-integral decomposition and strongly commuting KvN generators. We further relate contact KvN dynamics to the KvN formulation of its symplectization.

fields
Mathematical Physics, Dynamical Systems
pdf ↗ page arXiv:2611.03522 ↗

We develop a numerical conformal bootstrap for two-dimensional CFTs with $c>1$ based on Virasoro conformal blocks, computed with Zamolodchikov's recursion and optimal polynomial interpolation. As a first test we isolate an island around three decoupled Ising models. We then consider three 3-state Potts models coupled through their energy operators, a candidate irrational CFT. Mixed correlators isolate the decoupled theory in an island, and different gap assumptions, motivated by perturbation theory, yield a peninsula that contains the coupled fixed point but not the decoupled one. Finally, we explore the standard single-correlator bound on the lowest-dimension scalar primary in the OPE of two identical scalars. We find that for central charges just above $c=1$ the bound collapses over a wide range of external dimensions. This excludes any theory whose lightest scalar is absent from its own OPE and lies in this range, and supports the conjecture that no compact CFT exists in this region. We explain several features of these bounds analytically.

comments
48 pages, 8 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.03565 ↗

We show that the vacuum partition function of the $q$-deformed oscillator \[ L_q(z):= \langle0|e^{zT_q}|0\rangle, \qquad T_q := \mathsf{a}_q + \mathsf{a}_q^* \] satisfies the Lee-Yang property, i.e., all zeros of $L_q$ lie on the imaginary line for all $q\in[-1, 1)$, proving the conjectures of Okuyama'23. Using the connection between $q$-deformed oscillators and the Sachdev-Ye-Kitaev (SYK) Hamiltonian in the doubly-scaled regime, we show that the annealed SYK partition function satisfies the Lee-Yang property in the thermodynamic limit, that is, all of its Fisher zeros are on the imaginary axis. As a result, we show that the quenched SYK partition function admits a zero-free strip of constant width with high probability, rigorously complementing the large$-k$ replica calculations of Zlokapa and Kiani'26. We show the imaginary-rootedness of $L_q$ by expressing $\varphi_q(z):= L_q(\mathbf{i} z)$ as a locally uniform limit of ``$q$-deformed'' matching polynomials and then showing that those $q$-deformed polynomials are real-rooted. This establishes that $\varphi_q$ is real-rooted, and in fact belongs to the \emph{Laguerre-Pólya} class. The real-rootedness of the $q$-deformed polynomials yields novel log-concavity relations on the \emph{$q$-deformed matching moments} \[M_\ell(q):= \sum_{π\in\mathcal{P}_2(2\ell)}q^{\operatorname{cr}(π)}.\] We show the real-rootedness of the $q$-deformed polynomials by using the Touchard–Riordan formula to derive a partial differential equation relating their $q$-derivatives to their $z$-derivatives, and then analyzing the resulting motion of their roots.

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

Number Theory68

We introduce the notion of cuspidal coherent sheaves on the moduli stack of local L-parameters. We give a complete classification and relate them to Lusztig's cuspidal local systems (or character sheaves). Under the categorical local Langlands conjecture, these sheaves are expected to correspond to supercuspidal representations supported at basic points. We also construct semiorthogonal decompositions of the category of coherent sheaves on the moduli stack of L-parameters that conjecturally match the semiorthogonal decompositions of sheaves on $\mathrm{Bun}_G$ coming from the stratification by the Kottwitz set and Bernstein decomposition of representation categories.

comments
155 pages. Comments welcome!
fields
Number Theory, Algebraic Geometry, Representation Theory
pdf ↗ page arXiv:2611.00220 ↗

We provide a general framework for obtaining upper bounds on the packing dimension of certain sets arising from Diophantine approximation using the notion of porosity from geometric measure theory. In particular, the framework relies on showing that such sets are mean porous, as introduced by Koskela and Rohde (Math. Ann., 1997). As applications of our framework we show that: For $\varepsilon>0$ sufficiently small, the set of $d$-dimensional $\varepsilon$-badly approximable points has packing codimension comparable to $\varepsilon^{d}$ up to multiplicative constant. Any $C^{2}$ submanifold of $\mathbb{R}^{d}$ with bounded first and second partial derivatives intersected with the set of $d$-dimensional $\varepsilon$-badly approximable points has packing dimension strictly less than the dimension of the submanifold. For any matrix $A\in \mathbb{R}^{m\times n}$ satisfying certain Diophantine conditions, the set of points that avoid the $\varepsilon \|\mathbf{q}\|_{\infty}^{-\frac{n}{m}}$-neighbourhood of the orbit $\{A\mathbf{q} \mod \mathbb{Z}^{m}:\mathbf{q} \in \mathbb{Z}^{n}\}$ has packing codimension greater than $C_{A} \varepsilon^{m}$ for $C_{A}$ a constant depending on $A$ and $m$ only. \end{itemize}

comments
17 pages
fields
Number Theory, Dynamical Systems
pdf ↗ page arXiv:2611.00257 ↗

We prove that, for every \(A>0\), all but \(O_A(X(\log X)^{-A})\) integers \(n<X\) satisfying \(n\equiv11\pmod{24}\) admit a representation \[ n=a^2+b^2+p^2, \] where \(p\) and \(a^2+b^2+1\) are prime and \((a,b)=1\). For ergodic averages along prime squares, we prove a universal divergence result for integrable functions, while establishing almost-everywhere convergence for near-integrable functions. We also quantify how the bounds used to establish convergence behave as one approaches integrability. Moreover, we prove endpoint improving and sparse bounds for the corresponding discrete averages, with an explicit Orlicz loss.

code
github.com/HamedMousaviMath/lean4-paper-On-Distribution-of-Prime-Squares-formalization/tree/main ∎ Lean project (lakefile.toml, lean-toolchain) builds, no sorry at b67166d, checked 2026-11-10 build details
comments
87 pages. A formalization, conditional on thirteen explicitly documented families of external analytic and arithmetic inputs, is here: https://github.com/HamedMousaviMath/lean4-paper-On-Distribution-of-Prime-Squares-formalization/tree/main
fields
Number Theory, Combinatorics, Dynamical Systems
pdf ↗ page arXiv:2611.00485 ↗

For the Möbius-weighted quadratic form $T(N)=\sum_{m,n\leq N}μ(m)μ(n)(m,n)^2/(mn)$, we prove that $T(N)=cN+O_{\varepsilon}(N^{2/3+\varepsilon})$ for every $\varepsilon>0$, where $c>0$ is given by an absolutely convergent series of finite Möbius sums multiplied by a convergent Euler product. The proof combines the classical Jordan-totient decomposition of the GCD kernel with a mean-value estimate that is uniform in a coprimality parameter. Grouping the resulting squares according to $\lfloor N/d\rfloor$ gives the error term and a nonnegative series for $c$.

comments
6 pages, no figures
fields
Number Theory
pdf ↗ page arXiv:2611.00525 ↗

Let $α$ be an element of $\Fq((1/T))$ which is not in $\Fq(T)$. We ask how small $\nrm{απ}$ can be made when $π$ runs over irreducible polynomials, and write $θ(α)$ for the largest exponent $θ$ such that $\nrm{απ}<|π|^{-θ}$ has infinitely many solutions. The analogue of Matomäki's exponent, $θ(α)\ge\frac13$, was proved by Baier and the author, and it is the natural limit of the Riemann Hypothesis. In this paper we go beyond it. For odd characteristic $p$ and $q$ large in terms of $p$ and $θ$, we prove that $θ(α)\geθ$ for every $α$ and every $θ<\sqrt2-1=0.414\ldots$, and for every $θ<\frac12$ when $α$ has bounded partial quotients. The main tools are an exact count of points in affine subspaces of $\Fq[T]$, a splitting of these subspaces into long arithmetic progressions, and the results of Sawin and Shusterman on the Möbius function along such progressions.

comments
24 pages
fields
Number Theory
pdf ↗ page arXiv:2611.00623 ↗

We classify the pairs $(q,n)$, where $q$ is a prime power, $n>1$, and $\gcd(n,q)=1$, for which every irreducible factor of $Φ_n(x)$ over $\F_q$ has exactly three nonzero terms. The positive support exponents of these factors have a common greatest common divisor, which gives a unique reduction by a power substitution. The reduced degree is two in odd characteristic and belongs to $\{2,3,4\}$ in characteristic two; the cubic and quartic cases arise by scalar substitution from the layers of orders $7$ and $15$. This yields necessary and sufficient arithmetic conditions on $(q,n)$ and explicit factorizations. Among the classified families, precisely those arising from quartic bases have a divisor layer containing an irreducible factor with more than three terms.

fields
Number Theory, Information Theory
pdf ↗ page arXiv:2611.00647 ↗

Let $A_{t,k}(n)$ denote the number of partition $k$-tuples of $n$ with $t$-cores. Using fifth-order modular equations and the Atkin $U_5$-operator, we prove the congruences $A_{5,125i+21}(25n+r)\equiv 0 \pmod{5^3}$ for $r\in\{9,14,19,24\}$, $A_{5,125i+41}(25n+r)\equiv 0 \pmod{5^3}$ for $r\in\{19,24\}$, and $A_{5,125i+111}(125n+r)\equiv 0 \pmod{5^4}$ for $r\in\{39,64,89,114\}$, which were stated by Tang \cite{tang2025iterative}.

comments
7 pages, comments are welcome!
fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2611.00693 ↗

In this note, we construct combinatorial statistics in terms of partitions, overpartitions, and two-color partitions and relate the corresponding generating functions to the universal mock theta functions. Our framework primarily builds on two $q$-series identities of Fine.

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

We prove twisting-free converse theorems for $Γ_0(32)$ and $Γ_0(36)$ under the setting of Conrey–Farmer, namely assuming a single functional equation and a suitable Euler product, with particular shapes at ramified primes. The proofs make substantial use of the ramified primes, with methods somewhat different from the existing ones in the literature.

comments
This paper has 8 pages. The original proof was generated by GPT, while the paper itself was written solely by the author according to his own understanding. The author takes full responsibility for the correctness of this paper
fields
Number Theory
pdf ↗ page arXiv:2611.00850 ↗

We show that all the periodic points with period $n \ge 3$ of the algebraic function defined by the relation $g(x,y) = x^2+2xy^2-y = 0$ are expressible in terms of values of Ramanujan's cubic continued fraction $c(τ)$. It is shown that the values $c(w/2), c(w/6), c(w/6+1/2)$ are periodic points, for specific elements $w$ in the order of discriminant $-d$ in $K = \mathbb{Q}(\sqrt{-d})$, with $-d \equiv 1$ (mod $8$); and all the periodic points are conjugates of these values or specific linear fractional expressions in their conjugates, times cube roots of unity. These periodic points are determined by relating them to the periodic points of the algebraic function defined by $k(x,y)= -xy^2+x^2+y^2+3x = 0$; and these periodic points (for periods $\ge 2$) generate ring class fields over $K$.

comments
67 pages, 5 tables
fields
Number Theory
pdf ↗ page arXiv:2611.00886 ↗

We prove that the covering radius of the binary first-order Reed-Muller code RM(1,9) is exactly 242. Equivalently, the maximum nonlinearity of a Boolean function in nine variables is 242. Our proof combines a one-point rigidity theorem with a spectral and computational exclusion of the two larger candidate nonlinearities. We first show that every nine-variable Boolean function of nonlinearity 243 admits a unique one-point modification that raises its nonlinearity to 244: the point to be changed is the vector sum of its support. This part uses exact Walsh-update identities, integer interpolation, rigidity of a quadratic residue, and a sharp Walsh l1 estimate for cubic Boolean functions. To exclude nonlinearity 244, we use Parseval's identity and congruences of integral Walsh coefficients to force an exceptionally restricted spectrum. An associated cubic residue phase must attain the extremal Walsh l1 bound 10240. We eliminate one equality spectrum by hyperplane slicing; the other forces the original Boolean function from the signs of the cubic phase and yields a double-complement-pairing identity for its cubic top part. The classification of alternating trilinear forms over F2, an exact filter of their representatives, and two exhaustive enumerations of 218 quadratic supplements then rule out every remaining candidate. Together with the known construction attaining nonlinearity 242, these arguments establish the asserted covering radius.

comments
28 pages
fields
Number Theory, Information Theory, Combinatorics
pdf ↗ page arXiv:2611.00890 ↗

We refine the ordinary product moment in the cubic-theta comparison by allowing a returned prime product to be exhausted. The return stops either when the positive-prime length inequality holds or when the established prime-free ordinary estimate applies. Keeping the extracted central coefficients gives a local normalization inequality on a larger domain. On the critical ordinary-length interval this yields a net first-mean gain of $1/20000$. We prove the complementary-class, short-sum and algebraic comparison inequalities directly, and obtain the endpoint $B_*-1/160000=0.87446205769353\ldots$, where $B_*$ is Liu's algebraic boundary. The zero-free conclusion is conditional on the cited general-field theta, detector, prior-bound and Mellin input theorems in their stated uniform forms. The proof includes the actual return weights, both approximate-functional-equation arms, the principal-residue normalization and descent to arbitrary number fields.

comments
16 pages
fields
Number Theory
pdf ↗ page arXiv:2611.00924 ↗

We explore the simple continued fraction expansion for the $k$th power of the Fibonacci convergent $F_{n+1}/F_n$, as $n$ grows. For most $k$, this continued fraction consists of $k$ linearly growing \emph{patches} of infinite periodic continued fractions separated by \emph{junctions} that vary periodically in $n$. But under special conditions, two patches merge or, more strikingly, an exponentially growing \emph{monster term} replaces two patches and the junction between them. We trace these phenomena to properties of the Padé approximants that approximate $x^k$ near $x = φ$ and $x = \barφ$ simultaneously. We prove the patterns for second-order unimodular recurrences and compute several more instances of this rare and apparently previously unnoticed monster term.

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

We study explicit denominator conditions ensuring the irrationality of the dilogarithm at positive and negative rational points. We prove that $\operatorname{Li}_2(p/q)$ is irrational whenever $q>(4e^4/27)p^3$, and obtain an explicit, slightly smaller threshold for $\operatorname{Li}_2(-p/q)$. The positive argument specializes the Rhin–Viola integral family and uses a uniform estimate for a restricted prime divisor. The negative argument combines the same arithmetic construction with three adjacent integral moments and an explicit maximization. We also give finite-numerator refinements by interpolating certified partition bounds and by introducing a comparison measure with a quadratic tail. In particular, $\operatorname{Li}_2(5/q)$ is irrational for every integer $q\ge418$. The proof separates the established integral and determinant constructions from the parameter estimates and finite certificates used here.

comments
13 pages. The ancillary package is available at https://zenodo.org/records/23247332
fields
Number Theory
pdf ↗ page arXiv:2611.01066 ↗

A Wagstaff prime is a prime number of the form $(2^{\mathfrak{p}}+1)/3$, where $\mathfrak{p}$ is an odd prime. For an integer $k\ge 2$, the sequence of $k$-generalized Pell numbers $\bigl(P_n^{(k)}\bigr)_{n\ge 2-k}$ is the linear recurrence of order $k$ given by $P_n^{(k)}=2P_{n-1}^{(k)}+P_{n-2}^{(k)}+\cdots+P_{n-k}^{(k)}$ for $n\ge 2$, with initial values $P_{2-k}^{(k)}=\cdots=P_{0}^{(k)}=0$ and $P_1^{(k)}=1$. For $k=2$ this is the classical Pell sequence. Motivated by the recent determination of the Wagstaff primes in the $k$-Fibonacci and $k$-Lucas sequences, we study the exponential Diophantine equation $P_n^{(k)}=(2^{\mathfrak{p}}+1)/3$ in positive integers $n,k$ and an odd prime $\mathfrak{p}\geq 3$, with $k\ge 2$. We show that this equation has no solutions, that is no $k$-Pell number is a Wagstaff prime. The proof combines linear forms in logarithms of algebraic numbers with reduction based on the theory of continued fractions, together with a computational verification in the remaining finite range.

comments
11 pages
fields
Number Theory
pdf ↗ page arXiv:2611.01170 ↗

We use Fermat curves with real multiplication and classical CM theory to construct an explicit class field theory for arbitrary real quadratic number fields. The underlying strategy is well-established in computational class field theory, our main contribution is a geometric model to realize this strategy explicitly. This approach complements the recent breakthrough works solving conjectures by Brumer, Stark and Shintani and gives an alternative constructive solution to Hilbert's 12th problem for real quadratic fields.

comments
preliminary version, comments more than welcome!
fields
Number Theory
pdf ↗ page arXiv:2611.01201 ↗

For an elliptic curve $E$ defined over a number field $K$ and $\mathfrak{p}$ a prime of good reduction of $E/K$, we let $n_\mathfrak{p}=\#E(k_\mathfrak{p})$ be the order of the group of points over the residue class field $k_\mathfrak{p}$. Divisibility of $n_\mathfrak{p}$ by a prime $\ell$ depends on the splitting behavior of $\mathfrak{p}$ in the $\ell$-division field $K(E[\ell](\bar{K}))$ of $E$ and, generically, divisibility of $n_\mathfrak{p}$ by different primes $\ell_1$ and $\ell_2$ are `independent events' on the set of primes $\mathfrak{p}$ of good reduction. However, there do exist elliptic curves with `entangled division fields' for which infinitely many $n_\mathfrak{p}$ are coprime to $\ell_1$ and infinitely many $n_\mathfrak{p}$ are coprime to $\ell_2$, but no $n_\mathfrak{p}$ is coprime to to $\ell_1 \ell_2$. For $\ell_1=2$, we classify in group theoretical terms the entanglement giving rise to this behavior, and count up to isomorphism the number of `special $2\ell$-division groups' exhibiting the phenomenon. A final section shows how such groups may be realized as the Galois group of $2\ell$ division fields for elliptic curves $E/\mathbf{Q}$.

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

We construct distinct covering systems with minimum moduli 8, 9, 10, 11 and least common multiples 20160, 75600, 302400, 3326400, respectively, and conjecture that these values are minimal. For minimum modulus 8, the exclusion computations leave only 10080 and 15120 unresolved below our construction. The constructions use segmented local search: moduli are introduced in increasing blocks, followed by joint reoptimization of selected blocks. We give complete residue lists and an independent integer-arithmetic verifier. Two computational studies, comprising 180 initial runs and 130 follow-up runs, compare initialization orders, revisit rules and seed-bank capacities under fixed scan limits.

fields
Number Theory
pdf ↗ page arXiv:2611.01282 ↗

P. Gao and L. Zhao obtained an asymptotic formula for the smoothed first moment of primitive cubic Dirichlet $L$-functions over $Q$ with conductors coprime to $3$, with a main term of order $Q$ and error \(O\left(Q^{\frac{7}{8}+\eps}\right)\) under the generalized Lindelöf hypothesis. Building on their double Dirichlet series, we assume the generalized Riemann hypothesis and separate an explicit secondary term of order $Q^{\frac{5}{6}}$, with error $O\left(Q^{\frac{23}{28}+\eps}\right)$.

fields
Number Theory
pdf ↗ page arXiv:2611.01451 ↗

We study the smoothed first moments of primitive quartic and sextic Dirichlet $L$-functions for which every nontrivial power of the character remains primitive. Assuming the generalized Riemann hypothesis for the Dirichlet and finite order Hecke $L$-functions occurring in the proof, we obtain asymptotic formulas with errors $O(Q^{\frac{49}{58}+\eps})$ and $O(Q^{\frac{23}{26}+\eps})$, respectively. We follow the double Dirichlet series approach of Gao and Zhao. The main ingredient is a joint estimate for the two sums arising from the removal of rational prime divisors, with the Möbius coefficients retained. This gives a quotient of Dirichlet $L$-functions. Under GRH, we bound both the Dirichlet $L$-functions and their reciprocals. Combining the joint estimate with estimates for the generating series of Gauss sums gives larger regions of meromorphic continuation. These regions do not separate the possible secondary terms.

fields
Number Theory
pdf ↗ page arXiv:2611.01452 ↗

Let $r\geq 3$ be an integer, let $q$ be an odd prime power, and set $A=\mathbb{F}_q[T]$ and $F=\mathbb{F}_q(T)$. We study the Galois representations associated with rank $r$ Drinfeld modules of the form $φ_T=T+g_1τ+\cdots+g_rτ^r$, where $g_i\in A$ and $g_r\neq 0$. Ordering the coefficient tuples $\vec{g}=(g_1,\ldots,g_r)$ by their maximum degree, we prove that, for a density-one set of tuples, the $λ$-adic Galois representation is surjective for every prime $λ$ of $A$, and the adelic Galois image contains $\mathrm{SL}_r(\widehat A)$. Moreover, for every tuple in this set, the index of the adelic image equals the index of the corresponding rank-one determinant representation and hence divides $q-1$. These results extend Zywina's theorem in rank $2$ to arbitrary ranks $r\geq 3$. As a further consequence, we establish the existence of rank $r$ Drinfeld modules with surjective adelic Galois representations for every $r\geq 3$, extending previous existence results which were known for prime values of $r$.

comments
v1: 32 pages
fields
Number Theory
pdf ↗ page arXiv:2611.01464 ↗

Color each positive integer red or blue, and call an integer a same-color product if it is the product of two red numbers or of two blue numbers. Does there exist a universal constant $c > 0$ such that: For each fixed coloring, and for all sufficiently large $M$ (where "sufficiently large" may depend on the coloring), at least $cM$ of the integers among $1$, $2$, $\ldots$, $M$ are same-colored products (allowing for equal factors, and where each distinct product is counted once)? This problem was given (in an equivalent way) in Guy's famous text on unsolved problems in number theory, and was posed (in equivalent ways) by Erdős and Sárközy in 1990, in the proceedings of the 1988 Banff number theory conference, and 1993 [Colloq. Math.], and this problem seems to have remained open. We succeed in solving this problem, by proving that no such universal constant exists.

comments
Submitted for publication
fields
Number Theory
pdf ↗ page arXiv:2611.01480 ↗

For real numbers $α$ and $β$, let $\mathcal{B}(α,β)=\{\lfloorαm+β\rfloor:m\in\mathbb{N}\}$. Wooley asked whether the exponential sum over $\mathcal{B}(α,β)\cap[1,N]$ always has $L^1$ norm $O_{α,β}(\log N)$. We give a negative answer. We construct fixed $α>1$ and $β$, with $1/α$ of finite Diophantine type, such that the $L^1$ norm is $\gg(\log N)^2$ for infinitely many $N$. Wooley also proved that this $L^1$ norm is $O_{α,β}((\log(2N))^2)$ when $1/α$ has finite Diophantine type. Our example shows that his upper bound is sharp.

comments
7 pages
fields
Number Theory
pdf ↗ page arXiv:2611.01494 ↗

We prove a mean value theorem on the distribution of smooth numbers in two simultaneous arithmetic progressions, with generalizing a result of Drappeau. Let $\varepsilon>0$ and $(\log x)^C<y<x^{1/C}$ for a sufficiently large $C$. Our result implies that $y$-smooth numbers are well-distributed in the residue classes of a fixed integer $a$ on average over moduli $\leq x^{5/9-\varepsilon}$ for each $|a|\leq x$, which improves Drappeau's range $\leq x^{6/11-\varepsilon}$. As an application, we show that a positive proportion of $y$-smooth numbers $n\leq x$ satisfy $\min(P^+(n-1), P^+(n+1))>x^{407/720}$.

comments
27 pages
fields
Number Theory
pdf ↗ page arXiv:2611.01522 ↗

Let $G$ be a nontrivial finite nilpotent group. In this paper, we study the distribution of genus numbers of Galois extensions of $\Q$ with Galois group isomorphic to $G$, ordered by absolute discriminant. We show that the proportion of fields with any prescribed genus number tends to zero, and obtain a quantitative bound for this proportion. Moreover, if every element of order $\ell$ in $G$ is central, where $\ell$ is the smallest prime divisor of $|G|$, we determine the orders of magnitude of the average genus number and its higher moments.

comments
21 pages, Comments welcome
fields
Number Theory
pdf ↗ page arXiv:2611.01556 ↗

Fauzan's determinantal proof that $ζ(5)$ is irrational also yields $|ζ(5)-a/b|>b^{-260}$ for all large $b$. The exponent is the product $\varrhoλ/\varepsilon$ of three constants attached to the construction, of which $\varrho$ governs the growth of a relative matrix norm. We show that $\varrho$ may be taken to be $9.09$ instead of $6933/500=13.866$, and deduce $|ζ(5)-a/b|>b^{-171}$ for all integers $a$ and all sufficiently large integers $b$, so that the irrationality exponent of $ζ(5)$ is at most $171$. Two closed-form functions replace two worst-case estimates: a node function, which bounds the residue weights individually instead of uniformly, and the external field of the energy estimate, which replaces a factor-by-factor bound on the weight. The result is conditional on Fauzan's preprint. An exact arithmetic verifier is attached.

comments
7 pages. Ancillary file: verify_zeta5.py (exact arithmetic verifier; mpmath required, python-flint optional). The bound is conditional on A. Fauzan, DOI 10.5281/zenodo.22826419, whose construction gives the exponent 260; one of its three constants is lowered from 6933/500 to 9.09, which yields 171
fields
Number Theory
pdf ↗ page arXiv:2611.01708 ↗

Let $μ$ denote the irrationality exponent. Bruiltet proved in 2002 that $μ(Γ(1/4))\le 10^{143}$ and $μ(Γ(1/3))\le 10^{151}$. We prove $μ(Γ(1/4))\le 3.24\cdot 10^{26}$ and $μ(Γ(1/3))\le 1.74\cdot 10^{26}$, with explicit thresholds $h(p/q)\ge 5.4\cdot 10^{7}$ and $h(p/q)\ge 4.7\cdot 10^{7}$ respectively, against $10^{75}$ and $10^{79}$ in the published statements. The proof keeps the architecture of Bruiltet's argument -- Philippon's transcendence criterion together with a zero estimate in commutative algebraic groups -- and replaces three of its ingredients. First, an approximate Schwarz principle based on Hermite interpolation replaces the gravitation estimate of Reyssat; on a lattice point set its cost per node is governed by a lattice energy and drops from about 3.7 to about 1.0. Second, a summation lemma for the failure of Diaz's approximation lemma sharpens the passage from an approximation measure to an irrationality measure. Third, the auxiliary point is taken at a torsion point of order 4, respectively 3, which lowers the degree of the base field from 8d to 2d. All numerical constants are produced by a verifier run in interval arithmetic, supplied as ancillary files.

comments
9 pages. Ancillary files: VERIF_gamma.py (verifier in interval arithmetic, mpmath only, about 30 s), GEN_tables.py (generator of the two embedded tables, about 8 min per table) and README.txt. The tables embedded in the verifier are the generator's output, cell for cell
fields
Number Theory
pdf ↗ page arXiv:2611.01711 ↗

Let \(s>0\), \(α,γ\in\mathbb{R}\), and let \(ψ\colon \mathbb{N}\to\mathbb{R}_{>0}\) be a non-increasing function. Consider the limsup set \[ W_s(ψ,α,γ) = \left\{ β\in[0,1] \colon \norm{nβ-γ} < \frac{ψ(n)}{\norm{nα}^{\,s}} \ \text{ for infinitely many } n\in\mathbb{N} \right\}. \] Chow [Duke J. Math. 2018] settled the measure-theoretic result for \(s=1\). In this paper, we investigate the Lebesgue measure of \(W_s(ψ,α,γ)\) for general \(s>0\).

fields
Number Theory
pdf ↗ page arXiv:2611.01781 ↗

We study groups of units modulo $n$ whose nonidentity elements are all primes in $\{1,\ldots,n-1\}$. We prove that there are only nine groups of prime units which are the full group of units modulo $n$, and there are fewer than $10^{22}$ groups of prime units containing all prime units in the possible range $(\sqrt n,n-\sqrt n)\cup\{n-1\}$. We prove under Dickson's conjecture that there are infinitely many groups of prime units of arbitrary order $d \ge 2$ modulo composite integers. We prove under Schinzel's Hypothesis H that there are infinitely many groups of prime units of order 3 modulo a prime $r$. We prove that the number of such prime moduli $r$ smaller than $X$ is $\ll X/(\log X)^3$.

comments
30 pages, 2 tables
fields
Number Theory
pdf ↗ page arXiv:2611.01793 ↗

We derive explicit formulas for finite sums of powers of cotangents, both at rational and arbitrary arguments, together with their alternating counterparts, weighted by additive characters. Our method relies on Apostol–Bernoulli polynomials and on the partial fraction expansion of trigonometric functions. As applications, we solve the problem posed by Berndt, Kim and Zaharescu \cite{BKZ:2023} on evaluating $\sum\csc^{2m}$ and $\sum\sec^{2m}$ at rational arguments, recover as a special case the classical Berndt–Yeap formula, and relate our identities to spectral zeta functions of circulant graphs. Furthermore, to systematically evaluate higher-order derivatives arising from the Lipschitz summation formula, we introduce a novel sequence of polynomial coefficients $c_{m,j}(β)$, termed \emph{deformed cotangent coefficients}, and establish their recursive and algebraic properties. Using these coefficients, we establish a general additive-and-multiplicatively twisted character mean value theorem for Lerch zeta functions, significantly extending the framework of Bayad and Raouj to incorporate additive character twists.

fields
Number Theory
pdf ↗ page arXiv:2611.01801 ↗

We study products \[ N=(aC_n+1)(aC_{n+1}+1)(aC_{n+2}+1), \] where $(C_n)$ is the Lucas–balancing sequence. Under the assumption that all three factors are prime, we give a necessary and sufficient condition for $N$ to be a Carmichael number: this happens precisely when $n$ is even and $a=kC_{n+1}$ for a positive integer $k$ satisfying \[ 48k\equiv 7\pmod{C_nC_{n+2}}. \] We derive further congruence restrictions, an explicit parametrization of the integer solutions of the resulting congruence, a lower bound for $k$, and a divisibility relation involving the middle prime factor. The characterization is conditional on the primality of the three factors and does not assert that such prime triples exist for infinitely many parameters.

fields
Number Theory
pdf ↗ page arXiv:2611.02054 ↗

Zero correlations offer a way to test the cuspidal structure of an automorphic L-function, but their leading self statistics retain only coarse degree and multiplicity data. We therefore adjoin a specified cuspidal L-function as a probe and study the resulting raw mixed correlations. Assuming a factorization into cuspidal L-functions over Q, we show that a mixed pair statistic detects the probe's occurrence and recovers its multiplicity. A suitable Gevrey-order-two test eliminates the smooth-density terms and gives a subexponential error. For arbitrary smooth plateau tests, the prime number theorem of Harcos and Thorner gives an error smaller than every fixed inverse power of log T, without a self-contragredience assumption. The stronger prime number theorem of Liu and Ye gives a subexponential remainder under its stated structural assumptions, with the possible norm-twist terms made explicit. To obtain arithmetic information beyond this overlap, we compute the correlation expansion at every fixed level and inverse-logarithmic order within the original strict small-support range. We treat the pair and higher correlations separately, using Jiang's rational-field fixed-data estimates to justify the required prime-power convergence. The pair calculation identifies the mixed arithmetic finite parts and gives detailed error estimates, including the contribution of norm twists. The higher-level calculation retains connected prime-power invariants, whose first cubic contribution appears at order (log T)^{-3}. Explicit third- and fourth-level formulas and examples explain the arithmetic content of these coefficients and the limitations of self-correlations. Varying powers of the probe separates their mixed components. These formulas, together with the distinct-index sieve, provide a collection of arithmetic probe responses toward the further problem of recovering automorphic induction structure.

comments
Expanded version
fields
Number Theory, Representation Theory
pdf ↗ page arXiv:2611.02058 ↗

We use an automorphic L-function over one number field as a probe for the functorial structure of another automorphic L-function over a possibly different field. No automorphic induction is assumed. We first determine the mixed Euler factors arising from the explicit formula, including the residue-degree multiplicities that occur when local traces are grouped by absolute norm. This local analysis gives four probe constructions. Rational-field probes with known base change detect constituent multiplicities and, in equal rank, exact Satake equalities. Probes over a common Galois field detect conjugacy and stabilizers. Dirichlet-character probes give congruence-weighted combinations of Satake traces even when the leading overlap vanishes. A tensor-product construction realizes general different-field probes whenever the required base changes exist. We then separate the pair calculation from the higher connected calculations and work out the cubic and quartic arithmetic explicitly. In an explicit small Fourier box these expressions yield all finite secondary orders of the centered statistics; the required pair prime number theorems also give raw and distinct-index correlations. The main analytic tools are an independent fixed-data proof of Hypothesis H over number fields, a positive-margin estimate for rationally grouped coefficients, and the theorem of Harcos-Thorner for the realized Rankin-Selberg factors. This expanded version includes the full computations, local examples, and an appendix explaining the character-extension issue avoided by the proof of Hypothesis H. The resulting probes give concrete tests of functorial relationships, while recovery of automorphic induction remains a longer-term goal.

comments
Expanded version
fields
Number Theory, Representation Theory
pdf ↗ page arXiv:2611.02071 ↗

We prove a converse theorem for GL(2) over global fields in which the root numbers in the twisted functional equations need not be prescribed. Instead, we allow nonzero scalar factors that are invariant under unramified twists. We show that these scalars are independent of the twisting character and obtain a unique isobaric automorphic representation with the prescribed unramified local components.

fields
Number Theory
pdf ↗ page arXiv:2611.02217 ↗

We prove that for any $s\ge 2$ and polynomials $f_{1}(x),\dots,f_{s-1}(x)\in \mathbb{R}[x]$ satisfying a certain equidistribution condition, the natural density of the numbers $n\in \mathbb{N}$ such that $n,\lfloor f_{1}(n)\rfloor,\dots,\lfloor f_{s-1}(n)\rfloor$ are mutually coprime is $1/ζ(s)$. This generalises a recent result of Champagne, in which this was proven under the assumption that $f_{1}$ is linear.

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

We give a deterministic polynomial-time primality test whose main verification is the congruence $(1+X)^n=1+X^n$ in $C_n[X]/(X^r-b(Y))$, where $C_n=(\mathbb{Z}/n\mathbb{Z})[Y]/(Φ_r(Y))$. Two identities in the coefficient ring normalize $b$ and ensure compatibility with the main congruence. A finite-field root count and a lattice bound show that an accepted input is a prime power; elementary preprocessing excludes nontrivial perfect powers. We construct $b$ deterministically using Jacobi sums and the uniform Dedekind-zeta zero-free theorem of Cureton and Thorner, which extends OpenAI's Hecke zero-free theorem. The total bit complexity is $L^{32+o(1)}$, where $L=\lceil\log_2 n\rceil$, and verification after constructing $b$ costs $L^{6+o(1)}$. More generally, for a fixed real algebraic $1/2\leθ<1$, a common zero-free boundary $\Re s>θ$ for the relevant Dedekind zeta functions gives $L^{\max\{6,(1-θ)^{-1}\}+o(1)}$. This bound reaches $L^{6+o(1)}$ at $θ=5/6$, and hence under GRH. We state a fixed-base modification of Agrawal's conjecture for odd integers passing the base-$2$ Fermat test, using the modulus $X^r-2$ with $r$ the least positive integer not dividing $n(n-1)$.

comments
12 pages. An earlier version appeared as Revision 2 of ECCC TR23-200: https://eccc.weizmann.ac.il/report/2023/200/#revision2
fields
Number Theory
pdf ↗ page arXiv:2611.02280 ↗

The Pell numbers satisfy $P_n^2+P_{n+1}^2=P_{2n+1}$, and Bravo, Luca and Pomeo recently found all the cases in which the sum of the $x$-th powers of two consecutive $k$-generalized Pell numbers is again a $k$-generalized Pell number. We ask what happens when the two indices are arbitrary, that is, we solve $\big(P_n^{(k)}\big)^x+\big(P_r^{(k)}\big)^x=P_m^{(k)}$ in positive integers $k\ge2$, $n\ge r$, $m$ and $x$. The answer is that nothing new appears: apart from $1^x+1^x=2$, every solution has consecutive indices. The proof combines linear forms in logarithms with an auxiliary Fibonacci equation which does not depend on $k$, and, for large $k$, with the fact that the dominant root of the sequence is very close to $\varphi^2$. For the reduction step, the method of Dujella and Pethő fails for large indices and has to be replaced by a criterion of Legendre type.

fields
Number Theory
pdf ↗ page arXiv:2611.02295 ↗

For the Pell numbers one has $P_{n+1}-P_{n-1}=2P_n$ and $P_{n+1}^2-P_{n-1}^2=2P_{2n}$. We look for all the solutions of $\big(P_{n+1}^{(k)}\big)^x-\big(P_{n-1}^{(k)}\big)^x=2P_m^{(k)}$ in positive integers $k\ge2$, $n$, $m$, $x$, where $P^{(k)}$ is the $k$-generalized Pell sequence. We prove that for $k=2$ the two identities above give all the solutions, and that for $k\ge3$ the only solutions are $(n,m,x)=(1,1,1),(1,2,2),(2,2,1)$. In contrast with the analogous equation for $k$-generalized Fibonacci numbers, there are no parametric families of solutions. The proof uses an auxiliary equation with Fibonacci numbers which does not depend on $k$, Matveev's lower bound for linear forms in logarithms, the reduction of Dujella and Pethő, and, for large $k$, the fact that the dominant root of $P^{(k)}$ is very close to $\varphi^2$.

fields
Number Theory
pdf ↗ page arXiv:2611.02299 ↗

Let $L/K$ be a degree $p$ extension of $p$-adic fields. We shall provide a complete characterization for the freeness of any fractional ideal $\mathfrak{p}_L^h$, $h\in\mathbb{Z}$, of $L$ as a module over its associated order $\mathfrak{A}_{L/K}(h)$ in the only Hopf-Galois structure on $L/K$, and an explicit description of $\mathfrak{A}_{L/K}(h)$. We show that there is no loss of generality in assuming that $0\leq h\leq p-1$ and that the normal closure of $L/K$ is totally ramified over $K$. If $L/K$ is maximally ramified, then $\mathfrak{A}_{L/K}(h)$ is the maximal $\mathcal{O}_K$-order in $H$ and $\mathfrak{p}_L^h$ is $\mathfrak{A}_{L/K}(h)$-free. The remaining cases correspond to typical extensions. For these, we provide an $\mathcal{O}_K$-basis of $\mathfrak{A}_{L/K}(h)$ and a characterization for the condition that $\mathfrak{p}_L^h$ is $\mathfrak{A}_{L/K}(h)$-free. In the non-exceptional cases, which had been partially studied in the Galois setting, the characterization depends on $h$ and the continued fraction expansion of $\frac{a}{p}$, where $a$ is the residue class mod $p$ of the (fractional) ramification jump $\ell$ of $L/K$. In the remaining exceptional case, where $L/K$ is almost maximally ramified and $a+1\leq h\leq p-1$, it consists in a numerical common minimizer condition.

fields
Number Theory
pdf ↗ page arXiv:2611.02301 ↗

Motivated by a modular transformation law for multiple Eisenstein series established by Yu, we introduce spaces of holomorphic functions satisfying this law together with an additional filtration condition. We show that these spaces contain the spaces spanned by admissible multiple Eisenstein series, are finitedimensional in each weight, and share several structural properties with them. We also obtain an explicit formula for the generating function of their dimensions. However, the inclusions are known to be strict for certain weights. Thus, the defining conditions do not suffice to characterize the spaces spanned by admissible multiple Eisenstein series.

fields
Number Theory
pdf ↗ page arXiv:2611.02331 ↗

Recently, Andrews and El Bachraoui introduced partition-counting functions $a_2(n)$ and $b_2(n)$, together with their signed analogues $a'_2(n)$ and $b'_2(n)$, and proved that $a'_2(n), b'_2(n)>0$ for all $n\geq 3$. For $m\geq 2$, the latter functions extend naturally to $a'_m(n)$ and $b'_m(n)$, defined by \begin{align*} \sum_{n\geq 0} a'_m(n)q^n &= -\frac{q}{1-q} \frac{(q^m;q^m)_\infty}{(q;q^m)_\infty} +\frac{q}{(1-q)^2},\\ \sum_{n\geq 0} b'_m(n)q^n &= -\frac{q(1-q^{m-1})}{1-q} \frac{(q^{2m};q^m)_\infty}{(q;q^m)_\infty} +\frac{q}{1-q} \left( \frac{1}{1-q} -\frac{q^{m-1}}{1-q^{m+1}} \right). \end{align*} They asked whether there exists an integer $m>2$ for which $a'_m(n)$ is eventually positive, and posed the same question for $b'_m(n)$. In this paper, we resolve these two questions.

fields
Number Theory
pdf ↗ page arXiv:2611.02389 ↗

In this paper, we study elementary abelian $p$-covers of $P^1$ totally ramified at exactly two points and unramified elsewhere. Such covers are isomorphic to the rank-$\ell$ Artin–Schreier curves $ X_{f, \ell} : y^{p^\ell} - y = f(x), $ where $f \in \bar{F}_p[x^{\pm 1}]$ has a pole of order $d_1>0$ at $0$ and order $d_2>0$ at $\infty$. After fixing $d_1$ and $d_2$, the cover $X_{f, \ell}$ is generic if its Newton polygon is minimal as $f$ varies over all Laurent polynomials with pole orders $d_1$ and $d_2$. For $p$ sufficiently large relative to $d_1$ and $d_2$, we construct a combinatorial cost polygon $GL(d_1,d_2,p)$ and prove that its attainment is characterized by the nonvanishing of a homogeneous polynomial in the coefficients of $f$. Moreover, we prove that these conditions stabilize: there exists a Zariski-open dense subset $U$ in the coefficient space that is defined over $\Q$ and depends only on $d_1$ and $d_2$, whereby for any $f$ whose coefficients lie in $U(\overline{\Q})$, the reduction is generic at every prime ideal above sufficiently large rational primes, and for every rank $\ell$ permitted by the residue field. This result extends Zhu's result for one ramification point.

comments
31 pages
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2611.02398 ↗

We construct $p$-adic polynomial approximations to the zero-framing cohomological quasimap vertex of cotangent bundles to complete flag varieties from the trigonometric Calogero–Moser system. Negative integer couplings give regular staircase Jack polynomials with nonnegative integer coefficients. We compare them with complete-flag master polynomials extending the construction of Smirnov–Varchenko. Both families converge coefficientwise to the vertex and satisfy the full commuting equations modulo $p^s$. For $n\geq3$, we prove sharp degree-dependent congruences and compute leading residues at every $p$-power scale. Their discrepancy has coefficient norm $p^{-1}$ and an exact weighted Gauss norm giving uniform decay on smaller closed polydiscs. For the master family, multivariable Dwork congruences reconstruct the vertex by an infinite product. The results hold in every rank for $0<r/d\leq1/2$ and odd prime $p$.

comments
45 pages
fields
Number Theory, Mathematical Physics, Algebraic Geometry, Representation Theory
pdf ↗ page arXiv:2611.02417 ↗

Given a polynomial $f\in \mathbb{Q}[X]$, the Hilbert–Siegel problem asks for a description of the set of all values $t_0\in \mathbb{Z}$, possibly up to a finite set, such that $f(X)-t_0$ is reducible. Reducibility occurs trivially for $t_0$ in the value set of some non-linear left-composition factor of $f$. The problem therefore reduces to determining the polynomials having infinitely many further reducible values. The biggest step towards a solution so far was taken in joint work of the author with Behajaina and Neftin. We strengthen some of the methods obtained in that work to present the complete solution of the Hilbert–Siegel problem over $\mathbb{Q}$. We give applications to the problem of newly reducible iterates of polynomials, and to an unlikely intersection problem on simultaneous reducible fibers of two polynomial maps over $\mathbb{Q}$, generalizing a result by Bilu and Tichy.

fields
Number Theory
pdf ↗ page arXiv:2611.02434 ↗

We give an analytic proof of the Hasse-Sugawara problem by treating the seven remaining families of moduli. We also construct an explicit integer translate of a Weber value whose relative norms generate every intermediate field, and express these generators using extended form class groups.

fields
Number Theory
pdf ↗ page arXiv:2611.02495 ↗

Symmetric primitives over Galois rings need nonlinear components whose differentials with respect to ring addition are controlled. Let $R=\mathrm{GR}(4,m)$ and $q=2^m$, so that $(R,+)\cong(\mathbb{Z}/4\mathbb{Z})^m$ has order $N=q^2$. For every $m\ge1$ we construct an explicit permutation $G_c$ of $R$ all of whose differentials with a nonzero input difference have probability at most $36/N$, whereas every permutation polynomial of $R$ has such a differential of probability at least $2/\sqrt{N}$ (Ronjom–Sandrib). The bound holds for the fixed permutation itself, not on average over keys. Equivalently, $Δ(G_c)\le36$ against $Δ\ge2\sqrt{N}$ for permutation polynomials; since every permutation has $Δ\ge2$, the least differential uniformity of a permutation of $(\mathbb{Z}/4\mathbb{Z})^m$ lies between $2$ and $36$ for every $m$. In Teichmuller digits $(a,b)\in\mathbb{F}_q^2$ and for $c\in\mathbb{F}_q$ of absolute trace $1$, $G_c(a,b)=(L,(L^2+L+c)a)$ with $L=(a^2+a+c)b$. The map is $F_c\circ J\circ F_c$, where $F_c(a,b)=(a,(a^2+a+c)b)$ is induced by a polynomial over $R$ and $J$ exchanges the digits: a single digit exchange between two polynomial layers yields a bound independent of $m$. The proof reduces the difference equations, in each of three types of directions, to one-variable polynomials whose degrees do not depend on $m$. For general maps $F\circ J\circ F$ with $F(a,b)=(p(a),h(a)+d(a)b)$, where $p,d,h$ have degrees bounded independently of $m$, $p'\ne0$ and $d$ has no zeros, a Jacobian identity in characteristic $2$ bounds the differentials with nonzero low input and output differences independently of $m$; the remaining directions need a separate argument, which we give for an explicit family ($Δ\le440$, resp. $510$, for odd $m$).

comments
8 pages. Source, verification scripts and recorded outputs: https://doi.org/10.5281/zenodo.23876071
fields
Number Theory, Information Theory
pdf ↗ page arXiv:2611.02572 ↗

We classify the primitive positive solutions of $Cx^2+p^{2m}=y^q$ under the hypotheses that $C>3$ is odd and square-free, $p,q$ are odd primes, $p\nmid C$, $q\nmid h(-C)$, and $y$ is odd. The solutions form six explicit families: one for arbitrary $q$ and five exceptional families with $q=3$, three of which arise from half-integral elements when $C\equiv3\pmod8$. The proof combines ideal factorization with Lehmer sequences and shows that representations with second coordinate $v=p^r$, $r>0$, contribute only when $q=3$.

fields
Number Theory
pdf ↗ page arXiv:2611.02595 ↗

In this paper, we establish lower bounds for extreme values of derivatives of Dedekind zeta functions on the \(1\)-line over arbitrary fixed number fields. Our result extends Yang's corresponding estimate for the Riemann zeta function in 2024, with the leading constant involving residues of Dedekind zeta functions and a moment of the Dickman function. A key ingredient is a uniform asymptotic formula for weighted friable sums involving the coefficients of Dedekind zeta functions.

comments
15 pages
fields
Number Theory
pdf ↗ page arXiv:2611.02675 ↗

For a positive integer $n$, let $a(n)$ be the largest number of sides of a simple cyclic polygon of circumradius $n$ whose side lengths are positive integers. For primes $p,q$ we show that $a(pq)\in\{6,8,18\}$ and characterize each value by conditions on Gaussian and Eisenstein integers. For every integer $N\ge2$, on the other hand, $a(N^e)\to\infty$ and $\limsup_{e\to\infty}a(N^e)/e\ge2\sqrt2$; a quadratic chord tower combined with Farey neighbors gives explicit polygons, for instance $a(8192)\ge38$. We also show that an odd-sided polygon of radius $n$ exists if and only if $n$ has a prime divisor congruent to $1\pmod4$, and that $a(n)$ is even whenever at most one distinct prime divisor of $n$ is congruent to $1\pmod4$; it is also even when the Gaussian part of $n$ is the product of two distinct primes congruent to $1\pmod4$. Moreover, $a(N^e)=O_N(e^{ω(N)})$ for every fixed $N\ge2$, and $a(q^e)=Θ(e)$ for primes $q\equiv1\pmod4$; exceptional semiprime extremisers have unique side-length multisets. The proofs use a splitting lemma for angle relations by squarefree class, arithmetic in imaginary quadratic fields, bounded zero-sum problems, and a one-dimensional Farey argument. No computer-assisted step is used.

comments
31 pages, 3 figures
fields
Number Theory
pdf ↗ page arXiv:2611.02712 ↗

Duke's equidistribution theorem shows that the nonconstant contribution of the $\mathrm{GL}(2)$ automorphic spectrum to CM packets becomes asymptotically negligible. CM packets on the Levi base index the fibers of Bessel quotients in $\mathrm{GSp}(4)$, and the symmetric cube correspondence carries $\mathrm{GL}(2)$ cusp forms to $\mathrm{GL}(4)$. In the holomorphic setting considered here, these two constructions meet inside $\mathrm{GSp}(4)$. We prove averaged decay for the resulting class group periods over imaginary quadratic fields, expressed as averages of conditional fiber integrals. More precisely, let $f$ be a non-CM holomorphic Hecke newform with trivial central character. The mean absolute value of the associated class-group averages tends to zero along the transverse unipotent direction.

comments
24 pages
fields
Number Theory
pdf ↗ page arXiv:2611.02748 ↗

For primes $p,q,r$ that are not all equal, let $n=pqr$ and define Goldring's $w$-function by $w(n)=P(p+q)P(p+r)P(q+r)$, where $P(a)$ denotes the largest prime factor of $a$. In this paper, we resolve three problems of Chen, Shi and Wu. As $n\to\infty$ through such products, the sets of finite limit points of $P(w(n))/P(n)$ and $w(n)/n$ are $[0,1]$ and $[0,\infty)$, respectively. The same conclusions hold when $n$ is restricted either to $p^2q$ with distinct primes $p,q$ or to squarefree products of three primes. Nevertheless, on each of these three sets, the proportion of integers $n\le X$ satisfying $P(w(n))/P(n)>α$ tends to zero as $X\to\infty$, for every fixed $α>0$. We also determine the complete set of finite joint limit points of the two quotients for $n=p^2q$ with $p\ne q$.

comments
19 pages
fields
Number Theory
pdf ↗ page arXiv:2611.02851 ↗

We revisit the classical Siegel-Shidlovskii method in transcendental number theory from a new perspective, in which functional relations play a central role. Within a single self-contained framework, we recover the foundational results in the theory of E-functions, including the Siegel-Shidlovskii theorem, Beukers' lifting theorem, and Andr{é}'s theorem on the singularities of the minimal differential operator annihilating an E-function. Notably, the latter is obtained without any recourse to the theory of Gfunctions. This unified approach also allows us to resolve a problem posed by Shidlovskii: we obtain a general algebraic independence measure extending the classical Siegel-Lang measure to an arbitrary algebraically independent family of E-values. We also provide a short elementary proof of a second theorem of Andr{é}, which has become an important tool in the theory of Efunctions and concerns the primality of the specialization, at a regular point, of the ideal of functional relations of a vector of E-functions satisfying a differential system.

fields
Number Theory
pdf ↗ page arXiv:2611.02907 ↗

We study real zeros of completed modular L-functions and the determination of cusp forms by their periods. Using Chebyshev systems and the Riemann-Roch theorem, we obtain bounds for real zeros, counted with multiplicity, and rank estimates for evaluation maps in terms of the dimensions of cusp-form spaces and the genera of modular curves. These estimates give criteria for finite families of periods to determine a cusp form and yield explicit dual bases in cases where the relevant quotient curves have genus zero. We also bound the dimensions of rational spans of eigenform periods.

comments
37 pages
fields
Number Theory
pdf ↗ page arXiv:2611.02933 ↗

We apply the theory of generalised cluster algebras to classify the finiteness of positive integral points on the class of log K3 surfaces defined by $xyz = G(x,y)$ where $G$ has positive coefficients. We furthermore establish results on Zariski density, number of orbits and asymptotic growth of such points. These provide a Diophantine realisation of the finite-affine-indefinite trichotomy of rank-two root systems.

comments
52 pages
fields
Number Theory, Algebraic Geometry, Rings and Algebras
pdf ↗ page arXiv:2611.03036 ↗

A monomial square form is a polynomial $F=\sum_{i=1}^k M_i^2$, where $M_1,\ldots,M_k$ are pairwise distinct squarefree monomials $\ne1$. We consider the problem of which of these forms are universal, i.e.\ represent every positive integer. We consider three classes of such forms:\\ (1) Forms $M_1^2+M_2^2+M_3^2+M_4^2$ ($k=4$),\\ (2) Forms $M_1^2+\ldots +M_5^2$ ($k=5$) in at most 5 variables,\\ (3) Forms where the monomials are products of consecutive variables of a fixed length:\\ $P_{m,d}(x)=\sum_{i=1}^{d}(x_ix_{i+1}\cdots x_{i+m-1})^2,$ and its circular version\\ $C_{m,d}(x)=\sum_{i=1}^{n}(x_ix_{i+1}\cdots x_{i+m-1})^2\quad(n=m+d-1,\ x_{i+n}=x_i).$ We classify which of these are universal, possibly universal, or conditionally universal on a conjecture on the form $x^2+4y^2+5z^2$. This ternary form appears repeatedly and seems to play a central role. For forms (1), we also show that a form is universal if and only if it represents 14, 15, 29 and 9591 (partially conditional on $x^2+4y^2+5z^2$).

fields
Number Theory
pdf ↗ page arXiv:2611.03057 ↗

A nested version of the $δ$-method is developed for number fields $K/\QQ$ and is used to establish an asymptotic formula for the number of $K$-rational points of bounded height on non-singular complete intersections of two quadrics in $\PP^{n-1}_K$, when $n\geqslant11$.

comments
54 pages
fields
Number Theory
pdf ↗ page arXiv:2611.03085 ↗

We study anticyclotomic Iwasawa theory for self-dual twists of $p$-ordinary modular forms of weight two with nebentype $ε^2$, where $ε$ is a non-trivial Dirichlet character of conductor $p$. Under a generalized Heegner hypothesis and suitable residual hypotheses, we prove one divisibility in the anticyclotomic main conjecture in both the definite and indefinite settings. The prime $p$ may split, remain inert, or ramify in the imaginary quadratic field. Our proofs use a compatible bipartite Euler system of Heegner classes and theta elements, together with a comparison with the $p$-adic $L$-functions of Kohen–Pacetti. In the definite case, we prove cotorsion of the Selmer group and the characteristic-ideal divisibility by the $p$-adic $L$-function. In the indefinite case, we prove a rank-one statement and the corresponding divisibility in terms of the Heegner class. We also discuss criteria for equality and their relation to Kolyvagin's conjecture. Specialization gives finite-level Bloch–Kato Selmer bounds with local terms, and applications to Mordell–Weil ranks and $p$-primary Tate–Shafarevich groups for elliptic curves that have potentially ordinary reduction at $p$ satisfying our hypotheses.

comments
30 pages. Comments welcome!
fields
Number Theory
pdf ↗ page arXiv:2611.03195 ↗

We prove a quantitative non-covering theorem for finite nilpotent groups. As a consequence, every finite covering of $\Z^d$ by affine full-rank sublattices with pairwise distinct indices contains a member of bounded index, uniformly in $d$. We also establish a summability criterion allowing repeated indices, which extends to finite groups containing a normal nilpotent subgroup of bounded index.

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

Let F be a field, G = GL_n(F), and let St be the Steinberg module of G. For a parabolic subgroup P of G, let St_P be its Steinberg module. There is a natural map rho_P: St -> St_P corresponding to intersection of a modular symbol with the Borel–Serre boundary. We construct a ZP-resolution Sh_P of St_P, the P-sharbly resolution. We also construct a P-equivariant chain map from the sharbly resolution of St to the P-sharbly resolution of St_P which enables us to compute the map induced on Steinberg homologies by rho_P. In the case when F is a number field and Gamma subset G is a torsion-free arithmetic subgroup, rho_P induces the restriction map H^(Gamma, E) -> H^(Gamma cap P, E) via Borel–Serre duality, for any coefficient module E which is flat over the base ring. If E is a vector space over Z/pZ this provides a computation of the restriction map on cohomology from Gamma to Gamma cap P in terms of sharblies, which enables the study of this restriction map in characteristic p, where Eisenstein series cannot be used.

fields
Number Theory, Group Theory, Representation Theory
pdf ↗ page arXiv:2611.03303 ↗

We extend Landau's local analytic method for the deduction of zero-free region to a very general setting, and as a particular consequence, obtain a zero-free region and corresponding Prime Number Theorem for Beurling number systems with well-behaved integers. We also discuss the sharpness of the method and prove estimates for the local number of zeros, as well as a clustering result, which roughly put says that zeros close to the 1-line cannot be isolated but must occur in clusters.

fields
Number Theory
pdf ↗ page arXiv:2611.03356 ↗

We calculate zeta functions of quasi-split reductive algebraic groups over local fields using the classification of Tits and prove a functional equation. We give explicit exam- ples of these zeta functions for non-split unitary and orthogonal groups.

comments
15 pages
fields
Number Theory, Representation Theory
pdf ↗ page arXiv:2611.03470 ↗

We develop an analogue of nested efficient congruencing applicable in the ring $\mathbb Z[t]/t^2\mathbb Z[t]$ so as to estimate mean values related to that of Vinogradov. Let $k$ be a natural number, and suppose that $\varphi_j(u)\in \mathbb Z[t,u]$ $(1\le j\le k)$ is a system of polynomials having Wronskian $W(u;\boldsymbol \varphi)=\det ({\rm d}^i\varphi_j(u)/{\rm d}u^i)_{1\le i,j\le k}$ with respect to $u$. Consider the number $Υ_{s,k}(X;\boldsymbol \varphi)$ of integral solutions of the system of equations \[ \sum_{i=1}^s \bigl( \varphi_j(u_i+v_it)-\varphi_j(u_{s+i}+v_{s+i}t)\bigr) \equiv 0 \pmod{t^2}\quad (1\le j\le k), \] with $|u_i|\le X$ and $|v_i|\le X$ $(1\le i\le s)$. We show that when $W(u;\boldsymbol \varphi)\not\equiv 0\pmod{t}$ and $1\le s\le k(k+1)/2$, then $Υ_{s,k}(X;\boldsymbol \varphi)\ll X^{2s+\varepsilon}$. Our conclusions extend to number fields and function fields, as we outline. We describe several consequences of our results, including forthcoming work establishing the main conjecture for certain systems of equations not possessing translation-dilation invariant properties.

comments
55 pages
fields
Number Theory
pdf ↗ page arXiv:2611.03487 ↗

Let $\ell$ be an odd prime number. Let $E$ be a non-isotrivial elliptic curve defined over the global function field $K = \mathbb{F}_q(t)$ such that $(q, 6) = 1$ and $q \equiv 1 \mod \ell$. We show that as $q$ grows arbitrarily large, both analytic and algebraic ranks of $E$ do not grow upon base change to $100\%$ of $\mathbb{Z}/\ell \mathbb{Z}$ Galois extensions over $K$. One of the applications we obtain is that over a positive proportion of $\mathbb{Z}/\ell \mathbb{Z}$ Galois extensions $L$ over $K$, the Tate–Shafarevich group of $E$ over $L$ is non-trivial. To obtain these results, we incorporate several geometric and probabilistic techniques which were studied in previous literature. These include the construction of desired auxiliary abelian varieties by Mazur–Rubin–Silverberg, the theory of middle convolution and big monodromy results by Katz and Hall, uniform Chebotarev density theorem by Kowalski, and distribution of prime Selmer groups of auxiliary abelian varieties by Klagsbrun–Mazur–Rubin and Park.

comments
28 pages
fields
Number Theory
pdf ↗ page arXiv:2611.03535 ↗

We prove that $$ \sum_{1\le x,y\le N} e(αF(x,y)) \ll_{F,α,ε}N^{5/3+ε} $$ for every $ε>0$, real quadratic irrational $α$, and integral binary quartic form $F$ that is not the fourth power of a linear form over $\mathbb{C}$. The proof uses the two-dimensional $q$-analogue of van der Corput's method, following Heath-Brown's work in the one-variable case. The heart of our argument rests on new bounds for complete binary cubic Weyl sums with linear terms, which retain the dependence on the cubic discriminant and the linear coefficients.

comments
28 pages, all comments welcome
fields
Number Theory
pdf ↗ page arXiv:2611.03583 ↗

Let $λ$ be the Liouville function. We prove Let $λ$ be the Liouville function. We prove \[ \mathcal{I}_λ(X)=\int_{\mathbb{T}}\left|\sum_{1\leqslant n\leqslant X}λ\left(n\right)\mathrm{e}\left(nα\right)\right| \mathrm{d}α \gg X^{\frac{1}{4}}. \] This removes the $X^\varepsilon$ loss in the previous result of Pandey and Radziwiłł~\cite{PandeyRadziwill2026}. In the second paper in this series, we will prove that \[ \limsup_{X \to \infty} \frac{\log \mathcal{I}_λ(X)} {\log X} \geqslant\frac{1}{3}. \]

comments
7 pages. Comments welcome!
fields
Number Theory
pdf ↗ page arXiv:2611.03589 ↗

We study finite orbits generated by fibrewise translations on varieties carrying two abelian fibrations. Under natural dominance and generation hypotheses, non-isotriviality of the first family forces points with finite orbit to lie over proper closed subsets of both bases. This extends results of Corvaja, Tsimerman and Zannier to complex families of arbitrary, possibly different relative dimensions, including torsors. The proof combines relative Manin-Mumford with a general isogeny rigidity theorem for algebraic group actions.

comments
34 pages. With an appendix by E. Amerik
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2611.03606 ↗

Let $A=\mathbb{F}_q[T]$ and $K=\mathbb{F}_q(T)$, and let $φ$ be a Drinfeld $A$-module over $K$ of rank $r\geq 2$. We study the reduction of $φ$ at primes $\mathfrak{p} \in A$ lying in a prescribed arithmetic progression, for which $φ(\mathbb{F}_{\mathfrak{p}})$ has at most $r-1$ cyclic components. We obtain asymptotic formulas for the number of such primes of a given degree, with error bounds uniform in the modulus of the arithmetic progression. Furthermore, when $\mathrm{End}_{\overline K}(φ)=A$, we sharpen the error term and, under additional hypotheses, establish a necessary and sufficient condition for positivity of the resulting density.

fields
Number Theory
pdf ↗ page arXiv:2611.03607 ↗

We show that, for $k\in\{3,4\}$, a $B_k$-set $A\subseteq[N]$ has size $o(N^{1/k})$ if it omits a fixed positive proportion of the residue classes modulo every prime in a fixed family whose reciprocals have divergent sum.

comments
6 pages
fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2611.03609 ↗

Information Theory66

Let $\text{RM}(r,n)$ be the $r$th order Reed-Mullet code of length $2^n$, and let $ρ(r,n)$ denote its covering radius. It is known that $242\leρ(1,9)\le 244$, and the determination of $ρ(1,9)$ is a long-standing open question. We give a computer-assisted proof that $ρ(1,9)=242$, leveraging the classification of the $349$ orbits in $\text{RM}(3,9)/\text{RM}(2,9)$ under $\text{GL}(9,2)$ [1,3]. The notebook to verify the computer search portion, Verify_RM(1,9).ipynb, contains all data and recomputes each check, and may be found in the repository https://github.com/FreemanSlaughter/Covering-Radius.

comments
9 pages
fields
Information Theory, Combinatorics
pdf ↗ page arXiv:2611.00070 ↗

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
pdf ↗ page arXiv:2611.00082 ↗

Channel state information (CSI) in cellular networks is primarily used to maintain quality of service (QoS), yet it leaks privacy-sensitive information, in particular the user equipment's (UE) location. CSI is reported in plaintext on a publicly available schedule; thus, capturing it on the air and using a well trained AI model to localize the UE is straightforward. This simplicity in the attack execution makes it a serious privacy vulnerability. Using conventional privacy enhancing techniques, such as additive perturbation from differential privacy, to protect location data can potentially degrade the downlink communication quality. We present HideOut, a client-side defense mechanism that preserves the user's location from neural-based localization methods, while maintaining their downlink Spectral Efficiency (SE). Unlike generic adversarial attacks, HideOut treats downlink SE as a strict constraint in an optimization setting. Under maximum ratio transmission (MRT) beamforming, we show that a user-selected SE loss budget can be converted into an angular rate-feasible constraint on the reported channel vector. HideOut then performs gradient-based localization obfuscation while projecting each update onto this rate-feasible set. We evaluate HideOut against four CSI-based localization architectures under both white-box and black-box assumptions. Across models, HideOut increases localization ambiguity (error) from approximately $1–2$ m to $72–85$ m while keeping downlink SE loss within a $1\%$ budget. These results show that CSI-based localization can be substantially degraded at negligible communication quality loss when adversarial perturbations are made aware of the wireless link.

fields
Information Theory
pdf ↗ page arXiv:2611.00088 ↗

Wireless communication systems increasingly require not only confidentiality but also transmission undetectability, motivating covert communications. This paper studies an unmanned aerial vehicle (UAV) enabled covert communication system where a UAV serves a legitimate receiver in the presence of multiple active and colluding wardens with imperfect location information. We maximize covert energy efficiency (CEE) by jointly optimizing the UAV's 3D trajectory and transmit power while accounting for energy. To address the resulting non-convex problem with robust covertness constraints, we develop Genetic Algorithm (GA) and Particle Swarm Optimization (PSO)-based metaheuristic algorithms and compare them with a Block Coordinate Descent with Successive Convex Approximation (BCD-SCA) benchmark. Numerical results show that the proposed methods improve CEE while satisfying covertness constraints.

comments
6 pages, 6 figures. Presented at ATC 2026
fields
Information Theory
pdf ↗ page arXiv:2611.00090 ↗

Rubio and Torres conjectured that a multidimensional Costas array, defined by a bijection between two boxes of integer points whose domain has at least as many dimensions as its image, can stay Costas in every window of its periodic extension only if its order is a power of two fixed by the dimension of the domain. We give a four-dimensional periodic Costas array of order $6$, with a two-dimensional domain and a two-dimensional image, so the conjecture is false. The verification reduces to $36$ windows. It has been confirmed by computer and in the Lean proof assistant. The array also meets with equality the pigeonhole bound that Rubio and Torres use for their non-existence results, so that bound is tight.

comments
Comment arXiv:2208.02378
fields
Information Theory, Combinatorics
pdf ↗ page arXiv:2611.00098 ↗

We provide a counterexample to the non-abelian Gyarmati-Matolcsi-Ruzsa conjecture. The construction comes from an equivalent maximal-coupling entropy inequality, for which a counterexample can be found in a lower-dimensional group. We give an explicit cardinality counterexample in $D_4^{14}$, the fourteenth direct power of the dihedral group of order $8$.

comments
12 pages
fields
Information Theory, Combinatorics
pdf ↗ page arXiv:2611.00156 ↗

Uniform random sampling of strings is overwhelmingly dominated by high-complexity strings, leaving the much smaller set of low- and intermediate-complexity strings largely unexplored. Here, we adapt the nested neutral set estimator (NNSE), a Monte Carlo rare-event sampling method, to estimate the distribution P(K) of complexity values for binary strings of fixed length. NNSE allows us to explore the full complexity landscape, including exponentially rare low-complexity regions that are inaccessible to direct sampling, for string lengths up to several hundred. We apply the method to several widely used complexity measures: Lempel-Ziv 76 (LZ76), Lempel-Ziv 78 (LZ78), context tree weighting (CTW), the block decomposition method (BDM), and block entropy. We further introduce uniform complexity weighting (UCW), which gives equal weight to different complexity levels rather than to individual strings. This approach provides a dataset-independent framework for comparing complexity measures across their full range and reveals substantial differences between measures for low- and intermediate-complexity strings that are largely hidden by conventional uniform sampling. Using the NNSE to perform UCW sampling allows us to compare complexity measures across their full range in a dataset-independent way. This reveals differences in their behavior for low- and intermediate-complexity strings that are practically inaccessible to conventional uniform sampling.

fields
Information Theory
pdf ↗ page arXiv:2611.00162 ↗

We compute Polak's bound $A_4(19,6,8)$ for binary constant weight codes, obtaining the numerical value $673.04001$. An exact rational certificate gives $A_4(19,6,8)\le 673.0400143064802474039375132665301315202504$, and hence $A(19,6,8)\le 673$. This improves the upper bound $693$ listed in Brouwer's table. The certificate is verified by a separate program using exact rational arithmetic.

comments
3 pages
fields
Information Theory, Combinatorics
pdf ↗ page arXiv:2611.00173 ↗

For a fixed positive integer $n>1$, we study the prime powers $q$ coprime to $n$ for which all monic irreducible factors of $Φ_n$ over $\F_q$ have the same coefficient Hamming weight. Cyclotomic orbit coefficients give a finite, effective classification of these fields. Outside finitely many computable characteristics, every factor has the support of its characteristic-zero orbit polynomial; the uniform condition $p>2^{\varphi(n)}$ suffices. In each remaining characteristic, extension exponents reduce to divisors of $\ord_n(p)$, and an integer variance identity expressed by polynomial gcd degrees decides equal weight. The same coefficient data determine the full weight distribution. As an application, we prove that an MDS constacyclic code with an irreducible generator forces every irreducible polynomial of the same root order to have full support, including factors associated with different constacyclic constants. This yields a uniform gcd and norm obstruction. We develop its short-multiplier extension, give a prime-order cubic family, and establish an explicit quadratic-residue exclusion without a prime-square alphabet or a near-square length hypothesis.

fields
Information Theory
pdf ↗ page arXiv:2611.00637 ↗

Semantic error control coding (SECC) can correct the residual errors of a standard channel code with a foundation model that supplies a prior on the source content, but existing SECC schemes are designed for text. In this paper, we develop SECC for image transmission with spatial token interleaving and a two-pass belief propagation (BP) schedule. At the transmitter, a vector-quantized (VQ) tokenizer converts an image into tokens, which are transmitted in multiple low-density parity-check (LDPC) code blocks of fifth-generation New Radio (5G NR). In raster order, a block that BP fails to decode corrupts consecutive token rows, so the interleaver reorders the tokens such that adjacent tokens are carried by different blocks, without additional transmitted bits. At the receiver, after the first BP pass, token recovery fuses the token probabilities given by BP with the predictions of the autoregressive model Emu3-Gen, and the second BP pass decodes each block again with the fused distributions as priors on the information bits. On Kodak24 at 0.5 channel uses per pixel and a signal-to-noise ratio (SNR) of 0.15 dB, the second pass removes 92% of the token errors left by token recovery, and interleaving reduces the final token error rate by 88%. At medium to high SNR, the proposed receiver exceeds deep joint source–channel coding baselines with the same channel uses by at least 1.2 dB in peak signal-to-noise ratio.

fields
Information Theory
pdf ↗ page arXiv:2611.00697 ↗

Constrained quantum samplers often produce infeasible outputs that retain information about good feasible solutions. We develop a post-measurement framework that constructs problem-dependent classical feasibility maps from constraint-violation statistics and pushes the raw quantum sampling law forward onto the feasible set. The probability of each repaired solution is the total raw mass of its repair preimage, enlarging the successful sampling event from a target feasible set to its full repair preimage. We derive exact identities for repaired success and expected cost, and separate repair-basin geometry from sampler-dependent probability concentration. For noisy implementations, we distinguish leakage from the encoded subspace from concentration loss within it. For permutation constraints, Hungarian maximum-overlap repair provides an O(n^3) implementation, which we study on traveling-salesman problems (TSP). We derive conditional repaired-success bounds and quantify how basin aggregation reduces the absolute-transfer budget required by these bounds. Noiseless simulations show that optimal repair basins contain selectively overweighted infeasible contributors. For an n=10 TSP instance, pushforward repair recovered the optimum using approximately 10^3 shots, compared with 10^6 shots in the original CE-QAOA workflow without repair. On a 127-qubit IBM processor, using encodings of up to 100 qubits, repaired candidates match reference tours on smaller benchmarks and improve them on larger instances. These results establish concentration of quantum probability on useful repair preimages as a design principle for constrained quantum optimization.

fields
Information Theory, Mathematical Physics
pdf ↗ page arXiv:2611.00759 ↗

Pinching-antenna systems (PASS) enable near-field beam focusing using radiating points along a dielectric waveguide, but coherent spherical-wave superposition makes their channels sensitive to small user displacements. This sensitivity is critical for power-domain non-orthogonal multiple access (NOMA), where successive interference cancellation (SIC) requires the weak-user layer to remain decodable at the strong user. We develop spatially robust PASS-NOMA designs that optimize antenna placement and power splitting over bounded service areas (SAs), with a preset decoding order and explicit SIC-feasibility constraints. We propose a worst-case design for quasi-static users and an ergodic design for codewords spanning representative SA positions, and characterize their achievable rate regions. Numerical results show that, despite SIC requiring weak-user decoding in both SAs, NOMA outperforms orthogonal multiple access (OMA) with a shared placement under both robustness models except when the strong user is served at low rate. In the ergodic regime, this advantage can persist even against OMA with per-user antenna reconfiguration.

comments
5 pages, 3 figures
journal
IEEE Wireless Communications Letters, Date of Publication: 30 October 2026
fields
Information Theory
pdf ↗ page arXiv:2611.00847 ↗

Rank-2 discrete Fourier transform-spread orthogonal frequency-division multiplexing (DFT-s-OFDM) is attracting renewed interest for 6G uplink, offering not only spatial multiplexing gains but also an additional degree of freedom for peak-to-average power ratio (PAPR) reduction. We exploit this freedom by selectively exchanging constellation symbols between the two layers before DFT spreading, preserving the transmitted information while reshaping the resulting waveforms. Building on this idea, we propose Cyclic Layer Assignment with Shared-basis Synthesis (CLASS). CLASS employs carefully designed cyclic assignment patterns to generate diverse waveform candidates, while reusing a small number of waveform components to avoid synthesizing each candidate separately. We further establish the optimality of the cyclic design in maximizing waveform diversity under a minimum-basis constraint when equal group sizes are feasible. With only six inverse DFTs, CLASS explores 16 assignments and reduces the 99th-percentile worst-layer PAPR by 1.41 dB relative to fixed assignment, outperforming representative selected mapping (SLM) and partial transmit sequences (PTS) schemes under the same synthesis budget.

fields
Information Theory
pdf ↗ page arXiv:2611.00862 ↗

For a balanced Boolean function $f$ on the discrete hypercube, we study the $α$-stability $\mathbb{E}[(T_ρf)^α]$, where $T_ρ$ is the Boolean noise operator and $0<α<1$. Using the asymmetric Hellinger kernel estimates recently established by OpenAI, we prove that dictators minimize the $7/8$-stability in every dimension and at every correlation $0\leρ\le1$. At interior correlations they are the only minimizers. As a consequence, dictators minimize the $α$-stability for every $7/8\leα<1$, maximize the $α$-stability for every $1<α<2$, and maximize the one-sided Shannon entropy stability $\mathbb{E}[T_ρf\log T_ρf]$. This resolves a conjecture of Li and Médard and strengthens the Courtade–Kumar conjecture in the balanced setting.

comments
27 pages
fields
Information Theory, Probability
pdf ↗ page arXiv:2611.00868 ↗

We derive a Gaussian Mixture (GM) representation of a full-dimensional subset of Euclidean space with finite volume from a finite simplicial triangulation in closed form. On each simplex, we replace the uniform probability density function (PDF) with a Gaussian PDF that minimizes the Kullback–Leibler (KL) divergence, arriving at the information projection onto the family of Gaussian PDFs. By exploiting affine isomorphisms between simplices, the joint convexity and bijection invariance properties of the KL divergence, identities for Dirichlet PDFs, and a partition-of-unity argument, we establish a dimension-dependent but geometry-independent sharp upper bound on the global KL divergence between the resulting GM PDF and the uniform PDF on the original domain. Numerical examples illustrate the construction and demonstrate its potential in practical applications.

comments
Accepted to "2026 IEEE Sensor Data Fusion: Trends, Solutions, Applications (SDF)". 17 pages and 6 figures
fields
Information Theory, Numerical Analysis, Probability
pdf ↗ page arXiv:2611.00922 ↗

We prove a fixed-characteristic density form of the Berger-Charpin conjecture for non-degenerate irreducible cyclic codes: for each prime $p$, the lengths admitting such a non-standard code over some finite field of characteristic $p$ have natural density zero. Thus, for almost every length coprime to $p$, every such code over every finite field of characteristic $p$ has only the permutation automorphisms generated by the cyclic shift and the Frobenius map. The proof uses the Feng–Hollmann–Li–Xiang classification for non-standard irreducible cyclic codes, a normal form for the deriving constructions in that paper, and a theorem by Wiertelak on multiplicative orders, in the form recalled by Moree.

comments
13 pages
fields
Information Theory, Combinatorics
pdf ↗ page arXiv:2611.00925 ↗

We study the shared randomness needed to sample a uniform permutation in parallel output rounds. Coordinates committed in the same round are independent conditional on the complete history and the current shared choice. Previous outputs are public; local computation and private randomness are free. We charge each shared choice by the logarithm of its conditional support size and sum these costs along the worst execution path. At every fixed round density $ρ\in(0,1)$, the optimal limiting total-variation error under any $o(n)$ shared budget matches the conditional-marginal optimum, even with arbitrary local kernels and adaptive coordination. A fixed improvement requires linear cost. For exact sampling in $R=Θ(n)$ rounds, the optimum is $nΦ(R/n)+O(\log n)$, where $Φ$ linearly interpolates $Φ(1/q)=\log q$. A protocol attaining this rate uses an initial seed and at most one further binary shared choice. When $\lceil n/2\rceil\le R\le n$, the finite optimum is $\log\binom{2(n-R)}{n-R}$, attained by an initial seed alone. The approximate converse uses an entropy inequality for sparse injections to control overlap with the target. The exact construction reuses randomness retained in a shared label partition after the first-stage outputs are exposed.

fields
Information Theory
pdf ↗ page arXiv:2611.01028 ↗

Under uniform transmission, we determine the received binary words that maximize input entropy for two-deletion and two-insertion channels. For two deletions the maximizers are exactly the two alternating words at every positive received length. For two insertions the same conclusion holds from received length five onward; we give all smaller cases and exact maximal values. The proof combines an embedding-count identity organized by runs with strict convexity estimates, and a grouping of two-position deletion masks. For every insertion radius we give the complete positive embedding histogram of an alternating received word. We also determine its three-deletion histogram for every length, and certify all three-deletion maximizers through received length twelve and all three-insertion maximizers through length eighteen by exact integer comparison. These computations give precise three-error conjectures with their small-length exceptions.

comments
12 pages; exact enumeration code, outputs and Lean companion in ancillary files
fields
Information Theory, Combinatorics
pdf ↗ page arXiv:2611.01064 ↗

Millimeter-wave (mmWave) communication relies on directional beam sweeping for initial access, which incurs substantial latency and signaling overhead as antenna arrays grow large and deployments become denser. Machine-learning-based beam prediction can reduce this overhead, but its effectiveness depends on training data that accurately reflects the deployment environment, a requirement that is difficult to meet in practice. This paper presents a latency-aware beam management architecture that integrates digital-twin-assisted prediction, regionbased localization, weighted ensemble learning, and explainability-driven beam pruning into a unified framework. A digital twin (DT) generates site-specific ray-traced channel knowledge offline, enabling environment-aware beam prediction without exhaustive real-world measurements and supporting both initial access and beam tracking. The proposed ensemble learning scheme combines a base classifier and a specialist classifier through reliability-weighted fusion to improve prediction accuracy and robustness, while explainable artificial intelligence (XAI)-based attribution pruning reduces the beam codebook to a small subset of the most informative beams for beam allocation. To capture the distributional mismatch between the DT and real-world environments: the network was trained on imperfect digital-twin data but evaluated on real-world surrobase data. Results show that the proposed method achieves 96.80% top-1 and 98.36% top-3 beam prediction accuracy, while reducing over-the-air sounding overhead by nearly an order of magnitude relative to exhaustive sweeping, outperforming convolutional and deep neural network baselines from prior work.

fields
Information Theory
pdf ↗ page arXiv:2611.01107 ↗

In this work, we investigate the impact of Doppler frequency shift on sub-terahertz low Earth orbit (LEO) satellite communications using OFDM transmission. To comprehensively evaluate the severity of the Doppler shift impact on sub-terahertz satellite-to-ground links, we first put together an evaluation framework that jointly accounts for major Doppler-induced and non-Doppler-induced signal impairments in such systems. We then compare and contrast three possible engineering approaches to deal with Doppler shift in such a communication system. Our study concludes that (i)~while just ignoring the Doppler effect in such high-frequency and high-mobility systems substantially compromises the performance and reliability, (ii)~most of the negative effects can be eliminated by implementing only a small set of low-complexity measures. We particularly show that even a single Doppler shift estimation over a 5-min-long satellite pass over the ground user location may be sufficient to ensure high performance throughout the entire connectivity period. Hence, while Doppler shift is an important effect to account for in sub-terahertz LEO satellite communications, it should not constitute a critical design challenge for these emerging systems.

fields
Information Theory
pdf ↗ page arXiv:2611.01264 ↗

Sendrier's Support Splitting Algorithm (SSA) is the standard solver for the Permutation Equivalence Problem (PEP); its cost is dominated by a term that grows exponentially in the hull dimension. We study, mathematically, how much this cost can be lowered by replacing the standard inner product, on which the hull is defined, with an alternative bilinear form. Two structural results give a complete answer: only a narrow two-parameter family of bilinear forms produces a hull on which SSA can still operate, namely those whose matrix in the standard basis is a linear combination of the identity and the all-ones matrix; and even within this family the hull dimension drops by at most one (with the reduction achieved on every self-dual code whose length is coprime to the field characteristic). Together, these results give a tight upper bound: since SSA on a code with hull dimension $h$ has cost dominated by $q^h$, replacing the standard hull with $\mathrm{Hull}_M$ lowers this dominant term from $q^h$ to at best $q^{h-1}$, so no bilinear-form generalization of the inner product can reduce the SSA cost by more than a factor of $q$, the field size. Going beyond this requires invariants outside the bilinear framework. As an application, we verify that PEP-based SPECK admits the factor-$q$ cost reduction, while LEP-based LESS and PKP-based PERK lie outside our framework. A SageMath implementation of the bilinear-hull preprocessing confirms feasibility at SPECK's recommended length $n = 252$.

comments
25 pages. Accepted to SAC 2026; to appear in Lecture Notes in Computer Science (Springer). Author's accepted manuscript
fields
Information Theory
pdf ↗ page arXiv:2611.01337 ↗

The minimax next-symbol Kullback-Leibler risk for stationary binary renewal processes is known to have order n^(-1/2). We give a polynomial-time predictor attaining this order for an arbitrary unknown finite-mean interarrival law. The construction uses a classical type-uniform renewal code. Its contribution is an exact dynamic program for censored prefix marginals, avoiding enumeration of gap histograms or binary completions. Combined with an established prediction reduction, it gives risk at most [log M_(n+1)+log(n+2)]/n, where M_N counts renewal types. Shared suffix updates reduce the total computation to O(n^3) arithmetic work and polynomial bit complexity, without tail, mixing, known-mean, or bounded-support assumptions. The statistical rate and its lower bound are prior results; the proposed advance concerns computation.

comments
11 pages; includes exact algorithms and a reproducibility appendix with ancillary Python code
fields
Information Theory
pdf ↗ page arXiv:2611.01430 ↗

This paper investigates secrecy sum-rate (SSR) maximization in a downlink rate-splitting multiple access (RSMA)-enabled single-waveguide pinching-antenna system (PASS) with an external eavesdropper. The RSMA power allocation, secure common-rate allocation, and pinching-antenna (PA) positions are jointly optimized subject to transmit-power, per-user secrecy-rate, and PA-placement constraints. To tackle the resulting nonconvex problem, an alternating-optimization framework is developed, combining successive convex approximation for RSMA resource allocation with feasibility-preserving projected gradient ascent for PA-position optimization. Numerical results show that the proposed design consistently outperforms the considered benchmarks in terms of average SSR, demonstrating the benefits of joint RSMA resource and PA-position optimization for secure PASS transmission.

fields
Information Theory
pdf ↗ page arXiv:2611.01544 ↗

For every fixed genus $g\geq2$ and every $0<ρ<1$, we construct maximum distance separable (MDS) algebraic geometry codes over $\F_q$ for all sufficiently large odd squares $q$. Their parameters are $\bigl[n,\lfloorρn\rfloor,n-\lfloorρn\rfloor+1\bigr]_q$ with $n=\sqrt q+1+O_g(q^{1/4})$. The codes use full Riemann–Roch spaces on genus-$g$ hyperelliptic curves. They are not monomially equivalent to generalized Reed–Solomon (GRS) codes when $q$ is sufficiently large. An infinite subfamily has exact length $n=\sqrt q+2gq^{1/4}+1$.

comments
10 pages, 2 figures
fields
Information Theory, Algebraic Geometry
pdf ↗ page arXiv:2611.01546 ↗

This paper characterizes the second-order coding region of the scalar Gaussian broadcast channel along the curved boundary of its capacity region. The characterization holds under both average and maximal error criteria and allows correlation between the receiver noises. At each interior point of this boundary, the second-order region is a halfspace, as in the work of Scarlett and the author on Gaussian multiple-access channels with degraded message sets. Achievability follows from spherical superposition coding with a blocklength-dependent power allocation. The main innovation lies in the converse. Using Ornstein–Uhlenbeck entropy dissipation and Gaussian functional inequalities, we construct an auxiliary observation through an additive Gaussian noise channel and establish quantitative relative entropy bounds for the channel output distributions conditioned on this observation. The strong functional representation lemma of Li and El Gamal then allows us to select a realization of its independent random seed to obtain a deterministic partition of the retained receiver-1 message set. The component label plays a role analogous to the auxiliary random variable in the capacity characterization, while providing the distributional control needed at the second-order scale. These properties guide the construction of auxiliary output measures whose likelihood ratios admit the cancellations and normal approximation needed to evaluate an information spectrum converse.

comments
34 pages, 9 figures
fields
Information Theory
pdf ↗ page arXiv:2611.01583 ↗

The development of 6G uplink is expanding waveform and spatial transmission options, while distributed reception makes their relative merits depend on the spatial and frequency structure of the aggregate channel. We study the joint selection of cyclic prefix orthogonal frequency-division multiplexing and discrete Fourier transform spread OFDM at rank 1 and noncoherent rank 2 under common user equipment power constraints and centralized linear minimum mean-square error reception. We derive waveform switching thresholds at both ranks and a rank selection margin, establishing conditions for selecting among the four modes based on available transmit power, DFT despreading loss, and spatial multiplexing gain. We then characterize how port gains and correlations at individual access points (APs) form aggregate spatial separation and influence mode selection. At fixed port gains and available transmit powers, improving spatial separation without reducing it on any subcarrier increases the rank selection margin, while its effect on the preferred waveform within rank 2 depends on the frequency distribution of the improvement. Numerical results show that different AP deployments can favor different waveforms and ranks, even with the same receive antenna budget and comparable aggregate channel gains, including waveform switches at a fixed preferred rank.

fields
Information Theory
pdf ↗ page arXiv:2611.01590 ↗

In this paper, a worst-user outage probability minimization problem in active reconfigurable intelligent surface (RIS)-aided systems is addressed. Since the resulting problem involves a discontinuous objective function over an unknown channel distribution, a sequence of reformulations is applied by integrating a probability-simplex user weighting, a softplus surrogate for differentiability, and entropic tail-risk aggregation for rare but severe outage events. Based on the reformulated problem, a data-driven stochastic optimization technique that relies on historical channel samples is adopted to jointly optimize the beamformer and reflection coefficients with projected adaptive moment estimation. Simulation results show advantages of the proposed technique for reliability-oriented active RIS transmission design.

comments
5 pages, 2 figures, accepted to IEEE Wireless Communications Letters
fields
Information Theory
pdf ↗ page arXiv:2611.01650 ↗

GPTQ is Babai's nearest-plane algorithm on the lattice of the Cholesky factor of the layer's input second moment $Σ$. In the high-rate, entropy-coded regime it needs $\tfrac12\log_2(\AM/\GM)$ of its Cholesky pivots more bits than WaterSIC, which is within $0.255$ bit of the rate-distortion limit for every $Σ$; random rotations close most of this gap in practice, and Ordentlich and Polyanskiy asked for the worst-case gap between rotated GPTQ and WaterSIC. We show that after a Haar rotation the $k$-th pivot converges almost surely, uniformly in $k\geδn$ and over spectra $ν$ of bounded condition number, to $1/S_ν(-k/n)$, a classical formula from the theory of Lyapunov exponents, and use it to answer the question. Over spectra with condition number $κ$ the worst rotated gap is $\tfrac12\log_2κ-\log_2\lnκ+\tfrac12-\tfrac1{\ln2}+o(1)$ bits, attained only by two-point spectra, just $\tfrac12\log_2\lnκ+O(1)$ bits below the worst case without rotation, so rotation cannot replace waterfilling in general. It nearly can on real layers: rotation cuts the cost of an $η$-fraction of outlier eigenvalues of size $μ$ from about $ημ$ to $η^2μ/2$ to leading order, but cannot remove spectral spread on a logarithmic scale; for non-Gaussian weights it also adds a weight-side rate cost, which we characterize exactly under a standard high-rate assumption. On $96$ Hessians of Qwen3 and Llama-3.1 the rotated gap has median $0.04$ bit and maximum $0.36$ bit, against $2$--$5$ bits in the worst case for the same condition numbers, and the limit matches it to within $0.009$ bit.

comments
28 pages, 3 figures
fields
Information Theory
pdf ↗ page arXiv:2611.01669 ↗

We consider communication systems operating in environments where some participating users cannot be trusted. This motivates the study of Byzantine communication models, in which users may behave adversarially. In this survey, we provide a unified information-theoretic perspective on communication with adversarial users in multi-user settings. We review recent advances in Byzantine multiple access channels, including reliable communication, adversary identification, and distributed function computation. Furthermore, we discuss extensions to classical-quantum channels and highlight fundamental differences between classical and quantum models. Finally, we outline key open problems and future research directions at the intersection of communication, computation, and security.

fields
Information Theory
pdf ↗ page arXiv:2611.01678 ↗

This paper investigates the influence of reference waveform selection on temporal dispersion estimation in a time-varying radio channel at 38 GHz. Three reference waveforms-numerically generated in MATLAB, measured through a conducted connection, and recorded in an anechoic chamber -are compared using the same wideband channel measurements conducted in a dynamic road environment. Their effects on the estimated power delay profiles (PDPs), mean delay, and root mean square (RMS) delay spread are evaluated. Despite noticeable differences in the time-domain and spectral characteristics of the reference waveforms, the resulting PDPs exhibit similar multipath structures, while the estimated temporal dispersion parameters show relatively small differences. The results indicate limited sensitivity to reference waveform selection under the investigated measurement conditions.

comments
5 pages, 7 figures
fields
Information Theory
pdf ↗ page arXiv:2611.01685 ↗

Using the Feature Space Decomposition framework, we establish non-asymptotic matching upper and lower bounds for the expected Kullback-Leibler estimation error of the Add-$λ$ estimator of a discrete probability distribution, for any signal, any dimension, any sample size, and any $λ>0$.

fields
Information Theory, Statistics Theory
pdf ↗ page arXiv:2611.01828 ↗

Hybrid precoding reduces the radio-frequency (RF) hardware burden in wideband massive MIMO-OFDM systems, but conventional optimization and deep neural network (DNN)-based approaches can incur high online complexity. This paper proposes XGB-SVD, a lightweight hybrid precoding framework that maps compact ray-tracing path parameters directly to analog beamforming codeword indices using cascade eXtreme Gradient Boosting (XGBoost). The cascade captures sequential beam-selection dependencies and transmit–receive propagation correlation, while the digital precoder and combiner are obtained from the reduced-dimensional equivalent channel using singular value decomposition (SVD). Evaluations over five DeepMIMO scenarios spanning sub-6-GHz and millimeter-wave bands show that XGB-SVD consistently outperforms the considered DNN baselines and approaches simultaneous orthogonal matching pursuit (SOMP) in several environments. Cross-scenario results further indicate improved transfer from propagation-diverse training environments, while XGB-SVD provides lower online computational and training costs than the DNN baselines.

comments
6 pages, 4 figures, 3 tables. Submitted to the IEEE International Conference on Communications (ICC) 2027
fields
Information Theory
pdf ↗ page arXiv:2611.01880 ↗

Integrated sensing and communication (ISAC) enables wireless infrastructure to jointly support communication and environmental sensing, but also introduces new physical-layer security threats. A malicious reconfigurable intelligent surface (RIS) can manipulate its time-varying reflection phases to generate spoofing echoes and distort the sensing results of a roadside unit (RSU). Existing trajectory-level detectors rely on reconstructed sensing parameters and vehicle trajectories, making their performance dependent on upstream estimation accuracy. In this paper, we propose a signal-level Green Learning (GL) framework that directly detects RIS spoofing from matched-filtered RSU echoes. The proposed method combines two-stage Subspace Approximation with Adjusted Bias (SAAB), Discriminant Feature Test (DFT), and eXtreme Gradient Boosting (XGBoost) for spatial-temporal representation learning, feature selection, and classification, respectively. Simulation results show 99.335\% detection accuracy for a 32-element malicious RIS at $-80$ dBm receiver noise power. GL remains competitive with Long Short-Term Memory (LSTM) and bidirectional LSTM (BiLSTM) baselines while requiring only 0.1119 million floating-point operations (FLOPs), and also generalizes to previously unseen RIS sizes.

comments
6 pages, 4 figures, and 2 tables. Submitted to the IEEE International Conference on Communications (ICC) 2027
fields
Information Theory
pdf ↗ page arXiv:2611.01881 ↗

Microwave linear analog computer (MiLAC) has been proposed as an analog processing architecture to perform efficient computation in the microwave domain. Consisting of reconfigurable impedance networks, a MiLAC can extract many of the gains of large multi-antenna systems without costly digital processing, e.g., achieving capacity in narrowband multiple-input single-output (MISO). However, the behavior of wideband MiLAC, required to support high data-rate transmissions, is widely unknown. The impedance components of MiLACs have non-trivial frequency-dependent response, requiring specific implementations to characterize it. In this work, we consider MiLAC implementations based on LC resonators with tunable capacitance, which allow synthesizing near-arbitrary passive lossless impedance matrices at individual frequencies using inductors and varactors. We characterize the mapping between optimal MISO precoding at a reference frequency, and the vector of capacitances configuring the MiLAC. We derive the degrees of freedom (DoFs) remaining after fixing such optimum precoding at the reference frequency, and show that these DoFs can be exploited to tune the frequency response of the MiLAC. We propose two techniques to exploit these DoFs: a closed-form approach for frequency-flat MiLAC processing, and a numerical approach for multi-frequency MiLAC processing, optimizing processing at frequencies other than the reference one. The frequency-flat approach shows satisfactory performance in a simulated frequency-flat millimeter-wave scenario, approaching the performance of digital processing. The multi-frequency approach can adapt to the frequency-selectivity of a simulated sub-6GHz scenario, attaining gains over frequency-flat digital processing. This constitutes the first demonstration that realistic MiLAC implementations can be configured to perform independent computations at different frequencies.

comments
15 pages, 6 figures. Copyright information may change upon publication at an IEEE journal
fields
Information Theory
pdf ↗ page arXiv:2611.02109 ↗

We study codes correcting up to $t\geq1$ successive adjacent transpositions, using block concatenation to support blockwise encoding and decoding. A fixed set $P$ of words of length $b$ over a $q$-symbol alphabet generates, for every $m$, the length-$mb$ code of all concatenations of $m$ words from $P$. For our explicit constructions, the prepared encoder and decoder depend only on the block parameters and are reused at every concatenation length. We first prove that correction at every concatenation length is certified by a single finite test at $2t+1$ blocks, and this test is tight over a $q$-symbol alphabet exactly when $\binom q2\geq2t$. For binary words and $b\geq2t+1$, we give an explicit construction with total redundancy at most $mt\log_2 b+O_t(m)$, matching the optimal per-block redundancy $t\log_2 b+O_t(1)$ among block sets correcting at every concatenation length. Among all binary $t$-correcting codes of length $mb$, the optimal total redundancy is $t\log_2(mb)+O_t(1)$. Using all concatenations of one block set makes our total redundancy grow linearly in $m$ and buys independent block encoding, with one encoder and decoder at every length. The construction encodes and decodes in time linear in $mb$ for fixed $b,t$, and recovers the $j$-th source block from the first $jb$ received symbols. We also prove that, whenever the length-$mb$ code corrects $t$ transpositions, the $j$-th source block is determined within $2tb$ received symbols beyond position $jb$, and that explicit binary block sets with rates tending to one as $b$ grows with $t$ fixed attain this bound in the worst case. Finally, we prove that every ordinary correcting code contains a constant fraction of its words whose arbitrary concatenations retain correction, for fixed $q,t$.

comments
32 pages
fields
Information Theory
pdf ↗ page arXiv:2611.02192 ↗

Capacity-approaching quantum error correction faces a fundamental tension: the required parity-check matrices need to become increasingly dense, while practical decoding and syndrome extraction favor sparse, bounded-degree structures. Reconciling these competing requirements remains an important open problem in quantum code design. We construct Calderbank-Shor-Steane (CSS) code ensembles that approach the CSS rate over memoryless Pauli channels under maximum-likelihood decoding while retaining sparse, bounded-degree graphical representations. The construction separates parity-check density from graphical complexity: although capacity-approaching components may require dense parity-check matrices, they are represented by sparse concatenated factor graphs. We first study a construction combining low-density parity-check (LDPC) and low-density generator-matrix (LDGM) component codes and numerically analyze the average weight distributions of the resulting codes. Motivated by these results, we introduce a second construction based on concatenated LDPC and LDGM codes and generalized irregular repeat-accumulate (GIRA) codes. We derive bounds on the average weight distribution of the resulting sum ensemble and use the Miller-Burshtein framework to prove simultaneous reliability of the two CSS decoding components. Consequently, the proposed ensemble achieves rates arbitrarily close to the CSS hashing bound under separate bit- and phase-error correction, while maintaining bounded graphical complexity, thus providing a foundation for future iterative decoders and indirect syndrome-extraction architectures.

comments
45 pages, 9 figures
fields
Information Theory
pdf ↗ page arXiv:2611.02339 ↗

Wi-Fi sensing applications require unambiguous angle-of-arrival (AoA) estimation over the full azimuth plane. Uniform circular arrays (UCAs) are shown to remove this ambiguity, but deploying the four RF chains typically available on commercial Wi-Fi chipsets into a sparse layout suffers from spatial undersampling. Such undersampling produces strong grating lobes. To overcome this hardware bottleneck, we first establish a generalized array manifold incorporating element radiation patterns, revealing the suitability and degradation mechanisms of directional UCAs. Then we propose an angularly staggered beam-switched UCA architecture that leverages the spatial complementarity. Numerical evaluations demonstrate that the proposed scheme effectively mitigates grating-lobe ambiguities without increasing the number of RF chains, significantly reducing AoA estimation outliers and improving omnidirectional tracking performance.

comments
5 pages, 8 figures. Submitted to EuCAP 2027
fields
Information Theory
pdf ↗ page arXiv:2611.02378 ↗

Over-the-air backpropagation returns a loss gradient through the reciprocal channel, which requires the return port to see the channel of the forward port. If the terminal moves in between, a fluid antenna system can return through the port nearest to the forward position. In ray-traced Chicago streets, with a pedestrian displacement of about half a wavelength and a street-level base station, this rule reverses 20 percent of the gradients at a port spacing of 0.7 wavelengths and 49 percent at 0.9 wavelengths, while one of the four nearest ports stays aligned in all but 2 and 9 percent. We derive a certificate for the sign of the mean correlation from the second moment of a planar angular spectrum. It reduces to a linear program with three variables and infinitely many constraints, is tight, and holds over a region of second moments. In a static Gaussian model, observations collected along a line cannot tell an angular spectrum from its mirror image, so the sign of the cross moment must come from other information. At unsurveyed positions of the same city, a knowledge map that transports surveyed paths through virtual sources and fits them to the causal channel history lowers the reversal rate at 0.9 wavelengths from 49 to 27 percent. Its gain over the nearest port survived every tested error, while its gain over a geometry rule stayed significant at the tested single-error levels of 5 degrees of phase drift per step and 2 mm of position error but not at the next tested levels. Without any survey, across five cities and ten base stations, the nearest port reverses 37 percent of the returns at 0.9 wavelengths and a rule based on the direction and elevation of the base station 20.5 percent. The multilayer perceptrons we tested did not beat these physical rules by the margin fixed in advance in the primary settings.

comments
15 pages, 6 figures, 13 tables. Extended version with appendices
fields
Information Theory
pdf ↗ page arXiv:2611.02384 ↗

In physical backpropagation, users return loss derivatives over the time-division duplex uplink, giving the base station the downlink gradient without channel reconstruction. Reciprocity calibration conventionally prioritizes base-station chains, as column-normalized zero-forcing reduces a per-user factor to a stream rotation. This priority can reverse. With ideal base-station chains and no noise, per-user amplitude errors make the returned field a weighted sum-rate gradient. With zero-forcing full service at both optima, the loss is independent of array size. Otherwise the selection penalty, serving the wrong users, carries 86 to 94 percent of the amplitude-induced loss in five of six configurations. Per-user phase errors mainly slow the iteration. Base-station chain errors scale the returned field per antenna, and at 3 dB and 25 degrees they cost one user 1.3 dB of signal-to-noise ratio (SNR) that no array size removes. With 80 users, such errors on both sides, and mismatched pilots, oracle per-user and base-station calibration leave 6.2 and 12.3 percent loss at 256 antennas on clustered channels. This ordering holds at 30 dB SNR and reverses for 1 dB, 10 degree user errors. A capped one-echo estimator comes within 2.4 percentage points of oracle per-user calibration but underperforms no calibration at 10 dB SNR.

comments
9 pages, 3 figures, 2 tables
fields
Information Theory
pdf ↗ page arXiv:2611.02390 ↗

We prove a sharp upper bound on the mutual information between two binary random variables in terms of their distribution-dependent KL contraction coefficient. This resolves the binary-pair conjecture of Anantharam, Gohari, Kamath, and Nair. Equality holds if and only if the variables are independent or form a doubly symmetric binary source. The proof uses supporting tangents of an entropy curve to vary the input distribution and the channel while preserving the contraction coefficient. Together with tensorization and data processing, the result also bounds the mutual information between binary outputs obtained separately from two correlated observation sequences. When the observation pairs are independent copies of a finite-alphabet pair, this bound depends only on the law of one pair and not on the number of observations.

fields
Information Theory
pdf ↗ page arXiv:2611.02392 ↗

Inspired by the optimization approach to biology, we formulate an inverse problem for communication with memory: construct a finite-state channel for which a given signaling behavior supports capacity-achieving codes. Dynamic measure matching is introduced to turn a directed-information converse into conditions on the channel dynamics. These conditions lead to a new notion of dynamic surprise: the log ratio of physical to test output probabilities with a continuation correction for future signaling opportunities. The matching inequalities bound its conditional mean. For fixed architecture, test law, and potential, channel row synthesis under convex physical restrictions is convex. For every signaling constraint represented by a finite irreducible constrained graph of positive entropy, we construct a channel law under which undesired inputs remain available and behaviorally distinct while incurring a strict information penalty. A noisy refractory family has an exact capacity plateau, followed by an interval in which Shannon and zero-error feedback capacities differ. Explicit zero-error codes attain capacity in the graph construction and on the plateau. In this family, a Gibbs choice maximizes the penalty and makes dynamic surprise equal its conditional mean on every transition, yielding an exact trajectory-wise likelihood identity, a finite-block bound on successful decoding with premature requests, and an exponential strong converse. An exact gap decomposition into action residuals and output-law divergence constrains every reliable capacity-approaching code. Within the strict plateau, positive discrimination exponents for unused dynamics require a positive rate loss, while sparse probing permits consistent estimation at asymptotic capacity. A chemical channel illustrates how premature stimulation can alter future responsiveness while leaving the immediate output law unchanged.

fields
Information Theory
pdf ↗ page arXiv:2611.02400 ↗

Quantum channel relative entropy can be nonadditive, making its regularization essential for asymptotic analysis. We study when the regularized value is attained at finite blocklength and how efficiently it can be approximated. For the first question, we establish a sharp dichotomy: the regularized value is either attained already at the single-copy level, implying additivity at every blocklength, or is never attained at any finite blocklength. Notably, a simple two-copy additivity test distinguishes between these alternatives for qubit channels and for channel pairs in arbitrary dimensions admitting an interior optimizer. We further show that both the interiority condition and finite nonattainment are generic, holding for almost every channel pair. For the second question, we establish explicit convergence rates for approximating the regularized channel relative entropy. For fixed channel dimensions, $\widetilde O(\varepsilon^{-3/2})$ channel copies suffice to approximate the regularized value to additive accuracy $\varepsilon$. Alternatively, a semidefinite hierarchy achieves the same accuracy at level $\widetilde O(\varepsilon^{-2})$, yielding a certified polynomial-time approximation. Together, these results reveal the intriguing structure and generic behavior of regularized channel relative entropy, sharpening our understanding of both its analytical and computational aspects.

comments
comments are welcome
fields
Information Theory
pdf ↗ page arXiv:2611.02425 ↗

Measuring devices do not always function perfectly due to fatigue, damage, or malfunction. When device repair or replacement is not possible, it becomes necessary to seek optimal measurements from a broken device. We show this is possible via a sequential decision making process where we optimize measurement sequences over the remaining available measurements using information theory. With dynamic programming, we show greedy measurement sequences are always suboptimal for a simple class of measurement constraints. Greedy measurement sequences generally lead to equiprobable measurement outcomes, while the optimal policy is found to select each measurement in such a way as to assign a low probability to any measurement outcome that triggers a constraint condition; leading to measurement outcomes that are not equiprobable. A measurement sequence generated under this policy is shown to decompress its source: that is, the expected number of measurement outcomes is strictly greater than the number of bits it encodes, defining a key property of constrained measurements. Dynamic programming is inefficient for finding optimal measurement sequences, so we develop an alternative algorithm related to optimal binary decision trees. By deriving upper and lower complexity bounds for the task, we propose this algorithm as an efficient means to find optimal measurements for a broken or constrained measuring device.

fields
Information Theory
pdf ↗ page arXiv:2611.02470 ↗

We determine the information complexity of matrix multiplication over finite fields under independent uniform inputs, up to a universal additive constant. The binary inner-product case resolves the open question of Braverman, Garg, Pankratov, and Weinstein on the optimal dependence of information complexity on the error probability. For inputs in $\mathbb F_2^m$ and error at most $\varepsilon\in[0,1/2]$, the information complexity with output at Bob lies between $(1-2\varepsilon)m-c_0$ and $(1-2\varepsilon)m$, where $c_0<4.772$ is a universal constant. For independent uniform matrices $X\in\mathbb F_q^{t\times m}$ and $Y\in\mathbb F_q^{s\times m}$, where $t\le s$, computing $XY^{\mathsf T}$ with output at Bob and error at most $\varepsilon\in[0,1]$ has information complexity $(1-q^{ts}\varepsilon/(q^{ts}-1))^+mt\log_2q$, up to an additive gap of less than $9.544$ bits. This gap is independent of the matrix dimensions, field size, and error. At zero error, the information complexity is exactly $mt\log_2q$. The information lower bounds for both inner product and matrix multiplication follow from a new Shannon-to-min-entropy theorem for convolution on discrete groups. Let $Q_1,\ldots,Q_k$ be the finitely supported distributions of independent random variables taking values in a discrete group, and let $s$ be the largest support size. We show that if $k\ge\lceil\lfloor\log_2s\rfloor\ln2\rceil$, then the min-entropy of their ordered product is at least the average Shannon entropy of the $Q_i$ minus $c_0$ bits. This holds for arbitrary discrete groups, including infinite and noncommutative groups, even when the input distributions differ. The leading coefficient of the logarithmic threshold is optimal.

comments
38 pages, including appendices
fields
Information Theory
pdf ↗ page arXiv:2611.02684 ↗

Pinching-antenna systems (PASS) reconfigure the wireless channel by positioning dielectric antennas along a waveguide. A single waveguide, however, confines its antennas to one line, so that good coverage of an area has relied on several waveguides or waveguide segments with separate feeds. This paper proposes X-PASS, in which a hub feeds radially deployed waveguide arms, one pinching antenna on each, and drives them by arm selection, aggregation or multiplexing. It models the hub with its insertion losses, derives a unified signal-to-noise ratio expression for these three operating modes, and derives in closed form a radius inside which aggregation outperforms selection. Numerical results validate the analysis and compare the coverage of X-PASS with that of the other layouts at equal transmit power.

comments
6 pages, 5 figures. Submitted to IEEE ICC 2027
fields
Information Theory
pdf ↗ page arXiv:2611.02687 ↗

Physical-layer key generation (PLKG) exploits reciprocal channel dynamics to generate symmetric keys, addressing the key distribution problem in wireless communications. However, strong temporal correlation in slow-fading environments limits fresh randomness and results in low key generation rates. Movable antennas (MAs) introduce spatial degrees of freedom through antenna repositioning, providing a new approach to addressing the limitation. This paper investigates MA-assisted PLKG over temporally correlated channels. A first-order Gauss-Markov process is utilized to characterize the temporal correlation of multipath gains. We characterize the full-sequence mutual information (MI) over temporally correlated channels. For fixed antenna positions and beamforming, we establish a finite-horizon approximation error bound that vanishes as both effective signal-to-noise ratios (SNRs) increase. We derive a closed-form expression for the one-step conditional MI and adopt it as a tractable key-information metric. A nonconvex problem is formulated to jointly optimize antenna positions and per-slot beamforming under transmit-power and minimum-spacing constraints. We develop an alternating optimization algorithm, combining an exact principal-eigenvector beamforming solution with feasible SCA-based projected gradient position updates. Simulation results demonstrate that the MA-assisted scheme outperforms the fixed-position antenna baseline. At a high temporal correlation coefficient, position optimization achieves approximately $51\%$ higher rates than fixed antennas. Joint position and beamforming optimization provides a further $106\%$ gain over position optimization alone, demonstrating more pronounced gains under strong temporal correlation.

fields
Information Theory
pdf ↗ page arXiv:2611.02761 ↗

This paper develops a receiver-specific mean-squared-error (MSE) framework for cooperative integrated sensing and communication (ISAC) localization using random orthogonal frequency-division multiplexing (OFDM) payloads. It captures local peak perturbations and incorrect ambiguity-peak acquisition for two classical receiver processing schemes: matched filtering (MF) and reciprocal filtering (RF). For scatterers well separated in delay, we quantify how frequency spread and interference induced by symbol-energy fluctuations affect local delay errors under MF. RF removes symbol-dependent weighting but amplifies noise for low-energy symbols. Payload-conditioned joint Gaussian delay profiles yield peak-selection probabilities, which combine with nonlinear multistatic fusion errors to approximate position MSE while accounting for network geometry. Numerical results illustrate receiver-dependent estimation errors and the benefits of frequency-dependent constellation allocation.

comments
6 pages, 3 figures, submit to IEEE for possible publication
fields
Information Theory
pdf ↗ page arXiv:2611.02783 ↗

By adjusting their reflection coefficients, intelligent reflecting surfaces (IRSs) can reshape the channels between a base station (BS) and user equipment (UE). Existing studies mainly optimize IRS phase-shifts for communication objectives, leaving the physical attainability of prescribed IRS-reflected channels largely unexplored. This paper investigates channel customization with a phase-only IRS under three progressively relaxed criteria. Observing that the customization mean-squared error (MSE) has the same mathematical form as the signal MSE of a point-to-point multiple-input multiple-output system, we construct a counterpart problem to characterize individual singular-coordinate gain limits and the condition for attaining the amplitude-matching upper bound. To address multi-stream phase conflicts, we analyze principal contribution area (PCA) overlap and derive sufficient array-size conditions for disjoint PCAs under a specified focused-vector construction with parallel uniform linear arrays. We also derive necessary conditions from the two propagation links' singular values and an array-size restriction under the parallel-array Fresnel model. Both the restriction and the construction involve the BS–IRS array-size product. Numerical results show that jointly selecting right singular vectors and IRS phase-shifts reduces mean customization MSE, whereas gains exceeding propagation spectral limits cannot be realized exactly. These results provide design guidance and highlight spectral limits of phase-only IRS channel customization.

comments
13 pages, 8 figures
fields
Information Theory
pdf ↗ page arXiv:2611.02894 ↗

Fluid antenna systems (FASs) have shown that activating a single port from a densely packed antenna array can yield spatial diversity comparable to that of tens of independent antennas, a property that has substantially improved communication reliability and efficiency. The fluid antenna array (FAA) extends this concept to multi-port configurations while avoiding complex multi-dimensional spatial correlation, and offers significant geometrical flexibility under a finite aperture and a limited port budget. These attributes motivate environment-adaptive array geometry for sensing in integrated sensing and communication (ISAC) systems. Although this flexibility enables adaptive array geometries that exploit near-field distance-angle information, improving multi-parameter target estimation under communication and deployment constraints remains challenging. In this paper, we propose a planar FAA-assisted near-field ISAC framework for multiuser communication and target sensing. Specifically, we derive the Fisher information matrix (FIM) and the corresponding Cramér-Rao bound (CRB) for the joint estimation of target range, zenith angle, azimuth angle, and radial velocity. Based on the derived CRB, we jointly optimize the FAA port positions and transmit beamforming to improve sensing accuracy while satisfying communication signal-to-interference-plus-noise ratio (SINR), transmit power, and physical deployment constraints. To solve the resulting non-convex problem, we develop a two-stage alternating optimization algorithm, in which transmit beamforming is optimized through semidefinite relaxation (SDR), while FAA port positions are successively optimized through discrete search and continuous refinement. Simulation results indicate that the proposed algorithm achieves favorable sensing performance while maintaining a reasonable computational cost.

fields
Information Theory
pdf ↗ page arXiv:2611.03000 ↗

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\leq K$ users is active in the delivery phase. In all regimes where the optimal hotplug tradeoff is known, it depends only on $A$, not on $K$; whether this holds in general is open. We show that: (i) Under uncoded placement, YMA delivery with MAN placement, where offline users are assigned the demands of active users, is optimal. Hence, offline users cause a strict load penalty at intermediate memory sizes, while the MAN placement is optimal for every number of active users; (ii) Under row-wise placement (RWP), where each cache is a function of the user's own row of each file, every classical scheme can be embedded in a Reed-Solomon code. The resulting hotplug scheme has the tradeoff of the classical model with $A$ users, for every $A\leq K$: there is no load penalty, but the placement depends on $K$. We then derive a converse for RWP, which shows that: (a) for $2\leq N\leq A$, the scheme of Gomez-Vilardebo (GV) is RWP optimal for $AM\leq N/(N-1)$, which settles the RWP tradeoff for $N=2$; (b) YMA is RWP optimal at $AM=N$; and (c) for $N=A=3$, GV is RWP optimal for $M\leq 1$. Hence, the Reed-Solomon embeddings of these schemes are optimal among embedded RWP schemes.

comments
Submitted to ICC 2027
fields
Information Theory
pdf ↗ page arXiv:2611.03045 ↗

Beyond-diagonal reconfigurable intelligent surfaces (BD-RISs) extend conventional diagonal RISs by allowing controllable coupling among reflecting elements. This flexibility is attractive for aerial networks, where unmanned aerial vehicles (UAVs) face rapidly varying channels and strict power limits. In this paper, we study a hybrid BD-RIS-assisted multi-UAV rate-splitting multiple access (RSMA) downlink, in which UAVs within favourable BD-RIS coverage use both direct and BD-RIS-aided links, whereas the remaining UAVs are served through direct links only. We formulate a network sum-rate maximization problem that jointly optimizes UAV trajectories, RSMA common-rate allocation, beamforming, BD-RIS scattering matrices, and UAV-BD-RIS association. The resulting mixed-integer non-convex problem is solved by using deep deterministic policy gradient (DDPG) algorithm, equipped with a constraint-preserving action layer that generates reciprocal and lossless BD-RIS responses in closed form and handles the binary association inside the environment transition. Simulation results, averaged over three training seeds under a physically consistent channel model with blocked direct links near the BD-RISs, show that the proposed design attains a sum rate comparable to SAC and higher than twin delayed deep deterministic policy gradient ( TD3), proximal policy optimization (PPO), and deep Q-network (DQN), exceeds per-slot alternating optimization with fixed trajectories at about 1/65 of its per-slot runtime, and benefits mainly from RSMA, while the additional BD-RIS gain is modest.

comments
6 pages, 5 figures, accepted for presentation at the IEEE GLOBECOM 2026 Workshops
fields
Information Theory
pdf ↗ page arXiv:2611.03047 ↗

Beamforming designs for integrated sensing and communication (ISAC) in cell-free multiple-input multiple-output (MIMO) systems face the challenge to stay reliable under uncertainties from both channel state information (CSI) as well as clutter. To this end, this paper proposes an impairment-aware heterogeneous graph neural network (GNN) framework for beamforming that obtains the CSI error level and the clutter covariance as edge features, which enables a single trained model to adapt to both impairments. In particular, the GNN is trained on a low quantile of the minimum user rate with a clutter-aware signal-to-clutter-plus-noise ratio, balanced by a normalized Tchebycheff scalarization. Simulation results show that the proposed GNN framework outperforms the considered baselines in sensing-only and communication-only settings. Depending on the operating point, a single GNN model attains approximately 97\% of each baseline's rate while serving both functionalities at once. The model further generalizes to unseen CSI error levels and clutter counts and renders the ISAC system resilient.

comments
6 pages, 4 figures, 1 table, submitted to IEEE ICC 2027
fields
Information Theory
pdf ↗ page arXiv:2611.03054 ↗

In quantum error correction, the decoder must estimate the errors from the measurement data accurately and fast enough to avoid a backlog. Search-based decoders such as Tesseract achieve high accuracy by finding a minimum-weight set of error events with an A* search, but their search effort grows rapidly with the physical error rate and the code size. To reduce this search effort while maintaining a logical error rate close to that of Tesseract, we propose a belief propagation (BP)-guided modification of the Tesseract decoder for quantum low-density parity-check (LDPC) codes. Damped sum-product BP is applied to the triggered detectors before the Tesseract search. If the detectors triggered by the BP hard decision match the triggered detectors, this hard decision is accepted directly, and the Tesseract search is skipped. Otherwise, the BP marginal probability estimates, weighted by a trust coefficient, modify the search priority, while the path cost keeps the channel-prior weights so that the decoding objective is unchanged. The framework also supports BP-based initialization, in which selected BP decisions form the starting point of a residual search whose signed-cost objective allows incorrect initial decisions to be removed. A node-exploration limit bounds this residual search; if the limit is reached, the decoder falls back to the BP-guided search on the original triggered detector set. The method is evaluated on the [[72,12,6]], [[90,8,10]], and [[144,12,12]] bivariate bicycle codes under circuit-level noise. With BP-based initialization and a global trust coefficient, the number of Tesseract search nodes expanded is reduced by up to more than two orders of magnitude at low physical error rates, while the logical error rate remains close to that of Tesseract.

comments
12 pages, 4 figures, 5 tables. Submitted to IEEE Transactions on Quantum Engineering
fields
Information Theory
pdf ↗ page arXiv:2611.03128 ↗

We prove that any linear $3$-query locally correctable code $C \colon \mathbb{F}_2^k \to \mathbb{F}_2^n$ with constant correction radius must have length $n \geq 2^{Ω(\sqrt{k})}$. This improves on the prior best lower bound of $2^{Ω(\sqrt{k/\log k})}$, due to [AG24], and shows that the folklore construction of linear $3$-LCCs from Reed-Muller codes, which achieve length $n = 2^{O(\sqrt{k})}$, is optimal up to constant factors in the exponent. Our proof builds on the approach of [KM24a], further refined in [Yan24,KM24b], that uses "chain derived equations" in combination with Kikuchi graphs. The crux of our argument is to show that a certain edge-coloured Kikuchi graph has a unique colour cycle: a cycle in which some colour is used exactly once. We do this by controlling the distribution of colours at each vertex in the graph using a random walk mixing argument and a novel hypergraph decomposition based on edge expansion of the hypergraph's "flattening" into a graph.

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

We prove that the covering radius of the third-order Reed–Muller code in eight variables is fifty-six. The proof separates even- and odd-weight inputs by moment-controlled slicing. On the even side, a transport invariant on quadratic-label stars and consistency of singleton restrictions give a compatible cubic correction. On the odd side, symmetry of the third moment yields a covariance-rank obstruction. Its rank-two exception is a quartic plus three points of a two-plane; the zero-second-moment case is a prescribed-point perturbation of a quintic. We prove that every such point perturbation has third-order nonlinearity at most fifty-five by a marked derivative identity and complete restriction-code covers. Consequently the maximum among exact-degree-eight functions is fifty-five. The structural reductions are proved analytically, and complete finite certificates verify the explicitly stated local covering and compatibility assertions. The matching lower bound follows from the published quartic relative radius.

comments
35 pages,
fields
Information Theory
pdf ↗ page arXiv:2611.03186 ↗

This letter investigates a cell-free massive MIMO system with $L$ access points (APs), each employing a small fixed-form-factor, uniform linear array of $N$ potentially closely spaced antennas. Utilizing multiport communication theory, we analyze the impact of mutual coupling on uplink and downlink spectral efficiency (SE) under various impedance-matching strategies. We compare two deployment regimes: ($i$) increasing $N$ while $L$ is kept fixed, and ($ii$) increasing $N$ while fixing the total antenna count $M = NL$. Numerical results show that, with a full matching network, mutual coupling itself becomes beneficial when an AP serves several user equipments, which is the typical operating regime of user-centric cell-free networks. Furthermore, with full matching, antenna densification can enhance SE or allow for a reduction in the number of APs without performance loss. Since full matching networks remain of manageable size in the small arrays of distributed APs, unlike in large centralized arrays, cell-free networks offer a natural setting for exploiting mutual coupling.

fields
Information Theory
pdf ↗ page arXiv:2611.03193 ↗

Locally recoverable codes (LRCs) are fundamental to the architecture of modern distributed storage systems. The Tamo-Barg construction of optimal LRCs was revolutionized by the introduction of good polynomials, which group evaluation points into local recovery sets. However, polynomial constructions are constrained by their inherently large Galois groups, which limit the number of totally split rational places. Recent advances have generalized this paradigm to good rational functions, which leverage the geometry of the projective line to achieve minimal Galois groups and subsequently codes with greater length. In this paper, we complete the classification of good rational functions of degree up to $6$ in characteristic $2$. By embedding the problem into algebraic function field theory, we explicitly determine the minimal arithmetic and geometric Galois groups for these low degrees. Furthermore, we move beyond asymptotic Hasse-Weil estimates by proving that the exact number of totally split places over extension fields obeys a linear recurring sequence (LRS). This gives an efficient method for computing the exact lengths and dimensions of the corresponding optimal LRCs and, in many cases, yields parameters beyond those obtainable from good polynomials.

comments
14 pages, 1 table
fields
Information Theory, Number Theory
pdf ↗ page arXiv:2611.03368 ↗

Non-coherent over-the-air (NCOTA) aggregation offers a scalable and communication-efficient approach to distributed average consensus in wireless networks, without requiring instantaneous channel state information (CSI) or phase alignment. However, persistent aggregation errors pose fundamental challenges in achieving exact average consensus under nominal distributed averaging protocols. In this paper, we develop an NCOTA consensus framework that accommodates row-stochastic mixing, without requiring the conventional average-preservation property of doubly stochastic mixing matrices. Building on a distributed optimization formulation of average consensus, we propose a decentralized projected gradient descent with row-stochastic mixing (DPGD-RS) algorithm and establish its mean-square convergence to the exact average of the agents' initial states. We further derive a closed-form upper bound on the mean-square consensus error, characterizing the effects of aggregation uncertainty, network connectivity, and mixing imbalance. Guided by this analysis, we propose a spectral-reshaping power control (SR-PC) scheme that jointly optimizes transmit powers and receive-scaling factors to accelerate convergence by balancing aggregation accuracy and network mixing. Numerical results validate the theoretical convergence guarantees and demonstrate that the proposed power control scheme significantly accelerates convergence compared with full-power transmission and spectral-radius-minimization benchmarks.

comments
13 pages, 4 figures. Extended version of a paper published in Proc. IEEE ICC 2025
fields
Information Theory
pdf ↗ page arXiv:2611.03378 ↗

Optimal control of partially observable Markov decision processes (POMDPs), in general, requires a complete history. The belief state, a distribution over hidden states, summarizes this history and provides the classical sufficient statistic to control POMDPs. However, the continuous nature of the belief space generally prevents a finite-memory controller from maintaining it exactly. This raises the question we address in this work: what must the available finite memory preserve to achieve near-optimal control performance? We study this question through an information-theoretic converse that gives a fundamental lower bound on the loss of any finite-memory controller. The analysis introduces the concept of a decision witness that characterizes belief states whose confusion would lead to unavoidable loss. Motivated by this bound, we propose RECAP, a constructive quantization method for designing representative memory states. We prove an upper bound on the optimality gap of any RECAP codebook and use the components of this bound together with the converse analysis to define the codebook objective. Experiments on 11 POMDP benchmarks demonstrate that RECAP improves over finite-memory representation baselines under the same memory budget.

comments
Accepted at NeurIPS 2026
fields
Information Theory
pdf ↗ page arXiv:2611.03414 ↗

Large constellations of low Earth orbit (LEO) satellites provide ubiquitous global connectivity; yet, their rapid motion introduces significant Doppler shift effects. While challenging for communication, these effects can be leveraged for precise user terminal (UT) positioning, particularly in GNSS-denied environments where traditional satellite-based navigation struggles. Unlike GNSS, most LEO satellites lack dedicated navigation signals, motivating signals-of-opportunity (SOPs) approaches that repurpose existing LEO signals and use publicly available two-line element (TLE) files for orbital information, although ephemeris errors can limit accuracy. This article explores the fundamental principles, challenges, and enabling technologies for LEO-based Doppler shift positioning, highlighting its advantages over conventional non-Doppler methods, and discussing future research directions. Furthermore, to facilitate realistic and reproducible performance evaluation beyond stochastic modeling, we propose SionnaNTN-RT, a ray tracing framework for non-terrestrial network (NTN) built upon Sionna, enabling end-to-end simulation of Doppler-based positioning. Simulation results demonstrate that Doppler-based positioning can achieve high positioning accuracy in both urban and open-sky environments, highlighting its promise for next-generation positioning systems.

comments
17 pages, 4 figures, 2 tables
fields
Information Theory
pdf ↗ page arXiv:2611.03440 ↗

We study hashing against quantum adversaries, as used in cryptographic applications, and provide bounds on the probability of failure in practical settings where seeds might be reused and might be non-ideal. Randomness extraction and privacy amplification are key components of quantum cryptographic protocols, such as quantum randomness generation or key distribution, that allow the compression of partially secure raw data into shorter output with high security. To ensure the security of any cryptographic construction that integrates them, it is desirable to establish composable security. This can be done by using methods based on universal hashing and leveraging the general leftover hash lemma, which allows extraction of near-uniform random numbers from an imperfect entropy source by sampling from an almost two-universal family of hash functions using a seed. This approach is taken in many practical implementations, commonly using Toeplitz hashing. The lemma provides an upper bound $\varepsilon$ on the distance of the output to uniform randomness, which holds on average over the choice of seeds. It makes no claim that any particular seed yields near-uniform random numbers. This poses a problem for practical applications where a seed is sampled once and reused for many rounds (blockwise hashing). Here, we study the subset of \textit{bad} seeds yielding far-from-uniform outputs. We show that randomness extraction against quantum side information is guaranteed to produce $δ$-close-to-uniform random numbers except with failure probability $\left(\frac{\varepsilon}δ\right)^2$. This result is generalised to blockwise hashing providing a guarantee of the security of $k$ rounds except with failure probability $\big(\frac{(2k-1)\varepsilon}δ\big)^2$. Moreover, we extend the general leftover hash lemma to blockwise hashing and relax the assumption of almost two-universality.

fields
Information Theory
pdf ↗ page arXiv:2611.03484 ↗

Understanding how complex systems perform computations, i.e. how they store, transmit, and transform information across their components, is a major goal across the natural sciences. However, characterising genuinely collective computations across multiple inputs and outputs that cannot be reduced to contributions from individual components remains an open problem. In this work, we introduce $Φ\text{ID}^{IG}$, a geometric theory of information dynamics that captures irreducible collective phenomena and enables a complete decomposition of multi-input multi-output operations into interpretable computational modes, providing a complete informational profile of a system. We first validate our framework to identify and quantify distinct computational modes in discrete and Gaussian systems with known ground truth. We then apply it to uncover the computational architecture of complex systems across synthetic and real-world scenarios, including chaotic maps, where distinct universality classes are associated with characteristic modes of computation; brain anatomy of over 100 mammalian species, revealing an evolutionary shift towards more distributed computation in the human neocortex; and financial markets, where collective computations recover the modular organisation of market sectors. Overall, our results show how complex systems can be quantitatively investigated through multidimensional computational portraits derived from the geometry of their underlying probability distributions.

comments
16 pages, 6 figures + supplementary material
fields
Information Theory
pdf ↗ page arXiv:2611.03545 ↗

We consider the problem of graph private information retrieval (PIR) in the quantum setting. We focus on a specific type of graphs, namely the forest graphs. A forest graph is a union of disjoint trees. We consider the quantum setting where all the servers share an entangled state. Each server is allowed to send only one qudit per retrieval round. We design a scheme for the forest graphs that achieves the rate of $\frac{3}{N}$. The scheme uses a GHZ state as the initial entangled state between the servers prior to the scheme initiation. We compare our scheme with the only work done in the literature that considered the quantum setting of graph PIR. We show that our scheme is more efficient in this setting. We derive the quantum capacity for the case of $G=3K_2$, which is equal to $4/6$. $G=3K_2$ is a special case of the forest graph. We design a scheme that is specialized for this graph, achieving a rate equal to $4/6$ and provide the corresponding matching upper bound, establishing it as the capacity.

fields
Information Theory
pdf ↗ page arXiv:2611.03558 ↗

We give exactly uniform samplers for linear codes with prescribed hull dimension, for the Euclidean, Hermitian, and symplectic inner products and over finite fields of every characteristic. Except for the Euclidean form over fields of odd characteristic, these are the first uniform samplers for arbitrary prescribed hull dimension. Each sample costs an expected $O(k^2 N + k \log q)$ field operations for codes of dimension $k$ in a space of dimension $N$ over $\mathbb{F}_q$ or $\mathbb{F}_{q^2}$.

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

In this paper, we study when two parties should pool their data to train a machine learning model. Two agents, Alice and Bob, each hold a sensitive labeled dataset and want to train a classifier from a given hypothesis class $\mathcal{H}$. Even when each party's dataset can be perfectly classified on its own, the two parties may follow conflicting labeling standards or have selection biases that affect their features and label sets, such that no single classifier in $\mathcal{H}$ fits their combined data. Before committing to data sharing, Alice and Bob therefore want to test whether a single classifier in $\mathcal{H}$ can jointly fit both datasets—without revealing their individual data points to one another. We formalize this problem from a learning-theoretic viewpoint via $\operatorname{opt}_\mathcal{H}$, the minimum \emph{number of mistakes} made by any hypothesis in $\mathcal{H}$ on their pooled data. Through interactive communication, the agents must distinguish $\operatorname{opt}_\mathcal{H}=0$ (compatible datasets) from $\operatorname{opt}_\mathcal{H}\geq t$ (conflicting datasets) under pure $\varepsilon$-two-party differential privacy. A trusted curator could do this with $t=O(1/\varepsilon)$, and we ask how small $t$ can be without one. For thresholds on the real line over a domain of size $m$, we show that the optimal $t$ is $\tildeΘ(\log\log m/\varepsilon)$, exponentially smaller than the $Θ(\log m/\varepsilon)$ samples needed to privately learn thresholds, even with a curator. For halfspaces in $\mathbb{R}^d$, the dependence on $m$ jumps to $\log(m)$: we give a protocol with $t=\tilde{O}(d^3\log m/\varepsilon)$ and show that some domains require $t=Ω(d\log(m/d)/\varepsilon)$.

comments
53 Pages, 6 Figures
fields
Information Theory
pdf ↗ page arXiv:2611.03599 ↗

Quantum channel tomography (also known as quantum process tomography) is a fundamental task in quantum information and quantum computing, aiming to learn the full description of an unknown quantum channel from black-box queries. For channels with input dimension $d_1$, output dimension $d_2$, and Kraus rank at most $r$, [CGO+26] identifies the dilation rate $τ=rd_2/d_1\geq 1$ as a key parameter governing a Heisenberg-to-classical transition in query complexity. While the optimal bounds in the boundary regime ($τ=1$) and the away-from-boundary regime ($τ\geq 1+Ω(1)$) are now known, the precise behavior in the near-boundary regime ($1<τ<1+o(1)$) has remained unresolved. In this paper, we close this gap, thereby fully settling the query complexity of quantum channel tomography. Specifically, we show that the query complexity is - $Ω(rd_1d_2/\varepsilon^2)$ for diamond norm error $\varepsilon$, matching the upper bound by [MB26, CGO+26], - $Θ(d_1^2/\varepsilon+\min\{(τ-1)d_1^2,(τ-1)^2d_1^2d_2^2\}/\varepsilon^2)$ for Choi trace norm error $\varepsilon$. Our results reveal two qualitatively different forms of the Heisenberg-to-classical transition. For diamond norm tomography, the Heisenberg scaling disappears suddenly as soon as $τ$ leaves the boundary regime. In contrast, Choi trace norm tomography exhibits a gradual transition from Heisenberg to classical scaling as $τ$ moves from the boundary regime to the away-from-boundary regime.

comments
40 pages
fields
Information Theory
pdf ↗ page arXiv:2611.03639 ↗

Numerical Analysis63

Spatially resolved modeling of optically pumped alkali-metal vapors requires the solution of a high-dimensional nonlinear diffusive quantum master equation (DQME) coupled to state-dependent light propagation. We develop a structure-preserving computational framework for this coupled three-dimensional system in the high-pressure limit. The high-fidelity solver combines second-order finite differences, explicit pseudo-time marching, and an exponential-integrator discretization of the light-propagation equation. The scheme preserves the density-matrix trace, while a derived global pseudo-time-step restriction guarantees nonnegative, bound-preserving population updates and frozen-coefficient $1$-norm stability. In the absence of a closed-form solution for the general coupled problem, the solver is verified against complementary analytical reductions, pumping-rate asymptotics, and a light-propagation invariant, all of which are accurately recovered. Tensorized GPU implementation reduces the per-iteration cost by more than two orders of magnitude relative to a single-core CPU. For repeated parameter queries, we further construct an intrusive POD–Galerkin reduced-order model. The quadratic spin-exchange term is treated by an exact nonlinear quadratic expansion, whereas the nonpolynomial and nonlocal optical-pumping term is hyper-reduced using the discrete empirical interpolation method. At out-of-sample parameter points, the reduced model closely reproduces the full-order population and polarization fields while achieving speedup of more than \(7\times10^3\) relative to the single-core CPU full-order solver. The resulting hierarchy connects verified high-fidelity simulation with efficient reduced-order prediction for spatially resolved alkali-metal spin dynamics.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.41778 ↗

We present DiffStent, a differentiable finite element framework for simulating arterial deformation during in silico stent deployment, where nearly incompressible, anisotropic vessel walls undergo large deformation and frictional contact with the stent. DiffStent combines the fiber-reinforced Holzapfel-Gasser-Ogden constitutive model with an implicit discrete adjoint that differentiates the converged mechanical equilibrium without unrolling the nonlinear solver, thus reducing the memory cost by three orders of magnitude. We identify three mechanisms that can lead to inaccurate, unstable, or uninformative gradients: nonsmooth switching, state mismatch, and gradient cancellation. To address these, we apply a contact surrogate in the backward pass while retaining the original physical model in the forward pass. We show superior gradient accuracy of our method over AutoDiff and finite differencing across constitutive benchmarks, idealized stented vessels, and patient-specific calcified coronary anatomies, and use the resulting sensitivities to quantify how tissue properties and calcification patterns govern lumen expansion and arterial wall stress. Finally, we demonstrate that DiffStent enables gradient-based system identification from retrospective clinical images of atherosclerotic coronary anatomy. Together, these results establish a practical approach for differentiating through nonlinear biomechanical simulations with stiff constitutive laws and nonsmooth contact, enabling patient-specific parameter inference and optimization in computational cardiovascular mechanics.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.00014 ↗

The vector play model (VPM) replaces the implicit minimization of the energy-based hysteresis model (EBM) by an explicit update. Its tangent contains the product of the Hessians of two unrelated potentials and is unsymmetric. Hence, the VPM has no co-energy density at frozen memory, and the skew part makes $\boldsymbol{H}\mapsto\boldsymbol{B}$ lose monotonicity in a band just outside the pinning circle, into which small time steps drive the sliding states. In composite models, the determinant of the tangent can change sign, which explains published failures of the local inversion $\boldsymbol{B}\mapsto\boldsymbol{H}$, and where it is negative, $\boldsymbol{H}\mapsto\boldsymbol{B}$ is not injective. In the scalar potential formulation, the exact tangent keeps a descent guarantee, whereas symmetric surrogates of the tangent, such as the symmetrized tangent or Broyden-Fletcher-Goldfarb-Shanno (BFGS) updates, lose it and become ascent directions where the skew part dominates, as computations of TEAM Problem 32 confirm. It is therefore recommended to use solvers with an unsymmetric tangent.

comments
6 pages, 4 figures, 3 tables, submitted to IEEE Transactions on Magnetics
fields
Numerical Analysis
pdf ↗ page arXiv:2611.00168 ↗

Floating point computing has dominated scientific computations since the 1950s because of its versatile ability to approximate real numbers with both sufficiently high precision and sufficiently great range. Since 1985, two specific formats have become standard across the industry, one with 32 bits which is adequate for many purposes and one with 64 bits which allows numbers with both much higher precision and much greater range for applications where these are needed. However, during the past decade, deep learning has come to dominate computation, and narrower floating point formats with lower precision and reduced range have steadily become more common. In this article we discuss this phenomenon, why it is happening, how various 16-bit, 8-bit and even 4-bit floating point formats have been developed, and efforts to standardize these formats.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.00301 ↗

Learning the continuous-time evolution of nonlinear dynamical systems relies on trajectory-based objectives, which require simulating the learned dynamics during training and backpropagating through the numerical scheme, at a cost that grows with the rollout horizon. We show that trajectory-based objectives degenerate as the rollout horizon increases, hindering gradient-based optimization, and that the numerical scheme biases the learned dynamics by constraining the spectrum of the learned Jacobian to its absolute stability region. To overcome these limitations, we introduce Velocity Matching (VM), a simulation-free objective that relies on piecewise-linear interpolation and stochastic collocation, and approximates the velocity population risk to second order in the sampling step. We develop a theoretical framework for velocity-based learning, introducing stability estimates that control trajectory errors in terms of velocity errors, which enable us to establish universal and continuous-time approximation results when the learned velocity field is parameterized by deep neural networks. Building on a bias-variance decomposition of the VM objective, we show that its higher-order approximation of the velocity population risk yields a consistent minimizer; that it relates to the residual of an A-stable continuous-stage Runge-Kutta scheme, thus connecting VM to implicit integration without requiring any implicit solve; and that it implicitly matches the action of the learned Jacobian to that of the true one along the observed trajectories, without requiring access to the underlying velocity field or its Jacobian. Numerical experiments on nonlinear ordinary differential equations and semi-discretized time-dependent partial differential equations show that VM improves accuracy over trajectory-based objectives, while avoiding both the cost of simulation and the instabilities of long rollouts.

comments
76 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2611.00448 ↗

A high-order hierarchical direct solver for variable-media scattering in two dimensions is presented. Standard discretizations for these problems produce dense linear systems that are commonly solved iteratively, requiring a new global solve for each incident field. The method proposed here instead constructs a reusable scattering operator for the inhomogeneous medium, based on a hierarchical subdivision of the computational domain. First, high-accuracy leaf scattering operators are built from discretized local integral equations. Up the hierarchy, neighboring boxes are merged to build the scattering operators for successively larger boxes. A key feature of the method is that each scattering operator is represented as a map of incoming traces to outgoing traces. Consequently, volume unknowns appear only in the leaf computations; all higher levels of the hierarchy operate entirely on boundary traces. The hierarchical solver is presented first at the continuum level and discretized only afterward using high-order local volume quadrature, polynomial trace representations, and boundary integral techniques. For a discretization involving $N$ degrees of freedom, the method requires $O(N^{3/2})$ work and $O(N\log N)$ storage to build all scattering operators. Once these are available, any incoming field can be processed at cost $O(N)$ if only the outgoing field is required, and cost $O(N\log N)$ if the full field is required. Numerical experiments demonstrate high-order accuracy on a range of challenging scattering problems including cavities, back-scattering, limited regularity, and high wavenumber, that pose significant challenges to iterative methods.

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

Exact triangular solves parallelise poorly, limited by the size and number of the level sets, so on GPUs the factors from incomplete LU (ILU) factorisations are often solved approximately with parallel iterative methods. We compare four such methods: a Jacobi method, an Incomplete Sparse Approximate Inverse (ISAI), GMRES polynomials, and AIRG, a reduction multigrid built on GMRES polynomials, for which we introduce a parallel coarse/fine splitting that bounds the diagonal dominance ratio of the fine-fine block. We test them with ILU(0) and ILU(1) factors of canonical PDE problems and 91 SuiteSparse/Matrix Market matrices, the latter on a single GPU. AIRG is the most robust on the PDE factors, with nearly flat iteration counts under refinement and no per-problem tuning, but has the largest setup and memory costs. GMRES polynomials are more robust than the Jacobi method at a similar cost. As the inner solve of an ILU preconditioner with tuned inner iteration counts, ISAI gives the largest median speedups over a hipSPARSE exact triangular solve (4.5$\times$ and 6.8$\times$ for ILU(0) and ILU(1)), though this was dominated by smaller problems; on the largest ILU(1) problems all four methods give similar median speedups of 2.1-2.6$\times$.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.00552 ↗

In this paper, we develop a linearly implicit relaxation Crank-Nicolson difference scheme for the two-dimensional space-fractional nonlinear Schrödinger (SFNS) equation, where the fractional Laplacian is approximated by a simple fractional central difference scheme. The proposed scheme is uniquely solvable and conserves discrete mass for general real-valued nonlinear coefficients, and a modified discrete energy in the cubic case. By introducing a modified error system employing a cut-off technique, we establish the optimal-order error estimates without mesh-ratio restriction. Specifically, the primary variable achieves second-order temporal and spatial convergence in the discrete $H_h^{α/2}$-norm, and the relaxation variable satisfies the same convergence in the discrete $L^2$-norm. Some numerical experiments confirm the relevant theoretical results.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.00571 ↗

We study direct and inverse approximation for linearized shallow ReLU$^k$ networks on $\mathbb S^d$ with quasi-uniform hidden parameters. For $0<α<\frac{d+2k+1}{2d}$, under the coefficient growth condition $\bigl(n\sum_{j=1}^na_{j,n}^2\bigr)^{\frac{1}{2}}\leq n^αM$, we prove that approximation at the order $n^{-\frac{d+2k+1}{2d}+α}$ is equivalent to membership in the parity-compatible Besov space $\mathcal B_{2,\infty,*}^{\frac{d+2k+1}{2}-αd}(\mathbb S^d)$. Mere convergence under the same coefficient budget does not imply this regularity. For unconstrained approximation along a nested parameter sequence, a single ridge function gives a counterexample when $α<\frac{1}{2}$, whereas for $α>\frac{1}{2}$ the endpoint Besov inverse conclusion follows from a Bernstein inequality under antipodal quasi-uniformity. The inverse conclusion is also recovered when the prescribed rate holds for two quasi-uniform parameter sequences whose union is antipodally separated.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.00656 ↗

Surface parameterization is a fundamental task in geometry processing and shape analysis. For topologically closed surfaces, it is common to parameterize them onto a standardized closed domain in $\mathbb{R}^3$, with a prime example being a unit sphere for genus-0 closed surfaces. Many mapping methods use planar projections and perform computations on the plane rather than directly on the 3D surface. However, perturbations introduced before projection or geometric evolution propagate through the computation and may affect map quality, convergence, stopping behavior, and geometric validity. In this work, we formulate representation sensitivity as a branchwise input–output problem, separating smooth propagation through active Jacobians from changes in anchors, stopping rules, and fallback events. Under consistent piecewise-linear assembly, the unmodified south-pole Beltrami correction in the FLASH method for spherical conformal parameterization reduces exactly to source-mesh harmonic extension. On a fixed-anchor branch, the corrected map factors into chart transition, harmonic propagation, and inverse stereographic projection, yielding an explicit sensitivity Jacobian and a finite-triangle conditioning bound. Separately, we introduce a bounded five-parameter affine preconditioner over planar scale, translation, and anisotropy and evaluate candidates on the corrected spherical map. Across 30 genus-0 surfaces, it reduces median polar upper-tail log-condition and chord-angle distortion by $10.17\%$ and $10.97\%$, respectively, with both measures improving on every mesh. We also apply the framework to other spherical mapping methods including the conformalized mean-curvature flow and spherical density-equalizing maps. Altogether, our work highlights the importance of representation selection as a structural and practical component of spherical parameterization and downstream computation.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.00721 ↗

A local sensing Keller-Segel model, in which cells adjust their motility to the local chemoattractant rather than its gradient, and a semi-implicit finite volume scheme for its numerical approximation are studied. Computable a posteriori bounds for the approximation error measured in terms of the $L^\infty(0, T; H^{-1}(Ω))$ and $L^2(0, T; L^2(Ω))$ norms of the cell density are derived based on a new stability estimate and suitable reconstructions of the flux and the flux potential of the numerical solution. Optimal scaling of the estimates is numerically demonstrated in 1D and 2D experiments. Moreover, an adaptive mesh refinement method steered by the estimator is proposed for the 1D case, and its efficiency is numerically verified.

comments
31 pages, 5 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.00767 ↗

We present two new semi-implicit finite volume schemes for the 1D hyperbolic and thermodynamically compatible (HTC) isentropic two-phase flow model of Romenski et al., written in terms of mixture density, volume fraction, partial gas density, mixture momentum and the relative phase velocity. In gas-liquid mixtures, the sound speed of the weakly compressible liquid is much larger than the gas sound speed and flow velocity, so the time step of fully explicit discretizations is dictated by liquid acoustic waves, even when the interest lies in the dynamics of the gas. To overcome this difficulty, the model's flux is split at the continuous level into an explicit subsystem (gas dynamics) and an implicit subsystem (liquid acoustic waves), leading to a nonlinear system for liquid pressure solved with the Newton method. In the first splitting the entire liquid phase is treated implicitly, while in the second the liquid convective terms are moved to the explicit subsystem, so only liquid acoustic waves are treated implicitly and nested Picard iterations are avoided. Thus, the time step of both schemes is restricted only by flow velocities and gas sound speed, independent of liquid sound speed. We prove and numerically confirm that both schemes exactly preserve the Abgrall condition (uniform velocity and pressure across material interfaces). For well-prepared initial data, both schemes are consistent with the volume balance of the liquid's low Mach number limit. Riemann problems, pressure equilibrium tests and acoustic tests show that in non-stiff regimes the semi-implicit schemes reproduce the results of a fully explicit scheme, while in the stiff regime they allow time steps that are up to 3-4 orders of magnitude larger, avoiding the excessive numerical dissipation of explicit schemes whose numerical viscosity is dictated by liquid sound speed.

comments
32 pages, 9 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.00781 ↗

Replacing the matrix in an iteration with random low-rank matrices can reduce the cost of matrix-vector multiplication. However, even if the sampled matrices equal the original matrix in expectation, the expected squared norm of the random iterates may grow while the original iteration converges. Under a fixed rank bound, we study how to choose the distribution of these random matrices to minimize this growth when sampling independently at each step. We derive an exact formula for the optimal asymptotic growth factor and use it to determine when the expected squared norm can converge to zero. We then characterize precisely when a fixed sampling distribution achieves this optimal factor and construct finite-support optimal distributions in every attainable case. These results determine the minimum rank required for stability and provide optimal sampling designs under the prescribed rank constraint.

fields
Numerical Analysis, Optimization and Control, Rings and Algebras
pdf ↗ page arXiv:2611.00787 ↗

Stochastic dynamic mode decomposition (SDMD) approximates the Koopman semigroup of an Itô diffusion by a Galerkin generator matrix on a dictionary of observables, computed from samples of the invariant law and evaluations of the generator, and advances observables with a first-order stochastic Taylor step (SDMD-1). The second-order Taylor step (SDMD-2) also needs the matrix of second generator actions, hence a dictionary with four derivatives, evaluations of a fourth-order differential operator at every sample, and a third matrix. We show that the Richardson extrapolation of two SDMD-1 half steps (SDMD-R) is second-order accurate with the data, the matrices, and the regularity of SDMD-1. One error bound covers exact and empirical Galerkin matrices. It consists of the Galerkin error of the dictionary, which is common to all schemes, a time-stepping term, and a data term of order $m^{-1/2}$ in the sample size $m$. The time-stepping term is $O(\dt^2)$ for SDMD-R and $O(Θ_N\dt+\dt^2)$ for SDMD-2, where $Θ_N$ is the norm of the second-order Galerkin residual $\Proj_N\cA(I-\Proj_N)\cA|_{\cV_N}$. The first-order term is attained and, for self-adjoint generators, vanishes only for generator-invariant dictionaries. For reversible periodic diffusions and trigonometric dictionaries with cutoff $K$, the step restriction $\dt\lesssim K^{-2}$ makes all three schemes contractions, and the error against the Koopman semigroup on $H^\ell$ observables is $O(K^{-(\ell-2)}+\dt^p)$ plus a sampling term of order $K^{d+2}m^{-1/2}$ in dimension $d$, with $p=1$ for SDMD-1 and $p=2$ for SDMD-R and SDMD-2. Numerical experiments confirm that SDMD-R matches or improves on the accuracy of SDMD-2 at the cost of SDMD-1.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.00793 ↗

This paper proposes a novel second-order prediction–filter–projection framework for incompressible flows with variable density and viscosity. In this framework, a constrained $L^2$-projection is enforced to unconditionally preserve the prescribed density bounds and discrete mass conservation, while a generalized-Laplacian reformulation combined with the D-CSAV approach is used to discretize the variable-viscosity momentum equation. In particular, a density-weighted second-order time filter is proposed, which eliminates the additional uniform-in-time bound restriction imposed on the time difference quotient of the discrete density in existing stability analyses. The resulting scheme is shown to satisfy an unconditional modified-energy dissipation law, without the viscosity-related restrictions imposed in earlier work. Then, an additional scalar auxiliary variable and its compatible temporal discretization are introduced to construct a variable-step prediction–filter–projection scheme. This scheme is also bound-preserving and mass-conserving, and satisfies an unconditional modified-energy dissipation law. Moreover, the modified energy is much closer to the ``original'' kinetic energy, differing from it only through the auxiliary-variable corrections. Based on the variable-step scheme, a reliable energy-based adaptive time-stepping strategy is developed. Finally, numerical experiments demonstrate the accuracy, physics-preserving properties, and efficiency of the proposed schemes.

comments
25 pages, 37 figures, 3 tables
fields
Numerical Analysis
pdf ↗ page arXiv:2611.00834 ↗

We construct and analyze a fully discrete finite volume scheme for the time-fractional Allen-Cahn equation with nondegenerate state-dependent mobility. The scheme combines a standard two-point flux approximation of diffusion, the L1 approximation of the Caputo derivative on a uniform time grid, and a semiconvex splitting of the potential, and it discretizes the inverse mobility by a secant average multiplying the entire L1 derivative. The key estimate is a lower bound for the accumulated pairing of this weighted L1 derivative with the solution increments in terms of the accumulated L1 quadratic form. Using this lower bound, we derive a discrete energy estimate and the time regularity required for compactness. For twice continuously differentiable semiconvex potentials satisfying sign conditions outside $(-1,1)$ and initial data in $H^1(Ω)$ taking values in $[-1,1]$, we prove existence of at least one fully discrete solution on every admissible finite volume mesh and every uniform time grid. Every such solution satisfies the maximum bound principle and a discrete energy bound relative to the initial energy, without a time-step restriction. In up to three space dimensions, under a mesh regularity condition with a constant independent of the mesh size, we prove that any sequence of fully discrete solutions has a subsequence converging strongly in $L^2(Ω\times(0,T))$ to a weak solution of the continuous problem as the mesh size and time step tend to zero. As a consequence, we obtain existence of a weak solution in one and two space dimensions, and in three dimensions whenever such meshes exist.

comments
38 pages, 5 figures
fields
Numerical Analysis, Analysis of PDEs
pdf ↗ page arXiv:2611.00837 ↗

Full-wave analysis of finite antenna arrays is computationally demanding because detailed element responses must be resolved and coupled across the entire array. To reduce this cost, this paper presents a clustered equivalent-source method that combines local response compression with group-symmetry reduction. Local responses are represented in compressed equivalent-surface bases or coordinates inherited from child clusters. Symmetry constraints associated with the cluster partition and excitation reduce the coupled system, while the corresponding group transformations recover the complete response in the retained coordinates. To assess overall efficiency, we evaluate the costs of local construction, propagation, global solution, and recovery. Numerical examples involving layered and finite annular patch arrays show close agreement between the computed and reference complex far fields and shorter complete-run times than those of the corresponding symmetry-reduced direct solvers. Among the three equivalent-source implementations for the layered array, the one with the smallest coupled system has the longest runtime because local construction and propagation dominate the cost. These findings highlight the need to consider local construction and coupling costs when assessing the benefit of reducing the global system dimension.

comments
14 pages, 8 figures
fields
Numerical Analysis, Mathematical Physics
pdf ↗ page arXiv:2611.00914 ↗

This paper investigates the application of two regularization methods, classical Tikhonov and Alternative Tikhonov regularization, to the Calderón inverse conductivity problem. We develop an iterative reconstruction scheme based on linearizing the Dirichlet-to-Neumann map and approximating conductivity updates using Gaussian basis functions. The resulting linear systems are solved using both regularization methods, with particular attention given to the derivation and numerical implementation of Alternative Tikhonov regularization. We compare the performance of these methods through numerical experiments on a synthetic conductivity containing two localized regions of differing conductivity. A total of 666 reconstruction tests are performed across varying regularization parameters, damping factors, and iteration counts. The lowest relative reconstruction errors obtained are 0.064730 for Alternative Tikhonov and 0.065173 for classical Tikhonov regularization. Although both methods produce comparable reconstructions, Alternative Tikhonov achieves the lowest observed error. The results demonstrate the effectiveness of both approaches within the proposed reconstruction scheme and motivate further investigation into parameter selection, numerical stability, and reconstruction accuracy.

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

We develop a one-level restricted additive Schwarz solver with perfectly matched layer transmission conditions (RAS–PML) for high-frequency Helmholtz systems. For problems with ${O}(k^d)$ unknowns, $d=2,3$, the solver uses Cartesian decompositions and ${O}(k^d)$ concurrent local solves for a single right-hand side, where $k$ is the wavenumber. Starting from the convergence theory for fixed decompositions established in~\texttt{arXiv:2404.02156}, we address the growing cost {as $k$ increases} of local solves through a nested RAS–PML construction. Under suitable stability and contraction assumptions, we prove that sufficiently accurate recursive local solves preserve convergence of the outer iteration. We also prove that a single inner iteration at each non-terminal level yields a correction algebraically equivalent to one-level RAS–PML, provided that the hierarchy-induced finest local problems and composite restriction and weighted extension operators are retained. This equivalence provides a hierarchical interpretation and permits a direct implementation without recursive transfers. We assess the one-level solver using PML and overlap widths of order ${O}(k^{-1}\log k)$. Constant-coefficient experiments cover $300\leq k\leq19200$ in two dimensions and $60\leq k\leq780$ in three dimensions, reaching $1.47\times10^9$ and $4.75\times10^8$ complex unknowns, respectively. Richardson iteration counts grow approximately linearly with $k$ over these ranges, while total parallel runtime, including setup and solution, exhibits near-linear growth at the larger tested wavenumbers. Further experiments assess the effects of mesh refinement and heterogeneous media.

comments
26 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2611.01075 ↗

We study minimum-norm interpolation in weighted variation spaces generated by ReLU$^s$ ridge functions on the unit ball, where $s$ is a positive integer. For a target $f$ in the weighted variation space and a node set with sufficiently small fill distance $h$, every minimum-norm interpolant satisfies the direct bound $\|f-\mathscr{I}_{X_h}f\|_{L_2(\mathbb{B}^d)}\lesssim_{d,s}h^{(2s+1)/4}\|f\|_{\mathcal{V}_s}$. Under a boundary separation condition on the nodes, we construct a matching lower bound for the worst-case interpolation error. For the inverse problem, we introduce dual certificates and derive an estimate analogous to a Bernstein inequality. Under suitable upper bounds on dictionary size and spectral lower bounds for the atomic Gram matrices, sufficiently fast $L_2$ convergence of minimum-norm interpolants along geometrically decreasing fill distances implies that the target belongs to $\mathcal{V}_s$. As a byproduct, the best $L_2$ approximation error $E_n(f)_{L_2(\mathbb{B}^d)}$ for shallow ReLU$^s$ networks of width at most $n$ satisfies $E_n(f)_{L_2(\mathbb{B}^d)}\lesssim_{d,s}n^{-1/2-(2s+1)/(2d)}\|f\|_{\mathcal{V}_s}$, with the weighted atomic cost of an approximating network bounded by a constant multiple of $\|f\|_{\mathcal{V}_s}$, independently of $n$.

comments
32 pages, 1 figure
fields
Numerical Analysis
pdf ↗ page arXiv:2611.01105 ↗

We develop an incidence-based edge-averaged method for scalar convection-diffusion problems on convex polytopal meshes in arbitrary dimensions. The proposed method extends the classical edge-averaged finite-element scheme through a graph-theoretic formulation based on vertex-edge incidence matrices. We first establish this formulation on simplices in arbitrary dimensions and then extend it to convex polytopes by introducing complementary edges and generalized barycentric coordinates. A key ingredient is a matrix identity that relates the generalized Whitney edge mass matrix to a diagonal representation of the Poisson stiffness matrix, enabling an exponentially-fitted discretization expressed entirely in terms of nodal values and edge weights. We prove that the resulting stiffness matrix is a nonsingular $M$-matrix under suitable positivity and connectivity conditions, ensuring monotonicity and the discrete maximum principle. Numerical experiments on two- and three-dimensional simplicial and nonsimplicial meshes demonstrate first-order convergence in the $H^1$ semi-norm and stable, nonoscillatory solutions in convection-dominated regimes.

comments
21 pages, 9 figures, submitted to the Special Section of SISC for the 2026 Colorado Conference on Iterative Methods
fields
Numerical Analysis
pdf ↗ page arXiv:2611.01175 ↗

Algebraic multigrid (AMG) methods are widely used for solving large sparse linear systems, but their efficiency depends strongly on interacting setup and solve parameters. Effective parameter choices typically depend on the problem. We develop a phase-aware online autotuning method for hypre's BoomerAMG to reduce cumulative time-to-solution over sequences of related linear systems. A LinUCB-based contextual bandit selects mixed-type parameters for AMG hierarchy construction using a shared cost model over PDE descriptors and configuration encodings. A recursive LSTDQ controller uses residual and timing observations to estimate the AMG solve time within each attempt and adapt relaxation weights between multigrid cycles. Both learners update from ongoing solves without offline pretraining. Across grids of sizes $40^3$, $60^3$, and $80^3$, the joint autotuning method reduces total runtime, including recurring learner computation, by 36.1-43.3% for diffusion problems and 19.8-31.0% for diffusion-advection problems over sequences of 5000 linear systems, relative to the reference BoomerAMG default configuration. On a variable-flow diffusion-advection benchmark comprising 30,000 systems on a $60^3$ grid, 2 systems fail to converge with joint autotuning, compared with 1677 for the reference configuration, under their respective attempt budgets.

comments
26 pages, 7 figures, 7 tables. Code: https://github.com/EriseHe/BoomerAMG-Autotuner
fields
Numerical Analysis
pdf ↗ page arXiv:2611.01193 ↗

Bayesian inverse problems require both informative prior models and computationally feasible posterior inference. Score-based diffusion models provide expressive learned priors, but their use for inversion introduces a conditioning problem: the score of a noised posterior is generally unavailable from a prior score alone. This selective survey reviews the principal approaches to that problem, including likelihood guidance, spectral and projection methods, sequential Monte Carlo corrections, and amortized conditional training. We organize methods by how they split cost between offline preparation and online inference, and compare their assumptions, advantages and limitations, with emphasis on computational speedups. Some ongoing directions and open questions are gathered at the end.

fields
Numerical Analysis, Statistics Theory
pdf ↗ page arXiv:2611.01300 ↗

We present a generalized variational approach for constructing energy-stable macroscopic partial differential equations (PDEs) directly from microscopic physical laws. Rather than fitting the PDE evolution for prescribed variables from macroscopic trajectories, we construct an extendable variational structure by adjoining auxiliary variables to seek autonomous reduced dynamics in an enlarged state space. By defining these variables as micro–macro encoders with explicit microscopic counterparts, we cast the learning problem as the sample-wise joint identification of the reduced state representation and the variational ingredients from time-discrete data, enabling systematic law-level transfer across scales. The resulting PDEs preserve frame indifference, physical constraints, and energy stability by construction, and admit a fluctuation–dissipation-consistent stochastic extension. Numerical results for the non-Newtonian hydrodynamics of polymeric fluids show that the learned models capture the viscoelastic responses induced by nonlinear and heterogeneous molecular interactions beyond empirical closures.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.01432 ↗

A semi-Lagrangian discontinuous finite element scheme based on the characteristic Galerkin method (CSLDG) is investigated.The scheme directly discretizes an integral invariant model derived from the coupling of the transport equation and its adjoint equation.we have established, for the first time, error estimates for the fully discrete CSLDG scheme over a general domain Ωin \mathbb{R}^d.The error is decomposed into three parts: the ideal numerical solution error (the difference between the exact solution and the spatial discretization), the time-dependent test function error (the deviation of the test function caused by the numerical characteristic backtracking via an ODE solver), and the upstream region approximation error (the integration region deviation induced by numerical characteristic backtracking and spline boundary reconstruction).Under either compact-support boundary conditions or periodic boundary conditions with the velocity field and the solution sharing the same spatial periodicity, without requiring incompressibility,and assuming the standard CFL condition (Δt=O(h)) linking the time step and the mesh size, the following results are proved:Using piecewise P^K polynomial spaces, the L^2 error of the ideal numerical solution attains a suboptimal order O(h^K); If the ODE solver order satisfies D \ge 2K+2+d, the overall error retains the suboptimal order even after incorporating the time-dependent test function error;When the upstream region approximation error is further taken into account, for d \ge 2 the overall error remains suboptimal O(h^K) provided the spline reconstruction degree satisfies r \ge \max(K+1+d, d+2);

comments
for d=1 the error bound reduces to a form that depends only on the ODE order; If the ideal numerical solution error could be improved to the optimal order O(h^{K+1}), then the corresponding conditions on the ODE order and the spline degree become D \ge 2K+4+d and r \ge K+2+d, respectively. All the order conditions stated above are just sufficient conditions, not sharp necessary conditions
fields
Numerical Analysis
pdf ↗ page arXiv:2611.01448 ↗

The goal of this paper is to derive robust preconditioners for integral control-state constrained optimal control problems governed by the second order partial differential equations with linear finite element approximations. We give corresponding discretized systems of the first order necessary and sufficient optimality conditions, and get six linear algebraic systems with saddle point schemes. Furthermore, we propose efficient block preconditioners to solve the corresponding linearized algebraic systems. With respect to both mesh sizes and inherent parameters, the robustness of proposed preconditioners is proved with explicit eigenvalues of minimal polynomials. Meanwhile, we design two algorithms and choose the incomplete $LU$ factorizations to deduce the computations. Two numerical experiments are given to depict the efficiency of our proposed preconditioners.

comments
31 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2611.01526 ↗

In this paper, we study the recovery of an unknown rank-$r$ matrix $\boldsymbol{X}_\star \in \mathbb{R}^{n_1\times n_2}$ from Gaussian linear measurements using the Riemannian Gauss-Newton (RGN) algorithm. Each iteration of RGN solves the RGN equation followed by a fixed-rank retraction. We prove that, with high probability, RGN with spectral initialization converges quadratically to $\boldsymbol{X}_\star$ using $\mathcal{O} ( r(n_1+n_2)κ^2 )$ measurements, where $κ$ is the condition number of $\boldsymbol{X}_\star$. This is the first result to simultaneously achieve rank-optimal sample complexity and quadratic convergence for Gaussian low-rank matrix sensing. The key to the proof is a sharp spectral-norm analysis of the iterates, which requires controlling the inverse operator arising from the RGN equation. Our analysis develops an exact finite Neumann expansion of this inverse operator and combines it with a virtual-sequence decoupling argument and the restricted isometry property. Extensive numerical experiments support our theoretical findings and demonstrate the advantages of RGN.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.01542 ↗

We propose energy-dissipative backward differentiation formula (BDF) methods for geometric flows in the Barrett–Garcke–Nürnberg (BGN) parametric finite element framework. Starting from a Lagrange-multiplier formulation, we replace the multistep approximation of the energy derivative by an energy-increment equation while retaining the BDF geometric equations. The Simpson quadrature and two interleaved time grids provide third- and fourth-order constructions. The positive quadrature weights ensure stepwise decay of the original discrete geometric energy for every nondegenerate solution of the nonlinear system. We establish an explicit conditional consistency bound for the scalar energy equation and a regularity criterion for the Newton system of curve-shortening flows. Then, the proposed schemes extend to simulating curve diffusion, mean curvature flow, and surface diffusion. Finally, numerical experiments demonstrate geometric accuracy, energy decay, good mesh distribution, and high performance of the proposed schemes.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.01593 ↗

We develop and analyze parameter-robust block preconditioners for a stabilized control-volume discretization of the quasi-static Biot equations. Beginning with a five-field formulation, we eliminate the poroelastic stress and time-scaled Darcy velocity through independent vertex-local solves, obtaining a symmetric cell-centered displacement–rotation–pressure system. A macrocell rotation-jump term stabilizes the weak-symmetry constraint. We prove the well-posedness of the fully discrete scheme and show that the condensed, coupled displacement–rotation mechanics block is uniformly spectrally equivalent to its block-diagonal counterpart. For uncoupled preconditioners, we derive an exact discrete pressure-control criterion and a sufficient parameter condition that accommodates the scaling \(c_0\asymp K_{\rm dr}^{-1}\), thereby allowing the storage coefficient to vanish in the nearly incompressible limit. We then construct a Schur-consistent pressure block that approximates the mechanics-induced pressure correction and prove its uniform equivalence to the exact pressure Schur complement. These results yield parameter-independent spectral bounds for block-diagonal preconditioning and weighted field-of-values estimates for lower-triangular preconditioning. Practical realizations employ a macrocell mass-matrix approximation for the stabilized rotation block and tailored two-grid solvers for the displacement and pressure blocks. Numerical experiments verify the expected convergence behavior in two dimensions and demonstrate robust performance under mesh refinement and broad variations of the physical parameters in both two and three dimensions.

comments
26 pages,6 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.01922 ↗

We develop and validate a physics-informed neural network (PINN) framework for computing the tidal Love numbers of black holes directly from their perturbation equations. We consider static perturbations of the Kerr black hole, whose exact hypergeometric solutions provide a controlled benchmark for both the numerical solver and the extraction of the physical response. The framework combines exact enforcement of the horizon boundary conditions with an $H^2$-Sobolev loss that incorporates derivatives of the differential-equation residual. The Love number is then obtained by extracting the asymptotic coefficients of the learned solution, without using the analytic connection formula. Across the tested scalar, vector, and tensor perturbations, the method recovers the finite dissipative response with relative errors below $10^{-5}$. Controlled comparisons show that the higher-derivative loss terms improve solution accuracy by orders of magnitude, while independent tests of the extraction procedure distinguish solver errors from errors in recovering the response coefficients. The conservative response, which vanishes analytically, is constrained by the numerical error floor. These results demonstrate that PINNs can accurately compute black-hole tidal response and establish a validated framework for future extensions to frequency-dependent and non-separable perturbation problems.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.02084 ↗

Phase-field models provide a powerful framework for simulating grain growth phenomena in polycrystalline materials, but their application to large-scale systems is limited by the high computational and memory costs associated with resolving multiple phase variables over fine spatial and temporal scales. This paper presents a tensor decomposition based model reduction framework for accelerating phase-field simulations of grain growth. The proposed method exploits the underlying low-rank structure of the evolving phase-field variables and represents the high-dimensional solution in a spatially decomposed tensor format. By performing the numerical computations directly within this reduced representation, the framework decreases storage requirements and reduces the cost of repeatedly solving the phase-field equations. The number of modes for the decomposed approximation is controlled during the online computation with a subspace mode-updating algorithm, to balance computational efficiency and approximation accuracy. The method is assessed using representative grain growth problems, and its predictions are compared with those obtained from conventional full-order finite element simulations. The results demonstrate that the formulation can accurately reproduce the evolution of grain morphology and the principal characteristics of grain growth kinetics while substantially improving computational efficiency. The proposed framework therefore provides a promising approach for extending phase-field simulations to larger spatial domains, finer discretizations, and systems containing a large number of phase variables.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.02118 ↗

We show that the well-known Ehrlich–Aberth root finding method is not generally convergent. More precisely, we show that there is an open subset of polynomials of any degree $d\ge 7$, and an open subset of initial conditions, such that the iteration of the Ehrlich–Aberth method converges to an attracting periodic cycle of period $4$, rather than to a vector of roots. The proof is constructive in the sense that we present explicit values for the polynomial and the $4$-cycle. The search is highly non-trivial: we found no attracting cycles for lower degrees/periods, and the size of the attracting domain relative to a ``unit cube'' in the space of polynomials and starting vectors is on the order of $10^{-127}$.

comments
10 pages, 4 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.02143 ↗

We develop unconditionally $L^2$-stable explicit–implicit–null (EIN) filtered Runge–Kutta (RK) methods for nonlinear degenerate parabolic equations with space-, time-, state-, and gradient-dependent diffusion coefficients. The methods are linearly implicit in the sense that they evaluate nonlinear terms explicitly and require only linear solves. Unlike classical EIN methods that are direct applications of implicit–explicit (IMEX) RKs, our construction is built upon explicit RKs. The key ingredient is two-sided symmetric filtering applied at each RK stage: a high-order filter is applied both before and after evaluating the original nonlinear residual. It leads to a dissipation estimate independent of the time step and retains the underlying RK order formally. Assuming time-dependent splitting operators with stagewise pointwise coefficient bounds, we rigorously prove non-increasing $L^2$ norm for arbitrary time steps. A quadratic matrix criterion covers explicit RK-based methods with positive weights, while strong stability preserving (SSP) compositions yield exact energy identities and weighted dissipation estimates. We present SSP methods through fourth order and a method based on the classical RK4. The framework accommodates spatial discretizations with discrete gradient structures including continuous Galerkin, Bassi–Rebay 1, the method of Brezzi et al., and local discontinuous Galerkin. Compatible summation-by-parts discretizations with simultaneous approximation terms are also covered in their discrete mass norm.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.02282 ↗

The perfect electric conductor (PEC) boundary condition alone does not eliminate the gradient nullspace of the Maxwell curl-curl operator. Consequently, a boundary-only Maxwell implementation of Eig-PIELM, an eigenvalue extension of the physics-informed extreme learning machine (PIELM), may retain represented gradient modes in its reduced trial space, producing nonphysical, gradient-contaminated modes. We develop dR-Eig-PIELM, a finite-dimensional structure-preserving extension that retains the linear-coefficient, boundary-null-space, and one-shot multimode architecture of Eig-PIELM. It combines compatible tensor-product grad–curl trial spaces with a constrained null-space construction to restrict the sampled PEC space to the mass-orthogonal complement of the represented gradient image before the eigensolve. Symmetric weak-form Gram assembly yields a symmetric-definite reduced eigenproblem without an eigenvalue cutoff under the stated sampling and material-positivity assumptions. For rectangles and cuboids, we establish fixed-degree exactness at the PEC vector-field space and derive rank and dimension identities. Numerical experiments show that dR-Eig-PIELM excludes the spurious eigenmodes with significant gradient components observed in the boundary-only baseline. The method exhibits rapid convergence with increasing polynomial degree and competitive work–precision performance in the tested configurations. A covariantly mapped waveguide example illustrates the potential of dR-Eig-PIELM for integration into design optimization workflows through a constrained local geometry update driven by computed cutoff frequencies and their sensitivities. This work provides a mathematical and computational framework for separating represented gradient modes from physical Maxwell eigenmodes within Eig-PIELM and supports its use in waveguide spectral analysis and geometry design.

comments
25 pages, 4 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.02337 ↗

On a uniform grid with equal weights, Fourier modes that remain distinct on the grid are exactly orthogonal. When the nodes are perturbed, density compensation readjusts the weights. We ask how much of the resulting error reweighting can remove, measuring it by the Frobenius norm of the Gram defect, whose square is proportional to the mean-square error of density-compensated adjoint reconstruction. The answer is governed by aliasing. The grid cannot distinguish certain frequency differences, so a weight correction must treat each such alias class as a single number, while a node displacement affects every frequency difference in the class separately. To first order, reweighting removes the class average but not the spread. The irreducible error is a sum of covariance matrices, one for each class of colliding frequency differences. If no differences collide, every small node perturbation can be repaired exactly with positive weights. With collisions, a repair that works to first order can fail at second order. At the two-dimensional DFT, row and column shears are each exactly repairable, but their combination is not, and we compute the obstruction. In one dimension, oversampling protects a band of low-frequency node motions, and under random jitter optimal reweighting asymptotically removes a fraction $1-κ^2(2-κ)^2$ of the expected squared first-order error at oversampling ratio $κ\in[1,2]$. At critical sampling, node and weight perturbations are orthogonal: no reweighting helps, Voronoi weights can never reduce the error, and for the one-dimensional DFT the remaining error is a log-Vandermonde energy with the circular $H^{1/2}$ energy as its continuum limit.

comments
30 pages, 4 figures. Code reproducing all results: https://github.com/circlespie/alias-geometry-fourier-sampling
fields
Numerical Analysis
pdf ↗ page arXiv:2611.02379 ↗

We construct and analyze high-order implicit–explicit backward differentiation formula finite element (IMEX BDF–FEM) schemes for the Hodgkin–Huxley cable system on a branched metric graph. The linearly implicit schemes combine constant-step BDF methods of orders $q=1,\ldots,5$ with conforming finite elements of any fixed degree $p\ge1$. Extrapolated gate variables are smoothly masked before evaluating the conductances, preserving coercivity without projecting the numerical gates. A voltage cutoff makes the gate rates globally bounded and Lipschitz. Each timestep requires one linear voltage solve followed by independent nodal gate updates. Under exact spatial integration, we prove unconditional stability of the complete fully discrete regularized scheme in discrete history energies. Under regularity and starting-history assumptions, the voltage and reconstructed gates converge in $L^2(Γ)$ at the optimal rate $O(h^{p+1}+Δt^q)$, without a timestep restriction or an $h$--$Δt$ coupling. The same rate holds with numerical quadrature when its full residual defect is $O(h^{p+1})$. Manufactured solutions recover the predicted orders through BDF5--$P_4$. Action-potential simulations illustrate pulse propagation and splitting, while a controlled work–precision comparison within the proposed family shows that higher-order variants can reach a prescribed accuracy at much lower runtime along the tested joint-refinement paths.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.02423 ↗

Kaczmarz-type methods often converge slowly when the coefficient matrix is ill-conditioned. In particular, when the smallest singular value is small, every row of the coefficient matrix is nearly orthogonal to the corresponding right singular direction, so that the iteration stalls along that direction. To break this slow-convergence regime, we borrow the delayed-step-size idea of the Barzilai-Borwein (BB) method and, within the framework of the residual-based surrogate-hyperplane Kaczmarz method, propose two new step sizes for gradient-descent-type methods solving linear systems: a delayed residual step size \(α_k^{\mathrm{DR}}\) and a residual-difference step size \(α_k^{\mathrm{RD}}\), which correspond, respectively, to the BB1 and BB2 step sizes in convex quadratic optimization. We prove that \(α_k^{\mathrm{RD}}\leα_k^{\mathrm{DR}}\), and we analyze the convergence of the resulting method in a canonical model with two singular values: although the step sizes are non-monotone, the residual norm is shown to decrease after finitely many steps. Numerical experiments on some ill-conditioned linear systems illustrate the effectiveness of the proposed methods.

comments
12 pages,4 figures
fields
Numerical Analysis, Dynamical Systems, Optimization and Control
pdf ↗ page arXiv:2611.02743 ↗

Reduced-order models (ROMs) learned from trusted numerical simulations enable the real-time simulation of complex physical systems, making computationally prohibitive tasks-such as uncertainty quantification and optimal control-tractable. In particular, data-driven ROMs are opening the opportunity to learn from both numerical simulations and experimental data. However, integrating these sources of information is far from straightforward. Real-world measurements often involve multiple sources of uncertainty, including non-Gaussian noise, latent heterogeneities, unknown or hidden system parameters, and multiscale phenomena occurring below the resolution of the data. Consequently, real-world data are better described by parametrized stochastic partial differential equations, for which the development of effective ROMs remains relatively unexplored. In this work, we introduce POD-CNF, a data-driven generative ROM for efficient uncertainty quantification of parametrized high-dimensional systems. The approach combines projection-based model reduction and deep generative modeling. First, Proper Orthogonal Decomposition (POD) is employed to obtain a low-dimensional representation of the solution manifold. A Conditional Normalizing Flow (CNF) is then trained to approximate the density of the reduced coefficients conditionally on the input parameters. This formulation allows the surrogate to capture complex, multimodal output distributions, going beyond standard regression-based ROMs and least-squares predictions. We assess the effectiveness of POD-CNF through numerical experiments, demonstrating its ability to accurately reproduce output distributions while substantially reducing computational costs. Finally, a proof-of-concept application illustrates how the generative paradigm facilitates integration into Bayesian inverse problems, highlighting promising directions for future research.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.02787 ↗

Convection-diffusion equations are fundamental models for transport phenomena, but their numerical solution becomes challenging in convection-dominated regimes due to steep gradients and sharp boundary layers. This motivates the development of accurate approaches capable of effectively resolving such features while avoiding costly iterative optimization. In this study, a modified ELM framework based on shifted Legendre polynomials is developed for convection-diffusion equations in steady-state, continuous-time, and discrete-time formulations. The proposed approach is evaluated on steady and unsteady benchmark problems with relatively high Peclet numbers, including continuous and discontinuous boundary conditions. Finite element method solutions are used as independent solution references. By exploiting the linearity of the governing equations, MELM determines the output weights through a single least-squares solve, avoiding the iterative gradient-based training required by PINNs. The shifted Legendre polynomial basis provides an effective spectral representation for resolving steep gradients and sharp boundary layers. For the DT-MELM formulation, the coefficient matrix remains unchanged across successive time levels, allowing its LU or QR factorization to be computed once and reused. A systematic comparison with PINNs that incorporate advanced training strategies demonstrates that MELM provides higher accuracy and shorter solution times for steady-state and DT-MELM formulations across the benchmark problems considered. In contrast, CT-MELM exhibits scalability limitations as the size of the space–time basis increases. Overall, the results demonstrate the effectiveness of MELM for steady-state and discrete-time convection–diffusion problems, while also showing that PINNs provide better scalability for large space–time formulations where global CT-MELM becomes computationally demanding.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.02800 ↗

Kernel collocation is a meshfree method for partial differential equations whose accuracy depends on the smoothness of the kernel and of the solution. For globally supported kernels, however, the collocation matrices are dense and severely ill-conditioned. We address both issues by combining a multiscale collocation scheme with samplets, a multiresolution basis of discrete signed measures with vanishing moments. In the samplet basis, the collocation matrix has only O(N log N) relevant entries, while the multiscale scheme adapts the kernel width to the spacing of the points on every level. Since the differential operator scales the equations at the interior points differently from those at the boundary points, the rescaling alone does not bound the condition number of the level systems. We therefore solve them by a Schur-complement reduction that is invariant under this scaling. For noisy data, we consider physics-informed kernel learning, which replaces the collocation system by a regularized least-squares fit. We show that it reduces to collocation as the regularization vanishes, and we solve it by a deflated conjugate gradient method that reuses the Schur-complement reduction. Numerical experiments in two and three dimensions, with exact and noisy boundary data, show that the method handles significantly more points than dense collocation.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.02832 ↗

We study the characteristic Galerkin-type semi-Lagrangian discontinuous finite element (CSLDG) method for conservative linear transport equations. When the characteristic maps and upstream regions are exact, each update of the ideal CSLDG scheme is equivalent to exact conservative transport of the current numerical solution followed by L^2 projection onto the background DG space. The conventional estimate obtained by accumulating projection errors over successive time steps loses one order when Δt\asymp h, but this loss does not represent the actual accuracy of the scheme. For smooth velocity fields \A(\x,t) on a common periodic lattice, we construct local correctors used only in the analysis on uniform Cartesian meshes, assuming that Δt/h is fixed and that every component of the local Courant vector remains uniformly separated from the integers throughout the space-time domain. We prove strict contraction of the reference-cell transport-projection operator on the zero-mean polynomial space, establish uniform solvability of the corrector equation and Lipschitz estimates with respect to its parameter, and control the difference between the exact flow map and a local frozen translation through weak integral moments. This yields a one-step residual of order O(h^{K+2}), and, while retaining the step-by-step update and the standard L^2-projected initial data, gives, for the P^K approximation, an optimal O(h^{K+1}) error bound. The velocity may depend on both space and time, and incompressibility is not required. An appendix extends the analysis to a compact-support setting, in which the velocity field and the solution need not share a common spatial period.

comments
Combining this result with earlier estimates for the time-dependent test function error and the geometric error in the approximate upstream region, we obtain the sufficient conditions D\ge2K+4+d and r\ge K+2+d for preserving the overall optimal order, where D is the order of the ODE solver and r is the degree of the spline boundary reconstruction
fields
Numerical Analysis
pdf ↗ page arXiv:2611.02867 ↗

Computing high-order partial derivatives of multivariate functions is often computationally and memory intensive. This paper addresses this problem via an algebraic approach. High-order partial derivatives of a multivariate function are expressed as linear combinations of univariate directional derivatives, which are computationally friendly. The coefficients and direction vectors are determined by the Waring decomposition of monomials, so that the number of univariate directional derivatives in the representation is minimized. Numerical experiments confirm the efficiency of the proposed method.

comments
4 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2611.02948 ↗

Eliminating an unresolved diffusion field from a coupled parabolic system produces an operator-valued memory term and a contribution from the hidden initial state. We study whether a reduced prediction of the retained field meets a prescribed tolerance. For known hidden initial data, the discarded response, damped by diffusion and transmitted through the coupling, gives an upper error bound; an auxiliary diffusion problem supplies a lower bound. Rigorous discretisation bounds then yield tests that accept, reject or remain undecided. If the discarded initial state is known only through a norm bound, the minimum worst-case error equals that bound multiplied by the time-uniform gain from the missing state to the retained trajectory. Our main result encloses this infinite-dimensional gain using a finite spectral Galerkin evolution, its residual in the full equations and an explicit diffusion tail. The enclosure converges without compactness or smallness of the coupling. Strict comparisons of the optimal radius with a tolerance have finite certificates if all endpoint quantities admit arbitrarily accurate rigorous enclosures. Multiplication-coupling examples with infinitely many dynamically coupled modes illustrate both settings, including explicit finite-element error budgets.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.02977 ↗

Accurate computation of the acoustic terms in weakly-compressible SPH, including the equation of state, its inverse, and the evaluation of the local speed of sound, is essential to ensure energy conservation, robust solid boundary conditions, and correct open boundary behavior. In the classic Cole's equation of state, using values of the polytropic constant $γ\ne 1$ can lead to significant precision loss, particularly when computations are performed in single precision, as is common in GPU implementations. We extend here our previous results on the optimal choice of state variable by introducing a new higher-precision form for all three acoustic terms, denoted \texttt{explog}, and assess its numerical accuracy and computational performance across a variety of devices and test cases. We find that the new form evaluates the acoustic terms with a maximum ULP of~2 for arguments less than $0.125$, and has higher errors in less than 1\% of the arguments larger than the threshold. Combined with a rewritten expression of the pressure at solid boundary particles in the ``dummy'' model, it provides consistently more accurate results, maintaining deviations from the reference pressure profile to below 2\%, even in presence of a rough bottom terrain. Computationally, the new formulation is also faster than the naive one on GPU, and only marginally slower on CPU.

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

Contingency analysis repeatedly solves the power-flow equations under many single-element outages, an increasingly demanding workload as operating margins tighten and renewable variability grows. Graphics processing units (GPUs) are attractive for this task, but a change in topology alters the sparsity pattern of the Jacobian, preventing the uniform batched factorization on which efficient GPU solvers rely. This paper presents a GPU-parallel Newton–Raphson solver for $N\!-\!1$ contingency analysis that separates the change in operating state from the change in topology. A single reference Jacobian is inverted once and reused across all contingencies. Each topology change is expressed as a low-rank Woodbury correction, while the residual state-dependent perturbation is handled by an inner iterative solve, a truncated Neumann series or the biconjugate gradient stabilized method. We analyze the spectral radius and condition number of the resulting iteration matrices and show that the reference Jacobian is an effective preconditioner. On transmission-scale benchmarks, the method attains per-topology solve times competitive with an optimized 80-core central processing unit baseline, with the low-rank correction accounting for approximately 1–2\% of the workload. This makes GPU-parallel $N\!-\!1$ contingency analysis feasible at transmission scale without per-topology refactorization.

comments
Submitted to IEEE Transactions on Power Systems. 10 pages, 5 figures, 1 table
fields
Numerical Analysis
pdf ↗ page arXiv:2611.03012 ↗

The Ozaki scheme for matrix multiplication computes an accurate matrix product by splitting the input matrices and evaluating a sequence of low-precision matrix products. Its accuracy and computational cost depend strongly on the number of splits. We develop accuracy-driven criteria for selecting this number in both Ozaki matrix multiplication and in block LU factorization using Ozaki trailing updates. For matrix multiplication, we derive normwise and componentwise criteria that determine how many split products are required to achieve a given accuracy requirement. For block LU, we present a fixed normwise strategy with essentially no selection cost, an LU-aware adaptive normwise strategy that can reduce the number of splits in subsequent trailing updates, and a componentwise strategy that uses information accumulated from preceding updates to guide the later selections. In the componentwise strategy, when the required number of splits exceeds a prescribed maximum, the corresponding update is instead carried out using ordinary matrix multiplication. We also provide rigorous backward error bounds for these approaches. Numerical experiments show that the adaptive normwise strategy can reduce the number of splits while preserving normwise accuracy, whereas the componentwise strategy can provide smaller componentwise backward errors when stronger local accuracy is needed.

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

GPU acceleration of finite element assembly is well established for standard formulations, but mixed-dimensional problems, in which volumetric subdomains are coupled via lower-dimensional interfaces, remain unsupported in automated frameworks such as FEniCS. We extend cuDOLFINx, a GPU-enabled extension of the DOLFINx finite element framework, to assemble such interface problems on GPUs while preserving the high-level FEniCS programming model. Combined with GPU-resident Krylov solvers and algebraic multigrid preconditioning, this enables end-to-end GPU execution of the EMI (Extracellular–Membrane–Intracellular) model, an elliptic interface problem from cardiac modeling in which many intracellular subdomains are coupled through membranes. We compare the GPU implementation against a CPU-based one through strong and weak scaling experiments on regular and realistic 3D cardiac geometries with up to 8000 cells and 22 million degrees of freedom. In terms of assembly, a single GH200 node is roughly equivalent to two 144-core CPU nodes in strong scaling, and to two to three nodes in weak scaling, depending on geometry. For the linear solver, performance depends on geometry, preconditioning, and problem scale. On the regular geometry, GPU advantages emerge mainly at larger problem sizes and node counts. On the realistic geometry, with the same algebraic multigrid preconditioner for both architectures, the GPU is faster at all tested scales. The implementation is available as open-source software and applies to other problems with interface coupling.

comments
21 pages, 6 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.03181 ↗

The Stable Fluids algorithm is a fractional step method for solving the incompressible Navier-Stokes (NS) equations in an unconditionally stable way. It was initially developed for visual effects and allows real-time simulations because of its low computational complexity. The method solves the advection step by using the method of characteristics which is implemented via linear interpolation. This results in excessive diffusion of vorticity and is one of the main reasons for the physical inaccuracy of the algorithm. We propose Kernelized Stable Fluids with Sparse Cholesky Preconditioning (KSF-Chol) in order to address this shortcoming and make the algorithm thereby suitable for engineering problems and scientific computing. The algorithm is modified by replacing the linear interpolation approach with kernel interpolation in the advection step. We accelerate the computationally expensive kernel interpolation by using sparse Cholesky preconditioning and a near-/far-field approach and optimize both methods for computations on a uniform Cartesian grid. KSF-Chol achieves per time step a near-linear computational complexity of $\mathcal{O}(N\log^d(N/\varepsilon_{\mathrm{chol}}))$ in space and time. We test KSF-Chol against reference solvers and numerical reference data on multiple 2D and 3D benchmarks and demonstrate a significantly reduced numerical diffusion as well as a competitive accuracy concerning the computation of relevant flow quantities.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.03263 ↗

In this paper we study quadrature perturbations and high-order time discretization for a prescribed-feature evolutionary generalized transferable neural network (Evo-GTransNet) Galerkin method for linear self-adjoint parabolic equations. Assembly quadrature, together with truncated singular value decomposition, is used to select a numerically resolved trial space and obtain coordinates with an identity mass matrix. Since this normalization depends on the assembly quadrature, the retained functions are also evaluated using a separate comparison quadrature, which is finer in the numerical experiments. For the two resulting semidiscrete systems, we derive an exact equation for the difference between their trajectories and an energy estimate that separates errors arising from the effective operator, load vector, and initial projection. The estimate is conditional on the trial space selected by the assembly quadrature. The retained rank, discarded mass, cross mass, and principal angles are used to assess this selection step. Refining the comparison quadrature yields stable retained spaces for the reported configurations, whereas deliberate underintegration leads to much larger perturbations. On the fixed retained systems, the temporal convergence of implicit midpoint, BDF, Radau IIA, and Gauss–Legendre methods is consistent with their classical orders over the resolved refinement ranges. The experiments distinguish the retained-coordinate error from the total solution error; the latter is measured against the PDE solution in the $L^2$ norm, with the error integrals evaluated by sufficiently fine quadrature. They also illustrate the importance of suitable starting values for BDF3 and show how the performance of IMEX-BDF schemes depends on the operator splitting and time step size.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.03281 ↗

We consider the efficient numerical solution of time-dependent Rayleigh-Bénard convection governed by the incompressible Boussinesq equations. The coupled velocity-pressure-temperature system presents significant computational challenges arising from incompressibility, buoyancy coupling, convection, and the simultaneous resolution of multiple physical time scales. We present a systematic study of fully implicit Runge-Kutta methods for time-dependent Rayleigh-Bénard convection, together with scalable finite element solvers for the resulting stage-coupled systems. We employ high-order, L-stable Radau IIA methods for temporal integration and investigate Taylor-Hood and Alfeld-Sorokina finite elements in two dimensions, along with Taylor-Hood and enriched macroelement discretizations in three dimensions. The macroelement approaches offer strong local inf-sup stability and patch structures well suited to Vanka-type relaxation. In two dimensions, monolithic multigrid achieves nearly stage-independent outer Krylov iteration counts and maintains robust convergence under mesh refinement. On the same mesh with incremental pressure correction, selected Radau configurations reduce elapsed solve time by 18-32% and yield smaller sampled transient differences relative to a numerical reference solution. Three-dimensional experiments demonstrate favorable parallel scalability with Taylor-Hood elements and substantially improved discrete mass conservation with the enriched macroelement discretization. These results identify regimes in which coupled multistage fully implicit integration is computationally competitive when equipped with appropriate multigrid preconditioners.

comments
26 pages, 10 tables, and 7 figures, submitted for publication in the SIAM journal on scientific computing (SISC) special section, 41st Colorado Conference Iterative and Multigrid Methods 2026
fields
Numerical Analysis
pdf ↗ page arXiv:2611.03361 ↗

A closed rectifiable curve on the torus $\mathbb T^d=\mathbb R^d/\mathbb Z^d$ is a $t$-design curve if normalized arclength integration is exact for trigonometric polynomials $e^{2πi \langle m,x\rangle}$ with frequencies $m\in\mathbb Z^d$ satisfying $\|m\|_\infty\le t$. For the arclength $L$ of such curves, we establish the sharp lower bound \begin{equation}\label{eq:abs} L\geq \Big(\frac{(t+1)^{2d}-1}{t(t+2)}\Big)^{1/2}. \end{equation} Equality is attained by the family of Korobov curves described in \cite{Kunis,Lindblad}. For even $t$, we also derive an explicit lower bound on the length of total-degree $t$-design curves, defined by the frequency condition $\|m\|_1\leq t$. This bound is sharp for $t=2$ in every dimension and for every even $t$ in dimension two. We determine the minimum length of hyperbolic cross $t^2$-design curves in dimension two. For $d\geq3$, we establish lower bounds of optimal order for the length of hyperbolic cross $t^d$-design curves. Finally, we obtain lower bounds of optimal order for the length of $t$-design curves associated with sparse frequency sets.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.03362 ↗

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 Poisson's equation, we prove optimal algebraic convergence rates for adaptive conforming finite element methods driven by standard maximum marking in arbitrary space dimension, for every marking parameter in $(0,1]$. Previously, instance optimality of a modified maximum marking was proved in [L. Diening, C. Kreuzer, and R. Stevenson, Instance optimality of the adaptive maximum strategy, Found. Comput. Math., 16 (2016), pp. 33–68]. The basic ingredients of our anlaysis consists of discrete reliability, discrete efficiency, overlay and closure estimates of local mesh refinement. The discrete efficiency requires a facet-interior node property of simplicial mesh refinement. The novel part of the optimality analysis is an elementary integral-sum argument that converts energy decrease into a cumulative cardinality bound of marked elements, yielding rate optimality without a contraction argument.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.03387 ↗

Global tractography offers a theoretical framework for reconstructing white matter connectivity from diffusion MRI by jointly inferring all streamlines and their consistency with the diffusion signal and underlying anatomical priors. However, its sequential nature and log-linear complexity make it computationally prohibitive at the scales demanded by neuroimaging, from large population cohorts such as the Human Connectome Project (HCP) to ex vivo ultra-high-field acquisitions at mesoscopic resolution. In this work, we present ExaTract, a parallelized spin-glass tractography framework designed for high-performance computing (HPC) architectures. Implemented as an open-source MPI+Kokkos application, ExaTract partitions the tractography domain into spatially overlapping regions processed across distributed memory nodes, with regular synchronization of boundary modifications to preserve global convergence guarantees. We validate ExaTract on both in vivo and ex vivo diffusion MRI data: the complete HCP dataset demonstrates population-scale throughput, while the high-resolution Chenonceau dataset provides the first mesoscopic structural connectome derived from global tractography.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.03419 ↗

Overlapping Schwarz methods are among the most successful domain decomposition preconditioners for large-scale finite element simulations. In this work, the Generalized Dryja-Smith-Widlund (GDSW), GDSW$^*$, and Reduced GDSW (RGDSW) coarse spaces are studied for three-dimensional high-order finite element method (FEM) and virtual element method (VEM) for the Poisson equation and the equations of linear elasticity. To the best of our knowledge, this is the first study of GDSW-type coarse spaces for polynomial degrees $k\ge 3$ in three dimensions, for either discretization. In 3D VEM, the face degrees of freedom (DOFs) are moments instead of point values. The kernel of the differential operator, which defines the interface values of the GDSW coarse basis functions, must be represented through these moments. The construction is therefore no longer purely algebraic and, without this correction, the coarse level loses its effect for $k\ge 3$. FEM and VEM are tested on hexahedral meshes, and VEM is additionally tested on polyhedral ones. Polynomial degrees up to $k=5$ and runs on up to $4\,096$ subdomains and parallel cores are included in the numerical study. Numerical experiments show scalable iteration counts for all coarse space variants for the Poisson problem, illustrating the expected trade-off between the coarse space size and robustness. Further experiments for linear elasticity confirms that the moment-based construction extends naturally from the scalar to the vector-valued problem.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.03447 ↗

Fourier-based Poisson solvers treat periodic directions spectrally and unbounded ones by the Hockney–Eastwood convolution with a free-space kernel. With two unbounded and one periodic direction, the setting of vortex tubes, wakes and jets, the kernel used so far by these solvers combines the two-dimensional kernel on the zero periodic mode with the symbol of the operator sampled on the doubled grid on every other mode. We show that the second ingredient is not exact: the error is the field of the periodic images of the source and independent of the mesh size. While the period $L_z$ is not much longer than the unbounded extent $L_x$, it is of order $\exp(-2πd/L_z)$, with $d$ the distance to the nearest image; beyond, it grows like $(L_z/L_x)^2$. The error is thus small on cubic domains, but larger than the solution itself on elongated ones. We remove the approximation by extending the integral representation of the exact second-order kernel of Hou and Colonius: the screened kernel of each mode is evaluated in closed form along one unbounded direction and by Gauss–Legendre quadrature along the other, for the high-order dimension-split and Mehrstellen stencils, at a one-off cost of about one solve. The kernels, implemented in the open-source library \flups{}, are verified by comparison with independent quadratures, by a padding test sensitive to the boundary condition enforced, and by convergence at the order of each stencil on an axially modulated tube source, on domains up to $64$ times longer than wide and up to $2.7\times10^{11}$ unknowns.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.03458 ↗

Hybrid models and neural differential equations (NDEs) are becoming increasingly important for modelling physical systems; however, they often encounter stability and accuracy issues during long-term integration. Training on unrolled trajectories is known to limit these divergences but quickly becomes too computationally expensive due to the need to compute gradients over an iterative process, making this method impractical for large-scale physical systems (e.g. weather and climate forecasting). Two popular paradigms for improving the stability of learned dynamics are to train on interpolated or noisy samples or to regularize the Jacobian of the learned representation. In this work, we demonstrate that these paradigms can be understood under a common lens and that they both correspond to an approximation of the gradients obtained in an unrolled learning strategy. Building on this understanding, we derive a principled and complete approach to regularize training and demonstrate its impact on the stability of learned dynamical systems.

comments
Accepted at NeurIPS 2026
fields
Numerical Analysis
pdf ↗ page arXiv:2611.03461 ↗

We certify reduced and neural approximations of European-put price trajectories under the Carr–Geman–Madan–Yor model by residual bounds for the spline Galerkin discretisation of the tempered-fractional pricing equation. The Galerkin matrices are Toeplitz sections of an explicit periodised Fourier symbol; summing the alias series to a stated tail makes the assembled system exact to $10^{-8}$. A Lévy–Khintchine argument gives the parameter-explicit bound $λ_{\min}(S_I)\ge r\,m_{\min}$ for the symmetric part, valid for $Y\in(0,2)\setminus\{1\}$, replacing numerical spectral estimates. A banded comparison norm built from the mass and stiffness symbols yields a rigorous certificate at $O(N)$ cost with explicit effectivity, and empirical interpolation of the symbol makes the operator affine in about 36 terms with a rigorous error transfer, so a reduced model is certified at a cost independent of $N$; a three-stage rule escalates to the full-order bounds only when needed. At the resolution that prices the whole parameter box to one cent ($N=1024$), the full-order certificate costs 6% of a direct solve, and the certified POD–Galerkin model of rank 80 costs 3% of it and settles 99.8% of $10^4$ queries without touching the full space. No false accept occurs on any query with a reference solution (150 inside the parameter box, 264 outside), and outside the box the certificate accepts 193 of the 210 queries on which the reduced model is still within one cent. The neural reduced models trained here miss the one-cent tolerance by a factor of at least 46; the certificate detects this at every query in a few milliseconds and explains it as a trade-off between temporal smoothness and coefficient accuracy. A residual certificate for the American put is proved as an outlook.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.03463 ↗

We present a novel Active Flux method and a divergence-free method using exact evolution operators for solving Maxwell's equations in three space dimensions on Cartesian grids. The proposed methods are fully discrete, third-order accurate and rely on a truly multidimensional evolution operator based on Kirchhoff's formula for the electromagnetic wave equation. The first method is a classical Active Flux method with globally continuous reconstruction while the second method is an adaptation of the Active Flux method to a locally divergence-free reconstruction by Balsara. The applied reconstruction is built from facial degrees of freedom and is no longer globally continuous. The classical method keeps the divergence error bounded. The divergence-free method with face averages initialized by a potential keeps the constraints at round-off. We compare the accuracy of both methods for smooth and discontinuous test problems.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.03471 ↗

High-performance electrical steel used for iron cores of power transformers and generators exhibits complex material behavior. While modeling and simulation of isotropic nonlinear response is well understood, the incorporation of magnetic anisotropy remains challenging. This work proposes to utilize a structured neural network architecture to systematically describe the anisotropic nonlinear anhysteretic magnetic material response of electrical steel sheets. By constructing a convex and smooth co-energy density with dedicated behavior at infinity, we can ensure thermodynamic consistency and correct physical behavior and further guarantee basic mathematical properties which provide well-posedness of corresponding magnetic field problems and efficient numerical solvers. Numerical tests demonstrate the capability of the proposed method to describe strongly anisotropic behavior as well as its robust convergence in finite-element simulations.

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

We present a path-conservative methodology for the numerical approximation of conservative systems formulated exclusively in primitive variables, the most physically relevant set of variables. The approach is designed to preserve the correct weak solution while avoiding the spurious oscillations near contact discontinuities that may arise in conservative formulations. Nonconservative products are treated through the selection of a suitable family of paths combined with an in-cell discontinuous reconstruction strategy, which is locally activated near shocks. To choose the path we introduce a compatibility condition between the Rankine-Hugoniot conditions of the non-conservative form, with the exact ones, assumed to be known. In smooth regions and across contact discontinuities, a standard path-conservative scheme is employed. The method is further extended to achieve high-order accuracy. Numerical results for the Euler multimaterial and shear interface model demonstrates correct shock-capturing property, suppression of spurious oscillations due to contact discontinuities, and convergence without using hybrid formulations.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.03479 ↗

We compute unconditional guaranteed lower eigenvalue bounds for Schrödinger operators using a modified hybrid high-order method with built-in correction for the potential defect. The method assumes exact numerical integration and allows possibly unbounded potentials in $L^p$ for $p>n/2$ and $p\geq2$ on general polyhedral domains. We prove that the high-order correction preserves optimal a priori convergence orders, and derive reliable and efficient a posteriori error estimators. Numerical experiments provide striking evidence of optimal high-order convergence rates of the adaptive algorithm.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.03567 ↗

Previously, we developed a ``parallel-in-iteration'' optimization framework that uses multigrid reduction-in-time (MGRIT) to parallelize slowly converging optimization methods, such as gradient descent. Unlike time-dependent evolution problems, optimization requires only a final point with a sufficiently small gradient, rather than an accurate approximation of the entire trajectory of iterates. This motivates a different use of MGRIT: instead of repeatedly improving the approximation of a single long trajectory, we introduce restarted MGRIT (R-MGRIT), which performs one MGRIT iteration on a trajectory, takes the approximate final point as a new initial guess, and repeats the process on a new trajectory. Each restart thus defines a new all-at-once system, allowing progress toward the solution without accurately approximating the preceding trajectory. Moreover, we find that these trajectories can be shortened without increasing the number of restarts needed for convergence. We provide theoretical results comparing MGRIT and R-MGRIT for linear problems and demonstrate the convergence behavior of the shortened trajectories numerically for both linear and nonlinear problems. Shortening the trajectories increases the estimated parallel speedup while reducing the number of processors required.

comments
26 pages, 8 figures, 6 tables
fields
Numerical Analysis, Optimization and Control
pdf ↗ page arXiv:2611.03621 ↗

Statistics Theory50

We study statistical inference for a high-dimensional stochastic interaction model observed only through low-dimensional aggregate data. The model describes pairwise communication between $d$ individuals as a collection of mutually interacting branching processes with immigration, where activity on one directed pair may trigger subsequent activity in the reverse direction. The latent interaction counts are not observed. Instead, for each individual, only the total number of messages sent and received in each time slot is available. This aggregation gives rise to an inverse problem in which the parameters governing the latent pairwise dynamics must be recovered from substantially compressed observations.

comments
23 pages, 5 figures
fields
Statistics Theory, Probability
pdf ↗ page arXiv:2611.00152 ↗

Large generative models are commonly trained on data collected from the open web, which may contain data produced by previous generations of the same model. Previous work has shown that recursively training on model-generated data can progressively degrade model performance, a phenomenon known as model collapse. Yet, generative models continue to improve dramatically over time. Existing theory suggests that this is enabled by the availability of new real data at each iteration, kept separate from generated data. However, exact separation is not realistic, and uncurated data is still commonly used. We bridge this gap by considering a more realistic setup in which real and generated data are not handled differently during training. Specifically, we present a comprehensive theoretical study of iterative estimation of the mean and covariance of a multivariate Gaussian distribution. At each iteration, samples are drawn from a mixture of the real data distribution and the estimated distribution from the previous iteration, but are used indistinguishably. We provide a single equivalent condition for consistency of the mean and covariance estimators in Euclidean norms, and convergence to zero of the expected squared 2-Wasserstein distance between the estimated and true distributions. Using this result, we show that consistency holds, i.e., model collapse is avoided, for any fixed real data fraction above zero, and even for a fraction that vanishes across iterations, provided it does not vanish too quickly. However, more real data (or data curation) remains important at practical finite times: the convergence rate of the mean estimator deteriorates as the real data fraction approaches zero. We support our results with an empirical investigation of the theoretical setup, and with experiments on iterative training of a diffusion model on CIFAR-10 that correlate with our theory.

fields
Statistics Theory
pdf ↗ page arXiv:2611.00259 ↗

We study finite sample guarantees for transport based mutual information estimation. Mutual information can be estimated by first learning the conditional and marginal densities and then evaluating their log-density ratio by Monte Carlo. Given training samples, we use triangular transport maps to learn these densities and then compute the mutual information estimate on an independent batch of evaluation samples. For conditional density estimation using triangular transport maps, we establish non-asymptotic guarantees over realizable Hölder classes by viewing the conditional density as an ordinary density with respect to the product of the law of the conditioning variable and Lebesgue measure. This allows standard density estimation techniques to be applied directly to the conditional density estimation. These results yield finite sample guarantees for the resulting mutual information estimator and characterize how a fixed sample budget should be allocated between training and evaluation in order to minimize the mean squared error. Numerical experiments support the predicted training and evaluation error rates and illustrate the resulting sample allocation tradeoff.

fields
Statistics Theory
pdf ↗ page arXiv:2611.00471 ↗

Support points provide a practical and effective way to approximate a probability distribution by a small set of equally weighted representatives through energy-distance minimization. In many applications, the variables satisfy convex constraints that the representatives should also respect. We investigate whether unconstrained support points automatically satisfy such constraints and show that this is not guaranteed. We construct counterexamples using three planar observations, a density with full triangular support, and positive-definite matrix data admitting an indefinite optimal representative under the Frobenius norm. We also identify cases in which containment holds, establish stability under distributional perturbations, and quantify the objective cost of imposing a convex-hull constraint. For a fixed number of representatives and a positive population constraint gap, empirical configurations with vanishing global objective error eventually leave the sample convex hull almost surely.

fields
Statistics Theory
pdf ↗ page arXiv:2611.00514 ↗

Understanding the distribution of individual treatment effects (ITEs) is a central problem in causal inference. In general, however, this distribution is only partially identifiable from observed data because it depends on the unidentifiable joint distribution of the two potential outcomes. In this paper, we develop design-based inference for the distribution of ITEs whose validity relies solely on the randomization of treatment assignment, treating the potential outcomes as arbitrary fixed constants. Building on recent randomization tests for ITE quantiles, we propose tests based on either a rank-based Kolmogorov–Smirnov (KS) statistic or the usual KS statistic, with the latter being more conservative in the presence of ties. We show that, under certain regularity conditions, the confidence bounds obtained by test inversion are asymptotically no worse than the sharp bounds on ITE quantiles given the marginal distributions of the potential outcomes. We further derive a closed-form expression for the confidence bounds from the KS-based randomization test and show that they can be equivalently constructed by combining sharp bounds on ITE quantiles with uncertainty of empirical marginal distributions. This equivalence connects randomization-based inference with partial identification and clarifies the special role of the KS statistic in achieving sharp inference. Under additional distributional assumptions, we characterize the power of the proposed randomization tests under local alternatives. Finally, we discuss how to incorporate covariates to further sharpen inference. We illustrate the properties of the proposed methods using both simulations and a real-data application.

fields
Statistics Theory
pdf ↗ page arXiv:2611.00607 ↗

Hidden Markov models (HMMs) offer an important capability to interpret fitted latent states and transitions. When emission distributions nearly coincide, a small observation-density error does not ensure accurate estimation of the latent quantities needed for interpretation. This motivates us to characterize convergence rates for latent recovery that account for emission separation. Our main contribution lies in deriving deterministic inverse inequalities that convert Hellinger error between fitted and true densities into bounds on latent recovery errors. We develop these bounds for multivariate Gaussian HMMs with a common, known emission covariance matrix and combine them with a Hellinger estimation guarantee for the global maximum likelihood estimator to obtain latent recovery rates. Although the joint observation distribution is a Gaussian mixture with exponentially many path components, they share the same emission centers across time. Leveraging this shared structure, we show that the separation exponents are governed by the maximum number of simultaneously approaching centers rather than the number of path components. Under exact specification, the global bounds on state-sequence probability discrepancies and the 1-Wasserstein loss for latent location distributions exhibit sharp separation exponents that do not increase with the number of selected times. Moreover, sufficiently small observation-density error guarantees unique matching between fitted and true emission centers, which yields error bounds for individual emission centers and transition rows. Under over-specification, individual split-state transition rows are not necessarily identifiable, so we quantify aggregate latent recovery errors and show that state-sequence probability bounds incur larger separation exponents compared to exact specification. We conduct synthetic experiments to validate our theoretical results.

comments
Trang Pham and Dung Le contributed equally to this work
fields
Statistics Theory
pdf ↗ page arXiv:2611.00680 ↗

In this paper, we develop a projected instrumental variable framework that relaxes conventional assumptions for causal identification with instrumental variables. Building on the interpretation of conditional expectation as an orthogonal projection in a Hilbert space, the framework replaces the conditional expectation operator with a general projection operator. We provide an alternative inverse problem formulation based on the Riesz representation. Drawing on semiparametric efficiency theory, we further develop debiased and adaptive machine learning methods for estimation and inference. The proposed framework connects invalid instrumental variables to instrumented difference-in-differences. We also examine invalid projected instrumental variables and discuss their relationship to existing methods. Simulation studies and real data analysis demonstrate that the proposed methods perform favorably compared with existing approaches.

fields
Statistics Theory
pdf ↗ page arXiv:2611.00705 ↗

Component tests can support a lower confidence limit for a system that has not been tested as a whole, but numerical optimization can compromise its coverage. A feasible point in the minimization defining a Buehler limit gives an upper bound on that limit; reporting it can therefore overstate reliability. We develop a computation that maintains lower and upper bounds on the ideal endpoint for a prescribed ordering. Bounds over entire parameter regions justify the reported lower endpoint at every completed checkpoint, including under adaptive stopping and selection among runs. Separate refinement conditions establish convergence, and an explicit error allocation accounts for simulated tail probabilities and confidence-region localization. The theory retains nuisance and dependence parameters in the observation model. Monotone corner bounds give the implemented specialization for scalar and two-component binomial systems; Bernstein and probability-distance bounds provide further theoretical constructions. Four benchmark problems reach a certified width of $10^{-5}$ under each of four search strategies. Additional stochastic candidates increase cost without reducing subdivisions, whereas complete sample-space enumeration verifies the implemented coverage at three parameter vectors. For the all-success example, the certified lower limit is $0.68128$, compared with $0.41738$ from Bonferroni-adjusted component limits.

fields
Statistics Theory
pdf ↗ page arXiv:2611.00711 ↗

Degenerate degree-two U-statistics have non-Gaussian limits, making sequential inference substantially more difficult than in the nondegenerate case. However, row normalization preserves the target parameter and makes the centered numerator a martingale on a harmonic variance clock, at the cost of logarithmic variance inflation. We establish a strong Gaussian approximation for this process and consistently estimate its variance through online updates, allowing spectrum-free calibration. Combining this strong approximation with Gaussian-mixture (GM) and stitched law-of-the-iterated-logarithm (LIL) boundaries yields confidence sequences with asymptotic time-uniform coverage and corresponding sequential tests for null hypotheses under which the kernel is degenerate. We further extend the framework to multi-dimensional vector-valued kernels, yielding Mahalanobis confidence ellipsoids based on consistent covariance estimation. Numerical experiments illustrate sequential type-I error control and favorable detection power in two-sample and independence testing against spectral baselines, and in three-sample homogeneity testing using vector confidence ellipsoids.

fields
Statistics Theory
pdf ↗ page arXiv:2611.00753 ↗

We consider Bayesian inference for the frequency of a periodic signal of unknown shape, observed in Gaussian white noise on the interval $[0,n]$. The information about the frequency grows like $n^3$, so the frequency can be estimated at rate $n^{-3/2}$, while the shape is an infinite-dimensional nuisance parameter. We endow the frequency and the shape with independent priors, the prior on the shape being a random series in the trigonometric basis. We give conditions on the priors under which the posterior for the signal contracts at a rate that, for suitable choices, is the minimax rate for Sobolev classes of smoothness at least one, up to a logarithmic factor and adaptively to the smoothness of the shape. If, moreover, the prior keeps the shape away from shapes with a shorter period, also the marginal posteriors for the frequency and the shape contract around the truth. Under further conditions, which hold for a Gaussian random series prior conditioned to keep the shape away from shapes with a shorter period, for every true shape with smallest period 1 and Sobolev smoothness larger than $3/2$, the marginal posterior for the frequency satisfies a semi-parametric Bernstein-von Mises theorem at rate $n^{-3/2}$, which we prove by moving the origin of time, a change that leaves the posterior unchanged when the prior on the shape is invariant under time shifts.

fields
Statistics Theory
pdf ↗ page arXiv:2611.00821 ↗

In high-dimensional dynamic treatment regimes, nonlinear terminal outcome models complicate upstream conditional-mean modeling and inference based on recursively estimated continuation values. We introduce a Deformed Q-learning procedure for general action spaces that accommodates a terminal-stage GLM, random designs, conditional heteroscedasticity, and fine-grained action discretization. The procedure changes the recursive criterion by propagating the terminal deformed optimal Q-function through sparse block-wise linear conditional-mean models. Under the stated models and regularity conditions, we establish consistent and asymptotically normal estimators, accounting for downstream estimation uncertainty in inference for optimal Q-values, deformed optimal Q-values, and their contrasts. We bound population regret relative to the original terminal mean-outcome objective without explicit stage-wise accumulation. Estimation and inference also extend to a growing number of stages under conditions uniform across stages. Simulation studies demonstrate accurate estimation and variable selection. In an empirical application to sepsis management using the MIMIC-III database, the proposed framework supports stage-specific value inference, while an auxiliary action-alignment analysis provides an exploratory signal that early-stage concordance with the learned recommendation may be associated with improved survival.

fields
Statistics Theory
pdf ↗ page arXiv:2611.00929 ↗

This paper develops feasible high-frequency inference for the leverage effect when the spot variance follows rough Volterra dynamics, leverage loadings depend on endogenous rough states, and observed prices may be contaminated by microstructure noise. We define an integrated leverage parameter through a scaled covariation between log prices and spot variance that accounts for their different local fluctuation scales. The scaled realized covariation admits a stable functional central limit theorem with an explicit pathwise centering correction arising from within-interval variation in the leverage loading. A loading regularity condition renders this correction asymptotically negligible, and we verify the condition for direct Volterra loadings and for smooth functions of closed rough states for every Hurst index below one half. We construct a block-based estimator with an exact finite-window correction for the leading proportional bias, together with a nonnegative single-scale estimator of its asymptotic variance. Pre-averaging extends feasible inference to observations with independent and identically distributed microstructure noise. Simulations under the rough Heston model demonstrate accurate finite-sample calibration with and without noise. An empirical application to fifteen years of one-second data on nine U.S. equities and ETFs finds negative median leverage estimates for every asset at weekly and monthly horizons.

fields
Statistics Theory
pdf ↗ page arXiv:2611.00965 ↗

Mitigating unfair disparities in sequential decision-making is a growing concern in machine learning. We study contextual bandits under a global covariate-based Lipschitz fairness constraint, pioneered by \cite{dwork2012fairness}, requiring individuals with similar contexts to receive similar action distributions. We show that this constraint induces a randomisation region near the decision boundary and explicitly quantify the population level cost of fairness. We further establish a canonical representation of the optimal fair policy, which reduces the fair policy design to a lower-dimensional boundary optimisation problem. We develop a lazy fair greedy algorithm that exploits fairness-induced covariate diversity under continuous contexts, with policy updates computed via finite-dimensional linear programming. For general context distributions, including discrete and mixed contexts, we propose a lazy polyhedral upper confidence bound (UCB) algorithm, whose optimistic optimisation reduces to finitely many linear programs over confidence-set vertices. Both methods satisfy fairness at every round and achieve regret of order $O(\sqrt{T} + T^{(d-2)/(d-1)}{\indc\{d\geq 4\}})$ up to poly-logarithmic factors, where $d$ is the dimension of the contexts. A matching minimax lower bound for $\ell_1$-based fairness establishes optimality, and reveals an unavoidable nonparametric cost of learning the decision boundary, which dominates the parametric learning cost when $d \geq 4$. Experiments on synthetic and real data support our theoretical findings and demonstrate the practical effectiveness of our methods.

fields
Statistics Theory
pdf ↗ page arXiv:2611.00979 ↗

We study worst-case distortion riskmetrics over symmetric distributions with prescribed mean and variance in a Wasserstein ball around a reference distribution. Our key contribution is the construction of a reference-dependent auxiliary distortion that encodes the Wasserstein constraint while preserving symmetry under the concave-envelope operation. Under suitable regularity and nondegeneracy conditions, this construction yields sharp upper bounds for distortions of bounded variation, allowing nonmonotonicity and interior discontinuities, and identifies extremal distributions when the bounds are attained. An approximation preserving symmetry and the prescribed moments exactly shows that upper semicontinuous relaxation of the symmetrized distortion leaves the supremum unchanged for budgets strictly above the feasibility threshold. With additional unimodality, symmetry fixes the quantile's concavity-convexity transition at the midpoint, yielding a characterization via $L^2$-projection onto a fixed closed convex cone for absolutely continuous distortions with square-integrable derivatives. Numerical examples for ES, RVaR, and VaR illustrate how shape restrictions and the reference distribution affect feasibility and worst-case risk. Simulations with data-dependent Wasserstein radii examine worst-case ES and feasibility under correctly specified and misspecified shape restrictions.

comments
43 pages, 4 figures
fields
Statistics Theory
pdf ↗ page arXiv:2611.01003 ↗

This paper concerns certain parametric models for densities on the unit interval which lead to nonsmooth and nonregular likelihood functions. (i) The first is the simple triangular model on the unit interval, characterised by a density linearly increasing from zero to the mode position $θ$ and then linearly decreasing to zero from the mode to one. With data from this model the likelihood function is a sum of individually log-convex terms, and with the derivative having discontinuities at each data point. (ii) The second is the one-parameter two-box density which is flat on $[0,θ]$ and $(θ,1]$, with $θ$ the median. The likelihood has jumps at each datapoint. Here the maximum likelihood estimator is sharper than usual, with convergence in distribution of $n(\hatθ-θ)$ to a nonnormal limit. We also study the $k$-box extension of this model, with density being flat on $k$ boxes determined by $k$ quantiles. (iii) This second model is extended to the two-parameter two-box model, with areas $γ$ and $1-γ$ for boxes $[0,θ]$ and $(θ,1]$. Again the likelihood is nonregular, and the maximum likelihood estimators exhibit different rates of convergence for the breakpoints and the density values. The model generalises to the $2(k-1)$ parameter density piecewise flat over $k$ boxes. For each of these models we tend to the delicate task of sorting out the large-sample behaviour of the log-likelihoods, then leading to precise and partly nonstandard limit distributions for the maximum likelihood and Bayes estimators.

comments
22 pages, 12 figures; Statistical Research Report, Department of Mathematics, University of Oslo; to be submitted for publication
fields
Statistics Theory
pdf ↗ page arXiv:2611.01030 ↗

Gaussian differential privacy (GDP) and zero-concentrated differential privacy (zCDP) are two competing privacy accounting frameworks, but they share similar minimax lower bounds in various estimation problems. Moreover, it is known that a mechanism satisfying $μ$-GDP satisfies $(μ^2/2)$-zCDP, whereas the converse fails to hold at the same calibration. In this paper, we establish the optimal reverse conversion, showing that every $ρ$-zCDP mechanism satisfies $μ_{\mathrm{zCDP}}(ρ)$-GDP, where $μ_{\mathrm{zCDP}}(ρ)=2Φ^{-1}((1+e^{-t_ρ})^{-1})$ and $t_ρ$ uniquely solves the equation $ρ=t_ρ\tanh(t_ρ/2)$. We also obtain simplified bounds $\sqrt{πρ}\leqμ_{\mathrm{zCDP}}(ρ)\leq\sqrt{8ρ}$, with sharp constants, which imply equivalence of the two frameworks up to constants. This explains why their minimax risks agree up to a constant rescaling of the privacy budget. We show that the squared conversion is strictly convex, which implies that converting zCDP to GDP before applying composition or group privacy yields a tighter GDP guarantee than converting afterward. We also derive the sharp conversion from bounded-range and logistic DP mechanisms (e.g., exponential mechanism) to GDP, where converting before composition but after group privacy gives the tighter guarantee.

fields
Statistics Theory
pdf ↗ page arXiv:2611.01218 ↗

We determine sharp minimax rates for distribution estimation under pure local differential privacy at critical query smoothness. For the integral probability metric generated by the unit ball of $B^d_{2,q}$, $1\le q\le\infty$, over fixed periodic Sobolev density balls with positive smoothness and interior slack at the uniform density, the expected risk is of order $N^{-1/2}(\log N)^{3/2-1/q}$, where $N=n\varepsilon^2$; expected squared risk has the squared order. The fine index governs aggregation across resolutions that share one private information budget. A single noninteractive release with a measurable proper density output attains these rates, and matching lower bounds allow finite public blackboard interaction and repeated participation under each user's total privacy budget. A known $L^2$ radius permits the same rates without using density smoothness, with output in the $L^2$ density ball. Separately, for positive smooth densities on $[0,1]$, integrated squared CDF risk has minimax order $(\log N)^2/N$, with sharp quantile, Wasserstein, and transport map consequences. The rates hold uniformly for $0<\varepsilon\le1$ as $N\to\infty$, with class parameters fixed.

comments
30 pages
fields
Statistics Theory
pdf ↗ page arXiv:2611.01289 ↗

We study estimation of linear functionals $\int fψ$ of the conductivity $f$ in the Darcy problem $\nabla\cdot(f\nabla u)=g$ from observations of $u$ in Gaussian white noise of level $N^{-1/2}$. When the potential has a single nondegenerate minimum, we determine the minimax rates over Sobolev balls in the linearised experiment. Unless a compatibility condition along the gradient flow holds, the rate is governed by an effective dimension $T$ of the Hessian at the minimum, not by the ambient dimension: it is $N^{-(2s+T)/(4s+8)}$ for $T<4$, has an elbow at $T=4$ with an extra logarithmic factor, and is parametric for $T>4$. In the nonlinear experiment we show that these lower bounds persist when compatibility fails at the reference and $T\le4$, and we prove the minimax rate on classes with isotropic critical Hessians, and the parametric rate near references with $T>4$. In dimension at most four, no nonzero linear functional is uniformly $\sqrt N$-estimable on a Sobolev neighbourhood of the constant conductivity, even when it is regular there.

comments
57 pages
fields
Statistics Theory
pdf ↗ page arXiv:2611.01290 ↗

We study randomized multiple testing with e-values under arbitrary dependence and introduce a conditional certification constraint: Given the observed evidence, each coordinate's expected rejection certificate must not exceed its e-value. Existing randomized e-BH improvements satisfy this constraint but have no established optimality guarantee. We prove that the maximum conditional inclusion probability for hypothesis $i$, given e-values~$x$, is $1 \wedge (α/ K) \sum_j \min(x_i, x_j)$, and construct one rule attaining these bounds simultaneously. The rule uses a single independent uniform variable, rejects a prefix of the ordered e-values, and has a unique conditional rejection-set law among rules attaining all the bounds. It therefore maximizes every nonnegative weighted sum of inclusion probabilities, including expected true discoveries under any truth configuration. Under a shared uniform draw, its rejection set contains those of e-BH and U-eBH. The construction extends to BY-calibrated p-values, and simulations under positive and negative dependence show power gains over existing randomized procedures.

fields
Statistics Theory
pdf ↗ page arXiv:2611.01333 ↗

This study is dedicated to autoregressive processes with stable and explosive time-varying coefficients, with a particular emphasis on a root located inside or outside the unit circle but converging towards the unit circle as the sample size increases (so that the limit process is integrated). Our objective is to develop a unified asymptotic theory that connects the classical stable, unstable and explosive regimes. By considering roots approaching the unit circle from both the stationary and explosive sides, we investigate how the corresponding asymptotic behaviors (of the process and the OLS) interact, and we try to build bridges between the rates associated with these regimes. This perspective provides a framework for understanding mixed autoregressive dynamics having a root in the neighborhood of the unit circle, provided a fairly general set of conditions.

comments
Only 1 figure
fields
Statistics Theory
pdf ↗ page arXiv:2611.01365 ↗

Conditional sampling is central to Bayesian inference, generative modeling, and causal inference: given a joint law for random variables $X$ and $Y$ and an observation $Y=y$, one seeks to sample from the conditional law of $X\mid Y=y$. Even when the joint distribution is accurately represented, this task can be computationally difficult as it may require evaluating intractable normalizing constants or solving a new inference problem for each observation. Measure transport provides an approach to this problem by identifying a map with triangular structure that directly pushes forward a reference to the conditional of a joint distribution for any observation. This article reviews the theoretical, methodological, and algorithmic foundations of triangular transports, with the Knothe-Rosenblatt rearrangement as a canonical construction. We discuss methods for estimating triangular maps from finite samples, as well as their use in simulation-based inference and causal inference. While our primary aim is to review existing formulations, we also present new ideas and open questions for conditional sampling using transport.

comments
30 pages, 2 figures
fields
Statistics Theory
pdf ↗ page arXiv:2611.01436 ↗

E-process confidence sequences for unbounded means typically use a variance bound and a first-order score, leaving skewness and kurtosis unused. We construct a quadratic-envelope e-process from a conditionally centered vector score with a predictable second-moment bound. Under moment information specified independently of the tested stream, it stays positive on unbounded support and gives exact anytime-valid coverage under predictable strategies and fixed mixtures, without score clipping. For a location family with known central moments through order four, the centered observation and its centered square yield an exact confidence sequence whose local width shrinks, relative to a first-order construction, by a factor determined by skewness and kurtosis. At level 5%, the largest null ever-crossing rate was 4.63%; on two zero-inflated-lognormal families median stopping times fell by 36.8-45.8%. When the moments are calibrated on an independent reference sample, a centering-robust factor keeps exact coverage at a closed-form width cost: the median gain was 21.6-30.3% for Gamma(2) and lognormal errors with 10^6 reference observations, and a loss of up to 9.9% with 10^4. On public Fermi gamma-ray detector data with a declared stability margin, it crossed at the current location in 1.8% of 225 windows and stopped 30-35% earlier than the calibrated first-order method.

comments
23 pages, 3 figures, 4 tables. Code, frozen configurations and results: https://github.com/SZabolotnii/Ku-Betting-CS-code-supplement
fields
Statistics Theory
pdf ↗ page arXiv:2611.01637 ↗

For a U-statistic with a symmetric kernel of any rank, we offer new upper and lower bounds on its variance, which are uniformly sharper than those established in the classical paper by Hoeffding (1948, Theorem 5.2). Our new bounds have strong optimality properties and can tightly describe how the variance scales with the degree of the kernel. As an application, we leverage our new upper bound to improve an existing Berry-Esseen theorem for the normal approximation of incomplete U-statistics based on Bernoulli sampling, in a computationally frugal regime where the computational budget is much smaller than the available sample size.

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

This article shows how researchers can exploit \textit{locally exogeneous variation} even in the presence of endogeneity, autocorrelation, or spurious correlation. It describes the infill asymptotic properties of generalized least squares estimation with county-level data, Census tract-level data, and similar regional averages, including sufficient conditions for consistency, asymptotic normality, and valid inference.

fields
Statistics Theory
pdf ↗ page arXiv:2611.01854 ↗

We develop an intrinsic framework for inference on conditional Fréchet means with predictors and responses taking values in finite-dimensional Riemannian manifolds. We derive a second-order expansion of the smoothing bias, represented in the tangent space via the logarithm map, and show that this bias can affect first-order inference. We propose Riemannian robust bias correction (RRBC), which estimates the leading smoothing bias using a local quadratic regression in the response tangent space and corrects the estimator through the exponential map. Our leave-one-out (LOO) covariance estimator uses intrinsic displacements between the full-sample and LOO RRBC estimates, accounting for the variability of the estimated bias correction and its covariance with the local linear estimator. We establish asymptotically valid pointwise confidence sets and simultaneous confidence tubes without undersmoothing. Simulations on spheres and symmetric positive-definite matrices show that RRBC can improve coverage when smoothing bias is nonnegligible. Cardiovascular and ocean-current applications illustrate simultaneous hypothesis testing and inference for smooth functionals.

comments
103 pages, 16 figures, 4 tables. Includes supplementary material
fields
Statistics Theory
pdf ↗ page arXiv:2611.01857 ↗

Tensor factor models provide low-dimensional representations of tensor-valued observations while preserving their multiway structure. When these observations are held by different clients, privacy constraints may prevent them from being pooled for centralized analysis. We study estimation of common loading spaces in Tucker tensor factor models under federated differential privacy, allowing heterogeneous sample sizes, privacy budgets, and factor strengths. The proposed method combines private stability testing, Huber aggregation, and Gaussian perturbation at each client with weighted aggregation at the server. We establish non-asymptotic upper bounds governed by a scaled harmonic mean of the squared local error rates, and prove minimax optimality up to logarithmic factors under strong factors, fixed factor ranks, and fixed noise variance. We further develop a private calibration procedure that selects the local tuning parameters and aggregation weights without knowledge of the noise level or client-specific factor strengths. The resulting adaptive estimator preserves the privacy guarantee and attains the error rate obtained with oracle tuning. We illustrate the finite-sample performance of the proposed estimators through simulation experiments and an application to a Meditation Traits EEG dataset.

comments
70 pages
fields
Statistics Theory, Information Theory
pdf ↗ page arXiv:2611.01903 ↗

We study the weighted taper arising in Thomson's multitaper F test, which is constructed from pre-plunge discrete prolate spheroidal wave functions (DPSWF). Numerical evidence suggests that, in the asymptotic regime, the Fourier transform of this taper converges to a delta measure supported at the origin. We provide a rigorous theoretical justification for this behavior.

fields
Statistics Theory, Classical Analysis and ODEs
pdf ↗ page arXiv:2611.01941 ↗

A clinical trial must learn which treatment is superior while sparing its participants from the inferior one. Kundu et al. 2025 recently showed that a purely deterministic rule, which always assigns the treatment with the larger current sample mean, achieves a strong form of this ethical goal. The smaller allocation count stays almost surely finite and has all moments bounded uniformly in the sample size. Deterministic allocation is, however, predictable, and predictability invites selection bias. We ask whether this bounded-exposure phenomenon survives once the deterministic rule is replaced by a smooth randomized one. We show that it does not. Under any fixed non-degenerate symmetric randomization, both treatments are sampled infinitely often, the adaptive sample means are strongly consistent, and the inferior treatment draws a strictly positive limiting allocation proportion. Consequently, the inferior allocation count grows linearly and its moments are unbounded. We then study annealed randomization, in which the randomization scale cools with the accumulated information, and obtain summability and divergence criteria that separate finite, sublinear, and linear exposure. A forced-exploration variant identifies the superior treatment with probability one while keeping the inferior exposure sublinear, and thereby frees the annealed guarantees from any correct-stabilization event. We also treat normalized multi-treatment rules, ties, indifference zones, unequal variances, general response distributions, and local alternatives. Finally, we develop the post-trial asymptotic inference that each exposure regime permits. The results delineate the trade-off between allocation concealment, persistent exploration, and ethical concentration on the superior treatment.

fields
Statistics Theory
pdf ↗ page arXiv:2611.02012 ↗

Spectral shrinkage encompasses a broad family of estimators for high-dimensional linear regression that regularize estimation and prediction by applying spectral filters to the sample covariance matrix. Despite its widespread use, achieving oracle-optimal prediction risk under general covariance structures remains challenging, as the oracle filter requires unknown population quantities and has a closed form only for specific covariance models such as isotropic and spiked models. We propose \textit{risk-targeted Krylov fitting} (RTK), a data-driven spectral estimator that adapts to the unknown covariance structure and attains the oracle risk asymptotically. Like partial least squares, RTK operates in an $m$-dimensional Krylov space, but it targets the oracle risk directly by minimizing the leave-one-out risk, which we compute exactly without refitting the model $n$ times. Under general distributions and covariance structures, RTK attains the optimal prediction risk in the Krylov space up to $O(1/n)$. Furthermore, its risk approaches that of the optimal analytic filter with $m$ of order $\log n$. In simulations over a wide range of covariance structures, RTK and a truncated variant were robust to the choice of $m$ and consistently among the spectral estimators closest to the oracle. In applications to single-cell sequencing data and large-scale neural recordings, the proposed methods achieved higher prediction accuracy than competing estimators on most tasks.

fields
Statistics Theory
pdf ↗ page arXiv:2611.02122 ↗

When testing a composite null $\mathcal{P}$ against a composite alternative $\mathcal{Q}$, it has been known since Huber and Strassen (1973) that if a least favorable distribution (LFD) pair exists, then a version of its likelihood ratio yields a minimax optimal test, and Huber (1965) derived a similar result in the sequential setting for a specific robust testing problem that is the focus of the current paper; the same likelihood ratio is log-optimal in the worst case; its expected logarithm under the alternative equals $\inf_{P \in \mathcal{P},S \in \mathcal{Q}} KL(S\|P)$, whose inverse also determines the stopping time of the test under the alternative. These results focus on optimizing worst-case performance, but the resulting methods have lower power if the data come from simpler alternatives. This paper studies an arguably more practical goal of achieving asymptotic \emph{instance optimality} for ``power-one'' sequential tests, which remarkably may even be possible when $\mathcal{Q} = \mathcal{P}^c$. This means that when the data are drawn from any $S \in \mathcal{P}^c$, the test has power one, and its stopping time is determined by the larger information number $\inf_{P \in \mathcal{P}} KL(S\|P)$, which governs the performance of an oracle that knows $S$. To demonstrate this point, our paper focuses on the case of testing a TV ball around a discrete distribution with $d$ components, and designs a computationally and memory efficient algorithm that is also asymptotically instance-optimal. Specifically, we consider two different asymptotic settings: one is the "Wald setting", where the type-1 error level $α$ approaches zero for a fixed alternative $S$ and the second is the "Farrell setting", where $α$ is fixed and $\inf_{P \in \mathcal{P}} KL(S\|P)$ approaches $0$. Our sequential test is simultaneously optimal in both regimes.

fields
Statistics Theory
pdf ↗ page arXiv:2611.02130 ↗

One of the earliest techniques in multivariate analysis, Principal Component Analysis (PCA) remains among the most popular ones in the area. PCA, however, is a linear and bidirectional technique (principal directions $\pm\mathbf{u}$ are defined up to a sign), which is fine under Gaussian or elliptical assumptions but constitutes a major limitation outside that restrictive context. This has prompted the development of numerous nonlinear approaches. We show here how recent results in measure transportation allow for a nonlinear and strictly directional (disentangling $\mathbf{u}$ and $-\mathbf{u}$) concept preserving the intuitive interpretation of the classical linear concept by maximizing expected squared arc lengths along data-driven principal curves rather than principal directions.

comments
75 pages including the Supplementary Material
fields
Statistics Theory
pdf ↗ page arXiv:2611.02158 ↗

This paper focuses on the conditional consistency of the bootstrap. The target is the conditional law of a statistic given a common shock, and the bootstrap approximates it by the law of a resampled statistic conditional on the shock and the data. We call the bootstrap consistent if these laws are close in the Kolmogorov distance for almost every realization of the shock. The conditioning $σ$-algebras are allowed to be unrelated across sample sizes, and both the comparison law and the dimension of the data may vary with the sample size. We give sufficient conditions for consistency in this sense, show that they yield asymptotically correct conditional coverage for bootstrap quantiles, and provide a finite-sample bound on the coverage error. We also relate the Kolmogorov formulation to the merging of probability measures. The results are specialized to statistics depending smoothly on an estimator or on an estimated nuisance parameter.

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

Causal modeling of discrete-time processes often involves the assumption that the modeled processes are stationary. A general class of linear causal models for discrete-time stationary processes are structural equation processes (SEP), which generalize the well known structural equation model for i.i.d. observations. In this paper, we extend the SEP model from stationary to $P$-stationary processes, which are non-stationary processes whose $P$-periodically sampled subprocesses are jointly stationary. We will use this model to approach the problem of causal effect identification under temporally incomplete observations from a graphical modeling perspective. To have a notion of generic identifiability, we restrict our analysis to $P$-stationary structural vector autoregressive (SVAR) processes, which are SVAR processes whose underlying coefficients can vary $P$-periodically over time. Our findings allow to detect, in any given temporally incomplete observational setting, if a certain set of instrumental processes qualifies to identify a causal effect between $P$-periodic subprocesses, and if this is the case, that effect admits an explicit expression as a rational function evaluated at the observational spectral density.

comments
35 pages
fields
Statistics Theory
pdf ↗ page arXiv:2611.02252 ↗

We consider classification in high-dimensional feature spaces where only a vanishing fraction of features are useful and the number of classes may be large. While this rare-and-weak useful-feature regime is well understood in the binary setting, its multiclass version raises new questions: a feature can be useful for class discrimination without separating any specific pair of classes. We focus on a rare feature diversity model, in which most features are useless, but a small fraction promote discrimination among classes in a way that can be detected by a per-feature diversity test, such as one-way ANOVA or the Kruskal-Wallis test. For this setting, we propose Diversity Pursuit Higher Criticism Thresholding (DP-HCT), a feature-screening procedure that applies a higher-criticism threshold to the collection of p-values obtained from per-feature diversity tests. We justify DP-HCT under a Gaussian multiclass Rare-and-Weak Useful Feature model with class-mean contrasts of fixed magnitude in random directions, extending the binary model of Donoho and Jin (2008). When the number of classes is fixed, our model recovers the binary phase transition. When the number of classes grows logarithmically with the number of features, however, we derive a new and strictly harder phase transition, driven by the growing degrees of freedom and their effect on the useful-feature tail rate. We show that whenever classification beyond chance is possible, DP-HCT with ANOVA, followed by a simple classifier based on similarity to class means, achieves asymptotically perfect accuracy. Experiments on real multiclass classification benchmarks demonstrate substantial improvements, and numerical simulations confirm that the derived phase-transition curve accurately predicts the finite-sample behavior of DP-HCT in the growing-class regime.

comments
Accepted at NeurIPS 2026. 43 pages, including references and supplementary material
fields
Statistics Theory
pdf ↗ page arXiv:2611.02255 ↗

This paper presents a near-quadratic-time algorithm that correctly matches almost all nodes of two correlated Erdős-Rényi graphs without any incorrect matches. Each graph has average degree $λ$ and its edges are subsampled from a common parent Erdős-Rényi graph with $n$ nodes, with subsampling probability $s$. The nodes of one graph are then relabeled by an unknown permutation. The algorithm is built on a test for correlated versus independent Galton-Watson trees with approximated likelihood ratios. For every constant $s>\sqrt{C_{\mathrm{Otter}}}$, where $C_{\mathrm{Otter}}\approx0.338$ is Otter's tree-counting constant, and every $λ=ω(1)$ with $λ=(\log n)^{O(1)}$, the algorithm outputs a partial matching of size $n-o(n)$ that contains no incorrect matches with high probability. If, in addition, $λs\ge(1+ε)\log n$ for a constant $ε>0$, a seeded completion step recovers the permutation exactly. In both cases, the time complexity of the algorithm is $n^{2+o(1)}$ with high probability, whereas previous polynomial-time algorithms with the same guarantees either have a time-complexity bound whose exponent goes to $\infty$ as $s$ approaches $\sqrt{C_{\mathrm{Otter}}}$ from above, or apply only when $s$ is close to $1$.

comments
67 pages, 3 figures
fields
Statistics Theory
pdf ↗ page arXiv:2611.02281 ↗

We develop a high-dimensional Lagrange multiplier (LM) test for cross-sectional independence in Gaussian panels with a common stationary, short-memory temporal covariance matrix. The statistic is based on the trace of the square of R, where R is the sample correlation matrix. When the cross-sectional and time dimensions grow proportionally, we derive explicit expansions for the null mean and variance in terms of temporal spectral moments. Random diagonal normalization produces a non-negligible centering correction, while squared sample correlations sharing a cross-sectional unit contribute an additional variance term. Both corrections vanish under temporal independence. We establish a central limit theorem under the null, consistency against fixed alternatives, and a Gaussian-shift limit with a detection boundary under local alternatives. Monte Carlo experiments examine the size and power of the oracle test and feasible versions that estimate the temporal spectral moments. The asymptotic theory applies to the oracle statistic; feasible procedures are evaluated numerically.

comments
81 pages
fields
Statistics Theory
pdf ↗ page arXiv:2611.02308 ↗

Large biobanks provide an opportunity to study how associations with related traits vary across age and across their distributions. We propose a quantile regression procedure that jointly groups responses and estimates their shared varying-coefficient curves on conditional percentile scales. An information criterion selects both the number of groups and their membership from grouped B-spline fits. We establish consistent group recovery, curve convergence rates, and feasible pointwise inference after group selection as the spline dimension grows. The analysis distinguishes true curve differences from improvements due to separate spline approximations of a shared curve. Errors in the estimated percentile scales partly cancel in comparisons of pooled and split fits of a shared curve, but can still contribute to the asymptotic variance of the curve estimators. In 127,040 UK Biobank women aged 40 to 70, we grouped nine metabolic traits by their associations with a type 2 diabetes polygenic risk score and found seven groups at the median, compared with three and four at the lower and upper quantiles. The method identifies shared tail associations among traits with distinct median associations, allowing their information to be pooled where the curves agree.

fields
Statistics Theory
pdf ↗ page arXiv:2611.02466 ↗

The Simes test combines marginal p-values to test a global null hypothesis. Whether it controls the type I error for two-sided Gaussian tests with arbitrary covariance remains open. We prove that, for every fixed number $m$ of tests, the rejection probability does not exceed the nominal level when that level is sufficiently small. The same range of levels works for every covariance matrix. Equality holds if and only if the p-values form independent groups with identical values within each group. For $m=3$, a computer-assisted proof establishes validity at $0.05$, and an analytic argument extends it to an explicit interval around $0.05$. As the number $m$ of tests increases, we prove validity in two settings: each test statistic is correlated with at most a fixed number of others; or the statistics form independent blocks whose sizes grow sufficiently slowly, at a specified rate of order $\log\log m$. Both settings allow arbitrary correlations within these restrictions. For any fixed $0<a<1$, validity holds for every $m$ above a threshold $M$ and every level $0<α\le a$; the same $M$ works for all allowed covariances. Further results quantify the difference between the nominal level and the rejection probability, and permit more correlated neighbors when their correlations are bounded away from $\pm1$. We do not obtain numerical values for the general small-level cutoffs or the required number of tests.

comments
140 pages
fields
Statistics Theory
pdf ↗ page arXiv:2611.02513 ↗

The Johnson-Lindenstrauss (JL) lemma and its extensions provide tools for solving the $L_2$ regression problem in high-dimensional settings with $n>d$, by transforming a subspace of $\mathbb{R}^{n}$ to a subspace of $\mathbb{R}^{m}$, (where $m<n$) while approximately preserving the norms of elements of the subspace. In this paper, we study the theoretical guarantees made by various JL-based subspace embeddings critically and concretely to gauge their practical applicability. We derive concrete versions of results on subspace embeddings in the literature to establish lower bounds on the reduced dimension as well as to concretely analyze the complexity of the Fast JL, OSNAP Transforms among other embeddings. These analyses suggest that guaranteeing substantial computational savings while maintaining the accuracy of the sketched solution requires data dimensions larger than those typically encountered in practice. We also see that, for practically necessary accuracy requirements or for sparsity requirements for computational gain, existing theoretical guarantees lead to substantially large reduced dimensions. This leads to very stringent data requirements for establishing guarantees of any kind.

fields
Statistics Theory
pdf ↗ page arXiv:2611.02808 ↗

A reduced experiment can have vanishing minimax risk yet lose arbitrarily much precision relative to full observation. We determine when growing reductions preserve target-specific minimax precision, their exact cost, and which omissions can remain without increasing that cost. For Gaussian sequence reductions, we give necessary and sufficient criteria for bounded relative risk and losslessness. With parameter-dependent information, sampling difficulty and unresolved target variation draw on the same parameter budget. We prove that the exact global asymptotic minimax risk is the maximum scalar interval-decision risk over their jointly attainable frontier under a Sobolev constraint. This identity shows that positive ambiguity at the inverse-square-root sample-size scale can preserve the full-observation minimax constant. Under the corresponding full-experiment risk match, a sharp boundary criterion determines when critical-order resolution suffices for losslessness. A quadratic Poisson budget yields an exact threshold and quadratic risk onset under a stated information condition. Across Poisson power budgets, separate-maxima planning incurs a diverging asymptotic coordinate-budget factor near full precision, both with a positive lossless threshold and with zero threshold but higher-order risk onset. Finite-sample calculations and conditional medical-data and classifier audits distinguish the effects of observation coverage and repeated measurement.

comments
70 pages, including supplementary material
fields
Statistics Theory
pdf ↗ page arXiv:2611.02914 ↗

Confirmatory trials may seek efficacy claims in a prespecified subgroup and the full popu- lation, although benefit outside the subgroup is uncertain. We measure power loss relative to the marginal level-α test available if the population to protect were known, using the same experiment. In a bivariate Gaussian model with known covariance, we minimise the largest power loss, or regret, over prespecified ranges of target and non-target effects, subject to strong familywise error control and coordinatewise monotonicity. We optimise over monotone closed- testing procedures with fixed marginal tests, allowing randomisation in the shared intersection test. Monotonicity places the worst non-target mean at its lower planning bound for each target effect. On the resulting reduced planning set, every least-favourable distribution is supported on exactly two efficacy scenarios, one for each target population. Under a condition on the effect ranges and covariance, the minimax procedure is nonrandomised and unique up to null sets. An integral criterion characterises exactly when a calibrated step-up procedure attains the minimax value within this class. Bounds for the continuous problem quantify possible improve- ments over simple procedures. An asthma planning example illustrates power allocation and the compatibility of target assignments with treatment benefits and burdens.

fields
Statistics Theory
pdf ↗ page arXiv:2611.03155 ↗

Causal mediation analysis is an important tool for understanding how a treatment affects an outcome through intermediate variables referred to as mediators. However, in many applications, these mediators and pre-treatment covariates are not directly observed and are instead measured through noisy, high-dimensional surrogates. Mediation analysis when such latent variables are observed only through these surrogates remains less explored. In this paper, we propose Factor-Adjusted Regression for Mediation Analysis (FARMA), a factor-based framework for estimating direct and indirect effects when either one or both of the mediators and relevant pre-treatment covariates are latent. FARMA uses the surrogate measurements to recover information about the underlying latent variables. Under a latent factor structure, we show that the direct and indirect effects are approximately identified, with an approximation error that vanishes as the surrogate dimensions grow. We further show that our estimator is $\sqrt{n}$-consistent and asymptotically normal. We combine the theory with extensive simulation studies and apply it to data from the Alzheimer's Disease Neuroimaging Initiative (ADNI) study, where we investigate whether the effect of depressive symptoms on cognitive impairment is mediated through the latent process underlying high-dimensional DNA methylation measurements.

fields
Statistics Theory
pdf ↗ page arXiv:2611.03167 ↗

Marginal permutation is exact for testing marginal independence but generally invalid for conditional independence because it breaks the dependence between the exposure ($\bm X$) and covariates ($\bm Z$). In this paper, we show that empirical studentization can nevertheless make this deliberately misspecified resampling scheme asymptotically valid for important conditional independence tests based on scores. The resulting procedures are novel in the sense that they are valid in finite samples when the exposure is marginally independent of the outcome ($\bm Y$) and covariates, and asymptotically valid under the broader conditional independence null, $\bm X\indep \bm Y\mid \bm Z$, subject to method-specific conditions. For generalized linear model scores, separately studentizing the observed and permuted scores yields validity under a correctly specified null mean despite \emph{arbitrary} conditional variance misspecification. Moreover, the permutation calibration also applies to tests based on generalized and projected covariance measures. Their validity accommodates machine learning nuisance estimates under a condition on the stability of refitting after permutation, for which we provide sufficient conditions for common regression learners. Permutation calibration preserves first-order local power while better capturing the finite-sample discreteness and skewness induced by sparse observations. Simulations and single-cell CRISPR screen analysis show substantial calibration gains with our methods when effective sample size is small.

fields
Statistics Theory
pdf ↗ page arXiv:2611.03255 ↗

In 1962, Shepp famously discovered a product of normal random variables that preserves normality. The Shepp product, which takes the form $XY/\sqrt{X^2 + Y^2}$, has since been thoroughly studied and has found numerous connections to other areas of statistics. Among other things, it has an extension to $n$ normal variables, gives a multiplicative analogue of the central limit theorem, and applies rather unexpectedly to genomics as a test statistic for alignment-free sequence analysis. The Shepp product is evidently the $p =2$ special case of $XY/\sqrt[p]{X^p + Y^p}$ that we call the Shepp $p$-product. We will show that the Shepp $p$-product, particularly when $p = 1$ and $p = \infty$ (the latter in a limiting sense), is no less fascinating and applicable than the original $p = 2$ case. Just as the Shepp $2$-product preserves normal distributions, the Shepp $1$-product preserves Cauchy distributions, and the Shepp $\infty$-product preserves exponential distributions. In fact, the converse is also true in an appropriate sense, allowing us to characterize the Cauchy, normal, and exponential distributions as the unique distributions preserved by the Shepp $p$-product for $p =1,2,\infty$, respectively. We will study the multiplicative analogue of infinite divisibility with respect to the Shepp $p$-product, establish an asymptotic theory for the Shepp $p$-product of $n$ i.i.d.\ random variables, and estimate the rates of convergence in Kolmogorov distance. Some of our results are new even for the $p=2$ case. We will also discuss new applications of the Shepp $p$-product in statistics, computational biology, and statistical physics. In particular, our new test statistic for exponentiality based on the Shepp $\infty$-product is more powerful, both theoretically and empirically, than the rule-of-thumb Kolmogorov–Smirnov test based on the relative efficiency.

comments
35 pages
fields
Statistics Theory
pdf ↗ page arXiv:2611.03282 ↗

Calibrated multiaccuracy asks that a predictor be globally calibrated and multiaccurate with respect to a bounded test family $G$; that is, its residuals should be uncorrelated with every test $g(x)\in G$. This weakening of multicalibration suffices for many applications. Its sample complexity was not known to improve on that of full multicalibration, which is $\widetildeΘ\left(\frac{\log|G|}{\varepsilon^2} + \frac{1}{\varepsilon^{3}}\right)$ when $|G|$ is at least a sufficiently large power of $\log(1/\varepsilon)$. We resolve the sample complexity of $\varepsilon$-calibrated multiaccuracy, showing that it scales as $$ \widetildeΘ\left(\frac{\log|G|}{\varepsilon^2} + \frac{1}{\varepsilon^{5/2}}\right), $$ separating it from the complexity of multicalibration. The upper bound is obtained by an algorithm that outputs a randomized predictor. For deterministic predictors, we establish the tight rate $$ \widetildeΘ\left( \frac{\log|G|}{\varepsilon^2} + \frac{(\log|G|)^{1/3}}{\varepsilon^{8/3}} \right) $$ whenever $\log|G|=Ω(\log(1/\varepsilon))$. When $\log|G|\le\varepsilon^{-1+κ}$ for any fixed $κ\in(0,1)$, this rate is polynomially larger than the rate for randomized predictors. Thus, unlike for multicalibration, calibrated multiaccuracy exhibits a genuine sample-complexity separation between deterministic and randomized predictors. The matching upper and lower bounds show that the unusual cube-root dependence on $\log|G|$ is intrinsic. At $\log|G|\asymp\varepsilon^{-1}$, the minimax rates for randomized and deterministic calibrated multiaccuracy both coincide with the minimax rate for multicalibration.

fields
Statistics Theory
pdf ↗ page arXiv:2611.03305 ↗

Asymptotic independence between sum-type and maximum-type statistics arises repeatedly across many areas of probability and statistics, particularly in high-dimensional testing and random matrix theory. Motivated by the shared structure underlying existing proofs, which is obscured by their model-specific formulations, this note isolates a common intermediate principle. We introduce a finite-exceedance dependence principle: if the finite-exceedance dependence error vanishes at every fixed order and high-order exceedances are mildly controlled, then a finite-order Bonferroni argument yields asymptotic independence between the sum and the maximum. We further give an independent-proxy criterion for verifying this: for each finite set of exceedances, it suffices to construct an exactly independent proxy for the sum-type statistic whose approximation error is negligible in aggregate. Local deletion under dependency graphs and Gaussian regression and residualization are two examples. The framework gives modular derivations of existing sum–max independence results.

comments
28 pages
fields
Statistics Theory
pdf ↗ page arXiv:2611.03351 ↗

This paper studies a partially linear semiparametric additive model that allows for interactions among variables in high-dimensional settings. We propose the Specification LASSO (S-LASSO), a two-step method that integrates LASSO and Adaptive Group LASSO to simultaneously perform variable selection and model specification. Theoretically, we establish that S-LASSO possesses oracle properties in terms of selection consistency and asymptotic normality. Monte Carlo simulations confirm that S-LASSO outperforms existing alternatives across a variety of scenarios. Empirically, we apply S-LASSO to a characteristics-based asset pricing model, exploring the linear and nonlinear effects of asset-specific characteristics on cross-sectional returns, as well as their interactions with firm size.

fields
Statistics Theory
pdf ↗ page arXiv:2611.03391 ↗

We study the gradient query complexity of sampling from a density $π(x)\propto\mathrm{e}^{-V(x)}$ on $\mathbb{R}^d$, where $V$ has a $β$-Lipschitz gradient but need not be convex. Our approach uses the proximal sampler, which alternates Gaussian perturbation with sampling a position conditional on the noisy observation. We implement its observation chain using the high-order noisy conditional sampler of [OpenAI 2026], obtaining improved dimension dependence under functional inequalities. If $π$ satisfies a log-Sobolev inequality (LSI) with constant $α$, then for every fixed $ν>0$, there is a finite constant $C_ν$ depending only on $ν$ such that the algorithm returns a sample within total-variation distance $\varepsilon$ using at most $C_νκ(d+κ+\varepsilon^{-1}+\|\nabla V(x_0)\|^2/β)^ν$ queries, where $κ=β/α$ and $x_0$ is an arbitrary reference point for initialization. The analysis controls center-dependent local errors along exact proximal histories and removes the final observation noise by conditional decoding. Under a Poincaré inequality (PI), we obtain a corresponding guarantee from a warm start with a known bound on its Rényi divergence. An oracle lower bound shows that a stationary point alone, which suffices under LSI, is insufficient under PI.

fields
Statistics Theory
pdf ↗ page arXiv:2611.03442 ↗

We consider nonparametric maximum likelihood estimation of the intensity function of a Poisson process, allowing the intensity to depend on observed covariates. Such models describe how event rates vary with external conditions, including conditions under which the intensity becomes arbitrarily small or vanishes. However, risk analysis based on the Kullback-Leibler (KL) divergence typically requires the true intensity to be bounded away from zero, a restrictive assumption in applications. We develop a unified approach that avoids this assumption and derive an oracle inequality for the covariate-averaged Hellinger distance between the true intensity and the nonparametric maximum likelihood estimator (NPMLE). As an application of the oracle inequality, we establish convergence rates for NPMLEs based on deep neural networks (DNNs). Our results show that, as in nonparametric regression, the ability of DNNs to capture underlying structure leads to improved convergence rates. Specifically, DNN-based NPMLEs mitigate the curse of dimensionality when the true intensity has a compositional structure and automatically adapt to a low-dimensional Riemannian manifold structure of the event space. For intensity functions with a compositional structure, DNN-based NPMLEs achieve nearly minimax-optimal convergence rates without explicitly incorporating this structure into the network architecture. Simulations demonstrate that DNN-based estimators outperform kernel estimators in most settings, while manifold kernels remain competitive in some designs. Finally, we analyze stimulus-evoked neural spiking using data from the Allen Brain Observatory Visual Coding Neuropixels project. DNN-based NPMLEs provide better out-of-sample performance than a conditional kernel estimator, as evaluated by held-out log-likelihood.

comments
59 pages, 13figures
fields
Statistics Theory
pdf ↗ page arXiv:2611.03552 ↗

In completely randomized experiments with heavy-tailed outcomes, a few units can carry a share of the residual variation that does not vanish as the number of units grows. We study the studentized difference in means and Lin's regression-adjusted estimator, with covariates whose leverage vanishes, when the finite population is fixed, and the treatment assignment is the only source of randomness. The studentized statistic then has a nonnormal limit in general. Populations with the same marginal distributions of potential outcomes can have different limits, as the limit depends on the unobserved pairing mechanism of the two potential outcomes of each dominant unit. When the outcome errors are drawn from a heavy-tailed law, the limit is random and, outside a degenerate case, varies with the population. Under balanced allocation, the conventional Wald interval has an explicit asymptotic coverage floor. At the nominal level $0.95$, the floor is about $0.42$ for every population and about $0.84$ when the two potential residuals of each unit are equal. Both floors are close to the best possible, and without balanced allocation, the coverage can fall to the smaller of the proportions of treated and control units.

fields
Statistics Theory
pdf ↗ page arXiv:2611.03561 ↗

Differential Geometry47

We classify all four-dimensional semi-homogeneous convex cones, i.e., closed, pointed, full-dimensional cones whose connected automorphism group has principal orbits of codimension at most one. On such cones, the Monge-Ampère equation defining the canonical barrier reduces to an ordinary differential equation. This makes this barrier computationally accessible. The semi-homogeneous cones can then be used in modeling by conic programs. An obvious subset of such cones are the homogeneous cones. The key point allowing the classification is that for all other cones, the automorphism group has a three-dimensional subgroup acting locally faithfully on the principal orbits. This subgroup must have a Lie algebra which is either abelian or a direct product of a 1-dimensional algebra and a two-dimensional algebra generated by $A,B$ satisfying $[A,B]=B$. In both cases we classify all 4-dimensional representations up to isomorphism, and for each representation all invariant convex cones. For every cone an orbit invariant is computed.

fields
Differential Geometry
pdf ↗ page arXiv:2611.00101 ↗

We show that the blowdown shrinking Ricci soliton of Feldman, Ilmanen and Knopf is strictly dynamically stable in the following strong local sense: (1) The Ricci flow from every metric on a closed 4-manifold containing a region close to a rescaling of a sufficiently large compact subset of the soliton in either orientation and with controlled geometry elsewhere develops a singularity with unique tangent flow modeled on the soliton. (2) The singular time slice has an isolated conical singularity, and by Gianniotis-Schulze the flow can be continued by blowing down a sphere of self-intersection $\pm1$. (3) On a closed 4-manifold, the set of metrics whose Ricci flows have their first singularity modeled on the soliton is $C^{14}$-open. It is nonempty if and only if the manifold contains a sphere of self-intersection $\pm1$. (4) The soliton is strongly rigid among shrinking Ricci solitons. As applications, we construct $C^{14}$-open sets of initial data whose Ricci flows perform any prescribed ordered sequence of blowdowns. (1) Every closed simply connected smooth 4-manifold, including spin and exotic examples, can be reached by Ricci flow from a standard $k\mathbb{CP}^2\#\ell\overline{\mathbb{CP}}{}^2$, through finitely many blowdown singularities. (2) On the standard $2\mathbb{CP}^{2}\#9\overline{\mathbb{CP}}{}^{2}$, there are infinitely many open sets of initial metrics whose Ricci flows, after a single blowdown, reach pairwise nondiffeomorphic manifolds. The proof uses the spectral analysis of Naff and the second author and deals with the gauge-fixing problem along Ricci flow through a Ważewski argument inspired by Stolarski. We also use Bamler-Lai's PDE-ODI principle. Except for continuation (requiring nonnegative curvature of the asymptotic cone), all results apply to linearly stable nonflat asymptotically conical shrinkers in all dimensions.

comments
48 pages
fields
Differential Geometry, Analysis of PDEs, Geometric Topology
pdf ↗ page arXiv:2611.00139 ↗

We prove that standard $k$-bubbles uniquely minimize perimeter in $\mathbb R^n$ and $\mathbb S^n$ for $n\ge2$ and $1\le k\le n$, and that standard double bubbles uniquely minimize perimeter in $\mathbb H^n$ for $n\ge3$. For nonnegative curvature, the proof combines the structure and spectral theory of Milman–Neeman with a uniform semialgebraic exceptional set, an almost-everywhere profile comparison, and localized variational arguments. A curvature-variable lift gives a uniformly elliptic comparison at the Euclidean limit. The independent hyperbolic argument uses the rotational structure of Cotton–Freeman, a scalar meridian force potential, and a transverse conformal variation. The critical range $k=n+1$ in $\mathbb R^n$ and $\mathbb S^n$, and hyperbolic clusters with more than two finite cells, are not covered.

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

We study the splitting problem for complex supermanifolds using formal exponential maps and Ehresmann connections. We show that every formal exponential map induces a splitting of the underlying supermanifold. Furthermore, we establish that every Ehresmann connection determines a linearization of the infinite jet space, extending the corresponding construction for ordinary manifolds to supermanifolds. For Ehresmann connections preserving the zero section, we construct a formal exponential map in two ways: via the linearization of the infinite jet space and directly from the connection operator. We prove that both constructions yield the same map and induce the same splitting, thereby generalizing Koszul's splitting theorem from linear connections to zero-section-preserving Ehresmann connections. Finally, we provide examples showing that, without this assumption, the two constructions may yield different splittings, or one or both of them may fail to induce a splitting.

fields
Differential Geometry, Mathematical Physics, Complex Variables
pdf ↗ page arXiv:2611.00331 ↗

This is the first of several papers devoted to the classification of coisotropy-one homogeneous spacetimes. It is the first step in extending the classification of spatially isotropic homogeneous spacetimes of kinematical Lie groups to the much vaster context of homogeneous spacetimes that are not spatially isotropic; that is, where the rotations no longer act transitively on the space of directions in each tangent space. In this first paper we classify (up to isomorphisms preserving the rotational subalgebra) a class of the relevant transitive Lie algebras, the so-called (3,2)-kinematical Lie algebras, for the coisotropy-one case in spatial dimension at least 4. As a by-product of this classification, we classify two-dimensional real representations of Bianchi Lie algebras up to a suitable notion of equivalence.

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

The Deep Linear Network (DLN) is a simple version of a Multilayer Perceptron (MLP) in which the activation function is the identity and the bias vector is the zero vector. We examine the behavior of the model when the number of weight matrices, which is finite in the original model, goes to infinity. We show that a plausible continuum limit is a dimensionally reduced version of the Yang-Mills equation on the torus, revealing an unexpected geometric interpretation of infinite-depth DLNs. While we do not prove this rigorously, it is a very pretty calculation. It also gives some insight into several features of the construction. We note that the choices of boundary conditions on the ends of the discrete series survive better in the continuum limit. Also, the regularizing functional which uses the moment map survives nicely in the continuum limit, whereas the regularizing functional using the size of approximating terms has no sensible limit. This surely is useful information for the choices we make in the finite-dimensional theory, and might also be useful in the more complicated MLP setting.

fields
Differential Geometry
pdf ↗ page arXiv:2611.00503 ↗

The structure of the Poisson cohomology groups for scalar Poisson brackets of Dubrovin-Novikov type with $D$ independent variables has been first described in arXiv:1512.05744 ; in that work, a complete dimensional counting was provided for $D=2$, and some numerical results exhibited for $D=3$, $D=4$. Here, we prove a formula for the dimensional counting of the Poisson cohomology for arbitrary $D$. Moreover, we show how to obtain canonical representatives for each cohomology class.

comments
18 pages
fields
Differential Geometry, Mathematical Physics
pdf ↗ page arXiv:2611.00531 ↗

We develop a weighted scalar spectral geometric description of Sacks-Uhlenbeck $α$-harmonic maps into round spheres and identify its convex geometry realization for $α$-harmonic diffeomorphisms onto the round $2$-sphere. More precisely, we establish a one-to-one correspondence, modulo orientation preserving isometries of $\mathbb{S}^2$, between orientation preserving $α$-harmonic diffeomorphisms onto the round $2$-sphere and positive Codazzi tensors satisfying a determinant bound and a compatibility condition with the prescribed metric on $\mathbb{S}^2$. These tensors are the radii tensors of auxiliary strictly convex surfaces, and the weighted scalar forms in spectral geometry equal $-α$ times the second variations of the enclosed volumes with respect to the support functions. Using these spectral geometry and convex geometry results, we prove a sharp Morse index characterization of isometric equatorial parametrizations among $α$-harmonic $2$-spheres in the round $n$-sphere. We also prove that every $α$-harmonic diffeomorphism between unit round $2$-spheres is orthogonal for all $α>1$. Equivalently, the only admissible positive Codazzi tensor whose reconstructed metric on $\mathbb{S}^2$ has Gaussian curvature $1$ is $(κ+2)^{α-1}\bar{g}$, where $\bar{g}$ is the unit round metric.

comments
76 pages. Comments welcome!
fields
Differential Geometry, Analysis of PDEs, Spectral Theory
pdf ↗ page arXiv:2611.00642 ↗

We establish a local higher regularity theorem for the homogeneous complex Monge-Ampere equation on $X\times D$, where $X$ is a complete, possibly noncompact Kahler manifold and $D\subset\mathbb C$ is the unit disc. For a bounded weak solution given by the Perron envelope, we prove higher regularity on a smaller spatial domain when the smooth boundary data are locally small. The geometric hypotheses require uniformly convex local Kahler potentials and a local barrier threshold sufficiently large relative to the global $L^\infty$ bound of the solution. We also obtain quantitative local Holder estimates. The proof combines a perturbative construction of local holomorphic disc foliations with a construction of global subsolutions using convexity and barriers. A key analytic difficulty is the loss of Holder regularity in the construction of holomorphic disc families, which we address using BMO estimates and Nash-Moser-Zehnder theorems. Comparison along the discs identifies the local smooth solution by holomorphic discs foliation with the global weak solution. We apply the theorem and its proof to compact Kahler manifolds and to ALE, ALF, and asymptotically complex hyperbolic (ACH) ends. Under the stated geometric and decay assumptions, we obtain higher regularity of each prescribed order sufficiently far out, together with weighted Holder estimates preserving the boundary decay.

comments
57 pages. Comments are welcome!
fields
Differential Geometry, Analysis of PDEs, Complex Variables
pdf ↗ page arXiv:2611.00736 ↗

We study spatial Hessian degeneracy along weak Kähler geodesics. We construct examples in three settings: (1) On every compact Kähler manifold, the spatial form degenerates on a nonempty open set during an interior time interval, although both endpoints are smooth and strictly Kähler. (2) On ALE Kähler manifolds with a holomorphic quotient end and a decaying potential to the Euclidean metric, spatial degeneracy occurs on open regions arbitrarily far along an unbounded horn. (3) For cone and Poincaré endpoint metrics along a smooth divisor, normal spatial degeneracy occurs on open sets approaching the divisor. Both cone endpoints retain the prescribed angle. The first construction answers negatively the spatial-positivity question recorded in Darvas's survey. The ALE and divisor constructions show that weak geodesics need not preserve the asymptotic behavior of the endpoint metrics.

comments
38 pages, 3 figures. Comments are welcome!
fields
Differential Geometry, Complex Variables
pdf ↗ page arXiv:2611.00744 ↗

We examine the differential geometry of Lie semiheaps that admit biunital elements. Open Ol'shanskii semigroups, which appear widely across causal geometry and harmonic analysis, provide a large class of examples. It is shown that the subset of biunits is a smoothly embedded Lie subheap. Moreover, there is a canonical Lie triple algebroid associated with any proper biunital Lie semiheap. That is, there is a vector bundle over the manifold of biunits that comes equipped with a ternary bracket that satisfies the axioms of a Lie triple system together with a compatible `higher' anchor map. Although every Lie triple algebroid associated with a proper biunital Lie semiheap is trivialisable, it is not canonically so, unlike the case of the tangent bundle of a Lie group. As concrete examples, we examine the Lie semiheap of real $n\times n$ matrices, and the conformal causal Lie semiheap associated with the Lie group $\mathrm{SU}(2,2)$, which is a double cover of the conformal group of Minkowski spacetime, and the future-directed light cone.

comments
17 pages, comments welcomed
fields
Differential Geometry, Mathematical Physics
pdf ↗ page arXiv:2611.00812 ↗

We fix a smooth vector field and a positive parameter $m$, and compare the nondegenerate metrics for which the field is conformal or $m$-modified conformal with the same prescribed smooth factor. Metrics of arbitrary signature are allowed. Passing to inverse metrics gives a linear transport equation and an explicit correspondence on the exact nondegeneracy domains. At a regular point, transverse initial data yield a signature-preserving correspondence of metric germs. For a nowhere-zero field and a Killing background in dimension at least three, every metric satisfying the modified conformal equation and differing from the background by a tensor of rank at most one has factor zero; its inverse-metric difference is $rX\otimes X$ for a unique smooth function $r$. Under a complete flow, such global deformations exist precisely when the field is null for the background and admits a smooth function $τ$ with $Xτ=1$. An auxiliary field satisfying $[X,Z]=X$ gives a second correspondence under orthogonality assumptions. Finally, for a nowhere-zero complete field, a Killing metric and a zero-factor modified conformal metric have inverse-metric difference of rank at least two whenever that rank is constant. In the rank-two case, the pair determines a unique auxiliary field. Examples distinguish the roles of dimension, completeness, constant rank, the zero-factor condition, and orthogonality.

fields
Differential Geometry
pdf ↗ page arXiv:2611.00844 ↗

We prove a rigidity theorem for closed connected minimal Tangent-Yang-Mills hypersurfaces in the unit sphere. In every dimension $n\geqslant 3$, such a hypersurface is totally geodesic if the squared norm of its Riemannian curvature tensor is at most $2n(n-1)$.

comments
20 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.00976 ↗

We study the locally conformal geometry of cosymplectic and coorientable contact manifolds within a common algebraic framework based on a non-degenerate odd pair: a one-form and a two-form whose appropriate wedge product defines a nowhere-vanishing top-degree form on an odd-dimensional manifold. We consider conformally compatible local geometric and Hamiltonian data and encode their gluing through a closed Lee form and the Lichnerowicz-de Rham differential. For locally conformal cosymplectic geometry, we introduce an equal-weight formulation in which the defining forms carry the same conformal weight. This formulation allows compatible local Hamiltonian vector fields to glue directly into a global Hamiltonian vector field without additional rescaling, thereby preserving the local dynamics. For contact geometry, we develop a twisted odd-pair formulation in which the Lee form records the conformal gluing of local Hamiltonian data, while the global one-form remains an ordinary contact form. We illustrate these constructions through time-dependent mass dynamics in the cosymplectic setting and dissipative particle dynamics in the contact setting.

fields
Differential Geometry, Mathematical Physics
pdf ↗ page arXiv:2611.00982 ↗

We develop a matching principle for assembling maps from a common manifold into spherical minimal immersions. The equations couple the coefficients to the induced metric and yield examples with nonminimal constituent immersions. We establish existence and uniqueness of matching coefficients under suitable hypotheses and sharp rigidity for complete harmonic assemblies over $\mathbb S^2$. For a Clifford family, the first eigenspace determines the underlying fibration. The principle also produces weighted minimal profiles that generate minimal products in round spheres, with examples formed from finitely many Lawson–Osserman blocks of different degrees over a common Hopf source.

fields
Differential Geometry
pdf ↗ page arXiv:2611.00984 ↗

We study the Poisson chain of the compact spin Calogero-Moser-Sutherland system obtained by conjugation reduction of $T^*\mathrm{SU}(n)$ at a fixed coadjoint orbit. We give a Horn-type condition ensuring that the spectral torus acts freely on the full fiber over a simple spectrum; for each orbit, the admissible spectra form a nonempty open dense set, and the restricted chain is strongly superintegrable of rank $n-1$ on every orbit-type stratum. We also construct, across certain affine spectral walls, a proper quotient map onto a Hausdorff stratified Poisson space with a finite Whitney stratification. For $\mathrm{SU}(3)$, we compute the free spectral domain and the quotient near two intersecting walls, and a zero-orbit example shows that the analogous quotient need not be Hausdorff on the unrestricted reduced phase space.

comments
Guorui Ma is the corresponding auother for this work
fields
Differential Geometry
pdf ↗ page arXiv:2611.01002 ↗

In this paper, we prove that we can subtract the full spectral gap $\left(\frac{N-1}{p}\right)^{p}$ of the $p$-Laplacian and keep the sharp Sobolev constant $S(N,p)$ of $\mathbb{R}^N$ at the same time in a large family of $p$. For $p=2$, this was proved by Benguria, Frank and Loss in dimension three, and it was shown by Hebey to be false in dimensions $N\geq4$. For $p\neq2$, it was proved by Nguyen for $N\geq4$ and $\frac{2N}{N-1}\leq p<N$. By employing, among other tools, a suitable conjugation that maps the radial $p$-Dirichlet integral on $\mathbb{H}^N$ onto its Euclidean counterpart on $\mathbb{R}^N$ while preserving the $L^p$ norm, together with a one-dimensional tangent line inequality, we establish such sharp Poincaré–Sobolev inequalities for $N=3$ and $2\leq p<3$, for $N=4$ and $\frac{1+\sqrt{13}}{2}\leq p<4$, and for $N\geq5$ and $\min\{3,\frac{1+\sqrt{4N-3}}{2}\}\leq p<N$. In particular, in all cases we also obtain an explicit remainder term. Moreover, since the change of function keeps the $L^p$ norm, we prove the sharp logarithmic Sobolev inequalities with the full spectral gap and the sharp Euclidean constant for $N=3$ and $2\leq p\leq3$, and for $N\geq4$ on an explicit interval of $p$. For $p\geq3$, we also use the change of variable $t=\sinhρ$ and the Hardy inequality, which give a second remainder term. At the endpoint $p=N$, this remainder gives a Hardy–Trudinger–Moser inequality on $\mathbb{H}^N$ under a weaker constraint than the one of Liang, Lu, Wang and Yang, in every dimension $N\geq3$. Finally, we show that for $1<p<\frac{1+\sqrt{4N-3}}{2}$, which includes all $1<p<2$, the full spectral gap can still be subtracted with some positive constant in front of the Sobolev term, and that this constant is smaller than $S(N,p)^{p}$ when $p<\min\{2,\sqrt N\}$. Together with our other results, this shows that the full spectral gap can be subtracted for every $1<p<N$.

fields
Differential Geometry
pdf ↗ page arXiv:2611.01161 ↗

We prove that the standard triple bubble uniquely minimizes perimeter among clusters in the hyperbolic plane with three prescribed positive finite areas. The standard family admits global pressure coordinates, and its volume differential is the negative of a positive definite grounded weighted graph Laplacian. A normalized perimeter excess attains a comparison minimum under a perimeter bound and gives a strict comparison between actual and model pressures. Component relabeling reduces the possible topologies to an all-boundary network or a 4-daisy. Discrete comparisons exclude the 4-daisy; pressure-preserving face deletion reduces the remaining network to the standard tetrahedral configuration.

fields
Differential Geometry
pdf ↗ page arXiv:2611.01367 ↗

For every integer $N\ge1$, we construct a smooth closed connected strictly mean-convex rotationally symmetric surface in $\mathbb{R}^3$ whose level set flow remains connected until extinction and has exactly one singular point at each of its first $N$ singular times. These singularities are degenerate neckpinches with the Angenent–Velázquez asymptotics: the leading deviation from the cylinder under parabolic rescaling is a cubic Hermite term.

comments
12 pages, 2 figures. Comments are welcome!
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2611.01419 ↗

We prove a splitting theorem for cosmological spacetimes which admit a globally $p$-harmonic Cauchy temporal function for some $p < 1$, without making any use of timelike lines. In Bartnik's context of cosmological and timelike geodesically complete spacetimes, we establish a Liouville-type unboundedness result which shows that globally $p$-harmonic temporal functions, $p < 1$, are necessarily Cauchy temporal. Moreover, using the theory of elliptic PDEs, we show that locally Lipschitz $p$-harmonic temporal functions with $p < 1$ are in fact smooth. Altogether, our work reduces the resolution of Bartnik's cosmological splitting conjecture to the global weak solvability of the $p$-d'Alembert equation for some $p < 1$ in the class of locally Lipschitz temporal functions.

comments
26 pages
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2611.01456 ↗

We prove that the spectral gap of a Weil–Petersson random hyperbolic surface of genus $g$ with $n=n(g)\ge1$ labelled cusps converges in probability to $1/4$ as $g\to\infty$, for every sequence $n=o(\sqrt g)$. More precisely, for each fixed $0<\varepsilon<1/4$, there are constants $C_\varepsilon\ge2$ and $g_\varepsilon\ge3$, independent of $n$, such that the expected number of nonzero $L^2$ eigenvalues in $(0,1/4-\varepsilon]$, counted with multiplicity and including residual eigenvalues, is at most $C_\varepsilon(n+1)^2/g$ whenever $g\ge g_\varepsilon$ and $g\ge C_\varepsilon(n+1)^2$. This proves a conjecture of Shen and Wu. A matching lower bound shows that the count estimate is optimal up to constants for each fixed $\varepsilon$, and that $n=o(\sqrt g)$ is necessary for convergence of the gap to $1/4$. The proof combines volume estimates uniform in the cusp count with polynomial approximation and a positive trace on truncated surfaces.

fields
Differential Geometry
pdf ↗ page arXiv:2611.01477 ↗

We resolve Topping's diameter conjecture for closed immersed surfaces in Euclidean three-space, building on his recent result for embedded surfaces. More generally, we establish sharp diameter and mean-width estimates for compact connected immersed surfaces, possibly with boundary. As a consequence, we confirm the codimension-one case of the sharp length–diameter conjecture for immersed minimal surfaces.

comments
13 pages, 3 figures
fields
Differential Geometry
pdf ↗ page arXiv:2611.01589 ↗

Double fibration transforms integrate functions over families of submanifolds. We survey the recovery of singularities by both classical normal operator methods and direct analytic methods. We also discuss support theorems, injectivity and applications to geodesic ray transforms, seismic inversion and minimal surface data.

comments
Survey article. Accepted for publication in Extended Abstracts IPMS 2026 Conference - "Inverse Problems: Modeling and Simulation"
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2611.01760 ↗

We study global Calabi flows $g(t)$ on compact Kähler surfaces with a uniform Sobolev constant. For any sequence $t_j\to\infty$, set $g_j(t):=g(t_j+t)$. After passing to a subsequence, these flows converge to an eternal Calabi flow on a compact extremal Kähler orbifold surface. The convergence holds in the spacetime $\hat C^\infty$-Cheeger–Gromov topology: it is uniform in the Gromov–Hausdorff sense on compact time intervals and smooth away from the orbifold singularities, using comparisons fixed in time.

fields
Differential Geometry, Geometric Topology
pdf ↗ page arXiv:2611.01882 ↗

We investigate the contact of regular surfaces in $\mathbb{R}^4$ with spherical cylinders $S^2(r) \times \mathbb{R}$. We introduce cylindrical directions of these surfaces, defined by the axes of spherical cylinders having degenerate contact with the surfaces, and show that these directions capture the ridge condition of projected regular surfaces under orthogonal projection along these directions.

fields
Differential Geometry
pdf ↗ page arXiv:2611.01912 ↗

We study the Morgan–Shalen boundary of holonomy representations of complex projective structures on a compact Riemann surface of genus at least two. We prove that every direction defined by a holomorphic quadratic differential with a multiple zero admits distinct projective marked length limits. Together with Dumas's uniqueness theorem for simple zeros, this gives a complete characterization of directions with unique limits. We also establish that no nonzero abelian length function can occur in the holonomy boundary of any such fixed surface, regardless of the limiting quadratic differential. Finally, we characterize all directional boundary fibers by a necessary-and-sufficient analytic condition involving valued representations and the holomorphic jet bundle underlying an oper.

comments
34 pages
fields
Differential Geometry, Geometric Topology
pdf ↗ page arXiv:2611.01928 ↗

We study global smooth Calabi flows on polarized Kähler surfaces $(M,L)$, assuming uniformly bounded Sobolev constants and the algebraic conditions $χ(\mathcal O_M)=1$ and $c_1(M)\cdot c_1(L)>0$. Using the orbifold compactness theorem, we prove a uniform Bergman estimate, construct a normal test configuration for each geometric limit, and establish uniqueness of the extremal orbifold limit up to polarized holomorphic isometry. K-polystability then identifies the limit with the original surface and gives a constant scalar curvature Kähler metric. We also prove finite-group equivariant versions of these results. Independently of the flow, we obtain a uniform Bergman lower bound for polarized cscK surfaces with bounded volume and Sobolev constants and $|S|\leq1$. We illustrate the hypotheses with nonstationary flows near a product cscK metric on $\mathbb P^1\times\mathbb P^1$ and near Calabi's non-cscK extremal metric on the first Hirzebruch surface. Their controlled-cone energy inequalities follow from elementary calculations and continuity.

fields
Differential Geometry, Complex Variables
pdf ↗ page arXiv:2611.01968 ↗

We prove that on a connected, simply-connected nilpotent Lie group, the notions of left-invariant generalized Ricci soliton, semi-algebraic and algebraic generalized Ricci soliton coincide. Moreover, every such soliton has harmonic torsion. We classify all algebraic solitons with positive definite metric on the five-dimensional Heisenberg algebra, the four-dimensional oscillator algebra and the four-dimensional split-oscillator algebra up to automorphisms and rescalings. We find that there is only a finite number of algebraic solitons, all of which have harmonic torsion.

fields
Differential Geometry
pdf ↗ page arXiv:2611.02062 ↗

We construct explicit $U(n)$-equivariant isometric embeddings $T^*\mathbb{CP}^{n-1} \hookrightarrow \mathbb{R}^{n^4+2n^2-1}$, $n\ge 2$, with respect to Calabi's hyperkähler metric on $T^*\mathbb{CP}^{n-1}$. To achieve this, we first construct a diffeomorphism from $T^*\mathbb{CP}^{n-1}$ onto the manifold of rank-1 projections in $M_n(\mathbb{C})$, such that the pullback of half of the trace-class norm is a Kähler potential for the hyperkähler metric. We then use the Hilbert space structure of $M_n(\mathbb{C})$ to produce the isometric embeddings into Euclidean space.

comments
This preprint has been accepted into the Journal of Geometry and Physics. It is a more focused and streamlined version of a previous preprint
fields
Differential Geometry, Symplectic Geometry
pdf ↗ page arXiv:2611.02089 ↗

We prove a gauge equivalence result for the non-Abelian X-ray transform with connection and Higgs field on simple 2-dimensional asymptotically hyperbolic spaces. Our approach is based on the construction of holomorphic integrating factors. To construct these, we analyze the geodesic X-ray transform on functions on simple asymptotically hyperbolic manifolds of general dimension and prove polyhomogeneous mapping properties and a surjectivity result for the adjoint.

comments
38 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.02264 ↗

Let $C^m \subset \mathbb{R}^{m+n}$ be a regular embedded cone, where $n\geq 1$, and let $k\geq 1$. We prove that two smooth, connected, properly embedded self-shrinking ends whose blow-downs converge locally smoothly to the same cylindrical cone $C\times\mathbb{R}^k$ away from the axis $\{0\}\times\mathbb{R}^k$ must coincide. As a consequence, we obtain a rigidity result for complete self-shrinkers asymptotic to cylindrical cones. The proof uses Gaussian decay estimates and a sectorial Carleman estimate to establish backward uniqueness.

fields
Differential Geometry
pdf ↗ page arXiv:2611.02303 ↗

The Euler equations of hydrodynamics describe the motion of an ideal incompressible fluid. Arnold observed that their solutions are geodesics on the group of volume-preserving diffeomorphisms of the fluid domain, equipped with the $L^2$ metric, so that the curvature of this group governs how nearby fluid motions separate. Sectional curvature takes both signs, and Ricci curvature, its average over all directions, is the natural measure of which sign prevails, but in infinite dimensions the sum defining it diverges. When the fluid domain is the flat torus, we define Ricci curvature through Zeitlin's finite-dimensional models, which approximate the Euler equations by geodesic equations on the matrix groups $SU(N)$. We compute the Ricci curvature of these models exactly and prove that, normalized by dimension, it converges as $N \rightarrow \infty$ to an explicit integral. The limit is strictly negative in every Fourier mode and decreases logarithmically with the wavenumber, the behavior conjectured in \cite{lichtenfelz2026ricci} for the sphere. We also show that the diameter of $SU(N)$ in the Zeitlin metric grows at most linearly in $N$.

comments
24 pages
fields
Differential Geometry, Mathematical Physics
pdf ↗ page arXiv:2611.02323 ↗

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. In particular, such a body exists in every smooth three-dimensional or four-dimensional Riemannian manifold.

fields
Differential Geometry
pdf ↗ page arXiv:2611.02355 ↗

We show that Ricci flows of invariant metrics on twisted principal bundles with nilpotent fibres over \(S^1\) are immortal and type III. After normalisation and lift to the universal cover, a sequence of metrics converges in the Cheeger–Gromov topology to a homogeneous expanding Ricci soliton. The proof extends the bracket flow technique from homogeneous Ricci flows to invariant Ricci flows on twisted principal bundles.

fields
Differential Geometry
pdf ↗ page arXiv:2611.02477 ↗

In 1988, J.~M.~Lee conjectured that a compact strictly pseudoconvex CR manifold admits a pseudo-Einstein contact form if and only if the real first Chern class of its holomorphic tangent bundle vanishes. The necessity of this condition was proved by Lee. We show that the condition is not sufficient: in every real dimension $2n+1\ge 5$ there is a compact connected strictly pseudoconvex CR manifold $M$ with $c_1(\Tone)=0$ in $H^2(M;\Z)$ which admits no pseudo-Einstein contact form. The examples are boundaries of small strictly pseudoconvex neighborhoods of a section $D\cong B$ with negative normal bundle in a $\PP^1$-bundle $\PP(E_e)\to B$, where $B=C^n$ is a power of a curve of genus two and $E_e$ is a non-split extension of $\cO_B$ by an ample line bundle $L$ with $K_B\cong L^2$. More generally, if $K_B\cong L^m$, such a boundary admits a pseudo-Einstein contact form if and only if $(m-1)e=0$, where $e\in H^1(B,L)$ is the extension class; the obstruction is detected on the first infinitesimal neighborhood of $D$.

fields
Differential Geometry
pdf ↗ page arXiv:2611.02718 ↗

We prove that, in every dimension, the focal set of the potential function of a complete gradient shrinking Ricci soliton with constant scalar curvature is totally geodesic whenever it has dimension two or three, and that every complete five-dimensional gradient shrinking Ricci soliton with constant scalar curvature is rigid. The first result follows from a Bochner identity for the covariant derivative of the Ricci tensor at the focal set. For the second, when the scalar curvature is twice the soliton constant, we prove that total geodesy implies rigidity through an integral identity on the level hypersurfaces; the case of scalar curvature three times the soliton constant is treated by a separate argument. As further applications, we combine our methods with the rigidity theorem in the recent preprint of Li, Li, Ou, Qu, Wu and Zhou to obtain rigidity in arbitrary dimension when the scalar curvature is twice or three times the soliton constant, and under integral Weyl pinching for four-dimensional focal sets.

comments
28 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.02740 ↗

In this article we produce many examples of knotted self expanders. For example, there is an expander isotopic to a trefoil knot with three half cylinders attached.

comments
Comments welcome!
fields
Differential Geometry
pdf ↗ page arXiv:2611.02829 ↗

We establish a polarized weighted Reilly identity and an exact deficit decomposition for weighted curvature integrals $I_j=\int_ΣVE_j~\mathrm{d}μ$ in hyperbolic space, where $V=\cosh r$ and $E_j$ is the normalized $j$th mean curvature. For compact domains with smooth connected boundary, these yield $I_k^2\geq I_{k-1}I_{k+1}$ under intrinsic sub-staticity at $k=1$ and static convexity with $κ\inΓ_k\cap\overlineΓ_{k+1}$ for $2\leq k\leq n-1$, with equality precisely for geodesic balls. Under $h\geq0$ and $Vh-V_νg\geq0$, log-concavity and a Euclidean mixed-volume representation recover the centered-ball comparisons conjectured by Hu and Li \cite[Conjecture~1.1]{HuLi}, allowing the weight center to lie outside the domain. Equality in these comparisons holds precisely for balls centered at the weight center.

comments
25 pages. All comments are welcome
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2611.02882 ↗

We study singularities of separation coordinates for geodesic flows of real-analytic two-dimensional (pseudo-)Riemannian metrics. We obtain a complete local classification of these singularities using the Nijenhuis operator associated with a quadratic first integral. The singular set is locally a smooth curve, an isolated point, or two transversely intersecting curves. We also show that orthogonal separation near one point of an analytic disk extends to a quadratic first integral on the entire disk and provide explicit separation coordinates near singularities.

fields
Differential Geometry, Mathematical Physics, Dynamical Systems
pdf ↗ page arXiv:2611.02939 ↗

We study the behaviour of Hermitian-Einstein metrics on a holomorphic vector bundle over a compact Kähler manifold, as the underlying Kähler metric varies and its Kähler class changes. In particular, if the bundle stops being stable at some point, the Hermitian-Einstein metrics blow up, and their rescaling can be used to construct a destabilizing subsheaf, following the argument of Uhlenbeck and Yau. Furthermore, we study the behaviour of Chern connections of these metrics, and show, that after passing to a subsequence, and applying suitable gauge transforms these connections converge, and identify the blow-up locus of their Uhlenbeck limit.

comments
41 pages
fields
Differential Geometry, Analysis of PDEs, Complex Variables
pdf ↗ page arXiv:2611.03025 ↗

We construct a new explicit toric ALF gravitational instanton. The instanton has Euler characteristic $χ= 4$ and Hirzebruch signature $τ= 1$. The topology at infinity is a lens space $L(3,1)$. The solution depends on one parameter and is constructed from the Belinski–Zakharov four-soliton solution. We prove that the instanton is smooth and positive definite on and away from the axis. This is the first example of a non-Hermitian ALF (not AF) gravitational instanton.

comments
8 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.03221 ↗

We prove that every smooth closed strictly convex hypersurface in $\mathbb R^{n+1}$ contracts to a round point under the $σ_k$-curvature flow for $2\leq k\leq n-1$, without additional pinching or symmetry assumptions. After rescaling about the extinction point to mean width two, the hypersurfaces converge smoothly and exponentially in normalized time to the unit sphere. The proof is based on an entropy which is invariant under translations and dilations and admits a representation by weighted boundary areas of orthogonal projections. A strengthened Codazzi inequality yields its monotonicity. An upper bound for the entropy controls the inradius relative to the mean width, while its dissipation controls the spatial variation of the normalized speed. We also obtain two-sided curvature bounds at the natural extinction scale.

comments
26 pages, comments are welcome!
fields
Differential Geometry
pdf ↗ page arXiv:2611.03249 ↗

We establish sharp lower bounds for the lengths of balls in the universal covers of finite metric graphs. For a finite connected $d$-regular graph, with $d \geq 3$ and average edge length at most one, we show that, at every radius, the average length of balls centered at a vertex of the universal cover is at least that of a ball of the same radius in the equilateral $d$-regular tree. We extend this comparison to arbitrary finite connected graphs whose total length does not exceed that of an equilateral trivalent graph with the same cyclomatic number. In particular, we show that the maximal length of a ball centered at a vertex of the universal cover is bounded below by that of a ball of the same radius in the equilateral trivalent tree. This answers a question of the first author. Furthermore, equality at an integer radius forces all edges to have unit length in the regular case and, in the general case, forces the graph to be an equilateral trivalent graph after suppressing vertices of degree two. In contrast, rigidity fails at every noninteger radius.

fields
Differential Geometry
pdf ↗ page arXiv:2611.03277 ↗

This is the higher dimensional continuation of our works on Hausdorff dimension of Kleinian groups \cite{Hou2010}, \cite{Hou2020}. In this paper we prove that for all $r\ge 2$ there exists $λ_r>0$, which is independent of the dimension $N$ of the hyperbolic space, such that any finitely generated non-elementary torsion-free Kleinian group of $\Isom(\mathbb{H}^N)$ generated by $r$ elements with limit set of Hausdorff dimension $<λ_r$ is a classical Schottky group. For two generators the bound can be taken to be $1/3$. The proof relies on our previous works in \cite{Hou2010}, \cite{Hou2020} and on a metric carrier graph reduction. Our result can also be considered as the complete converse to the well-known theorem of Phillips-Sarnak \cite{PS} for spaces of any dimension $N$.

comments
Continuation of our work on Kleinian groups of Geometry \& Topology. 14. 2010. & Math. Z. 294. 2020
fields
Differential Geometry
pdf ↗ page arXiv:2611.03335 ↗

We give a proof of a folklore conjecture that a compact Kähler manifold with the same scalar Laplace spectrum as complex projective space equipped with the Fubini–Study metric is holomorphically isometric to it. More generally, we prove that the spectrum of the Hodge Laplacian in any one fixed degree $p$ determines $\CP^n$ up to holomorphic isometry among compact connected Kähler manifolds, for every fixed pair of integers $(p,n)$ with $0\leq p\leq n$. Equality of a single Hodge spectrum first forces periodic geodesic flow and the integral cohomology ring of complex projective space. The ordinary first heat coefficient then identifies the total scalar curvature except on a Pell sequence of pairs. For those pairs, a clean wave-trace argument, a Krawtchouk estimate, and a mod-two projective-bundle obstruction determine the geodesic return holonomy. A canonical Kähler involution recovers a weighted first heat coefficient which is nonzero throughout the exceptional sequence. The Kobayashi–Ochiai theorem and a fixed-class second-heat-coefficient calculation complete the argument.

comments
32 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.03536 ↗

Let $p>3$ and let $Γ$ be a non-elementary Gromov hyperbolic group with $\partial_\inftyΓ\cong\mathbb S^{p-1}$. We prove that every $\mathbb{H}^{p,2}$-convex cocompact representation $$ ρ:Γ\longrightarrow \mathrm{PO}_{p,3} $$ whose proximal limit set $Λ_ρ\subset\partial_\infty\mathbb{H}^{p,2}$ is a $C^1$ submanifold preserves a totally geodesic copy of $\mathbb{H}^p\subset\mathbb{H}^{p,2}$. Consequently, $Γ/\ker ρ$ is virtually a cocompact lattice in $\mathrm{Isom}(\mathbb{H}^p)$. For odd $p$, we prove the same conclusion for every signature $(p,q)$ with $p>q\ge2$, under the same hypothesis $\partial_\inftyΓ\cong\mathbb S^{p-1}$. Our methods combine dynamics, differential topology, and representation theory. The key new ingredient is to study the radicals of the semidefinite forms induced on the tangent spaces of the limit set. They form a continuous vector bundle of constant rank. The tangent action at attracting fixed points gives a bound, in terms of the radical rank, on the number of eigenvalues of an orthogonal lift whose modulus exceeds one. We then use the topology of the sphere and the representation theory of real algebraic groups to exclude the remaining possibilities. In arbitrary signature with $p>q$, these arguments already imply that a representation with a $C^1$ limit set cannot be Zariski dense.

comments
33 pages, comments are very welcome!
fields
Differential Geometry, Dynamical Systems, Group Theory, Geometric Topology
pdf ↗ page arXiv:2611.03539 ↗

We study the surjectivity of the differential of the Laplace-Beltrami operator with respect to the metric parameter. We use the obtained results to prove that every small deformation of a nonconstant eigenfunction can be realized with a small perturbation of the metric. As a consequence, we prove that every generic property of smooth functions which is invariant under multiplication by a nonzero scalar is generic for eigenfunctions of the Laplace-Beltrami operator, extending a result by Uhlenbeck.

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

Dynamical Systems37

We prove that linear momentum escape is generic in the $C^{1,α}$ topology for smooth potential perturbations of exact symplectic twist maps, for every $0<α<1$. We assume a $C^2$ generating function, a uniform twist condition, and uniform upper bounds on $D_{11}S$ and $D_{22}S$. For an open dense set of potentials, every sufficiently small momentum drift is realized by an orbit. This genericity result does not extend in general to the $C^2$ topology. We give examples with no nonzero linear drift under $C^2$-small perturbations in every dimension. In dimension one, a second example has bounded momentum along every orbit under $C^2$-small perturbations.

comments
19 pages, 2 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2611.00254 ↗

Analog computers solve problems through physical representations of mathematical variables and relations, often using the dynamics of electronic circuits and their associated signals. Many analog computers directly represent nonlinear dynamical systems; they encode their solutions in the signals that they generate. Although most modern scientific computing relies on digital architectures with inherently discrete-valued representations and algorithmic approaches, the design constraints of such architectures increasingly limit both performance and energy efficiency. Analog systems can circumvent some of these constraints; they execute specific computations very efficiently by mapping them directly onto physical processes using smaller and simpler computing elements than the ones in digital architectures. In this article, we provide an interdisciplinary perspective on modern analog and hybrid (i.e., analog-digital) computing. We discuss how modern scientific computing workflows can leverage analog approaches in various applications, such as in simulating dynamical systems, performing optimization, and enabling more energy-efficient implementations of artificial intelligence.

comments
31 pages, 11 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2611.00446 ↗

Spectral fields can recover matrix coefficients without standardizing the invariant Hermitian form. Over an algebraic subfield of $\mathbb{C}$ stable under nontrivial complex conjugation, we prove that every Zariski-dense subgroup in a normalized Hermitian model of dimension $m\ge4$ and signature $(m-1,1)$ at the fixed embedding contains a loxodromic element whose spectrum makes all diagonal coefficients norms. The element can be chosen so that every positive power is regular and generates the same splitting field. For an arbitrary initial Hermitian model over such a field, two spectra suffice for standard unitary descent over an extension of relative degree at most $(m!)^2$. Over every quadratic extension $F/k$ of nonarchimedean local fields of characteristic zero, a four-dimensional quasi-split unitary group of Witt index two contains a discrete, Zariski-dense free subgroup whose spectra all split over $F$. Over intrinsic fields of positive transcendence degree, we construct a single convex cocompact, Zariski-dense free subgroup of $\mathrm{SU}(3,1)$ for which, for every initial regular element and every normalized extraction, the Hermitian obstruction persists after adjoining any finite family of spectra and over the total spectral field.

fields
Dynamical Systems, Group Theory
pdf ↗ page arXiv:2611.00456 ↗

Many systems are observed only through unpaired snapshots, with population samples available at each time point but no correspondence between samples at different times. These snapshots determine the one-time distributions but leave the temporal coupling unspecified, requiring a modeling prior to connect successive times. We propose the lift-project stochastic differential equation (SDE), an autonomous SDE on the observed coordinate and a few hidden coordinates, trained only to match the snapshots. Most existing methods, including time-dependent SDEs, Schrödinger bridges and optimal transport, evolve the observed coordinate alone. For a scalar observation, the classical comparison theorem implies that all such models have non-negative lagged covariance, so on data whose lagged covariance turns negative, their error has a computable floor. The lift-project SDE is not bound by this floor. On two representative partially observed systems, the Duffing and pendulum oscillators, at comparable fit to the snapshots, the proposed method reduces the lagged-covariance error by factors of 2.4 and 6.6 relative to the strongest baseline and is the only model below the error floor; one hidden coordinate is already enough for such improvement. Furthermore, if a second experiment changes only the initial state of the hidden coordinate, no single model that evolves the observed coordinate alone can fit both experiments, whereas a single lift-project SDE can.

comments
26 pages, 12 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2611.00742 ↗

This paper proposes a generalized AHU algorithm based on tree isomorphism theory and applies it to the complete classification of n-dimensional stably dissipative Lotka-Volterra systems.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.00772 ↗

We introduce the concept of Markov-driven self-similar measures, a notion that simultaneously generalizes classical self-similar measures, self-conformal measures, dynamically driven self-similar measures and many random measures. This class is also closed under Cartesian products and linear projections. We initiate the study of this class of measures and investigate the $L^q$ dimension of Markov-driven self-similar measures under certain Diophantine conditions. As an application, we obtain the first Furstenberg slicing type results for intersections of Cantor sets in non-homogeneous settings.

comments
41 pages
fields
Dynamical Systems, Classical Analysis and ODEs, Metric Geometry
pdf ↗ page arXiv:2611.00962 ↗

We introduce a new surgical operation on Anosov flows, which we call bicontact padding surgery. The operation is defined using the machinery of strongly adapted bicontact structures, and involves inserting a 'padding' layer where one of the contact structures rotates many times around the Reeb flow of the other. We show that every skew Anosov flow with orientable stable and unstable foliations can be transformed into a finite cover of a geodesic flow using bicontact padding surgery and Goodman surgery. Together with previous results, this implies that every transitive Anosov flow with orientable stable and unstable foliations can be transformed into a suspension flow using bicontact padding surgery and Goodman surgery. This gives some progress towards the Christy-Fried-Ghys conjecture, which predicts that the same statement is true using only Goodman surgery.

comments
70 pages, 18 figures
fields
Dynamical Systems, Geometric Topology, Symplectic Geometry
pdf ↗ page arXiv:2611.00977 ↗

In this article we study the concept of product of two holomorphic correspondences which was introduced in our previous work. Beginning with some basic results regarding the orbit space associated with the product correspondence, we then move on to a detailed analysis on the thermodynamic formalism of the same. Some of the results look at the behaviour of the product correspondence with respect to the individual correspondences. Finally, we explore different families of correspondences with expanding nature.

comments
Comments are welcome!
fields
Dynamical Systems
pdf ↗ page arXiv:2611.00993 ↗

This paper studies positive expansiveness and positive kinematic expansiveness for strongly continuous semigroups of bounded linear operators on complex Banach spaces. We prove that positive kinematic expansiveness is equivalent to the unboundedness of every nonzero orbit, while positive expansiveness additionally requires the generator to be bounded from below. We also show that continuous changes of time can be replaced by increasing homeomorphisms without changing positive expansiveness. Uniform exponential expansion implies positive expansiveness without any surjectivity assumption; we characterize it through the minimum modulus, the lower growth bound, and the approximate point spectrum of a single semigroup operator. Under a uniform positive lower bound on the semigroup, positive expansiveness is equivalent to positive kinematic expansiveness together with boundedness below of the generator. Diagonal semigroups on $\ell_p$ then show that uniform exponential expansion, positive expansiveness and its kinematic version form a strictly decreasing hierarchy. Finally, we derive necessary spectral conditions for bounded generators and show that all three properties coincide in finite dimensions.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.01005 ↗

In this paper, the first in a series devoted to finite-time singularities of point-vortex systems in domains with boundaries, we establish the existence of finite-time interior collapse for three vortices in the upper half-plane $\mathbb{H}^+$. Our approach treats the boundary-induced interactions as a perturbation of the classical self-similar Gröbli collapse in the full plane. Under suitable conditions on the vortex circulations and collapse profile, we prove the existence of a one-dimensional local strong stable manifold of the augmented rescaled system, which generates exact solutions in which three distinct vortices collapse simultaneously at any prescribed interior point $z^*\in\mathbb{H}^+$. Moreover, these solutions are asymptotically self-similar, with the characteristic square-root collapse rate $O(\sqrt{T-t})$.

comments
27 pages
fields
Dynamical Systems, Mathematical Physics, Analysis of PDEs, Classical Analysis and ODEs
pdf ↗ page arXiv:2611.01014 ↗

Let $(X,ω)$ be a translation surface with at least one singularity. We investigate the distribution of the number of singularity encounters along prime closed geodesics on $X$. Writing $\ell(γ)$ for the geometric length of a closed geodesic and $m(γ)$ for the number of singularities it encounters, we establish a uniform counting local limit theorem for the values of $m(γ)$ sampled over $\ell(γ)<T$. The key technical step is to introduce and study a trace-class operator whose spectral data encodes the Fourier transform of our counting distribution. Our results hold for every translation surface, without genericity assumptions.

comments
16 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2611.01060 ↗

Work/life balance (WLB) remains a central yet elusive concept in social and organizational sciences, often described qualitatively without a unified quantitative framework. To address this gap, a novel compartmental mathematical model is proposed that formalizes WLB as a dynamic population-level phenomenon. The individuals are categorized into 4 compartments, namely, regularly employed, temporarily employed, imbalanced (infected), and balanced (recovered), representing balanced and imbalanced states. Role-based complaints govern the transitions between states, the conflict conversion rates of these complaints, and the recovery rate. The model, structured as a system of nonlinear ordinary differential equations, is analyzed for the existence of the equilibrium and its stability. In the analysis, the stable disease-free equilibrium is found to exist, representing complete societal balance. The other endemic equilibrium is shown to be infeasible through simulations and thus requires certain parameter constraints, which represent a specific scenario that may occur in the population. However, it is found that the endemic equilibrium always remains unstable. The model's ability to quantify how micro-level stressors spread into macro-level imbalance is demonstrated by numerical simulations, which also validate the analytical results. This work establishes a rigorous mathematical foundation for WLB, enabling future empirical and mathematical calibrations.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.01091 ↗

Let $K\subset\mathbb{C}$ be the attractor of $n\ge2$ similarities $z\mapstoλz+b_k$, $0<|λ|<1$, whose fixed points are evenly spaced on a line, and suppose that $K$ does not lie in a line. We prove that $K$ can be a dendrite only if $n\le6$, and that such dendrites exist for every $2\le n\le6$; no separation or finite-intersection hypothesis is imposed. Hence, for $n\ge7$, every connected $K$ of this kind has interior points or separates the plane. Neighboring pieces of $K$ meet in similar copies of a single contact set. In a dendrite exactly one first-level piece meets this set, whereas for $n\ge7$ at least $n-\lceil2\sqrt{n-1}\rceil\ge2$ do, a bound attained by explicit quadratic parameters. The proof combines a planar translation obstruction for replicated contact arcs with an estimate based on Jensen's formula. After normalizing to $z\mapsto t+z/c$, $t\in\{-n+1,-n+3,\ldots,n-1\}$, the connectedness locus is the closure, outside the unit disk, of the roots of monic integer polynomials of height at most $n-1$. The same estimate shows that, for $n\ge7$, every such polynomial with a non-real root $c$ satisfying $|c|^2\ge\lceil2\sqrt{n-1}\rceil+1$ has subleading coefficient of absolute value at most $\lceil2\sqrt{n-1}\rceil$, and that this bound is sharp. Accordingly, for $n\ge7$, at every non-real boundary point $c$ of the locus with $|c|>1$, each expansion $c=\sum_{j\ge0}d_jc^{-j}$ with integer digits $|d_j|\le n-1$ has $|d_0|\le\lceil2\sqrt{n-1}\rceil$.

comments
20 pages, 5 figures. Ancillary files: exact-arithmetic verifier, figure programs and parameter-grid data
fields
Dynamical Systems, Metric Geometry, Number Theory
pdf ↗ page arXiv:2611.01291 ↗

Let $U$ be an arbitrary open subset of $C^1([-h,0],\mathbb R^n)$, and let $f:U\to\mathbb R^n$ be continuously differentiable. Suppose that each derivative $Df(φ)$, $φ\in U$, admits a continuous linear extension $D_ef(φ):C([-h,0],\mathbb R^n)\to\mathbb R^n$, such that $D_ef(φ)χ$ depends jointly continuously on $φ\in U$ and $χ\in C([-h,0],\mathbb R^n)$. We construct a $C^1$ diffeomorphism of $U$ onto an open subset of $C^1([-h,0],\mathbb R^n)$ which maps the solution manifold of $x'(t)=f(x_t)$ onto an open subset of the closed subspace defined by $φ'(0)=0$. This resolves an open problem posed by Walther concerning regularization of the entire solution manifold. The diffeomorphism preserves the value at zero and agrees with the original history on $[-h,-τ]$ for any prescribed $τ\in(0,h)$, and is uniformly arbitrarily close to the identity in the supremum norm. It is connected to the identity by a jointly $C^1$ family of diffeomorphisms. The same conclusions hold under the weaker assumption that the finite signed measures representing the derivatives of $f$ have no atom at zero. We also establish a corresponding theorem for separable real Hilbert-valued histories.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.01482 ↗

We prove strict separation of antiperiodic degeneracy curves associated with elliptic Euler and Lagrangian solutions of the planar three-body problem. For every eccentricity $0<e<1$, each Euler pair issuing from a common circular parameter is strictly ordered in the extended family $β>0$, and the two Lagrangian curves remain disjoint. Every antiperiodic degeneracy point in these families with $0<e<1$ has a one-dimensional full kernel. Rotation and reflection decomposition yield, for each model, two half-integer Fourier block operators with identical tails and different first blocks. In the Euler case, a positive definite first-block perturbation gives a definite connecting crossing form; a spectral-flow rectangle and sectorwise index counts then force strict separation. In the Lagrangian case, exact tail elimination and an explicit estimate for a two-dimensional Schur complement exclude simultaneous degeneracy in the two reflection sectors.

comments
17 pages, 3 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2611.01719 ↗

For a dissipation stochastic differential equation (abbreviated as SDE), exponential ergodicity has been investigated a lot in a wide range of settings. In this paper, we prove that the Markovian measure $μ$ determined by the unique stationary measure is also the unique invariant measure which satisfies the entropy formula. Consequently, the existence of an SRB measure is completely determined by the sign of the sample top Lyapunov exponent of $μ$: if $χ_μ^1>0$, then $μ$ is the unique SRB measure, whereas if $χ_μ^1\leq0$, then the SDE admits no SRB measure. As an application, we establish a dichotomy of SRB measures for the 2D additive-noise stochastic Hopf normal form within a shear parameter domain.

comments
29 pages
fields
Dynamical Systems, Probability
pdf ↗ page arXiv:2611.01725 ↗

In this paper, we establish the classical Brin-Katok local entropy formula for $C^1$ random dynamical systems on a complete Riemannian manifold (possibly non-compact) under a mild integrability condition. The proof depends on the constructions of measurable partitions adapted to asymptotically varying radii and finite measurable partitions with null-boundaries. As an application, under additional integrability assumptions, we obtain the Margulis-Ruelle inequality for $C^2$ random dynamical systems on complete non-compact Riemannian manifolds. Furthermore, we also construct a counterexample showing that the integrability condition above cannot in general be omitted.

comments
40 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2611.01896 ↗

We introduce two types of Bykov cycles for Filippov systems: crossing Bykov cycles, which retain the main dynamical features of their smooth counterparts, and sliding Bykov cycles, whose dynamics intrinsically involves the switching manifold. We construct explicit piecewise linear examples of both configurations. For crossing Bykov cycles, we prove the existence of hyperbolic invariant sets carrying symbolic dynamics, as in the classical smooth setting. For sliding Bykov cycles, under suitable open conditions, we obtain a countable symbolic dynamics on an invariant set; we prove that this invariant set has several interesting properties: the Hausdorff dimension of it and of its closure are equal, and it lies strictly between zero and one, and so both sets have zero Lebesgue measure; its closure is a Cantor set; and we also obtain conformal and invariant ergodic measures for the associated return dynamics. Finally, we show that convolution regularization of a suitable piecewise constant vector field produces a spatial cusp whose versal unfolding contains classical Bykov cycles. Thus, Bykov-type dynamics arises in the non-smooth setting both intrinsically, through crossing and sliding mechanisms, and through smooth regularization.

comments
Version v00
fields
Dynamical Systems
pdf ↗ page arXiv:2611.01971 ↗

For any $r>1$ and any nonnegative sequence $ω(n)=o(n)$, we construct a $C^r$ sphere diffeomorphism $f$ with $h=h_{\mathrm{top}}(f)>0$ such that \begin{equation*} \lim_{n\to\infty}\frac1n\log\#\Fix(f^n)=h, \qquad \sum_{n\geqslant1}e^{-hn+ω(n)}\#\Fix(f^n)<\infty. \end{equation*} Every ergodic invariant probability measure is hyperbolic, and, apart from finitely many fixed points, all periodic points lie in a single topologically mixing homoclinic class of entropy $h$. This shows that the logarithmic periodic-point lower bound is optimal in finite regularity. In particular, we answer the finite-regularity case of Katok's periodic-point question in the negative.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.01980 ↗

The announced rank-one ergodicity theorem of Rodriguez Hertz, Rodriguez Hertz, and Wu includes the nonpositively curved metrics considered here on Aravinda–Farrell twisted doubles. For these construction metrics, a direct geometric argument identifies the singular set. Their singular geodesics are precisely those tangent to the torus sections of finitely many flat product collars, so their initial vectors have Liouville measure zero. A compact simply connected modification region cannot contain a complete geodesic; this also treats the exotic connected-sum examples. Ergodicity then follows from the classical theorem on the regular set.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.02106 ↗

We study codimension one homoclinic flows on closed surfaces and introduce a complete topological invariant based on the structural graph of the flow and the distinguishing graphs of its atoms. This invariant completely determines the topological equivalence class of a homoclinic flow. For flows on the two-dimensional sphere, we construct a canonical coding algorithm that avoids the global renumbering required in the classical coding of Morse flows and substantially reduces the computational complexity. As an application, we derive recursive formulas for the number of topologically distinct homoclinic flows on the two-dimensional sphere and compute these numbers for flows with a small number of saddle singularities and closed orbits.

comments
19 pages, 5 figures
fields
Dynamical Systems, Geometric Topology
pdf ↗ page arXiv:2611.02116 ↗

We develop nonreciprocal spherical attention as a mathematical framework for coarsening and compressed nearest-neighbor retrieval. For two shrinking acute blocks whose centers have zero skew pairing and whose total mass ratio is subexponential in inverse temperature, we prove $\lim_{β\to\infty}β^{-1}\log T_β=1-\cosφ$, without restricting particle-count growth. An explicit three-body flow has two rigorously separated metastable exponents. For finite compression, mass centering yields a sharp $O(r^2)$ attention-output error bound at fixed temperature, with an explicit spherical-normalization correction. We formulate skew query-side score calibration as a strictly convex moment problem and derive a unique normal equation, residual-based optimization certificates, and bounded low-rank projections. A norm-aware margin objective calibrates native squared-distance rankings. Experiments use semantic retrieval data, one million visual descriptors with three codebook seeds, and a ten-million-vector FAISS IVF-PQ index with recomputed exact cosine ground truth. On SIFT1M, skew margin calibration raises native-L2 hit@10 from 0.8926 to 0.8948; symmetric calibration reaches 0.8996. The ten-million-vector index reaches 0.8827 hit@10 at 0.1794 ms per query in a four-thread batch benchmark, while validation selects no skew update. Exact streamed attention over ten million keys evaluates compressed memory on 1,024 held-out queries. Independent matrix solves, automatic differentiation, finite differences, interval arithmetic, full-flow tests, and nine Rocq-checked algebra lemmas support reproducibility. Directionality alone does not establish retrieval superiority.

comments
42 pages, 9 figures, 10 tables. Includes mathematical appendices and ancillary reproducibility code
fields
Dynamical Systems
pdf ↗ page arXiv:2611.02237 ↗

This paper studies the global dynamics of a three-dimensional Lotka-Volterra system of two prey, with direct competition between them, and one predator. Under a symmetry assumption, the rescaled parameter space is sorted into four generic categories, which yield a complete classification of the global dynamics into 56 meaningful subcases. We determine the existence and stability of the boundary and positive equilibria, including global asymptotic stability and bistability of boundary equilibria, and necessary and sufficient conditions for local asymptotic stability of the positive equilibrium. We identify regimes of periodic solutions and chaos, including a period-doubling route to chaos. We further show that the parameters of Gilpin's chaotic dynamics fall within some cases. Biologically, we introduce the notion of extensive negative competition, which, together with trade-off competition and apparent competition, interprets the interactions among the three species. Our classification shows that the full system largely tracks the dynamics of the prey-only subsystem, and these competition mechanisms explain the differences between them, clarifying how predator-mediated interactions alter competitive outcomes and facilitate prey persistence, thereby providing mathematical support for Paine conjecture.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.02246 ↗

The Hubbard-Wigner model describes binary lattice configurations with convex repulsive pair interactions. We give a unified classification of its periodic minimizers, minimizing invariant measures, and Aubry sets through a positive block-count identity, recovering explicit plateau widths and a complete devil's staircase for the minimizing density. This variational structure parallels Aubry-Mather theory and the authors' work on Aubry's completeness conjecture, where the staircase is related to the sliding and pinning mechanisms underlying the conducting and insulating interpretations of particle chains. In the binary model, completeness follows from discrete convexity and an exact sum of plateau widths. We then study how this classical structure persists for interactions arising in the fractional quantum Hall effect on a thin torus. At rational density $p/q$, the diagonal reference has a $q$-dimensional lowest eigenspace, a spectral gap uniform in the number of repeated periods, and an associated bundle of Chern number $p$. For the full $V_1$ operator, we prove persistence of a density-$1/3$ plateau and a positive spectral gap, uniformly in system size at sufficiently small fixed transverse circumference; the lowest-eigenspace bundle has rank three and Chern number one. For the full periodic Coulomb operator, we establish multiplicity, spectral-gap, and Chern-number conclusions at bounded denominators, and quantitative bounds on plateau-endpoint displacement and loss of width under explicit joint conditions on size and geometry.

fields
Dynamical Systems, Mathematical Physics
pdf ↗ page arXiv:2611.02429 ↗

We associate a directed substrate hypergraph with an enzymatic reaction system. The hypergraph records which substrates each composite reaction consumes and produces, and each composite reaction is realized by a Henri–Michaelis–Menten (HMM) module whose enzyme may be distinct, shared with other reactions, or absent. We call the hypergraph a cycle when it is strongly connected and every substrate is produced by exactly one reaction and consumed by exactly one reaction, each time with coefficient one; equivalently, its dual is a strongly connected ordinary directed graph. For a cycle, every HMM realization, under every enzyme assignment and for all positive rate constants, has exactly one positive steady state in each stoichiometric compatibility class that contains a strictly positive point, and no steady state on the boundary of such a class, and every trajectory in such a class is persistent. The interior dynamics, in contrast, depend on how enzymes are shared. When each enzyme catalyzes at most one reaction, every trajectory in such a class converges to its unique steady state. With enzyme sharing, convergence can fail even for the three-substrate transformation cycle $X_1\to X_2\to X_3\to X_1$: if two transformations share an enzyme and the third has its own enzyme or none, the steady state can undergo a supercritical Hopf bifurcation that produces a stable limit cycle. Thus the substrate structure controls existence, uniqueness, and persistence, while the pattern of enzyme sharing controls the interior dynamics. The results extend to weighted cycles, which allow higher stoichiometric coefficients, and to longer chains of intermediates.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.02523 ↗

The spring-loaded inverted pendulum (SLIP) describes the center-of-mass (COM) motion of runners but has no trunk. In trunk models, the hip torque couples posture and COM motion and destroys the central-force structure on which SLIP analysis relies. As a result, trunk models have been studied almost only numerically. We show that this structure can be restored. The central pivot point (CPP), a hip-torque law that directs the ground reaction force through the COM, decouples pitch exactly and reduces stance to a planar central-force problem. At upright posture, time-reversal symmetry produces one-parameter families of periodic gaits. A stance-phase pitch law and a stride-level regulator stabilize all computed gaits, also with bounded hip torque and friction. Under CPP, any radial force law in virtual-leg coordinates can be embedded independently of posture. For a linear radial template, the stance radius and the constant-momentum sweep have exact closed forms. With a new gravity correction, the resulting analytic return map, to our knowledge the first for a trunk model, predicts liftoff velocity and apex position with mean errors of 1.6% and 0.9%. The natural gaits of the embedded runner are symmetric and need no force step at touchdown. A near-reversibility argument explains their unit multiplier, and a scalar equation predicts them within 0.8%. A deadbeat stride controller based on the analytic map tracks changes of speed, height and posture. CPP thus makes trunk models accessible to the analytic tools developed for SLIP.

comments
21 pages, 15 figures. Submitted to Chaos: An Interdisciplinary Journal of Nonlinear Science
fields
Dynamical Systems
pdf ↗ page arXiv:2611.02564 ↗

Let $T$ be a continuous self-map of a compact metric space. For each integer $p\geq2$, we consider the upper capacity entropy scale obtained by dividing the $p$-fold logarithm of an orbit covering number by the $(p-1)$-fold logarithm of time. We prove that every nonempty compact set contains a compact subset realizing any value between zero and its own scale entropy. Every strictly intermediate value is realized by a countable compact set with exactly one accumulation point. The proof combines localization at a fixed spatial resolution, a finite-tree selection lemma, and refinements of orbit covers at dyadic times. An example shows that the assertion about one accumulation point does not extend to the upper endpoint. On the product-diagonal construction used in classical entropy lowerability, the diagonal scales preserve the values of the base subsets, although classical upper capacity entropy takes only zero or infinity.

comments
14 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2611.02638 ↗

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

fields
Dynamical Systems
pdf ↗ page arXiv:2611.02781 ↗

Many control tasks require driving the system into a prescribed goal set and subsequently keeping it there. The considered setting assumes that a working controller is available that provably reaches and maintains the goal, albeit with suboptimal performance. This controller is referred to as the fallback policy. Conversely, although state-of-the-art reinforcement-learning (RL) algorithms can discover policies with impressive empirical performance, the neural networks at their core act as opaque black boxes learned through data-driven exploration and, as such, provide no theoretical mechanism to guarantee that the system will ever reach—and stay within—the prescribed goal set. This article presents CALF-Wrapper, a method that combines the fallback policy with a pretrained RL base policy and uses the critic estimate associated with the base policy to select between them during deployment. The theoretical analysis establishes that CALF-Wrapper inherits the goal-reaching property of the fallback policy under the stated assumptions and provides probability bounds for the settling time and the maximum distance from the goal set over a prescribed time interval. The experimental study evaluates CALF-Wrapper in four simulated control environments of different complexity. Comparisons include the base policy, fallback policy, and constrained reinforcement-learning methods formulated for the same objective. Sensitivity and ablation studies provide direct hyperparameter recommendations. The experiments show how CALF-Wrapper can provide effective task performance while attaining the maximum possible observed goal-reaching rate. CALF-Wrapper requires no additional dynamics model, online learning, or constrained optimization during execution.

comments
Accepted for IEEE Access (2026)
fields
Dynamical Systems
pdf ↗ page arXiv:2611.02888 ↗

We prove that, for commuting unitary representations $U,V$ of a countable amenable group $G$, the averages $$ D_F=\frac1{|F|}\sum_{g\in F}U_g^*V_g $$ have a common selfadjoint weak operator limit along all left and right \Folner{} sequences, with strong* convergence along two-sided sequences. This answers Bergelson's question on commuting actions. For any unitary representation $π$, we also prove that $A_F=|F|^{-1}\sum_{g\in F}π(g^2)$ converges strongly along right \Folner{} sequences to a selfadjoint central operator supported on the finite type~I part of $π(G)''$; the adjoints $A_F^*$ converge strongly along left \Folner{} sequences. This settles the convergence question for square averages posed by Bergelson and Rodríguez-Martín. For measure-preserving actions of finitely generated amenable or countable virtually FC groups, we obtain $$ \lim_n\frac1{|F_n|}\sum_{g\in F_n}μ(A\cap T_{g^2}A)>0 \qquad\text{whenever }μ(A)>0. $$ For each $\varepsilon>0$, the set $\{g:μ(A\cap T_{g^2}A)>μ(A)^2-\varepsilon\}$ meets every Bohr neighborhood of the identity in a set of positive lower density, uniformly over \Folner{} sequences. These intersections are also left and right IP$^*$ for virtually FC groups. We construct a unitary representation $π$ of a locally finite nilpotent group and a weakly mixing vector $f$ for which $\{g:\text{Re}\langleπ(g^2)f,f\rangle>-\varepsilon\}$ has upper Banach density zero for small $\varepsilon>0$. We also give a weakly mixing action of a two-generated solvable group for which the IP$^*$ conclusion fails. The recurrence results yield product sets $BB$ inside difference sets, with $B$ of positive upper density.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.02901 ↗

Near the neutral fixed point of an intermittent map, a single entrance into a small target can be followed by a long run of consecutive visits, so the number of visits need not follow its mean. We study targets $[0,u_n]$ for iid random compositions of Liverani-Saussol-Vaienti maps with a bounded parameter law that is regularly varying at its minimum $α\in(0,1)$; this includes a single map. For $u_n=cn^{-g}L(n)$, where $c>0$, $0<g\leq1$ and $L$ is slowly varying, the visit count is almost surely asymptotic to its mean if and only if $\sum_n n^{-1}(nu_n)^{-(1-α)/α}<\infty$. Under the stationary law, the count divided by its mean converges to one in $L^1$ exactly when $nu_n\to\infty$. Thus clusters of visits separate these two modes of convergence.

comments
51 pages. Identical in content to Zenodo v5, published on 25 October 2026: https://doi.org/10.5281/zenodo.23636722
fields
Dynamical Systems, Probability
pdf ↗ page arXiv:2611.03010 ↗

Viewing computing machines as symbolic dynamical systems is a powerful idea which has led to many important results. However, the standard setting of symbolic Turing dynamics is not well suited for studying questions of typicality, genericity, or robustness. Such natural questions, for example, as "what is the computational power of a typical computer program?", "how common is poly-time computability", or "how common is universal computation among all algorithms?" require a different approach. In this paper we develop a suitable general framework of viewing families of dynamical systems as computing devices. We study a specific class of such devices given by the logistic family, and give the answers to the above questions in this setting.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.03028 ↗

We develop a homological approach to the topological entropy of discontinuous interval maps with arbitrary branch orientations. Relations among the one-sided images of discontinuities reduce the kneading determinant, while symmetries yield further simplifications. We determine the smallest possible dimension of this reduction for each orientation pattern and show that this minimum can coexist with maximal entropy. The general theory is applied to maps with increasing or decreasing branches, extending earlier results for bimodal maps and yielding exact formulas for entropy and periodic-orbit counts.

comments
24 pages; 3 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2611.03287 ↗

We derive bifurcation equations for periodic orbits of autonomous and periodically non-autonomous implicit discrete systems in arbitrary finite dimension. Cyclic Lyapunov–Schmidt reduction gives recursive coefficients and nondegeneracy and transversality conditions at the multipliers +1 and -1. We prove equivalence under regular changes of implicit representation and exact invariance under cyclic relabelling when the reduction data are transported consistently.

comments
27 pages; 1 figure
fields
Dynamical Systems
pdf ↗ page arXiv:2611.03336 ↗

Switching networks arise across physics, biology, and engineering, where interactions turn on and off due to communication limits, control protocols, failures, or scheduling. Most synchronization theory for switching networks of continuous-time oscillators relies on the fast-switching approximation, yet many systems operate outside this regime, where switching can produce unexpected and counterintuitive collective dynamics. We develop the first analytical framework for synchronization in non-fast-switching networks of saddle-focus continuous-time oscillators. Using Rössler and piecewise-smooth systems as canonical examples, we leverage a structural property of saddle-focus oscillators to reduce the variational dynamics to a linear system with constant coefficients, enabling a Floquet-theoretic stability characterization under periodic switching. The analysis identifies explicit switching intervals that stabilize synchronization even when neither switching mode nor the corresponding average system supports synchronization in isolation, thereby revealing the mechanism underlying the emergence of "windows of opportunity" at intermediate switching rates. We further derive a switching-dependent master stability function linking the network Laplacian spectrum to the switching rate. The master stability function provides two complementary routes to inducing or preserving synchronization: adjusting the switching schedule for a fixed network or adapting the network spectrum to a prescribed schedule through our constructive edge-pruning or edge-augmentation algorithms. These results provide a rigorous basis for understanding and leveraging intermediate-rate switching in the design and control of evolving networks.

comments
18 pages, 14 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2611.03355 ↗

Let $M$ be a closed manifold and $H:T^*M\to\mathbb{R}$ a $C^k$ ($k\geq2$) Tonelli Hamiltonian whose Aubry set consists of finitely many hyperbolic orbits, each of which is either a periodic orbit or a fixed point. We construct a $C^k$ critical subsolution that is quadratically strict outside the projected Aubry set. We then use this subsolution to establish an $O(1/t)$ rate of convergence for the associated Lax–Oleinik semigroup and the minimal action functions. This rate is optimal whenever at least one of these hyperbolic orbits is periodic.

comments
28 pages, 3 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2611.03505 ↗

Increased computing power has transformed computational science and improved predictive capabilities for complex systems, but many phenomena still exceed current simulation capabilities or require rapid evaluations for fast design iterations. Closure models address this challenge by approximating unresolved effects in reduced or incomplete dynamical systems. Data-driven closures offer a flexible mechanism for improving model accuracy and applicability, but approaches that embed the closure within a computational model for construction and training phases can be computationally expensive and cause numerical instabilities in the computational model during training. To avoid the challenges posed by embedded approaches, staged approaches to closure-model learning have been developed. The first stage uses data assimilation to infer state and closure trajectories from observations. The second stage trains a machine learning closure model offline using the assimilated data, thereby avoiding repeated simulator calls during training. In this work, we investigate the cost and accuracy tradeoffs between embedded and staged data-driven closure modeling approaches for a synthetic epidemiological SIQR model with a nonlinear state-dependent quarantine closure. The results illustrate a practical accuracy-efficiency trade-off: for this exemplar, embedded training provides the strongest average accuracy, while the staged approach yields comparable qualitative behavior with a moderate increase in error, substantially fewer model evaluations, and improved optimization robustness.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.03612 ↗

Algebraic Geometry32

In this paper, we prove that the rational points on hyperkähler varieties in each of the four known deformation families admitting a rational Lagrangian fibration are potentially dense. Furthermore, we give several applications and construct examples of hyperkähler varieties beyond these families satisfying the potential density property. Our approach is first to prove that rational points on hyperkähler varieties admitting two rational Lagrangian fibrations with distinct associated isotropic rays are potentially dense. We then construct a projective Shafarevich–Tate twist admitting two such fibrations, together with a dominant rational map from the twist to the original variety.

comments
22 pages, comments welcome!
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2611.00311 ↗

By introducing the notion of stable compatibility, we provide a framework in the model category theory which addresses the existence of a stable model structure on the category of modules over a monad. Exact version of such monads have been studied in the setting of triangulated categories, separately as separable monads a la Balmer in tensor triangular geometry and non-separable monads a la Dell'Ambrogio and Sanders in stable homotopy theory. By introducing stable compatibility, we explore their properties together and produce a non-separable monad in Algebraic geometry and more.

comments
26 pages
fields
Algebraic Geometry, Algebraic Topology, Category Theory
pdf ↗ page arXiv:2611.00813 ↗

We prove a plane-curve analogue of Zaslavsky's theorem for arrangements of real rational curves for which every complex singularity with more than one local branch is real and all of its branches are real. If at least one component has odd degree, the number of real regions equals the total rational Betti number of the complexified complement. We also give a formula for bounded affine regions which records the number of branches at infinity and the connected components of the real affine curve. Oriented regions generate the middle Borel–Moore homology over $\mathbb{Q}$, and they generate it over $\mathbb{Z}$ when the component degrees are coprime. The relations are described by the circles in the real normalization and, in an affine chart, by winding functions. These results imply equality of combinatorial rank and real combinatorial rank in the framework of Brown–Dupont and Sturmfels–Telen. Examples include singular rational cubics, arrangements of conics, Chebyshev curves, and the plane model of the $27$ lines on a split cubic surface.

comments
18 pages
fields
Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:2611.00861 ↗

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 ↗

We study the action of $\text{Gal}(\overline{\mathbb{Q}}/\mathbb{Q})$ on the solutions to the discrete Dirichlet problem for a graph with fixed edge energies. We establish transitivity of the Galois action outside a thin set in the parameter space and demonstrate that the exceptional thin set may be Zariski dense, so the conclusion cannot in general be replaced by one that holds on a Zariski-open set. Identifying the parameter locus where the Galois action is transitive constrains the possibilities for linking combinatorial and arithmetic properties of the discrete energy-harmonic Laplace equations and other systems of the same form.

comments
17 pages, 2 figures
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.00990 ↗

Let $Y$ be a smooth projective complex variety of dimension $n$ with trivial Chow groups, and let $f: X\rightarrow Y$ be a cyclic cover of degree $d$ branched over a smooth ample divisor $D\in |dL|$. We show that a naturally constructed Chow–Künneth decomposition of $X$ is $m$-fold $mn$-multiplicative for each integer $m\geq2$ and that its stable motivic multiplicativity defect satisfies $\mathfrak{sd}(X)\leq 2dn$. If, in addition, each positive-codimension cycle class on $Y$ is supported on $D$, then a double cover admits motivic $0$-multiplicativity. As a further application, we show that any smooth Gushel–Mukai sixfold admits motivic 0-multiplicativity. Moreover, we establish the sharp modified-diagonal property for all smooth double EPW sextics, confirming a conjecture of O'Grady for these varieties.

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

Let $G=UT_3(\F_q)$ be the finite Heisenberg group. We study the image closures and secant varieties of a family of equivariant bilinear maps between representations induced from central characters. Evaluation at a basepoint identifies the ambient space with $M_{q^2}(\C)$. A single channel is represented by $A^T\operatorname{diag}(d)B$, with $A$ and $B$ in prescribed twisted-convolution algebras. We prove that its affine image closure has dimension $3q^2-2$ for every central-character pair and that its affine second-secant closure has the expected dimension for every prime power $q$. For $q\ge3$, the proof constructs two differential images with zero intersection. We also prove a subgroup-lifting theorem for channel parameterizations on finite abelian groups with bicharacter coefficients: a parameter point with differential rank $r(3|H|-2)$ on a subgroup $H$ extends by zero to a parameter point with differential rank $r(3|K|-2)$ on the ambient group $K$, provided that every parameter vector is nonzero. Exact Jacobian certificates determine all secant dimensions for $q=2,3,4,5$, with generic widths $2,4,6,9$. The lifting theorem yields specified higher-secant dimensions on infinite families of extension fields. Attainment of the dimension lower bound for arbitrary $q$ remains a conjecture.

fields
Algebraic Geometry, Group Theory
pdf ↗ page arXiv:2611.01104 ↗

We study the Seshadri function on the ample cone of a smooth complex projective surface at a fixed point. At a submaximal class, we show that the function is differentiable if and only if there is a unique Seshadri curve. At a maximal class $L$, differentiability is equivalent to every curve $C$ computing the Seshadri constant satisfying $\frac{[C]}{{\rm mult}_x C}=\frac{[L]}{\sqrt{L^{2}}}$. We also prove that the non-differentiability locus is nowhere dense. For the blow-up of $\mathbb P^{2}$ at $r\ge 9$ very general points, assuming the $(-1)$-curves conjecture for the blow-up at $r+1$ very general points, we construct a non-empty open subset of the ample cone on which the Seshadri function at a very general point equals $\sqrt{L^{2}}$. Consequently, this function is not piecewise linear. Under the assumption of the Strong SHGH conjecture, we obtain a common non-empty open subset on which maximality holds at every point when $r\ge36$.

comments
Comments are welcome; 19 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.01138 ↗

Bogomolov–Guan manifolds are simply connected, irreducible holomorphic symplectic manifolds that are not Kähler, yet they echo hyperkähler geometry in striking ways. We show that their Frölicher spectral sequence degenerates at $E_1$ and that their Hodge numbers are stable under small deformations. The general fibers of their natural Lagrangian fibration are rationally null-homologous, and the Beauville–Bogomolov–Fujiki form is degenerate. Despite this, in every dimension, the Euler characteristics agree with those of generalized Kummer manifolds. In dimensions four and six, we compute the full Hodge diamonds and all Chern and Pontryagin numbers. Surprisingly, these characteristic numbers are the same as the generalized Kummer ones, even though the Betti numbers differ and the Hodge diamonds are asymmetric.

comments
69 pages, comments welcome
fields
Algebraic Geometry, Complex Variables
pdf ↗ page arXiv:2611.01210 ↗

We conjecture that the generating series of equivariant Gromov-Witten invariants of the local Calabi-Yau $(2n-1)$-fold $\operatorname{Tot} \mathcal{O}_{\mathbb{P}^{n-1}} (-1)^{\oplus n}$ at fixed genus can be presented as a linear combination of polylogarithms, generalising a well-known property of the resolved conifold. We prove this conjecture for two specialisations of the equivariant parameters. In the first, the parameters are specialised to roots of unity and the proof proceeds via Givental-Teleman reconstruction. In the second, we obtain a closed-form evaluation of the generating series from which the conjecture follows. For $n=3$, the resulting closed formula establishes a special case of a Gopakumar-Vafa-type conjecture for Calabi-Yau fivefolds.

comments
28 pages. Comments welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.01260 ↗

Suppose we have $r$ hypersurfaces in $\mathbb{P}^m$ of degree $d$, whose defining polynomials are linearly independent and whose intersection is zero-dimensional. What is the maximum number of points in their intersection? This problem is motivated by computing the generalized Hamming weights of projective Reed-Muller codes, and a conjectured formula for this maximum was given in [21]. We prove the conjectured formula for arbitrary $m$ when $\binom{m+d}{d}-\binom{d+2}{2}<r\leq\binom{m+d}{d}$. We use the notion of Artinian reduction to reformulate the problem in terms of graded Artinian algebras and then apply combinatorial tools to bound their Hilbert functions.

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

Let $K$ be a perfectoid field of characteristic $p$ with countable value group (for example, $K=\mathbb{C}_{p}^{\flat}$). We study Zariski-closed subsets \begin{equation*}Z\subseteq \mathbb{B}_{K}^{n,\mathrm{perfd}}\end{equation*}of the $n$-dimensional perfectoid closed unit ball $\mathbb{B}_{K}^{n,\mathrm{perfd}}$ over $K$. We use an example of Gleason, and its generalization obtained in the authors' previous work, to show that two natural notions of dimension for such Zariski-closed subsets, the Krull dimension $\dim(Z)$ and Huber's iterated transcendence degree $\mathrm{dim.tr}(Z)$, do not coincide, and that the gap between them can be arbitrarily large.

fields
Algebraic Geometry, Commutative Algebra, Number Theory
pdf ↗ page arXiv:2611.01418 ↗

We present an account of the classification of Fano contact manifolds based on the proof of OpenAI and the solution of LeBrun-Salamon conjecture by Hu, Liu and Wan. The proof combines their constructions with earlier results on contact lines, with some simplifications.

comments
This paper grew out from my attemps to understand [OpenAI] and [HLW] through extensive discussions with ChatGPT. My contribution is mainly editorial: the rewriting, reformulation and reorganization of claims and proofs; the explanation and illustration of the proof via adjoint varieties (which is the essential part of my contribution in this paper); attributions of previous works etc
fields
Algebraic Geometry, Differential Geometry
pdf ↗ page arXiv:2611.01423 ↗

We extend the definition of cdh-sheafified Hochschild homology from varieties to stable categories linear over a field of characteristic zero, thereby proving its Morita-invariance. The dimensions of its homology groups give meaningful numerical invariants of a category; we combine them with invariants coming from topological K-theory and Poincaré duality to prove equality of mixed Hodge numbers for singular complex projective Fourier–Mukai partners in several classes in dimensions two, three, and four, including normal surfaces and threefolds with rational singularities and equal irregularity. Beyond these applications, we construct Du Bois versions of topological cyclic homology of stable categories together with appropriate multiplicative structures, prove a Geller–Weibel-type result for the variants of negative cyclic homology we introduce, and give categorical characterizations of cohomological purity of proper varieties and the $\mathbb{Q}$-factoriality defect of complex projective threefolds with rational singularities.

comments
57 pages, 1 figure. Comments welcome!
fields
Algebraic Geometry, Algebraic Topology, Category Theory, K-Theory and Homology
pdf ↗ page arXiv:2611.01508 ↗

For any simply connected almost simple group $G$ and any compact Riemann surface of genus $g>1$, we study the singular locus of the character variety which parametrises fundamental group representations with a twist by a central element $z$ of $G$. While for $z=1$ the most singular representations have values in a maximal torus (and are invariant for the Weyl group action) and for generic $z$ every $z$-twisted representation is irreducible, for a general $z$ we find that the most singular representations have values in a particular Levi subgroup $L_z$ up to conjugation. From the explicit Lie-theoretic description of $L_z$, we determine the structure of the maximal stabiliser groups, and prove that the most singular loci is a disjoint union of generic type $A$ character varieties.

fields
Algebraic Geometry, Group Theory, Representation Theory
pdf ↗ page arXiv:2611.01528 ↗

We prove that every orientation-preserving Hodge isometry between the integral Mukai lattices of the Kuznetsov components of two smooth cubic fourfolds is induced by an exact equivalence. The proof uses Markman–Mehrotra's comonad reconstruction method to recover both Kuznetsov components from a common Fourier–Mukai comonad on a moduli space of stable objects. As an application, we prove that the Kuznetsov components of two smooth cubic fourfolds are equivalent whenever their Fano varieties of lines are derived equivalent.

comments
18 pages. Comments are welcome!
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.01716 ↗

We give a geometric interpretation of the projection and reconstruction underlying the Open AI's characteristic-two proof of the Deligne–Drinfeld conjecture. Using the double covering and filling a puncture, we construct a morphism on normalized level-two associators with an explicit inverse on its image. We compute the restricted tangent reconstruction in the pro-2 realization and identify the leading coefficient maps with those of the OpenAI proof, making its implicit reconstruction explicit.

comments
19 pages
fields
Algebraic Geometry, Quantum Algebra
pdf ↗ page arXiv:2611.01745 ↗

We study the Gieseker–Maruyama moduli space $M_{c_3}$ of stable rank 2 torsion-free sheaves on $\mathbb{P}^3$ with Chern classes $c_1=-1$, $c_2=1$, and odd $c_3 \le 1$. Every such sheaf $E$ has reflexive hull $E^{\ast\ast}$ parametrised by $M_1$, and the quotient $E^{\ast\ast}/E$ is a 0-dimensional sheaf of length $n = (1-c_3)/2$. We prove that $M_{c_3}$ is isomorphic to the relative Quot scheme $\mathsf{Quot}_{\mathbb{P}^3 \times M_1/M_1}(\mathscr{R},n)$, where $\mathscr{R}$ is the universal reflexive sheaf over $M_1$. Our technique combines (i) Bridgeland-type wall-crossing in Donaldson–Thomas theory, (ii) the theory of good moduli spaces, (iii) deformation theory in dgla and Ext-quiver language. We deduce that $M_{c_3}$ is connected, and we analyse its \emph{smoothable component} $M_{c_3}^{\mathsf{main}}$, proving it is rational and generically smooth of dimension $4n+3$. We further prove that $\dim \mathrm{Sing} M_{c_3} \geq 4n-2$ for all $n \geq 2$. Finally, we provide a geometric characterisation for the cases $n\leq 2$. We show that $M_{-1}$ is a smooth rational projective variety of dimension 7 and compute its motive in the Grothendieck ring of varieties, while $M_{-3}$ is shown to be an integral, normal variety of dimension 11 that is regular in codimension 4.

comments
58 pages, comments welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.01961 ↗

Let $π\colon X\to S$ be a smooth ramified cyclic cover of an anticanonical rational surface, with $κ(X)\geq0$, and let $A$ be a divisor on $S$. We prove a Reider-type theorem for syzygies: for every integer $p\ge 0$, the adjoint divisor $K_X+π^*A$ satisfies Property $\mathrm{N}_p$ provided that $A\cdot C\geq p+3$ for every curve $C\subseteq S$ with $C^2\le 1$. One ingredient is a syzygy criterion for finite covers that reduces the weight-two Koszul vanishing on $X$ to weight-one vanishing for the nontrivial character modules on $S$. The most delicate case, in which $\dim|-K_S|=0$ and $K_S^2<0$, is handled by a separate geometric argument.

comments
Comments are welcome
fields
Algebraic Geometry, Commutative Algebra
pdf ↗ page arXiv:2611.02000 ↗

We recall the construction of the Coxeter-Todd principally polarized abelian sixfold, and study its special properties. We show that the base locus of the Gamma00 linear system on the Coxeter-Todd sixfold consists of 253 points, disproving the stronger version by Donagi and Beauville–Debarre of the Gamma00 conjecture of van Geemen and van der Geer. This also leads us to construct explicit indecomposable 7-dimensional principally polarized abelian varieties that are not Jacobians, but lie in the so-called Big Schottky locus, thus disproving the corresponding conjecture from the Schottky-Jung approach to the Schottky problem. We furthermore show that while no even theta constant vanishes for the Coxeter-Todd sixfold, its associated Scorza quartic is identically zero. Finally, we show that there exist two different theta level (2,4) structures on the Coxeter-Todd sixfold, for which the sets of second order theta constants are projectively equal. This disproves the expected injectivity of the second order theta constant map for all genera starting with 6.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.02013 ↗

We prove normality of closures of the conormal bundle to certain Schubert cells in the flag variety for $\operatorname{GL}_n$ coming from Grassmannians. Our argument uses a Zelevinsky-type resolution of singularities, and through a sequence of cohomological computations based on the Borel–Weil–Bott theorem, we reduce normality to a problem about Kronecker coefficients, which we solve by applying results of Knutson and Tao from honeycomb theory.

comments
20 pages, comments welcome
fields
Algebraic Geometry, Representation Theory
pdf ↗ page arXiv:2611.02261 ↗

We provide a novel, homotopy theoretic model for the motivic Eilenberg–Mac Lane spaces $K(Z_{(p)}(n), 2n) \in Spc(k)$ over fields of characteristic p. Using this, we determine their motives and, consequently, determine the motivic Steenrod algebra at the characteristic. Applications include the Hopkins–Morel isomorphism over arbitrary base schemes as well as the computation of the p-completed motivic stable stems and algebraic cobordism groups of fields of characteristic p. Along the way we expand the theory of normed algebraic structures in motivic homotopy theory, compare them to derived algebra at the characteristic, and produce a functor computing the motivic homology of the $P^1$-loop spaces of (certain) motivic spaces in terms of the motives.

fields
Algebraic Geometry, Algebraic Topology, K-Theory and Homology
pdf ↗ page arXiv:2611.02320 ↗

We construct Bridgeland stability conditions on the Kuznetsov components of smooth Fano hypersurfaces of degrees three, four, and six and dimension at least three, smooth quartic double fivefolds, and smooth Fano complete intersections of three quadrics. For odd-dimensional cubic hypersurfaces and quartic double fivefolds, every connected component of the numerical stability manifold is biholomorphic to $\mathbb C\times\mathbb H$. For general cubic sevenfolds and quartic double fivefolds, spherical twists produce infinitely many distinct connected components.

comments
35 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.02388 ↗

For a smooth complete intersection $V\subset(\C^*)^n$ of dimension $k$, $n\ge2k$, we bound the volume of its amoeba by $π^{2k}$ times a sum of mixed volumes, divided by the order of any finite group $Γ$ of symmetries commuting with the logarithmic map. For $n=2k\ge4$ almost every fibre of the amoeba map has a number of points divisible by $2|Γ|$. For $n=2k$ we characterise the varieties of maximal volume, show that for $k\ge2$ they are not real, and prove that no plane in general position in $(\C^*)^4$ has maximal volume. For $n>2k$ the bound is never attained, varieties of maximal volume have amoeba maps injective off a null set, and injectivity is generic. The amoeba map of almost every real $k$-plane is two-to-one, and that of the $k$-th symmetric power of a real line exactly $2^k$-to-one; conversely, real $k$-planes in general position in $(\C^*)^{2k}$ with $2^k$-to-one amoeba maps are symmetric powers. We also classify the real planes of $(\C^*)^4$ and study lines in $(\C^*)^3$.

comments
55 pages; all comments are welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.02496 ↗

Recently, Pardon introduced a universal curve counting framework, which allows him to show that curve counting on 3-folds is "generated" by local curves (in a precise sense). We implement this universal curve counting program for Calabi-Yau 4-folds, where a significant technical difficulty comes from the dependence of the virtual dimension on the genus, which leads to more complicated generators than just local curves. Our main techniques are combinations of deformation-theoretic and homotopy-theoretic methods with an adaptation of Pardon's generic transversality results, which allow us to establish a full set of (computable) generators for CY4 curve counting. As a result, we prove (a slight correction of) the Gromov-Witten/Pandharipande-Thomas correspondence with primary descendents for CY4-folds, formulated by Cao, Maulik, and Toda. From this, we additionally obtain integrality of Gopakumar-Vafa style invariants for CY4-folds, as conjectured by Klemm-Pandharipande.

comments
95 pages, 2 figures. Comments welcome!
fields
Algebraic Geometry, Symplectic Geometry
pdf ↗ page arXiv:2611.02717 ↗

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 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
42 pages
fields
Algebraic Geometry, Differential Geometry
pdf ↗ page arXiv:2611.03124 ↗

This article is motivated by the OpenAI manuscripts "Minimal metrics and interior injectivity for nef adjoints" and "Log abundance in characteristic zero". We establish a jet comparison for metrics with minimal singularities and use it to prove a dlt-type extension theorem. Combined with geometric arguments from the latter manuscript, this yields an alternative analytic proof of its Theorem~3.1.

comments
No figures
fields
Algebraic Geometry, Complex Variables, Differential Geometry
pdf ↗ page arXiv:2611.03225 ↗

We construct a canonical Du Bois 1-form on the nilpotent cone in the dual Lie algebra of any reductive group. Using this 1-form we give an intrinsic construction of Nadler and Yun's universal global nilpotent cone. In particular, we obtain a moduli interpretation of the universal nilpotent cone.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.03311 ↗

We give a formula for the spectral pairs of Newton non-degenerate polynomials with isolated singularities. This is a revised version of a conjecture proposed by Steenbrink fifty years ago. Although this conjecture fails in the non-simplicial Newton polytope case, we can find the correction term using the intersection complexes and the primitive intersection cohomologies of toric varieties associated with non-simplicial compact faces. To verify the correctness of the formula, we provide a sample code for Singular which computes the spectral pairs and compares the output with that of sppairs in Singular for the three variable case.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.03464 ↗

We prove that the number of maximal complex totally geodesic submanifolds of a smooth finite-volume non-arithmetic ball quotient is bounded linearly by its volume, with a constant depending only on the complex dimension. This gives a quantitative strengthening of the finiteness theorems of Bader–Fisher–Miller–Stover (Invent. Math., 2023) and Baldi–Ullmo (Ann. of Math., 2023).

comments
34 pages, comments are very welcome!
fields
Algebraic Geometry, Differential Geometry, Dynamical Systems
pdf ↗ page arXiv:2611.03514 ↗

Let $B$ be a complex manifold and $f:\bX\to B$ a derived \textit{complex-analytic} (not necessarily \textit{algebraic}) space with an oriented relative $(-2)$-shifted symplectic structure. We suppose that the closed symplectic form is locally exact in the completed relative de Rham complex, and construct a derived smooth manifold over $B$, independent of additional choices. When $f$ is proper and oriented, this gives integral virtual fundamental classes on its fibres. Our argument is heavily based on the strategy of Borisov-Joyce who already solved the \textit{algebraic} version of this problem, and uses \textit{derived differential geometry}. The proof also contains a relative analytic Darboux theorem a-la Brav-Bussi-Joyce, and has a natural analogue in Borel-Moore homology. We provide applications to complex-analytic enumerative geometry: in particular, to counting Pandharipande-Thomas pairs on compact and non-compact complex-analytic Calabi-Yau $4$-folds. This is part of a joint project with Felix Thimm dedicated to the proof of the GW/PT-correspondence for Calabi-Yau $4$-folds by implementing Pardon's programme in dimension $4$.

comments
V.1, any comments are very welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.03566 ↗

Algebraic genericity in the family of polynomial counterexamples to the recently solved Jacobian Conjecture for $N\ge3$ is investigated. The notion of affine-coneability is introduced and it is shown that this family is affine-coneable and 1-lineable, but not 2-lineable. Semigroupability is further studied with respect to coordinatewise multiplication and composition.

fields
Algebraic Geometry, Classical Analysis and ODEs, Functional Analysis
pdf ↗ page arXiv:2611.03572 ↗

Functional Analysis31

Let $T\colon F\to E$ be a bounded operator between Banach spaces and let $\overline T\colon FBL^{(p)}[F]\to FBL^{(p)}[E]$ be the lattice homomorphism induced by $T$ between the corresponding free $p$-convex Banach lattices generated by $F$ and $E$. We show that $\overline T$ is order continuous if and only if it is either zero or a lattice isomorphic embedding. For $p=\infty$, this holds precisely when $T$ is zero or an isomorphic embedding, while for $1\leq p<\infty$, apart from the zero operator, $T$ must be an embedding and the pair $(T(F),E)$ must have the operator-extension property POE-$p$. In addition, we study when $FBL^{(p)}[E]$ is order dense or majorizing in $FBL^{(q)}[E]$ for $p<q$.

code
github.com/pedrotradacete/FBLOrderContinuousLH ∎ Lean project (lakefile.toml, lean-toolchain) builds, no sorry at ee3cde5, checked 2026-11-03 build details
comments
20 pages, lean formalization available at https://github.com/pedrotradacete/FBLOrderContinuousLH
fields
Functional Analysis
pdf ↗ page arXiv:2611.00451 ↗

In previous work \cite{Zha26a}, the author established Clarkson–McCarthy type inequalities for several classes of operator families, including $\ell_p$--$\ell_p$ estimates and mixed $\ell_q$--$\ell_p$ estimates, by means of operator square-sum identities. The present paper has two main aims. First, using the tracial joint spectral measures recently introduced by O.~Heinävaara \cite{Hei25}, we obtain several refinements of the McCarthy–Clarkson inequalities, one of which confirms a conjecture of Audenaert \cite{AK17}. Second, combining tools from matrix analysis with complex interpolation theory, we establish Clarkson–McCarthy type inequalities for unitary orbits, unitarily invariant norms, and $\ell_s$--$\ell_s$ estimates, again in the framework of operator square-sum identities.

comments
19 pages. All comments are welcome!
fields
Functional Analysis
pdf ↗ page arXiv:2611.00459 ↗

In 2014, K.Guo and the second author constructed the first example of an infinite Blaschke product $B$ (a thin Blaschke product), for which the associated multiplication operator $M_B$ is irreducible on the Bergman space $L_a^2(\mathbb{D})$ over the unit disk $\mathbb D$. We take a substantial step forward toward characterizing the irreducibility of the operator $M_B$ on $L_a^2(\mathbb{D})$, or equivalently, the trivialness of the von Neumann algebra $\{M_B,M_B^*\}'$. This characterization indicates a close connection with the primeness of $B$ and with the two-component property of the Riemann surface $\mathcal{S}_B$ associated with $B$. The approach is built upon a nested family of connected components of the sublevel set $\{z\in \mathbb{D}:|B(z)|<t\}$ for $0<t<1$, which captures the function-theoretic and geometric feature of $B$.

comments
74 pages
fields
Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2611.00933 ↗

In this paper we study functions of pairs of unitary operators and pairs of contractions with commutators in the Schatten-von Neumann class $\boldsymbol{S}_p$. We obtain commutator estimates and prove that our functional calculus is multiplicative modulo $\boldsymbol{S}_p$. On the other hand, we show that our commutator estimates do not extend to the case $p>2$. We also obtain an extension of the Carey–Pincus trace formula. The main tool of this paper is a technique of triple operator integrals.

comments
12 pages
fields
Functional Analysis, Classical Analysis and ODEs, Complex Variables, Spectral Theory
pdf ↗ page arXiv:2611.01149 ↗

This paper is the third in the series of papers devoted to the explicit description of linear maps preserving the Cullis' determinant of rectangular matrices of size $n\times k$ with entries belonging to an arbitrary ground field which is large enough. In this part we study the remaining case where $k = 3$ and $n \ge k + 2 = 5$ and prove that every linear map preserving the Cullis' determinant admits the same description as for the case where $k \ge 4$ and $n \ge k + 2$ obtained previously.

journal
Special Matrices, vol. 14, no. 1, 2026, pp. 20250053
fields
Functional Analysis
pdf ↗ page arXiv:2611.01242 ↗

We show nonuniqueness for a discrete X-ray transform on $\mathbb Z^2$ under quadratic decay. We construct an explicit nonzero function in $\ell^1(\mathbb Z^2)$ with pointwise decay $O(|z|^{-2})$ whose sums over integer lines vanish. We also obtain an infinite-dimensional null space with the same decay assumption. Furthermore, we show a result which indicates that the decay rate $|z|^{-2}$ may be sharp and faster decay may imply uniqueness.

comments
19 pages, 2 figures
fields
Functional Analysis, Number Theory
pdf ↗ page arXiv:2611.01294 ↗

Kaplansky's second test problem for similarity asks whether $A\oplus A\sim B\oplus B$ implies $A\sim B$ for bounded operators on a separable infinite-dimensional Hilbert space. We answer this question in the negative, even for compact operators whose singular values satisfy any prescribed positive upper bounds tending to zero. We also show that cancellation can fail under the stronger hypothesis $J_2(T)\sim J_2(S)$ considered by Marcoux, Radjavi, Troscheit, and Zhang \cite{MRTZ}. For these operators, finite amplifications and primitive roots are similar exactly at even multiplicities and even orders, respectively. In contrast, cancellation in fixed matrix size admits a uniform bound on the condition number. This extends the finite type~$I$ results of Jiang, Ma, Shi, and Zhang \cite{JMSZ}. The bound also holds for simultaneous similarity of arbitrary families of matrices and can be chosen to tend to one as the amplified bound tends to one. We conclude that, in a finite type~$I$ von Neumann algebra, cancellation of doubles and cancellation of primitive square roots are each equivalent to boundedness of the orders of its nonzero homogeneous summands.

fields
Functional Analysis
pdf ↗ page arXiv:2611.01298 ↗

Let $\HH$ be a complex separable infinite-dimensional Hilbert space. We prove that every operator in $\BH$ is a sum of three commutators of idempotents and a product of two such commutators. Both numbers are best possible. The same is true for differences of idempotents, for operators similar to their negatives, and for operators anticommuting with an involution. Each of these four classes therefore has additive length three and multiplicative length two. We also construct nilpotent operators of order three that are similar to their negatives but cannot be conjugated to their negatives by any bounded involution. These results answer Question~7.22(a)--(c), the question in Remark~7.17, and the question about involutions in Section~2.9 of Marcoux, Radjavi and Zhang, \emph{J. Funct. Anal.} \textbf{284} (2023), 109854.

fields
Functional Analysis
pdf ↗ page arXiv:2611.01316 ↗

We give a short proof of the complete Crouzeix inequality with sharp constant $2$ for matrices of dimension at most three.

comments
4 pages
fields
Functional Analysis
pdf ↗ page arXiv:2611.01416 ↗

Let $K$ be a compact Hausdorff space and $p\in K$. We prove that the Banach space $C(K,p)=\{f\in C(K,\mathbb R):f(p)=0\}$ fails the ball fixed point property (BFPP) whenever $p$ is non-isolated, answering a question of Avilés, Japón, Lennard, Martínez-Cervantes and Stawski. Consequently, $C_0(L)$ fails the BFPP for every noncompact locally compact Hausdorff space $L$. Together with Barroso's characterization for $C(K)$, this yields complete topological classifications of the BFPP for $C_0(L)$ and $C(K,p)$. We also resolve a second question of Avilés et al., showing that the BFPP of $C(K)$ implies that of $C(K,p)$ for every compact Hausdorff space $K$ and every $P$-point $p\in K$ if and only if there are no measurable cardinals.

fields
Functional Analysis, General Topology
pdf ↗ page arXiv:2611.01486 ↗

We establish a general principle for bounding the matrix-valued analytic functional calculus $F\mapsto F(T)$ of a Hilbert space operator $T$, independently of the matrix size. It rests on two properties of an auxiliary Hilbert space of holomorphic functions: the accretivity of its moment map at $T$ and a uniform bound for its multipliers. The mechanism of OpenAI's direct proof of the complete Crouzeix conjecture is the instance in which these properties come from the positivity of the double-layer potential and from norm estimates for Faber series of a convex domain. The main advantage of our method is that the auxiliary space can be chosen freely, to fit the class of operators, and a well-chosen space can give sharp constants, also on domains that are not convex, simply connected or bounded. On every intersection of two disks of the Riemann sphere, for operators with both closed disks as spectral sets, we obtain a complete bound independent of the two disks, which is sharp for the quantum annulus and the strip. For operators, bounded or m-sectorial, with numerical range in a sector, our bounds improve on the complete Crouzeix inequality for every opening; they are optimal for the right angle, answering a question of Crouzeix, and nearly optimal for acute angles. On Jordan domains with regular real-analytic boundary, a space built from the exterior conformal map and the Faber polynomials of the domain gives complete bounds for operators whose double-layer potential is bounded below. They are optimal for the disk, recover the complete Crouzeix inequality on convex domains, and improve on earlier bounds, including bounds of Crouzeix and Greenbaum, also on nonconvex domains.

fields
Functional Analysis, Classical Analysis and ODEs, Complex Variables, Operator Algebras, Spectral Theory
pdf ↗ page arXiv:2611.01503 ↗

We present an alternating-chain argument intended to show that every lattice strictly singular operator from a real Banach lattice to a real Banach space is disjointly strictly singular. A hypothetical counterexample yields two LSS operators on a reflexive sequence lattice whose difference is bounded below. Quotienting by the range of that difference gives a common map bounded below on a positive tail cone. Finite chains of positive disjoint vectors, with alternating small differences, then lead to incompatible length estimates. We record the resulting operator and sequence consequences and extend the construction to common postcompositions with DSS errors. Independently of the proposed equality, we prove simultaneous nuclear restriction results for countable DSS families and uniform nuclear tails for norm-compact DSS families, together with common Hilbert-space factors and arbitrarily small nuclear corrections having a common infinite-dimensional kernel. Examples identify limits of these selection statements. The main equality is a candidate real-field proof; no complex-field equality is asserted.

fields
Functional Analysis
pdf ↗ page arXiv:2611.01504 ↗

Let $A$ be a bounded operator on a Hilbert space and let $u$ be a non-constant Blaschke product, finite or infinite. We prove that if the spectrum of $A$ does not meet the closure of the set of poles of $u$, then $u(A)$ is similar to a contraction if and only if $A$ is. This settles a conjecture of R.G. Douglas. For infinite products $u$, no additional condition on the zeros beyond the Blaschke condition is required. We also show that '$u(A)$ is similar to a contraction if and only if $A$ is' for all non-constant inner functions $u$ whose reflected singularity set, the closure of the set of poles together with the singular support, avoids the spectrum of $A$. We also prove a weighted resolvent version of the theorem, which allows the poles to accumulate on the spectrum to a limited extent; a column criterion for partial products, which is shown to force their norm convergence; and a simultaneous version for commuting tuples of operators tested by separated inner functions sharing one Lyapunov operator. For finite Blaschke products we obtain a polynomial form of the Lyapunov operator, which gives an estimate for the similarity constants. We also characterise the tuples of finite Blaschke products that form a uniform strong test collection: they are exactly the tuples that are injective, with non-vanishing joint derivative, on the closed disc. Finally, we show by examples that the separation hypothesis cannot be replaced by the existence of a bounded $H^\infty$ calculus, by the existence of a norm radial limit, or by the strong convergence of the partial products, even for Ritt operators.

comments
20 pages
fields
Functional Analysis, Complex Variables, Operator Algebras
pdf ↗ page arXiv:2611.01703 ↗

We study the Toeplitz operators on the Hardy space over the annulus and provide a complete characterization of them. Based on that, we single out a certain class of Toeplitz operators that satisfy the multiplicativity property and lead to a zero product theorem. We further extend the results for the general multiply-connected domain and prove the zero product theorem for Toeplitz operators on the Hardy space over such a domain.

fields
Functional Analysis
pdf ↗ page arXiv:2611.01717 ↗

Let $0<λ_1\leqλ_2\leq\cdots$ be the Dirichlet eigenvalues of an open set $Ω\subset\mathbb R^n$, $n\geq2$. We develop two Fourier-space refinements of the Berezin–Li–Yau argument. For every finite-measure open set, coordinate commutator identities and coupled scalar–vector projections lead to a one-dimensional variational constant $C_n^{\mathrm{new}}$ and the individual bound \[ λ_k\geq C_n^{\mathrm{new}}(2π)^2ω_n^{-2/n} |Ω|^{-2/n}k^{2/n}, \qquad \frac{n}{n+2}<c_n^{\mathrm{env}}<C_n^{\mathrm{new}}<1. \] Here $n/(n+2)$ is the classical Li–Yau individual coefficient and $c_n^{\mathrm{env}}$ is the coefficient associated with the uncoupled scalar envelope developed in our previous paper. Thus the displayed strict hierarchy separates the gain of the scalar energy envelope from the further gain supplied by the commutator coupling. For bounded open sets, a frequency-concentration operator, its first two traces, and the Ky Fan principle force Fourier mass outside the Li–Yau filling ball. A two-region bathtub argument then gives \[ \sum_{j=1}^kλ_j \geq \mathcal C_k^{(2)}(Ω) \frac{n}{n+2}(2π)^2ω_n^{-2/n} |Ω|^{-2/n}k^{1+2/n}, \qquad \mathcal C_k^{(2)}(Ω)>1, \] where $\mathcal C_k^{(2)}(Ω)$ is strictly decreasing in $k$ and converges to one, and \[ \mathcal C_k^{(2)}(Ω)-1\geq \frac{n+2}{2(n+1)^2} \left(\frac{ω_{n-1}}{ω_n}\right)^2 \left(\frac34\right)^{n-1}k^{-2/n}. \] Thus the sharp leading term in the Berezin–Li–Yau sum is supplemented by an explicit positive, volume-only correction of order $k$. Apart from boundedness in the concentration argument, no boundary regularity, convexity, or connectedness is assumed. These improvements do not prove Pólya's conjecture: the individual coefficient is below one, and the sum multiplier tends to one.

comments
28 pages
fields
Functional Analysis
pdf ↗ page arXiv:2611.01741 ↗

For integers $n\ge1$ and $N\ge0$, let $\mathbf g=(g_0,\ldots,g_N)$ be a vector of entire functions. We consider the generalized integral operator \ [T_{\mathbf g}^{(n,N)}f =I^n\!\left(\sum_{j=0}^N g_jf^{(j)}\right), \qquad (Ih)(z)=\int_0^z h(w)\dd w. \] We characterize its boundedness and compactness between Fock–Sobolev spaces $\F_m^p$ and $\F_\ell^q$, where $0<p,q<\infty$ and $m,\ell\ge0$ are integers. The coefficients of critical total degree determine the operator modulo compact operators and yield essential-norm estimates. In the Hilbert case, a Laurent Toeplitz representation gives the exact essential norm, a Fredholm criterion and an index formula. As an application, we obtain conditions for solutions of linear differential equations to belong to Fock–Sobolev spaces, including a necessary and sufficient polynomial zero condition in the Hilbert case. For entire functions $u_0,\ldots,u_N$ and $\varphi$, we also characterize boundedness, compactness and essential norms of the operators \[ L_{\mathbf u,\varphi}^{(N)}f =\sum_{j=0}^N u_j\,f^{(j)}\circ\varphi. \] The proofs use Carleson measure characterizations for finite sums of weighted differentiation operators on Fock–Sobolev spaces.

comments
43 Pages,
fields
Functional Analysis
pdf ↗ page arXiv:2611.01959 ↗

We construct two separable Banach spaces with the Daugavet property whose injective and projective tensor squares, respectively, fail the Daugavet property. Both examples arise from one sequence of finite-dimensional extensions. The first space is the completion of the increasing union of the extensions, whereas the second is the closed span of their coordinate functionals. We will also investigate the operator Daugavet properties of these spaces later in the paper, also highlighting natural examples of metric spaces \(M\) for which \(\operatorname{Lip}_0(M)\) has the Daugavet property but fails to have the weak operator Daugavet property. Independently of this, we will also prove that every Banach space admits a linear isometric embedding into a Banach space which is not isomorphic to any Banach space with the Daugavet property.

fields
Functional Analysis
pdf ↗ page arXiv:2611.02060 ↗

We introduce a family of Sobolev-type spaces on Gelfand pairs, built from the Stockwell transform: a function belongs to the space of a given smoothness when its Stockwell transform, multiplied by a weight that grows with the smoothness, is square integrable. We prove that these spaces are Hilbert spaces, that they form a decreasing scale under continuous embeddings, and that an interpolation inequality controls the norm at an intermediate smoothness by the norms at the two endpoints. Under integrability conditions on the weight and on the family of analysing windows, they embed continuously into Lebesgue spaces. Under a local domination condition on the window, we show that their elements have bounded continuous representatives. On the Euclidean motion group, where the Stockwell transform reduces to a windowed Hankel transform, this gives boundedness and continuity as soon as the smoothness exceeds half the dimension, which is the classical threshold for Euclidean spaces.

comments
12 pages
fields
Functional Analysis
pdf ↗ page arXiv:2611.02175 ↗

Boundary conditions can change the dimensional scale of a sharp functional inequality. We determine this change for inverse-square Hardy inequalities on the product lattices $\mathbb N^k\times\mathbb Z^{N-k}$. Their sharp constants satisfy $C_{N,k}\sim N^2Ψ(k/N)$ uniformly for $1\le k\le N$, where $Ψ(α)\sim2α$ at zero. The law gives linear growth for a fixed number of positive coordinates, every intermediate power for suitable sublinear choices, and quadratic growth for a positive proportion. We develop a method that connects exact uncertainty inequalities with Hardy inequalities through logarithmic localization, and combines this transfer with a block decomposition to cover all proportions. The transfer holds on weighted graphs with an explicit geometric error and controls the variational problem over arbitrary functions. A mixture of two Mathieu ground energies determines $Ψ$. At the fully positive endpoint, the variational problem defining $κ=Ψ(1)$ has a unique nondegenerate minimum and a unique positive energy–moment minimizing profile. We also prove strict comparison with the continuum coefficient in every sector for $N\ge9$, the optimal uniform dimension.

comments
35 pages, 1 figure, 2 tables. Submitted
fields
Functional Analysis
pdf ↗ page arXiv:2611.02206 ↗

In this paper, we develop refined Jensen–Mercer-type inequalities for strongly convex functions, including reverse inequalities in the differentiable case. We identify the relationships between these inequalities and known bounds. Our method exploits a structural decomposition of strongly convex functions together with classical convexity arguments. As applications, we obtain explicit and computable bounds for strongly $f$-divergences, leading to new quantitative estimates for major divergence measures such as the Kullback–Leibler divergence, $χ^{2}$-divergence, Hellinger divergence, Bhattacharyya-type divergence, and Jeffreys divergence.

fields
Functional Analysis
pdf ↗ page arXiv:2611.02518 ↗

In this paper, we obtain the sharp constants for Hausdorff–Young inequalities on simply connected, completely solvable Lie groups, and connected real semisimple Lie groups with finite center.

fields
Functional Analysis
pdf ↗ page arXiv:2611.02597 ↗

We establish an extension theorem for kappa-additive probability measures, where kappa is an arbitrary uncountable cardinal. Starting from a <kappa-algebra, we define an outer measure using coverings of cardinality at most kappa and characterise measurable sets by approximation in outer measure of symmetric differences. We prove that these sets form a kappa-algebra carrying a complete kappa-additive extension of the original measure. The extension is unique on the generated kappa-algebra, and its completion is the minimal domain admitting a complete kappa-additive extension. We also establish attainment of the covering infimum and show why the closure assumption on the initial algebra is essential. Examples include a strict extension of classical Lebesgue measure under the additional hypothesis add N = aleph_1 < cov N.

comments
12 pages
fields
Functional Analysis, Logic
pdf ↗ page arXiv:2611.02729 ↗

Let $K$ be a nonempty compact semialgebraic subset of the real line, and let $S$ be a saturated scalar description of $K$. We prove that every hermitian polynomial with bounded-operator coefficients that is positive semidefinite on $K$ belongs to the operator quadratic module generated by $S$. We also show that if such a polynomial has degree at most $\tt{d}$, then it admits a certificate of weighted degree at most $\tt{d}+c_S$, where $c_S$ depends only on $S$, not on the polynomial or the coefficient Hilbert space. In contrast to the scalar case, where natural preorderings admit the degree bound $\tt{d}$ independently of $K$, we show that no uniform additive constant exists for natural matrix preorderings. We construct quadratic $2\times2$ matrix polynomials positive semidefinite on unions of two intervals whose minimum certificate degrees in the corresponding natural preorderings diverge as one interval shrinks to a point, while the gap length remains bounded below. Conversely, we establish uniform bounds of the form $\tt{d}+C$ for families of interval unions contained in a fixed compact interval when interval lengths and gap lengths have uniform positive lower bounds. Our proofs develop two techniques that may be of independent interest. First, a quadratic reduction principle represents arbitrary-degree operator polynomials as compressions of quadratic ones on enlarged Hilbert spaces. A perturbation argument and the closedness of truncated operator quadratic modules then extend uniform degree bounds from the quadratic case to arbitrary degrees with linear degree bounds of slope $1$. Second, a rank-one symmetric matrix pencil transfers positivity on interval unions to $[0,1]$, where the operator Fejér–Riesz theorem yields certificates.

comments
34 pages
fields
Functional Analysis, Algebraic Geometry
pdf ↗ page arXiv:2611.02967 ↗

Given $A,B\in B\left(H\right)_{+}$, we consider the existence and uniqueness of a positive operator $C\in B\left(H\right)_{+}$ such that \[ \left(I+mA+nB+mnC\right)^{-1}=\int_{\left[0,1\right]^{2}}s^{m}t^{n}dE\left(s,t\right),\quad m,n\geq0, \] for a positive operator-valued measure $E$. This is a joint Hausdorff moment problem. Without $C$, it holds if and only if $AB=BA$. In dimension two we give a complete criterion for noncommuting pairs. In higher finite dimensions, nonexistence is generic. Under certain spectral and cyclicity assumptions, we obtain a necessary and sufficient condition on arbitrary Hilbert spaces. The completion is unique in this case. We also classify these pairs up to unitary equivalence. The class includes irreducible infinite-dimensional examples, even with continuous spectrum.

fields
Functional Analysis, Spectral Theory
pdf ↗ page arXiv:2611.03081 ↗

Let $Y$ be a closed subspace of a real Banach space $X$. Let $(Ω,Σ,μ)$ be a complete finite measure space and let $1<p<\infty$. We prove that $Y$ has property-$(U)$, property-$(SU)$, property-$(wU)$ in $X$ if and only if $L^p(μ,Y)$ has the corresponding property in $L^p(μ,X)$. No Radon-Nikodým assumption on $X^*$ is required. The proofs use $w^*$-measurable representations of dual functionals and a simultaneous scalar-lifting construction. A norm-minimal representation for an element in $L^p(μ,X)^*$ is found suitable in this case. We also study the point of continuity of the identity map under different topologies on the unit sphere of $L^p(μ,X)^*$. For Bochner-integrable functionals, the pointwise $w^*-w$-continuity yields the uniqueness of the extension to $L^p(μ,X^{**})$. Examples show why arbitrary $w^*$-measurable representatives cannot replace the norm-minimal representatives in this context.

fields
Functional Analysis
pdf ↗ page arXiv:2611.03203 ↗

For $A$ positive definite, $B$ positive semidefinite and $p\ge1$ we show that $\mathrm{tr}[(A+tB)^{-p}]=\int(1+t\ell)^{-p}\,dρ_p(\ell)$ for a positive measure $ρ_p$ on the spectral interval of $L=A^{-1/2}BA^{-1/2}$, and we identify the measure: it has atoms $\mathrm{tr}[(P_sA^{-1}P_s)^p]$ at the eigenvalues of $L$ and a continuous density, an integral of Heinävaara's tracial joint spectral measure along rays. For integer $p$ the positivity of $ρ_p$ follows from the positivity of Heinävaara's measure alone, and the density is a sum of Curry-Schoenberg B-splines; for real $p$ the representation is obtained by inverting Heinävaara's transform. For $0<p<1$ the function is a Stieltjes function of order $p$ only if $[A,B]=0$, but a positive representation of order one holds, with an explicit density. Along $A_p=pI+A_0$, $p\to\infty$, the measures converge to the measure of Stahl's theorem (the Bessis-Moussa-Villani conjecture) for $\mathrm{tr}\,e^{-(A_0+tB)}$.

fields
Functional Analysis, Mathematical Physics
pdf ↗ page arXiv:2611.03208 ↗

Motivated by the pressure formation problem for hydrodynamic models with nonlocal interactions, we classify strong Lebesgue lower bounds for the Riesz energy functional and for a determinant functional arising from the theory of compensated integrability. The classification covers all integrability exponents in $(0,\infty]$ within the class of confined log-concave densities. These geometric assumptions are motivated by counterexamples for general densities. On the whole space, neither functional controls any fixed Lebesgue quasi-norm. Under confinement, lower bounds fail for exponents greater than one, whereas $L^1$ bounds hold for the energy in every dimension and for the determinant only in dimension one. The log-concave estimates hold at sharp integrability exponents and follow from endpoint Lorentz bounds for confined quasiconcave densities and a weak-to-strong lemma. In particular, the energy estimates provide a geometric lower-bound counterpart to the classical Hardy-Littlewood-Sobolev inequality.

fields
Functional Analysis
pdf ↗ page arXiv:2611.03215 ↗

We give a new, simpler proof of sharp stability for the Prékopa–Leindler inequality. In contrast to the main arguments from Figalli, van Hintum and Tiba~\cite{FigalliVanHintumTibaPL}, our proof hinges mostly on the sharp stability theory for the Brunn–Minkowski problem, developed by the same authors \cite{figalli2024BM}, and on the idea of using a height transportation approach in order to match level sets. As a by-product of our techniques, we are able to prove the sharp dependency on $τ= \min\{λ,1-λ\}$ in the Prékopa–Leindler stability constant whenever one of the inputs is logarithmically concave, producing a new, simplified proof of two of the main results from~\cite{FigalliVanHintumTibaPL}. Finally, in the same fashion as Kristály and Pîrvuceanu \cite{kristaly2026quantitative}, we are able to obtain new stability results for the Bakry-Emery log-Sobolev inequality and for the Talagrand inequality. Due to the sharpness of the inputs, these results are optimal in terms of exponents. We moreover show that the $L^1$ nature of the distance in such results \emph{cannot} in general be improved to any other $L^p$ distance, where $p>1.$

fields
Functional Analysis, Analysis of PDEs, Probability
pdf ↗ page arXiv:2611.03295 ↗

Let $1<p<\infty$ and let $w:\mathbb{Z}\to(0,\infty)$ be a weight. When is the weighted space $\ell^p(\mathbb{Z},w)$ an algebra with respect to convolution? A well-known sufficient condition is that $(w^{-q}*w^{-q})/w^{-q}$ be bounded on $\mathbb{Z}$, where $q:=p/(p-1)$ is the index conjugate to $p$. We present an example to show that this sufficient condition is not necessary.

comments
20 pages
fields
Functional Analysis
pdf ↗ page arXiv:2611.03334 ↗

The Kaczmarz algorithm is an iterative projection method for reconstructing vectors in a Hilbert space from inner product data. However, sequences that are effective for this algorithm need not be frames and may lack standard frame reconstruction properties. We investigate these properties for stationary effective sequences, which were classified by Kwapień and Mycielski according to their spectral measures. In particular, we show that the corresponding Kaczmarz reconstruction series always converge unconditionally if and only if the spectral measure is atomic with finitely many point masses. We show that if the spectral measure is atomic, the stationary effective sequence and its auxiliary Parseval frame can be interchanged in the Kaczmarz reconstruction formula. Finally, we construct two stationary effective sequences with singular continuous spectral measures, one of which can be interchanged with its auxiliary Parseval frame in the reconstruction formula, and one of which cannot be interchanged.

fields
Functional Analysis
pdf ↗ page arXiv:2611.03358 ↗

We give a complete classification of all sets which are spectra of Beurling algebras of any locally compact abelian group, parametrizing them by compact convex sets in the dual of a certain locally convex vector space generated by the group. Hence, for example, a finitely generated free abelian group may enjoy a more complicated range of such spectra than the does rational numbers.

comments
19 pages
fields
Functional Analysis
pdf ↗ page arXiv:2611.03437 ↗

Classical Analysis and ODEs29

This paper proves a rigidity theorem characterizing the Gini-type Lorenz-area ordering under general decision-theoretic constraints together with weak Lorenz dominance, thereby resolving the characterization problem pursued in this line of research on egalitarianism. This does not, of course, bring the broader inquiry to an end. In a certain sense, it may instead mark a step beyond the infancy of our attempt to connect social choice theory, welfare economics, and formal moral philosophy through a common mathematical language. The main proof strategy was originally obtained by the author's own hand, though 5.6sol and Astra could effortlessly reproduce it without any additional hint.

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

The ad-conditions of Duistermaat and Grünbaum characterize bispectrality for a pair of differential operators. M.~Reach observed that a sequence of functions which is simultaneously an eigenfunction of a second-order differential operator and satisfies a recurrence relation of arbitrary order must satisfy a different kind of ad-conditions. We prove that the Reach ad-conditions are also sufficient, by an argument which is purely algebraic. This motivated us to explore ad-conditions in two new directions: to Dunkl differential-difference operators, where the coefficients of the ad-condition become elements of the Dunkl algebra and the reflection enters as a coefficient, and to matrix-valued orthogonal polynomials, where we exhibit ad-conditions for several families of exceptional matrix-valued polynomials satisfying five- and seven-term recurrence relations.

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

The second order Heisenberg Uncertainty Principle of Cazacu, Flynn and Lam is the uncertainty principle for the gradient of a function. Motivated by the question of Maz'ya on the uncertainty principle for divergence-free vector fields, solved by Cazacu, Flynn and Lam for $N=2$ and by Hamamoto for $N\ge3$, we study the second order principle for divergence-free fields $\mathbf{U}$ on $\mathbb{R}^N$. We prove that $\int|Δ\mathbf{U}|^2dx\int|x|^2|\nabla\mathbf{U}|^2dx\ge C_N^2(\int|\nabla\mathbf{U}|^2dx)^2$, where $C_N=1+\frac12\sqrt{N^2+8}$ for $N\ge3$ and $C_2=1+\sqrt2$. For the velocity of an incompressible flow, $\int|\nabla\mathbf{U}|^2$ and $\int|Δ\mathbf{U}|^2$ are, up to constant factors, the enstrophy and the palinstrophy, so the inequality bounds the palinstrophy from below in terms of the enstrophy and the spatial spread of the velocity gradient. The constant $C_N$ is sharp and larger than the constant $\frac{N+2}{2}$ for general fields, and all the optimizers are explicit fields with Kummer function profiles. We also obtain the sharp constants on the poloidal and the toroidal fields of each degree. Then we prove the sharp stability of the inequality. In sum form, the deficit controls a chain of squared distances to explicit families of poloidal and toroidal fields, with all the constants sharp. In product form, we find the sharp stability constant in all dimensions. For $N\ge4$ it is $\frac12(\sqrt{N^2+4N-4}-\sqrt{N^2+8})$, and it is attained by swirling flows, the toroidal fields of degree one. On the Fourier side, the sixth order poloidal problem becomes a first order Caffarelli-Kohn-Nirenberg inequality for radial functions, and its stability follows from weighted Poincaré inequalities with Gaussian type measures.

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

The convergence of spherical harmonic expansions (SHEs) of gravitational potentials below the Brillouin sphere has been a long-standing problem in potential theory and geodesy. In previous work, some of the present authors gave a necessary and sufficient condition for convergence along a fixed ray, formulated in terms of analyticity of a longitudinal average of the balayage density. In the present paper, we extend these results to arbitrary physical solid planets, assuming only that the planet is a compact subset of $\mathbb R^3$ and that its density belongs to $L^\infty$. We establish sharp regularity properties of the gravitational potential at the Brillouin sphere. The potential and its first derivative extend continuously to the sphere, the first derivative is locally Hölder continuous with exponent $1/2$, and the second derivative satisfies the optimal bound $V''(z)=O\bigl(\operatorname{dist}(z,\partial\mathbb D)^{-1/2}\bigr)$ under nontangential approach from the exterior. We also obtain sharp estimates for the spherical harmonic coefficients: $a_\ell=O(\ell^{-3/2}).$ If, for almost every latitude, the Brillouin sphere is a one-sided Lebesgue point from the interior of the longitudinally averaged density, then $a_\ell=o(\ell^{-3/2}).$ Both estimates are optimal. We explicitly recover the balayage density on the Brillouin sphere from the exterior gravitational potential, and its circular averages from the potential along a single radial line. Finally, we give a physical characterization of convergence of the SHE below the Brillouin sphere. If the SHE converges at such a point, then, after truncating the planet at any suitable intermediate radius, the gravitational potential of the removed outer part is completely determined by that of the remaining truncated planet. This provides a direct interpretation of the strong constraint imposed by convergence below the Brillouin sphere.

fields
Classical Analysis and ODEs, Mathematical Physics
pdf ↗ page arXiv:2611.00389 ↗

Christoffel-type determinant formulas construct both normalized polynomial families and their reproducing kernel for mixed-type orthogonality in several variables after independent rational matrix transformations on the two arguments. The pairing may have a rectangular matrix of functionals, with separate degree bounds on each component, and may be supported on an algebraic variety. The reduced matrices are calculated from the original biorthogonal polynomials, rational moments, polynomial division and the masses left free by division; their nonvanishing determinants characterize existence and uniqueness. For measure pairings the rational data are expressed by Cauchy and multivariate Fantappie transforms. Exact dimension counts incorporate the four matrix factors and the relations of the support. For normal degree-ordered original families and fixed factors, when the component degrees on each side differ by a bounded amount and the normalization dimension grows at most like one degree layer, the resulting orders are bounded on curves and grow at most linearly on surfaces. For pairings allowing scalar factors to move between arguments, called balanced pairings, an exact obstruction determines whether a bilateral mass decomposes into unilateral masses when the denominators act injectively. Residue duality provides coordinates for division and mass quotients on integral curves, including singular points, and on the finite surface quotients specified here. Explicit singular-curve families retain nondegenerate residue pairings as denominator zeros coalesce. Positive congruences admit a further reduction by orthogonal projection, while balanced pairings give simultaneous intertwining identities for all coordinate multiplication matrices.

fields
Classical Analysis and ODEs, Mathematical Physics, Algebraic Geometry, Spectral Theory
pdf ↗ page arXiv:2611.00457 ↗

The classical Bernstein and Erdős Conjectures for algebraic Lagrange interpolation on a finite interval were settled in two consecutive papers by Kilgore and by de Boor and Pinkus in 1978. Extending these results to weighted interpolation on unbounded intervals has proved to be more difficult. In a previous work, we established the Bernstein and Erd\H os Conjectures, together with the ``modified'' de Boor–Pinkus intertwining theorem, for weighted Lagrange interpolation on the half-line with exponential weights. Here we continue this line of research by considering the Hermite weight on the whole real line. Our main result is the Hermite-weighted analogue of the Bernstein and Erdős conjectures together with the appropriate version of the de Boor–Pinkus intertwining theorem. A key ingredient in the classical proofs is the nonsingularity of certain derivative matrices associated with the local maxima of the Lebesgue function. This property already breaks down in the exponentially weighted setting, although the resulting difficulties can still be resolved. In the Hermite-weighted setting, however, the situation becomes more intricate, requiring a substantial refinement of the previous approach.

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

For $1<q<p<\infty$ we study the $L^p\to L^q$ contractivity of the two-point operator $T_ω(a+bx)=a+ωbx$ with a complex parameter $ω$, extending the Weissler two-point condition, usually discussed in the range $1<p\le q<\infty$, to the reversed order of exponents. For $1<q<p<2$ we prove that the second-order necessary condition $|(p-2)-(q-2)ω^2|\le p-q|ω|^2$, obtained near $(a,b)=(1,0)$, is also sufficient; by duality the same description applies to $2<q<p<\infty$. The proof uses the method of characteristic flows. In addition, for $q\le2\le p$ the contractivity follows directly from $L^2$ contraction.

comments
19 pages, 1 figure. Keywords: two-point inequality, complex hypercontractivity, Weissler condition, logarithmic Sobolev inequality, characteristic flow
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.00835 ↗

Recently, Thangavelu introduced a scalar-valued Fourier transform on the Heisenberg group, built from the joint spectral theory of the sublaplacian and the central vector field. Around the same time, Krukowski characterised the classical Fourier transform on various groups from a small number of structural properties, paired with a normalisation hypothesis. In this paper, we obtain analogous results for the Strichartz Fourier transform on the Heisenberg group. Here, the spectral property is formulated jointly for the sublaplacian and the central vector field, and the translation property is based on a twisted form of left translation. The joint spectral property, paired with the twisted translation property and a normalisation at a single explicit test function, characterises the Strichartz Fourier transform on each ray of the underlying spectral set, the Heisenberg fan. The twisted translation property alone, paired with a Dirac delta property, already suffices. We also characterise the radial kernel of the transform on each ray by a Laguerre-type differential equation.

comments
17 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.01128 ↗

We investigate the $L^p$ norm convergence of Bochner-Riesz means $S_R^δf$, $f \in L^p(\mathbb{R}^+,dμ_β)$ associated to Laguerre expansions of type $β\geq -1/2$. For any given $1 < p < \infty$ and $β> -1/2$, we provide a complete characterisation of the order $δ$ for which these means are uniformly bounded on $L^p$ spaces. A particularly noteworthy phenomenon arises for $-1/3 <β<0$, where the admissible $(p, δ)$ region differs substantially from those for $ -1/2 \leq β\leq -1/3$ or $β\geq 0$. Interestingly, the convergence for $-1/3 < β<0$ is an interaction between the ranges $ -1/2 \leq β\leq -1/3$ and $β\geq 0$.

comments
42 pages
fields
Classical Analysis and ODEs, Analysis of PDEs
pdf ↗ page arXiv:2611.01221 ↗

We prove that constant functions are global maximizers for the endpoint Stein–Tomas inequality on $\mathbb{S}^1$, thereby determining its sharp constant. By the known characterization of the phases of maximizers, every nonzero maximizer then has the form $f(ω)=c e^{ix_0\cdotω}$, where $c\in\mathbb{C}\setminus\{0\}$ and $x_0\in\mathbb{R}^2$.

comments
22pages, no figures
fields
Classical Analysis and ODEs, Functional Analysis
pdf ↗ page arXiv:2611.01318 ↗

We study multiple orthogonal polynomial systems obtained from a Nikishin system of two measures by applying a Christoffel transform to one of the measures at a point $x=x_0$. We show that if $x_0$ separates the supports of the generating measures, then the modified systems remain perfect. As an application, we prove that the type I multiple orthogonal polynomials of a Nikishin system have no zeros in the gap between the supports of its generating measures.

comments
23p
fields
Classical Analysis and ODEs, Mathematical Physics, Spectral Theory
pdf ↗ page arXiv:2611.01395 ↗

We study the Marcinkiewicz–Zygmund property for finite differences. A difference \[ D(f,h)=\sum_{k=1}^n a_k f(b_kh) \] is said to have the MZ-property if, for every measurable function $f$, \[ D(f,h)=o(h) \quad\text{and}\quad f(h)=o(1) \] imply \[ f(h)=o(h). \] In this paper, we characterize all three-node differences \[ D(f,h)=af(qh)+bf(rh)+cf(sh) \] having the MZ-property. In particular, for irrational differences with distinct nodes, we obtain explicit necessary and sufficient conditions in terms of the coefficients $a,b,c$ and the nodes $q,r,s$. As an application, our results resolve an open problem concerning a second-order Riemann difference.

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

Meixner's classification asks which exponential generating functions can generate orthogonal polynomials. We follow the continuous Meixner family from this question to its moments, measures, and continued fractions. A beta integral and a bilinear identity establish positivity and orthogonality; Carlitz's Bernoulli and Euler constructions reveal further connections. Turning the parameter into a variable leads to rational orthogonality and Wall's fraction. We derive its Nevanlinna measure and unite the two spectral directions in a joint law with Cauchy marginals. Even finite pencils produce couplings with these exact marginals. Laguerre limits explain the gamma law governing joint extremes. Along the way, Meixner's scientific life, combinatorics, tangent numbers, and even zeta values illuminate the same structure.

comments
52 pages, 1 figure
fields
Classical Analysis and ODEs, Combinatorics, Functional Analysis, Probability
pdf ↗ page arXiv:2611.01422 ↗

In a 2005 survey, R. Szwarc asked for criteria, stated in the recurrence coefficients, for nonnegative linearization (property (P)) of finite orthogonal polynomial systems such as the Krawtchouk polynomials. For a finite three-term recurrence normalized to have row sums one, whose diagonal and downward coefficients have a constant nonnegative ratio, we prove that property (P) holds for every product, including products beyond the terminal degree, whenever the Newton coefficients of the profile $d_i=b_i+c_i$ are log-concave without internal zeros. The criterion contains the full positive Krawtchouk range and the dual $q$-Krawtchouk arrays, and through a quadratic decomposition of symmetric finite systems it covers Szwarc's quadratic system $Q_n$ in its sharp range $0<p_0\leq1/2$. As a limit to any such criterion, property (P) fails at coefficient distance $O((1-r^2)^N)$ from the Krawtchouk array of size $N$ with fixed ratio $c_i/d_i=r<1$. All theorems, corollaries and propositions are formalized in Lean 4.

code
github.com/skypher/szkraw ∎ Lean project (lean/lakefile.toml, lean/lean-toolchain) builds, no sorry at fbffa24, checked 2026-11-03 build details
comments
21 pages. Lean 4 formalization and exact diagnostics at https://github.com/skypher/szkraw
fields
Classical Analysis and ODEs, Combinatorics
pdf ↗ page arXiv:2611.01561 ↗

Wilson's intrinsic square function tests the input against all the cancellative functions of a given smoothness, at every location and scale. We show that it is dominated pointwise by a sparse square function, whose coefficients are the percentile oscillations of the input modulo polynomials, at every polynomial order below the smoothness plus one. These coefficients are local sizes, which nevertheless retain essentially all the cancellation: the weighted norms of the sparse square function are equivalent to smooth grand maximal norms, for all $0<p<\infty$ and $A_\infty$ weights, with explicit dependence on the weight. These are weighted Hardy norms in the range allowed by the smoothness. Consequences include potential bounds, and weighted Hardy space estimates with the sharp factor $[w]_{A_\infty}^{1/2}$. For the derivatives of Calderón–Zygmund operators, we characterize the corresponding square function estimates by testing conditions on the polynomial symbols of their wavelet resolution. In the quadratic setting, the factor $[w]_{A_\infty}^{1/2}$ detects a transition from $\mathrm{BMO}$ testing conditions to vanishing symbols.

comments
20 pages; submitted
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.01687 ↗

This paper establishes sharp variational estimates for families of averaging operators over smooth hypersurfaces in $\mathbb{R}^{n+1}$. For a hypersurface with $k$ non-zero principal curvatures at a given point, we prove that the $r$-variation operator $V_r(A_t f : t>0)$ is bounded on $L^p$ for all exponents satisfying $(k+1)/k < p < r(k+1)$, with operator norm depending explicitly on a translation parameter $D$. In the special case $k=n$ (i.e., non-vanishing Gaussian curvature), we show that the range $p<r(n+1)$ is optimal, thereby recovering and extending classical results for the sphere. Furthermore, for convex hypersurfaces of finite type (in the sense of Iosevich-Sawyer), we obtain variational bounds in the range $p_0 < p < 2r$, where $p_0$ is the contact index of the associated hypersurface. The proofs combine long-short variational decompositions, stationary phase analysis, vector-valued singular integrals, and local smoothing estimates for Fourier integral operators. These results unify and generalize earlier work on maximal functions and variational inequalities for averages over hypersurfaces.

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

We use Castillo's dual formulation of classicality for the alternating map to reduce polynomial time-and-band limiting to two scalar problems. The reconstruction preserves polynomial cutoffs, multipliers and concentration forms. It recovers the symmetric Dunkl constructions of Castro and Grünbaum and applies to continuous and discrete inputs. Scalar recurrences avoid moment factorizations; positive integrals and residual bounds control the accuracy of the concentration values.

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

In this paper, we study the signed error-sum function of tent map base series introduced by Dai and Tang in 2011. We show that the function is discontinuous at every dyadic rational in the open unit interval, although it was asserted to be continuous. We determine its values at these points and analyze its range, differentiability, and variation. We also obtain sharp covering estimates for its graph and calculate the Hausdorff, box-counting, and covering dimensions of the graph, which are $1$, $1$, and $0$, respectively. Moreover, we show that the signed error sum agrees with Lévy's function away from dyadic rationals and that the unsigned error sum is the Takagi function.

comments
17 pages
fields
Classical Analysis and ODEs, Number Theory
pdf ↗ page arXiv:2611.01955 ↗

In 1980 Calvert and Vamanamurthy asked whether a polynomial whose only critical point is a local minimum must attain its global minimum there. They gave counterexamples of every degree at least five in two or more variables and settled cubics in two and three variables and quartics in two variables, leaving open quartics in three or more variables and cubics in four or more variables. We resolve both remaining cases. First, we give an explicit quartic in three variables whose unique critical point is a nondegenerate strict local minimum, although the polynomial is unbounded below; the example extends to every dimension at least three, and its critical locus is a single point even over the complex numbers. Second, we prove that in every dimension a polynomial of exact degree three with a local minimum has another critical point, so that the cubic case holds vacuously; the proof is elementary and avoids the topological degree arguments used previously in two and three variables. Together with the results of Calvert and Vamanamurthy, this gives the complete classification of the local-to-global property by degree and dimension.

comments
9 pages, 1 table. Submitted to the Journal of Mathematical Analysis and Applications
fields
Classical Analysis and ODEs, Optimization and Control
pdf ↗ page arXiv:2611.02068 ↗

In this paper we study the boundedness properties of a \emph{hybrid} trilinear Hilbert transform characterized by a \emph{dual regime} which simultaneously exhibits 1) \emph{resonant} (zero curvature) features, \emph{i.e.}, modulation invariance properties, and 2) \emph{non-resonant} (non-zero curvature) features. Specifically, given $a\in(0,\infty)\setminus \{1,2\}$ and $\vecλ:=(λ_1,λ_2,λ_3,λ_4)\in (\mathbb{R}\setminus\{0\})^4$ with $λ_1\neq λ_2$ and $λ_3\neq λ_4$, we provide wide-range $L^p$ bounds for the trilinear operator $$ HTHT^a_{\vecλ} (f_1,f_2,f_3)(x):= p.v. \int_{\mathbb R} f_1(x-λ_1 t)\,f_2(x-λ_2 t-λ_3 t^a)\,f_3(x-λ_4 t^a)\,\frac{dt}{t},\quad x \in \mathbb{R}\,.$$ By combining variable multiresolution, multiscale wave-packet analysis, and Rank II LGC method, our present work establishes a common framework where the diverse methodologies of all of the following naturally converge: i) the maximal truncated bilinear Hilbert transform, ii) the Biest operator, iii) the hybrid bilinear Hilbert-Carleson operator, and iv) the non-resonant (curved) trilinear Hilbert transform. Ultimately, this work reveals that the hybrid trilinear transform sits on a critical intermediate scale between the purely non-resonant case and the purely resonant regime -- the latter remaining a challenging, major (open) problem in harmonic analysis.

comments
95 pages, 3 figures
fields
Classical Analysis and ODEs, Combinatorics, Dynamical Systems, Number Theory
pdf ↗ page arXiv:2611.02167 ↗

We construct a perfect set of uniqueness on the circle carrying a continuous probability measure which annihilates every $H^{(d)}$-set, simultaneously for all finite dimensions d. This gives a strict inclusion between the polar of the compact sets of uniqueness and the polar of the union of the classes $H^{(d)}$, answering a question raised in earlier work on these polars. The construction uses random binary increments of size comparable to the reciprocal of a product of square roots. A Gaussian sampling estimate gives a uniform Fourier-tail bound for all pseudomeasures supported by the resulting set, and also bounded atomic approximation and spectral synthesis. A separate energy estimate, stable under deletion of a small number of increments, yields full support for every limiting quasi-independent image of every positive measure absolutely continuous with respect to the constructed measure.

comments
15 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.02241 ↗

Let $c>1$ be noninteger, and let $Λ$ denote the von Mangoldt function. The averages \[ A_N^{c} f(x):=\frac1N\sum_{n=1}^{N} Λ(n)f\bigl(T^{\lfloor n^c\rfloor}x\bigr) \] satisfy the variational estimate \[ \bigl\|\mathcal{V}^r(A_N^{c} f:N\in\mathbb{N})\bigr\|_{L^p(X)} \lesssim_{c,p,r}\|f\|_{L^p(X)} \] for every $1<p<\infty$ and $r>2$, on every $σ$-finite measure-preserving system. In particular, the normalized averages along fractional powers of primes converge almost everywhere. The main arithmetic ingredient is a uniform bound on the correlations of $Λ-1$ with fractional-power exponential phases, yielding arbitrarily large powers of logarithmic gain. We obtain this estimate through short-interval polynomial approximation of the fractional phase and higher-order discorrelation estimates. The same approach yields almost-everywhere convergence to for the Möbius-weighted averages along $\left( \lfloor n^c \rfloor \right)_{n \in \mathbb{N}}$ throughout $1<p<\infty$.

code
github.com/anastasiosfragkosmath/Pointwise-Ergodic-Theorems-Along-floor-p-c-Palomar-Submission ∎ Lean project (lakefile.lean, lean-toolchain) builds with 3 sorry warnings at 87f3fd8, checked 2026-11-10 build details
fields
Classical Analysis and ODEs, Dynamical Systems
pdf ↗ page arXiv:2611.02465 ↗

Motivated by the works of Lee–Shuin and Borges–Foster on the Euclidean space, in this article we consider bilinear averages on the Heisenberg group $\mathbb{H}^n$ corresponding to some degenerate surfaces associated with the Korányi norm as well as Nevo–Thangavelu type averaging structures, and study the boundedness of the their full and lacunary maximal functions on various $L^{p}(\mathbb{H}^n) \times L^{q}(\mathbb{H}^n)$ spaces, for $n \geq 2$. For the full maximal functions, we obtain optimal range except possibly at the end points.

fields
Classical Analysis and ODEs, Functional Analysis
pdf ↗ page arXiv:2611.02745 ↗

We prove that the bilinear multipliers with symbols singular along a nondegenerate line, in the class of Muscalu, Tao and Thiele, map $L^{p_1}(\mathbb R)\times L^{p_2}(\mathbb R)$ into $L^{2/3,\infty}(\mathbb R)$ on the whole critical line \[ \frac1{p_1}+\frac1{p_2}=\frac32,\qquad 1<p_1,p_2<2 . \] This is sharp, as no estimate into $L^{p,\infty}$ with $p<\frac23$ holds uniformly over the class. Moreover, the generalized restricted weak type estimates of the class extend, without logarithmic loss, to the open short sides of the hexagon of exponents. For the bilinear Hilbert transforms, this confirms a folklore conjecture recorded by Thiele and the author, and removes the doubly logarithmic term in their endpoint estimates. The main step is an improvement over the multi-frequency Calderón–Zygmund decompositions already present in the literature. The bad part of this version has vanishing moments of order one at the top frequencies of the trees close to each Whitney interval, and vanishing moments of logarithmic order at the frequency bins where the tops of distant trees accumulate.

comments
27 pages; submitted
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.02768 ↗

We prove strict log-concavity of the positive functions $Θ$ and $Λ$ with one-sided and bilateral Laplace transforms $1/ξ(\tfrac12+\sqrt s)$ and $1/Ξ$, respectively, where $Ξ(z)=ξ(\tfrac12+iz)$. For either function, log-concavity is the Pólya frequency property of order two (PF$_2$). Without assuming the Riemann hypothesis (RH), but using its published verification up to height about $3\cdot10^{12}$, we further prove that both densities are PF$_{k_*}$ for $k_*=1\,810\,540\,931\,075$. The proof views $Θ$ as a small signed perturbation of a density that is PF of every order, with an error bound independent of the order, so the numerical check reduces to scalar inequalities. Since $Λ$ is a Gaussian mixture of $Θ$, it inherits the same order. Conversely, a pole obstruction shows that if either density is PF$_k$, then every zeta zero lower than the $(k+2)$-nd lies on the critical line. Finally, we prove that if RH holds up to height $T>\tfrac12$, then $Ξ$ satisfies the generalized Laguerre inequalities $L_n[Ξ](x)\ge0$ of every order $n$ for $|x|\le T-\tfrac12$, extending the case $n=1$ of Csordas, Ruttan and Varga (1991).

comments
53 pages; latest version and/or supporting material at: https://github.com/suvrit/preprints
fields
Classical Analysis and ODEs, Number Theory, Probability
pdf ↗ page arXiv:2611.02944 ↗

We show that any uniformly $d$-rectifiable subset of $\mathbb{R}^n$ is contained in an Ahlfors $d$-regular set in $\mathbb{R}^{n+1}$ which supports a $(1,1)$-Poincaré inequality. This provides a natural converse to a recent result of Azzam.

comments
69 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.03153 ↗

A remarkable theorem of S. Alesker, S. Artstein-Avidan, and V. Milman characterizes the Fourier transform on $\mathbb{R}^n$ as, in essence, the unique transformation on the space of tempered distributions that exchanges convolution with pointwise multiplication. In this paper, we extend this perspective to the setting of the Heisenberg group $\He$, focusing on functions taking values in a separable Hilbert space $\Hi$. We establish a characterization of the group Fourier transform on $\He$ in terms of convolution. More precisely, we characterize the group Fourier transform on $L^1(\He,\Hi)$ and $L^2(\He,\Hi)$. In addition, we obtain a similar characterization for the group Fourier transform of $\Hi$-valued Schwartz class functions on the Heisenberg group.

comments
22 Pages
fields
Classical Analysis and ODEs, Functional Analysis
pdf ↗ page arXiv:2611.03267 ↗

The hyperplane Furstenberg problem asks how small the Hausdorff dimension of $E\subset\mathbb{R}^n$ can be when a $t$-dimensional family of affine $(n-1)$-dimensional hyperplanes meets $E$ in sets of dimension at least $s$. For $0<s\le n-1$ and $0<t\le n$, we prove the sharp bound in $\mathbb{R}^n$ $\dim_{\mathrm{H}}E\ge\mathbf{F}(s,t;n,n-1)$, where $\mathbf{F}$ is Gan's Furstenberg index proposed in prime fields. We also construct examples attaining this bound for all parameters. Our main reduction theorem, Theorem 3.1, states that for $n\ge3$, $0<s\le n-2$, and $1<t\le n$, every weighted $(s,t)$ configuration $(E,H)$ at scale $δ$ produces a dual weighted $(s,t-1)$ configuration $(P,\mathcal{T})$ inside a hyperplane $H_{y_0}\cong\mathbb{R}^{n-1}$. The reduction uses radial projection and energy estimates for Frostman measures. Iterating this reduction and applying the Csörnyei–Stull incidence theorem yields the bound.

comments
23 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.03504 ↗

This paper is based on lecture notes taken and organized during the 17th Graduate Mathematics Intensive Training Program (Spring 2025), held at the Beijing International Center for Mathematical Research, in which Professor Shaoming Guo lectured on "An Introduction to Fourier Decoupling Theory." The main content includes an introduction to and proofs of $\ell^2$ decoupling inequality, together with its applications in number theory, harmonic analysis, and geometric measure theory. The writing follows Professor Guo's teaching style, proving theorems in an intuitive and heuristic manner; consequently, the text contains many figures to explain the ideas at hand, while also lacking some rigor. However, all of these geometric intuitions can be rigorously justified, albeit in a more complicated and technical way. The author hopes that readers will be able to understand, through these lecture notes, the geometric intuition hidden behind the cumbersome proofs, and thereby deepen their understanding of the relevant definitions and theorems. Rigorous proofs can be found in Professor Guo's forthcoming book, which interested readers may consult.

comments
77 pages, 75 figures
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.03549 ↗

Complex Variables17

We study probability measures on the space of holomorphic functions on the unit disk that are invariant under pre-composition by conformal automorphisms and give no mass to constant functions. We determine the slowest possible growth of functions supported by such measures. Let $M_f(R)$ denote the maximum modulus of $f$ on the hyperbolic ball of radius $R$ centered at the origin. We show that given a non-decreasing function $G:[1,\infty)\to(0,\infty)$, there exists an $\textrm{Aut}(\mathbb{D})$-invariant probability measure $μ$ on $\textrm{Hol}(\mathbb{D}, \mathbb{C}) \setminus \{\textrm{constant functions} \}$ such that $\log^+ M_f(R)=O_f(G(R))$ for $μ$ almost every $f$ if and only if $\int_1^\infty (R/G(R)) \, dR <\infty$. For the lower bound, we use a mass transport argument to show that almost every trajectory of the gradient flow of $\log |f|$ has finite energy. To establish sharpness, we construct holomorphic functions of slow growth on infinite Riemann surfaces.

comments
16 pages
fields
Complex Variables, Dynamical Systems, Probability
pdf ↗ page arXiv:2610.40057 ↗

A holomorphic function bounded in modulus by one in the unit disk has Taylor coefficients of modulus at most one. If the function has no zeros, Krzyż's conjecture predicts the stronger bound $2/e$ for every coefficient of positive order. We establish this bound for the seventh coefficient: $|a_7|\leq2/e$, with equality precisely for the functions $η\exp[-(1-ξz^7)/(1+ξz^7)]$, where $|η|=|ξ|=1$. Thus the largest possible value of $|f^{(7)}(0)|$ in this class is $7!\,2/e$, and the extremal functions are uniquely determined up to rotations of the variable and multiplication by a constant of modulus one.

fields
Complex Variables
pdf ↗ page arXiv:2611.00397 ↗

We show that for every $n\ge2$, $p>2$, and positive integer $m$, there exists a finite-volume pseudoconvex domain $D\subset\mathbb C^n$ with real-analytic strongly pseudoconvex boundary whose $p$-Bergman space $A^p(D)$ has dimension $m$. These domains admit smooth strictly plurisubharmonic exhaustions and satisfy $H^\infty(D)=\mathbb C$ and $\dim A^s(D)=\infty$ for every $0<s\le2$. Moreover, for every finite $s\ge p$, we have $\dim A^s(D)=\lceil pm/s\rceil$. As an application, we show that the Bergman projection fails to map $\mathcal{C}_c^\infty(D)$ into $A^p(D)$ and admits no bounded extension to $L^s(D)$ or $L^{s/(s-1)}(D)$ for any finite $s\ge p$.

comments
25 pages, comments are welcome!
fields
Complex Variables
pdf ↗ page arXiv:2611.00501 ↗

Let $\text{HQS}(\mathbb{R})$ denote the class of increasing homeomorphisms of the real line $\mathbb{R}$ that admit harmonic quasiconformal extensions to the upper half-plane $\mathbb{H}$. Kalaj and Pavlović proved that a homeomorphism $h$ belongs to $\text{HQS}(\mathbb{R})$ if and only if $h$ is bi-Lipschitz and the Hilbert transform of $h'$ belongs to $L^\infty(\mathbb{R})$, and asked whether $\text{HQS}(\mathbb{R})$ is a group under composition. We give a negative answer to this question. Further, we show that the Beltrami coefficients of harmonic quasiconformal mappings of $\mathbb{H}$ can be identified with the open unit ball of $H^\infty(\mathbb{H})$. Finally, we study the topology of $\text{HQS}(\mathbb{R})$ and prove that it is contractible in the topology inherited from the BMO-Teichmüller space.

comments
11pages
fields
Complex Variables
pdf ↗ page arXiv:2611.00860 ↗

Given $h_o: \mathbb{S} \to \mathbb{S}$, an orientation-preserving homeomorphism of the unit circle, we seek to establish very weak conditions so as to derive a modulus of continuity for $h_o$ and its inverse $h_o^{-1}$, then use these to derive various compactness properties for families of circle homeomorphisms and solutions to Beltrami equations.

comments
25 pages
fields
Complex Variables
pdf ↗ page arXiv:2611.00904 ↗

In this paper, we study Steinness of holomorphic fibre bundles. Over a compact Riemann surface, we prove that every holomorphic ball bundle is weakly $1$-complete and that its total space is Stein if and only if it admits no holomorphic section. We also obtain higher-dimensional Stein criteria for reductive ball bundles and affine bundles in terms of positivity of the canonical class. A topological obstruction to the $1$-convexity of holomorphic fibre bundles is also established.

comments
33 pages
fields
Complex Variables
pdf ↗ page arXiv:2611.01693 ↗

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 the polynomial convexity of smooth totally real discs contained in the boundaries of strongly pseudoconvex domains in $\mathbb{C}^2$. Using Wermer's classical example, we construct a bounded domain with smooth strongly pseudoconvex boundary containing a non-polynomially convex totally real disc. We also construct a nonsingular Levi-flat hypersurface in a non-Runge domain containing such a disc. This provides a partial negative answer, to a conjecture proposed in an earlier work. Furthermore, we prove that the Wermer graph over the closed disc of radius $R$ is polynomially convex for every $R\in (0,1)$. Finally, we establish a sufficient condition for the polynomial convexity of totally real discs contained in the smoothly bounded strongly pseudoconvex domains in $\mathbb{C}^2$.

comments
This is a preliminary version. Comments are welcome
fields
Complex Variables
pdf ↗ page arXiv:2611.02004 ↗

A zero set for a space of analytic functions is a set on which some nonzero function in the space vanishes; it is exact if it coincides with the full zero set of such a function. We construct zero sets that are not exact in the classical coefficient spaces $\ell_A^p$ of functions analytic on the unit disk for every $1\le p<2$. For $1<p<2$, a single Blaschke set $W$ is a zero set for every $\ell_A^p$ in this range, but is not exact for any of them. The endpoint case $p=1$, corresponding to the analytic Wiener algebra $\ell_A^1$, requires a separate construction, yielding a non-exact zero set that accumulates at only one point of the unit circle. The proofs combine quadratic characters, finite-dimensional Clark transforms, and logarithmic estimates in zero-free regions. We also establish sharp moment duality and an exact summability criterion for a family of regular polygons. For $p>2$, we construct two disjoint exact zero sets whose union is a uniqueness set. For these exponents, suitably chosen rotations also yield a continuum-sized family of nonzero closed shift-invariant subspaces of $\ell^p$ with pairwise trivial intersections, recovering a known existence result.

fields
Complex Variables
pdf ↗ page arXiv:2611.02159 ↗

We study a Schwarz Lemma on the matrix ball \[ \mathbb D^+=\{Z\in M_2(\mathbb C);\, \|Z\|<1\} \simeq U(2,2)/(U(2)\times U(2)), \] which arises naturally from the complexification of the quaternions. We prove Schwarz and Schwarz–Pick estimates on $\mathbb D^+$, construct its $U(2,2)$-invariant Riemannian Poincaré metric, and describe a Cayley transform to a tube-domain realization. The intrinsic spectral metric is the Kobayashi metric and is contracted by holomorphic maps. Comparing it with the Poincaré metric gives the sharp estimate $d(F(P),F(Q))\le \sqrt2\,d(P,Q)$ for every holomorphic self-map $F$ of $\mathbb D^+$; in general the constant $1$ is false. We also prove an infinitesimal rigidity statement and record a Burns–Krantz boundary rigidity theorem at the smooth part of $\partial\mathbb D^+$. Finally, we develop a conformally natural barycenter construction on the Shilov boundary $U(2)$. Every admissible probability measure has a unique barycenter in $\mathbb D^+$, the construction is $U(2,2)$-natural, and it gives a barycentric extension of suitable boundary maps. Under the natural admissibility hypothesis, a holomorphic self-map extending to $U(2)$ is the barycentric extension of its boundary values. Many aspects of this paper are motivated by quaternionic analysis, however, no prior knowledge of quaternionic analysis is required from the reader.

comments
42 pages, submitted
fields
Complex Variables, Differential Geometry
pdf ↗ page arXiv:2611.02161 ↗

We investigate sufficient conditions for the close-to-convexity and univalence of planar harmonic mappings. First, we establish a unified monotonicity criterion for harmonic mappings that incorporates the ordinary and odd harmonic cases. We then develop a criterion based on the total variation of successive coefficient differences. Unlike conventional monotonicity conditions, this approach allows the coefficient sequences to exhibit non-monotone behavior. Several previously established criteria for harmonic close-to-convexity are recovered as particular consequences. Applications are developed for harmonic mappings associated with Gaussian hypergeometric functions and Legendre polynomials, with explicit restrictions on their parameters.

comments
10 pages
fields
Complex Variables
pdf ↗ page arXiv:2611.02290 ↗

In this paper, we establish sufficient conditions for several geometric properties of confluent hypergeometric functions. Using differential subordination techniques, we derive parameter conditions ensuring lower bounds for the real part of the confluent hypergeometric function and sectorial subordination of its derivative. We also obtain criteria for strong convexity and strong starlikeness of prescribed order. In addition, we investigate the close-to-convexity and starlikeness of the confluent hypergeometric functions. Particular cases yield corresponding results for generalized Laguerre polynomials. The obtained criteria are compared with existing sufficient conditions, and their implications for the geometric theory of special functions are discussed.

comments
15 pages
fields
Complex Variables
pdf ↗ page arXiv:2611.02298 ↗

In the paper, using Nevanlinna's value distribution theory of meromorphic functions in $\mathbb{C}^m$, we study the problem: Let $f$ and $g$ be two finite order non-constant meromorphic functions in $\mathbb{C}^m$ such that $f$ and $g$ share $0$ and $\infty$ CM. If $\partial_{z_i}(f)$ and $\partial_{z_i}(g)$ share $0$ CM and if for one $n>1$, $\partial^n_{z_i}(f)$ and $\partial^n_{z_i}(g)$ share $0$ CM, where $i=1,2,\ldots,m$, then $f$ and $g$ have special presentations. Our finding extends the result of Köhler (Meromorphic functions sharing zeros and poles and also some of their derivatives sharing zeros, Complex Var., 11 (1989), 39-48) into higher dimensions. Moreover, we show by an example that the restriction on the growth of $f$ and $g$ is necessary.

fields
Complex Variables
pdf ↗ page arXiv:2611.02682 ↗

Given a polynomial $p\in \mathbb{C}[z,w]$ whose zeros lie outside the unit ball $\mathbb{B}_2$ of $\mathbb{C}^2,$ we study its local Weierstrass polynomial–obtained via the Weierstrass Preparation Theorem–and provide a strong version of the Nash curve selection lemma. These results lead to a characterization of the intersection of the zero set of $p$ with the unit sphere: $\mathcal{Z}(p)\cap\mathbb{S}_{2}.$

comments
12 pages
fields
Complex Variables, Algebraic Geometry
pdf ↗ page arXiv:2611.02838 ↗

We use a combination of the classical dead-end space method and the interpolation (by bounded holomorphic functions) method to affirmatively solve Corona and Gleason problems for familiar Banach spaces of holomorphic functions such as (Besov-)Lipschitz spaces of holomorphic functions on bounded symmetric domains (including the unit ball and polydisc) in $\mathbb{C}^n$, holomorphic mean (Besov-)Lipschitz spaces, (Besov-)Hardy-Sobolev spaces and some special classes of holomorphic mixed-norm (Bergman) spaces (including weighted Bergman spaces) as well as some special classes of holomorphic (mean) Besov-Lipschitz spaces on the unit ball in $\mathbb{C}^n$. Indeed, we extend our recent work on both problems for holomorphic Lipschitz algebras.

comments
33 pp.; The arXiv: 2302.03433 is divided in 3 parts: (1) discusses the test case for the corona problem, Extracta Math. Vol 41 (2026), which also gives a solution to Fornaess and Ovrelid's problem (1983); (2) provides a solution to the original corona problem; and (3) this article provides solutions to corona and Gleason's problems for certain familiar Banach spaces of holomorphic functions
fields
Complex Variables, Functional Analysis
pdf ↗ page arXiv:2611.02949 ↗

We show that for every integer $n\ge3$ there is a bounded pseudoconvex domain in $\mathbb{C}^n$ with smooth real-analytic boundary whose maximum boundary D'Angelo $1$-type is $16$, carrying a $\bar\partial$-closed form continuous on the closure and smooth in the domain with no bounded distributional solution. On each fixed domain, we also construct a uniformly bounded sequence of smooth $\bar\partial$-closed data for which every bounded solution has norm at least $ck^{1/320}$ for all sufficiently large $k$. Each datum in this sequence and a corresponding solution extend smoothly to a neighborhood of the closure. The obstruction comes from a singular curve in two weak complex tangential directions, whose normalization admits holomorphic functions that do not extend to a neighborhood of the curve.

fields
Complex Variables
pdf ↗ page arXiv:2611.03127 ↗

We introduce and investigate the main features of weakly Lipschitz mappings whose pointwise Lipschitz constant is controlled from above by the derivative of a set function. The main results give conditions under which such mappings belong to $W^{1,n}_{\rm loc},$ and show that the class contains metrically quasiconformal mappings as a proper subclass. In addition, under a Rado–Reichelderfer type oscillation assumption, we derive diameter control, image-measure bounds, sufficient conditions for Lusin's $(N)$-property, and an area formula.

comments
20 pages
fields
Complex Variables
pdf ↗ page arXiv:2611.03532 ↗

Group Theory16

For a finite group $G$, let $ω(G)$ be the largest size of a pairwise noncommuting set and put $z(G)=[G:\mathrm Z(G)]$. We determine the maximum possible central index under $ω(G)\le k$ for every integer $k\ge1$, giving an exact answer to Neumann's central-index question and sharpening Pyber's exponential upper bound. The maximum is $1$ for $k=1,2$, $(k-1)^2$ for $3\le k\le6$, $81$ for $k=7,8$, and $4^{\lfloor(k-1)/2\rfloor}$ for $k\ge9$. In the last range, with $r=\lfloor(k-1)/2\rfloor$, equality holds exactly when $G'\cong C_2$ and $G/\mathrm Z(G)\cong\mathbb F_2^{2r}$. We also obtain the sharp universal bound $z(G)\le(81/64)2^{ω(G)-1}$. All maximizers are classified up to isoclinism. The results extend to arbitrary groups with finite clique number through finite isoclinic representatives.

comments
20 pages. Comments are welcome
fields
Group Theory
pdf ↗ page arXiv:2611.00943 ↗

Let $R_n = \bigvee_{i=1}^{n} S^1$ be a finite connected one-dimensional CW complex with $n \geq 2$, and let $\mathrm{Out}(F_n)$ be the outer automorphism group of the free group $F_n$, where $π_1(R_n)\cong F_n$. Let $p_k:\tilde{R}_n\rightarrow R_n$ be the standard $k$-sheeted regular cyclic cover of $R_n$ induced by a $\mathbb{Z}_k$-action on $\tilde{R}_n$ (which is homotopy equivalent to $R_{n_k}$, where $n_k=k(n-1)+1$) generated by a free rotation through $2π/k$ of $\tilde{R}_n$. Let $\mathrm{Out}_{F_{n_k}}(F_n)$ be the liftable outer automorphism group associated with a standard $k$-sheeted normal cover $p_k$. For $n\geq3$, we show that $\{\mathrm{Out}_{F_{n_k}}(F_n)\}_{k\geq2}$ forms an infinite family of self-normalizing subgroups of $\mathrm{Out}(F_n)$. For $n\geq2$, these groups are maximal if and only if $k$ is prime. Furthermore, we derive explicit finite generating sets for $\mathrm{Out}_{F_{n_k}}(F_n)$ for $k\geq 2$ and $n\geq 3$. Let $\mathcal{C}$ be the infinite chain of roses, and let $q_n:\mathcal{C}\longrightarrow R_n$ be the standard infinite-sheeted cover induced by $\langle τ\rangle$, where $τ$ is the unit translation on $\mathcal{C}$. As a final application, we obtain a finite generating set for $\mathrm{Out}_{F_\infty}(F_n)$ when $n\geq 3$.

comments
19 pages, 2 figures
fields
Group Theory, Geometric Topology
pdf ↗ page arXiv:2611.01444 ↗

We exhibit two finitely generated residually finite groups $G_1$ and $G_2$ with isomorphic profinite completions $\widehat{G_1} \cong \widehat{G_2}$, such that $G_1$ has a faithful representation into $GL(d,\mathbb{C})$ but $G_2$ is not linear. This answers a question of Andrei Jaikin-Zapirain, Alexander Lubotzky, and Martin Bridson negatively. We also present two finitely generated residually finite groups $H_1$ and $H_2$ with isomorphic profinite completions $\widehat{H_1} \cong \widehat{H_2}$ satisfying the following. For every field $k$ with characteristic $p \geq 5$ and transcendence degree $r \geq 2$, there exists $d>0$ such that $H_1$ has a faithful representation into $GL(d,k)$. However, $H_2$ admits no faithful finite-dimensional representation over any field of positive characteristic.

comments
16 pages. Comments are welcome!
fields
Group Theory, Geometric Topology, Representation Theory
pdf ↗ page arXiv:2611.01672 ↗

We investigate various chain conditions for abelian normal subgroups of groups, following Robinson (1968). We focus on the maximal condition for abelian normal subgroups, an exceptional case excluded from his results except for some counterexamples. In particular we show that a hypercentral group satisfies the maximal condition for abelian normal subgroups if and only if it is is finitely generated nilpotent.

comments
10 pages
fields
Group Theory
pdf ↗ page arXiv:2611.01964 ↗

We prove the Díaz$\unicode[Arial]{x2013}$Park conjecture for sharpness of saturated fusion systems. More generally, for every saturated fusion system $\mathcal F$ over a finite $p$-group and every Mackey functor for $\mathcal F$ over the localisation $\mathbb{Z}_{(p)}$ of the integers at $p$, the higher limits of its contravariant part over the centric orbit category vanish in all positive degrees. In particular, the subgroup and normaliser decompositions of every $p$-local finite group $(S,\mathcal F,\mathcal L)$ over the $\mathcal F$-centric subgroups are sharp. This answers in the affirmative a question in the list of important open problems in [M. Aschbacher, R. Kessar and B. Oliver, Fusion Systems in Algebra and Topology, Cambridge Univ. Press (2011)], and proves the sharpness conjecture stated in [M. Aschbacher and B. Oliver, Fusion systems, Bull. Amer. Math. Soc. (2016)] and Conjecture 1.2 of [E. Yalç$\unicode[Arial]{x131}$n, Higher limits over the fusion orbit category, Adv. Math. (2022)]. The proof is algebraic and does not rely on the classification of finite simple groups.

comments
Lean and Rocq unconditional formalisations (about 62,000 and 100,000 lines of project source). Compilation on personal laptop took about 2.7 hours for Lean under Windows and 3.4 hours for Rocq under Linux. There is a report that describes the details of the formalisations and the underlying theories. See the acknowledgemets for more details
fields
Group Theory, Algebraic Topology, Category Theory, Representation Theory
pdf ↗ page arXiv:2611.02043 ↗

Let $G$ be a group. A normal subgroup $E$ is an $M$-subgroup if $E\cap N_1\cap N_2\neq1$ whenever $N_1\cap N_2$, $E\cap N_1$, and $E\cap N_2$ are non-trivial for normal subgroups $N_1,N_2$. We characterise these subgroups as the essential or relatively uniform normal subgroups. For finite $G$, an $M$-subgroup is either trivial, contains exactly one minimal normal subgroup, or contains the socle. Consequently, every normal subgroup is an $M$-subgroup precisely when the socle has $G$-chief length at most two. We obtain an explicit $M$-closure operation and describe the minimal normal subgroups of finite direct products. For crown-based powers, we use the known comparability of normal subgroups with the socle to describe the normal lattice in terms of Boolean or subspace lattices and the quotient above the socle. We then determine when the $M$-lattice retains the normal lattice, classify normal quotients and their automorphism orbits, and characterise quotient maps compatible with $M$-closure. Finally, we compute the maximal length of chains of $M$-subgroups in terms of the chief length and socle length of $G$.

comments
48 pages
fields
Group Theory
pdf ↗ page arXiv:2611.02078 ↗

Let $G$ be a finite group. L. Morgana, C. E. Praeger, A.E. Zalesski \cite {MOR} introduced the notion of almost maximal subgroup of $G$. A subgroup $H$ of $G$ is said to be almost maximal in $G$ if $N_G(H)$ is maximal in $G$. In this paper, let $AM(G)$ denote the number of conjugacy classes of all almost maximal subgroups of $G$. First, we prove that $G$ is Dedekindian if and only if $AM(G)=0$. Second, we show that the finite groups with $AM(G)\leq 1$ are supersolvable. Furthermore, we characterize the structure of finite groups with $AM(G)=1$. Final, we investigate a lower bound of $AM(G)$ for certain non-solvable groups.

comments
10pages
fields
Group Theory
pdf ↗ page arXiv:2611.02532 ↗

Let $G$ be a finite group and $p$ any fixed prime divisor of $|G|$. We prove that if every maximal subgroup of $G$ of order divisible by $p$ containing the normalizer of some Sylow subgroup is nilpotent then $G$ is a solvable group having a Sylow tower and $G$ is $q$-nilpotent or $q$-closed for each prime divisor $q$ of $|G|$.

fields
Group Theory
pdf ↗ page arXiv:2611.02596 ↗

Let $G$ be a non-solvable group and $p$ any fixed prime divisor of $|G|$. We prove that the intersection of all non-nilpotent maximal subgroups of $G$ of order divisible by $p$ containing the normalizer of some Sylow subgroup is $p$-closed, which provides a further generalization of Shidov's theorem and Shlyk's theorem.

fields
Group Theory
pdf ↗ page arXiv:2611.02608 ↗

This paper introduces the notion of a twisted building associated to a Coxeter system and an initial section of a reflection order. These are pairs of buildings and a map between them which depends on a twisted Bruhat order. It is proved that projection maps exist between components and that the common apartment property holds for a suitable notion of an apartment, generalising what is known for twin buildings. Several well-known examples are given, including a family of twisted buildings associated to an affine building and its façades.

comments
32 pages, comments are welcome
fields
Group Theory, Combinatorics
pdf ↗ page arXiv:2611.02925 ↗

This book develops a digital formulation of finite group theory, in which every finite group of order $N$ is represented as the alphabet $\{0,1,\dots,N-1\}$ endowed with the transported group product. Multiplication, inversion and related structure are written explicitly as integer operations on labels. The foundations treat digit functions, codes of permutations and $r$-ary operators, finite magmas, and constructions of laws from diagrams. Classical parts of finite group theory, including conjugacy classes, stabiliser chains and characters, are recast as identities between digits of codes. The book gives explicit digital laws for all groups of order at most 32, the finite quotients of the 17 plane and 230 space crystallographic groups, the symmetric and alternating groups, the finite simple groups of Lie type, and all 26 sporadic groups. For most sporadic groups the laws are obtained by chain constructions; for the Baby Monster and the Monster they are computed structurally from the 196884-dimensional representation and evaluated with the mmgroup package. The accompanying software archive reproduces the laws, tables and worked examples as verifiable integer data.

comments
306 pages. Software, scripts, data and certificates: https://doi.org/10.5281/zenodo.23881253
fields
Group Theory
pdf ↗ page arXiv:2611.03074 ↗

The Tits alternative asserts that a finitely generated linear group is either solvable-by-finite or contains a non-abelian free subgroup. Given a non-solvable-by-finite subgroup G of GL(d, F), where F is the field of complex numbers or a non-archimedean local field, we present methods to construct explicitly a non-abelian 2-generator free subgroup of G in specific cases. Our implementations in the computeralgebra system Oscar are publicly available.

comments
30 pages
fields
Group Theory
pdf ↗ page arXiv:2611.03175 ↗

We solve a major open problem from [D. Dikranjan, D. Shakhmatov, Algebraic structure of pseudocompact groups, Memoirs AMS 633 (1998)] by describing abelian groups which admit a pseudocompact Hausdorff group topology. First, we prove that an abelian group G can be equipped with a pseudocompact Hausdorff group topology iff it can be decomposed into a direct sum G=B\oplus H of a bounded torsion group B and agroup H satisfying |nH|=|H| for all positive integers $n$, such that both B and H admit a pseudocompact Hausdorff group topology. Second, for an unbounded abelian group G, we denote by m the minimal positive integer n such that |nG|=|kG| for all integers k\ge n. Then G admits a pseudocompact group topology iff both G[m]={g\in G: mg=0} and mG\cong G/G[m] admit a pseudocompact Hausdorff group topology.

fields
Group Theory, General Topology
pdf ↗ page arXiv:2611.03270 ↗

We characterize finite groups whose involutions form a single fusion class. In the solvable case, we show that the $2$-length is $1$, extending Thompson's theorem which states that a solvable group with all involutions conjugate has $2$-length $1$. For a nonsolvable group $G$, we prove that if its involutions are fused then they are conjugate; moreover, $G/\mathbf{O}_{2'}(G)$ is almost quasisimple. As an application, we obtain a restriction on $m$ for which an $m$-pyramidal Kirkman triple system can be realized under a nonsolvable group.

comments
15 pages
fields
Group Theory, Combinatorics
pdf ↗ page arXiv:2611.03366 ↗

We study the singular loci of the reduced $\SL_2(\CC)$-representation varieties $R_{m,n}$ of non-Hopfian Baumslag–Solitar groups $B(m,n)=\langle a,b\mid b^{-1}a^m b=a^n\rangle$. We determine their dimensions and profile functions, which list the numbers of irreducible components in descending order of dimension. The components have dimensions three or five. Their reduced singular loci have the explicit description \[ \Sing R_{m,n} =\left\{(\varepsilon I,Y): \varepsilon^m=\varepsilon^n,\quad (\tr Y)^2=\frac{(m+n)^2}{mn}\right\}, \] where $\varepsilon\in\{\pm1\}$ and $Y\in\SL_2(\CC)$. Each is a disjoint union of $μ$ copies of the smooth affine quadric $Q=\{(x,y,z)\in\CC^3:x^2+yz=1\}$, where $μ=2$ for $m-n$ odd and $μ=4$ for $m-n$ even. Thus its complex algebraic isomorphism type depends only on this parity. Each quadric is homotopy equivalent to $S^2$, so the singular locus has integral homology $\ZZ^μ$ in degrees zero and two and zero in all other degrees. An algebraic stratification gives its compactly supported E-polynomial $μ(q^2+q)$, with $q=uv$. At every singular point, $R_{m,n}$ is locally analytically the product of a smooth surface and a nodal curve.

comments
12 pages
fields
Group Theory, Algebraic Geometry
pdf ↗ page arXiv:2611.03402 ↗

Let $G$ be a finite $p$-group and let $χ,ψ\in\operatorname{Irr}(G)$. We prove that $$\operatorname{Van}(χ)\subseteq\operatorname{Van}(ψ) \quad\Longrightarrow\quad χ(1)\midψ(1),$$ where $\operatorname{Van}(θ)=\{g\in G:θ(g)=0\}$. Consequently, two irreducible characters of a finite $p$-group with the same vanishing set have the same degree. This answers a question attributed to J. Sangroniz and recorded by Hung, Moretó, and Morotti, extending the previously known case in which one character has degree $p$. The same divisibility conclusion holds for irreducible characters of finite nilpotent groups.

comments
6 pages
fields
Group Theory
pdf ↗ page arXiv:2611.03541 ↗

Representation Theory16

A max filter with Gaussian templates $a_1,\dots,a_D$ is a $G$-invariant map $\R^d\to\R^D$, where $G$ is a finite reflection group. As $D\to\infty$ its distortion converges a.s to the condition number of $M_G^{1/2}$, where $M_G$ is the second-moment matrix of a standard Gaussian vector moved into a fundamental chamber of $G$. We compute this limit exactly for the sign and dihedral groups, and show it grows as $Θ(\sqrt d)$, $Θ(d^{3/2})$ and $Θ(k)$ for the sign, symmetric and dihedral groups of order $2k$. The symmetric case bound uses a lower bound on the covariance of order statistics. For any finite $G$ we also show that the infimum defining the optimal lower Lipschitz constant of a piecewise-linear $G$-invariant map is a minimum.

fields
Representation Theory, Probability
pdf ↗ page arXiv:2611.00305 ↗

Let a general linear group act on a partial flag variety transitively, and consider the induced action of a Levi subgroup $L$. A Schubert variety is $\textit{$L$-spherical}$ if it is stable under the $L$-action and contains a dense open orbit of a Borel subgroup of $L$. It is $\textit{toric}$ if, in addition, $L$ is a torus. In this paper, we give a combinatorial classification of $L$-spherical Schubert varieties in partial flag varieties. This is achieved by applying Lakshmibai-Seshadri paths forming crystal graphs of Demazure modules. Previously, Hodges and Lakshmibai classified $L$-spherical Schubert varieties in Grassmannians. $L$-spherical Schubert varieties in complete flag varieties were treated independently by Gao-Hodges-Yong and Can-Saha. Our classification generalizes and unifies these results.

fields
Representation Theory, Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:2611.00321 ↗

Let $G=\exp(\g)$ be an exponential solvable Lie group, $π\in\widehat G$, and $Ω_π$ the coadjoint orbit attached to $π$ by the orbit method. The Zariski closure conjecture asserts that the Poisson characteristic variety $\VA(π_ν)$ of the deformed representation coincides with the Zariski closure of $Ω_π$ in $\g^*$. Known until now only in special situations, including the nilpotent case, it is proved here in full generality. Since the Hilbert space of $π$ is a quantization of the symplectic manifold $Ω_π$, the statement says that the passage back from the representation to the orbit, a dequantization, loses nothing: the orbit is recovered, up to Zariski closure, from the algebra alone. We also characterize the quasi-Frobenius exponential Lie algebras, those whose dual vector space is a Zariski-dense coadjoint orbit, through the triviality of the annihilator of an irreducible representation.

comments
10 pages
fields
Representation Theory
pdf ↗ page arXiv:2611.00757 ↗

We prove signed positivity for the expansion of a parabolic hybrid basis in the Kazhdan-Lusztig basis of a Hecke algebra. The coefficients have degree bounded by the length of the corresponding minimal coset representative. We deduce this linearity from Elias-Williamson's ordinary Rouquier linearity by a truncation argument. The result does not require the parabolic subgroup to be finite.

comments
6 pages
fields
Representation Theory
pdf ↗ page arXiv:2611.00882 ↗

We study $AV$-modules on an affine algebraic group $G$, that is, modules that admit compatible actions of the algebra of regular functions on $G$ and the Lie algebra of vector fields. A central role in this theory is played by the Lie algebra of jets of vector fields. Our main result is the Decomposition Theorem for the Lie algebra of jets of vector fields. We apply the Decomposition Theorem to describe differentiable $AV$-modules on $G$.

fields
Representation Theory
pdf ↗ page arXiv:2611.00905 ↗

The question of when a syzygy module or a module satisfying a Serre condition satisfies the cohomological vanishing conditions known as higher torsionfreeness has been extensively studied. In this paper, we address these questions using grade conditions introduced and studied by Auslander-Bridger and Auslander-Reiten. We also investigate homological conditions on Ext modules and, as an application, give a partial answer over commutative rings to a question of Auslander-Bridger concerning whether higher reflexive modules are higher torsionfree.

comments
19 pages
fields
Representation Theory, Commutative Algebra, Rings and Algebras
pdf ↗ page arXiv:2611.00913 ↗

In this paper, we give verifications of the inductive Navarro-Alperin weight condition in [8] for the Suzuki and Ree groups at all primes.

fields
Representation Theory, Group Theory
pdf ↗ page arXiv:2611.01608 ↗

We prove identities of Siegel-Weil type for Eisenstein series on general linear groups, attached to parabolic induction from two Speh representations corresponding to the same irreducible, cuspidal representation. Such an identity relates a residue, at a (simple) pole of an Eisenstein series, as above, to a value of a similarly structured Eisenstein series at a point of holomorphy.

fields
Representation Theory
pdf ↗ page arXiv:2611.01762 ↗

We introduce \emph{RaFH superalgebras}, which are Rees affine Frobenius Hecke superalgebras. These algebras are defined by generators and relations, using \emph{Frobenius-tensor superalgebras} to axiomatise tensor powers of Frobenius superalgebras together with their copairing elements. The RaFH superalgebras include, as special cases, the affine and degenerate affine Hecke algebras of type $A$, the affine Sergeev superalgebras, the affine wreath product algebras and quantum affine wreath algebras, as well as the recently introduced quantum wreath product algebras in the special case of the superflip braiding. We study the RaFH superalgebras from both structural and representation theoretic points of view. We prove a basis theorem for the RaFH superalgebras, construct universal Jucys–Murphy elements, and classify their simple modules over an algebraically closed field via atomic superalgebras, which are smaller RaFH superalgebras of Hecke, Clifford or wreath type. We then study \emph{CRaFH superalgebras}, which are the cyclotomic quotients of the RaFH superalgebras. We construct bases for these superalgebras, and compute the Gram determinants of natural trace forms, and use these to determine when these superalgebras are symmetric or Frobenius. To study the representation theory of the CRaFH superalgebras, we introduce the \emph{respectable algebras}, which is a vast generalisation of cellular algebras, standardly based algebras and finite dimensional affine cellular algebras, and give many examples illustrating their variety and ubiquity. We then show that CRaFH superalgebras are respectable algebras with weight poset given by multipartitions that are coloured by the representations of the underlying Frobenius algebra. This result can be viewed as a far-reaching generalisation of Murphy's bases into the setting of CRaFH algebras.

comments
101 pages. Comments welcome
fields
Representation Theory, Quantum Algebra, Rings and Algebras
pdf ↗ page arXiv:2611.01803 ↗

Let $\mathfrak{g}$ be a noncompact simple real Lie algebra with a Cartan decomposition $\mathfrak{g}=\mathfrak{k}\oplus\mathfrak{p}$. Let $K$ denote the connected Lie group corresponding to $\mathfrak{k}$. Then $K$ acts on $\mathfrak{p}$ via the adjoint representation. In this paper, we prove that for every $C\in\mathfrak{p}$ and every real linear map $L:\mathfrak{p}\to\mathbb{R}^2$, the linear image $L(K\cdot C)$ of the orbit $K\cdot C\subset\mathfrak{p}$ is convex in $\mathbb{R}^2$, except for the circle orbits when $\mathfrak{g}\cong\mathfrak{sl}_2(\mathbb{R})$ and $C\ne0$. By the two-piece property of isotropy orbits, any point omitted from the interior of the convex hull of a planar projection induces a nonzero class in the first integral cohomology of the orbit. This class vanishes directly in the non-Hermitian case, whereas in the Hermitian case we show that it vanishes by using the central circle action and a common-zero theorem of Gichev for Laplace eigenfunctions. Our approach treats classical and exceptional noncompact simple real Lie algebras uniformly and extends to real semisimple Lie algebras via Minkowski sums.

fields
Representation Theory, Functional Analysis
pdf ↗ page arXiv:2611.02575 ↗

We prove multiplicity one for a linear spherical pair associated with $\mathrm{GL}_4(F)\times\mathrm{GL}_2(F)$ and its unitary similitude analogue associated with $\mathrm{GU}(2,2)(F)\times\mathrm{GU}(1,1)(F)$. Both results hold for all irreducible admissible representations over non-Archimedean local fields of characteristic zero. Generalized Harish-Chandra descent reduces the proofs to the analysis of closed orbits and their normal representations. The unitary proof combines reductions to the linear case with a rational classification of closed orbits and a separate analysis of the remaining normal representations. We also establish multiplicity one for unitary Shalika periods of $\mathrm{GU}(2,2)(F)$ with arbitrary irreducible admissible coefficients. A theta-period identity relates these periods to the unitary spherical pair. By varying the splitting character, we prove that every irreducible admissible representation of $\mathrm{GU}(2,2)(F)$ occurs as a quotient of a suitable big theta lift, allowing the multiplicity-one bound to pass to the Shalika periods. The linear argument also recovers Rallis's multiplicity-one theorem for twisted Jacquet modules of $\mathrm{GL}_4(F)$.

comments
94 pages
fields
Representation Theory, Number Theory
pdf ↗ page arXiv:2611.02670 ↗

We study a family of generalized parabolic Demazure modules, i.e. of gl[x]-submodules of tensor products of integrable representations of the affine Lie algebra generated by tensor products of extremal vectors, and describe these modules by generators and relations. Realizing the Garsia–Haiman modules of two-row diagrams as fusion products of two local Weyl modules, we show that their y-graded components admit filtrations whose associated graded modules are isomorphic to tensor products of these generalized parabolic Demazure modules with the cohomology rings of Grassmannians. As a consequence, the Garsia-Haiman modules of two-row diagrams of a fixed size generate a distributive lattice, and the N!/2-conjecture holds for two-row diagrams.

fields
Representation Theory, Combinatorics
pdf ↗ page arXiv:2611.02749 ↗

For each integer $l\ge1$, we give closed formulas for the local energies on tensor squares of the level-$l$ perfect crystals of types $D_4^{(3)}$ and $G_2^{(1)}$, normalized to vanish at the all-zero coordinate tensors. The $D_4^{(3)}$ energy is the maximum of three defects, equivalently of nine linear forms in parameters of classical highest-weight elements. Eliminating these parameters yields the maximum of nine piecewise-linear functions of the twelve input coordinates. Tensor-compatible similarity identifies the $G_2^{(1)}$ energy at level $l$ with one third of the pullback of the $D_4^{(3)}$ energy at level $3l$, yielding the same coordinate formula. The formula has no explicit level dependence, respects natural coordinate-set inclusions between levels, and allows direct evaluation without the combinatorial $R$-matrix or crystal-graph traversal.

fields
Representation Theory, Combinatorics
pdf ↗ page arXiv:2611.02789 ↗

Representations of quivers over the virtual field $\mathbb{F}_1$ can be naturally extended to bound quivers with monomial and commutativity relations. In this paper, we introduce and study the Hall algebra $\mathcal{H}_{\mathbb{F}_1}(Q,I)$ for a bound quiver $(Q,I)$ equipped with such relations. As in the quiver setting, $\mathcal{H}_{\mathbb{F}_1}(Q,I)$ is a graded, connected, and cocommutative bialgebra, and the free subgroup generated by all indecomposable representations forms a Lie subalgebra. We study $\mathcal{H}_{\mathbb{F}_1}(Q,I)$ in detail for two special classes of bound quivers: Nakayama bound quivers and gentle one-cycle bound quivers. In both cases, we prove that for any triple $L, M, N$ of $\mathbb{F}_1$-representations over $(Q,I)$, the Hall number $g_{N,L}^M$ coincides with the evaluation of the corresponding Hall polynomial $φ_{N,L}^M(t)$ at $t=1$. Consequently, there exists a canonical isomorphism between $\mathcal{H}_{\mathbb{F}_1}(Q,I)$ and the degenerate Hall algebra $\mathcal{H}_1(Q,I)$, justifying Tits's $\mathbb{F}_1$-philosophy in these settings.

comments
28 pages, 2 figures
fields
Representation Theory
pdf ↗ page arXiv:2611.02904 ↗

We introduce hammock coordinates to study the combinatorial structure of partial silting configurations in the bounded derived category of a derived-discrete algebra $Λ(r,n,m)$. By extracting exact integer inequalities from the Bobiński–Geiß–Skowroński Hom-hammock formula, we establish a closed-form criterion for pairwise partial silting both within any $\mathcal Z$-component and across distinct components. Using this coordinate framework, we establish three primary results. First, we prove the universal upper bound $|S| \le n+m$ on the cardinality of any partial silting configuration $S$ of $\mathcal Z$-objects ---both globally via Bongartz completion in the silting-discrete setting, and combinatorially within a single component via a $Σ^r$-invariant staircase argument. Second, we prove that this bound is universally sharp by constructing an explicit L-shaped partial silting configuration of size $n+m$ for every $Λ(r,n,m)$, alongside specialized diagonal configurations. Third, we show that the configuration lattice carries a faithful action of the cyclic group $\mathbb Z/g$ where $g = \gcd(r+m, n-r)$. We conclude by showing a structural obstruction to local determination: pairwise partial silting of consecutive objects in the lattice ordering does not imply global partial silting, due to the strict additivity of a coordinate defect along chains.

fields
Representation Theory, Category Theory, Rings and Algebras
pdf ↗ page arXiv:2611.03204 ↗

We give a geometric analogue of Kottwitz-Shelstad transfer for a general class of reductive groups over p-adic fields with cyclic component groups of trivial or prime order. We prove that this geometric transfer coincides with Kottwitz-Shelstad transfer, adapted to the language of disconnected groups, assuming the local Langlands correspondence satisfying certain desiderata, including the Kazhdan-Lusztig hypothesis for the ambient group and its endoscopic groups. As an application of this geometrization, we prove Vogan's conjecture on local Arthur packets over p-adic fields: for quasisplit classical groups and their pure inner forms, all local Arthur packets are ABV-packets, and the distributions attached to these ABV-packets of Arthur type satisfy Arthur's local conjectures on twisted endoscopic character relations. This demonstrates the following general principle: for any reductive group G over a local field, an Arthur packet should be defined as an ABV-packet of Arthur type, equipped with the endoscopic pairing calculated by traces of actions on vanishing cycles or microlocalizations.

comments
Comments are welcome
fields
Representation Theory, Number Theory
pdf ↗ page arXiv:2611.03342 ↗

Geometric Topology14

The regular ideal right-angled 24-cell has volume $4 π^2/3$ and is the unique minimum-volume entirely ideal right-angled hyperbolic four-polytope. We prove that the next distinct volume is $8 π^2/3$ and that its unique equality case is the reflection double of the 24-cell across one octahedral facet. We also show that an entirely ideal right-angled four-polytope whose facets are regular ideal octahedra or their doubles across triangular faces decomposes into a chain of regular 24-cells, with opposite cutting facets in each intermediate cell.

code
github.com/sashakolpakov/CoxeterPolytopes ∎ Lean project (formal/lakefile.toml, formal/lean-toolchain) builds, no sorry at 36eeadd, checked 2026-10-30 build details
comments
18 pages; GitHub repository at https://github.com/sashakolpakov/CoxeterPolytopes/
fields
Geometric Topology, Metric Geometry
pdf ↗ page arXiv:2611.00118 ↗

The fundamental groups of compact $3$-manifolds are known to be residually finite. Feng Luo conjectured that a stronger statement is true, by allowing only finite groups of the form $\mathrm{PGL}_2(R),$ where $R$ is a finite commutative ring with identity. In a prior paper, "Linear representations of $3$-manifold groups over rings", we, together with two co-authors, gave an equivalent formulation of Luo's conjecture via faithful representations, investigated variants of the conjecture where the target group is of type $\mathrm{SL}_2, \mathrm{GL}_2, \mathrm{PSL}_2$, or $\mathrm{PGL}_2$ as in the original conjecture, and claimed to provide a $3$-manifold group which violated all four variants of the conjecture. We have discovered a flaw in the work, such that the existing proof is valid only for $\mathrm{SL}_2$ and $\mathrm{GL}_2$. Here, we provide a modified argument for the $\mathrm{PSL}_2$ and $\mathrm{PGL}_2$ cases.

comments
6 pages, including code; the final result remains exactly the same as in the original paper, only the argument changes. Erratum to arXiv:1703.06609
fields
Geometric Topology
pdf ↗ page arXiv:2611.00142 ↗

We prove that the stabilizer of a reflection mirror of the Couwenberg-Heckman-Looijenga lattice $\mathcal{C}(G_{29},3)$ induces a nonarithmetic lattice in $\operatorname{PU}(2,1)$. This lattice is not commensurable with any Deligne-Mostow lattice in $\operatorname{PU}(2,1)$ or any lattice in the twenty-two nonarithmetic classes listed by Deraux, Parker and Paupert.

comments
17 pages, comments welcome!
fields
Geometric Topology
pdf ↗ page arXiv:2611.00270 ↗

Let $M$ be a closed manifold with fundamental group $G$. A subset of conjugacy classes $E \subset \text{conj}(G)$ is said to be spectrally rigid if when two negatively curved Riemannian metrics have the same marked length spectra on $E$, then their length spectra agree on all conjugacy classes. In this work we study spectrally rigid subsets from a quantitative perspective. We show that, if the density of $E \subset \text{conj}(G)$, measured with respect to a fixed reference metric, decays more slowly than $T^{-1/2}$ then $E$ is spectrally rigid. We establish analogous rigidity results for Culler-Vogtmann Outer Space and show that the $T^{-1/2}$ threshold is sharp in this setting.

comments
19 pages, 2 figures, to appear in Journal of Topology
fields
Geometric Topology
pdf ↗ page arXiv:2611.00285 ↗

We show that there is no algorithm to decide whether or not a given 4-manifold is PL homeomorphic to the connected sum of 7 copies of S 2 x S 2 . We also show that the TOP and PL unknotting problems for all surfaces in the connected sum of 7 copies of S 2 x S 2 are unsolvable.

comments
15 pages
fields
Geometric Topology
pdf ↗ page arXiv:2611.00355 ↗

Let $E\xrightarrowπB$ be an oriented circle bundle over an oriented closed surface, and let $\mathcal E$ denote its Euler number. A \textit{quasisection} is a smooth surface $Q$, possibly with boundary, together with a generic smooth map $q:Q\to E$ such that $π\circ q(Q)=B$. The \textit{local formula} expresses the Euler number $\mathcal E$ of a bundle as a sum of the weights of the \textit{singular vertices} of a quasisection. In the present paper determine the minimal number $\mathcal N$ of singular vertices for closed and for bordered quasisections for a given circle bundle. For bordered quasisections, \[ \mathcal N_{\mathrm b}(E\to B) =\left\lceil\frac{3|\mathcal E|}{2}\right\rceil. \] For closed quasisections, If $\mathcal{E}$ is even, \[ \mathcal N_{\mathrm cl}(E\to B) =\frac{3|\mathcal E|}{2}. \] If $\mathcal{E}$ is odd, \[ \mathcal N_{\mathrm cl}(E\to B) =4|\mathcal E|. \] We also provide examples of quasisections that realize these minimal values.

fields
Geometric Topology
pdf ↗ page arXiv:2611.00679 ↗

In this paper, we establish several nonvanishing results for Floer lasagna modules $\mathcal{FL}(W,K)$ for a smooth compact connected oriented $4$-manifold $W$ and a knot $K\subset \partial W$, via the evaluation maps to link Floer homology. We first establish a general criterion: if a certain Heegaard Floer cobordism map associated with a smooth $4$-manifold $W$ is nonzero, then $\mathcal{FL}(W,U)\neq 0$, where $U\subset \partial W$ is a local unknot. Applications include the nonvanishing of Floer lasagna modules for $\#^m\overline{\mathbb{C}P^2}$ and for knot traces $X_n(K)$ when $K$ is slice and $n$ is a non-positive integer. In another direction, we show that for every nontrivial knot $K$ and every integer $n$, the Floer lasagna module $\mathcal{FL}(X_n(K),K_n)$ is nonzero, where $K_n\subset S_n^3(K)$ is the dual knot. Moreover, if $K$ is an L-space knot, then $\mathcal{FL}(X_n(K),K_n)$ is infinite-dimensional for all integers $n\ge \max\{2g(K),1\}$.

comments
27 pages, 5 figures; comments welcome
fields
Geometric Topology
pdf ↗ page arXiv:2611.00830 ↗

We investigate the expectation $E(v_2)$ of the Casson invariant $v_2$ for knots represented by two similar types of braids, the rosette $s$-braids which are products of $k$ factors $\prod_{1\leq 2i\leq s}σ_{2i}^{\pm 1}\prod_{1\leq 2i+\leq s}σ_{2i+1}^{\pm 1}$ and the quasitoric $s$-braids which are products of $k$ factors $σ_{1}^{\pm 1}σ_{2}^{\pm 1}...σ_{s-1}^{\pm 1}$. If $k$ is of the form $ns+1$, $\dfrac{E(v_2)}{c}\sim \dfrac{s+1}{24}$ where $c$ is the number of crossing points of braid; if $k$ is of the form $ns-1$, $\dfrac{E(v_2)}{c}\sim \dfrac{5-s}{24}$.\\ If we go through all $3$-braids, regardless of the shape of their diagram, we get $\dfrac{E(v_2)}{c}\sim \dfrac{1}{8}$. \\ For knots with a checkerboard diagram, $\dfrac{E(v_2)}{c}\sim \dfrac{1}{16}$.

fields
Geometric Topology
pdf ↗ page arXiv:2611.01188 ↗

Let $λ_L \approx 1.17628$ be Lehmer's number. We prove that no pseudo-Anosov homeomorphism of a closed orientable surface of genus six with orientable invariant foliations has stretch factor $λ_L$. This gives a negative answer to a question of Lanneau and Thiffeault on the minimal stretch factor in even genus. As a consequence, the minimal stretch factor $δ_6^{+}$ of such maps is the largest root of $x^{12}-x^{9}-x^{7}+x^{6}-x^{5}-x^{3}+1$, approximately $1.20189$. The proof combines the Lefschetz method of Lanneau and Thiffeault, the standardly embedded train tracks of Hironaka and Tsang, an elementary analysis of the transition digraph, and an obstruction from periodic conjugacy classes in the fundamental group.

comments
22 pages, 10 figures. Code at https://github.com/Lizi-Guo/lehmer-genus6
fields
Geometric Topology
pdf ↗ page arXiv:2611.01350 ↗

We prove that a finite-volume hyperbolic Coxeter polytope has dimension at most $81$, substantially improving Prokhorov's bound of $995$. A refinement of Prokhorov's method gives the intermediate bound $162$, while an extension of Vinberg's planar-angle comparison to the finite-volume setting yields the sharper bound. Both arguments combine improved weighting functions with estimates using cusp geometry to control weight contributions of angles at ideal vertices or edges incident to them.

comments
77 pages
fields
Geometric Topology, Combinatorics, Metric Geometry
pdf ↗ page arXiv:2611.01795 ↗

We construct Stein fillings diffeomorphic to complements of a connected symplectic unbranched multisection and a regular sphere fiber in the ruled surface $Σ_g\times S^2$. For every $g\geq2$ and every multisection degree $p\geq4$, a fixed contact three-manifold admits infinitely many pairwise nonhomeomorphic aspherical fillings of this form. Their first and second integral homology groups are $\Z^{2g}\oplus\Z/p$ and $\Z^{(2g-1)(p-1)}$, respectively, and their intersection pairings vanish. We vary the braid monodromy while preserving the marked contact boundary. Unbounded torsion orders in the first homology of regular unbranched covers of degree $p2^{p-1}$ detect infinitely many isomorphism types of fundamental groups. We also give an equivariant Weinstein handle construction for the cyclic filling $W_{g,4}$. The contact boundaries are supported by spinal open books with planar pages and have positive ordinary support genus.

comments
24 pages, 3 figures
fields
Geometric Topology, Symplectic Geometry
pdf ↗ page arXiv:2611.01833 ↗

We show that for an arbitrary compact orientable smooth $4$--dimensional manifold $M$ with a given open book structure on the boundary $\partial M \neq \emptyset$, which may be disconnected, there exists a generic smooth map of $M$ onto the $2$--disk which gives a relative trisection on $M$ consistent with the given open book structure on $\partial M$. This gives a new proof to the existence of a relative trisection on $M$. In fact, it turns out that every relative trisection can be obtained in this way. As a byproduct, we also show that $M$ always admits a decomposition into a PALF (positive allowable Lefschetz fibration) over the $2$--disk $D^2$ and a fiber bundle over the circle with a sutured compression body fiber, consistent with the given open book structure on $\partial M$ and with the surface bundle structure of the PALF over $\partial D^2$.

comments
19 pages, 13 figures
fields
Geometric Topology
pdf ↗ page arXiv:2611.02494 ↗

Let $N_g$ be a closed connected nonorientable surface of genus $g\ge1$, let $ω$ be a smooth positive density, and let $μ$ be a good measure. In this paper we generalize the Gambaudo–Ghys construction using homogeneous quasimorphisms on the central quotients of the braid groups of $N_g$. We prove injectivity of this map for density-preserving diffeomorphisms. For $g\ge2$ and quasimorphisms vanishing on the disc braid group, we obtain an injective map to $C^0$-continuous homogeneous quasimorphisms on $Homeo_0(N_g,μ)$. We also obtain undistortion criteria in $Homeo_0(N_g)$ and $Diff_0(N_g)$. For $g=1,2$ and every $d\ge2$, we prove $$ \dim\overline H_b^d(Homeo_0(N_g,μ))=\infty,\qquad \dim\overline{EH}_b^d(Diff_0(N_g,ω))=\infty. $$ Moreover, $\overline{EH}_b^d(Homeo_0(N_2,μ))$ is infinite dimensional in every positive even degree $d$. Here $\overline{H}_b^d$ and $\overline{EH}_b^d$ denote reduced bounded cohomology and reduced exact bounded cohomology, respectively.

comments
36 pages, one figure
fields
Geometric Topology, Group Theory, Symplectic Geometry
pdf ↗ page arXiv:2611.02847 ↗

Let $T(p,q;r,s)$ be the twisted torus link obtained from the torus link $T(p,q)$ by adding $s$ full twists to $r$ adjacent strands, and let $C$ be an unknotted circle encircling those strands. For all $p$, $q$, and $r$ we compute the multivariable Alexander polynomial of $T(p,q)\cup C$ in closed form. A relation of Silver and Williams between the Alexander polynomials of a link and of its $1/n$ Dehn fillings then gives a closed formula for the multivariable Alexander polynomial of every twisted torus link $T(p,q;r,s)$, answering a question of Adnan and Park. When $\gcd(p,q)=1$, so that $T(p,q;r,s)$ is a knot, the formula is a sum of $pr$ monomials with coefficient $+1$, divided by cyclotomic factors, and its exponents are governed by an elementary counting function on the orbit of $q$ modulo $p$. Because the numerator has no cancellation, we are able to give the degree for all $s$ and a simple non-fiberedness criterion.

fields
Geometric Topology
pdf ↗ page arXiv:2611.03265 ↗

Logic14

A grounded arithmetic counts a sentence as true only when a terminating process establishes it; a sentence no such process settles has no value. Such a logic can state that an event happens, but not that it never happens under unbounded choice. This paper extends such a logic so that it can. The base is Reflective Grounded Arithmetic (RGA) with Inductive Grounded Arithmetic (IGA)'s least-fixed-point reading and ground induction. It adds a separate greatest-fixed-point former $ν$ with Park's coinduction rule, proves that one former cannot carry both ground induction and coinduction, and adds a dichotomy rule: the classical disjunction between a least-fixed-point atom and the greatest-fixed-point atom of its dual, under a derivable premise that the body's leaves are decided. The systems are sound for an explicit model reading every $ν$-body at its greatest fixed point, hence consistent; they agree with the least model wherever it has a value and prove sentences it leaves without one. The dichotomy replaces the underivable hypothesis that an order is well-founded by the derivable one that its steps are decided; the change of model pays for the move. With ground induction the dichotomy derives the omniscience rule of the sibling arithmetic OGA, so the system has no semantics whose certificates for universals are its own proofs. The systems prove, as single sentences, that every decided tree is well-founded or has an infinite branch given by a term, total in the new model; that random assignment terminates while its divergent twin runs forever; that a fair loop terminates and the alternating-bit protocol delivers every message; that open games are determined; that the termination gap in Nakata and Uustalu's trace semantics closes; and that Cinderella wins the bucket game at capacity three. Isabelle/HOL checks every result.

comments
75 pages
fields
Logic
pdf ↗ page arXiv:2611.00176 ↗

We introduce logics of dependence and independence over polyteams (that is, databases with multiple relation schemes), in a similar way as in arXiv:1704.02158v3 [cs.LO]. On this basis, we develop a logical framework in which we can express (in formulas) relevant properties about the statistics of a repeated quantum experiment. In this framework, we formalize Bell's theorem, and the Kochen-Specker theorem as failure of logical entailments, as it was suggested in arXiv:2107.10817v3 [math.LO]. The key feature of polyteam logics in action here is their power to express both local and global properties, with respect to the set of possible measurements. The point of this is at least twofold. Firstly, as in arXiv:1102.0264v7 [quant-ph], it gives a high-level (information-theoretic) understanding of these physical phenomena, that is not intrinsic to the physical objects involved. Secondly, since logical entailment is often (partially) axiomatizable, this framework incites us to tackle the question of contextuality computationally. We also define semiring-weighted polyteams along with logics on them, and use them to recover the probabilistic versions of the contextuality theorems mentioned above.

comments
Article produced from the Master thesis of the author
fields
Logic
pdf ↗ page arXiv:2611.00814 ↗

We characterize the uniform computational strength of finding one-way Eulerian paths in countable graphs. 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-theoretical strength of the existence of an 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}$. We also study the problem $\mathsf{OrientEP}$ of orienting an undirected graph while preserving the existence of a one-way Eulerian path. We prove $\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}}$.

fields
Logic, Combinatorics
pdf ↗ page arXiv:2611.00818 ↗

The reflection calculus with one modality is denoted by $\mathsf{RC}_1$ and its quantified generalization is known as $\mathsf{QRC}_1$. These decidable calculi are of interest since they generate the strictly positive fragments of the (quantified) provability logic for theories like Peano Arithmetic and Heyting Arithmetic. We introduce analytic cut-free calculi ${\mathrm{GRC1}}$ and ${\mathrm{GQRC1}}$ for $\mathsf{RC}_1$ and $\mathsf{QRC}_1$ respectively. The new calculi derive sequents of the form $A\Longrightarrow B$ with $A,B$ strictly positive formulas. In particular, the new calculi do not use (multi)sets nor nested sequents. For both ${\mathrm{GRC1}}$ and ${\mathrm{GQRC1}}$ it is shown that the cut-rule is admissible. As a consequence, it is proven that the calculi are deductively equivalent to $\mathsf{RC}_1$ and $\mathsf{QRC}_1$ respectively. The cutfree systems are used to prove uniform interpolation for the two reflection calculi. In addition, ${\mathrm{GRC1}}$ is used to give a syntactic proof of Dashkov's Theorem to the extent that $\mathsf{RC}_1$ is the strictly positive fragment of the provability logic ${\mathsf{GL}}$. The paper also introduces non-analytic calculi that are conceptually easier but proof-theoretically behave badly. It is shown that even those systems allow direct cut-elimination: the benefits of the strict positivity outweigh the draw-backs of a non-analytic calculus in these cases.

fields
Logic
pdf ↗ page arXiv:2611.01248 ↗

We investigate whether classical recursion-theoretic notions defined by function domination remain unchanged when success is required only on sets of prescribed asymptotic density. We establish robustness for many such notions and uncover unexpected connections between familiar degree properties by comparing upper and lower density. In contrast, pdomination, as defined by Chong, Hoi, Stephan and Turetsky, is not robust under density weakenings. We also answer a question of Kjos-Hanssen and Nies by characterizing superhighness as domination with a threshold boundedly limit recursive in the oracle. As an application, we introduce supermaximal sets, a strengthening of maximality whose degrees are exactly the superhigh r.e. degrees.

fields
Logic
pdf ↗ page arXiv:2611.01420 ↗

Every K-degree has an upper bound of effective Hausdorff dimension one and Kurtz random sequences are cofinal in the K-degrees.

fields
Logic
pdf ↗ page arXiv:2611.01421 ↗

Order-invariant cluster first-order logic (CFO) and local-order-invariant first-order logic are two fragments of order-invariant first-order logic, both motivated by the study of invariant logics on classes of bounded degree. Our main result is that order-invariant CFO contains local-order-invariant FO on arbitrary classes of finite structures, settling the conjecture of Ghasemi and Grange that order-invariant CFO contains plain FO. By combining this with a collapse result of Ghasemi and Grange, we obtain the equivalence of FO, local-order-invariant FO, and order-invariant CFO on classes of finite colored graphs of bounded degree. The proof makes use of Gaifman normal form, which allows our translation from local-order-invariant FO to order-invariant CFO to be effective. Combined with the fixed-parameter tractability of model-checking for order-invariant CFO on bounded-degree colored graph classes, this shows that model-checking for local-order-invariant FO on bounded-degree colored graph classes is fixed-parameter tractable. To generalize our collapse and model-checking results beyond colored graphs, we use a method based on first-order interpretations which also yields a collapse of order-invariant FO to FO when restricted to graph classes of bounded shrub-depth. Finally, we give an application to the database-motivated frozen-witness logic of Abiteboul, Simon, and Vianu by showing that local-order-invariant FO contains deterministic frozen-witness FO, and thus that deterministic frozen-witness FO collapses to FO on classes of finite structures of bounded degree.

comments
19 pages
fields
Logic
pdf ↗ page arXiv:2611.01501 ↗

This paper shows that the pairwise intersection principle ($2\mathrm{IP}$) implies, over $\mathsf{RCA}_0$, the existence of a Cohen $1$-generic real relative to every given set. Together with the known implications, this yields the equivalence over $\mathsf{RCA}_0$ of the finite intersection principle (FIP), $2\mathrm{IP}$, and $1$-GEN. In fact, FIP is equivalent to $n\mathrm{IP}$ for every fixed $n\geq 2$. These results give affirmative answers to Questions~1 and~2 of Cholak, Downey, and Igusa, and to Question~9.10.26 of Dzhafarov and Mummert. The proof uses cumulative, nested supports satisfying a finite Helly property and a decoding argument based on a least selected label. Neither $Σ^0_2$ induction nor $Σ^0_2$ bounding is required.

comments
11 pages
fields
Logic
pdf ↗ page arXiv:2611.01571 ↗

This paper shows that the problem of producing a Cohen $1$-generic real relative to a given oracle is not Weihrauch reducible to the finite intersection principle (FIP). More strongly, no nontrivial computable FIP instance admits a single Turing functional that produces an absolute $1$-generic real from every enumeration of every maximal centered set of indices. The argument combines a $1$-generic real that computes no perfect tree all of whose paths are $1$-generic with local constancy and a parametrization of maximal centered sets. This answers Question~9.10.25 of Dzhafarov and Mummert.

comments
7 pages
fields
Logic
pdf ↗ page arXiv:2611.01576 ↗

For countable vocabularies, we extend the omitting types theorem for countable fragments of infinitary logic to Keisler's general real-valued structures by proving that the space of Henkin types of each such fragment is Čech-complete. The structures interpret function symbols arbitrarily and predicate symbols by bounded real-valued functions, while each formula carries a bound of its own. This extends the setting of Eagle's theorem from metric structures with a prescribed master metric to general structures whose vocabulary prescribes the sorts and bounds of the symbols. Following Keisler and Miller's treatment of logic without equality, we build models from closed terms. Morley's Baire category method then gives every satisfiable theory on a countable fragment a model with countable sorts omitting any countable family of types whose closed-term instances have empty interior in the space of Henkin types satisfying the theory.

fields
Logic
pdf ↗ page arXiv:2611.02247 ↗

We prove that the family of coset relations of $F_σ$ real linear subspaces of Banach space $\ell_1$ has no common upper bound among Borel equivalence relations in the sense of Borel reducibility. These relations are indexed by a well-founded tree. Consequently, on a Polish space, a universal $Σ^0_α$ equivalence relation exists exactly when $α=1$, and a universal $Π^0_α$ equivalence relation exists exactly when $α=1$ or $2$. This strengthens the earlier nonexistence theorem for a universal $F_σ$ equivalence relation. This also answers a question of Kanovei and Lyubetsky about universal equivalence relations in Borel classes.

comments
10 pages
fields
Logic
pdf ↗ page arXiv:2611.02531 ↗

We introduce $\mathbb{N}\mathtt{PDL}$, a resource-aware variant of Propositional Dynamic Logic ($\mathtt{PDL}$) capable of accounting for program costs measured by natural numbers (such as time or space in the sense of computability theory). In this framework, programs correspond to transition systems weighted by extended natural numbers, and the syntax of our logic includes formulas expressing which properties are reachable by program executions within specific cost constraints. First, we explain how the standard program constructs of non-deterministic choice, sequential composition, iteration, and tests are interpreted in this weighted setting and establish the validity of their corresponding reduction axioms. Using an appropriate adaptation of the (Fischer-Ladner) filtration technique, we proceed to prove decidability and completeness for $\mathbb{N}\mathtt{PDL}$ as our main results. We furthermore provide upper and lower complexity bounds for this logic using translations between standard $\mathtt{PDL}$ and $\mathbb{N}\mathtt{PDL}$.

fields
Logic
pdf ↗ page arXiv:2611.02971 ↗

The 1-2-3 Conjecture asserts that every finite graph without isolated edges admits edge weights from $\{1,2,3\}$ such that the sum function forms a vertex coloring. We study its Borel analogue for locally finite Borel graphs without isolated edges, proving that five weights suffice in general and four suffice for regular graphs. We obtain three weights for acyclic graphs admitting a Borel selection of a nonempty finite set of ends from each component. We also obtain $μ$-measurable and Baire measurable vertex-coloring $3$-edge weightings from $3$-colorings of the same definability, under probability measure-preserving and Baire quasi-invariance conditions, respectively.

comments
21 pages
fields
Logic
pdf ↗ page arXiv:2611.03320 ↗

An ideal $\mathcal{I}$ on $ω$ is called Farah if there are hereditary closed subsets $C_n$ of $\mathcal{P}(ω)$, for $n\inω$, such that $\mathcal{I}=\{A\subseteqω:\ \forall_{n\inω}\ \exists_{k\inω}\ A\setminus k\in C_n\}$. Farah asked in [Trans. Amer. Math. Soc. 356 (2004), no. 6] if every $\mathbf{F_{σδ}}$ ideal is a Farah ideal. We show that this is false by providing both tall and non-tall counterexamples. Moreover, we show that there is an antichain in the sense of Katětov order of length $\continuum$ consisting of $\mathbf{F_{σδ}}$ non-Farah ideals. We also investigate a closely related problem concerning sets of ideal limit points. We show that if $\mathcal{I}$ is an $\mathbf{G_{δσδ}}$ ideal on $ω$ and $x\in X^ω$ is a sequence in an uncountable Polish space $X$, then \[ Λ_x(\mathcal{I})=\left\{p\in X:\ \exists_{A\notin\mathcal{I}}\ x\restriction A\text{ converges to }p\right\} \] is $\mathbf{F_σ}$. This answers [Top. App. 312 (2022)] (partially) and [J. Symb. Logic, DOI: 10.1017/jsl.2026.10181]. Earlier it was known to be true only in the case of Farah ideals.

fields
Logic
pdf ↗ page arXiv:2611.03432 ↗

Metric Geometry14

Let $K \subset\mathbb{R}^d$, $d\ge2$, be a connected compact set and $φ(t)=tL(t)$ be a gauge function with $L$ non-increasing. We study intersections of $K$ with rectifiable curves and chord-arc curves. We show that if $\int_0^1\frac{dt}{φ(t)}<\infty$, then there exists a rectifiable curve $γ\subset\mathbb{R}^d$ such that $\mathcal{H}^φ(K \capγ)>0$. Moreover, for every $0<s<1$, there exists a chord-arc curve $γ$ such that $\textrm{H$.$dim}(K \capγ)\ge s$. Conversely, we show that if $K$ is uniformly porous on lines and $\int_0^1\frac{dt}{φ(t)}=\infty$, then $\mathcal{H}^φ(K \capγ)=0$ for every rectifiable curve $γ$ and $\textrm{H$.$dim}(K \capγ)<1$ for every chord-arc curve $γ$.

comments
15 pages
fields
Metric Geometry, Classical Analysis and ODEs
pdf ↗ page arXiv:2610.41510 ↗

We prove that the root lattice $D_4$ uniquely minimizes the normalized second moment among four-dimensional lattices, up to similarity. The computer-assisted proof combines the classification of secondary cones with integration over Voronoi cells and weighted sums of squares. In dimensions at least two, comparison with circular cones gives a lower bound in terms of the number of Voronoi facets, improving the sphere bound and recovering the hexagonal value in dimension two. We prove Ajjanagadde's circular-cone concavity conjecture and deduce the lattice case of his conjectured quantization bound.

fields
Metric Geometry, Information Theory, Combinatorics
pdf ↗ page arXiv:2611.00100 ↗

In this note we study the problem of packing infinite circular cylinders tangent to the unit sphere. For a given number of cylinders $N$, $N\geq 3$, the maximal common cylinder radius $R_N$ is the maximum $R$ for which there exist $N$ circular cylinders of radius $R$ with non-overlapping interiors, all tangent to the unit sphere. In 1990, Kuperberg conjectured that there does not exist a packing of more than 6 cylinders of radius one tangent to the unit sphere, that is, $R_7<1$. This conjecture was recently confirmed by an exhaustive computer-assisted case analysis. Here we prove new bounds for $R_N$ for small $N$ by considering an auxiliary configuration of spherical quadrilaterals. In particular, we provide a short geometric proof of Kuperberg's conjecture and show that $R_7<0.9978$.

fields
Metric Geometry, Combinatorics
pdf ↗ page arXiv:2611.00251 ↗

We prove a conjecture of András Bezdek on plank coverings of square annuli. A plank in a Euclidean space is the closed region between two distinct parallel hyperplanes, and its width is the distance between them. Let $Q$ be a unit square and let $H$ be a square of side length $1/2$ whose sides are parallel to those of $Q$. Then every finite family of planks covering $Q\setminus H$ has total width at least $1$. More generally, if an axis-parallel box with side lengths $h_1,\ldots,h_d$ is removed from the unit cube in $\mathbb{R}^d$ and $\sum_jh_j = d-1$, then every finite plank covering of the remaining set has total width at least one. The bounds are sharp.

fields
Metric Geometry, Combinatorics
pdf ↗ page arXiv:2611.00379 ↗

Bellman's lost-in-a-forest problem, Moser's worm problem, Lebesgue's universal covering problems, and the classical 'fits and covers' questions can be organized by a common obstruction principle: an object fits a region if some admissible group action places it in the region, whereas an escape object is one for which every placement fails to remain in the interior. In this paper, we develop a general theory of escape-covering duality for any dimension and explore several applications. For convex translation covers of all closed planar curves of Euclidean length one, we prove $ W \ge f(\sqrt3/9)+c_1>0.15545785378555,c_1=0.000009944944227372... $ Here $f(\sqrt3/9)$ is Wetzel's classical lower bound. For a rational polytopal Minkowski gauge and prescribed rational facet directions, we express universal closed-loop cover feasibility as a rational polyhedron in the facet offsets. After removing translations, minimum volume is attained at a vertex. Refining the facet directions gives explicit two-sided rational bounds for the unrestricted fixed-gauge worm constant. Four exact benchmarks recover known sharp values. The construction uses an elementary circuit–circumradius form of the established non-fitting-polygon and capacity theory. We supply its support and ledger derivation, the finite complete test family in arbitrary dimension, a cover vertex bound, and the resulting algebraicity statement. The surrounding escape–covering framework includes endpoint placement, attainment, gauge stability, and finite-to-continuum error bounds. For nonsymmetric gauges the objects are parametrized closed curves, so orientation-dependent length is retained. Through the published capacity identity, the improved Wetzel estimate gives a product volume–capacity factor below $1.023781939711102$ for every planar ellipsoidal gauge.

comments
83 pages including formalized proofs in Lean
fields
Metric Geometry
pdf ↗ page arXiv:2611.00569 ↗

Under the usual nondegeneracy assumptions, repeatedly projecting a fixed point onto the side lines of an $n$-gon returns its shape after $n$ steps. We explain this classical theorem through a short complex-number identity: the multipliers of one step move cyclically around the polygon. The same calculation allows a different common angle of projection at each step. A sharp angle-dependent contraction bound identifies the incircle centre as the maximiser for tangential polygons. In space, even a regular tetrahedron can fail to recover its shape after four steps. We give an exact example, then show how concentric inscribed and circumscribed spheres restore a two-step return. Rectangular boxes provide a further four-step family.

comments
8 pages, 4 figures
fields
Metric Geometry
pdf ↗ page arXiv:2611.01247 ↗

We prove that every lattice isomorphism between the lattices of slowly oscillating real-valued functions on proper metric spaces induces a coarse homeomorphism. This yields a Banach–Stone-like theorem for slowly oscillating functions, as well as a representation theorem for linear lattice isomorphisms between these function lattices. Both theorems were previously established by the author under the assumption of chain-connectedness. The present paper establishes both results for arbitrary proper metric spaces.

comments
13pages
fields
Metric Geometry, Functional Analysis
pdf ↗ page arXiv:2611.01629 ↗

A spherical $t$-design is a finite set of points on the $d$-dimensional unit sphere such that averaging any polynomial of degree at most $t$ over these points gives its exact spherical average. We study the corresponding notion for curves, where point averages are replaced by normalized arclength integration. For fixed $d\ge 2$, the length of such curves is known to be bounded below by a positive multiple of $t^{d-1}$ as $t\to\infty$. We show that this asymptotic order is attained: for every $d\ge 2$, there exists a constant $C_d>0$ such that, for every positive integer $t$ and every prescribed length $L\ge C_dt^{d-1}$, there is a simple spherical $t$-design curve of length $L$. This establishes the analogue for curves of the theorem of Bondarenko, Radchenko, and Viazovska, which resolved the Korevaar-Meyers conjecture for spherical design points. More generally, we prove the corresponding result on closed, connected Riemannian manifolds of dimension $d\ge 2$, where eigenfunctions of the Laplace-Beltrami operator substitute for polynomials. The proof combines a geometric construction of curves with continuously adjustable local lengths and an application of Brouwer's degree theorem.

fields
Metric Geometry, Combinatorics, Numerical Analysis
pdf ↗ page arXiv:2611.01895 ↗

We give explicit kissing configurations in R^d for every d = 49, ..., 61. The lower bound is improved over the best previously published value in all thirteen dimensions, by margins from 232 to 159,220 points and by 506,461 points in total. The configurations are obtained from the antipodal block lift of Yang et al. applied to the 52,416,000-point minimal shell of the extremal even unimodular lattice P_48p, using a class of 7,193 minimal lines and, in each dimension, a kissing configuration of R^k (k <= 15) with the largest available number of antipodal pairs. Two ingredients are new. The published class of 7,077 lines is grown to 7,193 by local search in three stages, as a sequence of exchanges between candidate lines and class lines; and the point count, which equals 52,416,000 + 2S + 2t with t the number of antipodal pairs and S the size of the union of t isometric images of the class, is maximised as a maximum-coverage problem by greedy search with iterated local search over pools of 4,000 automorphic images, reaching 92-100% of the trivial bound 7,193t. All results are verified in exact integer arithmetic, and the certificates are distributed with the code. Code and data: https://github.com/dimkadimon/KissingNumbers

code
github.com/dimkadimon/KissingNumbers repository not found
comments
9 pages, 4 tables, 1 figure. Code, data and exact certificates: https://github.com/dimkadimon/KissingNumbers
fields
Metric Geometry, Information Theory, Combinatorics
pdf ↗ page arXiv:2611.01906 ↗

We study rational generalized barycentric coordinates (rational GBCs) on polytopes. We recall their essential theory and clarify some statements from the literature. We study polytopes that admit GBCs with low degree denominators (and hence, low degree (affine) adjoint polynomials). We give a full classification of polytopes that admit polynomial barycentric coordinates (i.e. constant adjoints).

fields
Metric Geometry
pdf ↗ page arXiv:2611.02110 ↗

Quadrilateral meshes that flex with rigid planar faces are of interest to transformable architecture, rigid-foldable origami, and mechanical metamaterials. Their building blocks are flexible $3 \times 3$ nets, that is, Kokotsakis polyhedra with a quadrangular base, classified by Izmestiev. We study one of his types, the equimodular elliptic type, defined by three conditions on the flat angles, the third of them through Jacobi elliptic functions. We turn these conditions into equivalent algebraic ones, free of elliptic functions, which lead to the generalized quasi-symmetric nets (GQS-nets), polyhedra of this type that include the known elliptic quasi-symmetric nets. For every polyhedron of this type, we give a flexible polyhedron with the same flat angles and its flexion in closed form. From the simplest GQS-nets, we assemble arbitrarily large flexible $m \times n$ nets. Examples include nets that, at one position, form letters; further nets in the supplementary materials form digits or, seen along their rows, approximately follow the side silhouettes of a bunny and a fish. Unlike numerically computed mechanisms, these nets are exactly flexible. As an application, we design three such nets as transportable arch halls of 80 mm sandwich panels, which fold to fit through the door of a standard container or into the well of a low-bed semi-trailer, and we check them numerically under snow load and build a 1:20 model of one. Supplementary Mathematica notebooks verify the symbolic computations, a Python tool constructs the nets and checks them numerically, including for self-intersections, and further scripts recheck the halls.

comments
49 pages (41 + 8 pages of supplementary materials), 11 figures, 5 tables. Code, Mathematica notebooks, data, print files of the 1:20 model, and a video: https://github.com/nurmaton/gqs-nets
fields
Metric Geometry, Complex Variables, Differential Geometry
pdf ↗ page arXiv:2611.02229 ↗

On a volume doubling metric measure space endowed with a family of $p$-energies such that the Poincaré inequality and the capacity upper bound with $p$-walk dimension $β_p$ hold, for $p$ in an open interval $I\subseteq(1,+\infty)$, we prove the following dichotomy: either $β_p=p$ for all $p\in I$, or the function $p\mapsto \frac{β_p}{p}$ takes values in $(1,+\infty)$ and is strictly decreasing on $I$. Moreover, if the metric measure space is $d_h$-Ahlfors regular, we prove the following dichotomy: either $β_p=d_h+p-1$ for all $p\in I$, or the function $p\mapsto \frac{β_p-d_h}{p-1}$ takes values in $(-\infty,1)$ and is strictly increasing on $I$.

comments
32 pages, AI statement included
fields
Metric Geometry, Functional Analysis
pdf ↗ page arXiv:2611.02422 ↗

We show that the Hausdorff dimension of a Bedford-McMullen carpet with non-uniform fibres can be lowered with a quasisymmetry, provided that the defining iterated function system does not have a full column. We prove this by constructing explicit dimension lowering metrics which are quasisymmetrically equivalent to the Euclidean metric.

comments
21 pages, 3 figures
fields
Metric Geometry, Dynamical Systems
pdf ↗ page arXiv:2611.03252 ↗

During the Minisymposium on Length Optimization as part of the International Conference "Mathematics Days in Sofia - 2026", the participants collected the following open problems: 1. Find any non-trivial upper and lower bounds for the degree of a branching point in the Gilbert-Steiner problem with cost-function $c(x) = x^p$ in the metric space $X = \mathbb{R}^d$ for large $d$ and fixed $p > 1/2$ (see Section 1). 2. Determine whether a typical trajectory of a given branched optimal traffic plan has bounded length. To find the optimal transport plan between the Dirac measure in the center of a circle and the Lebesgue measure on the circle (see Section 2). 3. To find the maximal distance minimizers for any explicit compact sets (see Section 3). 4. What is the minimal $C$ such that for any set of $n$ points in the three-dimensional unit cube, there is a tour through all these $n$ points with the sum of the cubes of its edge lengths at most $C$ (see Section 4). 5. To explore parallels between tropical caustics and Steiner trees: do caustics really need convexity (see Section 5).

comments
12 pages, 8 figures. Open problems from the Length Optimization minisymposium, Mathematics Days in Sofia 2026 (6-7 July 2026). Problems by D. Cherkashin, A. Prouff, Y. Teplitskaya, A. Gordeev, M. Shkolnikov
fields
Metric Geometry, Optimization and Control
pdf ↗ page arXiv:2611.03403 ↗

Commutative Algebra13

Let $I$ be a monomial ideal in $S=\mathbb{k}[x_1,\ldots,x_n]$, and set $R=S/I$. We prove that if $I$ is $\mathbf{a}$-bounded and $M$ is a positively $\mathbf{b}$-determined $R$-module, then $\mathrm{tr}_R(M)$ is $(\mathbf{a}+\mathbf{b})$-bounded. For the canonical module, this gives the bound $2\mathbf{a}$. In particular, the canonical trace ideal of every Stanley–Reisner ring is a cube-free monomial ideal. We also prove that, for a Stanley–Reisner ring satisfying $(S_2)$, the canonical trace ideal is the square of its radical if and only if the ring satisfies $(G_2)$.

comments
9 pages, comments are welcome
fields
Commutative Algebra
pdf ↗ page arXiv:2611.00714 ↗

Tensors over commutative rings naturally appear in number theory, geometry, and group theory. For example, $2\times 2\times 2$ tensors over $\mathbb{Z}$ form the starting point of Bhargava's celebrated works generalising Gauss's composition law (Bhargava, Ann. Math., 2004). Symmetric tensors over $\mathbb{Z}$ are central to the classification of Calabi–Yau threefolds (Yau, Commun. Pure Appl. Math., 1978; Wall, Invent. Math., 1966), geometric objects of significance in string theory. Additionally, tensors over finite commutative rings closely correspond to finite nilpotent groups of class 2 (Baer, Trans. Am. Math. Soc., 1938). In this work, we study isomorphism testing of tensors over commutative rings from a complexity-theoretic viewpoint, and its applications. Some of our main results are: 1. Let $\mathrm{R}$ be a commutative ring. We introduce two complexity classes: $\mathsf{3TI}_\mathrm{R}$ consisting of problems that are polynomial-time reducible to isomorphism problems of tensor products of three modules over $\mathrm{R}$, and $\mathsf{3FTI}_\mathrm{R}$ consisting of problems that are polynomial-time reducible to isomorphism problems of tensor products of three free modules over $\mathrm{R}$. 2. We show that some classical problems considered by Grunewald and Segal (ibid.), and the problem of classifying Calabi–Yau threefolds, are $\mathsf{3FTI}_\mathbb{Z}$-complete. We also show that many natural problems are complete for $\mathsf{3TI}_{\mathbb{Z}/p^e\mathbb{Z}}$. 3. We show that testing isomorphism of tensors in $\mathbb{Z}^2\otimes\mathbb{Z}^2\otimes\mathbb{Z}^2$ is polynomial-time equivalent to the principal ideal problem in algorithmic number theory. 4. We present an $N^{O((\log N)^{8/9})}$-time algorithm for testing isomorphism of finite nilpotent groups of class $2$ and odd order $N$.

comments
74 pages, extended abstract appeared at STOC'25, abstract shortened to meet arXiv requirement
fields
Commutative Algebra, Number Theory
pdf ↗ page arXiv:2611.00735 ↗

We study the integer-valued polynomial ring with the stacked-bases property, maximal ideals above valuation ideals, and the polynomial closure of matrices with prescribed characteristic polynomials. A content argument gives stacked-bases properties for integer-valued polynomial rings over number-field integer rings. The construction of Hagg and Mortberg provides a Bezout domain without this property. For rank-one valuation domains, maximal ideals are described by evaluations and pseudo-convergent sequences. For matrices, we give congruence-ideal and companion-lattice criteria, together with finite-level tests to characterize the polynomial closures.

comments
21 pages, comments are welcome!
fields
Commutative Algebra, Number Theory
pdf ↗ page arXiv:2611.00906 ↗

For a finite simple gap-free graph $G$, let $B(G)$ denote the vertices $v$ for which $G-N_G[v]$ is not co-chordal, and put $C(G)=V(G)\setminus B(G)$. We prove a sufficient condition for all ordinary powers of its edge ideal to have linear resolutions from the second power onward: every induced anticycle of length at least five must contain an edge with both endpoints in $C(G)$. The argument uses variable generators of augmented colon ideals to eliminate anticycles that may persist in the ordinary quadratic colons. It yields linear resolutions for all powers $I(G)^q$, $q\ge2$, whenever the ordinary matching number is at most four, which answers the first part of a question of Erey, Hà, Hibi, Kara and Morey. The criterion also applies to certain graphs with adjacent exceptional vertices and matching number five. The proofs are theoretical and valid over arbitrary fields. We do not assert linear quotients.

comments
8 pages. Theoretical proofs; no computer-assisted arguments
fields
Commutative Algebra, Combinatorics
pdf ↗ page arXiv:2611.00961 ↗

We characterize bipartite graphs whose edge rings are almost Gorenstein. Using this characterization, we recover known results for two families of graphs. In addition, we show that if the edge ring of a bipartite graph is almost Gorenstein and its $h$-polynomial has degree at least two, then the $h$-polynomial is palindromic except possibly for the linear and next-to-leading coefficients. Moreover, we construct two bipartite graphs whose edge rings have the same $h$-vector, although only one of the rings is almost Gorenstein.

comments
12 pages, 2 figures
fields
Commutative Algebra
pdf ↗ page arXiv:2611.01032 ↗

Let $R$ be a Noetherian $\mathbb{N}$-graded ring. Assume that $L$ and $M$ are finitely generated $\mathbb{Z}$-graded $R$-module, and $I$ a homogeneous ideal of $R$. Let $N$ be a graded submodule of $M$. Fix $k\in \mathbb{N}$. Denote $H:=\operatorname{Ext}^k_R(L,M)$ (or $\operatorname{Tor}_k^R(L,M)$) and $H_n:=\operatorname{Ext}^k_R(L, M/I^nN)$ (or $\operatorname{Tor}_k^R(L,M/I^nN)$). When $I$ is generated by elements of positive degree, we show that the local $v$-number of $H_n$ either coincides with that of colon submodule $(0:_H I)$ or is a polynomial in $n$ of degree one whose leading coefficient is one of the degrees of the generators of $I$. This extends the main result of Ghosh-Pramanik [J. Algebra 671 (2025), 61-74], where asymptotic linearity was shown under the assumption that $(0:_H I)=0$.

comments
Comments are most welcome, 13 pages
fields
Commutative Algebra
pdf ↗ page arXiv:2611.01156 ↗

We give a complete classification of all Koszul licci ideals, including a complete description of the defining equations and graded Betti tables for these ideals, showing that they exactly correspond to quadratic licci ideals that are at most two links away from a complete intersection. More generally, we show how to uniquely associate the Hilbert function of a quadratic licci ideal to a partition of its codimension, and use it to prove that the Hilbert function of a quadratic ideal determines whether or not it is licci. This provides a strong affirmative answer in the quadratic case to a question of Huneke, Polini, and Ulrich asking whether graded Betti tables determine the licci property of graded ideals.

comments
39 pages
fields
Commutative Algebra
pdf ↗ page arXiv:2611.01224 ↗

We prove that if a local ring has a weakly lim Cohen-Macaulay sequence of modules, then it satisfies the conjecture that every system of parameters is a Q-sequence. We also give a generalization of Lech's formula for the multiplicity of a local ring $(R,m)$ with respect to a system of parameters that allows a very large class of sequences of $m$-primary ideals generated by monomials in the parameters to be used in the calculation. The cases where the sequence of ideals consists of the powers of the ideal generated by parameters, or where the ideals in the sequence are generated by varying powers of the individual parameters all of which tend to infinity, which is Lech's original formula, are included.

fields
Commutative Algebra
pdf ↗ page arXiv:2611.01439 ↗

Let $A$ be a ring such that the formal power series ring $A[[t]]$ is a unique factorization domain. Bayart's problem asks whether the formal power series ring in two variables $A[[x,t]]$ must also be a UFD. Equivalently, is every irreducible element $f\in A[[x,t]]$ prime? We prove that the answer is yes whenever the constant term of $f$ is an associate of $p^m$, for any prime $p \in A$ and $1\leq m\leq3$, and for $m=4$ if $A$ contains $\Q$. We also prove the following reduction: To prove a positive answer to Bayart's problem, it suffices to prove that $A[x][[t]]$ is a UFD whenever $A[[t]]$ is.

fields
Commutative Algebra
pdf ↗ page arXiv:2611.01622 ↗

For a finitely generated module $M$ of finite Gorenstein dimension over a commutative noetherian local ring $(R,\mathfrak{m},\Bbbk)$, we prove that the natural map $\mathrm{Ext}_R(\Bbbk,M)\longrightarrow\mathrm{Ext}_R(\Bbbk,M/\mathfrak{m} M)$ is zero unless $R$ is Gorenstein. More generally, the same conclusion holds whenever $\mathrm{Ext}_R^i(M,R)=0$ for $i\gg0$. This gives a Gorenstein analogue of a regularity criterion of Avramov and Iyengar. The proof uses the right $\mathrm{Ext}_R(\Bbbk,\Bbbk)$-module structure of bounded cohomology studied by the author in a previous work. As an application, we show that $R$ is Gorenstein if a nonzero quotient of a finite direct sum of syzygies of $\Bbbk$ has finite Gorenstein dimension. In particular, this answers affirmatively a question of Takahashi concerning direct summands of syzygies of the residue field.

fields
Commutative Algebra
pdf ↗ page arXiv:2611.01630 ↗

We construct an explicit minimal cellular resolution for every squarefree monomial ideal generated in degree $n-2$ in the polynomial ring $S=K[x_1,\ldots,x_n]$. Such an ideal is the complementary edge ideal $I_c(G)$ of a simple graph $G$ on $[n]$, and the resolution is supported on a labeled regular CW complex $X_G$ of dimension at most $2$. This yields closed formulas for the differentials and for the multigraded Betti numbers of $I_c(G)$ in terms of graph invariants. We then determine the $a$-invariant of $S/I_c(G)$ in terms of the vertex connectivity of $G$. Finally, when $S/I_c(G)$ is Cohen–Macaulay, we describe the canonical module and its Hilbert series, and recover the known characterizations of the Gorenstein and level cases.

comments
13 pages
fields
Commutative Algebra, Combinatorics
pdf ↗ page arXiv:2611.02168 ↗

Final coalgebras and the coinduction principle for coalgebras over $R$-modules, where $R$ is a commutative ring, are essential in determining the denotational behaviour of various types of linear weighted automata. The goal of this paper is to provide lower and upper bounds on the ordinals that are needed to construct final coalgebras over $R$-modules as the limit of a transfinite sequence of functor iterations. We give an example of a binary intersection preserving finitary functor on the category of abelian groups, which is the category of modules over integers, that fails to converge in $ω\cdot 2$ steps, thus settling an open problem of Adámek, Milius, and Moss. Then we relate this to the failure of the Artinian property of the integers and show that all finitary functors on $R$-modules for a Noetherian ring $R$ with Krull dimension $n$, which preserve countable directed intersections and a generalised notion of monomorphism, converge in $ω\cdot (n + 2)$ steps. We also establish how the connection between Aczel-Mendler bisimulation and behavioural equivalence is mediated by the functor $\operatorname{Ext}^1$. These results show that homological algebra tools can play an important role in coalgebra.

fields
Commutative Algebra, Category Theory
pdf ↗ page arXiv:2611.03174 ↗

In 2010. Okuyama proved the following. Let $G$ be a finite group and $k$ an algebraically closed field of characteristic $p$ dividing the order of $G$. (1) Let $\frak p$ be an associated prime of $H^*(G,k)$ of $\dim=s$. Then there exists an elementary abelian $p$-subgroup $E\subseteq G$ of rank $s$ with $\mathfrak p=\mathfrak p_E$ and depth$\,H^*(C_GE,k)=s$. (2) Let $E$ be an elementary abelian $p$-subgroup of $G$ of rank $s$ and suppose depth$\,H^*(C_GE,k)=s$. Then $\mathfrak p_E$ is an associated prime of $H^*(G,k)$. It is shown this result is true for all fields of characteristic $p$. We also show the following result: If $E$ is an elementary abelian $p$-subgroup of $G$ and depth $H^*(G,k)=\text{rank} E$, then up to conjugation $E$ contains the maximal elementary abelian subgroup contained in the center of a Sylow $p$-subgroup of $G$.

comments
3 pages
fields
Commutative Algebra, Group Theory
pdf ↗ page arXiv:2611.03569 ↗

Rings and Algebras13

Let $Φ_r(a,b)$ denote the homogeneous cyclotomic value. For sufficiently large $A$, uniformly for $1/2\leq B\leq A$, $r\geq3$ and $Z\geq2$, the number of coprime pairs in $(A,2A]\times(B,2B]$ whose greatest prime factor $P(Φ_r(a,b))$ is at most $Z$ is $O(AB/\varphi(r)+\sqrt{r/\varphi(r)}\,π(Z;r,1))$, where $π(Z;r,1)$ counts primes at most $Z$ congruent to $1$ modulo $r$. If $n=n(A)\to\infty$ through positive integers and $1\leq H(A)=o(\log A)$, then $P(a^{2^n}+1)>2^nAH(A)$ for almost all $a\in(A,2A]$, and $P(a^{2^n}+b^{2^n})>2^nA^2H(A)$ for almost all coprime pairs in $(A,2A]^2$, with no further restriction on $n$. For every fixed $α>0$ and every $r\geq A^α$, pairwise distinct primitive prime divisors of $Φ_r(a)$ can be selected for all but $O_α(A^{1-c_α})$ bases in $(A,2A]$, where $c_α>0$. For coprime positive integers $a,b$ with $\max(a,b)\geq2$ and $r\geq3$, put $C=Φ_r(a,b)$ and $S=\varphi(r)^2\log\max(a,b)$. Uniformly as $S\to\infty$, $\max_{p\mid C}p^{v_p(C)}\geq(5/16-o(1))S$. For every positive function $h(S)\to\infty$, $\sum_{p\mid C,\;p^{v_p(C)}>S/h(S)}v_p(C)\log p =(1-o(1))\log C$ uniformly in the same limit.

comments
36 pages, 0 figures
fields
Rings and Algebras
pdf ↗ page arXiv:2611.00075 ↗

We classify the nonzero complete Bernstein functions whose matrix functions preserve every real P-matrix in every order. They are precisely $f(z)=a+bz$, with $a,b\ge0$ and $a+b>0$, and $f(z)=a+cz/(z+s)$, with $a\ge0$ and $c,s>0$. For each fixed order $n\ge4$, the preservers vanishing at zero are exactly $cz$ and $cz/(z+s)$; every other such function admits a strictly totally positive counterexample. For a finite positive measure $μ$ on $(0,\infty)$, put $g(z)=\int z/(z+s)\,μ(ds)$ and $M_t=\int s^t\,μ(ds)$. In every fixed order $n\ge4$, a finite constant shift restores preservation on all real P-matrices if and only if $M_{r_n}$ and $M_{-r_n}$ are finite, where $r_n=\lfloor n/2\rfloor-1$. Every $a>c_n\sqrt{M_{r_n}M_{-r_n}}$ is sufficient, with $c_n$ depending only on $n$. A complete Bernstein function vanishing at zero admits a possibly different repairing constant in every order exactly when it is linear, or is a pure kernel mixture with all positive and negative integer moments finite. For principal real powers, the preserving exponents are $\mathbb R$ in order one, $[-1,1]$ in orders two and three, and $\{-1,0,1\}$ in every higher order. An explicit rational determinant-one totally positive family gives negative principal minors uniformly on prescribed compact subsets of $(-1,0)\cup(0,1)$.

comments
27 pages, 0 figures
fields
Rings and Algebras
pdf ↗ page arXiv:2611.00096 ↗

A Leibniz dialgebra is a vector space with two bilinear products $\dashv$ and $\vdash$ satisfying the dialgebra analogue of the right Leibniz identity. This notion is obtained by the same standard procedure that turns the associative identity into the axioms of Loday's associative dialgebras. In particular, $(\mathcal{DL},\dashv)$ is a right Leibniz algebra, so a Leibniz dialgebra is a Leibniz algebra together with a second, compatible product. This paper recalls the definition of Leibniz dialgebras and continue the algebraic classification of three-dimensional complex Leibniz dialgebras. This paper describes up to isomorphism all Leibniz dialgebras $(\mathcal{DL},\dashv,\vdash)$ for which the Leibniz algebra $(\mathcal{DL},\dashv)$ is isomorphic to one of the algebras $\mathcal{L}_{8}(α)$, $\mathcal{L}_9$, $\mathcal{L}_{10}$, $\mathcal{L}_{11}$ of the classification of three-dimensional complex Leibniz algebras. The result consists 18 families of pairwise non-isomorphic Leibniz dialgebras, nine of which depend on a complex parameter.

fields
Rings and Algebras
pdf ↗ page arXiv:2611.00109 ↗

For Hermitian matrices $α,β$ let $\A_{n,m}(e^α,e^β)$ be the average of the traces of all words with $n$ letters $e^α$ and $m$ letters $e^β$. The refined Bessis–Moussa–Villani conjecture contains the lower bound $\A_{n,m}(e^α,e^β)\ge\Tr e^{nα+mβ}$ (Tr denotes the trace), which for $n=m=1$ is the Golden–Thompson inequality. We prove this lower bound for all $n+m\le7$ when the matrices have size at most three, and for $\min(n,m)\le2$ in every dimension. In all these cases we prove the stronger inequality $\A_{n,m}(A,B)\ge\Tr(A^{n/m}B)^m$ for positive semidefinite $A,B$, or its mirror image with the roles of $A$ and $B$ exchanged; the lower bound of the refined conjecture follows from the Araki–Lieb–Thirring inequality. The cases with three letters $B$ in dimension three, $(n,m)=(3,3)$ and $(4,3)$, are reduced by an exact identity and the inequality of arithmetic and geometric means to a polynomial inequality in two variables, which is certified in exact rational arithmetic by Bernstein expansion on three boxes. The certificate is a short program in the ancillary files.

comments
Proof by Claude (Anthropic) checked by Gemini Opus (Google). The author guided Claude in finding the proof
fields
Rings and Algebras, Mathematical Physics, Operator Algebras
pdf ↗ page arXiv:2611.00129 ↗

We investigate the algebraic classification of Jordan algebras of dimensions at most three over arbitrary fields with more than two elements. Our approach combines the theory of nilalgebras and radicals with Peirce, Wedderburn decompositions and the length function. In characteristic two, we adapt the Peirce decomposition to organize the classification, including the field-dependent isomorphism conditions among parametrized families. We also study the varieties of Jordan algebra structures up to dimension three over an algebraically closed field of characteristic two. Besides explicit degenerations and standard arguments, we introduce the alicyclic and characteristic conditions as geometric obstructions to degeneration. We determine the rigid algebras and irreducible components in both dimensions. In dimension three, one component is the nine-dimensional affine space of square-zero products; unlike the other three components, it contains no open orbit.

comments
39 pages
fields
Rings and Algebras, Algebraic Geometry
pdf ↗ page arXiv:2611.00315 ↗

We construct generalized quantum cluster scattering diagrams over a ring of formal reciprocal exchange coefficients, for compatible seeds satisfying \(\widetilde B^TΛ=[I_n\mid0].\) A central lattice extension records the roots of the exchange polynomials as independent degrees. Applying Davison–Mandel positivity in this extension and proving a positive cylinder projection theorem yields positive wall factorizations and theta coefficients in the root variables. Their regular classical limits recover generalized cluster scattering diagrams. Nonvanishing under classical specialization, together with control of the mutated positive monoids, gives quantum mutation compatibility. The resulting scattering atlas has the generalized cluster fan, and every reachable cluster monomial is a theta function. Classical detection of theta coefficients gives a geometric proof of the Laurent phenomenon, with positivity after adjoining the polynomial roots. Evaluation of the exchange coefficients recovers the generalized quantum cluster algebras with this normalization. The Fock–Goncharov mutation product becomes a wall-crossing action, identifying extended \(g\)-vectors with leading theta exponents and \(F\)-polynomials with the coefficient factors on their right. Constructing these polynomials before evaluation gives the separation formula for arbitrary prescribed reciprocal Laurent polynomial coefficients, without requiring positivity at \(t=1.\) Positivity in the roots is distinguished throughout from positivity in the exchange coefficients.

fields
Rings and Algebras
pdf ↗ page arXiv:2611.00991 ↗

We prove that every even or odd local superderivation of the Block Lie superalgebra $S(q)$ is a superderivation for every $q\in\mathbb{C}$, with both basis indices ranging over $\mathbb{Z}$. The superderivations used in the local condition have the same parity as the map. The proofs use the known description of homogeneous superderivations, bracket computations, and coefficient comparisons.

comments
11 pages
fields
Rings and Algebras
pdf ↗ page arXiv:2611.01137 ↗

In this paper, we introduce and investigate partial coactions of a Hopf algebra on an associative, possibly nonunital algebra and on $\Bbbk$-linear categories. We prove that every partial coaction has a globalization in a broad sense. We study in detail the case of a partial coaction on an algebra with local units; we prove that such a coaction is always induced from a global coaction, and we show that there exists a naturally associated $\Bbbk$-linear category endowed with a partial coaction.

fields
Rings and Algebras
pdf ↗ page arXiv:2611.01231 ↗

Central codimensions measure the dimensions of spaces of multilinear polynomials modulo those taking values in the center of an algebra. We classify associative algebras over a field of characteristic zero whose central codimensions grow at most linearly. The classification is given up to equality of polynomial identities, in terms of explicit generating algebras and an equivalent finite exclusion criterion. We also give a direct structural characterization of the bounded case. As a consequence, we determine the five varieties of quadratic central codimension growth whose proper subvarieties all have at most linear central growth. As an application of the bounded-growth classification, we characterize algebras graded by an arbitrary finite group whose graded central codimensions are bounded. Up to graded PI-equivalence, these are direct sums of commutative and nilpotent graded algebras, possibly together with the Grassmann algebra on two generators endowed with the trivial grading.

comments
20 pages
fields
Rings and Algebras
pdf ↗ page arXiv:2611.01244 ↗

In this article, we give three candidates for a definition of the Yangian associated with the binary tree $X^*$ and the group $Aut(X^*)$ consisting of automorphisms of $X^*$ which preserve the tree structure. The first candidate has the Schur-Weyl duality with one kind of an extension of the degenerate affine Hecke algebra. The second and third ones have a homomorphism corresponding to the wreath recursion.

fields
Rings and Algebras, Representation Theory
pdf ↗ page arXiv:2611.01412 ↗

We prove that every continuous homomorphism from a complete topologized semilattice to a Hausdorff semitopological semilattice has closed image, answering a question of Banakh and Bardyla. The main step is the convergence of idempotent ultrafilters on complete semitopological semilattices. We also prove that, for every complete subsemilattice $X$ of a Hausdorff semitopological semilattice $Y$, the natural order of $X$ is closed in $Y\times Y$. In particular, the natural order of every complete Hausdorff semitopological semilattice $X$ is closed in $X\times X$.

comments
7 pages
fields
Rings and Algebras, General Topology, Representation Theory
pdf ↗ page arXiv:2611.01545 ↗

Morier-Genoud and Ovsienko conjectured that a cubic Boolean generating function satisfying an ordered separation condition on its second polar must be equivalent to one of two symmetric normal forms. Two infinite families of counterexamples are constructed and proved analytically; both are direct sums of small seeds, and neither is equivalent to the proposed forms even after linear functions are added. The first adjoins a nondegenerate quadratic block to a ternary cubic seed and is distinguished from the proposed forms by the radical of its third polar. This radical determines the associative nucleus of every twisted quasialgebra with the given generating function, so the corresponding algebras are not isomorphic even when the grading is forgotten. The second family consists of direct sums of a five-variable seed and has zero third-polar radical. A criterion for quadratic-block presentations establishes the separation property of the seed; commutation-graph degrees, radical dimensions, and contraction ranks establish non-equivalence in all dimensions of the family.

comments
22 pages
fields
Rings and Algebras, Combinatorics
pdf ↗ page arXiv:2611.02544 ↗

For restricted simple Cartan-type Lie algebras over an algebraically closed field of characteristic $p\ge5$, the reduced enveloping algebra at every nonzero $p$-character is a matrix algebra over a terminal symmetric corner, and this corner determines the extensions. Central-socle traces recover its radical and its simple factors, and the first radical layer determines the degree-one extensions. For the Witt algebra $W(1;1)$, at even height $2\le h\le p-3$, the unique simple module has self-extension dimension $\min\{p-h-2,h+2\}$. At height two in characteristic seven, we present the Yoneda algebra as an eight-dimensional symmetric algebra tensored with a polynomial algebra on three central degree-two classes. An equivariant Tate resolution and cocycle identities prove the presentation in all degrees.

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

General Topology12

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.

fields
General Topology
pdf ↗ page arXiv:2611.00249 ↗

This paper studies continuous selections in the framework of intuitionistic fuzzy sets. To each intuitionistic fuzzy set $A=(μ,ν)$ on a topological space $X$ we associate the interval-valued map $F_{A}(x)=[μ(x),1-ν(x)]$, whose width is the hesitation degree. Hence, in this setting, a selection of $F_{A}$ is an ordinary fuzzy membership function compatible with the intuitionistic information, and every selection is the membership function of Atanassov's operator $D_{\vartheta}$ for a suitable pointwise parameter $\vartheta$. When $X$ is normal and $μ$, $ν$ are upper semi-continuous, a continuous selection exists by the Katětov–Tong insertion theorem. We show that upper semi-continuity arises naturally in a voting model, in which a panel of experts divides a metric universe into closed regions of acceptance and rejection, and for this model we construct an explicit continuous selection, the consensus selection, illustrated by a non-compact example in the plane. On metric spaces we characterise the intuitionistic fuzzy sets that admit an $L$-Lipschitz selection through a non-local version of the condition $μ+ν\leq 1$, and we give the largest and the smallest such selections in closed form. Finally, we prove that the set of continuous selections depends in a $1$-Lipschitz way on the intuitionistic fuzzy set, with respect to the Hausdorff-type distance of Grzegorzewski. We also characterise the intuitionistic fuzzy sets admitting locally Lipschitz selections.

fields
General Topology, Functional Analysis
pdf ↗ page arXiv:2611.00857 ↗

We investigate how order structure controls sequential convergence in the lower topology of a poset and how this, in turn, governs topological duality and co-sobriety of Scott spaces. We first give a purely order-theoretic characterization of lower convergence. For complete lattices this yields a lower-limsup formula, and on complete chains the lower limsup coincides with the usual lattice limsup. We also characterize first countability of the lower topology at a point by the existence of a countable coinitial subset outside its principal ideal. We prove that every compact saturated subset of a Scott space is sequentially closed in the lower topology and deduce that, for every poset, the lower topology and the co-compact (de Groot dual) topology of its Scott space have exactly the same convergent sequences and limits. For coherent Scott spaces we identify the lower closure of a $k$-irreducible compact saturated set with its double-cone closure and obtain an infimum criterion for co-sobriety. Consequently, every bounded-complete dcpo with sequential lower topology has a co-sober Scott space. In particular, every countable bounded-complete dcpo, and hence every countable complete lattice, has a co-sober Scott space.

comments
14 pages
fields
General Topology
pdf ↗ page arXiv:2611.01487 ↗

We show that the Scott power construction does not preserve co-sobriety. For a dcpo $P$, let $\operatorname{Fin}(P)$ be the poset of nonempty finitely generated upper sets ordered by reverse inclusion. We prove that co-sobriety of $Σ\operatorname{Fin}(P)$ implies co-sobriety of $ΣP$. The proof adapts the point-saturation and union argument used for full compact saturated power posets; the finite step follows from a result of Heckmann and Keimel. Applying this transfer to a dcpo with a non-co-sober Scott space yields a co-sober Alexandrov space whose Scott power space is not co-sober. We also construct a countable example for which the Smyth power poset is countable. In the countable example, the same poset is co-sober under the upper Vietoris topology but not under the Scott topology.

comments
10 pages
fields
General Topology
pdf ↗ page arXiv:2611.01516 ↗

In this paper, we focus on well-filtered spaces. By using the Rudin sets and WD sets, we obtain the following results: (1) The product of arbitrary many Scott well-filtered dcpos is still well-filtered with respect to the Scott topology. Thus we give positive answers for two questions proposed by Xu and Zhao; (2) Let P be a dcpo with ΣK(P) being well-filtered and Q a RB-domain. Then ΣK(P\times Q) is well- filtered if K(P\times Q) is a dcpo; (3) A intrinsic characterization of the WD sets is given by using Scott open filters.

fields
General Topology
pdf ↗ page arXiv:2611.01518 ↗

Kernel retracts of co-sober spaces need not be co-sober, even when the ambient space is countably infinite and compact. We construct a co-sober $T_0$-space $Y$ and a continuous idempotent map $k\colon Y\to Y$ satisfying $k(y)\leq_Y y$ in the specialization order, whose image with the subspace topology is not co-sober. The construction starts from a countable compact $T_1$ KC anti-Hausdorff space of van Douwen type and adjoins an infinite chain. We classify the $k$-irreducible compact saturated subsets of the extension and show that each is a point saturation. The kernel operator collapses the added chain to a distinguished point while fixing the original space, thereby recovering the non-co-sober seed as its image. This answers negatively two questions of Xu and Zhao, concerning continuous kernel operators and arbitrary retracts, and contrasts with the known preservation of co-sobriety by continuous closure operators.

comments
9 pages
fields
General Topology
pdf ↗ page arXiv:2611.01531 ↗

The Wilker property requires that a compact set covered by two open sets admit compact covering pieces inside those open sets. We study this property through products, compact-open function spaces and hyperspaces. We construct countable compact Fréchet–Urysohn $T_1$ hereditarily Wilker spaces with non-Wilker products and squares. For spaces whose compact subsets are closed, Wilker-ness is equivalent to every compact subspace being Hausdorff; this yields a positive product theorem when one Wilker factor has closed compact subsets. For an irreducible subset system $H$, we characterize preservation of $H$-sobriety by compact-open function spaces in terms of $H$-supercompactness of compact subsets of the domain, and show that Wilker spaces satisfy this criterion. The Hoare hyperspace of a space is Wilker exactly when binary union on the Scott space of its open-set lattice is jointly continuous for the ordinary product topology. Consequently, the Hoare construction preserves and reflects Wilker-ness on consonant bases, although preservation fails in general. We also identify core-compactness of the base with local compactness of its Hoare hyperspace and prove that the Smyth construction reflects Wilker-ness.

comments
39 pages
fields
General Topology
pdf ↗ page arXiv:2611.01547 ↗

Given a subset system $H$ on $T_0$-spaces, we associate with each topology a closure-testing derived topology and study the fixed points of this operator. The $H$-determined topologies above a given topology are closed under intersections and hence determine a least fixed-point hull. We prove that this hull is obtained by transfinite iteration, is functorial, and defines a right adjoint to the inclusion of $H$-determined spaces into $\mathbf{Top}_0$. Consequently, the corresponding full subcategory is coreflective and complete. We isolate restriction-stability and open-locality hypotheses under which determinedness is inherited by closed and open subspaces, and we establish a general non-reflectivity criterion. If $H$ is contained in the directed-subset system, the category of $H$-determined spaces is Cartesian closed; its exponentials are obtained by coreflecting the pointwise convergence topology on continuous maps. The construction subsumes familiar monotone- and irreducible-determined cases while separating the formal consequences of the subset-system axioms from the additional hypotheses needed for heredity and exponentials. It therefore provides a uniform categorical mechanism for producing complete Cartesian closed categories of $T_0$-spaces with explicit higher-order function spaces, as required in denotational semantics.

comments
15 pages
fields
General Topology
pdf ↗ page arXiv:2611.01698 ↗

In this paper, we prove that for every topological MV-algebra the topology is induced by a uniformity. As a application, we obtain that every topological MV-algebra is completely regular and every \(T_0\) first countable topological MV-algebra is metrizable.

fields
General Topology
pdf ↗ page arXiv:2611.01779 ↗

We prove that the indicator functions form a uniformly continuous retract of the set of $[0,1]$-valued functions in $L^2([0,1])$. Consequently, the Lebesgue probability measure algebra, equipped with the symmetric-difference metric, is an injective uniform space. The construction uses dyadic conditional expectations and a common exponential coupling to obtain Lipschitz maps into the indicator functions that approximate the identity uniformly on that set. As an application, we construct a Polish topological group whose left uniform space is injective but which admits a bounded left uniformly continuous real-valued function that is not right uniformly continuous. This answers the injective part of a question of Bouziad and Troallic in the negative. The group is a semidirect product of two copies of the measure algebra and is also bounded, locally finite, and of exponent at most four.

fields
General Topology
pdf ↗ page arXiv:2611.01802 ↗

We consider Mykhaylyuk's problem asking whether the Baire-one property for every separately continuous real-valued function on each of the squares $X^2$ and $Y^2$ implies the same property on $X\times Y$. Assuming $\mathfrak b>ω_1$, the article obtains a negative answer using the compact cube $K=[-1,1]^{ω_1}$ and the space $E=(c_{00}(ω_1),σ(c_{00}(ω_1),\ell_\infty(ω_1)))$. It presents a finite-coordinate characterization of Baire-one functions on $E$ under this hypothesis.

comments
7 pages
fields
General Topology
pdf ↗ page arXiv:2611.01818 ↗

We study the relationship between nonpathological lower semicontinuous submeasures, $F_σ$ ideals on $ω$, and matrix summability ideals. First, we construct in $\mathsf{ZFC}$ a non-analytic ideal on $ω$ which is representable as an intersection of matrix summability ideals. Then, we show that an $F_σ$ ideal is nonpathological if and only if it can be represented as an intersection of summable ideals if and only if it can be represented as an intersection of matrix summability ideals. We also prove that the random graph ideal is pathological. Finally, we compute the exact degree of pathology of a certain submeasure related to a construction of Topsøe.

fields
General Topology
pdf ↗ page arXiv:2611.02266 ↗

Quantum Algebra11

We construct multivariate analogues of Ruijsenaars' hypergeometric function as nested products of overlap coefficients between eigenfunctions of twisted primitive elements in representations of the modular double of $U_q(\mathfrak{sl}_2)$. The construction is a hyperbolic counterpart of the nested multivariate Askey–Wilson polynomials and functions. Using iterated coproducts, we derive four systems of difference equations for which these multivariate functions are joint eigenfunctions. The four systems correspond to the two sets of variables and the two step sizes $iw_1$ and $iw_2$, which are interchanged by modular duality. We also prove that Ruijsenaars' one-variable transform is unitary in the parameter regime required for the construction, for positive as well as complex conjugate $w_1,w_2$. A two-sided normalization of the kernel separates the input and output weights, so that iterating one-variable transforms yields unitary multivariate transforms with explicit inverse and Plancherel formulas.

comments
34 pages. Based on the second author's MSc thesis
fields
Quantum Algebra, Mathematical Physics
pdf ↗ page arXiv:2611.00445 ↗

We introduce a family of semisimple Hopf superalgebras obtained from abelian extensions. Using this family and bosonization, we complete the classification of Hopf superalgebras of dimension up to 10 over an algebraically closed field of characteristic zero. We also determine the duals of the semisimple classes with nonzero odd part and give tables of the complete classification.

comments
42 pages, 22 tables
fields
Quantum Algebra, Rings and Algebras
pdf ↗ page arXiv:2611.00632 ↗

We study Whittaker and generalized Whittaker modules for the universal principal $W$-algebra $\mathcal W^k(\mathfrak{sl}_3)$, using two free field realizations: one in the Heisenberg vertex algebra of rank two and the other in the tensor product of the universal Virasoro vertex algebra with the Heisenberg vertex algebra of rank one. Under explicit conditions on the parameters, we construct universal Whittaker modules, establish their ordered bases, and obtain explicit irreducibility criteria. Under an explicit nondegeneracy condition, we also show that the submodules of these tensor products correspond to the submodules of the Virasoro factor. We prove irreducibility of the universal Whittaker modules constructed in this paper.

comments
27 pages
fields
Quantum Algebra, Representation Theory
pdf ↗ page arXiv:2611.01428 ↗

Symmetric informationally complete positive operator-valued measures (SIC-POVMs, or SICs) are optimal minimal measurements for quantum state tomography. Problem~1 of Horodecki, Rudnicki and Życzkowski's open problems in quantum information asks for SICs in infinitely many dimensions. By work of Appleby–Flammia–Kopp and Radchenko–Wheeler, ghost SICs, which satisfy the SIC equations with Hermiticity up to parity, exist unconditionally for $d\ge4$. We study the passage from ghosts to SICs. We compute all isolated points of the complexified SIC variety for $d=4,5,6$; exactly half are SICs. We prove that no symmetry of the SIC equations maps a ghost to a SIC, so the step is purely arithmetic, and that a SIC exists in dimension $d$ whenever the ghost overlap units satisfy a place law: each Galois conjugate is real or unimodular according to the infinite place of the real quadratic field $F$ below it. If the unit field is abelian over $F$, the place law is the Stark relation $c_-=κ$; equivalently, a Galois conjugate of an associated near-group fusion category is unitary exactly when it is pseudo-unitary. For $d$ a power of a prime $p\equiv5\pmod 6$ or of $3$, an infinite family, we prove that under the algebraic part of Stark's conjecture $c_-=κ$ is equivalent to the triviality of $κ$ on the Hilbert-class-field part of the unit field. That condition involves no complex conjugation, and it follows from a sign-free multiplet hypothesis. We state an explicit $GL_2$ reciprocity law for the squared ghost overlaps that implies $c_-=κ$, and we prove it for the computed algebraic overlaps in $d=5,7,11,15$ by Artin reciprocity and a check in every ray class. Zauner's conjecture remains open: the algebraic part of Stark's conjecture and the multiplet hypothesis are not proved here.

comments
100 pages, 1 figure, 18 tables. Code and data: https://github.com/hassankhodaiemehr/ghost-sic-galois
fields
Quantum Algebra
pdf ↗ page arXiv:2611.01524 ↗

Evans and Gannon showed that a positive vertex operator algebra of central charge eight whose representation category is the Drinfeld center $Z(\mathcal{H}_3)$ of the Haagerup fusion category has one of two character vectors, with six or nineteen currents. Call such an algebra, if strongly rational, a Haagerup algebra. We prove that a Haagerup algebra $U$ has six currents, that $U_1 \cong \mathfrak{sl}_2 \oplus \mathfrak{sl}_2$ embeds into $V_{E_6 \oplus A_2}$ in one of two explicit ways, with levels $(1,39)$ or $(3,13)$, and we determine the lowest weight spaces of its modules and $U_2$ as $U_1$-modules. For the levels $(3,13)$, $U_2$ is one of four Galois conjugate subspaces, and the algebra it generates is unitary, $C_2$-cofinite and isomorphic to the algebra constructed by Jiao; for the levels $(1,39)$, $U$ contains the algebra announced by Riesen. The associated lattice of $U$ is that of the form $x^2+xy+10y^2$, resp. $3x^2+3xy+4y^2$, the two classes of the principal genus of discriminant $-39$. Exchanging them in the decomposition of $U$ over its Heisenberg commutant gives a Haagerup algebra $U^\natural$ of the other levels, and $U \mapsto U^\natural$ is a bijection between the isomorphism classes of the two cases. Consequently, if either explicit algebra of Jiao or Riesen is positive and strongly rational with representation category braided equivalent to $Z(\mathcal{H}_3)$, there are exactly two Haagerup algebras up to isomorphism, forming a single hyperbolic genus. The explicit algebras of Jiao and Riesen have rational forms. The proofs combine exact trace relations given by vector-valued modular forms, exact computations in a model of $V_{E_6 \oplus A_2}$, and genera of vertex operator algebras.

comments
75 pages. Code and certificates: https://github.com/cedricarhancet/haagerup-c8
fields
Quantum Algebra, Mathematical Physics
pdf ↗ page arXiv:2611.01618 ↗

We give a construction of electrical quantum group and its superpartner as coideal subalgebras in $U_q(\mathfrak{gl}(N))$ and, respectively, in $U^u_q(\mathfrak{gl}(1|N-1))$, where the latter is an "ungraded" (non-standard) quantum general linear supergroup. We derive them as quantum isotropy subgroups of triangular twisted K-matrices found in one of our recent papers.

comments
11 pages, no figures
fields
Quantum Algebra
pdf ↗ page arXiv:2611.02100 ↗

We establish a finite system of consistency equations for triangle relation planar algebras. Within the Yang–Baxter relation class, we characterize triangle relations by $H^2(K;\mathbb C)=0$, where $K$ is the fusion complex recording the support of the fusion coefficients. Together with a reconstruction theorem, this gives an algebraic classification procedure. We classify bi-commutative triangle relation planar algebras with $\dim P_{2,\pm}\leq5$. In ranks two, three, and four, the classification yields respectively $2$, $7$, and $19$ realizable fusion-support pair strata, up to relabelling and shading reversal. These results recover the low-rank examples of Bisch, Jones, Liu, and Lu, and extend the rank-four classification beyond exchange relations. In rank five, we obtain two one-parameter families with different duality types whose generic members do not arise from representations of groups or quantum groups.

comments
58 pages
fields
Quantum Algebra
pdf ↗ page arXiv:2611.02714 ↗

We develop detailed quaternionic and octonionic frameworks for quantum computation grounded on normed division algebras. Our central result is to prove the polynomial computational equivalence of quaternionic and complex quantum models: Computation over $\mathbb{H}$ is polynomially equivalent to the standard complex quantum circuit model and hence captures the same complexity class BQP up to polynomial reductions. Over $\mathbb{H}$, we construct a complete model—quaternionic qubits on right $\mathbb{H}$-modules with quaternion-valued inner products, unitary dynamics, associative tensor products, and universal gate sets—and establish polynomial equivalence with the standard complex model; routes for implementation at fidelities exceeding $99\%$ via pulse-level synthesis on current hardware are discussed. Over $\mathbb{O}$, non-associativity yields path-dependent evolution, ambiguous adjoints/inner products, non-associative tensor products, and possible failure of energy conservation outside associative sectors. We formalize these obstructions and systematize four mitigation strategies: Confinement to associative subalgebras, $G_{2}$-invariant codes, dynamical decoupling of associator terms, and a seven-factor algebraic decomposition for gate synthesis. The results delineate the feasible quaternionic regime from the constrained octonionic landscape and point to applications in symmetry-protected architectures, algebra-aware simulation, and hypercomplex learning.

journal
Quantum Reports 2025, 7(4), 55
fields
Quantum Algebra
pdf ↗ page arXiv:2611.03348 ↗

For a partition $X = Y \sqcup Z$ of a set $X$ and an arbitrary map $g \colon Y \to {\rm Hom}_{\rm Set} (Z, \, Z)$, we construct a solution $R_g \colon X \times X \to X \times X$ of the braid equation. We characterize intrinsically the solutions which are isomorphic to some $R_g$ and we give a necessary and sufficient condition for two solutions $R_g$ and $R_{g'}$ to be isomorphic. Consequently, the number of isomorphism classes of the solutions $R_g$ on a set with $n$ elements is $1 + \sum_{k = 1}^{n-1} \widetilde{o} (n - k, \, k)$, where $\widetilde{o} (m, \, k)$ is the number of orbits of the symmetric group $S_m$, acting by conjugation, on the set of multisets with $k$ elements of maps $\{1, \ldots, m\} \to \{1, \ldots, m\}$. This construction is then used to obtain a solution of the braid equation whose automorphism group is exactly the centralizer ${\rm Aut} (f_1, \ldots, f_k)$ of a given family $f_1, \ldots, f_k \colon X \to X$ of maps, $k \geq 1$. For $k = 2$, combined with a result of Agore, Chirvasitu and the author, this gives another proof of the fact that any group is isomorphic to the automorphism group of a solution of the braid equation (equivalently, of the set-theoretic Yang–Baxter equation).

comments
9 pages + References
fields
Quantum Algebra, Combinatorics, Group Theory, Rings and Algebras
pdf ↗ page arXiv:2611.03380 ↗

A Haagerup algebra is a positive strongly rational vertex operator algebra $U$ of central charge eight with $\mathrm{Rep}(U)$ braided equivalent to the Drinfeld center $Z(\cal H_3)$ of the Haagerup fusion category. Such an algebra has been proposed by Jiao, with a computer-assisted proof, and announced by Riesen and by Huang. We show that $U$ has exactly three holomorphic extensions, each isomorphic to $V_{E_8}$, and that the categories of modules over the corresponding Lagrangian algebras are the three Haagerup fusion categories of Grossman and Snyder. The extensions attached to $\cal H_2$ and $\cal H_3$ are the two lattice extensions of $V_{E_6 \oplus A_2}$. Along a strategy outlined by Huang, we prove a recognition theorem for $\cal H_2$ and $\cal H_3$ among unitary fusion categories of rank six with three invertible objects. For regular unitary vertex operator algebras with Tener's bounded localized vertex operators, we prove that the fusion product of two unitary modules is unitarizable when one of them integrates to the conformal net. The explicit unitary algebra $S \subset V_{E_6 \oplus A_2}$ of our previous work, isomorphic to Jiao's algebra, is strongly local. Granting that Jiao's algebra is a Haagerup algebra, we deduce that the conformal net $\cal A_S$ is completely rational with $\mathrm{Rep}(\cal A_S) \cong Z(\cal H_3)$, that the Haagerup subfactor arises from $\cal A_S$, and that $\cal A_S$ solves a problem of Bischoff on generalized orbifolds. Under the same hypothesis, using a unitary structure on $V_{E_8 \oplus E_8}$ found by exact computer calculations, we prove that $S$ is completely unitary and that $\mathrm{Rep}(\cal A_S) \cong \mathrm{Rep}(S)$ through the correspondence given by smeared vertex operators. The diagonal construction and the passage to the twin algebra also show that every Haagerup algebra is completely unitary and satisfies Condition I+.

comments
66 pages, the supplementary files will be available at https://github.com/cedricarhancet
fields
Quantum Algebra
pdf ↗ page arXiv:2611.03560 ↗

Let $V$ be a simple, strongly finitely generated vertex algebra with a connected nonnegative integer grading, and let $G$ be a finite group of grading-preserving automorphisms. In this paper, we prove that $X_{V^G}\cong X_V/G$ as reduced Poisson varieties. More precisely, the canonical surjection $R_{V^G}\longrightarrow (R_V)^G $ has nilpotent kernel. The proof uses a uniform derivative bound in a relative $C_2$-quotient, which also implies that $V^G$ is strongly finitely generated. Consequently, quasi-lisseness and $C_2$-cofiniteness descend to finite-group orbifolds, and hence, by existing results, so does strong rationality.

comments
Comments are very welcome! 24 pages
fields
Quantum Algebra
pdf ↗ page arXiv:2611.03611 ↗

Algebraic Topology10

In topological data analysis, multiparameter persistence modules (MPMs) are used to analyze data with multiple parameters. Summarizing topological information for MPMs is a non-trivial task; one useful summary of bipersistence modules is the fibered barcode \cite{lesnick2015interactive,lesnick2025fast}. In this paper, we use a directed topological construction of the parameter space of a bifiltration to extend the fibered barcode. Specifically, given a $k$-critical bifiltration $F$, we build an associated directed Euclidean cubical complex $C$ whose directed paths each correspond to a one-parameter subfiltration of $F$. The path space of $C$, $\di{C}$, is used to define the \emph{extended fibered barcode}, which contains all possible monotonically increasing paths in $C$. We show that there can be paths in $\di{C}$ which generate filtrations not obtainable along a line with positive slope, and that all lines with positive slope have a path in $\di{C}$ that generate an equivalent barcode. We introduce two types of equivalence for these restricted modules: combinatorial equivalence of diagrams, and simplicial equivalence of the filtrations generating the modules. We show that removing certain cubes from $C$ yields a subcomplex on which dihomotopic paths induce simplicially equivalent filtrations, and hence combinatorially equivalent diagrams.

fields
Algebraic Topology
pdf ↗ page arXiv:2611.00261 ↗

We study persistence modules obtained from the $A$-fundamental groupoids of finite graphs. Moreover, we verify the categorical properties needed to form generalized persistence diagrams, and describe a quotient that identifies equivalent groupoids. A normalized linear presheaf construction places these modules in an essentially small abelian category, where Patel's Continuity Theorem gives a $1$-Lipschitz estimate in erosion distance. Explicit graph filtrations illustrate the groupoid-valued construction, and so we suggest a new approach to interpret persistence diagrams and large data sets in topological data analysis, based on recent works of A-homotopy theory of the last years.

comments
22pp
fields
Algebraic Topology, Combinatorics, Category Theory
pdf ↗ page arXiv:2611.00799 ↗

We define generalized Bernoulli numbers as appropriate coefficients of the Baker–Campbell–Hausdorff (BCH) product formula, extending the classical sequence of rational numbers to a 2-dimensional setting. We give an identity involving these numbers and the classical Bernoulli numbers which is equivalent to the existence of a particular complete differential graded Lie algebra modelling a cell decomposition of the 2-disk and based on the Lawrence–Sullivan model of the interval. From this identity we derive explicit quadratic relations. The existence of Lie models for the symmetries of the interval and the disk is related to certain properties of the BCH product and to some notable features of the classical Bernoulli numbers: the two choices for $B_1$, the vanishing of $B_n$ for odd $n\geq 3$, and the equality $B_4=B_8$.

fields
Algebraic Topology, Combinatorics, Number Theory
pdf ↗ page arXiv:2611.00825 ↗

Homology nilpotency need not increase under a product with a sphere. We construct a simply connected, closed smooth manifold $M$ of dimension $53$, rationally elliptic with $\dim_{\mathbb Q}\bigl(π_*(M)\otimes\mathbb Q\bigr)=7$, such that $cat_0(M)=10$ and $Hnil(M\times S^2)=Hnil(M)=11$. The inequality $Hnil(X\times Y)\leq Hnil(X)+Hnil(Y)$ can therefore be strict even for a product of a closed manifold with $S^2$ as the second factor.

fields
Algebraic Topology
pdf ↗ page arXiv:2611.01567 ↗

In this article we initiate the study of perfect commutative $\mathbb{F}_p$-algebras in the non-connective setting. As an application we show that given a finite $C_p$-space $X$ the $\mathbb{F}_p$-cochains on $X^{C_p}$ can be recovered as a base-change of the tilt of the Tate construction on cochains on $X^e$.

comments
20 pages
fields
Algebraic Topology
pdf ↗ page arXiv:2611.01985 ↗

We prove Lurie's proposed description of left rigid symmetric monoidal $(\infty,n)$-categories in terms of purely $\infty$-categorical data. More precisely, unfolding gives an equivalence between left rigid symmetric monoidal $(\infty,n)$-categories and complete categorical chain complexes of rigid symmetric monoidal $\infty$-categories. More generally, unfolding identifies skeletal sequences with categorical chain complexes without the completeness condition. We extend these equivalences to $(\infty,\infty)$-categories and, stably, obtain an equivalence between complete unbounded categorical chain complexes and left rigid categorical spectra. We also analyze their groupoid completion and express the homotopy groups of the associated spaces and spectra in terms of categorical cycles and boundaries. As examples, we construct the categorical chain complexes associated to geometric and algebraic bordism categories, including their equivariant variants, and to iterated span categories. Their localizations recover classical bordism and $L$-groups, while the span examples are related to algebraic $K$-theory.

comments
64 pages
fields
Algebraic Topology, Category Theory, K-Theory and Homology
pdf ↗ page arXiv:2611.01994 ↗

We study regular spherical actions, namely, actions of a connected compact Lie group G on a manifold M with equidimensional orbits, some of which are spheres. These spherical orbits are diffeomorphic to homogeneous spaces G/H, and there is a list of nine possible families of pairs (G, H). The normalizer N of H in G plays an important role in our calculations, as does the Weyl group W = N/H. In fact, there are three possibilities for W, namely: Z_2, S^1 and S^3. The goal of this paper is to relate the cohomology of M to that of the orbit space M/G. We obtain a particularly simple relationship in the first case, W = Z_2. For the remaining two cases, W = S^1 and W = S^3, it is already known that the cohomology of M and that of the orbit space M/G are related by the Gysin sequence ... \to H^k(M/G) \to H^k(M ) \to H^{k-d}(M/G) \to H^{k+1}(M/G) \to ... In this work, we provide a direct construction of this sequence, avoiding the use of spectral sequences. Moreover, we give an explicit description of the connecting homomorphism as multiplication by a power of the Euler class associated with the action of the Weyl group W = S^l on the fixed-point set M^H.

fields
Algebraic Topology
pdf ↗ page arXiv:2611.02111 ↗

For a compact oriented even-dimensional Witt pseudomanifold $X$, we compute the $S_n$-equivariant Banagl–Zagier $L$-classes of $X^n$ in terms of the Goresky–MacPherson $L$-classes of $X$ and the intersection cohomology Euler characteristic of $X$. This generalizes a theorem of Zagier for manifolds. Our approach is based on analyzing the equivariant structure of the signature operator of $X^n$ using equivariant $KK$-theory and power operations in analytic $K$-homology. We establish an analytic $K$-homology analogue of Moonen's algebraic localization theorem by proving that the localized Chern character of the $n$-th power operation, evaluated at an $n$-cycle, agrees with the $n$-th homological Adams operation applied to the Chern character. As an application, we prove that the characteristic class Hodge index conjecture for singular varieties, formulated by Brasselet–Schürmann–Yokura, is preserved under taking symmetric products of complex projective varieties.

comments
comments are welcome
fields
Algebraic Topology, Algebraic Geometry, K-Theory and Homology
pdf ↗ page arXiv:2611.02577 ↗

We show that the $f_j$, $p_j$, $D_3(j)$, and $p_j'$ families on the 4-line of the classical Adams spectral sequence all conform to the Uniform Doomsday Conjecture. We do so by first using Bruner's formula to establish uniform families of differentials on these classes. We then study the Burklund-Xu and Cartan-Eilenberg spectral sequences to ensure that the differential targets are nonzero. The $f_j$ family requires further analysis of possible Adams $d_2$ differentials since the $f_j$ support uniform $d_3$ differentials. As a result of our work, only two indecomposable $\text{Sq}^0$ families remain to be settled in Adams filtration 4.

fields
Algebraic Topology
pdf ↗ page arXiv:2611.02614 ↗

Determining the representative volume element is essential for establishing statistically meaningful microstructure-property relationships. Conventional approaches rely on the convergence of selected geometric descriptors, which may yield different estimates of the representative volume. Here, we propose a topology-based framework for assessing the representative scale of a nickel-yttria-stabilized zirconia solid oxide cell anode reconstructed using plasma focused ion beam-scanning electron microscopy (121.8 um x 83.97 um x 45.99 um). Persistent homology was used to characterize the pore network, and normalized persistence images of subvolumes were compared with those of the largest available reference volume using the L1 distance. This provides a continuous measure of topological similarity across observation scales, rather than defining representativeness through a single convergence threshold. The topological distance decreases with increasing volume and is described by empirical exponential models over the investigated range (R2 in [0.972, 0.983]). Comparison with porosity and specific surface area highlights differences in the scale-dependent behavior of geometric and topological descriptors. The framework was also tested on three independent synthetic realizations, demonstrating its potential for quantitative assessment of topological similarity in porous microstructures.

comments
20 pages, 8 figures
fields
Algebraic Topology
pdf ↗ page arXiv:2611.03176 ↗

Operator Algebras9

Let \(M\) be a Hopf–von Neumann algebra with predual \(M_*\). Using minimal weak*-closed left ideals, we obtain an idempotent state \(\varphi\in\operatorname{WAP}(M_*)^*\) satisfying \(\varphi\star ω\star\varphi=\varphi\) for every state \(ω\) on \(\operatorname{WAP}(M_*)\). This state determines the largest closed introverted subspace \(X_\varphi\subseteq\operatorname{WAP}(M_*)\) containing the identity and admitting a two-sided invariant mean. We also characterize the existence of a unique two-sided invariant mean on introverted operator systems in \(\operatorname{WAP}(M_*)\) by a symmetry condition on their left and right state orbits. The criterion recovers the classical results for locally compact groups and their Fourier algebras, and gives a unified treatment of cocommutative Hopf–von Neumann algebras, compact quantum groups, unital \(C^*\)-Eberlein algebras, and \(\operatorname{WAP}(M(G))\) for every locally compact group \(G\).

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

Let $(\mathcal T_t)_{t\geqslant0}$ be a quantum Markov semigroup on a von Neumann algebra and let $\mathcal A$ be an invariant Feller $C^*$-algebra. We formulate the $e$-property on the full state space and show that its quantitative defect is equivalent, within an optimal factor two, to the Hausdorff measure of non-compactness of observable orbits. We develop Cesàro and Lip-norm criteria and a generalised Doeblin minorisation by a state-space contracting positive map, including finite-dimensional and measure-prepare factorisations. When every observable has the $e$-property, the Jacobs–de Leeuw–Glicksberg decomposition identifies the reversible Choi–Effros algebra and the norm-stable sector. Expected and decoherence-free subalgebras transfer the property under norm decay of the complementary dynamics, including infinite-dimensional ultracontractive and finite-index Pimsner–Popa regimes. Finally, we establish the full comparison hierarchy among ordinary, eventual, Cesàro and pointwise eventual equicontinuity notions, reinforced by matrix Jamison and homoclinic flow counterexamples. Projection-face criteria are treated in a companion paper.

comments
45p
fields
Operator Algebras, Dynamical Systems, Functional Analysis, Probability, Spectral Theory
pdf ↗ page arXiv:2611.00703 ↗

We prove that every amenable action of a countable discrete group on a separable, simple, unital, nuclear, $\mathcal{Z}$-stable C*-algebra absorbs the trivial action on $\mathcal{Z}$ up to cocycle conjugacy. The group may be nonamenable, as in Suzuki's recent examples, and no assumptions on outerness or on the tracial state space are needed. This extends OpenAI's result for amenable groups to amenable actions. Amenability of the action cannot be omitted in general, as examples of the author and Lupini show. More generally, we show that every tracially amenable action on a separable, unital, $\mathcal{Z}$-stable C*-algebra with traces admits invariant central copies of all matrix algebras, without simplicity or nuclearity. For amenable actions on simple nuclear algebras, equivariant property (SI) allows one to deduce $\mathcal{Z}$-stability from this. As applications, we obtain absorption of $\mathcal{Z}$ for intermediate subalgebras in the crossed product, and also pure infiniteness for outer amenable actions of nonamenable groups. The basic techniques involving Gaussian variables originate in OpenAI's preprint, and are also the main new tool in its proposed solution to the Toms–Winter conjecture. We extend these techniques in order to deal with the weight functions coming from amenability, and one of the main new ingredients is the fact that one can replace an amenable action by an auxiliary one for which the amenability weights are central. In order to make the probabilistic tools accessible to the community beyond what is used here, we include an appendix where the theory is developed assuming only an elementary background, and where the relevant estimates are proved in detail.

comments
45 pages, including 11 pages of appendix where the tools used to estimate Gaussian moments are explained in detail
fields
Operator Algebras
pdf ↗ page arXiv:2611.00995 ↗

We show that if $N\subset M$ is an inclusion of $\mathrm{II}_1$ factors of uniform infinite index, for instance an irreducible inclusion of infinite index, then every positive contraction $b\in N$ is of the form $E_N(p)$ for a projection $p\in M$. This gives the exact version of Popa's asymptotic result in the ultrapower, and it is a subfactor analogue of the Carpenter problem for masas. In particular, Popa's relative dimension set of such an inclusion is $[0,1]$, so the set of expectations of projections does not distinguish inclusions without corners of finite index. As applications, the Carpenter property holds for $N\subset N\rtimes G$ whenever an infinite group $G$ acts outerly on a $\mathrm{II}_1$ factor $N$, and for ICC groups $H\le G$ the inclusion $L(H)\subset L(G)$ has it exactly when $[G:H]=\infty$, confirming a recent conjecture. We also give examples showing that the Carpenter property does not imply uniform infinite index, and that infinite index does not imply the Carpenter property.

fields
Operator Algebras
pdf ↗ page arXiv:2611.02006 ↗

Popa's relative dimension set $Λ(M,N)$ of an inclusion of $\mathrm{II}_1$ factors $N\subset M$ consists of the scalars $α$ for which some projection $p\in M$ satisfies $E_N(p)=\alpha1$. Popa computed it for index at most $4$, and for index $d>4$ outside the middle interval $(t_d,1-t_d)$, where $t_d(1-t_d)=d^{-1}$; whether the middle interval meets $Λ(M,N)$ for every irreducible inclusion of index $d>4$ has remained open. We show that for every extremal inclusion of finite index $d>4$, the whole interval $[t_d,1-t_d]$ is contained in $Λ(M,N)$. Consequently, $Λ(M,N)$ depends only on the index for all extremal inclusions of finite index, in particular for all irreducible ones. Extremality cannot be dropped: for $d>4$, Popa's locally trivial inclusions are exactly those whose relative dimension set misses the middle interval. Other non-extremal inclusions can contain the whole middle interval in their relative dimension set, or miss part of it.

fields
Operator Algebras
pdf ↗ page arXiv:2611.02336 ↗

Let $(\mathcal{M},τ)$ be a tracial von Neumann algebra, $T:L_1(\mathcal{M},τ)\to L_1(\mathcal{M},τ)$ be induced by a normal $τ$-preserving $*$-automorphism of $\mathcal{M}$, and $x\in L_1(\mathcal{M},τ)$. We will prove the bilaterally almost uniform convergence of averages of the form $$\frac{1}{n}\sum_{k=0}^{n-1}T^k(x_k),$$ generalizing an ergodic theorem proven by Breiman in \cite{Breiman57}, where $(x_k)_{k=0}^{\infty}$ is an element of the noncommutative vector-valued $L_p$-space $L_p(\mathcal{M},τ;\ell_\infty)$ such that there exists $x\in L_p(\mathcal{M},τ)$ with $(x_k-x)_{k=0}^{\infty}\in L_p(\mathcal{M},τ;c_0)$. A generalization to semifinite $(\mathcal{M},τ)$ and general positive Dunford-Schwartz operators $T\in DS^+(\mathcal{M},τ)$ is shown as well when $1<p<\infty$. In addition to these, we also prove a number of generalizations of the results to weighted, subsequential, and other types of averages.

comments
32 pages
fields
Operator Algebras, Dynamical Systems, Functional Analysis
pdf ↗ page arXiv:2611.02535 ↗

Motivated by the recent explicit counterexample to Connes' embedding conjecture, we study the degree and number of variables needed to separate normalized matrix traces on self-adjoint contractions from traces on finite von Neumann algebras. We prove that the two trace infima coincide for every Hermitian polynomial of degree at most two in at most three variables, with a dimension-explicit approximation bound. We give three explicit separators: an integer-coefficient polynomial of degree six in ten variables with 392 nonzero words, a quadratic polynomial in 214 variables, and an integer-coefficient polynomial in two variables of ordinary and cyclic degree 24. Each has normalized trace at least \(3/4\) on every matrix contraction tuple and trace \(-1\) at a finite tracial witness. We provide the source systems, transfer estimates, and exact coefficient recipes for all three constructions.

comments
83 pages
fields
Operator Algebras
pdf ↗ page arXiv:2611.02604 ↗

We prove that the nuclear dimension of any graph $C^*$-algebra is at most two, and we compute the exact value of the nuclear dimension for a large class of graph $C^*$-algebras. In particular, this class covers all graphs with Condition (K). Our methods --- based on Szabó's recent $KK$-uniqueness theorem --- provide a unified approach to computing the nuclear dimension of various extensions. This includes the nuclear dimension of the Toeplitz algebra (first computed by Brake–Winter) and that of the Cuntz–Toeplitz algebras (first computed by Easo et al).

comments
46 pages, comments welcome! No LLM's were used at any stage during this project
fields
Operator Algebras
pdf ↗ page arXiv:2611.03082 ↗

Building on the results of \cite{HR}, we investigate the relationship between \(C^*\)-extremality and linear extremality in the closed unit balls of general unital \(C^*\)-algebras. We show that, unlike in von Neumann algebras, these two notions of extremality need not coincide in general \(C^*\)-algebras. More precisely, we prove that the unilateral shift is a linear extreme point, but not a \(C^*\)-extreme point, of the closed unit ball of the Toeplitz \(C^*\)-algebra. We further establish that \(C^*\)-extremality implies linear extremality whenever the \(C^*\)-algebra admits a faithful unital representation on a separable Hilbert space. We also prove this implication for elements admitting a factorization $x=v|x|$, where $v$ is a partial isometry belonging to the algebra, and extend the result to suitable quotient \(C^*\)-algebras, including the Calkin algebra. Finally, we characterize the linear extreme points of the closed unit ball of unital \(C^*\)-subalgebras of \(B(H)\) containing the compact operators.

comments
10 pages. Comments are welcome
fields
Operator Algebras
pdf ↗ page arXiv:2611.03563 ↗

Category Theory8

We study category-like structures in which composition is not associative, especially Munch-Maccagnoni's duploids, in univalent foundations. Included is a definition of what a univalent duploid is: one where isomorphisms of a suitable kind render the objects indistinguishable to the type theory. We show that the existing construction of a duploid from an adjunction is not univalent as a "single-sorted" duploid, and provide a novel construction which is. This work is formalized in the UniMath library for the Rocq proof assistant.

fields
Category Theory
pdf ↗ page arXiv:2611.00068 ↗

We present some theoretical aspects of the categories of global and partial group actions of topological groups on topological spaces, denoted by G-ActTop and G-pActTop, respectively. We construct topological partial actions on products and disjoint unions of topological spaces, and G-pinvariant subspaces. Furthermore, we provide an adequate definition of congruence (G-pcongruence), which enables the construction of quotient objects in the category of topological partial actions. In addition, we associate a special G-pcongruence to each pair of strong G-pmorphisms. Then, we study products, co-products, equalizers, co-equalizers, pullbacks, and pushouts in the category G-pActTop. We find that the category of topological partial actions is finitely complete and contains a co-complete subcategory. Finally, we show that the relationship between a topological partial action and its enveloping action is functorial. As a consequence, we obtain that the categorical product in G-ActTop coincides with the categorical product in G-pActTop. Moreover, the envelope of a co-product in G-pActTop is given by the co-product of the respective envelopes.

comments
Research article, 30 pages, no figures
fields
Category Theory, General Topology, Group Theory
pdf ↗ page arXiv:2611.00363 ↗

For a finitely complete category X, we prove that the lax comma category Cat//X is cartesian closed if and only if its free coproduct completion Fam(X) is cartesian closed. The proof uses a change-of-base theorem: postcomposition with a functor induces a left adjoint between lax comma categories precisely when that functor is a left multiadjoint. We describe the exponentials and derive examples from known results on family categories.

comments
7 pages
fields
Category Theory, Logic
pdf ↗ page arXiv:2611.01184 ↗

We continue the programme developed in Pseudo-Kan extensions and descent theory by studying descent for augmented pseudocosimplicial objects. Let $\mathcal H$ be a $2$-category, and let $\operatorname{suc}=\mathsf{1}+(-)$ be the successor monad on the augmented simplex category. Precomposition with $\operatorname{suc}$ induces the décalage pseudomonad $\mathbb S$ on the $2$-category of augmented pseudocosimplicial objects with values in $\mathcal H$. We prove that every successor contraction makes the corresponding augmented pseudocosimplicial object effective for descent. This structure is preserved by postcomposition with every pseudofunctor. Consequently, the resulting descent object is an absolute bilimit. A first application concerns split epimorphisms. We recover the Janelidze–Tholen characterization of absolute effective descent morphisms given in Facets of Descent II. Moreover, we prove that one direction holds for every pseudofunctor $A\colon C^{\mathrm{op}}\to\mathcal H$, where $\mathcal H$ is an arbitrary $2$-category. Consequently, every $\mathbb S$-pseudoalgebra is of absolute descent. In particular, this holds for every free $\mathbb S$-pseudoalgebra, and hence for every one-sided décalage. This makes the shift-effectiveness hypothesis in the Bénabou–Roubaud theorem of Pseudo-Kan extensions and descent theory automatic. Thus, under the adjointness and Beck–Chevalley hypotheses, the descent and Eilenberg–Moore factorizations are equivalent whenever they exist. We thus obtain a stronger version of the Bénabou–Roubaud theorem for arbitrary augmented pseudocosimplicial objects, which we call the formal Bénabou–Roubaud theorem. Applied to indexed Čech objects associated with pseudofunctors $A\colon C^{\mathrm{op}}\to\mathcal H$, this theorem extends the classical Bénabou–Roubaud theorem to an arbitrary $2$-category $\mathcal H$.

comments
26 pages
fields
Category Theory, Algebraic Geometry
pdf ↗ page arXiv:2611.01654 ↗

We show that a closed symmetric monoidal V-enriched $\infty$-category can be described by a lax symmetric monoidal functor to V from its underlying $\infty$-category.

comments
24 pages
fields
Category Theory, Algebraic Topology
pdf ↗ page arXiv:2611.01916 ↗

We study the representability of actions in varieties of algebras with $n \geq 1$ not necessarily associative bilinear multiplications. We first prove that, for homogeneous varieties, action accessibility is equivalent to being an Orzech category of interest. For an action accessible, operadic variety we then construct the external weak actor $\mathcal{E}(X)$ of an algebra $X$, an algebra with $n$ bilinear partial operations together with a natural monomorphism encoding the actions on $X$. We characterise the algebras admitting an actor in terms of $\mathcal{E}(X)$, and we deduce an obstruction to action representability: if, for some algebra $X$ with trivial multiplications, $\mathcal{E}(X)$ does not satisfy a multilinear identity of the variety, then the variety is not action representable. Computing the external weak actor explicitly, we obtain that associative and matching dialgebras are weakly action representable but not action representable, and that Poisson algebras, left-right non-commutative Poisson algebras and matching Lie algebras are not action representable. Finally, we introduce the reduced type $(p,q)$ of such a variety and prove that, over a field of characteristic different from $2$, an operadic variety of reduced type $(p,0)$, $(0,q)$ or $(1,1)$ is action representable if and only if it is term equivalent to the variety of Lie algebras or to that of abelian algebras. For the reduced types $(p,0)$ and $(0,q)$, the arguments require no assumption on the cardinality of the field, whereas the case $(1,1)$ requires the field to be infinite.

fields
Category Theory, Rings and Algebras
pdf ↗ page arXiv:2611.02097 ↗

We show that the category of morphisms of topological groups admits split extension classifiers and hence the category of topological groups admits normalizers. We give explicit descriptions of both normalizers and of split extension classifiers of morphisms of topological groups in terms of split extension classifiers of topological groups.

fields
Category Theory
pdf ↗ page arXiv:2611.03253 ↗

Higher-order many-sorted categorial algebras are many-sorted algebras whose carriers are strict higher-order categories and whose operations are higher-order functors. They admit a homogeneous and a heterogeneous presentation, both by partial algebras whose operation domains are given by existence equations. To relate these presentations and their dimensions, we introduce generalized hep-derivors between hierarchical equationally partial signatures. A generalized hep-derivor selects carriers by existence equations in one variable and interprets operation symbols by terms, with operation domains evaluated recursively in the transformed algebra. Every generalized hep-derivor induces a functor between categories of many-sorted partial algebras. The values of this functor satisfy the domain conditions wherever their operations are defined, and we characterize when the operations are defined exactly where these conditions hold. The functor induced by a composite receives a natural inclusion from the composite of the induced functors; this inclusion, which can be strict, makes the induced functors a normal lax indexed category. In finite dimensions, generalized hep-derivors realize graduation and unification as an equivalence between the homogeneous and heterogeneous presentations, and discretization as a left adjoint to truncation. In dimension $ω$, we reconstruct the categories of $ω$-categorial algebras as projective limits of their finite-dimensional truncations and obtain unification by a quotient construction; we also establish algebraic squares and compatibility with change of signature. Finally, for nonempty sets of sorts, we show that the finite-dimension condition in the homogeneous $ω$-presentation is not axiomatizable by quasi-existence equations on its fixed signature.

comments
136 pages, 1 figure
fields
Category Theory
pdf ↗ page arXiv:2611.03553 ↗

Spectral Theory7

We prove that every spectral finite union of pairwise disjoint bounded intervals whose lengths satisfy at most four linearly independent rational relations tiles the real line, and that each of its spectra has at most five cosets modulo its least period. This includes every spectral union of at most five bounded intervals. The proof combines specialization preserving subset-sum equalities with rigidity of exchanges between finite spectral fibers. We also obtain common tiling complements for all spectra of primitive sets of at most seven elements in finite cyclic groups, and establish the sharp eleven-point range in which consecutive pairs force periodicity of the dual set.

comments
108 pages, 8 figures
fields
Spectral Theory
pdf ↗ page arXiv:2611.00307 ↗

We investigate a one-dimensional discrete Dirac-type operator $D_d$ acting on the Hilbert space $\big(\ell^2(\mathbb{Z};\mathbb{C})\big)^2$, obtained from the classical continuous free Dirac operator by replacing the spatial derivative with the one-sided backward difference operator $I - S_1$, where $S_1$ denotes the right shift on $\ell^2(\mathbb{Z};\mathbb{C})$. We establish the fundamental operator-theoretic and spectral properties of $D_d$: unlike symmetric or supersymmetric lattice discretizations, $D_d$ is bounded and non-normal for every non-zero rest mass $m > 0$, with self-commutator $[D_d, D_d^†] = -2mc^3(-Δ_{\mathrm{disc}})σ_2$, yet it is quadratically normal. We compute the exact operator norm, determine the exact spectral radius in two mass regimes, and show via Fourier–Laurent analysis that the spectrum $σ(D_d)$ is purely continuous and lies on a two-component algebraic curve in the complex plane undergoing a topological transition at $mc^2 = 2c$. Finally, introducing a lattice spacing $h > 0$ and embedding $\big(\ell^2(h\mathbb{Z};\mathbb{C})\big)^2$ isometrically into $\big(L^2(\mathbb{R};\mathbb{C})\big)^2$ via Whittaker–Shannon band-limited interpolation, we prove that the scaled non-normal discrete Dirac-type operator $D_{d,h}$ converges to the continuous self-adjoint Dirac operator $D$ in the norm resolvent sense at the optimal rate $\mathcal{O}(h)$ as $h \to 0^+$, without requiring frequency cutoffs.

comments
17p
fields
Spectral Theory, Mathematical Physics, Functional Analysis
pdf ↗ page arXiv:2611.00820 ↗

We prove strong ballistic transport for one-dimensional continuum Schrödinger operators by comparing the spectral geometry at two consecutive periods. Enlarging a period decomposes each fiber into the eigenspaces of translation by the smaller cell. Away from the larger-period symmetry momenta, a simple ordered band remains in one translation sector and agrees with one translated smaller-period band. This permits us to combine large-period ordering and non-overlap with a smaller-period derivative bound. We obtain lower bounds for folded band widths and confine all near-collisions to a common neighborhood of the symmetry momenta, with the exponential cost at the smaller period. For nested periods $p_n$ with $p_{n+1}/p_n\in\mathbb{N}$ and $p_{n+1}\ge2p_n$, approximation errors $o(p_{n+1}^{-2}e^{-ηp_n})$, where $η>7\sqrt{2R}$ and $\|V\|_\infty\le R$, give a nonzero strong asymptotic velocity on a weighted $H^2$ class containing the Schwartz space. Every position moment of order $0<r\le4$ has two-sided ballistic growth. A period-uniform form estimate, ordered-gap summation, and a linear dynamical comparison complete the argument. No upper bound on successive period ratios is assumed, and the sufficient approximation exponents are not claimed to be optimal.

comments
29 pages, no figures
fields
Spectral Theory, Mathematical Physics, Analysis of PDEs
pdf ↗ page arXiv:2611.01303 ↗

We prove that every convex body $K\subset\mathbb{R}^n$ admits $S\in\mathrm{SL}_n(\mathbb{R})$ such that $λ_1(SK)|K|^{2/n}\le Cn$, where $C$ is universal. For origin-symmetric bodies of volume one, the bound holds in maximal Gaussian measure position. The main step is the spectral estimate \[ λ_1(D)\le C(P)\bigl(n+\sqrt{n I(ν\midγ_n)}\bigr) \] for an even isotropic log-concave probability measure $ν$ supported on a symmetric convex body $D$, with Poincaré constant at most $P$ and finite relative Fisher information. A second-order Stein estimate and an information jump under convolution give entropy decay faster than $m^{-1}$ for normalised sums. Their supports control the Gaussian measure of dilates, and a Brownian bridge expansion gives the spectral estimate. A Gaussian-weighted ground state supplies a measure whose Fisher information is bounded in terms of $λ_1(K)$. The square-root dependence then gives the bound of order $n$.

comments
16 pages
fields
Spectral Theory, Functional Analysis, Metric Geometry
pdf ↗ page arXiv:2611.02279 ↗

We study low-order eigenvalue ratio estimates for the Laplacian with Muckenhoupt $A_2$ weights. For weights bounded above and below, we prove a universal upper bound for $λ_2/λ_1$ with constant $1 + \frac{4}{n}\,\frac{C}{c}$, linear in the ratio of the weight bounds, and recover the classical Payne-Pólya-Weinberger bound as a special case. For radial decreasing weights, we prove that the ball maximizes $λ_2/λ_1$ among domains of equal volume, assuming that an admissible radial test function exists (Definition 5.8) and that on the ball the second eigenvalue is attained by the $l=1$ mode. The argument adapts the method of Ashbaugh–Benguria to the weighted setting via a weighted Chiti comparison theorem and a monotonicity property of the admissible radial test function (Definition 5.8). Higher-order eigenvalue ratios are estimated in terms of the $(n-1)$-Hausdorff measure of the boundary, under an explicit balance condition on the weight at the covering scale. The generalized Payne-Pólya-Weinberger conjecture for eigenvalue sums remains open in general; conditional results are presented for restricted families of domains.

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

We give a two-term Weyl asymptotic for the Steklov spectrum of a solid regular tetrahedron. Its linear coefficient is the total edge length times an explicit, absolutely convergent dihedral invariant. A trace-class difference of massive Neumann-to-Dirichlet operators computes the full invariant, including the continuous spectrum. The main analytic step is a fixed-time cumulative trace comparison between the compact tetrahedron and its exact half-space or dihedral models. Localized Hilbert-Schmidt defects have vanishing high-energy tails; retaining the time factor in Duhamel's formula makes this sufficient for an $o(L)$ cumulative error. A separate trace-class face comparison fixes the model's infinite exterior primitive and permits one observation time independent of the inner collar width. Compact-band Mourre estimates and a harmonic comparison establish immediate reflection/transmission support for incident face waves. Triangular unfolding gives null periodic and dead-end sets for the maximal branching relation. Actual edge-window bounds, adapted conical annuli and an ordered-limit Fourier-Tauberian argument then prove the sharp remainder. The proof treats guided and continuum channels together in the edge trace and requires neither a guided metric graph nor a lower-departure estimate uniform at zero tangential momentum.

comments
27 pages. The AI system GPT-6 Astra was used in preparing this manuscript; see the disclosure on the first page
fields
Spectral Theory
pdf ↗ page arXiv:2611.02733 ↗

This article presents two converses to well-known observations regarding products of eigenfunctions of the Laplacian on a closed Riemannian manifold $(M,g)$. First, if $(M,g)$ is real-analytic, the coefficients in the eigenfunction expansion of a product of eigenfunctions decay exponentially. We show that such exponential decay in fact implies that $g$ is real-analytic. Second, it is clear that if $(M,g)$ is flat, there exists an eigenbasis for which the product of any two of its elements lies in the span of at most $N = N(M,g)$ elements. We prove that any manifold with such an eigenbasis must be flat. We then construct metrics on $\mathbb{S}^7$ that share an eigenbasis with the standard metric yet are not locally homogeneous, from which we deduce that homogeneity cannot be characterized solely in terms of the multiplicative structure of eigenfunctions.

fields
Spectral Theory, Differential Geometry
pdf ↗ page arXiv:2611.03619 ↗

Symplectic Geometry6

We introduce a relative version of Weinstein's morphism associated to a Lagrangian submanifold \(L\) of a closed symplectic manifold \((M,ω)\). We construct a homomorphism \[ \mathcal{A}^{(L,α)}\colon π_{1}\bigl(\operatorname{Ham}_0(M,L)\bigr) \longrightarrow \mathbb{R}/\mathcal{P}_{2}(M,ω), \] and establish its basic properties. We compute the invariant in several examples, including latitude circles in \(S^2\), and more generally, Lagrangian fibers in toric manifolds. These computations provide obstructions to Ha\-mil\-to\-nian isotopy of Lagrangian submanifolds and detect nontrivial, and in some cases infinite-order, elements in the homotopy groups of their Hamiltonian stabilizers.

fields
Symplectic Geometry
pdf ↗ page arXiv:2611.01083 ↗

We prove the nearby Lagrangian conjecture for the Klein bottle: every closed connected embedded exact Lagrangian submanifold of its cotangent bundle is Hamiltonian isotopic to the zero section by a compactly supported isotopy. The proof passes to the torus double cover and builds on the theorem of Dimitroglou Rizell, Goodman, and Ivrii for the two-dimensional torus. The main step is to construct an isotopy compatible with the covering involution. We achieve this using holomorphic sphere rulings in $S^2\times S^2$ adapted to the zero section, allowing the construction to descend to the Klein bottle.

comments
16 pages, 7 figure
fields
Symplectic Geometry
pdf ↗ page arXiv:2611.01506 ↗

We introduce the partially wrapped contact Fukaya category of a 1-jet space equipped with a stop, which is an \(A_\infty\)-category of Legendrians equipped with representations of their Chekanov-Eliashberg algebras. This category is invariant under contact isotopies of the stop. We prove a wrapping exact triangle and a generation theorem. When the stop is bounded subanalytic singular isotropic, we prove a Morita equivalence between the partially wrapped contact Fukaya category and a microlocal sheaf category.

comments
42 pages, 12 figures
fields
Symplectic Geometry, Geometric Topology
pdf ↗ page arXiv:2611.01689 ↗

In this paper, we study the fiber connectivity of proper almost-toric systems $Φ$ on connected four-dimensional symplectic manifolds. Using Morse–Kirwan theory, we establish three sufficient conditions for fiber connectivity. These results generalize and extend the fiber connectivity results of Pelayo, Ratiu, and Vu Ngoc (2015) by relaxing some of their hypotheses.

comments
23 pages, 2 figures
fields
Symplectic Geometry
pdf ↗ page arXiv:2611.02165 ↗

Inspired by the rigidity of exact Lagrangian submanifolds, a conjecture by P.~Biran and O.~Cornea asks if a simple exact Lagrangian cobordism $W$ in a tame exact symplectic manifold is always ``symplectically trivial'' (i.e. the Lagrangian suspension of an Hamiltonian isotopy). In this short note, we prove a topological version of this conjecture~: if the cobordism has dimension at least $6$, it is always topologically trivial. This extends a previous work of Lara Suarez who reduced the question to proving an injectivity result among fundamental groups.

fields
Symplectic Geometry
pdf ↗ page arXiv:2611.03041 ↗

We show that a decomposable Lagrangian concordance between two Legendrian links must induce a closed immersion between the sheaf moduli of its ends. As the main application of this criterion, we prove a conjecture of Cornwell-Ng-Sivek, showing that their Lagrangian concordance is not decomposable. This establishes the first known example of a regular Lagrangian concordance between Legendrian knots that is not decomposable. In addition, we show that even the simpler Lagrangian concordance, satelliting via the Reeb 2-copy, is not decomposable.

comments
21 pages, 11 figures
fields
Symplectic Geometry
pdf ↗ page arXiv:2611.03448 ↗

History and Overview4

What does it mean to tell the story of a mathematician? Written as a letter to a young Black mathematician, this article reflects on how stories shape our understanding of mathematics and our sense of belonging within the mathematical community. Through the lens of Hidden Figures Revealed, a project documenting Black mathematicians at The Ohio State University, I discuss humanity, mathematics, and context as three guiding principles for mathematical storytelling. In particular, I reflect on how this framework emerged through archival research, shaped historical narratives, and informed mathematical learning experiences.

fields
History and Overview
pdf ↗ page arXiv:2611.00125 ↗

Large collections of manuscripts and research notes offer ways to reuse arguments, while making it harder to retain hypotheses, check claims, and understand how results were obtained. We propose Recursive Reasoning Exploration (RRE), a framework for cumulative mathematical research through evolving reasoning graphs. RRE links claims and jointly required premises to research targets, attempted arguments, counterexamples, checks, and revisions. Each investigation can generate further targets, and its supported outcomes become available to subsequent investigations. This is Phase III of the Math Instruments program: identifying mathematical instruments, reconstructing reusable reasoning, and organizing recursive research from that reasoning. The framework supports human-directed, collaborative, and goal-directed autonomous exploration, with open-ended exploration as a further mode. Its records also provide material for learning how mathematical investigations develop. A complexity research case study establishes an exact theorem: for every complex tensor of order n >= 2 and rank greater than two, the minimum Nullstellensatz certificate degree for its original two-term decomposition equations is 3n. This includes an infinite family whose every flattening has rank at most two. The exploration develops an explicit boundary certificate, a balanced transfer lemma, and an exhaustive argument using classical rank-two geometry. A parallel branch gives bounds 3m + 3 <= delta_m(I_m, N) <= 3m + 6 for every nonzero nilpotent m by m matrix. Six graph revisions record the progression from inherited results to these theorems, with exact arithmetic checks and a replayable exploration history. We present the RRE representation and protocol, the mathematical proofs, visualizations of graph evolution, and a research agenda for shared human-AI exploration, cumulative reuse, and education.

fields
History and Overview
pdf ↗ page arXiv:2611.02186 ↗

Signed numbers make learners revise what addition, subtraction and the minus sign meant for whole numbers. This paper presents the design rationale and a critical analysis of a three-level source progression for signed numbers (Grades 5-7, nominal ages 10-13), from which French-curriculum and International Baccalaureate chapters published at https://commeunjeu.org are assembled. One representation is presented first and taken up throughout: an integer is drawn as a collection of positive and negative units, a positive and a negative unit forming a zero pair that leaves nothing. An integer therefore has many drawings, which makes visible the construction of the integers as classes of pairs of natural numbers. The design hypothesis is that the gesture pupils perform with the units, inserting a zero in the form a + (-a), is shared by the subtraction of a negative number, by the worked examples that accompany the 2026 French programme, and by the derivation of the sign of a product of two negatives through distributivity; the progression does not model that product, it derives it from the zero pair, a derivation that holds only if distributivity is kept. The number line supports position, order and distance; contexts provide applications. The choices are related to the epistemological obstacles described by Glaeser, to studies of counter and number-line models, including a classroom comparison in which a path model gave better results than chips, immediately and five weeks later, and to the French and IB curricula. A block-level audit of the dated source documents found the representation absent from the first level, no exercise asking pupils to draw, and the decisive subtraction never drawn; the revisions made after the audit are recorded. No empirical evaluation is reported; hypotheses for one are stated.

comments
21 pages, 6 figures, 3 tables. CC BY 4.0
fields
History and Overview
pdf ↗ page arXiv:2611.02294 ↗

Fitch Cheney's five-card trick is one of the purest two-person effects in card magic, and it has attracted mathematicians for more than seventy five years. This article retells the effect and its classic method, surveys how far it can be pushed, and presents several new results that matter to performers. We give a version of Cheney's method that needs no fixed first suit and no fixed ``lowest card'': shifting every card one step in rank and one step in suit shifts the display in the same way. A heckler who may swap two neighboring cards of the display defeats every method with a full deck. We show that a 29-card deck is the largest for which such a swap can be corrected, and that the corresponding maximum is 14 cards if any two cards may be swapped. We give simple methods that achieve both bounds. Finally, we make Berlekamp's arithmetic method for the 124-card deck independent of where the numbering starts. We also describe a pocket version with eight cards.

fields
History and Overview, Combinatorics
pdf ↗ page arXiv:2611.02424 ↗

General Mathematics3

Let $Γ$ be a group characterized by a small cancellation $C'(1/8)$-presentation. We study the structure of its Cayley graph, specifically geodesic intervals and digons. We prove that all geodesic segments $[x,y]$ of length $n$ can be covered by finitely many simple geodesic digons with pairwise $C'(1/8)$-short lower intersections whose lower sides lie on a common geodesic segment $[x,y]$. This is a generalization of a proposition of Kharlampovich-Sklinos (arXiv:2106.05461) for random groups. We then bound this resulting diagram of digons, showing that the total perimeter of its cells and its edge count is bounded by $n$, and the cycle rank is equal to the number of distinct cell contours. Thus, although there may be many different geodesics, the size of their union is bounded linearly in the distance between their endpoints. The constant is independent of the number and lengths of the defining relators. In particular, the estimate applies to infinite presentations with unbounded relator lengths. From this we get a consequence for growth, allowing us to compare the number of geodesic words with the number of group elements of the same length.

comments
12 pages, 4 figures
fields
General Mathematics, Group Theory
pdf ↗ page arXiv:2611.00095 ↗

We describe a finite computational verification of Markov Uniqueness Conjecture for normalized positive integer solutions of $x^2+y^2+z^2=3xyz$ with $z \leq 10^{500000}$. The archived run reports $239\,536\,376\,556$ triples with distinct maximal coordinates.The method combines a disjoint tree decomposition, certified fixed-point range bounds, a deterministic 48-bit candidate screen,and replay modulo $2^{128}$. We give the mathematical justification and a reproducibility procedure covering package checks,retained-data auditing, and a full rerun. The conclusion depends on correct execution of the exhaustive screen and replay; the retained audit does not regenerate the deleted screening buckets.

comments
7 pages. The supplementary materials accompanying this paper contain the computational evidence and reproducibility instructions; they can be obtained at https://zenodo.org/records/23670834
fields
General Mathematics
pdf ↗ page arXiv:2611.01007 ↗

Let $p$ be a prime and let $G$ be the diagonal of $N/Q$ in $m$ variables over the $p$-adic integers, with $Q(0)$ a unit. We prove that the $p$-kernel of the coefficients of $G$ modulo $p^α$ has size $K_α(G)\le p^{(|J|+1)α-1}+(p^α-1)/(p-1)$, where $J$ is an explicit finite support set determined by the Newton polytopes of $N$ and $Q$, and $|J|\le\prod_i(h_i+1)$ for $h_i=\max(°_{z_i}N,°_{z_i}Q)$. Thus the minimal automaton has $p^{O(α)}$ states for fixed input and prime. The general upper bounds of Rowland and Yassawi have exponents that are cubic in $α$ for Furstenberg series and of order $α^{m+1}$ for diagonals in $m$ variables. The proof combines a $δ$-decomposition with synchronous Cartier sections and a count of compatible histories; it requires no smoothness or ordinarity assumption. We give explicit transitions and derive bounds for Furstenberg series. For the Furstenberg series $F$ of $bx^2y^2+(1+ax+dx^2)y+cx^2$ with odd $a,b,c,d\in\mathbb{Z}_2$, we prove $K_α(F)\ge9\cdot8^α/(64α-32)$ and $\lim_{α\to\infty}α^{-1}\log_2K_α(F)=3$. This exponent result rests on primitive reachability, parameter-independent normalized window frames, and an overlap estimate certified in a finite quotient of a rational Cartier lattice. An appendix also proves that the zero orbit in the Rowland-Yassawi automaton for $x^2y^2+(1+x+x^2)y+x^2$ has exactly $2^{α+1}+α+1$ states, resolving their orbit-size conjecture.

comments
38 pages; ancillary files (code, exact data and logs) in anc/
fields
General Mathematics
pdf ↗ page arXiv:2611.01481 ↗

K-Theory and Homology2

We give a negative answer to a question of Sánchez Saldaña–Velásquez and Lück asking whether the topological K-theory of the reduced group C*-algebra of a split crystallographic group with finite cyclic holonomy is always torsion-free. For two explicit split crystallographic groups with translation subgroup of rank four and holonomy of order four, we compute the equivariant K-theory of the classifying space for proper actions and find nontrivial two-torsion. The equivariant universal coefficient theorem transfers this torsion to proper equivariant K-homology, and the Baum–Connes conjecture identifies the resulting groups with the topological K-theory of the corresponding reduced group C*-algebras.

fields
K-Theory and Homology
pdf ↗ page arXiv:2611.00493 ↗

We study how Koszul duality relates two kinds of boundary constructions associated with a smooth category and a proper category. For a smooth category with a proper Koszul-dualizing subcategory, we construct a fully faithful functor from its categorical neighborhood of infinity to the singularity category associated to the proper category. We prove that this functor is an equivalence precisely when the smooth category is reflexive, meaning that it can be reconstructed from its finite-dimensional module theory. Under a Gorenstein condition, satisfied in the Calabi–Yau setting, the functor is induced by restriction of modules. We give algebraic criteria that ensure equivalence and obtain an identification of Hochschild cohomology.

comments
25 pages
fields
K-Theory and Homology, Category Theory, Representation Theory
pdf ↗ page arXiv:2611.02080 ↗

Revised papers525

We show that non-relativistic Quantum Mechanics can be faithfully represented in terms of a classical diffusion process endowed with a gauge symmetry of group Z_4. The representation is based on a quantization condition for the realized action along paths. A lattice regularization is introduced to make rigorous sense of the construction and then removed. Quantum mechanics is recovered in the continuum limit and the full U(1) gauge group symmetry of electro-magnetism appears. Anti-particle representations emerge naturally, albeit the context is non-relativistic. Quantum density matrices are obtained by averaging classical probability distributions over phase-action variables. We find that quantum conditioning can be described in classical terms but not through the standard notion of sub sigma-algebras. Delicate restrictions arise by the constraint that we are only interested in the algebra of gauge invariant random variables. We conclude that Quantum Mechanics is equivalent to a theory of gauge invariant classical stochastic processes we call Stochastic Mechanics.

comments
I changed my mind on the correctness of this piece
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:0711.2978 ↗

We present two new forms in which the Frechet differential of a power series in a Banach algebra can be expressed in terms of absolutely convergent series involving the commutant $C(T):A\mapsto [A,T]$.Then we apply the results to the analytic functional calculus in a complex Banach space.

comments
Added in front-page address, email, URLs
journal
Opuscula Math. 30/2 (2010), 155-177
fields
Functional Analysis, Operator Algebras
pdf ↗ page arXiv:0804.2836 ↗

We investigate a limiting procedure for extending local integral operator equalities to the global ones and to applying it to obtaining generalizations of the Newton-Leibnitz formula for operator-valued maps for a wide class of unbounded operators.

comments
Added in front-page address, email, urls
journal
Dissertationes Mathematicae, 464 (2009)
fields
Functional Analysis, Operator Algebras
pdf ↗ page arXiv:0804.3069 ↗

In this work we construct certain general bundles $<\mathfrak{M},ρ,X>$ and $<\mathfrak{B},η,X>$ of Hausdorff locally convex spaces associated with a given Banach bundle $<\mathfrak{E},π,X>$. Then we present conditions ensuring the existence of bounded sections $\mathcal{U}\in Γ^{x_{\infty}}(ρ)$ and $\mathcal{P}\in Γ^{x_{\infty}}(η)$ both continuous at a point $x_{\infty}\in X$, such that $\mathcal{U}(x)$ is a $C_{0}-$semigroup of contractions on $\mathfrak{E}_{x}$ and $\mathcal{P}(x)$ is a spectral projector of the infinitesimal generator of the semigroup $\mathcal{U}(x)$, for every $x\in X$.

comments
Added in front-page address, email, URLs
journal
Eurasian Math. J. 7,3 (2016) 53-88; Eurasian Math. J. 7,4 (2016) 46-78; Eurasian Math. J. 8,3 (2017) 85-108
fields
Functional Analysis, Spectral Theory
pdf ↗ page arXiv:0906.2953 ↗

(Due to the limit on the number of characters for an abstract set by arXiv, the full abstract can not be displayed here. See the abstract in the paper.) We study dispersive equations with a time non-homogeneous modulation acting on the linear dispersion term. As primary models, we consider the Korteweg-de Vries equation (KdV) and related equations such as the Benjamin-Ono equation (BO) and the intermediate long wave equation (ILW), imposing certain irregularity conditions on the time non-homogeneous modulation. In this work, we establish phenomena called regularization by noise in three-folds: (i) When the modulation is sufficiently irregular, we show that the modulated KdV on both the circle and the real line is locally well-posed in the regime where the (unmodulated) KdV equation is known to be ill-posed. In particular, given any $s \in \mathbb R$, we show that the modulated KdV on the circle with a sufficiently irregular modulation is locally well-posed in $H^s(\mathbb T)$. Moreover, by adapting the $I$-method to the current modulated setting, we prove global well-posedness of the modulated KdV in negative Sobolev spaces. (ii) It is known that certain (semilinear) dispersive equations such as BO and ILW exhibit quasilinear nature. We show that sufficiently irregular modulations make the modulated versions of these equations semilinear by establishing their local well-posedness by a contraction argument, providing local Lipschitz continuity of the solution map. (iii) We also prove nonlinear smoothing for these modulated equations, where we show that a gain of regularity of the nonlinear part becomes (arbitrarily) larger for more irregular modulations. As applications of our approach, we also include further examples.

comments
94 pages. Minor updates. To appear in Mem. Eur. Math. Soc
fields
Analysis of PDEs, Probability
pdf ↗ page arXiv:1406.7675 ↗

We characterize q-Bernstein functions by exponential tests and, on a geometric lattice, by a well-defined spectral q-Laplace convolution semigroup. We also establish results on q-completely monotonic, q-log-completely monotonic, and q-Bernstein functions and give applications to q-gamma functions.

comments
9
journal
Advanced Studies in Contemporary Mathematics 25:1 (2015) 75--83
fields
Classical Analysis and ODEs, Probability
pdf ↗ page arXiv:1602.02956 ↗

We show non-linear stability and instability results in spherical symmetry for the interior of a charged black hole -approaching a sub-extremal Reissner-Nordström background fast enough at infinity- in presence of a massive and charged scalar field, motivated by the strong cosmic censorship conjecture in that setting : 1. Stability : We prove that spherically symmetric characteristic initial data to the Einstein-Maxwell- Klein-Gordon equations approaching a Reissner-Nordström background with a sufficiently decaying polynomial decay rate on the event horizon gives rise to a space-time possessing a Cauchy horizon in a neighbourhood of time-like infinity. Moreover if the decay is even stronger, we prove that the spacetime metric admits a continuous extension to the Cauchy horizon. This generalizes the celebrated stability result of Dafermos for Einstein-Maxwell-real-scalar-field in spherical symmetry. 2. Instability : We prove that for the class of space-times considered in the stability part, whose scalar field in addition obeys a polynomial averaged-L^2 (consistent) lower bound on the event horizon, the scalar field obeys an integrated lower bound transversally to the Cauchy horizon. As a consequence we prove that the non-degenerate energy is infinite on any null surface crossing the Cauchy horizon and the curvature of a geodesic vector field blows up at the Cauchy horizon near time-like infinity. This generalizes an instability result due to Luk and Oh for Einstein-Maxwell-real-scalar-field in spherical symmetry. This instability of the black hole interior can also be viewed as a step towards the resolution of the C^2 strong cosmic censorship conjecture for one-ended asymptotically initial data.

comments
Correction of the instability argument, which requires an additional assumption on the event horizon. This additional assumption, like the previous ones, is conjectured to hold for generic exterior perturbations
fields
Mathematical Physics, Analysis of PDEs
pdf ↗ page arXiv:1704.05790 ↗

A natural transformation $\mathfrak{J}$ between functors valued in the category $\mathfrak{Chdv}_{0}$ is assembled. $\mathfrak{Chdv}_{0}$ is obtained by replacing both the categories $\mathrm{ptls}$ and $\mathrm{ptsa}$ with the category of topological linear spaces in the defining properties of the category $\mathfrak{Chdv}$ introduced in one of our previous papers. By letting a $\mathfrak{dp}$-valued functor be (classical) quantum whenever every its value is a dynamical pattern whose set map takes values in the set of (commutative) noncommutative topological unital $\ast-$algebras, and letting a (classical) quantum $0$-species be a $\mathfrak{Chdv}_{0}$-valued functor factorizing through the canonical functor from $\mathfrak{dp}$ to $\mathfrak{Chdv}_{0}$ into a (classical) quantum $\mathfrak{dp}$-valued functor, we have that the domain and codomain of $\mathfrak{J}$ are a classical and a quantum $0$-species respectively.

comments
Added in front-page address, email, URLs
fields
Functional Analysis
pdf ↗ page arXiv:1812.06548 ↗

Holm introduced $m$-free $\ell$-arrangements which is a generalization of free arrangements, while he asked whether all $\ell$-arrangements are $m$-free for $m$ large enough. Recently Abe and the author verified that this question is in the negative when $\ell\geq 4$. In this paper we verify that $3$-arrangements $\mathscr{A}$ are $m$-free and compute the $m$-exponents for all $m\geq |\mathscr{A}|+2$, where $|\mathscr{A}|$ is the cardinality of $\mathscr{A}$. Hence Holm's question is in the positive when $\ell=3$. Finally we prove that $3$-dimensional Weyl arrangements of types A and B are $m$-free for all $m\geq 0$.

comments
27 pages, 3 figures
journal
Algebr. Represent. Theory 27, 877-896 (2024)
fields
Combinatorics
pdf ↗ page arXiv:1903.03249 ↗

We define integral cycle complexes and Chow homology of derived Artin stacks. To any quasi-smooth family of derived Artin stacks we associate a bivariant fundamental class, encoding the virtual fundamental classes of its fibres and their deformation invariance up to coherent homotopy. We extend the Riemann-Roch theorem of Baum-Fulton-MacPherson from quasi-projective schemes to derived Artin stacks, and thereby obtain a virtual Riemann-Roch formula for quasi-smooth derived Artin stacks. As another application of the formalism, we construct intersection products on regular Artin stacks locally of finite type over a field. Finally, we prove an integral comparison of our Chow homology with the cycle-theoretic Chow groups of Kresch.

comments
56 pages, submitted version; v2: new title/abstract, add integral Chow groups, add new appendix on comparison with Kresch
fields
Algebraic Geometry
pdf ↗ page arXiv:1909.01332 ↗

We study rank-two differential systems $\hbar x \partial_x ψ+ A (x, \hbar) ψ= 0$ near a logarithmic pole, with coefficients that are holomorphic in $x$ and admit uniform factorial asymptotic expansions in the complex parameter $\hbar$. If the classical residue has distinct eigenvalues, then upon choosing an ordering and an admissible $\hbar$ direction, we transform this system to an upper-triangular form by a holomorphic gauge transformation with the same factorial asymptotic regularity on a sector in the $\hbar$-plane. Its diagonal is fully determined by the $\hbar \to 0$ and $x \to 0$ limits. This construction produces a canonical $(x,\hbar)$-dependent invariant flag. This flag specialises to the usual Levelt filtration for nonzero values of $\hbar$ on a narrower sector, and its associated graded converges to the eigenspaces of the residue as $x \to 0$ and of the leading-order matrix as $\hbar \to 0$. A Schrödinger example gives a uniform matching formula between the WKB data and the exact Frobenius exponent at a double pole.

comments
16 pages. Revised version with a new title
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:1909.04011 ↗

We demonstrate that three maximal subgroups of infinite index in the rectangular subgroup \( K_{(2,2)} \) of the Thompson group \( F \), each containing Jones's \( 3 \)-colorable subgroup \( \mathcal{F} \), can be characterized as stabilizer subgroups. Additionally, we show that the \( \vec{F} \)-index, an elementary knot invariant introduced thanks to Jones's construction of knots from Thompson groups, may increase at most by $4$ after changing the orientation of a knot.

comments
corrected the graph substitution for Theorem 2
journal
Revista de la Unión Matemática Argentina 69 (2) (2026), pp. 443-458
fields
Geometric Topology, Group Theory
pdf ↗ page arXiv:1910.05045 ↗

It has long been suggested that the Cauchy horizon of dynamical black holes is subject to a weak null singularity, under the mass inflation scenario. We study in spherical symmetry the Einstein-Maxwell-Klein-Gordon equations and \textit{while we do not directly show mass inflation}, we obtain a "mass inflation/ridigity" dichotomy. More precisely, we prove assuming (sufficiently slow) decay of the charged scalar field on the event horizon, that the Cauchy horizon emanating from time-like infinity is $\mathcal{CH}_{i^+}= \mathcal{D} \cup \mathcal{S}$ for two (possibly empty) disjoint connected sets $\mathcal{D}$ and $\mathcal{S}$ such that: _$\mathcal{D}$ (the dynamical set) is a past set on which the Hawking mass blows up (mass inflation scenario). _$\mathcal{S}$ (the static set) is a future set isometric to a Reissner–Nordström Cauchy horizon i.e.\ the radiation is zero on $\mathcal{S}$. As a consequence, we establish a novel classification of Cauchy horizons into three types: dynamical ($\mathcal{S}=\emptyset$), static ($\mathcal{D}=\emptyset$) or mixed, and prove that $\mathcal{CH}_{i^+}$ is globally $C^2$-inextendible. Our main motivation is the $C^2$ Strong Cosmic Censorship Conjecture for a realistic model of spherical collapse in which charged matter emulates the repulsive role of angular momentum: in our case the Einstein-Maxwell-Klein-Gordon system on one-ended space-times. As a result, we prove in spherical symmetry that: - two-ended asymptotically flat space-times are $C^2$-future-inextendible i.e. $C^2$ Strong Cosmic Censorship is true for Einstein-Maxwell-Klein-Gordon, assuming the decay of the scalar field on the event horizon at the expected rate. - In the one-ended case, the Cauchy horizon emanating from time-like infinity is $C^2$-inextendible. This result suppresses the main obstruction to $C^2$ Strong Cosmic Censorship in spherical collapse.

comments
Strengthened the event-horizon assumptions to account for the correction to the instability argument in arXiv:1704.05790
fields
Mathematical Physics, Analysis of PDEs
pdf ↗ page arXiv:2001.11156 ↗

Let $G_1, \dots, G_k$ and $H$ be vector spaces over a finite field $\mathbb{F}_p$ of prime order. Let $A \subset G_1 \times\dots\times G_k$ be a set of size $δ|G_1| \cdots |G_k|$. Let a map $φ\colon A \to H$ be a multi-homomorphism, meaning that for each direction $d \in [k]$, and each element $(x_1, \dots, x_{d-1}, x_{d+1}, \dots, x_k)$ of $G_1\times\dots\times G_{d-1}\times G_{d+1}\times \dots\times G_k$, the map that sends each $y_d$ such that $(x_1, \dots,$ $x_{d-1},$ $y_d,$ $x_{d+1}, \dots,$ $x_k) \in A$ to $φ(x_1, \dots,$ $x_{d-1},$ $y_d,$ $x_{d+1}, \dots,$ $x_k)$ is a Freiman homomorphism (of order 2). In this paper, we prove that for each such map, there is a multiaffine map $Φ\colon G_1 \times\dots\times G_k \to H$ such that $φ= Φ$ on a set of density $\Big(\exp^{(O_k(1))}(O_{k,p}(δ^{-1}))\Big)^{-1}$, where $\exp^{(t)}$ denotes the $t$-fold exponential. Applications of this theorem include: $\bullet$ a quantitative inverse theorem for approximate polynomials mapping $G$ to $H$, for finite-dimensional $\mathbb{F}_p$-vector spaces $G$ and $H$, in the high-characteristic case, $\bullet$ a quantitative inverse theorem for uniformity norms over finite fields in the high-characteristic case, and $\bullet$ a quantitative structure theorem for dense subsets of $G_1 \times\dots\times G_k$ that are subspaces in the principal directions (without additional characteristic assumptions).

comments
199 pages, significantly improved exposition and expanded the motivation of the arguments
fields
Combinatorics
pdf ↗ page arXiv:2002.11667 ↗

Balancing square and rectangular tables by rotation has been an interesting way to illustrate the intermediate value theorem. This article studies the same question for tables whose feet form a cyclic quadrilateral, following a conjecture of A.~Martin. In the idealised model behind this conjecture, the balancing act works for every such table and is a nice application of the ergodic theorem. For the actual rigid table on a Lipschitz terrain, the situation is more subtle. If the terrain is flattened enough, the table can be stabilised unless an idealised wobbling function vanishes identically, \ie unless the terrain is degenerate for the table. Even if this should happen, the tables whose feet are vertices of a regular polygon and which satisfy a non-degeneracy condition of their own can still be stabilised on every terrain with a small enough Lipschitz constant (\eg a halved regular hexagon as long as the slope is less than $3.7$\textdegree{}). On the other hand, there is an isosceles trapezoid and another table, which are shown to wobble at every angle on suitable terrains however small the Lipschitz constant is. These counterexamples are fragile: for every table, if the idealised wobbling function vanishes identically for every position of the rotation axis in a small disc, then, near the feet, the terrain is a plane or a paraboloid of revolution with a vertical axis; so in practice a slight move of the axis makes the terrain non-degenerate. The results are, with minor exceptions, formalised in Lean.

comments
37 pages
fields
History and Overview
pdf ↗ page arXiv:2004.09260 ↗

In the previous paper (J. Combin. Theory Ser. A, 120, 2013, 1263–1284) H. Tagawa and the two authors proposed an algebraic method to compute certain Pfaffians whose form resemble to Hankel determinants associated with moment sequences of the classical orthogonal polynomials. At the end of the paper they offered several conjectures. In this work we employ a completely different method to evaluate this type of Pfaffians. The idea is to apply certain de Bruijn type formula and convert the evaluation of the Pfaffians to the certain Selberg type integrals. This approach works not only for Pfaffians but also for hyperpfaffians. Hence it enables us to establish much more generalized identities than those conjectured in the previous paper. We also investigate some Pfaffians related to classical $q$-orthogonal polynomials.

fields
Combinatorics, Mathematical Physics, Classical Analysis and ODEs
pdf ↗ page arXiv:2008.09776 ↗

In this paper we develop a bridge between model theory, geometric topology, and geometric group theory. In particular, we investigate the Ivanov Metaconjecture from the point of view of model theory, and more broadly we seek to answer the general question: why does the curve graph of a surface play such a central role in the study of surfaces and mapping class groups? More specifically, we consider a surface $Σ$ of finite type and its curve graph $\mathcal C(Σ)$, and we investigate its first-order theory in the language of graph theory. Crucially, $\mathcal C(Σ)$ is bi-interpretable with a certain object called the augmented Cayley graph of the mapping class group of the surface. We use this bi-interpretation to prove that the theory of the curve graph is $ω$--stable, to compute its Morley rank, and to show that it has quantifier elimination with respect to the class of $\forall\exists$--formulae. We also show that many of the complexes which are naturally associated to a surface are interpretable in $\mathcal C(Σ)$. This shows that these complexes are all $ω$--stable and admit certain a priori bounds on their Morley ranks. We are able to use Morley ranks to prove that various complexes are not bi–interpretable with the curve graph. As a consequence of quantifier elimination, we show that algebraic intersection number is not definable in the first order theory of the curve graph. Finally, we prove that the curve graph of a surface enjoys a novel phenomenon that we call interpretation rigidity. That is, if surfaces $Σ_1$ and $Σ_2$ admits curve graphs that are mutually interpretable, then $Σ_1$ and $Σ_2$ are homeomorphic to each other. Along the way, numerous technical results are obtained.

comments
153 pages. Revised and expanded version: incorporated referee comments, 4 figures and 7 tables
fields
Geometric Topology, Group Theory, Logic
pdf ↗ page arXiv:2008.10490 ↗

In this work we establish a Stokes-type integral equality for scalarly essentially integrable forms on an orientable smooth manifold with values in the locally convex linear space $\langle B(G),σ(B(G),\mathcal{N})\rangle$, where $G$ is a complex Banach space and $\mathcal{N}$ is a suitable linear subspace of the norm dual of $B(G)$. This result widely extends the Newton-Leibnitz-type equality stated in one of our previous articles. To obtain our equality we generalize the main result of that article, and employ the Stokes theorem for smooth locally convex vector valued forms established in a prodromic paper. Two facts are remarkable. Firstly the forms integrated involved in the equality are functions of a possibly unbounded scalar type spectral operator in $G$. Secondly these forms need not be smooth nor even continuously differentiable.

comments
Added in front-page address, email, URLs
journal
Eurasian Math. J. 12,3 (2021) 78-89
fields
Functional Analysis
pdf ↗ page arXiv:2010.02692 ↗

We prove the decidability for a class of languages which extend BST and failure of NP-completeness for a subclass of them. The languages BST extended with unordered cartesian product, BST extended with ordered cartesian product and BST extended with powerset fall in this last subclass.

comments
arXiv admin note: substantial text overlap with arXiv:2106.01224
fields
Logic
pdf ↗ page arXiv:2108.13913 ↗

Given a linear cocycle over an ergodic homeomorphism on a compact metric space, we show that the existence of a uniform gap between the $p$-th and $(p+1)$-th Lyapunov exponent on a $C^0$-neighbourhood implies the existence of a dominated splitting of index $p$.

comments
36 pages, 1 figure. Major revision of some proofs and introduction, adding more clarity and context for the work
fields
Dynamical Systems
pdf ↗ page arXiv:2110.11301 ↗

We characterise when the elementary quotient completion of an elementary doctrine, introduced in previous work by the first and third authors, is a quasitopos. Since the elementary quotient completion generalises the notion of exact completion of a cartesian category with weak equalisers to the setting of elementary doctrines, as proposed by F.W. Lawvere, the characterisation established in this paper, generalises previous results on exact completions, which include A. Carboni and E. Vitale's characterisation in terms of projective objects, Carboni and G. Rosolini's characterisation of locally cartesian closed exact completions, as revised by J. Emmenegger, and M. Menni's characterisation of exact completions that are toposes.

fields
Logic, Category Theory
pdf ↗ page arXiv:2111.15299 ↗

A rotation-symmetric S-box on $n$ bits is a vectorial Boolean function that commutes with the right cyclic shift and is therefore determined by a single Boolean function. The map $χ$ used in Keccak is a well-known example. Ordinary affine equivalence allows arbitrary invertible affine transformations, which need not preserve rotation symmetry. We introduce \emph{cyclic affine equivalence}, in which the implementing transformations each have an invertible $k$-circulant linear part with $\gcd(k,n)=1$ and a translation vector fixed by the shift. For $n\ge3$, the two relations give the same classes of rotation-symmetric permutations exactly when $n$ is an odd prime for which $2$ is a primitive root. In every other dimension $n\ge3$, explicit constructions exhibit affine classes containing several cyclic affine classes. We derive exact class-size formulas, count cyclic affine classes for $3\le n\le9$, and classify a four-bit family of $χ$-siblings under both relations. Finally, we characterize when a permutation is affinely equivalent to a rotation-symmetric one and apply the criterion to the Ascon S-box.

comments
30 pages; new title and substantial revision, including a dimension classification for affine versus cyclic affine equivalence, new counting results, and corrected lifting theory and tables
fields
Combinatorics, Information Theory
pdf ↗ page arXiv:2203.00778 ↗

Let $K$ be a non-archimedean local field with residue field of characteristic $p$. We give necessary and sufficient conditions for a two-generator subgroup $G$ of ${\rm PSL_2}(K)$ to be discrete, where either $K=\mathbb{Q}_p$ or $G$ contains no elements of order $p$. We give a practical algorithm to decide whether such a subgroup $G$ is discrete. We also give practical algorithms to decide whether a two-generator subgroup of either ${\rm SL_2}(\mathbb{R})$ or ${\rm SL_2}(K)$ (where $K$ is a finite extension of $\mathbb{Q}_p$) is dense. A crucial ingredient for this work is a structure theorem for two-generator groups acting by isometries on a $Λ$-tree.

comments
Accepted by Israel Journal of Mathematics in June 2025, not sure when it will appear their publication backlog is huge
fields
Group Theory, Geometric Topology
pdf ↗ page arXiv:2208.12404 ↗

Conjecturally complete lists of connected components of the complements of the discriminant varieties (aka wave fronts) of smooth function singularities of types $X_{10}^3$ and $X_{10}^1$ are provided. The combinatorial invariants of these components are defined and calculated. It is shown that the one-dimensional homology group of the complement of the discriminant of any versal deformation of any singularity of class $X_{10}^1$ contains a subgroup isomorphic to $\Z^3$.

fields
Algebraic Geometry
pdf ↗ page arXiv:2301.06994 ↗

By following the same construction pattern which Martin Davis proposed in a 1968 paper of his, we have obtained six quaternary quartic Diophantine equations that candidate as `rule-them-all' equations: proving that one of them has only a finite number of integer solutions would suffice to ensure that each recursively enumerable set admits a finite-fold polynomial Diophantine representation.

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

In economy, markets are denoted as efficient when it is impossible to systematically generate profits which outperform the average. In the past years, the concept has been tested in other domains such as the growing sports betting market. Surprisingly, despite its large size and its level of maturity, sports betting shows traits of inefficiency. The anomalies indicate the existence of strategies which shift betting from a game of chance towards a game of skill. This article shows an example for an inefficiency detected in the German soccer betting TOTO 13er Wette, which is operated by state-run lottery agencies. Gamblers have to guess the outcome (win, draw, loss) of 13 soccer matches listed on a lottery tip. Applying stochastic methods, a recipe is presented to determine hit rates for single match outcomes. More important, the recipe provides the number of lottery tips required to achieve a specific number of strikes (number of correct match forecasts per lottery tip) for any given level of safety. An approximation is derived to cope with large numbers in hypergeometric distributions, valid under certain constraints. Overall, the strategy does lead to returns exceeding the aggregated lottery fees, resulting in moderate, but consistent profits. It is briefly discussed if lessons learned from soccer betting can be transferred back to financial markets, because gamblers and retail investors face similar challenges and opportunities.

comments
25 pages, 3 figures, 8 tables
fields
Probability
pdf ↗ page arXiv:2303.16648 ↗

We examine the inverse procedure of the Radford-Majid bosonization for Hopf superalgebras and give a handy method for enumerating Hopf superalgebras whose bosonization is isomorphic to a given Hopf algebra. As an application, we classify Hopf superalgebras of dimension up to 5 and give examples of higher dimensions.

comments
30 pages. v3: Corrected formulas and proofs and updated references. The classification results are unchanged
journal
Contemp. Math. 814 (2025), 193-221
fields
Quantum Algebra
pdf ↗ page arXiv:2306.04122 ↗

I describe parts of my joint work with S. Deser [March 19, 1931 - April 21, 2023] which started when I was working as a post-doc at Brandeis University in 2001. Our work was mostly, but not exclusively, on conserved charges of higher curvature theories of gravity. I also describe some recent developments, such as expressing the conserved charges in terms of the linearized Riemann tensor; I expound upon the computations. I also reminisce about our interaction for over two decades that went beyond our scientific collaboration. The physics part of this review is intended for graduate students and researchers interested in extended theories of gravity, especially about the conserved quantities and perturbative techniques in these theories.

comments
1 figure, 39 pages. The section containing the author's reminiscence of S. Deser was published in "The Supersymmetric World: The Beginnings of the Theory", 2nd ed., edited by G. Kane and M. Shifman (World Scientific, Singapore, 2025)
fields
Mathematical Physics
pdf ↗ page arXiv:2307.12758 ↗

We prove that if the $m$-th homotopy group for $m \geq 2$ of a closed manifold has non-trivial invariants or coinvariants under the action of the fundamental group, then there exist infinitely many geometrically distinct closed geodesics for a $C^4$-generic Riemannian metric. If moreover there are infinitely many conjugacy classes in the fundamental group, then the same holds for every bumpy Riemannian metric. Finally, under a homological condition that can detect the non-triviality of the higher homotopy groups, the same conclusion holds for every Riemannian metric. All three conclusions extend to smooth, possibly non-reversible Finsler metrics. In the generic statement, the conclusion holds for $C^6$-topology; under the homological hypothesis, the conclusion holds for every smooth Finsler metric.

comments
v2 has 17 pages. Corrected Theorem A by adding a bumpiness assumption to ensure homological visibility; the generic existence result remains unchanged. Added Theorem B and Corollary 9, establishing sufficient homological conditions for infinitely many geometrically distinct closed geodesics for arbitrary Riemannian metrics. Clarified the extensions to Finsler metrics
fields
Differential Geometry
pdf ↗ page arXiv:2307.13877 ↗

In this work, we study the control constrained distributed optimal control of a stationary doubly diffusive flow model. For the control problem, we use a well-posedness analysis based on minimal assumptions on data and domain. We show the existence of an optimal control with quadratic type cost functional, study the Fréchet differentiability properties of the control-to-state map and establish the first-order necessary optimality conditions corresponding to the optimal control problem. Expanding on this we prove the local optimality of a reference control using second-order sufficient optimality condition for the control problem. Then, following the \textit{optimize-then-discretize} approach, we propose a fully non-conforming, locally exactly divergence-free discretization of the control problem based on the lowest order $(\texttt{CR}_0, \mathbb{P}_0)$ finite element spaces for the state and adjoint variables, and explicit and implicit discretizations for the control variable. Optimal \textit{a priori} error estimates are established for the state, adjoint and control variables in suitable norms up to the regularity of the solution. Finally, the optimal control is computed using a primal-dual active set strategy as a semi-smooth Newton method and numerical experiments are performed to validate the theoretical findings, and it's applicability to optimal control of thermal and solutal convection in a porous medium.

fields
Optimization and Control
pdf ↗ page arXiv:2308.02178 ↗

The convergence rate in Wasserstein distance is estimated for empirical measures of ergodic Markov processes, and the estimate can be sharp in some specific situations. The main result is applied to subordinations of typical models excluded by existing results, which include: stochastic Hamiltonian systems on $\mathbb R^{n}\times \mathbb R^{m}$, spherical velocity Langevin processes on $\mathbb R^n\times\mathbb S^{n-1},$ multi-dimensional Wright-Fisher type diffusion processes, and stable type jump processes.

journal
Applied Mathematics & Optimization (2025) 92:4
fields
Probability
pdf ↗ page arXiv:2309.04674 ↗

Many known examples of simply-connected gradient Kähler-Ricci solitons in real dimension four are toric, and the symmetry is intrinsically related to the potential function $f$ and the scalar curvature $\SS$. In this article, we consider the case that $f$ and $\SS$ are functionally dependent and deduce a complete classification, while the independence case is addressed elsewhere. The main theorem recovers all known examples of cohomogeneity one symmetry. We also discover a connection to the theory of isoparametric functions and contact geometry. Indeed, a key ingredient is a new characterization for a deformed Sasakian structure generalizing a classical result.

comments
Corrected Theorem D and Corollary B to include an additional case omitted in the previous version: a cusp-like expanding soliton
fields
Differential Geometry
pdf ↗ page arXiv:2310.11328 ↗

We study equisingularity of families of reduced curves over smooth parameter spaces of arbitrary positive dimension, using the difference between two analytic invariants of a curve singularity: the multiplicity of its Jacobian ideal and its complete intersection discrepancy. This difference provides a fiberwise multiplicity criterion for Whitney equisingularity. We prove that Whitney equisingularity (equivalently, strong simultaneous resolution) is characterized by equidimensionality of the fibers of the exceptional locus of either the relative conormal space or the relative Nash blowup. We further show that this condition is equivalent to the emptiness of the relative polar variety of smallest dimension. In addition, we establish that the Milnor number of a reduced curve is Zariski upper semicontinuous. As an application, we show that the constancy of the Milnor number in a family of reduced curves is equivalent to its topological equisingularity, under a natural assumption on the fibers.

comments
39 pages, the results in Sct. 6 are in stronger form now, a gap in the alternative proof of Thm. 7.2 is fixed, a finiteness assumption in Sct. 5 is introduced, the proof of Thm. 8.1 is expanded, the overall exposition of the paper is improved
fields
Algebraic Geometry, Commutative Algebra, Complex Variables
pdf ↗ page arXiv:2310.16558 ↗

A central property of (Chern) topological insulators is the presence of robust asymmetric transport along interfaces separating two-dimensional insulating materials in different topological phases. A Topological Anderson Insulator is an insulator whose topological phase is induced by spatial fluctuations. This paper proposes a mathematical model of perturbed Dirac equations and shows that for sufficiently large and highly oscillatory perturbations, the systems is in a different topological phase than the unperturbed model. In particular, a robust asymmetric transport indeed appears at an interface separating perturbed and unperturbed phases. The theoretical results are based on careful estimates of resolvent operators in the homogenization theory of Dirac equations and on the characterization of topological phases by the index of an appropriate Fredholm operator.

comments
We incorporate every correction in the corrigendum (submitted to the publisher) and fixes a few remaining typographical errors of v2
fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2311.15678 ↗

We study the relation between deterministic and randomized $\textit{enumerating}$ Kolmogorov complexity of sets $S\subseteq \mathbb{N}$. Let $D(S)$ be the length of a shortest input on which a fixed optimal deterministic machine enumerates $S$, and let $ R(S) $ be the probability that a fixed optimal randomized machine enumerates $S$. It is easy to see that $-\log R(S) \le D(S)+O(\log D(S))$ for every $S$; the converse direction is much harder. Solovay proved $D(S)\le -3\log R(S) +O(\log\log\frac{1}{ R(S) })$ for all $S$, while for finite sets the sharper bound with the constant $2$ is known. We show that the case of infinite sets carries no extra cost: $\textit{any}$ inequality of the form $D(F)\le -α\log R(F)+O(\log\log\frac{1}{R(F)})$ with a computable $α$, valid for all finite $F$, automatically extends to all sets. More generally, we prove a single dichotomy from which such transfer results follow for an arbitrary computable non-decreasing bound, and which also shows that every c.e. set $S$ has a finite subset $F$ such that $F$ has at least as large deterministic complexity as $S$ but randomized one approximately the same or lower. Our result makes qualitative progress on a problem studied by Solovay in 1977 by showing that the search for the optimal constant can be reduced to a purely combinatorial question about a game played with finite sets. In particular, our result yields $D(S)\le-2\log R(S) +O(\log\log\frac{1}{ R(S) })$ for every $S$, improving Solovay's constant $3$ to $2$.

fields
Information Theory
pdf ↗ page arXiv:2312.04187 ↗

Persistence modules indexed by finite posets arise in topological data analysis. Unlike in the one-parameter case, they need not decompose into interval modules. Interval replacements approximate them by formal differences of interval decomposable modules. Extending earlier work on 2D-grids, we study these replacements for arbitrary compression systems. Different choices can give different interval rank invariants and replacements, including those related to interval resolutions on commutative ladders. Our main results are an explicit formula for interval ranks and an essential-cover theorem. Using Auslander–Reiten theory, we express interval ranks in terms of ranks of matrices formed from the structure maps of the module. The essential-cover theorem recovers each interval rank from a suitable restriction of the module. The replacement construction preserves the corresponding interval rank invariant, which recovers the usual rank invariant on segments. Essential covers also give a sufficient condition for two compression systems to yield the same invariant. For total compression, the invariant coincides with the generalized rank invariant of Kim and Mémoli. On 2D-grids, essential covers recover the zigzag formula of Dey, Kim, and Mémoli for this invariant.

comments
76 pages. Accepted for publication in Discrete & Computational Geometry
fields
Representation Theory, Algebraic Topology, Rings and Algebras
pdf ↗ page arXiv:2403.08308 ↗

Conventional matrix completion methods exploit the underlying low-rank structure of a target matrix to recover its missing entries, but may be inadequate for capturing complex nonlinear dependencies. Deep neural networks have therefore been increasingly adopted for nonlinear matrix completion (NLMC). However, their high representational capacity, particularly in deep fully connected neural networks (FCNNs), can lead to over-fitting when training is restricted to incomplete observations. In this paper, we propose a Deep Neural Network with Nonsmooth Regularization (DNN-NSR) framework to address this issue by incorporating two complementary structural priors: sparsity of intermediate representations and low-rankness of layer-wise weight matrices. Specifically, the $\ell_1$-norm of hidden representations promotes sparse latent features, while the nuclear norm of weight matrices encourages low-rank layer-wise transformations. To optimize the resulting nonsmooth and nonconvex objective, we develop an extrapolated proximal gradient algorithm that employs soft-thresholding and singular-value thresholding to handle the two regularization terms, respectively. We further introduce a gradual regularization strategy that progressively increases the influence of these structural penalties during training. Under suitable assumptions, we establish convergence properties of the proposed algorithm toward a critical point of the training objective. The effectiveness of DNN-NSR is evaluated through extensive experiments on synthetic matrix recovery, single-image inpainting, and recommender systems using the MovieLens 100K and MovieLens 1M datasets. Comparisons with representative linear and nonlinear matrix completion methods demonstrate the potential of the proposed framework to improve recovery performance by jointly exploiting sparse latent representations and low-rank network transformations.

fields
Information Theory
pdf ↗ page arXiv:2403.10232 ↗

The geometry induced from a dynamical system dictates its latent structures, conservation laws, and intrinsic coordinates. This paper provides two procedures to extract the governing equations of a dynamical system from its samples, \acf{KR} and \acf{IKEA}. These procedures leverage the prior knowledge from the Koopman Eigenfunction Space. Both techniques extract a functionally independent set of Koopman Eigenfunctions, which are the intrinsic coordinates. Consequently, despite its finite cardinality, the governing equations are immaculately restored. Thus, the principle of parsimony is implemented. Samples can be taken either from a vector field or from orbits of the system. \acs{KR} extracts the governing law from samples of the vector field, and \acs{IKEA} extracts it from samples of trajectories of the system. Both algorithms are based on constrained optimization methods for learning the governing equations from sparse and corrupted samples of the vector field or trajectories. These procedures yield promising results in denoising, generalization, and dimensionality reduction and achieve better results than \acs{DMD}, \acs{EDMD}, \acs{PINN}, and \acs{SINDy} in dynamical system restoration.

fields
Dynamical Systems, Differential Geometry
pdf ↗ page arXiv:2403.11302 ↗

We study the relation between large N instantons and conventional instantons, focusing on matrix models and topological strings. We show that the resurgent properties of the perturbative series at fixed but arbitrary N, including the replica limit N = 0, can be obtained from large N instantons. In the case of topological strings, it has been conjectured that the resurgent structure encoded by large N instantons is closely related to the spectrum of BPS states. We give direct evidence for this connection in the case of Seiberg-Witten theory and other topological string models, and we show in detail how the resurgent properties at fixed N follow from the large N theory, and therefore can be used to obtain information on BPS invariants.

comments
46 pages, 5 figures, clarifications and corrections added
fields
Mathematical Physics, Algebraic Geometry
pdf ↗ page arXiv:2403.14462 ↗

We study the subspace-constrained Tyler's estimator (STE) for recovering a low-dimensional linear subspace from data contaminated by outliers. Under deterministic conditions on inlier spread and outlier alignment, we prove linear convergence to the true subspace from a sufficiently accurate initialization. The guarantee also applies when the dimension-scaled signal-to-noise ratio is below one, where general robust subspace recovery is SSE-hard. When initializing STE from a candidate subspace, we provide a sufficient recovery condition based on the initial angular error and the size of the identity shift applied to the subspace projector. For noisy inliers, we prove a subspace error proportional to the noise level within an explicit iteration bound. Finally, under an asymptotic, anisotropic Gaussian inlier–outlier model, we show that Tyler's M-estimator (TME) provides a successful STE initialization even when TME's own leading eigenspace differs from the target subspace.

fields
Statistics Theory
pdf ↗ page arXiv:2403.18658 ↗

We investigate a class of free boundary problems with oscillatory singularities within heterogeneous media. Our main result yields sharp regularity estimates along the free boundary, provided the power of the singularity varies in a Dini-continuous fashion below a certain threshold. We also reveal an interesting repelling estimate preventing the free boundary from touching the region where the singularity power oscillates above the threshold.

comments
To appear in the J. London Math. Soc
fields
Analysis of PDEs
pdf ↗ page arXiv:2404.03060 ↗

We develop the theory of quasi-$F^e$-splittings, quasi-$F$-regularity, and quasi-$+$-regularity.

comments
90 pages. arXiv admin note: text overlap with arXiv:2208.08016 ver2:Several proofs and statements have been revised and the exposition improved. The main results remain unchanged
fields
Algebraic Geometry, Commutative Algebra
pdf ↗ page arXiv:2404.06788 ↗

Peter Doyle conjectured that locally univalent circle packings on the hexagonal lattice only consist of regular hexagonal packings and Doyle spirals, which is called the Doyle conjecture. In this paper, we prove a rigidity theorem for Doyle spirals in the class of infinite circle packings on the hexagonal lattice whose radii ratios of adjacent circles have a uniform lower bound in one fixed lattice direction. This gives a partial answer to the Doyle conjecture. Based on a new observation that the logarithm of the radii ratio of adjacent circles is a weighted discrete harmonic function, we prove the result via the Liouville theorem for discrete harmonic functions. Moreover, we establish a Ring Lemma for locally univalent circle packings with bounded degree, assuming that their carrier surfaces are the universal covers of $\mathbb{C}-\{0\}$, and the visual angles of all circles viewed from the origin are uniformly bounded away from $π$. This provides a new geometric sufficient condition for the rigidity of Doyle spirals.

comments
24 pages,9 figures. In the second version, we add a new rigidity theorem for locally univalent circle packings when the distributional property of their carrier surfaces are assumed
fields
Geometric Topology, Differential Geometry
pdf ↗ page arXiv:2404.11258 ↗

The concept of a fully interlacing matrix of formal power series with real coefficients is introduced. This concept extends and strengthens that of an interlacing sequence of real-rooted polynomials with nonnegative coefficients, in the special case of row and column matrices. The fully interlacing property is shown to be preserved under matrix products, flips across the reverse diagonal and Veronese sections of the power series involved. These results and their corollaries generalize, unify and simplify several results which have previously appeared in the literature. An application to the theory of uniform triangulations of simplicial complexes is included.

comments
Final version (19 pages), to appear in the Mathematical Proceedings of the Cambridge Philosophical Society
fields
Combinatorics, Classical Analysis and ODEs
pdf ↗ page arXiv:2404.12989 ↗

We consider the infinite-horizon average-reward restless bandit problem. We propose a novel two-set policy that maintains two dynamic subsets of arms: one subset of arms has a nearly optimal state distribution and takes actions according to an LP-Priority routine; the other subset of arms is driven towards the optimal state distribution and gradually merged into the first subset. We show that our two-set policy is asymptotically optimal with an $O(\exp(-C N))$ optimality gap for an $N$-armed problem, under the assumptions of aperiodic-unichain, non-degeneracy, and local stability. Our policy is the first to achieve exponential asymptotic optimality under the above set of easy-to-verify assumptions, whereas prior work either requires a global attractor assumption or only achieves an $O(1/\sqrt{N})$ optimality gap. We further discuss obstacles in weakening the assumptions by demonstrating examples where exponential asymptotic optimality is not achievable when any of the three assumptions is violated. Notably, we prove a lower bound for a large class of locally unstable restless bandits, showing that local stability is particularly fundamental for exponential asymptotic optimality. Finally, we use simulations to demonstrate that the two-set policy outperforms previous policies on certain restless bandit problems and performs competitively overall.

comments
63 pages, 4 figures. Reorganized the proof of Theorem 1 for clarity, with additional corrections and improvements to other arguments
fields
Optimization and Control, Probability
pdf ↗ page arXiv:2405.17882 ↗

We study the approximation errors \[ \varepsilon(x)=\operatorname{li}_{*}(x)-\operatorname{li}(x) \qquad\text{and}\qquad \varepsilon_{0}(x)=\operatorname{li}_{0}(x)-\operatorname{li}(x), \] arising from the classical Stieltjes–van Boven and pure Stieltjes asymptotic expansions of the logarithmic integral, respectively. Our analysis is based on the discrete values \(\varepsilon_k=\varepsilon(e^k)\) and their increments \(Δ_{k+1}=\varepsilon_{k}-\varepsilon_{k+1}\), for which we derive new unconditional analytic bounds. Using precise integral representations of the increments and sharp upper and lower estimates for the associated kernel integrals, we obtain explicit bounds for \(\varepsilon_k\), valid for every integer \(k\geq 1\). These bounds yield corresponding estimates for \(\varepsilon(x)\) for all real \(x\geq e\). In particular, we prove that for every real $x \ge e$, \[\varepsilon(x) =\frac{1}{3} \sqrt{\frac{2π}{\log x}} + O\left(\frac{1}{\log x}\right), \qquad\qquad x \to \infty.\] We then use these results to demonstrate that for all real number $x \ge e$ \[|\varepsilon_{0}(x)| = \frac{\sqrt{2π}\left|\frac13-α\right|}{\sqrt{\log x}} + O\left(\frac{1}{\log x}\right), \qquad\qquad x\to\infty\] where $n=\lfloor\log x\rfloor$ and $α=\log x-n$. This provides an explicit asymptotic description of the absolute approximation error associated with the pure Stieltjes expansion, including its dependence on the fractional part of \(\log x\).

comments
Substantially revised and expanded version of arXiv:2406.12152v2. The presentation and proofs have been reorganized, and the main results strengthened. We establish positivity and monotonicity of the Stieltjes-van Boven approximation error, prove the asymptotic behavior conjectured in the previous version, and analyze the pure Stieltjes approximation. 33 pages
fields
Number Theory
pdf ↗ page arXiv:2406.12152 ↗

In this paper, we classify connected graded quadratic Artin-Schelter regular (AS-regular, henceforth) algebras of global dimension four that have a Hilbert series the same as that of the polynomial ring on four generators and that map onto a twisted homogeneous coordinate ring of a rank-two quadric. A twisted homogeneous coordinate ring is a construction that was defined by Artin, Tate, and Van den Bergh in \cite{ATV1, ATV2, AVdB1990} in the context of the classification of AS-regular algebras of global dimension three. In \cite{SV99,VVr}, the authors classified AS-regular algebras of global dimension four that map onto the twisted homogeneous coordinate ring of a rank-three and a rank-four quadric, respectively. We expand on their work to include the case of coordinate rings of a rank-two quadric.

comments
This revision addresses concerns about whether the the map tau defined on the rank-two quadric lifts to P^3
fields
Rings and Algebras
pdf ↗ page arXiv:2406.12737 ↗

Spectral properties of bounded linear operators play a crucial role in several areas of mathematics and physics. For each self-adjoint, trace-class operator $O$ we define a set $Λ_n\subset \mathbb{R}$, and we show that it converges to the spectrum of $O$ in the Hausdorff metric under mild conditions. Our set $Λ_n$ only depends on the first $n$ moments of $O$. We show that it can be effectively calculated for physically relevant operators, and it approximates the spectrum well without diagonalization. We prove that using the above method we can converge to the minimal and maximal eigenvalues with super-exponential speed. We also construct monotone increasing lower bounds $q_n$ for the minimal eigenvalue (or decreasing upper bounds for the maximal eigenvalue). This sequence only depends on the moments of $O$ and a concrete upper estimate of its $1$-norm; we also demonstrate that $q_n$ can be effectively calculated for a large class of physically relevant operators. This rigorous lower bound $q_n$ tends to the minimal eigenvalue with super-exponential speed provided that $O$ is not positive semidefinite. As a by-product, we obtain computable upper bounds for the $1$-norm of $O$, too. Numerical examples demonstrate the relevance of our approximation in estimating entropy and negativity, which is useful, among others, in quantum optical and in open quantum system models. The results can be directly applicable to problems in quantum information, statistical mechanics, and quantum thermodynamics, where using traditional techniques based on diagonalization is impractical.

comments
34 pages, 3 figures, 3 tables. Added two appendices, and made minor revisions. Accepted for publication in PTEP
fields
Mathematical Physics, Spectral Theory
pdf ↗ page arXiv:2407.04478 ↗

Given an irreducible holomorphic symplectic (IHS) manifold $X$, we call an automorphism $f$ of $X$ algebraically trivial if $f$ acts trivially on the Néron–Severi group of $X$. In this paper, we extend the approach of Brandhorst–Cattaneo to classify, by means of lattice data, all the pairs $(X, G)$, where $X$ is an IHS manifold of a known deformation type (to this date), and $G$ is a finite group consisting of algebraically trivial automorphisms of $X$ that are nonsymplectic. In particular, we classify even-order algebraically trivial nonsymplectic automorphisms, with or without trivial discriminant action. In the case of nontrivial discriminant actions, we show that such automorphisms only exist for finitely many deformation types and orders

comments
57 pages, 5 tables. Final version incorporating referees' comments - published in EpiGA
journal
Épijournal de Géométrie Algébrique, volume 10 (2026), article no. 20
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2407.06007 ↗

This paper will introduce a family of sliced Wasserstein geodesics which are not standard Wasserstein geodesics, objects yet to be discovered in the literature. These objects exhibit how the geometric structure of the Sliced Wasserstein space differs from the Wasserstein space, and provides a simple example of how solving the barycenter and gradient flow problems change when moving between these metrics. Some of these geodesics will only be Hölder continuous with respect to the Wasserstein metric and thus will provide a direct proof that Sliced-Wasserstein and regular Wasserstein metrics are not equivalent. Previous proofs of this were done for various cases in [2] and [5]. This paper, not only provides a direct proof, but also fills in gaps showing these metrics not equivalent in dimensions greater than 2.

comments
12 pages, 2 figures, 4 page abstract, preprint. This is a more detailed version of the first version including an appendix on the infinity sliced Wasserstein distance and some reference to recent works
fields
Probability, Optimization and Control
pdf ↗ page arXiv:2407.07219 ↗

We construct functorial Igusa stacks for all Hodge-type Shimura varieties, proving a conjecture of Scholze and extending earlier results of the fourth-named author for PEL-type Shimura varieties. Using the Igusa stack, we construct a sheaf on $\mathrm{Bun}_G$ that controls the cohomology of the corresponding Shimura variety. We use this sheaf and the spectral action of Fargues-Scholze to prove a compatibility between the cohomology of Shimura varieties of Hodge type and the semisimple local Langlands correspondence of Fargues-Scholze, generalizing the Eichler-Shimura relation of Blasius-Rogawski to arbitrary level at $p$. When the given Shimura variety is proper, we show moreover that the sheaf is perverse, which allows us to prove new torsion vanishing results for the cohomology of Shimura varieties.

comments
Final version, to appear in Inventiones mathematicae
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2408.01348 ↗

The universal $2$-parameter vertex algebra $W_{\infty}$ of type $W(2,3,4,\dots)$ serves as a classifying object for vertex algebras of type $W(2,3,\dots,N)$ for some $N$ in the sense that under mild hypothesis, all such vertex algebras arise as quotients of $W_{\infty}$. There is an $\mathbb{N} \times \mathbb{N}$ family of such $1$-parameter vertex algebras which, after tensoring with a Heisenberg algebra, are known as $Y$-algebras. They were introduced by Gaiotto and Rapčák and are expected to be the building blocks for all $W$-algebras in type $A$, i.e., every $W$-(super) algebra in type $A$ is an extension of a tensor product of finitely many $Y$-algebras. Similarly, the orthosymplectic $Y$-algebras are $1$-parameter quotients of a universal $2$-parameter vertex algebra $W^{\text{ev}}_{\infty}$ of type $W(2,4,6,\dots)$, which is a classifying object for vertex algebras of type $W(2,4,\dots, 2N)$ for some $N$. Unlike type $A$, these algebras are not all the building blocks for $W$-algebras of types $B$, $C$, and $D$. In this paper, we construct a new universal $2$-parameter vertex algebra of type $W(1^3, 2, 3^3, 4, 5^3,6,\dots)$ which we denote by $W^{\mathfrak{sp}_2}_{\infty}$ since it contains a copy of the affine vertex algebra $V^k(\mathfrak{sp}_2)$. We identify $8$ infinite families of $1$-parameter quotients of $W^{\mathfrak{sp}_2}_{\infty}$ which are analogues of the $Y$-algebras. We regard $W^{\mathfrak{sp}_2}_{\infty}$ as a fundamental object on equal footing with $W_{\infty}$ and $W^{\text{ev}}_{\infty}$, and we give some heuristic reasons for why we expect the $1$-parameter quotients of these three objects to be the building blocks for all $W$-algebras of classical types. Finally, we prove that $W^{\mathfrak{sp}_2}_{\infty}$ has many quotients which are strongly rational. This yields new examples of strongly rational $W$-superalgebras.

comments
Minor corrections and improvements, references updated, final version to appear in Forum of Math Sigma
fields
Representation Theory, Quantum Algebra
pdf ↗ page arXiv:2409.03465 ↗

Automorphic twists of Shintani zeta functions encode spectral information about binary cubic forms and the shapes of cubic rings. We study their adelic integrals over an arbitrary number field, allowing ramified data, nonspherical vectors, and arbitrary unitary central character. For cuspidal twists the zeta function is meromorphic on the whole plane and holomorphic for $\Re s>1/4$.

comments
39 pages
fields
Number Theory
pdf ↗ page arXiv:2410.11166 ↗

Cellular automata find applications in cryptography, error correction, theoretical computer science, and the simulation of physical and biological processes. We say that a Boolean function is a proper lifting if its induced cellular automaton is reversible. This paper introduces new classes of proper liftings, constructed through compositions of landscape functions, and explores their cryptographic potential by computing indicators relevant to differential and linear cryptanalysis. We combine theoretical and computational methods to obtain a complete classification of proper liftings for diameters up to $6$. Several open problems and conjectures are posed along the way.

comments
15 pages; now proves completeness of the diameter-six classification; also adds nonlinearity results, and updates discussion and references
fields
Combinatorics, Information Theory, Dynamical Systems
pdf ↗ page arXiv:2411.00721 ↗

We give $L^p$ estimates for the second derivatives of weak solutions to the Dirichlet problem for equation $\operatorname{div}(\mathbf{A}\nabla u) = f$ in $Ω\subset \mathbb{R}^d$ with Sobolev coefficients. In particular, for $f\in L^2(Ω) \bigcap L^s(Ω)$ $$\|Δu\|_{2} \leq \begin{cases} c_1\|f\|_2 + c_2 \|\nabla \mathbf{A}\|_q^2\|f\|_s, & \text{if } 1 < s < d/2, \frac{1}{2}=\frac{2}{q}+ \frac{1}{s} - \frac{2}{d}\\ c_1\|f\|_2 + c_2 \|\nabla \mathbf{A}\|_4^2\|f\|_s, & \text{if } s > d/2 \end{cases}.$$

comments
Misprint in the abstract fixed
journal
Annali di Matematica 204, 2273-2279 (2025)
fields
Analysis of PDEs
pdf ↗ page arXiv:2411.09378 ↗

We prove that the Rubik's cube group can be realized as a Galois group over the rationals.

comments
14 pages. Postprint version
fields
Number Theory, Group Theory
pdf ↗ page arXiv:2411.11566 ↗

Numerical homogenization methods aim at providing appropriate coarse-scale approximations of solutions to (elliptic) partial differential equations that involve highly oscillatory coefficients. The localized orthogonal decomposition (LOD) method is an effective way of dealing with such coefficients, especially if they are non-periodic and non-smooth. It modifies classical finite element basis functions by suitable fine-scale corrections. In this paper, we make use of the structure of the LOD method, but we propose to calculate the corrections based on a Deep Ritz approach involving a parametrization of the coefficients to tackle temporal variations or uncertainties. Numerical examples for a parabolic model problem are presented to assess the performance of the approach.

fields
Numerical Analysis
pdf ↗ page arXiv:2411.14084 ↗

Let \(\mathcal{G}\) be a non-empty subset of the Euclidean space \(\mathbb{R}^m\) (\(m \geq 1\)). This work is dedicated to further investigating the properties of \(\mathcal{G}\)-multi-almost automorphic functions defined on \(\mathbb{R}^m\) with values in a Banach space \(\X\). Using the theory of \(\mathcal{G}\)-multi-almost automorphic functions, we provide two new characterizations of compact almost automorphic functions. In the first characterization, \(\mathcal{G}\) corresponds to the lattice subgroup \(\mathbb{Z}^m \subset \mathbb{R}^m\), while in the second, \(\mathcal{G}\) is taken to be a dense subset of \(\mathbb{R}^m\). Furthermore, we establish the invariance of the space of bounded and compactly \(\mathcal{G}\)-multi-almost automorphic functions under integral operators with Bi-almost automorphic kernels. Finally, we apply these results to the analysis of the almost automorphic dynamics of Poisson's and heat equations. Specifically, we prove the persistence of compact almost automorphic properties in solutions to these equations assumming that the source or initial data, respectively, is \( \mathcal{G} \)-multi-almost automorphic, where \( \mathcal{G} \) is either the lattice subgroup \( \mathbb{Z}^m \) or a dense subset (subgroup) of \( \mathbb{R}^m \).

comments
41 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2412.07644 ↗

Let $(X,d)$ be a uniformly locally finite metric space, and $T$ an operator in the uniform Roe algebra $C_u^*(X)$ (or uniform quasi-local algebra $C_{ql}^*(X)$). In this paper, we introduce the concept of limit operators of $T$ on galaxies in the nonstandard extension of $X$, and prove that $T$ is a generalized Fredholm operator with respect to the ghost ideal in $C_u^*(X)$ (or $C_{ql}^*(X)$) if and only if all limit operators on afar galaxies are invertible, and their inverses are uniformly bounded. In particular, if $X$ has Yu's Property A, then $T$ is a Fredholm operator if and only if all limit operators on afar galaxies are invertible. Using techniques in nonstandard analysis, our result strengthens a work of Špakula–Willett \cite{SpW} on the characterization of Fredholmness by using less limit operators.

comments
This is the accepted version of the following article: Guo, L., Qian, J. and Wang, Q. (2026), A nonstandard analysis approach to limit operators and Fredholmness in Roe-like algebras. Bull. London Math. Soc., 58: e70534, which has been published in final form at https://doi.org/10.1112/blms.70534. A minor error in the previous version is pointed out by the referee and is corrected (see Remark 1)
journal
Guo, L., Qian, J. and Wang, Q. (2026), A nonstandard analysis approach to limit operators and Fredholmness in Roe-like algebras. Bull. London Math. Soc., 58: e70534
fields
Functional Analysis, Metric Geometry, Operator Algebras
pdf ↗ page arXiv:2412.08130 ↗

This paper investigates additive processes with respect to several different independences in non-commutative probability in terms of the convolution hemigroups of the distributions of the increments of the processes. In particular, we focus on the relation of monotone convolution hemigroups and Loewner chains, a special kind of family of conformal mappings, on the upper half-plane. Generalizing the celebrated Loewner differential equation, we formulate an integral equation and the concept of ``generator'' for any Loewner chain of reciprocal Cauchy transforms. This generalization enables us to remove the assumption of the absolute continuity of Loewner chains which had been imposed in the literature. The locally uniform convergence of Loewner chains is then equivalent to a suitable convergence of generators. Using generators, we define homeomorphisms between the aforementioned class of Loewner chains, the set of monotone convolution hemigroups, and the set of classical convolution hemigroups on the real line. We also discuss similar homeomorphisms to free, boolean and anti-monotone convolution hemigroups on the real line.

comments
(v1) 67 pages. (v2) 70 pages. Some arguments in Section 4.3 have been changed, and some contents from our another manuscript (arXiv:2301.04361) have been incorporated. (v3) 85 pages. The general case has been added, in which the assumption of finite second moment is removed. (v4) 85 pages. Minor corrections. (v5) only some corrections of typos. To appear in ALEA Lat. Am. J. Probab. Math. Stat
fields
Probability, Complex Variables
pdf ↗ page arXiv:2412.18742 ↗

We offer further results on a general size-biased distribution related to the Riemann xi-function we presented in [9] using the work of Ferrar. Curious properties associated with its expected value are presented, which are related to special functional equations. We also relate our observations to some recent developments related to the Riemann hypothesis.

comments
Added more details
fields
Number Theory
pdf ↗ page arXiv:2412.19347 ↗

Let $ω$ be a Kahler form on $M$, which is a torus $T^4$, a $K3$ surface or an Enriques surface, let $M\#n\overline{\mathbb{CP}^2}$ be $n-$point Kahler blowup of $M$. Suppose that $κ=[ω]$ satisfies certain irrationality condition. Applying techniques related to deformation of complex objects, we extend the guage-theoretic invariant on closed Kahler suraces developed by Kronheimer\cite{Kronheimer1998} and Smirnov\cite{Smirnov2022}\cite{Smirnov2023}. As a result, we show that even dimensional higher homotopy groups of $\Symp(M\#n\overline{\mathbb{CP}^2},ω)$ are infinitely generated.

comments
30 pages
fields
Geometric Topology, Symplectic Geometry
pdf ↗ page arXiv:2412.19375 ↗

We present a dichotomy for structures $A$ that are preserved by primitive actions of $S_ω = \text{Sym}({\mathbb N})$: such a structure primitively positively constructs all finite structures and the constraint satisfaction problem is NP-complete, or the constraint satisfaction problem for $A$ is in P. To prove our result, we study the first-order reducts of the Johnson graph $J(k)$, for $k \geq 2$, whose automorphism group $G$ equals the action of $\text{Sym}({\mathbb N})$ on the set $V$ of $k$-element subsets of $\mathbb N$. We use the fact that $J(k)$ has a finitely bounded homogeneous Ramsey expansion and that $G$ is a maximal closed subgroup of $\text{Sym}(V)$.

comments
34 pages plus references; accepted for publication in LMCS
fields
Logic
pdf ↗ page arXiv:2501.03789 ↗

Quadratically constrained quadratic programs (QCQPs) are ubiquitous in optimization: Such problems arise in applications from operations research, power systems, signal processing, chemical engineering, and portfolio theory, among others. Despite their flexibility in modeling real-life situations and the recent effort to understand their properties, nonconvex QCQPs are hard to solve in practice. Most of the approaches in the literature are based on either Linear Programming (LP) or Semidefinite Programming (SDP) relaxations, each of which works very well for some problem subclasses but perform poorly on others. In this paper, we develop a relaxation selection procedure for nonconvex QCQPs that can adaptively decide whether an LP- or SDP-based approach is expected to be more beneficial by considering the instance structure. The proposed methodology relies on utilizing machine learning methods that involve features derived from spectral properties and sparsity patterns of data matrices, and once trained appropriately within a dimension-independent setup, the prediction model applies to any instance with an arbitrary number of variables and constraints. We develop classification and regression models under different feature-design setups, including a dimension-independent representation, and evaluate them on synthetically generated instances and a combined benchmark dataset consisting of MINLPLib and QPLIB instances. We further investigate relaxation selection within a spatial branch-and-bound framework, evaluating the trade-off between lower bound quality and computational time.

fields
Optimization and Control
pdf ↗ page arXiv:2501.03954 ↗

This work gives an application of Dynnikov coordinates in geometric group theory. We present a new approach to the study of subgroups of the mapping class group of a disc with $3$ marked points, $\mathbb{D}_3$, using Dynnikov coordinates.

comments
6 pages, 6 figures
fields
Geometric Topology
pdf ↗ page arXiv:2501.07287 ↗

Objective functions based on Hellinger distance yield robust and efficient estimators of model parameters. Motivated by privacy and regulatory requirements encountered in contemporary applications, we derive in this paper \emph{private minimum Hellinger distance estimators}. The estimators satisfy a new privacy constraint, namely, Hellinger differential privacy, while retaining the robustness and efficiency properties. We demonstrate that Hellinger differential privacy shares several features of standard differential privacy while allowing for sharper inference. Additionally, for computational purposes, we also develop Hellinger differentially private gradient descent and Newton-Raphson algorithms. We illustrate the behavior of our estimators in finite samples using numerical experiments and verify that they retain robustness properties under gross-error contamination.

comments
Minor revisions
fields
Statistics Theory, Probability
pdf ↗ page arXiv:2501.14974 ↗

We establish an asymptotic formula for the mean value of the logarithm of the middle prime factor of an integer, defined with or without multiplicity, with a relative error of size a negative power of $\log x$, thus refining and generalising a recent result of McNew, Pollack, and Singha Roy.

comments
in French language
fields
Number Theory
pdf ↗ page arXiv:2501.15947 ↗

Many real-world problems, such as those with fairness constraints, involve complex expectation constraints and large datasets, necessitating the design of efficient stochastic methods to solve them. Most existing research focuses on cases with no {constraint} or easy-to-project constraints or deterministic constraints. In this paper, we consider nonconvex nonsmooth stochastic optimization problems with expectation constraints, for which we build a novel exact penalty model. We first show the relationship between the penalty model and the original problem. Then on solving the penalty problem, we present a single-loop SPIDER-type stochastic subgradient method, which utilizes the subgradients of both the objective and constraint functions, as well as the constraint function value at each iteration. Under certain regularity conditions (weaker than Slater-type constraint qualification or strong feasibility assumed in existing works), we establish an iteration complexity result of $O(ε^{-4})$ to reach a near-$ε$ stationary point of the penalized problem in expectation, matching the lower bound for such tasks. Building on the exact penalization, an $(ε,ε)$-KKT point of the original problem is obtained. For a few scenarios, our complexity of either the {objective} sample subgradient or the constraint sample function values can be lower than the state-of-the-art results by a factor of $ε^{-2}$. Moreover, on solving two fairness-constrained problems and a multi-class Neyman-Pearson classification problem, our method is significantly (up to 466 times) faster than the state-of-the-art algorithms, including switching subgradient method and inexact proximal point methods.

comments
accepted by SIAMOPT
fields
Optimization and Control, Numerical Analysis
pdf ↗ page arXiv:2501.19214 ↗

In the paper, the author expresses the difference $2^m[ζ(-m,λz)-ζ(-m,λz+μ)]$ for $m\in\mathbb{N}_0$ and $\Re(z)>0$ with $λ,μ>0$ in terms of the functions $Γ(j+1){\,}_2F_1(-j,-z;1;2)$ for $0\le j\le m$ and $z\in\mathbb{C}$ in the form of matrix equations, where $Γ(z)$, $ζ(z,α)$, and ${}_2F_1(a,b;c;z)$ stand for the classical Euler gamma function, the Hurwitz zeta function, and the Gauss hypergeometric function, respectively. The case of non-integer $t$ in $2^t[ζ(-t,λz)-ζ(-t,λz+μ)]$ is left open. The coefficients are characterized by matrix formulas and by an explicit recursion; closed-form expressions for them are not obtained. This problem originates from the Landau level quantization in solid state materials.

comments
16 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2502.00624 ↗

This paper investigates normalized solutions to a focusing biharmonic Schrödinger equation with mixed dispersion and combined nonlinearities involving a lower-power perturbation and a Sobolev critical term. Under a suitable smallness condition on the prescribed mass and in the range \(2<p<2+\frac{4}{N}\), we establish the existence of a local minimizer of the associated energy functional on \(S_r(c)\) and infinitely many pairs of radial normalized solutions by combining the truncation technique, the concentration-compactness principle and genus theory. In particular, our results extend those of Alves et al. (Anal. Appl., (2025), doi: 10.1142/S0219530525500447) by removing the additional assumptions imposed in their work. In the range \(2+\frac{8}{N}<p<4^*\), we prove the existence of bounded radial constrained Palais-Smale sequences at mountain pass levels below the critical Sobolev threshold for sufficiently large \(μ\). We further show that their nonzero weak limits are radial weak solutions, with strong convergence in the derivative norms and in the critical Lebesgue norm. Moreover, under an additional condition \((N)\) ensuring the strict negativity of the limiting Lagrange multiplier, the weak limit preserves the prescribed \(L^2\)-mass, and the Palais-Smale sequence converges strongly in \(H^2(\mathbb R^N)\). These results extend the previous studies of Chang et al. (arXiv preprint, (2023), arXiv: 2305.00327v1) and Bonheure et al. (Trans. Amer. Math. Soc., (2019), doi:10.1090/tran/7769).

fields
Analysis of PDEs
pdf ↗ page arXiv:2502.02049 ↗

Let $\mathcal F_1,\ldots, \mathcal F_s\subset [n]^k$ be a collection of $s$ families. In this paper, we address the following question: for which sequences $f_1,\ldots, f_s$ do the conditions $|\mathcal F_i|>f_i$ imply that the families contain a rainbow matching, that is, there are pairwise disjoint $F_1\in \mathcal F_1,\ldots, F_s\in \mathcal F_s$? We call such sequences {\em satisfying}. Kiselev and the first author showed that $f_1 = \ldots = f_s=(s-1)n^{k-1}$ is satisfying for $s>470$, verifying the conjecture by Aharoni and Howard. This is the best possible if we insist that the families are of the same size. However, it turns out that much more can be said about asymmetric restrictions. In this paper, we investigate this question in several regimes and in particular answer the questions asked by Kiselev and Kupavskii. We use a variety of methods, including concentration and anticoncentration results, spread approximations, and the Combinatorial Nullstellenzatz.

fields
Combinatorics
pdf ↗ page arXiv:2502.03105 ↗

Understanding how 5G networks correct errors is no trivial matter. At the heart of the process lie two sophisticated families of codes: LDPC and polar codes. This paper opens the black box, not only by explaining how these codes are designed, but also by showing how they are encoded and decoded in practice. To describe the research covered in this review, we present a detailed survey of the literature supplemented with insights that are often buried deep within technical standards. These foundations are not just historical footnotes: they remain relevant to research on error correction for future wireless systems. In bringing clarity to these building blocks, we aim to help engineers and researchers navigate what is both a complex and increasingly vital part of wireless communication.

fields
Information Theory
pdf ↗ page arXiv:2502.11053 ↗

We show exactly which Seifert manifolds support partially hyperbolic dynamical systems. In particular, a circle bundle over a higher-genus surface supports a partially hyperbolic system if and only if it supports an Anosov flow. We also show for these systems that the center-stable and center-unstable foliations can be isotoped so that their leaves are transverse to the circle fibering. As a consequence, every partially hyperbolic system defined on the unit tangent bundle of a higher-genus surface is a collapsed Anosov flow.

comments
51 pages, 6 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2503.08077 ↗

In this work we study the smoothing effect of some variable coefficient operators of the form $D_t-A$, where $A$ is a Weyl-quantized pseudo-differential operator of order $m=2,3$. The class under consideration includes, among others, KdV-type and ultrahyperbolic Schrödinger operators. We prove homogeneous and inhomogeneous smoothing estimates and use them to get well-posedness results for some NLIVPs with derivative nonlinearities. Finally, we investigate the so called non-trapping property of the bicharacteristic curves of the principal symbol of our operators.

fields
Analysis of PDEs
pdf ↗ page arXiv:2503.08656 ↗

Let $P$ be a convex polygon in ${\mathbb C}$ and let $Δ_{D, P}$ be the operator of the Dirichlet boundary value problem for the Lapalcian $Δ=-4\partial_z\partial_{\bar z}$ in $P$. We derive a variational formula for the logarithm of the $ζ$-regularized determinant of $Δ_{D, P}$ for arbitrary infinitesimal deformations of the polygon $P$ in the class of polygons (with the same number of vertices). For a simply connected domain with smooth boundary such a formula was recently discovered by Wiegmann and Zabrodin as a non obvious corollary of the Alvarez variational formula, for domains with corners this approach is unavailable (at least for those deformations that do not preserve the corner angles) and we have to develop another one.

comments
Formula (4) is improved (one term was lost in the previous versions). Its proof underwent minor changes
fields
Spectral Theory, Mathematical Physics
pdf ↗ page arXiv:2503.13718 ↗

We present FreqBased, a frequency-based algorithm for the maximal square problem in binary matrices. The algorithm maintains a vertical run-length array and a horizontal counter to validate candidate squares, matching the standard single-array dynamic programming algorithm in O(mn) time and O(n) space while reducing the amount of work performed during execution. Experiments on synthetic random binary matrices reveal a clear density-dependent performance transition: FreqBased consistently outperforms the dynamic programming baseline on moderate- and high-density inputs across Intel and AMD processors, achieving peak speedups of 1.175x and 1.277x, respectively, while executing up to 2.08x fewer instructions. On 180 real aerial image masks from the INRIA dataset, FreqBased outperforms the baseline on every instance with speedups of up to 4.63x, confirming that the instruction-count advantage observed on synthetic inputs extends to real binary matrices with spatial structure. Hardware performance counter analysis shows that the performance advantage arises primarily from reduced instruction count despite lower execution efficiency, demonstrating that algorithms with identical asymptotic complexity can exhibit substantially different practical performance depending on input characteristics.

fields
Optimization and Control
pdf ↗ page arXiv:2503.18974 ↗

In this work, we propose an atomic decomposition of the Bergman-Orlicz spaces on the complex upper half-plane. Using this result, we characterize Carleson embeddings with loss between Bergman-Orlicz spaces and certain Orlicz spaces. We also leverage this last result to control the composition operator between two Bergman-Orlicz spaces.

fields
Complex Variables, Classical Analysis and ODEs
pdf ↗ page arXiv:2503.23570 ↗

Variational inference, as an alternative to Markov chain Monte Carlo sampling, has played a transformative role in enabling scalable computation for complex Bayesian models. Nevertheless, existing approaches often depend on either rigid model-specific formulations or stochastic black-box optimization routines. Tangent approximation is a principled class of structured variational methods that exploit the geometry of the underlying probability model. However, its utility has largely been confined to logistic regression and related modeling regimes. In this article, we propose a novel variational framework based on tangent transformation for a broad class of probability models characterized by strongly super-Gaussian likelihoods. Our method leverages convex duality to construct tangent minorants of the log-likelihood, thereby inducing conjugacy with Gaussian priors over model parameters in an otherwise intractable setup. Under mild assumptions on the data-generating mechanism, we establish algorithmic convergence guarantees, a contribution that stands in contrast to the limited theoretical assurances typically available for black-box variational methods. Additionally, we derive near-parametric variational risk bounds. Superior performance of our proposed methodology is illustrated on simulated and real-data scenarios that challenge state-of-the-art variational algorithms in terms of scalability and their ability to consistently capture complex underlying data structure.

comments
145 pages (35-page main paper + 110-page supplementary material), 51 figures, 14 tables. Accepted in the Journal of the American Statistical Association (Theory & Methods)
fields
Statistics Theory
pdf ↗ page arXiv:2504.05431 ↗

We define a new representation for a subset of rational numbers and prove that each real number \( x \notin (-1,1) \) can be approximated arbitrarily well by rational numbers which have only \( 2 \)'s and \( 1 \)'s in their representation.

fields
General Mathematics
pdf ↗ page arXiv:2504.07970 ↗

We construct a rational homotopy pullback decomposition for variants of the classifying space of the group of homeomorphisms for a large class of manifolds. This has various applications, including a rational section of the stabilisation map ${\rm Top}(d)\rightarrow {\rm Top}$ of the space of homeomorphisms of ${\bf R}^d$ for $d\ge 6$, or a new method to construct topological bundles and detect characteristic classes thereof. Some steps in the proofs may be of independent interest, such as the construction of a nullhomotopy of the twice-iterated stabilisation map for the space of orientation-preserving derived automorphisms of the rational $E_d$-operad, results on recovering boundaries of manifolds from their interior in the context of embedding calculus, or a treatment of tensor products of truncated $\infty$-operads.

comments
62 pages, 2 figures, to appear in Duke Mathematical Journal
fields
Algebraic Topology, Geometric Topology
pdf ↗ page arXiv:2504.20265 ↗

We adapt the article of Forien, Pang, Pardoux and Zotsa, on epidemic models with varying infectivity and waning immunity, to incorporate the memory of the last infection. To this end, we introduce a parametric approach and consider a piecewise deterministic Markov process modeling both the evolution of the parameter, also called the trait, and the age of infection of individuals over time. At each new infection, a new trait is randomly chosen for the infected individual according to a Markov kernel, and their age is reset to zero. In the large population limit, we derive a partial differential equation (PDE) that describes the density of traits and ages. The main goal is to study the conditions under which endemic equilibria exist for the deterministic PDE model and to establish an endemicity threshold that depends on the model parameters. The local stability of these equilibria is also analyzed. The endemicity threshold is computed for several examples, including models that incorporate a vaccination policy, and a local stability result is obtained for a memory-free SIS-type model.

comments
Stochastic epidemic model with memory; age-structured model; varying infectivity; varying immunity/susceptibility; endemicity; local stability
fields
Probability
pdf ↗ page arXiv:2505.00601 ↗

Twisted torus links $T(p,q;r,s)$ generalize torus links by introducing $s$ additional twists on $r$ adjacent strands of the torus link $T(p,q)$. It is well known that the number of components of a torus link $T(p,q)$ is given by the greatest common divisor of $p$ and $q$. However, the number of components of a twisted torus link cannot be determined as straightforwardly from its parameters. In this work, we present a Euclidean algorithm-like procedure for computing the number of components of twisted torus links from their parameters. As a result, we show that the number of components of a twisted torus link $T(p,q;r,s)$ is a multiple of $\gcd(p,q,r,s)$, and in particular, $T(p,q;r,s)$ is a knot only if $\gcd(p,q,r,s)=1$. We also use our algorithm to determine the number of components for several families of twisted torus links considered in the literature.

comments
10 pages, 5 figures. Revised version incorporating referee comments and minor corrections and clarifications. Accepted for publication in the Journal of Knot Theory and Its Ramifications
fields
Geometric Topology
pdf ↗ page arXiv:2505.01021 ↗

This survey develops a variable and operator splitting (VOS) framework for accelerated first-order methods. Operator splitting separates the components of the optimality system, while variable splitting introduces auxiliary dynamics that generate acceleration. The strong Lyapunov property guides the stability analysis, and practical schemes follow from Accelerated Over-Relaxation (AOR) and Extrapolation by Predictor–Corrector (EPC) discretizations. For merely convex problems, a perturbed VOS flow combined with homotopy in the auxiliary scale yields accelerated rates. The framework gives a common derivation and analysis of Nesterov-type, FISTA-type, composite, mirror-descent-type, and bilinear saddle-point accelerated methods. Its main contribution is structural and expository: it organizes these methods within one Lyapunov and splitting template and explains how acceleration survives different splittings and discretizations.

fields
Optimization and Control
pdf ↗ page arXiv:2505.04065 ↗

A graph $G$ consists of two parts, the vertices and edges. The vertices constitute the vertex set $V(G)$ and the edges, the edge set. An edge \( e=xy \), \( ev \)-dominates not only the vertices incident to it but also those adjacent to either \( x \) or \( y \). The edge-vertex degree of $e,$ $deg^{ev}_{G}(e),$ is the number of vertices in the $ev$-dominating set of $e$. In this article, we compute expressions for the $ev$-degree version of the Zagreb index of several unary and binary graph operations.

fields
Combinatorics
pdf ↗ page arXiv:2505.05999 ↗

We prove the non-existence of cohomogeneity one Einstein metrics on a class of compact manifolds arising as double disk bundles, whose principal orbits split into two inequivalent irreducible summands. The proof uses a phase space barrier argument that yields a new obstruction to the existence of closed cohomogeneity one Einstein metrics, even when the principal orbits admit homogeneous Einstein metrics.

comments
This submission contains the non-existence result originally part of arXiv:2405.10836v3, now split off for clarity. The artificial condition d2\geq d1 is no longer needed by the main result. The proofs in the Appendix were largely simplified. Proposition 4.10 added for an upcoming preprint
fields
Differential Geometry
pdf ↗ page arXiv:2505.06631 ↗

Convex quadratic programs (QPs) constitute a fundamental computational primitive across diverse domains including financial optimization, control systems, and machine learning. The alternating direction method of multipliers (ADMM) has emerged as a preferred first-order approach due to its iteration efficiency - exemplified by the state-of-the-art OSQP solver. Machine learning-enhanced optimization algorithms have recently demonstrated significant success in speeding up the solving process. This work introduces a neural-accelerated ADMM variant that replaces exact subproblem solutions with learned approximations through a parameter-efficient Long Short-Term Memory (LSTM) network. We derive convergence guarantees within the inexact ADMM formalism, establishing that our learning-augmented method maintains primal-dual convergence while satisfying residual thresholds. Extensive experimental results demonstrate that our approach achieves superior solution accuracy compared to existing learning-based methods while delivering significant computational speedups of up to $7\times$, $28\times$, and $22\times$ over Gurobi, SCS, and OSQP, respectively. Furthermore, the proposed method outperforms other learning-to-optimize methods in terms of solution quality. Detailed performance analysis confirms near-perfect compliance with the theoretical assumptions, consequently ensuring algorithm convergence.

fields
Optimization and Control
pdf ↗ page arXiv:2505.09391 ↗

In 1960, Ghouila-Houri proved that every strongly connected directed graph $G$ on $n$ vertices with minimum degree at least $n$ contains a directed Hamilton cycle. We asymptotically generalize this result by proving the following: every directed graph $G$ on $n$ vertices and with minimum degree at least $(1+o(1))n$ contains every orientation of a Hamilton cycle, except for the directed Hamilton cycle in the case when $G$ is not strongly connected. In fact, this minimum degree condition forces every orientation of a cycle in $G$ of every possible length, other than perhaps the directed cycles.

comments
20 pages (plus 5 page appendix), 3 figures. To appear in Journal of Combinatorial Theory, Series B
fields
Combinatorics
pdf ↗ page arXiv:2505.09793 ↗

Group distributionally robust optimization (GDRO) aims to learn models that perform well across $m$ distributions simultaneously. Existing methods either (i) query $m$ samples per round, which imposes strict implementation requirements, or (ii) query only a single sample per round, which requires many rounds to converge and therefore leads to long runtime. To avoid these limitations, we introduce a novel setting called \emph{flexible sample queries} (FSQ), which allows the number of samples that can be queried to vary across rounds. Under the FSQ setting, we cast GDRO as a two-player game: one performs non-oblivious online convex optimization, while the other tackles a non-oblivious prediction with limited advice (PLA) problem. In this game, the first player updates its decision using follow-the-regularized-leader with stochastic gradients. For the second player, we develop a new PLA method equipped with an adaptive exploration strategy that can leverage an arbitrary per-round sample size. We then establish the \emph{first} high-probability regret bound for non-oblivious PLA. By integrating these components, we develop an anytime GDRO algorithm that supports FSQ, and derive a high-probability optimization error bound of $O\left(\frac{1}{t}\sqrt{\sum_{j=1}^t \frac{m}{r_j}\log m}\right)$, where $r_j$ is the sample size at round $j$. This result demonstrates that the optimization error decreases as the per-round sample sizes increase, and implies the same near-optimal sample complexity of $O(m\log (m)/ε^2)$ for any fixed sample size $r\in[m]$.

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

Let $L$ be a compact oriented Lagrangian surface in a Kähler surface endowed with a complete Riemannian metric (compatible with the symplectic structure and the complex structure) with bounded sectional curvatures and a positive lower bound on injectivity radius. We show that for every nontrivial class $[γ]$ of the fundamental group $π_1(L)$ such that $γ$ bounds a topological disk in $M$, there exists a holomorphic disk whose boundary belongs to $L$ and is freely homotopic to $γ$ on $L$. This answers a question of Bennequin on existence of $J$-holomorphic disks. Nonexistence of exact Lagrangian embeddings of certain surfaces is established in such Kähler surface if the fundamental form is exact. In the almost Kähler setting, especially, the cotangent bundles of compact manifolds, results on nonexistence of $J$-holomorphic disks and existence of minimizers of the partial energies in the sense of A. Lichnerowicz are obtained.

fields
Differential Geometry, Symplectic Geometry
pdf ↗ page arXiv:2505.19407 ↗

We establish a substantial part of the categorification framework for $k$-Schur functions proposed in Chen's Ph.D.\ thesis, written under the supervision of Mark Haiman. More precisely, we realize $k$-Schur functions as the graded characters of a distinguished family of objects in a certain module category and establish module-theoretic analogues of several foundational properties of $k$-Schur functions. A final part of Chen's framework predicts a homological characterization of modules admitting filtrations by these distinguished objects; we establish this characterization under an additional combinatorial hypothesis. In addition, we unconditionally prove that modules arising in this framework admit filtrations whose subquotients are affine Demazure modules of level $k$. As a consequence, modified Macdonald polynomials expand positively in the characters of affine Demazure modules. This may be viewed as a homological refinement of Macdonald positivity, arising from an intrinsic $\mathrm{ext}$-orthogonality condition on the corresponding Garsia–Haiman modules. We also prove the combinatorial hypothesis for $m \le 2k$ in the appendix and verify it computationally for $m\leq 19$, yielding $k$-Schur positivity of modified Macdonald polynomials in these cases. Our approach builds on our previous work on the algebraic and geometric realization of Catalan symmetric functions, a class encompassing both $k$-Schur and Hall–Littlewood functions.

comments
69 pages. In v3, the full claim on the k-Schur positivity of Macdonald polynomials was withdrawn due to an error in Section 8 of v2; weaker/restricted results were recorded instead. In v4, corrected the treatment of the $\mathfrak g[z]$-action in Section 5 of v3 and made corresponding revisions. The main statements are unchanged from v3. Other minor corrections
fields
Representation Theory, Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:2505.23202 ↗

We introduce dro, an open-source Python library for distributionally robust optimization (DRO) for regression and classification problems. The library implements 15 DRO formulations and 9 backbone models, enabling 85 distinct DRO methods. Furthermore, dro is compatible with both scikit-learn and PyTorch through a unified interface, and uses approximation techniques to reduce runtime for some computationally demanding formulations. Comprehensive documentation is available at https://python-dro.org.

fields
Numerical Analysis
pdf ↗ page arXiv:2505.23565 ↗

Let $ G $ be a connected reductive algebraic group over $ \mathbb{R} $, and $ H $ its symmetric subgroup. For parabolic subgroups $ P_{G} \subset G $ and $ P_{H} \subset H $, the product of flag varieties $ \mathfrak{X} = H/P_H \times G/P_G $ is called a double flag variety, on which $ H $ acts diagonally. Now let $G$ be either $\mathrm{U}(n,n)$ or $\mathrm{Sp}_{2n}(\mathbb{R})$. We classify the $H$-orbits on $ \mathfrak{X} $ in both cases and show that they admit exactly the same parametrization. Concretely, each orbit corresponds to a signed partial involution, which can be encoded by simple combinatorial graphs. The orbit structure reduces to several families of smaller flag varieties, and we find an intimate relation of the orbit decomposition to Matsuki duality and Matsuki-Oshima's notion of clans. We also compute the Galois cohomology of each orbit, which exhibits another classification of the orbits by explicit matrix representatives.

comments
63 pages
journal
Mathematische Zeitschrift 314, 22 (2026)
fields
Representation Theory
pdf ↗ page arXiv:2506.12663 ↗

We study bandit learning in matching markets with two-sided reward uncertainty, extending prior research primarily focused on single-sided uncertainty. Building on Irving's (1994) concept of super-stability and the partial-order proposal algorithm of Cseh and Juhos (2021), we use a simultaneous Extended Gale-Shapley procedure to certify stable matchings from incomplete preference information. By employing this procedure, our centralized algorithm attains logarithmic pessimal stable regret dependent on an instance-dependent admissible gap parameter. This algorithm is further adapted to a decentralized setting with a time-independent additive $O(N^3K)$ regret increase under the stated shared-flag communication model. Finally, we establish a centralized instance-dependent lower bound for binary stable regret on strict interior Bernoulli instances, elucidating the roles of admissible partial ranks and super-stable matching in characterizing the complexity of stable matching with bandit feedback.

fields
Information Theory
pdf ↗ page arXiv:2506.15926 ↗

We establish a fixed-point framework for non-linear boundary value problems for first-order elliptic operators on vector bundles, with primary application to the spinorial Yamabe and Brezis–Nirenberg equations. We prove existence and uniqueness of an $H^1$-solution under a smallness condition that is homogeneous under amplitude and operator scaling. The associated iterative scheme converges geometrically in $L^q$ and $H^1$, and the solution depends continuously on the harmonic representative of the boundary datum. Through bootstrapping, we obtain interior $C^{1,α}$-regularity and boundary smoothness under Shapiro–Lopatinski conditions. The method is extended to families of small domains via rescaling to a fixed reference domain.

comments
Updated version: We now work proof our results via Fixed-Point method. We omit fractional Sobolev spaces. New results on well-posedness, specifically the stability and uniqueness of the solution, have been added. The framework has been extended other non-linear BVP, for example the spinorial Brezis--Nirenberg equation. The contraction conditions are now explicit and homogenous in the datum
fields
Analysis of PDEs, Differential Geometry
pdf ↗ page arXiv:2506.18546 ↗

Robust subspace estimation is fundamental to many machine learning and data analysis tasks. Iteratively Reweighted Least Squares (IRLS) is an elegant and empirically effective approach to this problem, yet its theoretical properties remain poorly understood. This paper establishes that, under deterministic conditions, a variant of IRLS with dynamic smoothing regularization converges linearly to the underlying subspace from any initialization. We extend these guarantees to affine subspace estimation, a setting that lacks prior recovery theory. Additionally, we illustrate the practical benefits of IRLS through an application to low-dimensional neural network training. Our results provide the first global convergence guarantees for IRLS in robust subspace recovery and, more broadly, for nonconvex IRLS on a Riemannian manifold.

fields
Optimization and Control
pdf ↗ page arXiv:2506.20533 ↗

Greenberg examined the local behaviour of Iwasawa invariants as functions on the set $\mathscr{E}(F)$, the set of all $\mathbb{Z}_p$-extensions of a number field $F$. Kleine later extended these ideas to study the variation of Iwasawa invariants in the context of Selmer groups of abelian varieties across different $\mathbb{Z}_p$-extensions of $F$. Let $K$ be a global function field of characteristic $p$. In this article, we examine the relationship between the Iwasawa invariants of fine Selmer groups of an elliptic curve over $K$ as one varies over different $\mathbb{Z}_p$-extensions of $K$, using the methods developed by Kleine. We also study generalised Iwasawa invariants of the fine Selmer groups over a $\mathbb{Z}_p^2$-extension $\mathscr{L}/K$, adapting the techniques used by Kleine, Matar and Sujatha.

comments
Accepted for publication in the Journal of Pure and Applied Algebra
fields
Number Theory
pdf ↗ page arXiv:2506.22002 ↗

Consider a sequence of masses $m_0,m_1,...$ arriving uniformly at random at some points $u_0,u_1,...$ on the unit circle $\mathbb{R}/\mathbb{Z}$ (or on $\mathbb{Z}/n\mathbb{Z}$, in the discrete version). Upon arrival, each mass undergoes a relaxation phase during which it is dispersed, possibly also at random. This process can model many physical phenomena, such as the diffusion of liquid in a porous medium. In the discrete case, it can model parking (related to additive coalescence and hashing with linear probing) in which the cars are permitted to follow random displacement policies. The dispersion policies considered in the paper ensure that at time $k$, after the successive dispersions of $m_0,\cdots,m_{k-1}$, the total covered region has Lebesgue measure $m_0+\cdots+m_{k-1}$. Furthermore, during the dispersion of a given mass, the covered domain increases continuously, except when it merges with another covered connected component (CC). We show a very general exchangeability property for the sequence of covered CC. Additionally, we demonstrate a universal spacing property between these CC, and a notable general result: if the $(u_i)$ are independent and rotationally invariant, then the number of free (not covered) CC follows a binomial distribution whose parameters depend solely on the number and total mass of arrived particles. Furthermore, conditional on the number of CC, the sizes of the free CC follow a simple Dirichlet distribution in the continuous case, regardless of the dispersion policy considered and the values of the masses. We also characterize the distribution of the occupied space. In the second part of the paper, we study the total cost associated with these models for various cost models, and establish connections with the additive coalescent. We also provide an asymptotic representation of the limiting covered space as the number of masses goes to infinity.

comments
57 pages, 10 figures
fields
Probability, Combinatorics
pdf ↗ page arXiv:2507.00737 ↗

Let $ X $ be a closed, oriented Riemannian manifold. Denote by $ (M = X \times I = X \times [0, 1], \partial M = X \times \lbrace 0 \rbrace \cup X \times \lbrace 1 \rbrace, g) $ a compact cylinder with smooth boundary, $ \dim M \geqslant 3 $. In this article, we address the following question: If $ g $ is a Riemannian metric having (i) positive scalar curvature (PSC metric) on $ M $ and nonnegative mean curvature on $ \partial M $; and (ii) $ χ(X) = 0 $ and $ \dim X \geq 5 $, then there exists a PSC metric on $ X $. This generalizes a result of Gromov and Lawson for $ X = \mathbb{T}^{n} $. Our result also implies an infinite band width consequence complementary to Gromov's band width conjecture, which roughly says no additional obstruction or flexibility for the existence of PSC on $ X $ is gained by passing to $ X \times [0, 1] $. Our result relies on geometric PDE analysis with respect to a new conformal invariance—the $ g $-angle condition between normal vector field along $ \partial M $ and the global vector field tangential to the $ I $-direction.

comments
18 Pages, all comments are welcome. V2 shows that the same conclusion holds when $ χ(X) = 0 $ and $ \dim X \geq 5 $
fields
Differential Geometry
pdf ↗ page arXiv:2507.07005 ↗

Let ${\mathbb{G}}$ be a simply connected ${\mathbb{Z}}_\ell$-spets, let $q$ be a prime power, prime to $\ell$ and let $S$ be the underlying Sylow $\ell$-subgroup. Firstly, motivated by known formulae for values of Deligne-Lusztig characters of finite reductive groups, we propose a formula for the values of the unipotent characters of ${\mathbb{G}}(q)$ on the elements of $S$. Using this, we explicitly list the unipotent character values of the ${\mathbb{Z}}_2$-spets $G_{24}(q)$ related to the Benson-Solomon fusion system Sol$(q)$, and the Aguadé ${\mathbb{Z}}_5$-spets $G_{29}(q)$. Secondly, when $\ell > 2$ is a very good prime for ${\mathbb{G}}$, the Weyl group $W$ of ${\mathbb{G}}$ has order coprime with $\ell$, and $q\equiv1\pmod\ell$ we introduce a formula for the values of characters in the principal block of ${\mathbb{G}}(q)$ which extends the Curtis-Schewe type formulae for groups of Lie type, and which we show to satisfy a version of block orthogonality. In both cases we formulate and provide evidence for several conjectures concerning the proposed values.

comments
revised version; added example of $G_{29}$
fields
Representation Theory, Group Theory
pdf ↗ page arXiv:2507.08502 ↗

This article gives an expository account of quasisyntomic descent and the Nygaard filtration in positive characteristic, complemented by several new applications to $p$-adic cohomology theories. The guiding result is a new approach to Illusie's comparison between fppf cohomology with $\mathbb{Z}_p(1)$ coefficients and the slope $1$ part of crystalline cohomology. We follow work of Bhatt-Lurie, but give a more elementary presentation which does not rely on the formalism of $\infty$-categories. We then revisit Ogus' comparison theorem between infinitesimal cohomology and étale cohomology, and give new proofs of several results on fppf cohomology that were previously obtained with the de Rham-Witt complex. We also determine the action of multiplication-by-$n$ on the fppf cohomology of an abelian variety, answering a question of A. Skorobogatov to the author. This is an expanded version of the author's master thesis.

comments
45 pages. v2: minor corrections and exposition improved based on referee comments
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2507.08568 ↗

Given a closed, smooth 4-manifold $X$ and self-diffeomorphism $f$ that is topologically pseudo-isotopic to the identity, we study the question of whether $f$ is moreover smoothly pseudo-isotopic to the identity. If the fundamental group of $X$ lies in a certain class, which includes trivial, free, and finite groups of odd order, we show the answer is always affirmative. On the other hand, we produce the first examples of manifolds $X$ and diffeomorphisms $f$ where the answer is negative. Our investigation is motivated by the question, which remains open, of whether there exists a self-diffeomorphism of a closed 4-manifold that is topologically isotopic to the identity, but not stably smoothly isotopic to the identity.

comments
v2 some small structural changes, corrections and addition of Section 7 after referee comments. To appear in J. Reine Angew. Math
fields
Geometric Topology
pdf ↗ page arXiv:2507.16984 ↗

We develop a microlocal theory, in the sense of Kashiwara-Schapira, for Zariski-constructible sheaves on rigid analytic varieties. We define and study monodromic sheaves, the monodromic Fourier transform, specialisation, microlocalisation, micro-hom, and singular support in this context. Some questions and conjectures are formulated in the end. The appendix contains infinity-categorical characterisations of monodromic sheaves.

comments
30 pages. Comments welcome! v2: minor improvements, generalised the theory of monodromic sheaves and specialisation as encouraged by T. Abe
fields
Algebraic Geometry
pdf ↗ page arXiv:2507.18604 ↗

We prove Hypothesis H in full generality for ${\rm GL}_n$ over any number field. This result is a consequence of our stronger effective bound on Euler products involving Rankin–Selberg coefficients at prime ideal powers. The proof rests on a new analytic method, which employs a power sieve over number fields and an iterative argument to bypass the functoriality barrier that had restricted prior results to $n\leq 4$. As applications, we unconditionally establish smoothed $m$-level correlations of zeros of automorphic $L$-functions for a restricted class of test functions, provide an explicit polynomial bound for the strong multiplicity one problem for coefficients, and resolve the Selberg orthogonality conjecture with stronger error terms.

comments
36 pages. Comments welcome!
fields
Number Theory
pdf ↗ page arXiv:2507.20653 ↗

Let $k'(G)$ and $L(G)$ be the number of conjugacy classes of subgroups and the subgroup lattice of a finite group $G$, respectively. Our objective is to study some aspects related to the ratios $d'(G)=\frac{k'(G)}{|L(G)|}$ and $d^*(G)=\min\{ d'(S) \mid S\text{ is a section of }G\}$ which measure how close $G$ is to being a Dedekind group. We prove that the set containing the values $d'(G)$, as $G$ ranges over the class of nilpotent groups, is dense in $[0, 1]$. A nilpotency criterion is obtained by proving that if $d^*(G)>\frac{2}{3}$, then $G$ is nilpotent and information on its structure is given. We also show that if $d^*(G)>\frac{4}{5}$, then $G$ is an Iwasawa group. Finally, we deduce a result which ensures that a $p$-group of order $p^n$ ($n\geq 3$) is a Dedekind group. This last result can be extended to the class of nilpotent groups and it also highlights the second maximum value of $d^*$ on the class of $p$-groups of order $p^n$.

comments
accepted for publication in Mediterr. J. Math
fields
Group Theory
pdf ↗ page arXiv:2508.14267 ↗

We study the sequential root-finding problem with repeated noisy measurements. We propose sequential-test bisection STB, which uses a nonparametric sequential sign test to determine when to move to a new design point. Compared with variants of stochastic approximation, STB offers broader adaptivity and faster convergence. When the regression function satisfies $|f(x)|\geq \textsf{c}_0|x-θ|^γ$ in a neighborhood of $θ$ for constants $\textsf{c}_0,γ>0$ where $θ$ is the root, i.e. $f(θ) = 0$, we establish non-asymptotic guarantees showing that STB, without using the knowledge of $γ$, achieves the minimax adaptive optimal convergence rate $\widetilde{O}(n^{-1/(2γ)})$, outperforming Robbins–Monro and related stochastic-approximation methods in convergence rate. Under sub-Gaussian noise, STB provides finite-sample confidence sequences for the root $θ$ without estimating a derivative. In the positive-slope model, we augment STB with {randomized weighted-section and a line fitted to all observations}, leading to asymptotic normality and consistent variance estimation. We formalize the efficiency by a convolution theorem of Hájek-Le Cam type. Furthermore, when the regression function is discontinuous at the root, we show that Robbins–Monro converges at rate $1/n$, whereas STB converges super-polynomially. We extend this construction to multivariate nonparametric level-set estimation by sampling along rays. As a technical byproduct, we establish a new central limit theorem under random stopping, with proof techniques that may be of independent interest.

comments
72 pages, 12 figures
fields
Statistics Theory
pdf ↗ page arXiv:2508.17591 ↗

We begin by defining Temperley-Lieb algebra, in two different ways: as a presented algebra or as a diagrammatic algebra. Next, we look for a basis algorithmically, using rewriting theory. Finally, we introduce a generalization of the Temperley-Lieb algebra, which is an oriented version of the previous one. This pushes us to employ a more efficient tool, category theory, to use rewriting to easily obtain a basis for the algebra.

comments
35 pages. This document is an internship report from a bachelor student. It shows a lot of "known" results, except for part 2.1.2, giving the Jones normal form of a diagram; part 2.2.2-3, applying rewriting theory to find the Jones normal forms basis of the Temperley-Lieb algebra; and 4.3-4, applying category theory to find a new basis
fields
Representation Theory
pdf ↗ page arXiv:2508.19360 ↗

In this study, we examine Fritz John (FJ) and Karush-Kuhn-Tucker (KKT) type optimality conditions for a class of nonsmooth and nonconvex optimization problems with inequality constraints, where the objective and constraint functions all are assumed to be radially epidifferentiable. The concept of the radial epiderivative constitutes a distinct generalization of classical derivative notions, as it replaces the conventional limit operation with an infimum-based construction. This formulation permits the analysis of directional behavior without invoking standard neighborhood-based assumptions and constructions commonly required in generalized differentiation. This leads to one of the key advantages of the radial epiderivative which lies in its applicability even to discrete domains, where classical and generalized derivatives are often inapplicable or undefined. The other advantage of this concept is that it provides a possibility to inverstigate KKT conditions for global minimums. Consequently, this approach necessitates a reformulation of fundamental analytical tools such as gradient vectors, feasible direction sets, constraint qualifications and other concepts which are central to the derivation of optimality conditions in smooth optimization theory. The primary contribution of this paper is the development of a comprehensive theoretical framework for KKT conditions tailored to the radially epidifferentiable setting. We introduce novel definitions of the radial gradient vector, of the set of feasible directions, and examine how classical constraint qualifications may be interpreted and extended within this new framework.

comments
This work contains critical errors that invalidate the main conclusions
fields
Optimization and Control
pdf ↗ page arXiv:2509.01272 ↗

We study dual volume representations of canonical forms for positive geometries in projective spaces, expressing their rational canonical functions as Laplace transforms of measures supported on the convex dual of the semialgebraic set. More generally, for hyperbolic positive geometries the inverse Laplace transform is naturally understood as a distribution supported on the closed dual cone. When this distribution is a non-negative measure, we term the geometry completely monotone, reflecting the property of its canonical function. We identify a class of positive geometries with hyperbolic algebraic boundary for which this cone-supported distribution exists. In particular, simplex-like minimal spectrahedra are completely monotone, with representing measures governed by the Riesz–Wishart theory of the cone of positive semidefinite matrices and admitting integral descriptions over spectrahedral slices and lower-rank strata. We explicitly compute these measures for positive geometries in the projective plane bounded by lines and conics or by a nodal cubic, revealing periods evaluating to transcendental functions. This dual volume perspective replaces logarithmic differential forms by dual measures in the completely monotone case, forging new connections to hyperbolic differential operators, convex optimization and algebraic statistics.

comments
36 pages, 14 figures, Revised version addressing referee comments, with clarifications to the discussion, improved notation, and corrections of minor errors and typos
fields
Algebraic Geometry, Analysis of PDEs, Probability, Statistics Theory
pdf ↗ page arXiv:2509.02239 ↗

A Markov logic network (MLN) $\mathbb{M}$ determines a probability distribution $\mathbb{P}_n^\mathbb{M}$ on the set $\mathbf{W}_n$ of structures, or ``possible worlds'', with domain $\{1, \ldots, n\}$. We study the properties of such distributions as $n$ tends to infinity. We show that with mild assumptions on an MLN $\mathbb{M}$ with one soft constraint with an arbitrary positive weight the distribution $\mathbb{P}_n^\mathbb{M}$ will behave quite differently from the uniform distribution $\mathbb{P}_n^{uni}$ on $\mathbf{W}_n$ for all sufficiently large $n$. For a language with only one relation symbol $R$ which has arity 1 we give an almost complete characterization of the possible asymptotic behaviours of $\mathbb{P}_n^\mathbb{M}$ as $n \to \infty$, where $\mathbb{M}$ may be any MLN for this language. The asymptotic behaviour depends on the soft constraints and weights of the MLN. This characterization is used to show that if the language under consideration contains at least one relation symbol of arity 1 then the following holds: (a) There is an MLN $\mathbb{M}$ such that for every lifted Bayesian network (LBN) $\mathbb{G}$ there are infinitely many $n$ such that $\mathbb{M}$ and $\mathbb{G}$ determine different distributions on $\mathbf{W}_n$. (b) There is an LBN $\mathbb{G}$ such that for every MLN $\mathbb{M}$ there are infinitely many $n$ such that $\mathbb{G}$ and $\mathbb{M}$ determine different distributions on $\mathbf{W}_n$. We also show that, in the limit, the weight dimension and the domain size dimension may behave completely differently.

fields
Logic
pdf ↗ page arXiv:2509.04192 ↗

We study the geodesic flow defined on the unit tangent bundle of a Riemannian manifold with non-positive curvature. In the case of surfaces, Coudène and Schapira proved that the existence of a flat strip prevents the set of ergodic measures from being generic in the space of invariant probability measures. We show the existence of a three-dimensional manifold that contains an embedded flat torus and where ergodicity is a generic property. More generally, Coudène and Schapira proved that ergodicity is a generic property within the space of invariant probability measures defined on $Ω_{NF}$, the set of non-wandering vectors whose orbits do not bound a flat strip. We introduce a larger set $\mathcal{R}_w$ where the same property holds, and we illustrate the extent of our findings using a famous example of a rank-one manifold attributed to Gromov.

comments
This article is currently under review for publication in Annales de l'Institut Fourier
fields
Dynamical Systems, Differential Geometry
pdf ↗ page arXiv:2509.04916 ↗

We show that quasi-$F$-pure but not $F$-pure isolated quasi-homogeneous hypersurface singularities necessarily have $F$-pure threshold $1 - \frac{1}{p}$. This extends work of Bhatt and Singh beyond the Calabi-Yau case. We also classify the (quasi)-$F$-purity of Fermat hypersurfaces.

comments
Updated to include referee feedback; to appear in Nagoya Math Journal. Comments welcome!
fields
Commutative Algebra, Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2509.06211 ↗

We introduce a quantity called the free mutual information (FMI), adapted from concepts in free probability theory, as a new physical measure of quantum chaos. This quantity captures the spreading of a time-evolved operator in the space of all possible operators on the Hilbert space, which is doubly exponential in the number of degrees of freedom. It thus provides a finer notion of operator spreading than the well-understood phenomenon of operator growth in physical space. We derive two central results which apply in any physical system: first, an explicit "Coulomb gas" formula for the FMI of two observables $A(t)$ and $B$ in terms of the eigenvalues of the product operator $A(t)B$; and second, a general relation expressing the FMI as a weighted sum of all higher-point out-of-time-ordered correlators (OTOCs). This second result provides a precise information-theoretic interpretation for the higher-point OTOCs as collectively quantifying operator ergodicity and the approach to freeness. This physical interpretation is particularly useful in light of recent progress in experimentally measuring higher-point OTOCs. We identify universal behaviours of the FMI and higher-point OTOCs across a variety of chaotic systems, including random unitary circuits and chaotic spin chains, which indicate that spreading in the doubly exponential operator space is a generic feature of quantum many-body chaos. At the same time, the non-generic behavior of the FMI in various non-chaotic systems, including certain unitary designs, shows that there are cases where an operator spreads in physical space but remains localized in operator space. The FMI is thus a sharper diagnostic of chaos than the standard 4-point OTOC.

comments
92 pages, 24 figures. Comments are welcome!;v2: published version, minor revisions
journal
PRX Quantum 7, 043017 (2026)
fields
Mathematical Physics
pdf ↗ page arXiv:2509.13406 ↗

In this text we (re)-tell the theory of pseudo-Anosov flows on 3-manifolds with the orbit space as the central character; via a streamlined framework called {\em Anosov-like group actions}. This brings a simplified and unified perspective, and allows for the import of tools from 1- and 2-dimensional topological dynamics. In so doing, we are able to give a relatively efficient presentation (or re-presentation) of foundational results in the field which appeared over several decades and many papers. We hope that the reader, whether a beginning or more advanced topologist or dynamicist, finds this a welcoming invitation to the rich theory of pseudo-Anosov flows.

comments
v3: replaced all figures by vectorized versions created by Federico Salmoiraghi. Lots of typos, and small errors fixed, sketches or hints added to the exercises. v2: added a new chapter (chapter 3), old section 2.11 incorporated into chapter 3, lots of small modifications following feedback. v1: First complete, public, version. Please don't hesitate to send us comments, including detected typos
fields
Dynamical Systems, Geometric Topology
pdf ↗ page arXiv:2509.15375 ↗

Many have have taken in hand to write a treatise on the Star of Bethlehem, particularly on Kepler's explanation as a stellar birth, triggered by Mars joining a great conjunction (a meeting of Jupiter and Saturn), as he observed it in October 1604. It is the aim of my short treatise to introduce, at a hopefully well digestible level, into underlying antiquity's concepts of physics, astrology, and astronomy around the time of Christ's birth and to demonstrate their essential developments up to the early modern period. In the latter, Kepler played a significant role. His contributions enabled him to calculate back to the year 7 BC with astonishing precision, locating a triple great conjunction in Pisces, which was then complemented by Mars. This is confirmed by both Babylonian tradition and modern astronomy. The following background provided may be specifically helpful for a more theologically oriented audience, also because the controversy surrounding "geocentric" and "heliocentric" world systems (Copernicus) is touched upon. And, because the overall context raises questions for theology, with which the epilogue concludes.

comments
in German language
fields
History and Overview
pdf ↗ page arXiv:2509.15387 ↗

Given a collection of distributions $\{P_{y}\}$ and a mixing distribution $ρ$ supported over $\mathbb{R}^{d}$, we propose new sufficient conditions under which the mixture / joint distribution satisfies a Poincaré or log-Sobolev inequality. We develop these sufficient conditions in a unified manner using the framework of $Φ$-Sobolev inequalities (Chafaï, 2004). The conditions that we develop in this work are satisfied by a variety of Markov chains, and consequently allows us to characterise the evolution of these functional inequalities for iterates generated by simulating these Markov chains. As a result, we obtain an clean error analysis for estimating a broad class of functionals using Markov chain Monte Carlo strategies along these Markov chains.

comments
v3: establish stronger W2 mixing with condition on kernel
fields
Probability, Functional Analysis
pdf ↗ page arXiv:2509.15410 ↗

In any graph, the maximum size of an induced path is bounded by the maximum size of a path. However, in the general case, one cannot find a converse bound, even up to an arbitrary function, as evidenced by the case of cliques. Galvin, Rival and Sands proved in 1982 that, when restricted to weakly sparse graphs, such a converse property actually holds. In this paper, we consider the maximal function $f$ such that any planar graph (and in general, any graph of bounded genus) containing a path on $n$ vertices contains an induced path of size $f(n)$, and prove that $f(n) \in Θ(\log n/\log \log n)$ by providing a lower bound matching the upper bound obtained by Esperet, Lemoine and Maffray, up to a constant factor. We obtain these tight bounds by analyzing graphs ordered along a Hamiltonian path that admit an edge partition into a bounded number of sets without crossing edges. In particular, we prove that the guaranteed size of an induced path when the ordered graph can be partitioned into $2k$, resp. $2k+1$, sets of non-crossing edges, is $Θ_k((\log n/\log \log n)^{1/k})$, resp. $Θ_k((\log n)^{1/(k + 1)})$.

fields
Combinatorics
pdf ↗ page arXiv:2509.17835 ↗

Pipeline-parallel distributed optimization is essential for large-scale machine learning but is challenged by significant communication overhead from transmitting high-dimensional activations and gradients between workers. Existing approaches often depend on impractical unbiased gradient assumptions or incur sample-size memory overhead. This paper introduces Clapping, a Communication compression algorithm with LAzy samPling for Pipeline-parallel learnING. Clapping adopts a lazy sampling strategy that reuses data samples across steps, breaking sample-wise memory barrier and supporting convergence in few-epoch or online regimes. Clapping comprises two variants including Clapping-FC and Clapping-FU, both of which achieve convergence without unbiased assumption for compressed gradient, effectively addressing compression error propagation in multi-worker settings. Numerical experiments validate the performance of Clapping across different tasks.

comments
71 pages
fields
Optimization and Control
pdf ↗ page arXiv:2509.19029 ↗

Let $d$ be a positive integer. In a previous article we established a bijective correspondence between the following classes of objects, considered up to the appropriate notion of equivalence: differential graded algebras (dg) with finite-dimensional $0$-th cohomology such that the canonical generator of their perfect derived category is a basic $d\ZZ$-cluster tilting object, and basic Frobenius algebras that are twisted $(d+2)$-periodic as bimodules. In this article, we prove a variant of our general correspondence for bimodule right Calabi–Yau dg algebras. A novel ingredient is a new cohomology theory which contains obstructions to the existence and uniqueness of minimal $A_\infty$-bimodule structures on a graded bimodule. As an application of our results, we obtain, to our knowledge, the first example of an algebraic triangulated category with a triangulated Calabi–Yau structure that cannot be lifted to a bimodule right Calabi–Yau structure on any of its dg enhancements.

comments
103 pages. v2: Corrected several small typos. Added new Section 7.3 on a non-enhanceable triangulated Calabi--Yau structure. v3: Editorial improvements. v4: Enhanced exposition, several small corrections. Subsection 7.3 is now Section 8. v5: Corrected Example 7.14, other minor edits
fields
Representation Theory
pdf ↗ page arXiv:2509.22625 ↗

The goal of this paper is to prove bilinear $L^p$ estimates for rough dispersive evolutions satisfying non-degeneracy and transversality assumptions. The estimates generalize the sharp Fourier extension estimates for the cone and the paraboloid. We obtain the sharp dependence on transversality and sharp up to endpoints $L^p$ range. To this end, we combine an axiomatic induction-on-scales with the construction of a wave packet parametrix for dispersive equations with $C^{1,1}$-coefficients by using the FBI transform.

comments
97 pages, minor corrections, results unchanged
fields
Analysis of PDEs
pdf ↗ page arXiv:2509.23551 ↗

Fix a polarised Calabi-Yau threefold $(X,H)$. We reduce a version of the Bayer-Macrì-Toda conjecture for $(X,H)$, which ensures the existence of Bridgeland stability conditions on $X$, to verifying a Brill-Noether-type inequality for curves on $X$. We then prove this inequality for a broad class of Calabi-Yau threefolds, including complete intersection Calabi-Yau threefolds in weighted projective spaces.

comments
37 pages, comments are very welcome. v3: Final version, to appear in Invent. Math
fields
Algebraic Geometry
pdf ↗ page arXiv:2509.24990 ↗

We find the (unique) largest subset of $\{0, 1, 2\}^n$ such that it contains no two elements, one of which is coordinatewise greater than the other, but strictly greater on at most $k$ coordinates. To do so, we decompose the cube into weighted chains. In Appendix B we present a new proof of Sperner's theorem we found while working on this problem.

comments
A new version rewritten to improve the exposition, and with links to AI-generated, human-verified formalisations of proofs
fields
Combinatorics
pdf ↗ page arXiv:2509.26493 ↗

In this paper, we study the random polynomial $p_n(ρ):=\prod_{j=1}^n (|z_j|-ρ)$, where the points $\{z_j\}_{j=1}^n$ are the eigenvalues of random normal matrices with a radially symmetric potential. We establish precise large $n$ asymptotic expansions for the moment generating function $\mathbb{E}\bigl[{\rm e}^{(u \operatorname{Im}\log p_n(ρ))/π} {\rm e}^{a\operatorname{Re}\log p_n(ρ)}\bigr]$, $u\in\mathbb{R}$, $a>-1$, where $ρ>0$ lies in the bulk of the spectral droplet. The asymptotic expansion is expressed in terms of parabolic cylinder functions, which confirms a conjecture of Byun and Charlier. This also provides the first free energy expansion of two-dimensional Coulomb gases with general circular root- and jump-type singularities. While the $a=0$ case has already been widely studied in the literature due to its relation to counting statistics, we also obtain new results for this special case.

journal
SIGMA 22 (2026), 106, 32 pages
fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2510.00843 ↗

We develop a mixed-precision iterative refinement framework for solving low-rank Lyapunov matrix equations $AX + XA^T + W =0$, where $W=LL^T$ or $W=LSL^T$. Via rounding error analysis of the algorithms we derive sufficient conditions for the attainable normwise residuals in different precision settings and show how the algorithmic parameters should be chosen. These conditions are independent of the choice of inner solver, provided that the prescribed residual accuracy is attained in the inner solves. Using the sign-function Newton iteration as the solver, we demonstrate that reduced precisions, such as half precision with unit roundoff $u_s$, can be used for Lyapunov equations with condition number of order $u_s^{-1}$ without compromising the attainable solution quality. The numerical experiments validate our error analysis, and we establish cost models to quantify the expected speedup for different low-to-high precision timing ratios. This work provides an algorithmic framework towards exploiting native low-precision hardware to accelerate low-rank Lyapunov solvers without sacrificing accuracy.

fields
Numerical Analysis
pdf ↗ page arXiv:2510.02126 ↗

We study Catalan semirings, which are additively idempotent semirings whose multiplicative semigroups belong to a natural family of transformation monoids known as Catalan monoids. There are two kinds of Catalan semirings, whose properties differ substantially. We address the Finite Basis Problem for individual Catalan semirings of each kind and their representations by Boolean triangular matrices. Furthermore, we characterize the varieties and pseudovarieties generated by all Catalan semirings of each kind.

comments
40 pages, 6 illustrations. The text of version 2 constitutes Section 2 of the present version
fields
Rings and Algebras, Combinatorics, Group Theory
pdf ↗ page arXiv:2510.05045 ↗

We study Dirichlet series arising as linear functionals on an inner product space of meromorphic functions and establish a relation between the discontinuities of the former on the boundary and the poles and zeros of the latter on the imaginary axis. As an example application of Delange's Tauberian theorem, it is shown that the conjectured asymptotic in the additive divisor problem follows conditionally on the non-vanishing of certain meromorphic functions on the imaginary axis.

comments
A uniform lower bound for the norm on the r.h.s. of (3.17) has not been given. This is crucial, and requires an additional argument
fields
Number Theory
pdf ↗ page arXiv:2510.06523 ↗

We provide a derivation of the one-dimensional fourth-order DLSS equation based on an interpretation as a chemical reaction network. We consider the rate equation on the discretized circle for a process in which pairs of particles occupying the same site simultaneously jump to the two neighboring sites; the reverse process involves pairs of particles at adjacent sites simultaneously jumping back to the site located between them. Depending on the rates, in the vanishing-mesh-size limit we obtain either the classical DLSS equation or a variant with nonlinear mobility of power type. Via EDP convergence, we identify the limiting gradient structure to be driven by entropy with respect to a generalization of diffusive transport with nonlinear mobility. Interestingly, the DLSS equation with power-type mobility shares qualitative similarities with the fast diffusion and porous medium equation, since we find traveling wave solutions with algebraic tails or compactly supported polynomials, respectively.

comments
38 pages, 2 figure. Accepted version. Comments welcome
fields
Analysis of PDEs, Mathematical Physics, Numerical Analysis
pdf ↗ page arXiv:2510.07149 ↗

In this paper, we propose \textit{general Chen's first inequality} for Riemannian maps between Riemannian manifolds and demonstrate its equality and sharpness via non-trivial examples. We also utilize this general inequality by establishing Chen's first inequalities when the target spaces are generalized complex and generalized Sasakian space forms, including real, complex, real Kähler, Sasakian, Kenmotsu, cosymplectic, and almost $C(α)$ space forms. In addition, we estimate $δ$-invariants under various hypotheses on these space forms. Finally, we validate our new approach by comparing particular results with those of existing approaches.

comments
Received 28 January 2026; received in revised form 17 September 2026; accepted 20 October 2026
journal
Indagationes Mathematicae (2026)
fields
Differential Geometry
pdf ↗ page arXiv:2510.10505 ↗

In this paper, we consider the one-dimensional interaction energy $\frac{1}{2}\int_{\mathbb{R}}(W*ρ)(x)dρ(x) + \int_{\mathbb{R}}U(x)dρ(x)$ where the interaction potential $W(x)= -\frac{|x|^b}{b},\,1\le b \le 2$ and the external potential $U(x)=\frac{|x|^4}{4}$, and $ρ$ is a compactly supported probability measure on the real line. Our main result shows that the minimizer is supported on two intervals when $1<b<2$, showing in particular how the support of the minimizer transits from an interval (when $b=1$) to two points (when $b=2$) as $b$ increases. As a crucial part of the proof, we develop a new version of the iterated balayage algorithm, the original version of which was designed by Benko, Damelin, Dragnev and Kuijlaars for logarithmic potentials in one dimension. We expect the methodology in this paper can be generalized to study minimizers of interaction energies in $\mathbb{R}^d$ whose support is possibly an annulus.

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

We study stationary solutions of McKean-Vlasov equations on the circle. We establish an exact equivalence between solutions of the stationary McKean-Vlasov equation and an infinite-dimensional quadratic system of equations over Fourier coefficients, allowing explicit characterization of stationary states in a sequence space rather than a function space. This framework provides a transparent description of local bifurcations, their periodicity and resonance structures, while accommodating singular potentials. We derive analytic expressions for the emergence, form and shape (supercritical, critical, subcritical or transcritical) of bifurcations involving possibly multiple Fourier modes and connect them with discontinuous phase transitions. We also characterize, under suitable assumptions, the detailed structure of the stationary bifurcating solutions through leading small-amplitude coefficients for arbitrarily many fixed Fourier modes. At the global level, we establish regularity and concavity properties of the free energy landscape, proving existence, compactness, and coexistence of globally minimizing stationary measures, and identifying discontinuous phase transitions with points of non-differentiability of the minimum free energy map. We apply the theory to the Noisy Mean-Field Transformer model, where we show how changing the inverse temperature $β$ affects the geometry of the infinitely many bifurcations from the uniform measure. We also discuss how increasing $β$ motivates the study of approximate multi-mode stationary profiles as candidates for a separate metastability analysis; persistence times require additional dynamical estimates. Moreover, we determine the exact threshold $β_0\simeq2.447$ separating continuous and discontinuous phase transitions in this model. The same threshold marks the change of the first bifurcation from supercritical to subcritical.

comments
46 pages, 5 figures, Theorem 2.7 strengthened
fields
Probability, Analysis of PDEs
pdf ↗ page arXiv:2510.20094 ↗

We introduce Morita equivalence to the study of Kleene algebras and modules. Classical characterizations of Morita-equivalent semirings such as having equivalent categories of modules and one semiring being a full idempotent corner of a finite matrix semiring over the other transfer easily to this new context. We also observe that Morita equivalence can be applied to extending and restricting scalars in Lindenbaum–Tarski algebras of propositional dynamic logics, and that an appropriately-defined category of generalized finite automata satisfies the property that when the underlying Kleene algebras are Morita equivalent then the corresponding categories of generalized automata are equivalent. But the signature results which we obtain relate to rigidity of Kleene algebras in this context. Specifically, every semiring that is Morita-equivalent to the semiring reduct of a Kleene algebra has a unique expansion to a Kleene algebra, and semiring bimodules witnessing Morita-equivalence of semirings which are reducts of Kleene algebras are already Kleene bimodules.

comments
29 pages; corrects issues found by LLM
fields
Logic
pdf ↗ page arXiv:2510.24993 ↗

We show that the heat kernel measures based at the north pole of the spheres $S^{N-1}(\sqrt N)$, with a properly scaled radius $\sqrt N$ and adjusted center, in the sense of finite-dimensional marginals, to a Gaussian measure on $\mathbb R^\infty$. In particular, in the direction of the base point, the variance of this limiting measure is $1-e^{-t}-te^{-t}$, and in the orthogonal directions, the variance is $1-e^{-t}$.

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

We prove new time decay estimates for the linearized $β$-plane equation near the Couette flow on the plane that combine inviscid damping and the dispersion of Rossby waves. Specifically, we show that the profiles of the velocity field components (i.e. $u(t,x+ty,y)$) decay pointwise on any compact set with polynomial rates. While mixing dominates for streamwise frequencies that are $O(1)$, dispersive effects need to be extracted for low streamwise frequencies that appear along a critical ray in frequency space.

comments
Simpler proof compared to v1
fields
Analysis of PDEs
pdf ↗ page arXiv:2511.00667 ↗

Permutations can be viewed as pairs of linear orders, or more formally as models over a signature consisting of two binary relation symbols. This approach was adopted by Albert, Bouvel and Féray, who studied the expressibility of first-order logic in this setting. We focus our attention on monadic second-order logic. Our results go in two directions. First, we investigate the expressive power of monadic second-order logic. We exhibit natural properties of permutations that can be expressed in monadic second-order logic but not in first-order logic. Additionally, we show that the property of having a fixed point is inexpressible even in monadic second-order logic. Secondly, we focus on the complexity of monadic second-order model checking. We show that there is an algorithm deciding if a permutation $π$ satisfies a given monadic second-order sentence $\varphi$ in time $f(|\varphi|, \operatorname{tw}(π)) \cdot n$ for some computable function $f$ where $n = |π|$ and $\operatorname{tw}(π)$ is the tree-width of $π$. On the other hand, we prove that the problem remains hard even when we restrict the permutation $π$ to a fixed hereditary class $\mathcal{C}$ with mild assumptions on $\mathcal{C}$.

comments
Accepted to Advances in Applied Mathematics
fields
Combinatorics, Logic
pdf ↗ page arXiv:2511.02386 ↗

We investigate the stability of homogeneous minimal submanifolds in two families of closed Einstein manifolds, the Page space $\mathbb{CP}^2 \# \overline{\mathbb{CP}^2}$ and the Sasaki-Einstein spaces $Y^{p,q}$, which are equipped with cohomogeneity-one Einstein metrics admitting the isometric action of $SU(2) \times U(1)$ and $U(1) \times U(1) \times SU(2)$ respectively. We determine all the homogeneous, minimal hypersurfaces and explicitly compute the spectrum of their associated stability operators and determine their index.

comments
13 pages, 1 figure; v2 (agrees with published version): 15 pages, 4 figures, substantial improvements and statement of Theorem 1.2 corrected
journal
Journal of Geometry and Physics 228 (2026) 105915
fields
Differential Geometry
pdf ↗ page arXiv:2511.05447 ↗

The Chapman–Enskog procedure provides the classical asymptotic connection between kinetic nonequilibrium and macroscopic viscous stress. The present work isolates its first-order kinetic-to-stress step as an explicit operator composition. The construction separates the leading-order streaming source, the collisional kinetic response, and the deviatoric second-moment projection into a single transport map. Under explicit solvability, coercivity and bounded-inverse, regularity, and controlled-remainder assumptions, this map is well defined and bounded; hypocoercive estimates may additionally be used in closing the conditional remainder bound. In particular, a nonzero first-order deviatoric stress requires a nonzero first-order kinetic correction, although the converse is not asserted. The result is not a new derivation of the Navier–Stokes constitutive law or viscosity coefficient; its contribution is to make the kinetic-to-macroscopic transport map and its analytic conditions explicit. A BGK example recovers the classical Newtonian constitutive relation.

journal
Transport Phenomena, 1(4): (2026)
fields
Analysis of PDEs
pdf ↗ page arXiv:2511.05514 ↗

This paper studies distributed adaptive estimation over sensor networks with partially unknown source dynamics. We present parallel continuous-time and discrete-time designs in which each node runs a local adaptive observer and exchanges information over a directed graph. For both time scales, we establish stability of the network coupling operators, prove boundedness of all internal signals, and show convergence of each node's estimate to the source despite model uncertainty and disturbances. We further derive input-to-state stability (ISS) bounds that quantify robustness to bounded process noise. A key distinction is that the discrete-time design uses constant adaptive gains and per-step regressor normalization to handle sampling effects, whereas the continuous-time design does not. A unified Lyapunov framework links local observer dynamics with graph topology. Simulations on star, cyclic, and path networks corroborate the analysis, demonstrating accurate tracking, robustness, and scalability with the number of sensing nodes.

comments
This version is accepted for publication in the 2026 IFAC World Conference
fields
Dynamical Systems
pdf ↗ page arXiv:2511.07646 ↗

This paper develops robust inference methods for predictive regressions that address key challenges posed by endogenously persistent or heavy-tailed regressors, as well as persistent volatility in errors. Building on the Cauchy estimation framework, we propose two novel tests: one based on $t$-statistic group inference and the other employing a hybrid approach that combines Cauchy and OLS estimation. These methods effectively mitigate size distortions that commonly arise in standard inference procedures under endogeneity, near nonstationarity, heavy tails, and persistent volatility. The proposed tests are simple to implement and applicable to both continuous- and discrete-time models. Extensive simulation experiments demonstrate favorable finite-sample performance across a range of realistic settings. An empirical application examines the predictability of excess stock returns using the dividend-price and earnings-price ratios as predictors. The results suggest that the dividend-price ratio possesses predictive power, whereas the earnings-price ratio does not significantly forecast returns.

fields
Statistics Theory
pdf ↗ page arXiv:2511.09249 ↗

In this article we prove semiglobal stabilization and exact controllability results for semilinear plate equations with hinged boundary conditions and analytic nonlinearity, when the damping or control acts on a region where the linear Schrödinger equation is observable. At the core of these results lies a new unique continuation property for the nonlinear plate equation, which significantly relaxes the geometric conditions required for such a property to hold. This property is obtained by combining recent results on propagation of analyticity in time and unique continuation for linear plate operators. More broadly, our approach exploits the linear observability of the plate equation to establish both stabilization and control results. First, we prove exponential decay of the nonlinear energy under a defocusing assumption on the nonlinearity. Second, under a weaker asymptotic assumption on the nonlinearity, we prove semiglobal exact control by analyzing control properties inside the compact attractor provided by the dynamics of the damped equation.

comments
v2: Introduction re-written to better position the results within the literature. Section 2 better organizes preliminaries and Corollary 2.7 corrected (previously Corollary 2.6). Section 4.2 added comment on convergence toward equilibria. Several minor corrections and clarifications added (analyticity hypothesis, proof of Theorem 1.1 and various passages of Section 5)
fields
Analysis of PDEs, Optimization and Control
pdf ↗ page arXiv:2511.17468 ↗

We study neural-network approximation of density functionals in a Banach-space setting. Since the exact continuum functionals are discontinuous in the natural density topology, we apply $p$-Moreau-Yosida regularization. We construct finite-rank ReLU networks that preserve convexity and nonnegativity, lie below the regularized functional, and approximate it uniformly on compact sets. For energies obtained by minimization over compact density sets, we account exactly for the energy shift caused by regularization and bound the remaining error by the localization on these compact sets and network approximation errors. We apply this framework to canonical and grand-canonical density-functional theory at fixed particle number and fixed mean particle number, respectively. We obtain uniform energy convergence on norm-compact classes of external potentials, including molecular Coulomb potentials. We illustrate our results through numerical experiments on a simple model system.

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

We introduce a modified CBO model based on a regularized Gibbs weight. For each fixed temperature and regularization parameter, the regularized weight yields a configuration-independent lower bound on the denominator of the consensus map, thus a quantitative analysis without an upper bound on the objective function or cutoff in the noise. We first prove large-time consensus for the finite-particle system: above an explicit stability threshold, every particle converges exponentially to a common random limit. This consensus mechanism does not require the $C^2$ condition used in the direct weighted-energy argument. We next prove uniform-in-time propagation of chaos: we derive quantitative bounds for the finite-particle consensus point from finite-time concentration estimates for the mean-field law, with explicit approximation and large-time tail errors. The synchronous-coupling estimate also gives a quantitative comparison between the random particle consensus point and the deterministic mean-field consensus point. We also quantify the regularization error in the quantitative Laplace principle, making the effect of the additive regularization explicit. A direct weighted-energy estimate is obtained under stronger $C^2$ assumptions. Furthermore, we give a stopped quadratic stability estimate with the actual Gibbs denominator. Under the weak-landscape condition, full support of the initial law, and local nondegeneracy of the minimizer, we prove a high-probability finite-particle global-optimization theorem for any fixed $λ>σ^2$. The proof combines an affine-flow local-mass estimate, finite-time mean-field entrance, ordinary finite-horizon propagation of chaos, and an $α$-independent convex trapping energy near the minimizer.

comments
The abstract/structure of the paper has been revised, and a probabilistic finite-particle result has been added under an additional set of assumptions
fields
Probability, Analysis of PDEs, Optimization and Control
pdf ↗ page arXiv:2511.19116 ↗

This work presents conjectures about eigenvalues of matrices associated with $k$-path graphs, the algebraic connectivity, defined as the second smallest eigenvalue of the Laplacian matrix, and the $α$-index, as the largest eigenvalue of the $A_α$-matrix. For this purpose, a process based on [Discrete Applied Mathematics 164 (2014) 297-303] is presented to generate lists of $k$-path graphs containing all non-isomorphic 2-paths, 3-paths, and 4-paths of order $n$, for $6 \leq n \leq 26, 8 \leq n \leq 19$, and $10 \leq n \leq 18$, respectively. Using these lists, exhaustive searches for extremal graphs of fixed order for the mentioned eigenvalues were performed. Based on the empirical results, conjectures are suggested about the structure of extremal $k$-path graphs for these eigenvalues.

comments
DOI: 10.1051/ro/2026105
fields
Combinatorics
pdf ↗ page arXiv:2511.21524 ↗

Let $0 \leq α< n$, $N \in \mathbb{N}$, and let $X$ and $Y$ be ball quasi-Banach function spaces on $\mathbb{R}^n$. We consider operators $T_α$ defined by convolution with kernels of type $(α, N)$. Assuming that the powered Hardy-Littlewood maximal operator satisfies a Fefferman-Stein vector-valued maximal inequality on $X$ and is bounded on the associated space, we prove that, for $α= 0$, $T_0$ extends to a bounded operator $H_{X}(\mathbb{R}^n) \to X$ and $H_{X}(\mathbb{R}^n) \to H_{X}(\mathbb{R}^n)$; and for $0 < α< n$, under certain additional assumptions on $X$ and $Y$, $T_α$ extends to a bounded operator $H_{X}(\mathbb{R}^n) \to Y$ and $H_{X}(\mathbb{R}^n) \to H_{Y}(\mathbb{R}^n)$. In particular, these results yield the corresponding estimates for singular integral operators and Riesz potentials. We also provide an off-diagonal Fefferman-Stein vector-valued inequality for the fractional maximal operator on the $p$-convexification of ball quasi-Banach function spaces.

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

We extend Peng's maximum principle to the case of stochastic delay differential equations of mean-field type. More precisely, the coefficients of our control problem depend on the state, on the past trajectory and on its expected value. Moreover, the control enters the noise coefficient and the control domain may be non-convex. Our approach is based on a lifting of the state equation to an infinite dimensional Hilbert space that removes the explicit delay in the state equation. The main ingredient in the proof of the maximum principle is a precise asymptotic for the expectation of the first order variational process, which allows us to neglect the corresponding second order terms in the expansion of the cost functional.

comments
Accepted for publication in Appl. Math. Optim
fields
Probability, Optimization and Control
pdf ↗ page arXiv:2512.00934 ↗

We study the dynamical Teichmüller space ${\mathcal T}(U,f)$ associated to a wandering domain $U$ of an entire function $f$. We show that a discrete grand orbit relation in $U$ forces ${\mathcal T}(U,f)$ to be infinite dimensional, thereby answering a question of Fagella–Henriksen. We further describe the geometry of these spaces by developing normal forms for the dynamics on wandering domains, yielding global linearising coordinates in the discrete case and power-type dynamics between annuli in the indiscrete case.

comments
22 pages. V2: Author accepted manuscript. To appear in IMRN
fields
Dynamical Systems
pdf ↗ page arXiv:2512.01136 ↗

In this paper we deal with a subclass of chordal graphs, which are simultaneously strictly chordal and interval, the strictly interval graphs. We present a new characterization of the class that leads to a simple linear recognition algorithm. Next we introduce a new subclass of strictly interval graphs, the $SI$-core graphs, that are non-split and non-cograph graphs and show that several elements of the new class are Laplacian integral

fields
Combinatorics
pdf ↗ page arXiv:2512.01175 ↗

We obtain an estimate for the expected subspace robust 2-Wasserstein distance between any probability measure with a finite q-th moment (q>2) defined on a separable Hilbert space, and its empirical distribution from $n$ i.i.d. samples.

comments
v2: main theorem extended to probability measures with bounded q-th moment and general k; lower bound sharpened; refinements under spectral decay added
fields
Probability
pdf ↗ page arXiv:2512.04462 ↗

For a degree $5$ real polynomial with roots $x_1\leq \cdots \leq x_5$ and roots $ξ_1\leq \cdots \leq ξ_4$ of its derivative, we set $z_j:=(x_j+x_{j+1})/2$, $1\leq j\leq 4$. We prove that one cannot have at the same time $\min_{1\leq j\leq 3}(z_{j+1}-z_j)\geq \min_{1\leq j\leq 3}(ξ_{j+1}-ξ_j)$ and $\max_{1\leq j\leq 3}(z_{j+1}-z_j)\geq \max_{1\leq j\leq 3}(ξ_{j+1}-ξ_j)$. The result settles a general question about midpoints and critical points of hyperbolic polynomials.

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

Let $G$ be a groupoid acting on a set $X$ and let $R$ be a $G$-graded ring with graded local units. We study the main properties of the category $gr-(R,G,X)$ of $X$-graded $R$-modules and adjoint functors between categories of this kind. We characterize the latter in terms of tensor-like and hom-like functors. As an application we obtain a characterization of equivalences between such categories in the spirit of Morita theory. Then we introduce restriction and induction functors between categories of type $gr-(R,G,X)$ and show that many functors between such categories can be realized naturally as a restriction or induction functor. This includes the forgetful functor, the functor associating a $G$ graded $R$-module with the $H$-graded module formed by the sum of the homogeneous components of degree in subgroupoid $H$, and the one associating it with the collapsing of homogeneous components in cosets modulo $H$ for $H$ a wide subgrupoid. We characterize when a restriction or induction functor is an equivalence of categories. Finally, we prove that $gr-(R,G,X)$ is always equivalent to the category of modules over a ring with local units and, generalizing a result of Menini and Năstăsescu, we characterize when $gr-(R,G,X)$ is equivalent to the category of modules over a unital ring.

comments
26 pages. We corrected some mistakes and fixed typos
fields
Rings and Algebras
pdf ↗ page arXiv:2512.07722 ↗

Let $p$ be a prime number. If a number field $k$ has at least one complex place, there are infinitely many $\mathbb{Z}_p$-extensions over $k$, and some authors studied the behavior of Iwasawa invariants of these $\mathbb{Z}_p$-extensions. In particular, Fujii studied the case where $k$ is an imaginary quadratic field and obtained some results on the boundedness of Iwasawa $λ$-invariants in a certain infinite family of $\mathbb{Z}_p$-extensions. In the present article, we give analogous theorems in the case where $k$ is a quartic CM-field. One of our main theorems determines all the Iwasawa invariants, including the $ν$-invariants, of a certain infinite family of $\mathbb{Z}_p$-extensions over a quartic CM-field.

comments
14 pages
journal
J. Number Theory 289 (2026), 96-113
fields
Number Theory
pdf ↗ page arXiv:2512.08278 ↗

A margin-free measure of bivariate association generalizing Spearman's rho to the case of non-monotonic dependence is defined in terms of two square integrable functions on the unit interval. Properties of generalized Spearman correlation are investigated when the functions are piecewise continuous and strictly monotonic, with particular focus on the special cases where the functions are drawn from orthonormal bases defined by Legendre polynomials and cosine functions. For continuous random variables, generalized Spearman correlation is treated as a copula-based measure and shown to depend on a pair of uniform-distribution-preserving (udp) transformations determined by the underlying functions. Bounds for generalized Spearman correlation are derived and a novel technique referred to as stochastic inversion of udp transformations is used to construct singular copulas that attain the bounds and parametric copulas with densities that interpolate between the bounds and model different degrees of non-monotonic dependence. Sample analogues of generalized Spearman correlation are proposed and their asymptotic properties are investigated. Potential applications of the theory are demonstrated including: exploratory analyses of the dependence structures of datasets and their symmetries; elicitation of functions maximizing generalized Spearman correlation via expansions in orthonormal basis functions; and construction of tractable probability densities to model a wide variety of non-monotonic dependencies.

fields
Statistics Theory
pdf ↗ page arXiv:2512.10828 ↗

We study the topology of circularly ordered sets. While the algebraic notion is classical, the general topological theory has received comparatively little attention. In this work we provide a self-contained topological exposition and present several new directions and results. Our aim is to initiate a systematic study of generalized circularly ordered topological spaces and of continuous group actions on them. Provide a convex uniform structure description of circularly ordered compactifications. This yields a topological analysis of Novak's regular completion and its uniformity. Demonstrate that this uniform-structure approach yields several new results in the theory of $G$-compactifications for topological group actions on abstract ordered spaces. Reexamine functions of bounded variation on circularly ordered sets and prove generalizations of Helly's selection theorem (for circular and linear orders). These developments and the systematic analysis of circular order topologies are motivated by recent applications in topological dynamics, particularly in joint works with Eli Glasner.

comments
50 pages
fields
General Topology, Dynamical Systems, Functional Analysis
pdf ↗ page arXiv:2512.17314 ↗

Uniqueness for stochastic PDEs with drift in differential form is a main open problem in the recent literature on regularisation by noise. This paper establishes a self-contained theory in the framework of stochastic evolution equations on separable Hilbert spaces and provides a first result to address such an issue, in the direction of both pathwise and weak uniqueness, as well as continuous dependence on the initial data. The singularity of the drift allows to achieve novel uniqueness results for several classes of examples, ranging from fluid-dynamics to phase-separation models.

comments
49 pages
fields
Probability, Analysis of PDEs
pdf ↗ page arXiv:2512.17736 ↗

We introduce a new type of Mean Field Game epidemiological models, in which subpopulations have different behavioral patterns: some people exhibit a type of ``rational'' self interested behavior by choosing Nash-equilibrium long-term strategies while others follow pre-specified ``non-rational'' patterns (e.g., either sticking to their usual habits or trying to mimic those around them). Our new B-MFG models allow for occasional behavioral switches, which rational individuals also take into account when formulating their Nash-equilibrium strategies. Although this modeling approach is general, here we develop it for individuals choosing their ``contact rates'' within a particular Susceptible-Infected-Recovered-Susceptible-Dead (SIRSD) epidemic model. The latter is based on a frequency-based force of infection with proportionate mixing and the mortality rate that rapidly increases once the proportion of infected individuals exceeds some prescribed threshold, resulting in a strain on medical resources. Numerical tests illustrate the properties of our model and highlight the ways in which additional/non-rational behavioral patterns and behavioral switching increase the impact of infectious diseases. The paper aims to build a bridge between two distinct communities of epidemiological modelers and to promote the consideration of behavioral patterns in broader Mean Field Games literature.

comments
45 pages; 13 figures; 2 appendices
fields
Optimization and Control
pdf ↗ page arXiv:2512.20547 ↗

A pair of integers is called amicable if each number equals the sum of the proper divisors of the other. In this paper, we investigate a broader class of integer pairs $(A, B)$ that satisfy the weaker condition $σ(A) = σ(B)$, where $σ$ is the sum-of-divisors function. We focus on pairs whose greatest common divisor is a power of two and analyze their distinct prime factorizations. Specifically, we consider configurations of the forms $(A=2^n ab,\ B=2^n cd)$, $(A=2^n abc,\ B=2^n de)$, and $(A=2^n abc,\ B=2^n def)$, where the factors are odd primes. For each configuration, we derive explicit symmetric identities that must be satisfied. These identities relate the odd prime factors of $A$ and $B$ to the quantity $\varphi(A)+\varphi(B)$, where $\varphi$ denotes Euler's totient function. As a consequence, these relations provide necessary structural constraints for amicable pairs of these specific forms, while also revealing an underlying algebraic symmetry for any pair with equal divisor sums.

comments
13 pages
fields
History and Overview
pdf ↗ page arXiv:2512.22319 ↗

We study a phenomenological electropermeabilization model in a periodic medium representing biological tissue. Starting from a cell-level model describing the electric potential and the degree of poration, we perform dimensional analysis to identify a relevant scaling in terms of a small parameter $\varepsilon$ - the ratio between the cell and the tissue size. The electric potential satisfies electrostatic equations in the extra- and intracellular domains, while its jump across the cell membrane evolves according to a nonlinear law coupled with an ordinary differential equation for the poration degree. We prove the well-posedness of the microscopic problem, derive a priori estimates, obtain formal asymptotics, and rigorously justify the expansion by combining two-scale convergence with monotonicity arguments. The resulting macroscopic model exhibits memory effects and a nonlinear, time-dependent effective current. It captures the nontrivial evolution of effective conductivity, including a characteristic drop reflecting the capacitive behavior of the lipid bilayer, in agreement with experimental data. Numerical computations of the effective conductivity confirm that, although the intracellular and extracellular bulk conductivities are constant, tissue conductivity varies nonlinearly with electric field strength, showing a sigmoid trend.

comments
40 pages, 9 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2512.23007 ↗

We describe the spectrum of ordinary Diophantine exponents for $d$-dimensional lattices. The result reduces the problem to two-dimensional case and uses argument of metric theory.

comments
Minor AI suggested corrections of inaccuracies in the final version of the manuscript
fields
Number Theory
pdf ↗ page arXiv:2512.24913 ↗

We develop a theory of polymatroids on Stallings core graphs, and prove a gap theorem. As special cases of it, we prove the gap conjecture of Ernst-West, Puder, Seidel and the author on the stable $K$-primitivity rank (using a forthcoming result of Ernst-West and Puder); prove Reiter's conjecture on word-random subgroups of finite groups; improve Bowen's bounds on the $f$-invariant for p.m.p. actions of free groups in which a generating partition has a non-cyclic stabilizer, deducing coalescence; and extend the proof of Wise's $w$-cycle conjecture by Louder and Wilton to not-necessarily-cyclic subgroups, which gives a new proof of this special case of the Friedman-Mineyev theorem (i.e. the Hanna Neumann conjecture). Louder and Wilton further improved the bound in Wise's conjecture via their "dependence theorem"; in an appendix joint with Noam Ta Shma, we extend this improvement too to not-necessarily-cyclic subgroups, again as a special case of the main gap theorem. We also compute the exact decay rate of the expected number of invariant subsets, respectively subspaces, for word-random subgroups of $S_n$, respectively $\mathrm{GL}_n(\mathbb{F}_q)$.

comments
56 pages. v2: substantially revised and extended, with a new abstract: new applications to Bowen's f-invariant and to the dependence theorem of Louder and Wilton (in an appendix joint with Noam Ta Shma). Appendices contributed by Doron Puder and Andrei Jaikin-Zapirain
fields
Group Theory
pdf ↗ page arXiv:2601.00053 ↗

This paper introduces a unified profile quasi-likelihood framework for generalised linear models built on a topologically complete extension to Kendall's $τ$ with finite sample power and Type-I error rates. By establishing equivalence between continuous $L^2$ profile estimators and discrete Generalized Gibbs exponential families, we prove local asymptotic minimax efficiency over the copula tangent space. The framework yields monotone-affine invariant inference, sub-Gaussian concentration bounds, and exact finite-sample $t$-pivot tail majorization under arbitrary tie configurations. We illustrate the methodology through three canonical applications: bivariate rank correlation, paired testing, and intraclass correlation.

fields
Statistics Theory
pdf ↗ page arXiv:2601.00188 ↗

Inference-time alignment for diffusion models aims to adapt a pre-trained reference diffusion model toward a target distribution without retraining the reference score network, thereby preserving the generative capacity of the reference model while enforcing desired properties at inference time. A central mechanism for achieving such alignment is guidance, which modifies the sampling dynamics through an additional drift term. In this work, we introduce variationally stable Doob's matching, a novel framework for provable guidance estimation grounded in Doob's $h$-transform. Our approach formulates guidance as the gradient of the logarithm of an underlying Doob's $h$-function and employs gradient-regularized regression to simultaneously estimate both the $h$-function and its gradient, resulting in a consistent estimator of the guidance. Theoretically, we establish non-asymptotic convergence rates for the estimated guidance. Moreover, we analyze the resulting controllable diffusion processes and prove non-asymptotic convergence guarantees for the generated distributions in the Wasserstein-2 distance. Finally, we show that variationally stable guidance estimators are adaptive to unknown low dimensionality, effectively mitigating the curse of dimensionality under low-dimensional linear subspace assumptions. Numerical experiments demonstrate the effectiveness of our proposed method and show the advantages compared to the baselines.

fields
Numerical Analysis, Optimization and Control, Statistics Theory
pdf ↗ page arXiv:2601.06514 ↗

Econometric applications with multi-way clustering often feature a small number of effective clusters or heavy-tailed data, making standard cluster-robust and bootstrap inference unreliable in finite samples. In this paper, we develop a framework for finite-sample valid permutation inference in linear regression with multi-way clustering under an assumption of conditional exchangeability of the errors. Our assumption is closely related to the notion of separate exchangeability studied in earlier work, but can be more realistic in many economic settings as it imposes minimal restrictions on the covariate distribution. We construct permutation tests of significance that are valid in finite samples and establish theoretical power guarantees, in contrast to existing methods that are justified only asymptotically. While our main presentation is under exchangeable errors, our framework encompasses invariance-based tests that remain valid under general forms of heteroskedastic errors. We also extend our methodology to settings with missing data and derive power results that reveal phase transitions in detectability. Through simulation studies, we demonstrate that the proposed tests maintain correct size and competitive power, while standard cluster-robust and bootstrap procedures can exhibit substantial size distortions.

comments
60 pages, 6 figures
fields
Statistics Theory
pdf ↗ page arXiv:2601.08610 ↗

We study the local convergence of nonlinear inverse iterations for eigenvalue problems arising from variational energies that are invariant under global phase rotations. This symmetry introduces an inherent degeneracy of the target eigenvalue, preventing the direct application of existing convergence results that require a simple eigenvalue. Within an abstract variational framework, we investigate a shifted Jacobian-based inverse iteration, known as the J-method, and establish its local convergence to quasi-isolated ground states. Our analysis shows that the target eigenvalue of the J-operator has algebraic and geometric multiplicity exactly two. By introducing an auxiliary iteration that fixes the global phase, we prove local linear convergence of the iterates modulo phase rotations and derive sharp convergence rates in terms of the spectrum of the J-operator. In particular, these rates can be improved through spectral shifting. We apply the abstract theory to a generalized Gross-Pitaevskii equation that models spin-orbit coupled Bose-Einstein condensates, verify the relevant structural assumptions and numerically examine the quasi-isolation of the computed ground states. Numerical experiments demonstrate the effectiveness of the shifted J-method, particularly in regimes with slowly converging conventional inverse iterations.

fields
Numerical Analysis
pdf ↗ page arXiv:2601.08990 ↗

Chip-firing on a directed graph is a game in which chips, a discrete commodity, are placed on the vertices of the graph and are transferred between vertices. In this paper, we study a chip-firing game on the lattice of nonnegative integer points on the $x$-$y$ plane, where we start with $2^n$ chips at the origin. When we fire a vertex $v$, we send one chip to each out-neighbor. We fire until we reach a stable configuration, a distribution of chips where no vertex can fire. We study the intermediate firing configuration: a table that assigns to each vertex the total number of chips that reach it. We prove that the nonzero entries of the stable configuration correspond to the odd entries of the intermediate firing configuration. The intermediate firing configuration consists of three parts: the top triangle, the midsection, and the bottom triangle. We describe properties of each part. We study properties of each row and the number of rows of the intermediate firing configuration. We also explore properties of the difference tables, which are tables of first differences of each row of the intermediate firing configuration.

comments
22 pages, 11 figures, revisions were made throughout the paper
fields
Combinatorics
pdf ↗ page arXiv:2601.09125 ↗

Let $A$ be the algebra $\mathbf{C}[X_1^{\pm 1},X_2^{\pm 1}]$ and $Q(A)$ its quotient field. In this short article we exhibit the correct normalization for the toric period on the parabolically induced unramified family over $Q(A)$, so that it behaves optimally under restriction to the parabolically induced unramified family over $A$. Finally, we explicitly describe the structure of the $A$-module given by the image of this normalized period. These results answer questions raised by D. Prasad, and point towards potential generalizations to a broader unramified Gan-Gross-Prasad setting.

comments
Revised version, to appear in Proc. Indian Acad. Sci. (Math. Sci.)
fields
Number Theory, Representation Theory
pdf ↗ page arXiv:2601.09418 ↗

Low-Earth orbit (LEO) mega-constellations are emerging as high-capacity backbones for next-generation Internet. Deployment of laser terminals enables high-bandwidth, low-latency inter-satellite links (ISLs); however, their limited number, slow acquisition, and instability make forming a stable satellite topology difficult. Existing patterns like +Grid and Motif ignore regional traffic, ground station placement, and constellation geometry. Given sparse population distribution on Earth and the isolation of rural areas, traffic patterns are inherently non-uniform, providing an opportunity to orient inter-satellite links (ISLs) according to these traffic patterns. In this paper, we propose Starfield, a novel demand-aware satellite topology design heuristic algorithm supported by mathematical analysis. We first formulate a vector field on the constellation's shell according to traffic flows and define a corresponding Riemannian metric on the spherical manifold of the shell. The metric, combined with the spatial geometry, is used to assign a distance to each potential ISL, which we then aggregate over all demand flows to generate a score for each satellite's link selection. Inspired by +Grid, each satellite selects the link with the minimum Riemannian distance along with its corresponding angular links. To evaluate Starfield, we developed a custom, link-aware, and link-configurable packet-level simulator, comparing it against LAMP, +Grid, Motif, and Random topologies. For the Phase 1 Starlink, simulation results show up to a 30% reduction in hop count and a 15% improvement in stretch factor across multiple traffic distributions. Moreover, static Starfield, an inter-orbital link matching modification of Starfield, achieves a 15% improvement in stretch factor under realistic traffic patterns compared to +Grid. Experiments demonstrate Starfield's robustness under traffic demand perturbations.

comments
31 pages, 12 figures, 3 Tables, 1 Algorithm
fields
Differential Geometry
pdf ↗ page arXiv:2601.10083 ↗

We exploit the variational and Hamiltonian structures of quantum hydrodynamics with spin to unfold the correlation and torque mechanisms accompanying spin-orbit coupling (SOC) in electronic motion. Using Hamilton's action principle for the Pauli equation, we isolate SOC-induced quantum forces that act on the orbital Madelung–Bohm trajectories and complement the usual force terms known to appear in quantum hydrodynamics with spin. While the latter spin-hydrodynamic forces relate to the quantum geometric tensor (QGT), SOC-induced orbital forces originate from a particular current operator that contributes prominently to the spin current. This distinction between force terms reveals two fundamentally different mechanisms generating quantum spin-orbit correlations. Leveraging the Hamiltonian structure of the hydrodynamic system, we also elucidate spin transport features such as the correlation-induced quantum torques and the current shift in the spin Hall effect. This Hall shift leads to a new definition of the transport spin current thereby addressing an open question in spintronics. Finally, we illustrate the framework via the Madelung–Rashba equations for planar SOC configurations and propose a particle closure for possible numerical implementations.

comments
Slightly expanded version. 28 pages. Comments welcome
fields
Mathematical Physics
pdf ↗ page arXiv:2601.10698 ↗

We compute icanonical basis of the quasi-split rank one modified iquantum group, by obtaining explicit transition matrices among the icanonical basis, monomial basis, and standardized canonical basis; all these bases can be naturally categorified. These transition matrices follow from their counterparts computed in this paper among the icanonical basis, monomial basis, and canonical basis on simple finite-dimensional modules of quantum $\mathfrak{sl}_3$.

comments
v2: 43 pages, major revision, formulated uniform transition formulas between monomial and icanonical bases including previously separate boundary cases b=a+c (the old boundary case formulas were incorrect due to sign error in results in the literature); full transition formula from icanonical to canonical bases
fields
Quantum Algebra, Representation Theory
pdf ↗ page arXiv:2601.13482 ↗

In this paper we introduce and study diagolinear categories. These are pointed categories equipped with sum-like and product-like monoidal structures, where diagonal matrices of morphisms between two sequences of objects are (uniquely) realizable as morphisms from the sum of the first sequence to the product of the second sequence. We formulate and prove the coherence theorem for diagolinear categories and study the universal construction that realizes also the non-diagonal matrices (equivalently, turns the two monoidal structures into actual categorical sum and product). We also compare diagolinear categories with duoidal categories.

comments
We have renamed "prelinear" to "diagolinear" to reflect that diagonal matrices realize morphisms here. In this version we have isolated this part of the project and included new results on a reflection to bicartesian categories and a number of examples. In follow-up papers, we will include the other topics presented in the original paper: partially linear categories and centrality in that context
fields
Category Theory
pdf ↗ page arXiv:2601.14237 ↗

In recent years, Rectified flow (RF) has gained considerable popularity largely due to its generation efficiency and state-of-the-art performance. In this paper, we investigate how well RF automatically adapts to the intrinsic low dimensionality of the support of the target distribution to accelerate sampling. We show that, using a carefully designed \blue{end-point adapted} time-discretization scheme and with sufficiently accurate drift estimates, the RF sampler enjoys an iteration complexity of order $O(k/\varepsilon)$ (up to log factors), where $\varepsilon$ is the precision in total variation distance and $k$ is the intrinsic dimension of the target distribution. In addition, we show that the denoising diffusion probabilistic model (DDPM) procedure is equivalent to a stochastic version of RF by establishing a novel connection between these processes and stochastic localization. Building on this connection, we further design a stochastic RF sampler that also adapts to the low-dimensionality of the target distribution under mild requirements on the accuracy of the drift estimates, and also with a specific time schedule. We illustrate the efficacy of newly designed time-discretization schedules with simulations on the synthetic data and text-to-image (T2I) data experiments.

comments
48 pages, 7 figures
fields
Statistics Theory
pdf ↗ page arXiv:2601.15500 ↗

We extend earlier results of Azzam on the dimension drop of the harmonic measure for a domain $Ω\subset \R^{n}$ with $n\geq 3$, with dimensional Ahlfors regular boundary $\partialΩ$ of dimension $s$ with $n-1-δ_0 \leq s\leq n-1$, that is uniformly non flat. Here $δ_0$ is a small positive constant dependent on the parameters of the problem. Our novel construction relies on elementary geometric and potential theoretic considerations. We avoid the use of Riesz transforms and compactness arguments, and also give quantitative bounds on the $δ_0$ parameter.

comments
corrected minor errors and typos
fields
Analysis of PDEs, Classical Analysis and ODEs
pdf ↗ page arXiv:2601.16167 ↗

We construct bisymmetric, partially strictly increasing binary operations on real intervals which are not continuous. This shows that continuity cannot be removed from the classical characterization of bisymmetric quasi-sums due to Aczél and Dhombres. Our examples are operations of the form \[ F(x,y)=f^{-1}(αf(x)+βf(y)), \] where $α,β>0$ and $α+β\neq1$. The generating map $f$ is chosen as a strictly increasing bijection from an interval onto a two-component subset of $\mathbb{R}$ separated by a gap. The range is directly invariant under the relevant weighted sums, while the gap produces a jump of $f$ and hence discontinuity of every one-variable section. As a consequence, we obtain discontinuous associative and strictly increasing operations on intervals, and we extend the construction to the multivariate case. In the opposite direction, we prove that if a symmetric bisymmetric strictly increasing operation is reflexive at two points of an interval, then it is automatically continuous on the segment between them and coincides there with a quasi-arithmetic mean.

comments
19 pages
fields
General Mathematics
pdf ↗ page arXiv:2601.16247 ↗

We develop the moment map theory of the twisted scalar curvature of a Kähler metric. Primarily, we introduce a coupled system of equations on a holomorphic submersion intertwining the twisted scalar curvature of a Kähler metric on the base and the fibrewise scalar curvature of a relatively Kähler metric on the total space. This resulting system can be viewed as producing the natural coupled metric geometry of holomorphic submersions, and we show that this system appears canonically as a moment map. The approach generalises to foliations, where we prove similar results.

comments
v2. Minor edits. To appear in Math. Zeit
fields
Differential Geometry, Symplectic Geometry
pdf ↗ page arXiv:2601.18141 ↗

We introduce the notion of the $\infty$-category of (complete) derived $G$-graded modules over a $G$-graded ring $R$ for a torsion-free abelian group $G$, and we study its foundational properties. Moreover, we prove a categorical equivalence between (complete) derived $G$-graded modules over $R$ and derived (formal) comodules over a certain comonad constructed from the group ring $R[G]$ of $G$ over $R$.

comments
42 pages; Lemma 5.1 in v2 is false, which required major revision. The revised material appears in Sections 5 and 6 of this version
fields
Commutative Algebra, Algebraic Geometry
pdf ↗ page arXiv:2601.19164 ↗

We present a new geometric perspective on quantum error correction based on spectral triples in noncommutative geometry. In this approach, quantum error correcting codes are reformulated as low energy spectral projections of Dirac type operators that separate global logical degrees of freedom from local, correctable errors. Locality, code distance, and the Knill Laflamme condition acquire a unified spectral and geometric interpretation in terms of the induced metric and spectrum of the Dirac operator. Within this framework, a wide range of known error correcting codes including classical linear codes, stabilizer codes, GKP type codes, and topological codes are recovered from a single construction. This demonstrates that classical and quantum codes can be organized within a common geometric language. A central advantage of the spectral triple perspective is that the performance of error correction can be directly related to spectral properties. We show that leakage out of the code space is controlled by the spectral gap of the Dirac operator, and that code preserving internal perturbations can systematically increase this gap without altering the encoded logical subspace. This yields a geometric mechanism for enhancing error correction thresholds, which we illustrate explicitly for a stabilizer code. We further interpret Berezin Toeplitz quantization as a mixed spectral code and briefly discuss implications for holographic quantum error correction. Overall, our results suggest that quantum error correction can be viewed as a universal low energy phenomenon governed by spectral geometry.

comments
76 pages, 2 figures
fields
Mathematical Physics, Quantum Algebra
pdf ↗ page arXiv:2601.19765 ↗

We study normalized solutions of $-\mathrm{div}(|x|^{-2a}\nabla u) = λ|x|^{-2a}u + β|x|^{-bq}|u|^{q-2}u + |x|^{-b2^\sharp}|u|^{2^\sharp-2}u$ in $\mathbb{R}^N$ with $\int_{\mathbb{R}^N}|x|^{-2a}u^2\,dx = ρ^2$, where $0 < a < \frac{N-2}{2}$, $a < b < a+1$, $2 < q < 2^\sharp$, and $2^\sharp$ is the critical Caffarelli-Kohn-Nirenberg exponent. Let $q_c$ denote the mass-critical exponent. For $2 < q < q_c$ and small $β> 0$, we obtain two positive radial solutions: a local minimizer with negative energy and a solution of mountain-pass type. For $q_c \le q < 2^\sharp$, there is a number $β_0 \ge 0$, defined through the energy level below which compactness holds, such that a positive radial ground state exists for every $β> β_0$. In the mass-critical case $q = q_c$, this holds for $β_0 < β< β^*$, where $β^*$ is explicit, and for $β\ge β^*$ the ground state level is zero and is not attained. Our main result is a necessary and sufficient condition on $N$, $a$, $b$ and $q$ for $β_0 > 0$. The condition holds only when $a$ is close to $\frac{N-2}{2}$, and it fails in the formal unweighted limit $a = b = 0$. When $β_0 > 0$, the ground state level is not attained for $0 < β< β_0$, and every normalized solution has energy above the compactness level. When $β_0 = 0$, we describe the behavior of ground states as $β\to 0$. The proofs combine the Pohozaev constraint, sharp estimates for the extremals of the Caffarelli-Kohn-Nirenberg inequality, and a blow-up analysis in Emden-Fowler variables.

fields
Analysis of PDEs
pdf ↗ page arXiv:2601.20513 ↗

In this paper, we focus on the problem of computing the set of diagonal transversal gates fixing a CSS code. We determine the logical actions of these gates and characterize the subgroups that induce tensor products of single-qubit logical gates and logical identities. We describe these groups through explicit linear equations given by componentwise products of basis vectors of the underlying classical codes, which is the key difference from previous approaches. We compute the complete set of diagonal transversal gates fixing the code, and of transversal logical gates, for any CSS code arising from monomial codes, a family that includes decreasing monomial codes and polar codes. As a consequence, we recover and extend some results in the literature on CSS-T codes, triorthogonal codes, and divisible codes. We also extend these results to diagonal gates acting transversally on several code blocks and use them to characterize addressable gates.

fields
Information Theory
pdf ↗ page arXiv:2601.21514 ↗

This paper is concerned with the approximation of continuously differentiable functions with high-dimensional input by a composition of two functions: a feature map that extracts few features from the input space, and a profile function that approximates the target function taking the features as its low-dimensional input. We focus on the construction of structured nonlinear feature maps, that extract features on separate groups of variables, using a recently introduced gradient-based method that leverages Poincaré inequalities on nonlinear manifolds. This method consists in minimizing a non-convex loss functional, which can be a challenging task, especially for small training samples. We first investigate a collective setting, in which we construct a feature map suitable to a parametrized family of high-dimensional functions. In this setting we introduce a new quadratic surrogate to the non-convex loss function and show an upper bound on the latter. We then investigate a grouped setting, in which we construct separate feature maps for separate groups of inputs, and we show that this setting is almost equivalent to multiple collective settings, one for each group of variables.

comments
34 pages, 4 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2602.01143 ↗

In this paper, a new class of Taylor-accelerated neural-network interpolation operators is introduced for quasi-uniform, irregularly distributed grids to reconstruct derivative-informed physical fields in both univariate and multivariate settings. The framework incorporates Taylor expansions within the neural network operators framework, allowing operators to efficiently utilize the smoothness of the target function. We determine the analytical properties of the proposed operators, including well-posedness, uniform boundedness, and exact interpolation at the sampling nodes. Additionally, we establish polynomial reproduction to a specified degree and provide Jackson-type error estimates based on higher-order moduli of smoothness, thereby improving convergence rates on quasi-uniform, irregular grids. The applicability of the method is demonstrated by reconstructing physical fields such as temperature, electromagnetic fields, and fluid properties, including pressure and velocity. The numerical results show that the proposed operators provide reliable, accurate estimates in the presence of noise and irregular sampling. The enhanced accuracy of the proposed method is validated by comparing it with current interpolation systems on irregular grids, including Lagrange-type methods.

comments
35 pages, 13 figures
fields
Numerical Analysis, Functional Analysis
pdf ↗ page arXiv:2602.05589 ↗

Given a set $\mathcal{F}$ of finite groups, it is said that a group $G$ is an $\mathcal{F}$-cover if every group in $\mathcal{F}$ is isomorphic to a subgroup of $G$. Moreover, $G$ is a minimum $\mathcal{F}$-cover if there is no $\mathcal{F}$-cover whose order is less than $|G|$. In [Cameron P. J., et al., Minimal cover groups, J. Algebra 660 (2024)], the authors pose the following question: For which classes $\mathcal{X}$ of groups, closed under taking subgroups and direct products, is it true that, if $\mathcal{F}$ is a set of $\mathcal{X}$-groups, then there is a minimum $\mathcal{F}$-cover which is an $\mathcal{X}$-group? In this paper, we give a negative answer in two cases: $\mathcal{X}\in \{``supersolvable", ``metabelian"\}.$

comments
accepted for publication in The Quarterly Journal of Mathematics
fields
Group Theory
pdf ↗ page arXiv:2602.06220 ↗

Let $G$ be a finite group and denote by $o(g)$ the order of an element $g\in G$. We say that $G$ is an $LCM$-group if $o(x^ny)$ is a divisor of the least common multiple of $o(x^n)$ and $o(y)$ for all $x, y\in G$ and $n\in\mathbb{N}$. This paper extends some existing results on $LCM$-groups, such as the structure of a minimal non-$LCM$-group, and establishes criteria for $G$ to be an $LCM$-group or a nilpotent group. We also prove that, in general, a minimum cover of a finite set of $LCM$-groups is not an $LCM$-group, and we answer two questions posed by M. Amiri.

comments
accepted for publication in Comm. Algebra
fields
Group Theory
pdf ↗ page arXiv:2602.06228 ↗

The space of all finite non-empty subsets of a topological space $X$, also known as the Ran space of $X$, is weakly contractible for $X$ path connected. We consider subspaces $\mathrm{Ran}_{\leqslant n}(X)$ of the Ran space given by all subsets of $X$ of size at most $n$, and their first homotopy groups. These groups are known to be trivial for $n\geqslant 3$, though the proofs are not constructive. We draw an explicit contraction in $\mathrm{Ran}_{\leqslant 3}(S^1)$ of the generator of $π_1(S^1)$, which we then use to conclude that the induced maps $π_1(\mathrm{Ran}_{\leqslant n}(X)) \to π_1(\mathrm{Ran}_{\leqslant 2n+1}(X))$ and $π_1(\mathrm{Ran}_{\leqslant n}(X)) \to π_1(\mathrm{Ran}_{\leqslant n+2}(X))$ are trivial for all positive integers $n$. Pathological maps with infinitely many strata changes in $\mathrm{Ran}_{\leqslant n}(X)$ are resolved via locally contractible neighbourhoods and exit paths. From this we conclude the triviality of $π_1(\mathrm{Ran}_{\leqslant n}(X))$, for all $n\geqslant 3$.

comments
Major revision, simpler construction, stronger results. Comments welcome
fields
Algebraic Topology, General Topology
pdf ↗ page arXiv:2602.09815 ↗

Let $K/k$ be a field extension, $X$ a connected quasi-compact and quasi-separated scheme over $k$ with a rational point $x$, $p:X_K\to X$ the natural projection, $\mathcal{C}_X$ and $\mathcal{C}_{X_K}$ the Tannakian categories whose objects consist of vector bundles on $X$ and $X_K$ respectively. We give criteria for the natural homomorphism $π(\mathcal C_{X_K},x_K)\toπ(\mathcal C_X,x)_K$ to be an isomorphism. Suppose further $X$ is geometrically reduced connected scheme proper over $k$. As applications, we prove base change isomorphisms for $π^{\acute{e}t},π^{E\acute{e}t}$ under arbitrary extensions and for $π^S,π^N,π^{EN}$ under arbitrary algebraic extensions; a cuspidal cubic curve example shows that it can fail for purely transcendental extensions. In positive characteristic, base change isomorphism holds for $π^{Loc}$ and $π^{ELoc}$ under separable algebraic extensions; an elliptic curve example shows that it can fail for finite purely inseparable extensions.

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

For the moduli spaces $\mathcal{V}(K3)_{d,t}^n$ and $\mathcal{V}(\text{Kum})_{d,t}^n$ of polarized hyperkähler manifolds of $\text{Hilb}^n(K3)$-type and $\text{Kum}^n$-type respectively, with polarization with square $2d$ and divisibility $t$, we study general base point freeness and very ampleness of the polarization. We provide conditions, in terms of $n, d, t$ that guarantee that the general polarization, in any connected component of these moduli spaces, to be base point free or very ample.

comments
Improved main results to work also in the case the moduli space is not connected, giving lower bounds on d which are linear in terms if n, and, at worst, quadratic in term of t. 23 pages; no figures. Comments are welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2602.12439 ↗

This paper is devoted to a class of finite horizon deterministic mean field games with Grushin type dynamics, state constraints and nonlocal coupling. First, we consider the optimal control problem that each agent aims to solve when the evolution of the population is given and we establish some properties as: the existence of an optimal trajectory for any starting point $(x,t)$, the closed graph property for the multivalued map which associates to each point $(x,t)$ the set of optimal trajectories starting from that point, endowed with a suitable notion of convergence, the continuity of the value function. The main issue to overcome is due to the local interplay at boundary points between the set of state constraints and the degenerate dynamics. To this end, we shall point out two different sets of assumptions which are both sufficient for these properties. Afterwards, we tackle the mean field games; taking advantage of the aforementioned properties, we prove the existence of a relaxed equilibrium (which describes the evolution of the game in terms of a probability on the set of admissible trajectories) and derive the existence of a mild solution (which is a couple formed by the value function for the generic player and a family of time dependent measures on the state).

fields
Optimization and Control
pdf ↗ page arXiv:2602.12807 ↗

Entanglement is the hallmark of quantum physics, yet its characterization in interacting many-body systems at thermal equilibrium remains one of the most important challenges in quantum statistical physics. We prove that the Gibbs state of any quantum spin chain can be exactly decomposed into a mixture of matrix product states with a bond dimension that is independent of the system size, at any nonzero temperature. As a consequence, the Schmidt number, arguably the most stringent measure of bipartite entanglement, is strictly finite for thermal states, even in the thermodynamic limit. Our decomposition is explicit and is accompanied by an efficient classical algorithm to sample the resulting matrix product states.

comments
33 pages, 1 figure. Improved constants
fields
Mathematical Physics
pdf ↗ page arXiv:2602.13386 ↗

Some non-trivial upper bounds are proved relating to the triple product property (TPP) for subgroups of finite nilpotent groups of class $2$ using elementary group theory. The TPP is the property defined for three non-empty subsets $S, T, U$ of a group $G$ that the group equation $s's^{-1}t't^{-1}u'u^{-1} = 1$, over pairs of elements $s', s \in S$, $t', t \in T$, $u', u \in U$, is satisfied if and only if $s' = s$, $t' = t$, $u' = u$. When $G$ is finite, and the parameter $ρ_0(G)$, called \emph{subgroup TPP ratio}, is defined as $ρ_0(G) := \max\frac{|S||T||U|}{|G|}$, where the maximum is over the collection of all triples of subgroups $S, T, U$ of $G$ satisfying the TPP, this paper proves that \textup{(1)} $ρ_0(G) < \sqrt{G:Z(G)}$} for (all) groups of nilpotency class $2$, \textup{(2)} $ρ_0(G) \leq p$ for $p$-groups with a cyclic commutator subgroup of order $p$, \textup{(3)} $ρ_0(G) = 1$ for $p$-groups of nilpotency class $2$ with a "large" centre such that either $G/Z(G)$ is isomorphic to $C_p \times C_p$ or $C_{p^2} \times C_p$, \textup{(4)} and $ρ_0(G) = 1$ for $p$-groups of nilpotency class $2$ with "small" (irreducible, complex) character degrees of $1$ or $p$ where $G/Z(G)$ is not isomorphic to $C_p \times C_p \times C_p$.

comments
23 pages, including abstract, references and an appendix with three tables. This version contains corrections, as well as additional detail and preliminary results, for the results on extraspecial groups. The title has been updated for clarity, and the subject classifications have also been updated (removal of 68R05, addition of 20D15)
fields
Group Theory
pdf ↗ page arXiv:2602.15796 ↗

We collect open problems in permutation patterns on four themes: rank-unimodality in the permutation pattern poset and log-convexity of principal classes, Wilf-equivalence and shape-Wilf-equivalence, the enumeration of derangements in permutation classes, and sorting by stacks in series, generalized stacks, and restricted containers (C-machines).

fields
Combinatorics
pdf ↗ page arXiv:2602.16355 ↗

Using flag algebras, we prove that the minimum density of $8$-cliques in a large graph without an independent set of size $3$ is $491411/268435456+o(1)$, thus resolving a new case of an old problem of Erdős [Magyar Tud. Akad. Mat. Kutató Int. Közl. 7 (1962) 459-464]. Also, we establish some other results of this type; for example, we show that the minimum $s$-clique density in a large graph with no independent set of size 3 nor an induced 5-cycle is $2^{1-s}+o(1)$ when $s=4,5,6$. For each of these results, we also describe the structure of all extremal and almost extremal graphs of large order $n$. These results are applied to give an asymptotic solution to a number of cases of the problem of Baumann and Briggs [Electron. J. Combin. 32 (2025) P1.22] which asks for the minimum number of $s$-cliques in an $n$-vertex graph in which every $k$-set spans a $t$-clique.

fields
Combinatorics
pdf ↗ page arXiv:2602.17412 ↗

When the number of assets is larger than the sample size, the minimum variance portfolio interpolates the training data, delivering pathological zero in-sample variance. We show that if the weights of the zero variance portfolio are learned by a novel ``Ridgelet'' estimator, in a new test data this portfolio enjoys out-of-sample generalizability. It exhibits the double descent phenomenon and can achieve optimal risk in the overparametrized regime when the number of assets dominates the sample size. In contrast, a ``Ridgeless'' estimator which invokes the pseudoinverse fails in-sample interpolation and diverges away from out-of-sample optimality. Extensive simulations and empirical studies demonstrate that the Ridgelet method performs competitively in high-dimensional portfolio optimization.

fields
Statistics Theory
pdf ↗ page arXiv:2602.19462 ↗

Owing to the intrinsic computational limitation that infinite memory cannot be stored numerically, the approximation of invariant probability measures (IPMs) for stochastic functional differential equations (SFDEs) with infinite delay remains an open problem. This paper addresses this challenge by proposing an explicit finite-memory truncated Euler-Maruyama scheme that combines memory and state truncation for such SFDEs. We establish strong convergence of the numerical segment process over any finite time horizon and obtain a convergence order arbitrarily close to $1/2$. We further prove that this numerical segment process admits a unique IPM and that its IPM converges to the exact counterpart under the $L^2$-Wasserstein metric as the step size vanishes, with an explicit convergence rate. The framework applies to both linear and superlinear coefficients.

fields
Numerical Analysis
pdf ↗ page arXiv:2603.04724 ↗

Stacked intelligent metasurfaces (SIMs) cascade several closely spaced programmable metasurface layers so that an electromagnetic wave undergoes repeated modulation-propagation interactions before leaving the stack. The stack thereby implements, at the speed of propagation and with few radio-frequency chains, high-dimensional analog transformations that would otherwise require digital precoding, combining, spatial filtering, focusing, or inference. Since 2023, SIM research has produced more than two hundred articles, a dedicated magazine special issue, and two survey-level overviews organized around applications and wave-domain computing. This article complements them with a model-to-hardware perspective. First, we present the electromagnetic modeling hierarchy of SIMs, making explicit the assumptions under which the models coincide, their validity regimes, and their computational complexity, with a common notation for hardware non-idealities and power consumption. Second, we present a methodology-first taxonomy (SIM-aware channel acquisition, model-based optimization, statistical-CSI design, learning-based control, and hardware-aware robust design), compare the families in terms of CSI requirements, complexity, convergence, and hardware constraints, and reconcile conflicting findings in the literature. Third, we synthesize applications by the physical role of the SIM. Fourth, we quantitatively compare experimentally demonstrated multilayer prototypes, separate validated from conceptual architectures, and discuss thermal, tolerance, and calibration issues. Fifth, we provide a tutorial-style performance and trade-off analysis anchored in reported results. Finally, we map evidence-based challenges to research directions with measurable targets. Lessons learned are summarized at the end of every section.

fields
Information Theory
pdf ↗ page arXiv:2603.05633 ↗

We provide a method to systematically construct vector fields for which the dynamics display transitions corresponding to a desired hierarchical connection structure. This structure is given as a finite set of directed graphs $\mathbf{G}_1,\dotsc,\mathbf{G}_N$ (the lower level), together with another digraph $\mathbfΓ$ on $N$ vertices (the top level). The dynamic realizations of $\mathbf{G}_1,\dotsc,\mathbf{G}_N$ are heteroclinic networks and they can be thought of as individual connection patterns on a given set of states. Edges in $\mathbfΓ$ correspond to transitions between these different patterns. In our construction, the connections given through $\mathbfΓ$ are not heteroclinic, but excitable with zero threshold. This describes a dynamical transition between two invariant sets where every $δ$-neighborhood of the first set contains an initial condition with $ω$-limit in the second set. Thus, we prove a theorem that allows the systematic creation of hierarchical networks that are excitable on the top level, and heteroclinic on the lower level. Our results modify and extend the simplex realization method by Ashwin & Postlethwaite.

comments
34 pages, 10 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2603.06157 ↗

In this paper we study the singular set in the parabolic obstacle problem for general obstacles $\varphi \in C^{2,1}$, with $Δ\varphi < 0$. We prove that the singular set has parabolic Hausdorff dimension at most $n-1$. Prior to our result, this was only known when $Δ\varphi \equiv -1$. Our approach combines a truncated parabolic frequency formula and monotonicity estimates with an iterative argument showing that the frequency is saturated for all values of the truncation parameter between $2$ and $3$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2603.06352 ↗

Partial Information Decomposition (PID) has become one of the most prominent information-theoretic frameworks for describing the structure and quality of information in complex systems. Despite its widespread utility, there exists no unique solution constraining precisely how a PID should be constructed, leading to a multiverse of different formalisms with different mathematical commitments. In this work, we provide a comprehensive overview of the mathematical landscape of PID. By integrating existing PID measures into a common language, we systematically examine all major approaches to the PID framework that have emerged so far, determining for each measure whether or not each known property holds. In addition, we derive a web of all known theorems mapping the relationships and incompatibilities between these properties, before also revealing some novel interdependency results. In doing so, we chart a brief history of the framework, promote a unified perspective for its discussions, and offer a path towards both theoretical refinement and informed empirical applications for the future of this powerful method.

fields
Information Theory
pdf ↗ page arXiv:2603.06678 ↗

Computing exact optimal transport (OT) distances at large scale remains computationally challenging. Entropy-regularized OT can be solved efficiently, but its solution is biased toward the regularized problem, and small regularization parameters often lead to slow convergence and numerical instability. In this paper, we propose \emph{Inexact Bregman Sparse Newton} (IBSN), an efficient method for high-accuracy computation of the original OT problem. Building on a verifiable inexact Bregman proximal framework, IBSN develops a sparse Newton inner solver tailored to the semi-dual formulation, which yields a lower-dimensional Newton system. To accelerate the inner subproblem solves, we introduce a Hessian sparsification strategy tailored to the semi-dual formulation, which reduces the cost of Newton direction computation while preserving key spectral properties. We establish convergence guarantees for the resulting algorithm, including convergence of the inner sparse Newton iterations and global convergence of the overall method to an optimal OT solution. Numerical experiments on synthetic and real datasets show that IBSN is effective in high-accuracy regimes and compares favorably with representative first-order and second-order OT solvers.

fields
Optimization and Control
pdf ↗ page arXiv:2603.07156 ↗

We show how the computer algebra system OSCAR can be used to retrace geometric constructions of plane algebraic curves and provide topologically correct and visually pleasing drawings. The approach is illustrated on Shustin's construction from 1987 of a particular M-curve of degree eight. We arrive at an explicit homogeneous trivariate polynomial with rational coefficients, and we provide a computational proof of all claimed properties of Shustin's original article.

comments
22 pages, 8 figures
fields
Algebraic Geometry
pdf ↗ page arXiv:2603.12985 ↗

In this work, we extend a classical theorem of Keith Ball on integrals of log-concave functions along rays against the weight $r^{p-1}$ to the previously inaccessible regime $p\in (-1,0)$: if $g:\mathbb R^n\to\mathbb R_+$ is an integrable, upper semi-continuous, log-concave function which attains its maximum at the origin and has the origin in the interior of its support, then \[ x\mapsto \left(\frac{p}{g(o)}\int_{0}^{\infty}r^{p-1}(g(rx)-g(o))\mathrm{d}\,r\right)^{-\frac{1}{p}} \] is a gauge on $\mathbb{R}^n$. Our approach also provides a new proof of the original regime $p> 0$. The argument is based on a reduction to a two-dimensional inequality derived from Prékopa's theorem, which may be of independent interest. As a consequence of this extension, we resolve a nearly 30-year-old question of Richard Gardner and Gaoyong Zhang in the affirmative. In 1998, R. Gardner and G. Zhang introduced the radial $p$th mean bodies $R_p K$ of a convex body $K\subset \mathbb{R}^n$ for $p>-1$. Furthermore, they established that $R_p K$ is convex for $p\geq 0$, but the convexity of $R_p K$ for $p\in (-1,0)$ remained open. We prove that $R_p K$ is convex for all $p>-1$.

comments
23 pages. Substantially simplified presentation by assuming g in LC satisfies max g = g(0) and the origin lies in the interior of its support. Earlier versions treated the boundary case with lengthy proofs and approximation arguments that diluted the main results and proof ideas. These cases will be revisited in future work. Minor technical improvements throughout
fields
Metric Geometry, Functional Analysis
pdf ↗ page arXiv:2603.14134 ↗

We establish a discrete Hadamard variational formula for Green operators on weighted graphs along an increasing family of subgraphs. The increment of the Green operator factors through harmonic extension from the newly added layer and the positive square root of its boundary Green operator. This gives a dimension-free decomposition of the Green kernel and an associated isometric Hadamard operator. As an application, the discrete Gaussian free field is constructed by successively adding independent harmonically extended Gaussian contributions. The formulation uses only the graph structure and its conductances, without smoothness assumptions. For nested square-lattice approximations of smooth planar domains, we also prove convergence of the growing fields in finite-dimensional distributions and convergence of the integrated Hadamard increments as Green-operator forms.

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

Following ideas from [14], we give a uniform large genus asymptotics for primitive psi-class intersection numbers on the moduli space of stable algebraic curves, and extend this result including insertions of zeros in a certain uniform way. Application to a particular formal solution of the Painlevé I equation is given. We also use a method from [14] to give a new proof of the polynomiality conjecture on large genus asymptotic expansions of psi-class intersection numbers.

comments
We corrected an error in the statement of Theorem 2, and updated its proof. We also corrected a few typos. 23 pages
fields
Mathematical Physics, Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:2603.15233 ↗

Effectful categories have two classes of morphisms: pure morphisms, which form a monoidal category; and effectful morphisms, which can only be combined monoidally with central morphisms (such as the pure ones), forming a premonoidal category. This suggests seeing morphisms of an effectful category as carrying a grade that combines under the monoidal product in a partially defined manner. We axiomatize this idea with the notion of monoidal category graded by a partial commutative monoid (PCM). Monoidal categories arise as the special case of grading by the singleton PCM, and effectful categories arise from grading by a two-element PCM. Further examples include grading by powerset PCMs, modelling non-interfering parallelism for programs accessing shared resources, and grading by intervals, modelling bounded resource usage. We show that effectful categories form a coreflective subcategory of PCM-graded monoidal categories; introduce cartesian structure, recovering Freyd categories; and describe PCM-graded monoidal categories as monoids by viewing a PCM as a thin promonoidal category.

comments
MFPS XLII Final Proceedings Version
fields
Category Theory
pdf ↗ page arXiv:2603.16375 ↗

We present a calculus that models a simple sort of process interaction. Our calculus consists of a collection of terms together with a rewrite relation, parameterised by an arbitrary multicategory whose morphisms we understand as non-interactive processes. We show that our calculus is confluent and terminating, and that terms modulo the induced convertibility relation form a virtual double category. We relate our calculus to the free cornering of a monoidal category, which is a double-categorical model of process interaction that is similar in spirit to the calculus presented herein. Precisely, we construct a functor from the virtual double category given by our calculus into the underlying virtual double category of the free cornering of the free monoidal category on the multicategory of non-interacting processes. If we think of the terms of our calculus as programs and the rewriting system as an operational semantics for these programs, this functor gives a sound denotational semantics for our calculus in terms of the free cornering.

comments
To appear in the post-proceedings of MFPS 2026
fields
Category Theory
pdf ↗ page arXiv:2603.18321 ↗

Linear Response theory aims to predict how added forcing alters the statistical properties of a system. This has been predominantly studied for autonomous dynamical systems, yet many systems in the physical, natural, and social sciences are inherently nonautonomous. In such settings, one would like to understand how the system's time-dependent statistical properties change when additional infinitesimal forcings are applied. This question is of clear practical relevance, but from a rigorous mathematical viewpoint it has been addressed only for a few specific classes of systems and perturbations. Here we provide a rigorous linear response theory for a rather general class of deterministic and random nonautonomous systems satisfying a specific set of assumptions that are the counterpart of the standard assumptions used in the autonomous setting. A central ingredient is rapid loss of memory along the nonautonomous evolution. Our main strategy is to reformulate the sequential dynamics as a fixed-point problem for a global transfer operator acting on an extended sequence space of measures. This yields explicit and readily implementable causal response formulas for predicting the effect of small perturbations on time-dependent statistical states. We illustrate the theory on two representative classes: sequential compositions of expanding maps and sequential compositions of noisy random maps. We also establish linear response for reflected Euler-Maruyama discretizations of dissipative nonautonomous stochastic differential equations with nondegenerate additive Gaussian noise, on fixed compact domains. As a physical application, we study the response of a Ghil-Sellers climate energy balance model, discretized in latitude and time to a time-dependent perturbation of the greenhouse parameter.

comments
Further revision. We enriched the introduction and simplified the applications to Euler-Maruyama dicretizations of SDE and the Ghil-Sellers energy balance model
fields
Dynamical Systems
pdf ↗ page arXiv:2603.19509 ↗

In this paper, we consider the nonsmooth convex optimization problems over the fixed point constraint sets of firmly nonexpansive operators. To find an optimal solution of the problem, we present an iterative method based on the hybrid steepest descent method and the idea of a delayed subgradient scheme in which allows the use of staled subgradients from the earlier iteration when updating the next iteration. We start the convergence part by deriving an upper bound for the difference of the best-achieved function values and the optimal value. After that, to ensure the convergence in iterations, we prove that there exists a subsequence of the generated sequence by the proposed method which converges to an optimal solution. Moreover, we subsequently show that the whole generated sequence converges to an optimal solution when the strict convexity of the objective function is imposed. Further, we extend the presented results to the inexact version and the centralized network system consisting of a finite number of workers and a central server. Finally, we apply the proposed method to image inpainting problems. The numerical results describe the effect of delay in many cases of objective functions.

fields
Optimization and Control
pdf ↗ page arXiv:2603.19604 ↗

In this paper, we obtain an action on a cube complex from an action on a path-connected topological space with a system of divisions. In the settings of hyperbolic groups or relatively hyperbolic groups with no peripheral splittings, our result provides an alternate route to Sageev's construction of a cube complex action from a collection of (relatively) quasiconvex subgroups of a (relatively) hyperbolic group.

comments
v2: 29 pages, better discussion of related work
fields
Group Theory
pdf ↗ page arXiv:2603.20424 ↗

BoostConv has been introduced in earlier works as an effective acceleration technique for nonlinear iterative processes and has been successfully employed in a variety of applications to enhance convergence rates or to compute unstable fixed points that are otherwise inaccessible through standard approaches. Despite its demonstrated practical effectiveness, the theoretical properties of the method have not yet been fully characterized. In this work, we present a more robust formulation of the BoostConv algorithm and, for the first time, provide a rigorous proof of its local convergence. The proposed analysis places BoostConv within a precise mathematical framework, clarifying its interpretation as a nonlinear convergence accelerator and establishing sufficient conditions under which convergence to a fixed point is guaranteed. The theoretical findings are illustrated through several numerical examples, spanning from a linear problem to a low-dimensional benchmark and a large-scale incompressible Navier-Stokes simulation. These results demonstrate the robustness and practical relevance of the proposed method and bridge the gap between empirical performance and rigorous analysis, paving the way for further developments and applications to complex nonlinear problems.

fields
Numerical Analysis
pdf ↗ page arXiv:2603.20749 ↗

In this paper, we study hyperbolic cycles in the first homology group of congruence subgroups of $\mathrm{SL}_2(\mathbb{Z})$ with local coefficients. We prove that, for any prime number $p$, the $p$-ordinary part of the first homology group is generated by hyperbolic cycles.

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

This study explores B-stationarity condition for mathematical programs with complementarity constraints (MPCCs) and convergence of a Bounding Algorithm we proposed in [33]. Special attention is given to the cases with biactive complementarity constraints. First, we introduce the concept of piecewise M-stationarity and prove its equivalence to B-stationarity under MPCC-GCQ. Then, this concept is employed to propose a simplified B-stationarity verifica- tion. Finally, we investigate improved convergence properties of the Bounding Algorithm in [33]. Limit points of this method are shown to be C-stationary, based on the stationarity of an approaching sequence; moreover, they are piece-wise M-stationary (and therefore B-stationary), if an additional second-order condition is satisfied by the sequence.

fields
Optimization and Control
pdf ↗ page arXiv:2603.23389 ↗

We consider a far generalization of the well-known stable roommates and non-bipartite stable allocation problems. In its setting, one is given a finite non-bipartite graph $G=(V,E)$ with nonnegative integer edge capacities $b(e)\in{\mathbb Z}_+$, $e\in E$, in which for each vertex (``agent'') $v\in V$, the preferences on the set $E_v$ of its incident edges are given via a choice function $C_v$ acting on the vectors in ${\mathbb Z}_+^{E_v}$ bounded by the capacities and obeying the standard axioms of substitutability and size monotonicity. We refer to the related stability problem as the stable partnership problem with integer choice functions, or SPPIC for short. Extending well-known results for particular cases, we give a solvability criterion for SPPIC and develop an algorithm of finding a stable solution, called a stable partnership, or establishing that there is none. Moreover, in general the algorithm constructs a pair $(x,{\cal K})$ such that $x\in {\mathbb Z}_+^E$ and ${\cal K}$ is a set of pairwise edge-disjoint odd cycles in $G$ satisfying the following properties: if ${\cal K}=\emptyset$, then $x$ is a stable partnership, whereas if ${\cal K}$ is nonempty, then a stable partnership does not exist, and in this case, the set ${\cal K}$ is determined canonically. Our constructions essentially use earlier author's results on the corresponding bipartite counterpart of SPPIC. Keywords: stable marriage problem, stable roommates problem, stable partition, stable allocation, choice function

comments
25 pages, 1 figure, appeared in DAM
journal
Discrete Applied Math., Vol.397, 2026, pp.345-359. Free share link until Dec.15, 2026: https://authors.elsevier.com/a/1n-qk_,OC1pQzC
fields
Combinatorics
pdf ↗ page arXiv:2603.24433 ↗

This paper studies the convexity properties of nonsmooth extended-real-valued weakly convex functions, a class of functions that is central to modern optimization and its applications. We establish new characterizations of convexity using second-order generalized derivative tools, including subgradient graphical derivatives, second subderivatives, and second-order subdifferentials. These tools allow us to derive necessary and sufficient conditions for convexity in the nonsmooth framework.

fields
Optimization and Control
pdf ↗ page arXiv:2603.24951 ↗

We introduce a contravariant idempotent adjunction between (i) the category of ranked monads on $\mathsf{Set}$; and (ii) the category of internal categories and internal retrofunctors in the category of locales. The left adjoint takes a monad $T$-viewed as a notion of computation, following Moggi-to its localic behaviour category $\mathsf{LB}T$. This behaviour category is understood as "the universal transition system" for interacting with $T$: its "objects" are states and the "morphisms" are transitions. On the other hand, the right adjoint takes a localic category $\mathsf{LC}$-similarly understood as a transition system-to the monad $Γ\mathsf{LC}$ where $(Γ\mathsf{LC})A$ is the set of $A$-indexed families of local sections to the source map which jointly partition the locale of objects. The fixed points of this adjunction consist of (i) hyperaffine-unary monads, i.e., those monads where term $t$ admits a read-only operation $\bar{t}$ predicting the output of $t$; and (ii) ample localic categories, i.e., whose source maps are local homeomorphisms and whose locale of objects are strongly zero-dimensional. The hyperaffine-unary monads arise in earlier works by Johnstone and Garner as a syntactic characterization of those monads with Cartesian closed Eilenberg-Moore categories. This equivalence is the Stone duality for monads; so-called because it further restricts to the classical Stone duality by viewing a Boolean algebra $B$ as a monad of $B$-partitions and the corresponding Stone space as a localic category with only identity morphisms.

comments
19 pages without appendix, 35 pages total, to appear in final proceedings of MFPS2026
fields
Category Theory
pdf ↗ page arXiv:2603.25710 ↗

LLM-based multi-agent planning delegates operational decisions to specialists that communicate through finite reports. In this research, we study its reliability limits when a coordinator can revisit source records before completing a resource-constrained plan. A useful report can support an immediate decision or direct later reading, so its value depends on how these stages communicate. We derive exact communication and access tradeoffs and prove that two report forms suffice for a broad class of allocation requirements, one favoring immediate resource identification and the other distinguishing absence from unnamed availability. For shared capacity, this reduction permits joint optimization of reporting roles and adaptive reads for a fixed number of source types with unequal workloads and reading costs. Identical specialists can optimally report different facts, and maximizing immediate completion can impose an unbounded recovery cost penalty even with full-record access. We also conduct numerical experiments to quantify the benefits of the proposed joint optimization and show how source access improves language-agent decisions that already use their reports optimally. In particular, an exhaustive evaluation of 207,632 report designs on small allocation instances recovers the predicted joint optima. Our analysis suggests that reliable agent communication should be evaluated by the complete decisions it supports and the cost of finishing its unresolved cases, instead of solely by report length, local prediction accuracy, or immediate task completion, as is often the case in current practice.

comments
36 pages, including appendices; 2 figures. Substantially revised
fields
Optimization and Control
pdf ↗ page arXiv:2603.26993 ↗

We study the adelic Galois representations attached to products of two Drinfeld modules of generic characteristic. As a function-field analogue of Serre's open image theorem for products of elliptic curves, we show that the image of the joint adelic representation is commensurable with the subgroup defined by the natural determinant compatibility conditions if and only if at least one of the two Drinfeld modules has potential complex multiplication, or the two modules are not geometrically isogenous up to any Frobenius twist. Our proof combines Pink's theory of minimal quasi-models, explicit reciprocity laws from global class field theory, and an analysis of residual Galois representations. As an arithmetic application, we prove a torsion finiteness result: if one of the Drinfeld modules has no potential complex multiplication and the two are not geometrically isogenous up to any Frobenius twist, then that Drinfeld module has only finitely many torsion points over the compositum of the maximal abelian extension of the base field and the torsion field of the other module. This is an analogue of the classical results of Ribet and Zarhin for abelian varieties.

comments
Compared with v3, this 40-page version removes the strong supersingular reduction condition from the main theorem, making the adelic open image result unconditional. We also prove a stronger torsion-finiteness result. The manuscript has been thoroughly revised for clarity; comments are welcome
fields
Number Theory
pdf ↗ page arXiv:2603.27710 ↗

This work introduces a framework for analyzing the Age of Incorrect Information (AoII) in a real-time monitoring system with a generic discrete-time Markov source. We study a noisy communication system employing a hybrid automatic repeat request (HARQ) protocol, subject to a transmission rate constraint. The optimization problem is formulated as a constrained Markov decision process (CMDP), and it is shown that there exists an optimal policy that is a randomized mixture of two stationary policies. To overcome the intractability of computing the optimal stationary policies, we develop a multiple-threshold policy class where thresholds depend on the source, the receiver, and the packet count. By establishing a Markov renewal structure induced by threshold policies, we derive closed-form expressions for the long-term average AoII and transmission rate. The proposed policy is constructed via a relative value iteration algorithm that leverages the threshold structure to skip computations, combined with a bisection search to satisfy the rate constraint. To accommodate scenarios requiring lower computational complexity, we adapt the same technique to produce a simpler single-threshold policy that trades optimality for efficiency. Numerical experiments exhibit that both thresholdbased policies outperform periodic scheduling, with the multiplethreshold approach matching the performance of the globally optimal policy.

comments
new title, draft layout
fields
Information Theory
pdf ↗ page arXiv:2603.28369 ↗

Given a strict partial order $Δ$ on a set $Λ$ and an arbitrary ring $R$ with $1\neq 0$, the corresponding McLain group $M(Δ)$ has been studied in depth. We construct a larger family of McLain groups $G(Δ)$, where $Δ$ need be neither asymmetric nor transitive, while satisfying two weaker axioms. Structural properties common to all members~$G(Δ)$ of this new family are investigated, including a group presentation, a description of the factors of its descending central series, a canonical form for its elements relative to any total order on~$Δ$, and a recursive determination of its upper central series. In addition, we prove the natural isomorphism $G(Δ)/G(Γ)\cong G(Δ\setminusΓ)$, where $Γ$ is a normal subset of $Δ$, and $G(Γ)$ and $G(Δ\setminusΓ)$ are extended McLain groups on their own right. This result has no parallel in the classical context.

fields
Group Theory
pdf ↗ page arXiv:2604.02087 ↗

A line bundle on a curve with two marked points can be special in many ways, as measured by the global sections of all of its twists by these points. All of this information is conveniently packaged into a permutation, which we call the transmission permutation. We prove that when twice-marked curves are chained together, these permutations are composed via the Demazure product; in reverse, bundles with given permutation can be enumerated via reduced decompositions of a permutation. This paper demonstrates the utility of transmission permutations by giving a short derivation of the basic dimension bounds of both classical Brill–Noether theory and Hurwitz–Brill–Noether theory in a unified framework. The difference between the two cases derives from taking permutations in either symmetric groups or affine symmetric groups.

comments
17 pages. v2: minor corrections and improvements
fields
Algebraic Geometry
pdf ↗ page arXiv:2604.03895 ↗

We model indistinguishability under chosen-plaintext attack (IND-CPA) games as binary classification tasks for deep neural networks (DNNs). We apply this methodology to the public-key encryption (PKE) schemes used to construct PQC key encapsulation mechanisms (KEMs) such as ML-KEM and HQC, and to cascaded symmetric algorithms, demonstrating methodological generality. Moreover, we present a novel extension of this approach to empirical distinguishability testing of hybrid KEMs. For IND-CPA-secure schemes and their combinations, no DNN achieves accuracy significantly different from random guessing (measured via Bonferroni-corrected binomial tests), consistent with theoretical security guarantees. For insecure schemes, such as plain RSA, AES-CTR and AES-CBC with IV or counter reuse, or RC4, the DNNs classify the ciphertexts better than random guessing. Thus, this framework is shown to serve as a practical, scheme-agnostic tool for flagging distinguishable ciphertexts in both individual and composed constructions.

fields
Information Theory
pdf ↗ page arXiv:2604.06942 ↗

The Cramér-Lundberg model with exponential claims and proportional investment is solved exactly: the integro-differential equation for the survival probability reduces to a doubly confluent Heun equation, yielding an explicit solution in terms of Heun functions, a verification theorem, and a qualitative analysis of ruin probability versus investment share.

fields
Probability
pdf ↗ page arXiv:2604.08745 ↗

We study a norm-controlled notion of semiprojectivity for Banach lattices, testing sequential quotient towers in separable ambient lattices and requiring arbitrarily small norm loss at a fixed stage. For a locally compact second-countable Hausdorff space $X$, we prove that $C_0(X)$ is semiprojective if and only if $X$ is compact and an absolute neighbourhood retract. Finite $\ell_1$-sums preserve semiprojectivity, and arbitrary $\ell_1$-sums of $1^+$-projective lattices are semiprojective without any order-unit assumption. By contrast, $\mathbb{R} \oplus_\infty \ell_1$ fails to be semiprojective, showing that neither semiprojectivity nor $1^+$-projectivity is preserved by finite $\ell_\infty$-sums, extensions, or pullbacks over a projective base. Every separable semiprojective lattice is $λ$-projective for some finite $λ$, and its scalar-valued lattice homomorphisms separate points. Consequently, a separable reflexive Banach lattice is semiprojective precisely when it is finite-dimensional, and no nonzero separable atomless order-continuous lattice is semiprojective. We also characterise $\ell$-openness as $1^+$-projectivity relative to separable ambient lattices; for separable domains this is ordinary $1^+$-projectivity. The restriction to separable ambient lattices is redundant for separable domains but affects the nonseparable examples.

comments
21 pp
fields
Functional Analysis, Category Theory, Operator Algebras
pdf ↗ page arXiv:2604.10624 ↗

This paper introduces LTLFS, a linear temporal logic for reasoning about frequencies in finite series of probabilistic events. The logic conservatively extends linear temporal logic over finite traces with measure-sensitive operators that compare the empirical distribution observed at any point in a series with an independently specified target distribution. Its semantics integrates the actual sequence of events, the probability distribution governing individual outcomes, and the set of finite assignments compatible with the target frequency. This supports two complementary tasks: verifying whether an observed partial distribution is compatible with the benchmark, and predicting whether and with what probability the completed series can still satisfy it. The language can express observed and attainable frequencies, the probability of realizing a desired final distribution, and conditional probabilities for subsequent outcomes under the assumption that the benchmark is met. We establish formal properties of the operators and characterize their interaction with the temporal structure. A running example concerning representational fairness in sequential outputs from a generative AI system illustrates how the framework can distinguish temporary deviations from irrecoverable violations and support early, logically interpretable intervention. LTLFS thereby provides a symbolic foundation for runtime monitoring of evolving quantitative requirements, with applications to explainable and responsible AI.

fields
Logic
pdf ↗ page arXiv:2604.10669 ↗

We investigate the large-scale dynamics of the one-dimensional real and complex Ginzburg-Landau equations using a scalar equation for the local wave number derived by a Wentzel-Kramers-Brillouin (WKB) expansion. For the real equation, the reduction has a conserved gradient structure. With higher-order regularization, we obtain families of exact stationary solutions and show that all nonuniform steady states are linearly unstable. These include localized holes distinct from the classical Langer-Ambegaokar hole. In the Eckhaus-unstable regime, the reduced equation develops finite-time singularities associated with phase slips. We derive a universal self-similar description of this process, with parameter-independent scaling exponents in good agreement with direct numerical simulations. The similarity profile satisfies a nonlinear fourth-order boundary-value problem admitting multiple numerically identified solutions. For the complex equation with nearly real coefficients, an additional Burgers-type nonlinearity produces wave steepening and traveling shocks connecting plane waves of different wave numbers. We derive the shock profile exactly and show numerically that the full complex Ginzburg-Landau equation converges to this prediction in the appropriate asymptotic limit. Outside this regime, the wave number profile becomes nonmonotonic, as explained in terms of spatial dynamics. These shocks differ qualitatively from classical Nozaki-Bekki solutions. The reduced equation thus unifies stationary holes, self-similar collapse toward phase slips, and propagating shocks within a common description of pattern-forming systems.

fields
Dynamical Systems
pdf ↗ page arXiv:2604.12847 ↗

Let $V$ be a grading-restricted vertex algebra and let $A^\infty(V )=U^\infty(V)/Q^\infty(V)$ be the associative algebra constructed by Huang, where $U^\infty(V)$ is the space of column-finite infinite matrices with entries in $V$ and $Q^\infty(V)$ is an ideal of a (nonassociative) algebra structure on $U^\infty(V)$ defined by Huang. Huang introduced families of elements in $Q^\infty(V)$ and conjectured that these elements generate $Q^\infty(V)$. We introduce the ``diagonal shift property" and prove that the elements that Huang conjectured as a generating set for $Q^\infty(V)$ satisfy this property. On the other hand, in the case that $V$ is the rank one Heisenberg vertex operator algebra, we construct infinitely many linearly independent elements in $Q^\infty(V)$ that do not satisfy the diagonal shift property. As a corollary, we disprove Huang's conjecture.

comments
Final version, to appear in the Journal of Pure and Applied Algebra
fields
Quantum Algebra
pdf ↗ page arXiv:2604.12937 ↗

Let \(Λ\) be a finite-dimensional Koszul algebra with Koszul dual \(Λ^!\). We establish derived Koszul dualities at the level of bounded derived categories, both in the graded setting \(\mathsf{D}^{b}(Λ\textup{-gmod})\) and in the ungraded setting \(\mathsf{D}^{b}(Λ\textup{-mod})\), without imposing finiteness conditions on \(Λ^!\). We first prove a graded derived Koszul duality for every finite-dimensional Koszul algebra, with no Noetherian or coherence assumptions on the Koszul dual. We then show that the bounded derived category \(\mathsf{D}^{b}(Λ\textup{-mod})\) can be reconstructed from the graded theory as the triangulated hull of an orbit category. This yields a genuinely non-graded derived Koszul duality. We further establish singular and dg refinements of these dualities. For Iwanaga–Gorenstein Koszul algebras, this gives a stable Koszul duality for graded Gorenstein-projective modules and their ungraded counterparts, providing a non-graded form of the Bernstein–Gel'fand–Gel'fand correspondence. As applications, we obtain new descriptions of the bounded derived categories \(\mathsf{D}^{b}(\mathcal{O}_λ)\) for all integral blocks of category \(\mathcal{O}\), including singular blocks, thereby closing a gap left open in the work of Beilinson, Ginzburg, and Soergel. We also establish analogous dualities for certain categories of perverse sheaves arising in geometric representation theory. Finally, we formulate conjectural descriptions of bounded derived and singularity categories of finite-dimensional graded algebras in terms of dg orbit categories.

fields
Representation Theory, Category Theory
pdf ↗ page arXiv:2604.16805 ↗

In this paper, we establish a complete structural description of flat Lorentzian Lie groups, i.e., Lie groups endowed with a flat left invariant Lorentzian metric, thereby resolving a long-standing open problem in the theory of pseudo-Riemannian Lie groups. Our main result shows that any flat Lorentzian Lie group either admits a timelike parallel left-invariant vector field or is of Kundt type, and that in both cases the underlying Lie algebra falls into one of six explicit classes. A key ingredient of the proof is a refined analysis of the double extension process, which reveals that all flat Lorentzian Lie algebras arise - directly or in a generalized sense - from flat Euclidean ones. As a consequence, we obtain easily a complete classification in dimensions three and four, recovering and unifying several previously known partial results.

comments
65 pages, 8 Tables, third version, many typos an errors corrected. Submitted
fields
Differential Geometry
pdf ↗ page arXiv:2604.17292 ↗

Superspecial curves are important objects in number theory and algebraic geometry, and the existence of such a curve of genus $g \geq 4$ is an open problem, for general characteristics $p > 0$. As a computational approach to this problem, Kudo-Harashita-Howe (2020) showed that a superspecial curve of genus 4 exists in each characteristic $p$ with $7 < p < 20000$. Their method restricted attention to a specific class of curves, known as Howe curves, for which superspeciality is reduced to those of curves of genus at most 2. In this paper, we focus on a more specific class of curves, namely Howe curves whose Jacobians decompose into a product of four elliptic curves. By restricting our attention to such curves, the superspeciality reduces to the supersingularity of elliptic curves, which enables us to construct a superspecial curve of genus 4 more efficiently than Kudo-Harashita-Howe's method. As our first main result, we confirmed by computer the existence of such superspecial curves of genus 4 in characteristics $p$ with $20000 < p < 10^6$. Using a similar approach, we also propose constructions of superspecial curves of genera 5 and 6 from only supersingular elliptic curves. Furthermore, computational experiments establish the existence of superspecial curves of genus 5 (resp. genus 6) in characteristics $p$ with $13 < p < 10^5$ (resp. $7 < p < 10^5$).

comments
16 pages, comments welcome!
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2604.18074 ↗

Let $k$ be a perfect field of characteristic $p>0$, and let $d$ be a positive integer not divisible by $p$. We define a non-empty Zariski open subset $U$ of the space of polynomials of degree $d$, and for $f(x)\in U(k)$, we compute the $a$-number of the curve defined by $y^p-y=f(x)$. This $a$-number realizes a lower bound given by Booher and Cais, so the latter is tight. Our result also implies that the bound of Booher and Cais for minimal $a$-numbers of Artin-Schreier covers of ordinary curves is tight.

comments
14 pages. v2: fixed a few typos
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2604.20091 ↗

We study the random-cluster model on trees and 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$, approximately sampling from this model on graphs of degree at most $Δ$ is computationally hard. At parameter $p$ below the tree uniqueness threshold $p_{\mathsf{u}}(q,Δ)$, it is expected that sampling is easy and local Markov chains mix rapidly on all bounded degree graphs. On typical graphs (e.g., random regular graphs), the same is predicted at $p > p_{\mathsf{s}}(q,Δ)$, where $p_{\mathsf{s}}(q,Δ)$ is a second uniqueness transition point on the $Δ$-regular wired tree. Our first result establishes this non-uniqueness/uniqueness phase transition at $p_{\mathsf{s}}(q,Δ)$ for all $q$ on the infinite $Δ$-regular wired tree, resolving a conjecture of H{ä}ggstr{ö}m (1996). For this, we establish weak spatial mixing at $p>p_{\mathsf{s}}(q,Δ)$ under sufficiently wired boundary conditions. We use this understanding of decay of correlations to show that on the wired tree on $n$ vertices, whenever $q>1$ and $p>p_{\mathsf{s}}(q,Δ)$, the mixing time of random-cluster Glauber dynamics is a near-optimal $n^{1+o(1)}$. We then extend these results on spatial and temporal mixing from the tree to treelike geometries with mostly wired boundaries and use them to show that the random-cluster Glauber dynamics mix rapidly on the random $Δ$-regular graph for all $p>p_{\mathsf{s}}(q,Δ)$ as long as $q \ge C \log Δ$, providing an efficient sampling algorithm for both the random-cluster and Potts models in this context.

fields
Probability
pdf ↗ page arXiv:2604.20693 ↗

Let $X$ be a projective nested product of fields and let $δ_X(d)$ be the minimum distance in degree $d\geq 1$ of the projective nested Cartesian code $C_X(d)$. The regularity index ${\rm reg}(δ_X)$ of the minimum distance function $δ_X$ is the minimum integer $d_0\geq 0$ such that $δ_X(d)=1$ for $d\geq d_0$. We give a formula for ${\rm reg}(δ_X)$ by determining an indicator function of least degree for each point of $X$ and using the fact that ${\rm reg}(δ_X)$ is the ${\rm v}$-number of the vanishing ideal $I_X$ of $X$. Then we give an arithmetical criterion that characterizes when $X$ is Cayley–Bacharach.

fields
Commutative Algebra, Information Theory, Algebraic Geometry
pdf ↗ page arXiv:2604.20729 ↗

We study the emergence of symmetric oscillatory behavior in multi-agent systems where each agent incorporates distributed memory of past states and feedback from changes in its response over a finite time window. The latter admits a neutral-form presentation but reduces to a finite difference of delayed states. The closed-loop dynamics are therefore described by a system of nonlinear retarded functional differential equations with a high degree of symmetry, arising from a network of homogeneous agents. By reformulating the problem as a fixed point operator equation, we apply equivariant degree theory to establish rigorous conditions for unbounded global Hopf bifurcation from the consensus equilibrium. Our main results provide sufficient conditions for the local asymptotic stability of consensus and for the existence of unbounded global branches of non-constant periodic solutions with prescribed spatio-temporal symmetries. The question of whether such periodic solutions are stable (and therefore constitute periodic multiconsensus) is not resolved by the degree method; we address it in an illustrative example via numerical simulations. The example, which models eight coupled asset markets with chartist traders and fundamentalists, demonstrates how memory-driven instability can generate periodic boom-bust cycles across clusters of assets. The numerical example illustrates the predicted two-cluster pattern, and Floquet computations provide numerical evidence of local orbital asymptotic stability at sampled parameter values.

fields
Dynamical Systems
pdf ↗ page arXiv:2604.20740 ↗

A thin-sheet (TS) volume integral equation (VIE) formulation incorporating generalized sheet transition conditions (GSTCs) is presented for the simulation of three-dimensional (3D) bianisotropic metasurfaces. The metasurface is represented as an equivalent thin sheet, with its constitutive tensors derived from the GSTC susceptibility tensors. Invoking the thin-sheet approximation, the governing VIEs are reduced to surface integral equations (SIEs), in which tangential and normal flux density components are treated as distinct sets of unknowns and discretized using Rao-Wilton-Glisson and pulse basis functions, respectively. In contrast to conventional GSTC approaches based on conventional SIEs, which represent only tangential fields, the proposed framework rigorously enforces the bianisotropic GSTCs, including normal field interactions, while retaining the flux-based VIE character of the formulation. Numerical examples, including a comparison with an SIE-GSTC solver that neglects the normal susceptibility components, demonstrate the accuracy and robustness of the proposed TS-VIE-GSTC solver for polarization rotation on planar and curved sheets, perfect reflection, beam steering with spatially varying susceptibilities, multi-directional attenuation, and oblique phase-shift transformation.

fields
Numerical Analysis
pdf ↗ page arXiv:2604.21474 ↗

We present the RLL-realization of extended orthosymplectic quantum supergroups for any parity sequence, with R-matrices evaluated in the earlier work [Lett. Math. Phys. 116 (2026), 55, 97 pages, arXiv:2408.16720]. Our isomorphism is compatible with the internal structure of generalized doubles. We also relate different sign conventions through 2-cocycle twists.

journal
SIGMA 22 (2026), 105, 65 pages
fields
Representation Theory, Quantum Algebra
pdf ↗ page arXiv:2604.21785 ↗

This paper investigates the variational problems associated with the $L^2$-norms of the normal and tangent curvature tensors for submanifolds immersed in a unit sphere. We define the critical points of these functionals under normal variations as Normal-Yang-Mills and Tangent-Yang-Mills submanifolds, for which we explicitly establish the Euler-Lagrange equations in terms of the second fundamental form. Furthermore, by investigating the focal submanifolds of OT-FKM isoparametric hypersurfaces, we construct infinitely many non-trivial examples of both Normal-Yang-Mills and Tangent-Yang-Mills submanifolds. Notably, the curvature tensors of these examples generally do not satisfy the classical Yang-Mills equations.

comments
34 pages; corrected a sign in the definition of $\mathcal{H}^{T}$; revised the expression for $\mathcal{H}^{N}$ and corrected Theorem 1.6(1), with a complete treatment of the remaining cases; all other conclusions remain unchanged
fields
Differential Geometry
pdf ↗ page arXiv:2604.23207 ↗

In this paper we study continuum-marginal optimal transport. Given a time-continuous family of probability marginals, the problem is to recover the minimum-energy velocity field whose flow reproduces every marginal. This problem is the continuum limit of the classical two-marginal Benamou-Brenier formulation, and also the deterministic limit of the Nelson problem of stochastic optimal transport. We propose a practical mesh-free solver for this problem. The weak continuity equation is embedded in a reproducing kernel Hilbert space, yielding a sample-only objective that requires no spatial discretization. The velocity is parametrized by any linear-in-parameters dictionary or neural network, and is optimized by mini-batch stochastic methods. Synthetic experiments confirm that the method achieves accurate drift recovery and marginal consistency. The same computational framework also applies to the Nelson problem.

comments
Published in Transactions on Machine Learning Research (10/2026). Reviewed on OpenReview: https://openreview.net/forum?id=1bzgCxWYpr. 48 pages, 16 figures, 14 tables
journal
Transactions on Machine Learning Research (2026)
fields
Optimization and Control, Numerical Analysis
pdf ↗ page arXiv:2604.24226 ↗

An identification of two vertices \(u\) and \(v\) in a graph replaces them with a new vertex that is made adjacent to every vertex of \(N(u)\cup N(v)\setminus \{u,v\}\). We study the \(\mathcal{H}\)-Identification problem, which is to decide whether a given graph \(G\) can be transformed (``identified'') to a graph in \(\mathcal{H}\) by applying at most \(k\) vertex identifications. We determine the classical and parameterized complexity of this problem for various subclasses \(\mathcal{H}\) of chordal graphs, obtaining an almost complete picture for two parameters: \(k\) and \(n-k\). We also consider the Identification problem, which is to test, for two given graphs \(G\) and \(H\), whether \(G\) can be identified to \(H\). We determine the parameterized complexity of this problem when \(H\) is a graph from one of our testbed classes, taking the number of simplicial vertices of \(H\) as the parameter.

comments
A preliminary version of this paper appeared in the proceedings of IPEC 2026. Minor mistakes and inconsistencies have been corrected in this version
fields
Combinatorics
pdf ↗ page arXiv:2604.24325 ↗

For a risk-averse finite-horizon Markov Decision Process, we introduce a special class of Markov coherent risk measures, called mini-batch measures. We also define the class of multipattern risk-averse problems that reduce to linear MDPs in the risk-neutral case. We use both concepts in a feature-based $Q$-learning method with multipattern $Q$-factor approximation and we prove a high-probability regret bound of $\widetilde{\mathcal{O}}\big(d^{3/2}HN^{H-1}\sqrt{K}\big)$, where $d$ is the number of features, $H$ is the horizon, $N\ge2$ is the mini-batch size, $K$ is the number of episodes, and $\widetilde{\mathcal{O}}$ hides logarithmic factors. We also propose an economical version of the $Q$-learning method that streamlines the policy evaluation (backward) step. The theoretical results are illustrated on a stochastic assignment problem and a short-horizon multi-armed bandit problem.

fields
Optimization and Control
pdf ↗ page arXiv:2605.00654 ↗

Frequent handovers and finite satellite capacity make multi-user mobility management challenging in low Earth orbit (LEO) satellite networks. This paper develops a capacity-aware multi-user handover framework based on a double deep Q-network (DDQN) with a dueling architecture. Both training and evaluation employ sequential user equipment (UE) processing with shared satellite occupancy, while action masking excludes invisible or capacity-infeasible satellites. The state incorporates satellite visibility, achievable link quality, remaining capacity, previous association, short-term visibility, and time information. A fixed multi-criteria reward balances throughput, blocking, handover cost, connection persistence, and short-term visibility, while expert trajectories are used only for replay-buffer initialization. Simulations under different UE densities and satellite capacities show that the proposed framework maintains high average throughput per UE and low blocking rates with moderate handover frequency. Ablation results show that removing the remaining-capacity vector has only a limited effect on performance when sequential occupancy tracking and feasible-action masking are retained.

comments
6 pages, 4 figures. Submitted to the 2027 IEEE International Conference on Communications (ICC) 2027
fields
Information Theory
pdf ↗ page arXiv:2605.02416 ↗

Geodesic currents on closed orientable hyperbolic surfaces are measures on the unit tangent bundle invariant under geodesic flow and orientation reversal. Every geodesic current induces a kind of ``length'', namely the dual functional on curves defined by the geometric intersection pairing with the current. It is natural to ask which other ``lengths'' or curve functionals arise this way. In this paper we give a purely axiomatic and combinatorial characterization of curve functionals on closed orientable hyperbolic surfaces that are dual to geodesic currents. This yields a new definition of geodesic currents as curve functionals or, equivalently, as functions on surface groups, without reference to measures or flows. More precisely, we show that a functional on curves arises as the geometric intersection pairing with a geodesic current if and only if it is additive under disjoint union and satisfies a simple \emph{smoothing} property: it is non-increasing under surgery of essential crossings. As applications, we obtain new axiomatic characterizations of measured laminations and hyperbolic length functionals, and new descriptions of surface group actions on real trees dual to measured laminations, including a streamlined proof of a classical theorem of Skora. We also provide a unified framework for dual geodesic currents arising from metric structures and generalized cross-ratios, including those associated with certain Anosov representations. Our approach subsumes all previously known constructions of dual geodesic currents for closed surfaces and yields broad new families of examples.

comments
Title changed. Improved multiple sections: rewrote some parts of the introduction, revised and taxonomized examples in Section 2. Reordering in Sections 6, 7. Sections 8, 9 substantially revised, in particular fixed a gap in Lemma 9.11
fields
Geometric Topology
pdf ↗ page arXiv:2605.04031 ↗

Most first-order optimizers treat matrix-valued parameters as vectors, ignoring the intrinsic geometry of hidden-layer weights in neural networks. Muon addresses this mismatch by updating along the polar factor of a momentum matrix, but its theoretical understanding has lagged behind practice. In particular, practical implementations incorporate Nesterov momentum, compute the polar factor only approximately, and operate with stochastic gradients that may be heavy-tailed. We close this gap by developing a convergence theory for Muon with Nesterov momentum and inexact polar decomposition in non-convex matrix optimization under heavy-tailed noise. Our analysis builds on a unified framework for inexact polar decomposition that captures practical iterative approximations such as Newton-Schulz and quantifies how their errors propagate through the optimization dynamics. Under uniform bounds on polar errors, we establish an optimal iteration and sample complexity of $O \left(\varepsilon^{\frac{-(3α-2)}{(α-1)}} \right)$ for finding an $\varepsilon$-stationary point, where $α\in(1,2]$~denotes the heavy-tail index. For the inexact-polar setting with $σ_1=0$, we also provide guarantees that do not require prior knowledge of $α$. We analyze a randomized low-rank polar decomposition that is substantially more efficient than full-space methods while remaining compatible with our theory. Numerical experiments further demonstrate the effectiveness of the proposed inexact and randomized~variants.

comments
48 pages, 6 figures, 4 tables
fields
Optimization and Control
pdf ↗ page arXiv:2605.06884 ↗

In this work, the traditional third-order Active Flux advection scheme is modified by reformulating the method and introducing four additional parameters R, S, T, and U that allow the numerical dissipation and dispersion of the scheme to be adjusted. The influence of these parameters is studied using Fourier analysis and parameter choices that lead to schemes with improved dissipative properties are identified. These improvements are validated by numerical experiments.

fields
Numerical Analysis
pdf ↗ page arXiv:2605.09669 ↗

Operator learning for partial differential equations (PDEs) aims to learn solution operators on infinite-dimensional function spaces from finite-resolution data. In this setting, it is important for the learned model to be discretization-invariant, or resolution-robust, and to reflect PDE-specific structure. It is therefore natural to ask how such structure should be encoded in the model architecture, hypothesis class, or learning procedure. In this paper, we study operator learning for solution operators of nonlinear parabolic PDEs based on Duhamel–Picard iteration. We formulate Picard iteration as an abstract state-transition model and present a theoretical framework for Picard-type operator learning. We derive implementation-agnostic generalization error bounds that separate the implementation error from the estimation error associated with the abstract state-transition model induced by Picard iteration. A key consequence is that increasing the Picard depth reduces the Picard truncation error without causing an unbounded growth of the entropy-based estimation error. We also extend the analysis to long-time prediction by rolling out the same learned local model over successive time blocks. Finally, we illustrate the theory for nonlinear heat equations on the torus using a Picard-type Fourier neural operator as a concrete implementation.

comments
44 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2605.10277 ↗

One of the classical results of mathematical population genetics states that the frequency of a beneficial mutant's offspring, on its way to fixation in a large population, looks like a logistic curve. A logarithmic scaling (both in height and time) of these selective sweep curves leads (in the case of strong selection) to a tent-like shape in the large population limit: First the logarithmic frequency of the mutant increases linearly from 0 to 1, then that of the former resident decreases from 1 to 0. For moderate selection the logarithmic frequencies develop (in the large population limit) a jump at the beginning/the end of the sweep, which takes the shape of the tent into that of a house. Our main result (proved for the Moran model) assesses the regularity of this convergence in the large population limit: It is uniform in the house's roof (phases of linear growth and decline) and "Skorokhod $M_1$" in the house's walls (closely around the jumps). Apart from interest in its own right, we anticipate that this result and the proof techniques will be instrumental for extending the description of clonal interference by Poissonian interacting trajectories (as it was done in Hermann et al. (2024) for strong selection) also to moderate selection.

comments
29 pages, 2 figures
fields
Probability
pdf ↗ page arXiv:2605.10617 ↗

We propose kernel-gradient drifting, a one-step generative modeling framework that replaces the fixed Euclidean displacement direction in drifting models with directions induced by the kernel itself. Standard drifting is attractive because it enables fast, high-quality generation without distilling a large pretrained diffusion model, but its theory is currently understood mainly for Gaussian kernels, where the drift coincides with smoothed score matching and is identifiable. Our gradient-based reformulation exposes this score-based structure for general kernels: the resulting drift is the score difference between kernel-smoothed data and model distributions, yielding identifiability for characteristic kernels and a smoothed-KL descent interpretation of the smoothed drifting dynamics. Since kernel gradients are intrinsic tangent vectors, the same construction extends naturally to Riemannian manifolds and to discrete data via the Fisher-Rao geometry of the probability simplex. Across spherical geospatial data, promoter DNA and molecule generation, kernel-gradient drifting enables state-of-the-art one-step generation beyond the Euclidean setting without distillation. Code is available \href{https://github.com/jcarrascopollo/kgd_thesis}{here}.

fields
Differential Geometry
pdf ↗ page arXiv:2605.10727 ↗

This paper is devoted to the dynamics of a weakly interacting Fermi gas at the kinetic time regime $t\sim λ^{-2}$ where $λ\ll 1$ is the strength of the interaction potential. We prove that if the initial state is close to equilibrium, then the two-point time correlation function of the many-body quantum dynamics can be computed effectively. In fact, we show that its leading order behavior is determined completely by the collisional frequency of the Boltzmann-Nordheim collision operator at equilibrium. This settles a prediction by Lukkarinen-Spohn, and thus gives a justification of the quantum Boltzmann equation from many-body quantum mechanics.

comments
88 pages, 12 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2605.13499 ↗

In the late eleventh century, Omar Khayyam gave a systematic classification of, and solutions to, cubic equations by means of intersecting conic sections. His work is often retold in modern Cartesian language, where each cubic is reduced to equations of certain curves whose intersection determines solutions in the Cartesian plane. In this paper, we retain the first part of the standard modern treatment of Khayyam: translating his verbal algebra into modern symbolic algebra. But instead of interpreting the resulting equations as curves in a Cartesian plane, we interpret them as Khayyam himself did, as relations between positive geometrical magnitudes represented by conics in the Apollonian sense. On this basis, and using a purpose-designed colour scheme, we reconstruct, in a compact treatment, his solutions to all the cubic equations treated by Khayyam. The reconstruction brings to light a hidden feature of the treatise and draws a sharp line between the geometrization of algebra as practised by Khayyam, on the one hand, and the geometrization of algebra developed by Fermat and Descartes, on the other.

comments
v2: substantially revised and retitled; all constructions redrawn as exact TikZ figures
fields
General Mathematics
pdf ↗ page arXiv:2605.13876 ↗

We consider the direct product of two symplectomorphisms, one of which exhibits a basic set and the other one a non-degenerate elliptic equilibrium. Under a local domination condition we show that a typical real-analytic deformations of this system display large robustly transitive sets. As a corollary of our construction we also obtain new open sets of real-analytic symplectomorphisms which are topologically mixing but not uniformly hyperbolic. To establish these results we develop perturbation techniques to create blender horseshoes in the real-analytic setting and import ideas from control theory which show that, typically, these objects have a large domain of influence.

fields
Dynamical Systems
pdf ↗ page arXiv:2605.15922 ↗

We develop a quantitative statistical theory of transformers in the large-context regime by adopting the abstraction of contextual flow maps (CFMs): dynamical systems that evolve a distinguished token in the presence of a contextual measure across a stack of attention blocks. Within this framework, the finite-context model approximates an idealized infinite-context system in which the contextual measure is replaced by its underlying population, so that the context length $n$ becomes a statistical resource. Exploiting the McKean–Vlasov structure of the dynamics and the classical machinery of propagation of chaos, we establish a forward bound controlling the deviation between the finite- and infinite-context CFMs uniformly along depth, and a backward bound controlling the deviation between the corresponding training trajectories uniformly across iterations of online gradient descent. Both bounds achieve the optimal Wasserstein rate $n^{-1/d}$ for general CFMs and parametric rate $n^{-1/2}$ for a restricted class of CFMs that includes transformers as a special case. The analysis rests on a new Eulerian adjoint formulation of the loss gradient and stability estimates for the resulting forward–adjoint system, both of which may be of independent interest.

comments
32 pages, 1 figure
fields
Analysis of PDEs, Optimization and Control, Probability, Statistics Theory
pdf ↗ page arXiv:2605.16747 ↗

In this paper, a novel dual-field structure-preserving mixed finite element discretization for the incompressible Hall magnetohydrodynamics (MHD) equations is introduced. It preserves pointwise mass conservation, magnetic Gauss law, and conservation of current density. It also satisfies a discrete energy law that exactly captures the correct energy dissipation rate in the dissipative regime and recovers energy conservation in the ideal limit. Numerical experiments are presented to verify the temporal and spatial accuracy and to illustrate the structure-preserving properties of the scheme.

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

Completeness proofs in categorical semantics usually proceed by building a syntactic category whose composition is given by substitution. For untyped effectful Call-by-Value languages, this runs into a basic obstacle: there is no canonical notion of simultaneous substitution of computations, since evaluation order is semantically meaningful. We address this by taking single computation substitutions, that is, binding steps, as primitive, and representing computation substitution by finite sequential lists composed by concatenation. We formalize this idea in a one-object Freyd-multicategorical setting. We introduce Freyd operads, separating a cartesian operad of values from a symmetric Ren-cartesian preoperad of computations, connected by a Freyd functor, and from any Freyd operad we construct a corresponding Freyd PROP of substitutions. We prove that this construction is representable and, in the strict one-object setting, left adjoint to restriction to codomain 1. Using the induced term model, we interpret untyped computational lambda-calculus with procedures and higher-order functions in weakly closed Freyd operads, and prove soundness, initiality, and completeness. This yields a categorical semantics tailored to untyped effectful computation and broad enough to encompass realizability-oriented models such as monadic combinatory algebras.

comments
Published in MFPS 2026
fields
Category Theory
pdf ↗ page arXiv:2605.21337 ↗

We study an excursion-dependent generalization of inverse-subordinator time changes for recurrent regenerative processes. Subordinators from an independent family are assigned to measurable classes of excursions and to the distinguished state at which the process is regenerative, and the random clock is constructed from the corresponding occupation times. Although the time-changed process is not necessarily regenerative or Markovian, we show that its transformed excursion point process is again Poisson and is obtained from the original excursion point process by a marking-and-mapping procedure. We also identify the transformed stagnancy component, on the original local-time scale, as a subordinator independent of this point process. We use this representation to study occupation- and waiting-time asymptotics. Under regular variation assumptions on the tails of the Lévy measures of the cumulative excursion lifetimes and stagnancy components, we prove a multiscale joint occupation-time limit theorem, including generalized arcsine laws and Darling–Kac-type limits. We further obtain joint scaling limits for the last and next visit times to the distinguished state.

comments
57 pages
fields
Probability
pdf ↗ page arXiv:2605.23659 ↗

We study stochastic density control between Gaussian-mixture endpoint distributions under Brownian prior dynamics. Since the direct Schrödinger bridge between Gaussian mixtures is generally not available in closed form, we introduce a lifted path-space construction in which each trajectory is augmented with a source–target component label. Consequently, the problem decomposes into Gaussian component-to-component Schrödinger bridges with explicit marginal, drift, and cost formulas, while the mixture-level assignment reduces to a finite-dimensional entropic coupling problem with a Sinkhorn scaling form. We then analyze the projection obtained by discarding or forgetting the label. By construction, the projected law satisfies the original Gaussian-mixture endpoint constraints, but its relative entropy generally differs from the lifted relative entropy by a nonnegative conditional label-information gap. This gap reveals a path-space obstruction: the lifted optimizer cannot, in general, be identified with the direct unlabeled Schrödinger bridge after projection. We also derive the posterior-averaged Markov drift associated with the projected marginal flow, prove a kinetic-energy upper bound, and identify a common path-potential condition under which the projection gap vanishes. Several numerical illustrations showing density and shape control are recorded for a self-contained exposition.

comments
37 pages; revised version of a journal submission with a new section on duality certificates
fields
Optimization and Control
pdf ↗ page arXiv:2605.24795 ↗

Entropy-regularized optimal transport is widely used to compare and align data distributions, but Sinkhorn can converge slowly at small regularization. We introduce Acc-Sinkhorn, a two-state Hessian-driven Nesterov iteration built on the dual mirror geometry of the row-reduced Sinkhorn map. The method combines momentum acceleration with an inexpensive descent safeguard, sta- ble log-domain evaluation, and a prescribed homotopy schedule requiring neither line search nor curvature estimation. We prove global linear convergence of the safeguarded method, rule out con- secutive restarts, and establish local accelerated convergence for fixed parameters without restarts through spectral analysis. Numerical comparisons with six methods on synthetic problems, color transfer, and bilingual word alignment show runtime speedups of up to about 26 over Sinkhorn, with additional rendering-accuracy comparisons for color transfer.

fields
Optimization and Control
pdf ↗ page arXiv:2605.30267 ↗

We study local coordination on finite graphs, equivalently, the ability of randomized local protocols with independent private randomness to produce highly correlated outputs at neighboring vertices. Hutchcroft, Rospuskova, and Tamuz (2026) showed that if such local coordination can be achieved with low cost, then the graph admits a low-cost leader profile, or equivalently an appropriate bounded-radius decomposition, with a square-root loss in the cost. We substantially improve this bound for unbiased binary outputs. If the average disagreement is $\varepsilon$, we construct a leader profile of cost $O(\varepsilon\log(1/\varepsilon))$. The key ingredient is an information-theoretic influence measure: after fixing an ordering of the independent information sources, we assign to each binary output the increments of mutual information revealed along that ordering. For two outputs that disagree with probability $p$, the corresponding measures are within binary entropy $h(p)$ in total variation. Combined with a grand coupling theorem, this yields the improved bound. We also show that a universal linear bound is impossible. We construct graphs with binary local profiles of cost $O(\varepsilon)$ for which every leader profile has cost $$ Ω\!\left(\varepsilon\sqrt{\log(1/\varepsilon)}\right). $$ The construction uses weighted majority functions and can be implemented as an action-symmetric Nash equilibrium, giving a negative answer to the question of HRT whether leader equilibria are always optimal up to a constant factor. Finally, we show that the binary assumption is essential: for general real-valued outputs, the square-root dependence of the HRT theorem is sharp up to a universal constant.

fields
Information Theory, Probability
pdf ↗ page arXiv:2606.01963 ↗

In this article, we propose an algorithmic approach to determine the integer points located near a transcendental curve. This approach is closely related to a celebrated work by Bombieri and Pila and to the so-called Coppersmith's method. We establish the underlying theoretical foundations, prove the algorithms, study their complexity and present practical experiments; we also compare our approach with previously existing ones. From a practical point of view, we focus on an instance of our general problem, called the Table Maker's Dilemma, whose solving makes it possible to evaluate a given function with correct rounding. Our experiments show a significant speedup. In particular, our results show that the development of a correctly rounded mathematical library for the binary128 format is now possible at a much smaller cost than with previously existing approaches.

fields
Number Theory
pdf ↗ page arXiv:2606.04858 ↗

We analyze electron dynamics in a plane electromagnetic wave using the Landau-Lifshitz equation with a quantum radiation reaction correction modelled by a Gaunt factor. In this geometry, the quantum parameter $χ$ depends solely on the lightfront momentum, allowing the modified equation of motion to retain the integrable structure of the classical problem. We derive a semi-analytical solution for the energy evolution and the four-velocity, which reduces to the known classical result in the appropriate limit. The results provide an analytical and deterministic description of semiclassical radiation reaction in plane-wave fields.

comments
15 pages, 5 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2606.05205 ↗

Berwald-Finsler spacetimes are Finsler spacetimes that are closest to pseudo-Riemannian geometry, as their canonical nonlinear connection defines an affine connection on spacetime. In this paper, we find the first exact, non-Ricci flat, $SO(3)$-symmetric Berwald solutions to the Finsler gravity vacuum equation. To this aim, we first select from all spherically symmetric Berwald spacetimes, the only class that admits flat Finsler spacetime structures, making it particularly suitable for future investigations of asymptotic flatness. Then, for this class, we completely solve the Finsler gravity vacuum equation, and find three families of solutions. In particular, we show that in Finsler geometry there exist $SO(3)$-symmetric, vacuum solutions that are not Ricci-flat. These solutions are promising candidates to model the gravitational field around compact objects, beyond their Riemannian description.

comments
This version corrects a misprint in equation (114) of the previous one
fields
Mathematical Physics, Differential Geometry
pdf ↗ page arXiv:2606.05427 ↗

We study an inverse source problem for fully nonlinear elliptic equations of the form \[ F(D^2u)=f \quad \text{in } Ω. \] The question is whether the source term can be recovered from the Dirichlet-to-Neumann map. In two dimensions, the first linearization does not immediately give uniqueness: it leaves a natural conformal ambiguity in the linearized coefficients. For homogeneous nonlinearities $F$ with injective differential $DF$, we show that this ambiguity has a precise meaning at the level of the equation itself, namely that the source is determined up to an explicit scalar factor. The main point of the paper is to show how this remaining factor can be removed. We use the second linearization to extract information which is invisible at first order, and combine it with an algebraic nondegeneracy condition on the nonlinearity. Under this condition, the residual ambiguity is forced to be trivial, and the Dirichlet-to-Neumann map uniquely determines the source. The result applies, in particular, to homogeneous admissible Hessian equations of Monge–Ampère type and related examples.

comments
24 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2606.06431 ↗

Stimulated by Aldroubi and his collaborator's recent work on dynamical sampling, we consider a homogeneous discrete dynamical system of the form $f_n = A f_{n-1}= A^{n}f, \quad f_0 = f$, where A is a bounded linear operator on a separable Hilbert space H, which is known as the evolution operator, and $f_0 \in \mathcal{H}$ is the unknown initial state. The associated dynamical samples are given by the collection $\{\langle A^n f, g\rangle: g \in \mathcal{G, 0 \leq n < n < L(g)}\}$, where $\mathcal{G} \subset H$, is a finite or countable sampling set and $L$ is a function $L: G \rightarrow \mathbb{N} \bigcup \{\infty\}$. We analyze the stability of perturbed dynamical sampling systems in the sense of Nagy and Pollard-Hilding. More precisely, we establish sufficient conditions for the stable recovery of an initial state from perturbed dynamical samples obtained by changing the sampling vector, the evolution operator, ro simultaneously both, within the framework of Nagy-type and Pollard-Hilding-type perturbation of frames.

fields
Dynamical Systems, Functional Analysis
pdf ↗ page arXiv:2606.08066 ↗

We consider an inverse boundary value problem for the time-independent Schrödinger equation in dimension three. We prove that the local Dirichlet-to-Neumann map defined near a boundary point uniquely determines the potential in a neighborhood of the boundary point in the interior. In particular, we show that the uniqueness question can be reduced to the injectivity of a weighted X-ray transform, which links inverse boundary value problems to integral geometry.

comments
The asymptotic expansion (4.20) does not hold since there is a cancellation
fields
Analysis of PDEs
pdf ↗ page arXiv:2606.10247 ↗

Lifted product codes are an important family of quantum low-density parity-check (QLDPC) codes, as they were the first QLDPC code family shown to be asymptotically good. Understanding the structure of their parity-check matrices $H_{\mathsf{X}}$ and $H_{\mathsf{Z}}$, as well as the associated Tanner graphs, is essential for analyzing their decoding behavior and error-floor performance. In this work, we show that the Tanner graphs of $H_{\mathsf{X}}$ and $H_{\mathsf{Z}}$ are indeed isomorphic, and investigate their graph-theoretical structure. We establish conditions ensuring the connectivity of these graphs and provide bounds on their minimal absorbing sets, providing new insight into the combinatorial structures influencing decoding performance.

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

The voter model is a classical stochastic process that models how opinions might spread through a network: at each step, every node lazily adopts the opinion of a random neighbour; eventually all nodes share the same opinion (consensus). Stronger connectivity should yield faster consensus. Berenbrink, Giakkoupis, Kermarrec, and Mallmann-Trenn (ICALP 2016) make this precise via the network's conductance: if the network has $m$ edges, minimum degree $d_{\min}$, and conductance at least $φ$, then the voter model reaches consensus in expected $O(m/(d_{\min}φ))$ steps. Their results extend to dynamic networks with fixed vertex degrees by considering the network's conductance at each time step. We introduce temporal conductance $Φ$, a more general connectivity measure for dynamic networks. Unlike static conductance, which collapses to $0$ whenever some snapshot is disconnected, $Φ$ captures connectivity through edges that appear at different times. We generalise the results of Berenbrink et al. from static conductance to temporal conductance, showing that the expected consensus time of the standard voter model is at most $O(m/(d_{\min}Φ))$. Moreover, we prove that this bound is tight up to constant factors. We expect temporal conductance to be a useful primitive for analysing other dynamics on temporal networks, and potentially time-inhomogeneous Markov chains more generally.

fields
Probability
pdf ↗ page arXiv:2606.13374 ↗

We study dependence measures between two discrete random variables. The measures vanish at independence and satisfy the data processing inequality (DPI): stochastic post-processing of one variable cannot increase dependence. We ask which such measures admit an exactly unbiased estimator from a fixed finite number of i.i.d. samples, a property equivalent to being polynomial in the joint probabilities. We distinguish fixed-alphabet DPI, which preserves the alphabet size of the variable being processed, from dimension-changing DPI. Under one-sided fixed-alphabet DPI, every measure with a continuously differentiable extension to a neighborhood of the closed probability simplex vanishes whenever one processed state has zero probability. If the processed alphabet is larger than the other alphabet, the measure is identically zero. If it has $n$ states and the other alphabet has at least $n$, every nonzero polynomial measure has degree at least $2n$ and requires at least $2n$ samples for unbiased estimation. Both bounds are attained by the Gram determinant. Under one-sided dimension-changing DPI, every family with the same boundary regularity is identically zero. These results yield sharp task bounds for multi-task peer prediction. For two agents with $n$ signals each, $2n$ tasks are necessary and sufficient for nontrivial expected payments that vanish for independent reports and cannot increase under memoryless stochastic garbling. Under these requirements, unequal signal-space sizes force the larger-alphabet agent's expected payment to vanish identically for any finite number of tasks.

fields
Information Theory
pdf ↗ page arXiv:2606.14225 ↗

In this paper, we study the existence of invariant sublinear expectations of Markovian semigroups on sublinear expectation spaces. To achieve this, we establish a complete metric space of sublinear expectations, on which we extend Harris' method to the nonlinear setting on the convergence of sublinear semigroups. We then explore two cases of $G\text{-}$diffusions by studying the Lyapunov function and the local Doeblin condition. One is the $G\text{-}$Brownian motion on the unit circle which is the case studied in Feng and Zhao(2021), but with the new method. Another is the multidimensional $G\text{-}$SDEs on the whole space $\mathbb{R}^d$. We establish, for the first time in the literature, the existence of the invariant sublinear expectation for $G\text{-}$SDEs under the non-degenerate and weakly dissipative assumption. For this, we prove that for a class of $G\text{-}$SDEs, the $G\text{-}$expectation can be represented as the supremum of the semigroup of a family of SDEs, of which the regularity is obtained by considering { oscillations and coupling of the nonlinear Markovian semigroup,} and the Denis-Hu-Peng representation for the distribution of $G\text{-}$Brownian motions.

comments
35 pages, this work has been accepted by the SIAM Journal on Mathematical Analysis
fields
Probability
pdf ↗ page arXiv:2606.15203 ↗

Combinatorics of graphs is a very powerful tool to unravel various properties of graph algebras. In particular, isomorphisms between graph algebras are often implemented by moves between their graphs. In this paper, we make these combinatorial methods functorial. Our categorical approach not only reveals the relationship between moves, but also leads to unexpected extensions of known moves (shifts and reductions) and the characterization of out-splits as admissible epimorphisms admitting a lifting of the source map. The former allowed us to go beyond isomorphisms and Morita equivalences, and the latter yielded a factorization lemma for out-splits. Better still, the functorial understanding of maximal out-splits permitted combining them with the derived-graph construction, which resulted in computing new proper endomorphisms of Cuntz algebras. Finally, the functorial implementation of balanced in-splits required the construction of a new category of graphs, where morphisms are given as homomorphisms of graph inverse semigroups. Thus, the combinatorics of moves brought a new tool to the realm of noncommutative topology where directed graphs are viewed as quantum spaces.

fields
Operator Algebras, Quantum Algebra
pdf ↗ page arXiv:2606.15439 ↗

Motivated by the known derived set $[1,+\infty)$ of multiple zeta-star values, we study finite multiple star harmonic sums and their infinite-depth limits. Divided differences give a cube-integral representation of their holomorphic interpolation on $\mathrm{Re}(s)>0$, which agrees with the Kawashima functions after reversal of the index. The finite-depth interpolations converge locally uniformly in $s$ as the depth tends to infinity, uniformly over all positive integer index sequences on compact subsets. For real $s>1$, these limits define a bijection from the infinite positive integer indices onto $(1,s]$. For each admissible infinite index, they tend to the corresponding multiple zeta-star limit as $\mathrm{Re}(s)\to+\infty$ with bounded imaginary part. For $\mathrm{Re}(s)>1$, we prove strict separation of every ordered pair of finite indices and of every ordered pair of infinite indices: either the difference or the difference divided by $s$ has positive real part throughout this half-plane, with the choice fixed by the pair. In particular, both index maps are injective. The proof uses a summation principle for functions with positive real part, established through positive integral representations and explicit kernel estimates.

comments
48 pages
fields
Number Theory
pdf ↗ page arXiv:2606.16627 ↗

We introduce a second-order approximation to the compressible atmospheric Euler equations with gravity that is invariant domain preserving and well-balanced with respect to stratified rest states, including isentropic and isothermal equilibria. The approximation is built upon discrete auxiliary states derived from a hydrostatic reconstruction of the density and potential temperature. These auxiliary states, together with an affine shift of the numerical state, provide local bounds needed for maintaining well-balancing and invariant domain preserving properties of the method. The numerical method is then verified and validated with analytic solutions, well-balancing tests, and typical benchmark problems for atmospheric flows.

fields
Numerical Analysis
pdf ↗ page arXiv:2606.19764 ↗

We derive a determinantal expression for the inhomogeneous asymmetric five vertex model in a rectangular geometry with arbitrary boundary conditions at the bottom and top. Standard non-intersecting lattice path, or free fermion, approaches are not applicable and the determinantal form thus is not immediate.

comments
30 pages, final accepted version
journal
Ann. Inst. Henri Poincare D (2026)
fields
Mathematical Physics, Combinatorics, Probability
pdf ↗ page arXiv:2606.22004 ↗

We introduce magnetic cotangent groupoids on the cotangent bundle of a Lie groupoid using normalized cocycles, and characterize when magnetic symplectic forms are multiplicative on these groupoids. We show that $\mathbb{S}^1$-central extensions of Lie groupoids yield such structures via symplectic reduction. For a Kac–Moody extension, the resulting deformation connects the coadjoint and gauge action groupoids, which are not Morita equivalent.

comments
Revised exposition; main results unchanged
fields
Symplectic Geometry, Differential Geometry
pdf ↗ page arXiv:2606.22288 ↗

In the present article, we consider $\mathbb{Z}_p$-extensions defined by restrictions on ramification at $p$-adic primes. We study the finiteness, the existence of non-trivial finite submodules, and the triviality of the unramified Iwasawa modules of these $\mathbb{Z}_p$-extensions. In addition, we give a new sufficient condition for Greenberg's Generalized Conjecture with some non-trivial concrete examples.

comments
27 pages
fields
Number Theory
pdf ↗ page arXiv:2606.22324 ↗

The Mori-Zwanzig formalism provides a systematic framework for deriving reduced-order model of dynamical systems when only part of the state is observed, but its practical use is often limited by the complexity of the resulting computations. This paper develops an explicit formulation of the Mori-Zwanzig equation for linear time-invariant systems under partially observed observables. By expressing the dynamics in terms of observables, the Koopman generator, and projections onto resolved and unresolved components, we derive closed-form representations of the Markovian, noise, and memory contributions that arise in the Mori-Zwanzig identity. For the linear setting, the resulting formulas recover the reduced dynamics obtained from the variation-of-constants formula while retaining the operator-based structure of the Mori-Zwanzig approach. This makes the derivation a transparent reference case for reduced-order modelling with memory and clarifies how unresolved variables influence the observed dynamics through history-dependent terms. The analysis also identifies the ingredients needed for extensions to nonlinear systems and more general projections, including spectral filtering and data-driven approximations of memory effects. Analytical and numerical examples involving the harmonic oscillator and wave equations illustrate the construction and demonstrate how the formalism can be used to obtain interpretable reduced-order models for partially observed systems.

journal
Proc. Appl. Math. Mech. 26(4) (2026), e70222
fields
Dynamical Systems
pdf ↗ page arXiv:2606.23341 ↗

For any infinite one-relator group $Γ=\langle S \mid w^m\rangle$, we prove that $\mathrm{cost}(Γ)=|S|-\frac{1}{m}$. For such groups, this gives $β^{(2)}_1(Γ)=\mathrm{cost}(Γ) - 1$, answering a special case of Gaboriau's question on the relationship between cost and first $\ell^2$-Betti number.

comments
13 pages
fields
Group Theory, Dynamical Systems, Operator Algebras, Probability
pdf ↗ page arXiv:2606.23506 ↗

We introduce the notion of tropical regularity as a generalization of tropical smoothness and present a geometric classification conjecture for tropical regular cycles. Roughly, the conjecture predicts that every regular tuple either forms a regular fibration or descends via a lattice projection to one of finitely many minimal-model cycles. Our main results establish this conjecture in three fundamental cases:unmixed regular tuples $(T,\ldots,T,[F])$ with $L(T)=\{0\}$ and $[F]$ spanning its ambient space; regular tropicalizations of complete intersections with generic coefficients; and regular tropical $2$-cycles satisfying the Hodge index inequality and spanning their ambient space.

fields
Combinatorics
pdf ↗ page arXiv:2606.24339 ↗

We show that random linear codes (RLCs) possess nearly optimal discrepancy-type properties in a broad range of settings. Our main results are two general discrepancy theorems: one controls all translates of a fixed test, and the other controls large families of Fourier-pseudorandom tests. Two motivating examples follow: First, RLCs behave essentially like unstructured random codes for list-decoding from errors above capacity. More precisely, an RLC $C\subseteq \mathbb{F}_q^n$ of rate $1 - \frac{1}{n}\log_q|B_ρ| + \varepsilon$, where $|B_ρ|$ is the volume of a radius-$ρ$ Hamming ball in $\mathbb{F}_q^n$, satisfies $|C \cap B| = (1\pm o(1)) \frac{|C|\cdot |B|}{q^n}$ simultaneously for all radius-$ρ$ Hamming balls $B$ with high probability. This significantly strengthens the best prior results, which follow from work by Blinovsky (1987, 1990) and Levitin (1988) on the covering properties of RLCs. Second, over prime fields, RLCs behave essentially like unstructured random codes for zero-error list-recovery, and list-recovery from erasures, above capacity. More precisely, for a prime $q>2$ and input list size $2\leq \ell\leq q-1$, an RLC $C\subseteq \mathbb{F}_q^n$ of rate $1-\log_q \ell+\varepsilon$ will satisfy $|C \cap S| = (1\pm o(1)) \frac{|C|\cdot \ell^n}{q^n}$ simultaneously for all combinatorial rectangles $S=S_1\times S_2\times\cdots\times S_n$, where $|S_i|=\ell$ for all $i$, with high probability. An analogous result also holds when we can bound $|S_i|$ only for some of the $i$'s. We use this to show the abundance of locally leakage-resilient $n$-party linear ramp secret sharing schemes with any linear reconstruction threshold and sublinear threshold gap $O(n/\log n)$ over fields of polynomial size $q=Θ(n^γ)$ for a constant $γ\in(0,1/5)$. Prior work was stuck at reconstruction thresholds above $n/2$ for both threshold and ramp schemes.

comments
66 pages. Updated discussion of related work
fields
Information Theory, Combinatorics
pdf ↗ page arXiv:2606.24471 ↗

A variational minimum principle for linear elastodynamics of a possibly heterogeneous material without a stored energy function is developed. It involves a change of variables to dual fields, and results in a degenerate elliptic Euler-Lagrange system, even when the primal elastodynamics is hyperbolic. Uniqueness assertions for the dual dynamic and static problems and implications of the degenerate ellipticity are sketched. Some implications pertaining to heterogeneous materials and ones with indefinite elastic moduli are discussed.

comments
This preprint was suggested as a submissiion for math.AP by arxiv - there is no separate category on arxiv for theoretical Solid Mechanics
journal
JTCAM, Nov. 4, 2026
fields
Analysis of PDEs, Optimization and Control
pdf ↗ page arXiv:2606.24782 ↗

We study the equivariant lifting of cleft extensions of abelian categories and its impact on singularity categories. Specifically, we establish the necessary framework for lifting a cleft extension to a G-equivariant cleft extension. Furthermore, we prove that a restriction functor associated to a cleft extension induces a singular equivalence if and only if its equivariant counterpart does. As a concrete application, we demonstrate that the skew group ring of a $G$-equivariant $θ$-extension is isomorphic to a $\widehatθ$-extension of the base skew group ring, allowing us to lift singular equivalences for these structures.

comments
16 pages. v2: Corrections and additions. Comments are welcome!
fields
Representation Theory, Category Theory, Rings and Algebras
pdf ↗ page arXiv:2606.25560 ↗

In this article, we consider the anisotropic Calderón problem of determining the potential from boundary measurements of the time-independent Schrödinger equation on compact Riemannian manifolds with boundary. We prove a global uniqueness theorem for small perturbations of the Euclidean metric.

comments
The asymptotic expansion (4.23) does not hold since there is a cancellation
fields
Analysis of PDEs
pdf ↗ page arXiv:2606.26540 ↗

We introduce avalanche homology as a new (di)graph homology theory, based on the dynamics of the sandpile model. Avalanche homology is the simplicial homology of the avalanche complex generated from the sets of unstable vertices at the time steps of the sandpile dynamics. In this work we focus on digraphs, and our main results give the homotopy types of the avalanche complex for directed paths and directed cycles for certain initial configurations of the sandpile dynamics. Even for such simple digraphs a wide range of topologies can arise, and we compare this to the directed flag complex and to the recently introduced burning homology. Furthermore, the dynamics yields very naturally a filtered simplicial complex, and hence persistent avalanche homology.

comments
28 pages, 9 figures
fields
Algebraic Topology, Combinatorics
pdf ↗ page arXiv:2606.26786 ↗

We establish two Korovkin-type approximation theorems for sequences of positive linear operators acting on continuous functions on $[0,\infty)$. The first result shows that pointwise convergence on all polynomial test functions implies pointwise convergence for every function in the domain that is dominated by a polynomial. The second result provides an analogous criterion for functions of exponential growth, where the test functions are the exponentials $e^{λx}$, $λ\in\mathbb{R}$. The results are applied to several classical and modified positive linear operators, including Baskakov, Szász–Mirakjan, Phillips, Post–Widder, Gamma, and Durrmeyer-type operators. Further applications are given to operators associated with modified Bessel functions and hyperbolic functions. The approach provides a unified framework for deriving pointwise convergence on unbounded intervals from convergence on suitable test functions.

fields
Numerical Analysis
pdf ↗ page arXiv:2606.27517 ↗

We investigate linear lumping for parameter-dependent mass action reaction networks, distinguishing between generic and critical parameter regimes. For generic parameters -- those ranging in some non-empty open subset of parameter space -- we prove that exact linear lumping yields only "obvious" reductions: elimination of non-reactant species or projections along stoichiometric first integrals. This characterization extends to reaction networks with product-form kinetics, including Michaelis-Menten and Hill-type rate laws. For mass action systems we proceed to develop an algorithmic approach to identify critical parameter sets -- algebraic subvarieties in parameter space where non-trivial lumpings become available. This procedure reduces the determination of lumping maps to a system of finitely many polynomial equations. It also applies to constrained lumping scenarios (which are frequently motivated by chemical considerations). We then review and extend results about proper lumpings. Finally, we discuss lumpings of a self-replicator system, and of a two-pathway enzyme mechanism, to document the viability of our methods in relevant scenarios. Our results clarify the relationship between structural (parameter-independent) and fine-tuned (parameter-dependent) reductions, with implications for approximate lumping when system parameters lie near critical values

comments
57 pages, 4 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2606.28895 ↗

In this paper, we consider operators that are compositions of an isometric isomorphism and a left multiplier on a Banach algebra, and we provide necessary and sufficient conditions for these operators to have a dense set of periodic elements. As an application of this result, we characterize generalized weighted shifts with a dense set of periodic elements on the standard Hilbert module over C*-algebra of compact operators on a separable Hilbert space. As another application, we characterize generalized weighted shifts with a dense set of periodic elements on the standard Hilbert module over commutative non-unital C*-algebra. Finally, in the last section of the paper, we provide extensions of these results from the case of a sequence generated by powers of a single operator to families of operators indexed over a countable set.

fields
Functional Analysis
pdf ↗ page arXiv:2606.29525 ↗

Let $Ω$ be a bounded domain in $R^d$. Denote by $λ_k$ (resp. $μ_k$) the eigenvalues of the Laplace operator in $Ω$ with Dirichlet (resp. Neumann) boundary conditions. Denote by $Ψ= Ψ(d,k,Ω)$ the shift of indices in the inequality $μ_{k+Ψ} \le λ_k$. We are interested to describe the behaviour of $Ψ$ for large $d$. We prove that a) $Ψ(d,1,Ω) \ge C (e/2)^d$ for all domains $Ω$; and b) $Ψ(d,k,Ω) \ge C (e/2)^d$ for all $k$ and all convex domains $Ω$.

comments
Proof of Theorem 1.7 is added
fields
Spectral Theory, Analysis of PDEs
pdf ↗ page arXiv:2606.30120 ↗

Functional principal component analysis has traditionally focused on processes indexed by Euclidean domains, although functional observations increasingly arise on curved domains. We develop functional principal component analysis for real-valued processes observed at discrete locations on a general Riemannian manifold. We estimate the mean and covariance functions using intrinsic kernel smoothing based on geodesic distance and a normal-coordinate volume correction, with a general weighting scheme accommodating unequal numbers of observations across subjects. We establish $L^2$ and uniform convergence rates for these estimators and derive corresponding error bounds for the estimated eigenvalues and eigenfunctions. These results quantify how manifold dimension, sampling frequency and the weighting scheme affect estimation accuracy and characterize the phase transition between sparse and dense sampling regimes. Simulation studies on the circle and sphere, together with real-data applications, illustrate the finite-sample performance of the proposed methodology.

comments
55 pages, 4 figures, 3 tables
fields
Statistics Theory
pdf ↗ page arXiv:2606.31465 ↗

Non-fixed flexible antenna architectures, such as fluid antenna system (FAS), movable antenna (MA), and pinching antenna, have garnered significant interest in recent years. In this paper, we deploy a rotatable antenna (RA) array at the base station (BS) to improve the integrated sensing and communication (ISAC) performance by exploiting the additional spatial degrees of freedom (DoFs) introduced by antenna rotation. To enhance the sensing performance over an extended region containing a potential target while meeting the communication requirements of multiple users, we aim to maximize the minimum echo signal power within the sensing region, subject to required minimum communication rates of the users. For the special case of a single user and a point target, we develop a tractable approximation of the original problem, leading to independent per-RA subproblems. We characterize the geometric structure of these subproblems and derive closed-form solutions. Under the far-field approximation, the per-RA subproblems become approximately identical, allowing a common pointing vector to be adopted for all RAs. For the general multi-user and regional sensing case, we propose an alternating optimization (AO) algorithm that alternately optimizes the transmit beamforming for communication, the covariance matrix of the probing signal, and the pointing vectors of the RAs in an iterative manner. Simulation results demonstrate that the proposed RA-enabled ISAC system significantly outperforms various benchmark schemes with restricted antenna-orientation flexibility, while the evaluation of the Cramér-Rao bound (CRB) further verifies its benefits for target-position estimation accuracy.

comments
16 pages, submitted to IEEE for possible publication
fields
Information Theory
pdf ↗ page arXiv:2606.31466 ↗

We derive an explicit bound for the L2-L2-gain of linear time-invariant systems whose output is a quadratic function of the state and the input. Such systems appear naturally in many areas, for example for port-Hamiltonian systems, optimal-control, and stochastic problems. In case the output is purely quadratic in the state, the bound is determined by the supremum over $ω\in\mathbb R$ of the L2-norms of the bivariate transfer function restricted to the anti-diagonals $\{(s,\, iω-s)\mid s\in i\mathbb R\}$ of the frequency domain $i\mathbb R\times i\mathbb R $. Further, we show how the bound can be computed by solving linear matrix equations. This result provides a practical tool for assessing and reducing quadratic-output models.

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

This monograph provides an introduction to mean field reinforcement learning through the lens of Markov decision processes arising from large-population stochastic control with mean field interactions and common noise. Starting from the connection between multi-agent reinforcement learning and mean field control, it develops the probabilistic, mathematical, and control-theoretic framework needed to formulate representative-agent learning problems, analyze their relationship with finite-population systems, and study both general and linear-quadratic models. The presentation includes dynamic programming principles, propagation-of-chaos limits, and theoretical analyses of tabular Q-learning and policy-gradient methods. It also discusses numerical implementations, including tabular schemes and deep reinforcement learning methods such as deep deterministic policy gradient. The goal is to give readers a coherent bridge between mean field control theory and reinforcement learning methodology, emphasizing the mathematical structure of the problems and the design of tractable learning approaches for large stochastic populations.

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

We prove that the classical and the quantum flat torus can be rigorously approximated at a differential level by finite-dimensional fuzzy tori within the framework of the spectral propinquity, a distance up to unitary equivalence which we extend in this paper to the space of twisted, metric spectral triples. Standard attempts to establish this convergence are traditionally obstructed by the intrinsic non-locality of discrete calculus and the subsequent failure of the Leibniz rule. While contemporary alternatives such as spectral truncations circumvent this issue by abandoning $C^*$-algebras in favor of operator systems, our approximations instead remain within the $C^*$-algebraic category, generalizing the commutator formula used to define the Lipschitz seminorm induced by spectral triples. To this end, we introduce a relaxed notion of a twisted spectral triple where the twist is a linear map acting as a discretized Riesz transform that encapsulates the non-locality of the discrete world. Self-adjointness is obtained by adjoining the backward difference to the forward difference and representing this doubled calculus with the creation and annihilation operators of the CAR algebra. The maximum of the norm of the twisted commutator and norm of the displacement of the twist from the identity becomes our Lipschitz seminorm, from which the quantum metric structure of quantum compact metric spaces (QCMS) on fuzzy tori is constructed. Our proposal to connect twisted spectral triples with QCMS recovers the usual connection between metric spectral triples and QCMS. By extending the spectral propinquity to this generalized setting of twisted spectral triples with possibly unbounded twists, we prove that fuzzy tori equipped with their natural two-sided discrete calculus converge to an amplification of the standard flat Dirac triple, while the underlying twists converge to the identity.

comments
50 pages. Minor misprints corrections, improved introduction, per referee report. Previous version correction: The definition of the twist is relaxed somewhat, without needing any change in the proofs, but to make it compatible with a subsequent paper on C*-crossed products which uses this technique
fields
Operator Algebras
pdf ↗ page arXiv:2607.01681 ↗

Why does quantum relative entropy occupy such a privileged role among measures of distinguishability? We show that a single operational principle determines it. If one pair of states can be distinguished at least as successfully as another for every prior, when both are assisted by the same auxiliary pair, acting as a catalyst, a distinguishability measure should assign it no smaller value. Remarkably, for a normalized measure, this requirement singles out Umegaki relative entropy under mild classical continuity and expansibility on uniform distributions: adding impossible outcomes leaves their associated entropy unchanged. Qubit catalysts already suffice. No additivity or quantum continuity is assumed. We also prove that, without auxiliary assistance, respecting binary discrimination dominance uniquely determines the quantum extension of every regular classical divergence, including the Hirche–Tomamichel extensions of classical $f$-divergences. For additive classical divergences, these extensions respect classical catalysis; allowing noncommuting qubit catalysts is what singles out Umegaki relative entropy.

comments
Major revision with a substantially stronger uniqueness theorem: catalytic Lorenz monotonicity characterizes Umegaki relative entropy without assuming additivity; full-rank qubit catalysts suffice. Includes a new proof and results distinguishing classical from quantum catalysis
fields
Mathematical Physics
pdf ↗ page arXiv:2607.01712 ↗

We consider the Sherrington-Kirkpatrick spin glass model at the critical inverse temperature $β= 1$ with zero external field. We prove that the free energy $F_N = F_{N,β=1}$ of this model has variance \[ \mathrm{Var}(F_N) = \frac16 \log N + O(1)\,, \] confirming a physics prediction of Aspelmeier \cite{aspelmeier2008free}, and that the centered and scaled $F_N$ satisfies a Gaussian CLT. We also identify the critical two-replica overlap scale, proving \[ \mathbb{E} \langle R_{1,2}^2\rangle \asymp N^{-2/3}\,, \] as conjectured by Talagrand \cite{talagrand2011mean2}, together with a uniform exponential moment bound for $N^{1/3} |R_{1,2}|$. The key input is a critical reweighted moment method, in the spirit of the ``small subgraph conditioning'' technique from probabilistic combinatorics, but capable of capturing diverging fluctuations. Through this reweighting, we relate the critical SK model to the BBP critical edge, which determines the overlap and fluctuation scales.

comments
41 pages. v3: updated introduction and overview
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2607.02172 ↗

In a recent paper \cite{q}, Quinn-Gregson fully classified ultrahomogeneous mono-unary algebras of arbitrary cardinalities. In particular, he proved that every 1-ultrahomogeneous mono-unary algebra is ultrahomogeneous, and every locally finite mono-unary algebra with finitely many 1-orbits is $ω$-categorical. It is also known that every 1-homomorphism homogeneous mono-unary algebra is homomorphism-homogeneous \cite{ed}. Very naturally, Quinn-Gregson asked if these three results can be generalized to unary algebras. This short note answers the first and the third question negatively by providing two simple counterexamples. We also show that the second question has a positive answer in ``tree-like" cases which covers his result to mono-unary algebras and has a small combinatorial implication.

comments
Add a counterexample to a new question in Quinn-Gregson's updated version
fields
Logic
pdf ↗ page arXiv:2607.02725 ↗

We establish an explicit symmetric spectral reciprocity formula for twisted fourth moments of $\mathrm{GL}_{2}$ $L$-functions over an arbitrary number field. A Rankin–Selberg kernel gives a new analytic regularization of the formal Petersson identity for products of Eisenstein series, based on the rank decomposition $4=2+2$. The formula preserves the nonnegativity of the amplified fourth-moment spectral side at general levels. We further identify a new \emph{square-level concentration phenomenon}: after amplification, the dominant off-diagonal contribution comes from representations whose conductor is the square of a product of two distinct primes. Using square-level local test functions in the relative trace formula, we prove new hybrid subconvexity bounds for twisted $L$-functions. Combining these bounds with symmetric spectral reciprocity and amplification, we obtain the uniform estimate \begin{align*} L(1/2,π)\ll_{F,\varepsilon} C(π)^{\frac{1}{4}-\frac{1}{120}+\varepsilon} \end{align*} for every unitary cuspidal automorphic representation $π$ of $\mathrm{GL}_{2}/F$ with arbitrary central character. We also obtain stronger bounds for fixed central characters, a prime-level fifth-moment estimate, and applications to Rankin–Selberg and ring class $L$-functions.

comments
73 pages
fields
Number Theory
pdf ↗ page arXiv:2607.04476 ↗

We investigate steady compressible Euler flows in two-dimensional infinitely long nozzles, where the piecewise smooth upstream data admit a contact discontinuity. Except for the subsonicity condition, no additional constraints are imposed on the data. We establish existence and uniqueness on the maximal interval of wall amplitudes containing the straight-nozzle configuration, and show that the contact discontinuity curve is of class $C^{2,α}$. An Euler–Lagrange transformation reduces the problem to a scalar elliptic equation in divergence form on a fixed strip, with discontinuous coefficients and the contact discontinuity conditions incorporated into the weak formulation. We further investigate the downstream asymptotic behavior and show that the convergence rate of the flow matches that of the nozzle walls.

fields
Analysis of PDEs
pdf ↗ page arXiv:2607.04804 ↗

The present paper is an extended version of the lecture notes of a course given by the first author at the summer school on Formulas of Siegel and Weil (Bielefeld, September 2025). We survey three perspectives on the Siegel-Weil formula: classical, geometric, and arithmetic. We first recall the Siegel-Weil formula for elliptic theta series arising from positive definite lattices. We next discuss the higher genus case for lattices of arbitrary signature from an adelic viewpoint. After introducing orthogonal Shimura varieties, we present the geometric Siegel-Weil formula, in which the generating series of volumes of special cycles is shown to be an Eisenstein series. We conclude with the (partly conjectural) arithmetic Siegel-Weil formula, relating degrees of special cycles in arithmetic Chow groups to central derivatives of Eisenstein series.

comments
25 pages, few minor improvements. To appear in the Schiermonnikoog volume "Moduli Spaces and Modular Forms" edited by EMS Press
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2607.06285 ↗

Since self-orthogonal codes, few-weight codes and linear complementary dual codes(LCD codes, for short) have nice applications in coding theory and cryptography, they have received continuous attention. In 2024, by introducing the notion of the augment code, Heng et al.[16] constructed several classes of few-weight self-orthogonal codes basing on defining sets, which are introduced by Ding et al.[7] in 2007. In this manuscript, for two classes of defining sets, we consider the corresponding augmented codes, construct three classes of four-weight self-orthogonal projective codes and determine the parameters of their dual codes. And then, we construct three classes of LCD codes. In particular, we prove that there exists a class of these LCD codes whose dual codes are almost optimal LCD codes according to the sphere packing bound.

comments
18pages
fields
Information Theory
pdf ↗ page arXiv:2607.07181 ↗

We compare two Polish presentations of separable real Banach lattices: closed sublattices of a universal lattice and closed ideals of $\operatorname{FBL}[\ell_1]$. We construct translations preserving lattice isometry in both directions, continuous and injective from sublattices to ideals and Borel in the reverse direction. Natural generation and Fremlin tensor operations are $\boldsymbolΣ^0_2$-measurable with $G_δ$ graphs. Isometric lattice isomorphism in either universal coding is Borel bireducible with a complete orbit equivalence relation of Polish-group actions. Uniform monotonicity and order uniform smoothness are $\boldsymbolΠ^0_3$-complete in both codings, whereas strict monotonicity, order smoothness, and order continuity are coanalytic. Abstract $L_p$ and AM-spaces form closed classes of sublattice codes. We also give explicit Borel bounds for atom counts, compact order intervals, and the lattice-isometry classes of $L_p[0,1]$, $\ell_p$, and $c_0$.

comments
29p
fields
Functional Analysis, General Topology, Logic
pdf ↗ page arXiv:2607.08064 ↗

Given a fence poset P , we define a new statistic on permutations, denoted by blP, that provides a combinatorial interpretation of the coefficients of the order polynomial of P , answering a question of Ferroni, Morales, and Panova (2025). Using the fact that the base polytope of a lattice path matroid can be decomposed into order polytopes of fence posets, we also obtain a combinatorial interpretation of the coefficients of the Ehrhart polynomial of the base polytope of Schubert matroids, answering a question of Stanley (1999). As an application of this statistic, we establish the first nontrivial lower bound for the linear coefficient of the Ehrhart polynomial of an order polytope. Finally, we conjecture generalizations of this statistic to skew-shape posets and circular fence posets.

comments
24 pages, 22 figures
fields
Combinatorics
pdf ↗ page arXiv:2607.11225 ↗

The paper studies martensitic microstructures in polycrystals, focussing on their compatibility across grain boundaries. After a reduction to the case of a planar grain boundary, the case when the grain boundary separates two constant gradients of zero energy is considered. It is shown that for cubic-to tetragonal transformations such a configuration can occur when the relative grain rotation is not in the cubic group. Then the case when the grain boundary separates two simple laminates of zero energy is considered, it being shown using a computer-assisted symbolic calculation that in the cubic-to-tetragonal case compatibility is only possible for a closed set of measure zero in the manifold of grain boundary normals and relative grain rotations, and that a similar slightly weaker result holds for cubic-to-orthorhombic transformations. The results suggest why higher-order laminates are often observed for such transformations. The Taylor set of deformation gradients is defined and studied, this set having the property that any deformation whose gradient belongs to it corresponds to a zero-energy microstructure for the polycrystal independent of grain geometry and grain rotations. New upper bounds for the Taylor set are proved for cubic-to-tetragonal and cubic-to-orthorhombic transformations, generalizing those of Bhattacharya and Kohn using the geometrically linearized theory. We give a simple proof of a related result of Peigney characterizing the positive diagonal matrices in the quasiconvex hull of the energy wells for cubic-to-tetragonal transformations.

comments
29 pages. Revised. To appear in Journal of Elasticity
fields
Analysis of PDEs
pdf ↗ page arXiv:2607.12572 ↗

Snooker folklore holds that no single stroke can pocket all twenty-one object balls. We examine the claim in an explicit model: twenty-two equal disks on a rectangle with six pocket points, under constant rolling deceleration, frictionless collisions with normal restitution, and lossy specular cushions. We exhibit a configuration and a stroke, and prove in interval arithmetic that every stroke in an explicit box around it pockets all twenty-one object balls, so the set of successful strokes has positive measure. That set is a ribbon: every speed from 9.3213 to 12 m/s works, while the certified window of directions is 9.4813e-43 radians wide, a number explained by a first-order analysis of twenty near-grazing collisions. A second configuration, a near-frozen cluster, has a certified window 9.4e-4 radians wide, thirty-nine orders of magnitude wider; its certificate uses Taylor models of degree six. The strokes with a given list of events form a semialgebraic set, and the endpoints of the windows are algebraic numbers. For the regulation opening position we state the corresponding conjecture, and show that if it holds with a regular witness then a finite certified search establishes it.

comments
20 pages, 1 figure. v2: the witness of v1 was found not to survive exact arithmetic and is replaced by a certified one; adds the width and the lower edge of the ribbon, a second configuration with a wide window, and the semialgebraic structure. Code, data and certificates: https://github.com/avnerkantor/one-shot-twenty-one-balls (doi:10.5281/zenodo.23816267)
fields
Dynamical Systems
pdf ↗ page arXiv:2607.12995 ↗

The causal action principle for causal fermion systems is analyzed for a minimizing measure whose support is assumed to have the structure of a smooth manifold $\tilde{M}$. The concept of osculating vacua is introduced. It is shown that the Lagrangian induces on $\tilde{M}$ a Lorentzian metric. Moreover, the Euler-Lagrange equations of the causal action imply that the Ricci tensor must satisfy the Einstein equations of General Relativity for an energy-momentum tensor given in terms of a power expansion in the regularization length. The gravitational coupling constant is found to be the square of the regularization length. Our methods provide a systematic procedure for deriving corrections to the Einstein equations. The paper includes a self-contained introduction to causal variational principles and the causal action principle. Most geometric structures (connection, Riemannian metric and curvature) are introduced and analyzed in the general setting of causal variational principles for an arbitrary dimension of $\tilde{M}$. The Lorentzian setting works only for causal fermion systems and is worked out only in four spacetime dimensions.

comments
49 pages, LaTeX, 5 figures, many smaller improvements
fields
Mathematical Physics, Differential Geometry
pdf ↗ page arXiv:2607.13871 ↗

We investigate traveling wave fronts for an acid-mediated tumor invasion model with density-dependent degenerate diffusion. The model is a partially diffusive PDE–ODE system of Gatenby–Gawlinski type, in which the tumor diffusion coefficient $D(U)$ is allowed to be a general decreasing function satisfying $D(1)=0$. This degeneracy causes the traveling wave equation for the tumor component to lose uniform ellipticity near the healthy state, and hence standard arguments for nondegenerate reaction diffusion systems are not directly applicable. To overcome this difficulty, we introduce a nonlinear change of variables which removes the degeneracy from the highest-order term of the tumor equation. For each fixed admissible tumor profile, the acid profile is represented by a Green kernel, while the healthy-tissue profile is obtained from an explicit integral formula. The transformed tumor profile is then constructed as the stationary limit of a uniformly parabolic auxiliary problem. By combining comparison principles, local Schauder estimates, carefully chosen super- and sub-solutions, and the Schauder fixed-point theorem, we prove the existence of traveling wave fronts for every wave speed $θ\ge 2\sqrt{rD(0)}$. The resulting wave connects the tumor-dominant state $(0,1,1)$ at $z=-\infty$ to the healthy state $(1,0,0)$ at $z=+\infty$. We further establish strict pointwise bounds, monotonicity of all wave components, and one-sided exponential asymptotic estimates in both the transformed variable and the original traveling-wave variable.

comments
28 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2607.13944 ↗

Li and Boyle showed that the Penrose tiling defines a quantum error-correcting code: superpositions of tilings over isometry orbits protect quantum information against erasure of any bounded region. We extend the construction to the aperiodic monotiles discovered by Smith, Myers, Kaplan and Goodman-Strauss. For the Hat, we prove strong local indistinguishability for all Hat tilings, and we prove local recoverability unconditionally for all nonsingular Hat tilings via the torus parametrization of the underlying cut-and-project scheme. The remaining singular case reduces to one sharply posed geometric question -- can a region that is a union of hats be retiled a second way? -- which we verify computationally has no counterexample up to a substantial scale: a certified $2490$-tile patch admits precisely one tiling by hats, so all $2^{2490}$ of its tile-subregions retile uniquely. Unlike the Penrose, Ammann-Beenker and Fibonacci tilings, both monotiles form two local-indistinguishability classes, so their code spaces split into two erasure-correcting sectors carrying a superselected classical label. Whether the label survives depends on which isometries are gauged: the Spectre's classes are exchanged by a $30^{\circ}$ rotation and merge once all proper isometries are gauged, whereas the Hat's are exchanged only by reflections. Under the physically natural gauge group $SE(2)$, the Hat code therefore stores one robust classical bit -- the handedness of its long-range order, readable in any bounded window with separation $Δ= |K|\sqrt{5}/3$ -- alongside its protected quantum sectors. It is the reflexible monotile, not the chiral one, that carries the chirality bit. We give the exact Perron-Frobenius data of both codes, including the per-class reflected-Hat frequencies $(3\mp\sqrt{5})/6$ and the Spectre orientation-class frequencies $(5\pm\sqrt{15})/10$.

comments
Extended updated version
fields
Metric Geometry
pdf ↗ page arXiv:2607.15326 ↗

We study the joint diffusive-mean field limit for a system of weakly interacting kinetic Langevin dynamics, extending the results of Delgadino, Gvalani and Pavliotis (Arch. Ration. Mech. Anal., 2021) to the hypoelliptic/hypocoercive case. We show that, in the absence of phase transitions, the two limits commute, and we calculate the covariance matrix of the limiting Brownian motion using the Green-Kubo/Kipnis-Varadhan formula. However, at low temperatures, and in the presence of phase transitions, the two limits may not commute. We demonstrate our findings by providing a detailed analysis of the diffusive-mean field limit for the $O(2)$ model in a magnetic field. Our analysis is based on the systematic use of recently developed hypocoercivity techniques, together with an appropriate linearization of the mean field McKean-Vlasov-Fokker-Planck partial differential equation.

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

We introduce a family of polynomials satisfying the natural duality relations for Hermite interpolation, analogous to the classical Lagrange interpolation polynomials. They yield an explicit closed formula for the Hermite interpolant with arbitrary multiplicities, without recourse to divided differences, recursive corrections, or auxiliary Bézout identities. We also give a detailed account of Hermite's original approach to the problem, based on an integral formula, which he used both to derive the interpolating polynomial and to estimate the interpolation error for holomorphic data.(To appear in L'Enseignement Mathématique.)

comments
8 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2607.17998 ↗

Tamari lattices and weak Bruhat order are classical posets on the vertices of associahedra and permutohedra. These posets are particular instances of the \emph{flip order} on the vertices of graph associahedra. We present here a generalisation of the flip order to all the faces of nestohedra, encoded in terms of hypergraphs. For right-filled hypergraphs, we characterise our order in terms of generalised inversions. As an application, we describe shuffle products on faces of suitable nestohedra as sums over intervals in this order.

comments
50 pages
fields
Combinatorics
pdf ↗ page arXiv:2607.20132 ↗

We give a direct construction of the spectral projectors of a complex square matrix, based on explicit interpolation polynomials previously introduced. This yields a spectral resolution $A=\sum_{i=1}^r(λ_iP_i+N_i)$ from which the Primary Decomposition Theorem, the Cayley–Hamilton theorem, criteria for diagonalizability, and the spectral theorem for normal matrices are proved by short formal arguments. A weaker form of the construction, extends to any perfect fields via a Galois invariance argument and produces the Jordan–Chevalley decomposition.

comments
13 pages
fields
Spectral Theory, Operator Algebras
pdf ↗ page arXiv:2607.20218 ↗

We prove constant lower bounds for the spectral gap of the following random walks on unitary groups $\mathsf{SU}(2^n)$ on $n$ qubits. (i) Random Pauli Rotation: choose an $n$-qubit Pauli operator $P$ and an angle $θ\in [0,2π)$, both uniformly at random, and apply $e^{\mathrm i θP}$. (ii) Brickwork Random Unitary Circuit: choose $n-1$ unitaries $U_{i}$ uniformly at random from $\mathsf{SU}(4)$ (including central phases of the parent group) independently, and apply $U_{2j-1}$ on two qubits $2j-1, 2j$ and then $U_{2j}$ on two qubits $2j, 2j+1$. Importantly, the gap bounds are independent of $n$ and apply for all finite dimensional unitary representations of $\mathsf{SU}(2^n)$ uniformly. Our results immediately imply that the Random Pauli Rotation and Brickwork Random Unitary Circuit converge to approximate unitary $t$-designs after $\mathcal{O}(nt)$ steps. As a consequence, we improve implications for the complexity growth of random unitary circuits as a function of the depth. The existing argument can be applied almost verbatim, but previously the depth had to be $\mathcal{O}(2^{cn})$ for some $c < 1$. Our unconditional constant spectral gap removes this restriction. We prove analogous constant-gap results for orthogonal and Clifford groups; the latter is indispensable for our result on the Brickwork Random Unitary Circuit. The former implies convergence to approximate orthogonal $t$-designs. In this case, the implied mixing time with respect to a constant additive and multiplicative error is optimal (up to an absolute constant factor) for $t=2$.

comments
34 pages. 1 figure. Julia and Mathematica code (v3) added proof ideas and clarified local groups to include central phases
fields
Probability
pdf ↗ page arXiv:2607.20919 ↗

We give new proofs computing the asymptotic densities for orbits of the arithmetic Hecke triangle groups $Γ_q$ when $q=4$ and $q=6$. We use elementary number theory techniques along with basic properties of the Möbius function and Riemann zeta function with additional congruence conditions. This note actually came about by observing that, in the $q=4$ case, the underlying congruence condition partitions the set of coprime integer pairs into three classes of equal density.

comments
6 pages
fields
Number Theory
pdf ↗ page arXiv:2607.22142 ↗

In 2011/12, Ruskey, Sawada, Stevens and Williams showed that a binary universal sequence can be constructed containing all $n$-tuples of Hamming weight either $r$ or $r+1$ for every possible $r$, and no others. In this paper we examine extensions of this result that require choosing a weight-like function applying to $n$-tuples with symbols taken from an alphabet of arbitrary (finite) size. We consider three possible such weight functions, and in each case establish an analogous result to that of Ruskey, Sawada, Stevens and Williams.

comments
A number of errors and omissions have been rectified
fields
Combinatorics
pdf ↗ page arXiv:2607.22350 ↗

This paper studies a multi-player non-zero-sum optimal stopping game driven by a spider Brownian motion. We study a specific, tractable family of games and the focus is on the existence and uniqueness of subgame-perfect Nash equilibria (SPNE). We begin by analyzing the two-player setting, in which the underlying process is a skew Brownian motion, and establish sufficient conditions for the existence of an SPNE. We then derive sufficient conditions for the uniqueness of the SPNE in the symmetric case, (where the skew Brownian motion reduces to a standard Brownian motion and both players have the same payoff structures). We also give examples which show that there can be multiple SPNE or no SPNE. We then extend the framework to the multi-player setting and provide sufficient conditions for the existence of an SPNE in this more general setting with a spider Brownian motion.

fields
Probability
pdf ↗ page arXiv:2607.22416 ↗

We extend the theory of the first chiral homology group of vertex algebras, developed by van Ekeren and Heluani for elliptic curves, to compact Riemann surfaces of arbitrary genus. Our approach realizes a genus $g$ surface by iterated self-sewing of $g$ handles onto the Riemann sphere, each governed by a sewing parameter $ρ_i$ in a punctured disc. We construct an explicit complex computing the chiral homology groups $H^{\mathrm{ch}}_0$ and $H^{\mathrm{ch}}_1$ of a vertex algebra $V$ on a genus $g$ surface with $n$ marked points, and equip it with a projectively flat connection, with an explicit central-charge anomaly, over the $g$-dimensional space of sewing parameters. We prove a genus $g$ Fourier-space Borcherds identity for the associated modified vertex operators. We show that two finiteness assumptions 1) finite dimensionality of the first Poisson homology $\HP_1(R_V)$ of the Zhu $C_2$-algebra, and 2) finite generation of a certain Koszul homology of the associated graded algebra, imply finite dimensionality of $H^{\mathrm{ch}}_1(X,V)$ for every genus $g$ and every vertex algebra $V$. Using the degeneration $ρ_i \to 0$ together with the factorization theorem of Damiolini-Gibney-Tarasca, we relate the totally degenerate limit of $H_1^{\mathrm{ch}}$ to the Hochschild homology of an iterated construction on the Zhu algebra, and deduce vanishing of the first chiral homology group in every genus for rational vertex algebras.

fields
Functional Analysis
pdf ↗ page arXiv:2607.24719 ↗

We study ordinary kernel ridge regression over full Hölder-Zygmund balls, measuring errors in Sobolev norms and in pointwise and uniform losses for mixed derivatives. For targets of smoothness $s$, every RKHS norm equivalent to $H^{s+d/2}$ gives the optimal $H^r$ risk for $0\le r<s$; integer choices of $r$ include integrated squared derivative losses. Pointwise and uniform guarantees require additional kernel structure. A localized wavelet kernel attains the sharp derivative rates with the same regularization orders as for function estimation, whereas equivalent changes of the RKHS norm can destroy the population bias rates. For the ordinary Gaussian kernel with a shrinking bandwidth, we prove a uniform derivative risk bound with the optimal polynomial rate and an explicit, unoptimized logarithmic factor. The results allow bounded measurable design densities bounded away from zero and conditionally sub-Gaussian noise.

fields
Statistics Theory
pdf ↗ page arXiv:2607.26065 ↗

Blohmann's tangent functor makes the category of elastic diffeological spaces a Cartesian tangent category in the sense of Cockett and Cruttwell. We use this structure to develop Riemannian geometry on elastic diffeological spaces. Following Cockett and Cruttwell, with additional axioms for scalar multiplication, we introduce connections, covariant derivatives and curvature; for a Riemannian metric we prove a Koszul formula and the uniqueness of the Levi-Civita covariant derivative. Our main result is a variational characterization of geodesics: if a full connection whose vertical part is Levi-Civita admits a geodesic flow fixing the zero section, then the critical paths of the energy functional are exactly the paths satisfying the geodesic equation, and regular length-minimizing paths are geodesics after constant-speed reparametrization. On elastic spaces for which the real line is a curve object, completeness of the geodesic spray yields such a flow and uniqueness of geodesics. The results apply to quotients of complete Riemannian manifolds by free isometric actions of countable groups, such as irrational tori, and, under a tangent-commuting hypothesis, to mapping spaces from a closed manifold into elastic spaces for which the real line is a curve object, including free loop spaces of complete Riemannian manifolds.

comments
32 pages. v3: Substantially revised; preliminaries reorganized, assumptions for the variational characterization weakened, and applications to quotient and mapping spaces added
fields
Differential Geometry, Category Theory, Metric Geometry
pdf ↗ page arXiv:2608.01037 ↗

We develop the geometry of conformal mappings through Dirichlet operator symbols and the nonlinear wave equation. These symbols, introduced in the work of Hedenmalm and Shimorin (2020), are holomorphic functions on the bidisk associated with contractions on $L^2(\mathbb{D})$. For Grunsky operators, the nonlinear wave equation and the related Riccati equation induce a hierarchy of of differential relations along the diagonal. We use this jet hierachy to obtain alternative coordinates and a characterization of the manifold $Σ/\mathbb{C}$ of normalized exterior univalent functions modulo translations, without an explicit univalence test. This manifold may be viewed as an extension of the universal Teichmüller space beyond the quasicircle boundary setting. The diagonal jets also give rise to a hierarchy of \emph{diagonal series Schwarzian derivatives}. Already the fourth Schwarzian $S_4(ψ)$ leads to differential equations connected with the Weierstrass elliptic $\wp$ function and Painlevé I, revealing a comparison between the geometry of conformal mappings and that of complex tori. As a quantitative application of the framework, we interpret asymptotic variance through the Littlewood-Paley formula as an asymptotic density of quadratic nonlinearity energy under logarithmic averaging. We introduce Schwarzian asymptotic variance and obtain the upper bound $12.566563\ldots$ for its averaged squared hyperbolically normalized amplitude, in comparison with the classical pointwise bound $36$.

comments
56 pages
fields
Complex Variables, Differential Geometry
pdf ↗ page arXiv:2608.04666 ↗

In this work, we construct a generalization of the $G_n^k$-theory to the case of an arbitrary hypergraph. The case of spherical braids is considered separately, using the stratification of the moduli space $\mathcal{M}_n(S^2)$ and the hypergraph $Γ_n^{\mathrm{sph}}$ encoding projective constraints. In contrast to the original $G_{n}^{k}$ theory, where codimension-one properties are determined by exactly $k$ particles, the present work considers various cases corresponding to strata of codimension~$1$. These groups admit nice maps to free products of cyclic groups. Among unsolved problems, we emphasize the question how the above construction works for abelian varieties and, in particular, for elliptic curves.

comments
9 pages; referee's remarks taken into account; some formulations justified
fields
Geometric Topology
pdf ↗ page arXiv:2608.07976 ↗

A pre-symplectic left-symmetric algebra $\mathcal{A}$ is a left-symmetric algebra endowed with a nondegenerate skew-symmetric bilinear form $ω$ such that all left multiplication operators are symmetric with respect to $ω$. In this setting, the underlying subadjacent Lie algebra $(\mathcal{A}^{-},ω)$ forms a flat $T$-symplectic Lie algebra. This paper provides a systematic investigation into the structural properties of pre-symplectic left-symmetric algebras. In particular, we introduce a distinguished subclass termed \emph{Milnor pre-symplectic algebras}, and prove that any pre-symplectic left-symmetric algebra whose commutator ideal is nondegenerate necessarily belongs to this subclass. Next, we investigate the Levi-Civita product associated with symplectic Lie algebras. We show that this product always yields a right-symmetric algebra, and we prove that it forms a left-symmetric algebra if and only if it is associative. Furthermore, we provide a characterization of symplectic Lie algebras in terms of representations of left-symmetric algebras, and conclude by establishing a construction method for these structures known as the $T^*$-extension. Furthermore, we develop a double extension procedure for pre-symplectic left-symmetric algebras by means of commutative associative algebras. We show that every such algebra with a degenerate commutator ideal can be reconstructed via this extension process. More generally, we show that any pre-symplectic left-symmetric algebra is either a Milnor pre-symplectic algebra or can be obtained through a finite sequence of successive double extensions starting from a Milnor pre-symplectic algebra. As a concrete application of these structural results, we provide a complete classification of pre-symplectic left-symmetric algebras of dimension less than or equal to $4$.

fields
Rings and Algebras
pdf ↗ page arXiv:2608.08517 ↗

In this work, we revisit a continuous-time two-compartment pharmacokinetic model of human ethanol metabolism originally proposed by Levitt and Levitt. We first establish the positivity of the solutions, investigate the existence and uniqueness of a positive equilibrium, and analyze its local and global asymptotic stability. As a result, the global dynamics of the original ethanol metabolism model is characterized, thereby complementing and extending the analytical results reported in the original study. Second, building upon the foundational two-compartment model of Levitt and Levitt, we replace the Michaelis–Menten metabolism rate with a general class of nonlinear functions, including both monotone and nonmonotone forms. This generalization allows us to examine a wider range of physiologically motivated scenarios and reveals richer dynamical behavior. We then establish the positivity of the solutions, study the existence and asymptotic stability of equilibria, and analyze the long-term dynamics under different ethanol input conditions. In particular, for a specific nonmonotone family, we establish the occurrence of a nondegenerate saddle-node bifurcation through center-manifold analysis. Furthermore, we prove the absence of nonconstant periodic orbits in the generalized model without assuming monotonicity of the metabolic rate functions. These findings extend the qualitative analysis beyond equilibrium stability and provide further insights into the complex dynamics of human ethanol metabolism. Finally, numerical experiments are conducted to illustrate the theoretical findings. The numerical results provide further support for the theoretical analysis.

comments
31 pages, 10 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2608.09151 ↗

We systematically investigate finite-difference (FD) derivative computation in Physics-Informed Neural Networks (PINNs) as an alternative to automatic differentiation (AD). On three benchmark PDEs we show that, with a properly calibrated step size, FD matches AD in accuracy on every problem while running faster across the full tested batch-size range and using substantially less GPU memory, and that a stochastic variant we propose outperforms AD on a stationary problem. We further show that for neural architectures with inter-sample dependencies (e.g. BatchNorm, self-attention) the standard PyTorch autograd idiom is silently incorrect; the correct per-sample alternative is computationally infeasible at PINN-relevant batch sizes, while FD provides a forward-only approximation that is empirically an order of magnitude closer to the true per-sample derivative.

comments
v2: journal version under review; 22 pages, 12 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2608.11020 ↗

Partial path interception (PPI) asks for a minimum-cost vertex set whose removal from a directed acyclic graph leaves at most a prescribed number of designated terminals able to reach a protected sink. We study how costs, depth, and fan-out affect its complexity. Unit-cost PPI is NP-complete at depth two with exactly two paths per terminal. Unique-path and individual-coverage instances admit polynomial-time algorithms, and bounded treewidth yields fixed-parameter tractability. Parameterized by the terminal threshold, weighted PPI is in XP and W-one-hard already at depth two, with no subexponential-time algorithm in that threshold under ETH. At depth two, undeletable terminals with bounded fan-out admit an FPT algorithm parameterized by the terminal threshold plus the fan-out bound. For unit costs, a dual-gammoid rank identity characterizes the optimum. Unit-cost depth-two instances with intermediate in-degree at most two are solvable in polynomial time for every terminal threshold, whereas depth-three instances are W-one-hard even with terminal out-degree one. On general directed acyclic graphs, minimum cuts and submodular optimization give a randomized approximation whose factor is the smaller of the coverage demand and roughly the square root of the number of initially exposed terminals, up to logarithmic factors. Reductions from smallest specified-edge subgraph, densest subgraph, and minimum union transfer conditional approximation lower bounds. PPI also gives an exact formulation of proof-valid caching under conjunctive derivation semantics: under independent premise erasures, the recovery probability equals one minus the erasure rate raised to the number of exposed premises. We extend this formulation to shared workloads, derive a sorting-based optimum under exact module routing, and give an AND-OR reliability envelope and a separate coded payload-recovery benchmark.

fields
Information Theory
pdf ↗ page arXiv:2608.11782 ↗

In this paper, we solve risk functional minimization problems with general losses in Banach spaces within the framework of stochastic approximation. We introduce an adaptive regularization strategy for stochastic mirror descent (SMD). Specifically, using a Schauder basis, we construct nested finite-dimensional subspaces whose dimensions adapt to the sample size $n$ to balance approximation and optimization errors. We solve each SMD subproblem over the corresponding subspace and project the stochastic subgradient onto its dual space. This yields closed-form solutions and coordinate-wise coefficient updates with low computational and storage complexity. For risk minimization in $\mathcal{L}^p$ spaces with $1<p<\infty$, we construct Bregman distances adapted to the uniform convexity of the underlying Banach space using $\max\{2,p\}$-convex functionals. At the $\mathcal{L}^1$ endpoint, we instead construct a locally strongly convex functional based on the entropy function. By developing a new analytical framework, we show that the risk functional values converge to the minimum at a rate of $\mathcal{O}\left(n^{-\min\{\frac12,\frac1p\}}\right)$, up to logarithmic factors. In the misspecified setting, we prove convergence under weaker regularity assumptions and derive explicit polynomial rates under suitable regularity conditions. Finally, we apply the method to statistical inverse problems and illustrate its empirical performance through numerical experiments in both settings.

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

For a finite connected simplicial complex $X$, the strand map $ι_\ast$, from $\mathbb{P}_n(X)$ to $\prod_{i=1}^nπ_1(X,x_i^0)$, sends a pure braid to the homotopy classes of its strands. A theorem of Goldberg (1973) computes its kernel when $X$ is a closed surface other than $S^2$ and $\mathbb{RP}^2$: the kernel is the normal closure of the pure braids supported in an embedded disc. We extend this picture to arbitrary finite connected simplicial complexes. Call $X$ $\textit{weakly Goldberg}$ if some contractible subcomplex $X_0\subseteq X$ realises Goldberg's description, $\kerι_\ast=\left\langle \operatorname{im}(\mathbb{P}_n(X_0)\to\mathbb{P}_n(X)) \right\rangle$, and $\textit{Goldberg}$ if $X_0$ can moreover be chosen so that $\mathbb{P}_n(X_0)\to\mathbb{P}_n(X)$ is injective. We prove that the strand map is surjective if and only if $X\not\cong S^1$; that $X$ is weakly Goldberg if and only if its free part is a forest; and that $X$ is Goldberg if and only if it admits an $\textit{admissible tree}$ -- a maximal tree of a scaffold, compatible with the boundary and interior types of the attachments of the free part to the thick components. We also classify the complexes for which the kernel is trivial, settle the exceptional surfaces $S^2$ and $\mathbb{RP}^2$, and obtain complete answers for manifolds and for graphs. The main tools are a graph-of-spaces decomposition of the configuration space at a point of $X$ and a resolution procedure reducing an arbitrary complex to a simple model.

fields
Algebraic Topology, Geometric Topology
pdf ↗ page arXiv:2608.14350 ↗

We construct a $4$-parameter family of properly embedded genus-zero surfaces with at most two boundary components in a Riemannian $3$-ball. The construction is a free boundary analog of the canonical $5$-parameter family of surfaces on the $3$-sphere by Marques-Neves in the proof of Willmore conjecture. In the Euclidean unit ball, this family realizes the critical catenoid as a Simon-Smith min-max limit. As applications, we give an upper bound of Almgren-Pitts $4$-width $ω_4(\mathbb{B}^3)$ by the area of the critical catenoid. Moreover, we prove the existence of at least three free boundary minimal annuli in any compact $3$-manifold with nonnegative Ricci curvature and strictly convex boundary.

comments
52 pages, 1 figure, submitted version, comments are welcome!
fields
Differential Geometry, Analysis of PDEs, Geometric Topology
pdf ↗ page arXiv:2608.14679 ↗

Let $d\geq1$, $Λ>0$, and $ρ\in\mathbb{R}$, let $μ=\mathcal{N}(0,Λ^{-1}\mathrm{Id})$ on $\mathbb{R}^{d}$, where $\mathrm{Id}$ is the identity matrix, and let $ν$ be a probability measure whose support is a convex body $K$ of diameter $D=\operatorname{diam}(K)$ and whose density is proportional to $e^{-W}$, where $\mathrm{D}^{2}W\succeq-ρ\mathrm{Id}$. We prove that the Brenier map $T$ from $μ$ to $ν$ has Lipschitz constant $\operatorname{Lip}(T)\leq\sqrt{Λ/(2π)}\int_{-D/2}^{D/2}e^{ρt^{2}/2}\,\mathrm{d}t$, which is sharp in every fixed dimension. For log-concave targets, the optimal coefficient of $\sqrtΛ\,D$ is $1/\sqrt{2π}$. For sources with finite second moment and density proportional to $e^{-V}$ for which $x\mapsto\frac12\langle Qx,x\rangle-V(x)$ is convex, where $Q$ is symmetric positive definite, and log-concave targets with compact support $K$, the Brenier potential $Φ$ satisfies $\partial_{vv}Φ\leq C_{1}\sqrt{\langle Qv,v\rangle}\,w_{K}(v)$ in the sense of distributions, where $w_{K}(v):=\sup_{y\in K}\langle y,v\rangle-\inf_{y\in K}\langle y,v\rangle$ is the width of $K$ along $v\in\mathbb{R}^{d}$ and $C_{1}<0.463$. This removes Kolesnikov's $\sqrt d$ loss. For log-concave sources with $\mathrm{D}^{2}V\preceqΛ\mathrm{Id}$ and the target $ν$, the Brenier map $T$ satisfies $\operatorname{Lip}(T)^{2}\leqΛ\int_{0}^{D^{2}/4}e^{ρt}\,\mathrm{d}t$, so $\operatorname{Lip}(T)$ has the optimal exponential rate $1/8$ in $ρD^{2}$.

comments
This is a fully revised and shorter version of the paper
fields
Analysis of PDEs, Probability
pdf ↗ page arXiv:2608.15906 ↗

We classify nearly Gorenstein monomial ideals over an arbitrary field. In dimension zero, we compute the canonical trace ideal using a graph on the socle monomials. In positive dimension, we prove a dimension bound under unmixedness and a connectedness condition, with weaker assumptions on the canonical trace ideal.

comments
16 pages. Substantially revised, with a new title. The nearly Gorenstein classification has been extended to arbitrary monomial ideals
fields
Commutative Algebra, Combinatorics
pdf ↗ page arXiv:2608.15955 ↗

Operator-splitting methods such as the primal-dual hybrid gradient method (PDHG) and the alternating direction method of multipliers (ADMM) often exhibit linear convergence on conic programs, although general theory guarantees only sublinear rates. We identify two geometric conditions -- strict complementarity and quadratic facial violation -- that explain this local behavior: under these conditions, PDHG and ADMM converge linearly to an optimal solution when initialized sufficiently close to the converging strictly complementary solution. We establish this result through a unified and verifiable primal-dual error-bound framework. First, we show that strict complementarity, together with a quadratic facial-violation property of the associated complementary faces, implies uniform quadratic growth of both the primal and dual augmented Lagrangians near a strictly complementary solution. Second, we prove the local equivalence of three regularity conditions: uniform quadratic growth of the augmented Lagrangians, quadratic growth of a localized smoothed primal-dual gap, and metric subregularity of the saddle-point mapping. This equivalence clarifies the relationship among previously proposed conditions for local linear convergence. Third, using a unified formulation, we give a concise analysis showing that these equivalent conditions yield local linear convergence of PDHG and ADMM. We verify the quadratic facial-violation property for standard polyhedral and symmetric cones, as well as relevant faces of exponential and power cones, and show that it is preserved under Cartesian products. We also obtain an improved local rate using a restarted Halpern scheme. Finally, we extend the framework to convex composite optimization through a quadratic subdifferential-violation condition, which generalizes the quadratic facial-violation.

fields
Optimization and Control
pdf ↗ page arXiv:2608.16054 ↗

Let $K$ be a compact Hausdorff space and let $E$ be an infinite-dimensional real Banach space. We prove that there is no continuous bijection $h\colon C_p(K)\to E_w$ whose inverse is continuous at $h(0)$. Consequently, $C_p(K)$ and $C_w(L)$ are not homeomorphic for any infinite compact Hausdorff spaces $K$ and $L$. This settles Krupski's problem and its two-space version due to Krupski and Marciszewski, and answers a question of Kąkol, Leiderman, and Michalak concerning $C_p([0,1])$ and weak Banach spaces.

comments
6 pp
fields
Functional Analysis, General Topology
pdf ↗ page arXiv:2608.17549 ↗

Partial entanglement may provide enough connections in the universe to satisfy the definition of a small world. To investigate this possibility, we define a network of particles on a given space-like hyper-surface with a long-range link between any two particles that are connected by a chain of exchanged particles involving a limited number of interactions. Considering the mean free paths of particles in different regions of space and the resulting probability distributions of entanglement connections vs. distance, we find evidence of small-world or random network structure on all but the smallest scales - corresponding to stars and planets - on which other types of connections would need to be added to complete the small world picture.

comments
21 pages, 3 figures, error in Eq. (3) corrected, with consequent changes to Eqs. (5), (6), and Fig. 2, but no effect on conclusions
fields
Mathematical Physics
pdf ↗ page arXiv:2608.19459 ↗

We study embeddings and operators on the Möbius-invariant spaces $Q_K$ using two dyadic capacities. One capacity is defined by analytic packets; the other is defined by domination of positive semidefinite matrices. We prove that they are equivalent. They give criteria for bounded and compact embeddings $Q_K\to L^2(μ)$, bounded and compact Volterra operators, and pointwise multipliers. For the weights $K(t)=t^p/\log^β(e/t)$, $0<p<1$ and $β\ge1$, we prove $\mathcal M(Q_K)\subsetneq H^\infty\cap Q_K^{\log}.$ This disproves the logarithmic multiplier conjecture recorded in Bao and Wulan's 2021 survey.

fields
Complex Variables
pdf ↗ page arXiv:2608.20205 ↗

In this article, we first investigate the box dimension results for the graphs of continuous functions defined on $\mathfrak{F\times F}$, where $\mathfrak{F}$ is the self-similar fractal generated by an iterated function system (IFS) exhibiting the open set condition (OSC). Following this, we manifest the existence of a prevalent surface, defined by a continuous function on $\mathfrak{F\times F}$, that satisfies the horizon property in relation to the box dimension, i.e., the box dimension of the prevalent surface is greater than that of its horizon up to a constant $η$, where $η$ is the box dimension of the self-similar fractal $\mathfrak{F}$. Finally, we provide an example consolidating that the OSC on the underlying IFS of $\mathfrak{F}$ cannot be dropped.

comments
15 Pages
fields
Dynamical Systems
pdf ↗ page arXiv:2608.21047 ↗

In this paper we focus on the stability of positive semidefinite matrix sensing maps $Φ_{\mathcal{A}}=(\langle A_i,X\rangle)_{i=1}^m$ where $A_i\succeq 0$, $X\succeq0$ and $\operatorname{rank}(X)\le r$. We introduce the bi-Lipschitz constants of $Φ_{\mathcal{A}}$ and define the global condition numbers as the ratio of upper and lower Lipschitz constants. We give deterministic universal lower bounds for these condition numbers that depend only on the rank $r$ and on the underlying field. We then show that rank-one Gaussian measurements asymptotically attain these bounds, except for the operator-norm condition number over $\mathbb R$ when $r=1$. For this exceptional case, we establish a sharper universal lower bound and prove its asymptotic sharpness. As an application, we derive stability guarantees for an $\ell_1$-residual PhaseLift-type estimator at the optimal sampling scale. These results identify the intrinsic limits of conditioning in positive semidefinite matrix sensing and connect these limits to stable low-rank recovery.

fields
Information Theory, Functional Analysis, Numerical Analysis
pdf ↗ page arXiv:2608.22418 ↗

The Khintchine inequality provides a lower bound on the expected absolute value of a weighted sum of independent Rademacher random variables. In the classical setting, when the coefficient vector has unit Euclidean norm, this lower bound is a constant, with equality attained only by a simple family of extremal configurations. A refinement due to De, Diakonikolas, and Servedio, referred to as the \emph{linear Khintchine inequality} in this work, strengthens this estimate by establishing a lower bound that depends linearly on the distance of the coefficient vector from the extremal set. In this paper, we present a refined analysis of this dependence on the weight vector. Our results reveal a phase transition in the rate of improvement: when the dimension exceeds six, the lower bound undergoes an abrupt change as the weight vector deviates from the minimizer. Additionally, we improve the slope constant in linear Khintchine inequality. As a consequence, we establish an improved lower bound on the degree-1 Fourier weight for linear threshold functions $\mathbf W^{\leq1}[f]\geq0.55100929$, marking progress towards a conjecture of Benjamini, Kalai, and Schramm.

fields
Probability, Combinatorics
pdf ↗ page arXiv:2608.27908 ↗

The Lagrange spectrum is a classical object in number theory, defined as the set of values of $\liminf_{q\to\infty} q\, \mathrm{dist}(qα,\mathbb{Z})$ where $α$ runs through irrational numbers. It has a complicated structure, with the discrete part, Hall's ray, and a transitional part in between. One can similarly define Lagrange spectrum in the multidimensional set-up, and until now not much has been understood about it. In this paper we prove that, unlike in the one-dimensional case, the closure of the multidimensional Lagrange spectrum is equal to the interval between $0$ and its supremum. The proof relies on a correspondence between Diophantine approximation and dynamics on the space of unimodular lattices and proceeds by studying a dynamical counterpart of the Lagrange spectrum that we call dynamical Lagrange spectrum. The latter is shown to be equal to the interval between $0$ and its maximum by means of an argument utilizing the higher rank nature of the set-up. A passage from full dynamical spectrum to the density of the Diophantine spectrum is achieved by applying equidistribution of expanding translates of horospheres in the space of lattices.

comments
13 pages; several results from the previous version generalized, references updated
fields
Number Theory, Dynamical Systems
pdf ↗ page arXiv:2608.30735 ↗

Permutative sliding block codes - in the sense of Hedlund - give rise to finite-to- one extensions of subshifts. We provide criteria under which minimality and unique ergodicity are preserved by this 'lifting procedure'. These findings are illustrated by means of some nat- ural example families, which we use to obtain strictly ergodic finite-to-one extensions of sub- stitution subshifts (including the case of Fibonacci, Tribonacci, silver mean and noble means substitutions). We further study the interplay between permutative sliding block codes and Toeplitz flows. In particular, we find examples which demonstrate that a permutative lift of a strictly ergodic subshift may be minimal, but not uniquely ergodic - a phenomenon which cannot occur for primitive substitution subshifts.

fields
Dynamical Systems
pdf ↗ page arXiv:2609.01140 ↗

In the realm of probability theory and game design, the study of dice probabilities plays a crucial role. The featured dice are usually fair, so their probabilities can be predicted without rolling the dice. Pentagonal prismatic dice are not fair. Hence, the probabilities are more complicated. Our mathematical model is naturally derived from both the geometric properties of the dice and empirical evidence. Dice of varying sizes but with constant volume were designed. Using a 3D printer with 100 percent infill, the dice were printed and prepared. A machine that simulates dropping dice through a dice tower onto a hard surface was used to obtain about 41,000 results. From these data, a statistical model was constructed that gives probabilities of dice with varying height-to-radius ratios. The formula for the model is based on the centroid solid angle, but with two adjustment parameters due to varying energy and other requirements to transition between different resting aspects. Within the range of height-to-radius ratios tested, the data are within reasonable statistical error of the model.

comments
11 pages, 7 figures. Revised methods and statistical reporting; original 41,068 outcomes retained. Parametric-bootstrap goodness-of-fit calibration and ancillary data/code added
fields
Probability
pdf ↗ page arXiv:2609.01643 ↗

We prove Chui's conjecture on sums of Cauchy kernels. It states that among all configurations of Cauchy kernels on the unit disk, the equispaced one minimizes $L^1$ norm of the sum in the unit disk. Moreover, we obtain a generalization to a wider set of functionals, including weighted $L^p$ norms for $p > 1$ with radially symmetric weights.

fields
Complex Variables
pdf ↗ page arXiv:2609.03134 ↗

We investigate finite group structures that yield complex irreducible characters induced simultaneously from two or more distinct subgroups. When such a group is realized as the Galois group of a Galois extension of number fields, this phenomenon implies that multiple subfields share the same Artin $L$-function.

comments
20 pages. We have corrected errors and typos
journal
Journal of Pure and Applied Algebra, 2026, Article 108430
fields
Number Theory, Group Theory
pdf ↗ page arXiv:2609.04764 ↗

Diffusion-guided methods have recently emerged as effective tools for probing the intrinsic geometry of high-dimensional data. Understanding their accuracy requires quantifying both (i) finite-scale approximation error relative to the true local intrinsic dimension (LID) and (ii) estimation error from finite samples. We address these two questions for the FLIPD field (Kamkari et al., 2024; arXiv:2406.03537), defined at the population level through the logarithmic scale derivative of a Gaussian-smoothed density and admitting a Fokker–Planck representation. For $α$-smooth densities on a regular $d$-dimensional manifold, we establish a uniform $O(σ^2)$ approximation bound relative to the manifold dimension $d$. Under expected integrated squared loss, we prove a minimax lower bound of order $(nσ^d)^{-1}$ for estimating the FLIPD field from $n$ observations when $n^{-1/(2α+d)}\leσ\leσ_0$. A plug-in FLIPD estimator based on the empirical denoising score matching (DSM) solution attains a matching upper bound. Thus the minimax rate is of order $(nσ^d)^{-1}$ and it becomes $n^{-2α/(2α+d)}$ at its smallest scale.

comments
35 pages, 1 figure
fields
Statistics Theory
pdf ↗ page arXiv:2609.04822 ↗

A matching $M$ of a $2$-connected graph $G$ is \emph{removable} if $G-M$ is $2$-connected. We prove that, for every integer $d\ge4$, every $2$-connected graph with at least $2d$ vertices and minimum degree at least $d$ has a removable matching of size $d$. This improves the previously known lower bound $d-2$ for $d\ge5$ to the optimal value $d$, answering a question of Li, Zhou, Fujita, and Mao. We also show that a $2$-connected graph on at least six vertices with minimum degree at least $3$ has a removable matching of size $3$ if and only if it is not a wheel. Our proofs use edge contraction and the structure of \emph{minimal non-removable matchings}.

comments
13 pages
fields
Combinatorics
pdf ↗ page arXiv:2609.06918 ↗

For an ordered graph $H$ and an integer $q\geq2$, let $r_{<}(H;q)$ denote the $q$-color ordered Ramsey number of $H$. Conlon, Fox, Lee and Sudakov asked whether, for every $q\geq3$, there is a constant $c_q$ such that $r_{<}(M;q)\leq n^{c_q\log n}$ for every ordered matching $M$ on $n$ vertices. We answer this negatively in a strong form: for every $q\geq2$, there is $c_q>0$ such that almost every perfect matching $M$ on $[n]$ satisfies $$r_{<}(M;q)>2^{c_q(\log n)^q/(\log\log n)^{q-1}}.$$ This matches the general upper bound up to a factor of $(\log\log n)^{q-1}$ in the exponent. We also give two applications. First, we prove a lower bound conjectured by Fox, He and Wigderson for multicolor Ramsey numbers of acyclic digraphs. Second, we strengthen a result of Axenovich, Rollin and Ueckerdt by giving a superquasipolynomial lower bound on the maximum chromatic number of $M$-free ordered graphs, for almost every perfect matching $M$ on $[n]$.

comments
6 pages, no figures. Minor revisions to exposition, notation and references. Main results unchanged
fields
Combinatorics
pdf ↗ page arXiv:2609.08157 ↗

Proximity gaps are central to the soundness of interactive oracle proofs of proximity (IOPPs) and polynomial commitment schemes (PCSs). An $[n,k,d]$ linear code $C\subseteq\mathbb F^n$ has a $δ$-proximity gap with error $ε$ if, for every $u_0,u_1\in\mathbb F^n$, either all points on $\ell_{u_0,u_1}=\{u_0+αu_1:α\in\mathbb F\}$ are $δ$-close to $C$, or at most an $ε$ fraction are. Although proximity gaps for Hamming-metric codes are well understood, their rank-metric counterparts remain largely unexplored despite their applications in coding theory and cryptography. In this work, we study proximity gaps for linear rank-metric codes and their cryptographic applications. First, we show that every $[n,k,d]$ linear rank-metric code $C$ over $\mathbb F_{q^m}$ admits a proximity gap for every $δ\le(d-1)/(3n)$, with error at most $q^{e+1}/q^m$, where $e=\lfloorδn\rfloor$. For Gabidulin codes, we improve the gap to $(d-1)/(2n)$ with error $10q^{n-1}/q^m$. These two proximity gaps match those for general linear Hamming-metric codes and Reed–Solomon (RS) codes, respectively. We prove the $(d-1)/(2n)$ bound is tight by constructing an infinite family of constant-rate Gabidulin codes and affine lines $\ell_{u_0,u_1}$ on which a $1-o(1)$ fraction of points are $d/(2n)$-close to the code, while $u_1$ is at least $3d/(4n)$-far from it. At $δ=(d-1)/(2n)$, a further counterexample gives a lower bound of order $q^{n-1}/q^m$ on $\varepsilon$, matching our upper bound up to a constant factor. As applications, we construct an IOPP for interleaved Gabidulin codes by adapting the Ligero IOPP for interleaved RS codes. We then adapt the Ligero-based PCS for ordinary polynomials to obtain a $q$-linearized polynomial commitment scheme. To our knowledge, this is the first PCS framework based on rank-metric error-correcting codes.

comments
40 pages
fields
Information Theory
pdf ↗ page arXiv:2609.09838 ↗

This paper introduces and studies the Multi-Objective Enterprise Doubly-Green Supply Chain Network Design (MOE-DGSCND) problem, an extension of Multi-Objective Supply Chain Network Design. The problem studied here is a three-objective combinatorial optimization problem that simultaneously minimizes total cost f1, carbon dioxide emissions f2 and customer dissatisfaction f3 over binary decisions regarding which distribution centers to open and how to assign customer zones to open facilities. The problem generalizes the capacitated facility location problem (CFLP) and is known to be NP-hard (Garey and Johnson, 1979). This paper formally specifies the decision variables, objective functions and constraints and investigates three solution approaches using a single numerical instance: (A) an exact weighted-sum integer linear programming (ILP) formulation solved with Python combinatorially and via PuLP, (B) three Fully Polynomial-Time Approximation Schemes (FPTAS) providing (1 + $ε$)-approximate solutions for $ε$ := 0.15 and (C) two baseline heuristics for comparison. On an instance with eight customers and five candidate distribution centers, the exact solver certifies the optimal (sampled) supported solutions across eight weight combinations, while the FPTAS-based approaches complete within milliseconds, compared to centiseconds for the exact ILP on this tiny non-stochastic instance.

comments
24 pages, 10 tables, 3 figures, 14 references
journal
Cond. acc./R&R AJOR 16(4), 2026
fields
Optimization and Control
pdf ↗ page arXiv:2609.11971 ↗

We develop a framework for deterministic approximate counting of multi-spin systems beyond bounded-degree graphs. The algorithm recursively constructs rational polytopes containing the true marginal vectors and uses linear-fractional programming to obtain certified bounds on marginal ratios. For positive interactions on graphs of polynomial connective constant $D$, we establish strong spatial mixing whenever $Dc<1$, where $c$ bounds the Birkhoff contraction coefficients of the interactions. Under the same condition, we also give a deterministic fully polynomial-time approximation scheme (\textbf{FPTAS}) for the partition function. We further extend the framework to proper colorings of sparse Erdős-Rényi random graphs using recursion on permissive blocks. For every fixed $η\in(0,1)$, sufficiently large fixed $d$, and fixed integer $q\ge(2+η)d$, we obtain an \textbf{FPTAS} for counting proper $q$-colorings of $G\sim\mathcal G(n,d/n)$ with high probability over $G$. This improves the leading constant $3$ in the earlier counting guarantee of Yin and Zhang (APPROX/RANDOM, 2016) to $2$, and asymptotically matches the spatial mixing regime established by Yin (ICALP, 2014).

comments
A revised version
fields
Probability
pdf ↗ page arXiv:2609.12352 ↗

We establish domain criteria for critical homogeneous potential inequalities in the plane. Assuming signed plane cancellation, uniform absolute summability of frozen annular moments at each boundary centre implies the nonlinear endpoint estimate on arbitrary bounded open sets. For the Newton kernel and trace-free quadratic integrands, uniform boundedness of signed cumulative moments over all source centres and truncation radii is necessary and sufficient; testing all translates and dilates of one fixed radial unit-mass mollifier suffices. Tangent-cone cancellation on finitely cornered Dini domains follows as a geometric corollary. On one explicit strictly convex, non-Dini $C^1$ domain, the estimate holds for $2ξ_1ξ_2$ and fails for $ξ_1^2-ξ_2^2$ with $\log\log(1/\varepsilon)$ divergence. A Laplacian-measure extension transfers density estimates to PDE inequalities on the Dini class and on strictly convex $C^1$ domains. We also classify quadratic cancellation on polygons. The signed necessary-and-sufficient criterion is restricted to quadratic integrands.

comments
38 pages, 2 figures. Substantially revised and retitled. Added a boundary atomic-sum sufficient criterion and an exact quadratic cumulative criterion on arbitrary bounded planar open sets, together with contrasting endpoint estimates on one strictly convex non-Dini $C^1$ domain. Extended the Laplacian-measure construction to strictly convex $C^1$ domains
fields
Analysis of PDEs, Classical Analysis and ODEs
pdf ↗ page arXiv:2609.12755 ↗

We prove the all-genus conifold gap conjecture for the Gromov–Witten (GW) theories of the quintic threefold, other smooth Fermat Calabi–Yau threefold hypersurfaces, and local $\mathbb P^2$, as well as for the FJRW theories associated with these hypersurfaces. Our proof uses Mixed Spin P-field (MSP) theory and analogous master-space constructions. The central object is the \emph{cone-vertex theory}. We express this theory as a translation of the point CohFT via a formal Laplace transform and prove a universal conifold gap theorem for the resulting translated theories. The master-space construction then transfers the gap from the cone-vertex theory to the GW and FJRW theories.

comments
29 pages. Improved the proof of the universal cone-vertex gap theorem and added a family of examples
fields
Algebraic Geometry, Mathematical Physics
pdf ↗ page arXiv:2609.13921 ↗

This article investigates the duality of abelian topological groups by delving into the interplay between the algebraic and topological properties of a group $G$ and those of its dual group. In particular, extending the notion of a $g$-barrelled group, we introduce and study the classes of $κ$-barrelled and $ω$-barrelled groups. Our first main result establishes that every $ω$-barrelled group is $\aleph_0$-barrelled (i.e., if every weakly convergent sequence in the dual group is equicontinuous, then every metrizable weakly compact subset of the dual group is also equicontinuous). From this, we deduce that the free topological abelian group $A(K)$ over a metrizable compact space $K$ is determined by the subgroup generated by any of its dense subsets. Furthermore, we prove that if $G$ is a $σ$-compact, $ω$-barrelled group, then its dual group $\widehat{G}_κ$ equipped with the compact-open topology is sequentially complete (complete if $G$ is hemicompact). We also solve an open question posed by Trigos-Arrieta by constructing an explicit example of an $ω$-barrelled metrizable group that fails to be $g$-barrelled. Finally, we investigate the dualization of groups lacking infinite compact subsets, proving that for a totally bounded abelian group $G$, every compact subset of $G$ is finite if and only if its dual group $\widehat{G}$, endowed with the finite-open topology, is unordered Baire-like.

fields
Functional Analysis, General Topology, Group Theory
pdf ↗ page arXiv:2609.14074 ↗

In 1984, Mahler asked whether a transcendental entire function can map the set of Liouville numbers $\mathscr{L}$ into itself. We answer this question in the negative by proving a local rigidity theorem for real-analytic functions. More precisely, if $U\subset\mathbb{R}$ is an open interval and $f:U\to\mathbb{R}$ is real-analytic with $f(\mathscr{L}\cap U)\subseteq\mathscr{L}$, then $f$ is the restriction to $U$ of a rational function in $\mathbb{R}(x)$. Quantitatively, there exists an absolute constant $τ>2$ such that, for every nonrational real-analytic function $f$ and every nonempty open subinterval $V\subset U$, the set of $ξ\in V\cap\mathscr{L}$ satisfying $μ(f(ξ))\leqτ$ contains a Cantor set. The proof combines a two-height counting estimate near analytic graphs with a nested-interval construction.

comments
29 pages. Retitled as Part I of a two-part work. Includes a Lean 4 formalization
fields
Number Theory
pdf ↗ page arXiv:2609.14202 ↗

A shortest-path decision is often made from edge costs that are only observed through noisy samples, such as the average of $m$ simulation replications. When the mean cost vectors of different instances lie near a $k$-dimensional subspace, projecting the averaged sample onto that subspace should remove noise. We make this precise. The mean squared error of any projection estimator splits exactly into a variance term and a bias term. The best projector is the positive eigenspace of $Σ_c - D/m$, where $Σ_c$ is the covariance of the true costs and $D$ is the noise covariance. For a rank-$k$ signal, the projection has the error of a sample mean with a factor $d/(μk)$ more replications, where $d$ is the number of edges and $μ$ is an incoherence constant. For a signal that is only approximately low-rank, every rank-$k$ projection has an error floor, and the plain average wins beyond an explicit replication count. A margin bound shows that the chance of choosing a suboptimal path falls at the same improved rate. A projector learned from $n$ noisy instances loses at most an $O(d/n)$ term.

comments
15 pages
fields
Optimization and Control, Spectral Theory
pdf ↗ page arXiv:2609.15111 ↗

Motivated in part by non-ideal equations of state such as the van der Waals law, we study the Cauchy problem for the one-dimensional full compressible Navier–Stokes equations with constant positive viscosity and heat conductivity and general thermodynamically compatible pressure and internal-energy functions. Assuming $e_θ>0$, we obtain local $H^1(\mathbb R)$ strong solutions for initial data with positive specific volume and temperature, without sign conditions on the pressure derivatives. Near an equilibrium satisfying $p_v(\bar v,\barθ)<0$, sufficiently small $H^1(\mathbb R)$ perturbations generate global strong solutions with uniform thermodynamic bounds and time-integrable dissipation. For the full constitutive class, all first spatial derivatives decay in $L^2(\mathbb R)$ and the perturbation converges to zero in $L^p(\mathbb R)$ for every $2<p\le\infty$. We also identify a locally entropy-affine subclass of constitutive laws for which a Fourier–Duhamel argument establishes convergence to equilibrium in $H^1(\mathbb R)$. For more general thermodynamically compatible constitutive laws, we establish a conditional criterion for convergence in $H^1(\mathbb R)$, based on the space-time integrability of the nonlinear pressure remainder in entropy variables.

comments
This version substantially extends the previous manuscript, which established local well-posedness and global existence. It adds long-time stability results, including decay of spatial gradients, conditional nonlinear H^1 convergence, and full H^1 stabilization for locally affine pressure laws in entropy coordinates. The title and author list have also been updated
fields
Analysis of PDEs
pdf ↗ page arXiv:2609.15317 ↗

This work presents the first steps for simulating kinetic plasmas with collisions using the characteristic mapping method (CMM). The CMM is a semi-Lagrangian method that uses the group structure of volume-preserving diffeomorphisms to efficiently represent the flow-maps of transport problems. Individual submaps can be composed to follow the flow backward in time to its initial foot point, numerically establishing the back-to-label symmetry. The novelty of the presented work is the handling of the source term by storing the Duhamel integrals of each time sub-interval, allowing efficient temporal-integration. Furthermore, we use the Lagrangian structure to avoid implicit time-stepping in the hydrodynamic regime, which is known to be stiff. We benchmark our method on the Boltzmann-BGK and Vlasov-Poisson-BGK equations and consider different test cases, the Sod shock tube problem and nonlinear Landau damping for different Knudsen numbers. We show third-order spatial and temporal convergence and illustrate the fine-scale zoom property of CMM for the bump-on-tail instability.

fields
Numerical Analysis
pdf ↗ page arXiv:2609.16328 ↗

Let $S(T)$ denote the adjacency spectral center of a tree $T$, and let $C(T)$ be its characteristic set. We determine the maximum possible distance $Δ_n:=\max_{|V(T)|=n}\operatorname{dist}_T(S(T),C(T))$ for every $n\ge 3$. It turns out that $Δ_n=0$ for $3\le n\le 11$, that $Δ_{12}=1$, and that $Δ_n=\left\lfloor\frac{n-11}{2}\right\rfloor (n\ge 13)$. More generally, if the two sets are at distance $d\ge 2$, then the branch issuing from a closest vertex of $S(T)$ in the direction of $C(T)$ contains at least $2d+5$ vertices, while the complementary part of the tree contains at least $6$. We also establish structural restrictions in the equality case and completely classify the extremal trees of every odd order $n\ge 17$: there are exactly four nonisomorphic extremal trees, consisting of two brooms and two double brooms. Our proofs exploit the opposite extremal behaviour of paths for the adjacency spectral radius and for the bottleneck Perron value.

comments
V2: Strengthened the separation theorem with sharper branch-size bounds, characterized the equality case, and classified all extremal trees of odd order $n \geq 17$. Proofs and exposition have also been revised
fields
Combinatorics
pdf ↗ page arXiv:2609.16943 ↗

We prove that the Enots-Wolley sequence, a greedy sequence defined by local divisibility and coprimality conditions, contains every positive integer with at least two distinct prime divisors. This resolves an open conjecture by Shannon and Sloane. The only analytic number-theoretic inputs are the prime number theorem and Mertens' estimate for reciprocal primes.

comments
Revised exposition, abstract, and proof outline; simplified an arithmetic estimate. Main results unchanged
fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2609.18054 ↗

For every prime power $q$ and integer $n\ge1$, we give a single Kummer equation defining an $\mathbb{F}_{q^{2n}}$-maximal curve $\mathcal X_{q,n}$. The family recovers the Hermitian curves for $n=1,2$, the Giulietti–Korchmáros curve for $n=3$, and the Beelen–Montanucci curves for odd $n\ge5$. For $q>2$ and even $n\ge4$, it gives new maximal curves of genus $(q^2-1)q^n/2$ that are not covered by the Hermitian curve over $\mathbb{F}_{q^{2n}}$. We compute the genus for both parities of $n$ and give a uniform proof of maximality by counting rational places. For $q>2$ and odd $n\ge5$, we remove the Galois hypothesis from the known non-covering results for the Beelen–Montanucci and Garcia–Güneri–Stichtenoth curves. For even $n\ge4$, we determine the full automorphism group,of order $(q^n+1)q(q^2-1)$, and give explicit equations and genera for all Galois quotients, with closed-form equations for several classes of subgroups.

fields
Number Theory
pdf ↗ page arXiv:2609.19546 ↗

We show that the cover graph of the face lattice of every simplicial polytope admits a Hamilton cycle. Moreover, any two distinct facets can be prescribed as the neighbors of the full polytope on this cycle. By duality, the face lattice of every simple polytope is Hamiltonian as well. This proves the simplicial and simple cases of a conjecture of Behrooznia, Brenner, Merino, Mütze, Rieck, and Verciani (SODA26). The proof uses a line shelling in both directions. The forward shelling partitions the faces into Boolean intervals, whose cover graphs are cubes. The reverse shelling gives a second partition, on which we construct a perfect matching by adding or removing a fixed vertex in each interval. This matching connects the cubes of the first partition. A theorem of Gregor then completes it to a Hamilton cycle using only edges within these cubes. The same argument applies to shellable simplicial spheres, although without the prescribed neighbors of the full complex in this case. Using Chari's shelling construction of perfect matchings, we also obtain Hamiltonicity for polytopes with at most one facet that is not a simplex.

fields
Combinatorics
pdf ↗ page arXiv:2609.19938 ↗

In this paper, we study the multifractal analysis of Birkhoff averages for parabolic rational maps. We establish a conditional variational principle and prove the real analyticity and strict monotonicity of the Birkhoff spectrum, as well as the existence and uniqueness of the measure attaining the supremum in the conditional variational principle, on a certain region. To this end, we prove the existence and uniqueness of an expanding equilibrium measure and the real analyticity of the pressure function on a suitable domain. For parabolic systems, our approach using thermodynamic formalism provides a unified framework for establishing the conditional variational principle and investigating finer properties of the Birkhoff spectrum, including its real analyticity, strict monotonicity, and the existence and uniqueness of a measure attaining the supremum on a certain region.

comments
35 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2609.20036 ↗

Every finite planar set of at least $880$ points contains four collinear points or six pairwise visible points.

comments
4 pages, 2 figures. Revision based on feedback through xsci.com
fields
Combinatorics
pdf ↗ page arXiv:2609.21035 ↗

We establish improved asymptotic rate bounds for adversarial insertion–deletion codes. For binary unique-deletion correction in the linear-deletion regime, we strictly improve Levenshtein's classical lower-bound expression. At deletion fraction $δ=0.1$, our achievable rate increases from $0.162009$ to $0.194890$, a relative gain of approximately $20.30\%$. For list decoding with any prescribed finite list size $L$, we obtain new achievable-rate bounds for binary deletion and insertion codes. Our approach combines the Lovász local lemma with refined counting of common subsequences and supersequences, using generating functions and run-restricted sampling. We also establish a combinatorial reduction that trades $L$ units of insertion budget for one unit of deletion budget without changing the code or increasing the list size. It transfers insertion lower bounds at $γ+Lδ$ and deletion upper bounds at $δ+γ/L$ to mixed errors. We also derive a run-counting Levenshtein-type list-decoding upper bound and a higher-order Elias-type upper bound. The latter recovers Yasunaga's asymptotic unique-decoding bound at $L=1$ and strictly improves the Haeupler–Shahrasbi–Sudan insertion upper bound for every fixed $L$ and $0<γ<q-1$. Numerical comparisons quantify the gains and the remaining gaps.

comments
46 pages, 7 figures
fields
Information Theory
pdf ↗ page arXiv:2609.21395 ↗

Let $q\geq3$ be odd and put $m_r=\lfloor r\log_2q\rfloor$. We count parity sequences with exactly $r$ entries equal to $1$ for which the coefficient in the $qx+1$ iteration first drops below $1$ at step $m_r+1$. Their number $a_q(r)$ also counts the corresponding residue classes modulo $2^{m_r+1}$. By classifying increasing integer sequences according to the first index at which they exceed a prescribed bound, we obtain a recurrence which, for $q=3$, establishes the five- or six-term block pattern conjectured in 2015, allowing a shorter final block. We establish the sharp inequalities \[ \frac1r\binom{m_r-1}{r-1}\leq a_q(r)\leq\frac1r\binom{m_r}{r-1} \] Equality in the lower (respectively upper) bound occurs exactly when $\{r\log_2q\}$ is smaller (respectively larger) than all preceding fractional parts $\{j\log_2q\}$, $1\leq j<r$. These indices are characterized by denominators of convergents and semiconvergents from below and above; at these indices $r\geq2$, the values $a_q(r)$ are rational Catalan numbers. We also characterize the dependence on $q$ and prove, for each fixed odd $q\geq3$, that $a_q(r)=Θ_q(r^{-3/2}B_q^r)$, where $B_q=(\log_2q)^{\log_2q}/(\log_2q-1)^{\log_2q-1}$. For $q=3$, this proves Hikawa's conjectured polynomial factor for the number of finite binary words of given weight for which the length of every nonempty prefix is smaller than $\log_2 3$ times the number of its ones.

comments
19 pages, 2 tables. The author thanks the editors of the Journal of Integer Sequences for comments on an earlier version, particularly for noting that Proposition 6 holds for every nondecreasing bound
fields
General Mathematics
pdf ↗ page arXiv:2609.22303 ↗

Transient pressure diffusion in heterogeneous porous media becomes difficult to resolve efficiently when permeability is discontinuous and spans several orders of magnitude. In this paper, we develop a domain-decomposed random-feature evolutional deep neural network (DD RF-EDNN) that separates spatial approximation from temporal evolution. Permeability-informed random features are compressed into an orthonormal pressure space, and a conservative finite-volume operator is projected onto this space so that only the reduced coordinates are advanced in time. This formulation retains the dissipative structure of the discrete flow problem without repeated neural-network optimization. The analysis quantifies dictionary and singular-value truncation errors, proves contractivity under an energy-consistent dissipativity correction, and derives a conditional grid-level estimate for homogeneous dynamics and time-independent data admitting a steady lifting. Numerical experiments on low-permeability inclusions, high-conductivity blocks and channels, and three-dimensional grids assess the accuracy of the method across distinct coefficient configurations. The method reaches a final-time relative $L^2$ error of $9.54\times10^{-4}$ in the principal benchmark and maintains errors on the order of $10^{-2}$ at a permeability contrast of $10^3$. Numerical diagnostics further show that the observed error balance and temporal convergence are consistent with the analysis. These results support DD RF-EDNN as a structure-preserving and interpretable reduced formulation for transient simulations on prescribed heterogeneous media.

comments
35 pages
fields
Numerical Analysis, Mathematical Physics
pdf ↗ page arXiv:2609.22349 ↗

The category Nom of nominal sets was proposed by Pitts and Gabbay as a setting for the semantics of abstract syntax with variable bindings. It is well-known that Nom is a topos, also known as the Schanuel topos, and in particular it follows that Nom is locally closed, i.e., every slice category Nom/X is cartesian-closed. In this paper, we show that Nom has a much stronger property: every monoidal (closed) structure on Nom induces a monoidal (closed) structure on all slice categories Nom/X. One monoidal closed structure of particular interest on Nom is the separated product A * B, whose right adjoint A -* B is called the separated function space. In particular, it follows that Nom is locally separatedly closed.

fields
Category Theory
pdf ↗ page arXiv:2609.22551 ↗

We prove that the lattice covering density of the regular octahedron is $9/8$, establishing the optimality of the classical body-centered cubic covering. A hypothetical lattice covering of smaller density would yield a lattice basis whose six Kuhn tetrahedra each fit in a translate of the octahedron. A sharp determinant bound then gives a contradiction. As a consequence, the maximum order of an undirected Abelian Cayley graph with three generators and their inverses and diameter at most $k$ is $\frac{32}{27}k^3+O(k^2)$ as $k\to\infty$.

comments
34 pages, 4 figures
fields
Metric Geometry, Combinatorics
pdf ↗ page arXiv:2609.23210 ↗

In this paper, within the framework of real infinitesimal free probability introduced by Cébron and the second author, we compute the real infinitesimal free cumulants of independent complex Wigner matrices. Our approach relies on establishing a combinatorial relation between annular non-crossing partitions and families of directed graphs. As a consequence, we demonstrate that independent complex Wigner matrices are asymptotically real infinitesimally free. In particular, we show (under mild conditions) that a complex Wigner matrix is asymptotically infinitesimally free from its transpose.

comments
45 pages, 11 figures, added a reference and Remark 6.2
fields
Operator Algebras
pdf ↗ page arXiv:2609.24023 ↗

A Ševera bicomplex is a bicomplex $(M,d_{0},d_{1})$ whose differentials $d_{i}$ are Grothendieck differential operators of order $\leq i$ with respect to a given $A$-module structure on $M$, where $A$ is a graded commutative algebra. One also requires that $(M,d_{0})$ admits a contracting homotopy $K$ that is a differential operator of the same order as $d_{0}$. Under suitable assumptions, the differential $d_{2}$ of the second page of the spectral sequence associated with $(M,d_{0},d_{1})$ is a Batalin-Vilkovisky operator on $E_{2}$, so that when $E_{2}$ is a free rank 1 $A$-module, the graded commutative algebra structure of $A$ is enhanced to a Gerstenhaber algebra structure, and the choice of a $d_{2}$-closed basis element for $E_{2}$ further enhances this to a Batalin-Vilkovisky algebra structure. The prototypical example of this construction is Ševera's description of the Batalin–Vilkovisky algebra structure on the algebra of smooth functions of an odd symplectic manifold. Throughout the whole article we look at Batalin-Vilkovisky algebras through the lenses of Cartan calculus. Indications of a generalization to derived Cartan calculus are briefly discussed in the concluding section.

comments
Version 2: Example 5.12, Remark 6.23 and Appendix on Xu modules added, some minor typos fixed. 33 pages
fields
Mathematical Physics, Differential Geometry
pdf ↗ page arXiv:2609.24781 ↗

A binomial coefficient $\binom{n}{k}$ is good if all its prime divisors exceed $k$, and its deficiency is the number of $k$-smooth integers in $(n-k,n]$. A short constructive proof of the existence of infinitely many good binomial coefficients with deficiency exactly one is given, which provides an answer to a problem of Erdős, Lacampagne, and Selfridge.

comments
The main result, Theorem 1.1, dose not hold. An error is the reversal of the no-carry condition: the correct condition is $a_j+b_j\leq p-1$, not $b_j\geq a_j$
fields
Number Theory
pdf ↗ page arXiv:2609.25042 ↗

A quaternary Legendre pair of length $\ell$ is a pair of sequences over $\{\pm 1, \pm \mathrm{i}\}$ whose periodic autocorrelations sum to $-2$ at every nonzero shift. We give a quaternary Legendre pair of length $64$. To the best of our knowledge, this is the first reported construction at this length.

fields
Combinatorics
pdf ↗ page arXiv:2609.25573 ↗

Let $Ω\subset\mathbb R^2$ be a bounded smooth domain. We prove that the weak Dirichlet-to-Neumann map for $-Δ+V$ uniquely determines every complex-valued potential $V\in L^p(Ω)$, $p>1$, provided that zero is not a Dirichlet eigenvalue. This extends the previously known range $p>4/3$ to all $p>1$. The proof uses Bukhgeim's quadratic-phase solutions and an average of Alessandrini's identity over the phase center. After separating the Neumann-series tails, we show that each remaining Born term tends to zero. The fixed-order estimates combine bounds for the absolute kernels with oscillatory cancellation and a duality argument for the product of the two Cauchy transforms.

fields
Analysis of PDEs
pdf ↗ page arXiv:2609.28046 ↗

We study the Abelian maximal pattern complexity $p_{α}^{\ast \mathrm{ab}}(k)$ of infinite words over finite alphabets. For recurrent aperiodic words using exactly $\ell\geq 2$ letters, we prove the sharp lower bound $p_{α}^{\ast \mathrm{ab}}(k)\geq k+\ell-1$ and give a structural characterization of those words attaining equality for every $k\geq 1$. Without assuming recurrence, we prove that an infinite word $α$ is aperiodic if and only if $\binom{p_{α}^{\ast \mathrm{ab}}(k)}{2}\geq k$ for every positive integer $k$. For aperiodic words over $\ell\geq 2$ letters, each occurring infinitely often, we further prove that $p_α^{\ast \mathrm{ab}}(k)\geq m$ whenever $\binom{m}{2}\leq(\ell-1)(k-\ell+2)$, for all positive integers $m,k$. Together with a matching construction, this shows that the minimum Abelian maximal pattern complexity in this class is $\sqrt{2(\ell-1)k}+O_{\ell}(1)$. We call a word an Abelian pattern Sturmian word if, for every positive integer $k$, its Abelian maximal pattern complexity is the least positive integer $m$ satisfying $\binom{m}{2}\geq k$. We show that a word is Abelian pattern Sturmian if and only if, after relabeling its alphabet, it is the characteristic word of an infinite set $E\subset\mathbb{N}_0$ whose bipartite incidence graph is a forest. This graph has two disjoint copies of $\mathbb{N}_0$ as its vertex classes, with a left vertex $r$ adjacent to a right vertex $s$ exactly when $r+s\in E$.

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

The Davenport constant $\DD(G)$ of a finite abelian group $G$ is a classical invariant arising from the arithmetic of ideal class groups of number fields. Closely related to the Davenport constant is the first Narkiewicz constant $\Nark_1(G)$, which arises in the quantitative study of algebraic integers and their factorizations. Gao and Geroldinger conjectured in 2006 that $\DD(G)\leq \sum_{i=1}^r n_i,$ while Narkiewicz and Śliwa conjectured in 1982 that $\Nark_1(G)=\sum_{i=1}^r n_i,$ where $n_1,\ldots,n_r$ are the invariant factors of $G$. Both are central conjectures concerning arithmetic invariants arising from the theory of number fields. In this paper, we disprove both conjectures. Moreover, we show that, for every fixed $r\geq5$, both $\DD(G)-\sum_{i=1}^r n_i$ and $\Nark_1(G)-\sum_{i=1}^r n_i$ are unbounded over finite abelian groups of rank $r$. We develop a probabilistic representation technique to establish a uniform upper bound for the Davenport constant: $$ \DD(G)\leq\frac{16}{5}\,\rr(G)\exp(G). $$ Our bound gives the first improvement of the classical van Emde Boas–Kruyswijk estimate: $\DD(G)\leq\exp(G) \left(1+\log\frac{|G|}{\exp(G)}\right) \leq\exp(G)\bigl(1+(\rr(G)-1)\log\exp(G)\bigr)$, by removing the logarithmic dependence on the exponent from this classical estimate, replacing it with the absolute constant $16/5$. Their bound stood unimproved since its establishment in 1969. The existence of $C=16/5$ also brings us closer to the most challenging conjecture on the Davenport constant, namely the Emde Boas–Kruyswijk Conjecture in 1969, which predicts that $\DD(C_n^r)=r(n-1)+1.$ As a further application of our results, we disprove a conjecture of Girard in 2008 concerning cross numbers, an invariant with deep roots in the arithmetic of number fields and Krull monoids.

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

Convergence in parameter estimation classically requires ``persistency of excitation," which is a non-degeneracy condition on a trajectory-dependent signal. To the best of our knowledge, this paper develops the first such excitation theory for a nonlinear PDE. In the context of identifying the unknown viscosity from spectral observations in the two-dimensional Navier–Stokes equations for incompressible fluids, our excitation condition is computable, verifiable a priori, and sharp with respect to scaling. Our approach employs a data assimilation methodology to account for an unknown initial state and select candidate viscosities by minimizing the loss between the observed low-modes of the fluid velocity and low-modes of a nudging-based filter assimilating these observations. The main novelty of our framework is to distinguish a new functional, $\mathsf{W}$, representing the work done by the filter's associated sensitivity variable on the enstrophy, around which our entire analysis is centered. We show that $\mathsf{W}$ is explicitly comparable to the observability Gramian of the associated Gauss–Newton iteration, and subsequently establish the following dichotomy at every critical point of the observational loss: either $\mathsf{W}$ exceeds a minimal excitation threshold, in which case the candidate viscosity obeys an explicit error estimate that depends inversely on $\mathsf{W}$ and the observational density $N$, but directly on the error between initial conditions, or else the observations are quantitatively insensitive to parameter updates in a way that is detectable to the user. Our approach is energy-based, and therefore expected to be adaptable to many other nonlinear dissipative systems.

comments
48 pages, several discussions and remarks streamlined, references added
fields
Optimization and Control, Analysis of PDEs
pdf ↗ page arXiv:2609.31230 ↗

This work presents an analytical, parameter-free derivation of the lepton mixing matrix and active neutrino mass spectrum from an icosahedral $A_5$ flavor manifold coupled to the three-generation Iwahori-Hecke algebra $H_3(q)$. Partitioning the icosahedral vertex curvature across the six fundamental Weyl chambers of $H_3(q)$ fixes an elementary angular defect $Δ_{AD} = π/18$, unifying ultra-high-energy mass generation and low-energy flavor mixing as dual realizations of a single geometric invariant. At the topological braiding threshold $μ\sim M_0$, the right-handed Majorana scale $M_0$ breaks scale invariance and drives the five-dimensional Temperley-Lieb quotient into its hyperbolic regime with loop modulus $d'_{AD} = 2\coshΔ_{AD}$, where Quantum Yang-Baxter Baxterization projects the algebraic roots onto a hierarchical heavy spectrum $M_1 > M_2 > M_3 > 0$. Integrating out and inverting these states via a flavor-isotropic Seesaw mechanism Type-I locks in the normal mass hierarchy with $m_1 \approx 3.64$ meV, $\sum_i m_i \approx 63.5$ meV, and $m_β\approx 9.45$ meV. Simultaneously, probability conservation requires analytic continuation onto the compact unitary circle, factorizing the mixing matrix into the $A_5$ Golden Ratio baseline, a unitary boundary twist generated by the longest Coxeter involution, and a discrete Majorana parity matrix. This geometry yields $θ_{13} = 8.49^\circ$, $θ_{12} = 32.11^\circ$, $θ_{23} = 45^\circ$, and maximal Dirac CP violation, $δ_{CP} = \pm π/2$, while discrete $SO(3)$ parities quantize the relative Majorana phases, $α_{13} = -π, α_{23} = 0$, preventing $0νββ$ decay cancellation, $m_{ββ} \approx 1.14$ meV, and suppressing renormalization group drift to $\dotθ_{ij} \sim 10^{-7}$ rad.

comments
29 pages (main text) plus four Appendices. Improves the underlying algebra, updates the main results accordingly, and corrects typos from the previous version
fields
Mathematical Physics
pdf ↗ page arXiv:2609.31406 ↗

Transformers have become a central architecture for in-context learning (ICL), particularly through their state-of-the-art performance in large language models. This success motivates understanding how transformers exploit intrinsic geometry of real-world data. However, existing nonparametric ICL theory has largely focused on simplified settings, such as Euclidean domains or single manifold models, failing to fully explain its phenomenal empirical success in complex tasks. To address this gap, we study the prediction problem under unknown heterogeneous geometry, modeled by sample size-dependent mixtures of manifolds with heterogeneous dimensions, smoothness, and sampling masses. Under the growing geometric complexity model, we establish a minimax lower bound capturing the aggregate difficulty of the components and construct an oracle tangent local polynomial estimator with a matching upper bound. This estimator is connected to a structure-informed, two-stage softmax transformer with a geometric preconditioner and local polynomial solvers. The transformer achieves negligible approximation error relative to the minimax rate with logarithmic depth and polynomial size. Finally, we derive an in-context generalization bound for near empirical risk minimizers (ERM) over this class. Together, these results identify conditions under which the resulting predictor exploits local geometry and attains minimax rate.

comments
63 pages, 3 figures. Accepted at NeurIPS 2026
fields
Statistics Theory
pdf ↗ page arXiv:2609.31458 ↗

In this paper, we give conditions on a unital non-associative ring $R$ and additive map $σ: R\longrightarrow R$ so that the non-associative skew power series ring, denoted by $R[[X;σ]]$ and the non-associative skew Laurent series ring denoted by $R((X;σ))$ are left (resp. right) Noetherian, respectively. Consequently, we establish versions of Hilbert Basis Theorem of $R[[X;σ]]$ and $R((X;σ))$, respectively, for left (resp. right) Noetherianity . We also give a counterexample showing that the Hilbert Basis Theorem does not hold in general in the non-associative case. In establishing the Hilbert Basis Theorems for $R[[X;σ]]$ and $R((X;σ))$, we introduce and utilize the right (resp. left) quasi-associative property of $R$, which is equivalent to $rR$ (resp. $Rc$) being one-sided ideals for all $r\in R$ (resp. $c\in R$).

comments
26 pages. Updated, shorter version
fields
Rings and Algebras
pdf ↗ page arXiv:2609.31486 ↗

A subspace design is a collection of subspaces $H_1,\ldots,H_n$ of $\mathbb{F}_q^k$ with the property that no low-dimensional subspace $W$ intersects the collection "too much". Subspace designs and related objects in linear-algebraic pseudorandomness have found a broad range of applications, ranging from list decoding to derandomizing algorithms. We construct explicit strong subspace designs over every finite field. In the extremal case where the co-dimension $t$ of each $H_i$ is equal to the dimension of $W$, for every constant field size our construction attains $n=Ω(k)$ and matches the probabilistic intersection bound up to a constant factor. All previous constructions required the field size to grow with $t$ (or $k$). Our subspace designs also imply new constructions of rank condensers over arbitrary finite fields. This result is the first to achieve an optimal dependence on $k$ while maintaining both a constant output entropy rate and a constant field size. As an application, we construct lossless rank extractors for linear sources of rank $r$, for all $r < q$, with parameters matching those of Guo, Raj, Shangguan and Zhang (FOCS '26), thereby generalizing their result to prime fields and smaller field sizes. Our construction is based on an algebraic-geometric version of the Parvaresh–Vardy codes (Parvaresh–Vardy FOCS '05, Guruswami ECCC '05), extending the framework underlying the condensers of Guruswami, Umans and Vadhan (JACM '09). We view our construction as a linear-algebraic analysis -- tailored to affine sources -- of the GUV construction, generalized to functions over algebraic curves. More specifically, inspired by Ta-Shma and Umans (CCC '12) we develop a two-level evaluation scheme, where we first evaluate a function on a curve at extension-field points, and then evaluate a corresponding affine-linear polynomial to obtain outputs over the base field.

fields
Information Theory
pdf ↗ page arXiv:2609.32834 ↗

We study three particles on the two-dimensional square lattice with contact interactions of infinite strength, in every sector of total quasimomentum, for three statistics: identical bosons, two identical fermions with a distinguishable third particle, and two identical bosons with a distinguishable third particle. The atom-dimer sector associated with the infinitely degenerate eigenvalue of the pair-contact operator is analysed on the whole Brillouin zone. A Feshbach-Schur reduction gives explicit effective Hamiltonians built from the Dirichlet Laplacian and a rank-four exchange operator, and a spectral transfer theorem with explicit error bounds identifies the atom-dimer threshold of the three-body operator with that of the effective one; the eigenvalue counting function below the threshold is squeezed between those of the effective operator, so that the number of atom-dimer states bound uniformly in the coupling equals the number of bound states of the effective Hamiltonian. The threshold problem reduces to a four-by-four Hermitian matrix whose zero-energy limit is built from the two-point resistances of the square lattice and hence to a quartic polynomial. This yields the complete atom-dimer zones in closed form; the critical hopping ratio as an explicit function on the whole Brillouin zone with two-sided bounds and closed forms at all symmetry points; at most two atom-dimer states per sector with an explicit second threshold; exact onset laws of infinite order at the corner point and linear-over-logarithmic in the pure p-wave channel; and two exact dualities relating a change of statistics to a shift of quasimomentum by half a reciprocal-lattice vector. The reduction of the three-body eigenvalue problem to the lattice Skornyakov-Ter-Martirosyan equation is proved with an explicit isomorphism of eigenspaces.

comments
Version 2: major revision. Added spectral transfer theorem with explicit constants, analysis of critical parameters, proof of the lattice Skornyakov-Ter-Martirosyan reduction, first-principles derivation of lattice constants, and corrected remainder constant for the 2+1 bosonic mixture. Response to referee report.37 pages with Supplementary, 8 figures
fields
Mathematical Physics, Spectral Theory
pdf ↗ page arXiv:2609.33576 ↗

Integrated sensing and communication (ISAC) enables joint communication and sensing using a shared waveform, but its signal design is challenging due to the inherent trade-off between the two objectives, particularly in the short blocklength regime. This paper proposes an autoencoder (AE)-based framework for ISAC waveform design in noncoherent settings. We derive a modified Cramér-Rao bound for multi-target delay estimation and analyze the maximum-likelihood decoding rule for noncoherent communication under correlated fading. These results reveal structural connections and trade-offs between communication and sensing objectives in waveform design. Based on this analysis, the AE learns waveform representations that jointly optimize both functionalities, with a tunable parameter controlling the trade-off. Simulation results show that the proposed design outperforms conventional schemes in both communication reliability and sensing accuracy, especially under short blocklength and fading conditions.

comments
13 pages, 5 figures, preprint of a journal paper. Removed a part of a sentence that should have been deleted, but remained in the manuscript by mistake
fields
Information Theory
pdf ↗ page arXiv:2609.33605 ↗

Spectral zeta functions provide a standard tool for regularizing determinants of differential operators in quantum physics. In a previous paper (J. Math. Phys. 66: 083505, 2025), we introduced a $p$-adic spectral zeta function for discrete spectra via a locally analytic interpolation function. In this paper we extend the framework to continuous spectra using the inverse Stieltjes transform. Starting from the resolvent of a bounded operator, we construct a generalized distribution, called the $p$-adic spectral distribution, and define bosonic and fermionic zeta functions and functional determinants. We establish their analytic properties, special value formulas, and Stirling expansions, and show that our previous framework is embedded into the present one in the discrete case. In this approach, the bosonic and fermionic cases exhibit an interesting symmetry. As an application, we consider the position operator in $p$-adic quantum mechanics on an arbitrary compact subset of $\mathbb{C}_{p}$.

comments
43 pages. Dedicated to the memory of Lev Genrikhovich Shnirelman (1905--1938)
fields
Mathematical Physics, Number Theory
pdf ↗ page arXiv:2609.33660 ↗

We prove an inverse theorem for the Gowers uniformity norm $\mathsf{U}^k(\mathbb{F}_p^n)$ with quasipolynomial bounds in the case when $p \geq k$. The inverse theorem follows from a quasipolynomial structure theorem for Freiman multihomomorphisms, which are a natural generalization of Freiman homomorphisms to maps of several variables. The proof of the structure theorem for Freiman multihomomorphisms is the central result of the paper and rests on three main ingredients: algebraic regularity method, abstract Balog-Szemerédi-Gowers theorem and the theory of multilinear maps defined on multilinear varieties. The last ingredient originates from an earlier work of Gowers and the author, and is significantly expanded in this paper. In particular, once the theory of such maps is in place, the proof of the structure theorem for Freiman multihomomorphisms is relatively short, especially compared to the previous quantitative results in the inverse theory of Gowers norms.

comments
65 pages; corrected a couple of inaccuracies and improved the presentation of some arguments
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2609.33733 ↗

For a finite simple graph $G = (V, E)$, we consider the quotient algebra $\mathcal M(G)$ of the polynomial ring in the variables $u_e$ (for $e \in E$) by the ideal generated by all products $u_e u_f$ for non-disjoint edges $e$ and $f$ (including all squares $u_e^2$). This quotient is called the matching algebra of $G$, since it has a basis indexed by the matchings of $G$. In this quotient, we define a subalgebra $\mathcal D(G)$ generated by the signed incidence sums $θ_v=\sum_{e=(v,w)}u_e-\sum_{e=(w,v)}u_e$ for all $v \in V$ (where all edges of $G$ are oriented arbitrarily); we call this the Dunkl matching algebra. We show that, as a graded vector space, $\mathcal D(G)$ is dual to the span of all polynomials $p_M = \prod_{(i,j) \in M} (x_i - x_j)$, where $M$ ranges over all matchings of $G$. For the complete graph $K_n$, the latter span is a direct sum of two-row Specht modules (one in each degree); thus its Hilbert series is that of the Catalan triangle, and, in characteristic zero, the Dunkl matching algebra can be presented by linear and quadratic relations. For arbitrary graphs, we formulate the saturation problem of deciding when the selected matching Specht generators $p_M$ in a given degree $k$ span the full two-row Specht module $S^{(n-k,k)}$. We show that saturation in degree $k$ forces $k$-connectivity, that saturation in degree $2$ is equivalent to $2$-connectivity, and that $k$-linked graphs are saturated in degree $k$. We also prove saturation in every possible degree whenever the complement of $G$ is a matching. We show that the Dunkl matching algebra equals the full matching algebra exactly for forests, and give an explicit Hilbert series formula for unicyclic graphs.

comments
32 pages. Produced using GPT-5.6 based on third author's notes; significantly edited and fully proofread. v3 simplifies (and details) some proofs in Section 5 (no more ear-decomposition) and improves references in Section 4. Comments are welcome!
fields
Combinatorics, Commutative Algebra
pdf ↗ page arXiv:2609.34260 ↗

It was proved in [3] that on a closed manifold of dimension greater than one, every smooth weak Riemannian metric on the space of smooth positive probability densities that is invariant under the action of the diffeomorphism group is a multiple of the Fisher–Rao metric. Here we describe all purely covariant tensor fields of arbitrary order on the space of positive densities of a compact manifold with corners which are invariant under the action of the connected component of the diffeomorphism group. Finally, we classify the considerably fewer purely contravariant invariant tensor fields, describe the basic mixed contraction, and indicate the expected form of general invariant tensor fields.

comments
26 papes. Heavily revised version
fields
Differential Geometry
pdf ↗ page arXiv:2609.34601 ↗

We establish noncommutative maximal inequalities for averages over submanifolds in the $L^p$-spaces associated with semifinite von Neumann algebras. For every $1<p\leq\infty$, we prove local maximal bounds for smooth submanifolds of finite type at the parameter origin, and global bounds over all positive scales for polynomial parametrizations, without a finite-type assumption and with constants depending only on $p$, the degree and the dimensions. For variable hypersurfaces in $\mathbb{R}^n$, $n\geq3$, satisfying a uniform rotational curvature condition, we obtain local maximal bounds for $p>n/(n-1)$. To our knowledge, these are the first such noncommutative inequalities for general lower-dimensional submanifolds and polynomial images. The key step is a weak type $(1,1)$ estimate for a regularized auxiliary family adapted to non-isotropic dilations. The geometric kernels need not satisfy the pointwise smoothness or $L^2$-Dini conditions required by existing noncommutative Calderón–Zygmund theories. We combine a Calderón–Zygmund decomposition based on Cuculescu projections with integral regularity estimates, a non-isotropic Littlewood–Paley decomposition and Fourier decay to prove this endpoint estimate. Marcinkiewicz interpolation yields maximal $L^p$ bounds for the regularized averages, and interpolation with Fourier-based $L^2$ bounds recovers the original averages. The variable-hypersurface result uses oscillatory $TT^*$ estimates and localization. As applications, we obtain maximal ergodic inequalities for trace-preserving actions of $\mathbb{R}^n$ and, under additional assumptions, bilaterally almost uniform convergence results for the associated normalized averages.

comments
92 pages. The main content of the paper is unchanged. The abstract and introduction have been revised, and typographical errors elsewhere have been corrected
fields
Operator Algebras
pdf ↗ page arXiv:2609.34906 ↗

We investigate the local stability of direct Mach configurations for the two-dimensional steady compressible Euler equations. Given a piecewise constant direct Mach configuration with subsonic flow behind both the reflected shock and the Mach stem, we prove that under a transversality condition on the shock polar loops and a suitable condition on the truncation segment, every sufficiently small perturbation of the incoming flow gives rise to a Mach configuration that is a small perturbation of the background one, in the sense that the reflected shock, the Mach stem and the slip line, together with the downstream subsonic flow, stay close to their background counterparts. The triple point is fixed at the origin, and the domain is truncated at a finite distance. Euler–Lagrange coordinates are employed to transform the unknown contact discontinuity curve (slip line) into a fixed boundary and to write the full Euler system as a first-order elliptic system for the flow direction and pressure coupled to transport equations for the Bernoulli and entropy quantities. The key idea in dealing with the contact discontinuity is to solve a mixed boundary value problem, in divergence form with discontinuous coefficients, for a single elliptic equation, so that continuity of the scalar unknown and its conormal flux allows reconstruction of the flow direction and pressure with the required contact discontinuity conditions.

comments
42 pages, 4 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2609.35365 ↗

The shallow embedding of higher-order modal logic in classical higher-order logic, used in Benzmüller and Scott's Notes on Gödel's and Scott's variants of the ontological argument, reaches beyond the modal object language: its quantifiers range over domains containing the nominals and satisfaction operators of hybrid logic. A proof using one proves a theorem of the embedding, not necessarily of the modal logic. Whether a result is one of the modal logic can be settled by replaying it in an explicit calculus, or, more cheaply and for all results at once, by analysing what the embedding's proofs substitute. Every statement the Notes prove has a proof in the embedding substituting nothing outside the object language, 294 of them explicit. The Notes' own proofs substitute none either; what it flags are terms a prover introduced. A soundness theorem over general models closed under the object language, and a sentence of that language the embedding proves but which fails in such a model, fix what the certificate says. The Notes' three open questions are settled too, without nominals, but by the empty instance of the conjunction axiom, too cheaply to convince. Generalised to Gödel's "any number of summands", the axiom covers the empty conjunction and the singleton. This article restricts it to at least two different conjuncts, a non-degenerate reading of Gödel's footnote, and settles them again without nominals. In effect only the empty conjunction is excluded; the singleton comes back with the other axioms. In one variant the restriction refutes the possible existence of a God-like being; the answers return, with no side condition, once the Notes' non-emptiness clause is confined to Gödel's essence. Every theorem here is verified in Isabelle/HOL and independently in Lean 4, the separating model in its propositional part; the countermodels are Nitpick's, checked by the build.

comments
51 pages. New in v5: the witness criterion and the whole-term condition come apart (a proof with the nominal in a context alone); three open questions answered by Bjoern Lindheim's harness, cited; both detectors read schema positions off the rule, the Isabelle/HOL one every rule, with a whole-term mode; 114 facts of the Notes replayed in Isar. Ancillary: sources, sessions, detectors, reports
fields
Logic
pdf ↗ page arXiv:2609.36279 ↗

We prove that the Ehrhart $h^*$-polynomial of a rank-two matroid with exactly three parallel classes is real-rooted whenever its smallest parallel class has size at most three. This bound is sharp: the loopless rank-two matroids with parallel-class sizes $(4,561,600)$ and $(4,a,a+29)$, for all sufficiently large integers $a$, have $h^*$-polynomials that are not real-rooted. By matroid duality, these examples disprove Ferroni's real-rootedness conjecture even for cycle matroids of theta graphs. Nevertheless, every matroid of rank two or corank two has a positive $h^*$-coefficient sequence that is ultra log-concave of order equal to the polynomial's degree. In particular, the unimodality conjecture holds in both cases.

comments
21 pages
fields
Combinatorics
pdf ↗ page arXiv:2609.37439 ↗

Hilbert C*-modules whose coefficient C*-algebra is equipped with a finite faithful trace generate Banach Gelfand triples. This provides a natural setting for the interpretation of Hilbert C*-modules as function spaces. In particular, when the modules are finitely generated and projective, their external tensor products interact well with projective tensor products. This allowed us to derive abstract kernel theorems for Hilbert C*-modules. As an application, we apply our results to Heisenberg modules and obtain new kernel theorems for time-frequency analysis.

comments
Updated reference list. Added concluding examples. 43 Pages
fields
Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2609.37780 ↗

Concurrent games and strategies based on event structures are an established and expressive model of interactive computation. In this paper we revisit the problem of equipping this model with symmetry. Symmetry is essential for many applications, but it is also a source of mathematical complexity, not least because strategies with symmetry can be compared up to several distinct notions of equivalence. Our first contribution is a complete characterization of two classes of strategies for which composition admits an identity. For these two classes the identity laws hold, respectively, up to a "weak" and a "strong" notion of equivalence. The main result is that the weak class of strategies corresponds precisely to those inducing Street fibrations over the game. We also show how the established "thin" approach to symmetry also fits in this general framework. A second contribution is a formal connection between games and setoid-valued profunctors. This follows a long tradition of relating games and relational models, but here additionally includes a very general model of symmetries. Our characterization of strategies as Street fibrations makes the connection to profunctors significantly easier to establish.

comments
MFPS 2026 post-proceedings
fields
Category Theory
pdf ↗ page arXiv:2609.37815 ↗

To what extent does a local operator on smooth test functions determine a sub-Markov semigroup and its underlying structure of laws? Many existing approaches work with Feller semigroups on the space \(C_b\) of bounded continuous functions and rely on uniqueness, often established through a comparison principle for the associated evolution equation. However, even when the local operator is linear, uniqueness may fail and a \(C_b\)-Feller restriction may exclude the associated canonical semigroup. We discover that the space \(\operatorname{USC}_b\) of bounded upper semicontinuous functions offers a natural setting for this study. Within this framework, a complete description of the relationships among sublinear local operators, sublinear sub-Markov semigroups, and their underlying structures of laws is achieved without assuming uniqueness. Under suitable regularity and Lyapunov conditions, we construct the greatest semigroup compatible with a prescribed sublinear local operator and obtain a stochastic representation in terms of a Markov process under sublinear expectations. We characterize all sublinear sub-Markov semigroups dominated by this greatest semigroup in two ways: through a one-to-one correspondence with stable subfamilies of its representing laws, and through an order relation between their infinitesimal generators and the prescribed local operator. We further characterize the greatest semigroup via the greatest viscosity subsolution of the associated Hamilton–Jacobi–Bellman equation. These results clarify what information about global stochastic evolution can be recovered from local infinitesimal descriptions and what freedom remains in the absence of uniqueness. The resulting characterizations are new even when the local operator is linear.

fields
Probability
pdf ↗ page arXiv:2609.37881 ↗

The Erdős-Rogers function $f_{\ell,s}(n)$ is the largest order of a $K_\ell$-free induced subgraph guaranteed to exist in every $K_s$-free graph on $n$ vertices. While this function is well understood for $s=\ell+1$, the case where $s$ is much larger than $\ell$ has remained wide open. A long-standing lower bound of Sudakov states that $f_{\ell,s}(n)\geq n^{\frac{\ell}{2s}+O_\ell(s^{-2})}$, while a recent result of Bradač shows that $f_{\ell,s}(n)\leq n^{\frac{\ell-1}{s-1}+o(1)}$. In this paper, we close this gap asymptotically by proving that $f_{\ell,s}(n)= n^{\frac{\ell}{2s}+O_\ell(s^{-2})}$. More precisely, we prove that for all $2\leq \ell<s$, we have $f_{\ell,s}(n)\leq n^{\frac{\ell}{2s-\ell}+o(1)}$. Our proof builds on Bradač's recent tight construction for off-diagonal Ramsey numbers, which can be viewed as the $\ell=2$ case of our result.

comments
30 pages, added an appendix to the previous version
fields
Combinatorics
pdf ↗ page arXiv:2609.37987 ↗

We reveal an unexpected connection between two interacting particle systems: Kac's walk and the Kipnis-Marchioro-Presutti (KMP) process. We first establish a mixing-time analogue of Aldous's conjecture for the KMP process on general graphs: the mixing time of the $t$-particle process on any connected $d$-vertex graph is at most $O(\log d)$ times the corresponding single-particle mixing time, uniformly in $t$. As an application, we improve the mixing-time bound for coordinate hit-and-run on the $n$-dimensional standard simplex from $\widetilde{O}(n^3)$ [KV26] to $O(n\log n)$, while removing the dependence on the initial distribution. We then show that the twirling channel induced by the parallel Kac's walk on the symmetric subspace can be exactly encoded by a Markov chain on partitions, which naturally lifts to a parallel KMP chain on the complete graph. We prove that $O(\log d+\log(1/\varepsilon))$ repetitions of the parallel Kac's walk suffice to approximate Haar twirling on the symmetric subspace of $(\mathbb{C}^d)^{\otimes t}$ to error $\varepsilon$, uniformly in all $t$. Our main technical contribution is a new structural property of KMP-type dynamics: conditional product structure, which holds for both the standard KMP processes on general graphs and the parallel KMP processes on complete graphs. Conditioned on suitable auxiliary randomness, the evolution of the labeled KMP process factorizes into independent single-particle updates. Combining this structure with an exact coupling inspired by the analysis of Kac's walk, we remove the dependence on the number of particles from the mixing bounds for both unlabeled KMP models. This bypasses the $\log(π_{\min}^{-1})$ dependency from spectral-gap arguments, which is often prohibitively large for many-particle systems. Using this framework, we prove mixing bounds that are sharp up to logarithmic factors for both unlabeled KMP models.

comments
77 pages, 1 figure
fields
Probability
pdf ↗ page arXiv:2609.38044 ↗

We prove the strong Artin conjecture for the largest solvable Artin representations in three dimensions, whose projective image is isomorphic to the affine special linear group $C_3^2\rtimes \mathrm{SL}(2, 3)$. It is also the last solvable case in three dimensions. This is achieved with a new case of base change and automorphic induction for non-Galois quartic extensions with no intermediate fields. We additionally deduce the strong Artin conjecture for all 6-dimensional primitive solvable Artin representations.

comments
20 pages, minor improvements and typo fixes
fields
Number Theory
pdf ↗ page arXiv:2609.38231 ↗

We discuss a class of mixed characteristic rings defined analogously to Stanley-Reisner rings by replacing one variable with a uniformizing parameter for a discrete valuation ring. We adapt Hochster's formula for Tor and Ext modules, Hochster's formula for local cohomology, and Terai's criterion for Serre conditions to this new setting; one of the tools needed is cellular sheaf cohomology, for which we give a brief treatment.

comments
This version differs from the orignal posting only in that an error in the statemnt of one result is corrected. The proof is unaffected
fields
Commutative Algebra
pdf ↗ page arXiv:2609.38947 ↗

Coded distributed computing (CDC) mitigates the Shuffle communication bottleneck through coded multicast, but existing schemes with predetermined worker populations do not directly adapt to worker arrivals and disconnections. To address these dynamics, we propose a dynamic CDC scheme that preserves surviving workers' caches and Reduce assignments while exploiting the storage brought by arriving clusters. The model accommodates general MapReduce tasks under a placement that is partly fixed and partly new. The scheme uses Cartesian products of cluster-wise placement delivery arrays (PDAs) for file placement. A delivery-aware greedy algorithm reassigns abandoned Reduce functions, and a Communication Array allows workers with no Reduce function to serve as coded transmitters. For arbitrary feasible disconnections, the scheme's exact communication load is derived. A converse bound under one-shot communication shows that, in the absence of disconnections, the scheme lies within a factor of 2 of the lower bound under these assumptions when new clusters arrive, and within a factor of 4 otherwise.

fields
Information Theory
pdf ↗ page arXiv:2609.39373 ↗

For lattice Boltzmann simulations of unsteady flows at low Reynolds numbers, dual-time stepping decouples the physical time step from lattice streaming, yet conserved-moment iteration errors decay slowly at large steps. We develop a residual correction method based on the conserved-moment structure of the collision operator. With fixed step histories and both relaxation rates equal to unity, post-collision populations depend on incoming populations only through reconstructed conserved moments, so one collision eliminates local perturbations with zero conserved moments. Periodic rest-state linearization shows that, at large physical steps, the contraction factor of the uniform conserved mode approaches unity, while its moment residual scales inversely with the step relative to macroscopic error. On periodic domains, combining this scaling with linearized acoustic propagation and viscous diffusion yields a macroscopic auxiliary system driven by the conserved-moment residual and solved in Fourier space for low-wavenumber errors. For solid walls, reference-state linearization of the complete sweep, including executed bounce-back updates, yields a sparse kinetic correction. Both auxiliary systems compute increments from the full nonlinear residual, and we prove fixed-point equivalence with the original discrete system, preserving unsteady and nonlinear convective effects. Refining the time step on fixed grids verifies second-order temporal self-convergence of slowly varying periodic velocity fields in two and three dimensions. Under fixed physical steps and tolerances, mean inner sweeps per step drop from hundreds in three-dimensional periodic flow and thousands in a two-dimensional cavity to a few.

comments
19 pages, 4 figures, 4 tables (main text), plus 10-page Supplementary Materials (29 pages total); v2: restructured manuscript with expanded discrete defect analysis, fixed-point equivalence proof, and extended verification details
fields
Mathematical Physics
pdf ↗ page arXiv:2609.39474 ↗

Every real spherical harmonic of even degree is congruent to its mirror image. We prove that a real spherical harmonic of odd degree $n\ge3$ with distinct Maxwell axes is congruent to its mirror image if and only if the hyperelliptic curve of genus $n-1$ defined by its binary form has a reduced automorphism of even order whose lift acts on the form by $-1$. We then determine the locus of these curves: it is the locus of curves with an extra involution if and only if $n-1$ is a power of two, and otherwise it also contains, for each even divisor $k$ of $n-1$ with odd cofactor $d\ge3$, an irreducible family $y^2=x K(x^{2k})$, $°K=d$, with generic reduced automorphism group $\Z/2k$. For $n=3$ the condition is the vanishing of the skew invariant of the binary sextic. As an application, the invariants of the truncated spherical harmonic expansion of a genus-zero surface, in a conformal parameterization normalized by its conformal barycenter, give a descriptor that is exactly invariant under parameterization, position and scale, records handedness, and is stable in the orbit distance.

fields
Algebraic Geometry
pdf ↗ page arXiv:2609.39567 ↗

We consider multi-dimensional quasiperiodic Schrödinger operators with monotone sawtooth-type potentials in the perturbative localization regime. We prove that a given gap is closed iff a corresponding (via a natural gap labeling) eigenfunction vanishes at the origin. Using this, we show that for a generic choice of the sampling function $f$, the spectrum of such an operator is a Cantor set, with all possible gaps being open. We also provide a class of functions $f$ for which some gaps are closed. Finally, we observe that certain gaps are more difficult to close than the others.

comments
Fixed an error in Example 4.12 in the previous version: condition (4.16) is not possible due to monotonicity of $f$, which leads to Corollary 4.12 and a separate class of gaps (semi-principal gaps). Added Examples 4.13 and 4.14 for further illustration
fields
Spectral Theory, Mathematical Physics
pdf ↗ page arXiv:2610.00733 ↗

For a prime power $q\geq2$ and an integer $m\geq2$, let $PG(m,q)$ denote the $m-$dimensional projective hypergraph over the finite field $\mathbb{F}_q$. Employing the $\mathsf{L}^p-$method and using the incidence structure, we establish the Turán density of $PG(m,q)$ \begin{equation*} π(PG(m,q))\leq\begin{cases} \left(1-\frac{1}{q+1}\right)^{\frac{1}{q}} & \text{ if } m=2, \left(1-\frac{1}{(q+1)|E(PG(m-1,q))|}\right)^{\frac{1}{1+q^{m-1}}} & \text{ if } m\geq3. \end{cases} \end{equation*} The previously known upper bound on its Turán density was $1-\binom{q^m}{q}^{-1}$. As a consequence of our estimate, this upper bound is improved for each prime power $q\geq3$ and for each dimension index $m\geq2$. For a positive integer $t$, let $B_{t}[PG(2,q)]$ be the $(q+1)-$graph formed by taking $t$ copies of the $PG(2,q)$ that shares a common edge. Using the $\mathsf{L}^p-$method, we establish that the upper bound of the Turán density of $B_{t}[PG(2,q)]$ is $\left(1-\frac{1}{q+1}\right)^{\frac{1}{qt}}$.

comments
$r-$graph, Turán density, projective plane and hyperplane, $\mathsf{L}^{p}-$method
fields
Combinatorics
pdf ↗ page arXiv:2610.01084 ↗

We establish complexity lower bounds for stochastic first-order algorithms in nonconvex–concave minimax optimization, allowing algorithms to use variance reduction. Our main contribution is a lower bound for a zero-respecting algorithm class that permits variance reduction, extending beyond the algorithmic restrictions imposed by some existing lower bounds. We consider objectives with an $L$-Lipschitz continuous joint gradient, a compact convex dual domain of Euclidean radius at most $D_Y$, and a primal value function, defined by maximizing the objective over the dual variable, with initial suboptimality at most $Δ$. The target accuracy $\varepsilon$ is measured by the gradient norm of the Moreau envelope of the constrained primal value function with parameter $1/(2L)$. Under an unbiased stochastic first-order oracle with variance at most $σ^2$ and mean-squared smoothness, we prove the lower bound $Ω\!\left(L^2D_YΔ\varepsilon^{-3}+L^3D_Y^2Δσ^2\varepsilon^{-6}\right)$. This result quantifies the dependence on accuracy, dual-domain radius, and oracle noise even when variance reduction is allowed. We also establish complementary lower bounds for nonconvex–strongly-concave minimax optimization. With dual strong-concavity parameter $μ>0$ and condition number $κ:=L/μ$, we obtain $Ω\!\left(LΔ\sqrtκ\,\varepsilon^{-2}+LΔκσ^2\varepsilon^{-4}\right)$ under the bounded-variance oracle model. Under the additional mean-squared smoothness condition with constant $\bar L$, we obtain $Ω\!\left(LΔ\sqrtκ\,\varepsilon^{-2}+Δ\bar Lσκ^{3/2}\varepsilon^{-3}\right)$. Together, these results identify complexity barriers across the concave and strongly concave regimes, with the main nonconvex–concave bound remaining valid for algorithms that use variance reduction.

fields
Optimization and Control
pdf ↗ page arXiv:2610.01662 ↗

We introduce a technique for studying state preparation complexity in the quantum $p$-spin model on $n$ qubits, a disordered quantum spin system with random interactions on every set of $p$ qubits. We reduce the task of proving state preparation lower bounds to bounding the local profile complexity of the class, a quantity derived from the metric entropy of the set of vectors recording each state's expectation values against all weight-$p$ Pauli strings. We show that, for sufficiently large fixed $p$, any class with local profile complexity $O(n^2)$ remains separated from the ground-state energy by $Ω(\sqrt n)$, a gap on the leading energy scale. When the profile complexity is $o(n^2)$, we prove the stronger conclusion that the class cannot outperform a benchmark class of simpler states at leading order. Product states always provide such a benchmark. Our framework strengthens known bounds and covers classes beyond the reach of previous methods. These include examples where circuit lightcones extend across the entire system, preventing an application of standard arguments. We obtain an $Ω(n^2/\log n)$ gate lower bound for preparing near-ground states and depth–width tradeoffs, allowing arbitrary one- and two-qubit gates and arbitrarily many discardable ancillas. We also derive lower bounds on entanglement depth and matrix product state bond dimension, and energy obstructions for forward and reverse magic at every fixed level of Parham's magic hierarchy (arXiv:2504.19966). For Clifford circuits doped with $T$-gates, we obtain sharper energy comparisons using product stabilizer states as a more restrictive benchmark. The proof combines an adaptation of a nonsymmetric quantum de Finetti theorem (arXiv:1810.12197) with metric-entropy bounds for the Gaussian process indexed by the local profiles of states in the class.

comments
102 pages
fields
Probability
pdf ↗ page arXiv:2610.02166 ↗

Post-fault ascent replanning for launch vehicles requires rapid joint trajectory-guidance replanning under uncertainty to maintain closed-loop constraint satisfaction. In particular, propulsion performance cannot be promptly and fully identified after a fault, leaving persistent parametric uncertainty throughout the remaining flight. A fast stochastic ascent replanning method is developed to address this problem. To efficiently account for the cross-time correlation induced by persistent parametric uncertainty, a fast system level synthesis formulation is developed with a Riccati-based solution structure. The resulting feedback synthesis is complemented by a task-oriented terminal weighting method that shapes terminal covariance according to post-injection correction demand. These components are integrated with nominal trajectory replanning, chance-constraint tightening, and online feedback realization to establish a real-time joint stochastic trajectory-guidance replanning framework for launch vehicles. Nonlinear Monte Carlo simulations show that the proposed method effectively suppresses the influence of persistent parametric uncertainty and maintains stable convergence and high injection accuracy across parameter sweeps, with subsecond solution times. Compared with conventional ascent guidance, the empirical constraint-violation rate is substantially reduced.

fields
Optimization and Control
pdf ↗ page arXiv:2610.02989 ↗

Parallel samplers, including masked diffusion models, generate several coordinates per round from conditional marginals, and their accuracy depends on which coordinates are revealed together. A schedule can be improved in two natural ways: adaptively, by choosing later batches from the values already generated, or by randomization, by drawing the schedule at random. We show that randomization is strictly more powerful. For every $r \geq 1$ we construct a full-support distribution on $9r$ binary coordinates such that every deterministic three-round sampler, even with value-dependent batches and arbitrary product kernels, has forward Kullback-Leibler divergence at least $γr - \log 4$ with $γ\approx 0.0966$, whereas drawing one of four fixed schedules with two fair bits drives the divergence below $18 r β^r$ with $β\approx 0.966$. Both samplers query conditionals of the same target. The separation holds for every fixed number of rounds $T \geq 2$, a strict advantage survives perturbations of the target and errors in the conditional predictor, and exact rational arithmetic certifies the gap at nine coordinates, where trained neural predictors preserve it. The mechanism is a hidden mixture: each schedule preserves the dependence pattern of one component, while no deterministic first batch can serve them all.

comments
20 pages
fields
Information Theory
pdf ↗ page arXiv:2610.03335 ↗

We study the QWEP property of twisted crossed products and its relation to Fourier multiplier transference on noncommutative $L_p$-spaces. We show that QWEP is not preserved by crossed products of QWEP von Neumann algebras by hyperlinear groups. Our examples include trace-preserving actions of a torsion-free residually finite Kazhdan group on a diffuse abelian algebra and on the hyperfinite type II$_1$ factor. We also obtain non-QWEP crossed products with nontrivial scalar cocycles. For scalar twists, we prove that a finite trace-preserving crossed product is QWEP if and only if its ordinary crossed product and its twisted group von Neumann algebra are QWEP. In the positive direction, we establish a restriction theorem for scalar twists of regular wreath products. These results provide QWEP inputs for Fourier multiplier transference and identify a completely bounded multiplier norm obstruction to QWEP. Finally, operator-valued cocycles give finite QWEP crossed products whose acting groups are not hyperlinear.

comments
Updating refrences. Adding aknowledgements
fields
Operator Algebras, Functional Analysis, Group Theory
pdf ↗ page arXiv:2610.03424 ↗

Policy mirror descent (PMD) has a mature finite-time theory in discounted Markov decision processes (MDPs), but less is known in the average-reward setting, a more natural objective for many control applications. We give a finite-time, finite-sample analysis of PMD in ergodic average-reward MDPs built around a single master recursion that governs convergence for any critic, without external regularization. Its specializations yield linear rates for exact, inexact-tabular, and linear function approximation (LFA) updates. For exact PMD, the rate is tight in the worst case, and convergence can become superlinear. We complement these convergence results with critics whose end-to-end sample complexities improve the prior best policy-gradient dependence from $|S||A|\,t_{\mathrm{mix}}^3$ to $|S|\,t_{\mathrm{mix}}^3+|S||A|\,t_{\mathrm{mix}}^2$ in the tabular setting and from $|S||A|\,t_{\mathrm{mix}}^5$ to $d\,t_{\mathrm{mix}}^3$ under LFA. Matching information-theoretic lower bounds establish that both critics are optimal up to logarithmic factors.

comments
NeurIPS 2026 camera-ready version. 45 pages, 5 figures
fields
Optimization and Control
pdf ↗ page arXiv:2610.04117 ↗

We prove that a smooth immersed Euclidean submanifold is locally Nash if it satisfies the Dupin condition on the regular part of its unit normal bundle. This condition is equivalent to the Morse-Bott property of all squared distance functions and, for compact connected embedded submanifolds, to tautness over $\mathbb{Z}_2$. No local finiteness assumption on the regular locus, or regularity assumption on its complement, is required. We also prove that, in each fixed Euclidean space, every compact connected smooth taut submanifold can be joined to one of finitely many representatives by a Nash isotopy through taut embedded submanifolds. In each fixed intrinsic dimension, we also obtain only finitely many diffeomorphism types admitting taut embeddings in Euclidean spaces. We first treat hypersurfaces by combining a dimension-dependent degree bound on proper Dupin pieces with a continuation argument using finite jets and resultants. An analytic Hessian criterion then gives the Morse-Bott property, and small tubes extend the conclusions to arbitrary codimension. The degree bound also provides uniform semialgebraic complexity. Together with the semialgebraicity of tautness in parameter families and Nash triviality, this yields the finiteness and deformation results. Classical classification theorems give further topological restrictions.

comments
29 pages. Substantially revised and reorganized, with expanded proofs. The Morse-Bott characterization of the regular Dupin condition is made explicit. The analytic Hessian criterion is strengthened to a necessary and sufficient condition. Title and abstract updated
fields
Differential Geometry
pdf ↗ page arXiv:2610.04679 ↗

We characterize compactly supported functions $f$ in Dunkl–BMO spaces as those that can be written as \begin{equation*} f=g+\widetilde{S}_{μ,\mathcal{P}}, \end{equation*} the sum of some bounded function $g$ and the generalized balayage $\widetilde{S}_{μ,\mathcal{P}}$ of a Carleson measure on $\mathbb{R}^{N}\times(0,\infty)$ associated with the Dunkl–Poisson semigroup. As a direct application of this representation of Dunkl–BMO functions, we establish a new characterization of the Hardy space in the Dunkl setting via a principal value integral related to $\widetilde{S}_{μ,\mathcal{P}}$. Moreover, analogous conclusions hold for the Dunkl–heat semigroup as well.

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

We study the non-parametric estimation of the roughness of a path from discretely sampled observations. Our approach is based on the concept of normalized power variation of a path. The estimator identifies a variation index by comparing coarse increments with local sums of fine increments. We prove pathwise consistency under Hölder regularity, nondegenerate coarse critical power sums, uniform local bounds on fine critical power sums, and separation of the two sampling scales and obtain a convergence rate for the estimator. Neither convergence of critical variation nor monotonicity of the finite-sample statistic is required. The result applies to fractional Brownian motion under dyadic sampling and to Schauder series with bounded coefficients bounded away from zero. For signed Takagi–Landsberg functions we obtain a uniform asymptotic formula and a quantitative bound for every root of the estimating equation in a fixed parameter interval. For fractional Brownian motion, we obtain asymptotic uniqueness of the estimating root and a polynomial almost-sure error bound. We illustrate the results with numerical experiments for Takagi-Landsberg functions, fractional Brownian motion and the stochastic heat equation.

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

Let $E\subset\mathbb R^2$ be analytic with $t=\dim_{\mathrm H}E>1$. We prove $\dim_{\mathrm H}ΔE\ge 4/5+η_0$ for an absolute, non-explicit constant $η_0>0$, and \[ \dim_{\mathrm H}ΔE\ge \frac{t^2-2t+5}{2t^2-7t+10} \quad\text{for }1<t\le\frac{11-\sqrt{41}}{4}, \] which reaches $7/8$ at the right endpoint. For pinned distances, $\dim_{\mathrm H}Δ_xE\ge q_*=0.7813\ldots$ for every $x\in\mathbb R^2$ outside an exceptional set of Hausdorff dimension at most one, with stronger bounds depending on $t$ and further exceptional-set estimates. If $E$ is compact and supports an $s$-Frostman measure $μ$, $s>1$, then \[ \underline{\dim}_{\mathrm B}Δ_xE\ge \max\left\{\frac45+η_0,\min\left\{\frac{3s+1}{5},\frac78\right\}\right\} \] for $μ$-almost every $x$. The same bound holds for pinned Hausdorff dimension under a common dyadic mass law, allowing oscillation with scale. We retain information about both endpoints in the Kolmogorov complexity estimates of Stull and Fiedler–Stull. Applying the partition estimates with the endpoints reversed yields $4/5$ and the rational bound. Equality forces both information profiles to have excess information on a common interval of scales. Encoding one source measure for all pins converts this constraint into a configuration of points and circles with many rich perpendicular bisectors. Lower bounds of Katz–Tardos and Ren–Wang contradict the upper bound of Fu–Gan–Ren; compactness then gives $η_0>0$. This rigidity argument has a precedent in the work of Héra, Shmerkin and Yavicoli on Furstenberg sets, using Bourgain's projection theorem. A separate finite-scale selection proves the pinned lower box bound.

comments
122 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.05500 ↗

We show that, in equal characteristic $p$, the Hodge-Witt polygon can only move down and domino numbers can only increase under specialization in smooth proper families. We also show that the Hodge polygon of the generic fiber of a proper smooth $p$-adic formal scheme over $\mathcal{O}_C$ lies on or above the Hodge-Witt polygon of its special fiber, where $C$ is a complete algebraically closed extension of $\mathbb{Q}_p$. We further show that, in this mixed-characteristic setting, if the crystalline cohomology of the special fiber is torsion-free in degrees $n$ and $n+1$, then the degree-$n$ Hodge polygon of the generic fiber lies on or below the abstract Hodge polygon of the special fiber. We illustrate these comparisons with explicit examples.

comments
32 pages
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2610.05892 ↗

We study the Euclidean Varadhan formula (EVF) and path laws for diffusions with critical divergence-free drifts in dimension $d\geq2$. For drifts given by smooth bounded skew-symmetric stream matrices, we prove a quantitative lower bound under a sector condition with a lower-order term. Its constants depend only on the dimension and the sector condition data. By approximation, the locally uniform Euclidean lower bound holds for all divergence-free $L^\infty_t{\rm BMO}^{-1}_x$ drifts. However, a time-dependent counterexample shows that EVF can fail even for a drift in $L^\infty_tL^d_x$. A complementary upper bound is given under a structural decomposition condition. In particular, for every time-independent $L^{d,\infty}$ drift (without any smallness assumption), and the decoupled diffusion associated with the two-dimensional vorticity equation, the EVF holds. Finally, we construct a time-independent $L^d$ drift whose SDE has a unique strong solution from the origin and whose path law is mutually singular with the corresponding driftless Brownian law. The same diffusion satisfies EVF, showing that Brownian short-time endpoint costs can persist despite singularity of the path law.

comments
37 pages, 2 figures
fields
Probability
pdf ↗ page arXiv:2610.06341 ↗

A tournament is $k$-universal if it contains every tournament on $k$ vertices as a subtournament. We give a 7-universal tournament on 14 vertices, improving the upper bound of 15 due to Zhang and Szeider. Together with their lower bound, it follows that the smallest 7-universal tournament has 13 or 14 vertices.

fields
Combinatorics
pdf ↗ page arXiv:2610.06891 ↗

In this note, we establish quantitative stability of aggregation-diffusion energy for compactly supported data. Our consideration focuses on the degenerate diffusion with local attraction that are asymptotically flat at infinity, such as Riesz kernels. We characterize the spectral gap of the Wasserstein Hessian at steady states.

comments
18 pages, 2 figures
fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2610.07264 ↗

We study the Iwahori Gaiotto conjecture for cotangent types and its application to the representation theory of the (mixed, small, and Lusztig) quantum supergroups. Using local and global models and SW-Zastava spaces, we construct factorization functors and compare the Iwahori Gaiotto category with the category $O$ of the mixed quantum supergroup. We then study the images of intersection cohomology sheaves and the metaplectic Hecke action. In type A, we describe the finite and affine monodromic categories, the corresponding Yokonuma–Hecke actions, and their role in the Kazhdan–Lusztig algorithm. The last section treats the pointwise purity.

comments
comments welcome!
fields
Representation Theory, Quantum Algebra
pdf ↗ page arXiv:2610.08243 ↗

We characterize when a semi-infinite banded totally positive matrix admits a positive bidiagonal factorization, without assuming boundedness, and establish criteria for stability under perturbations. These criteria distinguish whether the initial factor entries are fixed or allowed to vary. For banded totally positive Toeplitz matrices, such factorizations always exist; a factorization can be chosen to depend analytically on all sufficiently small perturbations within the same band if and only if the polynomial symbol has distinct roots. Explicit root formulas determine the associated mixed-type multiple orthogonal polynomials and their matrix of positive measures. They also yield scalar linear forms independent of the chosen factorization, from which we obtain asymptotic zero spacing and sine-kernel limits. We further treat finite boundary modifications and limiting zero distributions for matrices with convergent diagonals.

fields
Classical Analysis and ODEs, Mathematical Physics, Probability, Spectral Theory
pdf ↗ page arXiv:2610.08568 ↗

We prove a prime number theorem for fixed terminal block words in a family of Pisot integer numeration systems defined by canonical block expansions. Suppose that the dominant root $\varphi$ is a Pisot number and that the characteristic polynomial $P_h$ is its minimal polynomial. Then every terminal block word of total digit-length $m$ occurs among the primes with asymptotic frequency $\varphi^{-m}$. The result recovers the known Zeckendorf and generalized Fibonacci cases and extends the terminal-prime problem to irreducible Pisot-unit systems without assuming that the recurrence coefficients are monotone, that the canonical expansions are greedy, or that the finiteness property (F) holds. Explicit non-$β$ families and Pisot units failing (F) illustrate this extension. The main structural ingredient is a canonical block language whose expansion of the companion substitution fixed word records the corresponding integer expansions in natural order. This connects terminal conditions with Rauzy cylinder windows and then with a linear orbit on a compact torus. The required multiplicity-one geometry follows from Barge's pure-discreteness theorem after reversal of the substitution words. The same toral model yields prime genericity for finite factors of the substitution fixed word, polynomial sampling laws, asymptotic independence from fixed congruence classes, fixed-shift correlation formulas, and Möbius orthogonality. Combined with established prime theorems, it also gives a terminal refinement of Chebotarev and arithmetic progressions inside fixed terminal prime classes.

comments
Literature updates and additional examples
fields
Number Theory, Dynamical Systems
pdf ↗ page arXiv:2610.10026 ↗

Start with the number $2$. At each move, combine two numbers already made, but the operations must be used in the fixed repeating order $+,\times,-,÷$. We ask for the fewest moves needed to make every integer from $1$ to $N$. Since $2$ is already one of the numbers we want and each move makes at most one new number, at least $N-1$ moves are needed. We show that $N-1$ moves are also enough for every $N\ge 9$. Conventional induction cannot work, because a division that comes right after a completed interval $\{1,\dots,P\}$ produces numbers already made. Instead we extend a completed interval $\{1,\dots,P\}$ to $\{1,\dots,3P\}$ all at once, which counting shows is the smallest multiplicative extension $P\to kP$ that can work, and then adjust the last few moves to reach every other $N$. For $9\le N\le 33$ we give explicit sequences, found by computer search.

comments
25 pages, 2 figures, 9 tables. Verification code: https://github.com/poscle/AMSD-Number-Generator
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2610.10095 ↗

We study a Monge normal form of a surface in $\mathbb{R}^4$ based on the principal axes of its curvature ellipse. The curvature-ellipse-based Monge normal form is obtained using only Euclidean motions of the ambient space and local reparameterizations of the surface, and preserves the Euclidean invariants of the curvature ellipse, including its semi-axis lengths up to their ordering. We also give applications of this normal form to the $2$-jet geometry of surfaces in $\mathbb{R}^4$ and to the geometry of their orthogonal projections.

fields
Differential Geometry
pdf ↗ page arXiv:2610.10132 ↗

We study approximately uniform sampling of satisfying assignments from random $k$-SAT formulas. Fix a constant $B>0$. For every $k\ge 2^{20}$ and density $0<α\le 2^k/k^{16}$, we prove that, with high probability over a random formula on $n$ variables, every accuracy $n^{-B}\le\varepsilon\le 1/2$ admits a sampler whose output distribution is within total variation distance $\varepsilon$ of the uniform distribution on satisfying assignments with expected running time $$\widetilde O_B\left(\mathrm{poly}(k,α+1)n^{2+η}\right),\quad 0<η\le 2^{16-k}.$$ In particular, the exponent of $n$ is $2+O(2^{-k})$ while the dependence on the width and density is polynomial with a universal degree. This improves the parameter-dependent polynomial exponent of the sampling algorithm of Chen, Lonkar, Wang, Yang, and Yin (STOC 2025) in the density regime $2^k/\mathrm{poly}(k)$. Our algorithm separates a high-degree core from the remaining variables. Every residual formula on the good variables is a deletion subformula of a common bounded-dependency formula. Adapting the rejection–repair framework of Liu, Wang, Yin, Zhang and Zhou (arXiv 2026), we construct an executable sampler for all such residual formulas using ordinary connected violation sets replacing weighted 2-tree witnesses and use it to simulate approximate block heat-bath updates on the core. To analyze the resulting core chain, we integrate out the good variables, represent the core marginal by an absolutely convergent polymer expansion and combine a component-swap variance comparison with an adaptive exploration bound. Absorbing single-component interactions into the local weights leaves interactions of cluster size at least two; retaining their additional decay gives a spectral gap of at least $1/(2s n^{2^{12-k}})$ where $s$ counts core components. Together with the residual sampler, this yields the stated running time.

comments
A revised version with fast expected running time
fields
Probability
pdf ↗ page arXiv:2610.10474 ↗

We systematically explore the relationship between edge-connectivity and Lin–Lu–Yau curvature for graphs. The intuition is that a connected graph with large Lin–Lu–Yau curvature should also have large edge-connectivity, and vice versa under suitable conditions. We prove that the edge-connectivity of a connected graph is bounded lower by the product of its minimum degree, its Lin–Lu–Yau curvature and the constant $\frac{3}{2}$. We also provide two lower bounds on the edge-connectivity of a graph that guarantee positive Lin–Lu–Yau curvature, and discuss the sharpness of these bounds.

fields
Combinatorics, Differential Geometry
pdf ↗ page arXiv:2610.10559 ↗

We develop new methods for studying infinite girth in finitely generated residually finite groups, particularly those containing no non-abelian free subgroups and satisfying no non-trivial group law. Our main contribution is a probabilistic Nielsen-component lifting principle, based on product replacement graphs, which provides a criterion for transferring suitable generation and word-avoidance properties of finite quotients to the ambient group. As an application, we prove that every finitely generated group admitting infinitely many pairwise non-isomorphic non-abelian finite simple quotients has infinite girth, with extensions to quasisimple and, under additional hypotheses, almost-simple quotients. We further establish infinite girth for the B. H. Neumann group and the Bou-Rabee-Seward group, obtaining new results on the occurrence of non-abelian finite simple quotients and sections. By a different construction, we also prove that Alt_fin(Z) semidirect Z has infinite girth. Finally, we establish a marked finite-quotient characterization of infinite girth for finitely generated residually finite groups and prove that, for linear groups over fields of characteristic zero, large marked girth can be realized in congruence quotients. We conclude with several open questions and remarks arising from our results.

comments
Many new results were added to the current version (e.g. Theorem A, Corollary B & Corollary C), and many structural changes were made. The Question 1.1 is completely resolved now. Question 1.2 was added and also resolved. Section 5.3, 6.1, and 6.2 are added to the last question and remark section
fields
Group Theory, Commutative Algebra, Representation Theory
pdf ↗ page arXiv:2610.10925 ↗

Extending recent works on the restricted divisor function over integers, we consider an analogue of this function over the function field. We provide some exact and asymptotic formulas related to this function.

comments
16 pages
fields
Number Theory
pdf ↗ page arXiv:2610.11240 ↗

Let \(b(M)\), \(d(M)\), and \(r(M)\) denote the number of bases, the number of circuits, and the rank of a matroid \(M\), respectively. Using a weighted count of fundamental circuits, we prove that every nonempty simple binary matroid \(M\) with no coloops satisfies \[ 2b(M)\ge(r(M)+1)d(M), \] with equality if and only if \(M\) is isomorphic to the Fano matroid. This settles a conjecture recorded by Oxley in 1983. For every \(e\in E(M)\), we also establish the deletion bound \(b(M\backslash e)\ge d(M)\) and characterize its equality cases. The deletion bound yields a sharp linear lower bound for basis growth under successive series extensions. Finally, under a circuit-size exclusion condition, every pair \((C,e)\) with \(C\) a circuit of a prescribed size and \(e\in C\) can be assigned a distinct basis containing \(C-e\).

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

We establish a conditional theory of genuinely non-perturbative global dynamics for the cutoff Boltzmann equation with hard potentials on the three-dimensional torus. We prove that any global mild solution satisfying \[ \sup_{t\ge0}\int_{\mathbb R^3}W(v)\sup_{x\in\mathbb T^3}F(t,x,v)\,dv<\infty, \] for a suitable stretched-exponential weight \(W\), enjoys uniform weighted \(L^\infty\) control, is unique in the dissipative mild class, and converges exponentially to the global Maxwellian. In particular, these conclusions hold for arbitrary-amplitude solutions admitting a uniform stretched-exponential velocity upper bound. The key mechanism is a *tail-to-coercivity principle*: uniform velocity-tail control generates positive lower bounds for the local density and nonlinear collision frequency, without imposing macroscopic coercivity a priori. A double-Duhamel positivity argument also generates a Gaussian lower bound at arbitrarily short positive times, allowing initial data with local vacuum. We establish a polynomially weighted counterpart under an additional spatially uniform lower velocity profile, obtaining analogous weighted \(L^\infty\) bounds, uniqueness, and exponential relaxation. Our results provide a low-regularity alternative to conditional theories requiring smoothness and pointwise macroscopic bounds. They reveal how a single velocity-tail condition controls large-data Boltzmann dynamics and suggest a route toward problems with physical boundary conditions.

comments
Revised version for journal submission, including the new Theorem 1.18. 131 pages,
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.12093 ↗

We construct smooth closed embedded minimal surfaces with everywhere negative Gaussian curvature in the unit round four-sphere. More precisely, for every sufficiently large integer $m$, our construction gives a minimal surface $Σ_m$ of genus $m^2+1$ such that $\operatorname{Area}(Σ_m)\to 4π^2$ as $m\to+\infty$. This result yields a complete solution to Problem 101 in Yau's 1982 list of open problems.

comments
65 pages, 7 figures. v2: Substantially revised exposition; routine computations in Riemannian geometry moved to the appendices. All comments are welcome!
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2610.12238 ↗

For a known finite-dimensional model subspace, classical Gaussian regression theory guarantees that least squares eventually attains the parametric rate, with prediction error scaling as the subspace dimension divided by the sample size. Yet subspaces with the same number of unknown coefficients can require very different sample sizes to reach this regime. For subspaces of polynomials on the Boolean cube, a fundamental question is how restrictions on degree and ambient dimension jointly determine this threshold. Our main result sharply characterizes the worst-subspace minimax sample threshold over a substantial parameter range, revealing an exponential dependence on degree and precisely quantifying the joint effects of degree, ambient dimension, and subspace dimension. A small modification of our lower-bound construction reveals a strong separation: a single subspace can admit noiseless recovery with optimal sample complexity independent of degree, yet require essentially the worst-case sample size, exponential in degree, to attain the noisy parametric rate. To establish the sampling lower bound, we sharpen the Polyanskiy-Samorodnitsky uncertainty principle (J. Funct. Anal., '19) to uniformly optimal precision and extend its concentration guarantee to large subspaces in which every function concentrates most of its energy on one shared Hamming ball. The sampling upper bound follows from the sharp moment bound of Kirshner and Samorodnitsky (IEEE Trans. Inf. Theory, '21) combined with empirical-process bounds.

fields
Probability, Information Theory, Combinatorics
pdf ↗ page arXiv:2610.12358 ↗

Given an integer $k \geq 2$, there are integers $M_k$ and $P_k$ so that for all $A \subseteq \mathbb F^n_p$ does not contain a restricted polynomial progression of the form \begin{align*} x, x+\begin{pmatrix} y_1 \\ y_2 \\ \vdots \\ y_n \end{pmatrix}, x+\begin{pmatrix} y_1^2 \\ y_2^2 \\ \vdots \\ y_n^2 \end{pmatrix}, \ldots, x+\begin{pmatrix} y_1^{k-1} \\ y_2^{k-1} \\ \vdots \\ y_n^{k-1} \end{pmatrix}, \end{align*} where $x \in \mathbb F^n_p$, with $p>P_k$, and $y \in \{0,2, 3, \ldots, M_k\}^n \backslash \{\vec{0} \}$, for some fixed $M_k$, then $A$ must have density bounded above by $\frac{C}{(\log^{(k^{O(k)})} n)^c}$, where $C, c>0$ only depend on $k$ and $p$. For $k\geq 4$, the best previously known bound came from the density Hales–Jewett theorem and was of inverse Ackermann type. The proof uses a recent inverse theorem for noise stability of Bhangale, Khot, Liu and Minzer, which arose in the study of constraint satisfaction problems. The main new ingredient is a proof that the underlying distribution counting restricted polynomial progressions does not admit a nontrivial abelian embedding, by way of an involved algebraic argument. Reasonable bounds are provided for $P_k$ and $M_k$.

code
github.com/lacey-gatech/restricted-polynomials-lean ∎ Lean project (lakefile.toml, lean-toolchain) builds with 2 sorry warnings at b31e436, checked 2026-11-03 build details
comments
35 pages. The paper is formalized, up to twos admit for the inverse Theorem 1.4, and a Theorem of Dimitrov at this URL https://github.com/lacey-gatech/restricted-polynomials-lean
fields
Number Theory, Classical Analysis and ODEs, Combinatorics
pdf ↗ page arXiv:2610.12831 ↗

For every smooth projective generalised Markoff surface $X_m$, every hyperplane section $H$, and every integer $n\ge2$, we establish Campana strong approximation with the Brauer–Manin obstruction for $\bigl(X_m,(1-1/n)H\bigr)$.

comments
14 pages
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2610.13528 ↗

We prove that every set $\mathcal{B}\subseteq\mathbb{Z}_{\ge0}$ for which $\mathbb{P}+\mathcal{B}$ contains all sufficiently large integers satisfies $B(X)\gg\log X\log\log X$, where $B(X)=\#(\mathcal{B}\cap[0,X])$ and the implied constant is absolute. This proves a quantitative form of Ruzsa's Conjecture 2 and gives a negative answer to the $O(\log X)$ question in Erdős Problem 32. The bound follows from a more general result: for an arbitrary set $\mathcal{B}\subseteq\mathbb{Z}_{\ge0}$ and sufficiently large $X$, we construct a block of $\lfloor c\log X\log\log X/(B(X)+1)\rfloor$ consecutive integers in $[X/2,X]$ outside $\mathbb{P}+\mathcal{B}$, provided this length is positive. As an application, we obtain $G_{\mathcal R}(X)\gg\log\log X$ for the longest block in $[1,X]$ containing no Romanoff number $p+2^n$, improving the bound $G_{\mathcal R}(X)\gg\log\log X/\log\log\log X$ of Kalmynin and Konyagin. The argument also applies to $p+a^n$ for every fixed integer $a\ge2$. The key step is a lemma on large shifts, proved using truncated products of divisor sums and the removal of auxiliary primes dividing differences of shifts.

comments
32 pages. Substantially revised and expanded version of "A lower bound for additive complements to the primes", with a new title. Includes a detailed proof of a large-shift lemma and new results on gaps between Romanoff numbers
fields
Number Theory
pdf ↗ page arXiv:2610.14127 ↗

We resolve the long-standing problem of Rudin concerning uniformly bounded orthonormal bases of homogeneous polynomials on complex unit spheres. Specifically, we show that for every $K \geq 2$ and $N \geq 0$ there exists a basis of degree $N$ homogeneous polynomials in $\mathbb{C}^K$ that is orthonormal with respect to the surface measure of the unit sphere of $\mathbb{C}^K$ and uniformly bounded by a constant depending only on $K$ on the unit ball of $\mathbb{C}^K$. Bourgain resolved the case $K = 2$ in 1985 and the case $K = 3$ in 2016. No cases $K \geq 4$ were previously known.

comments
39 pages; a lemma simplified; AI statement enlarged;
fields
Classical Analysis and ODEs, Metric Geometry, Number Theory
pdf ↗ page arXiv:2610.14160 ↗

A quasiconformal uniformization theorem of Rickman from 1966 asserts that every bounded turning planar arc is the image of the unit segment under a quasiconformal self-map of the plane. We prove an analogous uniformization theorem for planar trees by showing that every planar quasiconformal tree with uniform branch separation is quasiconformally equivalent to a quasiconvex planar tree with uniform branch separation and Hausdorff dimension arbitrarily close to 1. Along the way, we show that every quasisymmetric (resp. bi-Lipschitz) homeomorphism between planar quasiconformal trees that respects the counterclockwise orientation of the branches at every branch point can be extended quasisymmetrically (resp. bi-Lipschitz) to the whole plane. As a corollary of the extension theorem we construct a class of quadrivalent quasiconformal trees, which includes the Vicsek fractal, so that each tree in this class is the Julia set of a uniformly quasiregular map of $\mathbb{R}^2$.

comments
72 pages, 14 figures
fields
Metric Geometry
pdf ↗ page arXiv:2610.14236 ↗

For a fixed prime $p$, a group is called a $p'$-group if the orders of all its elements are coprime to $p$. It is well known that in a finite $p'$-group an automorphism of order $p$ is regular if and only if it is a splitting automorphism of period $p$. In the Kourovka Notebook, V.\,D.~Mazurov asked whether these two notions coincide for periodic $p'$-groups. We answer this question in the negative by constructing a periodic group of prime period $q$ that admits a regular automorphism of order $p \neq q$ which is not splitting.

fields
Group Theory
pdf ↗ page arXiv:2610.15360 ↗

Emil Artin asked whether the left and right dimensions of an extension of skew fields must agree. Cohn and Schofield gave counterexamples through elaborate constructions. Call a division ring index-symmetric if every division subring with at least one finite index has equal finite indices. It has been a long-standing open question whether there exists an index-symmetric division ring that is infinite-dimensional over its center. We give the first such examples: using a duality formula for bimodules over division algebras, we prove that every twisted Calabi–Yau division algebra is index-symmetric. This applies to the Weyl skew fields and, more generally, to the quotient division rings of rings of differential operators on smooth affine varieties in characteristic zero, to quantum skew fields, to the quotient division rings of noetherian AS-regular Hopf domains, and to the quotient and degree-zero division rings of three- and four-dimensional elliptic Sklyanin algebras, which we show to be twisted Calabi–Yau. In particular, every division ring on Artin's list of noncommutative surfaces is index-symmetric.

comments
17 pages. v2: list of examples extended; minor corrections
fields
Rings and Algebras, Quantum Algebra
pdf ↗ page arXiv:2610.15469 ↗

We study weighted Fourier extension estimates for the truncated cone. Building on the framework of Du–Li–Wang–Zhang, we introduce a more refined trilinear estimate. We obtain this estimate by applying weighted bilinear restriction on half-scale cubes and combining tube traversal with trilinear Kakeya to sum the local packet energies. Together with Lorentz rescaling, it yields improved weighted extension estimates.

comments
Refined the result using ChatGPT
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.16294 ↗

Given a graph $T$ and a nonempty family $\mathcal{F}$ of graphs, let $\operatorname{ex}(G, T, \mathcal{F})$ denote the maximum number of copies of $T$ in an $\mathcal{F}$-free subgraph of a host graph $G$. Alon and Shikhelman [Algorithmica, 2022] conjectured that if $e(T)> 0$ and no member of $\mathcal{F}$ is a subgraph of a blow-up of $T$, then for every $\varepsilon>0$, approximating $\operatorname{ex}(G, T, \mathcal{F})$ within an additive error of $n^{v(T)-\varepsilon}$ is NP-hard for an input graph $G$ on $n$ vertices. Previous advances toward this conjecture include the resolution of the canonical case $T=K_2$ by Alon, Shapira, and Sudakov [Ann. of Math., 2009], as well as the case of $\operatorname{ex}(G,K_m,K_k)$ by Alon and Shikhelman. In this paper, we confirm this conjecture for every bipartite graph $T$ and every clique $T$. Our proof reductions combine several techniques, including iterative leaf additions, symmetric rooted extensions, and random transversals. Together, they encode the optimal value of the NP-hard Max $r$-Colorable Subgraph problem into the objectives $\operatorname{ex}(G, T, \mathcal{F})$ for a suitably constructed graph $G$.

comments
34 pages, 0 figures
fields
Combinatorics
pdf ↗ page arXiv:2610.16358 ↗

One main aim of our paper is to formulate noncommutative versions of the Lebesgue dominated convergence theorem in the setting of quantum integration theory on von Neumann algebras. Our starting point is a reformulation of classical dominated convergence in terms of weak* convergence. Using our recent sequential-continuity theorem, we obtain dominated convergence formulations for sequentially normal states and, under domination by a fixed bounded integrable majorant, for sequentially normal weights. Integrable, possibly unbounded, majorants are treated first in the tracial setting, then for arbitrary von Neumann algebras using Haagerup's \(L^1\) space, and finally using normal semifinite weights and their GNS representations. For any faithful normal semifinite weight phi, weak* convergence of norm-bounded sequences is characterized by `integrating against' bounded positive integrable majorants. We also study noncommutative almost uniform and local almost uniform convergence, and make the relationship with the order convergence results of Chetcuti et al. explicit. In particular, for norm-bounded sequences, local phi-bilaterally almost uniform convergence implies weak* convergence and \(\|h^{1/2}(x_n-x)h^{1/2}\|_1\to0\) for every positive Haagerup L1 density h, without assuming \(σ\)-finiteness. We also prove a dominated convergence theorem in the predual: fixed positive order domination and Petz's almost uniform convergence imply convergence in the predual norm. We establish implications and equivalences among these convergence notions, connecting dominated convergence with tracial and nontracial integration.

comments
Revision with new appendix, and some extra results and shortenings, etc
fields
Operator Algebras, Mathematical Physics, Functional Analysis
pdf ↗ page arXiv:2610.16499 ↗

We determine thirteen entirely CM identity fibers of Shimura parametrizations attached to elliptic curves of rank two and conductor below $2000$. Each yields a proof of the imaginary quadratic class number one theorem. The argument combines the Gross–Zagier formula with the Ribet–Takahashi degree comparison to show that the fiber is completely explained by known CM points.

comments
11 pages
fields
Number Theory
pdf ↗ page arXiv:2610.16953 ↗

Moment relaxations provide lower bounds for polynomial optimization problems, while their moment matrices can also carry information about solutions. We study whether atomic candidates extracted from clique blocks reveal part of a global minimizer in moment relaxations with correlative sparsity. We give sufficient conditions for global extendability. If the relaxation is value-exact and the moment matrix of a selected clique has maximum rank over the optimal face and satisfies simplicial regularity, then at least one of its atomic candidates is globally extendable. When this maximum rank is one, we derive a direct certificate for global extendability. Further examples demonstrate the necessity of value exactness for global extendability. Numerical experiments on unicycle trajectory optimization successfully yield near-optimal solutions through progressive extraction and fixing, demonstrating the practical effectiveness of the proposed approach.

fields
Optimization and Control
pdf ↗ page arXiv:2610.17371 ↗

Let $M$ be a finite-dimensional complete Riemannian manifold of bounded geometry. We consider a time-dependent vector field $X : \mathbb{R} \times M \to TM$ with $X_t:=X(t,\cdot) \in \mathfrak{X}^r(M)$ for all $t \in \mathbb{R}$ that satisfies some further uniform continuity assumptions. We suppose that $X$ admits a globally defined integral curve $γ: \mathbb{R} \to M$. To any isolated subset $Ω$ of the Sacker-Sell spectrum of $t \mapsto \nabla X_t(γ(t))$, Sacker-Sell theory associates a subbundle $\mathscr{N}^Ω$ of $T_γM$ invariant under $\nabla X_t$. Under additional nonresonance conditions on $Ω$, we prove, by an application of the parameterization method (Cabré et al., 2003), the existence of an invariant topological submanifold $\mathscr{W}^Ω\subset \mathbb{R} \times M$ with $C^r$ fibers $W_t^Ω:= \mathscr{W}^Ω\cap \{t\} \times M$ that is unique in a sufficiently smooth subclass of invariant manifolds uniformly tangent to $\mathscr{N}^Ω$ (made precise later). We moreover show regularity of $\mathscr{W}^Ω$ with respect to parameters, and characterize the attraction towards $\mathscr{W}^Ω$ via a foliation in the case $Ω$ is the slowest part of the spectrum.

comments
62 pages, 9 figures. Comments welcome!
fields
Dynamical Systems
pdf ↗ page arXiv:2610.18078 ↗

Let $G$ be a group and let $A$ be a set with at least two elements. A lazy cellular automaton over $A^G$ acts as the identity except at the cells where a fixed pattern occurs, where it replaces the central symbol by a fixed different symbol. Let $M(G;A)$ be the submonoid of $\mathrm{CA}(G;A)$ generated by the lazy and the invertible cellular automata. We study when $M(G;A) = \mathrm{CA}(G;A)$. Since no lazy cellular automaton is surjective, every surjective element of $M(G;A)$ is invertible; hence $M(G;A) \neq \mathrm{CA}(G;A)$ whenever $A$ is infinite or $G$ has an element of infinite order. More unexpectedly, if $|A| = 2$ and $G$ has a quotient isomorphic to the Klein four-group $C_2 \times C_2$, then $M(G;A) \neq \mathrm{CA}(G;A)$. For locally finite groups, these are the only obstructions: we prove that $M(G;A) = \mathrm{CA}(G;A)$ if and only if $3 \leq |A| < \infty$, or $|A| = 2$ and $G$ has no quotient isomorphic to $C_2 \times C_2$.

comments
15 pages
fields
Group Theory, Dynamical Systems
pdf ↗ page arXiv:2610.18480 ↗

We develop a near-boundary rigidity theorem for arbitrary nonzero Neumann eigenfunctions on bounded convex planar domains. Precisely, if an eigenfunction $u$ with positive eigenvalue $μ$ has an interior maximum-modulus point $p$ satisfying $\sqrtμ\,\text{dist}(p,\partialΩ)\leπ/\sqrt3$, then $Ω$ must be a rectangle and $u$ must be a cosine of one coordinate, and $μ\ge4μ_2(Ω)$, with the factor $4$ being sharp. This shows that a scale-invariant distance condition at just one maximum-modulus point determines the geometry of the entire domain and the explicit form of the eigenfunction. We further prove that the maximum modulus of every second Neumann eigenfunction on a bounded convex planar domain is attained only on the boundary, without assuming boundary smoothness or eigenvalue simplicity. Moreover, we also prove strict boundary maximum modulus for higher Neumann eigenfunctions under suitable conditions, including all third Neumann eigenfunctions on arbitrary triangles.

comments
21 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.18546 ↗

The spectral distance between two non-isomorphic graphs of the same order is the lp-distance between their ordered adjacency spectra, and the cospectrality of a graph G on a family Gn is the minimum such distance from G to another graph in Gn. Abdollahi and Zakeri (Ars Math. Contemp. 22(1) (2022) P1.06) conjectured that, for every n >= 4 and for p in {1, 2}, the cospectrality of the complete tripartite graph Kn,n,n among all graphs on 3n vertices is attained exactly at Kn-1,n,n+1. We disprove both conjectures for every n >= 4. As a counterexample we use the graph Hn = (n - 1)K1 nabla (K1 union Kn,n), whose spectrum we determine. It yields cs(1)(Kn,n,n) <= 1 + o(1) and cs(2)(Kn,n,n) <= 1/2 + o(1) as n -> infinity, contrary to the conjectured values. We also study the cospectrality of Kn,n,n for p = 2, asymptotically, among complete multipartite graphs with possibly added isolated vertices. We conclude the paper by posing a conjecture that Hn is the unique graph nearest to Kn,n,n for p in {1, 2} and every n >= 3, and a problem asking whether every connected graph H with sigma(2)(Kn,n,n,H) < 2/3 has an adjacency matrix of rank at most 5.

comments
14 pages, 0 figures
fields
Combinatorics
pdf ↗ page arXiv:2610.18636 ↗

For a fixed $k$-graph $F$, let $h_F(n,q)$ be the minimum number of copies of $F$ in an $n$-vertex $k$-graph with $\text{ex}(n,F)+q$ edges. Let $c(n,F)$ be the minimum number created by adding one edge to an extremal $F$-free $k$-graph. We construct stable counterexamples to Mubayi's supersaturation conjecture for every $k\ge2$. The ratio $h_F(n,q)/(q c(n,F))$ tends to zero over ranges extending beyond $n^{k-1}$. For graphs, we give examples of every chromatic number at least three. In particular, there is a graph $F$ for which this ratio tends to zero for $1\le q=o(n^{4/3})$. For $k\ge3$, we use connected linear expansions of $G=(M_a\cup K_{1,b}\cup I_h)\vee K_{m_1,\ldots,m_{k-1}}$. Under explicit parameter conditions, the ratio tends to zero for $1\le q=o(n^{k-1+(b-1)/(a+b-1)})$ when $b\ge k+1$. We prove the exact Turán theorems for both constructions and determine their unique extremal graphs and hypergraphs. Keywords: supersaturation; extremal graph; linear hypergraph; graph expansion; stability.

fields
Combinatorics
pdf ↗ page arXiv:2610.18876 ↗

Qudit codes often inherit the parameters of qubit codes, but not necessarily their correctable erasures. We show that a code encoding one qudit of dimension D into seven such qudits that corrects every erasure Steane's code corrects exists exactly when D is a power of 2; for the qutrit color code, exactly when D is odd. This needs no stabilizer assumption: these codes are, up to local unitaries, stabilizer codes of qubits, respectively prime-power qudits. The two patterns differ in one line, which completes the Fano plane only where 1+1=0. As ideal secret sharing schemes, these codes exist exactly where classical ones do: entanglement does not help, unlike for Euler's 36 officers. The same arithmetic makes the entropy cones of qubit and odd-dimensional stabilizer states incomparable from six parties on. At five, the stabilizer cone is strictly smaller than the quantum linear rank cone, answering an open question.

comments
v2: revised and extended version with a new title. Main text 20 pages, 3 figures; Supplementary Information (41 pages) appended. Data, certificates and code: https://doi.org/10.5281/zenodo.23841282
fields
Information Theory, Combinatorics
pdf ↗ page arXiv:2610.18905 ↗

A unit root makes linear count time series models such as the Poisson INGARCH(1,1) nonstationary. We show that a softplus link changes this. Weiß, Zhu and Hoshiyar (2022) introduced softplus INGARCH models and gave a sufficient condition for stationarity. For Poisson, negative binomial, gamma and related versions of these models, we obtain the necessary and sufficient condition, which allows a unit root. At a stationary unit root, the conditional mean has a power-law tail, and the observations can have infinite variance or long memory. To our knowledge, this is the first stationary unit root established for an INGARCH-type count model. For a fixed softplus scale, the Poisson quasi-maximum likelihood estimator is asymptotically normal both below and at the unit root, including cases with infinite variance. Two applications show that unit-root conclusions can depend on the softplus scale.

fields
Statistics Theory
pdf ↗ page arXiv:2610.19421 ↗

We develop and analyze a three-dimensional pure source transfer domain decomposition method (PSTDDM) for the Helmholtz equation in free space. Extending the two-dimensional PSTDDM proposed by [Du and Wu, J. Sci. Comput., 83(2020),83:68], the proposed method transfers sources successively along the $x_1$, $x_2$, and $x_3$ directions, yielding layer-wise, bar-wise, and block-wise PSTDDMs. The main challenge in the convergence analysis is deriving wavenumber-explicit truncation-error estimates. To address this challenge, we establish inf–sup conditions for the uniaxial perfectly matched layer (UPML) problem under relaxed restrictions on the PML parameters and reformulate the source-transfer operators. We then introduce a positive-definite reconstruction step that produces a globally conforming approximation. In addition, a new quantitative lower bound is established for the imaginary part of the complex PML distance, more easily yielding exponential decay estimates in three dimensions. These lead to wavenumber-explicit convergence estimates for all three PSTDDMs. Numerical experiments demonstrate the effectiveness of the proposed methods both as direct solvers and as preconditioners for GMRES.

comments
46pages
fields
Numerical Analysis
pdf ↗ page arXiv:2610.19435 ↗

In undirected multiple-unicast networks, where independent messages are sent between specified source–destination pairs, network coding allows intermediate nodes to combine messages, whereas fractional routing splits and forwards individual messages along paths without mixing them. Proposed in 2004 by Li and Li and independently by Harvey, Kleinberg, and Lehman, the multiple-unicast conjecture—a central conjecture in network coding with deep connections to computational complexity—asserts that network coding and fractional routing have the same achievable rate region. We construct a counterexample refuting this conjecture and use it to reduce block transfers in external-memory data rearrangement, thereby accelerating external-memory integer sorting and answering in the affirmative the longstanding question of Aggarwal and Vitter (1988) on whether integer operations can beat the comparison-sorting input/output (I/O) bound. Specifically, we give a deterministic sorting algorithm: for $N$ integers of $Θ(\log N)$ bits, a memory holding $M$ integers, and block transfers of $B$ integers, where $2B\le M\le N$, the number of block transfers is \[ O\!\left(\frac{N}{B}\left[1+ \frac{\log N}{(\log(M/B))^{1-\varepsilon}(\log M)^\varepsilon} \right]\right), \] where $\varepsilon=1.5\times10^{-5}$ is an absolute constant. This bound asymptotically improves on the classical $Θ\!\left(\frac{N}{B}\left[1+ \frac{\log(N/M)}{\log(M/B)}\right]\right)$ comparison-sorting bound in certain parameter regimes. Under the external-memory model specified in this paper, we have formally verified the algorithm's correctness and I/O complexity bound in Lean~4.

code
github.com/rtyu-1/coded-sorting-lean ∎ Lean project (lean/lakefile.lean, lean/lean-toolchain) builds, no sorry at b6028c3, checked 2026-11-03 build details
comments
43 pages, 4 figures, 1 table. Lean 4 formalization and verification code: https://github.com/rtyu-1/coded-sorting-lean
fields
Information Theory
pdf ↗ page arXiv:2610.20079 ↗

We establish a joint stable limit theorem for integrated discretization errors of finite-dimensional càdlàg semimartingales whose predictable characteristics are absolutely continuous in time and satisfy a pathwise integrability condition. The normalized integrated error, evaluated on the discretization grid, converges stably jointly with the discretized semimartingale in the vector-valued Skorokhod $J_1$-topology. No martingale representation property is assumed. We apply this theorem to the Euler–Maruyama scheme for stochastic differential equations with additive semimartingale noise. For a $C^1$ drift with locally Lipschitz derivative and a nonexplosive solution, the grid-point error normalized by n converges stably jointly with the discretized driver. The limiting error solves a linear integral equation with an explicit inhomogeneous term involving the driver, an auxiliary Brownian motion, and independent uniform marks attached to the jumps. We also obtain the same limit under two alternative sets of assumptions allowing less regular drifts, based on small-jump integrability or smoothing estimates for Lévy semigroups. For continuous drivers, the continuous-time error converges stably in the uniform topology.

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

The construction of a coherent and general integration procedure is the central question of this second part of our study of measure theory in convergence spaces. We define, and establish convergence theorems for such process of integration, called the net Riemann integration, in convergence groups and commutative monoids, preserving the prescribed convergence throughout. The underlying interchange theorem admits noncommutative groups and requires right completeness only at the cardinality of the error family. Under intrinsic stability assumptions, countable error control therefore needs only sequential completeness, even for arbitrary integration nets, from which we also stablish a general version of Henstock's lemma. The resulting uniform theorems reaches incomplete ranges in which no complete subspace contains a tail of the approximating integrals. In the ordered locally solid convergence theory side, countability of the inner direction replaces countable accessibility of the approximants, and local existence arguments yield monotone and dominated convergence and, under additional controller assumptions, a further extension through increasing integrable barriers with pointwise coverage and uniformly vanishing excess primitives. This constructs the limiting integral without a common integrable envelope and gives uniform control of primitive variation. We finish with two appendices on new and general results of abstract metrization of net convergences and related topics.

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

Mansour, Rastegar and Roitershtein studied the \emph{roots} of ballistic deposition on a cyclic strip of $K$ sites, namely the sites that receive a particle at height one, and the number $D_{i,K}$ of pairs of consecutive roots at distance $i+1$. They computed the first two moments of $D_{i,K}$ for $i\le7$. They conjectured that for every $i$ the mean and the variance are exactly linear in $K$, that $D_{i,K}$ satisfies a central limit theorem, and that the standardized vector $(D_{i,K})_{i\ge1}$ converges to a Gaussian process. We prove these conjectures. The key observation is that the roots are exactly the valleys of a uniformly random circular arrangement, so that $D_{i,K}$ counts occurrences of a family of consecutive patterns. We determine sizes from which the moments are exactly linear; the size for the mean is sharp for every $i$, and those for the second moments cannot be lowered in any case we checked. We give closed forms for the variance constants and for the limiting covariance; the mean constants agree with a known distribution of distances between surface peaks. The reduction and the exact moment formulas are formalized in Lean~4 with Mathlib. We also prove a Wasserstein bound of order $(\mathbb{E} D_{i,K})^{-1/2}$ that is uniform in $i$, and a local limit theorem. Finally we describe the limit completely when $i$ grows with $K$: it is degenerate, Poisson or Gaussian according as $\mathbb{E} D_{i,K}$ tends to zero, to a positive constant, or to infinity.

comments
16 pages, 2 figures
fields
Probability
pdf ↗ page arXiv:2610.21094 ↗

In this paper we investigate three types of entropy that frequently appear in the research of Kähler geometry: the classical Kähler entropy, the radial entropy and the non-Archimedean entropy. We give a unifying interpretation for these entropies by showing that they can all be expressed as the derivative of the Monge–Ampère energy along certain Aubin–Yau type deformations. Such considerations also lead to a novel algebraic criterion for the existence of constant scalar curvature Kähler metrics.

comments
comments are welcome. v2: exposition slightly improved
fields
Differential Geometry, Algebraic Geometry, Complex Variables
pdf ↗ page arXiv:2610.21198 ↗

The elliptic regularity theory with $W^{1,n}$ coefficients dates back to Miranda, who established $W^{2,2}$ estimates for elliptic equations in divergence and non-divergence forms. For any such fixed operator, the $L^p$ estimates for all $1<p<\infty$ follow from the theory of VMO coefficients developed since the 1990s. However, the VMO theory does not yield constants in the estimates uniformly controlled by the $W^{1,n}$ norm of the coefficients, since the total $W^{1,n}$ norm does not control the VMO modulus. In this work, we establish uniform estimates for divergence-form elliptic systems with coefficients in the critical Sobolev–Lorentz spaces $W^{1,(n,s)}$ with $1\le s<\infty$, allowing an unbounded spatially skew-symmetric part. The constants in the estimates depend quantitatively on the critical Sobolev norms, and we show that they are sharp for scalar equations when $p>n$ and for systems when $p\neq 2$.

comments
Sharpness of the estimate and Hajłasz-space version included; exposition refined
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.22366 ↗

Oscillatory integrals appear throughout physics, from diffraction and gravitational lensing to real-time path integrals. Their asymptotic evaluation is complicated by the need to determine which real and complex saddle points contribute, and how they are connected by Stokes phenomena. In multiple dimensions, this traditionally requires computing the steepest descent manifolds in a high-dimensional complex space. Here, we develop an algebraic alternative for integrals with polynomial and rational exponents. Using integration by parts and Brieskorn reduction, we construct a finite-dimensional Gauss-Manin system that generates the asymptotic expansions of all saddle points. Its Borel transform yields a Fuchsian system, whose monodromy determines the Stokes constants and hence the adjacency of the saddles. Combined with the recent South-East rule, this identifies the contributing saddles and enables superasymptotic and hyperasymptotic approximations without computing gradient flows. We demonstrate the method for the parabolic umbilic diffraction integral and a Lorentzian lens as examples, obtaining agreement to machine precision. The methods are implemented in an accompanying open-source Julia package \href{https://github.com/jfeldbrugge/IntegralResurgence.jl}{\texttt{IntegralResurgence.jl}}.

fields
Mathematical Physics
pdf ↗ page arXiv:2610.22767 ↗

We consider the germ at the origin of Lauricella's function $F_C^{(3)}(a,b;c_0,c_1,c_2;κ,ωκ,ω^2κ)$, where $ω=\exp(2π\sqrt{-1}/3)$. We assume that $a,b,c_0,c_1,c_2$ avoid nonpositive integers and that $c_0,c_1,c_2$ also avoid half-integers. We consider finite linear combinations of ordinary generalized hypergeometric series with arguments $ακ^3$, where $α$ is a nonzero complex constant that may vary between summands, each multiplied by a nonnegative integer power of $κ$. Every target series has lower parameters outside the nonpositive integers and converges near the origin or terminates. We prove that such a representation exists if and only if, for each $j=0,1,2$, either $c_j-c_0$ or $c_j+c_0$ is an integer, and construct finite sums of ordinary ${}_9F_8$ functions when this condition holds. We prove necessity from irreducible differential equations of order $24$ for the generating functions of the three coefficient subsequences and from their formal solutions at infinity.

comments
19 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.22933 ↗

Split learning (SL) trains a neural network across devices by exchanging intermediate activations and gradients. In over-the-air SL, the wireless channel serves as an inter-layer linear map, and when the forward and backward channels match, reciprocity and conjugation supply the backward product without channel estimation at the base station (BS). Passive user motion, which the learning link does not control, breaks this match. Movable antennas let the antenna move relative to the user device, and we use this freedom to compensate the displacement. For a stationary BS and a propagation environment quasi-static within each exchange, returning the antenna to its forward-transmission position restores the channel and yields a conditionally unbiased gradient estimate. We also derive when discrete positioning or mechanical movement can achieve this in time. A residual displacement below a quarter wavelength keeps the real part of the channel correlation positive for any angular spectrum. At zero effective offset, independent Gaussian jitter attenuates this correlation without reversing its sign, whereas a persistent offset can reverse it, and in arrays the tolerance depends on the receive-combining direction. These effects enter a nonconvex convergence bound, and a local analysis shows that partial mechanical compensation saves cycle time to first order at only a second-order loss in correlation. In CIFAR-10 experiments, a user terminal without channel state information stays at chance level under uncompensated walking motion, while discrete positioning stays within about 0.3 percentage points of exact restoration, including at a speed beyond the modeled actuator's limit.

comments
v2: revised/extended; new title (v1: "Keep Pace to Learn: Movable Antennas Restore the Backpropagated Gradient Under User Mobility"); added coauthor Zhaoyang Zhang. Same research question/system model; expanded analysis/experiments. Extended manuscript submitted to IEEE JSAC; Appendices C-K omitted from journal submission for space. 22 pages, 15 figures, 10 tables
fields
Information Theory
pdf ↗ page arXiv:2610.23118 ↗

Let $\mathcal{N}$ be a non-empty class of nilpotent groups closed under taking subgroups, quotient groups, finite direct products, and unrestricted direct powers of the form $\prod_{x \in X}Y_{x}$, where $X \in \mathcal{N}$ and $Y_{x}$ ($x \in X$) are isomorphic copies of a group $Y \in \mathcal{N}$. Suppose also that $T$ is a tree product of $n$ groups ($2 \leqslant n < \infty$) with non-trivial torsion-free locally cyclic edge subgroups, $\mathcal{N}^{\mathfrak{tf}}$ is the class of all torsion-free $\mathcal{N}$-groups, and the symbol $\mathit{Poly}_{k}\mathcal{N}^{\mathfrak{tf}}$ ($k \geqslant 1$) denotes the class of polynilpotent groups such that $X \in \mathit{Poly}_{k}\mathcal{N}^{\mathfrak{tf}}$ if and only if $X$ has a subnormal series of length at most $k$ whose factors belong to $\mathcal{N}^{\mathfrak{tf}}$. We prove that if all free and all vertex groups are residually $\mathcal{N}^{\mathfrak{tf}}$-groups, then $T$ is residually a $(\mathit{Poly}_{n+1}\mathcal{N}^{\mathfrak{tf}})$-group. We prove also that if all vertex groups lie in $\mathcal{N}$, then $T$ has a homomorphism onto a $(\mathit{Poly}_{n-1}\mathcal{N}^{\mathfrak{tf}})$-group acting injectively on all edge subgroups. By assuming that $\mathcal{N}$ is the class of all nilpotent groups, we get a stronger result: if all vertex groups are residually $\mathcal{N}^{\mathfrak{tf}}$-groups, then $T$ is residually a $(\mathit{Poly}_{n}\mathcal{N}^{\mathfrak{tf}})$-group. It follows that all cyclically-pinched one-relator groups are residually finitely generated $(\mathit{Poly}_{2}\mathcal{N}^{\mathfrak{tf}})$-groups.

comments
Corollary was strengthened; some comments were added below its statement. In English and Russian
fields
Group Theory
pdf ↗ page arXiv:2610.23126 ↗

Most convergence guarantees for iterative stochastic algorithms are stated at a fixed iteration count and do not justify stopping at a data-dependent time. Recent anytime-valid envelopes do, but deterministic ones are typically too conservative for practical stopping, and existing data-adaptive ones are derived case-by-case, each concerned with a specific algorithm and a specific noise model and boundary construction. This paper provides a general recipe for sharp, data-adaptive anytime-valid envelopes for a large class of iterative algorithms. Our approach has two key steps: an optimization module derives a one-step recursion that performance measures of many such algorithms satisfy, reducing the error analysis to time-uniform concentration for predictably weighted sums of noise. Then, a statistical module ports the sub-$ψ$ condition to vector-valued processes, uniformly over predictable weights, and derives off-the-shelf boundaries via mixtures, stitching, and product betting martingales. Combining the two yields readymade envelopes for many iterative algoithms including but not limited to stochastic gradient descent (SGD), Oja's algorithm, temporal difference learning, Q-learning, and Bures-Wasserstein SGD, many with no prior data-adaptive anytime-valid guarantees. Specifically, for SGD, our framework recovers, often under weaker conditions, or significantly sharpens every existing envelope we are aware of. Our constructions come with explicit implementation details and are substantiated by numerical experiments.

comments
90 pages, 4 figures
fields
Optimization and Control
pdf ↗ page arXiv:2610.23570 ↗

Weighted dual skeletons are the combinatorial core of spectral duality structures. Their isomorphism classes, under Cartesian product and disjoint union, form a semiring graded by the degree. We identify it completely: a class is determined by its degree, a symmetric element of the group semiring N_0[R] and its number of fixed points. Equivalently, skeletons of a given degree are finite C_2-sets over the C_2-monoid (R,+), these data are their marks, and the semiring is an infinite-monoid analogue of a crossed Burnside semiring. The multiplicative monoid is not cancellative, the only obstruction being that multiplication by a skeleton without fixed points forgets the fixed points; accordingly, the Grothendieck ring has explicit zero divisors. A continuous family of semiring characters, with the degree and the number of fixed points, is a complete invariant, and for commensurable ratios the multiplicative Grothendieck group is described by Pólya's theorem. The main subject is factorization. The reduced monoid is atomic with bounded lengths, but factorization is not unique, the elasticity is infinite, and even the divisor-closed submonoid with one fixed point is not half-factorial. Without fixed points, every reducible skeleton splits off a single orbit, which gives a criterion by centers, exactly when the number of orbits is 8, 16, a prime or twice a prime. Irreducibility is generic in almost every type. Progression skeletons factor according to mixed-radix number systems, with all factorizations of equal length. Finally, orbit counting gives the dimension of the separatrix and the response rank of products.

comments
21 pages, 1 table
fields
Rings and Algebras, Commutative Algebra, Combinatorics, Probability
pdf ↗ page arXiv:2610.23684 ↗

For each fixed integer $k\ge2$, we prove that integrating one coordinate of the truncated correlation of order $k$ for zeros of the planar Gaussian entire function (GEF) gives $-(k-1)$ times the truncated correlation of order $k-1$. The integral converges absolutely, and the identity holds pointwise, including at coincident fixed coordinates by continuous extension. This answers the marginal-identity part of Krishnapur and Yogeshwaran's question for the planar GEF. We also prove a general criterion for simple point processes: under local moment and absolute integrability assumptions, the identities hold almost everywhere if there are compactly supported cutoffs between zero and one, eventually equal to one on each compact set, whose linear statistics have variances tending to zero. For GEF zeros, strong clustering and variance bounds for smooth linear statistics verify these assumptions. The proof combines a mixed-cumulant estimate with the partition formula for ordinary and factorial cumulants.

comments
12 pages
fields
Probability, Complex Variables
pdf ↗ page arXiv:2610.23697 ↗

We show that for any algebra $R$ that is essentially of finite type over a field $k$, the derived functors of Smith–Van den Bergh admit a dg enhancement. In particular, for any $R$-module $M$ one can associate a dg algebra of differential operators $\mathcal E_M$ whose cohomology is a nilpotent thickening of the (classical) ring of $k$-linear differential operators on $M$. We show that this dg algebra fits into a framework of Koszul duality due to Dwyer–Greenlees and specializes to a derived ring of differential operators studied by Yang when $M=R$ and $k=\mathbb{C}$. In particular, upon fixing a presentation $R=S/I$ with $S$ essentially smooth, we show a derived Kashiwara's equivalence, namely that whenever $\mathrm{supp}_S(M)=\mathrm{V}(I)$ then there is an equivalence of triangulated categories between the derived category of dg $\mathcal E_M$-modules and the derived category of \mbox{$D$-modules} on $S$ that are set-theoretically supported on $I$. Finally, in the case of positive characteristic, we show that the dg algebra $\mathcal E_M$ admits a description in terms of the Frobenius endomorphism akin to the classical description of differential operators, and the proof employs simplicial techniques to obtain a result of independent interest in commutative algebra.

comments
v2: Fixed cleveref bug
fields
Commutative Algebra, Algebraic Geometry
pdf ↗ page arXiv:2610.23778 ↗

Subspace-valued data arise in dimension reduction, image-set and video recognition, and signal processing, and the Fréchet mean is their standard sample mean [12,10,16,24]. We establish a central limit theorem for the intrinsic sample Fréchet mean of i.i.d. observations on the real Grassmann manifold $\mathrm{Gr}(p,n)$, as a specialization of the general theorem of [19]. Unlike prior results which require the distribution to vanish or place negligible mass near the cut locus of the population mean, we allow a continuous, possibly positive density. To enable our results, we derive two properties of $\mathrm{Gr}(p,n)$: the first is that the union of the cut loci of all points within distance $δ$ of the mean has volume $O(δ)$. The second is that the Hessian of the squared distance function is integrable. We also give a smooth density on $\mathrm{Gr}(1,2)$ for which the mean is unique but the Fréchet Hessian vanishes.

comments
12 pages
fields
Probability, Statistics Theory
pdf ↗ page arXiv:2610.24159 ↗

Mather and Yau proved that the analytic isomorphism class of an isolated complex hypersurface singularity is determined by its dimension and its moduli algebra. Yau's conjecture asserts that the moduli algebra of an isolated weighted homogeneous hypersurface singularity over $\C$ has no nonzero derivation of negative degree. We prove this conjecture.

comments
15 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.25177 ↗

We study the mixing time of the single-site Glauber dynamics for sampling proper $q$-colorings on sparse Erdős-Rényi random graphs $\mathcal{G}(n, d/n)$. We prove that, whenever $q \ge (1 + o_d(1))d$, Glauber dynamics mixes in polynomial time with high probability over $\mathcal{G}(n, d/n)$ for all sufficiently large integers $n$. This improves the previous bound $q = (α^* + o_d(1))d$ where $α^* = 1.7632...$ is the unique solution of $x = \exp(1/x)$ on $[1, \infty)$ by Efthymiou, Hayes, Štefankovič, and Vigoda (SODA, 2018) and asymptotically matches the uniqueness threshold on infinite regular trees. Our proof has three main ingredients. First we establish logarithmic bounds on the spectral and coupling independence constants of the Gibbs distribution by extending the tree analysis of Chen, Liu, Mani, and Moitra (J. ACM, 2026). Second, we extend the entropy-factorization framework for two-spin systems on random graphs, developed by Bezáková, Galanis, Goldberg, and Štefankovič (TALG, 2024), to proper colorings by introducing a buffer around high-degree vertices. Finally, we compare the resulting heat-bath block dynamics with the single-site Glauber dynamics.

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

In this paper, we study the three-dimensional incompressible stationary Navier–Stokes equations with the Coriolis force in the half space with the inhomogeneous Dirichlet boundary condition. We show the existence of a unique small solution in the scale-critical Besov spaces. In particular, for any boundary data with a vanishing normal component, and for any external forces, we establish the well-posedness of the inhomogeneous Dirichlet boundary value problem when the speed of rotation is sufficiently large. In the proof, to exploit the stabilizing effect of the Coriolis term, we employ two explicit formulas depending on the relation between the horizontal frequency and the magnitude of the rotation speed.

comments
53 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.25694 ↗

Let $M$ be the free metabelian Lie algebra of rank $4$ over the field of complex numbers $\mathbb{C}$. We construct a non-linearizable action of the symmetric group $S_3$, the smallest nonabelian group, on $M$ by automorphisms. We also construct a non-linearizable action of $S_3$ on free metabelian associative algebras of rank $4$.

comments
15 pages
fields
Rings and Algebras, Group Theory
pdf ↗ page arXiv:2610.26060 ↗

We investigate the asymptotic behavior of the inverse of Vandermonde matrices with nodes drawn from the quadratic sequences $u\_n = n^2$ and $u\_n = (n -1/2 )^2$. We derive new limiting formulas for the entries of the inverses, expressed through the even and odd central factorial numbers. These formulas are then used to study the asymptotic behavior of a ratio of determinants involving a modified Vandermonde matrix. For each node sequence, the corresponding determinant ratio converges uniformly on compact subsets of the complex plane to an explicit expression involving the Dirichlet eta or beta function. We then study a family of related functions and, using an inversion theorem, exhibit their shift structure: the shifted values of the eta and beta functions are recovered as finite linear combinations of the family, which yields an integral form of these values as integrals of polynomials related to the Bernoulli and Euler polynomials against generalized (half-)Clausen functions. A unified form of the shift representation, valid for an arbitrary base point z with Re(z) > 0, brings the eta and beta families under a single theorem. On the critical line the representation is unitary and the values on the two sides are complex conjugates.

fields
Number Theory
pdf ↗ page arXiv:2610.26408 ↗

We give a detailed, direct proof of a dimension-free weak-type $(1,1)$ estimate for the first-order Gaussian vector Riesz transform, using the fractional obstacle method of Ouyang, Spector, and Stockdale. For $dγ_n=π^{-n/2}e^{-|x|^2}\,dx$, let $L=-\tfrac12Δ+x\cdot\nabla$, $D=2^{-1/2}\nabla$, and $R_γ=DL^{-1/2}Π_0$, where $Π_0$ removes the mean. We prove that $R_γ$ has weak-type constant at most $2$ on real-valued inputs, independently of $n$. The main construction is the unique unshifted decomposition $F=g+L^{1/2}u$, for nonnegative $F\in L^2(γ_n)$ and $a>\int F\,dγ_n$, with $u\geq0$, $\min\{F,a\}\leq g\leq a$, preservation of mass, and $g=a$ on $\{u>0\}$. We retain the details of coercivity, the Lewy–Stampacchia estimate, the upgrade from the form domain to the operator domain, and locality. We also identify the $L^1$ extension with the principal-value transform and obtain the constant $8/π$ for complex-valued inputs.

code
github.com/na0b/gaussianriesz-lean ∎ Lean project (lakefile.lean, lean-toolchain) builds, no sorry at dc16c5d, checked 2026-11-03 build details
comments
33 pages. A Lean 4 formalization of the results of this paper is available at https://github.com/na0b/gaussianriesz-lean and at https://palomar-registry.org/entry?id=PALOMAR-2026-10-30-000009&version=1
fields
Analysis of PDEs, Functional Analysis, Probability
pdf ↗ page arXiv:2610.26478 ↗

Golden states, from which every state can be prepared by free operations, are the units of a resource theory. In the resource theory of superposition relative to linearly independent, nonorthogonal reference states, they were known only for two reference states and for special overlap matrices, all of them maximally coherent in the Löwdin basis. We determine what decides their existence and when this Löwdin pattern holds. For every overlap matrix, the robustness and the geometric measure of superposition are maximized by the same states, which overlap equally with all reference states; the maximal values are set by the ground-state energy of a classical $XY$ model on the dual basis. These states, and only these, are golden under the maximal superposition-free operations, but they need not be maximally coherent in the Löwdin basis. For the Kraus-type free operations, we prove Gram majorization, a necessary and sufficient criterion for converting pure states into targets with nonzero coefficients, which reduces to majorization for orthonormal reference states. It shows that every golden state of these operations is maximally coherent in the Löwdin basis, yet golden states exist only for special overlap matrices: three reference states that are not orthonormal admit one if and only if their overlaps have a common modulus $s$ and their Bargmann phase $Φ$ obeys $s\geq2\cos[(π+|Φ|)/3]$, so that a geometric phase decides whether the theory has a unit. Finally, equal-overlap states yield a complete family of superposition witnesses in the Löwdin basis, which show that white noise is a resource unless the reference states are orthonormal.

comments
30 pages, 4 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.26483 ↗

We develop quantum algorithms for optimal control over a prescribed finite time interval (finite horizon), focusing on continuous-time linear-quadratic regulation (LQR). This foundational control problem often requires solving a nonlinear matrix Riccati equation, which can be costly for large systems and long control durations on conventional classical solvers. We instead work directly with the state-costate optimality equations, reformulating the LQR problem as a multiple-shooting linear system. Importantly, we prove a condition-number bound for the system that is independent of the horizon, under stabilizability and detectability assumptions. By incorporating the initial and final conditions into a single linear system, we can solve the subsequent linear system more efficiently with a quantum linear systems subroutine. For a given initial state, our quantum algorithms return classical estimates of the optimal cost and the optimal control inputs at a selected time, without constructing a Riccati solution operator. Given sparse-matrix block-encodings, an initial-state preparation oracle and a fixed number of control inputs, the query and gate complexities scale polylogarithmically with system size and control duration, provided that sparsity, relevant norms, and stability parameters are bounded. The dependence on the target error is inverse-linear up to logarithmic factors. We establish the required bounds uniformly in system size and duration for a family of damped mass-spring chains with two endpoint controls. Numerical experiments support the analysis.

fields
Optimization and Control
pdf ↗ page arXiv:2610.26843 ↗

We classify all real linear into preservers of semipositivity on $M_{m,n}(\mathbb{R})$, $m,n\ge2$, relative to arbitrary source and target pairs of proper cones, without assuming invertibility or a prescribed form. The classification consists of product maps $L(A)=XAY$ and rank-$n$ degenerate maps $L(A)=Ψ(u^TA)$, subject to explicit cone and matrix-pencil conditions. For square minimal semipositivity with respect to the standard nonnegative orthant, preservation forces the operator to be invertible: for $n\ge2$, the linear into preservers are precisely the maps $L(A)=XAY$ and $L(A)=XA^TY$ with $X,Y\in\mathrm{GL}_n(\mathbb{R})$ satisfying $X^{-1},Y^{-1}\ge0$. We also classify all linear preservers of orthant semipositivity from $M_{2,2}(\mathbb{R})$ to $M_{1,3}(\mathbb{R})$ into three disjoint classes, two of which consist of maps of rank three outside product form.

comments
13 pages; Proofs simplified
fields
Functional Analysis
pdf ↗ page arXiv:2610.27413 ↗

For every round sphere $S^n$, $n\ge2$, we exhibit two explicit smooth vector fields whose flows generate a $C^\infty$-dense subgroup of $Diff_0(S^n)$. By deleting one gradient component from the second generator, we obtain two explicit divergence-free vector fields whose flows generate a $C^\infty$-dense subgroup of $SDiff_0(S^n)$. In both cases two generators are minimal. The proof first generates the divergence-free vector fields using rotations, a linearly modulated rotational shear, and transverse vector spherical harmonics. On $S^2$ this reduces to the Hamiltonian/Poisson formalism; for $n\ge4$ irreducibility of the transverse harmonic spaces completes the degree-raising argument, while $S^3$ requires a separate treatment of its two curl eigenspaces. Adding one gradient field and using the divergence map then generates all smooth vector fields. Finally, a Casimir operator for a recovered copy of $\mathfrak{so}(3)$ separates the components of the generating fields and compresses the natural finite generating families to two.

fields
Differential Geometry
pdf ↗ page arXiv:2610.27507 ↗

Kernel Galerkin methods allow meshfree trial spaces to be generated independently in each material subdomain and refined through their center sets, without generating an approximation mesh. We establish trace inverse estimates for products of Sobolev-kernel spaces on Lipschitz subdomains and use them to analyze symmetric Nitsche discretizations of linear elliptic interface problems. The estimates control gradient traces on subdomain boundaries by subdomain gradients, the interface jump, and an exterior boundary trace. Their conormal form supplies the flux control required for stability directly from the kernel and center assumptions, without a separate discrete flux hypothesis. For quasi-uniform center families with comparable fill distances and a fixed kernel scale, we obtain well-posedness for sufficiently large penalty parameters independent of refinement. We prove energy and $L^2$ error bounds of orders $h^{s-1}$ and $h^s$ for piecewise $H^s$ solutions, $2\le s\le m$, where $h$ is the maximum subdomain fill distance and $m$ is the kernel Sobolev order. The $L^2$ bound additionally requires piecewise $H^2$ regularity of the homogeneous adjoint interface problem. For kernels $Φ_m(\varepsilon\,\cdot)$ with $0<\varepsilon\le1$, we derive a scale-explicit condition-number bound in the kernel-translate basis and an $O(h^{-2})$ bound in an $L^2$-orthonormal basis. The analysis assumes exact geometry and integration. Planar experiments examine convergence and kernel scaling, while a three-dimensional heat-conduction problem in a curved composite illustrates the method.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.27537 ↗

Let $p$ be a prime and let $Y/X$ be a finite abelian branched cover of finite connected graphs. We consider a compatible branched $\mathbb Z_p$-tower above $Y$ whose total Galois group over $X$ is abelian. We construct an equivariant Picard Iwasawa module over the completed group ring of the total Galois group and give an explicit presentation of this module. On the analytic side, we construct an equivariant Artin–Ihara $L$-element at the top of the tower and isolate a modified factor whose value at $u=1$ is well defined. Our main result computes the Fitting ideal of the equivariant Picard Iwasawa module in terms of these special values and augmentation ideals determined by the inertia groups. As applications, we recover the main conjecture for branched $\mathbb Z_p$-towers from our earlier work and obtain finite-level Fitting-ideal and annihilation formulas which can be viewed as graph-theoretic analogues of the conjectures of Kurihara and Brumer–Stark.

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

We prove a sharp linear upper bound for the interior nodal length of Steklov eigenfunctions on smooth compact Riemannian surfaces with boundary, establishing the upper bound predicted by the Steklov analogue of Yau's conjecture in dimension two. On each fixed surface, we also show that the nodal length divided by the logarithm of the eigenvalue tends to infinity, uniformly over the eigenfunctions. We construct examples to show this divergence can be arbitrarily slow. These examples rule out every general lower bound by a positive power of the eigenvalue, in contrast with the linear lower bound on analytic surfaces by Polterovich-Sher-Toth. Moreover, boundary zero counts and both interior and boundary nodal domain counts satisfy sharp linear bounds for large eigenvalues. We also prove density estimates for boundary zeros on at least one boundary component and construct a fixed analytic cylinder on which another component remains free of boundary zeros along an unbounded sequence of eigenvalues.

fields
Analysis of PDEs, Classical Analysis and ODEs, Differential Geometry, Spectral Theory
pdf ↗ page arXiv:2610.28391 ↗

We establish a near-optimal almost sure invariance principle for nonstationary time series under the functional dependence measure (FDM) framework. This result yields a universal time-uniform dependent central limit theorem, which serves as the basis for anytime-valid inference. In particular, we instantiate the theorem through asymptotic confidence sequences (AsympCSs), time-uniform counterparts of asymptotic confidence intervals obtained via central limit theorems, extending those originally proposed in Waudby-Smith et al. (2024) to time series with serial dependence. We further refine the original definition because, as we show, it can admit AsympCSs that fail to achieve asymptotic time-uniform coverage even for independent and identically distributed settings. We address this issue by adding a simple eventual-inclusion condition, which in turn permits more flexible variance estimation. In time-series settings, this relaxation can substantially ease restrictions on bandwidth and kernel selection. For feasible implementation of AsympCSs, we establish strong consistency of HAC variance estimators under the FDM framework, accommodating a wider range of commonly used bandwidth choices than existing results under mixing conditions. As illustrations, we construct AsympCSs for algorithms with Markovian structure and time-series-based causal estimands.

fields
Statistics Theory
pdf ↗ page arXiv:2610.29288 ↗

Let $\mathrm{GL}_n(\mathbb{F}_q)$ be the group of $n\times n$ invertible matrices over a finite field $\mathbb{F}_q$. How many matrices in $\mathrm{GL}_n(\mathbb{F}_q)$ are there with a subset of their entries prescribed? Motivated by the random matrix theory of classical compact groups, we address this question and various variants, with a focus on asymptotic results that are valid as $n$ tends to infinity. Our methods are Fourier-analytic, with the main input being an exponential sum over $\mathrm{GL}_n(\mathbb{F}_q)$, evaluated in 1955 by Hodges via elementary methods. Our results turn out to be related to investigations carried out in other fields, including coding theory, universality for $p$-adic matrices and algebraic combinatorics.

comments
23 pages. Proposition 1.10 from v1 removed, will appear elsewhere
fields
Number Theory, Probability
pdf ↗ page arXiv:2610.29305 ↗

A single classical f-divergence has several inequivalent quantum versions, but what distinguishes them operationally is less clear. Matsumoto's reverse tests characterize the maximal quantum f-divergence as the least classical distinguishability needed to prepare two quantum states with one device. Here we introduce retrodictive tests, in which two reverse tests sharing a reference state are coupled via Bayesian retrodiction to define a forward and a reverse stochastic process. In the forward process, the system is prepared by the first device and measured by the Petz transpose of the second; the reverse process interchanges their roles. We seek the least classical distinguishability between these two processes, as measured by the f-divergence between their joint laws, for fixed prescribed states and reference. For full-rank states in finite dimension, we prove that the canonical spectral implementations attain this minimum simultaneously for every operator-convex f. The reference then determines which quantum f-divergence is obtained: a flat reference gives the standard divergences, with the Nussbaum–Szkoła distributions as optimal joint laws; either prescribed state as reference recovers Matsumoto's reverse tests and the maximal divergences; and power references give the geodesic family. In particular, the Umegaki and Belavkin–Staszewski relative entropies arise from the same classical variational principle under different choices of reference. Spectral optimality extends to processes containing a quantum channel; for channels with full-rank Choi operator, the minimum of the forward relative entropy agrees with a known average entropy production.

comments
v3: 17 pages, improved presentation and figures, submitted version; v2: 20 pages, 2 figures, improved presentation; v1: 18 pages, 2 figures, preliminary version, comments welcome; 100th arXiv post
fields
Information Theory, Mathematical Physics
pdf ↗ page arXiv:2610.29696 ↗

We prove multiplicity results for geometrically distinct brake Reeb orbits on real prequantization $S^1$-bundles under geometric and dynamical assumptions. The lower bounds are expressed in terms of the sum of the mod-two Betti numbers of the real locus of the base. Our proofs combine Lagrangian Rabinowitz Floer homology with the index iteration theory for brake orbits. As an application, we obtain a sharp lower bound for the number of brake geodesics on Finsler spheres with pinched flag curvature.

comments
35 pages; exposition revised and references updated
fields
Symplectic Geometry, Dynamical Systems
pdf ↗ page arXiv:2610.29917 ↗

We introduce a new class of unitary set-theoretic Yang–Baxter solutions, called \emph{bipartite} solutions. This class, which is purely combinatorial in nature, forms a full subcategory of $\mathcal{LYB}$, the category of Lyubashenko type solutions of Agore, Chirvasitu and the author, and is particularly amenable to explicit classification results. We give an intrinsic necessary and sufficient condition for a solution of the Yang–Baxter equation to be isomorphic to a bipartite solution, we settle the isomorphism problem within this class and, as an application, we determine their automorphism groups. If $X$ is a finite set with $|X| = n$, the number of isomorphism classes of bipartite solutions on $X$ is $\lfloor n/2 \rfloor + 1 + \sum_{m=2}^{n} \bigl( o(m, n-m) - 1 \bigr)$, where $o(m, k)$ denotes the number of orbits of the symmetric group $S_m$ acting by conjugation on the $k$-element multisets of elements of $S_m$. The paper also offers a comparative study: for small $|X| = n$ we count, up to isomorphism, all set-theoretic Yang–Baxter solutions on $X$, together with five distinguished families of solutions. Throughout the range we were able to compute, the class $\mathcal{LYB}$ accounts for a large share of all bijective and of all non-degenerate solutions, strikingly close to the total.

comments
v2: a reference to the companion paper arXiv:2610.39228 added; 27 pages, 6 tables
fields
Quantum Algebra, Combinatorics, Rings and Algebras
pdf ↗ page arXiv:2610.30845 ↗

For $p\geq2$ and $r\geq 1$, we prove the sharp strong $r$-variation estimate for solutions to the free Schrödinger equation $$ \bigl\|V^r_{[0,1]}\{e^{itΔ}f\}\bigr\|_{L^p(\mathbb R^2)} \lesssim \|f\|_{H^s(\mathbb R^2)}. $$ The estimate holds if $s> s(p,r)$ and fails if $s< s(p,r)$, where $$s(p,r)=\max\left\{ \frac{2}{r}+\frac{1}{p}-\frac12,\, \frac{2}{r}-\frac{2}{p},\, \frac{1}{p}+\frac{1}{r},\, \frac{2}{p}-\frac13,\, 1-\frac{2}{p} \right\}.$$ In particular, $s(3,\infty)=1/3$. Thus our result yields a sharp variational extension of the two-dimensional Schrödinger maximal estimate of Du, Guth, and Li [{Ann. Math.}, 186, 607–640 (2017)]. The proof employs fractal restriction estimates to eliminate the regularity loss originating from the summation in the variation norm.

comments
35 pages, Corrected minor typographical errors; the results are unchanged
fields
Classical Analysis and ODEs, Analysis of PDEs
pdf ↗ page arXiv:2610.31099 ↗

Let \(K\) be a non-Archimedean local field of characteristic different from \(2\), and let \(V\) have dimension four over \(K\). The Drinfeld upper half-spaces of \(V\) and \(Λ^2V\) define compatible open analytic subsets of \(\Pp(V)\), \(\Gr(2,V)\), and \(\Flag(1,2;V)\). Both restricted incidence projections are smooth and surjective. For every torsion-free discrete subgroup of \(\PGL(V)(K)\), the three actions are free and properly discontinuous, and the incidence correspondence descends to smooth analytic quotients. These domains contain an explicit flag defined over an unramified extension of degree seven. A symplectic form on \(V\) equips the projective domain with a contact structure and places the Grassmannian domain in \(\Sp_4/(\Sp_2\times\Sp_2)\). For torsion-free discrete symplectic groups, this contact structure descends to the quotient. Free discrete symplectic groups of every finite rank at least two give contact threefolds whose underlying Berkovich spaces have the homotopy type of a bouquet of circles. Every quotient of the projective domain by a torsion-free discrete group preserving the contact distribution is noncompact. For every torsion-free discrete projective linear group, the flag quotient and all fibers of its two incidence projections are noncompact; both projections are nonproper.

comments
17 pages. v2: new sections on torus-stable domains and on noncompactness of the quotients; corrections and revised exposition
fields
Algebraic Geometry, Group Theory
pdf ↗ page arXiv:2610.31379 ↗

Let $X$ be a smooth projective Poisson surface over an algebraically closed field of characteristic $p>2$, and let $s\in H^0(X,ω_X^{-1})$ be nonzero. We construct an anticanonical section associated to $s$, called the leafrian, on moduli spaces $M$ of stable objects on $X$, including the moduli of stable sheaves, of principal $G$-bundles, and of instantons. The leafrian splits $M$ if and only if $s^{p-1}$ Frobenius splits the base. It is invariant under the Hamiltonian flows of Bottacin's Poisson structure on $M$, so every compatibly split subvariety of $M$ is a Poisson subvariety. Furthermore, the leafrian extends to an anticanonical section on the Gieseker compactification $\bar M$, and splits $\bar M$ under the same criterion. As a consequence, in characteristic zero, for $X$ a smooth projective Poisson surface with a smooth or empty anticanonical divisor and $ρ>0$ (positive leaf rank), the Gieseker compactification $\bar M$ satisfies Kodaira-type cohomology vanishing, including singular $\bar M$.

fields
Algebraic Geometry, Commutative Algebra, Symplectic Geometry
pdf ↗ page arXiv:2610.31619 ↗

In this short note, we obtain upper bounds on the chromatic numbers of spheres using recent improvements in bounds for Euclidean space. We show that $χ(S^n_{R}) \leq (ξ_R + o(1))^n$, where $ξ_R = \frac{3\sqrt 3}{2}(1-\frac{1}{4R^2}) $ and $χ(S^n_R)$ denotes the chromatic number of the $n$-dimensional sphere of a fixed radius $R$.

fields
Combinatorics
pdf ↗ page arXiv:2610.32408 ↗

The dominant contemporary paradigm of direct state-led urban environmental regulation entails significant risks, including high administrative burden, frequent conflicts with polluting entities, and economic vulnerabilities for those sources. To address these deficiencies, this paper integrates third-party service provider (TPSP) into China's existing management framework as a beneficial extension beyond conventional government intervention. Utilizing an evolutionary game approach, we compare two distinct institutional settings, a non-integration management mode and an integration management mode, and scrutinize the evolutionary dynamics across both two- and three-dimensional systems. To enhance system robustness, we embed a strategic behavior-based dynamic punishment mechanism that effectively eliminates the perturbing effects of varied penalty rules, thereby steering all stakeholders toward an ideal stable state. This comparative institutional analysis isolates the marginal contribution of third-party intermediation, specifies when outsourcing environmental services outperforms direct government enforcement, and reframes evolutionary game theory as a design device for institutional self-correction. Furthermore, a predefined variable importance analysis is conducted to highlight critical factors warranting attention in practical policy implementation. Extensive simulation experiments, carried out under diverse system-level and parameter-level conditions, validate the theoretical properties of our model. The findings offer concrete managerial insights to inform the formulation of more effective urban environmental supervision regulations.

fields
Optimization and Control
pdf ↗ page arXiv:2610.32528 ↗

We give a negative answer to the unrestricted product version of Bergman's finite-comparison theorem, even when all factors have finite length. Finite comparison does hold for quasi-injective common modules under finite cogeneration. We also prove a semidirect-product case of Bergman's Question 3.2. For a semiprimary right self-injective ring, failure of the quasi-Frobenius conclusion produces a cyclic module with simple top and countably infinite homogeneous socle inside a fixed countable injective hull. We identify its extension class and an associated opposite-side extension obstruction. Over the square-zero algebra $k\oplus k^{(\mathbb N)}$, we compute the countable hull quotient as endomorphisms modulo finite-rank maps. This quotient also describes the socle-radical quotient of the regular product, yields a second counterexample with free cyclic family factors, and detects splitting of specified simple submodules. The general Faith conjecture remains unresolved.

fields
Rings and Algebras
pdf ↗ page arXiv:2610.32544 ↗

We study the following prescribed scalar curvature problem $$ -Δu=K(y)u^{2^*-1},\ \ u>0 \,\ \ \text{in}\ \ \mathbb{R}^N, $$ where $2^*=\frac{2N}{N-2}$. For $N\geq4$, we construct a positive $K(y)$ with maximum set $\{|y|=1\}$ and critical order of flatness $m=N-2$ at $|y|=1$, such that the equation admits only finitely many positive solutions in $D^{1,2}(\mathbb{R}^N)$. To this end, we prove the compactness of the solution set for this equation by blow-up analysis and then apply Sard's theorem to choose $K$ for which each solution is non-degenerate and hence isolated, so that the solution set is finite. Our results also give a definite answer to Wei–Yan's conjecture in [J. Wei and S. Yan, JFA, 2010].

comments
20 pages
fields
Analysis of PDEs, Differential Geometry
pdf ↗ page arXiv:2610.32707 ↗

While defect dynamics in condensed matter systems is widely studied and several methods are available to track the defect position over time, the formulation of dynamical models for the coupled evolution of both defects and background field quantities seems to be more challenging. Yet, the overall behavior of a system containing moving defects is strongly influenced by this defect-field interaction. Here, we propose a modeling framework for the conservative coupled evolution of the defect density and the background fields upon focusing on two relevant cases of study: the Gross-Pitaevskii theory of quantum fluids and the Ericksen-Leslie model of nematic liquid crystals. To achieve the coupled evolution, we combine the Euler-Poincaré variational setting of continuum dynamics with the gauge theory of topological defects. While the latter allows us to overcome certain ambiguities in definition of the defect density, the Euler-Poincaré method provides a unified modeling approach in the absence of defect reconnection. Suitable variational regularizations are also proposed to deal with the motion of singular defect lines.

comments
Second version. Largely expanded. Comments welcome
fields
Mathematical Physics
pdf ↗ page arXiv:2610.32973 ↗

We show that $K_6^{(2)} \cap X_6^{(2)} = D_6^{(1)} \cup C_6^{(1)}$ up to standard Hadamard equivalence, where $C_6^{(1)}$ is a non-affine one-parameter family of complex Hadamard matrices. This demonstrates that the intersection of the two-parameter Hadamard families of Karlsson and Szöllősi is strictly larger than the affine Diţă curve $D_6^{(1)}$. Our new parametrisation of the Szöllősi family $X_6^{(2)}$ in Karlsson coordinates and our constructive classification of the Karlsson-Szöllősi intersection shed light on the intersection of block-reducible forms and hypocycloid constraints. This may support the search for mutually unbiased bases in composite dimensions.

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

Conditional generative models parameterized by triangular transport maps are widely used for conditional sampling, yet theoretical guarantees on the quality of the conditional measures they produce remain scarce. We address this question for minimum divergence estimators of triangular maps. We use MMD-based objectives as a tractable setting in which the gap between joint and conditional errors can be analyzed precisely, and we measure performance through the average conditional estimation error, defined as the squared maximum mean discrepancy (MMD) between the estimated and the true conditionals, averaged over the conditioning variable. We first show that the common practice of minimizing a joint MMD may fail to recover the conditionals: writing the joint and the conditional criteria as quadratic energies of the same conditional mean embedding residual, we prove that, for parametric classes, joint minimizers are generically inconsistent in the misspecified setting. We then analyze an estimator that directly minimizes the conditional criterion through a surrogate loss computable from joint target samples and reference samples. We prove a non-asymptotic error bound that decomposes the average conditional estimation error into approximation, estimation, and reference sampling errors, with fast rates independent of the ambient dimension in the parametric setting. Finally, for joint MMDs built from concentrating Gaussian kernels on the conditioning variable, we show that the joint criterion approximates a density-reweighted version of the conditional one, and we derive an error bound for the joint minimizer whose rate suffers from a curse of dimensionality in the conditioning variable. Our results suggest that training criteria for conditional generative models should target the conditional rather than the joint error, a principle that extends to other divergences and to dynamic transport.

comments
69 pages, 1 figure. v2: added discussion of related work on engression error analyses that appeared while this manuscript was in preparation. Minor corrections
fields
Statistics Theory
pdf ↗ page arXiv:2610.33610 ↗

Let $0<σ<2$ and $1\leq p<\infty$. We construct a fixed linear nonlocal elliptic operator $L$ and functions $u_m\in C^\infty(\mathbb R^n)\cap L^\infty(\mathbb R^n)$ such that \[ \|u_m\|_{L^\infty(\mathbb R^n)}+\|Lu_m\|_{L^p(B_2)}\longrightarrow0, \qquad \liminf_{m\to\infty}\|(-Δ)^{σ/2}u_m\|_{L^p(B_1)}>0. \] The kernel is symmetric in the increment variable, uniformly elliptic, and satisfies the standard bounds on its first two derivatives in that variable. Its dependence on $x$ has a uniform modulus of continuity of order $(\log(1/r))^{-1/2}$ as $r\downarrow0$. Moreover, $\|Du_m\|_{L^p(B_4)}\to0$ for $σ>1$, and these norms remain bounded for $σ=1$. Thus the interior $L^p$ estimates for translation-invariant operators do not extend to this class under mere continuity in $x$.

comments
12 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.33689 ↗

We study the self-energy $E_0(α,Λ)$ of the spinless Pauli-Fierz model with a sharp ultraviolet cutoff $Λ$, retaining the vacuum contribution of the $A^2$ term (no normal ordering); $α=e^2/4π$ is the fine structure constant. Lieb and Loss proved lower and upper bounds of orders $α^{1/2}Λ^{3/2}$ and $α^{2/7}Λ^{12/7}$ for large $Λ$ and suggested that the upper bound, which comes from product states, gives the correct order. We prove that, for every fixed $α>0$, $E_0(α,Λ)=(1+o(1))\,c_α\,α^{2/7}Λ^{12/7}$, with an explicit constant $c_α=0.99338\ldots$, as $Λ\to\infty$. The same asymptotics hold uniformly in the joint limit $Λ/α\to\infty$, $α^{5/2}Λ\to\infty$, provided $\log(2+α)=o((Λ/α)^{1/21})$. The infimum of the energy over product states has the same leading asymptotics. The upper bound follows from a coherent state bound for the field energy in a fixed electron density. For the lower bound we combine a periodization of the field, a blockwise Born-Oppenheimer bound, and a lower bound on the magnetic Neumann Laplacian on a cube for band-limited fields. The magnetic estimate follows from a non-concentration bound for the vorticity of band-limited fields satisfying a weighted gradient condition.

comments
38 pages. First paper of a series on the Pauli-Fierz model in the ultraviolet limit. v2: main results unchanged; exposition revised and comparison with Bach-Hach expanded. Ancillary file: interval arithmetic script for the explicit constants
fields
Mathematical Physics, Spectral Theory
pdf ↗ page arXiv:2610.34122 ↗

We study the effective mass of a spinless non-relativistic electron coupled to the quantized transverse electromagnetic field (the Pauli-Fierz model without external potential), with bare mass $m$, fine structure constant $α=e^2/4π$ and a sharp ultraviolet cutoff $Λ$. We define $1/(2m_{\rm eff}):=\limsup_{P\to0}(E(P)-E(0))/|P|^2$ for the fiber ground state energy $E(P)$; this agrees with the curvature mass whenever $E$ is twice differentiable at zero. By scaling, $h=m_{\rm eff}/m$ depends only on $α$ and $λ=Λ/m$. For all $α>0$ and $λ\ge1$ we prove $h\ge1+0.3441\,α/(1+0.2985\sqrtα+0.1252\,α)$, a bound independent of the cutoff; with the band extended to the cutoff, its first order coefficient in $α$ is the perturbative one of Hiroshima and Spohn. At fixed $α>0$ we further prove $h\geλ^{8/7-ε}$ for every $ε>0$ and all sufficiently large $λ$. Hence $ι_{\rm PF}(α):=\inf_{λ>0}h/λ>0$: at fixed coupling, a bare mass reproducing a prescribed physical mass $m_{\rm phys}$ can exist only if $Λ\le m_{\rm phys}/ι_{\rm PF}(α)$. This proves the obstruction to mass renormalization at fixed physical mass anticipated by Lieb and Loss (2002). The first bound uses a coherent translation of the field applied to the ground state as a trial state. The second uses the sharp self-energy asymptotics of a companion paper and a position estimator constructed from the local centre of a shallow level set of the photon cloud.

comments
64 pages. Second paper of a series on the Pauli-Fierz model in the ultraviolet limit; Part II uses results of the companion paper arXiv:2610.34122. v2: gap in the proof of Lemma 8.2 repaired, exponent budget added, other corrections; main results unchanged. Ancillary file: interval arithmetic script for the constants of Part I
fields
Mathematical Physics, Spectral Theory
pdf ↗ page arXiv:2610.34125 ↗

In a series of joint papers with Loring, it was shown how index parings of $K$-theory classes with Fredholm modules can be computed as the half-signature of a suitably constructed finite-dimensional matrix, called the spectral localizer. After offering a novel perspective on earlier results, it is shown how the framework can be extended to unbounded gapped Hamiltonians given as second-order linear differential operators (in particular, matrix-valued Schrödinger and regularized Dirac operators). Important insights are the coercive phase space localization and discretizations by means of wavelets.

comments
several minor corrections and improvements
fields
Mathematical Physics
pdf ↗ page arXiv:2610.34138 ↗

For the estimation of a normal mean in $\mathbb{R}^m$ under quadratic loss, Brown (1971) proved that a generalized Bayes estimator $δ_F$ with bounded drift is admissible if and only if a diffusion attached to the marginal $f^*$ of the prior $F$ is recurrent, and gave two radial tests: a sphere-average test for recurrence and a ray test for transience. He observed that both tests can be silent. We read his theory as the potential theory of the weighted Euclidean space $(\mathbb{R}^m,f^*\,dx)$ and ask what the modern theory of recurrence on weighted manifolds adds inside the zone where neither test applies. Three results. (A) If $f^*\,dx$ is doubling and supports a scale-invariant Poincaré inequality, the sphere test is already complete: recurrence, Brown's sphere test and the ball-volume test are equivalent, so geometric criteria can add decidable cases only on the inadmissible side. (B) They do add one. An explicit prior on $\mathbb{R}^3$ whose marginal is small along a lattice of circles at dyadic scales with spacing equal to the square root of the scale, is doubling and Poincaré, silences both of Brown's tests, and is transient by the ball-volume test; its generalized Bayes estimator is inadmissible. (C) Outside the doubling-Poincaré class the zone is two-sided: the same circles placed on one surface per scale give an admissible estimator, decided by a flux bound along a non-spherical exhaustion, and a logarithmic product prior gives an inadmissible one, decided by product heat kernels. A comparison lemma shows that any positive weight with Lipschitz logarithm is, up to constants, the marginal of a prior, so that explicit weights may be used throughout.

comments
20 pages, 8 figures. v2: proofs of Lemma 4.3 and Theorem 4.1(a) corrected (constants and cell scales); one volume formula in Section 5 restricted to its range of validity; numerical statements aligned with the recorded results
fields
Statistics Theory, Differential Geometry, Probability
pdf ↗ page arXiv:2610.34309 ↗

We study critical holomorphic multiplicative chaos with circular iid inputs of unit variance. Writing \(R=|X_1|\), the radially normalized boundary measures converge in probability to a finite measure with almost surely positive mass exactly when \(\mathbb{E}[R^2\log(2+R)]<\infty\); otherwise they converge to zero. Radial and Fourier–radial approximations have distinct sharp \(L^q\) convergence criteria at each \(0<q<1\); convergence at every such order holds for both families exactly when \(\mathbb{E}e^{sR}<\infty\) for every \(0<s<2\). In the positive-limit class, coefficient vectors multiplied by \((\log n)^{1/4}\) and their analytic windows converge stably to Gaussian mixtures determined by the same critical measure. A uniformly bounded input family gives uncountably many coefficient-limit laws inequivalent under nonzero deterministic complex rescaling. We distinguish these laws using exact weighted tails under \(\mathbb{E}I_0(2R)<\infty\), where \(I_0\) is the modified Bessel function, and negative mass moments. For \(\log\mathbb{P}(R>u)\sim-λu^α\), \(0<α<1\) and \(λ>0\), the normalization and Gaussian-mixture form persist, while every positive limit moment diverges; we determine the logarithmic tails. Finite limiting moments need not imply convergence of the original coefficient moments. In the positive-limit class, coefficient periodograms recover the critical measure and energy normalization gives Gaussian limits. Hardy nonmembership holds under finite variance alone; the positive-limit class has sharp weighted Bergman criteria for \(0<p\le2\) and boundary Sobolev threshold \(s=-1/2\).

comments
67 pages
fields
Probability
pdf ↗ page arXiv:2610.34371 ↗

Let $\mathcal O_K$ be the ring of integers of a number field $K$. A finite subset $\mathcal H=\{η_1,\ldots,η_k\}\subset\mathcal O_K$ is said to be \emph{admissible} if for every prime ideal $\mathfrak p$ in $\mathcal O_K$, the reductions of the $η_i$ modulo $\mathfrak p$ do not represent every residue class. The diameter of a finite subset $S$ of $\mathcal O_K$ is defined to be \[\mathrm{diam}(S):= \max_{η_i,η_j\in S:η_i\neqη_j}|\mathcal N(η_i-η_j)|\] where $\mathcal N$ denotes the norm down to the rational field. This paper computationally investigates admissible subsets of rings of integers in imaginary quadratic fields of class number 1 (such as the Gaussian integers or the Eisenstein integers) that are large relative to their diameter. The motivation is twofold. Firstly, there is the improvement of results analogous to the question of an upper bound for the least gap between large rational primes, which has been one of the great number theoretic successes of the twenty-first century. A second motivation is that there is the opportunity to disprove a variation of the second Hardy-Littlewood conjecture. The calculations in the paper provide new records on the smallest distance between primes in the fields in question, and explicit counter-examples to a generalisation of the second Hardy-Littlewood conjecture in all bar one of the fields.

comments
25 pages, 8 figures
fields
Number Theory
pdf ↗ page arXiv:2610.34556 ↗

We show that if $κ^{<κ} = κ$, then there is a $κ$-strategically closed, $κ^+$-c.c. partial order that forces $\square_κ$. We discuss consequences for generic large cardinals.

fields
Logic
pdf ↗ page arXiv:2610.34900 ↗

Coron's return method established local nonlinear controllability of a moving water tank in sufficiently large time. The quadratic response at uniform equilibrium is studied in this work, where the acceleration input in the linearized model cannot excite the Fourier modes of the fluid with even indices. At three one-way wave crossings ($T=3$), the quadratic final-state map on a family of delayed controls that return the linearized state to zero is reduced to a scalar expression associated with a planar curve. A constant-level curve gives the return, and a tangential variation yields an explicit right inverse of the derivative of the quadratic final-state map. This inverse acts on all missing modes and maps mean-zero periodic $H^r$ targets to $H^r$ controls for every nonnegative integer $r$. A contraction argument also gives local exact solvability of the quadratic final-state equation. Finally, a time-dependent Sylvester equation provides an alternative representation of the coupling responsible for the second-order correction. The associated change of state coordinates involves one spatial derivative, while the control correction preserves regularity in appropriate Sobolev spaces. These results concern the first two variation equations only, while nonlinear controllability at this time remains open. Keywords: Controllability, control of partial differential equations, return method, Saint-Venant equations, Sylvester equations.

fields
Optimization and Control
pdf ↗ page arXiv:2610.35319 ↗

Rectified flow (RF) is an ODE-based generative modeling framework that has achieved remarkable success in practice over the past few years. By design, RF seeks to produce flows that have a high degree of straightness, in the sense that the resulting ODE trajectories can be obtained with relatively few (ideally, one) sampling steps. However, a rigorous analysis of straightness or near-straightness of RF flows remains missing in the literature. In this paper, we study settings in which the coupling generated by two-step RF is provably straight at the population level. We provide a complete characterization in two popular classes of data distributions: (i) smooth, strongly log-concave densities and (ii) Gaussian mixture models. Our main results yield sharp conditions for the coupling generated by two-step RF to be straight. Non-straight couplings are constructed when these conditions fail, which demonstrate the sharpness of these conditions. Using the theory developed on the straightness of two-step RF, we propose a notion of approximate straightness that measures the straightness of the learned couplings and can be estimated from the data. We introduce a procedure for constructing asymptotic confidence intervals for our proposed notion of approximate straightness and propose a data-driven method for selecting the number of reflow rounds in multiple iterations of RF.

comments
82 pages, 8 figures
fields
Statistics Theory
pdf ↗ page arXiv:2610.36090 ↗

For $n\ge2$, let $F_n$ be the free group of rank $n$, and let $\IA(F_n)$ be the group of automorphisms of $F_n$ acting trivially on its abelianization. Two natural filtrations of $\IA(F_n)$ are its lower central series $γ_c(\IA(F_n))$ and the Andreadakis filtration $\mathrm{I}_{c+1}\mathrm{A}(F_n)$, consisting of automorphisms acting trivially on $F_n/γ_{c+1}(F_n)$, $c \geq 1$. Andreadakis conjectured that these filtrations coincide. We prove that the conjectured equality fails for all $n\ge3$ and $c\ge4$.

fields
Group Theory
pdf ↗ page arXiv:2610.36302 ↗

We study compact non-Kähler Bismut Hermitian-Einstein threefolds endowed with an automorphism group acting with cohomogeneity one. We prove that the Lie algebra of this group is isomorphic to $\mathbb{R}^3\oplus\mathfrak{su}(2)$ or $\mathbb R^2\oplus\mathfrak{su}(2)$, provided that the Bismut connection is not flat. In the first case, we explicitly describe all these structures up to homothety and biholomorphic isometry. We also construct explicit families of complete non-compact examples. The resulting non-Bismut-flat threefolds have non-constant scalar curvature and restricted Bismut holonomy $T^1\subset \mathrm{SU}(3)$, and include examples on $S^3\times S^3$ and complete examples on $S^3\times S^1\times\mathbb{R}^2$. Finally, we construct a smooth deformation of a Bismut-flat Samelson structure on $S^3\times S^3$ through non-Bismut-flat Bismut Hermitian-Einstein structures whose complex structures are not compatible with any Bismut-flat metric.

comments
v2: several improvements including full classification in the compact case when the group is covered by T^3 X SU(2) and proof that the restricted Bismut holonomy is one dimensional
fields
Differential Geometry
pdf ↗ page arXiv:2610.37102 ↗

Let $\operatorname{odd}(G)$ be the number of odd-degree vertices of a graph $G$. We prove that, if $p=o(1)$ and $np/\log n\to\infty$, then with probability tending to one the random graph $G(n,p)$ has an edge decomposition into exactly $\operatorname{odd}(G)/2$ paths. This confirms a conjecture of Glock, Kühn and Osthus from 2016. The proof combines a local pairing argument based on the lopsided Lovász local lemma with cycle decompositions of random graphs.

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

We derive explicit overlap functions for integrable matrix product states associated with arbitrary finite-dimensional irreducible evaluation representations of the orthogonal and symplectic twisted Yangians. The central step is to relate the commuting quasi-determinants entering the universal overlap formula to Sklyanin determinants of nested subalgebras. For orthogonal evaluation representations, this relation determines their spectra directly in the Gelfand–Tsetlin basis. In the symplectic case, we combine Sklyanin determinants and minors with a factorization of the nested rank-two boundary matrices to obtain the corresponding spectra. The resulting overlap functions are explicit products parametrized by Gelfand–Tsetlin patterns and require only the highest-weight data of the underlying orthogonal or symplectic representation. Together with the universal ratio of Gaudin determinants and the model-dependent pseudovacuum overlap coefficients, they determine the normalized MPS overlaps. We also express the overlap functions in the orthogonal case beyond evaluation representations in terms of the highest weights arising along the nested twisted-Yangian subalgebras.

comments
27 pages, extra references added
fields
Mathematical Physics
pdf ↗ page arXiv:2610.37285 ↗

It is known that randomly initialized neural networks have Gaussian behaviour in the $n\to \infty$ limit. Unfortunately, this approximation can be poor for finite $n$ and gets worse as one goes deeper into the network. In this work, we develop a more accurate approximation that is \emph{slightly} non-Gaussian, which we call the para-Gaussian distribution and is constructed from the Hermite polynomials. We show how this para-Gaussian approximation can lead to a practical recursive method to approximate the deeper layers of the network. Finally, we apply this theory to linear neural networks (where things can be solved exactly) and to ReLU neural networks (where things can be approximated).

comments
34 pages, 9 figures
fields
Probability
pdf ↗ page arXiv:2610.37388 ↗

Let $\mathcal{N}(k,n)$ be the largest size of a family of affine $k$-planes in $\R^n$ at pairwise separation distance one. We develop a unified treatment of upper bounds, dimension reduction, product constructions, and fixed-codimension stability. Orthogonal-projection coordinates give a rank-stratified distance identity; a Veronese lifting converts its polynomial consequences into simultaneous total isotropy. Connected Nash decomposition and an analytic diagonal argument yield an explicit bound \[ \mathcal{N}(k,n)\leqslant 2^{\,2^{\,3(k+1)(n-k)}}. \] For configurations whose direction sums have dimension at most $k+1$, we prove the exact reduction $\mathcal{N}_{\leqslant k+1}(k,n)=\mathcal{N}(1,n-k+1)$. Every codimension-two configuration splits off a common linear factor, so $\mathcal{N}(n-2,n)=\mathcal{N}(1,3)$. A transverse product construction gives multiplicative inequalities. We further prove that for every fixed codimension $c$, the sequence $\mathcal{N}(k,k+c)$ is eventually constant. In codimension three, a sharper normal-span argument gives \[ \mathcal{N}(k,k+3)=\mathcal{N}(7,10)\qquad(k\geqslant7), \] where the numerical threshold uses the computer-assisted theorem $\mathcal{N}(1,3)=7$. The structural and stability results are otherwise independent of that numerical input.

comments
26 pages, comments are welcome
fields
Metric Geometry, Combinatorics
pdf ↗ page arXiv:2610.37421 ↗

For a positive integer $n$, let $D(n)$ be its set of positive divisors and put $N:=τ(n)=|D(n)|$. We characterize the arithmetic progressions $\mathcal P$ of length $N$ that admit a bijection with $D(n)$ pairing relatively prime integers. Such a coprime matching exists if and only if, for every prime $p\mid n$, at most $N/(ν_p(n)+1)$ terms of $\mathcal P$ are divisible by $p$, where $ν_p(n)$ is the exponent of $p$ in $n$. Call $n$ an $M$-number if $p^p\nmid n$ for every prime $p$. We prove that $D(n)$ can be matched with every primitive arithmetic progression of length $N$, meaning one whose first term and common difference are coprime, if and only if $n$ is an $M$-number. This proves a conjecture of McNew and Pomerance. In particular, $n$ is matchable, meaning that $D(n)$ can be matched with the primitive progression $\{1,2,\ldots,N\}$, if and only if $\lfloor N/p\rfloor\le N/(ν_p(n)+1)$ for all $p\mid n$. We classify the matchable non-$M$-numbers, settle a conjectured divisor criterion, and prove that every divisor of a matchable integer is matchable. The proofs combine a Vandermonde determinant with a partition into shorter progressions. If $E(x)$ counts the matchable non-$M$-numbers up to $x$, then, as $x\to\infty$, $$ E(x)\sim\frac{x}{\log x} \sum_{r\ge1}\frac{(\log\log x)^{r-1}}{(r-1)!\,q_r^{q_r}}, $$ where $q_r$ is the least prime greater than $2^r$. This also gives a second term in the asymptotic formula for the count of all matchable integers up to $x$.

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

We study whether open null strings admit the full Carroll–Weyl gauge symmetry consistently with endpoint conditions and nontrivial physical degrees of freedom. For endpoints constrained to timelike defects, natural variations imply that any nonzero Carroll flow must be tangent to the worldsheet boundary. For a fixed linear defect through the target origin, we construct a differentiable Hamiltonian system on this branch. Its complete Carroll–Weyl generator requires no additional boundary charge. Smooth reflection defines a preserved subdomain and gives a circle interpretation to selected sine and cosine modes of the constraints. Their centreless algebra extends the two-constraint open-string algebra by the local scale constraint. An endpoint obstruction shows that this reflection condition excludes some gauge orbits of the natural interval theory: we exhibit a regular four-dimensional solution with no corresponding reflected representative. Within the reflected sector, we construct a local canonical field pair and conserved target-space Lorentz charges. A separate solution family has nonzero boost charge and a nondegenerate two-dimensional symplectic pullback. The constraint algebra, the boundary choice, and the physical observables thus provide complementary information about the open theory.

comments
Major revision with structure rearranged, 26 pages, 2 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.37546 ↗

Physics-Informed Neural Networks approximate the solution of boundary value problems by minimizing the strong-form residual, their accuracy is often limited near corner and crack singularities, sharp layers and localized features and the enforcement of Neumann boundary conditions remains challenging. In hp-Variational Physics-Informed Neural Networks, the problem is formulated in a Petrov-Galerkin weak form, reducing the differentiation order applied to the neural network, while boundary constraints are imposed through penalty terms. The variational residual is evaluated using fixed Gauss quadrature points and the strong-form residual on a fixed collocation set, which may fail to capture regions of rapid variation. To address this issue, we integrate hp-Variational Physics-Informed Neural Networks with Residual-based Adaptive Refinement. During training, the strong-form residual is computed on a dense candidate pool and points with the largest residuals are added adaptively to the collocation set. Since the weak formulation is defined in $H^{1}(Ω)$, it avoids the $H^{2}(Ω)$ regularity requirement that fails on cracked and non-convex domains. The proposed method is validated on four two-dimensional elliptic problems and consistently achieves substantial reductions in relative $L^{2}$, absolute $L^{\infty}$ and relative $H^{1}$ semi-norm errors through adaptive residual-driven point placement.

comments
This submission is withdrawn because it duplicates the authors' work "Residual-Based Adaptive Refinement in Hybrid Variational-Collocation PINNs for Singular Elliptic PDEs with Mixed Dirichlet-Neumann Boundary Conditions" (arXiv:2610.26458). Please refer to that work instead
fields
Numerical Analysis
pdf ↗ page arXiv:2610.37670 ↗

Ordinary $0$-form symmetries $G$ can mix with $1$-form symmetries $Π_2$ to form a $2$-group $\mathcal{G}$. We give a concrete lattice definition for a class of finite $2$-group symmetries in terms of local relations among symmetry operators. These relations identify the Postnikov class $[ρ]\in H^3(BG,Π_2)$ that characterizes the mixing. We develop a method to extract anomalies of these symmetries in one spatial dimension by restricting symmetry operations to an interval and comparing their composition near its endpoints. We also construct explicit qubit symmetry actions in $d=1,2,3$ spatial dimensions for a $2$-group with $G=Π_2=\mathbb{Z}_2$. These actions share the same nontrivial Postnikov class but include both anomaly-free and anomalous realizations. Their cohomological anomalies are classified by $H^{d+2}(B\mathcal G,U(1))$, which is $\mathbb{Z}_2$ for $d=1,2$ and $\mathbb{Z}_2\times\mathbb{Z}_2$ for $d=3$, and our constructions realize every class in these dimensions. Our results connect higher-group symmetry and its anomalies to concrete lattice operations, providing a microscopic framework for studying anomalous symmetries.

comments
45 pages, 9 figures; Added acknowledgement, 3.4.2 deleted, Appendix C restructured
fields
Mathematical Physics, Quantum Algebra
pdf ↗ page arXiv:2610.37745 ↗

Randomized numerical linear algebra (RNLA) has fundamentally changed the landscape of scientific computing over the last twenty to thirty years. While early breakthroughs focused primarily on low-rank approximation and least-squares problems, randomized techniques are now used to solve a broad range of linear algebra problems, supporting applications spanning data science, optimization, and computational engineering. This paper surveys some of the main ideas of RNLA, focusing on methods that are effective in practice and on simple theoretical bounds that can be used to understand them. We highlight the core benefits of randomization: improved scalability, algorithmic simplicity, and—contrary to what the name may suggest—remarkable reliability and numerical stability. Topics include sketching, low-rank approximation, least squares, orthogonalization and approximate orthogonalization, randomized Krylov subspace methods, preconditioning, trace and spectral density estimation, row and column selection algorithms, posterior error estimation, randomized regularization, and tensor-structured randomness.

comments
186 pages; to appear in Acta Numerica; v2: fixes to bibliography
fields
Numerical Analysis
pdf ↗ page arXiv:2610.38157 ↗

Hofbauer, Kon and Saito showed that a Lotka-Volterra interaction matrix $A$ with negative diagonal can be qualitatively permanent only if (C1) every cycle of length $\ge 2$ of $A$ is nonpositive and (C2) every negative cycle contains exactly one negative entry. They conjectured that these conditions are also sufficient, and proved this for $n\le 3$. We give a $5\times 5$ integer matrix with seven nonzero off-diagonal entries that satisfies (C1) and (C2) but is not qualitatively permanent. For an explicit integer growth vector, in which one species is an obligate consumer as the definition allows, the system has an interior equilibrium, and an asymptotically stable heteroclinic cycle on the boundary of the orthant attracts an open set of interior orbits. Adding non-interacting species gives counterexamples for every $n\ge 5$. The interactions form a one-way feedback loop together with a predator of two prey. The verification is elementary except for one heteroclinic connection, which lies in a face that is not Volterra-Lyapunov stable. For it we prove a connection lemma based on invasion graphs, which reduces the question to a smaller, stable face. The failure is robust. It persists under small perturbations, including weak additional interactions, so every sign pattern that satisfies (C1) and (C2) and contains ours is a counterexample, and it occurs for an open cone of growth vectors. For $n\ge 6$ there are also counterexamples in which every species grows when alone. Finally, we announce that the conjecture holds for $n=4$ and that, for $n=5$, four minimal sign patterns characterise its failure.

comments
22 pages, 3 figures. Ancillary files: four verification scripts (Julia, standard library only)
fields
Dynamical Systems
pdf ↗ page arXiv:2610.38374 ↗

Behavior Cloning (BC) of expert controllers for multiscale dynamical systems is challenging: state variables evolving at widely separated timescales induce highly nonlinear couplings that a shared latent space may fail to adequately represent, degrading closed-loop generalization. We propose Structured Representation Learning for Behavior Cloning (SRLBC), an architecture designed to leverage the physical knowledge of multiscale systems in which slow state variables, fast (stiff) state variables, and predictable exogenous inputs evolve at different timescales. On 500 long-horizon roll-outs of a pressurized water reactor (PWR) load-following benchmark -a high-dimensional, stiff industrial system with challenging safety constraints -and across 20 training seeds, separated embeddings systematically outperform shared embedding baselines on cumulative cost, imitation accuracy and constraint satisfaction. The resulting standalone policies approach NMPC closed-loop performance at a computational cost 15 times lower on average. Since standalone policies still leave a few percent of trajectories infeasible, we embed the learned policies in a safety-augmented approximate NMPC framework, in which the optimizer is only called when the predicted input sequence is not certified as safe. This yields controllers still 6.8 times faster than the NMPC controller on average, with a feasibility (i.e., constraint satisfaction) of at least 99.8% for all architectures, SRLBC retaining the lowest closed-loop cost. Under distribution shift, standalone BC policies degrade sharply: SRLBC degrades the least, and once safety-augmented, it retains a feasibility above 98% with the lowest closed-loop cost. Beyond the quantitative results, Jacobian-based sensitivity analysis shows that the resulting controller relies on a sparse and less redundant set of latent features, each attributable to a single group of physical variables, and aligned with the physical timescale decomposition of the system.

fields
Optimization and Control
pdf ↗ page arXiv:2610.38496 ↗

Deep lid-driven cavities contain strong motion beneath the lid and much weaker recirculation at depth, so agreement in bulk velocity is an incomplete assessment of a computed flow. We examine data-free physics-informed neural networks (PINNs) for steady, two-dimensional incompressible flow in a cavity of depth-to-width ratio five at Reynolds numbers 100, 250, 500 and 1000. An established hard-constrained streamfunction formulation is combined with prescribed regional collocation, transferred initialization, and selected residual-scaling and envelope variants. Independent spectral/$hp$ calculations with the same Gaussian-regularized lid provide the reference fields. For a cavity of depth-to-width ratio $D/W=5$ at Reynolds numbers $\mathrm{Re}=100$, 250, 500, and 1000, evaluation on a common $121\times605$ grid gives interior relative velocity discrepancies of 5.130\%--7.850\%. Over the same cases, floor-region relative velocity discrepancies remain below 5\%, with absolute RMS discrepancies ranging from $1.255\times10^{-10}U$ to $2.332\times10^{-9}U$, where $U$ is the lid-velocity scale. In a separate $161\times801$ assessment at $\Rey=1000$, the refined workflow lowers interior velocity discrepancy from 5.624\% to 2.658\% and gauge-aligned pressure RMS discrepancy from $2.793\times10^{-3}$ to $1.167\times10^{-3}ρU^2$. The improvements compare accumulated training workflows and do not isolate regional sampling. Configuration rankings depend on both region and observable. These finite-budget comparisons establish where the retained workflows agree with the reference and where rotational-field discrepancies remain substantial.

fields
Mathematical Physics
pdf ↗ page arXiv:2610.38814 ↗

We develop an intrinsic theory of spectral structures on holomorphic vector bundles over compact Riemann surfaces, generalising eigenspace decompositions without eigenvalues. Their geometric realisations are presentations of vector bundles as pushforwards of line bundles along finite branched covers. We construct their analytic moduli stack locally of finite presentation and identify it with the relative Picard stack of the universal family of finite covers. We prove that the forgetful morphism to the stack of vector bundles is representable by analytic spaces and is smooth and surjective on a distinguished smooth open substack. Consequently, every holomorphic family of vector bundles locally admits spectral presentations along smooth connected simply branched covers, and these presentations can be deformed alongside the underlying bundles. The relative Picard description yields explicit local dimension formulas and recovers the stack of regular Higgs bundles as base change along the Hitchin base. We also characterise the additional data supplied to a spectral structure by a regular Higgs field as a global twisted generator, and prove that every vector bundle of rank at least three admits smooth connected simply branched spectral structures which cannot arise from any Higgs field.

comments
86 pages; v2 adds a projective-geometric existence proof (Proposition 2.1) based on a suggestion by Anand Patel, and a general existence theorem for non-Higgs spectral structures (Proposition 4.4)
fields
Algebraic Geometry, Complex Variables
pdf ↗ page arXiv:2610.38972 ↗

Stembridge conjectured that every monomial immanant is non-negative on totally non-negative matrices, and Haiman proposed a stronger statement which at $q=1$ says that every monomial immanant is a non-negative integer combination of the Kazhdan-Lusztig immanants of Rhoades and Skandera. We prove this for every hook shape $(a,1^{n-a})$ and every $n$. More precisely, each of the per-vertex functions obtained by splitting Stembridge's formula for hook characters is Kazhdan-Lusztig positive. The main tool is a positivity statement for products: a product of Kazhdan-Lusztig positive immanants of complementary submatrices is Kazhdan-Lusztig positive, which we deduce at $q=1$ from Braden's hyperbolic localization, following Billey and Braden. With Haiman's theorem for irreducible characters, it shows that every class function whose Frobenius characteristic lies in the semiring generated by Schur functions and hook monomial symmetric functions is Kazhdan-Lusztig positive; for example, Skandera's chain of normalised hook immanants is Kazhdan-Lusztig positive for every $n$. We place these results in a comparison of three cones of class functions, and show that the remaining obstructions to Haiman's conjecture lie at singular Schubert varieties that are not reached by an iterated doubling identity of Abreu and Nigro, for which we give an explicit criterion. Finally, on the full span of permutation monomials, an element that is non-negative on totally non-negative matrices can have a negative coefficient at the Kazhdan-Lusztig immanant $\mathrm{Imm}_w$ if and only if the Schubert variety $X_w$ is singular; Skandera proved the smooth half.

comments
26 pages, 7 figures, 1 table. Companion to arXiv:2610.41555. Code and data: doi:10.5281/zenodo.23730750. v2: adds Corollary 5.2 (Murnaghan-Nakayama inequalities), a remark on the dual e-positive picture and a remark that proofs for new shapes must leave class functions; credits Haiman 1993 for the inclusion C_KL in C_J; other numbering unchanged
fields
Combinatorics, Representation Theory
pdf ↗ page arXiv:2610.39021 ↗

Let $H$ be a complex Hilbert space with $\dim H\ge 2$. We characterize the nonzero additive maps on $\mathcal{B}(H)$ and on its self-adjoint part $\mathcal{B}_s(H)$ that preserve mutual strong numerical-radius orthogonality in one direction, assuming surjectivity only in infinite dimension. These maps are precisely those of the form $A\mapsto cUAU^*$, where $U$ is unitary or antiunitary, and $c$ is a nonzero complex scalar for $\mathcal{B}(H)$ and a nonzero real scalar for $\mathcal{B}_s(H)$.

comments
16 pages. The surjectivity assumption has been removed in the finite-dimensional case
fields
Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2610.39080 ↗

Delay-Doppler (DD) modulations, such as Zak-transform-based orthogonal time frequency space (Zak-OTFS) modulation, represent the channel as a sparse set of delay and Doppler shifts, which makes them well suited for radar sensing. Sensing with a single DD frame, however, is unambiguous only when the channel spread factor, i.e., the product of the delay and Doppler spreads, is less then one. Long-range mobility scenarios, including drones, airplanes, low Earth orbit (LEO) satellites, and underwater acoustic links, typically violate this crystallization condition, so that a single frame aliases the target delays, Doppler shifts, or both. Existing methods add a time-frequency pilot to a conventional DD frame, resolve the aliasing in only one dimension, and assume integer delays and Doppler shifts. We propose a frame design that combines multiple DD bases with different delay and Doppler periods, which together cover an overspread channel with fractional delays and Doppler shifts, using the same bandwidth and frame size. We show that modular arithmetic on the peak positions uniquely recovers each target by pairing the peaks through their common projection and their gains, and we derive the condition under which this pairing is ambiguous. We implement the design with two superimposed Zak-OTFS frames and propose two receivers: dual-frame sensing (DS), which performs the joint detection directly, and DS with cross-pilot cancellation (DS-XC), which additionally cancels the cross-pilot interference, re-estimates the gains by joint least squares, and removes ghost targets. Both receivers maintain a detection rate close to one as the spread factor grows, and DS-XC also achieves the lowest false-alarm rate and channel estimation error among all the compared systems. In a 100 km drone scenario, DS-XC outperforms all baselines, with a complexity that grows near-linearly with the time-bandwidth product.

comments
14 pages, 8 figures, 4 tables
fields
Information Theory
pdf ↗ page arXiv:2610.39110 ↗

We give an affirmative answer to the \emph{abstract group problem} for the category $\YB$ of all set-theoretic solutions of the Yang–Baxter (YB) equation: every group is isomorphic to the automorphism group of a YB-solution, which can be chosen on a finite set if the group is finite. In the terminology of László Babai, this means that the category $\YB$ is \emph{universal} and \emph{finitely universal}, which is an analogue of Frucht's classical theorem for graphs. Furthermore, the YB-solutions can be chosen within three very small classes: the solutions of the Frobenius-Separability equation, the solutions of the Baaj–Long–Skandalis equation and the recently introduced bipartite solutions. The proof is based on new constructions which associate to any graph a YB-solution in each of these classes, with the same automorphism group as the graph. Explicit YB-solutions with automorphism groups $C_n$, $S_n$, $D_n$ and $Q_8$ are given, as well as a unitary YB-solution, constructed directly from a field $K$, whose automorphism group is ${\rm Aut} (K)$.

comments
v2: added Example 2.23 (YB-solutions associated to a field); 17 pages
fields
Combinatorics, Group Theory, Quantum Algebra, Rings and Algebras
pdf ↗ page arXiv:2610.39228 ↗

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
pdf ↗ page arXiv:2610.39242 ↗

For every bounded convex domain $Ω\subset\mathbb R^d$, $d\ge2$, we establish the following sharp inequality for torsional rigidity $$T(Ω)\ge\frac{2(d+1)}{d}\int\limits_Ω\operatorname{dist}(x,\partialΩ)^2\,\mathrm{d} x,$$ where $T(Ω)=4\int\limits_Ωu\,\mathrm{d} x$ and $-Δu=1$ in $Ω$, $u\in H^1_0(Ω)$. Equality holds for balls.

comments
4 pages, minor revisions to the introduction and references
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39666 ↗

In every fixed dimension \(N\ge3\), for any finite list of positive integers \(m_1,\ldots,m_\ell\), we construct smooth strictly star-shaped Euclidean domains whose first \(\ell+1\) distinct Dirichlet eigenvalues can have multiplicities \(1,m_1,\ldots,m_\ell\) respectively. The condition "star-shaped" is almost optimal in the sense that this statement can not hold for bounded convex domains. In fact, we show that the $k$-th Dirichlet eigenvalue of any bounded convex domain has multiplicity at most $(N-1)(k-1)+1$, and this bound $N$ for the second Dirichlet eigenvalue is sharp.

comments
47 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39794 ↗

Petty conjectured that every n-dimensional real normed space contains n+1 equidistant points. The conjecture was proved in dimensions three and four by Petty and Makeev, respectively. We prove the five-dimensional case: every five-dimensional real normed space contains six equidistant points. The proof uses a bordism of equilateral configurations and a homological obstruction.

comments
21 pages
fields
Metric Geometry, Functional Analysis
pdf ↗ page arXiv:2610.39967 ↗

We construct, for each deterministic Turing machine that halts on all inputs, one polynomial vector field with rational coefficients that performs the same logical computation at unit Euler step, at every smaller or variable step in $(0,1]$ with divergent sum, and along the flow. This unifies discrete-time and continuous-time computation by polynomial dynamics, which earlier characterizations treated separately. For a machine making $T$ transitions in space $H$, a logical scale $h=2^{-s}$ with $s=O(H)$ suffices, with physical time $O(s(T+s))$, drift disturbances up to $h^{2K}$ for a fixed exponent $K$, and $2Ks+3$ fractional bits at unit step. On a fixed compact domain, polynomial time and robust eventual decision characterize P and PSPACE, respectively, with polynomial scale thresholds and no supplied stabilization horizon in the space case. Without sign, floor or conditional primitives, margin amplification at bounded speed, overlapping polynomial gates and interval-product estimates give the common realization, from which we derive shared logical traces, fixed-field PSPACE-complete prediction and a robust safety family with polynomial certificates common to all Euler steps and the flow.

comments
93 pages. Ancillary files: exact local checks (Python 3, standard library only). v2: explicit horizon in Corollary 55, minor corrections
fields
Dynamical Systems
pdf ↗ page arXiv:2610.40025 ↗

Bérczi, Gehér, Imolay, Lovász, and Schwarcz (SIAM J. Discrete Math. 40(2026), 308–335) asked whether every set function of bounded variation is a difference of two bounded submodular functions, and how to determine the optimum in a monotonic sum-decomposition of a planar graph cut function. In this paper, we answer both questions and obtain quantitative extensions. For the first question, we characterize the continuous profiles $f:[0,1]\to\mathbb R$ for which $A\mapsto f(m(A))$ is a bounded submodular difference on an atomless probability space. More precisely, we express the minimum oscillation of the subtracted component through the positive part of the distributional second derivative. We also characterize admissible discontinuous profiles and give an exact summability criterion for countable block functions. In particular, the first question has a negative answer even for increasing functions of variation one whose scalar profiles have log-Lipschitz derivatives and belong to every $C^{1,α}$, $0<α<1$. Turning to graph cuts, we prove that the optimum equals the total edge weight minus the maximum fractional triangle-packing weight for every nonnegative weighting if and only if the graph is $K_5$-free. Moreover, maximum packings parametrize the symmetrized optimal components, while on $K_4$-free graphs we describe all optimal components and characterize uniqueness. Consequently, the formula applies to weighted planar graphs and implies edge-weight monotonicity on $K_5$-free graphs. For rational weights, it also yields polynomial-time constructions.

comments
31pages
fields
Combinatorics
pdf ↗ page arXiv:2610.40032 ↗

This paper extends the classical results of Eisenhart (1923) and Levi-Civita (1896) classifying pairs of germs of Riemannian metrics with the same geodesics, either as parametrized curves (affine equivalence) or as unparametrized curves (projective equivalence), to sub-Riemannian metrics on arbitrary step 2 distributions: at every stable point in the projective case and at every point in the affine case. This extends the results of Zelenko (2004) for contact and even-contact distributions and the affine result of Lin and Zelenko (2024) for step 2 distributions with ad-surjective Tanaka symbols; our projective result covers the ad-surjective case as well. In the affine case, we prove that if a sub-Riemannian metric admits an affinely equivalent metric that is not constantly proportional to it, then locally it is a product of two sub-Riemannian metrics. In the projective case, we prove the 2019 conjecture of Jean, Maslovskaya, and Zelenko on generalized Levi-Civita pairs; in particular, the distribution admits a product structure, the squares of its components are involutive, and the restrictions of the two metrics to each leaf of the corresponding foliation are conformal under the appropriate pullback. The proof uses a new graph-theoretic formalism, in which compatible moving frames are represented by the vertices and edges of certain graphs. As a byproduct, we introduce a new discrete invariant of step 2 nilpotent graded Lie algebras, the characteristic tuple. For left-invariant metrics on step 2 Carnot groups, this tuple is the growth of the osculating flags of the Jacobi curves of generic normal extremals, i.e., the lengths of the columns of their Young diagrams starting from the second column. The compatible graphs are used where this tuple is locally constant; the resulting bracket relations extend by continuity, so our classification requires no local constancy of the tuple.

comments
82 pages, 1 table. Based on the PhD thesis of the first author, written under the supervision of the second author and defended at Texas A&M University in September 2026. v2: exposition of Subsection 1.4 and Section 4 improved (new Definition 4.1; Section 4 renumbered), matching edits in Sections 8 and 9, and a sentence on Jacobi curves added to the abstract
fields
Differential Geometry
pdf ↗ page arXiv:2610.40288 ↗

Exceptional points (EPs), at which two quasinormal frequencies and their eigenvectors coalesce, can enhance the spectral instability of black hole quasinormal modes. We investigate this behavior in Kerr–Newman spacetimes through pseudospectra and condition numbers for neutral massless scalar fields and coupled gravitoelectromagnetic (GE) perturbations. For the scalar field, we follow the $(\ell,m)=(1,1)$ spheroidal branch and derive the energy norm from the stress-energy tensor. For GE perturbations, we use a coupled four-field system equipped with a positive radiative energy. Along matched parameter paths toward the selected EPs, the frequency splitting follows a square-root law and the condition numbers grow as the inverse square root of the distance to the EP. Their product, which approximates the norm of the double-pole coefficient, does not depend on the offset or, for GE, on the angular truncation and projection used. The pseudospectral contours resolve the transition from individual-mode sensitivity to the collective response of the pair. At the selected backgrounds and resolution, both pair members are more sensitive than two more-damped modes at the same background, but this ordering holds only below a crossover offset that decreases with radial resolution. For the GE pair, angular refinement also displaces the coalescence by more than the selected offset. Within the discretized problems and energy norms considered here, these results describe qualitative trends of spectral instability near EPs rather than continuum magnitudes, and motivate further study of their possible role in black-hole ringdown.

comments
14 pages + appendices, 8 figures, 8 tables, references added
fields
Mathematical Physics
pdf ↗ page arXiv:2610.40323 ↗

Weyl points are quasimomentum-energy pairs in the band structure of three-dimensional periodic media at which two dispersion surfaces touch conically. They first arose in a model introduced by H. Weyl in 1929, but were first observed only recently in condensed matter physics and photonics experiments. Weyl points have been explored theoretically via numerical computation and via tight binding (discrete) models. In this article we present the first analytical treatment of Weyl points in a continuum PDE-type model. Starting with a Schrödinger operator whose electric potential is periodic with respect to the body-centered cubic (BCC) lattice, we introduce a small BCC-periodic magnetic vector potential that is equivariant with respect to a specific abelian group of symmetries. For magnetic Schrödinger operators of this type, we prove (i) that a pair of Weyl points bifurcates from a threefold degeneracy in the band structure of the underlying non-magnetic operator, and (ii) that these Weyl points are stable against small self-adjoint BCC-periodic perturbations of both the electric and magnetic vector potentials.

comments
55 pages, 4 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.40963 ↗

Let Q be a real indefinite quadratic form of type (1, 4) with determinant D \neq 0. We prove that for every c \in \mathbb{R}^5 there exists x \in \mathbb{Z}^5 such that 0 < Q(x + c) \le (8|D|)^{1/5}, and that the constant 8 is optimal. This establishes a conjecture of Bambah, Dumir and Hans-Gill and, together with earlier work, completes the determination of the sharp constants Γ_{r,s} for positive inhomogeneous values of nondegenerate indefinite quadratic forms. The proof combines classical reduction and gap theorems with uniform bounds for circular gaps of quadratic residues. A central step identifies the exceptional parameters in certain resonant reduced families: an explicit ladder of integer witnesses resolves their punctured neighbourhoods, leaving only three rational parameter points, subject to stated coefficient conditions. These are treated by retaining the coupling in a preceding, less reduced form. The remaining covering statements are verified by finite certificates in exact rational arithmetic.

fields
Number Theory
pdf ↗ page arXiv:2610.41223 ↗

We show that if the projectivised stratum $\mathbb{P}{H}_g(μ)$ associated to a partition $μ=(m_1,\ldots,m_n)$ of $2g-2$ contains a complete curve, then \[ \sum_{i=1}^n\frac{m_i(m_i+2)}{m_i+1}>12. \] The weak inequality follows from semipositivity applied to a quotient of the Hodge bundle, while equality is excluded using the second Fujita decomposition and the geometry of fibred surfaces with maximal unitary rank. Consequently, no projectivised holomorphic stratum in genus $g\leq5$ contains a positive-dimensional complete subvariety. In genus $g=6$ the same conclusion holds for signatures \[ (10),\ (9,1),\ (8,2),\ (8,1,1),\ (7,3),\ (6,4),\ (5,5). \]

comments
7 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.41287 ↗

We study the random walk on a Cayley graph of a finite group whose generators are chosen independently and uniformly at random. We show that, for every finite group, the walk exhibits cutoff with high probability whenever the number of generators is at least a constant multiple of the logarithm of the order of the group and small compared with every positive power of it. This holds for both undirected and directed Cayley graphs, in discrete and continuous time, and the lower bound on the number of generators is best possible, up to the value of the constant. The cutoff time is the time at which the expected entropy of the walk comes close to its maximum, and in general it depends on the structure of the group. This settles a conjecture of Aldous and Diaconis.

comments
22 pages; extended to directed Cayley graphs and discrete time
fields
Probability, Group Theory
pdf ↗ page arXiv:2610.41347 ↗

Haiman conjectured that for every partition $λ\vdash n$ and every $w\in S_n$ the polynomial $c_{λ,w}(q)$, a monomial character of the Hecke algebra evaluated at the Kazhdan-Lusztig basis, has non-negative integer coefficients and is symmetric and unimodal, and he verified this by computer for $n\le7$. We verify it for every $n\le10$. A stability lemma reduces the statement to $n=10$, which we settle by an exact computation that stores only the 1,252,173,030 pairs $(x,w)$ in $S_{10}$ with $x$ maximal in its double coset for the descent sets of $w$, and takes the traces of the standard basis from the class polynomials of Geck and Pfeiffer. Every stored Kazhdan-Lusztig polynomial agrees with du Cloux's Coxeter3, and the coefficients pass several independent checks, including a comparison at all 16,796 codominant $w$ with chromatic quasisymmetric functions computed from colourings. Consequently, for $n\le10$ every monomial immanant is a non-negative integer combination of Kazhdan-Lusztig immanants, Stembridge's monomial immanant conjecture holds, and a class-function immanant is non-negative on totally non-negative matrices if and only if it is non-negative at the block matrices $J_μ$. We use this to describe the order of normalised irreducible-character immanants on totally non-negative matrices for $n\le10$, and to prove Pate's inequalities there. On the full span of permutation monomials we give a Newton-polytope criterion for the coefficient of $\mathrm{Imm}_w$ to be non-negative throughout the totally non-negative cone, show that for $n=4,5$ this happens exactly when $X_w$ is smooth, and check by exact computation for $n\le10$ the proof of this for all $n$ given in a companion paper.

comments
25 pages. Companion to arXiv:2610.39021. Code: doi:10.5281/zenodo.23730750; data: doi:10.5281/zenodo.23532289. v2: credits Haiman 1993 for the inclusion C_KL in C_J and the values at w_0(mu); results and numbering unchanged
fields
Combinatorics, Representation Theory
pdf ↗ page arXiv:2610.41555 ↗

We construct a finite-range, translation-invariant counterexample to the Weak Gibbsianity property for quantum spin systems on $\mathbb{Z}^2$. The proof relies on showing how a local potential can induce macroscopically large deviations from an equilibrium configuration after a perturbation is introduced at the boundary of the lattice.

comments
11 pages, 2 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.41871 ↗

We study series $L(x,s):=\sum_n ρ(n)e^{2πi n x}/n^s$, where $ρ(n)$ are Fourier coefficients of an automorphic form $φ$ for a discrete cofinite subgroup $Γ\subset \mathrm{SL}(2,\mathbb{R})$ and $x\in\mathbb{R}$. Let $\mathfrak{b}\in\mathbb{R}\cup\{\infty\}$ represent a cusp of $Γ$. Ordering the orbit $Γ\mathfrak{b}$ by increasing denominators, we prove that the values $L(x,1/2)$ for $x\inΓ\mathfrak{b}$, suitably normalized, become equidistributed according to a standard complex Gaussian law, under natural assumptions on the Laplace eigenvalue of $φ$. Previously this was known either when $Γ=\mathrm{SL}(2,\mathbb{Z})$ or when $φ$ is associated to a holomorphic cusp form. This applies in particular to central values at $s=1/2$ of additive twists of Maass form $L$-functions $\sum_{n\geq1}λ(n)e^{2πi n x}/n^s$, or to the Dirichlet-theta series $\sum_{n\geq1}χ(n)e^{2πi n^2 x}/n^s$.

comments
58 pages, 5 figures
fields
Number Theory
pdf ↗ page arXiv:2610.42008 ↗

When $X_G=\mathbb{C}^n/\!/G$ is a GIT quotient of a vector space, replacing $G$ with a maximal torus $T \subset G$ produces a closely related toric variety $X_T:=\mathbb{C}^N/\!/T$, the \emph{Abelianization} of $X_G$. Abelian/non-Abelian correspondences connect structures on $X_G$ with structures on $X_T$. In this paper, we study the interaction between the toric moment map $μ$ of $X_T$ and $X_G$, when $X_G=\mathrm{Gr}(r,n)$. We do this by looking at the restriction of $μ$ to an intermediate space $Z/T \subset X_T$, where $Z/G=X_G$. We show that the generic fibres of this map are co-Lagrangians that project to Lagrangians on $X_G$. We completely describe the image in the case where $X_G=\mathrm{Gr}(2,n)$, and show that in the general $\mathrm{Gr}(r,n)$ case the image can be sliced so that each piece is determined by a finite set of points, related to matroid circuits.

fields
Algebraic Geometry, Combinatorics, Symplectic Geometry
pdf ↗ page arXiv:2610.42123 ↗

We study some size estimates for the solution of the equation d-bar u=f in one variable. The new ingredient is the use of holomorphic functions with precise growth restrictions in the construction of explicit solutions to the equation.

code
github.com/joaquimortega/MR1949832 ∎ Lean project (lakefile.toml, lean-toolchain) builds, no sorry at 7e465af, checked 2026-11-03 build details
comments
This is a corrected version produced after formalizing in Lean the published version. There was a missing weight in the estimate of Theorem 3 and minor typos. The formalized version is in https://github.com/joaquimortega/MR1949832
journal
Rev. Mat. Iberoamericana 18 (2002), no. 2, 355--377
fields
Complex Variables
pdf ↗ page arXiv:math/9912139 ↗

Get each issue by email →