Orbit equivalence and permutation groups defined by unordered relations. (Q424390): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / review text | |||
Let \(\Omega\) be a finite set. A subset \(R\) of the power set \(P(\Omega)\) is called an unordered relation, and the group preserving \(R\) is defined to be \(\mathcal G(R):=\{g\in\mathrm{Sym}(\Omega)\mid x^g\in R\text{ for all }x\in R\}\) [see \textit{D. Betten}, Mitt. Math. Ges. Hamb. 10, 317-324 (1977; Zbl 0425.20030)]. A group of the form \(G=\mathcal G(R)\) for some unordered relation \(R\) is called a relation group. This paper is an extension of the report [the authors, in Ischia group theory 2008. Proceedings of the conference in group theory, Naples, Italy 2008. Hackensack: World Scientific. 56-67 (2009; Zbl 1208.20001)] characterizing relation groups. A set \(x\in P(\Omega)\) is called a regular set for \(G\leq\mathrm{Sym}(\Omega)\) if the setwise stabilizer of \(x\) equals \(1\), and \(G\) is called orbit closed if the only permutations which leave the orbits of \(G\) set-wise fixed are those which lie in \(G\). The following Basic Lemma is proved: suppose \(H\leq\mathrm{Sym}(\Omega)\) has a regular set \(w\) and either (i) \(H=\mathcal G(R)\) for some \(R\) such that no subset in \(R\) has size \(|w|\), or (ii) \(H\) is not set-transitive but every subgroup of \(\mathrm{Sym}(\Omega)\) properly containing \(H\) is set-transitive; then each subgroup of \(H\) is a relation group and is orbit closed. Using this the authors show that a primitive group \(G\leq\mathrm{Sym}(\Omega)\) is a relation group if and only if it is orbit closed, and that the only cases where \(G\) is not a relation group are when \(G=\mathrm{Alt}(\Omega)\) or \(|\Omega|\leq 10\) (the exceptional cases of small degree are listed). The situation for imprimitive groups is less clear cut, but there is a sense in which most imprimitive groups are relation groups, and the authors give various criteria for this to happen. The classification [Bull. Lond. Math. Soc. 29, No. 6, 697-704 (1997; Zbl 0892.20002)] by \textit{Á. Seress} of primitive groups which contain no regular set plays a crucial role in the proofs. | |||
Property / review text: Let \(\Omega\) be a finite set. A subset \(R\) of the power set \(P(\Omega)\) is called an unordered relation, and the group preserving \(R\) is defined to be \(\mathcal G(R):=\{g\in\mathrm{Sym}(\Omega)\mid x^g\in R\text{ for all }x\in R\}\) [see \textit{D. Betten}, Mitt. Math. Ges. Hamb. 10, 317-324 (1977; Zbl 0425.20030)]. A group of the form \(G=\mathcal G(R)\) for some unordered relation \(R\) is called a relation group. This paper is an extension of the report [the authors, in Ischia group theory 2008. Proceedings of the conference in group theory, Naples, Italy 2008. Hackensack: World Scientific. 56-67 (2009; Zbl 1208.20001)] characterizing relation groups. A set \(x\in P(\Omega)\) is called a regular set for \(G\leq\mathrm{Sym}(\Omega)\) if the setwise stabilizer of \(x\) equals \(1\), and \(G\) is called orbit closed if the only permutations which leave the orbits of \(G\) set-wise fixed are those which lie in \(G\). The following Basic Lemma is proved: suppose \(H\leq\mathrm{Sym}(\Omega)\) has a regular set \(w\) and either (i) \(H=\mathcal G(R)\) for some \(R\) such that no subset in \(R\) has size \(|w|\), or (ii) \(H\) is not set-transitive but every subgroup of \(\mathrm{Sym}(\Omega)\) properly containing \(H\) is set-transitive; then each subgroup of \(H\) is a relation group and is orbit closed. Using this the authors show that a primitive group \(G\leq\mathrm{Sym}(\Omega)\) is a relation group if and only if it is orbit closed, and that the only cases where \(G\) is not a relation group are when \(G=\mathrm{Alt}(\Omega)\) or \(|\Omega|\leq 10\) (the exceptional cases of small degree are listed). The situation for imprimitive groups is less clear cut, but there is a sense in which most imprimitive groups are relation groups, and the authors give various criteria for this to happen. The classification [Bull. Lond. Math. Soc. 29, No. 6, 697-704 (1997; Zbl 0892.20002)] by \textit{Á. Seress} of primitive groups which contain no regular set plays a crucial role in the proofs. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: John D. Dixon / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20B05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20B25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20B15 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6040136 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
unordered relations | |||
Property / zbMATH Keywords: unordered relations / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
closed permutation groups | |||
Property / zbMATH Keywords: closed permutation groups / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
set-transitive groups | |||
Property / zbMATH Keywords: set-transitive groups / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
regular sets | |||
Property / zbMATH Keywords: regular sets / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
orbit closed groups | |||
Property / zbMATH Keywords: orbit closed groups / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
imprimitive permutation groups | |||
Property / zbMATH Keywords: imprimitive permutation groups / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2093678272 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1010.3536 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Symmetry breaking in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Primitive \(k\)-free permutation groups. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Set-Transitive Permutation Groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3859994 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On groups with no regular orbits on the set of subsets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Regular sets for the affine and projective groups over the field of two elements / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Regular orbits for projective orthogonal groups over finite fields of odd characteristic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Trivial Set-Stabilizers in Finite Permutation Groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Regular sets and geometric groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3754159 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Symmetry groups of Boolean functions and constructions of permutation groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Distinguishing number of countable homogeneous relational structures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the orders of primitive groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Primitive Groups with no Regular Orbits on the Set of Subsets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3545342 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On partitions and permutation groups on unordered sets / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 07:36, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Orbit equivalence and permutation groups defined by unordered relations. |
scientific article |
Statements
Orbit equivalence and permutation groups defined by unordered relations. (English)
0 references
1 June 2012
0 references
Let \(\Omega\) be a finite set. A subset \(R\) of the power set \(P(\Omega)\) is called an unordered relation, and the group preserving \(R\) is defined to be \(\mathcal G(R):=\{g\in\mathrm{Sym}(\Omega)\mid x^g\in R\text{ for all }x\in R\}\) [see \textit{D. Betten}, Mitt. Math. Ges. Hamb. 10, 317-324 (1977; Zbl 0425.20030)]. A group of the form \(G=\mathcal G(R)\) for some unordered relation \(R\) is called a relation group. This paper is an extension of the report [the authors, in Ischia group theory 2008. Proceedings of the conference in group theory, Naples, Italy 2008. Hackensack: World Scientific. 56-67 (2009; Zbl 1208.20001)] characterizing relation groups. A set \(x\in P(\Omega)\) is called a regular set for \(G\leq\mathrm{Sym}(\Omega)\) if the setwise stabilizer of \(x\) equals \(1\), and \(G\) is called orbit closed if the only permutations which leave the orbits of \(G\) set-wise fixed are those which lie in \(G\). The following Basic Lemma is proved: suppose \(H\leq\mathrm{Sym}(\Omega)\) has a regular set \(w\) and either (i) \(H=\mathcal G(R)\) for some \(R\) such that no subset in \(R\) has size \(|w|\), or (ii) \(H\) is not set-transitive but every subgroup of \(\mathrm{Sym}(\Omega)\) properly containing \(H\) is set-transitive; then each subgroup of \(H\) is a relation group and is orbit closed. Using this the authors show that a primitive group \(G\leq\mathrm{Sym}(\Omega)\) is a relation group if and only if it is orbit closed, and that the only cases where \(G\) is not a relation group are when \(G=\mathrm{Alt}(\Omega)\) or \(|\Omega|\leq 10\) (the exceptional cases of small degree are listed). The situation for imprimitive groups is less clear cut, but there is a sense in which most imprimitive groups are relation groups, and the authors give various criteria for this to happen. The classification [Bull. Lond. Math. Soc. 29, No. 6, 697-704 (1997; Zbl 0892.20002)] by \textit{Á. Seress} of primitive groups which contain no regular set plays a crucial role in the proofs.
0 references
unordered relations
0 references
closed permutation groups
0 references
set-transitive groups
0 references
regular sets
0 references
orbit closed groups
0 references
imprimitive permutation groups
0 references
0 references