Papers

Grishkov and Logachev have asked (Problem 1.4 of their recent survey) whether, for a fixed finite field F_q, the analytic ranks of the twists of the Carlitz module are bounded. We answer this in the negative for every q >= 3. For q = p^s and n >= 1 put P_{q,n} = (theta^(q^n) - theta)^(q-2). We show that the directed graph of the matrix M(P_{q,n},1,k) of Grishkov-Logachev has a completely explicit set of circuits: they are pairwise disjoint, none of them meets an entry involving t, and they are in bijection with the orbits of E^n under cyclic rotation, where E is the set of l in [0,q-2] with p not dividing l+1. Consequently L(C_P, t, T) does not depend on t, it factors as a product of one term 1 - wt(nu) T^per(nu) per orbit, and the analytic rank equals the sum of p^(v_p(per(nu))) over the orbits of weight 1. When n is a power of p this equals (q/p)^n (p-1)^(n-1), which is unbounded. The argument also answers questions 3.6.1 to 3.6.4 of the survey for this family.

We study the marked analytic moduli space of polystable degree-zero $\mathrm{SL}_r(\C)$-Higgs bundles over Teichmüller space. The connected components of the orbit-type loci defined by the full determinant-one stabilizers form a complex Whitney stratification. The projection to Teichmüller space is a holomorphic submersion on every stratum. Each stratum carries a canonical relative holomorphic symplectic form. These forms determine a vertical holomorphic Poisson bracket on the reduced structure sheaf, whose symplectic leaves are the connected orbit-type strata in the fibers. On each fiber, the Hitchin–Kobayashi correspondence is biholomorphic on every stratum and identifies its hyperkähler structure. The harmonic representatives and vertical hyperkähler tensors vary smoothly along the strata of the total space.

We prove that every $n$-point set in the plane has a two-coloring with discrepancy $O(n^{1/4})$ for all triangles. This improves the previous bound $O(n^{1/4}\sqrt{\log n})$ and matches the classical lower bound.

