Abstract
Hypertrees are high-dimensional counterparts of graph theoretic trees. They have attracted a great deal of attention by various investigators. Here we introduce and study hyperpaths—a particular class of hypertrees which are high dimensional analogs of paths in graph theory. A d-dimensional hyperpath is a d-dimensional hypertree in which every (d- 1) -dimensional face is contained in at most (d+ 1) faces of dimension d. We introduce a possibly infinite family of hyperpaths for every dimension, and investigate its properties in greater depth for dimension d= 2.
| Original language | English |
|---|---|
| Pages (from-to) | 399-421 |
| Number of pages | 23 |
| Journal | Discrete and Computational Geometry |
| Volume | 69 |
| Issue number | 2 |
| DOIs | |
| State | Published - Mar 2023 |
Bibliographical note
Publisher Copyright:© 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
Keywords
- Finite fields
- High dimensional combinatorics
- Hypertrees
- Linear algebra
- Matrix multiplication
- Simplicial complexes
Fingerprint
Dive into the research topics of 'In Search of Hyperpaths'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver