3 citations · 7 across the 4 of their papers we have counts for
4 papers
Counting Various Classes of Tournament Score Sequences
Paul K. Stockmeyer
Based on known methods for computing the number of distinct score sequences for -vertex tournaments, we develop algorithms for computing the number of distinct score sequences f…
A Census of Non-Reconstructable Digraphs, II: A Family of Tournaments
Paul K. Stockmeyer
Continuing the program begun in the first paper of this series, we present a pair of non-reconstructable tournament on vertices for each .
An Exploration of Sequence A000975
Paul K. Stockmeyer
Sequence A000975 in the Online Encyclopedia of Integer Sequences (OEIS) starts out 1, 2, 5, 10, 21, 42, 85, ... . As of July 1, 2016, the description in the OEIS lists several char…
The Pascal Rhombus and the Stealth Configuration
Paul K. Stockmeyer
The Pascal rhombus is a variant of Pascal's triangle in which each term is a sum of four earlier terms. Klostermeyer et al. made four conjectures about the Pascal rhombus modulo 2.…