scholarly journals Completing Partial Transversals of Cayley Tables of Abelian Groups

10.37236/9386 ◽  
2021 ◽  
Vol 28 (3) ◽  
Author(s):  
Jaromy Kuhl ◽  
Donald McGinn ◽  
Michael William Schroeder
Keyword(s):  
General Result ◽  
Abelian Groups ◽  
Cayley Table ◽  
Odd Order ◽  
Cayley Tables

In 2003 Grüttmüller proved that if $n\geqslant 3$ is odd, then a partial transversal of the Cayley table of $\mathbb{Z}_n$ with length $2$ is completable to a transversal. Additionally, he conjectured that a partial transversal of the Cayley table of $\mathbb{Z}_n$ with length $k$ is completable to a transversal if and only if $n$ is odd and either $n \in \{k, k + 1\}$ or $n \geqslant 3k - 1$. Cavenagh, Hämäläinen, and Nelson (in 2009) showed the conjecture is true when $k = 3$ and $n$ is prime. In this paper, we prove Grüttmüller’s conjecture for $k = 2$ and $k = 3$ by establishing a more general result for Cayley tables of Abelian groups of odd order.

scholarly journals Impartial achievement games for generating nilpotent groups

2019 ◽  
Vol 22 (3) ◽  
pp. 515-527
Author(s):  
Bret J. Benesh ◽  
Dana C. Ernst ◽  
Nándor Sieben
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Abelian Groups ◽  
Nilpotent Groups ◽  
Generating Set ◽  
Odd Order ◽  
Impartial Game ◽  
A Finite Group

AbstractWe study an impartial game introduced by Anderson and Harary. The game is played by two players who alternately choose previously-unselected elements of a finite group. The first player who builds a generating set from the jointly-selected elements wins. We determine the nim-numbers of this game for finite groups of the form{T\times H}, whereTis a 2-group andHis a group of odd order. This includes all nilpotent and hence abelian groups.

scholarly journals The Chromatic Number of Finite Group Cayley Tables

10.37236/7874 ◽  
2019 ◽  
Vol 26 (1) ◽  
Author(s):  
Luis Goddyn ◽  
Kevin Halasz ◽  
E. S. Mahmoodian
Keyword(s):  
Finite Group ◽  
Abelian Group ◽  
Chromatic Number ◽  
Finite Groups ◽  
Upper Bound ◽  
Latin Square ◽  
Finite Abelian Groups ◽  
Cayley Table ◽  
Minimum Number ◽  
Cayley Tables

The chromatic number of a latin square $L$, denoted $\chi(L)$, is the minimum number of partial transversals needed to cover all of its cells. It has been conjectured that every latin square satisfies $\chi(L) \leq |L|+2$. If true, this would resolve a longstanding conjecture—commonly attributed to Brualdi—that every latin square has a partial transversal of size $|L|-1$. Restricting our attention to Cayley tables of finite groups, we prove two results. First, we resolve the chromatic number question for Cayley tables of finite Abelian groups: the Cayley table of an Abelian group $G$ has chromatic number $|G|$ or $|G|+2$, with the latter case occurring if and only if $G$ has nontrivial cyclic Sylow 2-subgroups. Second, we give an upper bound for the chromatic number of Cayley tables of arbitrary finite groups. For $|G|\geq 3$, this improves the best-known general upper bound from $2|G|$ to $\frac{3}{2}|G|$, while yielding an even stronger result in infinitely many cases.

scholarly journals Antiautomorphisms and Biantiautomorphisms of Some Finite Abelian Groups

Symmetry ◽  
2020 ◽  
Vol 12 (2) ◽  
pp. 294
Author(s):  
Daniel López-Aguayo ◽  
Servando López Aguayo
Keyword(s):  
Lower Bound ◽  
Abelian Groups ◽  
Additive Group ◽  
Exact Formula ◽  
Finite Abelian Groups ◽  
Cyclic Groups ◽  
Partial Classification ◽  
Open Questions ◽  
Odd Order

We extend the concepts of antimorphism and antiautomorphism of the additive group of integers modulo n, given by Gaitanas Konstantinos, to abelian groups. We give a lower bound for the number of antiautomorphisms of cyclic groups of odd order and give an exact formula for the number of linear antiautomorphisms of cyclic groups of odd order. Finally, we give a partial classification of the finite abelian groups which admit antiautomorphisms and state some open questions.

Weak Cayley tables and generalized centralizer rings of finite groups

