Computing tournament sequence numbers efficiently with matrix techniques

zbMath1021.05004MaRDI QIDQ1865530

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

zbMATH Keywords

tournament matrixnumber of tournament sequencestournament numbers

Mathematics Subject Classification ID

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

Related Items (1)

Increasing integer sequences and Goldbach's conjecture

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