Papers

We study the relation between the geometric properties of a chord-arc curve and its conformal welding. Let $h$ be the conformal welding of a closed quasicircle $\Gamma$. By Jones's theorem, the pull-back operator $C_h u=u\circ h$ is bounded on BMO if and only if $h$ corresponds to the welding of a Bishop-Jones quasicircle, equivalently, $h$ is strongly quasisymmetric. Let $A_h$ denote the analytic projection of $C_h$. We prove that $A_h$ is a bounded isomorphism on BMOA if and only if $\Gamma$ is a chord-arc curve. More strongly, the same characterization holds if invertibility is replaced by Fredholmness. This gives an intrinsic conformal-welding characterization of chord-arc curves and a complete geometric answer to the invertibility problem posed by Semmes in the 1980s. Furthermore, we establish an exact correspondence between the inverse of $A_h$ and the classical Faber integral operator, showing that for a rectifiable quasicircle, the Faber operator is a bounded isomorphism on BMOA if and only if the curve satisfies the chord-arc condition.

Let $k=\mathbb F_q$. We reconstruct every $k$-indecomposable $g\in k(X)$ of degree greater than one whose normal closure has genus one. Such a map is automatically separable and, after independent degree-one changes of the source and target coordinates over $k$, arises from a separable equivariant isogeny between elliptic curves equipped with compatible finite group actions stable under Frobenius conjugation. In particular, $\deg g=\ell$ or $\ell^2$ for a prime $\ell$, with $\ell\ne\operatorname{char}k$ in the latter case. More generally, every separable rational function with genus-one Galois closure admits a canonical factorization class, modulo degree-one changes of the intermediate coordinates over $k$, determined by the intrinsic translation subgroup of its geometric monodromy group; every $k$-indecomposable factor of the remaining map has Galois closure of genus zero. For every equivariant-isogeny quotient and every finite extension $k_r/k$, the same exact finite-kernel condition characterizes both permutation of $\mathbf P^1(k_r)$ and exceptionality over $k_r$. The finite kernel and its induced Frobenius and linear symmetry actions also determine the arithmetic and geometric monodromy permutation groups, decomposition classes, and the exact periodic set of permutation extension degrees, including its least period and limiting proportion. Together with the corresponding genus-zero theorem, these results yield permutation if and only if exceptionality over every finite extension for every separable rational function whose Galois closure has genus at most one; under $k$-decomposition, the common extension-degree set is the intersection of the corresponding sets for the factors.

We extend the hypergraph regularity method to sparse $3$-uniform hypergraphs whose vertex links are $C_4$-free. In other words, we consider hypergraphs $H=(V,E)$ that are $K_{1,2,2}$-free, which implies that $|E|=O(|V|^{5/2})$. For such hypergraphs we establish a sparse analogue of the removal lemma for the tight cycle on seven vertices minus an edge.

We prove that for any countable ring $R$ (not necessarily commutative), if the associated left $R$-module ${}_R R$ has a strictly descending sequence of pp-definable subgroups, then the theory $Th(R^{(\omega)})$ of the infinite dimensional direct sum is Borel complete. From this, we conclude that if $R$ is countable and not left perfect, then the theory of $R$-modules is Borel complete, and we give a full characterization of which countable simple rings have Borel complete theories. One special case is that the complete theory $Th({\mathbb Z}^{(\omega)})$ is Borel complete, which strengthens the existing proofs of the Borel completeness of TFAB, the theory of torsion free abelian groups. The proof also introduces, relative to the chosen pp-chain, a proper two-sided ideal $L^R$, and a notion of f.g. hulls which, for countable rings and countable parameter sets in theories satisfying $T=T^{\aleph_0}$ exist and are unique up to isomorphism. These constructions may be of independent interest in the model theory of modules.

Every number field canonically gives rise to two lattices: its ring of integers and its log unit lattice. While the shapes of the former have undergone extensive research, far less is known about the shapes of the latter, referred to as unit shapes. This paper presents an in-depth analysis of the unit shapes of number fields with unit rank 2. Our first main result characterizes, in many cases, the location of unit shapes within the fundamental domain of the space of rank 2 lattice shapes in terms of the Galois group of the field's Galois closure, and determines when these unit shapes are transcendental. Next, we establish that the unit shape uniquely determines the field up to isomorphism for totally imaginary $D_6$ non-CM sextic fields; this result fails in the CM case. Finally, for certain subfamilies of $D_6$ non-CM imaginary sextics, we offer a simple sufficient condition for their log unit lattices to be orthogonal and provide lower bounds on the proportion of fields with orthogonal log unit lattice.

