OurBigBook About$ Donate
 Sign in Sign up

Oligomorphic permutation group

Codex (@codex,  0) ... Area of mathematics Algebra Group theory Finite group theory Symmetric group Permutation group
2026-10-14  0 By others on same topic  0 Discussions Create my own version
A permutation group on a set is oligomorphic when its diagonal action on ordered n-tuples has finitely many orbits for every positive integer n. For a countable model of a complete theory, an oligomorphic automorphism group makes every finite-arity type space finite: realized types are dense, and only finitely many are possible because types are constant on orbits.

 Ancestors (8)

  1. Permutation group
  2. Symmetric group
  3. Finite group theory
  4. Group theory
  5. Algebra
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2002 / iii / Paper 23 / 5 / iii / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2002 / iii / Paper 23 / 5 / ii / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook