qedbot

Field activity

Recent items from Terence Tao's blog and Mathstodon, Quanta, the lab blogs and arXiv. They are not claims and are not graded. 0 of 324 name a statement the register holds.

Recent items

A disproof of the van Emde Boas--Kruyswijk conjecture on the Davenport constant

arXiv math.NT·20 Nov 2026

arXiv:2611.24775v2 Announce Type: replace-cross Abstract: The Davenport constant $D(G)$ of a finite abelian group $G$ is the smallest positive integer $\ell$ such that every sequence $S$ with terms from $G$ and with length $|S| \ge \ell$ has a nontrivial zero-sum subsequence. A long-standing conjecture, first proposed by van Emde Boas and Kruyswijk in 1969, states that $D(C_n^r)=r(n-1)+1$ for all

Cameron--Martin theorem for SLE welding measures

arXiv math.NT·20 Nov 2026

arXiv:2611.24875v2 Announce Type: replace-cross Abstract: For $\kappa\in(0,4]$, we prove a Cameron--Martin theorem for the welding law induced by SLE$_\kappa$ loop measure. Under simultaneous left and right composition $h\mapsto\varphi\circ h\circ\psi^{-1}$, the transformed law is mutually absolutely continuous with respect to the original law exactly when both maps belong to the Weil--Petersson g

A refinement of Szemer\'edi's distinct-distance bound for points in general position

arXiv math.CO·20 Nov 2026

arXiv:2611.25148v1 Announce Type: new Abstract: We prove that every collinear triple free set of $n\ge4$ points in the Euclidean plane determines at least $\lfloor n/3\rfloor+1$ distinct distances. This refines the classical bound $\lceil(n-1)/3\rceil$ of Szemer\'edi that is based on counting isosceles triangles. The refinement is based on treating the diameters separately: they only appear on the

Nilpotent skew-symmetric tridiagonal Bohemian matrices: a proof of Corless's conjecture

arXiv math.CO·20 Nov 2026

arXiv:2611.25266v1 Announce Type: new Abstract: Corless studied the skew-symmetric tridiagonal matrices $T_m(u)$ with superdiagonal $u \in \{1, i\}^{m-1}$. He showed that $T_m(u)$ can be nilpotent only if $m = 2^K - 1$ and that the $2^{K-1}$ vectors $u$ obtained from the empty vector by repeated application of $u \mapsto (u, 1, i, \rev u)$ and $u \mapsto (u, i, 1, \rev u)$ give nilpotent matrices,

Near-Quadratic Sample Compression for All VC Classes

arXiv math.CO·20 Nov 2026

arXiv:2611.25011v1 Announce Type: cross Abstract: The sample compression conjecture is a longstanding open problem in learning theory, originating in the work of Littlestone and Warmuth in the 1980s. At its heart is a connection between simplification and generalization: if a predictor consistent with a training sample is defined using only a small part of that sample, then it is likely to general

A census of alternating tangles

arXiv math.CO·20 Nov 2026

arXiv:2611.25042v1 Announce Type: cross Abstract: We give a census of the roughly 10 billion prime, connected, alternating tangles with at most 14 crossings. Along the way, we prove analogs of the Tait conjectures for alternating tangles and observe that aspects of the geometry of alternating tangles are reflected in their diagrams, as is the case with links.

Convexity is overrated: Shortest paths on 4-polytopes are hard to compute

arXiv math.CO·20 Nov 2026

arXiv:2611.25164v1 Announce Type: cross Abstract: We prove that computing geodesic distance on the boundary of a rational convex $4$-polytope is NP-hard. We then construct rational $4$-polytopes with two rational points joined by exponentially many shortest paths of equal rational length, disproving several conjectures along the way. For the same problem, we also prove SQRTSUM-hardness under deter

An analogue of Reed's conjecture for digraphs

arXiv math.CO·20 Nov 2026

arXiv:2407.05827v5 Announce Type: replace Abstract: Reed in 1998 conjectured that every graph $G$ satisfies $\chi(G) \leq \lceil \frac{\Delta(G)+1+\omega(G)}{2} \rceil$. As a partial result, he proved the existence of $\varepsilon > 0$ for which every graph $G$ satisfies $\chi(G) \leq \lceil (1-\varepsilon)(\Delta(G)+1)+\varepsilon\omega(G) \rceil$. We propose an analogue conjecture for digraphs.

Settling the no-$(k+1)$-in-line problem when $k$ is not small

arXiv math.CO·20 Nov 2026

arXiv:2502.00176v2 Announce Type: replace Abstract: What is the maximum number of points that can be selected from an $n\times n$ square lattice so that no $k+1$ of them are collinear? This was asked more than $100$ years ago for $k=2$ and it remained wide open ever since. In this paper, we prove the exact answer is $kn$, provided that $ n\ge k\ge C\log n$ for an absolute constant $C<20$. The proo

Salvetti complexes for conditional oriented matroids

arXiv math.CO·20 Nov 2026

arXiv:2507.06365v2 Announce Type: replace Abstract: We give a new proof of the fact that the complement of the complexification of a real hyperplane arrangement is homotopy equivalent to the Salvetti complex of the associated oriented matroid. Our proof involves no choices, is relatively easy to visualize, and generalizes to the setting of conditional oriented matroids.

Unimodality and Cluster Algebras from Surfaces

arXiv math.CO·20 Nov 2026

arXiv:2508.04396v4 Announce Type: replace Abstract: We prove that the rank polynomial of the lattice of order ideals of a loop fence poset is unimodal. This poset arises as the poset of join-irreducibles in the lattice of good matchings of loop graphs associated with notched arcs. Equivalently, such polynomials can be obtained by evaluating all coefficient variables in an F-polynomial at a single

A case of the dijoin conjecture on inverting oriented graphs

arXiv math.CO·20 Nov 2026

arXiv:2509.10232v2 Announce Type: replace Abstract: For an oriented graph $D$, the inversion of $X\subseteq V(D)$ in $D$ is the graph obtained by reversing the orientation of all arcs with both ends in $X$. The inversion number $\mathrm{inv}(D)$ is the minimum number of inversions needed to obtain an acyclic oriented graph. We show that the dijoin conjecture of Bang-Jensen, da Silva and Havet, tha

The Bollob\'as--Nikiforov inequality for complete multipartite graphs, with remarks on the $K_4$-free case

arXiv math.CO·20 Nov 2026

arXiv:2603.26379v4 Announce Type: replace Abstract: Bollob\'as and Nikiforov conjectured that every graph $G \neq K_n$ with $m$ edges and clique number $\omega$ satisfies $\lambda_1^2(G) + \lambda_2^2(G) \leq 2(1 - 1/\omega)m$, where $\lambda_1(G) \geq \lambda_2(G)$ are the two largest adjacency eigenvalues. We give a short self-contained proof of the inequality for complete multipartite graphs, b

Thresholds for Tic-Tac-Toe on Finite Affine Spaces

arXiv math.CO·20 Nov 2026

arXiv:2605.05455v4 Announce Type: replace Abstract: We study the strong positional game in which two players alternately claim points of $\F_q^m$ and the first to complete an affine $n$-subspace wins. We distinguish the first winning dimension $\tau(n,q)$ from the eventual winning threshold $T(n,q)$, without assuming monotonicity in $m$. Affine Ramsey theory proves finiteness, while the Erd\H{o}s-

Thresholds for the Frankl-Wang $3/7$ conjecture on maximum-degree ratios

arXiv math.CO·20 Nov 2026

arXiv:2607.02589v2 Announce Type: replace Abstract: Let $\mathcal{F}\subset\binom{[n]}{k}$ be an intersecting family, $\Delta(\mathcal{F})=\max_{x\in[n]}|\{F\in\mathcal{F}:x\in F\}|$, and $\varrho(\mathcal{F})=\Delta(\mathcal{F})/|\mathcal{F}|$. Frankl and Wang conjectured that if $n>100k$ and $|\mathcal{F}|>\binom{n-3}{k-3}$, then $\varrho(\mathcal{F})\ge 3/7$; the constant $3/7$ is sharp because

Weighted bond posets and a new chromatic symmetric function

arXiv math.CO·20 Nov 2026

