A lattice walk approach to the inv and maj q-counting of multiset permutations

DOI10.1016/0022-247X(80)90121-3zbMath0439.05004MaRDI QIDQ1142214

Doron Zeilberger

Publication date: 1980

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

counting of multiset permutationslattice walk approach

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (5)

Basic calculus of signed permutations. I: Length and number of inversions ⋮ Partial difference equations in \(m_1\geq m_2\geq \dots \geq m_n\geq 0\) and their applications to combinatorics ⋮ On the lattice path method in convolution-type combinatorial identities. II: The weighted counting function method on lattice paths ⋮ Applying the cluster method to count occurrences of generalized permutation patterns ⋮ Multibasic Eulerian Polynomials

Cites Work

• Binomial posets, Möbius inversion, and permutation enumeration
• A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
• Théorie géométrique des polynômes eulériens
• On the “maj” and “inv”q-analogues of Euierian polynomials
• On the Geometry of Numbers in Elementary Number Theory

This page was built for publication: A lattice walk approach to the inv and maj q-counting of multiset permutations