scholarly journals ALTERNATING AND SYMMETRIC GROUPS WITH EULERIAN GENERATING GRAPH

2017 ◽  
Vol 5 ◽  
Author(s):  
ANDREA LUCCHINI ◽  
CLAUDE MARION
Keyword(s):  
Finite Group ◽  
Symmetric Group ◽  
Prime Number ◽  
Symmetric Groups ◽  
Alternating Group ◽  
Generating Graph ◽  
Alternating And Symmetric Groups ◽  
A Finite Group

Given a finite group $G$, the generating graph $\unicode[STIX]{x1D6E4}(G)$ of $G$ has as vertices the (nontrivial) elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. In this paper we investigate properties about the degrees of the vertices of $\unicode[STIX]{x1D6E4}(G)$ when $G$ is an alternating group or a symmetric group of degree $n$. In particular, we determine the vertices of $\unicode[STIX]{x1D6E4}(G)$ having even degree and show that $\unicode[STIX]{x1D6E4}(G)$ is Eulerian if and only if $n\geqslant 3$ and $n$ and $n-1$ are not equal to a prime number congruent to 3 modulo 4.

scholarly journals On alternating and symmetric groups which are quasi OD-characterizable

2017 ◽  
Vol 16 (04) ◽  
pp. 1750065 ◽  
Author(s):  
Ali Reza Moghaddamfar
Keyword(s):  
Finite Group ◽  
Symmetric Group ◽  
Prime Graph ◽  
Symmetric Groups ◽  
Degree Pattern ◽  
Alternating And Symmetric Groups ◽  
A Finite Group

Let [Formula: see text] be the prime graph associated with a finite group [Formula: see text] and [Formula: see text] be the degree pattern of [Formula: see text]. A finite group [Formula: see text] is said to be [Formula: see text]-fold [Formula: see text]-characterizable if there exist exactly [Formula: see text] nonisomorphic groups [Formula: see text] such that [Formula: see text] and [Formula: see text]. The purpose of this paper is two-fold. First, it shows that the symmetric group [Formula: see text] is [Formula: see text]-fold [Formula: see text]-charaterizable. Second, it shows that there exist many infinite families of alternating and symmetric groups, [Formula: see text] and [Formula: see text], which are [Formula: see text]-fold [Formula: see text]-characterizable with [Formula: see text].

scholarly journals The invariably generating graph of the alternating and symmetric groups

2020 ◽  
Vol 23 (6) ◽  
pp. 1081-1102
Author(s):  
Daniele Garzoni
Keyword(s):  
Finite Group ◽  
Undirected Graph ◽  
Symmetric Groups ◽  
Conjugacy Classes ◽  
Generating Graph ◽  
Alternating And Symmetric Groups ◽  
A Finite Group

AbstractGiven a finite group G, the invariably generating graph of G is defined as the undirected graph in which the vertices are the nontrivial conjugacy classes of G, and two classes are adjacent if and only if they invariably generate G. In this paper, we study this object for alternating and symmetric groups. The main result of the paper states that if we remove the isolated vertices from the graph, the resulting graph is connected and has diameter at most 6.

The normalizer property for integral group rings of holomorphs of finite nilpotent groups and the symmetric groups

2017 ◽  
Vol 16 (02) ◽  
pp. 1750025 ◽  
Author(s):  
Jinke Hai ◽  
Shengbo Ge ◽  
Weiping He
Keyword(s):  
Finite Group ◽  
Symmetric Group ◽  
Nilpotent Group ◽  
Symmetric Groups ◽  
Nilpotent Groups ◽  
Group Rings ◽  
Integral Group ◽  
Integral Group Rings ◽  
A Finite Group ◽  
The Normalizer Property

Let [Formula: see text] be a finite group and let [Formula: see text] be the holomorph of [Formula: see text]. If [Formula: see text] is a finite nilpotent group or a symmetric group [Formula: see text] of degree [Formula: see text], then the normalizer property holds for [Formula: see text].

A Geometrical Study of the Alternating and Symmetric Groups

1929 ◽  
Vol 25 (2) ◽  
pp. 168-174 ◽  
Author(s):  
G. de B. Robinson
Keyword(s):  
Finite Group ◽  
Hermitian Form ◽  
Symmetric Groups ◽  
Irreducible Group ◽  
Image Position ◽  
Alternating And Symmetric Groups ◽  
A Finite Group

Let a finite group Τ be represented as an irreducible group of order N of linear substitutions on n variables,The variables may be chosen so that the substitutions of the group leave invariant the Hermitian form

Integral Cayley Graphs over Finite Groups

2020 ◽  
Vol 27 (01) ◽  
pp. 131-136
Author(s):  
Elena V. Konstantinova ◽  
Daria Lytkina
Keyword(s):  
Finite Group ◽  
Symmetric Group ◽  
Cayley Graph ◽  
Cyclic Group ◽  
Finite Groups ◽  
Cayley Graphs ◽  
Alternating Group ◽  
Generating Set ◽  
A Finite Group

