Peer Revenue Fully funded

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 7 October

Probability

Notes on Kozma and Nitzan's proof of $\theta(p_c)=0$

We present a human intelligible proof of the conjectures of Kozma and Nitzan, that they used to show $\theta(p_c)=0$. The proof was recently found by AI, but was very poorly written. Our version is much shorter as it completely skips the horizontal term and its long estimate.

Probability

The Tutte embedding of tree-weighted planar maps converges to Liouville quantum gravity

Suppose $M$ is a planar map with a macroscopic boundary decorated by a spanning tree $T$, such that $(M,T)$ has been sampled from the critical Boltzman measure. We show that $M$ converges to a Liouville quantum gravity disk with parameter $\gamma=\sqrt{2}$ under the Tutte embedding as the length of the boundary of $M$ goes to infinity. Furthermore, conditioned on $(M,T)$, the simple random walk on $M$ converges to a planar Brownian motion modulo reparametrization of time.
Read the full abstract

Optimization and Control

An Optimal Second-Order Algorithm for Finite-Sum Optimization under Average Smoothness and Convexity

In this paper, we consider a finite-sum optimization problem, where the objective function is convex, the $n$ component functions are twice continuously differentiable and their Hessians are mean-square Lipschitz. Our contribution is twofold. First, we develop a stochastic algorithm, which requires $\tilde{\mathcal{O}}(n + n^{6/7}/\epsilon^{2/7})$ second-order oracle calls in expectation to find an approximate solution to the problem with the expected accuracy $\epsilon$. Second, we establish a lower complexity bound of $\Omega(n + n^{6/7}/\epsilon^{2/7})$ for any stochastic second-order algorithm satisfying a stochastic second-order version of the first-order linear span assumption, which is widely adopted in the optimization literature. Our lower and upper complexity bounds match up to logarithmic factors and thus resolve an important open question of establishing the optimal complexity of this problem class.
Read the full abstract

Complex Variables

Oka manifolds are ubiquitous

We prove that a holomorphic family of connected complex Lie groups is Oka if and only if its base is Oka. We establish the Oka property for moduli spaces of stable and parabolic vector bundles and characterize Oka minimal \(\delta\)-regular abelian fibrations over compact curves by the nonnegativity of their orbifold Euler characteristic. Strong dominability, analytic extension, and holomorphic descent also yield applications to mapping spaces, character varieties, and compactified Jacobians.
Read the full abstract

All authors Sicheng An, Yun-Heng Du, Bin Guo, Peng-Chao Wang, Song-Yan Xie

2610.10493 · 7 Oct · 44 pages. Substantially revised and expanded. Results on rationally connected manifolds and smooth hypersurface complements have been moved to the revised companion paper arXiv:2610.10475. This version focuses on applications to moduli spaces, Hilbert and Quot schemes, character varieties, and abelian fibrations

Differential Geometry

On Critical Dimensions for Compactness in the Boundary Yamabe Problem, II

We determine the sharp compactness ranges for the scalar-flat and minimal-boundary Yamabe problems on smooth compact manifolds of positive conformal type, excluding the conformal round hemisphere. For zero scalar curvature and positive constant boundary mean curvature, compactness holds through dimension $14$ for general boundary and dimension $21$ for umbilic boundary. For positive scalar curvature and zero boundary mean curvature, the corresponding upper dimensions are $14$ and $20$. Together with the noncompactness examples in Part I, these results identify the transition dimensions in both boundary classes. For positive scalar curvature, we also prove compactness through dimension eight for every fixed real boundary mean curvature, and obtain higher-dimensional ranges when this curvature is near zero or sufficiently large and positive. The proof combines scalar-correction estimates for the full conformal Fermi metric expansion with a geometric formula expressing the logarithmic coefficient of the corrected energy as a negative sum of squares.
Read the full abstract

All authors Liuwei Gong, Seunghyeok Kim, Monica Musso, Juncheng Wei

Numerical Analysis

A finite element exterior-to-interior reconstruction in the fractional conductivity inverse problem

