Results 21 to 30 of about 974 (238)
The first example of a simple 2−(81,6,2) design
Examples and Counterexamples, 2021 We give the very first example of a simple 2−(81,6,2)design. Its points are the elements of the elementary abelian group of order 81 and each block is the union of two parallel lines of the 4-dimensional geometry over the field of order 3.
Anamari Nakic
doaj +1 more source
Computing the number of symmetric colorings of elementary Abelian groups
Alexandria Engineering Journal, 2021 Given a finite group G and a positive integer r, an r-coloring of G is any mapping χ:G→{1,…,r}. Colorings χ and φ are equivalent if there exists g∈G such that χ(xg-1)=φ(x) for all x∈G. A coloring χ is symmetric if there exists g∈G such that χ(gx-1g)=χ(x)
Yuliya Zelenyuk
doaj +1 more source
Elementary Abelian 2-subgroups in an Autotopism Group of a Semifield Projective Plane
Известия Иркутского государственного университета: Серия "Математика", 2020 Elementary Abelian 2-subgroups in an Autotopism Group of a Semifield Projective Plane} We investigate the hypotheses on a solvability of the full collineation group for non-Desarguesian semifield projective plane of a finite order (the question 11.76 in ...
O. V. Kravtsova
doaj +1 more source
Determine the value d(M(G)) for non-abelian p-groups of order q = pnk of Nilpotency c
Ratio Mathematica, 2020 In this paper we prove that if n, k and t be positive integer numbers such that t < k < n and G is a non abelian p-group of order pnk with derived subgroup of order pkt and nilpotency class c, then the minimal number of generators of G is at most p1 2 (
Behnam Razzaghmaneshi
doaj +1 more source
How SU(2)$_4$ Anyons are Z$_3$ Parafermions
SciPost Physics, 2017 We consider the braid group representation which describes the non-abelian braiding statistics of the spin $1/2$ particle world lines of an SU(2)$_4$ Chern-Simons theory.
Richard Fern, Johannes Kombe, Steven H. Simon
doaj +1 more source
On the structure of finite groups associated to regular non-centralizer graphs
AIMS Mathematics, 2023 The non-centralizer graph of a finite group $ G $ is the simple graph $ \Upsilon_G $ whose vertices are the elements of $ G $ with two vertices are adjacent if their centralizers are distinct.
Tariq A. Alraqad , Hicham Saber
doaj +1 more source
Rigid automorphisms of linking systems
Forum of Mathematics, Sigma, 2021 A rigid automorphism of a linking system is an automorphism that restricts to the identity on the Sylow subgroup. A rigid inner automorphism is conjugation by an element in the center of the Sylow subgroup.
George Glauberman, Justin Lynd
doaj +1 more source
Wielandt′s Theorem and Finite Groups with Every Non-nilpotent Maximal Subgroup with Prime Index
Journal of Harbin University of Science and Technology, 2023 In order to give a further study of the solvability of a finite group in which every non-nilpotent maximal subgroup has prime index, the methods of the proof by contradiction and the counterexample of the smallest order and a theorem of Wielandt on the ...
TIAN Yunfeng, SHI Jiangtao, LIU Wenjing
doaj +1 more source
An approach to Quillen’s conjecture via centralisers of simple groups
Forum of Mathematics, Sigma, 2021 For any given subgroup H of a finite group G, the Quillen poset ${\mathcal {A}}_p(G)$ of nontrivial elementary abelian p-subgroups is obtained from ${\mathcal {A}}_p(H)$ by attaching elements via their centralisers in H.
Kevin Iván Piterman
doaj +1 more source
Sultan Qaboos University Journal for Science, 2009 The group of characters of an elementary Abelian group has been used to define duality between its subgroups, which in turn is extended to duality between group codes.
Adnan Abdulla Zain
doaj +1 more source