Ample simplicial complexes

DOI10.1007/S40879-021-00521-5MaRDI QIDQ2115328zbMATHOpenAlexFDO

Authors Chaim Even-Zohar, Lewis Mead, Michael Farber

Publication date 15 March 2022

Published in European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2012.01483

zbMATH Keywords

random simplicial complexample simplicial complexiterated Payley complexRado simplicial complex

Mathematics Subject Classification ID

Combinatorial aspects of simplicial complexes (05E45) Network design and communication in computer systems (68M10)

Abstract: Motivated by potential applications in network theory, engineering and computer science, we study $r$-ample simplicial complexes. These complexes can be viewed as finite approximations to the Rado complex which has a remarkable property of {it indestructibility,} in the sense that removing any finite number of its simplexes leaves a complex isomorphic to itself. We prove that an $r$-ample simplicial complex is simply connected and $2$-connected for $r$ large. The number $n$ of vertexes of an $r$-ample simplicial complex satisfies $exp(Omega(frac{2}^{r}sqrtr))$. We use the probabilistic method to establish the existence of $r$-ample simplicial complexes with $n$ vertexes for any $n>r{2}^r{2}^{2^r}$. Finally, we introduce the iterated Paley simplicial complexes, which are explicitly constructed $r$-ample simplicial complexes with nearly optimal number of vertexes.

Recommendations

• The Rado simplicial complex
• Connectivity of Ample, Conic, and Random Simplicial Complexes
• Large random simplicial complexes. III: The critical dimension.
• Large random simplicial complexes. I
• Large random simplicial complexes. II: The fundamental group

Cites work

• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 3912417 (Why is no real title available?)
• scientific article; zbMATH DE number 125198 (Why is no real title available?)
• scientific article; zbMATH DE number 2121181 (Why is no real title available?)
• scientific article; zbMATH DE number 887782 (Why is no real title available?)
• scientific article; zbMATH DE number 967590 (Why is no real title available?)
• A Constructive Solution to a Tournament Problem
• A class of self-complementary graphs and lower bounds of some ramsey numbers
• All self-complementary symmetric graphs
• Asymmetric graphs
• Cubic and quadruple Paley graphs with the \(n\)-e.c. property
• Equations over finite fields. An elementary approach
• Graphs which contain all small graphs
• Homogeneous factorisations of complete graphs with edge-transitive factors
• Large networks and graph limits
• Lower bounds of Ramsey numbers based on cubic residues
• Networks beyond pairwise interactions: structure and dynamics
• New lower bounds of some diagonal Ramsey numbers
• On Character Sums and Primitive Roots^†
• On Dedekind's Problem: The Number of Isotone Boolean Functions. II
• On the Brun-Titchmarsh theorem
• Paley graphs satisfy all first-order adjacency axioms
• Probabilities on finite models
• Properties of almost all graphs and complexes
• Pseudo-random hypergraphs
• Pseudo-random properties of self-complementary symmetric graphs
• Quantitative aspects of acyclicity
• Quasi-Random Set Systems
• Random Simplicial Complexes
• Random simplicial complexes in the medial regime
• Random simplicial complexes, duality and the critical dimension
• Reconstructing graphs as subsumed graphs of hypergraphs, and some self- complementary triple systems
• The Rado simplicial complex
• The poset of hypergraph quasirandomness
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• The random graph
• The search for N-e.c. Graphs
• Universal graphs and universal functions
• Vertex-transitive self-complementary uniform hypergraphs
• Vertex-transitive self-complementary uniform hypergraphs of prime order
• Zero-one laws with variable probability

Cited in

(4)

• The Rado simplicial complex
• Large simplicial complexes: universality, randomness, and ampleness
• Occupants in simplicial complexes
• Connectivity of Ample, Conic, and Random Simplicial Complexes

This page was built for publication: Ample simplicial complexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115328)