2009
DOI: 10.1007/s10801-009-0198-8
|View full text |Cite
|
Sign up to set email alerts
|

Quantized Chebyshev polynomials and cluster characters with coefficients

Abstract: We introduce quantized Chebyshev polynomials as deformations of generalized Chebyshev polynomials previously introduced by the author in the context of acyclic coefficient-free cluster algebras. We prove that these quantized polynomials arise in cluster algebras with principal coefficients associated to acyclic quivers of infinite representation types and equioriented Dynkin quivers of type A. We also study their interactions with bases and especially canonically positive bases in affine cluster algebras.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
22
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 14 publications
(23 citation statements)
references
References 20 publications
1
22
0
Order By: Relevance
“…In Section 2, we prove that cluster monomials form the atomic basis in a cluster algebra of type A. In Section 3, we give a combinatorial interpretation to a conjectural formula provided in [14] for the atomic basis in a cluster algebra of typeÃ. Finally, we prove in Section 4 that this conjectural atomic basis is indeed the atomic basis in typeÃ.…”
Section: Cluster Algebrasmentioning
confidence: 97%
“…In Section 2, we prove that cluster monomials form the atomic basis in a cluster algebra of type A. In Section 3, we give a combinatorial interpretation to a conjectural formula provided in [14] for the atomic basis in a cluster algebra of typeÃ. Finally, we prove in Section 4 that this conjectural atomic basis is indeed the atomic basis in typeÃ.…”
Section: Cluster Algebrasmentioning
confidence: 97%
“…For further details concerning these polynomials, especially in the context of cluster algebras, one can refer to [15].…”
Section: Normalized Chebyshev Polynomialsmentioning
confidence: 99%
“…Equation 20 is an approximation of the Mth order CSs representation. C is a matrix that is made up of M × N submatrices, and every submatrix is the expanded matrix that is defined by Equation 16.…”
Section: Des Of the Multidimensional Casementioning
confidence: 99%
“…17 The redundant CSs 18 or Chebyshev expansions 19 of the desired degree are cut off to find the Nth order polynomial approximating with the largest feasible leading coefficients. 20 The truncation errors of the CSs can be evaluated by the coefficients of the CSs. 21 Chebyshev polynomials form a complete orthogonal system.…”
Section: Introductionmentioning
confidence: 99%