To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

Multiply transitive group action

From Wikipedia, the free encyclopedia

A group acts 2-transitively on a set if it acts transitively on the set of distinct ordered pairs . That is, assuming (without a real loss of generality) that acts on the left of , for each pair of pairs with and , there exists a such that .

The group action is sharply 2-transitive if such is unique.

A 2-transitive group is a group such that there exists a group action that's 2-transitive and faithful. Similarly we can define sharply 2-transitive group.

Equivalently, and , since the induced action on the distinct set of pairs is .

The definition works in general with k replacing 2. Such multiply transitive permutation groups can be defined for any natural number k. Specifically, a permutation group G acting on n points is k-transitive if, given two sets of points a1, ... ak and b1, ... bk with the property that all the ai are distinct and all the bi are distinct, there is a group element g in G which maps ai to bi for each i between 1 and k. The Mathieu groups are important examples.

Examples

Every group is trivially 1-transitive, by its action on itself by left-multiplication.

Let be the symmetric group acting on , then the action is sharply n-transitive.

The group of n-dimensional homothety-translations acts 2-transitively on .

The group of n-dimensional projective transforms almost acts sharply (n+2)-transitively on the n-dimensional real projective space . The almost is because the (n+2) points must be in general linear position. In other words, the n-dimensional projective transforms act transitively on the space of projective frames of .

Classifications of 2-transitive groups

Every 2-transitive group is a primitive group, but not conversely. Every Zassenhaus group is 2-transitive, but not conversely. The solvable 2-transitive groups were classified by Bertram Huppert and are described in the list of transitive finite linear groups. The insoluble groups were classified by (Hering 1985) using the classification of finite simple groups and are all almost simple groups.

See also

References

  • Dixon, John D.; Mortimer, Brian (1996), Permutation groups, Graduate Texts in Mathematics, vol. 163, Berlin, New York: Springer-Verlag, ISBN 978-0-387-94599-6, MR 1409812
  • Hering, Christoph (1985), "Transitive linear groups and linear groups which contain irreducible subgroups of prime order. II", Journal of Algebra, 93 (1): 151–164, doi:10.1016/0021-8693(85)90179-6, ISSN 0021-8693, MR 0780488
  • Huppert, Bertram (1957), "Zweifach transitive, auflösbare Permutationsgruppen", Mathematische Zeitschrift, 68: 126–150, doi:10.1007/BF01160336, ISSN 0025-5874, MR 0094386
  • Huppert, Bertram; Blackburn, Norman (1982), Finite groups. III., Grundlehren der Mathematischen Wissenschaften, vol. 243, Berlin-New York: Springer-Verlag, ISBN 3-540-10633-2, MR 0650245
  • Johnson, Norman L.; Jha, Vikram; Biliotti, Mauro (2007), Handbook of finite translation planes, Pure and Applied Mathematics, vol. 289, Boca Raton: Chapman & Hall/CRC, ISBN 978-1-58488-605-1, MR 2290291
This page was last edited on 4 June 2024, at 07:16
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.