Jair Taylor - Counting words with Laguerre polynomials

dmtcs:2369 - Discrete Mathematics & Theoretical Computer Science, January 1, 2013, DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013) - https://doi.org/10.46298/dmtcs.2369
Counting words with Laguerre polynomialsArticle

Authors: Jair Taylor 1

  • 1 Department of Mathematics [Seattle]

We develop a method for counting words subject to various restrictions by finding a combinatorial interpretation for a product of formal sums of Laguerre polynomials. We use this method to find the generating function for $k$-ary words avoiding any vincular pattern that has only ones. We also give generating functions for $k$-ary words cyclically avoiding vincular patterns with only ones whose runs of ones between dashes are all of equal length, as well as the analogous results for compositions.


Volume: DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013)
Section: Proceedings
Published on: January 1, 2013
Imported on: November 21, 2016
Keywords: Laguerre polynomial,orthogonal polynomial,combinatorics on words,vincular pattern,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Consultation statistics

This page has been seen 248 times.
This article's PDF has been downloaded 527 times.