2017
DOI: 10.1007/s00454-017-9926-3
|View full text |Cite
|
Sign up to set email alerts
|

2-Complexes with Large 2-Girth

Abstract: The 2-girth of a 2-dimensional simplicial complex X is the minimum size of a non-zero 2-cycle in H 2 (X, Z/2). We consider the maximum possible girth of a complex with n vertices and m 2-faces. If m = n 2+α for α < 1/2, then we show that the 2-girth is at most 4n 2−2α and we prove the existence of complexes with 2-girth at least c α,ǫ n 2−2α−ǫ . On the other hand, if α > 1/2, the 2-girth is at most C α . So there is a phase transition as α passes 1/2.Our results depend on a new upper bound for the number of co… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
12
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(12 citation statements)
references
References 9 publications
0
12
0
Order By: Relevance
“…However, the weight of this filling is actually substantially larger than W n since it contains some Cn 2 triangles with high probability. This fact was proved in [4] and further studied in the work of Dotterrer, Guth and Kahle [11] concerning the homological girth of 2-dimensional complexes which inspired our proof of Theorem 3.…”
Section: First Passage Percolation / Combinatorial Optimization On Th...mentioning
confidence: 68%
“…However, the weight of this filling is actually substantially larger than W n since it contains some Cn 2 triangles with high probability. This fact was proved in [4] and further studied in the work of Dotterrer, Guth and Kahle [11] concerning the homological girth of 2-dimensional complexes which inspired our proof of Theorem 3.…”
Section: First Passage Percolation / Combinatorial Optimization On Th...mentioning
confidence: 68%
“…We rely on the following result of Dotterer, Guth, and Kahle derived from work of Aronshtam, Linial, Łuczak and Meshulam [2]. Since a proof is omitted from [4] we sketch a proof here. For notation and details, we refer the reader to [2].…”
Section: Asymptotically Good Homological Codesmentioning
confidence: 99%
“…The results in [2] and [4] rely on probabilistic methods to prove the existence of such simplicial complexes. It would be interesting to have explicit constructions of such simplicial complexes.…”
Section: Asymptotically Good Homological Codesmentioning
confidence: 99%
See 1 more Smart Citation
“…This paper contributes to the rapidly evolving study of the combinatorics of simplicial complexes in the context of their homological and homotopical properties. Let us mention, e.g., the paper [4] dealing with small (simple) cycle in dense simplicial complexes, addressing a similar (actually, only a similar-looking) problem.…”
Section: Introductionmentioning
confidence: 99%