We develop a regularized finite element method for the fractional conductivity equation, recovering the conductivity on an exterior observation region from noisy Dirichlet-to-Neumann measurements and using this reconstruction to determine the interior conductivity. Mesh-localized inputs and mass-lumped Tikhonov regularization discretize the exterior determination principle of Covi–Railo–Zimmermann (2026, Calc. Var. PDE). We prove exterior \(L^2\)- and \(L^\infty\)-convergence with error estimates, including the logarithmic correction at the critical Hölder exponent. The exterior reconstruction enables the Liouville reduction to the Calderón problem for the fractional Schrödinger equation. Separated measurements recover the interior potential, after which overlapping measurements determine the exterior potential tail. Together with the recovered exterior conductivity, the tail supplies the exterior Cauchy data for a Tikhonov-regularized finite element least-squares continuation. We prove \(H^s\)-convergence of the transformed conductivity and \(L^2\)-convergence of the interior conductivity, together with logarithmic state-bias and conductivity error estimates for full observation spaces. The admissible reconstructions remain uniformly positive and bounded. We present one- and two-dimensional numerical experiments illustrating the accuracy of the exterior and interior reconstructions and their sensitivity to measurement noise and discretization.
Read the full abstract

Probability

Random permutations using GEPP

Gaussian elimination with partial pivoting (GEPP) remains the most widely used solver for dense linear systems $A \mathbf x = \mathbf b$ for $A \in \mathbb C^{n\times n}$. We study the permutation $\pi = \pi(A)$ that arises in the GEPP factorization $PA = LU$, encoded by the permutation matrix factor $P = P_\pi$. When the input matrix is random, so is $\pi$. For random scalar butterfly matrices of size $2^n$ (a recursively defined family originally introduced to eliminate the need for pivoting altogether), we give the exact GEPP factorization and fully classify the induced permutation as an element of a $2$-Sylow subgroup of $S_{2^n}$ contained in the separable permutations. Moreover, the uniform-angle model induces the uniform distribution on this subgroup. For the GOE, GUE, and iid Bernoulli models, the induced permutation is never exactly uniform for $n \ge 2$. We give the precise rate of departure from uniformity at the leading pivot for the GOE and GUE, and give evidence that this non-uniformity vanishes asymptotically in the permuton sense. In contrast, for banded random matrices of sublinear bandwidth, including the tridiagonal $\beta$-Hermite ensembles, the induced permutation converges to the diagonal permuton. We further show that the resulting pivot probabilities are sensitive to implementation choices: standard LAPACK routines compare complex pivot candidates using the $\ell^1$ rather than $\ell^2$ norm, changing the GUE(2) pivot probability from $1/\sqrt3$ to $2/3$. Together these results establish a new connection between random matrix theory and permutation combinatorics through numerical linear algebra.
Read the full abstract

Probability

The circle packing and Riemann uniformization embedding of the mated-CRT map converges to Liouville quantum gravity

We prove that the mated-CRT map converges to Liouville quantum gravity under circle packing and the Riemann uniformization embedding. The proof is based on our recent work on circle packing and the Riemann uniformization embedding for random planar maps in ergodic-scale free environments, comparison of circle packing in different domains and several existing and new estimates for the mated-CRT map. As an intermediate step, we prove an extension of He and Schramm's result (1996) on convergence of circle packing maps to conformal maps to global uniform topology in several settings. The latter results are of independent interest and will be applied in our subsequent work on the convergence of spanning tree weighted planar maps to $\sqrt{2}$-LQG under circle packing and Riemann uniformization embedding.
Read the full abstract

Functional Analysis · Cross-listed from cs.CC

Primal/Dual Method for the Grothendieck Constant

We determine the hundredths digit of the real Grothendieck constant by proving $1.773 \leq K_G \leq 1.7799$. Furthermore, numerical heuristics suggest the estimate $K_G \approx 1.779$. We start by simplifying the Gaussian duality theory of $K_G$, based on Hermite projection games and Krivine rounding schemes. The bounds are obtained by a heuristic primal/dual search for these objects, followed by rigorous certification of their values. The search and certification are performed using AI tools, and in particular the rigorous certificates are very large (analytical reductions to thousands of numerical inequalities).
Read the full abstract

