arXiv subjects

Konstantin Golubev

Publications and source records attributed to Konstantin Golubev.

11 recordsLinked to original sources

arXiv2022

Cutoff on Graphs and the Sarnak-Xue Density of Eigenvalues

It was recently shown by Lubetzky and Peres (2016) and by Sardari (2018) that Ramanujan graphs, i.e., graphs with the optimal spectrum, exhibit cutoff of the simple random walk in an optimal time and have an optimal almost-diameter. We show that this spectral condition can be replaced by a weaker condition, the Sarnak-Xue density property, to deduce similar results. This allows us to prove that some natural families of Schreier graphs of the $SL_2(\mathbb{F}_t)$-action on the projective line exhibit cutoff, thus proving a special case of a conjecture of Rivin and Sardari.

math.CO↗

arXiv2022

On Sarnak's Density Conjecture and its Applications

Sarnak's Density Conjecture is an explicit bound on the multiplicities of non-tempered representations in a sequence of cocompact congruence arithmetic lattices in a semisimple Lie group, which is motivated by the work of Sarnak and Xue. The goal of this work is to discuss similar hypotheses, their interrelation and applications. We mainly focus on two properties - the spectral Spherical Density Hypothesis and the geometric Weak Injective Radius Property. Our results are strongest in the p-adic case, where we show that the two properties are equivalent, and both imply Sarnak's General Density Hypothesis. One possible application is that either the Spherical Density Hypothesis or the Weak Injective Radius Property imply Sarnak's Optimal Lifting Property. Conjecturally, all those properties should hold in great generality. We hope that this work will motivate their proofs in new cases.

math.NT↗

arXiv2021

Graphical Designs and Extremal Combinatorics

A graphical design is a proper subset of vertices of a graph on which many eigenfunctions of the Laplacian operator have mean value zero. In this paper, we show that extremal independent sets make extremal graphical designs, that is, a design on which the maximum possible number of eigenfunctions have mean value zero. We then provide examples of such graphs and sets, which arise naturally in extremal combinatorics. We also show that sets which realize the isoperimetric constant of a graph make extremal graphical designs, and provide examples for them as well. We investigate the behavior of graphical designs under the operation of weak graph product. In addition, we present a family of extremal graphical designs for the hypercube graph.

math.CO↗

arXiv2019

On the support of a non-autocorrelated function on a hyperbolic surface

Let $f$ be a non-negative square-integrable function on a finite volume hyperbolic surface $Γ\backslash\mathbb{H}$, and assume that $f$ is non-autocorrelated, that is, perpendicular to its image under the operator of averaging over the circle of a fixed radius $r$. We show that in this case the support of $f$ is small, namely, it satisfies $μ(supp{f}) \leq (r+1)e^{-\frac{r}{2}} μ(Γ\backslash\mathbb{H})$. As a corollary, we prove a lower bound for the measurable chromatic number of the graph, whose vertices are the points of $Γ\backslash\mathbb{H}$, and two points are connected by an edge if there is a geodesic of length $r$ between them. We show that for any finite covolume $Γ$ the measurable chromatic number is at least $e^{\frac{r}{2}}(r+1)^{-1}$.

math.CO↗

arXiv2019

High dimensional Hoffman bound and applications in extremal combinatorics

One powerful method for upper-bounding the largest independent set in a graph is the Hoffman bound, which gives an upper bound on the largest independent set of a graph in terms of its eigenvalues. It is easily seen that the Hoffman bound is sharp on the tensor power of a graph whenever it is sharp for the original graph. In this paper, we introduce the related problem of upper-bounding independent sets in tensor powers of hypergraphs. We show that many of the prominent open problems in extremal combinatorics, such as the Turán problem for (hyper-)graphs, can be encoded as special cases of this problem. We also give a new generalization of the Hoffman bound for hypergraphs which is sharp for the tensor power of a hypergraph whenever it is sharp for the original hypergraph. As an application of our Hoffman bound, we make progress on the problem of Frankl on families of sets without extended triangles from 1990. We show that if $\frac{1}{2}n\le2k\le\frac{2}{3}n,$ then the extremal family is the star, i.e. the family of all sets that contains a given element. This covers the entire range in which the star is extremal. As another application, we provide spectral proofs for Mantel's theorem on triangle-free graphs and for Frankl-Tokushige theorem on $k$-wise intersecting families.

