Counting subwords in flattened involutions and Kummer functions
From MaRDI portal
Publication:2964219
DOI10.1080/10236198.2016.1199689zbMath1356.05015OpenAlexW2464872408MaRDI QIDQ2964219
Publication date: 23 February 2017
Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10236198.2016.1199689
Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Permutations, words, matrices (05A05) Recurrences (11B37) Confluent hypergeometric functions, Whittaker functions, ({}_1F_1) (33C15)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Patterns in permutations and words.
- Permutation statistics on involutions
- Counting permutations by the number of successions within cycles
- Pattern avoidance in ``flattened partitions
- Differentiably finite power series
- Some statistics on restricted 132 involutions
- Kernel method and linear recurrence system
- Combinatorics of Set Partitions
- Combinatorics of Compositions and Words