Oligomorphic group

Oligomorphic group

In group theory, a branch of mathematics, an oligomorphic group is a particular kind of (usually infinite) permutation group. If a group G acts on a set S, then G is said to be oligomorphic if every Cartesian product, Sn of S has finitely many orbits under the action of G. The interest in oligomorphic group is partly based on their application to model theory, e.g. automorphisms in countably categorical theories.[1]

References

  1. ^ Notes on infinite permutation groups, Volume 1698 by Meenaxi Bhattacharjee 1998 ISBN 3540649654 page 83

Wikimedia Foundation. 2010.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

  • Oligomorphic code — An oligomorphic engine is generally used by a computer virus to generate a decryptor for itself in a way comparable to a simple polymorphic engine. It does this by randomly selecting each piece of the decryptor from several predefined… …   Wikipedia

  • Permutation group — In mathematics, a permutation group is a group G whose elements are permutations of a given set M , and whose group operation is the composition of permutations in G (which are thought of as bijective functions from the set M to itself); the… …   Wikipedia

  • List of permutation topics — This is a list of topics on mathematical permutations.*Alternating group *Alternating permutation *Bijection *Circular shift *Combination *Cycle index *Cycle notation *Cyclic order *Cyclic permutation *Derangement *Even and odd permutations… …   Wikipedia

  • Omega-categorical theory — In mathematical logic, an omega categorical theory is a theory that has only one countable model up to isomorphism. Omega categoricity is the special case κ =   = ω of κ categoricity, and omega categorical theories are also… …   Wikipedia

  • Model theory — This article is about the mathematical discipline. For the informal notion in other parts of mathematics and science, see Mathematical model. In mathematics, model theory is the study of (classes of) mathematical structures (e.g. groups, fields,… …   Wikipedia

  • Rado graph — The Rado graph, as numbered by Rado (1964). In the mathematical field of graph theory, the Rado graph, also known as the random graph or the Erdős–Renyi graph, is the unique (up to isomorphism) countable graph R such that for any finite graph G… …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”