Complex Variables

A Local Approximation Characterization of Oka Manifolds

We characterize Oka manifolds by the local approximation property (LAP), a planar approximation operation that preserves holomorphic dependence on prescribed parameter polydiscs. We prove that LAP yields convex approximation in every source dimension and propagates across sets of zero $(2n-1)$-dimensional Hausdorff measure in an $n$-dimensional target. Consequently, strong dominability characterizes Oka manifolds, convex approximation in the target dimension suffices, the Oka property is local in the Euclidean topology, and it descends under surjective holomorphic maps. Local families of entire curves give geometric applications: smooth projective rationally connected manifolds are Oka, and deleting an algebraic subset of codimension at least two from any such manifold preserves the Oka property. Structure theorems further show that compact Kähler manifolds with nonnegative holomorphic sectional curvature or nef tangent bundle are Oka. Finally, the complement of a smooth degree-$d$ hypersurface in $\mathbb{P}^n$ is Oka exactly when $d\leq n+1$.
Read the full abstract

All authors Sicheng An, Yun-Heng Du, Bin Guo, Peng-Chao Wang, Song-Yan Xie

Probability · Cross-listed from cs.DS

Fast Almost-Uniform Sampling of Random $k$-SAT Solutions

We study approximately uniform sampling of satisfying assignments from random $k$-SAT formulas. For every sufficiently large $k$ and density $0 < \alpha \le 2^k/k^{16}$, we prove that, with high probability over the formula, there is a sampler whose output distribution is within total variation distance $\varepsilon$ of the uniform distribution on satisfying assignments and whose expected running time is at most $(nk(\alpha+1)/\varepsilon)^C$, for a universal constant $C$. Our algorithm improves the counting and sampling algorithms obtained by Chen, Lonkar, Wang, Yang, and Yin (STOC 2025) at the density $2^k/\operatorname{poly}(k)$ with running time $(n/\varepsilon)^{\operatorname{poly}(k,\alpha)}$. Our result achieves this density region for sampling with a polynomial degree independent of both the width and the density. Our algorithm separates a high-degree core from the remaining variables, and combines a recursive sampler for the residual formulas with approximate block heat-bath updates on the core. We adapt the recursive insertion-chain framework of Jain, Mizgerd, and Pham (2026) from $2$-trees to ordinary connected violation sets. Expansion and random literal signs yield uniform moment bounds for the resulting correlated lists across all residual formulas, allowing the signed-flow analysis to give a universal polynomial running-time degree. A polymer expansion and an exploration bound establish a polynomial spectral gap for the core dynamics.
Read the full abstract

Mathematical Physics

Iterated Graph Systems (II): Bernoulli percolation and critical-exponent universality classes on hierarchical lattices

We study Bernoulli percolation and its universality classes on hierarchical lattices generated by edge iterated graph systems (EIGS). By examining eight critical exponents, we prove that no finite family of substitution-multiplicative dimensions completely determines universality, providing a rigorous proof of the failure of dimension-based universality discussed by Hauser and Saxena [Phys. Rev. B 34 (1986), 8193-8195]. Although the six exponentials theorem provides number-theoretic criteria for scale commensurability, we further disprove the conjecture that critical-exponent universality requires commensurate discrete renormalisation scales.
Read the full abstract

Information Theory

Polarforming for MIMO Covert Communications

