2010/10/18 by Francesca Dalla Volta, Volta, F. Dalla, Johannes Siemons +1
Computer Science · Engineering · Mathematics · #FOS: Mathematics #Finite Group Theory Research #Graph Labeling and Dimension Problems #Group Theory (math.GR) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1010.3536
openalex publication_date 2010/10/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
For a set Ω an unordered relation on Ω is a family R of subsets of Ω. If R is such a relation we let G(R) be the group of all permutations on Ω that preserves R, that is g belongs to G(R) if and only if x in R implies xg∈ R. We are interested in permutation groups which can be represented as G=G(R) for a suitable unordered relation R on Ω. When this is the case, we say that G is defined by the relation R, or that G is a relation group. We prove that a primitive permutation group different from the Alternating Group and of degree bigger or equal to 11 is a relation groups. The same is true for many classes of finite imprimitive groups, and we give general conditions on the size of blocks of imprmitivity, and the groups induced on such blocks, which guarantee that the group is defined by a relation. This property is closely connected to the orbit closure of permutation groups. Since relation groups are orbit closed the results here imply that many classes of imprimitive permutation groups are orbit closed.