Related papers: The maximum cardinality of minimal inversion compl…

We investigate the indicators for certain groups of the form $\BZ_k\rtimes D_l$ and their doubles, where $D_l$ is the dihedral group of order $2l$. We subsequently obtain an infinite family of totally orthogonal, completely real groups…

Any maximal root subsystem of a finite crystallographic reduced root system is either a closed root subsystem or its dual is a closed root subsystem in the dual root system. In this article, we classify the maximal root subsystems of an…

A minimal permutation representation of a finite group G is a faithful G-set with the smallest possible size. We study the structure of such representations and show that for certain groups they may be obtained by a greedy construction. In…

In this paper we give a different approach to determining the cardinality of $h$-fold sumsets $hA$ when $A\subset \mathbb{Z}^d$ has $d+2$ elements. This enables us to provide more general result with a shorter and simpler proof. We also…

Let $d \geq 2$ be an integer. We conjecture that there is a finitely generated perfect group whose homomorphic images include all finite $d$-generated perfect groups. We prove a special case of this conjecture for the finite perfect groups…

We describe the endomorphism ring of a short exact sequences $0 \to A_R \to B_R \to C_R \to 0$ with $A_R$ and $C_R$ uniserial modules and the behavior of these short exact sequences as far as their direct sums are concerned.

In this paper we compute the minimum degree of a faithful representation by partial transformations of a finite semigroup admitting a faithful completely reducible matrix representation over the field of complex numbers. This includes all…

Let $(G, +)$ be an abelian group. In 2004, Eliahou and Kervaire found an explicit formula for the smallest possible cardinality of the sumset $A+A$, where $A \subseteq G$ has fixed cardinality $r$. We consider instead the smallest possible…

The classical Hurwitz numbers count the fixed-length transitive transposition factorizations of a permutation, with a remarkable product formula for the case of minimum length (genus $0$). We study the analogue of these numbers for…

Given an ideal of forms in an algebra (polynomial ring, tensor algebra, exterior algebra, Lie algebra, bigraded polynomial ring), we consider the Hilbert series of the factor ring. We concentrate on the minimal Hilbert series, which is…

This is the first of a series of papers in which we initiate and develop the theory of reflection monoids, motivated by the theory of reflection groups. The main results identify a number of important inverse semigroups as reflection…

We give a classification of maximal elements of the set of finite groups that can be realized as the automorphism groups of polarized abelian threefolds over finite fields.

We present a simple formula for the expected number of inversions in a permutation of size $n$ obtained by applying $t$ random (not necessarily adjacent) transpositions to the identity permutation. More general, for any finite irreducible…

The deficiency of a group is the maximum over all presentations for that group of the number of generators minus the number of relators. Every finite group has non-positive deficiency. We show that every non-positive integer is the…

Complex reflection groups of rank two are precisely the finite groups in the family of groups that we call J-reflection groups. These groups are particular cases of J-groups as defined by Achar & Aubert in 2008. The family of J-reflection…

Strongly bounded groups are those groups for which every action by isometries on a metric space has orbits of finite diameter. Many groups have been shown to have this property, and all the known infinite examples so far have cardinality at…

In this paper we explicitly determine all indicators for groups isomorphic to the semidirect product of two cyclic groups by an automorphism of prime order, as well as the generalized quaternion groups. We then compute the indicators for…

By using the structure and some properties of extraspecial and generalized/almost extraspecial $p$-groups, we explicitly determine the number of elements of specific orders in such groups. As a consequence, one may find the number of cyclic…

Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $D\subseteq V$ such that every vertex not in $D$ is adjacent to at least one vertex in $D$. The cardinality of a smallest dominating set of $G$, denoted by $\gamma(G)$, is…

For a finite group $G$, let $d(G)$ denote the minimal number of elements required to generate $G$. In this paper, given a finite almost simple group $G$ and any maximal subgroup $H$ of $G$, we determine a precise upper bound for $d(H)$. In…