Computing tournament sequence numbers efficiently with matrix techniques

zbMATH Open1021.05004MaRDI QIDQ1865530FDOQ1865530

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

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)

Cited In (2)

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

   Recommendations

• Title not available (Why is that?) 👍 👎
• On tournament matrices 👍 👎
• A tournament approach to pattern avoiding matrices 👍 👎
• Title not available (Why is that?) 👍 👎
• Tournament Coding of Integer Sequences 👍 👎
• An algorithm to generate tournament score sequences 👍 👎
• Counting tournament score sequences 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Score sequences: Lexicographic enumeration and tournament construction 👍 👎

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)