Séminaire Lotharingien de Combinatoire, B47h (2002), 12 pp.

Erich Neuwirth

Computing Tournament Sequence Numbers Efficiently With Matrix Techniques

Abstract. We give a new, "almost explicit" formula for tournament numbers, representing them as upper left elements of the n-th power of a matrix with an explicit formula for elements of the original matrix. Using this representation, we show how to compute tournament numbers in time complexity O(n⁶).

Received: November 28, 2001; Revised: April 15, 2002; Accepted: July 6, 2002.

The following versions are available:

PDF (178 K)
PostScript (216 K)
DVI version
Tex version