Results 21 to 30 of about 646,532 (282)
Minimum Neighborhood of Alternating Group Graphs
IEEE Access, 2019 The minimum neighborhood and combinatorial property are two important indicators of fault tolerance of a multiprocessor system. Given a graph G, θG(q) is the minimum number of vertices adjacent to a set of q vertices of G (1 ≤ q ≤ |V(
Yanze Huang +3 more
doaj +1 more source
The Relation Between the Alternating Group and Standard Row Young’s Diagrams [PDF]
مجلة التربية والعلم, 2019 This study tackles the relationship between the alternating group 14An"> and young’sdiagrams concerning standard rows. The study has been divided into two stages… First, even permutations have been found depending on the conception of partition 14خ¼ ...
Ilham Matta Yacoob Matta +2 more
doaj +1 more source
The Navarro conjecture for the alternating groups [PDF]
Algebra & Number Theory, 2021 Recently Navarro proposed a strengthening of the unsolved McKay conjecture using Galois automorphisms. We prove that the Navarro conjecture holds for the alternating groups when the prime p is odd.
Brunat, Olivier, Nath, Rishi
openaire +4 more sources
OD-characterization of alternating groups Ap+d
Open Mathematics, 2017 Let An be an alternating group of degree n. Some authors have proved that A10, A147 and A189 cannot be OD-characterizable. On the other hand, others have shown that A16, A23+4, and A23+5 are OD-characterizable.
Yang Yong, Liu Shitian, Zhang Zhanghua
doaj +1 more source
The character table of a sharply 5-transitive subgroup of the alternating group of degree 12 [PDF]
International Journal of Group Theory, 2021 We calculate the character table of a sharply $5$-transitive subgroup of $\alter(12)$, and of a sharply $4$-transitive subgroup of $\alter(11)$. Our presentation of these calculations is new because we make no reference to the sporadic simple Mathieu
Nick Gill, Sam Hughes
doaj +1 more source
Top-Down Construction of Independent Spanning Trees in Alternating Group Networks
IEEE Access, 2020 A set of spanning trees in a graph G is called independent spanning trees (ISTs) if they are rooted at the same vertex r, and for each vertex v(≠ r) in G, the two paths from v to r in any two trees share no common vertex expect for v and r.
Jie-Fu Huang +3 more
doaj +1 more source
Comparison of Gelfand-Tsetlin Bases for Alternating and Symmetric Groups [PDF]
, 2017 Young's orthogonal basis is a classical basis for an irreducible representation of a symmetric group. This basis happens to be a Gelfand-Tsetlin basis for the chain of symmetric groups. It is well-known that the chain of alternating groups, just like the
Geetha, T., Prasad, Amritanshu
core +1 more source
Permutation statistics on the alternating group
Advances in Applied Mathematics, 2004 45 ...
Amitai Regev, Yuval Roichman
openaire +3 more sources
Conjectures on the normal covering number of finite symmetric and alternating groups [PDF]
International Journal of Group Theory, 2014 Let gamma(Sn) be the minimum number of proper subgroups Hi, i = 1,...,ell, of the symmetric group Sn such that each element in Sn lies in some conjugate of one of the Hi.
Daniela Bubboloni +2 more
doaj
A new characterization of A7 and A8
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2013 Let G be a finite group and πe(G) be the set of element orders of G. Let k ∈ πe (G)and mk be the number of elements of order k in G. Set nse(G):={mk|k ∈ πe (G)}. It is proved that An are uniquely determined by nse(An), where n ∈ {4,5,6}.
Asboei Alireza Khalili +2 more
doaj +1 more source