Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Golan, Gili"'
Autor:
Golan, Gili
Recall that a group $G$ is said to be $\frac{3}{2}$-generated if every non-trivial element $g\in G$ has a co-generator in $G$ (i.e., an element which together with $g$ generates $G$). Thompson's group $V$ was proved to be $\frac{3}{2}$-generated by D
Externí odkaz:
http://arxiv.org/abs/2402.19444
Autor:
Golan, Gili, Sapir, Mark
We prove that Thompson's group $F$ has a generating set with two elements such that every two powers of them generate a finite index subgroup of $F$.
Comment: 13 pages, 2 figures. v2: The proof of the main theorem was simplified following refere
Comment: 13 pages, 2 figures. v2: The proof of the main theorem was simplified following refere
Externí odkaz:
http://arxiv.org/abs/2210.16876
Autor:
Golan, Gili
Recall that a group $G$ is said to be $\frac{3}{2}$-generated if every non-trivial element of $G$ belongs to a generating pair of $G$. Thompson's group $V$ was proved to be $\frac{3}{2}$-generated by Donoven and Harper in 2019. It was the first examp
Externí odkaz:
http://arxiv.org/abs/2210.03564
Autor:
Golan, Gili
We study subgroups of Thompson's group $F$ by means of an automaton associated with them. We prove that every maximal subgroup of $F$ of infinite index is closed, that is, it coincides with the subgroup of $F$ accepted by the automaton associated wit
Externí odkaz:
http://arxiv.org/abs/2209.03244
Autor:
Golan, Gili, Sapir, Mark
We prove that Thompson's group $F$ has a subgroup $H$ such that the conjugacy problem in $H$ is undecidable and the membership problem in $H$ is easily decidable. The subgroup $H$ of $F$ is a closed subgroup of $F$. That is, every function in $F$ whi
Externí odkaz:
http://arxiv.org/abs/2105.00531
The word problem for Thompson's group $F$ has a solution, but it remains unknown whether $F$ is automatic or has a finite or regular convergent (terminating and confluent) rewriting system. We show that the group $F$ admits a natural extension of the
Externí odkaz:
http://arxiv.org/abs/1811.11691
Autor:
Golan, Gili, Sapir, Mark
We prove that R. Thompson groups F, T, V have linear divergence functions.
Comment: 18 pages, 5 figures
Comment: 18 pages, 5 figures
Externí odkaz:
http://arxiv.org/abs/1709.08144
A subset $S$ of a group $G$ invariably generates $G$ if $G= \langle s^{g(s)} | s \in S\rangle$ for every choice of $g(s) \in G,s \in S$. We say that a group $G$ is invariably generated if such $S$ exists, or equivalently if $S=G$ invariably generates
Externí odkaz:
http://arxiv.org/abs/1611.08264
Autor:
Golan, Gili, Shan, Songling
In 1966, Gallai asked whether all longest paths in a connected graph share a common vertex. Counterexamples indicate that this is not true in general. However, Gallai's question is positive for certain well-known classes of connected graphs, such as
Externí odkaz:
http://arxiv.org/abs/1611.05967
Autor:
Golan, Gili
We show that the generation problem in Thompson group $F$ is decidable, i.e., there is an algorithm which decides if a finite set of elements of $F$ generates the whole $F$. The algorithm makes use of the Stallings $2$-core of subgroups of $F$, which
Externí odkaz:
http://arxiv.org/abs/1608.02572