Skip to Main content Skip to Navigation
Conference papers

Counting words with Laguerre polynomials

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-01229684
Contributor : Alain Monteil <>
Submitted on : Tuesday, November 17, 2015 - 10:19:54 AM
Last modification on : Tuesday, March 7, 2017 - 3:23:32 PM
Long-term archiving on: : Thursday, February 18, 2016 - 11:37:54 AM

File

dmAS0193.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01229684, version 1

Collections

Citation

Jair Taylor. Counting words with Laguerre polynomials. 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), 2013, Paris, France. pp.1101-1112. ⟨hal-01229684⟩

Share

Metrics

Record views

85

Files downloads

865