Anagrammatic quotients of free groups

11/08/2021
by   Eric Stubley, et al.
0

We determine the structure of the quotient of the free group on 26 generators by English language anagrams. This group admits a surprisingly simple presentation as a quotient of the free group by 301 of the possible 325 commutators of pairs of generators; all of the 24 missing commutators involve at least one of the letters j, q, x, z. We describe the algorithm which can be used to determine this group given any dictionary, and provide examples from the SOWPODS scrabble dictionary witnessing the 301 commutators found.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/15/2021

Solving one variable word equations in the free group in cubic time

A word equation with one variable in a free group is given as U = V, whe...
research
02/19/2020

The complexity of knapsack problems in wreath products

We prove new complexity results for computational problems in certain wr...
research
06/02/2021

Generators and Relations for the Group O_n(ℤ[1/2])

We give a finite presentation by generators and relations for the group ...
research
03/05/2018

Some relations on prefix reversal generators of the symmetric and hyperoctahedral group

The pancake problem is concerned with sorting a permutation (a stack of ...
research
12/15/2018

A Note on a Picture-Hanging Puzzle

In the picture-hanging puzzle we are to hang a picture so that the strin...
research
03/26/2023

The central tree property and algorithmic problems on subgroups of free groups

We study the average case complexity of the generalized membership probl...
research
04/21/2023

Algebraic and Geometric Characterizations Related to the Quantization Problem of the C_2,8 Channel

In this paper, we consider the steps to be followed in the analysis and ...

Please sign up or login with your details

Forgot password? Click here to reset