Abelian Groups with a Minimal Generating Set

2010 ◽  
Vol 33 (2) ◽  
pp. 147-159 ◽  
Author(s):  
Pavel Růžčka
Keyword(s):  
Abelian Groups ◽  
Generating Set ◽  
Minimal Generating Set

Characterization of Abelian groups with a minimal generating set

2015 ◽  
Vol 38 (1) ◽  
pp. 103-120 ◽  
Author(s):  
Michal Hrbek ◽  
Pavel Růžička
Keyword(s):  
Abelian Groups ◽  
Generating Set ◽  
Minimal Generating Set

scholarly journals The Fundamental Group of Balanced Simplicial Complexes and Posets

10.37236/73 ◽  
2009 ◽  
Vol 16 (2) ◽  
Author(s):  
Steven Klee
Keyword(s):  
Fundamental Group ◽  
Upper Bound ◽  
Large Family ◽  
Simplicial Complexes ◽  
Generating Set ◽  
Minimal Generating Set

We establish an upper bound on the cardinality of a minimal generating set for the fundamental group of a large family of connected, balanced simplicial complexes and, more generally, simplicial posets.

The Fuzziness of a Minimal Generating Set of Fedorov Groups

2021 ◽  
Vol 66 (6) ◽  
pp. 913-919
Author(s):  
A. M. Banaru ◽  
V. R. Shiroky ◽  
D. A. Banaru
Keyword(s):  
Generating Set ◽  
Minimal Generating Set

The Number of Generators of a Linear p-Group

1972 ◽  
Vol 24 (5) ◽  
pp. 851-858 ◽  
Author(s):  
I. M. Isaacs
Keyword(s):  
Generating Set ◽  
Nilpotence Class ◽  
Number Of Generators ◽  
Minimal Generating Set

Let G be a finite p-group, having a faithful character χ of degree f. The object of this paper is to bound the number, d(G), of generators in a minimal generating set for G in terms of χ and in particular in terms of f. This problem was raised by D. M. Goldschmidt, and solved by him in the case that G has nilpotence class 2.

scholarly journals Triple-crossing projections, moves on knots and links and their minimal diagrams

2020 ◽  
Vol 29 (04) ◽  
pp. 2050015 ◽  
Author(s):  
Michał Jabłonowski ◽  
Łukasz Trojanowski
Keyword(s):  
Triple Point ◽  
Crossing Number ◽  
Systematic Method ◽  
Generating Set ◽  
New Type ◽  
Knots And Links ◽  
Minimal Generating Set

In this paper, we present a systematic method to generate prime knot and prime link minimal triple-point projections, and then classify all classical prime knots and prime links with triple-crossing number at most four. We also extend the table of known knots and links with triple-crossing number equal to five. By introducing a new type of diagrammatic move, we reduce the number of generating moves on triple-crossing diagrams, and derive a minimal generating set of moves connecting triple-crossing diagrams of the same knot.

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.

Generalization of the basis property on finite groups

2020 ◽  
pp. 2150111
Author(s):  
Ibrahim Al-Dayel ◽  
Ahmad Al Khalaf
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Frobenius Group ◽  
Sufficient Conditions ◽  
Basis Property ◽  
Generating Set ◽  
Equivalent Basis ◽  
Necessary And Sufficient ◽  
Special Case ◽  
Minimal Generating Set

A group [Formula: see text] has the Basis Property if every subgroup [Formula: see text] of [Formula: see text] has an equivalent basis (minimal generating set). We studied a special case of the finite group with the Basis Property, when [Formula: see text]-group [Formula: see text] is an abelian group. We found the necessary and sufficient conditions on an abelian [Formula: see text]-group [Formula: see text] of [Formula: see text] with the Basis Property to be kernel of Frobenius group.

Minimal presentations for groups of order 2n, n ≤ 6

1973 ◽  
Vol 15 (4) ◽  
pp. 461-469 ◽  
Author(s):  
T. W. Saga ◽  
J. W. Wamsley
Keyword(s):  
Generating Set ◽  
Image Position ◽  
Minimal Presentations ◽  
Minimal Generating Set

Let G be a finite 2-group having a minimal generating set {x1, …, xr} so that r = d (G) is an invariant of G. Suppose further that G has a presentation then.

scholarly journals A GENERATING SET FOR THE AUTOMORPHISM GROUP OF A GRAPH PRODUCT OF ABELIAN GROUPS

2012 ◽  
Vol 22 (01) ◽  
pp. 1250003 ◽  
Author(s):  
L. J. CORREDOR ◽  
M. A. GUTIERREZ
Keyword(s):  
Automorphism Group ◽  
London Math ◽  
Abelian Groups ◽  
Graph Products ◽  
Graph Product ◽  
Finitely Generated ◽  
Generating Set ◽  
Labeled Graph

We find a set of generators for the automorphism group Aut G of a graph product G of finitely generated abelian groups entirely from a certain labeled graph. In addition, we find generators for the important subgroup Aut ⋆ G defined in [Automorphisms of graph products of abelian groups, to appear in Groups, Geometry and Dynamics]. We follow closely the plan of M. Laurence's paper [A generating set for the automorphism group of a graph group, J. London Math. Soc. (2)52(2) (1995) 318–334].

Sign in / Sign up

Export Citation Format

Share Document