Torsion elements of order 𝑝2 in the Nottingham group

2020 ◽  
Vol 23 (3) ◽  
pp. 489-502
Author(s):  
Chun Yin Hui ◽  
Krishna Kishore
Keyword(s):  
Finite Field ◽  
Conjugacy Class ◽  
Upper Bound ◽  
Conjugacy Classes ◽  
Torsion Element ◽  
Exact Number

AbstractLet κ be a characteristic p finite field of q elements and {\mathfrak{N}_{\kappa}} the Nottingham group over κ. Lubin associated to every conjugacy class of torsion element of {\mathfrak{N}_{\kappa}} a type. We establish an upper bound {B(q;l,m)} on the number of conjugacy classes of order {p^{2}} torsion elements u of {\mathfrak{N}_{\kappa}} of type {\langle l,m\rangle}. In the case where {l<p}, the bound {B(q;l,m)} is the exact number of conjugacy classes. Moreover, we give a criterion on when u and {u^{n}} are conjugate.

ON THE REGULAR GRAPH RELATED TO THE G-CONJUGACY CLASSES

2021 ◽  
pp. 1-5
Author(s):  
SH. RAHIMI ◽  
Z. AKHLAGHI
Keyword(s):  
Finite Group ◽  
Normal Subgroup ◽  
Conjugacy Class ◽  
Regular Graph ◽  
Simple Graph ◽  
Conjugacy Classes ◽  
A Finite Group

Abstract Given a finite group G with a normal subgroup N, the simple graph $\Gamma _{\textit {G}}( \textit {N} )$ is a graph whose vertices are of the form $|x^G|$ , where $x\in {N\setminus {Z(G)}}$ and $x^G$ is the G-conjugacy class of N containing the element x. Two vertices $|x^G|$ and $|y^G|$ are adjacent if they are not coprime. We prove that, if $\Gamma _G(N)$ is a connected incomplete regular graph, then $N= P \times {A}$ where P is a p-group, for some prime p, $A\leq {Z(G)}$ and $\textbf {Z}(N)\not = N\cap \textbf {Z}(G)$ .

THE CONJUGACY CLASSES OF SOME FINITE METABELIAN GROUPS AND THEIR RELATED GRAPHS

2016 ◽  
Vol 79 (1) ◽  
Author(s):  
Nor Haniza Sarmin ◽  
Ain Asyikin Ibrahim ◽  
Alia Husna Mohd Noor ◽  
Sanaa Mohamed Saleh Omer
Keyword(s):  
Graph Theory ◽  
Conjugacy Class ◽  
Dihedral Group ◽  
Clique Number ◽  
Conjugacy Classes ◽  
Quaternion Group ◽  
Metabelian Groups ◽  
Dominating Number ◽  
Graph Properties ◽  
Class Graph

In this paper, the conjugacy classes of three metabelian groups, namely the Quasi-dihedral group, Dihedral group and Quaternion group of order 16 are computed. The obtained results are then applied to graph theory, more precisely to conjugate graph and conjugacy class graph. Some graph properties such as chromatic number, clique number, dominating number and independent number are found.   

Prefrattini Subgroups and Cover-Avoidance Properties in 𝔘-Groups

1975 ◽  
Vol 27 (4) ◽  
pp. 837-851 ◽  
Author(s):  
M. J. Tomkinson
Keyword(s):  
Conjugacy Class ◽  
Soluble Group ◽  
Saturated Formation ◽  
Conjugacy Classes ◽  
Pronormal Subgroup ◽  
Finite Soluble Group ◽  
Factors Associated ◽  
Chief Factors

W. Gaschutz [5] introduced a conjugacy class of subgroups of a finite soluble group called the prefrattini subgroups. These subgroups have the property that they avoid the complemented chief factors of G and cover the rest. Subsequently, these results were generalized by Hawkes [12], Makan [14; 15] and Chambers [2]. Hawkes [12] and Makan [14] obtained conjugacy classes of subgroups which avoid certain complemented chief factors associated with a saturated formation or a Fischer class. Makan [15] and Chambers [2] showed that if W, D and V are the prefrattini subgroup, 𝔍-normalizer and a strongly pronormal subgroup associated with a Sylow basis S, then any two of W, D and V permute and the products and intersections of these subgroups have an explicit cover-avoidance property.

scholarly journals Quadratic form Approach for the Number of Zeros of Homogeneous Linear Recurring Sequences over Finite Fields

2017 ◽  
Vol 9 (3) ◽  
pp. 8
Author(s):  
Yasanthi Kottegoda
Keyword(s):  
Quadratic Form ◽  
Finite Field ◽  
Characteristic Polynomial ◽  
Finite Fields ◽  
Quadratic Forms ◽  
Linear Recurring Sequences ◽  
Exact Number ◽  
Number Of Zeros ◽  
Homogeneous Linear ◽  
Form Approach

We consider homogeneous linear recurring sequences over a finite field $\mathbb{F}_{q}$, based on an irreducible characteristic polynomial of degree $n$ and order $m$. Let $t=(q^{n}-1)/ m$. We use quadratic forms over finite fields to give the exact number of occurrences of zeros of the sequence within its least period when $t$ has q-adic weight 2. Consequently we prove that the cardinality of the set of zeros for sequences from this category is equal to two.

Numbers Of Conjugacy Class Sizes And Derived Lengths for A-Groups