For a module \(M\) over a cocommutative Hopf algebra \(\mathscr A\), we define extensive amenability by amenability of its symmetric algebra as a module over \(\operatorname{Sym}(M)\#\mathscr A\). Using the author's coalgebraic rounding and quotient theorems, we prove that nonzero extensively amenable modules are amenable, that every module over an amenable Hopf algebra is extensively amenable, and that extensive amenability is preserved and reflected by short exact sequences. For permutation modules this definition agrees, over every field, with extensive amenability of group actions. A final section gives the modifications for exterior algebras and establishes the comparison between the two definitions in several cases.

Raedschelders, Špenko and Van den Bergh proved that the Plücker coordinate ring $C_n$ of the Grassmannian $\operatorname{Gr}(2,n)$ has finite Frobenius representation type when the characteristic $p$ satisfies $p\ge\max\{n-2,3\}$, and they determined the indecomposable summands of its Frobenius pushforwards up to nonzero multiplicity. We give nonrecursive finite formulas for every entry of the Frobenius multiplicity matrix and prove that each entry is a polynomial in $p$ of degree at most $2n-3$. Consequently the $F$-signature of $C_n$, and the asymptotic proportion of every indecomposable summand, is a single rational function of $p$ throughout the characteristic range. Its limit as $p\to\infty$ is the leading coefficient of the first free multiplicity, which we evaluate in closed form through Bernoulli numbers. For $\operatorname{Gr}(2,4)$ we find $s_p(C_4)=(13p^2+8)/(5(3p^2+2))$, and we calculate the analogous rational functions for $\operatorname{Gr}(2,5)$ and $\operatorname{Gr}(2,6)$ with computer assistance. We also construct the full characteristic polynomial from the Riemann-Roch weights and two residual matrices whose entries have degree at most $n-1$ in $p$. In the sequel, we use this work to show rank-two determinantal rings have FFRT, and to calculate their $F$-signatures.

We propose a pluripotential-theoretic framework for studying finiteness questions for polarized Calabi–Yau manifolds. The central idea is to use global \(m\)-Hessian capacities as a quantitative intermediate between complex potential theory and global geometric boundedness. We formulate a chain of uniform estimates connecting \(m\)-Hessian capacity, volume–capacity inequalities, capacity–perimeter estimates, Sobolev bounds, and non-collapsing of the associated Ricci-flat Kähler metrics. Under suitable regularity assumptions, these estimates lead to uniform diameter and curvature control and hence to metric compactness. We then describe the algebraic part of the argument. Uniform projective embeddings with bounded degree lead, through the Macaulay–Gotzmann theory, to only finitely many possible Hilbert polynomials and hence to a finite collection of Hilbert schemes. Ehresmann's fibration theorem then converts boundedness of the smooth algebraic families into finiteness of diffeomorphism and topological types. The resulting framework isolates the main analytic and algebraic bottlenecks in a potential-theoretic approach to Calabi–Yau finiteness. In particular, the capacity–perimeter estimate and the derivation of uniform algebraic embedding data from the preceding metric estimates constitute the essential steps requiring further development. Thus the paper provides a structured program linking complex Hessian potential theory with geometric and algebraic boundedness, rather than assuming that these implications are automatic.

Let $z_1,\ldots,z_5\in\mathbb C$ satisfy $\sum_{j=1}^5|z_j|^2=5$. We prove the sharp inequality \[ \prod_{1\le i<j\le5}|z_i-z_j|^2\le 5^5, \] with equality precisely for a regular pentagon on the unit circle, up to rotation and permutation. This settles the remaining five-point case of the discriminant problem considered by Mordell in 1960. The proof first identifies a maximizer with a normalized relative equilibrium of five identical planar point vortices. We then give an independent exact classification of the corresponding stationary equations. The main algebraic step proves that every collision-free physical solution of the normalized stationary equations is reflection symmetric; it is obtained from a resultant construction and exact Gröbner-basis elimination over $\mathbb Q$. The reflection-symmetric equations have exactly five physical shapes, and an exact discriminant comparison selects the regular pentagon. All symbolic eliminations, Sturm counts, and interval inequalities are reproduced by an accompanying verification script using rational arithmetic. As consequences, the same configuration gives the Gaussian weighted Fekete set and the global mode of the five-particle complex Ginibre density after the natural rescaling.

Whether a forced-oscillation source can be uniquely localized depends jointly on the available measurements and the candidate intervention dictionary. This paper considers a single unknown constant-amplitude sinusoid acting through one of physical intervention channels. Because its amplitude and phase are unknown, each candidate harmonic response is observable only up to a nonzero complex scalar and therefore defines a projective ray in measurement space. A necessary-and-sufficient condition is derived for exact localization, together with a weighted nearest-ray locator and a deterministic recovery bound based on projective separation. The paper proposes a framework distinguishing four mechanisms of source localization failure: mechanism mismatch, feature-projection loss, structural nonidentifiability, and poor conditioning or model error. Numerical studies on the Kundur two-area system illustrate well-separated recovery, mechanism-dependent terminal decisions, measurement-induced ambiguity, and the sensitivity of nearly collinear signatures to model perturbations. Then, IEEE–NASPI Contest models are used to further examine broad candidate dictionaries, terminal-feature source coverage, and ambiguity removal through measurement augmentation. The results show that correctly locating the source bus does not by itself establish unique identification of the internal forcing channel or robustness to measurement and model uncertainty.

Let $\Gamma<\mathrm{Isom}(\mathbb H^n)$, $n\geq2$, be a cocompact lattice containing a convex cocompact codimension-one subgroup in the sense of Sageev. We prove that every finitely supported admissible random walk on $\Gamma$ has hitting measure singular with respect to Lebesgue measure on $\partial\mathbb H^n$. The proof extends the method of Kosenko–Tiozzo, replacing Fourier analysis for a cyclic subgroup by a von Neumann dimension argument that also applies to nonabelian subgroups. As corollaries, we prove the singularity conjecture of Kaimanovich and Le Prince for cocompact hyperbolic lattices admitting a proper cocompact cubulation, cocompact Kleinian groups, and cocompact hyperbolic lattices with totally geodesic sublattices of codimension one. In particular, our result covers all cocompact hyperbolic reflection groups, cocompact arithmetic lattices of simplest type and cocompact nonarithmetic lattices arising from the hybrid and inbreeding constructions.

Given multiple uses of an unknown quantum channel, we determine whether it is a specified non-mixed-unitary channel or belongs to the set of mixed-unitary channels. Formulating this as a composite channel hypothesis testing problem, we characterize the Stein exponents achievable by parallel strategies under progressively weaker restrictions on probe states and auxiliary memory. In particular, we consider block-i.i.d. probes, which allow arbitrary correlations within blocks of fixed size while remaining i.i.d. across different blocks, and derive finite-letter expressions of the corresponding Stein exponents. Varying the block size, which interpolates between fully i.i.d. and arbitrary probes, together with further restrictions on intra-block correlations and access to auxiliary memory, results in a multifaceted hierarchy. We establish several strict separations within this hierarchy. Without auxiliary memory, we prove that fully i.i.d. probes yield a vanishing Stein exponent for every unital non-mixed-unitary channel, while blocks of three product probes suffice to obtain a strictly positive exponent for the qutrit Werner-Holevo channel. For block size two, although product probes seem to be insufficient for $O(3)$-covariant channels, an entangled probe achieves a strictly positive exponent for the qutrit Werner-Holevo channel, even though every maximally entangled probe fails. In contrast, access to auxiliary memory makes fully i.i.d. probes sufficient by yielding a strictly positive exponent for every non-mixed-unitary channel, even without requiring input-reference entanglement, and this exponent admits a lower bound determined by the diamond-norm distance from the mixed-unitary set. Moreover, for odd-dimensional Werner-Holevo channels, we find that this exponent is infinite, with every full-Schmidt-rank pure state being optimal.

We derive the half-space KPZ equation as a continuum limit from a general class of Ginzburg-Landau SPDEs under weak nonlinearity scaling. To our knowledge, this is the first half-space universality result for the KPZ equation beyond integrable models (and their perturbations).

We show that input-to-state stability (ISS) and integral input-to-state stability (integral ISS) with respect to the space of essentially bounded functions are equivalent properties for linear systems. The proof combines recent results on Orlicz-admissibility and a duality result due to the authors. As a direct consequence, we show that, given an $L^\infty$-admissible control operator, the mild solutions of the linear system are continuous, resolving a question by G.\ Weiss.

We apply Decoded Quantum Interferometry (DQI) to sample from the Gibbs measures of classical Ising spin Hamiltonians. We show that this Gibbs sampling problem reduces to a quantum decoding problem, and the temperature achievable by DQI is determined by the performance of decoding algorithms. We then focus on the task of Gibbs sampling for classical Ising $k$-spin glasses (or Max-$k$-XORSAT) on random Erdős-Rényi hypergraphs with average degree $D\ge k$. In a temperature range beginning asymptotically at the predicted dynamical phase transition, $\beta_{\rm dyn}(k,D) = \sqrt{(2\ln k)/D}\times [1+o_{k\to\infty}(1)]$, we show that shattering and disorder chaos form a topological barrier that obstructs many algorithms, including Glauber dynamics and any algorithm whose output distribution is "stable" under perturbations of the input. In contrast, we prove that this barrier can be broken both by a classical algorithm based on Prange's method, and by DQI equipped with a quantum decoder. For example, when $D=\alpha k$ with fixed $\alpha>1$, both Prange's algorithm and DQI can sample at any inverse temperature $\beta < \tanh^{-1}(1/\alpha)$ for sufficiently large $k$, well beyond the dynamical threshold $\beta_{\rm dyn} \sim \sqrt{2\ln k / (\alpha k)}$. Therefore, our results show that DQI can overcome topological barriers that obstruct stable algorithms.

We study fast numerical methods for the Poisson equation on a disk within the FFTRR (Fast Fourier Transform Radial Recurrence) framework, which is built on Green's function representations. Classical FFTRR schemes apply FFTs in the azimuthal variable and evaluate mode-by-mode radial recurrences, achieving a complexity of \(O(MN\log N)\) on an \(N\times M\) uniform grid. However, they require a uniformly spaced azimuthal mesh of \(N\) points. In this work we develop a Nonuniform (NUFFTRR) solver that admits nonuniform grids in both the radial and azimuthal directions while retaining the favorable structure of the original FFTRR formulation. The azimuthal analysis-synthesis step is implemented using either a dense NUDFT least-squares solver or one of two NUFFT-based iterative schemes: a Toeplitz solver using circulant-preconditioned conjugate gradients (PCG), and a preconditioned conjugate gradient for least squares (PCGLS) solver with Pipe–Menon density compensation. These yield azimuthal complexities \(O(N^3 + MN^2)\) for the NUDFT variant and \(O(K_{\mathrm{iter}} MN\log N)\) for the NUFFT-based variants on an \(N\times M\) grid and Krylov iteration count \(K_{\mathrm{iter}}\). Numerical experiments on nonuniform meshes demonstrate that the proposed method is robust, spectrally accurate in the azimuthal variable, and competitive in runtime with existing fast Poisson solvers. We make use of vectorization and batched BLAS/GPU-accelerated linear algebra operations to eliminate explicit loops while also formulating azimuthal and radial steps entirely in terms of dense array operations, FFTs, and NUFFTs, allowing for straightforward GPU acceleration. The implementation is released as an open-source Python package at https://github.com/CharliePyle4/NUFFTRR_Poisson, and its methodology can be extended directly to related elliptic problems such as the Helmholtz equation.

Stochastic approximation provides a general framework for online estimation and optimization. Statistical inference based on the resulting estimates requires understanding their fluctuations around the target. For Polyak–Ruppert averaging, functional central limit theorems describe the normalized cumulative estimation errors through a Brownian limit. However, weak convergence alone does not determine how quickly the distribution of this process approaches that limit. We establish a quantitative functional central limit theorem for nonlinear stochastic approximation with polynomially decreasing step sizes and martingale-difference noise. Under suitable regularity and moment conditions, we derive an explicit finite-sample bound on the Prokhorov distance between each fixed scalar projection of the normalized partial-sum process and its Brownian limit. The bound reveals a step-size tradeoff: faster step-size decay reduces the contribution of the nonlinear remainder but increases that of the smoothing induced by the recursion. To assess the sharpness of the upper bound, we develop four lower-bound constructions, each designed to isolate one source of error. They show that covariance stabilization, finite-moment noise, algorithmic smoothing, and nonlinearity can each separately limit the Brownian approximation rate of the SA path.

We develop a spectral theory for dynamical large deviations in non-Markov jump processes and non-Markov chains, whose dynamics depends on the past through state- and jump-dependent empirical observables. We demonstrate that a multiscale Wentzel-Kramers-Brillouin-Jeffreys (WKBJ) Ansatz separates fast configurational relaxation from slow memory evolution, reducing the Feynman–Kac equation for occupation and flux statistics to an eigenvalue problem for a new tilted operator coupled to Hamilton–Jacobi characteristics. This provides a computationally efficient framework for quantifying fluctuations in a broad class of non-Markovian systems. We illustrate our general results with a bistable self-induced East model.

Low-depth syndrome extraction for Calderbank-Shor-Steane (CSS) quantum low-density parity-check codes can be formulated as a proper ordered edge-coloring problem subject to quantum parity constraints. A proper edge-coloring of the CSS Tanner graph ensures that each data or ancilla qubit participates in at most one two-qubit gate per layer, but does not guarantee a valid interleaving of the X- and Z-check measurements as for every overlapping X/Z check pair, the number of shared data qubits on which the X interaction precedes the Z interaction must be even. The minimum number of colors in a proper ordered edge-coloring satisfying the quantum parity constraints equals the minimum two-qubit depth when each stabilizer check is measured with a single ancilla. We introduce local automorphism-aware syndrome compilation (LocalASC), which reduces the constraint system to edge-orbit variables under a subgroup of the Tanner graph automorphisms and lifts each feasible orbit assignment to the full graph. Although the $6$-layer degree lower bound is unattainable for the published weight-$6$ IBM bivariate bicycle codes, we show that this is not universal among two-block CSS codes. Among code instances for which the maximum check weight equals the maximum Tanner graph degree, LocalASC finds depth-optimal syndrome-extraction schedules for several two-block CSS codes with odd component weights, including instances with unequal odd weights. We also obtain lower-bound-saturating syndrome-extraction schedules for several quantum Tanner codes satisfying the same degree condition. To obtain the subgroups used by LocalASC without computing the full automorphism group of the Tanner graph, we construct translation subgroups for two-block group-algebra CSS codes over abelian groups. For quantum Tanner codes, we give conditions under which square-complex symmetries extend to Tanner graph automorphisms.

The Kerr stability conjecture has been proved in the slowly rotating case, i.e., $|a|\ll m$, in the sequence of works \cite{KS-GCM1} \cite{KS-GCM2} \cite{KS:Kerr} by Sergiu Klainerman and the author, \cite{GKS22} by Elena Giorgi, Sergiu Klainerman and the author, and \cite{Shen} by Dawei Shen, and extended in \cite{Sze}, by the author, to the full subextremal range $|a|<m$, thereby completing the proof of the Kerr stability conjecture. The proof in \cite{Sze} crucially relies on the two companion papers \cite{MaSz24} \cite{MaSz26} by Siyuan Ma and the author, in which we prove energy-Morawetz estimates respectively for the scalar wave equation and for Teukolsky equations on perturbations of Kerr with $|a|<m$. In addition, two results in \cite{Sze}, concerning the derivation of the Teukolsky wave-transport system in perturbations of Kerr and energy-Morawetz estimates for Teukolsky in the setting of \cite{Sze}, are stated without proofs. The goal of the present paper companion paper to \cite{Sze} is to provide the proof of these two results.

In classical coding theory, the quest for explicit codes achieving list decoding capacity has been an important driving force. While random codes are easily shown to achieve capacity, an explicit construction was only discovered decades later in the seminal work [Guruswami and Rudra, STOC 2006]. In quantum coding theory, it is highly desirable that a code family be LDPC. While good quantum codes were known for decades, obtaining the additional LDPC property was elusive. In fact, only very recently that good quantum LDPC codes were discovered in a breakthrough work [Panteleev and Kalachev, STOC 2022]. In this context, a natural question is to ask for an explicit family of quantum codes achieving list decoding capacity while also possessing the important LDPC property. In this work, we provide (to the best of our knowledge) the first explicit constructions of quantum LDPC codes achieving list decoding capacity, namely, with a list decoding radius approaching the quantum Singleton bound with constant list sizes. Furthermore, we provide near-linear time (in the block-length) list decoding algorithms approaching capacity. Our explicit code construction are based on expander graphs via the quantum analogue of Alon-Edmonds-Luby (AEL) amplification [Bergamaschi, Golowich and Gunn, STOC 2024], and this enables the important LDPC property. Our efficient list decoding algorithms are obtained by generalizing the classical expander-based weak-regularity list decoding algorithms [Srivastava and Tulsiani, FOCS 2025] [Jeronimo and Singh, 2025] to suitable instantiations of quantum AEL.

Mutually unbiased bases (MUBs) describe quantum measurements for which certainty in one basis gives uniform outcomes in the others. Their maximum number remains unknown in dimensions that are not powers of a prime. We introduce an ansatz that, in many dimensions, allows us to construct more MUBs than have previously been found. Each basis in the ansatz consists of a diagonal phase matrix applied to a fixed unitary, which is a tensor product of Fourier matrices and, optionally, any real Hadamard matrix. This construction yields five MUBs in dimension 12, six in dimensions 48, 96, and 192, seven in dimensions 36 and 108, and ten in dimension 648. These bases can then be extended to exceed the tensor product bound, asymptotically, in every eighteenth dimension. Moreover, we show that Paley's real Hadamard matrix can be used to construct $q+1$ bases in dimension $d = q(q+1)$ for every prime power $q\equiv3\pmod4$. This count grows as $\sqrt d$ and cannot be exceeded by tensor products of smaller sets.

We describe hearts of strongly deflation-exact categories with kernels as localizations of categories of three-term complexes up to homotopy, without assuming admissibility of kernels. We construct a calculus of fractions and give explicit formulas for kernels and cokernels. For complete locally convex spaces, whose failure to be quasiabelian was established by Prosmans (2000), our description and its dual provide derived equivalent abelian models through two choices of a notion of exactness. For quasi-complete, sequentially complete and locally (a.k.a. Mackey) complete spaces, we show that the topologically exact sequences form the maximal deflation-exact structure, although these categories are not extension-closed in the category of locally convex Hausdorff spaces. Our results make them nevertheless accessible to homological algebra with respect to the induced notion of exactness. Further applications concern the quasiabelian category of bornological modules equipped with the non-maximal linear split exact structure.

We study exact sequences of representation categories of weak Hopf algebras over an arbitrary field. Given a sequence $A\overset{k}{\to} B\overset{\pi}{\to} H$, where $A$ and $B$ are weak Hopf algebras and $H$ is a Hopf algebra, we develop verifiable algebraic conditions on $k$ and $\pi$ under which there is an exact sequence $\mathrm{Rep}(H)\to\mathrm{Rep}(B)\to\mathrm{Rep}(A)$ of tensor categories in the sense of Bruguières and Natale (2011). Along the way, we develop a generalization of the restriction of scalars functor for maps $\pi:B\to H$ between associative algebras satisfying a weakened multiplicativity constraint depending on a relatively separable subalgebra $B_r\subseteq B$, as well as a theory of kernels and cokernels for weak Hopf algebras. We, in particular, find that the cokernel of a weak Hopf algebra homomorphism $k:A\to B$ always exists, is a Hopf algebra, and the cokernel map is surjective when $A$ is connected. We conclude by studying examples of such exact sequences built from groupoids, formal ribbon extensions of quasitriangular weak Hopf algebras, and cocycled crossed products of a Hopf algebra acting weakly on a weak Hopf algebra.

Disruptions can exhaust a supply chain network's capacity, yet outside capacity is hard to use: incumbent models are private, provider profiles are unstructured, and offers stay hidden until costly engagement. We formulate open capacity pooling, making network membership a disruption-response decision. The alternating direction method of multipliers (ADMM) coordinates incumbents without sharing models, and residual capacity gaps direct search over profiles indexed by a large language model (LLM). Verification reveals offers, reduced-cost screening admits them, and warm-started ADMM re-optimizes. The procedure is optimal if every eligible offer is revealed at exact prices, heuristic otherwise. Across 200 synthetic episodes, full-information opening recovers 24.6% of capacity-scarcity cost. With 40 contacts, coordination-directed need selection and LLM ranking capture 32.0% of this value, versus 4.7% for undirected, unranked contact. LLM reading of all profiles performs within five points of a complete structured registry and error-free extraction and finds four times as many compatible providers as keyword search among 10,000 records. What profiles omit is the exact capacity each provider's single offer covers, and requests for other capacity fail; registering offers in the same index raises captured value without a contact limit from 46.8% to 98.6%, keeping net value positive at every tested contact charge.

We uncover a connection between the classical limit of the Magnus expansion in quantum field theory and the Malvenuto-Reutenauer Hopf algebra of permutations. We study a cubic scalar theory describing a massive particle coupled to massless scalar quanta, which captures the propagator structure relevant to classical scattering in gravity and scalar QED. Using a Schwinger parametrisation of the massive propagators, we compute the classical limit of Magnus amplitudes at tree level in this theory. First, we prove that all hyperclassical contributions cancel at the level of the Schwinger proper-time integrand, before integration. Then, we show that the classical Magnus amplitude precisely matches expectations from worldline quantum field theory. Both results rely on cancellations of disconnected diagrams which we relate to the Hopf algebra, specifically to the action of the adjoint first Eulerian projector, which annihilates the shuffle products associated with disconnected contributions. Moreover, the worldline diagrams include generic directed-tree topologies, whereas the field-theory diagrams only include directed chains. The correspondence we establish between the two therefore leads to a new formula for generic Murua coefficients in terms of simpler directed chain coefficients. Finally, we observe a suggestive connection between Magnus amplitudes and the web-mixing matrices governing the exponentiation of multiple Wilson lines.

In algorithmic statistics a string x is explained by a finite set containing it, and Kolmogorov's structure function records the smallest such model at each level of complexity. Strong models, those computable from the data by a total algorithm, are essentially the cells of simple partitions, so a partition of {0,1}^n can be read as a hypothesis and the cell containing x as the model it assigns. We develop algorithmic statistics over symmetric partitions, the orbit partitions of groups acting on strings. The Galois connection between subgroups and partitions gives each ambient group G a lattice of symmetric partitions with canonical certificates, joins and meets. A set is a cell of a symmetric partition exactly when its setwise stabiliser in G acts transitively on it, so the resulting structure function is Kolmogorov's restricted to these G-homogeneous sets. With a symmetric sophistication, it measures which part of the regularity of x is symmetric. Under the full symmetric group, cells recover all models and cells of cheap partitions recover exactly the strong models, so normal and strange strings are characterised by symmetry. For GL(n,2) the homogeneous sets are the linearly homogeneous ones, whose XOR dependencies look the same from every point. The GL structure function of a nonzero x lies in a band between C(x) - alpha and n - alpha, and both edges are attained: some stochastic normal strings have simple structure invisible to linear symmetry, with sophistication near 0 but GL-sophistication near C(x). We coordinatise permutation groups by a Burnside ring element (type) and a permutation (placement). In these coordinates a linear hypothesis is determined by its type up to n^2 bits, and any space of symmetry hypotheses small enough to search is small enough to miss simple structure. This sets up learned search over orbit models, the subject of later papers in the series.

For positive integers $t$ and $q$ let $b_q(t)$ be the smallest integer $n$ so that any coloring of the edges of the complete bipartite graph $K_{n,n}$ with $q$ colors yields a monochromatic copy of $K_{t,t}$. We give an independent proof that $b_2(t)\le 128\cdot 2^t$ for every positive integer $t$. More generally, for $0< p\le 1/2$, every bipartite graph of edge density at least $p$, with both classes of size at least $128\cdot p^{-t}$, contains $K_{t,t}$. This gives $b_q(t)\le 128\cdot q^t$ for every integer $q\ge 2$ and a uniform consequence for Zarankiewicz numbers.

Let $E/\mathbb{Q}$ be an elliptic curve, and let $p$ be an odd prime of ordinary reduction for $E$, and assume that $E$ admits a rational $p$-isogeny. In this paper we prove Greenberg's conjecture on the vanishing of algebraic Iwasawa $\mu$-invariants of the Selmer groups attached to $E$ over the cyclotomic $\mathbb{Z}_p$-extension of the rational numbers. Via the Iwasawa Main Conjecture for elliptic curves at Eisenstein primes, we also confirm Stevens's conjecture on the behavior of analytic $\mu$-invariants.

Characterising open quantum dynamics requires identifying the environmental degrees of freedom that shape the system's evolution. The memory dimension, defined as the size of the smallest effective memory needed to reproduce this influence, quantifies the dynamically relevant environmental resources and provides a common basis for comparing different many-body environments. Here we introduce a pseudo-control protocol that encodes information about the memory dimension in an experimentally accessible interference matrix, whose rank certifies a lower bound on this dimension without direct access to the environment or full process-tensor tomography. Applied to quantum many-body environments, the protocol allows flexible adjustment of the interaction and interval times, revealing how these parameters, environmental dynamics, and system-environment interactions shape detectable memory. Our approach provides a new operational technique for characterising open quantum dynamics and probing the structure of system-environment interactions through their memory signatures.

We develop a resurgent transseries approach to mock theta functions and show that the associated Mordell–Appell integrals underlie their modular and resurgent structure. From these integrals, we recover the modular transformation laws, obtain uniqueness characterizations of the mock theta vectors, provide a canonical crossing of their natural boundary, and produce new mock theta functions. After representing the Mordell–Appell integrals as Laplace transforms of elementary resurgent functions, we rotate the Laplace contour to a Stokes line. Their Stokes phenomena and their modular transformation laws reproduce those of the associated unary series and, combined with our uniqueness results, those of the mock theta functions. Conversely, we regard these modular transformation laws as functional equations governing the mock theta vectors. For Ramanujan's order-$3$ pair $(f,\omega)$ and the distinguished mock theta vectors of orders $5$, $7$, and $11$, satisfying the full $SL(2,\mathbb Z)$ transformation laws, we prove that these functional equations uniquely determine a holomorphic solution in the unit disk under canonical minimal-growth normalization. This unique solution is precisely the classical mock theta vector. We show that the normalization is essential: for orders $5$, $7$, and $11$ we determine explicit nontrivial solutions of the homogeneous problem, yielding new mock theta functions with faster-growing coefficients. Finally, we give two intrinsic and natural constructions for crossing the natural boundary $|q|=1$. The first continues the modular functional equations and takes their unique holomorphic solutions on the other side. The second acts on the resurgent asymptotic series at the cusp: we replace $\tau$ by $-\tau$ and apply Écalle–Borel summation. We prove that the constructions agree, giving a canonical and explicit boundary crossing.

The 2-switch-degree $\text{deg}(G)$ of a graph $G$ is the number of 2-switches that can be performed on $G$; equivalently, it is the degree of $G$ as a vertex of the realization graph $\mathcal{G}(d)$ of its degree sequence $d$. We classify the prime graphs of 2-switch-degree at most 4, where a graph is prime if it is indecomposable with respect to the Tyshkevich composition and every vertex takes part in some 2-switch. From this classification we derive a sharp dichotomy that recovers the global shape of $\mathcal{G}(d)$ from a single one of its local degrees: if $d$ has a realization $X$ with $\text{deg}(X)=k\le3$, then $\mathcal{G}(d)$ is vertex-transitive and $k$-regular if and only if neither $T_{221}$ nor $\overline{T_{221}}$ is an induced subgraph of $X$. Moreover, for every $k\geq 4$ some prime graph of degree $k$ carries a 2-switch raising its degree to $2k-2$. As a further consequence, up to isomorphism there are only 10 realization graphs of prime graphs with degree at most 4.