We study a parabolic transmission problem whose interface condition depends on the time derivative of the solution. This model arises naturally as the linearized limiting profile of a two-phase inhomogeneous Stefan problem after the hodograph transform. Our main result shows the existence and uniqueness of a classical solution. We also prove a Harnack inequality for a general class of transmission problems and establish $C^{1,\alpha}$ estimates up to the interface from both sides. These results can be used to obtain $C^{1,\alpha}$ regularity of flat free boundaries for the two-phase Stefan problem with distributed sources.

We show that there exists a polynomial-time algorithm to find a stable matching in network hypergraphic preference systems. The key connection that drives the algorithm was discovered by chatting with ChatGPT-5.6 Sol Max. We verified it independently and present the details in our own words.

The crossing graph $\mathrm{Cross}(M)$ of a median graph $M$ is defined as the graph whose vertices are the $\Theta$-classes of $M$ and whose edges connect two $\Theta$-classes whenever they cross. It is known that every graph $X$ can be realised as the crossing graph of some median graph. In this article, we initiate the study of the space $\mathrm{Cross}^{-1}(X)$ of all the median graphs with crossing graph $X$. First, we prove that two finite median graphs have isomorphic crossing graphs if and only if one can be obtained from the other by a sequence of elementary transformations we call slidings. Then, motivated by the fact that $\mathrm{Cross}^{-1}(X)$ always contains a single median graph of maximal degree, namely the simplex-graph of $X$, we introduce the median degree of $X$ as the smallest possible degree of a median graph in $\mathrm{Cross}^{-1}(X)$. We compute the median degree for some families of graphs and characterise the graphs with maximal median degree.

We study degenerate Eisenstein series on symplectic groups and construct a new automorphic descent. We show that a certain Fourier coefficient, after restriction to a smaller symplectic group, is itself an Eisenstein series with the same inducing parameter \(s\). We describe the resulting holomorphic section explicitly in terms of the original section and local \(L\)-factors at unramified places. At every regular point of the local descent, we prove surjectivity at non-Archimedean places and dense image at Archimedean places. We finally indicate an application of the iterated descent to maximal Fourier coefficients of Eisenstein series.

We define a new theory of logarithmic Gromov–Witten invariants allowing negative contact orders using pierced logarithmic curves. We prove that these classes satisfy logarithmic birational invariance and satisfy loop and splitting theorems generalising those for classical Gromov–Witten invariants.

The Laver Partition Theorem is a fundamental tool in the analysis of Laver and Hechler forcings. It is also connected to determinacy and the Galvin-Prikry theorem: indeed it can be seen as the common core of these two theorems. We study the reverse mathematics and Weihrauch degrees of the Laver Partition Theorem restricted to open and clopen sets. We obtain upper and lower bounds on the proof theoretic strength of this result, as well as a precise picture of the (arithmetical) Weihrauch degrees of the problems related to it.

Linear programming (LP) formulations offer a conceptually elegant approach to infinite-horizon, model-free nonlinear optimal control in continuous spaces. However, in addition to the curse of dimensionality, their practical use is limited by the difficulty of consistently obtaining bounded solutions. In this work, we use moment-matching techniques to derive sufficient boundedness conditions in terms of the available dataset and the cost vector of the LP. Moreover, we discuss practical design methods for nonlinear systems and polynomial features.

We prove dimension-free higher-order Sobolev norm estimates on open convex subsets of $\mathbb{R}^n$ with respect to Gaussian measure and use them to obtain norm equivalence on nonempty open convex subsets of $\ell^2$ endowed with a nondegenerate Gaussian measure. To the best of our knowledge, this is the first such equivalence theorem on a proper open subset of an infinite-dimensional Hilbert space, beyond the earlier whole-space results. We also prove the Malliavin–Sobolev norm equivalence for all $p\in[1,\infty)$ and $k\ge2$, including the case $p=1$, $k\ge3$ left open by Addona–Muratori–Rossi in \cite{AddonaMuratoriRossi}.

Let $S=K[x_1,\ldots,x_n]$ denote the polynomial ring in $n$ variables over a field $K$ with ${\rm deg} x_1=\cdots ={\rm deg} x_n = 1$ and ${\bf a} = (a_1,\ldots,a_n) \in {\mathbb Z}_{>0}^n$. Given a squarefree monomial $u=x_{i_1} \cdots x_{i_d}$ of $S$ with $1 \leq i_1 < \cdots < i_d \leq n$, we set $u^{[{\bf a}]}:=x_{i_1}^{a_{i_1}}\cdots x_{i_d}^{a_{i_d}}$. Let $I$ be a squarefree monomial ideal of $S$ and $G(I)$ its unique minimal set of monomial generators. We introduce the monomial ideal $I^{[{\bf a}]}$ with $G(I^{[{\bf a}]})=\{u^{[{\bf a}]} : u \in G(I)\}$. In the present paper, componentwise linearity of a squarefree monomial ideal $I$ and that of $I^{[{\bf a}]}$ is studied.

