Related papers: Permutation Groups and Orbits on Power Sets

In this note we give some new results concerning the subgroup commutativity degree of a finite group $G$. These are obtained by considering the minimum of subgroup commutativity degrees of all sections of $G$.

For each element $u$ in a finite group $G$ define a map $\theta_u\colon G\to G$ by $\theta_u(g)=[g^{-u},g]$ and set $\Theta_G(u)=\{g\in G\mid \theta_u^n(g)=g \hbox{ for some } n>0\}$. Then $\theta_u$ induces a permutation of $\Theta_G(u)$;…

The permutation group $S_N$ has a quantum analogue $S_N^+$, which is infinite at $N\geq4$. We review the known facts regarding $S_N^+$, and notably its easiness property, Weingarten calculus, and the isomorphism $S_4^+=SO_3^{-1}$ and its…

Let $G$ be a permutation group, and denote with $\mu(G)$ and $b(G)$ its minimal degree and base size respectively. We show that for every $\varepsilon>0$, there exists a transitive permutation group $G$ of degree $n$ with \[ \mu(G)b(G) \geq…

Let $S_n$ denote the symmetric group of order $n$. Say that two subsets $x, y\subseteq S_n$ are \emph{equivalent} if there exist permutations $g_1, g_2\in S_n$ such that $g_1xg_2=y$, where multiplication is understood elementwise. Recently,…

In this paper we study different restrictions imposed over the set of permutations of size $n$, $S_n$, and for specific classes of restrictions study the cycle structure of corresponding permutations. More specifically, we prove that for…

A permutation group $G\le\operatorname{Sym}(\Omega)$ is said to be $2$-closed if no group $H$ such that $G<H\le\operatorname{Sym}(\Omega)$ has the same orbits on $\Omega\times\Omega$ as $G$. A simple and efficient inductive criterion for…

We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…

A classical theorem of Jordan asserts that if a group $G$ acts transitively on a finite set of size at least $2$, then $G$ contains a derangement (a fixed-point free element). Generalisations of Jordan's theorem have been studied…

In this paper we study finite semiprimitive permutation groups, that is, groups in which each normal subgroup is transitive or semiregular. We give bounds on the order, base size, minimal degree, fixity, and chief length of an arbitrary…

Which subgroups of the symmetric group S_n arise as invariance groups of n-variable functions defined on a k-element domain? It appears that the higher the difference n-k, the more difficult it is to answer this question. For k>=n, the…

Let G,H be closed permutation groups on an infinite set X, with H a subgroup of G. It is shown that if G and H are orbit-equivalent, that is, have the same orbits on the collection of finite subsets of X, and G is primitive but not…

We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group…

We show that the minimal base size $b(G)$ of a finite primitive permutation group $G$ of degree $n$ is at most $2 (\log |G|/\log n) + 24$. This bound is asymptotically best possible since there exists a sequence of primitive permutation…

Let $\mathcal{F}_n(X;G)$ denote the set of number fields of degree $n$ with absolute discriminant no larger than $X$ and Galois group $G$. This set is known to be finite for any finite permutation group $G$ and $X \geq 1$. In this paper, we…

We prove that most permutations of degree $n$ have some power which is a cycle of prime length approximately $\log n$. Explicitly, we show that for $n$ sufficiently large, the proportion of such elements is at least $1-5/\log\log n$ with…

Let $G$ be a nontrivial permutation group of degree $n$. If $G$ is transitive, then a theorem of Jordan states that $G$ has a derangement. Equivalently, a finite group is never the union of conjugates of a proper subgroup. If $G$ is…

We consider the permutation group algebra defined by Cameron and show that if the permutation group has no finite orbits, then no homogeneous element of degree one is a zero-divisor of the algebra. We proceed to make a conjecture which…

We obtain an asymptotic upper bound for the product of the $p$-parts of the orders of certain composition factors of a finite group acting completely reducibly and faithfully on a finite vector space of order divisible by a prime $p$. An…

If k is a commutative field and G a reductive (connected) algebraic group over k, we give bounds for the orders of the finite subgroups of G(k); these bounds depends on the type of G and on the Galois groups of the cyclotomic extensions of…