2020
DOI: 10.48550/arxiv.2009.13558
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Computation of the taut, the veering and the Teichmüller polynomials

Abstract: Landry, Minsky and Taylor [LMT] introduced two polynomial invariants of veering triangulations -the taut polynomial and the veering polynomial. We give algorithms to compute these invariants. In their definition [LMT] use only the upper track of the veering triangulation, while we consider both the upper and the lower track. We prove that the lower and the upper taut polynomials are equal. However, we show that there are veering triangulations whose lower and upper veering polynomials are different.[LMT] prov… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 16 publications
0
3
0
Order By: Relevance
“…However, if the triangulation is veering the lower and upper tracks restricted to the faces of a single tetrahedron t are determined by the colours of the diagonal edges of t; see the lemma below. Lemma 3.8 (Lemma 3.9 in [18]). Let V = (T , α, ν) be a veering triangulation.…”
Section: The Lower and Upper Tracksmentioning
confidence: 99%
See 1 more Smart Citation
“…However, if the triangulation is veering the lower and upper tracks restricted to the faces of a single tetrahedron t are determined by the colours of the diagonal edges of t; see the lemma below. Lemma 3.8 (Lemma 3.9 in [18]). Let V = (T , α, ν) be a veering triangulation.…”
Section: The Lower and Upper Tracksmentioning
confidence: 99%
“…Remark. An algorithm to compute the Teichmüller polynomial using Lemma 7.1 is given in [18,Section 8]. 7.3.…”
Section: Consequences For the Teichmüller Polynomial And Fibred Facesmentioning
confidence: 99%
“…This connects to our previous work [LMT20] introducing the veering polynomial, relating it to the Teichmüller polynomial, and laying the combinatorial groundwork for what is done here (although we emphasize that this paper can be read independently of the previous). Also, Parlak has recently introduced and implemented algorithms to compute the veering polynomial and its relatives [Par20] and demonstrated a connection with the Alexander polynomial [Par21], thereby generalizing work of McMullen on the Teichmüller polynomial [McM00].…”
mentioning
confidence: 99%