Related papers: Generating minimally transitive permutation groups

Necessary and sufficient conditions for finite commutative semihypergroups to be built from abelian groups of the same order are established.

We examine the subgroup $D(G)$ of a transitive permutation group $G$ which is generated by the derangements in $G$. Our main results bound the index of this subgroup: we conjecture that, if $G$ has degree $n$ and is not a Frobenius group,…

Let $G$ be a countable infinite amenable group and $P$ be a polyhedron. We give a construction of minimal subshifts of $P^G$ with arbitrarily mean topological dimension less than $\dim P$.

In this paper, we introduce a novel approach for generating random elements of a finite group given a set of generators of that. Our method draws upon combinatorial group theory and automata theory to achieve this objective. Furthermore, we…

Let G be a group. We say that G has spread r if for any set of distinct elements {x1,..., xr}\subset G there exists an element y\in G with the property that <xi, y>=G for every 0<i<r+1. Few bounds on the spread of finite simple groups are…

We improve the lower bound on the number of permutations of {1,2,...,n} in which no 3-term arithmetic progression occurs as a subsequence, and derive lower bounds on the upper and lower densities of subsets of the positive integers that can…

We improve by an exponential factor the lower bound of Korner and Muzi for the cardinality of the largest family of Hamilton paths in a complete graph of n vertices in which the union of any two paths has degree 4. The improvement is…

We study groups generated by sets of pattern avoiding permutations. In the first part of the paper we prove some general results concerning the structure of such groups. In the second part we carry out a case-by-case analysis of groups…

We indicate a natural generalization of the concept of subgroup commutativity degree of a finite group and a list of open problems on these new concepts.

The minimal degree of a permutation group $G$ is the minimum number of points not fixed by non-identity elements of $G$. Lower bounds on the minimal degree have strong structural consequences on $G$. In 2014 Babai proved that the…

Let $d(G)$ be the smallest cardinality of a generating set of a finite group $G.$ We give a complete classification of the finite groups with the property that, whenever $ \langle x_1, \dots, x_{d(G)} \rangle = \langle y_1, \dots, y_{d(G)}…

We establish a sufficient condition for a finitely generated pro-$p$ group to be accessible in terms of finite generation of the module of ends.

The relative commutativity degree of a subgroup $H$ of a finite group $G$, denoted by $\Pr(H, G)$, is the probability that an element of $G$ commutes with an element of $H$. In this article we obtain some lower and upper bounds for $\Pr(H,…

We prove a new upper bound on the essential p-dimension of the projective linear group PGLn.

We give upper bounds on the order of the automorphism group of a simple graph

We establish the existence of maximal subgroups of various diferent natures in SL(n,Z). In particular, we prove that there are continuously many maximal subgroups, we provide a maximal subgroup whose action on the projective space has no…

We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of…

The transitivity degree of a group $G$ is the supremum of all integers $k$ such that $G$ admits a faithful $k$-transitive action. Few obstructions are known to impose an upper bound on the transitivity degree for infinite groups. The…

Given a prime $p$, we construct a permutation group containing at least $p^{p-2}$ non-conjugated regular elementary abelian subgroups of order $p^3$. This gives the first example of a permutation group with exponentially many non-conjugated…

For a positive integer $n$, the full transformation semigroup $T_n$ consists of all self maps of the set $\{1,\ldots,n\}$ under composition. Any finite semigroup $S$ embeds in some $T_n$, and the least such $n$ is called the (minimum…