Counting words with Laguerre series

zbMATH Open1300.05021arXiv1306.6232MaRDI QIDQ405183FDOQ405183

Authors: Jair Taylor 

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: We develop a method for counting words subject to various restrictions by finding a combinatorial interpretation for a product of weighted sums of Laguerre polynomials with parameter alpha = -1. We describe how such a series can be computed by finding an appropriate ordinary generating function and applying a certain transformation. We use this technique to find the generating function for the number of k-ary words avoiding any vincular pattern that has only ones, as well as words cyclically avoiding vincular patterns with only ones whose runs of ones between dashes are all of equal length.

Full work available at URL: https://arxiv.org/abs/1306.6232

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Counting words with Laguerre polynomials
• Restricted 132-avoiding \(k\)-ary words, Chebyshev polynomials, and continued fractions
• Counting occurrences for a finite set of words
• Restricted \(k\)-ary words and functional equations
• Counting occurrences for a finite set of words: an inclusion-exclusion approach

zbMATH Keywords

combinatorics on wordsorthogonal polynomialLaguerre polynomialvincular pattern

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05)

Cites Work

• The Goulden-Jackson cluster method for cyclic words
• Title not available (Why is that?)
• Title not available (Why is that?)
• Representation of an analytic function by a Laguerre series
• On the analyticity of Laguerre series
• Enumeration of pairs of sequences by rises, falls and levels
• Title not available (Why is that?)
• Generalized permutation patterns and a classification of the Mahonian statistics
• Combinatorics of Compositions and Words
• On Carlitz compositions
• Title not available (Why is that?)
• The representation of an analytic function by general Laguerre series
• The Goulden—Jackson cluster method: extensions, applications and implementations
• Title not available (Why is that?)
• Words restricted by 3-letter generalized multipermutation patterns
• Restricted 132-avoiding \(k\)-ary words, Chebyshev polynomials, and continued fractions
• Title not available (Why is that?)
• Enumeration of some classes of words avoiding two generalized patterns of length three
• Laguerre Polynomials, Weighted Derangements, and Positivity
• An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences
• Weighted Derangements and the Linearization Coefficients of Orthogonal Sheffer Polynomials
• Derangements and Laguerre polynomials
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Two variable extensions of the Laguerre and disc polynomials
• Counting words with Laguerre polynomials

Uses Software

• CGJ
• NAIVE
• DAVID_IAN
• JODO
• BLANKS
• SYMGJ
• SPGJ
• GJseries
• GJSAW
• GJsqfree

This page was built for publication: Counting words with Laguerre series

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