2013
DOI: 10.37236/30
|View full text |Cite
|
Sign up to set email alerts
|

Sequenceable Groups and Related Topics

Abstract: In 1980, about 20 years after sequenceable groups were introduced by Gordon to construct row-complete latin squares, Keedwell published a survey of all the available results concerning sequencings. This was updated (jointly with Dénes) in 1991 and a short overview, including results about complete mappings and R-sequencings, was given in the CRC Handbook of Combinatorial Designs in 1995. In Sections 1 and 2 we give a survey of the current situation concerning sequencings, including details of the most importan… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

1
20
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 26 publications
(21 citation statements)
references
References 76 publications
1
20
0
Order By: Relevance
“…Clearly, when k = |G| − 3, |G| − 2, |G| − 1, G is assumed to be finite. Alspach's conjecture is worth to be studied also in connection with sequenceability and strong sequenceability of groups, see [2,3,18], and simplicity of Heffter arrays, see [4,5,12,14].…”
Section: Introductionmentioning
confidence: 99%
“…Clearly, when k = |G| − 3, |G| − 2, |G| − 1, G is assumed to be finite. Alspach's conjecture is worth to be studied also in connection with sequenceability and strong sequenceability of groups, see [2,3,18], and simplicity of Heffter arrays, see [4,5,12,14].…”
Section: Introductionmentioning
confidence: 99%
“…As far as we know, Conjecture 7 has not been attacked directly. However, many partial results are known due to its connection to sequenceable groups (see eg, [20]).…”
Section: Discussionmentioning
confidence: 99%
“…In addition to those already mentioned, groups known to satisfy Keedwell's Conjecture include dihedral groups [15,18], soluble groups with a single involution [3], and groups of order at most 255 [22]. See [20] for a survey of this and related problems.…”
Section: Introductionmentioning
confidence: 99%