The Isaacs–Navarro–Wolf conjecture states that if $G$ is a finite solvable group and $x$ is an element of $G$ such that $\chi(x)$ does not vanish for all irreducible characters $\chi$ of $G$, then $x$ must be contained in some nilpotent normal subgroup. In this paper we present a proof of the Isaacs–Navarro–Wolf conjecture that was discovered with the use of artificial intelligence systems.

Let $\mathrm{ex}(n,H)$ denote the Turán number of $H$. A graph is color-critical if there exists an edge $e\in E(H)$ such that $\chi(H-e)<\chi(H)$. For a color-critical graph $H$ with $\chi(H)=r+1$, Simonovits' chromatic critical edge theorem implies that there exists an $n_0(H)$ such that $\mathrm{ex}(n,H)=e(T_{n,r})$ and the Turán graph $T_{n,r}$ is the only extremal graph provided $n\geq n_0(H).$ Let $W_{2k+2}$ be the even wheel obtained by joining a vertex to a cycle of length $2k+1,$ where $k\geq1$ is an integer. Since $W_{2k+2}$ is color-critical and $\chi(W_{2k+2})=4$, $T_{n,3}$ is the unique extremal graph for $W_{2k+2}$-free graphs of sufficiently large $n.$ Note that the extremal graph $T_{n,3}$ is 3-partite. In this paper, we determine the exact Turán number of $W_{2k+2}$ in non-$3$-partite graphs and characterize all extremal graphs provided $n$ is sufficiently large.

Motivated by the recent construction of fractional Gaussian fields on the Sierpinski gasket, we study those Gaussian fields whose covariance function exhibits a logarithmic behavior. We introduce a parametric family of random measures associated with these fields, which can be regarded as the analogue to Liouville quantum gravity. The construction is based on Kahane's approach via Gaussian multiplicate chaos. We establish reflection invariance and scaling self-similarity for both the fields and the measures, and in addition construct the corresponding analogue to Liouville Brownian motion.

For an elliptically fibered 4-manifold $\pi\colon M\to B$, we introduce a subgroup of the smooth mapping class group of $M$ with explicit geometric representatives: the smooth narrow Mordell-Weil group $MW_0(\pi)$. Leveraging Kodaira's classification of singular fibers, we construct a natural isomorphism between $MW_0(\pi)$ and the orthogonal complement of the trivial lattice in $H^2(M)$. This identification parallels its holomorphic counterpart. This paper generalizes work of Farb and Looijenga, who defined the smooth Mordell-Weil group and computed it for fibrations over a sphere with only nodal fibers. We give an explicit formula for the rank of $MW_0(\pi)$ depending only on the genus of the base curve and the types of singular fibers of $\pi$. As a corollary, we show that rational elliptic surfaces are the only elliptic surfaces with holomorphic and smooth Mordell-Weil groups of the same rank.

The class of left $h$-adequate semigroups sits between the classes of left ample and left Ehresmann semigroups. Whilst free objects in related classes have descriptions in terms of directed trees, free left $h$-adequate semigroups have yet only been described in terms of Rees quotients of free products. Here, we reintroduce the class of (left) $h$-Ehresmann semigroups, show their free objects coincide with free (left) $h$-adequate semigroups, and give a description of these free objects in terms of directed trees. We use our new description in investigating various properties of these structures, including finitary conditions of recent interest.

In 1893, James Joseph Sylvester posed the following problem: given n points in the plane, not all collinear, must there be a line determined by two of the points that does not pass through any of the other points? In 1940, Eberhard Melchior studied the equivalent dual problem in the projective plane: given a set of n lines in the (real) projective plane, not all passing through a common point, must there be a point where exactly two of the lines intersect? Such a point of intersection is called an *ordinary point*. Via a clever double-counting argument, Melchior found that in fact there must be at least three such points. Given the many simple "visual" proofs of what is today known as the Sylvester-Gallai Theorem — the theorem that states there must be at least one ordinary point — a natural question is whether there is a simple visual proof that recovers all three of Melchior's ordinary points. This paper provides such a proof.

