FACTOID # 182: Russia has twice as many chess Grandmasters as its nearest competitor, Germany.
 
 Home   Encyclopedia   Statistics   Countries A-Z   Flags   Maps   Education   Forum   FAQ   About 
 
WHAT'S NEW
RECENT ARTICLES
More Recent Articles »
 

Encyclopedia > Order automorphism

In the mathematical area of order theory, given a partially ordered set (S, ≤) an order automorphism of (S, ≤) is an order isomorphism from (S, ≤) to itself.


The set of order automorphisms of a set forms a group.


  Results from FactBites:
 
Automorphism - Wikipedia, the free encyclopedia (875 words)
In graph theory an automorphism of a graph is a permutation of the nodes that preserves edges and non-edges.
An automorphism of a differentiable manifold M is a diffeomorphism from M to itself.
In Riemannian geometry an automorphism is a self-isometry.
  More results at FactBites »

 

COMMENTARY     


Share your thoughts, questions and commentary here
Your name
Your location
Your comments
Please enter the 5-letter protection code


Lesson Plans | Student Area | Student FAQ | Reviews | Press Releases |  Feeds | Contact
The Wikipedia article included on this page is licensed under the GFDL.
Images may be subject to relevant owners' copyright.
All other elements are (c) copyright NationMaster.com 2003-5. All Rights Reserved.
Usage implies agreement with terms.