Related papers: On a conjecture on sparse binomial-type polynomial…
The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size, and its roots are called {\em independence roots}. We investigate the stability of such polynomials, that is, conditions…
Let ${\rm ex \,} {\mathcal B}$ be a minor-closed class of graphs with a set ${\mathcal B}$ of minimal excluded minors. We study (a) the asymptotic number of graphs without $k+1$ disjoint minors in ${\mathcal B}$ and (b) the properties of a…
In an era of unprecedented deluge of (mostly unstructured) data, graphs are proving more and more useful, across the sciences, as a flexible abstraction to capture complex relationships between complex objects. One of the main challenges…
Inspired by a question of Kra, Moreira, Richter, and Robertson, we prove two new results about infinite polynomial configurations in large subsets of the rational numbers. First, given a finite coloring of $\mathbb{Q}$, we show that there…
A graph $G$ is said to be $p$-locally dense if every induced subgraph of $G$ with linearly many vertices has edge density at least $p$. A famous conjecture of Kohayakawa, Nagle, R\"odl, and Schacht predicts that locally dense graphs have,…
We study the random \'etale algebra generated by a random polynomial with i.i.d. coefficients distributed according to Haar measure normalized on $\mathbb{Z}_p$. We determine the probability that this random algebra is an unramified field,…
For every fixed graph $H$ and every fixed $0 < \alpha < 1$, we show that if a graph $G$ has the property that all subsets of size $\alpha n$ contain the ``correct'' number of copies of $H$ one would expect to find in the random graph…
Lieanders are special cases of meanders and first appeared in connection with Lie algebras. Using the results from the author with E. Goujard, P. Zograf and A. Zorich, we prove a polynomial asymptotics for the number of lieanders with fixed…
In this paper we give an asymptotic formula for a matrix integral which plays a crucial role in the approach of Diaconis et al. to random matrix eigenvalues. The choice of parameter for the asymptotic analysis is motivated by an invariant…
We give a conditional proof of the Uniform Boundedness Conjecture of Morton and Silverman in the case of polynomials over number fields, assuming a standard conjecture in arithmetic geometry. Our technique simultaneously yields a dynamical…
Sergey Pinchuk discovered a class of pairs of real polynomials in two variables that have a nowhere vanishing Jacobian determinant and define maps of the real plane to itself that are not one-to-one. This paper describes the asymptotic…
We present two related conjectures, arising in work on i-matchings in random r-regular bipartite graphs. The conjectures themselves are easily stated and involve only basic properties of convergent power series. One formulation involves…
In recent years, the asymptotic normality of some famous combinatorial sequences has been the subject of extensive study. However, the methods used to prove the asymptotic normality of various combinatorial sequences differ significantly.…
The sparse analogue of Szemer\'edi's regularity method has played a central role in the development of extremal results for random graphs. While the sparse embedding lemma (the KLR conjecture) has been resolved, the corresponding sparse…
We continue the study of probabilistic and topological properties of the set of reals that are being guessed by a diamond sequence from \cite{Benhamou_Wu}. We show that the existence of sequence of a asymptotic growth $\pi$ which infinitely…
We derive a non-asymptotic expression for the moments of traces of monomials in several independent complex Wishart matrices, extending some explicit formulas available in the literature. We then deduce the explicit expression for the…
We provide an asymptotic expression for the probability that a randomly chosen polynomial with given degree, having integral coefficients bounded by some B, has a prescribed signature. We also give certain related formulas and numerical…
We investigate size Ramsey numbers involving bipartite graphs. It is proved that, if each forbidden graph is fixed or grows with n (in a certain uniform manner), then the extremal function has a linear asymptotics. The corresponding slope…
The graph polynomial for the number of independent sets of size $k$ in a general undirected graph is shown to be equal to an elementary symmetric polynomial of the vertex monomials, which are determined by the edges incident at the…
We study the asymptotics of large, moderate and normal deviations for the connected components of the sparse random graph by the method of stochastic processes. We obtain the logarithmic asymptotics of large deviations of the joint…