Searcharxiv⌕ Search

arXiv subjects

Mark L. Lewis

Publications and source records attributed to Mark L. Lewis.

At least 55 records · Page 3Linked to original sources
arXiv2024

Some results on the norm of finite groups

Let $G$ be a finite group and $N_Ω(G)$ be the intersection of the normalizers of all subgroups belonging to the set $Ω(G),$ where $Ω(G)$ is a set of all subgroups of $G$ which have some theoretical group property. In this paper, we show that $N_Ω(G)= Z_{\infty}(G)$ if $Ω(G)$ is one of the following: (i) the set of all self-normalizing subgroups of $G$; (ii) the set of all subgroups of $G$ satisfying the subnormalizer condition in $G$; (iii) the set of all pronormal subgroups of $G$; (iv) the set of all $\mathscr{H}$-subgroups of $G$; (v) the set of all weakly normal subgroups of $G$; (vi) the set of all $NE$-subgroups of $G$.

math.GR↗
arXiv2024

A lower bound on the size of maximal abelian subgroups

Let $G$ be a $p$-group for some prime $p$. Let $n$ be the positive integer so that $|G:Z(G)| = p^n$. Suppose $A$ is a maximal abelian subgroup of $G$. Let $$p^l = {\rm max} \{|Z(C_G (g)):Z(G)| : g \in G \setminus Z(G)\},$$ $$p^b = {\rm max} \{|cl(g)| : g \in G \setminus Z(G) \},$$ and $p^a = |A:Z(G)|$. Then we show that $a \ge n/(b+l)$.

math.GR↗
arXiv2024

A Frobenius group analog for Camina triples

Frobenius groups are an object of fundamental importance in finite group theory. As such, several generalizations of these groups have been considered. Some examples include: A Frobenius--Wielandt group is a triple $(G,H,L)$ where $H/L$ is {\it almost} a Frobenius complement for $G$; A Camina pair is a pair $(G,N)$ where $N$ is {\it almost} a Frobenius kernel for $G$; A Camina triple is a triple $(G,N,M)$ where $(G,N)$ and $(G,M)$ are {\it almost} Camina pairs. In this paper we study triples $(G,N,M)$ where $(G,N)$ and $(G,M)$ are {\it almost} Frobenius groups.

math.GR↗
arXiv2024

Characterizing finite groups whose enhanced power graphs have universal vertices