Covert communication conceals wireless transmission activity, but conventional multi-antenna designs rely mainly on spatial beamforming and can be constrained by limited spatial degrees of freedom. This paper investigates polarization-reconfigurable antenna (PRA)-aided multiple-input multiple-output (MIMO) covert communication, where Alice and Bob perform transmit and receive polarforming, respectively, and Willie uses a vertically polarized antenna for radiometric detection. We jointly optimize the transmit covariance matrix and the transmit and receive phase shift vectors to maximize Bob's achievable rate under the covertness and transmit power constraints. Under Gaussian signaling, perfect polarized channel state information, and known noise power at Willie, we derive his optimal radiometric threshold and exact minimum detection error probability (DEP) for a finite observation length, and convert the DEP requirement into a deterministic constraint on his received signal power. We further prove that, for a fixed transmission design, positive signal leakage becomes detectable as the observation length tends to infinity. To solve the design problem for a finite observation length, we develop an alternating optimization (AO) algorithm with a generalized water-filling covariance update and closed-form phase updates. Numerical results validate the exact DEP analysis and the rapid convergence of the proposed algorithm. Compared with the sufficient divergence-based condition, the exact covertness constraint permits a $0.99$–$1.12$~dB higher received signal-to-noise ratio (SNR) at Willie, while joint transmit and receive polarforming provides a rate gain of up to $53.8\%$ over the considered benchmark schemes.
Read the full abstract

All authors Xin Xie, Jinpeng Xu, Yihang Huang, Li Zhou, Zhaolong Ning

Differential Geometry

Sharp dynamical isoperimetric principle for mean curvature flow

In this paper, we establish a sharp dynamical isoperimetric principle for weak mean curvature flow. We prove that, among weak mean curvature flows with fixed area of initial smooth closed hypersurfaces, the standard smoothly shrinking spherical mean curvature flow uniquely maximizes the extinction time. More precisely, for the level set flow $K_t$ starting from the boundary of a smooth bounded domain $\Omega\subset\mathbb R^{n+1}$, as well as for the integral Brakke flow $\{\mu_t\}$ with initial Radon measure $\mu_0=\mathcal H^n\llcorner\partial\Omega$, we establish the corresponding optimal extinction time estimates \begin{equation*} T_ext(\Omega),\, T^B_ext(\Omega) \leq \frac{1}{2n} \left(\frac{P( \Omega)}{|{\mathbb{S}^n}|}\right)^{\frac{2}{n}}, \end{equation*} where $P(\Omega)$ is the perimeter of $\Omega$ representing the area of $\partial \Omega$, and the equality holds if and only if $\Omega$ is a round ball and the flow is the standard multiplicity-one smoothly self-shrinking round sphere. In particular, we obtain the sharp $L^p$-estimates for the arrival time function of a smooth bounded mean convex domain. In addition, we also establish the sharp isoperimetric inequality for the parabolic measure of the space-time track filling $X$ of outward minimizing level set flow starting from the boundary of a smooth bounded domain $\Omega\subset \mathbb R^{n+1}$: \begin{equation*} \mathcal H_{\mathrm{par}}^{n+2}(X) \leq \frac{\pi} {2n(n+2)^2|{\mathbb{S}^n}|^{{\frac{2}{n}}}} P(\Omega)^{\frac{n+2}{n}}, \end{equation*} where the equality holds if and only if $\Omega$ is a round ball and the flow is standard smoothly shrinking round sphere.
Read the full abstract

All authors Beomjun Choi, Wenkui Du, Seung Chul Park, Junseo Youn

Analysis of PDEs

Asymptotic Stability of Domain Walls for One Dimensional Schrödinger Map with Dzyaloshinskii-Moriya Interaction

In this paper, we study the long time dynamics of small perturbations of static domain walls in weighted Sobolev spaces for the one dimensional Schrödinger map with constant Dzyaloshinskii-Moriya interaction. The perturbation equation contains derivative nonlinearities, and its linearized operator has a threshold resonance. The results are twofold. (i) We prove the asymptotic stability of the domain wall modulo the translation and rotation symmetries. More precisely, the corresponding modulation parameters converge as time tends to infinity, while the radiation decays at the sharp rate $t^{-1/2}$. (ii) We prove that the radiation exhibits modified scattering, with an explicit logarithmic phase correction generated by the long range cubic interaction. The proof develops geometric reduction to overcome the loss of derivatives and exploits structural cancellations in the nonlinear interactions.
Read the full abstract

Combinatorics · Cross-listed from econ.TH

Risk-minimizing GUE-implementations of truthful reporting in a Dynamic Social Choice Problem