This paper gives examples and counterexamples in Oka theory: two about deleting closed sets from complex Euclidean space, one about blowing up along a connected Oka center, and one about deforming continuous maps to regular maps. Two positive results show that $\mathbb{C}^3\setminus S$ is Oka for every closed set $S\subset\mathbb{R}^3$, and that the complement of the closed Hartogs triangle in $\mathbb{C}^2$ is Oka. In contrast, for every $n\ge3$ there is a proper holomorphic embedding $\mathbb{C}\hookrightarrow\mathbb{C}^n$ whose image $A$ is a closed connected smooth curve biholomorphic to $\mathbb{C}$, but whose blow-up $Bl_A\mathbb{C}^n$ is Brody volume hyperbolic and hence not Oka. Finally, for every $n\geq 2$, there exist a smooth connected affine algebraic variety $X$ and a continuous map $X\to\mathbb{C}^n\setminus\{0\}$ that is not homotopic to any regular map $X\to\mathbb{C}^n\setminus\{0\}$; equivalently, $\mathbb{C}^n\setminus\{0\}$ fails the algebraic basic Oka property (aBOP).

Suppose that $G$ is a finitely generated group, $M$ is a compact Riemannian manifold and $G\curvearrowright M$ is a free and isometric action. We prove that the associated discretized warped cone does not have geometric property (T). In contrast, we show that the discretized warped cone associated to the natural action $SL_m(\mathbb Z)\curvearrowright \mathbb T^m$ has geometric property (T) for $m\geq 3$. We also prove that, for free probability-measure-preserving Lipschitz actions on compact Riemannian manifolds, geometric property (T) of the discretized warped cone implies Kazhdan's property (T) of the acting group.

We generalize and compare local-global obstructions for algebraic stacks over number fields. For smooth separated Deligne-Mumford stacks of finite type with a quasi-projective coarse moduli space, we prove that the descent obstruction is contained in the Brauer–Manin obstruction. By lifting $\mathbb{G}_m$-gerbes, we obtain an inclusion between the corresponding composite obstructions. We also show that in this setting the descent obstruction coincides with both the étale Brauer-Manin obstruction and the iterated descent obstruction. The Brauer-Manin obstruction also coincides with the iterated Brauer-Manin obstruction.

The minimal operator systems over ${\rm Mat}_k(\mathbb C)_+$, $k\geqslant2$, and the Lorentz cones $\mathcal L_m$, $m\geqslant4$, are not subhomogeneous. For the $2\times2$ cone we construct extreme positive maps of arbitrarily large output dimension. Positive retracts give the remaining cases. Equivalently, for fixed $k\geqslant2$ and $d$, there exist $s>d$ and an entangled positive operator on $\mathbb C^k\otimes\mathbb C^s$ such that every compression of the second factor to $\mathbb C^d$ is separable.

We study a thermodynamically consistent bulk-surface Navier–Stokes–Cahn–Hilliard system describing two-phase flows exhibiting moving contact lines, variable contact angles, and mass transfer. We establish the existence of global weak solutions for non-degenerate mobility functions and singular free-energy potentials. The proof is based on an implicit time-discretization scheme and a subdifferential characterization of the convex part of the bulk-surface free energy. Finally, we study the simultaneous high-friction and decoupling limit, and prove that corresponding weak solutions converge, up to a subsequence, to a weak solution of the Abels–Garcke–Grün model. One key ingredient of the proof is the Mosco convergence of the convex part of the bulk-surface free energy, which might be of independent interest.

Efficient exploitation of spreading resources is important for improving the transmission efficiency of spread-spectrum communications. Code index modulation (CIM) conveys additional information through spreading-code indices without requiring extra radio-frequency chains. The fixed number of code-index branches in existing CIM schemes limits information allocation between the code-index and modulation-symbol domains as the target rate increases. This paper proposes code-domain grouped index modulation (CGIM), which partitions an orthogonal spreading-code bank into multiple groups and maps the in-phase and quadrature components of one quadrature amplitude modulation (QAM) symbol in each group onto two independent code indices. Group-wise despreading enables parallel detection. Group-wise maximum-likelihood (ML) and low-complexity greedy detection (GD) are developed, with both achieving joint ML decisions under the stated conditions. A pairwise error probability (PEP)-based bit error rate (BER) analysis is derived for Rayleigh and Nakagami-$m$ fading, with additive white Gaussian noise (AWGN) as a benchmark. Numerical results show that CGIM achieves better BER performance than traditional CIM benchmark schemes at the same transmission rate, owing to a more balanced distribution of information bits between the code-index and modulation-symbol domains.

