Related papers: Groups of permutations that are even on maximal pr…

Let $\Omega_n$ be a finite chain with $n$ elements $(n\in\mathbb{N})$, and let $\mathcal{POPI}_{n}$ be the semigroup of all injective orientation-preserving partial transformations of $\Omega_n$. In this paper, for any nonempty subset $Y$…

For a group $G$ and a finite set $A$, denote by $\text{CA}(G;A)$ the monoid of all cellular automata over $A^G$ and by $\text{ICA}(G;A)$ its group of units. We study the minimal cardinality of a generating set, known as the rank, of…

Let $\mathcal{PORD}_{n}$ be the semigroup consisting of all oriented and order-decreasing partial transformations on the finite chain $X_{n}=\{ 1<\cdots<n \}$. Let $\mathcal{IORD}_{n}$ be the subsemigroup of $\mathcal{PORD}_{n}$ consisting…

There is an established bijection between finite-index subgroups Gamma of Gamma(2) and bipartite graphs on surfaces, or, equivalently, certain triples of permutations. We utilize this relationship to study both congruence and noncongruence…

The purpose of this paper is to prove that if $G$ is a transitive permutation group of degree $n\geq 2$, then $G$ can be generated by $\lfloor cn/\sqrt{\log{n}}\rfloor$ elements, where $c:=\sqrt{3}/2$. Owing to the transitive group…

The regular objects in various categories, such as maps, hypermaps or covering spaces, can be identified with the normal subgroups N of a given group \Gamma, with quotient group isomorphic to \Gamma/N. It is shown how to enumerate such…

Let $\sigma$ be a permutation on $n$ letters. We say that a permutation $\tau$ is an even (resp. odd) $k$th root of $\sigma$ if $\tau^k=\sigma$ and $\tau$ is an even (resp. odd) permutation. In this article, we obtain generating functions…

Let $G$ be a permutation group of degree $n$ and let $s(G)$ denote the number of set-orbits of $G$. We determine $\inf(\frac {\log_2 s(G)} n)$ over all groups $G$ that satisfy certain restrictions on composition factors (i.e. $Alt(k), k >…

We give a 1-sided randomised algorithm to detect when a permutation group of degree n, given by generators, contains the alternating group of degree n. This improves on standard methods, and on an algorithm of P. Cameron and J. Cannon.

Let S_n be the set of all permutations on [n]:={1,2,....,n}. We denote by kappa_n the smallest cardinality of a subset A of S_{n+1} that "covers" S_n, in the sense that each pi in S_n may be found as an order-isomorphic subsequence of some…

For a semigroup $S$ whose universal right congruence is finitely generated (or, equivalently, a semigroup satisfying the homological finiteness property of being type right-$FP_1$), the right diameter of $S$ is a parameter that expresses…

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 construct for $d\geq 2$ and $\epsilon>0$ a $d$-generated $p$-group $\Gamma$, which in an asymptotic sense behaves almost like a $d$-generated free pro-$p$-group. We show that a subgroup of index $p^n$ needs $(d-\epsilon)p^n$ generators,…

For $n \geq 2$ let $\Delta$ be a Dynkin diagram of rank $n$ and let $I = {1, >..., n}$ be the set of labels of $\Delta$. A group $G$ admits a weak Phan system of type $\Delta$ over $\mathbb{C}$ if $G$ is generated by subgroups $U_i$, $i \in…

A totally symmetric set is a subset of a group such that every permutation of the subset can be realized by conjugation in the group. The (non-)existence of large totally symmetric sets obstruct homomorphisms, so bounds on the sizes of…

Let $\Gamma$ be a finite group, let $\theta$ be an involution of $\Gamma$, and let $\rho$ be an irreducible complex representation of $\Gamma$. We bound $\dim \rho^{\Gamma^{\theta}}$ in terms of the smallest dimension of a faithful…

Let $G_n$ be the group of permutations on $\mathbb{Z}_n$ that is induced by a Dickson polynomial, where $n$ is a positive integer. In this work, by solving special types of systems of linear congruences, we obtain $G_n$. In addition, we…

This paper discusses the permutations that are generated by rotating $k \times k$ blocks of squares in a union of overlapping $k \times (k+1)$ rectangles. It is found that the single-rotation parity constraints effectively determine the…

Let $g$, $h$ be a random pair of generators of $G=Sym(n)$ or $G=Alt(n)$. We show that, with probability tending to $1$ as $n\to \infty$, (a) the diameter of $G$ with respect to $S = \{g,h,g^{-1},h^{-1}\}$ is at most $O(n^2 (\log n)^c)$, and…

We define a deterministic family of permutations generated by an alternating center-edge extraction process on the ordered set [n] = {1,2,...,n}. Starting from the ordered list (1,2,...,n), one repeatedly removes the median element or…