Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 26083

An automorphism is an isomorphism from an object to itself, and which also preserves the objects structure .

0 votes
0 answers
123 views

Simple automorphisms of finite relations

Finding automorphisms is a hard problem in general, but I am studying some simple subgroups of automorphisms, which are easy to find. … There are three ways such automorphisms can interact (with 1, 2 or 3 common values). Composing such automorphisms multiple times gives us new automorphisms of A2 containing (u1/u3). …