✦ LIBER ✦

Restricted colored permutations and Chebyshev polynomials

✍ Scribed by Eric S. Egge

Book ID: 108113733
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 180 KB
Volume: 307
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.09.027

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Restricted 132-Alternating Permutations

Restricted 132-Alternating Permutations and Chebyshev Polynomials

✍ Toufik Mansour 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 285 KB

Restricted 132-avoiding k-ary words, Che

Restricted 132-avoiding k-ary words, Chebyshev polynomials, and continued fractions

✍ Toufik Mansour 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 155 KB

Restricted permutations and queue jumpin

Restricted permutations and queue jumping

✍ M.H. Albert; R.E.L. Aldred; M.D. Atkinson; H.P. van Ditmarsch; C.C. Handley; D.A 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 159 KB

σ-Automata and Chebyshev-polynomials

✍ Klaus Sutner 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 192 KB

A -automaton is an additive, binary cellular automaton on a graph. For product graphs such as a grids and cylinders, reversibility and periodicity properties of the corresponding -automaton can be expressed in terms of a binary version of Chebyshev polynomials. We will give a detailed analysis of th

Schützenberger groups and Chebyshev poly

Schützenberger groups and Chebyshev polynomials

✍ K. D. Magill; S. Schanuel 📂 Article 📅 1976 🏛 Springer 🌐 English ⚖ 241 KB

Chebyshev polynomials and spectral metho

Chebyshev polynomials and spectral methods

📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 130 KB