1996 ◽  
Vol 39 (3) ◽  
pp. 346-351 ◽  
Author(s):  
Mary K. Marshall
Keyword(s):  
Conjugacy Class ◽  
Solvable Group ◽  
Conjugacy Classes ◽  
Finite Solvable Group ◽  
Conjugacy Class Sizes ◽  
Sylow Subgroups ◽  
Derived Length ◽  
Completely Reducible

AbstractAn A-group is a finite solvable group all of whose Sylow subgroups are abelian. In this paper, we are interested in bounding the derived length of an A-group G as a function of the number of distinct sizes of the conjugacy classes of G. Although we do not find a specific bound of this type, we do prove that such a bound exists. We also prove that if G is an A-group with a faithful and completely reducible G-module V, then the derived length of G is bounded by a function of the number of distinct orbit sizes under the action of G on V.

On the number of conjugacy classes of the sylow p-subgroups of GL(n,q)

1995 ◽  
Vol 52 (3) ◽  
pp. 431-439 ◽  
Author(s):  
Antonio Vera-López ◽  
J.M. Arregi ◽  
F.J. Vera-López
Keyword(s):  
Finite Field ◽  
Conjugacy Classes ◽  
Number Of Classes

If G is a finite p-group of order pn, P. Hall determined the number of conjugacy classes of G, r(G), modulo (p2 − 1)(p − 1). Namely, he proved the existence of a constant k ≥ 0 such that r(G) = n(p2 − 1) + pe + k(p2 − 1)(p − 1). In this paper, we denote by the group of the upper unitriangular matrices over , the finite field with q = pt elements, and we determine the number of classes of modulo (q − 1)5.

BALANCED SETS AND THE VECTOR GAME

2008 ◽  
Vol 04 (03) ◽  
pp. 339-347 ◽  
Author(s):  
ZHIVKO NEDEV ◽  
ANTHONY QUAS
Keyword(s):  
Field Theory ◽  
Lower Bound ◽  
Finite Field ◽  
Upper Bound ◽  
Log P ◽  
Prime Factorization ◽  
Minimum Cardinality ◽  
Player Game

We consider the notion of a balanced set modulo N. A nonempty set S of residues modulo N is balanced if for each x ∈ S, there is a d with 0 < d ≤ N/2 such that x ± d mod N both lie in S. We define α(N) to be the minimum cardinality of a balanced set modulo N. This notion arises in the context of a two-player game that we introduce and has interesting connections to the prime factorization of N. We demonstrate that for p prime, α(p) = Θ( log p), giving an explicit algorithmic upper bound and a lower bound using finite field theory and show that for N composite, α(N) = min p|Nα(p).

scholarly journals Prime powers as conjugacy class lengths of π-elements

2004 ◽  
Vol 69 (2) ◽  
pp. 317-325 ◽  
Author(s):  
Antonio Beltrán ◽  
María José Felipe
Keyword(s):  
Finite Group ◽  
Conjugacy Class ◽  
Normal Structure ◽  
Conjugacy Classes ◽  
First Case ◽  
A Finite Group

Let G be a finite group and π an arbitrary set of primes. We investigate the structure of G when the lengths of the conjugacy classes of its π-elements are prime powers. Under this condition, we show that such lengths are either powers of just one prime or exactly {1,qa, rb}, with q and r two distinct primes lying in π and a, b > 0. In the first case, we obtain certain properties of the normal structure of G, and in the second one, we provide a characterisation of the structure of G.

scholarly journals ROOT MULTIPLICITIES AND NUMBER OF NONZERO COEFFICIENTS OF A POLYNOMIAL

2007 ◽  
Vol 06 (03) ◽  
pp. 469-475 ◽  
Author(s):  
SANDRO MATTAREI
Keyword(s):  
Finite Field ◽  
Characteristic Zero ◽  
Positive Characteristic ◽  
Similar Argument ◽  
Original Result ◽  
Exact Number ◽  
Nonzero Root ◽  
Root Multiplicities ◽  
Univariate Polynomial

It is known that the weight (that is, the number of nonzero coefficients) of a univariate polynomial over a field of characteristic zero is larger than the multiplicity of any of its nonzero roots. We extend this result to an appropriate statement in positive characteristic. Furthermore, we present a new proof of the original result, which produces also the exact number of monic polynomials of a given degree for which the bound is attained. A similar argument allows us to determine the number of monic polynomials of a given degree, multiplicity of a given nonzero root, and number of nonzero coefficients, over a finite field of characteristic larger than the degree.

scholarly journals The Energy of Conjugacy Classes Graphs of Some Order of Alternating Groups

2020 ◽  
Vol 7 (4) ◽  
pp. 62-71
Author(s):  
Zuzan Naaman Hassan ◽  
Nihad Titan Sarhan
Keyword(s):  
Conjugacy Class ◽  
Adjacency Matrix ◽  
Finite Graph ◽  
Conjugacy Classes ◽  
Alternating Group ◽  
Alternating Groups ◽  
Eigen Values ◽  
Finite Set ◽  
Class Graph ◽  
Square Matrix

The energy of a graph , is the sum of all absolute values of the eigen values of the adjacency matrix which is indicated by . An adjacency matrix is a square matrix used to represent of finite graph where the rows and columns consist of 0 or 1-entry depending on the adjacency of the vertices of the graph. The group of even permutations of a finite set is known as an alternating group  . The conjugacy class graph is a graph whose vertices are non-central conjugacy classes of a group , where two vertices are connected if their cardinalities are not coprime. In this paper, the conjugacy class of alternating group  of some order for   and their energy are computed. The Maple2019 software and Groups, Algorithms, and Programming (GAP) are assisted for computations.

Sign in / Sign up

Export Citation Format

Share Document