scholarly journals The Spectrum of Group-Based Complete Latin Squares

10.37236/8542 ◽  
2019 ◽  
Vol 26 (3) ◽  
Author(s):  
M. A. Ollis ◽  
Christopher R. Tripp
Keyword(s):  
Abelian Group ◽  
Direct Product ◽  
Cyclic Group ◽  
Prime Order ◽  
Latin Square ◽  
Latin Squares ◽  
Spectrum Of Group ◽  
Odd Order

We construct sequencings for many groups that are a semi-direct product of an odd-order abelian group and a cyclic group of odd prime order.  It follows from these constructions that there is a group-based complete Latin square of order $n$ if and only if $n \in \{ 1,2,4\}$ or there is a non-abelian group of order $n$.

scholarly journals Atomic Latin Squares based on Cyclotomic Orthomorphisms

10.37236/1919 ◽  
2005 ◽  
Vol 12 (1) ◽  
Author(s):  
Ian M. Wanless
Keyword(s):  
Finite Fields ◽  
Complete Graph ◽  
Prime Order ◽  
Automorphism Groups ◽  
Latin Square ◽  
Latin Squares ◽  
Established Method ◽  
Cyclic Groups ◽  
Complete Bipartite Graphs ◽  
First Time

Atomic latin squares have indivisible structure which mimics that of the cyclic groups of prime order. They are related to perfect $1$-factorisations of complete bipartite graphs. Only one example of an atomic latin square of a composite order (namely 27) was previously known. We show that this one example can be generated by an established method of constructing latin squares using cyclotomic orthomorphisms in finite fields. The same method is used in this paper to construct atomic latin squares of composite orders 25, 49, 121, 125, 289, 361, 625, 841, 1369, 1849, 2809, 4489, 24649 and 39601. It is also used to construct many new atomic latin squares of prime order and perfect $1$-factorisations of the complete graph $K_{q+1}$ for many prime powers $q$. As a result, existence of such a factorisation is shown for the first time for $q$ in $\big\{$529, 2809, 4489, 6889, 11449, 11881, 15625, 22201, 24389, 24649, 26569, 29929, 32041, 38809, 44521, 50653, 51529, 52441, 63001, 72361, 76729, 78125, 79507, 103823, 148877, 161051, 205379, 226981, 300763, 357911, 371293, 493039, 571787$\big\}$. We show that latin squares built by the 'orthomorphism method' have large automorphism groups and we discuss conditions under which different orthomorphisms produce isomorphic latin squares. We also introduce an invariant called the train of a latin square, which proves to be useful for distinguishing non-isomorphic examples.

scholarly journals Finite Groups Which Admit An Automorphism With Few Orbits

1960 ◽  
Vol 12 ◽  
pp. 73-100 ◽  
Author(s):  
Daniel Gorenstein
Keyword(s):  
Abelian Group ◽  
Direct Product ◽  
Finite Groups ◽  
Study Groups ◽  
Quaternion Group ◽  
Fixed Integer ◽  
Fixed Element ◽  
Odd Order ◽  
Special Case

In the course of investigating the structure of finite groups which have a representation in the form ABA, for suitable subgroups A and B, we have been forced to study groups G which admit an automorphism ϕ such that every element of G lies in at least one of the orbits under ϕ of the elements g, gϕr(g), gϕrϕ(g)ϕ2r(g), gϕr(g)ϕr2r(g)ϕ3r(g), etc., where g is a fixed element of G and r is a fixed integer.In a previous paper on ABA-groups written jointly with I. N. Herstein (4), we have treated the special case r = 0 (in which case every element of G can be expressed in the form ϕi(gj)), and have shown that if the orders of ϕ and g are relatively prime, then G is either Abelian or the direct product of an Abelian group of odd order and the quaternion group of order 8.

MAXIMUM GENUS EMBEDDINGS OF LATIN SQUARES

