Pure n-Simplicial Trees: A Higher-Dimensional Framework

Updated 9 July 2026

Pure n-simplicial trees are defined as pure n-dimensional complexes that are connected and acyclic, serving as higher-dimensional generalizations of graph trees.
They encompass various formalisms—including path-and-cycle, homological, and commutative-algebraic approaches—that reveal unique structural and computational properties.
Research in this area bridges combinatorics, algebraic topology, and random complex theory, yielding insights into enumeration, spectral limits, and facet-ideal resolutions.

Pure $n$ -simplicial trees are higher-dimensional analogues of graph trees formulated inside pure $n$ -dimensional simplicial complexes. In one current formulation, a pure $n$ -simplicial tree is a pure $n$ -simplicial complex that is connected and acyclic, and this notion is equivalent to Dewdney’s $(n-1,n)$ -trees (Kottari et al., 25 Aug 2025). The broader literature, however, contains several closely related but non-identical frameworks: simplicial trees defined by leaf conditions, simplicial spanning trees and hypertrees defined by homological acyclicity and spanning conditions, stoss complexes with complete lower skeleta, and minimally path connected pure complexes (Kumar et al., 2023, Rosenthal et al., 2020, Duval et al., 2015, Mead, 2019). The subject therefore occupies an intersection of combinatorics, algebraic topology, commutative algebra, and random complex theory.

1. Terminology, purity, and competing formalizations

A simplicial complex $K$ on a finite vertex set is a collection of non-empty subsets closed under passage to non-empty faces; a simplex $\sigma$ has dimension $|\sigma|-1$ . A simplicial complex is pure $n$ -dimensional if every simplex is a face of at least one $n$ -simplex of $n$ 0 (Kottari et al., 25 Aug 2025). In the commutative-algebraic literature, purity is usually stated equivalently as the condition that all facets have the same dimension, so a pure $n$ 1-dimensional complex has all facets of cardinality $n$ 2 (Kumar et al., 2023, Kamberi et al., 2024).

The phrase “pure $n$ 3-simplicial tree” is not historically unique. In Faridi’s sense, a simplicial tree is a connected simplicial forest, where every nonempty subcomplex has a leaf; purity is additional rather than built into the definition (Faridi, 2012, Kamberi et al., 2024). In homological treatments, a $n$ 4-tree is often a pure $n$ 5-dimensional complex with $n$ 6 and $n$ 7, or a spanning subcomplex satisfying the corresponding higher-dimensional acyclicity and connectedness conditions (Duval et al., 2015). In the recent path-and-cycle approach, purity is built into the object from the outset, and tree-likeness is defined intrinsically rather than relative to an ambient complete skeleton (Kottari et al., 25 Aug 2025).

Notion	Defining feature	Representative source
Pure $n$ 8-simplicial tree	connected and acyclic pure $n$ 9-complex	(Kottari et al., 25 Aug 2025)
Simplicial tree (Faridi)	every nonempty subcomplex has a leaf	(Faridi, 2012)
Simplicial spanning tree / hypertree	spanning lower skeleton plus homological conditions	(Rosenthal et al., 2020)
Minimal connected cover	pure connected complex where removing any facet disconnects	(Mead, 2019)

This multiplicity of definitions is not accidental. Some formalisms emphasize intrinsic path and cycle structure, some emphasize homology, and some emphasize algebraic properties of facet ideals. A plausible implication is that the term is best handled as a family of adjacent notions whose overlap is substantial but not complete.

2. Path, cycle, and ordering characterizations

In the path-and-cycle framework, Dewdney’s $n$ 0-language is central. A pure $n$ 1-simplicial complex $n$ 2 has an $n$ 3-ordering if its $n$ 4-simplices can be ordered $n$ 5 so that for each $n$ 6, the attachment $n$ 7 is an $n$ 8-dimensional simplicial complex, where $n$ 9; if each attachment is $n$ 0-complete, then $n$ 1 has an $n$ 2-complete ordering (Kottari et al., 25 Aug 2025). Dewdney’s $n$ 3-trees are precisely pure $n$ 4-simplicial complexes with an $n$ 5-complete ordering.