The Guaranteed Utility Mechanism (GUM) was introduced to implement efficiency in Guaranteed Utility Equilibrium (GUE) in dynamic social choice problems. We show that this mechanism also has a previously unknown connection to risk minimization. Fixing an efficient decision policy, we study variance-minimizing budget-balanced transfer rules in the class of GUE-implementations of truthful reporting. A symmetrized version of GUM (sym-GUM) minimizes the sum of the agents' utility variances under truthful reporting when there is no public state. When a public state is present, a slight modification of this rule yields the minimizer for the same objective. Sym-GUM, however, does not minimize transfer risk. The minimizer for that problem is instead the symmetrized version of a closely related GUM-like transfer rule. In both problems, the minimizing truthful total transfers are unique up to agent-specific constants summing to zero and events of probability zero.
Read the full abstract

Number Theory

$p$-class groups in the cyclotomic $\mathbb{Z}_p$-extension of imaginary quadratic fields

We study the structure of the $p$-class group of the first layer of the cyclotomic $\mathbb{Z}_p$-extension of an imaginary quadratic field where $p$ is non-split. We obtain restrictions on the growth of the cyclic factors from the base layer to the first layer; in particular, when the $p$-rank remains unchanged, each cyclic factor grows by exactly one power of $p$. We show that in a large number of cases the Iwasawa $\lambda$-invariant is completely determined by the $p$-rank of the first layer itself. Finally we use a Cohen-Lenstra-Martinet type philosophy to study the probability distribution of Iwasawa lambda invariants of the first layer when the base layer has cyclic $p$-class group.
Read the full abstract

All authors Somnath Jha, Debanjana Kundu, H. Laxmi, Lawrence C. Washington

Algebraic Geometry

Combs and complex structures on the six-sphere

We construct complex structures on the six-sphere $S^6$ with arbitrarily large local Kuranishi dimension. As a corollary, we find the same phenomenon holds for the smooth manifold underlying complex projective 3-space $\mathbb{P}^3$.

Complex Variables

Gromov hyperbolicity, finite type, and subellipticity on $\mathbb{C}$-convex domains

In this article, we study three properties of a bounded $\mathbb{C}$-convex domain $\Omega \subset \mathbb{C}^n$, $n \geq 2$, with smooth boundary, namely Gromov hyperbolicity of its Kobayashi distance, finiteness of the D'Angelo type of $\partial \Omega$, and the existence of a subelliptic estimate for the $\bar{\partial}$-Neumann problem on $(0,1)$-forms. We prove that these three properties are equivalent. The subelliptic estimates are obtained without Catlin's construction of plurisubharmonic weights. Our weights are explicit bounded transforms of the logarithm of the Bergman kernel. A single quantity controls all three properties, namely the radius of the largest disc through a point of $\Omega$ in a given complex direction. Gromov hyperbolicity forces a power bound for these radii. Finite type gives the power $1/M$, where $M$ is the maximal type, and this power cannot be improved. A subelliptic estimate gives a power bound through the canonical solution operator applied to normalized Bergman kernels. The analytic estimates need no boundary regularity. On a bounded pseudoconvex domain, a bounded weight whose induced Hessian on $(0,q)$-forms is bounded below by a negative power of the boundary distance gives a Sobolev estimate for the extension by zero of $(0,q)$-forms, and also eigenvalue bounds for the $\bar{\partial}$-Neumann operator. On smooth $\mathbb{C}$-convex domains of finite type, we show that the directional expansion exponent, the normal expansion exponent, and the supremum of the subelliptic gains are all equal to $1/M$. Next, we prove that on a Lipschitz $\mathbb{C}$-convex domain whose Kobayashi distance is Gromov hyperbolic, the Euclidean boundary and the Gromov boundary are bi-Hölder equivalent. Finally, we give a Hardy-type criterion for Gromov hyperbolicity of collar metrics.
Read the full abstract

Mathematical Physics · Cross-listed from cs.DS

Color Coding for the Sherrington-Kirkpatrick Model

