5 citations · 5 across the 6 of their papers we have counts for
12 papers
On the spectral gap conjecture for pairs in SU(2)
Oleg Pikhurko, Kohki Sakamoto
For , Gamburd, Jakobson, and Sarnak [J. Eur. Math. Soc. 1, 51-85 (1999)] conjectured that almost every -tuple in has a spectral gap. Toward this conjec…
On problems of Erdős and Baumann-Briggs on minimising the density of -cliques in graphs with forbidden subgraphs
Levente Bodnár, Oleg Pikhurko
Using flag algebras, we prove that the minimum density of -cliques in a large graph without an independent set of size is , thus resolving a new case…
Rational codegree Turán density of hypergraphs
Jun Gao, Oleg Pikhurko, Mingyuan Rong +1
Let be a -graph (i.e. a -uniform hypergraph). Its minimum codegree is the largest integer such that every -subset of is contained in at lea…
New upper bound for lattice covering by spheres
Jun Gao, Xizhi Liu, Oleg Pikhurko +1
We show that there exists a lattice covering of by Eucledian spheres of equal radius with density as , where \begin{align*} β:= \…
The Turán density of short tight cycles
Levente Bodnár, Jared León, Xizhi Liu +1
The -uniform tight -cycle is the -graph on consisting of all consecutive triples in the cyclic order. Let be either…
Convergence of spectra of digraph limits
Jan Grebík, Daniel Král', Xizhi Liu +2
The relation between densities of cycles and the spectrum of a graphon, which implies that the spectra of convergent graphons converge, fundamentally relies on the self-adjointness…