The recent characterization of pure $n$ 6-simplicial trees defines them as pure $n$ 7-simplicial complexes that are connected and acyclic, where connectedness is expressed through $n$ 8-paths and acyclicity through the absence of simplicial cycles (Kottari et al., 25 Aug 2025). The main equivalence is that a pure $n$ 9-simplicial complex is a simplicial tree if and only if it has an $(n-1,n)$ 0-complete ordering; equivalently, pure $(n-1,n)$ 1-simplicial trees coincide exactly with Dewdney’s $(n-1,n)$ 2-trees (Kottari et al., 25 Aug 2025).

The same work gives a higher-dimensional unique-path theorem. A connected pure $(n-1,n)$ 3-simplicial complex is a simplicial tree if and only if there is a unique reduced $(n-1,n)$ 4-path sequence between any two $(n-1,n)$ 5-simplices, there is a unique reduced simplicial path between any two $(n-1,n)$ 6-simplices not contained in a common joint $(n-1,n)$ 7-simplex for each $(n-1,n)$ 8, and there are no $(n-1,n)$ 9-simplicial cycle sequences (Kottari et al., 25 Aug 2025). This is the direct analogue of the graph-theoretic criterion that a connected graph is a tree exactly when there is a unique simple path between any two vertices.

A numerical characterization is also available. If $K$ 0 is a pure $K$ 1-simplicial complex with $K$ 2 vertices, then $K$ 3 is a simplicial tree if and only if $K$ 4 is connected and, for some $K$ 5,

$K$ 6

where $K$ 7 is the number of $K$ 8-simplices (Kottari et al., 25 Aug 2025). In particular,

$K$ 9

For $\sigma$ 0, this reduces to the ordinary formula “number of edges = number of vertices minus 1.” For $\sigma$ 1, the corresponding conditions become $\sigma$ 2 and $\sigma$ 3, recovering the Beineke–Pippert characterization cited there (Kottari et al., 25 Aug 2025).

The same paper also settles a historical point: Dewdney’s two conjectures characterizing $\sigma$ 4-trees by the absence of circuits together with face-count identities are false when $\sigma$ 5; explicit pure 2-dimensional counterexamples are given (Kottari et al., 25 Aug 2025). The corrected statement requires both acyclicity and additional face-count conditions, notably

$\sigma$ 6

together with the absence of $\sigma$ 7-simplicial cycle sequences for some $\sigma$ 8 (Kottari et al., 25 Aug 2025). This is one of the clearest demonstrations that higher-dimensional tree theory cannot be reduced to a single naïve extension of graph-theoretic counting formulas.

3. Homological trees, simplicial spanning trees, and stoss complexes

$|\sigma|-1$ 5

(Duval et al., 2015). In a pure $|\sigma|-1$ 6-dimensional simplicial setting, this is a direct higher-dimensional analogue of acyclicity and connectedness for ordinary trees.

$n$ 4

where $n$ 5 (Rosenthal et al., 2020). In the maximal-dimension case $n$ 6, these are called simplicial spanning trees. Their weighted count is

$n$ 7

which is the higher-dimensional analogue of the number of spanning trees, now with torsion weighting (Rosenthal et al., 2020).

The homological theory naturally brings in matrix-tree formulas. For a $n$ 8-complex $n$ 9, if $n$ 0 denotes the product of nontrivial eigenvalues of the upper Laplacian $n$ 1, then the high-dimensional matrix-tree theorem states

$n$ 2

(Rosenthal et al., 2020). More generally, the cellular matrix-forest theorems express higher-dimensional tree counts via reduced Laplacians and torsion correction factors, and Kalai’s generalization of Cayley’s formula yields

$n$ 3

for the complete $n$ 4-dimensional complex on $n$ 5 vertices (Duval et al., 2015).

A related notion is the stoss complex, defined as a $n$ 6-dimensional simplicial complex on $n$ 7 vertices with complete $n$ 8-skeleton that is $n$ 9-acyclic; “stoss” abbreviates “Spanning Tree Of a Skeleton of a Simplex” (Katthän, 2014). Stoss complexes are pure $n$ 00-dimensional tree-like objects, every such complex is $n$ 01-Cohen–Macaulay, and every stoss complex on $n$ 02 vertices has exactly $n$ 03 facets when the dimension is $n$ 04 (Katthän, 2014).

This homological regime is distinct from the intrinsic path-and-cycle regime. Simplicial spanning trees and stoss complexes are defined relative to a fixed ambient complex, typically with complete lower skeleton; pure $n$ 05-simplicial trees in the Dewdney equivalence are intrinsic pure complexes characterized by path and cycle structure (Kottari et al., 25 Aug 2025, Rosenthal et al., 2020, Katthän, 2014). This suggests two complementary viewpoints: one local and combinatorial, one global and homological.

