A moore bound for simplicial complexes

Alexander Lubotzky*, Roy Meshulam

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

17 Scopus citations

Abstract

Let X be a d-dimensional simplicial complex with N faces of dimension d-1. Suppose that every (d-1)-face of X is contained in at least κ ≥ d + 2 faces of X, of dimension d. Extending the classical Moore bound for graphs, it is shown that X must contain a ball B of radius at most |"log κ-d N] whose d-dimensional homology Hd(B) is non-zero. The Ramanujan complexes constructed by Lubotzky, Samuels and Vishne are used to show that this upper bound on the radius of B cannot be improved by more than a multiplicative constant factor.

Original languageEnglish
Pages (from-to)353-358
Number of pages6
JournalBulletin of the London Mathematical Society
Volume39
Issue number3
DOIs
StatePublished - Jun 2007

Fingerprint

Dive into the research topics of 'A moore bound for simplicial complexes'. Together they form a unique fingerprint.

Cite this