The tennis ball problem (Q696915): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1006/jcta.2002.3273 / rank
Normal rank
 
Property / author
 
Property / author: Donatella Merlini / rank
Normal rank
 
Property / author
 
Property / author: Renzo Sprugnoli / rank
Normal rank
 
Property / author
 
Property / author: Maria Cecilia Verri / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Q688674 / rank
Normal rank
 
Property / author
 
Property / author: Donatella Merlini / rank
 
Normal rank
Property / author
 
Property / author: Renzo Sprugnoli / rank
 
Normal rank
Property / author
 
Property / author: Maria Cecilia Verri / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Timothy R. S. Walsh / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046705906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of Baxter permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating trees and proper Riordan arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: On context-free languages and push-down automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Riordan arrays and combinatorial sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4935981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating trees and the Catalan and Schröder numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating trees and forbidden subsequences / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/JCTA.2002.3273 / rank
 
Normal rank

Latest revision as of 01:02, 10 December 2024

scientific article
Language Label Description Also known as
English
The tennis ball problem
scientific article

    Statements

    The tennis ball problem (English)
    0 references
    12 September 2002
    0 references
    In how many ways can \(n\) numbers be chosen from the set \(\{1,2,\dots, ns\}\) so that the \(k\)th number chosen does not exceed \(ks\)? And what is the total sum, over all these choices, of the numbers chosen? These problems were solved for \(s=2\) in [\textit{C. L. Mallows} and \textit{L. Shapiro}, Balls on the lawn, J. Integer Seq. 2 (1999; Zbl 0923.05004)], where the numbers are labels on tennis balls to be thrown out the window onto the lawn. The article under review solves these two problems for general \(s\), employing ``the notion of generating trees to obtain a solution in terms of generating functions'' (quoted from the abstract). The number of choices is shown to be equal to the number of \(s\)-ary trees with \(n+1\) nodes and the total sum is given as a formula in terms of this number and the sum of \(n+2\) other numbers. Asymptotic results are given and a related problem is solved for a special case.
    0 references
    on-line combinations
    0 references
    generating trees
    0 references
    generating functions
    0 references
    \(s\)-ary trees
    0 references
    0 references
    0 references
    0 references

    Identifiers