Related papers: Isoperimetric Inequalities for Ramanujan Complexes…

In this note we draw a connection between noncommutative algebra and geometric group theory. Specifically, we ask whether it is possible to bound the sequence of codimensions for an associative PI-algebra using techniques from geometric…

In the framework of homological characterizations of relative hyperbolicity, Groves and Manning posed the question of whether a simply connected $2$-complex $X$ with a linear homological isoperimetric inequality, a bound on the length of…

In this paper, we present a new construction of simplicial complexes of subpolynomial degree with arbitrarily good local spectral expansion. Previously, the only known high-dimensional expanders (HDXs) with arbitrarily good expansion and…

Given a 2-manifold, a fundamental question to ask is which groups can be realized as the isometry group of a Riemannan metric of constant curvature on the manifold. In this paper, we give a nearly complete classification of such groups for…

This survey concerns regular graphs that are extremal with respect to the number of independent sets, and more generally, graph homomorphisms. More precisely, in the family of of $d$-regular graphs, which graph $G$ maximizes/minimizes the…

In this paper, we develop a refined analysis of hypergeometric functions to establish sharp quantitative integral inequalities for a general family of conformally invariant extension operators and their adjoints. Our results extend the…

Recently, Okounkov, Lazarsfeld and Mustata, and Kaveh and Khovanskii have shown that the growth of a graded linear series on a projective variety over an algebraically closed field is asymptotic to a polynomial. We give a complete…

In this article, we compute the topological expansion of all possible mixed-traces in a hermitian two matrix model. In other words we give a recipe to compute the number of discrete surfaces of given genus, carrying an Ising model, and with…

We show that every regular graph with good local expansion has a spanning Lipschitz subgraph with large girth and minimum degree. In particular, this gives a finite analogue of the dynamical solution to the von Neumann problem by Gaboriau…

We construct an explicit generating sets $F_n$ and $\tilde F_n$ of the alternating and the symmetric groups, which make the Cayley graphs $C(Alt(n), F_n)$ and $C(Sym(n), \tilde F_n)$ a family of bounded degree expanders for all sufficiently…

Deterministic constructions of expander graphs have been an important topic of research in computer science and mathematics, with many well-studied constructions of infinite families of expanders. In some applications, though, an infinite…

In a previous paper an asymptotic expansion for lambda_d in powers of 1/d was developed. The results of computer computations for some terms in the expansion, as well as various quantities associated to the expansion, are herein presented.…

We define the class of high dimensional graph manifolds. These are compact smooth manifolds supporting a decomposition into finitely many pieces, each of which is diffeomorphic to the product of a torus with a finite volume hyperbolic…

We study large uniform random maps with one face whose genus grows linearly with the number of edges. They can be seen as a model of discrete hyperbolic geometry. In the past, several of these hyperbolic geometric features have been…

We review recent results on the study of the isoperimetric problem on Riemannian manifolds with Ricci lower bounds. We focus on the validity of sharp second order differential inequalities satisfied by the isoperimetric profile of possibly…

We obtain the asymptotic expansions of the traces of the thermoelastic operators with the Dirichlet and Neumann boundary conditions on a Riemannian manifold, and give an effective method to calculate all the coefficients of the asymptotic…

In recent years, high dimensional expanders have been found to have a variety of applications in theoretical computer science, such as efficient CSPs approximations, improved sampling and list-decoding algorithms, and more. Within that, an…

The method of self-consistent expansions is a powerful tool for handling strong coupling problems that might otherwise be beyond the reach of perturbation theory, providing surprisingly accurate approximations even at low order. First…

We describe a natural topological generalization of edge expansion for graphs to regular CW complexes and prove that this property holds with high probability for certain random complexes.

We prove that a distance-regular graph with a dominant distance is a spectral expander. The key ingredient of the proof is a new inequality on the intersection numbers. We use the spectral gap bound to study the structure of the…