Related papers: Primitive finite nilpotent linear groups over numb…

We provide a detailed structural description of the nilpotent primitive subgroups of $\mathrm{GL}(n, \mathbb{F})$, where $\mathbb{F}$ is a finite field.

In the paper we show that any irreducible representation of a finitely generated nilpotent group $G$ over a finitely generated field $F$ of characteristic zero is induced from a primitive representation of some subgroup of $G$.

We provide an explicit construction for a complete set of orthogonal primitive idempotents of finite group algebras over nilpotent groups. Furthermore, we give a complete set of matrix units in each simple epimorphic image of a finite group…

We survey aspects of locally nilpotent linear groups. Then we obtain a new classification; namely, we classify the irreducible maximal locally nilpotent subgroups of $\mathrm{GL}(q, \mathbb F)$ for prime $q$ and any field $\mathbb F$.

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…

In this paper, we establish the theory of nilpotent hypergroups and study some properties of nilpotent hypergroups and provided some structural characterizations of nilpotent hypergroups.

We survey recent progress in computing with finitely generated linear groups over infinite fields, describing the mathematical background of a methodology applied to design practical algorithms for these groups. Implementations of the…

We consider the problem of existence and enumeration of primitive TSRs of order n over any finite field. Here we prove the existence of primitive TSRs of order two over finite fields of characteristic two and establish an equivalence…

Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…

In this article we look into characterizing primitive groups in the following way. Given a primitive group we single out a subset of its generators such that these generators alone (the so-called primitive generators) imply the group is…

We classify finite non-solvable groups with a faithful primitive irreducible complex character that vanishes on a unique conjugacy class. Our results answer a question of Dixon and Rahnamai Barghi and suggest an extension of Burnside's…

We introduce and study some families of groups whose irreducible characters take values on quadratic extensions of the rationals. We focus mostly on a generalization of inverse semi-rational groups, which we call uniformly semi-rational…

Fix a field F. A zero-nonzero pattern A is said to be potentially nilpotent over F if there exists a matrix with entries in F with zero-nonzero pattern A that allows nilpotence. In this paper we initiate an investigation into which…

We establish a surprising correspondence between groups definable in o-minimal structures and linear algebraic groups, in the nilpotent case. It turns out that in the o-minimal context, like for finite groups, nilpotency is equivalent to…

We give a new proof of Fitzgerald's criterion for primitive polynomials over a finite field. Existing proofs essentially use the theory of linear recurrences over finite fields. Here, we give a much shorter and self-contained proof which…

We give a characterization of the finite groups having nilpotent or abelian Hall $\pi$-subgroups which can easily be verified from the character table.

We consider the problem of enumeration of primitive TSRs of order n over any finite field. Here we prove the existence of primitive TSRs of order two over binary field extensions. Moreover we give a general search algorithm for primitive…

Let $q$ be a prime power and $\mathbb F_{q^n}$ be the finite field with $q^n$ elements, where $n>1$. We introduce the class of the linearized polynomials $L(x)$ over $\mathbb F_{q^n}$ such that…

Working in a theory with an integer-valued dimension on interpretable sets, we classify pseudofinite definably primitive permutation groups acting on one-dimensional sets which satisfy a version of chain condition on centralizers and on…

We develop methods for computing with matrix groups defined over a range of infinite domains, and apply those methods to the design of algorithms for nilpotent groups. In particular, we provide a practical algorithm to test nilpotency of…