math.CO↗

arXiv2019

Direct Sum Testing: The General Case

A function $f:[n_1]\times\dots\times[n_d]\to\mathbb{F}_2$ is a direct sum if it is of the form $f\left(a_1,\dots,a_d\right) = f_1(a_1)\oplus\dots \oplus f_d (a_d),$ for some $d$ functions $f_i:[n_i]\to\mathbb{F}_2$ for all $i=1,\dots, d$, and where $n_1,\dots,n_d\in\mathbb{N}$. We present a $4$-query test which distinguishes between direct sums and functions that are far from them. The test relies on the BLR linearity test (Blum, Luby, Rubinfeld, 1993) and on an agreement test which slightly generalizes the direct product test (Dinur, Steurer, 2014). In multiplicative $\pm 1$ notation, our result reads as follows. A $d$-dimensional tensor with $\pm 1$ entries is called a tensor product if it is a tensor product of $d$ vectors with $\pm 1$ entries, or equivalently, if it is of rank $1$. The presented tests can be read as tests for distinguishing between tensor products and tensors that are far from being tensor products. We also present a different test, which queries the function at most $(d+2)$ times, but is easier to analyze.

cs.CC↗

arXiv2017

Cutoff on Hyperbolic Surfaces

In this paper we study the common distance between points and the behavior of a constant length step discrete random walk on finite area hyperbolic surfaces. We show that if the second smallest eigenvalue of the Laplacian is at least 1/4, then the distances on the surface are highly concentrated around the minimal possible value, and that the discrete random walk exhibits cutoff. This extends the results of Lubetzky and Peres ([20]) from the setting of Ramanujan graphs to the setting of hyperbolic surfaces. By utilizing density theorems of exceptional eigenvalues from [27], we are able to show that the results apply to congruence subgroups of $SL_{2}\left(\mathbb{Z}\right)$ and other arithmetic lattices, without relying on the well known conjecture of Selberg ([28]). Conceptually, we show the close relation between the cutoff phenomenon and temperedness of representations of algebraic groups over local fields, partly answering a question of Diaconis ([7]), who asked under what general phenomena cutoff exists.

math.GT↗

arXiv2017

Lower bounds for the measurable chromatic number of the hyperbolic plane

Consider the graph $\mathbb{H}(d)$ whose vertex set is the hyperbolic plane, where two points are connected with an edge when their distance is equal to some $d>0$. Asking for the chromatic number of this graph is the hyperbolic analogue to the famous Hadwiger-Nelson problem about colouring the points of the Euclidean plane so that points at distance $1$ receive different colours. As in the Euclidean case, one can lower bound the chromatic number of $\mathbb{H}(d)$ by $4$ for all $d$. Using spectral methods, we prove that if the colour classes are measurable, then at least $6$ colours are are needed to properly colour $\mathbb{H}(d)$ when $d$ is sufficiently large.

math.CO↗

arXiv2017

Spectrum and combinatorics of two-dimensional Ramanujan complexes

Ramanujan graphs have extremal spectral properties, which imply a remarkable combinatorial behavior. In this paper we compute the high dimensional Hodge-Laplace spectrum of Ramanujan triangle complexes, and show that it implies a combinatorial expansion property, and a pseudo-randomness result. For this purpose we prove a Cheeger-type inequality and a mixing lemma of independent interest.

math.CO↗

arXiv2015

On the chromatic number of a simplicial complex

In [Ho] A.J. Hoffman proved a lower bound on the chromatic number of a graph in the terms of the largest and the smallest eigenvalues of its adjacency matrix. In this paper, we prove a higher dimensional version of this result and give a lower bound on the chromatic number of a pure $d$-dimensional simplicial complex in the terms of the spectra of the higher Laplacian operators.

math.CO↗

arXiv2014

Mixing properties and the chromatic number of Ramanujan complexes

Ramanujan complexes are high dimensional simplical complexes generalizing Ramanujan graphs. A result of Oh on quantitative property (T) for Lie groups over local fields is used to deduce a Mixing Lemma for such complexes. As an application we prove that non-partite Ramanujan complexes have 'high girth' and high chromatic number, generalizing a well known result about Ramanujan graphs.

math.CO↗