We give a polynomial-time algorithm for approximating the partition function of mean-field mixed $p$-spin models to arbitrarily high accuracy throughout the second-moment regime. This improves the quasipolynomial-time algorithm of Bencs, Huang, Lee, Liu, and Regts (arXiv:2507.15616) and answers their open question. In particular, our result covers the entire replica-symmetric regime of the Sherrington–Kirkpatrick model. The algorithm is deterministic, runs in time polynomial in $n$ and $1/\varepsilon$, and succeeds for every typical realization of the disorder. Our main technical contribution is a new algorithmic application of color coding to the classical high-temperature expansion introduced by Aizenman, Lebowitz, and Ruelle in their study of fluctuations of the Sherrington–Kirkpatrick partition function. We combine this approach with the zero-freeness established by Bencs et al. (arXiv:2507.15616) to convert additive approximations into multiplicative ones.
Read the full abstract

All authors Alina Harbuzova, Saba Lepsveridze, Mahbod Majid, Ankur Moitra

Combinatorics

The replica symmetric solution for hypergraph independent sets in the critical regime

We prove a variational formula for the logarithmic asymptotics of a non-existence probability in a broad class of combinatorial problems such as avoiding cliques in random graphs and $k$-term arithmetic progressions in random subsets of integers. These results follow from a formula for the probability that a binomial random subset of the vertices of a locally sparse hypergraph is an independent set. The formula holds throughout the critical regime, interpolating between the regimes in which Janson's inequality and the method of hypergraph containers give the respective asymptotics. The formula is the replica-symmetric Bethe free energy formula from statistical physics applied to a hypergraph hardcore model. The proof uses two new techniques. The first, for the upper bound, involves revealing a small `window' of a random independent set and then applying entropy methods. The second, for the lower bound, involves the analysis of a random greedy algorithm guided by a Belief Propagation fixed point. In the case of avoiding cliques in random graphs, the variational formula can be expressed as an optimization problem over graphons. Moreover, typical random graphs conditioned on not containing $K_r$, when suitably normalized, approach the set of optimizing graphons in cut distance.
Read the full abstract

All authors Matthew Jenssen, Will Perkins, Aditya Potukuchi, Michael Simkin

Differential Geometry

Compact toric Einstein four-manifolds

This is a continuation of our previous paper on toric gravitational instantons. We develop a systematic theory of compact simply-connected Einstein four-manifolds with toric symmetry. Applications include (1) The construction of simply connected positive Einstein four-manifolds with arbitrarily large $b_2$. Our method is based on local gluing combined with a global virtual counting argument. The key idea involves a particular design of rod structures to enable a gluing construction and restrict possible degenerations. (2) A topological characterization of algebraically special toric Einstein metrics. This uses special curvature identities for $W^+$ in the toric setting. (3) Uniqueness, up to scaling and isometry, on toric four-manifolds admitting algebraically special Einstein metrics. The proofs uses a variational study of the Einstein–Hilbert functional. (4) Diffeomorphism classification of compact toric Einstein four-manifolds in terms of an improved Hitchin-Thorpe inequality $\chi\geq3|\tau|$. In particular, our construction recovers all the classical toric Einstein metrics, including the Page and Chen–LeBrun–Weber metrics, starting from the round sphere through moduli spaces of conical Einstein metrics.
Read the full abstract

Combinatorics

A counting version of Petersen's $2$-factor theorem

A classical result of Petersen states that every regular graph of even degree has a $2$-factor. We prove that every $n$-vertex $2r$-regular simple graph contains at least $\left((1 + o_r(1))\frac{2r}{e}\right)^n$ distinct $2$-factors. This improves the previously known lower bound $\left((1 + o_r(1))\frac{r}{e}\right)^n$ by a factor of $2^{(1 + o(1))n}$ and is asymptotically tight for large $r$. As a direct consequence, we determine asymptotically tight bounds on the number of $2$-factorizations of a given $2r$-regular simple graph for every sufficiently large $r$.
Read the full abstract

Numerical Analysis

A hat function based positive contact discontinuity capturing Boltzmann scheme