2017 ◽  
Vol 60 (2) ◽  
pp. 495-504 ◽  
Author(s):  
TERRY S. GRIGGS ◽  
CONSTANTINOS PSOMAS ◽  
JOZEF ŠIRÁŇ
Keyword(s):  
Latin Square ◽  
Latin Squares ◽  
Orientable Surface ◽  
Maximum Genus ◽  
Odd Order

AbstractIt is proved that every non-trivial Latin square has an upper embedding in a non-orientable surface and every Latin square of odd order has an upper embedding in an orientable surface. In the latter case, detailed results about the possible automorphisms and their actions are also obtained.

scholarly journals Finite nilpotent groups that coincide with their 2-closures in all of their faithful permutation representations

2018 ◽  
Vol 17 (04) ◽  
pp. 1850065
Author(s):  
Alireza Abdollahi ◽  
Majid Arezoomand
Keyword(s):  
Nilpotent Group ◽  
Direct Product ◽  
Cyclic Group ◽  
Nilpotent Groups ◽  
Quaternion Group ◽  
Finite Nilpotent Group ◽  
Closed Group ◽  
Odd Order ◽  
Generalized Quaternion Group ◽  
Generalized Quaternion

Let [Formula: see text] be any group and [Formula: see text] be a subgroup of [Formula: see text] for some set [Formula: see text]. The [Formula: see text]-closure of [Formula: see text] on [Formula: see text], denoted by [Formula: see text], is by definition, [Formula: see text] The group [Formula: see text] is called [Formula: see text]-closed on [Formula: see text] if [Formula: see text]. We say that a group [Formula: see text] is a totally[Formula: see text]-closed group if [Formula: see text] for any set [Formula: see text] such that [Formula: see text]. Here we show that the center of any finite totally 2-closed group is cyclic and a finite nilpotent group is totally 2-closed if and only if it is cyclic or a direct product of a generalized quaternion group with a cyclic group of odd order.

On (k, l)-sets in cyclic groups of odd prime order

2001 ◽  
Vol 63 (1) ◽  
pp. 115-121 ◽  
Author(s):  
T. Bier ◽  
A. Y. M. Chin
Keyword(s):  
Abelian Group ◽  
Cyclic Group ◽  
Arithmetic Progression ◽  
Prime Order ◽  
Finite Abelian Group ◽  
Maximum Cardinality ◽  
Cyclic Groups ◽  
Positive Integers

Let A be a finite Abelian group written additively. For two positive integers k, l with k ≠ l, we say that a subset S ⊂ A is of type (k, l) or is a (k, l) -set if the equation x1 + x2 + … + xk − xk+1−… − xk+1 = 0 has no solution in the set S. In this paper we determine the largest possible cardinality of a (k, l)-set of the cyclic group ℤP where p is an odd prime. We also determine the number of (k, l)-sets of ℤp which are in arithmetic progression and have maximum cardinality.

Avoiding Arrays of Odd Order by Latin Squares

2012 ◽  
Vol 22 (2) ◽  
pp. 184-212 ◽  
Author(s):  
LINA J. ANDRÉN ◽  
CARL JOHAN CASSELGREN ◽  
LARS-DANIEL ÖHMAN
Keyword(s):  
Positive Integer ◽  
Latin Square ◽  
Latin Squares ◽  
Odd Order ◽  
Open Case

We prove that there is a constantcsuch that, for each positive integerk, every (2k+ 1) × (2k+ 1) arrayAon the symbols (1,. . .,2k+1) with at mostc(2k+1) symbols in every cell, and each symbol repeated at mostc(2k+1) times in every row and column isavoidable; that is, there is a (2k+1) × (2k+1) Latin squareSon the symbols 1,. . .,2k+1 such that, for eachi,j∈ {1,. . .,2k+1}, the symbol in position (i,j) ofSdoes not appear in the corresponding cell inA. This settles the last open case of a conjecture by Häggkvist. Using this result, we also show that there is a constant ρ, such that, for any positive integern, if each cell in ann×narrayBis assigned a set ofm≤ ρnsymbols, where each set is chosen independently and uniformly at random from {1,. . .,n}, then the probability thatBis avoidable tends to 1 asn→ ∞.

