Search

Let $D: \mathbb{Z}_m^n \to \mathbb{Z}_m^n$ be defined so \[D(x_1, x_2, ..., x_n)=(x_1+x_2 \; \text{mod} \; m, x_2+x_3 \; \text{mod} \; m, ..., x_n+x_1 \; \text{mod} \; m).\] $D$ is known as the Ducci function and for $\mathbf{u} \in \mathbb{Z}_m^n$, $\{D^{\alpha}(\mathbf{u})\}_{\alpha=0}^{\infty}$ is the Ducci sequence of $\mathbf{u}$. Every Ducci sequence enters a cycle because $\mathbb{Z}_m^n$ is finite. In this paper, we aim to establish an upper bound for how long it will take for a Ducci sequence in $\mathbb{Z}_m^n$ to enter its cycle when $n$ is even.

Let $G$ be a finite group, and let $\text{Irr}(G)$ denote the set of the irreducible complex characters of $G$. An element $g\in G$ is called a vanishing element of $G$ if there exists $\chi\in\text{Irr}(G)$ such that $\chi(g)=0$ (i.e., $g$ is a zero of $\chi$) and, in this case, the conjugacy class $g^G$ of $g$ in $G$ is called a vanishing conjugacy class. In this paper we consider several problems concerning vanishing elements and vanishing conjugacy classes; in particular, we consider the problem of determining the least number of conjugacy classes of a finite group $G$ such that every non-linear $\chi\in\text{Irr}(G)$ vanishes on one of them. We also consider the related problem of determining the minimum number of non-linear irreducible characters of a group such that two of them have a common zero.

This article investigates neighborhoods' sizes in the enhanced power graph (as known as the cyclic graph) associated with a finite group. In particular, we characterize finite $p$-groups with the smallest maximum size for neighborhoods of nontrivial element in its enhanced power graph., Comment: 6 pages

Define the Ducci function $D: \mathbb{Z}_m^n \to \mathbb{Z}_m^n$ so \[D(x_1,x_2, ...,x_n)=(x_1+x_2 \;\text{mod} \; m, x_2+x_3 \; \text{mod} \; m, ..., x_n+x_1 \; \text{mod} \; m).\] Call $\{D^{\alpha}(\mathbf{u})\}_{\alpha=0}^{\infty}$ the Ducci sequence of $\mathbf{u}$. Because $\mathbb{Z}_m^n$ is finite, every Ducci sequence will enter a cycle. In this paper, we will prove that if $n$ is odd and $m=2^lm_1$ where $m_1$ is odd, then the longest it will take for a Ducci sequence to enter its cycle is $l$ iterations. Furthermore, we will prove the set of all tuples in a cycle for $\mathbb{Z}_m^n$ is $\{(x_1, x_2, ..., x_n) \in \mathbb{Z}_m^n \; \mid \; x_1+x_2+ \cdots +x_n \equiv 0 \; \text{mod} \; 2^l\}$.

Let $G$ be a finite group and $N_{\Omega}(G)$ be the intersection of the normalizers of all subgroups belonging to the set $\Omega(G),$ where $\Omega(G)$ is a set of all subgroups of $G$ which have some theoretical group property. In this paper, we show that $N_{\Omega}(G)= Z_{\infty}(G)$ if $\Omega(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$.

Let $G$ be a finite group. The group pseudo-algebra of $G$ is defined as the multi-set $C(G)=\{(d,m_G(d))\mid d\in{\rm Cod}(G)\},$ where $m_G(d)$ is the number of irreducible characters of with codegree $d\in {\rm Cod}(G)$. We show that there exist two finite $p$-groups with distinct orders that have the same group pseudo-algebra, providing an answer to Question 3.2 in \cite{Moreto2023}. In addition, we also discuss under what hypothesis two $p$-groups with the same group pseudo-algebra will be isomorphic.

Let $\chi$ be an irreducible character of a group $G,$ and $S_c(G)=\sum_{\chi\in {\rm Irr}(G)}{\rm cod}(\chi)$ be the sum of the codegrees of the irreducible characters of $G.$ Write ${\rm fcod} (G)=\frac{S_c(G)}{|G|}.$ We aim to explore the structure of finite groups in terms of ${\rm fcod} (G).$ On the other hand, we determine the lower bound of $S_c(G)$ for nonsolvable groups and prove that if $G$ is nonsolvable, then $S_c(G)\geq S_c(A_5)=68,$ with equality if and only if $G\cong A_5.$ Additionally, we show that there is a solvable group so that it has the codegree sum as $A_5.$

Let $\chi$ be an irreducible character of a group $G.$ We denote the sum of the codegrees of the irreducible characters of $G$ by $S_c(G)=\sum_{\chi\in {\rm Irr}(G)}{\rm cod}(\chi).$ We consider the question if $S_c(G)\leq S_c(C_n)$ is true for any finite group $G,$ where $n=|G|$ and $C_n$ is a cyclic group of order $n.$ We show this inequality holds for many classes of groups. In particular, we provide an affirmative answer for any finite group whose order is divisible by up to 99 primes. However, we show that the question does not hold true in all cases, by evidence of a counterexample.

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)$.

