A generalization of the Chebyshev polynomials and nonrooted posets

DOI10.1093/IMRN/RNP158MaRDI QIDQ3550233zbMATH OpenOpenAlexFDO

Authors Masaya Tomie

Publication date 31 March 2010

Published in IMRN. International Mathematics Research Notices (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0704.0685, http://imrn.oxfordjournals.org/cgi/content/abstract/2010/5/856

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07) Arithmetic functions; related numbers; inversion formulas (11A25) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Combinatorics on words (68R15)

Abstract: In this paper we give a generalization of Chebyshev polynomials and using this we describe the M"obius function of the generalized subword order from a poset {a1,...as,c |ai<c}, which contains an affirmative answer for the conjecture by Bj"orner, Sagan, Vatter.[5,10]

Recommendations

• Combinatorics of generalized Tchebycheff polynomials.
• Tchebyshev posets
• On generalization of tchebycheff polynomials
• The Möbius function of generalized subword order
• Generalized Chebyshev polynomials

Cited in

(5)

• Tchebyshev posets
• Combinatorics of generalized Tchebycheff polynomials.
• On the topology of the permutation pattern poset
• The Möbius function of generalized subword order
• Generalized Tchebyshev triangulations

This page was built for publication: A generalization of the Chebyshev polynomials and nonrooted posets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3550233)