Let $G$ be a finite group and construct a graph $Δ(G)$ by taking $G\setminus\{1\}$ as the vertex set of $Δ(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set consisting of the universal vertices of $Δ(G)$ along the identity element. For a solvable group $G$, we present a necessary and sufficient conditon for $K(G)$ to be nontrivial. We also develop a connection between $Δ(G)$ and $K(G)$ when $|G|$ is divisible by two distinct primes and the diameter of $Δ(G)$ is $2$.

math.GR↗
arXiv2024

Finite solvable tidy Groups whose orders are divisible by two primes

In this paper, we investigate finite solvable tidy groups. We classify the tidy $\{ p, q \}$-groups. Combining this with a previous result, we are able to characterize the finite tidy solvable groups. Using this characterization, we bound the Fitting height of finite tidy solvable groups and we prove that the quotients of finite tidy solvable groups are tidy.

math.GR↗
arXiv2022

Conjugacy classes of maximal cyclic subgroups of metacyclic $p$-groups

In this paper, we set $η(G)$ to be the number of conjugacy classes of maximal cyclic subgroups of a finite group $G$. We compute $η(G)$ for all metacyclic $p$-groups. We show that if $G$ is a metacyclic $p$-group of order $p^n$ that is not dihedral, generalized quaternion, or semi-dihedral, then $η(G) \ge n-2$, and we determine when equality holds.

math.GR↗
arXiv2022

The Average of Some Irreducible Character Degrees

We are interested in determining the bound of the average of the degrees of the irreducible characters whose degrees are not divisible by some prime $p$ that guarantees a finite group $G$ of odd order is $p$-nilpotent. We find a bound that depends on the prime $p$. If we further restrict our average by fixing a subfield $k$ of the complex numbers and then compute the average of the degrees of the irreducible characters whose degrees are not divisible by $p$ and have values in $k$, then we will see that we obtain a bound that depends on both $p$ and $k$. Moreover, we find examples that make those bounds best possible.

math.GR↗
arXiv2022

Groups having all elements off a normal subgroup with prime power order

We consider a finite group $G$ with a normal subgroup $N$ so that all elements of $G \setminus N$ have prime power order. We prove that if there is a prime $p$ so that all the elements in $G \setminus N$ have $p$-power order, then either $G$ is a $p$-group or $G = PN$ where $P$ is a Sylow $p$-subgroup and $(G,P,P \cap N)$ is a Frobenius-Wielandt triple. We also prove that if all the elements of $G \setminus N$ have prime power orders and the orders are divisible by two primes $p$ and $q$, then $G$ is a $\{ p, q \}$-group and $G/N$ is either a Frobenius group or a $2$-Frobenius group. If all the elements of $G \setminus N$ have prime power orders and the orders are divisible by at least three primes, then all elements of $G$ have prime power order and $G/N$ is nonsolvable.

math.GR↗
arXiv2022

Conjugacy classes of maximal cyclic subgroups

In this paper, we set $η(G)$ to be the number of conjugacy classes of maximal cyclic subgroups of $G$. We consider $η$ and direct and semi-direct products. We characterize the normal subgroups $N$ so that $η(G/N) = η(G)$. We set $G^- = \{ g \in G \mid \langle g \rangle {\rm ~is~not ~maximal~cyclic} \}$. We show if $\langle G^- \rangle < G$, then $G/\langle G^- \rangle$ is either (1) an elementary abelian $p$-group for some prime $p$, (2) a Frobenius group whose Frobenius kernel is a $p$-group of exponent $p$ and a Frobenius complement has order $q$ for distinct primes $p$ and $q$, or (3) isomorphic to $A_5$.

math.GR↗
arXiv2021

The Cyclic Graph of a $2$-Frobenius Group

The cyclic graph of a group $G$ is the graph whose vertices are the nonidentity elements of $G$ and whose edges connect distinct elements $x$ and $y$ if and only if the subgroup $\langle x,y\rangle$ is cyclic. We obtain information about the cyclic graph of $2$-Frobenius groups. The cyclic graph of a $2$-Frobenius group is disconnected. In this paper, we determine the number of connected components of the cyclic graph of any $2$-Frobenius group.

math.GR↗
arXiv2021

Extending Morgan and Parker's results about commuting graphs

Morgan and Parker have proved that if $G$ is a group satisfying the condition that $Z(G) = 1$, then the connected components of the commuting graph of $G$ have diameter at most $10$. Parker has proved that if in addition $G$ is solvable, then the commuting graph of $G$ is disconnected if and only if $G$ is a Frobenius group or a $2$-Frobenius group, and if the commuting graph of $G$ is connected, then its diameter is at most $8$. We prove that the hypothesis $Z (G) = 1$ in these results can be replaced with $G' \cap Z(G) = 1$. We also prove that if $G$ is solvable and $G/Z(G)$ is either a Frobenius group or a $2$-Frobenius group, then the commuting graph of $G$ is disconnected.

math.GR↗
arXiv2021

Partial GVZ-groups

Following the literature, a group $G$ is called a group of central type if $G$ has an irreducible character that vanishes on $G\setminus Z(G)$. Motivated by this definition, we say that a character $χ\in {\rm Irr}(G)$ has central type if $χ$ vanishes on $G\setminus Z(χ)$, where $Z(χ)$ is the center of $χ$. Groups where every irreducible character has central type have been studied previously under the name GVZ-groups (and several other names) in the literature. In this paper, we study the groups $G$ that possess a nontrivial, normal subgroup $N$ such that every character of $G$ either contains $N$ in its kernel or has central type. The structure of these groups is surprisingly limited and has many aspects in common with both central type groups and GVZ-groups.

math.GR↗
arXiv2020

GVZ-groups, Flat Groups, and CM-Groups

We show that a group is a GVZ-group if and only if it is a flat group. We show that the nilpotence class of a GVZ-group is bounded by the number of distinct degrees of irreducible characters. We also show that certain CM-groups can be characterized as GVZ-groups whose irreducible character values lie in the prime field.

math.GR↗
arXiv2020

The Cyclic Graph of a Z-group

For a group $G$, we define a graph $Δ(G)$ by letting $G^{\#} = G \setminus \{ 1 \}$ be the set of vertices and by drawing an edge between distinct elements $x,y\in G^{\#}$ if and only if the subgroup $\langle x,y\rangle$ is cyclic. Recall that a $Z$-group is a group where every Sylow subgroup is cyclic. In this short note, we investigate $Δ(G)$ for a $Z$-group $G$.

math.GR↗