The suitable moments of the Maxwell velocity distribution function recover the conserved variable and flux vectors of the Euler equations of gas dynamics. However, the Maxwellian has infinite support in velocity space, which poses challenges for the numerical analysis of kinetic schemes based on it. Although Maxwellian is a natural choice, it is not the only distribution function that preserves these key moments. In his seminal paper, Perthame (1990) introduced a compactly supported hat function as an alternative. This paper presents the formulation and analysis of a contact discontinuity capturing Boltzmann scheme based on peculiar velocity, constructed using the hat function. Owing to the compact support of the hat function in velocity space, the numerical analysis of the proposed scheme is considerably simplified, allowing for a direct proof of its positivity. The scheme, extended to second-order accuracy without compromising the positivity-preserving property of its first-order counterpart, is tested on several benchmark inviscid flow problems in one- and two-dimensions.
Read the full abstract

Algebraic Geometry

A reduction theorem for Lê's conjecture

Let $\boldsymbol{n}=(n_1,n_2,n_3):(\mathbb{C}^2,0)\to(\mathbb{C}^3,0)$ be a holomorphic map germ admitting an injective representative. We prove that if $(d\boldsymbol{n})_0=0$, then $\mathrm{ord}_0(\boldsymbol{n})\in\{2,3,4\}$. This reduces Lê's conjecture to excluding potential counterexamples $\boldsymbol{n}$ of orders $2$, $3$, and $4$. The proof combines techniques from the theory of plane curve singularities, explicit cobordism constructions, and genus bounds obtained by applying properties of the $\Upsilon$ invariant coming from knot Floer homology.
Read the full abstract

Group Theory

On the residual finiteness of the non-abelian exterior square of wreath products and the Grigorchuk group

We show some sufficient conditions ( in terms of properties of $A$, $B$ and $X$) for the non-abelian exterior square $G \wedge G$ to be residually finite, where $G $ is the wreath product $A \wr B$ or the combinatorial wreath product $G = A \wr_X B$, in the latter case $B$ is a free group. We prove that for the Grigorchuk group $G$ the non-abelian exterior square $G \wedge G$ and the non-abelian tensor product $G \otimes G$ are residually finite. We show conditions that imply that $A \wr B$ is not (cohomologically) good in dimension $\leq 2$.
Read the full abstract

Combinatorics

The local dynamical structure of $\Delta^*$ sets via a new Furstenberg family algebra

In this paper, we strengthen the connection between the combinatorics of difference sets and the dynamics of group rotations. Our main result shows that sets which have non-empty intersection with all difference subsets of a commutative semigroup possess local Bohr structure. This generalizes results of Bergelson, Furstenberg, and Weiss and Host and Kra from the integers to arbitrary commutative semigroups. We accomplish this by A) utilizing a recent result showing that the regionally proximal relation is an equivalence relation for minimal actions of commutative semigroups and by B) describing a new, DeMorgan-type algebra on Furstenberg families that allows for efficient manipulation and computation. We formally verify all of the results in this paper in Lean. The main results are verified in a Palomar submission, and we link to a Github repository containing code for the complete verification.
Read the full abstract

All authors Angelina Blahodatna, Lauren Detmold, Daniel Glasscock, Anh N. Le

Analysis of PDEs

Stability for a formally determined Lorentzian inverse problem

We consider the inverse problem of recovering a potential $q$, depending on space and time, in the wave equation $(\Box_g+q)u=0$ on a Lorentzian manifold. We prove Lipschitz stability for a formally determined version of this problem under a null-cone foliation assumption. As a consequence, we obtain uniqueness for the Lorentzian Calderón problem in a fixed conformal class. Our approach uses distorted spherical waves.
Read the full abstract

Algebraic Geometry

Transverse rational curves and the LeBrun–Salamon conjecture

We prove that every compact connected positive quaternionic–Kähler manifold of real dimension $4n$ with $n\ge2$ is isometric to a Wolf space after rescaling the metric by a positive constant. This proves the LeBrun–Salamon conjecture. The proof uses transverse rational curves and the contact structure of the twistor space.
Read the full abstract