Sum complexes---a new family of hypertrees
From MaRDI portal
Publication:603857
DOI10.1007/S00454-010-9252-5zbMATH Open1213.05038arXiv0903.1359OpenAlexW2095841822MaRDI QIDQ603857FDOQ603857
Authors: Sumit K. Garg
Publication date: 8 November 2010
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Abstract: A k-dimensional hypertree X is a k-dimensional complex on n vertices with a full (k-1)-dimensional skeleton and �inom{n-1}{k} facets such that H_k(X;Q)=0. Here we introduce the following family of simplicial complexes. Let n,k be integers with k+1 and n relatively prime, and let A be a (k+1)-element subset of the cyclic group Z_n. The sum complex X_A is the pure k-dimensional complex on the vertex set Z_n whose facets are subsets sigma of Z_n such that |sigma|=k+1 and sum_{x in sigma}x in A. It is shown that if n is prime then the complex X_A is a k-hypertree for every choice of A. On the other hand, for n prime X_A is k-collapsible iff A is an arithmetic progression in Z_n.
Full work available at URL: https://arxiv.org/abs/0903.1359
Recommendations
Cites Work
Cited In (13)
- Spectral expansion of random sum complexes
- Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes
- Random balanced Cayley complexes
- When does the top homology of a random simplicial complex vanish?
- Generalized loop-erased random walks and approximate reachability
- Small simplicial complexes with prescribed torsion in homology
- Uncertainty principles and sum complexes
- Enumeration of \({\mathbb{Q}}\)-acyclic simplicial complexes
- Random simple-homotopy theory
- Betti numbers of complexes with highly connected links
- In search of hyperpaths
- Random discrete Morse theory and a new library of triangulations
- Extremal hypercuts and shadows of simplicial complexes
This page was built for publication: Sum complexes---a new family of hypertrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q603857)