Related papers: Identifying Cartesian decompositions preserved by …
We study permutations on n elements preserving orientation (parity) of every subset of size k. We describe all groups of these permutations. Unexpectedly, these groups (except for some special cases) are either trivial, cyclic or dihedral.…
We introduce a notion of permutation presentations of modules over finite groups, and completely determine finite groups over which every module has a permutation presentation. To get this result, we prove that every coflasque module over a…
The goal of invariant theory is to find all the generators for the algebra of representations of a group that leave the group invariant. Such generators will be called \emph{basic invariants}. In particular, we set out to find the set of…
This paper is dedicated to the problem of infinite transitivity for algebraically generated automorphism groups of the affine plane. We provide a necessary and sufficient condition of infinite transitivity for a large family of subgroups…
We design an algorithm to find certain partial permutation representations of a finitely presented group $G$ (the bricks) that may be combined to a transitive permutation representation of $G$ (the mosaic) on the disjoint union.
It is proven that the identity component of the group preserving the leaves of a generalized foliation is perfect. This shows that a well-known simplicity theorem on the diffeomorphism group extends to the nontransitive case.
The aim of this paper is to survey some aspects of mapping class groups with focus on their finite dimensional representations arising in topological quantum field theory.
We construct here the first known examples of non-split sharply 2-transitive groups of bounded exponent in odd positive characteristic for every large enough prime $p \equiv 3 \pmod{4}$. In fact, we show that there are countably many…
In this article we look into characterizing primitive groups in the following way. Given a primitive group we single out a subset of its generators such that these generators alone (the so-called primitive generators) imply the group is…
A linear group G on a finite vector space V, (that is, a subgroup of GL(V)) is called (1/2)-transitive if all the G-orbits on the set of nonzero vectors have the same size. We complete the classification of all the (1/2)-transitive linear…
It is shown, from $\sigma$-centered Martin's Axiom, that there exists a proper dense subgroup of the symmetric group on a countably infinite set whose natural action on sufficiently flexible relational structures is transitive. This allows…
A decreasing Cartesian code is defined by evaluating a monomial set closed under divisibility on a Cartesian set. Some well-known examples are the Reed-Solomon, Reed-Muller, and (some) toric codes. The affine permutations consist of the…
Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…
We extend the usual notion of fully commutative elements from the Coxeter groups to the complex reflection groups. Then we decompose the sets of fully commutative elements into natural subsets according to their combinatorial properties,…
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…
We formulate and prove relative versions of several classical decompositions known in the theory of Chevalley groups over commutative rings. As an application we obtain upper estimates for the width of principal congruence subgroups in…
The goal of this paper is to study primitive groups that are contained in the union of maximal (in the symmetric group) imprimitive groups. The study of types of permutations that appear inside primitive groups goes back to the origins of…
We study $6$-transposition groups, i.e. groups generated by a normal set of involutions $D$, such that the order of the product of any two elements from $D$ does not exceed $6$. We classify most of the groups generated by $3$ elements from…
A transitive permutation group is said to be semiprimitive if each of its normal subgroups is either semiregular or transitive.The class of semiprimitive groups properly contains primitive groups, quasiprimitive groups and innately…
A notion of a quantum automorphism group of a finite quantum group, generalising that of a classical automorphism group of a finite group, is proposed and a corresponding existence result proved.