2004•Journal of Combinatorial DesignsRequires access

No 17‐player triplewhist tournament has nontrivial automorphisms

Harri Haanpää

Open publisher page 2 citations

Abstract

Abstract The existence of triplewhist tournaments for v players has recently been solved for all values of v except = 17. For v = 12 and v = 13, a complete enumeration has shown the nonexistence of TWh(v), while constructions of TWh(v) have been presented for v > 17. For several values of v, existence has been shown by constructing a TWh(v) with a prescribed, usually cyclic, automorphism group. In this article, it is shown that the strategy of constructing a TWh(v) with a prescribed automorphism group cannot succeed with TWh(17), since no 17‐player triplewhist tournament has nontrivial automorphisms. © 2004 Wiley Periodicals, Inc.

About this research paper

What this paper is about

Abstract The existence of triplewhist tournaments for v players has recently been solved for all values of v except = 17. For v = 12 and v = 13, a complete enumeration has shown the nonexistence of TWh(v), while constructions of TWh(v) have been presented for v > 17. For several values of v, existence has been shown by constructing a TWh(v) with a prescribed, usually cyclic, automorphism group. In this article, it is shown that the strategy of constructing a TWh(v) with a prescribed automorphism group cannot succeed with TWh(17), since no 17‐player triplewhist tournament has nontrivial automorphisms. © 2004 Wiley Periodicals, Inc.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract The existence of triplewhist tournaments for v players has recently been solved for all values of v except = 17. For v = 12 and v = 13, a complete enumeration has shown the nonexistence of TWh(v), while constructions of TWh(v) have been presented for v > 17. For several values of v, existence has been shown by constructing a TWh(v) with a prescribed, usually cyclic, automorphism group. In this article, it is shown that the strategy of constructing a TWh(v) with a prescribed automorphism group cannot succeed with TWh(17), since no 17‐player triplewhist tournament has nontrivial automorphisms. © 2004 Wiley Periodicals, Inc.

Key concepts: Tournament, Automorphism, Mathematics, Automorphism group, Combinatorics, Group (periodic table), Physics, Quantum mechanics

Related papers

Back to paper searchBrowse research topicsOriginal source
No 17‐player triplewhist tournament has nontrivial automorphisms — Research Paper | ScholarLens