The tennis ball problem

DOI10.1006/jcta.2002.3273zbMath1006.05007OpenAlexW2046705906MaRDI QIDQ696915

Renzo Sprugnoli, Donatella Merlini, Maria Cecilia Verri

Publication date: 12 September 2002

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2d484c68c4d7a59a960e80106fb72da406f5fc74

zbMATH Keywords

generating functionsgenerating trees\(s\)-ary treeson-line combinations

Mathematics Subject Classification ID

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

Related Items

Bijections and the Riordan group ⋮ 312-Avoiding reduced valid hook configurations and duck words ⋮ The research and progress of the enumeration of lattice paths ⋮ Lattice path matroids: Enumerative aspects and Tutte polynomials ⋮ Identities induced by Riordan arrays ⋮ Unnamed Item ⋮ Finitely labeled generating trees and restricted permutations ⋮ Root geometry of polynomial sequences. I: Type \((0, 1)\) ⋮ Proper generating trees and their internal path length ⋮ Proof of a lattice paths conjecture connected to the tennis ball problem ⋮ Lattice and Schröder paths with periodic boundaries ⋮ Set-Valued Tableaux & Generalized Catalan Numbers ⋮ A solution to the tennis ball problem

Cites Work

• The number of Baxter permutations
• Riordan arrays and combinatorial sums
• Generating trees and the Catalan and Schröder numbers
• Generating trees and forbidden subsequences
• Generating trees and proper Riordan arrays
• On context-free languages and push-down automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The tennis ball problem