Rooted trees with the same plucking polynomial (Q2272809): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Brian Alspach / rank | |||
Property / reviewed by | |||
Property / reviewed by: Brian Alspach / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1702.02004 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Realization of plucking polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Strict unimodality of plucking polynomials of rooted trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Catalan states of lattice crossing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Catalan states of lattice crossing: an application of plucking polynomial / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4020209 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(q\)-polynomial invariant of rooted trees / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 13:07, 20 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Rooted trees with the same plucking polynomial |
scientific article |
Statements
Rooted trees with the same plucking polynomial (English)
0 references
20 September 2019
0 references
Let \(T\) be a rooted tree drawn in the upper half plane so that the root is at the origin. Define the plucking polynomial \(Q(T)\) recursively as follows. When \(T\) has order 1, \(Q(T)=1\). When \(|V(T)|>1\), let \[ Q(T)= \sum_{v\in L} q^{r(v)}Q(T-v), \] where the sum is over the set \(L\) of leaves of \(T\), \(r(v)\) is the number of edges of \(T\) to the right of the unique path joining \(v\) to the root, and \(T-v\) is the subtree of \(T\) with the leaf \(v\) removed. \textit{J. H. Przytycki} [Arnold Math. J. 2, No. 4, 449--461 (2016; Zbl 1358.05057)] introduced this polynomial motivated by the Kauffman bracket skein modules of 3-manifolds. The primary question addressed in this paper is when do two rooted trees have the same plucking polynomial. The question is answered in two ways along with an interesting discussion on operations on trees that preserve the plucking polynomial.
0 references
plucking polynomial
0 references
rooted tree
0 references