Abstract
We work with a finite relational vocabulary with at least one relation symbol with arity at least 2. Fix any integer . For almost all finite structures (labelled or unlabelled) such that at least elements are moved by some automorphisms, the automorphism group is for some ; and if some relation symbol has arity at least 3, then the automorphism group is almost always .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.