Related papers: The CLLC conjecture holds for cyclic outer permuta…

We extend the theory of local constants to l-adic families of representations of GL_n(F) where F is a p-adic field with l not equal to p. We construct zeta integrals and gamma factors for representations coming from the conjectural "local…

A fine mixed subdivision of a (d-1)-simplex T of size n gives rise to a system of ${d \choose 2}$ permutations of [n] on the edges of T, and to a collection of n unit (d-1)-simplices inside T. Which systems of permutations and which…

The Conifold Gap Conjecture asserts that the polar part of the Gromov-Witten potential of a Calabi-Yau threefold near its conifold locus has a universal expression described by the logarithm of the Barnes $G$-function. In this paper, I…

Locally checkable labeling problems (LCLs) form the foundation of the modern theory of distributed graph algorithms. First introduced in the seminal paper by Naor and Stockmeyer [STOC 1993], these are graph problems that can be described by…

Frankl's union-closed sets conjecture states that in every finite union-closed set of sets, there is an element that is contained in at least half of the member-sets (provided there are at least two members). The conjecture has an…

The union-closed sets conjecture, attributed to P\'eter Frankl from 1979, states that for any non-empty finite union-closed family of finite sets not consisting of only the empty set, there is an element that is in at least half of the sets…

This paper provides a complete proof of Simon-Lukic conjecture for orthogonal polynomials on the unit circle. For a probability measure $d\mu = w(\theta) \frac{d\theta}{2\pi} + d\mu_s$ with Verblunsky coefficients…

We give a new proof of the finiteness of B-representations. As a consequence of the finiteness of B-representations and Koll\'ar's gluing theory on lc centers, we prove that the (relative) abundance conjecture for slc pairs is implied by…

The question of whether the central limit theorem (CLT) holds for the total number of edges in exponential random graph models (ERGMs) in the subcritical region of parameters has remained an open problem. In this paper, we establish the…

This is the final paper in the series of five, in which we prove the geometric Langlands conjecture (GLC). We conclude the proof of GLC by showing that there exists a unique (up to tensoring up by a vector space) Hecke eigensheaf…

Let $X_H$ be the number of copies of a fixed graph $H$ in $G(n,p)$. In 2016, Gilmer and Kopparty conjectured that a local central limit theorem should hold for $X_H$ as long as $H$ is connected, $p\gg n^{-1/m(H)}$ and $n^2(1-p)\gg 1$, where…

A milestone in Probability Theory is the law of the iterated logarithm (LIL), proved by Khinchin and independently by Kolmogorov in the 1920s, which asserts that for iid random variables $\{t_i\}_{i=1}^{\infty}$ with mean $0$ and variance…

Locally checkable labeling problems (LCLs) are distributed graph problems in which a solution is globally feasible if it is locally feasible in all constant-radius neighborhoods. Vertex colorings, maximal independent sets, and maximal…

We show that for various natural classes of groups and appropriately defined K- and L-theoretic functors, injectivity or bijectivity of the assembly map follows from the Isomorphism Conjecture being true for acyclic groups lying within that…

A Ringel ladder can be formed by a self-bar-amalgamation operation on a symmetric ladder, that is, by joining the root vertices on its end-rungs. The present authors have previously derived criteria under which linear chains of copies of…

Given a prime $p$, the $p$-adic Littlewood Conjecture stands as a well-known arithmetic variant of the celebrated Littlewood Conjecture in Diophantine Approximation. In the same way as the latter, it admits a natural function field analogue…

We formulate an analogue of the Breuil-M\'ezard conjecture for the group of units of a central division algebra over a $p$-adic local field, and we prove that it follows from the conjecture for $\mathrm{GL}_n$. To do so we construct a…

Scott proved in 1997 that for any tree $T$, every graph with bounded clique number which does not contain any subdivision of $T$ as an induced subgraph has bounded chromatic number. Scott also conjectured that the same should hold if $T$ is…

We formulate a general conjecture relating Chern classes of subbundles of Gauss-Manin bundles in Arakelov geometry to logarithmic derivatives of Artin L-functions of number fields. This conjecture may be viewed as a far-reaching…

We present an extension of several results on pairs and varieties to foliated surface pairs. We prove the boundedness of local complements, the local index theorem, and the uniform boundedness of minimal log discrepancies (mlds), as well as…