We prove that the spectrum of a Cayley graph over a finite group with a normal generating set S containing with every its element s all generators of the cyclic group 〈s〉 is integral. In particular, a Cayley graph of a 2-group generated by a normal set of involutions is integral. We prove that a Cayley graph over the symmetric group of degree n no less than 2 generated by all transpositions is integral. We find the spectrum of a Cayley graph over the alternating group of degree n no less than 4 with a generating set of 3-cycles of the form (k i j) with fixed k, as {−n+1, 1−n+1, 22 −n+1, …, (n−1)2 −n+1}.

scholarly journals Gelfand Pairs Involving the Wreath Product of Finite Abelian Groups with Symmetric Groups

2020 ◽  
pp. 1-7
Author(s):  
Omar Tout
Keyword(s):  
Finite Group ◽  
Symmetric Group ◽  
Wreath Product ◽  
Abelian Groups ◽  
Symmetric Groups ◽  
Gelfand Pair ◽  
Gelfand Pairs ◽  
Finite Abelian Groups ◽  
A Finite Group

Abstract It is well known that the pair $(\mathcal {S}_n,\mathcal {S}_{n-1})$ is a Gelfand pair where $\mathcal {S}_n$ is the symmetric group on n elements. In this paper, we prove that if G is a finite group then $(G\wr \mathcal {S}_n, G\wr \mathcal {S}_{n-1}),$ where $G\wr \mathcal {S}_n$ is the wreath product of G by $\mathcal {S}_n,$ is a Gelfand pair if and only if G is abelian.

scholarly journals ON THE GENERATING GRAPH OF A SIMPLE GROUP

2016 ◽  
Vol 103 (1) ◽  
pp. 91-103 ◽  
Author(s):  
ANDREA LUCCHINI ◽  
ATTILA MARÓTI ◽  
COLVA M. RONEY-DOUGAL
Keyword(s):  
Finite Group ◽  
Symmetric Group ◽  
Simple Group ◽  
Generating Graph ◽  
A Finite Group

The generating graph $\unicode[STIX]{x1D6E4}(H)$ of a finite group $H$ is the graph defined on the elements of $H$, with an edge between two vertices if and only if they generate $H$. We show that if $H$ is a sufficiently large simple group with $\unicode[STIX]{x1D6E4}(G)\cong \unicode[STIX]{x1D6E4}(H)$ for a finite group $G$, then $G\cong H$. We also prove that the generating graph of a symmetric group determines the group.

Conjugacy classes of double covers of monomial groups

1984 ◽  
Vol 96 (2) ◽  
pp. 195-201 ◽  
Author(s):  
John F. Humphreys
Keyword(s):  
Finite Group ◽  
Conjugacy Class ◽  
Symmetric Group ◽  
Double Cover ◽  
Conjugacy Classes ◽  
Alternating Group ◽  
Double Covers ◽  
Monomial Group ◽  
The Subject ◽  
A Finite Group

Let G be a finite group, Sn be the symmetric group on n symbols and An be the corresponding alternating group. The conjugacy classes of the wreath product GSn (or monomial group as it is sometimes known) and the conjugacy classes of GAn have been described by Kerber (see [2] and [3]). The group Sn has a double cover n so that the faithful complex representations of this double cover may be regarded as protective representations of Sn. In Section 2, a particular double cover for GSn is constructed, the faithful complex representations of this group being the subject of a joint article with Peter Hoffman[1]. In the present paper, our task is to determine whether a conjugacy class of GSn corresponds to one or to two conjugacy classes in the double cover of GSn (and similarly for GAn). The main results, Theorems 1 and 2, are stated precisely in Section 2 and proved in Sections 3 and 4 respectively. The case when G = 1 provides classical results of Schur ([5], Satz IV). When G is a cyclic group, Read [4] has determined the conjugacy classes, not just for our particular double cover, but for all possible double covers of GSn.

The Probabilistic Zeta Function of Alternating and Symmetric Groups

2009 ◽  
Vol 16 (02) ◽  
pp. 195-210
Author(s):  
Andrea Lucchini ◽  
Marilena Massa
Keyword(s):  
Finite Group ◽  
Zeta Function ◽  
Dirichlet Series ◽  
Symmetric Groups ◽  
Simple Zero ◽  
Factor Group ◽  
Explicit Criterion ◽  
Alternating And Symmetric Groups ◽  
A Finite Group

The probability that a finite group G is generated by s elements is given by a truncated Dirichlet series in s, denoted by PG(s). We give an explicit criterion that allows one to recognize whether the factor group G/ Frat (G) is simple by only looking at the coefficients of PG(s). In order to get such a criterion, we prove that the series derived from PG(s) by removing the even-indexed terms has only a simple zero at s=1.

Sign in / Sign up

Export Citation Format

Share Document