Enumeration of small nonisomorphic 1-rotational twofold triple systems

In this paper, twofold triple systems of order v are enumerated for all v ≤ 19. The existence of TS(v , 2)'s (all terms are defined in §2) is completely settled; the condition v -0 or 1 (mod 3) is known to be both necessary and sufficient [4]. On the other hand, enumeration efforts hav...

Full description

Saved in:
Bibliographic Details
Main Authors: Royle, Gordon F., Chee, Yeow Meng
Other Authors: School of Physical and Mathematical Sciences
Format: Article
Language:English
Published: 2011
Subjects:
Online Access:https://hdl.handle.net/10356/91832
http://hdl.handle.net/10220/6940
http://www.jstor.org/stable/2153077
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-91832
record_format dspace
spelling sg-ntu-dr.10356-918322023-02-28T19:32:11Z Enumeration of small nonisomorphic 1-rotational twofold triple systems Royle, Gordon F. Chee, Yeow Meng School of Physical and Mathematical Sciences DRNTU::Science::Mathematics::Applied mathematics In this paper, twofold triple systems of order v are enumerated for all v ≤ 19. The existence of TS(v , 2)'s (all terms are defined in §2) is completely settled; the condition v -0 or 1 (mod 3) is known to be both necessary and sufficient [4]. On the other hand, enumeration efforts have not enjoyed such success. In fact, the exact number of painvise nonisomorphic TS(v, 2)'s, denoted N(v) , has been determined only for v 5 10. In particular, we have N(3) = N(4) = 1 (trivial), N(6) = 1 [5], N(7) = 4 [13], N(9) = 36 [12, 81, and N(10) = 960 [l, 31. One reason for the unavailability of such enumeration results for higher values of v is the inherent computational complexity of the problem that leads to a combinatorial explosion effect. To curb this combinatorial explosion, extra conditions are often imposed to enumerate interesting classes of designs. One such condition involves specifying automorphisms that the desired designs must possess. Published version 2011-07-28T02:39:59Z 2019-12-06T18:12:44Z 2011-07-28T02:39:59Z 2019-12-06T18:12:44Z 1992 1992 Journal Article Chee, Y. M., & Royle, G. F. (1992). Enumeration of small nonisomorphic 1-rotational twofold triple systems. Mathematics of Computation, 59, 609-612. 0025-5718 https://hdl.handle.net/10356/91832 http://hdl.handle.net/10220/6940 http://www.jstor.org/stable/2153077 en Mathematics of computation © 1992 American Mathematical Society. This paper was published in Mathematics of Computation and is made available as an electronic reprint (preprint) with permission of American Mathematical Society. The paper can be found at the following official URL: http://www.jstor.org/stable/2153077.  One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper is prohibited and is subject to penalties under law. 5 p. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic DRNTU::Science::Mathematics::Applied mathematics
spellingShingle DRNTU::Science::Mathematics::Applied mathematics
Royle, Gordon F.
Chee, Yeow Meng
Enumeration of small nonisomorphic 1-rotational twofold triple systems
description In this paper, twofold triple systems of order v are enumerated for all v ≤ 19. The existence of TS(v , 2)'s (all terms are defined in §2) is completely settled; the condition v -0 or 1 (mod 3) is known to be both necessary and sufficient [4]. On the other hand, enumeration efforts have not enjoyed such success. In fact, the exact number of painvise nonisomorphic TS(v, 2)'s, denoted N(v) , has been determined only for v 5 10. In particular, we have N(3) = N(4) = 1 (trivial), N(6) = 1 [5], N(7) = 4 [13], N(9) = 36 [12, 81, and N(10) = 960 [l, 31. One reason for the unavailability of such enumeration results for higher values of v is the inherent computational complexity of the problem that leads to a combinatorial explosion effect. To curb this combinatorial explosion, extra conditions are often imposed to enumerate interesting classes of designs. One such condition involves specifying automorphisms that the desired designs must possess.
author2 School of Physical and Mathematical Sciences
author_facet School of Physical and Mathematical Sciences
Royle, Gordon F.
Chee, Yeow Meng
format Article
author Royle, Gordon F.
Chee, Yeow Meng
author_sort Royle, Gordon F.
title Enumeration of small nonisomorphic 1-rotational twofold triple systems
title_short Enumeration of small nonisomorphic 1-rotational twofold triple systems
title_full Enumeration of small nonisomorphic 1-rotational twofold triple systems
title_fullStr Enumeration of small nonisomorphic 1-rotational twofold triple systems
title_full_unstemmed Enumeration of small nonisomorphic 1-rotational twofold triple systems
title_sort enumeration of small nonisomorphic 1-rotational twofold triple systems
publishDate 2011
url https://hdl.handle.net/10356/91832
http://hdl.handle.net/10220/6940
http://www.jstor.org/stable/2153077
_version_ 1759857016500649984