Papers
Topics
Authors
Recent
Search
2000 character limit reached

Vertex numbers of simplicial complexes with free abelian fundamental group

Published 24 Sep 2021 in math.CO, math.AC, and math.AT | (2109.11952v1)

Abstract: We show that the minimum number of vertices of a simplicial complex with fundamental group $\mathbb{Z}{n}$ is at most $O(n)$ and at least $\Omega(n{3/4})$. For the upper bound, we use a result on orthogonal 1-factorizations of $K_{2n}$. For the lower bound, we use a fractional Sylvester-Gallai result. We also prove that any group presentation $\langle S | R\rangle \cong \mathbb{Z}{n}$ whose relations are of the form $g{a}h{b}i{c}$ for $g, h, i \in S$ has at least $\Omega(n{3/2})$ generators.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.