Related papers: Constructing solvable groups with derived length f…
For a character $\chi$ of a finite group $G$, the number cod$(\chi):=|G:\mathrm{ker}(\chi)|/\chi(1)$ is called the codegree of $\chi$.In this paper, we give a solvability criterion for a finite group $G$ depending on the minimum of the…
A recurring theme in finite group theory is understanding how the structure of a finite group is determined by the arithmetic properties of group invariants. There are results in the literature determining the structure of finite groups…
Let $ G $ be a finite group and $ \chi \in \mathrm{Irr}(G) $. Define $ \mathrm{cv}(G)=\{\chi(g)\mid \chi \in \mathrm{Irr}(G), g\in G \} $, $ \mathrm{cv}(\chi)=\{\chi(g)\mid g\in G \} $ and denote $ \mathrm{dl}(G) $ by the derived length of…
A finite group $G$ is $normally ~monomial$ if all its irreducible characters are induced from linear characters of normal subgroups of $G$. In this paper, we determine all possible irreducible character degree sets of normally monomial…
We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…
We are interested in the algebraic properties of groups of local biholomorphisms and their consequences. A natural question is whether the complexity of solvable groups is bounded by the dimension of the ambient space. In this spirit we…
We obtain a necessary condition for the character degree graph of a solvable group G to be Eulerian.
We discuss the structure of finite groups for which the projective indecomposable modules have special given dimensions. In particular, we prove the converse of Fong's dimension formula for $p$-solvable groups. Furthermore, we characterize…
We introduce frameworks for constructing global derived moduli stacks associated to a broad range of problems, bridging the gap between the concrete and abstract conceptions of derived moduli. Our three approaches are via differential…
The purpose of this article is to demonstrate that non-crystallographic reflection groups can be used to build new solvable quantum particle systems. We explicitly construct a one-parametric family of solvable four-body systems on a line,…
We enumerate the number of complex irreducible representations of each degree of general unitary groups of degree 4 over principal ideal rings of length 2.
A supercharacter theory for a finite group $G$ is a set of superclasses each of which is a union of conjugacy classes together with a set of sums of irreducible characters called supercharacters that together satisfy certain compatibility…
We restrict irreducible characters of alternating groups of degree divisible by $p$ to their Sylow $p$-subgroups and study the number of linear constituents.
We investigate the finite groups $G$ for which $\chi(1)^{2}=|G:Z(\chi)|$ for all characters $\chi \in Irr(G)$ and $|cd(G)|=2$, where $cd(G)=\{\chi(1)| \chi \in Irr(G)\}$. We call such a group a GVZ-group with two character degrees. We…
In this work we study and provide a full description, up to a finite index subgroup, of the dynamics of solvable complex Kleinian subgroups of PSL(3,C). These groups havesimpledynamics, contrary to strongly irre-ducible groups. Because of…
New heterotic string theories in four dimensions are constructed by tensoring a nonstandard SCFT along with some minimal SCFT's. All such theories are identified and their particle generation number is found. We prove that from the infinite…
We introduce a new approach to constructing derived deformation groupoids, by considering them as parameter spaces for strong homotopy bialgebras. This allows them to be constructed for all classical deformation problems, such as…
In this paper, we construct new families of convolutional codes. Such codes are obtained by means of algebraic geometry codes. Additionally, more families of convolutional codes are constructed by means of puncturing, extending, expanding…
We describe a procedure for generating families of cyclic cubic fields with explicit fundamental units. This method generates all known families and gives new ones.
The paper considers computable Folner sequences in computably enumerable amenable groups. We extend some basic results of M. Cavaleri on existence of such sequences to the case of groups where finite generation is not assumed. We also…