A Generalization of the Chebyshev Polynomials and Nonrooted Posets

Autor:	Masaya Tomie
Rok vydání:	2009
Předmět:	Combinatorics Discrete mathematics Chebyshev polynomials Mathematics::Combinatorics Algebraic combinatorics Conjecture Generalization General Mathematics Order (group theory) Möbius function Chebyshev nodes Partially ordered set Mathematics
Zdroj:	International Mathematics Research Notices. 2010:856-881
ISSN:	1687-0247 1073-7928
Popis:	In this article we give a generalization of the Chebyshev polynomials of the first kind. Then we describe a Mobius function of the generalized subword order over P s . These results give the affirmative answer for the conjecture proposed in [A. Bjorner and B. Sagan, “Rationality of the Mobius function of the composition poset,” Theoretical Computer Science 359, no. 1-3 (2006): 282-98.] and [B. Sagan and V. Vatter, “The Mobius function of the composition poset,” Journal of Algebraic Combinatorics 24, no. 2 (2006): 117-36].
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::e409aa775ab48ca7aab2716f1c27ae57 https://doi.org/10.1093/imrn/rnp158 Zobrazit plný text záznamu