In the commutative-algebraic literature, a facet $n$ 06 of a simplicial complex is a leaf if it is the only facet or there exists another facet $n$ 07 such that

$n$ 08

such a $n$ 09 is a branch of $n$ 10 (Kumar et al., 2023). A simplicial forest is a complex in which every subcomplex has a leaf, and a simplicial tree is a connected simplicial forest (Kumar et al., 2023, Kamberi et al., 2024). A good leaf is a leaf that remains a leaf in every subcomplex containing it, and every simplicial tree contains a good leaf (Faridi, 2013).

Good leaves induce good leaf orders. If $n$ 11 is a good leaf of a simplicial tree $n$ 12, one can order the facets $n$ 13 so that

$n$ 14

each $n$ 15 is a leaf of $n$ 16, and each $n$ 17 is connected (Faridi, 2013). This provides a recursive combinatorial filtration of the tree by facet additions. In the pure case, all facets have the same cardinality, so the good leaf order becomes an especially rigid “leaf-by-leaf” construction of a pure $n$ 18-dimensional tree.

For a simplicial complex $n$ 19 with facets $n$ 20, the facet ideal in $n$ 21 is

$n$ 22

(Kumar et al., 2023). If $n$ 23 is pure of dimension $n$ 24, then $n$ 25 is generated in degree $n$ 26. Zheng’s intersection property is the key structural condition for pure simplicial trees connected in codimension $n$ 27: if $n$ 28 is pure $n$ 29-dimensional, connected in codimension $n$ 30, and $n$ 31 denotes the unique irredundant proper-chain distance between facets $n$ 32, then the intersection property is

$n$ 33

(Kumar et al., 2023, Kamberi et al., 2024).

The principal theorem in this direction states that for a simplicial tree $n$ 34, the following are equivalent: $n$ 35 satisfies the intersection property; $n$ 36 has a linear resolution; $n$ 37 has linear quotients for all $n$ 38 and $n$ 39 is pure; $n$ 40 has linear quotients for some $n$ 41 and $n$ 42 is pure; $n$ 43 has a linear resolution for some $n$ 44; and $n$ 45 has linear first syzygies for some $n$ 46 (Kumar et al., 2023). Thus, for pure simplicial trees, linearity of one power already forces a strong global intersection pattern.

Regularity is controlled recursively via good leaf orders. For a simplicial forest $n$ 47 with facets in good leaf order and $n$ 48, the paper gives a recursive bound

$n$ 49

and conjectures that for a $n$ 50-dimensional simplicial tree,

$n$ 51

(Kumar et al., 2023). This conjecture is proved there for some special classes, including certain pure trees arising from broom graphs and perfect rooted trees.

Squarefree powers provide a parallel theory. If $n$ 52 is a simplicial tree with intersection property, then all nonzero squarefree powers $n$ 53 have linear quotients and hence linear resolutions (Kamberi et al., 2024). For pure simplicial forests with the intersection property, the matching number satisfies $n$ 54, which sharply restricts the nonzero squarefree powers (Kamberi et al., 2024). For $n$ 55-path ideals of path graphs, which yield pure $n$ 56-dimensional simplicial trees, the regularity formula is explicit: $n$ 57 (Kamberi et al., 2024).

A common misconception is that the commutative-algebraic definition of simplicial tree is merely a reformulation of the path-and-cycle definition. The overlap is significant in pure codimension- $n$ 58-connected settings, but the two theories were developed for different purposes and are not stated as identical in the cited works.

5. Enumeration, random models, and asymptotic structure

One line of work studies pure complexes that minimally connect a vertex set. A pure $n$ 59-dimensional simplicial complex $n$ 60 on $n$ 61 is a minimal connected cover if $n$ 62 is connected and removal of any facet disconnects it (Mead, 2019). These objects are proposed there as higher-dimensional analogues of graph trees in the sense of minimal path connectivity rather than homological acyclicity. They satisfy

$n$ 63

their $n$ 64-skeleton determines them uniquely, and they can realize arbitrary finitely presented abelian groups in lower homology degrees (Mead, 2019). Their number $n$ 65 obeys

$n$ 66

for constants $n$ 67 depending on $n$ 68 (Mead, 2019). This is a markedly different enumeration problem from the homological hypertree counts of Kalai.