2012 ◽  
Vol 153 (2) ◽  
pp. 281-318 ◽  
Author(s):  
STEPHEN P. HUMPHRIES ◽  
EMMA L. RODE
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Conjugacy Classes ◽  
Cayley Table ◽  
A Finite Group ◽  
Finite Conjugacy ◽  
Relationship Of ◽  
Cayley Tables ◽  
The Relationship

AbstractFor a finite group G we study certain rings (k)G called k-S-rings, one for each k ≥ 1, where (1)G is the centraliser ring Z(ℂG) of G. These rings have the property that (k+1)G determines (k)G for all k ≥ 1. We study the relationship of (2)G with the weak Cayley table of G. We show that (2)G and the weak Cayley table together determine the sizes of the derived factors of G (noting that a result of Mattarei shows that (1)G = Z(ℂG) does not). We also show that (4)G determines G for any group G with finite conjugacy classes, thus giving an answer to a question of Brauer. We give a criteria for two groups to have the same 2-S-ring and a result guaranteeing that two groups have the same weak Cayley table. Using these results we find a pair of groups of order 512 that have the same weak Cayley table, are a Brauer pair, and have the same 2-S-ring.

scholarly journals Geometrical Representation of Automata over Some Abelian Groups

2014 ◽  
Vol 8 (1) ◽  
Author(s):  
Y.S. Gan ◽  
W.H. Fong ◽  
N.H. Sarmin ◽  
S. Turaev
Keyword(s):  
Abelian Groups ◽  
Finite Automata ◽  
Cayley Table ◽  
Geometrical Representation

One of the classic models of automata is finite automata, which determine whether a string belongs to a particular language or not. The string accepted by automata is said to be recognized by that automata. Another type of automata, so-called Watson-Crick automata, with two reading heads that work on double-stranded tapes using the complimentary relation. Finite automata over groups extend the possibilities of finite automata and allow studying the properties of groups using finite automata. In this paper, we consider finite automata over some Abelian groups ℤn and ℤn × ℤn. The relation of Cayley table to finite automata diagram is introduced in the paper. Some properties of groups ℤn and ℤn × ℤn in terms of automata are also presented in this paper.

scholarly journals The sum of orders of elements in non-Abelian groups of odd order

2021 ◽  
Vol 18 (2) ◽  
pp. 1698-1704
Author(s):  
A. A. Buturlakin ◽  
A. F. Tereshchenko
Keyword(s):  
Abelian Groups ◽  
Odd Order ◽  
Orders Of Elements

scholarly journals EXTENSION OF AUTOMORPHISMS OF SUBGROUPS

2012 ◽  
Vol 54 (2) ◽  
pp. 371-380
Author(s):  
G. G. BASTOS ◽  
E. JESPERS ◽  
S. O. JURIAANS ◽  
A. DE A. E SILVA
Keyword(s):  
Abelian Group ◽  
Finite Groups ◽  
Dihedral Group ◽  
Abelian Groups ◽  
Alternating Group ◽  
Finite Abelian Groups ◽  
Quaternion Group ◽  
Icosahedral Group ◽  
Odd Order ◽  
Even Order

AbstractLet G be a group such that, for any subgroup H of G, every automorphism of H can be extended to an automorphism of G. Such a group G is said to be of injective type. The finite abelian groups of injective type are precisely the quasi-injective groups. We prove that a finite non-abelian group G of injective type has even order. If, furthermore, G is also quasi-injective, then we prove that G = K × B, with B a quasi-injective abelian group of odd order and either K = Q8 (the quaternion group of order 8) or K = Dih(A), a dihedral group on a quasi-injective abelian group A of odd order coprime with the order of B. We give a description of the supersoluble finite groups of injective type whose Sylow 2-subgroup are abelian showing that these groups are, in general, not quasi-injective. In particular, the characterisation of such groups is reduced to that of finite 2-groups that are of injective type. We give several restrictions on the latter. We also show that the alternating group A5 is of injective type but that the binary icosahedral group SL(2, 5) is not.

scholarly journals Adders for the patterned starter in nonabelian groups

1976 ◽  
Vol 21 (2) ◽  
pp. 185-193 ◽  
Author(s):  
Kenneth B. Gross ◽  
Philip A. Leonard
Keyword(s):  
Large Class ◽  
Abelian Groups ◽  
Odd Order ◽  
Room Squares ◽  
Combinatorial Constructions ◽  
Nonabelian Groups

AbstractStarters with adders, in abelian groups of odd order, have been used widely in recent combinatorial constructions, most notably in the study of Room squares. In this paper, constructions of adders for the so-called “patterned starter” are described, for a large class of nonabelian groups of odd order.

Sign in / Sign up

Export Citation Format

Share Document