Kauffman's clock lattice as a graph of perfect matchings: a formula for its height (Q470959): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / review text | |||
Summary: We give an algorithmic computation for the height of Kauffman's clock lattice obtained from a knot diagram with two adjacent regions starred and without crossing information specified. We show that this lattice is more familiarly the graph~of perfect matchings of a bipartite graph~obtained from the knot diagram by overlaying the two dual Tait graphs~of the knot diagram. Furthermore we prove structural properties of the bipartite graph in general. This setting also makes evident applications to Chebyshev or harmonic knots, whose related bipartite graph is the popular grid graph, and to discrete Morse functions. | |||
| Property / review text: Summary: We give an algorithmic computation for the height of Kauffman's clock lattice obtained from a knot diagram with two adjacent regions starred and without crossing information specified. We show that this lattice is more familiarly the graph~of perfect matchings of a bipartite graph~obtained from the knot diagram by overlaying the two dual Tait graphs~of the knot diagram. Furthermore we prove structural properties of the bipartite graph in general. This setting also makes evident applications to Chebyshev or harmonic knots, whose related bipartite graph is the popular grid graph, and to discrete Morse functions. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 57M25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 57M15 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C70 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C90 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6369277 / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: OEIS / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1211.2558 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:59, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Kauffman's clock lattice as a graph of perfect matchings: a formula for its height |
scientific article |
Statements
Kauffman's clock lattice as a graph of perfect matchings: a formula for its height (English)
0 references
13 November 2014
0 references
Summary: We give an algorithmic computation for the height of Kauffman's clock lattice obtained from a knot diagram with two adjacent regions starred and without crossing information specified. We show that this lattice is more familiarly the graph~of perfect matchings of a bipartite graph~obtained from the knot diagram by overlaying the two dual Tait graphs~of the knot diagram. Furthermore we prove structural properties of the bipartite graph in general. This setting also makes evident applications to Chebyshev or harmonic knots, whose related bipartite graph is the popular grid graph, and to discrete Morse functions.
0 references