For homological spanning trees, random models become particularly rich. In the $n$ 69-uniform random Steiner complex model, the complex has complete $n$ 70-skeleton and $n$ 71-faces coming from the union of $n$ 72 independent $n$ 73-Steiner systems (Rosenthal et al., 2020). The main asymptotic theorem states that if $n$ 74, then for random $n$ 75-uniform Steiner complexes $n$ 76,

$n$ 77

in probability, where $n$ 78 is an explicit constant obtained from the limiting spectral measure of the $n$ 79-dimensional $n$ 80-regular arboreal complex (Rosenthal et al., 2020). The proof combines the high-dimensional matrix-tree theorem with local weak convergence to the arboreal complex and a Kesten–McKay-type limit law for the upper Laplacian.

A complementary probabilistic model is the determinantal measure on $n$ 81-dimensional hypertrees of the complete simplex. Kalai’s formula

$n$ 82

induces the determinantal probability measure

$n$ 83

on $n$ 84 (Werf, 2022). These random hypertrees admit a structurally inductive description via simplicial cones and rooted forests, and the link of a simplex in a random determinantal hypertree has the distribution of a lower-dimensional determinantal hypertree together with an independent Linial–Meshulam complex (Werf, 2022). One striking corollary is that the union of $n$ 85 determinantal $n$ 86-trees has fundamental group with Kazhdan’s property (T) with high probability (Werf, 2022).

Random pure simplicial complexes in the Bernoulli facet model provide a useful contrast. In the model $n$ 87, each $n$ 88-subset is chosen independently as a facet and the complex is its downward closure (Markström et al., 2020). The cited results show thresholds for complete lower skeleta and the emergence of large top homology; for example, if $n$ 89 is constant and $n$ 90, then $n$ 91 is nontrivial with high probability (Markström et al., 2020). This suggests that genuinely tree-like acyclicity occupies a sparse and atypical region of pure-complex parameter space.

6. Adjacent notions, non-equivalence, and broader geometric context

Minimal Cohen–Macaulay $n$ 92-simplicial complexes form another adjacent class. If $n$ 93 is a $n$ 94-dimensional pure $n$ 95-simplicial complex that is minimal Cohen–Macaulay, then $n$ 96 and

$n$ 97

for the number of vertices (Wang et al., 2021). Such complexes are acyclic, and shellability of a pure simplicial complex is equivalent to the existence of a full sequence of Cohen–Macaulay subcomplexes obtained by successively adjoining facets (Wang et al., 2021). The paper explicitly presents these minimal Cohen–Macaulay complexes as higher-dimensional “tree-like” objects, but it does not prove that they coincide with Faridi simplicial trees or with pure $n$ 98-simplicial trees in the path-and-cycle sense (Wang et al., 2021). They should therefore be treated as related, not synonymous.

There is also a geometric-combinatorial strand built from hypertrees rather than pure complexes of fixed facet size. The poset of noncrossing hypertrees has dual equal to the face poset of a pure simplicial complex, the noncrossing hypertree complex, whose maximal simplices correspond to noncrossing trees; this complex is homeomorphic to the noncrossing partition link and identified there with a generalized cluster complex of type $n$ 99 with parameter $n$ 00 (McCammond, 2017). Although these are not “pure $n$ 01-simplicial trees” in the Dewdney sense, they show that tree-like combinatorics naturally generate pure simplicial complexes tied to associahedra, cluster theory, and spherical buildings (McCammond, 2017).

Two points therefore matter for terminology. First, “pure” may refer either to all facets having a fixed dimension or, in some probabilistic settings, to random complexes generated from top-dimensional facets only. Second, “tree” may mean absence of higher-dimensional cycles, homological acyclicity with vanishing codimension- $n$ 02 homology, recursive leaf structure, or minimal path connectivity. The recent equivalence with Dewdney’s $n$ 03-trees gives one precise intrinsic definition for pure $n$ 04-simplicial trees (Kottari et al., 25 Aug 2025), but the literature as a whole preserves several other mathematically meaningful generalizations (Duval et al., 2015, Mead, 2019, Kumar et al., 2023).

A plausible implication is that future work will continue to move in two directions simultaneously: toward sharper intrinsic characterizations of pure $n$ 05-simplicial trees, and toward translation theorems relating path-and-cycle definitions, homological hypertrees, and facet-ideal methods. The current record already shows that higher-dimensional trees are not a single object but a structured landscape.