Counting words with Laguerre series

zbMATH Open1300.05021MaRDI QIDQ405183FDOQ405183

Authors Jair Taylor

Publication date 4 September 2014

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

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

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

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)

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.

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

Cites work

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

Cited in

(2)

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

Describes a project that uses

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)