Related papers: Permutation groups generated by binomials
The second author introduced notions of weak permutability and commutativity between groups and proved the finiteness of a group generated by two weakly permutable finite groups. Two groups H,K weakly commute provided there exists a…
The use of permutation polynomials has appeared, along to their compositional inverses, as a good choice in the implementation of cryptographic systems. Hence, there has been a demand for constructions of these polynomials which…
Let J be a finite-dimensional nilpotent algebra over a finite field F_q. We formulate a procedure for analysing characters of the group 1+J. In particular, we study characters of the group $U_n (q)$ of unipotent triangular $n\times n$…
For any finite group Q not of prime power order, we construct a group G that is virtually of type F, contains infinitely many conjugacy classes of subgroups isomorphic to Q, and contains only finitely many conjugacy classes of other finite…
We prove that the generalised Fibonacci group F(r,n) is infinite for (r,n) in {(7 + 5k,5), (8 + 5k,5)} where k is greater than or equal to 0. This together with previously known results yields a complete classification of the finite F(r,n),…
We show that a large multiplicative subgroup of a finite field $\mathbb{F}_q$ cannot be decomposed into $A+A$ or $A+B+C$ nontrivially. We also find new families of multiplicative subgroups that cannot be decomposed as the sum of two sets…
We complete the classification of the finite special linear groups $\SL_n(q)$ which are $(2,3)$-generated, i.e., which are generated by an involution and an element of order $3$. This also gives the classification of the finite simple…
We study multiplicities of unipotent characters in tensor products of unipotent characters of GL(n,q). We prove that these multiplicities are polynomials in q with non-negative integer coefficients. We study the degree of these polynomials…
Let G be any abelian group and {a_sG_s}_{s=1}^k be a finite system of cosets of subgroups G_1,...,G_k. We show that if {a_sG_s}_{s=1}^k covers all the elements of G at least m times with the coset a_tG_t irredundant then [G:G_t]\le 2^{k-m}…
Many finite groups, including all finite non-abelian simple groups, can be symmetrically generated by involutions. In this paper we give an algorithm to symmetrically represent elements of finite groups and to transform symmetrically…
We prove that if $G$ is a finite simple group, then all irreducible complex representations of $G$ by be realized over the real numbers if and only if every element of $G$ may be written as a product of two involutions in $G$. This follows…
We first give a short group theoretic proof of the following result of Lackenby. If $G$ is a large group, $H$ is a finite index subgroup of $G$ admitting an epimorphism onto a non--cyclic free group, and $g$ is an element of $H$, then the…
We prove that Chevalley groups over polynomial rings $\mathbb F_q[t]$ and over Laurent polynomial $\mathbb F_q[t,t^{-1}]$ rings, where $\mathbb F_q$ is a finite field, are boundedly elementarily generated. Using this we produce explicit…
Motivated by a problem in quantum field theory, we study the up and down structure of circular and linear permutations. In particular, we count the length of the (alternating) runs of permutations by representing them as monomials and find…
A 2-covering for a finite group $G$ is a set of proper subgroups of $G$ such that every pair of elements of $G$ is contained in at least one subgroup in the set. The minimal number of subgroups needed to 2-cover a group $G$ is called the…
This thesis addresses questions in representation and invariant theory of finite groups. The first concerns singularities of quotient spaces under actions of finite groups. We introduce a class of finite groups such that the quotients have…
We construct four new classes of permutation trinomials over the cubic extension of a finite field with even characteristic. Additionally, we explicitly provide the compositional inverse of each class of permutation trinomials in polynomial…
It is shown that any finitely generated non-elementary Fuchsian group has among its homomorphic images all but finitely many of the alternating groups. This settles in the affirmative a conjecture of Graham Higman.
Let ${\bf G}$ be a connected reductive group over $\bar{\mathbb{F}}_q$, the algebraically closure of $\mathbb{F}_q$ (the finite field with $q=p^e$ elements), with the standard Frobenius map $F$. Let ${\bf B}$ be an $F$-stable Borel…
In this paper, we consider the construction of irreducible representations of finite pattern groups in terms of Panov's associative polarization, which is a finite-field analogue of Kirillov's orbital method. Using this construction, first,…