Abstract
It is shown that any finite n-element predicate system for which any two one-element subsystems are isomorphic is embeddable in a finite (2n − 1)-element system having a transitive automorphism group.
Similar content being viewed by others
References
B. Herwig, “Extending partial automorphisms on finite structures,” Combinatorica, 15, 365–371 (1995).
E. Hrushovski, “Extending partial isomorphisms of graphs,” Combinatorica, 12, 204–218 (1992).
E. V. Ovchinnikova, “On extensions of partial isomorphisms of finite polygons over linearly ordered monoids,” in: Algebra and Model Theory [in Russian], Vol. 6, Izd. NSTU, Novosibirsk (2007), pp. 45–48.
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to the memory of my Teacher Yury Evgen’evich Shishmaryov
Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 15, No. 7, pp. 137–140, 2009.
Rights and permissions
About this article
Cite this article
Ovchinnikova, E.V. On homogeneous extensions of finite predicate systems. J Math Sci 169, 651–653 (2010). https://doi.org/10.1007/s10958-010-0066-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-010-0066-z