Zobrazeno 1 - 10
of 65
pro vyhledávání: '"Bondarenko, Ievgen"'
Autor:
Bondarenko, Ievgen
Let $\mathrm{WP}_G$ denote the word problem in a finitely generated group $G$. We consider the complexity of $\mathrm{WP}_G$ with respect to standard deterministic Turing machines. Let $\mathrm{DTIME}_k(t(n))$ be the complexity class of languages sol
Externí odkaz:
http://arxiv.org/abs/2403.11148
Autor:
Bondarenko, Ievgen, Juschenko, Kate
The zero divisor conjecture is sufficient to prove for certain class of finitely presented groups where the relations are given by a pairing of generators. We associate Mealy automata to such pairings, and prove that the zero divisor conjecture holds
Externí odkaz:
http://arxiv.org/abs/2402.08625
Autor:
Bondarenko, Ievgen
A finitely generated group $G$ is called poly-context-free if its word problem $\mathrm{WP}(G)$ is an intersection of finitely many context-free languages. We consider the quaternionic lattices $\Gamma_\tau$ over the field $\mathbb{F}_{q}(t)$ constru
Externí odkaz:
http://arxiv.org/abs/2402.07494
Autor:
Bondarenko, Ievgen
This dissertation is devoted to groups generated by bounded automata and geometric objects related to these groups (limit spaces, Schreier graphs, etc.). It is shown that groups generated by bounded automata are contracting. We introduce the notion o
Externí odkaz:
http://hdl.handle.net/1969.1/85845
Publikováno v:
International Journal of Algebra and Computation, Vol. 31, No. 06, pp. 1177-1190 (2021)
We devise an algorithm which, given a bounded automaton A, decides whether the group generated by A is finite. The solution comes from a description of the infinite sequences having an infinite A-orbit using a deterministic finite-state acceptor. Thi
Externí odkaz:
http://arxiv.org/abs/1912.06897
Autor:
Bondarenko, Ievgen, Kivva, Bohdan
The first example of a non-residually finite group in the classes of finitely presented small-cancelation groups, automatic groups, and CAT(0) groups was constructed by Wise as the fundamental group of a complete square complex (CSC for short) with t
Externí odkaz:
http://arxiv.org/abs/1707.00215
Publikováno v:
Journal of Fractal Geometry, Volume 4, Issue 4, 2017, 369-424
Every self-similar group acts on the space $X^\omega$ of infinite words over some alphabet $X$. We study the Schreier graphs $\Gamma_w$ for $w\in X^\omega$ of the action of self-similar groups generated by bounded automata on the space $X^\omega$. Us
Externí odkaz:
http://arxiv.org/abs/1601.07587
Autor:
Bondarenko, Ievgen.
Publikováno v:
Connect to the full text of this online resource..
"Major Subject: Mathematics" Title from author supplied metadata (automated record created 2010-03-12 12:08:51). Includes bibliographical references.
Externí odkaz:
http://hdl.handle.net/1969.1/ETD-TAMU-2081
Autor:
Bondarenko, Ievgen
Thesis (Ph. D.)--Texas A&M University, 2007.
"Major Subject: Mathematics" Title from author supplied metadata (automated record created on Oct. 13, 2008.) Vita. Abstract. Includes bibliographical references.
"Major Subject: Mathematics" Title from author supplied metadata (automated record created on Oct. 13, 2008.) Vita. Abstract. Includes bibliographical references.
Externí odkaz:
http://handle.tamu.edu/1969.1/85845
Publikováno v:
IJAC, Volume 23, Number 1, 69-79, 2013
A self-similar group of finite type is the profinite group of all automorphisms of a regular rooted tree that locally around every vertex act as elements of a given finite group of allowed actions. We provide criteria for determining when a self-simi
Externí odkaz:
http://arxiv.org/abs/1409.0125