Computing tournament sequence numbers efficiently with matrix techniques

MaRDI QIDQ1865530zbMATH OpenFDO

Authors Erich Neuwirth

Publication date 7 July 2003

Published in Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

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

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

tournament matrixnumber of tournament sequencestournament numbers

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16) Special sequences and polynomials (11B83) Matrix equations and identities (15A24)

Recommendations

• scientific article; zbMATH DE number 7732125
• On tournament matrices
• A tournament approach to pattern avoiding matrices
• scientific article; zbMATH DE number 1941832
• Tournament Coding of Integer Sequences
• An algorithm to generate tournament score sequences
• Counting tournament score sequences
• scientific article; zbMATH DE number 7363604
• scientific article; zbMATH DE number 3966322
• Score sequences: Lexicographic enumeration and tournament construction

Cited in

(3)

• Increasing integer sequences and Goldbach's conjecture
• Tournament Coding of Integer Sequences
• Counting tournament brackets

This page was built for publication: Computing tournament sequence numbers efficiently with matrix techniques

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