Punctual Copies of Algebraic Structures
- Authors: Zubkov M.V.1, Kalimullin I.S.1, Melnikov A.G.2, Frolov A.N.1
-
Affiliations:
- Kazan (Volga Region) Federal University
- Massey University
- Issue: Vol 60, No 6 (2019)
- Pages: 993-1002
- Section: Article
- URL: https://journals.rcsi.science/0037-4466/article/view/172725
- DOI: https://doi.org/10.1134/S0037446619060077
- ID: 172725
Cite item
Abstract
We estimate the complexity of constructing a punctual “online” copy of an algebraic structure. We establish a general upper bound as well as optimal bounds for classes of Boolean algebras, abelian p-groups, and linear orders. Moreover, the methods developed here are applied to solving Montalbán’s open problem (2013) about copyable linear orders.
About the authors
M. V. Zubkov
Kazan (Volga Region) Federal University
Author for correspondence.
Email: Maxim.Zubkov@kpfu.ru
Russian Federation, Kazan
I. Sh. Kalimullin
Kazan (Volga Region) Federal University
Author for correspondence.
Email: Iskander.Kalimullin@kpfu.ru
Russian Federation, Kazan
A. G. Melnikov
Massey University
Author for correspondence.
Email: A.Melnikov@massey.ac.nz
New Zealand, Albany
A. N. Frolov
Kazan (Volga Region) Federal University
Author for correspondence.
Email: a.frolov.kpfu@gmail.com
Russian Federation, Kazan
![](/img/style/loading.gif)