10 research outputs found
Equations solvable by radicals in a uniquely divisible group
We study equations in groups G with unique m-th roots for each positive
integer m. A word equation in two letters is an expression of the form w(X,A) =
B, where w is a finite word in the alphabet {X,A}. We think of A,B in G as
fixed coefficients, and X in G as the unknown. Certain word equations, such as
XAXAX=B, have solutions in terms of radicals, while others such as XXAX = B do
not. We obtain the first known infinite families of word equations not solvable
by radicals, and conjecture a complete classification. To a word w we associate
a polynomial P_w in Z[x,y] in two commuting variables, which factors whenever w
is a composition of smaller words. We prove that if P_w(x^2,y^2) has an
absolutely irreducible factor in Z[x,y], then the equation w(X,A)=B is not
solvable in terms of radicals.Comment: 18 pages, added Lemma 5.2. To appear in Bull. Lon. Math. So
Unsolved Problems in Group Theory. The Kourovka Notebook
This is a collection of open problems in group theory proposed by hundreds of
mathematicians from all over the world. It has been published every 2-4 years
in Novosibirsk since 1965. This is the 19th edition, which contains 111 new
problems and a number of comments on about 1000 problems from the previous
editions.Comment: A few new solutions and references have been added or update
The word problem and combinatorial methods for groups and semigroups
The subject matter of this thesis is combinatorial semigroup theory. It includes material, in no particular order, from combinatorial and geometric group theory, formal language theory, theoretical computer science, the history of mathematics, formal logic, model theory, graph theory, and decidability theory.
In Chapter 1, we will give an overview of the mathematical background required to state the results of the remaining chapters. The only originality therein lies in the exposition of special monoids presented in §1.3, which uni.es the approaches by several authors.
In Chapter 2, we introduce some general algebraic and language-theoretic constructions which will be useful in subsequent chapters. As a corollary of these general methods, we recover and generalise a recent result by Brough, Cain & Pfei.er that the class of monoids with context-free word problem is closed under taking free products.
In Chapter 3, we study language-theoretic and algebraic properties of special monoids, and completely classify this theory in terms of the group of units. As a result, we generalise the Muller-Schupp theorem to special monoids, and answer a question posed by Zhang in 1992.
In Chapter 4, we give a similar treatment to weakly compressible monoids, and characterise their language-theoretic properties. As a corollary, we deduce many new results for one-relation monoids, including solving the rational subset membership problem for many such monoids. We also prove, among many other results, that it is decidable whether a one-relation monoid containing a non-trivial idempotent has context-free word problem.
In Chapter 5, we study context-free graphs, and connect the algebraic theory of special monoids with the geometric behaviour of their Cayley graphs. This generalises the geometric aspects of the Muller-Schupp theorem for groups to special monoids. We study the growth rate of special monoids, and prove that a special monoid of intermediate growth is a group
Palindromes in the free metabelian Lie algebras
A palindrome, in general, is a word in a fixed alphabet which is preserved when taken in reverse order. Let F2 be the free metabelian Lie algebra over a field of characteristic zero generated by x1,x2. We propose the following definition of palindromes in the setting of Lie algebras: An element f(x1,x2) F2 is called a palindrome if it is preserved under the change of generators; i.e. f(x1,x2) = f(x2,x1). We give a linear basis and an explicit infinite generating set for the Lie subalgebra of palindromes. © 2019 World Scientific Publishing Company