Skip to main content
SpringerLink
Log in

The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract.

A ν-player whist tournament is a schedule of games, where in each round the ν players are partitioned into games of four players each with at most one player left over. In each game two of the players play as partners against the other two. All pairs of players must play in the same game exactly three times during the tournament; of those three times, they are to play as partners exactly once. Whist tournaments for ν players are known to exist for all ν ≡ 0,1 (mod 4). The special cases of directed whist tournaments and triplewhist tournaments are known to exist for all sufficiently large ν, but for small ν several open cases remain. In this paper we introduce a correspondence between near resolvable 2-(ν, k, λ designs and a particular class of codes. The near resolvable 2-(13, 4, 3) designs are classified by classifying the corresponding codes with an orderly algorithm. Finally, the thirteen-player whist tournaments are enumerated starting from the near resolvable 2-(13, 4, 3) designs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • I Anderson (1990) Combinatorial Designs: Construction Methods Ellis Horwood Chichester Occurrence Handle0691.05002

    MATH  Google Scholar 

  • I. Anderson A hundred (1995) ArticleTitleyears of whist tournaments Journal of Combinatorial Mathematics Combinational Computation 19 129–150 Occurrence Handle0855.05013

    MATH  Google Scholar 

  • I Anderson (1996) Whist tournaments CJ Colbourn JH Dinitz (Eds) The CRC Handbook of Combinatorial Designs CRC Press Boca Raton 504–508

    Google Scholar 

  • R. Baker (1975) ArticleTitleWhist tournaments Congressus Numerautium 14 89–100

    Google Scholar 

  • F. E. Bennett X. Zhang (1990) ArticleTitleResolvable Mendelsohn designs with block size 4 Aequationes Mathematical 40 248–260 Occurrence Handle0725.05012 Occurrence Handle1069797

    MATH  MathSciNet  Google Scholar 

  • I. A. Faradžev, Constructive enumeration of combinatorial objects, Colloq Internat CNRS, 260, CNRS, Paris (1978) pp. 131–135.

  • N. J. Finizio (1991) ArticleTitleOrbits of cyclic Wh[υ] of Z N-type Congressus Numerantium 82 15–28 Occurrence Handle1152054

    MathSciNet  Google Scholar 

  • The GAP Group, GAP –- Groups, Algorithms, and Programming, Version 4.3; 2002. (http://www.gap-system.org).

  • G. Ge C. W. H. Lam (2003) ArticleTitleSome new triplewhist tournaments TWh(υ) J. Combinatorial Theory, Series A 101 153–159 Occurrence Handle1061.05018 Occurrence Handle1953286

    MATH  MathSciNet  Google Scholar 

  • G. Ge L. Zhu (2001) ArticleTitleFrame constructions for Z-cyclic triplewhist tournaments Bull. Inst. Combin. appl. 32 53–62 Occurrence Handle0978.05019 Occurrence Handle1829684

    MATH  MathSciNet  Google Scholar 

  • PB Gibbons (1996) Computational methods in design theory CJ Colbourn JH Dinitz (Eds) The CRC Handbook of Combinatorial Designs CRC Press Boca Raton 718–740

    Google Scholar 

  • R. L. Graham H. O. Pollak (1971) ArticleTitleOn the addressing problem for loop switching Bell System Technical Journal 50 2495–2519 Occurrence Handle0228.94020 Occurrence Handle289210

    MATH  MathSciNet  Google Scholar 

  • H. Haanpää PRJ Östergård (2003) ArticleTitleClassification of whist tournaments with up to 12 players Discrete Applied Mathematics 129 399–407 Occurrence Handle1029.05017 Occurrence Handle1998002

    MATH  MathSciNet  Google Scholar 

  • P. Kaski PRJ Östergård (2001) ArticleTitleThere exists no (15,5,4) RBIBD Journal of Combinatorial Designs 9 357–362 Occurrence Handle1020.05011 Occurrence Handle1849618

    MATH  MathSciNet  Google Scholar 

  • Y. Lu L. Zhu (1997) ArticleTitleOn the existence of triplewhist tournaments Twh(υ) Journal of Combinatorial Designs 5 249–256 Occurrence Handle0913.05013 Occurrence Handle1451284

    MATH  MathSciNet  Google Scholar 

  • R. Mathon and A. Rosa, 2-(υ, k, λ) designs of small order, In C. J. Colbourn and J. H. Dinitz, CRC Press, Boca Raton (1996) pp. 3–41.

  • B. D. McKay, autoson – a distributed batch system for UNIX workstation networks (version 1.3), Technical Report TR-CS-96-03, Computer Science Department, Australian National University (1996).

  • B. D. McKay, nauty user’s guide (version 1.5). Technical Report TR-CS-90-02, Computer Science Department, Australian National University (1990).

  • L. B. Morales C. Velarde A complete (2001) ArticleTitleclassification of (12,4,3)-RBIBDs Journal of Combinatorial Designs 9 385–400 Occurrence Handle0994.05027 Occurrence Handle1859639

    MATH  MathSciNet  Google Scholar 

  • PRJ Östergård (2002) ArticleTitleA fast algorithm for the maximum clique problem Discrete Applied Mathematics 120 197–207 Occurrence Handle1019.05054 Occurrence Handle1912867

    MATH  MathSciNet  Google Scholar 

  • R. C. Read (1978) ArticleTitleEvery one a winner; or how to avoid isomorphism search when cataloguing combinatorial configurations Annals of Discrete Mathematics 2 107–120 Occurrence Handle10.1016/S0167-5060(08)70325-X Occurrence Handle0392.05001 Occurrence Handle491273

    Article  MATH  MathSciNet  Google Scholar 

  • N.V. Semakov and V.A. Zinov’ev, Equidistant q-ary codes with maximal distance and resolvable balanced incomplete block designs, Problems of Information Transmission, Vol. 4, No. 2 (1968) pp. 1--7; translated from Problemy Peredachi Informatsii , Vol. 4, No. 2 (1968) pp. 3--10 (Russian).

  • T. Syrjänen and I. Niemelä, The Smodels system, In T. Eiter, W. Faber, M. Truszczyński, (eds.), Logic Programming and Nonmonotonic Reasoning: Proc. 6th International Conference, LPNMR 2001, Lecture Notes in Artificial Intelligence, Springer, Berlin, 2173 (2001) pp. 434–438.

  • PM Winkler (1983) ArticleTitleProof of the squashed cube conjecture Combinatoria 3 135–139 Occurrence Handle0522.05064 Occurrence Handle716430

    MATH  MathSciNet  Google Scholar 

  • X. Zhang (1996) ArticleTitleOn the existence of (υ,4,1)-RPMD Ars Combinatoria 42 3–31 Occurrence Handle0848.05009 Occurrence Handle1386925

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Theoretical Computer Science, Helsinki University of Technology, P.O. Box 5400, FIN-02015, HUT, Finland

    Harri Haanpää & Petteri Kaski

Authors
  1. Harri Haanpää
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Petteri Kaski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Harri Haanpää.

Additional information

Communicated by: J. D. Key

Both authors were supported by Helsinki Graduate School in Computer Science and Engineering (HeCSE). In addition, the first author was supported by a grant from the Nokia Foundation and the second author by a grant from the Foundation of Technology, Helsinki, Finland (Tekniikan Edistämissäätiö).

AMS classification: primary 05B05, secondary 05B30, 05-04, 94B25

Rights and permissions

Reprints and permissions

About this article

Cite this article

Haanpää, H., Kaski, P. The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments. Des Codes Crypt 35, 271–285 (2005). https://doi.org/10.1007/s10623-003-6738-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-003-6738-7

Keywords

Search

Navigation