Related papers: Anagrammatic quotients of free groups

Using a suitably noncommutative flat matrix model, it is shown that the quantum permutation group has free orbitals: that is, a monomial in the generators of the algebra of functions can be zero for trivial reasons only. It is shown that…

Recently, Brannan and Vergnioux showed that the free orthogonal quantum group factors $\mathcal{L}\mathbb{F}O_M$ have Jung's strong 1-boundedness property, and hence are not isomorphic to free group factors. We prove an analogous result for…

In this paper we consider some classical varieties of linear algebras over the field which has characteristic 0. For every considered variety we take a category of the finite generated free algebras of this variety. And for every this…

Let $\FP(X)$ be the free paratopological group on a topological space $X$. For $n\in \N$, denote by $\FP_n(X)$ the subset of $\FP(X)$ consisting of all words of reduced length at most $n$, and by $i_n$ the natural mapping from $(X\oplus…

We classify all possible JSJ decompositions of doubles of free groups of rank two and we then compute the Makanin-Razborov diagram of a particular double of a free group and deduce that in general limit groups are not freely subgroup…

In this article, we study necessary conditions for certain square-free integers to be congruent numbers. Our method uses divisibility properties of class numbers of related imaginary quadratic fields. We first consider positive square-free…

Let $C$ be a smooth projective curve over the field of complex numbers $\mathbb{C}$ of genus $g(C)>0$. Let $E$ be a locally free sheaf on $C$ of rank $r$ and degree $e$. Let $\mathcal{Q}:={\rm Quot}_{C/\mathbb{C}}(E,k,d)$ denote the Quot…

Free cumulants are nice and useful functionals of the shape of a Young diagram, in particular they give the asymptotics of normalized characters of symmetric groups S(n) in the limit n\to\infty. We give an explicit combinatorial formula for…

Building on the previous extensive study of Yang, Gould and the present author, we provide a more precise insight into the group-theoretical ramifications of the word problem for free idempotent generated semigroups over finite biordered…

Differential operators of Schrodinger type are considered on metric Cayley graphs of free groups with a minimal set of M generators. The potential and edge lengths may vary with the M edge types. Using novel methods, a set of M multipliers…

The palindromic length of a finite word $w$ is defined as the minimal number of palindromes such that their product is $w$. Clearly, this function may take different values depending on if we consider $w$ as an element a free semigroup or…

The paper is devoted to the study of free objects in the variety of Steiner loops and of the combinatorial structures behind them, focusing on their automorphism groups. We prove that all automorphisms are tame and the automorphism group is…

An approach to a classification of groups generated by 3-state automata over a 2-letter alphabet and the current progress in this direction are presented. Several results related to the whole class are formulated. In particular, all finite,…

We introduce a new random group model called the square model: we quotient a free group on $n$ generators by a random set of relations, each of which is a reduced word of length four. We prove, as in the Gromov density model, that for…

In Chapter 1 we give the basic background and notations. We also give a new characterization of the Conrad property for orderings. In Chapter 2, we use the new characterization of the Conradian property to give a classification of groups…

For a group $G$, N-series $\cal G$ of $G$ and commutative ring $R$ let $I^n_{R,\cal G}(G)$, $n\ge 0$, denote the filtration of the group algebra $R(G)$ induced by $\cal G$, and $I_R(G)$ its augmentation ideal. For subgroups $H$ of $G$, left…

We study random nilpotent groups in the well-established style of random groups, by choosing relators uniformly among freely reduced words of (nearly) equal length and letting the length tend to infinity. Whereas random groups are quotients…

Let $F$ be a free group. We present for arbitrary $g\in\mathbb{N}$ a LogSpace (and thus polynomial time) algorithm that determines whether a given $w\in F$ is a product of at most $g$ commutators; and more generally an algorithm that…

In the present paper we develop a small cancellation theory for associative algebras with a basis of invertible elements. Namely, we study quotients of a group algebra of a free group and introduce three axioms for the corresponding…

We find a lower bound to the size of finite groups detecting a given word in the free group, more precisely we construct a word w_n of length n in non-abelian free groups with the property that w_n is the identity on all finite quotients of…