Asymptotics of the number of \(k\)-words with an \(l\)-descent

zbMath0892.05051MaRDI QIDQ1381671

Amitai Regev

Publication date: 1 April 1998

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

Full work available at URL: https://eudml.org/doc/119509

zbMATH Keywords

wordsYoung tableau\(l\)-descentSchensted-Knuth

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Asymptotic enumeration (05A16)

Related Items (5)

On avoiding 1233 ⋮ The mathematics of Amitai Regev ⋮ Pattern avoidance in ordered set partitions and words ⋮ Finite automata and pattern avoidance in words ⋮ Pattern occurrences in \(k\)-ary words revisited: a few new and old observations

This page was built for publication: Asymptotics of the number of \(k\)-words with an \(l\)-descent