Counting tournament brackets

MaRDI QIDQ5094673zbMATH OpenFDO

Authors John P. D'Angelo

Publication date 4 August 2022

Full work available at URL https://cs.uwaterloo.ca/journals/JIS/VOL25/Dangelo/dan3.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

recurrence relationinteger sequencebracket tournamentcombinatorial polynomial

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Special sequences and polynomials (11B83)

Recommendations

• Publication:4862248
• Computing tournament sequence numbers efficiently with matrix techniques
• Counting tournament score sequences
• Tournament sequences and Meeussen sequences
• Calculating the frequency of tournament score sequences

Cited in

(3)

• scientific article; zbMATH DE number 842027 (Why is no real title available?)
• Counting the number of round-robin tournament schedules
• A Mathematical Connection Between Single-Elimination Sports Tournaments and Evolutionary Trees

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Counting tournament brackets

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