Results 21 to 30 of about 23,371 (295)
Autostackability of Thompson's group F
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 these two properties, namely autostackability, and we give an explicit bounded regular convergent prefix ...
Corwin, Nathan +4 more
openaire +3 more sources
2-elements in an Autotopism Group of a Semifield Projective Plane
We investigate the well-known hypothesis of D.R. Hughes that the full collineation group of non-Desarguesian semifield projective plane of a finite order is solvable (the question 11.76 in Kourovka notebook was written down by N.D. Podufalov). The spread
Olga Kravtsova
doaj +1 more source
Prevalence of palmaris longus agenesis among the Urhobo of Delta State, Nigeria
Background: Palmaris longus (PL) is one of the most common muscles in the human body that has anatomical variants of surgical importance. Objectives: The purpose of this study was to find out the frequency of PL agenesis among Urhobo people in ...
Princess O Enakpoya +4 more
doaj +1 more source
Thompson’s group is distorted in the Thompson–Stein groups [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
BACKGROUND: This study was performed aiming to determine the effectiveness of life skills training on marital intimacy and family functioning among married women with major depression in Tehran, Iran.
Tiraje Javini
doaj +1 more source
Higher Dimensional Thompson Groups [PDF]
27 pages To appear in Geometriae ...
openaire +3 more sources
Length-based cryptanalysis: the case of Thompson's group
The length-based approach is a heuristic for solving randomly generated equations in groups that possess a reasonably behaved length function. We describe several improvements of the previously suggested length-based algorithms, which make them ...
Ruinskiy Dima, Shamir Adi, Tsaban Boaz
doaj +1 more source
Markovianity and the Thompson Group F
We show that representations of the Thompson group F in the automorphisms of a noncommutative probability space yield a large class of bilateral stationary noncommutative Markov processes. As a partial converse, bilateral stationary Markov processes in tensor dilation form yield representations of F.
Köstler, Claus, Krishnan, Arundhathi
openaire +3 more sources
Tame combing and almost convexity conditions [PDF]
We give the first examples of groups which admit a tame combing with linear radial tameness function with respect to any choice of finite presentation, but which are not minimally almost convex on a standard generating set.
Cleary, Sean +3 more
core +3 more sources
Conjugacy and dynamics in Thompson’s groups [PDF]
We give a unified solution to the conjugacy problem for Thompson's groups F, T, and V. The solution uses strand diagrams, which are similar in spirit to braids and generalize tree-pair diagrams for elements of Thompson's groups. Strand diagrams are closely related to piecewise-linear functions for elements of Thompson's groups, and we use this ...
Belk, J, Matucci, F
openaire +3 more sources