scholarly journals Parity Types, Cycle Structures and Autotopisms of Latin Squares

10.37236/2538 ◽  
2012 ◽  
Vol 19 (3) ◽  
Author(s):  
Daniel Kotlar
Keyword(s):  
Latin Square ◽  
Latin Squares ◽  
Upper Bounds ◽  
Cycle Decomposition ◽  
Odd Order ◽  
Cycle Structures

The parity type of a Latin square is defined in terms of the numbers of even and odd rows and columns. It is related to an Alon-Tarsi-like conjecture that applies to Latin squares of odd order. Parity types are used to derive upper bounds for the size of autotopy groups. A new algorithm for finding the autotopy group of a Latin square, based on the cycle decomposition of its rows, is presented, and upper bounds for the size of autotopy groups are derived from it.

scholarly journals The number of solutions to an equation arising from a problem on latin squares

1983 ◽  
Vol 34 (1) ◽  
pp. 138-142 ◽  
Author(s):  
I. P. Goulden ◽  
S. A. Vanstone
Keyword(s):  
Abelian Group ◽  
Recent Article ◽  
Latin Square ◽  
Latin Squares ◽  
Number Of Solutions ◽  
Graph Theoretic ◽  
Partial Latin Square

AbstractA recent article of G. Chang shows that an n × n partial latin square with prescribed diagonal can always be embedded in an n × n latin square except in one obvious case where it cannot be done. Chang's proof is to show that the symbols of the partial latin square can be assigned the elements of the additive abelian group Zn so that the diagonal elements of the square sum to zero. A theorem of M. Halls then shows this to be embeddable in the operation table of the group. In this paper, we show that when n is a prime one can determine exactly the number of distinct ways in which this assignment can be made. The proof uses some graph theoretic techniques.

Blocks of defect zero in finite groups with conjugate subgroups of a given prime order

2017 ◽  
Vol 16 (11) ◽  
pp. 1750217
Author(s):  
Tianze Li ◽  
Yanjun Liu ◽  
Guohua Qian
Keyword(s):  
Finite Group ◽  
Simple Group ◽  
Direct Product ◽  
Finite Groups ◽  
Prime Order ◽  
Text Block ◽  
Order Group ◽  
Odd Order ◽  
A Finite Group

Let [Formula: see text] be a finite group and [Formula: see text] be a prime. In this note, we show that if [Formula: see text] and all subgroups of [Formula: see text] of order [Formula: see text] are conjugate, then either [Formula: see text] has a [Formula: see text]-block of defect zero, or [Formula: see text] and [Formula: see text] is a direct product of a simple group [Formula: see text] and an odd order group. This improves one of our previous works.

On Restricted Sums

2000 ◽  
Vol 9 (6) ◽  
pp. 513-518 ◽  
Author(s):  
Y. O. HAMIDOUNE ◽  
A. S. LLADÓ ◽  
O. SERRA
Keyword(s):  
Abelian Group ◽  
Prime Order ◽  
Abelian Groups ◽  
Generating Set ◽  
Cyclic Groups ◽  
Odd Order

Let G be an abelian group. For a subset A ⊂ G, denote by 2 ∧ A the set of sums of two different elements of A. A conjecture by Erdős and Heilbronn, first proved by Dias da Silva and Hamidoune, states that, when G has prime order, [mid ]2 ∧ A[mid ] [ges ] min([mid ]G[mid ], 2[mid ]A[mid ] − 3).We prove that, for abelian groups of odd order (respectively, cyclic groups), the inequality [mid ]2 ∧ A[mid ] [ges ] min([mid ]G[mid ], 3[mid ]A[mid ]/2) holds when A is a generating set of G, 0 ∈ A and [mid ]A[mid ] [ges ] 21 (respectively, [mid ]A[mid ] [ges ] 33). The structure of the sets for which equality holds is also determined.

Sign in / Sign up

Export Citation Format

Share Document