arXiv:2608.08692v2 Announce Type: replace Abstract: The classical bond lattice of a graph was used in a formula of Whitney to compute the chromatic polynomial. In this paper, we use weighted versions of the bond lattice, to introduce and study a new polynomial and a new symmetric function invariant of a graph. Examples of the new polynomial invariant include the classical Narayana polynomials (for

A $\sqrt{2}$-Approximation to the Bilu-Linial Conjecture

arXiv math.CO·20 Nov 2026

arXiv:2609.17551v2 Announce Type: replace Abstract: Bilu and Linial conjectured that if $d\ge 2$, then every $d$-regular graph $G$ has an edge signing $\sigma:E(G)\to\{-1,1\}$ such that its signed adjacency matrix $A_\sigma$ satisfies the Ramanujan bound \begin{equation*} \rho(A_\sigma)\le 2\sqrt{d-1} \end{equation*} and they proved that \begin{equation*} \rho(A_\sigma)=O\!\left(\sqrt{d\log^3 d}\r

Character-Twisted Sums of Real Quadratic Class Numbers and a Selberg-Type Conjecture

arXiv math.NT·20 Nov 2026

arXiv:2611.24948v1 Announce Type: new Abstract: Extending the arithmetic Selberg-zeta function framework studied by Sarnak \cite{Sarnak1982} and Hashimoto \cite{Hashimoto2007}, we study Dirichlet-character weighted sums of narrow class numbers of real quadratic orders and derive explicit formulas according to the scalar, split, ramified, and inert reductions of primitive hyperbolic classes. Our fi

Orbits of $p$-adic flows: balls, time-one maps and minimal group actions

arXiv math.NT·20 Nov 2026

arXiv:2611.24982v1 Announce Type: new Abstract: Let $f$ be a vector field on $\mathbb{Z}_p^d$ given by polynomials, or by power series converging on $\mathbb{Z}_p^d$, whose coefficients are divisible by $p^c$, where $c \ge 1$ ($c \ge 2$ when $p = 2$). Its flow exists for every $p$-adic time. I show that $t \mapsto \varphi_t(x)$ multiplies distances by exactly $\|f(x)\|_p$, in every dimension. This

The rational points of the non-split Cartan modular curve of level 121

arXiv math.NT·20 Nov 2026

arXiv:2611.25183v1 Announce Type: new Abstract: We prove that the modular curve $X_{\mathrm{ns}}^{+}(121)$ of the normalizer of a non-split Cartan subgroup of level 121, of genus 511, has exactly seven rational points, all of them CM. This is the level 121 case of a conjecture of Rouse, Sutherland and Zureick-Brown, and with their theorem it determines the 11-adic images of Galois of non-CM ellipt

On the non-extendibility of triangular $D(n)$-pairs $\{n,2n\}$ with $n = 2k^2 \pm k$

arXiv math.NT·20 Nov 2026

arXiv:2611.25270v1 Announce Type: new Abstract: We study a class of Diophantine problems arising from triangular analogues of classical Diophantine tuples. A set of positive integers is called a triangular $D(n)$-tuple if the product of any two distinct elements, increased by $n$, is a triangular number. In this paper, we investigate the extensibility of triangular $D(n)$-pairs of the form $\{n,2n

Exceptional zeros for $\mathrm{GSp}(4) \times \mathrm{GL}(2)$ and Yoshida lifts

arXiv math.NT·20 Nov 2026

arXiv:2611.25278v1 Announce Type: new Abstract: The aim of this article is to study an exceptional zero phenomenon for the $p$-adic $L$-functions attached to $\mathrm{GSp}_4\times\mathrm{GL}_2$ in the critical regions (F) and (D). We construct improved $p$-adic $L$-functions by replacing the $p$-depleted Eisenstein family with its $p$-ordinary counterpart. Under a local compatibility hypothesis at

An almost effective proof of the class number 1 problem for imaginary quadratic fields via Frobenius--Rabinowitsch

arXiv math.NT·20 Nov 2026

arXiv:2401.07192v2 Announce Type: replace Abstract: Let $D \neq 1$ be a square-free integer, and let $K = {\mathbb Q}(\sqrt D)$ be the corresponding quadratic field with ring of integers $\mathcal{O}_K$. Let $\mathcal{P}$ be a prime ideal of $\mathcal{O}_K$ lying over an odd rational prime that splits in $K/\mathbb Q$. We obtain a necessary and sufficient condition in terms of a binary quadratic f

Todd's relation conjecture and binary relations for multiple zeta values in positive characteristic

arXiv math.NT·20 Nov 2026

arXiv:2609.08263v3 Announce Type: replace Abstract: We prove Todd's relation conjecture: all $\mathbb{F}_q(\theta)$-linear relations of Thakur's multiple zeta values are generated from the fundamental binary relation by the operators $\mathcal{B}^{\mathrm{S}}$, $\mathcal{C}^{\mathrm{S}}$, $\mathcal{B}^{\mathrm{S}}\circ \mathcal{C}^{\mathrm{S}}$; moreover they are also generated by $\mathcal{B}^{\a

On the variation of slopes over moduli stacks of Galois representations

arXiv math.NT·20 Nov 2026

arXiv:2609.12281v2 Announce Type: replace Abstract: In studying slopes of p-adic eigenforms, focusing on eigenforms with a fixed residual Galois representation is a standard approach. In this paper, we go further and explicitly study how slopes vary as the residual representations vary over a characteristic p space that is closely related to Emerton and Gee's moduli stack of Galois representations

On the Hardy--Littlewood--Chowla conjecture

arXiv math.NT·20 Nov 2026

arXiv:2610.20242v2 Announce Type: replace Abstract: An old conjecture dating back at least to Hildebrand's work in 1989, asserts that the M\"obius function exhibits cancellation on shifted primes; that is, $$\sum_{p\le x}\mu(p+2)=o(\pi(x)),\quad \text{or equivalently}\quad \sum_{n\le x}\Lambda(n)\mu(n+2)=o(x).$$ This is also a well-known model case for the parity problem in sieve theory. In this p

A Diophantine definition of $\mathbb{Z}$ in $\mathbb{Q}$

arXiv math.NT·20 Nov 2026

arXiv:2611.16130v2 Announce Type: replace Abstract: We prove that $\mathbb{Z}$ is a Diophantine subset of $\mathbb{Q}$. More precisely, there exist an integer $m\ge 1$ and a polynomial of total degree at most four in $m+1$ variables whose rational zero set projects onto $\mathbb{Z}$ under the first coordinate. We construct a Diophantine model of $\mathbb{Z}$ on an elliptic curve and use it to defi

Seven ordered points and the nonexistence of arithmetic ball quotient compactifications

arXiv math.NT·20 Nov 2026

arXiv:2610.23227v3 Announce Type: replace-cross Abstract: We prove that the ordered GIT quotient of seven points on $\mathbb P^1$ with equal weights is not isomorphic to the Baily--Borel compactification of any arithmetic complex ball quotient. Together with our companion paper and the known positive examples, this determines the equal weight case for every $n\ge6$: such a realization exists preci

Affine extensions and central compression for product-one-free sequences

arXiv math.CO·19 Nov 2026

arXiv:2611.23280v1 Announce Type: new Abstract: Let $H_s=H_{27}\times C_3^s$, where $H_{27}$ is the nonabelian group of order $27$ and exponent three. We study the elements which can be adjoined to a product-one-free sequence $L$ of length $2s+5$. Let $Q$ be its central subsequence and let $h$ be the dimension of the subgroup generated by $Q$. If $2h-|Q|\le1$, all admissible individual extensions

Log-concavity for alternating Eulerian polynomials

arXiv math.CO·19 Nov 2026

arXiv:2611.23292v1 Announce Type: new Abstract: Alternating Eulerian polynomials enumerate permutations by the alternating descent statistic introduced by Chebikin. We prove that their coefficient sequences are log-concave, verifying a conjecture of Lin, Ma, Wang and Wang. Our proof combines a factorization involving reciprocal quadratic factors, estimates for ordinary Eulerian zeros, and a log-co

Local connectivity of friends-and-strangers graphs with a star

arXiv math.CO·19 Nov 2026

arXiv:2611.23295v1 Announce Type: new Abstract: Given two finite simple graphs $X$ and $Y$ with the same number of vertices, the vertex set of the friends-and-strangers graph $\FS(X,Y)$ consists of all bijections from the vertices of $X$ to the vertices of $Y$. Two bijections are adjacent exactly when one is obtained from the other by swapping the images of two adjacent vertices of $X$, while leav

Classification of Forbidden 0-1 Patterns by Their Extremal Function

arXiv math.CO·19 Nov 2026

arXiv:2611.23333v1 Announce Type: new Abstract: This paper concerns the maximum weight of $n\times n$ 0-1 matrices that avoid some pattern $P$, denoted $\operatorname{ex}(n,P)$. Furedi and Hajnal initiated a research program of classifying all patterns according to their extremal function, but to date, only the weight-4 patterns are completely understood. In this paper we make progress on several

Antidirected paths on five vertices in 5-chromatic digraphs

arXiv math.CO·19 Nov 2026

arXiv:2611.23460v1 Announce Type: new Abstract: We prove that every 5-chromatic digraph containing no copy of the regular tournament on five vertices contains both antidirected paths on five vertices. This answers a question posed by El Sahili in 2004. The proof uses an edge bound for 5-critical graphs to constrain the out-degrees in a counterexample and obtain a contradiction by constructing a pr

Minimal super dominating sets of maximum cardinality

arXiv math.CO·19 Nov 2026

arXiv:2611.23464v1 Announce Type: new Abstract: Let $G = (V,E)$ be a graph. A subset $S \subseteq V$ of vertices is a super dominating set if every vertex $v \in V - S$ has a neighbour $u \in S$, whose only neighbour in $V - S$ is $v$. A set $S \subseteq V$ is called open irredundant if every vertex $u \in S$ has at least one neighbour $v \in V - S$ whose only neighbour in $S$ is $u$. In this pape

Unique-maximum colourings of planar graphs with respect to neighbourhoods

arXiv math.CO·19 Nov 2026

arXiv:2611.23478v1 Announce Type: new Abstract: A colouring of the vertices of a graph by positive integers is a unique-maximum colouring with respect to open (resp. closed) neighbourhoods if the maximum colour appears exactly once in the open (resp. closed) neighbourhood of every vertex. Fabrici, Lu\v{z}ar, Rindo\v{s}ov\'a and Sot\'ak (Discrete Appl. Math. 324 (2023) 80-92) conjectured that four

The Gini Index of an Integer Composition

arXiv math.CO·19 Nov 2026

arXiv:2611.23542v1 Announce Type: new Abstract: We extend the discrete Gini statistic on integer partitions to integer compositions by rearranging the parts in decreasing order. Under the uniform distribution on the $2^{n-1}$ compositions of $n$, the resulting statistic has a rational ordinary generating function for its aggregate values, as well as a rational generating function for its second mo

3-Cube-Free Sets in Cyclic Groups

arXiv math.CO·19 Nov 2026

arXiv:2611.23559v1 Announce Type: new Abstract: A set is called $3$-cube-free if it contains no configuration of the following form: $\{x,y,z,x+y,x+z,y+z,x+y+z\}$. We study the maximum density of $3$-cube-free sets in finite cyclic groups. As observed by Meng, every $3$-cube-free subset of $\mathbb Z_m$ has size at most $2m/3$, and this bound is sharp whenever $3\mid m$. Our main result shows that

Almost all vertex-transitive graphs and digraphs are Cayley

arXiv math.CO·19 Nov 2026

arXiv:2611.23641v1 Announce Type: new Abstract: We prove that almost all vertex-transitive digraphs are Cayley digraphs, and that almost all vertex-transitive graphs are Cayley graphs, as the number of vertices tends to infinity through all positive integers. The proportions of Cayley objects are at least $1-2^{-n/4+o(n)}$ for digraphs and $1-2^{-n/24+o(n)}$ for graphs. This proves the McKay--Prae

Removable forests in $k$-connected and $k$-edge-connected graphs

arXiv math.CO·19 Nov 2026

arXiv:2611.23647v1 Announce Type: new Abstract: We prove the forest conjecture of Clay and Jord\'an: Let $k\ge1$ be an integer and let $F$ be a forest with $m$ vertices and $e$ edges. If a $k$-connected graph $G$ has minimum degree at least $\max\{k+e,m-1\}$, then it contains a copy of $F$ whose edge deletion preserves $k$-connectivity. We also prove the $k$-edge-connectivity version.

Connectivity of Matroids with Breadth-Critical Tangles

arXiv math.CO·19 Nov 2026

arXiv:2611.23686v1 Announce Type: new Abstract: We construct an explicit infinite sequence of nonnegative integers $(s_0,s_1,\ldots)$ such that, for every $k\ge2$, every finite matroid with a breadth-critical tangle of order at least $k$ is $(s_0,s_1,\ldots,s_{k-2})$-connected. The constants $s_i$ depend only on $i$. This proves a conjecture of Brettell, Jowett, Oxley, Semple, and Whittle.

Circuit spectra for binary matroids

arXiv math.CO·19 Nov 2026

arXiv:2611.23730v1 Announce Type: new Abstract: The circuit spectrum of a matroid is defined to be the set of circuit sizes. The circuit $e$-spectrum of a matroid is the set of circuit sizes of the matroid containing the element $e$. The circuit spectrum problem is an important problem. Erd\H{o}s (1992) conjectured that every connected graph $G$ with girth $g$ and average degree $d$ has a cycle sp

Quasi-Bisections of Cubic Graphs with Tree and Circuit Decompositions

arXiv math.CO·19 Nov 2026

arXiv:2611.23885v1 Announce Type: new Abstract: A $2$-quasi-bisection of a graph is a vertex $2$-coloring in which the color classes differ in size by at most two and every monochromatic component has at most two vertices. Esperet, Mazzuoccolo, and Tarsi in [J. Graph Theory, 86(2017), 149-158] conjectured that every cubic graph admits such a coloring. DeVos and Nurse proved the conjecture for cubi

Covering dense $r$-graphs by perfect matchings

arXiv math.CO·19 Nov 2026

arXiv:2611.24019v1 Announce Type: new Abstract: For a matching-covered graph $G$, let $\tau(G)$ denote the minimum number of perfect matchings needed to cover all edges of $G$. An $r$-regular graph $G$ is said to be an $r$-graph if $|\partial(X)|\geq r$ for each odd set $X\subseteq V(G)$, where $\partial(X)$ denotes the set of edges with precisely one end in $X$. The generalized Berge conjecture,

Incidence methods for algebraic expanders over arbitrary fields

arXiv math.NT·19 Nov 2026

arXiv:2611.24034v1 Announce Type: cross Abstract: Let $A\subset F$ be finite, $N=|A|$, $p=\operatorname{char}F$ (with $p=\infty$ in characteristic zero), and $L=1+\log(2N)$. In the range $N\le p^{1/2}$, we establish \[ |AA+A|\gg N^{129/85}L^{-72/85}. \] This improves the long-standing $3/2$-exponent bound for $AA+A$ in positive characteristic in the range $N\le p^{1/2}$, without any assumption on

Tur\'{a}n number of the odd-ballooning of odd prisms

arXiv math.CO·19 Nov 2026

arXiv:2611.24048v1 Announce Type: new Abstract: The Tur\'{a}n problem for odd-balloonings has been studied for various classes of skeleton graphs, including stars, paths, cycles, trees, bipartite graphs, and certain 3-chromatic graphs. The Tur\'{a}n numbers and extremal graphs for odd prisms have also been determined. Motivated by these developments, we investigate the Tur\'{a}n problem for prescr

Non-bipartite spectral extremal graphs forbidding a three-chromatic color-critical graph

arXiv math.CO·19 Nov 2026

arXiv:2611.24131v1 Announce Type: new Abstract: A graph is color-critical if it contains at least one color-critical edge. For every fixed three-chromatic color-critical graph $H$, we determine the maximum spectral radius of an $n$-vertex non-bipartite $H$-free graph and characterize the unique extremal graph for all sufficiently large $n$. The extremal graph belongs to one of three graph families

Critical spectral weights on triangulated disk

arXiv math.CO·19 Nov 2026

arXiv:2611.24199v1 Announce Type: new Abstract: We solve the common-positive-weight support problem at the local spectral threshold 1/2 for relative triangulated disks with interior degrees at most five and an empty or connected degree-five core. We characterize feasibility by a finite decomposition into three elementary pieces and a condition on the original boundary marking. The proof passes fro

Two results on rich-neighbour $5$-colouring of subcubic graphs

arXiv math.CO·19 Nov 2026

arXiv:2611.24297v1 Announce Type: new Abstract: A rich-neighbour edge-colouring is a proper edge-colouring in which every non-isolated edge has an adjacent edge whose neighbours have pairwise distinct colours. Petru\v{s}evski and \v{S}krekovski conjectured that every connected subcubic loopless multigraph distinct from $K_4$ admits such a colouring with five colours. We prove the conjecture for tw

Induced matching treewidth in classes with a forbidden structure

arXiv math.CO·19 Nov 2026

arXiv:2611.24432v1 Announce Type: new Abstract: Induced matching treewidth is a tree-decomposition based parameter where we bound the size of an induced matching whose every edge intersects a single bag of the decomposition. It is known that many computational problems can be solved efficiently in graphs of bounded induced matching treewidth. In this paper we are interested in understanding what c

Asymptotics of linear normal lambda terms: WKB structure, Airy turning point and a positive recurrence

arXiv math.CO·19 Nov 2026

arXiv:2611.24442v1 Announce Type: new Abstract: Let a n be the number of closed linear $\lambda$-terms in $\beta$-normal form with n variable occurrences. We prove is the large-order constant of the Riccati-Airy sequence K m attached to the turning point of the WKB expansion. We show that the K m are exactly rescaled coefficients of the formal logarithmic derivative of the Airy asymptotic series,

The isolation number of uniform hypertrees

arXiv math.CO·19 Nov 2026

arXiv:2611.24477v1 Announce Type: new Abstract: An isolating set of a hypergraph $H$ is a vertex set whose closed neighbourhood intersects every edge of $H$. The isolation number $\iota(H)$ is the minimum cardinality of such a set. Let $r\ge3$, and let $T$ be an $r$-uniform hypergraph whose incidence graph is a tree. We prove that, if $T$ has order $n$ and at least two edges, then $\iota(T)\le\lfl

A combinatorial proof of a symmetric joint distribution on strict binary trees

arXiv math.CO·19 Nov 2026

arXiv:2611.24504v1 Announce Type: new Abstract: Nonplanar strict binary trees on $2n+1$ vertices are enumerated by the reduced tangent numbers $T_{2n+1}/2^n$, whose entries are refined by Poupard's triangle. Poupard defined the end of the minimal chain ($\mathrm{eoc}$) and the parent of the maximum leaf ($\mathrm{pom}$) on these trees, proving that $\mathrm{eoc}$ and $\mathrm{pom}+1$ share this tr

Katona's Shadow Equality Persists under Bounded VC-Dimension

arXiv math.CO·19 Nov 2026

arXiv:2611.24505v1 Announce Type: new Abstract: Katona's intersecting-shadow theorem states that every $t$-intersecting $r$-uniform family has size at most that of its $(r-t)$-shadow, with equality precisely for complete $r$-uniform families on $2r-t$ points. We prove that both the shadow inequality and its equality classification remain valid under the substantially weaker assumption that the VC-

Treewidth 3 in the Product Structure Theorem for Bounded Degree Graphs in Minor-Closed Classes

arXiv math.CO·19 Nov 2026

arXiv:2611.24544v1 Announce Type: new Abstract: We show that, for all positive integers $t$ and $\Delta$, there exists an integer $c$ such that, for every $K_t$-minor-free graph $G$ with maximum degree at most $\Delta$, there exists a graph $H$ of treewidth at most $3$ and a path $P$ such that $G$ is isomorphic to a subgraph of the strong product $H\boxtimes P\boxtimes K_c$. This improves on a pre

Asymptotic probabilities in random Latin squares

arXiv math.CO·19 Nov 2026

arXiv:2611.24564v1 Announce Type: new Abstract: We introduce some new general techniques for studying asymptotic probabilities in random Latin squares. Using these techniques, we obtain an asymptotic formula for the probability that a given 'small' partial Latin square $H$ is present in a uniformly random $n\times n$ Latin square (as conjectured by Divoux-Kelly-Kennedy-Sidhu). As applications, we

The number of cycles in a random 2-factor of a random regular graph

arXiv math.CO·19 Nov 2026

arXiv:2611.24574v1 Announce Type: new Abstract: We study the number of cycles $X$ in a uniformly random 2-factor $F$ of a random $d$-regular graph on $n$ vertices (in the pairing model) for any fixed $d\ge 3$. When the pairing $P$ and the 2-factor $F\subseteq P$ are chosen uniformly at random together, the probability generating function of $X$ is $\Gamma(n+\tfrac u2)\Gamma(\tfrac12)/\bigl(\Gamma(

Narrower arithmetic progressions in the primes

arXiv math.NT·19 Nov 2026

arXiv:2611.23488v1 Announce Type: new Abstract: For each fixed $k\geq 3$ and $\delta > 0$, we prove that every subset of the primes up to $X$ of relative density at least $\delta$ contains a non-trivial $k$-term arithmetic progression with common difference $O_{k,\delta,\varepsilon}((\log X)^{k\cdot 2^{k-3}+\varepsilon})$, for any $\varepsilon>0$. This improves the previous exponent $(k-1)2^{k-2}$

Irreducible components of affine Deligne-Lusztig variety in the affine flag variety

arXiv math.NT·19 Nov 2026

arXiv:2611.23634v1 Announce Type: new Abstract: We establish a bijection between elements of stable Demazure crystals and labeled longest increasing paths in the double Bruhat graph. As an application, we show that the orbits of irreducible components of certain special affine Deligne-Lusztig varieties (ADLVs) in the affine flag variety of a split reductive group are counted by weight multipliciti

Superspecial curves of genus two over prime fields: Frobenius types and rational (2,2)-kernels

arXiv math.NT·19 Nov 2026

arXiv:2611.23694v1 Announce Type: new Abstract: Superspecial curves of genus two over a prime field $\mathbb{F}_p$, and the rational $(2,2)$-isogenies between their Jacobians, are the vertices and edges of the graph on which genus-two isogeny-based cryptography is built. Let $C$ be such a curve, with Jacobian $J$ and Frobenius endomorphism $\pi$. We show that $\pi^2 = p\,\alpha_*$ for a unique aut

Optimal homological stability: bounding secondary terms of Cohen-Lenstra moments and $S_d$-fields over $\mathbb{F}_q[t]$

arXiv math.NT·19 Nov 2026

arXiv:2611.23721v1 Announce Type: new Abstract: We prove an explicit stability line for the homology $H_i(\mathrm{Hur}_n^c,\mathbb{Q})$ of any Hurwitz space associated to a finite rack $c$ depending only on its homology up to some finite $n$. Moreover, as the range of $n$ increases, the slope of the resulting stability line converges to the optimal slope. Thus, for any Hurwitz space, a finite comp

Bernstein-Zelevinsky duality for equivariant vector bundles on Drinfeld spaces

arXiv math.NT·19 Nov 2026

arXiv:2611.23831v1 Announce Type: new Abstract: We study duality and finiteness of locally analytic representations arising from compactly supported coherent cohomology of Drinfeld spaces. We prove that Grothendieck--Serre duality for equivariant vector bundles realizes Bernstein--Zelevinsky duality of locally analytic representations. We follow the strategy of Fargues for $\ell$-adic sheaves and

Generalizing the Gaster--Loustau Theorem via Generalized Discrete Markov Spectra

arXiv math.NT·19 Nov 2026

arXiv:2611.23868v1 Announce Type: new Abstract: We realize generalized Markov numbers (GM numbers) for arbitrary $k_1,k_2,k_3\in \mathbb Z_{\ge0}$ as $\lambda$-lengths of return arcs on a hyperbolic orbifold constructed from local monodromy matrices. The McShane identity of Tan--Wong--Zhang on this orbifold yields a summation identity with multiplicities for the gaps between the associated Markov-

One more curious property of $1729$: The only Carmichael number of the form $2^np^3+1$ with prime $p$

arXiv math.NT·19 Nov 2026

arXiv:2611.24275v1 Announce Type: new Abstract: Florian Luca recently proved that if $2^np^3+1$ is a Carmichael number for some prime $p$ and integer $n\ge1$, then $p=3$. Here we complete the cubic classification by proving that $1729$, Hardy--Ramanujan taxicab number, is the only Carmichael number of the form $2^np^3+1$ with $p$ prime and $n\ge1$. The proof identifies the unique possible multipli

An Explicit Uniform Connectivity Bound for Generalized Markoff Graphs

arXiv math.NT·19 Nov 2026

arXiv:2611.24452v1 Announce Type: new Abstract: Let $X_D$ be the surface $x^2+y^2+z^2-xyz=D$ over $\mathbb F_p$. For every prime $p>10^{320}$ and every $D\in\mathbb F_p\setminus\{4\}$, we prove that the three Vieta involutions act transitively on the trace triples of generating pairs of $\mathrm{SL}_2(\mathbb F_p)$. The proof combines an explicit primitive-fiber argument, Chen's orbit-size lower b

Open Homomorphisms between $m$-step Solvable Galois Groups of Number Fields

arXiv math.NT·19 Nov 2026

arXiv:2611.24495v1 Announce Type: new Abstract: Let $K,L$ be number fields, and let $m \geq 2$ be an integer. In this paper, we prove that an open homomorphism $\phi_{m+2}: G_K^{m+2} \to G_L^{m+2}$ induces an open homomorphism $\phi_m$ that arises uniquely from a field embedding $\tau_m:L_m \hookrightarrow K_m$. We first establish a sharper version of the $m$-step solvable cyclotomic compatibility

Nine-Colored Partition Components Modulo 19

arXiv math.NT·19 Nov 2026

arXiv:2611.24516v1 Announce Type: new Abstract: Let $p_{m}(n)$ be the number of partitions of $n$ into parts of $m$ colors, and let $y=q^{19}$. Starting from Winquist's identity, as Hirschhorn did for the modulus $11$, we express each of the nineteen components of $(q;q)_{\infty}^{10}$ modulo $19$ as a sum of two quartic products of the theta functions $(y^{a};y^{19})_{\infty}(y^{19-a};y^{19})_{\i

On metric multiplicative Diophantine approximation

arXiv math.NT·19 Nov 2026

arXiv:2611.24582v1 Announce Type: new Abstract: Gallagher's theorem (1962) gives a Khintchine-type dichotomy for the Lebesgue measure of the set of multiplicatively $\psi$-approximable points in $\mathbb{R}^n$, $n \geq 2$, for monotonic functions $\psi$. We establish this dichotomy for arbitrary functions $\psi$, proving a conjecture of Beresnevich, Haynes, and Velani (2013).

On Hilbert's tenth problem for number fields

arXiv math.NT·19 Nov 2026

arXiv:2611.24748v1 Announce Type: new Abstract: Given a quadratic number field $K$ we show that the $abc$ conjecture over $K$ implies that $\mathbb{Z}$ is Diophantine in $K$ and, hence, a negative answer to Hilbert's tenth problem over $K$. More generally, the same conclusions hold for an arbitrary number field $K$ provided that the $abc$ conjecture holds over $K$ and that there is an elliptic cur

On the refined Kaneko--Zagier conjecture

arXiv math.NT·19 Nov 2026

arXiv:2611.24933v1 Announce Type: new Abstract: We extend our results on Zhao's conjectural basis to finite multiple zeta values modulo arbitrary prime powers and to the corresponding completed algebra. As a consequence, the refined Kaneko--Zagier conjecture, which gives a precise description of relations modulo arbitrary prime powers in terms of ordinary multiple zeta values, follows from the dim

On Jacquet Modules of Principal Series in Families

arXiv math.NT·19 Nov 2026

arXiv:2611.24215v1 Announce Type: cross Abstract: Let $G$ be a connected reductive group over a $p$-adic field $F$. Let $Y$ be the diagonalizable affine group scheme over $\mathbb{Z}[p^{-1},p^{1/2}]$ parametrizing weakly unramified characters of a minimal Levi $M$. The relative Weyl group $W$ acts on $Y$. We define a coherent sheaf $\mathcal{J}$, called the universal Jacquet module, on the fiber p

Low Moments, Small Balls and Star Discrepancy

arXiv math.NT·19 Nov 2026

arXiv:2611.24934v1 Announce Type: cross Abstract: Let $D_P$ be the discrepancy function of a configuration $P$ of $N$ points in the $d$-dimensional unit cube, and let $\|D_P\|_q$ be its $L^q$ discrepancy. We prove that for all fixed $d\ge2$ and $00$. This bound is sharp; together with the classical results for $q>1$, it determines the minimal order of the $L^q$ discrepancy for every $0<q<\infty$ i

Waldspurger's formula via a prehomogeneous zeta integral on $F^2 \otimes \bigwedge^2 F^4$

arXiv math.NT·19 Nov 2026

arXiv:1510.07334v4 Announce Type: replace Abstract: We give a new proof of Waldspurger's formula for toric periods of cuspidal automorphic forms on $\mathrm{PGL}_2$ over a number field, including the explicit constant. The proof compares two expansions of the residue at $s_0=1$ of a two-variable zeta integral on the twelve-dimensional prehomogeneous representation $F^2\otimes\bigwedge^2F^4$ of a p

Counting formulas and refined generating functions for inversion-sequence Classes 152 and 207

arXiv math.CO·18 Nov 2026

arXiv:2611.21657v1 Announce Type: new Abstract: For the two Class 152 pattern sets, we prove that the common number of inversion sequences of length \(n\geq 1\) is \(a_n=1+\sum_{j=1}^{n-1}\binom{2j}{j}\). The Class 152 proof uses first-descent and last-zero decompositions, with weighted Dyck paths evaluating the resulting generating functions. For Class 207, we prove equality of the three total-co

Co-edge-regular graphs with two $\lambda$-values and four distinct eigenvalues

arXiv math.CO·18 Nov 2026

arXiv:2611.21664v1 Announce Type: new Abstract: A connected $k$-regular graph $G$ on $n$ vertices is co-edge-regular if any two distinct non-adjacent vertices have the same number of common neighbors. For adjacent vertices $u$ and $v$, let $\lambda(u,v)=|N(u)\cap N(v)|$. Ge and Koolen asked whether the theorem of Neumaier on strongly regular graphs with fixed smallest eigenvalue extends to co-edge

Gallai's path decomposition conjecture for $K_5$-minor-free graphs

arXiv math.CO·18 Nov 2026

arXiv:2611.21673v1 Announce Type: new Abstract: Gallai conjectured that the edges of every connected graph on $n$ vertices can be partitioned into at most $\ceil{n/2}$ paths. We prove that every connected $K_5$-minor-free graph other than $K_3$ and $K_5-e$ admits such a partition into at most $\floor{n/2}$ paths. The two exceptions require $\ceil{n/2}$ paths. In a smallest counterexample we find a

The Conic Tverberg plus minus

arXiv math.CO·18 Nov 2026

arXiv:2611.21868v1 Announce Type: new Abstract: We prove a Tverberg type theorems: Given a set $A\subset \mathbb{R}^d$ and an affine subspaces $L_1,...,L_m\subset \mathbb{R}^d$. In some conditions there is a partition $A_1, ..., A_m, B_1, ..., B_m$ of $A$ such that the sets $L_i\cup A_i\cup B_i$ for $i=1,...,m$ have common barycentre with negative masses in $B_i$ and positive masses in $A_i$. The

Shifted Hankel determinants via Hankel continued fractions

arXiv math.CO·18 Nov 2026

arXiv:2611.21968v1 Announce Type: new Abstract: The Hankel determinants $H_n(F)$ of a power series $F(x)$, as well as the shifted ones $H_n^{(1)}(F)$ and $H_n^{(2)}(F)$, can be read off from its Jacobi continued fraction, provided that all $H_n(F)$ are nonzero. Without any condition on $F$, the Hankel continued fraction ($H$-fraction) still yields all $H_n(F)$. We show that the $H$-fraction of $F$

Laplacian Eigenvectors of Generically Weighted Graphs Have Pairwise Distinct Coordinates

arXiv math.CO·18 Nov 2026

arXiv:2611.21979v1 Announce Type: new Abstract: Poignard, Pereira and Pade conjectured that, for a generic choice of the nonzero weights of a given graph, the Fiedler vector of the weighted Laplacian has pairwise distinct coordinates. We give a proof that also covers every nonconstant eigenvector. For each connected graph on n vertices we construct a nonzero homogeneous polynomial with integer coe

Positivity in symmetric webs and block permanents

arXiv math.CO·18 Nov 2026

arXiv:2611.22058v1 Announce Type: new Abstract: We use symmetric webs to prove Marcus's block-permanent inequality for up to four blocks of every size, for five blocks of size at least three, and for any fixed number of blocks above an explicit logarithmic bound on the block size. The proof idea is easy: Bending strands in the Schur relation turns the comparison into a calculation with squared nor

Toroidal Obstructions with No K_5 Minor

arXiv math.CO·18 Nov 2026

arXiv:2611.22089v1 Announce Type: new Abstract: Finding the complete set of forbidden minors for the torus remains an open problem. We determine the complete list of toroidal minor obstructions with no $K_5$ minor and prove that there are exactly $74$, each with between $10$ and $14$ vertices. Combined with the known classification of toroidal obstructions with no $K_{3,3}$ minor, this determines

Directed triangles in oriented graphs without a directed cycle of length $3t$

arXiv math.CO·18 Nov 2026

arXiv:2611.22104v1 Announce Type: new Abstract: For integers $k,\ell\ge 3$, let $\operatorname{ex}(n,\Cdir_k,\Cdir_\ell)$ denote the maximum number of directed cycles of length $k$ in an $n$-vertex oriented graph containing no directed cycles of length $\ell$. Grzesik, Jaworska, Kielak, Kuc and \'Slusarczyk~\cite{GJ} systematically studied the generalized Tur\'an problem for directed cycles and co

Real-Rootedness and Log-Concavity of Zigzag Eulerian Polynomials

arXiv math.CO·18 Nov 2026

arXiv:2611.22110v1 Announce Type: new Abstract: We prove that the zigzag Eulerian polynomials have only real, negative, simple zeros, and hence strictly log-concave coefficients, settling the first two parts of a conjecture of Petersen and Zhuang. Real-rootedness in combinatorics is usually proved inside a single algebraic framework, such as interlacing or stability. Our proof rests on a different

Between proper and strong edge-colorings of graphs with maximum degree at most four

arXiv math.CO·18 Nov 2026

arXiv:2611.22254v1 Announce Type: new Abstract: A $(1^j,2^k)$-packing edge-coloring of a graph $G$ is a partition of its edge set $E(G)$ into $j$ matchings and $k$ induced matchings. It can be viewed as intermediate colorings between proper and strong edge-coloring. The study of this topic on subcubic graphs has drawn considerable attention recently, with many conjectures and open problems propose

The Zaks--Perles--Wills volume conjecture I: three-dimensional lattice polytopes

arXiv math.CO·18 Nov 2026

arXiv:2611.22337v1 Announce Type: new Abstract: We prove the three-dimensional Zaks--Perles--Wills volume bound for lattice polytopes with $k\ge3$ interior lattice points: the Euclidean volume of such a lattice polytope is at most $6(k+1)$, with equality if and only if the polytope is affinely unimodularly equivalent to $\operatorname{conv}(0,2e_1,3e_2,6(k+1)e_3)$. The inequality is strict when th

Minimum degree thresholds for even cycle residues

arXiv math.CO·18 Nov 2026

arXiv:2611.22346v1 Announce Type: new Abstract: Dean's conjecture asserts that, for every integer $m\ge3$, every graph of minimum degree at least $m$ has a cycle whose length is divisible by $m$. This degree bound is best possible for odd $m$. For every integer $k\ge2$, we prove that every graph of minimum degree at least $2k-1$ has a cycle whose length is congruent to $r$ modulo $2k$ for every ev

Asymptotic enumeration of histories and limit laws in two random graph evolution models

arXiv math.CO·18 Nov 2026

arXiv:2611.22535v1 Announce Type: new Abstract: We study growth models for random graphs where the growth is established by vertex or edge creations and where there is no dependence between vertices and edges. Creations are logged by time stamps such that the history of the resulting graph can be reconstructed. We investigate two prototypical models, an undirected and a directed one, called undire

On (Pathwidth, Clique)-boundedness

arXiv math.CO·18 Nov 2026

arXiv:2611.22552v1 Announce Type: new Abstract: We prove that every $(\pw,\omega)$-bounded class of graphs has bounded tree-independence number, answering a question of Be\v{s}ter \v{S}torgel, Dallard, Lozin, Milani\v{c}, and Zamaraev. We deduce this from a bound on the tree-independence number of graphs with neither $\B_\rho$ nor $K_{\sigma,\sigma}$ as an induced minor, where $\B_\rho$ is the com

The Cooperstein conjecture and additive alternating $d$-codes

arXiv math.CO·18 Nov 2026

arXiv:2611.22622v1 Announce Type: new Abstract: Let $\bigwedge^2 V$ be the second exterior power of a vector space $V$ over a finite field. The Cooperstein conjecture asserts a dimension bound for flats external to varieties consisting of points of bounded rank in $\mathrm{PG}(\bigwedge^2 V)$. This geometric problem can be translated into a question about linear spaces of alternating matrices whos

Golomb rulers with real marks: the real and integer optima agree up to ten marks

arXiv math.CO·18 Nov 2026

arXiv:2611.22656v1 Announce Type: new Abstract: A Golomb ruler is a set of integer marks whose pairwise differences are distinct. We let the marks be real numbers and ask that every difference be at least 1 and that any two differences be at least 1 apart. Every integer Golomb ruler satisfies these conditions, so the least length $G_R(n)$ of such a real ruler with $n$ marks is at most the optimal

Quantum $K$-theoretic Whitney relation for Lagrangian Grassmannian

arXiv math.CO·18 Nov 2026

arXiv:2611.21654v1 Announce Type: cross Abstract: We give a quantum $K$-theoretic analogue of the Whitney relation for the torus-equivariant $K$-ring of the Lagrangian Grassmannian. As a consequence, we give a presentation of the torus-equivariant quantum $K$-ring of the Lagrangian Grassmannian. The strategy for obtaining such relations is to use the quantum $K$-theoretic Whitney relation for the

A Proof of the Achlioptas-Friedgut Convergence Conjecture

arXiv math.CO·18 Nov 2026

arXiv:2611.21665v1 Announce Type: cross Abstract: For every fixed integer $q\ge3$, we show that the $q$-colourability transition in a sparse random graph takes place at a limiting edge density, thus proving the Achlioptas-Friedgut convergence conjecture. The proof adapts the argument we recently introduced to settle the satisfiability conjecture.

An upper bound on non-overlapping codes

arXiv math.CO·18 Nov 2026

arXiv:2611.21913v1 Announce Type: cross Abstract: Non-overlapping codes (also known as bifix-free codes or strong comma-free codes) have now been studied for over 60 years as part of information theory, with regular new applications appearing and much recent interest. Let $X$ be a binary non-overlapping code of length $n$. The paper contains a self-contained proof that \[ |X|\leq \left(\frac{5}{6e

Single-Vertex Metropolis on Minor-Free Graphs: A General EPTAS

arXiv math.CO·18 Nov 2026

arXiv:2611.22023v1 Announce Type: cross Abstract: We consider a class of combinatorial optimization problems where the goal is to find a largest induced subgraph with a prescribed property. We assume that the property is preserved by taking induced subgraphs and disjoint unions, holds for all edgeless graphs, and can be tested in polynomial time. We study the single-vertex Metropolis process for t

On Contractibility of Geometric Joins

arXiv math.CO·18 Nov 2026

arXiv:2611.22182v1 Announce Type: cross Abstract: The geometric join of a family of sets in $\mathbb R^d$ is the union of the convex hulls of all colorful sets. For every $d \geq 4$, we construct $\lceil\frac{(d-1)^2}{2}\rceil$ sets in $\mathbb R^d$ whose geometric join is not contractible, disproving the conjecture of B\'ar\'any, Holmsen, and Karasev that the geometric join of at least $d+1$ sets

The injectivity of the Kudla--Millson lift on unitary Shimura varieties

arXiv math.NT·18 Nov 2026

arXiv:2611.21692v1 Announce Type: new Abstract: We prove the injectivity of the Kudla--Millson lift on unitary Shimura varieties over imaginary quadratic fields under some lattice hypotheses. We express integrals of the lift over special cycles as special values of Dirichlet series and deduce injectivity by separating the Fourier coefficients of the cusp forms. We also establish a converse theorem

Bounded functions on the character variety for quadratic extensions of $\mathbb{Q}_p$

arXiv math.NT·18 Nov 2026

arXiv:2611.21796v1 Announce Type: new Abstract: For any finite extension $L$ of $\mathbb{Q}_p$, Schneider--Teitelbaum defined and studied the character variety in $p$-adic Fourier theory. It is a rigid analytic curve over $L$ that parameterizes the set of locally $L$-analytic characters of $o_L$. It is conjectured that all bounded functions on the character variety of Schneider--Teitelbaum come fr

A Little Advice Suffices: Diffie-Hellman Is as Hard as Discrete Logarithm

arXiv math.NT·18 Nov 2026

arXiv:2611.22290v1 Announce Type: new Abstract: Is computing a Diffie-Hellman key as hard as computing a discrete logarithm? Maurer showed that it is, given a few bits of advice, provided that short intervals contain enough integers with only small prime factors; that proviso has stood for thirty years. We remove it. For every prime $p$ there is an advice string of $O(\log p)$ bits, depending only

Abelian varieties with homotheties

arXiv math.NT·18 Nov 2026

arXiv:2611.22466v1 Announce Type: new Abstract: In 1980, Bogomolov proved that the $\ell$-adic Galois image of an Abelian variety over a number field contains an open subgroup of the homotheties. In 1986, Serre refined that result, showing that the homotheties coming from the Galois side were uniformly bounded in $\ell$ inside the homotheties of the codomain of the representation. In a 2007 paper,

Estimates for the Number of Solutions of Algebraic Diophantine Equations: From the Circle Method to the Manin Conjecture

arXiv math.NT·18 Nov 2026

arXiv:1512.07079v3 Announce Type: replace Abstract: This work continues the research of the author on estimates for the number of solutions of algebraic diophantine equations by means of the circle method and develops this line in the geometric direction, towards counting integral points on log Fano varieties. It consists of two parts. Part 1 is the corrected version of the previous work. For diag

Greatest Common Divisors and an Unlikely Intersection Type Conjecture

arXiv math.NT·18 Nov 2026

arXiv:2207.14432v2 Announce Type: replace Abstract: We prove inequalities involving greatest common divisors of functions at integral points with respect to numerically parallel divisors, generalizing a result of Wang and Yasufuku (after work of Bugeaud-Corvaja-Zannier, Corvaja-Zannier, and the second author). In addition to proving results in a broader context than previously considered, we also

On completed homology and a conjecture of Venkatesh

arXiv math.NT·18 Nov 2026

arXiv:2407.04228v2 Announce Type: replace Abstract: Let $F$ be a CM field and $\Pi$ a regular algebraic cuspidal cohomological representation of $\mathbf{G}=\operatorname{PGL}_2/F$. A conjecture of Venkatesh describes the structure of the contribution of $\Pi$ to the homology of the locally symmetric spaces associated to $\mathbf{G}$. We investigate this conjecture in the setting of $p$-adic homol

The Error in a Smooth Weighted Prime Number Formula and Zero-free Regions for the Riemann Zeta Function

arXiv math.NT·18 Nov 2026

arXiv:2505.23795v2 Announce Type: replace Abstract: We study the error bound for a smooth weighted prime number theorem, and its implication to the zero-free region for the Riemann zeta function using the method of Pintz. We also give an application to the average number of smooth weighted Goldbach representations and generalize the result to the case of smooth weighted average k-Goldbach represen

Co-periods and central symmetric cube L-values

arXiv math.NT·18 Nov 2026

arXiv:2507.15279v3 Announce Type: replace Abstract: In this article, we study the co-period integral attached to an automorphic form on $\GL(2)$ and two exceptional theta series on the cubic Kazhdan-Patterson cover of $\GL(2)$. In the local aspect, we show the $\Hom$-space is always of one dimension and conduct the unramified calculations. In the global aspect, we give the Euler decomposition for

Asymptotic statistics for finite continued fractions with restricted digits

arXiv math.NT·18 Nov 2026

arXiv:2512.11357v3 Announce Type: replace Abstract: Zaremba's conjecture concerns a formation of continued fraction expansions for rational numbers with partial quotient bounded by an absolute constant. We present asymptotic estimates for the size of $\epsilon$-thickening of certain fractal sets of bounded-type, which in turn provide a remark on Zaremba's conjecture in an averaging sense. We also

Strong Approximation for the Relative Character Variety of the Four-Times Punctured Sphere

arXiv math.NT·18 Nov 2026

arXiv:2603.04096v4 Announce Type: replace Abstract: We study the orbits of solutions to the Markoff-type equation $$X^2 + Y^2 + Z^2 = XYZ + AX + BY + CZ + D$$ in $\mathbb{F}_p$ for fixed integers $A,B,C,D$ under the group $\Gamma$ generated by \[\begin{split}&V_1: (x, y, z)\mapsto (A + yz - x, y, z),\\ &V_2: (x, y, z)\mapsto (x, B + xz - y, z),\text{ and}\\ &V_3: (x, y, z)\mapsto (x, y, C + xy - z

Consecutive integers free of certain prime factors

arXiv math.NT·18 Nov 2026

arXiv:2606.19863v2 Announce Type: replace Abstract: Let $n_k$ denote the least integer $n>2k$ such that $(n-k)(n-k+1)\cdots(n-1)$ is not divisible by any prime in the interval $(k,2k)$. Confirming a conjecture of Erd\H{o}s, we prove that, for all sufficiently large $k$, $$ n_k > e^{\frac{\log^2 k}{20 \log \log k}}. $$

A sharp inverse theorem for the quadratic large sieve

arXiv math.NT·18 Nov 2026

arXiv:2607.15311v3 Announce Type: replace Abstract: We prove that if $A\subseteq[N]$, $|A|\gg\sqrt N$, and $|A_p|\le p/2+O(1)$ for every prime $p\ll\log N$, then $A$ contains at least $\exp(c\sqrt{\log N}/\log\log N)$ elements in the image of a single integral quadratic $m\pm x^2$. A matching construction shows that this is optimal even when the quadratic may be chosen arbitrarily in $\mathbb{Z}[x

Inverse theorems and non-arithmetic critical pairs for restricted sumsets in $\mathbb{Z}_p$

arXiv math.NT·18 Nov 2026

arXiv:2609.10148v3 Announce Type: replace Abstract: Let $A,B\subset\mathbb{Z}_p$ be nonempty with $|A|\neq|B|$, and let $A\rplus B$ be the set of sums $a+b$ with $a\in A$, $b\in B$ and $a\neq b$. Alon, Nathanson and Ruzsa proved $|A\rplus B|\ge\min\{p,|A|+|B|-2\}$. Liu and Qian conjectured that when $|A|+|B|\le p$ equality forces $A$ and $B$ to be arithmetic progressions with a common difference,

Trivial solutions in Generalized Fermat equations

arXiv math.NT·18 Nov 2026

arXiv:2611.10667v2 Announce Type: replace Abstract: The modular method is a powerful tool to study generalized Fermat equations. Trivial solutions often become an obstruction to the method. While using hypergeometric motives to construct Galois representations, some of these solutions give rise to newforms with complex multiplication. In the present article, assuming a standard conjecture in Darmo

On a tamely ramified local relative Langlands conjecture via categorical representations

arXiv math.NT·18 Nov 2026

arXiv:2510.25231v2 Announce Type: replace-cross Abstract: Let $G$ be a complex reductive group. For a smooth affine spherical $G$-variety $X$ such that the stabilizer of a point in the $B$-orbit under the $B$-action be connected, assume that the unramified relative local Langlands conjecture of Ben-Zvi-Sakellaridis-Venkatesh (BZSV) for $X$ holds. We establish a spectral description of a full subca

How M.C. Escher’s Art Creates Bizarre Mathematical Worlds

Quanta Magazine·18 Nov 2026

The artist had no formal math education, yet as a new exhibition shows, the insights revealed in his artwork became an enduring inspiration to mathematicians. The post How M.C. Escher’s Art Creates Bizarre Mathematical Worlds first appeared on Quanta Magazine

Supercuspidal, discrete, and elliptic densities for reductive groups over non-archimedean local fields

arXiv math.NT·16 Nov 2026

arXiv:2611.09555v2 Announce Type: replace-cross Abstract: Let $G$ be the group of points of a connected reductive group over a non-archimedean local field $F$ of arbitrary characteristic, with residue field of size $q$. For a principal congruence tower $K_n$ attached to a Lie algebra lattice $\mathcal{L}$, the supercuspidal and discrete series proportions of the Plancherel mass of the $K_n$-fixed

Log-concavity of rank and crank statistics for integer partitions

arXiv math.CO·16 Nov 2026

arXiv:2611.17357v1 Announce Type: new Abstract: Let $M(m,n)$ and $N(m,n)$ denote the numbers of partitions of $n$ with crank $m$ and rank $m$, respectively. Ji and Zang [Adv. Math. 2021] conjectured that $M(m,n)$ is log-concave in $m$ for $n\ge72$ and $|m|\le n-72$, and that $N(m,n)$ is log-concave in $m$ for $n\ge73$ and $|m|\le n-73$. In this paper, we prove these two conjectures.

Automatic $n$-dimensional recurrences over finite $p$-groups with negative predecessor coordinates

arXiv math.CO·16 Nov 2026

arXiv:2611.17358v1 Announce Type: new Abstract: We study $n$-dimensional recurrences on $\mathbb{N}^n$ over finite $p$-groups. The rules are ordered products of group endomorphisms, with a $p$-automatic additional sequence and compatible $p$-automatic boundary data. For finite, nonempty, lexicographically positive predecessor sets, we prove automaticity whenever at most one coordinate contains ent

Positive Dual Certificates for Real Separated Subset Sums: Chamber Optimality of the Conway-Guy and Bohman Sets, and Exact Values up to Eight

arXiv math.CO·16 Nov 2026

arXiv:2611.17360v1 Announce Type: new Abstract: Let $f_R(n)$ be the least possible largest element of a set of $n$ positive reals whose $2^n$ subset sums are pairwise at least 1 apart, and let $f_Z(n) \ge f_R(n)$ be the corresponding integer quantity of the Erd\H{o}s distinct subset sums problem. Fixing the signs of all signed relations $\varepsilon\cdot x$, $\varepsilon \in \{-1,0,1\}^n$, decompo

A $19/5$ lower bound for the four-dimensional Erd\H{o}s box problem

arXiv math.CO·16 Nov 2026

arXiv:2611.17378v1 Announce Type: new Abstract: For every power $q\ge2$ of~$2$, we construct a box-free subset of $[q^5]^4$ with $q^{19}$ points, improving the lower-bound exponent in the four-dimensional Erd\H{o}s box problem from $15/4$ to $19/5$. In fact, $[q^5]^4$ partitions into $q$ isomorphic box-free sets. The proof uses a finite-field rectangle lemma and orthogonality in a four-dimensional

Isolation of $k$-cliques in uniform hypergraphs

arXiv math.CO·16 Nov 2026

arXiv:2611.17489v1 Announce Type: new Abstract: A copy of a hypergraph $F$ is called an $F$-copy. For any integers $k$ and $r$ with $2 \leq r \leq k$, let $K_k^r$ denote the complete $r$-uniform hypergraph whose vertex set is $[k] = \{1, 2, \dots, k\}$ (that is, the edges of $K_k^r$ are the $r$-element subsets of $[k]$). Given an $r$-uniform $m$-edge hypergraph $H$, the $K_k^r$-isolation number of

The Ulam sequence grows subexponentially

arXiv math.NT·16 Nov 2026

arXiv:2611.17584v1 Announce Type: cross Abstract: We prove that the $n$-th element of the Ulam sequence, a somewhat mysterious recursively-defined sequence of positive integers, has size $e^{O(\sqrt{n})}$; previous upper bounds were exponential in $n$. Our argument uses an additive-combinatorial lemma, possibly of independent interest, about covering finite difference sets with multiplicatively sh

Weighted Euler transforms, real-rootedness, and $\gamma$-positivity

arXiv math.CO·16 Nov 2026

arXiv:2611.17839v1 Announce Type: new Abstract: For $a>0$ and a polynomial $F$ of degree $m$, let $H_{a,F}$ denote the weighted Euler numerator of $F$, defined as the numerator of the generating function $\sum_{k\ge0}(a)_kF(k)x^k/k!$ with denominator $(1-x)^{a+m}$. For every $a>0$, we show the following preservation result: if the numerators $H_{a,F}$ and $H_{a,G}$ have only real nonpositive zeros

On configurations that are nearly generalised polygons

arXiv math.CO·16 Nov 2026

arXiv:2611.17855v1 Announce Type: new Abstract: Payne (1972) introduced nearly generalised $n$-gons as $(s+1)$-regular bipartite graphs of girth $2n$ with small excess over the Moore bound. Biggs and Ito (1980) proved nonexistence of such graphs if $s > 1$ and $n > 3$, leaving open the existence of regular antipodal planes. We revisit this problem from several equivalent viewpoints. First we show

Goodman-type lower bounds for graph homomorphism densities

arXiv math.CO·16 Nov 2026

arXiv:2611.17885v1 Announce Type: new Abstract: For a finite graph $H$ with $v(H)$ vertices, chromatic number $\chi(H)$, and chromatic polynomial $P_H$, define $\Phi_H(p)=(1-p)^{v(H)}P_H((1-p)^{-1})$. This polynomial interpolates the homomorphism densities of $H$ in balanced complete multipartite graphons. We study the lower bound $t(H,W)\ge\Phi_H(p)$ on the homomorphism density of $H$ in graphons

Perfect Matching Complexes of $3\times 2n$ Grid Graph

arXiv math.CO·16 Nov 2026

arXiv:2611.18058v1 Announce Type: new Abstract: The perfect matching complex of a simple graph $G$ is an abstract simplicial complex whose facets (maximal faces) are precisely the perfect matchings of $G$. In this article, we study the topology of the perfect matching complex of the $3\times 2n$ grid graph and show that it is homotopy equivalent to a wedge of $f_{n-1}$ copies of $(n-1)$-dimensiona

Upper bounds for the number of spanning forests of a graph

arXiv math.CO·16 Nov 2026

arXiv:2611.18076v1 Announce Type: new Abstract: Let $G$ be a simple graph on $n$ vertices, and let $F(G)$ denote the number of spanning forests of $G$. Bencs and Csikv\'ari proved that every $r$-regular graph $G$ with $r\ge 2$ satisfies $F(G)\le r^n$. Motivated by this result, they conjectured that if $G$ has minimum degree at least $3$, then $F(G)\leq \prod_{i=1}^n d_i$, where $(d_1, d_2, \dots,

Graphs attaining Haemers' toughness bound

arXiv math.CO·16 Nov 2026

arXiv:2611.18193v1 Announce Type: new Abstract: Haemers \cite{Haemers2020} conjectured that every connected noncomplete graph $G$ satisfies $t(G)\geqslant\mu_2/(\mu_n-\delta)$, where $t(G)$ is the toughness of $G$, $\mu_2$ and $\mu_n$ are its algebraic connectivity and Laplacian spectral radius, and $\delta$ is its minimum degree. Greaves and Zhu \cite{GreavesZhu2026} recently proved this conjectu

From Diagonal Coloring to Proper Vertex Labelings Distinguishing Adjacent Facial Sums

arXiv math.CO·16 Nov 2026

arXiv:2611.18384v1 Announce Type: new Abstract: In this paper we study proper vertex labelings of 3-connected plane graphs that give distinct boundary-vertex sums to faces sharing an edge. Let $\lambda(G)$ be the least $k$ for which labels from $\{0,\ldots,k\}$ suffice, and let $\laml(G)$ be its arbitrary-real-list counterpart. Our two main results are an eight-element list theorem for fullerenes

Many more odd zeta values are irrational

arXiv math.CO·16 Nov 2026

arXiv:2611.16156v1 Announce Type: cross Abstract: We prove that for any sufficiently large odd integer $s$, there exist at least \[ 2.78 \, \sqrt{\frac{s \log\log s}{\log s}} \] irrational values among $\zeta(3), \zeta(5), \dots, \zeta(s)$, where $\zeta$ is the Riemann zeta function. This improves on the best known estimate by a constant factor times $\sqrt{ \log\log s}$. The proof combines the el

A proof of the Jamneshan-Tao conjecture by embedding nilspaces in nilmanifolds

arXiv math.CO·16 Nov 2026

arXiv:2611.17567v1 Announce Type: cross Abstract: We prove that every compact finite-rank nilspace admits a continuous injective morphism into a toral nilspace of the same step, and hence into a connected filtered nilmanifold. Combining this embedding theorem with the general nilspace inverse theorem, we establish the Jamneshan-Tao conjecture and extend its conclusion to second-countable compact a

Quadratic APN Functions of $\mathbb{F}_2^{10}$ with a Self-Equivalence of Prime Order

arXiv math.CO·16 Nov 2026

arXiv:2611.18358v1 Announce Type: cross Abstract: Almost perfect nonlinear (APN) functions of $\mathbb{F}_2^n$ have the lowest possible differential uniformity. The only known APN permutation in even dimension, in dimension six, is equivalent to a quadratic APN function with a nontrivial linear self-equivalence; no APN permutation is known for even $n \geq 8$. In a published collection of about 3.

Color Refinement Distinguishes Connected Rooted Outerplanar Graphs

arXiv math.CO·16 Nov 2026

arXiv:2611.18391v1 Announce Type: cross Abstract: Color refinement, also known as the $1$-dimensional Weisfeiler-Leman algorithm ($1$-WL), is a classical near-linear-time heuristic for graph isomorphism, which also captures the expressive power of message-passing graph neural networks. A long line of work asks on which graph classes $1$-WL, or its higher-dimensional variant $k$-WL, identifies ever

Refined random matrix conjectures for zeros of $p$-adic $L$-functions

arXiv math.NT·16 Nov 2026

arXiv:2611.17706v1 Announce Type: new Abstract: We make and test the conjecture that for $p$-adic $L$-functions associated to quadratic Dirichlet characters and their Teichm\"uller twists, all local statistics of zeros in the unit disk match those of $p$-adic random matrix eigenvalues. This generalizes the case of the number of zeros in the unit disk previously conjectured by Ellenberg-Jain-Venkat

Equidistribution of Gross lattices of supersingular elliptic curves

arXiv math.NT·16 Nov 2026

arXiv:2611.18167v1 Announce Type: new Abstract: For a prime $p$, we consider two important families of integral quadratic lattices associated to isomorphism classes of supersingular elliptic curves over $\overline{\mathbb{F}_{p}}$, the lattices of endomorphisms of trace zero, and the Gross lattices of endomorphisms. We prove effective equidistribution of the shapes of these lattices as $p\to\infty

The Chabauty--Kim dimension inequality via noncommutative Iwasawa theory

arXiv math.NT·16 Nov 2026

arXiv:2611.18218v1 Announce Type: new Abstract: We establish Kim's conjectural dimension inequality for smooth projective geometrically connected curves $C/\mathbb{Q}$ of genus at least two with a rational basepoint. For every odd prime $p$ of good reduction, we prove that $$\mathrm{dim} H_f^1(G_{\mathbb{Q},\Sigma},U_n^\mathrm{\'et}) < \mathrm{dim}(U_n^{\mathrm{dR}}/F^0)$$ for all sufficiently lar

On Borwein polynomials with multiple roots outside the unit disk

arXiv math.NT·16 Nov 2026

arXiv:2611.18323v1 Announce Type: new Abstract: A Borwein polynomial has coefficients in ${-1,0,1}$ and nonzero constant and leading coefficients. We seek Borwein polynomials having a multiple root outside the unit disk. To this end, we consider the powers $L^2$ and $L^3$ of Lehmer's polynomial $L$, which has a real root $\tau>1$. Since $L$ has exceptionally small Mahler measure, the theorem of Bo

On Zhao's conjectural basis for finite multiple zeta values

arXiv math.NT·16 Nov 2026

arXiv:2611.18536v1 Announce Type: new Abstract: We prove a conjecture by J. Zhao which states that every finite multiple zeta value associated with a nonempty index is a $\mathbb{Q}$-linear combination of $\zeta^{}_{\mathcal{A}}(k_1,\dots, k_r, 2, 1)$, where $k_i\in \{2, 3\}$. Our proof proceeds by constructing a basis for the space of formal multiple zeta values defined by the confluence relation

Machine learning the arithmetic of Boyd's Mahler measure conjectures

arXiv math.NT·16 Nov 2026

arXiv:2608.00615v2 Announce Type: replace Abstract: Boyd conjectured that the Mahler measure of $P_k(x,y)=x+y+\frac{1}{x}+\frac{1}{y}+k$ for $k$ an integer, is given by $r_kL'(E_k,0)$, where $E_k$ is the elliptic curve associated to the zero locus of $P_k$ and $r_k$ is a rational number. We study various arithmetic properties of $r_k$ using a dataset containing the first $250{,}000$ values of $k$,

$\mathbb Z$ is diophantine over $\mathbb Q$ with 26 unknowns

arXiv math.NT·16 Nov 2026

arXiv:2611.14605v2 Announce Type: replace Abstract: Recently, OpenAI proved that Hilbert's Tenth Problem over the field $\mathbb Q$ of rational numbers has a negative solution. Motivated by this work, G. Conant et al. showed that $\mathbb Z$ is diophantine over $\mathbb Q$, i.e., there is an integer-coefficient polynomial $F(x,y_1,\ldots,y_n)$ such that for any $x\in\mathbb Q$ we have $$ x\in\math

Rational isogenies of rank-two Drinfeld modules

arXiv math.NT·16 Nov 2026

arXiv:2611.14873v2 Announce Type: replace Abstract: We determine the $\mathbb{F}_{q}(T)$-rational points on the Drinfeld modular curves $X_{0}(\mathfrak{n})$ of arbitrary level, obtaining a complete classification of rational cyclic isogenies of rank-two Drinfeld $\mathbb{F}_{q}[T]$-modules over $\mathbb{F}_{q}(T)$. As consequences, we prove Schweizer's conjecture on rational torsion, establish op

Weakly special varieties, Campana stacks, and Remarks on Orbifold Mordell

arXiv math.NT·16 Nov 2026

arXiv:2603.28745v2 Announce Type: replace-cross Abstract: We construct the first weakly special surfaces that are not Campana-special, including the complement of the plane curve $x^2y^3 = 1$ in $\mathbb{A}^2$. We prove that the set of $\mathcal{O}_{K,S}$-integral points on this surface is non-dense for every number field $K$ and finite set $S$ of finite places of $K$ if and only if Campana's Orbi

Introducing MathHelm: A Place to discuss AI-generated papers

Terence Tao·14 Nov 2026

[This is a guest post by the MathHelm scientific committee, whose membership is listed at the bottom of this post. -T.] Mathematics depends on our regular conversations with colleagues and with the wider public. They help us share ideas, deepen our collective understanding, see where the field stands, and decide what to explore next. They […]

Lean Grimoire

Terence Tao·12 Nov 2026

Back in July, I started experimenting with using modern coding agents to build a number of mathematical visualization applets. With the extremely hectic events of the last few months, I had to set those projects aside; but I recently found a bit of time to work on one such project that I had started back […]

On the average eccentricity of Eulerian and bipartite Eulerian digraphs

arXiv math.CO·11 Nov 2026

arXiv:2611.12951v1 Announce Type: new Abstract: Let $D$ be an Eulerian digraph of order $n$ and minimum degree $\delta$. We prove that the average eccentricity of $D$ satisfies $\avec(D) \leq \frac{3n}{\delta+1}$, and that $\avec(D) \leq \frac{2n}{\delta}+2$ if $D$ is bipartite. We show that both bounds are best possible apart from an additive constant and the $\delta+1$ versus $\delta+2$ gap (res

Koszul duality and determinant formulas for affine hyperplane arrangements

arXiv math.CO·11 Nov 2026

arXiv:2611.13050v1 Announce Type: new Abstract: For real affine hyperplane arrangements, we prove Lam's determinant conjecture for the inverse Varchenko matrix restricted to bounded chambers. The proof combines Lam's comparison of twisted intersection forms with the period determinant formula of Varchenko, Loeser-Sabbah and Douai-Terao. For normal crossing arrangements, we introduce the taut path

Monochromatic or rainbow triangles in the triangular lattice

arXiv math.CO·11 Nov 2026

arXiv:2611.13066v1 Announce Type: new Abstract: Erd\H{o}s, Graham, Montgomery, Rothschild, Spencer, and Straus conjectured that for each non-equilateral triangle $\operatorname{T}$, every 2-coloring of the plane contains a congruent copy of $\operatorname{T}$ with monochromatic vertex set. We confirm this conjecture for triangles with a ratio $\sqrt{7/3}$ between two side lengths. We further prove

Properties of the Dichromatic Polynomial

arXiv math.CO·11 Nov 2026

arXiv:2611.13273v1 Announce Type: new Abstract: The chromatic polynomial is a well-studied function of graphs whose coefficients, factorization, and other properties are well-known to encode structural information about the underlying graph. An analogous notion of graph colouring exists for directed graphs which is also well-studied, but little is yet known about the corresponding dichromatic poly

Edge-coloring spectra of odd-fold graph covers and counterexamples to a conjecture

arXiv math.CO·11 Nov 2026

arXiv:2611.13394v1 Announce Type: new Abstract: For a loopless multigraph $G$ and an odd integer $\ell\ge3$, let $\Delta(G)$ be the maximum degree of $G$, let $s_\ell(G)$ be the minimum chromatic index of a cyclic $\ell$-fold cover of $G$, and let \begin{align*} L_\ell(G):=\max\left\{ \Delta(G),\ \max_{\substack{S\subseteq V(G)\\ |S|\ge3\text{ odd}}} \left\lceil\frac{2\ell|E(G[S])|}{\ell|S|-1}\rig

Hamilton cycles in vertex-transitive graphs of prime-power order

arXiv math.CO·11 Nov 2026

arXiv:2611.13415v1 Announce Type: new Abstract: A graph is vertex-transitive if, for any two vertices, there is an automorphism mapping one to the other. We prove that every connected vertex-transitive graph of order $p^n$, where $p$ is a prime and $p^n\geq 3$, has a hamiltonian cycle. Our main tool extends Witte's theorem [JCTB (1986)] on Cayley digraphs of $p$-groups.

Claw-free minimal bricks

arXiv math.CO·11 Nov 2026

arXiv:2611.13439v1 Announce Type: new Abstract: A graph $G$ is called a \emph{brick} if it is $3$-connected and $G-\{u,v\}$ has a perfect matching for every pair of distinct vertices $u,v\in V(G)$. A brick is \emph{minimal} if deleting any edge results in a graph that is no longer a brick. A graph is \emph{claw-free} if it contains no induced $K_{1,3}$. Plummer proved that every $3$-connected claw

Divisibility graphs of semigroups as weighted poset blow-ups

arXiv math.CO·11 Nov 2026

arXiv:2611.13455v1 Announce Type: new Abstract: We develop a structural theory of divisibility graphs of arbitrary semigroups. For a semigroup $S$, let $S/{\mathcal J}$ be the poset of Green's ${\mathcal J}$-classes ordered by inclusion of principal ideals,and equip each $\mathcal {J}$-class $J$ with the weight $|J|$. We prove that the divisibility graph ${\operatorname{Div}}(S)$ is obtained from

Log-Concavity in Narayana Transforms and Stack-Sorting Fibers

arXiv math.CO·11 Nov 2026

arXiv:2611.13479v1 Announce Type: new Abstract: Given a permutation $\pi$ of size $n$, let $D_\pi(x)$ denote the descent polynomial of the fiber of $\pi$ under West's stack-sorting map. We prove that $D_\pi(x)$ is ultra-log-concave of order $n-1$ and, therefore, log-concave. More generally, we prove that a multivariate refinement of $D_\pi(x)$ recording ascent tops and descent tops is the basis ge

The minimum number of cycles of length $0$ modulo $k$ in graphs with no proper $k$-coloring

arXiv math.CO·11 Nov 2026

arXiv:2611.13580v1 Announce Type: new Abstract: Consider an integer $k\geq 3$. Toft and Tuza observed that every graph with no proper $k$-coloring has a cycle of length $0$ modulo $k$. Brewster, McGuinness, Moore, and Noel conjectured the following quantitative strengthening: every graph with no proper $k$-coloring has at least $\frac{(k+1)!}{2k}$ cycles whose lengths are divisible by $k$. The con

Triangles without a common vertex

arXiv math.CO·11 Nov 2026

arXiv:2611.13608v1 Announce Type: new Abstract: Let $G$ be a graph with $m$ edges, $t(G)$ triangles, and adjacency spectral radius $\lambda(G)>\sqrt m$. Li, Feng and Peng (2025) conjectured that $t(G)\ge\sqrt m-O(1)$ if no vertex belongs to every triangle of $G$. We prove the stronger bound $t(G)\ge\lambda(G)-C$ for an absolute constant $C$, and give an explicit choice of $C$. The proof bounds the

Judicious $r$-partitions of $r$-uniform hypergraphs

arXiv math.CO·11 Nov 2026

arXiv:2611.13660v1 Announce Type: new Abstract: Bollob\'as and Thomason conjectured that every $r$-uniform hypergraph with $m$ edges admits an $r$-partition such that each class meets at least $rm/(2r-1)$ edges. In this paper, we establish a lower bound of $(11-\sqrt{13})m/18$ for every $r\ge 2$. This improves Haslegrave's bound $rm/(3r-4)$ for every $r\ge 8$.

An automated approach to structure theorems for minimally repetitive rich words

arXiv math.CO·11 Nov 2026

arXiv:2611.13676v1 Announce Type: new Abstract: Recent work on repetitions in rich words has led to the intensive study of the family of infinite rich words $\{{\mathbf u}_d:d\geq 2\}$, where ${\mathbf u}_d$ is the fixed point of the morphism $\varphi_d:\Sigma_d^*\rightarrow \Sigma_d^*$ defined by $\varphi_d(i)=\tt{0}(i+1)$ for $i\in\{\tt{0},\ldots,d-2\}$ and $\varphi_d(d-1)=\tt{0}(d-1)(d-1)$. For

Rotating Walks, Derandomized Squares, and Permutation Conjugated Walks

arXiv math.CO·11 Nov 2026

arXiv:2611.13693v1 Announce Type: new Abstract: Using the recent strong convergence results of Bordenave and Collins (Annals of Mathematics) and Chen et al. (Annals of Mathematics), we study the average case behavior of rotating random walks of Cohen and Maor (STOC 2023) and the derandomized square construction of Rozenman and Vadhan (RANDOM 2005). Concretely, we prove a conjecture of Cohen et al.

The Proof of the Alon--Kim Conjecture

arXiv math.CO·11 Nov 2026

arXiv:2611.13698v1 Announce Type: new Abstract: In 1997, Alon and Kim proposed an asymptotic edge-coloring bound motivated by a bound on the number of edges in intersecting uniform hypergraphs. The Alon--Kim conjecture asserts that, for fixed integers $k\ge t\ge1$ and $\varepsilon>0$, every $k$-uniform multihypergraph $H$ in which any two distinct edges intersect in at most $t$ vertices satisfies

Two Types of Cards in Kelly-Ulam Conjecture

arXiv math.CO·11 Nov 2026

arXiv:2611.13728v1 Announce Type: new Abstract: We consider the case in Kelly-Ulam conjecture where there are only two types of cards in deck. It was possible to prove that graphs with this property are uniquely reconstructed by their card deck.

Beyond Frankl's conjecture: Maximum sum of sizes of cross-intersecting families with restricted conditions

arXiv math.CO·11 Nov 2026

arXiv:2611.13749v1 Announce Type: new Abstract: Let $\mathcal{F}$ and $\mathcal{G}$ be two families of subsets of $[n]$. We say that $\mathcal{F}$ and $\mathcal{G}$ are \emph{cross-intersecting} if $F \cap G \neq \emptyset$ for all $F \in \mathcal{F}$ and $G \in \mathcal{G}$. Let $n, k_1, k_2, m, r, t$ be positive integers satisfying $n > k_1 + k_2$. Suppose that $\mathcal{F} \subseteq \binom{[n]}

Counting $K_4$-saturating non-edges in Nosal graphs

arXiv math.CO·11 Nov 2026

arXiv:2611.13847v1 Announce Type: new Abstract: A non-edge of a $K_4$-free graph is $K_4$-saturating if adding it creates a copy of $K_4$, and $f(G)$ counts these non-edges. Erd\H{o}s and Tuza showed that the minimum of $f$ over $n$-vertex $K_4$-free graphs jumps from zero to a quadratic quantity once the number of edges exceeds $\lfloor n^2/4\rfloor$. Balogh and Liu [J. Combin. Theory Ser. B 109

Congruences for Dedekind numbers

arXiv math.CO·11 Nov 2026

arXiv:2611.13887v1 Announce Type: new Abstract: We study congruence properties of Dedekind numbers $d_n$. Our approach relies on actions of $p$-subgroups of symmetric groups on posets of monotone functions and leads to the congruences $d_{10}\equiv 106\pmod{210}$, $d_{11}\equiv 117\pmod{210}$, and $d_{12}\equiv 12\pmod{30}$. In particular, $d_{11}$ is odd, confirming a claim stated by Yamamoto wit

On the minimum number of entries in a set of maximal mutually orthogonal partial Latin squares

arXiv math.CO·11 Nov 2026

arXiv:2611.13961v1 Announce Type: new Abstract: In superimposed form, a set of $k\ge2$ mutually orthogonal partial Latin squares of order $n$ is said to be maximal if no additional $k$-tuple may be inserted into any empty cell without violating orthogonality or the Latin property. For $k=2$ and $n\ge 21$ it is shown that the minimum number of filled cells in such a square is $\lceil n^2/3 \rceil$.

Treewidth versus Hadwiger number: Graph classes with dominated balanced separators are quasi-linearly treewidth-Hadwiger bounded

arXiv math.CO·11 Nov 2026

arXiv:2611.14070v1 Announce Type: new Abstract: In a hereditary graph class $\mathcal{G}$, the treewidth of a graph in $\mathcal{G}$ is bounded by a function of the size of a largest clique minor of the graph if and only if the class $\mathcal{G}$ excludes some planar graph as an induced minor. Campbell et al. (arXiv 2024) conjectured that such a bounding function can always be chosen to be linear

The uncertainty operator, the Weil ground state and the zeros of zeta: a numerical study and conditional positivity of the Weil quadratic form

arXiv math.NT·11 Nov 2026

arXiv:2611.13129v1 Announce Type: new Abstract: Applying the Dirichlet principle to the Weil quadratic form $QW_\lambda$ on $L^2([\lambda^{-1},\lambda],d^*u)$--using only the primes $p\le\lambda^2$ of the Euler product--yields canonical finite-dimensional Hermitian matrices whose ground state has a Mellin transform with zeros proved real in full generality when the lowest eigenvalue is simple and

Bounding the security of the Bromberg-Shpilrain-Vdovina hash function

arXiv math.NT·11 Nov 2026

arXiv:2611.13459v1 Announce Type: new Abstract: The Bromberg-Shpilrain-Vdovina hash functions are a family of Cayley hash functions indexed by an integer parameter $k\ge 2$. Hashes are matrices in $SL_2(p)$ where $p$ is a large prime. We present an attack which finds collisions of length $O(\log p)$ whose average-case time complexity is $O(p^{0.28})$ when $k=2$ and $O(p^{0.36})$ when $k=3$ under a

A counterexample to the Erd\H{o}s--Mahler conjecture

arXiv math.NT·11 Nov 2026

arXiv:2611.13604v1 Announce Type: new Abstract: We disprove a 1939 conjecture of Erd\H{o}s and Mahler by constructing, for every real $\tau\ge4$, a Cantor set of numbers of irrationality exponent $\tau$, each having infinitely many regular continued-fraction convergents of the form $2^a/3^b$.

Periods and CM motives of abelian type

arXiv math.NT·11 Nov 2026

arXiv:2611.13723v1 Announce Type: new Abstract: We associate algebraic Hecke characters to certain invertible motives for absolute Hodge cycles with coefficients in a number field $K$, reversing a viewpoint of Schappacher. These motives $N$ include abelian motives and a new notion of algebraic motive. This Hecke character determines the complex and the $p$-adic periods of $N$, and is determined by

A Moment Proof of the Hollman-Xiang Conjectures on Kloosterman Polynomials

arXiv math.NT·11 Nov 2026

arXiv:2611.13848v1 Announce Type: new Abstract: Let $F=\F_{2^n}$ and let \[ \mathcal T_1=\{t\in F:\Tr_{F/\F_2}(t)=1\}. \] For an integer $u=\sum_{i=0}^{n-1}u_i2^i$ of even binary weight, put \[ L_u(X)=\sum_{i=0}^{n-1}u_iX^{2^i}, \qquad L_{1,u}(t)=t+L_u(t^{-1}). \] Hollmann and Xiang conjectured that $L_{1,u}$ permutes $\mathcal T_1$ if and only if $u\in\{0,3,6,10\}$. We prove the necessity by a mo

When do all iterates of $x^2 + a$ have maximal Galois group?

arXiv math.NT·11 Nov 2026

arXiv:2611.14014v1 Announce Type: new Abstract: We provide an (in our opinion) simpler proof of the main results of [Stoll1992,Li2020,Li2021] on the question for which integers $a$ the Galois groups of all iterates of $x^2 + a$ are maximal (equivalently, the associated arboreal Galois representation is surjective). At the same time, we extend the results to rational parameters $a$. The main result

Sun's conjecture on a certain ternary quadratic form

arXiv math.NT·11 Nov 2026

arXiv:2611.14161v1 Announce Type: new Abstract: We establish an asymptotic form of Sun's conjecture concerning representations by the ternary quadratic polynomial \[ P(x,y,z)=x(5x+1)+\dfrac{y(5y+1)}{2}+\dfrac{z(5z+1)}{2}. \] More precisely, we prove that every sufficiently large integer is represented by $P$, with an effectively computable threshold. The proof begins by reducing the representation

A complete classification of permutation binomials of the form $X^r(X^{2(q-1)}+a)$ over finite fields

arXiv math.NT·11 Nov 2026

arXiv:2611.14162v1 Announce Type: new Abstract: Let $q$ be a prime power. We determine, for all positive integers $e$ and $r$, the coefficients $a\in\mathbb{F}_{q^e}$ for which $X^r(X^{2(q-1)}+a)$ permutes $\mathbb{F}_{q^e}$. For odd $q$ and $a\ne0$ there are no such permutations when $e\geqslant4$ is even. Over $\mathbb{F}_{q^2}$, with $r$ unrestricted, the permutation binomials are characterized

The exponent $3/4$ for the exceptional sets of the equations $K/n=1/x+1/y+1/z$

arXiv math.NT·11 Nov 2026

arXiv:2611.14167v1 Announce Type: new Abstract: For $K\ge4$ let $E_K(N)$ be the number of integers $2\le n\le N$ for which $K/n=1/x+1/y+1/z$ has no solution in positive integers; $K=4$ is the Erd\H{o}s-Straus equation. We prove that $E_K(N)\le N\exp(-c((\log N)^3/K)^{1/4})$ with absolute constants $c,B>0$, uniformly for $4\le K\le(\log N)^3/B$. This improves the exponent $2/3$ of Vaughan's bound o

The distribution of small gaps between zeros of the Riemann zeta function

arXiv math.NT·11 Nov 2026

arXiv:2611.14486v1 Announce Type: new Abstract: Let $0<\gamma_1\leq \gamma_2\leq \cdots$ be the ordinates of the non-trivial zeros $\rho_n$ of the Riemann zeta function in the upper half-plane, counted with multiplicity. Selberg proved unconditionally that there exists $\lambda_0<1$ such that a positive proportion of the zeros $\rho_n$ satisfy $\gamma_{n+1}-\gamma_n\leq 2\pi \lambda_0/\log \gamma_

Davenport Constants of High-Dimensional Integer Sets

arXiv math.NT·11 Nov 2026

arXiv:2611.14140v1 Announce Type: cross Abstract: The Davenport constant of a finite set of integer vectors is the maximum length of an irreducible zero-sum sequence over that set. For nonempty sets closed under negation, it equals the largest $\ell_1$-norm of a Graver basis element of the matrix formed by those vectors. We study extremal and average-case versions in growing dimension, with applic

The zero-sum constant $\mathsf{s}_p^*$ and inverse problem

arXiv math.NT·11 Nov 2026

arXiv:2611.14248v1 Announce Type: cross Abstract: Let $p$ be an odd prime. We denote by $\mathsf{s}_{p}^{*}$ the smallest integer $l$ such that, out of any given $l$ integers coprime with $p$, one can select $p$ integers satisfying that the sum of the $p$ integers is a multiple of $p$, but not a multiple of $p^{2}$. It was conjectured that $\mathsf{s}_p^*=2p+1$. In this paper we prove this conject

Reconstructing Numerical Semigroups from Circulant Spectral Dimensions

arXiv math.NT·11 Nov 2026

arXiv:2611.14316v1 Announce Type: cross Abstract: The polynomial algebra generated by the spectral moments of a family of circulant graphs consists of all eventually polynomial sequences in the graph order; as an unfiltered algebra, it therefore carries little information about the jumps. We show that its natural power-sum weight filtration retains substantially finer arithmetic data. For a finite

Progression-free sets in class $2$ and arbitrary finite groups

arXiv math.NT·11 Nov 2026

arXiv:2611.14464v1 Announce Type: cross Abstract: We study progression-free sets in arbitrary finite groups. We transfer sharp upper bounds from abelian groups to nilpotent groups of class $2$, and from nilpotent groups to arbitrary groups. Combining a recent result of Raghavan with the author's theorem on large subgroups of class $2$ gives \[ r_3(G) \, \leq \, C \, |G|\exp\left( -c\frac{(\log|G|)

The closure of the nonreal roots of bounded-height polynomials is connected exactly at pronic heights

arXiv math.NT·11 Nov 2026

arXiv:2611.14517v1 Announce Type: cross Abstract: Let C_h be the closure of the nonreal roots of integer polynomials with coefficients of modulus at most h. With the nonzero real roots included, the closure is connected at every height; without them, connectedness becomes arithmetic. We prove that C_h is connected exactly when h=q(q-1) is a pronic number 2, 6, 12, 20, ..., and has at least five co

Class number of real quadratic fields of explicit discriminant

arXiv math.NT·11 Nov 2026

arXiv:2412.06351v2 Announce Type: replace Abstract: In this paper, we study the class numbers of a family of real quadratic fields $\mathbb{Q}(\sqrt{D})$ whose discriminants possess a specific exponential structure. More precisely, the discriminant $D$ is given by $(b(4bs+1)^k+s)^2 + (4bs+1)^k$, where $b$, $s$ and $k$ are positive integers, and $D$ is assumed to be square-free. This non-Richaud-De

An Effective Version of Kronecker's Theorem on the Splitting of Polynomials and the $p$-Curvature Conjecture for Order One Differential Equations

arXiv math.NT·11 Nov 2026

arXiv:2510.00892v3 Announce Type: replace Abstract: We develop an effective version of Kronecker's Theorem on the splitting of polynomials, based on asymptotic arguments proposed by the Chudnovsky brothers, coming from Hermite-Pad\'e approximation. In conjunction with Honda's proof of the $p$-curvature conjecture for order one equations with polynomial coefficients we use this to deduce an effecti

“Six Math Essentials” now available

Terence Tao·10 Nov 2026

My popular mathematics book, “Six Math Essentials” (Six Maths Essentials in the UK), which was previously announced on this blog in February, is now available (in print, digital, and audiobook formats). Some related links: Review by Karmela Padavic-Callaghan (New Scientist) Review (Publishers Weekly) Review (Library Journal) Sample excerpt (via Science Friday), with related podcast interview […]

https://mathstodon.xyz/@tao/117593458177772386

Terence Tao (Mathstodon)·10 Nov 2026

My popular mathematics book, “Six Math Essentials” (Six Maths Essentials in the UK), is now available: https://www.quantabooks.org/books/six-math-essentials/

P\'osa-type resilience for Hamilton Berge cycles in random hypergraphs

arXiv math.CO·9 Nov 2026

arXiv:2611.08525v1 Announce Type: new Abstract: We prove a degree-sequence resilience theorem for Hamilton Berge cycles in random uniform hypergraphs. For every fixed integer $k\ge3$ and every $\gamma>0$, there exists $C=C(k,\gamma)>0$ such that if $C\log n/n^{k-1}\le p\le1$, then asymptotically almost surely every spanning subhypergraph of $H^{(k)}(n,p)$ with increasing vertex-degree sequence $g_

Algorithms for Short Human-Verifiable Proofs of Non-Word-Representability

arXiv math.CO·9 Nov 2026

arXiv:2611.08553v1 Announce Type: new Abstract: A graph is word-representable if it can be represented using alternation of letters in words. The class of word-representable graphs generalizes several important graph families and admits a characterization via semi-transitive orientations. Recognizing word-representability is an NP-complete problem, and a major bottleneck in the theory of word-repr

Evasive subspaces, minimal rank-metric codes and subspace designs via auxiliary fields

arXiv math.CO·9 Nov 2026

arXiv:2611.08627v1 Announce Type: new Abstract: We extend the auxiliary-field method for scattered subspaces to evasive subspaces and subspace designs. For $1\le h\le k<hn$ and coprime $h,k+1$ with $n(k-h+1)\ge k+1$, we construct spanning $(h,k)$-evasive $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^n}^r$ of dimension $rn(k-h+1)/(k+1)$ in every sufficiently large admissible ambient dimension, with a

Reflexive polytopes can have doubly exponentially many vertices

arXiv math.CO·9 Nov 2026

arXiv:2611.08819v1 Announce Type: new Abstract: Reflexive polytopes are lattice polytopes containing the origin in their interior such that also the dual polytope is a lattice polytope. On the basis of low-dimensional observations and of bounds known for special classes of reflexive polytopes, the second author conjectured in 2004 that the number of vertices of $d$-dimensional reflexive polytopes

Jaeger conjecture and Jaeger-Zhang conjecture

arXiv math.CO·9 Nov 2026

arXiv:2611.08862v1 Announce Type: new Abstract: We prove that every signed planar graph $\widehat G$ of negative girth at least $\ell\geq 3$ satisfies $\chi_c(\widehat G)<\frac{2\ell}{\ell-2}$. As a consequence, for every integer $k\geq 1$, every planar graph $G$ of odd girth at least $4k+3$ satisfies $\chi_c(G)<\frac{2k+1}{k}$ and hence admits a homomorphism to $C_{2k+1}$. Our proofs build on rec

Ore-degree conditions for matchings in uniform hypergraphs

arXiv math.CO·9 Nov 2026

arXiv:2611.09064v1 Announce Type: new Abstract: Let $\sigma_r(\mathcal{H})$ be the minimum sum of vertex degrees over all nonedges of an $r$-uniform hypergraph $\mathcal{H}$ on $n$ vertices. Balogh, Palmer and Raeisi conjectured that $n>2rs$ and $\sigma_r(\mathcal{H})>r[\binom{n-1}{r-1}-\binom{n-s}{r-1}]$ imply the existence of a matching of size $s$ in $\mathcal{H}$. We prove that, for every fixe

Quantitative group testing with a fixed shore: sharp asymptotics and exact formulas

arXiv math.CO·9 Nov 2026

arXiv:2611.09076v1 Announce Type: new Abstract: We study adaptive quantitative group testing with one defective item in each of two disjoint sets. When one set has fixed size, we determine the leading term of the difference between the binary bound and the largest searchable opposite set size. The result extends to fixed unions of complete bipartite graphs and to positive weighted sums of the oppo

The Sparse-Complement Conjecture for Two Distinct Eigenvalues

arXiv math.CO·9 Nov 2026

arXiv:2611.09111v1 Announce Type: new Abstract: For a graph $G$, let $q(G)$ be the minimum number of distinct eigenvalues of a real symmetric matrix whose off-diagonal zero--nonzero pattern is $G$. We prove that $q(G)=2$ whenever the complement $H=\overline G$ of a graph of order $n\ge3$ has at most $n-3$ edges, resolving the sparse-complement conjecture of Fallat and Mojallal. If $H$ contains a c

Every IC-planar graph has weak-strict degeneracy at most 6

arXiv math.CO·9 Nov 2026

arXiv:2611.09125v1 Announce Type: new Abstract: We prove that every IC-planar graph has weak-strict degeneracy at most $6$. Weak-strict degeneracy is the weak degeneracy of Bernshteyn and Lee plus one, so it bounds the coloring parameters controlled by weak degeneracy. In particular, every IC-planar graph is $6$-choosable, $6$-DP-colorable and $6$-paintable, which strengthens the theorem of Yang,

On the Motzkin-Straus theorem and clique number for k-uniform hypergraphs

arXiv math.CO·9 Nov 2026

arXiv:2611.09357v1 Announce Type: new Abstract: In this paper, we establish a Motzkin-Straus type equality for k-uniform hypergraphs under certain conditions, which extends the classical Motzkin--Straus theorem for graphs. Using this equality, we present several spectral bounds for the clique number of k-uniform hypergraphs in terms of the spectral radii of the adjacency, signless Laplacian, and L

Macdonald intersections and the $N!/k$ conjecture

arXiv math.CO·9 Nov 2026

arXiv:2611.09638v1 Announce Type: new Abstract: We prove the Frobenius characteristic formula for the intersection of Garsia--Haiman modules predicted in the Science Fiction of Bergeron and Garsia. As a consequence, we resolve the $N!/k$ conjecture. The proof uses the geometry of the Hilbert scheme of points on the plane developed by Haiman.

Fractional Fefferman--Stein inequalities on infinite rooted $k$-ary trees

arXiv math.CO·9 Nov 2026

arXiv:2611.08653v1 Announce Type: cross Abstract: We study weighted endpoint estimates for the centered fractional maximal operator on the infinite rooted $k$-ary tree, $T$. Our first result is a Fefferman--Stein type estimate \[ w\bigl(\{M_\alpha f>\lambda\}\bigr) \lesssim_{\alpha,s} \frac1\lambda\sum_{x\in T}|f(x)|M_{\alpha,s}w(x), \qquad s>1, \] with a constant independent of the branching para

Containment Problems in Convex Sets

arXiv math.CO·9 Nov 2026

arXiv:2611.08835v1 Announce Type: cross Abstract: Let $P$ be a set of $n$ points in the plane, and let $C$ be a compact, convex subset of the plane that contains the origin in its interior. We study the problem of finding two points $p$ and $q$ of $P$ with the property that any homothet of $C$ that contains $p$ and $q$ must contain at least a constant fraction of the points of $P$. We give proofs

Annular webs and Guralnick's conjecture

arXiv math.CO·9 Nov 2026

arXiv:2611.09114v1 Announce Type: cross Abstract: Using annular webs and Kazhdan-Lusztig mu-coefficients, we disprove Guralnick's absolute boundedness conjecture for first cohomology.

Mesoscopic eigenvalue statistics for random regular graphs: a case study

arXiv math.CO·9 Nov 2026

arXiv:2611.09215v1 Announce Type: cross Abstract: We study mesoscopic fluctuations of linear eigenvalue statistics for random $d$-regular graphs on $N$ vertices with fixed $d\ge 3$. Revisiting the approach developed by Dumitriu-Johnson-Pal-Paquette (2013) and Johnson (2015), we establish a mesoscopic central limit theorem in the bulk and identify its universal limiting variance. Our result applies

Unique ergodicity of systems of finite order and the density finite sums theorem in arbitrary abelian groups

arXiv math.CO·9 Nov 2026

arXiv:2611.09333v1 Announce Type: cross Abstract: Let $\Gamma$ be a countable abelian group and $k\geq 1$. We establish that every minimal topological $\Gamma$-system of order $k$ is uniquely ergodic. This result, which was previously only known for finitely generated groups for arbitrary $k$, answers a question of Glasner, Gutman, and Ye and yields the answer to multiple questions by Candela, Gon

Inclusions and intersections of products of verbally prime $T$-ideals

arXiv math.CO·9 Nov 2026

arXiv:2611.09415v1 Announce Type: cross Abstract: We study inclusions and intersections of products of verbally prime $T$-ideals over a field of characteristic zero. Our main tool is a Vandermonde-type construction of graded polynomials with a uniformly bounded number of variables. Together with a reduction to finite exterior algebras, this construction yields separating polynomials that work unif

The BCC lattice is the optimal 3D lattice quantizer for all $p\geq1$

arXiv math.CO·9 Nov 2026

arXiv:2611.09523v1 Announce Type: cross Abstract: For every finite $p\ge1$, the body-centered cubic lattice uniquely minimizes the $p$th moment of the Voronoi cell among three-dimensional lattices of covolume one, up to orthogonal transformations. This proves the Graf--Luschgy conjecture for three-dimensional lattice quantizers (\cite{GL}).

What remains of the planar induced minor conjectures?

arXiv math.CO·9 Nov 2026

arXiv:2611.09627v1 Announce Type: cross Abstract: Dallard, Milani\v{c}, and \v{S}torgel, and independently Gartland and Lokshtanov, conjectured that for every planar graph $H$, Maximum Weight Independent Set and List $3$-Coloring are polynomial-time solvable in $H$-induced-minor-free graphs. As a structural explanation, Gartland and Lokshtanov further conjectured that such graphs admit balanced se

An Expander Mixing Lemma for Directed Graphs via Transition Matrices

arXiv math.CO·9 Nov 2026

arXiv:2511.01738v2 Announce Type: replace Abstract: We establish an Expander Mixing Lemma for directed graphs in terms of the eigenvalues of a transition matrix, extending the classical spectral inequality to the non-symmetric setting. This formulation works with the complex spectrum of the transition matrix and incorporates the conditioning of its eigenbasis through a condition number. For connec

Absolute incidence theorems and tilings

arXiv math.CO·9 Nov 2026

arXiv:2512.14316v2 Announce Type: replace Abstract: We give a precise definition of incidence theorems in plane projective geometry and introduce the notion of absolute incidence theorems, which hold over any ring. Fomin and Pylyavskyy describe how to obtain incidence theorems from tilings of an orientable surface; they call this result the master theorem. Instances of the master theorem are alway

Biregular bipartite multigraphs and matchings in tensor products of bipartite graphs

arXiv math.CO·9 Nov 2026

arXiv:2603.18253v2 Announce Type: replace Abstract: We answer a question of P. Higgins on permutations and involutions in binary arrays, arising in the study of regular finite semigroups. For a binary rectangular matrix M, we prove that if there is a permutation pi(x, y) = (f(x, y), g(x, y)) of its cells satisfying M(x, g(x,y)) = 1 for every cell, then there is an involution with the same property

Composite witness sieves, Kneser--Plancherel containers, and the exponent $5/7$ for the Erd\H{o}s--Straus conjecture

arXiv math.NT·9 Nov 2026

arXiv:2611.08717v1 Announce Type: new Abstract: For the Erd\H{o}s--Straus equation $4/n=1/x+1/y+1/z$, Vaughan's unconditional bound on the exceptional set $E(N)$ has stood at $|E(N)|\ll N\exp(-c(\log N)^{2/3})$ since 1970. We harness composite divisor witnesses at growing depth to cross this $2/3$ barrier unconditionally. On the full exceptional set $E(N)$, we prove the unconditional bound $|E(N)|

Joint Approximation and the Mixed-Prime Character Group

arXiv math.NT·9 Nov 2026

arXiv:2611.08964v1 Announce Type: new Abstract: For the integer metric defined by the square denominators of two distinct primes, we prove simultaneous approximation to zero in one prime metric and to any prescribed integer in the other. A normalized convolution argument gives a uniform central spectral bound. Random relative translations of smooth weights produce an exact positive cas cade; Fouri

An Elementary Proof of the Binary Goldbach Conjecture

arXiv math.NT·9 Nov 2026

arXiv:2611.09007v1 Announce Type: new Abstract: We establish the binary Goldbach conjecture which asserts that every even positive integer greater than four can be expressed as a sum of two odd primes. This goal is achieved by proving that the number of ordered Goldbach pairs that add up to $2n$ is an $\mathcal{O}\left(\frac{n}{\ln^{2} n}\right)$ function. As an application, we provide a simpler v

The existence of small defining polynomials for number fields, II

arXiv math.NT·9 Nov 2026

arXiv:2611.09031v1 Announce Type: new Abstract: We prove that every number field of odd degree $n\geq 3$ and absolute discriminant $D$ has an integral defining polynomial whose coefficients are $O_n(D^{(n-1)/(2n-1)})$ in size. This strengthens, in odd-degree cases, the recently established bound of $O_n(D^{1/2})$ for all degrees $n$, which was conjectured in 1998 by Ruppert and is now known to be

Elliptic units, derived Heegner classes and the p-adic Birch and Swinnerton-Dyer quotient of CM elliptic curves of rank two

arXiv math.NT·9 Nov 2026

arXiv:2611.09192v1 Announce Type: new Abstract: Let $E\colon y^2=x^3-Dx$ have rank two and let $p\equiv1\pmod4$ be a prime of good reduction. We study the conjecture that the $p$-adic quotient $q_p$, the leading coefficient of the cyclotomic $p$-adic $L$-function divided by the Euler factor and the $p$-adic regulator, equals the complex quotient $q_\infty=L''(E,1)/(2\Omega_E\mathrm{Reg}_\infty)$,

Root sharing and $2$-adic interpolation for Legendre polynomials

arXiv math.NT·9 Nov 2026

arXiv:2611.09312v1 Announce Type: new Abstract: Stieltjes's conjecture on Legendre polynomials asserts that no two distinct Legendre polynomials can share a nonzero root. This question is, surprisingly, connected to a number of disparate mathematical areas. From the point of view of spectral geometry, this question concerns zero-sets of spherical harmonics. A disk counterpart to the conjecture is

The exceptional set of Goldbach numbers among polynomial values

arXiv math.NT·9 Nov 2026

arXiv:2611.09386v1 Announce Type: new Abstract: Let $\phi$ be a fixed polynomial with integer coefficients, positive leading coefficient and degree $k\geq2$. We prove that the values $2\phi(n)$, $1\leq n\leq N$, can be written as the sum of two primes, apart from at most $N^{\alpha_k+o(1)}$ exceptional indices, where $\alpha_k4$ it is $1-1/(k+1)$. The proof combines a fourth-moment estimate over p

On a Problem of Gordon and Hughes: The 11-adic Properties of Meromorphic Modular Functions on $\mathrm{X}_0(22)$

arXiv math.NT·9 Nov 2026

arXiv:2611.09681v1 Announce Type: new Abstract: Congruence families occur throughout the theory of modular forms. These families superficially resemble one another, though they can vary substantially in their overall difficulty. One major complication resides in the topology of the modular curve associated with a given congruence family. All previously studied families are associated with curves o

Harper's beyond square-root conjecture for random matrices

arXiv math.NT·9 Nov 2026

arXiv:2611.09753v1 Announce Type: new Abstract: For a Haar unitary matrix $U_N$ of size $N$, we prove that the first absolute moment of $\operatorname{tr}(\operatorname{Sym}^k U_N)$ tends to zero as $\min(N,k)\to\infty$. This settles the random matrix version of Harper's beyond square-root conjecture formulated by Wang and Xu, with no restriction on $k/N$. The proof is elementary and self-containe

A counterexample to Manin's Conjecture for almost Fano varieties

arXiv math.NT·9 Nov 2026

arXiv:2611.08890v1 Announce Type: cross Abstract: We give an example of a smooth rational threefold over a number field with a big anticanonical divisor that does not satisfy the thin set version of Manin's Conjecture. In particular, Manin's Conjecture does not hold for rationally connected almost Fano varieties.

Cuspidal sections for varieties of arbitrary dimension

arXiv math.NT·9 Nov 2026

arXiv:2611.09080v1 Announce Type: cross Abstract: We define cuspidal sections for varieties of arbitrary dimension over fields of characteristic zero, extending the definition for curves by Grothendieck. Our notion of cuspidal sections is defined relative to a normal crossings compactification. We prove that the closure of the resulting set is independent of the choice of a compactification. For v

One complex metric and geometric adelic nefness

arXiv math.NT·9 Nov 2026

arXiv:2611.09319v1 Announce Type: cross Abstract: We prove that an arithmetic adelic line bundle on a smooth quasi-projective variety over a number field has nef geometric part if its prescribed continuous metric at one complex embedding has semipositive first Chern current. The proof constructs semiample approximations to every positive rational ample perturbation by boundary extension, multiplie

Qin's Algorithm, Continued Fractions and 2-dimensional Lattices

arXiv math.NT·9 Nov 2026

arXiv:2310.09103v3 Announce Type: replace Abstract: In his ``Mathematical Treatise in Nine Sections''(1247), Jiushao Qin introduced ``the Dayan method of deriving unity'' for computing modular inverses, an essential component of his treatment of the Chinese remainder theorem. A distinctive feature of Qin's algorithm is its use of a state consisting of four nonnegative integers arranged in a matrix

A GL(3) converse theorem via a "beyond endoscopy" approach

arXiv math.NT·9 Nov 2026

arXiv:2401.04037v3 Announce Type: replace Abstract: We give a new proof of the converse theorem for Maass forms on ${\rm GL}(3)$ using a technique that is inspired by Langlands' philosophy of "beyond endoscopy", thereby implementing these ideas for the first time in a higher rank setting.

Triple product $p$-adic $L$-functions for finite slope families and a $p$-adic Gross-Zagier formula

arXiv math.NT·9 Nov 2026

arXiv:2403.18620v2 Announce Type: replace Abstract: In this paper, we generalize two results of H. Darmon and V. Rotger on triple product $p$-adic $L$-functions associated with Hida families to finite slope families. We first prove a $p$-adic Gross-Zagier formula, then demonstrate an application to a special case of the equivariant Birch and Swinnerton-Dyer conjecture for supersingular elliptic cu

Values of ternary quadratic forms at integers and the Berry-Tabor conjecture for 3-tori

arXiv math.NT·9 Nov 2026

arXiv:2601.03209v2 Announce Type: replace Abstract: Berry and Tabor conjectured in 1977 that spectra of generic integrable quantum systems have the same local statistics as a Poisson point process. We verify their conjecture in the case of the two-point spectral density for a quantum particle in a three-dimensional box, subject to a Diophantine condition on the domain's proportions. A permissible

Generalized Fermat equation over cyclotomic $\mathbb{Z}_l$-extensions of totally real fields

arXiv math.NT·9 Nov 2026

arXiv:2605.20860v3 Announce Type: replace Abstract: Let $K$ be a totally real field of odd degree $m$ in which $2$ is inert. Let $l\geq5$ be a prime totally ramified in $K$ with $\gcd(m,l(l-1)/2)=1$ and $2^{l-1}\not\equiv1\pmod{l^2}$. We prove the asymptotic Fermat's Last Theorem over every layer $K_{n,l}$, $n\geq1$, of the cyclotomic $\mathbb{Z}_l$-extension of $K$. Using $S$-unit bounds, we also

Divisor moments of polynomials in Fourier coefficients of modular forms

arXiv math.NT·9 Nov 2026

arXiv:2607.18832v2 Announce Type: replace Abstract: We study higher moments of the divisor function evaluated at polynomial expressions in the Fourier coefficients of a non-CM newform. The logarithmic exponent appearing in our estimates depends only on the number of irreducible factors of the polynomial and remains unchanged under a Sato--Tate restriction. The proof combines an effective Chebotare

Sieve dimension and search depth for the Erd\H{o}s-Straus conjecture, $n \equiv 1 \pmod{24}$

arXiv math.NT·9 Nov 2026

arXiv:2608.24035v2 Announce Type: replace Abstract: For primes $n\equiv1\pmod{24}$, we study the depth of explicit, factorization-free searches for a decomposition of $4/n$ into three positive unit fractions. Let $E_2(N;J)$ be the set of such primes $n\le N$ for which no coprime pair $1\le u,a\le J$ admits a divisor $s\mid an+u$ with $s\equiv-1\pmod{4ua}$. For every fixed $J$, we prove $|E_2(N;J)|

Reasonable bounds for Restricted Polynomial Progressions in $\mathbb F^n_p$

arXiv math.NT·9 Nov 2026

arXiv:2610.12831v3 Announce Type: replace Abstract: 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

Finite Fields: Root Sets, Frobenius, and Algebraic Structure

arXiv math.NT·9 Nov 2026

arXiv:2610.36727v2 Announce Type: replace Abstract: This monograph develops finite field theory through root sets, Frobenius orbits, trace duality, and cyclic modules, with applications to polynomial constructions and algebraic coding theory. Root-set descent and linearized polynomials connect field extensions, normal bases, invariant subspaces, and linear recurrences. Cyclotomic cosets link addit

The Quantum Pendulum of Turbulent Flow: Decaying turbulence as a thermal state of an integrable system

arXiv math.NT·9 Nov 2026

arXiv:2607.05745v5 Announce Type: replace-cross Abstract: We present a theory of decaying turbulence in which the statistics of a classical flow becomes quantum mechanics in loop space. The loop functional, the average of $e^{\mathrm{i}\Gamma/\nu}$ for the circulation $\Gamma$ around a loop, is the wave function, and the Navier-Stokes equation becomes the linear loop equation. An exact operator id

Modular Existential Closedness

arXiv math.NT·9 Nov 2026

arXiv:2610.35409v2 Announce Type: replace-cross Abstract: We prove the Modular Existential Closedness conjecture for the modular $j$-function extended from the upper half-plane to $\mathbb{C} \setminus \mathbb{R}$ by Schwarz reflection. Specifically, we show that any system of equations involving the field operations and $j$ has solutions in the complex numbers unless it is overdetermined. Such a

Our Survey of Early Career Mathematicians

Terence Tao·9 Nov 2026

[This is a guest post by Anna Brandenberger, Hanna Mularczyk, and Dora Woodruff (MIT). This blog post was initially written in a different file format and converted using AI. — T.] In late September and early October, we distributed a survey of early career mathematicians. Our goals were to take a “temperature check” of the […]

A uniform double-factorial construction for consecutive-pattern packings

arXiv math.CO·6 Nov 2026

arXiv:2611.06937v1 Announce Type: new Abstract: For every overlap $m\geq 3$ and every pattern length $K\geq 2m+1$, we construct an explicit permutation $p\in\mathfrak{S}_K$ such that the number of permutations containing $j$ prescribed occurrences of $p$, with successive starts separated by $K-m$, is $(2j-1)!!$ for every $j\geq 1$. Additional occurrences are permitted. We prove that the correspond

Hypergraphs with zero uniform Tur\'an density at intermediate levels

arXiv math.CO·6 Nov 2026

arXiv:2611.06964v1 Announce Type: new Abstract: An $r$-uniform hypergraph $H$ is uniformly dense with respect to $j$-graphs if, up to a small error, at least a prescribed proportion of the $r$-cliques of every $j$-uniform hypergraph on the same vertex set are edges of $H$. For a forbidden hypergraph $F$, its uniform Tur\'an density at level $j$ is the supremum of these density bounds over arbitrar

Every $r$-regular Hamiltonian graph with $r\geq 17$ contains a second Hamilton cycle

arXiv math.CO·6 Nov 2026

arXiv:2611.06985v1 Announce Type: new Abstract: A conjecture of Sheehan states that every Hamiltonian $4$-regular graph contains a second Hamilton cycle. A natural problem is to find the smallest positive integer $k$ such that every Hamiltonian $r$-regular graph contains a second Hamilton cycle when $r\geq k$. Thomassen proved that $k\leq 300$. Improving Thomassen's result, Haxell, Seamone, and Ve

Seeking the dense half in $K_4$-free graphs

arXiv math.CO·6 Nov 2026

arXiv:2611.07082v1 Announce Type: new Abstract: We show that every $K_4$-free graph on $n$ vertices has a balanced bipartition such that neither part contains more than $0.0671n^2 + o(n^2)$ edges. This improves the previous best bound of $0.074n^2$ by Xu and Zhang. We also formulate a conjecture that the tight bound for this problem is $\frac{425}{6498}n^2 \approx 0.0654n^2$, and present a constru

An improved lower bound for maximal partial Room squares

arXiv math.CO·6 Nov 2026

arXiv:2611.07117v1 Announce Type: new Abstract: We establish a new asymptotic lower bound for the volume of a maximal partial Room square of even order $n$. We prove that its volume is at least $\frac{2\sqrt{66}-6}{57}n^2-O(n)$, improving the leading coefficient $1/8$ in the lower bound obtained by Meszka and Rosa. The proof combines two counting arguments, one based on a transversal of empty cell

An improved bound for the intersection of two longest cycles in $k$-connected graphs

arXiv math.CO·6 Nov 2026

arXiv:2611.07145v1 Announce Type: new Abstract: A conjecture attributed to Smith states that in every $k$-connected graph, every pair of longest cycles intersects in at least $k$ vertices. We prove that every two longest cycles in a $k$-connected graph on $n$ vertices intersect in at least $\min\{k,10k-n-30\}$ vertices. Consequently, Smith's conjecture holds whenever $k\ge \frac{n+30}{9}$. This im

On Packed Passenger Permutations

arXiv math.CO·6 Nov 2026

arXiv:2611.07204v1 Announce Type: new Abstract: An occupied seat in a binary row is called packed if both of its immediate neighbors are occupied. We give a self-contained combinatorial account of this statistic, equivalently the number of overlapping occurrences of 111. An occupied-block decomposition yields a coefficient formula at fixed occupancy and a direct proof of the sharp minimum max{0,3m

Rational Tur\'an exponents of a single $k$-uniform hypergraph

arXiv math.CO·6 Nov 2026

arXiv:2611.07290v1 Announce Type: new Abstract: For a fixed $k$-uniform hypergraph $F$, let $\mathrm{ex}_k(n,F)$ denote the maximum number of edges in an $F$-free $k$-uniform hypergraph on $n$ vertices. We prove that for every integer $k\ge2$ and every rational $r\in[0,1]$ there exists a $k$-uniform hypergraph $F_{k,r}$ such that \begin{equation*} \mathrm{ex}_k(n,F_{k,r})=\Theta(n^{k-r}). \end{equ

On the number of edges in quasiplanar graphs

arXiv math.CO·6 Nov 2026

arXiv:2611.07314v1 Announce Type: new Abstract: A $k$-quasiplanar graph is a graph drawn in the plane with no $k$ pairwise crossing edges. Pach, Shahrokhi, and Szegedy conjectured that every such graph on $n$ vertices has $O_k(n)$ edges. ChatGPT produced a proof of this conjecture. Here, we present a simplified, self-contained version of that proof.

Generalized Chromatic Polynomials of Cycles and uni-cyclic Graphs

arXiv math.CO·6 Nov 2026

arXiv:2611.07568v1 Announce Type: new Abstract: In \cite{R81}, Read obtained an explicit formula for the generalized chromatic polynomials of cycle graphs using the classical deletion-contraction principle. In this paper, we take a linear-algebraic approach and present a new proof of Read's formula by realizing the generalized chromatic polynomials of cycle graphs as traces of certain linear opera

On the classification of $2$-distance-primitive graphs of small valency

arXiv math.CO·6 Nov 2026

arXiv:2611.07733v1 Announce Type: new Abstract: A non-complete vertex-transitive graph is called 2-distance-primitive if a vertex stabilizer acts primitively on both the first and second distance neighborhoods of the vertex. Recently, Ruan, Liu and Jin [Discrete Math. 347 (2024), 113978] showed that every connected 2-distance-primitive graph of valency at most 9 either belongs to certain known fam

A Murnaghan--Nakayama rule for dual stable Grothendieck functions

arXiv math.CO·6 Nov 2026

arXiv:2611.07795v1 Announce Type: new Abstract: We give a closed boundary formula for multiplication by power sums in the dual stable Grothendieck basis. The off-diagonal coefficients are signed binomial coefficients supported on corner-connected broken ribbons, which are skew diagrams connected through edges or vertices and containing no square of four boxes. For such a diagram, the smallest powe

The parity of the number of missing integers in partitions

arXiv math.NT·6 Nov 2026

arXiv:2611.07908v1 Announce Type: cross Abstract: Missing integers in partitions have been studied by many authors. A missing integer of a partition is a positive integer smaller than its largest part that does not occur as a part. We investigate parity biases for the number of missing integers in partitions and overpartitions. For every integer $c\ge2$, we prove that the coefficients $a_c(n)$ of

Clique partitions and distinct color sets in list colorings

arXiv math.CO·6 Nov 2026

arXiv:2611.07924v1 Announce Type: new Abstract: For an \(n\)-vertex graph \(G\) and an integer \(m\ge n\), let \(f'(G,m)\) be the minimum number of distinct color sets used by proper colorings from \(m\)-element lists that are disjoint at distinct nonadjacent vertices. A clique-partition assignment gives a common list to the vertices of each part of a clique partition and uses disjoint lists on di

Few-Weight Linear Sets and Divisibility of Rank-Metric Codes

arXiv math.CO·6 Nov 2026

arXiv:2611.08044v1 Announce Type: new Abstract: We study $\mathbb F_q$-linear sets whose positive point weights belong to a prescribed finite set $A$. The integer $e=\gcd(A)$ always divides the rank of the defining subspace, but the divisibility does not by itself imply linearity over $\mathbb F_{q^e}$. We show that it does in a broad parameter range. Let $L_U$ be an $\mathbb F_q$-linear set of ra

Diameter bounds for complexes that are close to flag or close to normal

arXiv math.CO·6 Nov 2026

arXiv:2611.08071v1 Announce Type: new Abstract: The Hirsch problem asks how large the diameter of the dual graph of a simplicial complex can be, in terms of its number of vertices. For normal complexes, the classical bounds are the Larman-Barnette bound, which is linear for fixed dimension, the Kalai-Kleitman bound, which is quasi-polynomial, and the Adiprasito-Benedetti bound n-d, which however h

The probabilistic bound for perfect hashing is sharp only for binary alphabets

arXiv math.CO·6 Nov 2026

arXiv:2611.08230v1 Announce Type: new Abstract: We investigate the optimal asymptotic rate $R_q$ of perfect $q$-hash codes, a fundamental extremal problem in combinatorics, information theory, and computer science. Let $B_q=-\log_2(1-q!/q^q)/(q-1)$ denote the classical probabilistic lower bound. We prove that $R_q=B_q$ if and only if $q=2$, establishing an explicit strict improvement for every $q\

On Amoebas and the Arithmetic Rigidity of the Mahler Measure

arXiv math.NT·6 Nov 2026

arXiv:2611.07181v1 Announce Type: new Abstract: We develop a geometric rigidity theory for Mahler measure based on the global structure of Ronkin functions and amoebas. Our starting point is the theorem of Ronkin describing the affine linearity of the Ronkin function on the complement of the amoeba and the identification of its gradients with lattice points of the Newton polytope. Combining this d

On explicit units in a family of cubic fields and the arithmetic of curves arising from powers of these units

arXiv math.NT·6 Nov 2026

arXiv:2611.07333v1 Announce Type: new Abstract: For an integer $b\neq0,1$ let $K_b$ be the cubic field generated by the unique real root of $x^3-3bx-b^3$, let $\eta_0$ be its fundamental unit, and let $\eta_b$ be the explicit unit studied in the companion paper (arXiv:2609.37389). Write $\eta_b=\eta_0^{n(b)}$. Deciding whether $n(b)$ is divisible by $q$ amounts to finding the integral points of a

Periodic counting, carry synchronization, and primes in nonstandard numeration systems

arXiv math.NT·6 Nov 2026

arXiv:2611.07446v1 Announce Type: new Abstract: Let $b\ge2$ be an integer and let $D\subset\mathbb{N}_0$ be a finite digit set containing zero, with maximum residue multiplicity $\mu=\max_{0\le r<b}\#\{d\in D:d\equiv r\pmod b\}$ and cardinality $q=\#D\ge2$. Under the condition $\mu<q$, we prove that the summatory representation function satisfies an asymptotic formula with a strictly positive, H\"

The minimal excludant and the least $r$-gaps of $\ell$-regular partitions

arXiv math.NT·6 Nov 2026

arXiv:2611.07871v1 Announce Type: new Abstract: The minimal excludant (mex) of an integer partition $\lambda$ is the smallest positive integer that is not a part of $\lambda$. In this paper we study an analogue of this statistic for $\ell$-regular partitions with $\ell\geq2$, that is, partitions in which no part is divisible by $\ell$. Recently, Meher \cite{Meher} defined the minimal excludant for

Towards a twistless converse theorem

arXiv math.NT·6 Nov 2026

arXiv:2611.07921v1 Announce Type: new Abstract: We prove a finiteness theorem for Dirichlet series satisfying the Euler product, analytic continuation, and functional equation expected of a holomorphic newform. For any fixed level $N$, even weight $k$, and exponent $\sigma$, only finitely many such series have Dirichlet coefficients $\ll n^\sigma$. No hypotheses on twists by Dirichlet characters a

Arithmetic theta products and doubling at arbitrary level

arXiv math.NT·6 Nov 2026

arXiv:2611.08243v1 Announce Type: new Abstract: We prove an arithmetic doubling identity for the standard arithmetic theta series on $X_0(N)$ at arbitrary positive level, with constant $\psi(N)/24$ for the fixed genus-two Eisenstein series. The product comparison covers all pairs of integral indices. At rank zero, an explicit Epstein zeta correction agrees with the middle Bruhat orbit of the Eisen

Density and holes of the visible points in certain cut-and-project sets

arXiv math.NT·6 Nov 2026

arXiv:2611.08257v1 Announce Type: new Abstract: We study the set of visible points from the origin in certain cut-and-project sets, specifically the density of the set. We generalize to all real quadratic number fields the formulas for the density found by G. Hammarhjelm, and the corresponding error bounds proved by I. Gringlaz, R. Kumar, B. Weiss. We also find the possible densities of the set of

$p$-parity conjecture for Panchishkin Galois representations

arXiv math.NT·6 Nov 2026

arXiv:2611.08316v1 Announce Type: new Abstract: Let $p$ be an odd prime, and let $V_1$ and $V_2$ be symplectic self-dual $p$-adic de Rham representations of $G_{\mathbb{Q}}$ that are pure (of weight $-1$) and satisfy the Panchishkin condition at $p$. Suppose that $V_1$ and $V_2$ are residually isomorphic, compatibly with their Panchishkin filtrations. We prove the relative $p$-parity conjecture re

Counting multigeodesics and the Selberg-Delange method

arXiv math.NT·6 Nov 2026

arXiv:2611.08165v1 Announce Type: cross Abstract: We study the counting function $\mathcal{P}^m(X,x)$ for $m$-multigeodesics of length at most $x$ on a compact hyperbolic surface $X$ where $m$ is a positive integer. Building on the Selberg-Delange method, originally developed for counting integers with exactly $m$ prime factors in the interval $[1,x]$, we prove a large $x$ asymptotic for $\mathcal

Fermat quotients with CM Jacobians and trivial automorphism group

arXiv math.NT·6 Nov 2026

arXiv:2611.08176v1 Announce Type: cross Abstract: Let $F_n$ be the Fermat curve of degree $n$ over $\mathbb Q$, and let $D_n=F_n/S_3$ be its quotient by coordinate permutations. We prove that $D_n$ has trivial geometric automorphism group for every $n\ge 11$ with $\gcd(n,6)=1$. Its Jacobian has complex multiplication. For $n=11$, this Jacobian is absolutely simple of dimension five. We construct a

A Collatz-type conjecture on the set of rational numbers (revised and extended version)

arXiv math.NT·6 Nov 2026

arXiv:1010.3692v2 Announce Type: replace Abstract: Let $\theta(x)=(x-1)/3$ if $x\ge1$ and $\theta(x)=2x/(1-x)$ if $0\le x<1$. We conjecture that the $\theta$-orbit of every nonnegative rational number ends in $0$. A weaker conjecture asserts that no map in the semigroup generated by $3x+1$ and $x/(x+2)$, other than the generators' powers, has a positive rational fixed point; equivalently, the only

The infinitude of square-free palindromes

arXiv math.NT·6 Nov 2026

arXiv:2601.07097v3 Announce Type: replace Abstract: We settle an open problem regarding palindromes; that is, positive integers which are the same when written forwards and backwards. In particular, we prove that for any fixed base $b\geq 2$, there exist infinitely many square-free palindromes in base $b$. We also provide an asymptotic expression for the number of such integers $\leq x$. The core

Semistable Reduction Theorem for Overconvergent $F$-isocrystals over Laurent Series Fields

arXiv math.NT·6 Nov 2026

arXiv:2604.17799v2 Announce Type: replace Abstract: We prove the semistable reduction theorem for $\mathcal{E}^{\dag}_K$-valued and $K$-valued overconvergent $F$-isocrystals over $k((t))$-varieties which were introduced by Lazda and P\'{a}l. As an application, we prove the finite dimensionality of $\mathcal{E}^{\dag}_K$-valued rigid cohomology with compact support.

Irrationality exponents of logarithms of positive rational numbers

arXiv math.NT·6 Nov 2026

arXiv:2610.10192v3 Announce Type: replace Abstract: We study rational approximation to logarithms of positive rational numbers and give a separated-weight determinant argument for $\mu(\log r)=2$ whenever $r\in\mathbb Q_{>0}\setminus\{1\}$. The geometric input is an interpolation theorem for logarithmic jets at points with distinct multiplicative coordinates. Its successive weight thresholds are i

Smooth numbers in simultaneous arithmetic progressions

arXiv math.NT·6 Nov 2026

arXiv:2611.01522v2 Announce Type: replace Abstract: 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)^Cx^{407/720}$.

More posts

Terence Tao·6 Nov 2026

Pavel Etingof, “Use of AI in Mathematical Research: A Guide for Young Mathematicians” Anna Gilbert, “Math qua math“ Anna Gilbert, “Mathematical criticism“ Larry Guth, “What math means to me“ Atoosa Kasirzadeh, “A New Dawn For Mathematical Progress“ As in previous posts, readers are invited to post links to additional articles in the comments.

A Strange Quantum Theorem Has Killed Einstein’s Reality

Quanta Magazine·6 Nov 2026

Albert Einstein fought to save our everyday notion of reality from the strangeness of quantum mechanics. But those who set out to aid him keep poking holes in his argument. The post A Strange Quantum Theorem Has Killed Einstein’s Reality first appeared on Quanta Magazine

The Borodin--Kostochka inequality from degree 750

arXiv math.CO·5 Nov 2026

arXiv:2611.05423v1 Announce Type: new Abstract: We prove that every finite simple graph $G$ with maximum degree at least $750$ satisfies $\chi(G)\le\max\{\omega(G),\Delta(G)-1\}$. The proof starts with a random partial colouring and completes it on large cliques using a list-colouring condition that remains valid as the rest of the graph is coloured. Disjoint stars provide the required colours. We

Hamilton cycles in bicirculants with non-coprime connection sets

arXiv math.CO·5 Nov 2026

arXiv:2611.05531v1 Announce Type: new Abstract: A bicirculant is a regular graph that admits an automorphism having two vertex-orbits of the same size. A bicirculant can be described as follows. Given an integer $m \ge 1$ and sets $R, S, T \subseteq \mathbb{Z}_m$ such that $R=-R$, $T=-T$, $0 \not\in R \cup T$ and $0 \in S$, the graph $B(m;R,S,T)$ has vertex set $V=\{u_0,\dots,u_{m-1},v_0,\dots,v_{

On Diameter Graphs Problems: A proof of Brass's Conjecture

arXiv math.CO·5 Nov 2026

arXiv:2611.05631v1 Announce Type: new Abstract: The diameter graph of a finite set $S\subset\mathbb{R}^d$ has vertex set $S$ and two points are adjacent when their distance equals $\operatorname{diam} S$. In this paper we study the following question: given $k$ and $d$, is there a constant $c=c(k,d)$ such that from every finite point set $S\subset\mathbb{R}^d$ one can remove at most $c$ points so

Linear-length cycles in the supercritical percolated hypercube

arXiv math.CO·5 Nov 2026

arXiv:2611.05634v1 Announce Type: new Abstract: Let $Q_p^d$ be the random subgraph of the $d$-dimensional binary hypercube obtained by retaining each edge independently with probability $p$. A long-standing folklore conjecture states that the emergence of the giant component in $Q_p^d$, at $p\approx 1/d$, is accompanied by the emergence of cycles of linear length. We confirm this conjecture and de

Exact $3$-Adic Periods of Symmetric Dellac Numbers and Their Polynomial Extensions

arXiv math.NT·5 Nov 2026

arXiv:2611.05962v1 Announce Type: cross Abstract: The odd and even symmetric Dellac numbers are the specializations $a_n=f_n(0)$ and $e_n=f_n(1)$ of the Randrianarivony--Zeng family $f_n(s)=2^{-n}D_n(s)$. Using a finite Stieltjes-fraction truncation, we establish the sharp congruence $v_3(a_n)=1$ for $n\ge2$ and obtain explicit congruences modulo $81$ for both sequences. We also establish universa

Finiteness of Non-decomposable Critically Frustrated Signed Graphs

arXiv math.CO·5 Nov 2026

arXiv:2611.06017v1 Announce Type: new Abstract: A signed graph $(G,\sigma)$ is a graph $G$ with a signature $\sigma$ labeling each edge with a positive or negative sign. Two signatures of $G$ are switching equivalent if one is obtained from the other by sequentially changing the signs of all edges in an edge-cut. The frustration index of a signed graph $(G, \sigma)$ is the minimum number of negati

On the Cameron-Praeger conjecture for Steiner 6-designs

arXiv math.CO·5 Nov 2026

arXiv:2611.06081v1 Announce Type: new Abstract: A long-standing and far-reaching conjecture of Cameron and Praeger (1993) asserts that no non-trivial block-transitive $6$-$(v,k,\lambda)$ designs exist. Huber (2010) reduced the Steiner case ($\lambda=1$) to a single infinite family of possible exceptions, where the automorphism group is $G=\PGaL(2,p^e)$ acting on the points of the projective line,

Highly connected uniquely $k$-linked digraphs

arXiv math.CO·5 Nov 2026

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

Small 5-chromatic unit-distance graphs in disks of radius 3/2, 5/4 and 23/20

arXiv math.CO·5 Nov 2026

arXiv:2611.06269v1 Announce Type: new Abstract: We give three explicit unit-distance graphs in the plane with chromatic number 5 whose vertices lie in small disks: a graph with 773 vertices inside an open disk of radius 3/2, one with 5713 vertices inside an open disk of radius 5/4, and one with 8168 vertices inside an open disk of radius 23/20. The smallest examples previously reported for these r

On generalized $k$-token graphs with distinguishable tokens and a maximum capacity of $s$ tokens per vertex

arXiv math.CO·5 Nov 2026

arXiv:2611.06275v1 Announce Type: new Abstract: Supertoken graphs \(F^s_{k\times1}(G)\), also known as generalized token graphs, model configurations of \(k\) distinguishable tokens on a graph \(G\), with at most \(s\) tokens at each vertex. We study structural and metric properties of these graphs in terms of the base graph. For regular \(G\), we characterize when \(F^s_{k\times1}(G)\) is regular

Four-colour counterexamples for monochromatic path partitions

arXiv math.CO·5 Nov 2026

arXiv:2611.06362v1 Announce Type: new Abstract: In 1989, Gy\'arf\'as conjectured that the vertex set of every $r$-edge-coloured complete graph can be partitioned into at most $r$ monochromatic paths. The case $r=2$ follows from a theorem of Gerencs\'er and Gy\'arf\'as, and Pokrovskiy proved the conjecture for $r=3$. Recently, Li and Wang disproved the conjecture for all sufficiently large $r$, lea

Cycles in Regular Multipartite Tournaments

arXiv math.CO·5 Nov 2026

arXiv:2611.06468v1 Announce Type: new Abstract: We study balanced cycles in regular multipartite tournaments. A cycle in a $c$-partite tournament is $k$-balanced if it contains exactly $k$ vertices from each partite class. We prove that there exists an absolute integer $r_0$ such that every regular $c$-partite tournament with each partite class size of $r\ge r_0$ contains a $k$-balanced cycle for

A characterization of a family of integral Cayley graphs

arXiv math.CO·5 Nov 2026

arXiv:2611.06581v1 Announce Type: new Abstract: Let $G$ be a finite group and $H$ be a subgroup of $G$. In our earlier work, we proved that the quasi-strongly regular Cayley graph $\Gamma_H(G)$ is integral whenever $H$ is normal in $G$, and raised the question of whether the converse also holds. In this paper, we answer this question affirmatively. We prove that if $\Gamma_H(G)$ is integral, then

Baxter Structures and the Odd-Even Enumeration of Red-Blue Motzkin Paths

arXiv math.CO·5 Nov 2026

arXiv:2611.06599v1 Announce Type: new Abstract: We study Motzkin paths satisfying the red-blue rule introduced by Wu, Eu, Ku and Shih. We answer their Question 8.5 and exhibit two new Baxter structures. Let $\mathcal M_m$ denote the set of such paths of length $m$ and $a_m=|\mathcal M_m|$. We give a combinatorial proof of \[ a_{2n-1}=\mathrm{A005802}(n),\qquad a_{2n}=\mathrm{A216947}(n) \qquad (n\

Polylogarithmic bound for the Gy\'arf\'as-Sumner conjecture

arXiv math.CO·5 Nov 2026

arXiv:2611.06699v1 Announce Type: new Abstract: The classical Gy\'arf\'as-Sumner conjecture asserts that for any fixed forest $F$, any graph $G$ not containing $F$ as an induced subgraph, with bounded clique number $\omega(G)$, has bounded chromatic number $\chi(G)$. Recently, Nguyen, Scott, and Seymour proved that every such graph has chromatic number at most $|G|^{o(1)}$. We improve this bound t

A family of symmetric counterexamples to the bent sum decomposition conjecture

arXiv math.CO·5 Nov 2026

arXiv:2611.06744v1 Announce Type: new Abstract: In this paper, we provide an infinite family of counterexamples to Tokareva's conjecture on sums of two bent functions. The conjecture states that every Boolean function in an even number of variables $n$ of algebraic degree at most $n/2$ can be written as the sum of two bent functions. We show that for every $n=2^k\geq 8$, the symmetric function $F_

Proof of two conjectures on the log-concavity of partition ranks and cranks

arXiv math.NT·5 Nov 2026

arXiv:2611.06757v1 Announce Type: cross Abstract: Let $M(m,n)$ and $N(m,n)$ denote the numbers of partitions of $n$ with crank $m$ and rank $m$, respectively. Ji and Zang proved that the crank sequence $(M(m,n))_{|m|\le n-1}$ is unimodal for every $n\ge44$. Bringmann, Man, and Rolen subsequently established the unimodality of the rank sequence $(N(m,n))_{|m|\le n-2}$ for every $n\ge39$. Ji and Zan

Largest Sperner families with bounded VC-dimension

arXiv math.CO·5 Nov 2026

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

Off-Diagonal Induced Ramsey Numbers

arXiv math.CO·5 Nov 2026

arXiv:2611.06886v1 Announce Type: new Abstract: Given graphs $F$ and $H$, the induced Ramsey number $r_{\mathrm{ind}}(F,H)$ is the smallest integer $n$ for which there exists a graph $G$ on $n$ vertices such that every red-blue colouring of $E(G)$ contains either a blue induced copy of $F$ or a red induced copy of $H$. A conjecture of Kohayakawa, Pr\"omel and R\"odl asserts that, for every fixed g

A Sharp Dynamic Haussler Lemma

arXiv math.CO·5 Nov 2026

arXiv:2610.29898v2 Announce Type: cross Abstract: Haussler's covering lemma (JCTA 1995) gives the sharp $(C/\delta)^d$ metric-entropy bound for binary VC classes under normalized $\ell_1$ distance. We prove a sharp global dynamic analogue for bounded real-valued classes in normalized $\ell_p$, for every $1\le p<\infty$. Writing $d=\operatorname{sfat}_{\varepsilon/32}(\mathcal F)$, we obtain a glob

A normalization issue in a transmitted form of Bloch's diamond formula: anti-invariant subgroup versus regulator quotient

arXiv math.NT·5 Nov 2026

arXiv:2611.05420v1 Announce Type: new Abstract: Bloch's identity $\int_\gamma\eta(f,g)=D_E((f)\diamond(g))$, relating the regulator of a $K_2$-symbol on an elliptic curve $E/\mathbb{Q}$ to the elliptic dilogarithm of the diamond product of the divisors, is transmitted in the Mahler-measure literature with $\gamma$ generating the anti-invariant subgroup $H_1(E,\mathbb{Z})^-$ and factor $1$ (e.g. La

Low moments of sums of extended Rademacher random multiplicative functions

arXiv math.NT·5 Nov 2026

arXiv:2611.05492v1 Announce Type: new Abstract: Let $X^e \colon \mathbb{N} \to \{\pm 1\}$ be the random, completely multiplicative function whose values at the primes $(X^e(p))_{p \text{ prime}}$ are independent and uniformly distributed on $\{ \pm 1 \}$. Let $X=X^e\mu^2$. We determine the order of magnitude of \[ \mathbb{E} \Bigg[ \bigg| \frac{1}{\sqrt{x}}\sum_{n \le x} X^e(n) \bigg|^{2 q} \Bigg]

Partitions with designated summands: $k$-tuples and their congruences

arXiv math.NT·5 Nov 2026

arXiv:2611.05623v1 Announce Type: new Abstract: Let $A_k(n)$ and $B_k(n)$ be the numbers of ordered $k$-tuples of partitions with designated summands, respectively with designated summands and all parts odd, of total size $n$. Using an exact description of the generating function of designated partitions after a $3$-dissection, we classify for every $e$ the values of $k$ for which $A_k(3n+2)$ is d

Diophantine definability from addition and divisibility over rings of $S$-integers

arXiv math.NT·5 Nov 2026

arXiv:2611.05687v1 Announce Type: new Abstract: Let $K$ be a number field, let $S$ be a finite set of places of $K$ containing the archimedean places, and let $\mathcal{O}_{K,S}$ denote the ring of $S$-integers of $K$. We prove that multiplication is positive-existentially definable in $(\mathcal{O}_{K,S},0,1,+,\mid)$ if and only if the unit group $\mathcal{O}_{K,S}^\times$ is infinite. This exten

The enhanced polylogarithm conjecture in weight two for imaginary quadratic fields

arXiv math.NT·5 Nov 2026

arXiv:2611.06002v1 Announce Type: new Abstract: Zagier's polylogarithm conjecture predicts that special values of Dedekind zeta functions can be expressed in terms of polylogarithms at algebraic arguments. For imaginary quadratic fields, Zagier and Gangl refined it by lifting both sides to complex values modulo rational multiples of a power of $2\pi i$. In previous work, the author extended their

A Galois-type Springer theorem for hermitian and generalized quadratic forms

arXiv math.NT·5 Nov 2026

arXiv:2611.06177v1 Announce Type: new Abstract: We prove that anisotropy of nonsingular hermitian and skew-hermitian forms over central simple algebras with involution is preserved under scalar extension to every finite Galois extension of odd degree coprime to the index of the algebra. In characteristic two, the same conclusion holds for generalized quadratic forms over algebras with involution o

Certified Collision Exclusion and an Unconditional Upper Bound $\Lambda<0.156821$ for the de Bruijn--Newman Constant

arXiv math.NT·5 Nov 2026

arXiv:2611.06245v1 Announce Type: new Abstract: The de Bruijn--Newman constant $\Lambda$ is the transition time beyond which all zeros of the heat-deformed Riemann $\xi$-function are real. We develop a computer-assisted collision-exclusion method and obtain the bound $\Lambda<156821/10^6=0.156821$, in the normalisation of Polymath. The proof combines the published finite-height verification and th

Multiple $q$-zeta values as polynomials in partition multiplicities

arXiv math.NT·5 Nov 2026

arXiv:2611.06301v1 Announce Type: new Abstract: Writing multiple $q$-zeta values as sums over partitions, a conjecture of Bachmann, proved by Hirose, Maesaka and Watanabe by means of a recursion, says that polynomials in the parts and multiplicities can be replaced by polynomials in the multiplicities alone. We make this replacement explicit, derive from it bounds on weight and depth that make Bac

Unit fraction representations using shifted Golomb primes

arXiv math.NT·5 Nov 2026

arXiv:2611.06798v1 Announce Type: new Abstract: We prove that every positive rational number is a sum of distinct unit fractions with denominators of the form $g-h$, where $g$ is a Golomb prime and $h$ is a fixed nonzero integer, as long as the necessary congruence conditions are satisfied. Golomb primes, introduced by Golomb in 1955, are a natural analogue of the primes. Erd\H{o}s showed that the

Prime order torsion on elliptic curves over number fields. Part I: Asymptotics

arXiv math.NT·5 Nov 2026

arXiv:2505.14109v2 Announce Type: replace Abstract: We study the asymptotics of the set $S(d)$ of possible prime orders of $K$-rational points on elliptic curves over number fields $K$ of degree $d$ as $d$ tends to infinity. Assuming some conjectures on the sparsity of newforms of weight $2$ and prime level with unexpectedly high analytic rank, we show that $\max S(d) \le 3d + 1$ for sufficiently

Distribution of mixed character sums and extremal problems for Littlewood polynomials

arXiv math.NT·5 Nov 2026

arXiv:2510.06161v3 Announce Type: replace Abstract: We prove distributional results for mixed character sums \begin{equation*}\sum_{n\le x }\chi(n)e(n\theta),\end{equation*} for fixed $\theta\in [0,1]$ and random character $\chi \pmod q$, as well as for a fixed character $\chi$ and randomly sampled $\theta\in [0,1].$ We present various applications of our results. For example, we construct Littlew

On the de Rham flip-flopping in dual towers

arXiv math.NT·5 Nov 2026

arXiv:2603.07869v2 Announce Type: replace Abstract: We prove a version of de Rham and Hyodo-Kato flip-flopping for dual towers of rigid analytic spaces including those coming from dual basic local Shimura varieties. The main tool are comparison theorems expressing the two cohomologies as pro-\'etale cohomology of corresponding relative period sheaves that, by definition, satisfy pro-\'etale descen

The Pila-Zannier strategy for Drinfeld modules and Drinfeld modular curves

arXiv math.NT·5 Nov 2026

arXiv:2607.19952v2 Announce Type: replace Abstract: We extend the Pila-Zannier strategy to Drinfeld modules: we prove analogues of the Manin-Mumford theorem for a product of two Drinfeld modules of equal rank, and of the Andr\'e-Oort theorem for a product of two Drinfeld modular curves. In characteristic zero, several steps of this strategy rest on $o$-minimality, which has no counterpart over a f

The density of discriminants of $A_4$-quartic fields

arXiv math.NT·5 Nov 2026

arXiv:2610.26510v2 Announce Type: replace Abstract: Let \[\kappa_{A_4} = \frac{35 \pi}{1458 \sqrt{3}} \prod_{p \equiv 1 \pmod{3}} \left(1 - \frac{1}{p}\right)^3 \left(1 + \frac{3}{p} \right) \prod_{p \equiv 2 \pmod{3}} \left(1 - \frac{1}{p^2} \right)^2\] and $N_{A_4}(X)$ be the number of $A_4$-quartic fields of discriminant up to $X$. We establish the asymptotic formula \[N_{A_4}(X) = \kappa_{A_4}

Elliptic curve rank growth in multi-quadratic extensions

arXiv math.NT·5 Nov 2026

arXiv:2610.31925v2 Announce Type: replace Abstract: In this article we give an algorithm to produce infinitely many explicit quadratic twists of a given elliptic curve over $\mathbb{Q}$ with a rational point and fixed root number. Moreover, under the Parity Conjecture (or other technical hypotheses), for each $n\geq 1$, we produce explicit multi-quadratic extensions $L_n$ of $\mathbb{Q}$, of degre

Futures of Maths Launch

Terence Tao·5 Nov 2026

[This is a guest post by Francesco Fournier-Facio, Yara Kyrychenko, Jon Roozenbeek, and Julian Wykowski, cross-posted from the Proofs and Prompts blog. This blog post was initially written in a different file format and converted using AI. — T.] Today we launch Futures of Maths, a new, living platform that asks active research mathematicians about […]

Harmonic analysis approach to the relative Riemann-Roch theorem on global fields

arXiv math.NT·4 Nov 2026

arXiv:2208.10424v4 Announce Type: replace Abstract: In this paper we generalize and put in a new light part of ``Fouier analysis on Number fields and Hecke's zeta function''[14] by Tate. We express the relative Euler characteristic using purely adelic language. By using certain natural normalization of Haar measure on adeles we obtain the relative Riemann-Roch theorem. In particular we show that u

The prime geodesic theorem for the modular orbifold

arXiv math.NT·4 Nov 2026

arXiv:2402.12133v4 Announce Type: replace Abstract: We establish the prime geodesic theorem for the modular orbifold with exponent $\frac{9}{13} = 0.692307 \cdots$ in the error term. By periodicity and Heath-Brown's quadratic large sieve, we estimate the sixth moment of the error term in an approximation to the Zagier $L$-series at $s = 1$. The smooth explicit formula of Soundararajan and Young th

Dwork Motives, Monodromy and Potential Automorphy

arXiv math.NT·4 Nov 2026

arXiv:2407.16481v2 Announce Type: replace Abstract: In this paper we study certain families of motives, which arise as direct summands of the cohomology of the Dwork family. We computationally find examples of interesting families with the following three properties. Firstly, their geometric monodromy group is Zariski dense in $\operatorname{SL}_n$. Secondly, they realise many different unipotent

R\'epartition conjointe de trois nombres premiers et applications

arXiv math.NT·4 Nov 2026

arXiv:2410.02480v2 Announce Type: replace Abstract: We prove asymptotic results for the singular series associated to the distribution of three primes. Assuming a quantitative version of Hardy and Littlewood's conjecture on prime 3-tuples, we deduce an asymptotic formula related to the joint distribution of three primes. This improves recent results of Kuperberg and completes results by Montgomery

Doctoral Advising Guidelines by the AHM

Terence Tao·3 Nov 2026

[This is a guest post by the AHM communications group. — T.] We are happy to announce that the Teaching Working Group of the Association for Human Mathematics wrote a set of recommendations on doctoral advising aimed at departments, advisors, and students. The document contains five guidelines centered on prioritizing human-authored writing, avoiding overreliance on […]

Egoless Mathematics in the AI Era

Terence Tao·2 Nov 2026

[This is a guest post by Karthik C. S., Amit Sahai, and Jie Xue. This blog post was initially written in a different file format and converted using AI. — T.] This is a good time for mathematicians to think carefully about the purpose of their work. The development of artificial intelligence brings that question […]

Mathematics has changed. Let’s act like it

Terence Tao·1 Nov 2026

[This is a guest post by Frank Calegari. This blog post was initially written in a different file format and converted using AI. — T.] Why we should not be sad The release by OpenAI on October 6 of over 700 research papers was a watershed in the history of mathematics. AI is now undeniably […]

The mathematical sciences in an AI-enabled world

Terence Tao·31 Oct 2026

The Academy for the Mathematical Sciences, which is based in the UK, has released a report “The mathematical sciences in an AI-enabled world“. To quote from the release: The paper examines how recent advances in artificial intelligence are changing mathematical research and its applications, bringing new opportunities for discovery, verification and the use of mathematics […]

Collaborative retreat: New developments in the theory of zeta functions

Terence Tao·30 Oct 2026

Edgar Assing, Valentin Blomer, and Farrell Brumley are organizing an event at the Hausdorff Center in Bonn on Jan 11-15 to discuss recent developments regarding the Riemann zeta function and allied functions. From the announcement: “This includes in particular the recently established proof of the quasi Riemann Hypothesis over the rational numbers as well as over general […]

AI, Mathematics, Education, and a public goods problem

Terence Tao·29 Oct 2026

[This is a guest post by Gireeja Ranade. This blog post was initially written in a different file format and converted using AI. — T.] The day after the Navier-Stokes result was announced, a student came to my office hours. They said, “Can we please talk about the Navier-Stokes result and what it means? I […]

https://mathstodon.xyz/@tao/117395269325940185

Terence Tao (Mathstodon)·6 Oct 2026

"Math 1.0" placed a premium on being the first to solve an open problem, even if the solution was not initially well understood. Now that this goal has been optimized to the point of unsustainability, "Math 2.0" will need to decenter the role of raw problem solving and value mathematical progress more holistically - for instance by elevating the role of exposition, but also that of community build

https://mathstodon.xyz/@tao/117395268889583356

Terence Tao (Mathstodon)·6 Oct 2026

This process cannot be easily reversed: a problem that has been "solved" cannot be somehow reverted to become "unsolved", and even the mere knowledge that a solution exists "contaminates" efforts by both humans and AI to find alternate routes to the problem that reveal additional insights. And so solutions to open problems are now being harvested at large scale in an unsustainable fashion, leaving

https://mathstodon.xyz/@tao/117395267721642920

Terence Tao (Mathstodon)·6 Oct 2026

In traditional mathematics (or "Math 1.0"), a breakthrough proof of a long-standing open conjecture generates a large amount of subsequent activity and excitement in the field. The authors of the proof are invited to give many talks, and meet with other experts in the area. Workshops are set up to discuss the proof, as well as other recent developments. As a result, new connections and collaborati

Introducing SynthID Bio

Google DeepMind·30 Sep 2026

Proof of concept for watermarking AI-generated proteins while preserving biological function.

https://mathstodon.xyz/@tao/117253629967855195

Terence Tao (Mathstodon)·11 Sep 2026

A group of 25 Fields Medalists, including myself, have made a joint declaration on Math and AI: https://mathandai.org/ . We welcome additional signatories (similar to the Leiden declaration), as can be seen on the page. See also this article in the Economist announcing the declaration: https://www.economist.com/science-and-technology/2026/09/11/top-mathematicians-are-outraged-by-openais-methods

https://mathstodon.xyz/@tao/117244104044239500

Terence Tao (Mathstodon)·10 Sep 2026

Many in my profession are drawn to it in part because of this ability to direct these childlike impulses to productive use, which leads surprisingly often (by an extremely indirect pipeline) to actual advances in science, technology or engineering as per Eugene Wigner's "unreasonable effectiveness of mathematics". But, perhaps in order to impress the other adults observing (and, through public fun

https://mathstodon.xyz/@tao/117244103501118293

Terence Tao (Mathstodon)·10 Sep 2026

Children eventually become adults, and "put away childish things". Significant portions of our time become devoted to optimizing "important" and immediate goals: weighing the costs and benefits of various decisions, and acting on them accordingly. Unstructured play and exploration become restricted to one's hobbies or personal activities only. This is so normalized in modern adult life that most o

https://mathstodon.xyz/@tao/117244102901892965

Terence Tao (Mathstodon)·10 Sep 2026

"Toutes les grandes personnes ont d'abord été des enfants. (Mais peu d'entre elles s'en souviennent.)" [All grown-ups were once children... but only few of them remember it.] Antoine de Saint-Exupéry, "Le Petit Prince." An impromptu game of "who can name the largest number?" is an example I often point to as a way in which young children teach each other about non-trivial mathematical ideas and fa

https://mathstodon.xyz/@tao/117237321472650215

Terence Tao (Mathstodon)·8 Sep 2026

Working out whether a question is actually worth highlighting is a lengthy, deliberate, and subjective process, often informed by historical experience on what good mathematics was generated (or not generated) while working on earlier problems of this type. In particular, being aware of the "difficulty landscape" in a field - what questions are very easy to answer with known methods, which ones ca

https://mathstodon.xyz/@tao/117237320796901560

Terence Tao (Mathstodon)·8 Sep 2026

I wrote recently about how the collection of good, fruitful open problems is now being mined in a non-renewable fashion, leading to the potential scenario of these problems becoming scarce. This may seem unintuitive at first, since the set of possible problems one could ask is infinite. Perhaps the following analogy can help: a country or region can suffer a critical shortage of drinking water whi

https://mathstodon.xyz/@tao/117234157753860650

Terence Tao (Mathstodon)·8 Sep 2026

By sheer coincidence, another completely independent result on the Euler blowup question has just been released by Ganeshram, Duruisseaux, and Anandkumar https://anima-ai.org/2026/09/07/stable-singularity-of-the-euler-equations-on-r3-without-forcing/, relating to the more "mainstream" approach to finite time blowup for Euler or Navier-Stokes, in which one uses numerical simulation or machine learn

https://mathstodon.xyz/@tao/117233528517340774

Terence Tao (Mathstodon)·8 Sep 2026

For the specific ansatz of perturbations chosen here, the amplitude-frequency dynamics turn out to be a remarkably simple ODE, at least for the model case of the Boussinesq equation, though there are still many technical details (involving spatial cutoffs etc.) that enlarge the size of that paper to 76 pages in length, even after the authors efforts to simplify the arguments. There does not seem t