4
$\begingroup$

I am giving an expository talk soon about Duval-Klivans-Martin's paper Simplicial Matrix Tree Theorems, and I've been struggling to find a good example to do at the board. An important aspect of the theory is that some spanning trees have torsion, and I want to highlight this fact. Here is the definition:

If $\Delta$ is a simplicial complex and $\Gamma^d$ is a subcomplex which agrees with $\Gamma$ in positive codimension $\Delta_{(d-1)}=\Gamma_{(d-1)}$, then $\Gamma$ is called a spanning tree if any two (and hence all) of the following conditions hold:

  • $\tilde H_d(\Gamma,\Bbb Z)=0$
  • $|\tilde H_{d-1}(\Gamma,\Bbb Z)|<\infty$
  • $f_d(\Gamma)=f_d(\Delta)-\tilde\beta_d(\Delta)+\tilde\beta_{d-1}(\Delta)$.

Ideally, I'm trying to find a simplicial complex which has both torsion and nontorsion spanning trees, and yet has few enough spanning trees that it could be reasonably computed on the board. Some candidates which don't fulfill these purposes include

  • A minimal triangulation $\Bbb{RP}^2$ is a torsion tree, which shows existence but is not so interesting.
  • You can stick a sphere out of $\Bbb{RP}^2$ (like the connect sum but without removing the disk) and this complex has four trees, but alas they are all torsion.
  • There is a minimal triangulation of $\Bbb{RP}^2$ which spans the $2$-skeleton of the $6$-simplex, but there are far too many spanning trees of this complex to do on the board.
$\endgroup$
  • 3
    $\begingroup$ So just to clarify, these spanning trees are not in fact trees? $\endgroup$ – Qiaochu Yuan Apr 30 '16 at 0:18
  • 1
    $\begingroup$ They are exactly trees if $d = 1.$ When $d=1$ the conditions become acyclic, connected, and one fewer edge than vertex. In general they are not trees, they are $d$-dimensional simplicial complexes satisfying a generalized "acyclic" and "connected" conditions. $\endgroup$ – John Machacek Apr 30 '16 at 0:24
6
$\begingroup$

Here is an example (which might be be what you are describing in your third bullet point) that I think is both doable and illustrates torsion spanning trees. Consider the minimal triangular of $\mathbb{RP}^2$ shown below.

$\hskip 2in$ enter image description here

Let $\Gamma$ denote this simplicial complex which triangulates $\mathbb{RP}^2$. Let $\Delta = \Gamma \cup \{1,2,3\}$ and let $\Theta = \Delta \setminus \{4,5,6\}$. Then $\Gamma$ is a simplicial spanning tree of $\Delta$ with torsion while $\Theta$ is a simplicial spanning tree of $\Delta$ with out torsion. Further $\Theta' = \Delta \setminus \{i,j,k\}$ for any $\{i,j,k\} \ne \{1,2,3\}$ will be homotopy equivalent to $\Theta$ and thus have the same homology.

$\endgroup$
  • $\begingroup$ Augh! I actually had been thinking about this example, but I did the calculations wrong and I thought that $\Theta$ wasn't a spanning tree :( :( Thanks for your diligence! $\endgroup$ – Eric Stucky Apr 30 '16 at 5:19

Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Not the answer you're looking for? Browse other questions tagged or ask your own question.