Let $k=\mathbb F_q$ be a finite field of characteristic $p$, and let \[ U_n(k)=\{F\in\operatorname{TA}_n(k):F(0)=0,\ JF(0)=I_n\}. \] We prove that every special tame polynomial automorphism is repeatedly Cartier-admissible for the de Rham flux class associated with \[ \lambda=x_1\,dx_2\wedge\cdots\wedge dx_n. \] Lowest-weight projection of the iterated Cartier descents gives additive characters \[ \chi_{r,j}:U_n(k)\longrightarrow(k,+), \qquad r\ge0,\quad 1\le j\le n, \] and for every fixed group element all but finitely many of these characters vanish. Put \[ S_{n,p}=\begin{cases} \mathbf N_{\ge1},&(n,p)=(2,2),\\ \mathbf N_0,&\text{otherwise}. \end{cases} \] The joint character map is surjective onto \[ \bigoplus_{s\in S_{n,p}}(k^n,+), \] and every fixed-coordinate submap onto \[ \bigoplus_{s\in S_{n,p}}(k,+) \] admits an explicit group-theoretic section. Consequently, \[ \dim_{\mathbb F_p} \frac{U_n(k)}{[U_n(k),U_n(k)]\,U_n(k)^{[p]}} =\aleph_0. \] The character $\chi_{r,j}$ factors through the jet of order \[ N_r=(n-1)(p^{r+1}-1), \] and this order is optimal for every $r\in S_{n,p}$. Since $U_n(k)$ has finite index in $\operatorname{TA}_n(k)$, the tame polynomial automorphism group over a finite field is finitely generated exactly in dimension one. In particular, this proves the Maubach–Willems finite-generation conjecture for $n\ge3$.

The primary goal of a distributed storage system is to ensure that clients can both write and read data in a reliable and consistent manner, even in the presence of failures. While existing asynchronous verifiable information dispersal (AVID) protocols achieve optimal space complexity for storage and communication complexity for data retrieval in a Byzantine setting, the crucial operations of data dispersal and node recovery have received less attention. We propose an efficient AVID protocol that simultaneously guarantees low complexities for dispersal, storage, retrieval, and recovery. At the core of the proposed protocol lies a novel mechanism to encode data in a two-dimensional matrix and a bespoke dispersal algorithm. The protocol maintains an optimal communication complexity for retrieval while substantially improving upon the state of the art for recovery. Additionally, we describe how the protocol can be modified in order to reduce the space complexity and the communication complexity for dispersal, at the expense of a higher communication complexity for retrieval and recovery. As the proposed protocols strike a balance across all considered metrics, they are suitable for a broad range of real-world use cases.

Approximate Linear Programming (ALP) is widely used for large-scale Markov Decision Processes (MDPs), but its performance can be sensitive to the choice of state-relevance weights, which are typically selected heuristically. Performance bounds suggest aligning these weights with the discounted occupancy measure of the induced policy, and existing primal approaches address this through repeated greedy-policy construction. Nonetheless, they lack convergence guarantees and are computationally expensive. We propose a dual-based method that uses projected occupancy information from the ALP dual solution to construct a smooth stochastic policy and update the state-relevance weights, which avoids separate greedy-action calculations. We establish conditions under which the weights match the discounted occupancy of the induced policy and prove uniqueness and global convergence under appropriate smoothing. We also derive an a posteriori policy-loss bound that separates error from the weighted Bellman residual, occupancy mismatch, and stochastic-versus-greedy disagreement. Experiments on classical queueing and multi-priority scheduling problems show that the proposed approach reduces sensitivity to fixed weights and achieves comparable or better policy quality than primal updates at lower computational cost. Finally, we show that adaptive weighting is most valuable when the basis functions are sufficiently expressive for occupancy information to influence the resulting policy.

We consider the Hamiltonian system with one degree of freedom $$\dot x = y, \quad \dot y = -\partial V(x) / \partial x, \qquad x,y\in{\mathbb R}$$ with the smooth potential $V:{\mathbb R}\to{\mathbb R}$. We assume that the origin is an elliptic singular point: $V'(0)=0$ and $V''(0)>0$. Two potentials $V_0$ and $V_1$ are referred to be isonormal if in a neighborhood of the origin there exists a canonical change of coordinates which transforms the Hamiltonian function $y^2/2 + V_0$ to $y^2/2 + V_1$. In particular, any potential isonormal to $x^2/2$ is isochronous. We obtain a criterium of isonormality for analytic potentials.