Let $D(x_1, x_2, ..., x_n)=(x_1+x_2 \;\text{mod} \; m, x_2+x_3 \; \text{mod} \; m, ..., x_n+x_1 \; \text{mod} \; m)$ where $D \in End(\mathbb{Z}_m^n)$ be the Ducci function. The sequence $\{D^k(\mathbf{u})\}_{k=0}^{\infty}$ will eventually enter a cycle. If $n=3$, we aim to establish the longest a cycle can be for a given $m$.

Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(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 $\Delta(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 $\Delta(G)$ and $K(G)$ when $|G|$ is divisible by two distinct primes and the diameter of $\Delta(G)$ is $2$., Comment: 8 pages

Let the Ducci function $D: \mathbb{Z}_m^n \to \mathbb{Z}_m^n$ be defined as \[D(x_1, x_2, ..., x_n)=(x_1+x_2 \; \text{mod} \; m, x_2+x_3 \; \text{mod} \; m, ..., x_n+x_1 \; \text{mod} \; m)\] and let the Ducci sequence of $\mathbf{u}$ be the sequence $\{D^{\alpha}(\mathbf{u})\}_{\alpha=0}^{\infty}$. %In this paper, we will prove that if $n,m$ are powers of $2$, then repeatedly applying $D$ will eventually result in $(0,0,...,0)$, as well as establish an upper bound for how many iterations it will take for this to happen. In this paper, we will provide another proof that for $n=2^k$ and $m=2^l$, that all Ducci sequences will end in $(0,0,...,0)$ and additionally prove that this will happen in at most $2^{k-1}(l+1)$ iterations of $D$.

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.

Given a discrete (resp. profinite) group $G$, we define $NCC(G)$ to be the smallest number of cyclic (resp. procyclic) subgroups of $G$ whose conjugates cover $G$. In this paper we determine all residually finite discrete groups with finite NCC and give an almost complete characterization of profinite groups with finite NCC. As a consequence we can show, for example, that for any $k\in\mathbb N$ and any prime $p>3$ the number of finite $p$-groups $P$ with more than $3$ generators and $NCC(P)=k$ is finite., Comment: 52 pages, v2: minor changes

We classify all finite groups $G$ which possesses an element $x\in G$ such that every irreducible character of $G$ takes a root of unity value at $x$.

In this paper, we set $\eta (G)$ to be the number of conjugacy classes of maximal cyclic subgroups of a finite group $G$. We compute $\eta (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 $\eta (G) \ge n-2$, and we determine when equality holds.

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.

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., Comment: 15 pages

In this paper, we set $\eta (G)$ to be the number of conjugacy classes of maximal cyclic subgroups of $G$. We prove that if $G$ is a $p$-group of order $p^n$ and nilpotence class $l$, then $\eta (G)$ is bounded below by a linear function in $n/l$., Comment: 9 pages

In this paper, we set $\eta (G)$ to be the number of conjugacy classes of maximal cyclic subgroups of $G$. We consider $\eta$ and direct and semi-direct products. We characterize the normal subgroups $N$ so that $\eta (G/N) = \eta (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$., Comment: 18 pages

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.

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., Comment: 10 pages, 4 figures

In this paper, we obtain a characterization of GVZ-groups in terms of commutators and monolithic quotients. This characterization is based on counting formulas due to Gallagher., Comment: 4 pages. arXiv admin note: text overlap with arXiv:1909.05841

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 $\chi\in {\rm Irr}(G)$ has central type if $\chi$ vanishes on $G\setminus Z(\chi)$, where $Z(\chi)$ is the center of $\chi$. 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., Comment: 11 pages

For a group $G$, we define a graph $\Delta(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 $\Delta(G)$ for a $Z$-group $G$., Comment: 6 pages, 3 figures

In this paper, we study the superscharacter theories of elementary abelian $p$-groups of order $p^2$. We show that the supercharacter theories that arise from the direct product construction and the $\ast$-product construction can be obtained from automorphisms. We also prove that any supercharacter theory of an elementary abelian $p$-group of order $p^2$ that has a nonidentity superclass of size $1$ or a nonprincipal linear supercharacter must come from either a $\ast$-product or a direct product. Although we are unable to prove results for general primes, we do compute all of the supercharacter theories when $p = 2, 3, 5$, and based on these computations along with particular computations for larger primes, we make several conjectures for a general prime $p$., Comment: 19 pages

Let $G$ be a finite group. Define a graph on the set $G^{\#} = G \setminus \{ 1 \}$ by declaring distinct elements $x,y\in G^{\#}$ to be adjacent if and only if $\langle x,y\rangle$ is cyclic. Denote this graph by $\Delta(G)$. The graph $\Delta(G)$ has appeared in the literature under the names cyclic graph and deleted enhanced power graph. If $G$ and $H$ are nontrivial groups, then $\Delta(G\times H)$ is completely characterized. In particular, if $\Delta(G\times H)$ is connected, then a diameter bound is obtained, along with an example meeting this bound. Also, necessary and sufficient conditions for the disconnectedness of $\Delta(G\times H)$ are established., Comment: Fixing typo in title

Let $G$ be a finite group, and let cs$(G)$ be the set of conjugacy class sizes of $G$. Recalling that an element $g$ of $G$ is called a \emph{vanishing element} if there exists an irreducible character of $G$ taking the value $0$ on $g$, we consider one particular subset of cs$(G)$, namely, the set vcs$(G)$ whose elements are the conjugacy class sizes of the vanishing elements of $G$. Motivated by the results in \cite{BLP}, we describe the class of the finite groups $G$ such that vcs$(G)$ consists of a single element \emph{under the assumption that $G$ is supersolvable or $G$ has a normal Sylow $2$-subgroup} (in particular, groups of odd order are covered). As a particular case, we also get a characterization of finite groups having a single vanishing conjugacy class size \emph{which is either a prime power or square-free}., Comment: 16 pages - revised according to referee's report

Let $G$ be a nonabelian group. We say that $G$ has an abelian partition, if there exists a partition of $G$ into commuting subsets $A_1, A_2, \ldots, A_n$ of $G$, such that $|A_i|\geqslant 2$ for each $i=1, 2, \ldots, n$. This paper investigates problems relating to group with abelian partitions. Among other results, we show that every finite group is isomorphic to a subgroup of a group with an abelian partition and also isomorphic to a subgroup of a group with no abelian partition. We also find bounds for the minimum number of partitions for several families of groups which admit abelian partitions -- with exact calculations in some cases. Finally, we examine how the size of partitions with the minimum number of parts behaves with respect to the direct product., Comment: 19 pages - revised according to referee's report

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., Comment: 18 pages - This is a correction of the version published in the Journal of Algebra. A corrigendum has been submitted there. Thank you to Viji Thomas for pointing out our mistake so we could fix it

Let $G$ be a finite group. The solubility graph associated with the finite group $G$, denoted by $\Gamma_{\cal S}(G)$, is a simple graph whose vertices are the non-trivial elements of $G$, and there is an edge between two distinct elements $x$ and $y$ if and only if $\langle x, y\rangle$ is a soluble subgroup of $G$. In this paper, we examine some properties of solubility graphs.

In this paper, we determine new characterizations of nested and nested GVZ-groups, including character-free characterizations, but we additionally show that nested groups and nested GVZ-groups can be defined in terms of the existence of certain normal series., Comment: 27 pages. This paper generalizes and provides a different method for obtaining the results in "Characterizations of nested GVZ-groups by central series," ArXiv 1907.409

A group is nested if the centers of the irreducible characters form a chain. In this paper, we will show that there is a set of subgroups associated with the conjugacy classes of group so that a group is nested if and only if these subgroups form a chain., Comment: 4 pages

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., Comment: 8 pages - Based on referee's report for the previous paper "GVZ-groups", that was substantially revised and subsumed by this paper

Many properties of groups can be defined by the existence of a particular normal series. The classic examples being solvability, supersolvability and nilpotence. Among the nilpotent groups are the so-called nested GVZ-groups --- groups where the centers of the irreducible characters form a chain, and where every irreducible character vanishes off of its center. In this paper, we show that nested GVZ-groups can be characterized by the existence of a certain ascending central series, or by the existence of a certain descending central series.

In this paper, we study the vanishing-off subgroups of supercharacters, and use these to determine several new characterizations of supercharacter theory products. In particular, we give a character theoretic characterization that allows us to conclude that one may determine if a supercharacter theory is a $\Delta$-product or $\ast$-product from the values of its corresponding supercharacters.

We consider groups where the centers of the irreducible characters form a chain. We obtain two alternate characterizations of these groups, and we obtain some information regarding the structure of these groups. Using our results, we are able to classify those groups where the kernels of the irreducible characters form a chain. We show that a result of Nenciu regarding nested GVZ groups is really a result about nested groups. We obtain an alternate proof of a theorem of Isaacs regarding the existence of $p$-groups with a given set of irreducible character degrees., Comment: 38 pages

Let $G$ be a $p$-group and let $\chi$ be an irreducible character of $G$. The codegree of $\chi$ is given by $|G:\text{ker}(\chi)|/\chi(1)$. Du and Lewis have shown that a $p$-group with exactly three codegrees has nilpotence class at most 2. Here we investigate $p$-groups with exactly four codegrees. If, in addition to having exactly four codegrees, $G$ has two irreducible character degrees, $G$ has largest irreducible character degree $p^2$, $|G:G'|=p^2$, or $G$ has coclass at most 3, then $G$ has nilpotence class at most 4. In the case of coclass at most 3, the order of $G$ is bounded by $p^7$. With an additional hypothesis we can extend this result to $p$-groups with four codegrees and coclass at most 7. In this case the order of $G$ is bounded by $p^{11}$.

Let $G$ be a $p$-group and let $\chi$ be an irreducible character of $G$. The codegree of $\chi$ is given by $|G:\text{ker}(\chi)|/\chi(1)$. This paper investigates the relationship between the nilpotence class of a group and the inclusion of $p^2$ as a codegree. If $G$ is a finite $p$-group with coclass $2$ and order at least $p^5$, or coclass $3$ and order at least $p^6$, then $G$ has $p^2$ as a codegree. With an additional hypothesis this result can be extended to $p$-groups with coclass $n\ge 3$ and order at least $p^{2n}$.

A graph is split if there is a partition of its vertex set into a clique and an independent set. The present paper is devoted to the splitness of some graphs related to finite simple groups, namely, prime graphs and solvable graphs, and their compact forms. It is proved that the compact form of the prime graph of any finite simple group is split., Comment: 22 pages, G2R2 (The International Conference and PhD-Master Summer School on Graphs and Groups, Representations and Relations)

Let $G$ be a $p$-group and let $\chi$ be an irreducible character of $G$. The codegree of $\chi$ is given by $|G:\text{ker}(\chi)|/\chi(1)$. If $G$ is a maximal class $p$-group that is normally monomial or has at most three character degrees then the codegrees of $G$ are consecutive powers of $p$. If $|G|=p^n$ and $G$ has consecutive $p$-power codegrees up to $p^{n-1}$ then the nilpotence class of $G$ is at most 2 or $G$ has maximal class.

Let $G$ be a finite group, $\pi$ be a set of primes, and define $H_{\pi}(G)$ to be the subgroup generated by all elements of $G$ which do not have prime order for every prime in $\pi$. In this paper, we investigate some basic properties of $H_{\pi}(G)$ and its relationship to the Hughes subgroup. We show that for most groups, only one of three possibilities occur: $H_{\pi}(G) = 1$, $H_{\pi}(G)=G$, or $H_{\pi}(G) = H_{p}(G)$ for some prime $p \in \pi$. There is only one other possibility: $G$ is a Frobenius group whose Frobenius complement has prime order $p$, and whose Frobenius kernel, $F$, is a nonabelian $q$-group such that $H_{\pi}(G)$ arises as a proper and nontrivial Hughes subgroup of $F$. We investigate a few restrictions on the possible choices of the primes $p$ and $q$., Comment: 6 pages, exposition

We enumerate the number of isoclinism classes of semi-extraspecial $p$-groups with derived subgroup of order $p^2$. To do this, we enumerate $\text{GL}(2, p)$-orbits of sets of irreducible, monic polynomials in $\mathbb{F}_p[x]$. Along the way, we also provide a new construction of an infinite family of semi-extraspecial groups as central quotients of Heisenberg groups over local algebras.

In this paper, we present a new method to construct solvable groups with derived length four and four character degrees. We then use this method to present a number of new families of groups with derived length four and four character degrees.

Let $p$ be a prime. A $p$-group $G$ is defined to be semi-extraspecial if for every maximal subgroup $N$ in $Z(G)$ the quotient $G/N$ is a an extraspecial group. In addition, we say that $G$ is ultraspecial if $G$ is semi-extraspecial and $|G:G'| = |G'|^2$. In this paper, we prove that every $p$-group of nilpotence class $2$ is isomorphic to a subgroup of some ultraspecial group. Given a prime $p$ and a positive integer $n$, we provide a framework to construct of all the ultraspecial groups order $p^{3n}$ that contain an abelian subgroup of order $p^{2n}$. In the literature, it has been proved that every ultraspecial group $G$ order $p^{3n}$ with at least two abelian subgroups of order $p^{2n}$ can be associated to a semifield. We provide a generalization of semifield, and then we show that every semi-extraspecial group $G$ that is the product of two abelian subgroups can be associated with this generalization of semifield.

We investigate prime character degree graphs of solvable groups that have six vertices. There are one hundred twelve non-isomorphic connected graphs with six vertices, of which all except nine are classified in this paper. We also completely classify the disconnected graphs with six vertices., Comment: 14 pages, 7 figures. arXiv admin note: text overlap with arXiv:1707.03020

We survey the results regarding semi-extraspecial $p$-groups. Semi-extraspecial groups can be viewed as generalizations of extraspecial groups. We present the connections between semi-extraspecial groups and Camina groups and VZ-groups, and give upper bounds on the order of the center and the orders of abelian normal subgroups. We define ultraspecial groups to be semi-extraspecial groups where the center is as large as possible, and demonstrate a connection between ultraspecial groups that have at least two abelian subgroups whose order is the maximum and semifields., Comment: Expository paper

Let $G$ be a finite solvable group, and let $p$ be a prime. In this note, we prove that $p$ does not divide $\varphi(1)$ for every irreducible monomial $p$-Brauer character $\varphi$ of $G$ if and only if $G$ has a normal Sylow $p$-subgroup., Comment: 3 page

A super-Brauer character theory of a group $G$ and a prime $p$ is a pair consisting of a partition of the irreducible $p$-Brauer characters and a partition of the $p$-regular elements of $G$ that satisfy certain properties. We classify the groups and primes that have exactly one super-Brauer character theory. We discuss the groups with exactly two super-Brauer character theories., Comment: 19 pages, 8 tables

Chillag has showed that there is a single generalization showing that the sums of ordinary character tables, Brauer character, and projective indecomposable characters are positive integers. We show that Chillag's construction also applies to Isaacs' $\pi$-partial characters. We show that if an extra condition is assumed, then we can obtain upper and lower bounds on the Chillag's table sums. We will demonstrate that this condition holds for Brauer characters, $\pi$-partial characters, and projective indecomposable characters, and so we obtain upper and lower bounds for the table sums in those cases. We also obtain results regarding the sums of rows and columns in these tables., Comment: 10 pages