Related papers: Permutation groups on countable vector spaces over…

Let $A$ and $G$ be finite groups such that $A$ acts coprimely on $G$ by automorphisms, we first prove some results on the solvability of finite groups in which some maximal $A$-invariant subgroups have indices a prime or the square of a…

In this paper we describe graded automorphisms and antiautomorphisms of finite order on matrix algebras endowed with a group gradings by a finite abelian group over an arbitrary algebraically closed field of charcteristic different from 2.

In this paper we give an algorithm to determine all finite matrix groups over a number field. Our algorithm is based on the representation theory of finite groups.

We characterize finite groups G generated by orthogonal transformations in a finite-dimensional Euclidean space V whose fixed point subspace has codimension one or two in terms of the corresponding quotient space V/G with its quotient…

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…

Given a permutation group $G$ on a finite set $\Omega$, let $G^{(k)}$ denote the $k$-closure of $G$, that is, the largest permutation group on $\Omega$ having the same orbits in the induced action on $\Omega^k$ as $G$. Recall that a group…

Let $G$ be a transitive permutation group on a finite set of size at least $2$. By a well known theorem of Fein, Kantor and Schacher, $G$ contains a derangement of prime power order. In this paper, we study the finite primitive permutation…

An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.

Recently it has been shown that all non-trivial closed permutation groups containing the automorphism group of the random poset are generated by two types of permutations: the first type are permutations turning the order upside down, and…

In this article we define $G$-algebras, that is, graded algebras on which a reductive group $G$ acts as gradation preserving automorphisms. Starting from a finite dimensional $G$-module $V$ and the polynomial ring $\mathbb{C}[V]$, it is…

A general theory of permutation orbifolds is developed for arbitrary twist groups. Explicit expressions for the number of primaries, the partition function, the genus one characters, the matrix elements of modular transformations and for…

We define, for any group $G$, finite approximations ; with this tool, we give a new presentation of the profinite completion $\hat{\pi} : G \to \hat{G}$ of an abtract group $G$. We then prove the following theorem : if $k$ is a finite prime…

Comparability graphs are graphs which have transitive orientations. The dimension of a poset is the least number of linear orders whose intersection gives this poset. The dimension ${\rm dim}(X)$ of a comparability graph $X$ is 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…

For an arbitrary finite permutation group $G$, subgroup of the symmetric group $S_\ell$, we determine the permutations involving only members of $G$ as $\ell$-patterns, i.e., avoiding all patterns in the set $S_\ell \setminus G$. The set of…

Let $\mathbb{F}_q$ denote the finite fields with $q$ elements. The permutation behavior of several classes of infinite families of permutation polynomials over finite fields have been studied in recent years. In this paper, we continue with…

The motion of a graph is the minimum number of vertices that are moved by a non-trivial automorphism. Equivalently, it can be defined as the minimal degree of its automorphism group (as a permutation group on the vertices). In this paper we…

For every prime $p$, we construct an infinite countable group that contains precisely $p-1$ elements which are not $p$th powers.

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…

Any knot group is the image of the group of a prime knot by a homomorphism that preserves peripheral structure. In fact, there are infinitely many such prime knots. A related partial order on knots is defined, and its properties are…