A note on permutations without runs of given length

DOI10.1007/BF01818572zbMath0384.05008MaRDI QIDQ1248515

David M. Jackson, Ronald C. Read

Publication date: 1978

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

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

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items (3)

The combinatorial interpretation of the Jacobi identity from Lie algebras ⋮ Where the monotone pattern (mostly) rules ⋮ From Hertzsprung's problem to pattern-rewriting systems

Cites Work

• Permutations without Rising or Falling $\omega$-Sequences
• Permutations without 3-sequences
• Unnamed Item

This page was built for publication: A note on permutations without runs of given length