Skip to main content
Log in

On homogeneous extensions of finite predicate systems

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. B. Herwig, “Extending partial automorphisms on finite structures,” Combinatorica, 15, 365–371 (1995).

    Article  MathSciNet  MATH  Google Scholar 

  2. E. Hrushovski, “Extending partial isomorphisms of graphs,” Combinatorica, 12, 204–218 (1992).

    Article  MathSciNet  Google Scholar 

  3. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to E. V. Ovchinnikova.

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

Reprints 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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-010-0066-z

Keywords

Navigation