Related papers: Graphons arising from graphs definable over finite…
We use spectral theory and algebraic geometry to establish a higher-degree analogue of a Szemer\'edi--Trotter-type theorem over finite fields, with an application to polynomial expansion.
We give a number of approximation metatheorems for monotone maximization problems expressible in the first-order logic, in substantially more general settings than the previously known. We obtain * constant-factor approximation algorithm in…
We study the weighted multilinear polynomial averages in finite fields. The essential ingredient is the $u^s$-norm control of the corresponding weighted multilinear polynomial averages in finite fields, which is motivated by Ter\"av\"ainen…
We establish a uniform approximation result for the Taylor polynomials of the xi function of Riemann which is valid in the entire complex plane as the degree grows. In particular, we identify a domain growing with the degree of the…
Let $R$ be a standard graded finitely generated algebra over an $F$-finite field of prime characteristic, localized at its maximal homogeneous ideal. In this note, we prove that that Frobenius complexity of $R$ is finite. Moreover, we…
We generalize the asymptotic behavior of the graph distance between two uniformly chosen nodes in the configuration model to a wide class of random graphs. Among others, this class contains the Poissonian random graph, the expected degree…
We study sampling methods for Paley-Wiener functions on graphons, thereby adapting and generalizing methods initially developed for graphs to the graphon setting. We then derive conditions under which such a sampling estimate is consistent…
Inspired by Viennot's observation that matching polynomials are numerators of branched continued fractions we present a proof of the Heilmann-Lieb Theorem.
We consider an inverse problem for Schr\"odinger operators on connected equilateral graphs with standard matching conditions. We calculate the spectral determinant and prove that the asymptotic distribution of a subset of its zeros can be…
We develop Kummer theory for algebraic function fields in finitely many transcendental variables. We consider any finitely generated Kummer extension (possibly, over a cyclotomic extension) of an algebraic function field, and describe the…
We extend Edmonds' Branching Theorem to locally finite infinite digraphs. As examples of Oxley or Aharoni and Thomassen show, this cannot be done using ordinary arborescences, whose underlying graphs are trees. Instead we introduce the…
We investigate degree bounds for fields of rational invariants of representations of finite groups. We prove many cases of a bound for $\mathbb{Z}/p\mathbb{Z}$ conjectured by Blum-Smith, Garcia, Hidalgo, and Rodriguez. For arbitrary groups,…
We classify all cubic function fields over any finite field, particularly developing a complete Galois theory which includes those cases when the constant field is missing certain roots of unity. In doing so, we find criteria which allow…
This paper investigates asymptotic properties of multifractal products of random fields. The obtained limit theorems provide sufficient conditions for the convergence of cumulative fields in the spaces $L_q.$ New results on the rate of…
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
We strengthen and put in a broader perspective previous results of the first two authors on colliding permutations. The key to the present approach is a new non-asymptotic invariant for graphs.
We establish basic facts about the varieties of homogeneous polynomials divisible by powers of linear forms, and explain consequences for geometric complexity theory. This includes quadratic set-theoretic equations, a description of the…
Building upon the theory of graph limits and the Aldous-Hoover representation and inspired by Panchenko's work on asymptotic Gibbs measures (Annals of Probability 2013), we construct continuous embeddings of discrete probability…
This paper proves limit theorems for the number of monochromatic edges in uniform random colorings of general random graphs. These can be seen as generalizations of the birthday problem (what is the chance that there are two friends with…
In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class,…