Words over a finite alphabet avoiding 1243

DOI10.2989/16073606.2024.2334869MaRDI QIDQ6618737

Toufik Mansour

Publication date: 15 October 2024

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The (ordinary) generating functions enumerating \(123\)-avoiding words with \(r\) occurrences of each of \(1, 2, \dots, n\) are always algebraic
• Symmetric functions and P-recursiveness
• Wilf-equivalence on \(k\)-ary words, compositions, and parking functions
• Forbidden subsequences
• Asymptotics of the number of \(k\)-words with an \(l\)-descent
• Finite automata and pattern avoidance in words
• The patterns of permutations
• Words restricted by patterns with at most 2 distinct letters
• On the number of permutations avoiding a given pattern
• Kernel method and linear recurrence system
• Restricted 132-avoiding \(k\)-ary words, Chebyshev polynomials, and continued fractions
• On avoiding 1233
• Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations
• Permutations of a multiset avoiding permutations of length 3

This page was built for publication: Words over a finite alphabet avoiding 1243

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