Related papers: Minimal embeddings of small finite groups

We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…

We augment the body of existing results on embedding finite semigroups of a certain type into 2-generator finite semigroups of the same type. The approach adopted applies to finite semigroups the idempotents of which form a band and also to…

We investigate group coding for arbitrary finite groups acting linearly on a vector space. These yield robust codes based on real or complex matrix groups. We give necessary and sufficient conditions for correct subgroup decoding using…

Let $d(G)$ be the minimum number of elements required to generated a group $G.$ For a group $G $ of order $p^n$ with derived subgroup of order $ p^k $ and $d(G) = d,$ we knew the order of the Schur multiplier of $G$ is bounded by $…

In this paper we discuss various aspects of the problem of determining the minimal dimension of an injective linear representation of a finite semigroup over a field. We outline some general techniques and results, and apply them to…

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…

The random ordered graph is the up to isomorphism unique countable homogeneous linearly ordered graph that embeds all finite linearly ordered graphs. We determine the reducts of the random ordered graph up to first-order interdefinability.

We prove that every minimal brick on n vertices has at least n/9 vertices of degree at most 4.

An L-shaped embedding of a tree in a point set is a planar drawing of the tree where the vertices are mapped to distinct points and every edge is drawn as a sequence of two axis-aligned line segments. There has been considerable work on…

We prove constructively that the maximum possible number of minimal connected dominating sets in a connected undirected graph of order $n$ is in $\Omega(1.489^n)$. This improves the previously known lower bound of $\Omega(1.4422^n)$ and…

The finite groups having an indecomposable polynomial invariant whose degree is at least half of the order of the group are classified. Apart from four sporadic exceptions these are exactly the groups having a cyclic subgroup of index at…

In this report we summarize this work, all finite simple groups $G$ can determined uniformly using their orders $|G|$ and the set $\pi_e(G)$ of their element orders.

In this paper we prove that a finite group of order $r$ has at most $$ 7.3722\cdot r^{\frac{\log_2r}{4}+1.5315}$$ subgroups.

Let $\Gamma$ be a totally ordered group. We use Hahn's embedding theorem to construct a totally ordered set $\Gamma\subset \Gamma_{\operatorname{sme}}$ which classifies small extensions of $\Gamma$. This small-extensions closure…

For a finite non cyclic group $G$, let $\gamma(G)$ be the smallest integer $k$ such that $G$ contains $k$ proper subgroups $H_1,\dots,H_k$ with the property that every element of $G$ is contained in $H_i^g$ for some $i \in \{1,\dots,k\}$…

The minimal faithful permutation degree of a finite group $G$, denote by $\mu(G)$ is the least non-negative integer $n$ such that $G$ embeds inside the symmetric group $\Sym(n)$. In this paper, we outline a Magma proof that 10 is the…

To a finite group $G$, one can associate several notions of dimensions (or degrees). In this survey, we attempt to bring together some of the notions of dimensions or degrees defined using representations of the group in General Linear…

We prove that every simple graph of order 12 which has minimum degree 6 contains a K_6 minor.

We provide new families of minimal codes in any characteristic. Also, an inductive construction of minimal codes is presented.

It is a long-standing open question to determine the minimum number of comparisons $S(n)$ that suffice to sort an array of $n$ elements. Indeed, before this work $S(n)$ has been known only for $n\leq 22$ with the exception for $n=16$, $17$,…