Related papers: The Grone Merris Conjecture and a quadratic eigenv…
We obtain a second order differential equation on moduli space satisfied by certain modular graph functions at genus two, each of which has two links. This eigenvalue equation is obtained by analyzing the variations of these graphs under…
The paper discusses the Andrews-Curtis graph of a normal subgroup N in a group G. The vertices of the graph are k-tuples of elements in N which generate N as a normal subgroup; two vertices are connected if one them can be obtained from…
We give improved uniform estimates for the rate of convergence to Plancherel measure of Hecke eigenvalues of holomorphic forms of weight 2 and level N. These are applied to determine the sharp cutoff for the non-backtracking random walk on…
Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these…
We introduce a new variant of the coarse Baum-Connes conjecture designed to tackle coarsely disconnected metric spaces called the boundary coarse Baum-Connes conjecture. We prove this conjecture for many coarsely disconnected spaces that…
We review recent progress on Horn's problem, which asks for a description of the possible eigenspectra of the sum of two matrices with known eigenvalues. After revisiting the classical case, we consider several generalizations in which the…
The degree chromatic polynomial $Pm(G,k)$ of a graph $G$ counts the number of $k$-colorings in which no vertex has $m$ adjacent vertices of its same color. We prove Humpert and Martin's conjecture on the leading terms of the degree…
Horn's problem was the following: given two Hermitian matrices with known spectra, what might be the eigenvalue spectrum of the sum? This linear algebra problem is exactly of the sort to be approached with the methods of modern Hamiltonian…
An eigenvalue of the adjacency matrix of a graph is said to be main if the all-ones vector is not orthogonal to its associated eigenspace. A generalized Bethe tree with $k$ levels is a rooted tree in which vertices at the same level have…
We introduce a measure of discrepancy of Hermitian matrices and establish an inequality between the second singular value of a Hermitian matrix and its discrepancy. These results are applied to answer two questions of Fan Chung about graph…
We present the first algorithm to morph graphs on the torus. Given two isotopic essentially 3-connected embeddings of the same graph on the Euclidean flat torus, where the edges in both drawings are geodesics, our algorithm computes a…
We define graftable curves on real projective surfaces. In particular, we construct graftable ones in Hitchin case and show that real projective structures with the same Hitchin holonomy, carrying the same weight type, are related to each…
We consider the Gaussian curvature conjecture of a minimal graph $S$ over the unit disk. First of all we reduce the general conjecture to the estimating the Gaussian curvature of some Scherk's type minimal surfaces over a quadrilateral…
We prove the filling area conjecture in the hyperelliptic case. In particular, we establish the conjecture for all genus 1 fillings of the circle, extending P. Pu's result in genus 0. We translate the problem into a question about closed…
Drawing on some recent results that provide the formalism necessary to definite stationarity for infinite random graphs, this paper initiates the study of statistical and learning questions pertaining to these objects. Specifically, a…
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,…
We define an analytic version of the graph property testing problem, which can be formulated as studying an unknown 2-variable symmetric function through sampling from its domain and studying the random graph obtained when using the…
A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.
We construct families of hyperelliptic curves over Q of arbitrary genus g with (at least) g integral elements in K_2. We also verify the Beilinson conjectures about K_2 numerically for several curves with g=2, 3, 4 and 5. The paper is…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…