Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Aleksander Ivanov"'
Autor:
Aleksander Ivanov
Publikováno v:
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, Iss 7 (2018)
The notion of an almost fully closed mapping, which generalizes the definition of a fully closed map, is introduced. It is shown that the composition of almost fully closed mappings of compacta with the first axiom of countability is also almost full
Externí odkaz:
https://doaj.org/article/49cfda56ffb34dceada78ab28dfa3763
Publikováno v:
Modern Stochastics: Theory and Applications, Vol 2, Iss 3, Pp 297-308 (2015)
We obtain limit theorems for extreme residuals in linear regression model in the case of minimax estimation of parameters.
Externí odkaz:
https://doaj.org/article/b0745b51f24c47dca37610059c528d16
Autor:
LOUYSE S. DAMÁZIO, EDUARDA B. FRUTUOSO, JOÃO PEDRO S. ZILLI, YURI ALEKSANDER IVANOV, SARAH G. CANCILLIER, JOÃO QUEVEDO, ALEXANDRA I. ZUGNO
Publikováno v:
Anais da Academia Brasileira de Ciências, Vol 96, Iss 2 (2024)
Abstract Comparing one’s appearance to other people’s and believing in an ideal body shape can negatively impact an individual. The probability of developing ED in individuals with high body dissatisfaction is higher than in the general populatio
Externí odkaz:
https://doaj.org/article/c22b654401ef4c0991e4e02219c2e1d4
Autor:
Oleg Bogopolski, Aleksander Ivanov
Publikováno v:
Canadian Mathematical Bulletin. :1-18
We study the following decision problem: given an exponential equation $a_1g_1^{x_1}a_2g_2^{x_2}\dots a_ng_n^{x_n}=1$ over a recursively presented group G, decide if it has a solution with all $x_i$ in $\mathbb {Z}$ . We construct a finitely presente
Autor:
Aleksander Ivanov, Karol Duda
Publikováno v:
Archive for Mathematical Logic. 61:891-902
Autor:
Aleksander Ivanov
Publikováno v:
Algebra and Discrete Mathematics. 33:140-144
In this paper we show that under some mild assumptions two copies of a metric group can be freely amalgamated over any central subgroup so that the distance between them is sufficiently small.
Autor:
Aleksander Ivanov
Publikováno v:
Mathematical Logic Quarterly. 67:206-225
Autor:
Aleksander Ivanov
Publikováno v:
Mathematical Logic Quarterly. 67:43-58
Autor:
Aleksander Ivanov
Publikováno v:
Archive for Mathematical Logic. 60:477-494
We show that for every sofic chunk $E$ there is a bijective homomorphism $f: E_c \rightarrow E$, where $E_c$ is a chunk of the group of computable permutations of $\mathbb{N}$ so that the approximating morphisms of $E$ can be viewed as restrictions o
Autor:
Karol Duda, Aleksander Ivanov (Iwanow)
We prove a computable version of Hall's Harem Theorem and apply it to computable versions of Tarski's alternative theorem.
Comment: Overlap with Sections 6-8 of arXiv:1904.02640. To be published in International Journal of Algebra and Computatio
Comment: Overlap with Sections 6-8 of arXiv:1904.02640. To be published in International Journal of Algebra and Computatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2f44e20ff75606d19b27ec445354841f
http://arxiv.org/abs/2203.07730
http://arxiv.org/abs/2203.07730