\markboth{A. Gaglione, S. Lipschutz, D. Spellman}{Burnside Groups} \wstoc{Burnside Groups}{A. Gaglione, S. Lipschutz, D. Spellman} \title{Groups Universally Equivalent to Free Burnside Groups of Prime Exponent and a Question of Philip Hall} %{\large GROUPS UNIVERSALLY EQUIVALENT TO FREE BURNSIDE GROUPS OF %PRIME EXPONENT AND A QUESTION OF PHILIP HALL } \author{A. Gaglione} \address{Department of Mathematics\\ U.S. Naval Academy\\ Annapolis, MD 21402} \author{S. Lipschutz} \address{Department of Mathematics\\ Temple University\\ Philadelphia, PA 19122} \author{D. Spellman} \address{Department of Mathematics\\ Temple University\\ Philadelphia, PA 19122} %\subjclass{Primary 20E26; Secondary 20E05, 20E06} %\keywords{} \begin{abstract} This paper proposes the Tarski Problem for free groups in a Burnside variety, \textbf{B}$_{n}$, where n is a sufficiently large odd integer so that Adian's results hold. We note that just as in the case of absolutely free groups it is easy to show that the nonabelian free groups in \textbf{B}$% _{n}$ for n as above are all universlly equivalent. \end{abstract} \section{Introduction} We bear in mind two problems which resisted solution for decades and succumbed only to the fresh attacks of supremely talented mathematicians. For our purposes we shall dub the questions (1) and (2) below as \textit{The Tarski Problem} and \textit{The Burnside Problem} respectively. \bigskip (1) Are the nonabelian free groups elementarily equivalent? (2) Must the finitely generated nonabelian free Burnside groups of fixed finite exponent be finite? \bigskip Of course the answers to (1) and (2) are now known to be (1) yes and (2) no respectively. (1) was solved independently by Kharlampovich and Myasnikov on the one hand and by Sela on the other. Kharlampovich and Myasnikov applied \textit{algebraic geometry over groups} invented by G. Baumslag, Myasnikov and Remeslennikov while Sela invented \textit{Diophantine geometry in groups} to solve the Tarski problem.{\large \ } {\large \ }Let's focus on algebraic geometry over groups. By way of analogy let us consider a Noetherian integral domain R. The closed subsets in the \textit{Zariski topology} on affine n-space over R are precisely the affine algebraic subsets. In order for the analog of this scenario to go through in groups \ the proper notions of domain and Noetherian had to be defined. One consequence of the correct definition of domain is that every \ nonabelian CSA group (See Section 3) is a domain. Since free groups are CSA, nonabelian free groups are domains. The correct notion of Noetherian is \textit{% equationally Noetherian} (See Section 6). Happily free groups are also equationally Noetherian. One felicitous consequence of this confluence of facts is the existence and uniqueness (in the usual sense) of the decomposition of a closed set into a finite union of irreducible affine algebraic subsets. (We need to reserve the word \textit{variety} for an equational class in this paper.) While the groups free in the variety of all groups are elementarily equivalent (provided their rank exceeds 1) it is easy to see that the corresponding result is false for groups free in many other varieties. For example, one can distinguish the free nilpotent groups (of fixed class) of different finite ranks by first order sentences. Perhaps the variety of all groups is unique in this regard? Or is it! We now turn our attention to Question (2). A negative answer was first provided by Adian who showed that, for all sufficiently large odd n, the nonabelian free groups in the variety $\mathbf{B}_{n}$ determined by the law $x^{n}=1$ were all infinite. Soon afterward Sirvanjan proved that, just as in the variety of all groups, the free group of countably infinite rank in the variety $\mathbf{B}_{n}${\large \ }embeds in its group free of rank 2 for all sufficiently large odd n. From this it easily follows that the nonabelian free groups in the varieties $\mathbf{B}_{n}$, for all sufficiently large fixed odd n, have the same universal theory in the sense of first order logic. For our purposes we can say the most when n = p is a sufficiently large prime. In any event, if n is a sufficiently large odd integer, the free groups in $\mathbf{B}_{n}$ are CSA; hence, the nonabelian free groups in such varieties are domains. We do not know whether or not they are equationally Noetherian. The Tarski problem relativized to such $% \mathbf{B}_{n}$ will require new techniques for its solution. This paper provides some halting first steps and should be viewed as an invitation to our colleagues to ponder possible approaches. \section{Preliminaries} We let $\omega $ be the first limit ordinal, which we identify with the first infinite cardinal $\aleph _{0}$. If $H$ and $G$ are groups we say that $G$ is $\mathit{H}$\textit{-inclusive} provided it contains a subgroup isomorphic to $H$; $G$ is $\mathit{H}$\textit{-exclusive} provided it is not $H$-inclusive. For each positive integer $n$, $C_{n}$ shall be a group cyclic of order $n$. If $G$ is a group and $\mathbf{H}$ is a nonempty class of groups, then we say that $\mathbf{H}$ \textit{separates} $G$ provided for every $g\in G\backslash \{1\}$ there is a group $H_{g}\in \mathbf{H}$ and a homomorphism $\varphi _{g}:G\rightarrow H_{g}$ such that $\varphi _{g}(g)\neq 1$; we say that $\mathbf{H}$\textit{\ discriminates }$G$ provided for every finite nonempty subset $S\subseteq G\backslash \{1\}$ there is a group $H_{S}\in \mathbf{H}$ and a homomorphism $\varphi _{S}:G\rightarrow H_{S}$ such that $\varphi _{S}(g)\neq 1$ for all $g\in S$. In the case $\mathbf{H}=\{H\}$ is a singleton we say that $H$ separates (discriminates) $G$ for $\mathbf{H}$ separates (discriminates) $G$. In the case that $\mathbf{H}$ separates (discriminates) $G$ by epimorphisms the language $G$ is \textit{residually (fully residually)} $\mathbf{H}$ is sometimes used. Let $L_{0}$ be the first order language with equality containing a binary operation symbol $\bullet $, a unary operation symbol $^{-1}$ and a constant symbol $1$. We remark that being first order means that the variables are interpreted as varying over individual elements of the domain of discourse - never over subsets nor functions. Thus an $\mathit{L}_{0}$\textit{-structure} is a set $G$ provided with a distinguished constant $1\in G$, a unary operation $G\rightarrow G$, $g\mapsto g^{-1}$ and a binary operation $% G^{2}\rightarrow G$, $(g,h)\mapsto gh$. A \textit{universal sentence} of $% L_{0}$ is one of the form $\forall \mathbf{x}\varphi (\mathbf{x})$ where $% \mathbf{x}$ is a tuple of distinct variables and $\varphi (\mathbf{x})$ is a formula of $L_{0}$ containing no quantifiers and containing free at most the variables in $\mathbf{x}$. A \textit{law} in $L_{0}$ is a universal sentence of the form $\forall \mathbf{x}(s(\mathbf{x})=t(\mathbf{x}))$ where $\mathbf{% x}$ is a tuple of distinct variables and $s(\mathbf{x})$ and $t(\mathbf{x})$ are terms of $L_{0}$ containing at most the variables in $\mathbf{x}$. The model class of a set of laws of $L_{0}$ is a \textit{variety} of $L_{0}$% -structures. The following three sentences are laws. $\gamma _{1}$: $\forall x_{1},x_{2},x_{3}((x_{1}\bullet x_{2})\bullet x_{3}=x_{1}\bullet (x_{2}\bullet x_{3}))$ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ Associative Law $\gamma _{2}$: $\forall x(x\bullet 1=x)$ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ Identity Law $\gamma _{3}$: $\forall x(x\bullet x^{-1}=1)$ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ Inverse Law We shall refer to the set $\{\gamma _{1},\gamma _{2},\gamma _{3}\}$ as \textit{the group axioms}. \ The model class $\mathbf{O}$ of the group axioms is \textit{the variety of \ all groups}. Every variety under consideration in this paper shall be a subvariety of $\mathbf{O}$. \ If $% \gamma $ is the conjunction $\gamma _{1}\wedge \gamma _{2}\wedge \gamma _{3}$ of the group axioms and $\sigma $ and $\tau $ are sentences of $L_{0}$ then we shall say that $\sigma $ and $\tau $ are \textit{equivalent modulo the group axioms }provided the sentence $\gamma \rightarrow (\sigma \leftrightarrow \tau )$ is true. Every law in $L_{0}$ is equivalent modulo the group axioms to one of the form $\forall \mathbf{x}(w(\mathbf{x})=1)$ where $\mathbf{x}$ is a tuple of distinct variables and $w(\mathbf{x})$ is a word in at most the variables in $\mathbf{x}$. Henceforth we shall omit the universal quantifiers and abbreviate the law $\forall \mathbf{x}(w(\mathbf{x}% )=1)$ as simply $w(\mathbf{x})=1$. From this point on we tacitly assume the group axioms. The \textit{trivial variety} $\mathbf{E}$, determined by the law $x=1$, is the isomorphism class of the one element group. All other varieties of groups are \textit{nontrivial}. Every nontrivial variety $% \mathbf{V}$ of groups admits, for each cardinal $r$, groups free of rank $r$ relative to $\mathbf{V}$. We adopt the notation $F_{r}(\mathbf{V})$ for a fixed, but arbitrary, group free of rank $r$ relative to $\mathbf{V}$. Any two such groups (for fixed $\mathbf{V}$ and $r$) are isomorphic. \smallskip \noindent \textbf{Convention: }If $\mathbf{E}$ is the trivial variety and $r$ is any cardinal, then $F_{r}(\mathbf{E})$ is the trivial group $1$. \smallskip If $G$ and $H$ are groups then we say that $G$ \textit{universally covers }$% H $ provided every universal sentence of $L_{0}$ true in $G$ is also true in $H $. Note that $H\leq G$ is a sufficient condition for $G$ to universally cover $H$. We say that $G$ and $H$ are \textit{universally equivalent} or \textit{have the same universal theory} and write $G\equiv _{\forall }H$ provided $G$ universally covers $H$ and $H$ universally covers $G$. \ An \textit{existential sentence }of $L_{0}$ is one of the form $\exists \mathbf{% x}\varphi (\mathbf{x})$ where $\mathbf{x}$ is a tuple of distinct variables and $\varphi (\mathbf{x})$ is a formula of $L_{0}$ containing no quantifiers and containing free at most the variables in $\mathbf{x}$. A \textit{% primitive sentence }of $L_{0}$ is an existential sentence of $L_{0}$ equivalent modulo the group axioms to one of the form $\exists \mathbf{x}% (\wedge _{j}(u_{j}(\mathbf{x})=1)\wedge \wedge _{k}(v_{k}(\mathbf{x})\neq 1)) $ where $\mathbf{x}$ is a tuple of distinct variables and the $u_{j}(% \mathbf{x})$ and $v_{k}(\mathbf{x)}$ are words in at most the variables in $% \mathbf{x}$. Since the negation of a universal sentence of $L_{0}$ is equivalent to an existential sentence of $L_{0}$ and vice-versa $G\equiv _{\forall }H$ may be paraphrased as asserting that every universal sentence and every existential sentence of $L_{0}$ true in $G$ is also true in $H$ (and vice-versa). It is easy to see that if $G_{1}\equiv _{\forall }G\equiv _{\forall }G_{2}$, then $G_{1}\leq H\leq G_{2}$ is a sufficient condition for $G\equiv _{\forall }H$. A somewhat more sophisticated sufficient condition is the following. $H\leq G$ and every finite system% \begin{eqnarray*} u_{j}(\mathbf{x}) &=&1,1\leq j\leq J \\ v_{k}(\mathbf{x}) &\neq &1,1\leq k\leq K \end{eqnarray*}% of equations and inequations ( in finitely many variables $\mathbf{x}% =(x_{1},...,x_{n})$) which has a solution in $G$ must also have a solution in $H$. To see that this is so observe that $G$ universally covers $H$; so, it will suffice to show that every existential sentence of $L_{0}$ true in $% G $ must also be true in $H$. Now we may assume that the \textit{matrix} $% \varphi (\mathbf{x})$ of the existential sentence $\exists \mathbf{x}\varphi (\mathbf{x})$ is written in \textit{disjunctive normal form} modulo the group axioms $\vee _{i}(\wedge _{j}(u_{i,j}(\mathbf{x})=1)\wedge \wedge _{k}(v_{i,k}(\mathbf{x})\neq 1))$. The sentence is then equivalent to the disjunction $\vee _{i}\exists \mathbf{x}(\wedge _{j}(u_{i,j}(\mathbf{x}% )=1)\wedge \wedge _{k}(v_{i,k}(\mathbf{x})\neq 1))$ of primitive sentences. Since a disjunction is true provided at least one of the disjuncts is, it suffices to prove that every primitive sentence of $L_{0}$ true in $G$ is also true in $H$; hence, the sufficiency of the above criterion is established. We say that two groups $G$ and $H$ are \textit{elementarily equivalent} and write $G\equiv H$ provided $G$ and $H$ satisfy the same sentences of $L_{0}$% . A theorem of Vaught (Theorem 4 of Chapter 6, Section 38 in [G]) asserts that , if $\mathbf{V}$ is any variety and $r$ and $s$ are infinite cardinals, then $F_{r}(\mathbf{V})\equiv F_{s}(\mathbf{V})$. In particular, $% F_{r}(\mathbf{V})\equiv _{\forall }F_{s}(\mathbf{V})$ when $r$ and $s$ are infinite. Let $n$ be a positive integer. The \textit{Burnside variety} $\mathbf{B}_{n}$ of exponent $n$ is the variety of groups determined by the law $x^{n}=1$. Adian proved that, for all sufficiently large odd $n$, (B1) $F_{r}(\mathbf{B}_{n})$ is infinite for all $r\geq 2$; moreover, every finite subgroup of $F_{r}(\mathbf{B}_{n})$ is cyclic. and (B2) The centralizer of every nontrivial element in $F_{r}(\mathbf{B}_{n})$ is cyclic for all $r\geq 2.$ Sirvanjan proved that, for all sufficiently large odd $n$, (B3) $F_{\omega }(\mathbf{B}_{n})$ embeds in $F_{2}(\mathbf{B}_{n})$. We shall call an integer $n>0$ an \textit{Adian-Sirvanjan integer} provided (B1), (B2) and (B3) hold for $\mathbf{B}_{n}$. A prime Adian-Sirvanjan integer $p$ shall be an \textit{Adian-Sirvanjan prime}. Every member $G$ of a variety $\mathbf{V}$ of groups is a homomorphic image of a group $F_{r}(\mathbf{V})$ free in $\mathbf{V}$. If there is an epimorphism $\psi :F_{r}(\mathbf{V})\rightarrow G$ such that $r$ is finite and $Ker(\psi )$ is the normal closure in $F_{r}(\mathbf{V})$ of finitely many elements of $F_{r}(\mathbf{V})$, then $G$ is \textit{finitely presented relative to }$\mathbf{V}$. \section{\textbf{Varieties and Discrimination}} We begin by remarking that, although we chose to live in the world of groups, the results of this section go through in the context of universal algebra. Let $\mathbf{V}$ be a nontrivial variety of groups. Let $F_{\omega }(\mathbf{% V})$ be a group free of countably infinite rank relative to $\mathbf{V}$. Suppose $\{a_{1},a_{2},...\}=\{a_{n+1}:n<\omega \}$ freely generates $% F_{\omega }(\mathbf{V})$ relative to $\mathbf{V}$. \begin{definition} \ [N] \ A group $G\in \mathbf{V}$ \textbf{discriminates}\textit{\ }$\mathbf{V% }$ provided $G$ discriminates $F_{\omega }(\mathbf{V})$. \end{definition} Now $G\in \mathbf{V}$ discriminates $\mathbf{V}$ just in case, given finitely many elements% \begin{equation*} w_{k}(a_{1},...,a_{n})\neq 1 \end{equation*} in $F_{\omega }(\mathbf{V})$, there is a homomorphism $\psi :F_{\omega }(% \mathbf{V})\rightarrow G$ such that $\psi (w_{k}(a_{1},...,a_{n}))\neq 1$ for all $k$. This is equivalent to the following. Given finitely many words $% w_{k}(x_{1},...,x_{n})$ such that none of the equations% \begin{equation*} w_{k}(x_{1},...,x_{n})=1 \end{equation*} is a law in $\mathbf{V}$, there is a tuple $(g_{1},...,g_{n})\in G^{n}$ such that $w_{k}(g_{1},...,g_{n})\neq 1$ for all $k$. \bigskip \noindent \textbf{Convention: }\textit{The trivial group }$1$\textit{\ discriminates the trivial variety }$E$\textit{.} \bigskip \begin{definition} Let $\mathbf{V}$ be a variety of groups. $\mathbf{V}$ is \textbf{finitely discriminable} provided there is a finitely generated group $G\in \mathbf{V}$ such that $G$ discriminates $\mathbf{V}$. \end{definition} \begin{lemma} $\mathbf{V}$ is finitely discriminable if and only if there is a positive integer $r$ such that $F_{r}(\mathbf{V})$ discriminates $\mathbf{V}$. \end{lemma} \noindent \textit{Proof: \ }If $G=F_{r}(\mathbf{V})$ discriminates $\mathbf{V% }$ for some integer $r>0$, then $\mathbf{V}$ is discriminated by an $r$% -generator member; hence, it is finitely discriminable. Suppose $\mathbf{V}$ is finitely discriminable. \ Suppose $r$ is a positive integer and $% G=\langle b_{1},...,b_{r}\rangle \in \mathbf{V}$ discriminates $\mathbf{V}$. Let $F_{r}(\mathbf{V})$ be freely generated relative to $\mathbf{V}$ by $% a_{1},...,a_{r}$. Then we get an epimorphism $\psi :F_{r}(\mathbf{V}% )\rightarrow G$, $a_{i}\mapsto b_{i}$, $1\leq i\leq r$. Suppose that $w_{k}(x_{1},...,x_{n})$ are finitely many words such that none of the equations $w_{k}(x_{1},...,x_{n})=1$ is a law in $\mathbf{V}$. Then there are elements $g_{i}=u_{i}(b_{1},...,b_{r})$, $1\leq i\leq n$ in $G$ such that $w_{k}(u_{1}(b_{1},...,b_{r}),...,u_{n}(b_{1},...,b_{r}))\neq 1$ for all $k$. It follows that $% w_{k}(u_{1}(a_{1},...,a_{r}),...,u_{n}(a_{1},...,a_{r}))\neq 1$ in $F_{r}(% \mathbf{V})$ for all $k$. Hence, $F_{r}(\mathbf{V})$ discriminates $\mathbf{V% }$. $\blacksquare $ \begin{definition} Let $\mathbf{V}$ be a finitely discriminable variety of groups. Then $\min \{1\leq r<\omega :F_{r}(\mathbf{V})$ discriminates $\mathbf{V}\}$ is the \textbf{index of discrimination} of $\mathbf{V}$. If $m$ is the index of discrimination of $\mathbf{V}$, then $D(\mathbf{V})=\{F_{r}(\mathbf{V}% ):m\leq r<\omega \}.$ \end{definition} \begin{theorem} \ [GS] Let $\mathbf{V}$ be a finitely discriminable variety of groups. Let $% r\geq 1$ be a cardinal. Then $F_{r}(\mathbf{V})\equiv _{\forall }F_{s}(% \mathbf{V})$ for all cardinals $s\geq r$ if and only if $F_{r}(\mathbf{V})$ discriminates $\mathbf{V}$. In particular, if $m$ is the index of discrimination of $\mathbf{V}$, then $F_{m}(\mathbf{V})\equiv _{\forall }F_{s}(\mathbf{V})$ for all $m\leq s\leq \omega $. \end{theorem} \begin{theorem} Let $\mathbf{V}$ be a finitely discriminable variety of groups with index of discrimination $m$. Let $G\in \mathbf{V}$ be $F_{m}(\mathbf{V})$ inclusive. If $D(\mathbf{V})$ discriminates $G$, then $G\equiv _{\forall }F_{m}(\mathbf{% V})$. \end{theorem} \noindent \textit{Proof: \ }Assume $D(\mathbf{V})$ discriminates $G$. It will suffice to show that, if% \begin{eqnarray*} u_{j}(x_{1},...,x_{n}) &=&1\ \ \ \ 1\leq j\leq J \\ v_{k}(x_{1},...,x_{n}) &\neq &1\ \ \ \ 1\leq k\leq K \end{eqnarray*}% has a solution $(g_{1},...,g_{n})\in G^{n}$, then it has a solution over $% F_{m}(\mathbf{V})$. Since $D(\mathbf{V})$ discriminates $G$ there is an integer $r\geq m$ and a homomorphism $\psi :G\rightarrow F_{r}(\mathbf{V})$ such that $\psi (v_{k}(g_{1},...,g_{n}))\neq 1$ for all $1\leq k\leq K$. It follows that the primitive sentence $\exists x_{1},...,x_{n}(\wedge _{j}(u_{j}(x_{1},...,x_{n})=1)\wedge \wedge _{k}(v_{k}(x_{1},...,x_{n})\neq 1))$ is true in $F_{r}(\mathbf{V})$. But since $F_{r}(\mathbf{V})\equiv _{\forall }F_{m}(\mathbf{V})$ the above primitive sentence must also be true in $F_{m}(\mathbf{V})$. Hence, the system has a solution over $F_{m}(\mathbf{% V})$. $\blacksquare $ \begin{corollary} Let $\mathbf{V}$ be a finitely discriminable variety of groups with index of discrimination $m$. Let $G\in \mathbf{V}$ be finitely presented relative to $% \mathbf{V}$ and suppose that $G$ is $F_{m}(\mathbf{V})$ inclusive. Then $% G\equiv _{\forall }F_{m}(\mathbf{V})$ if and only if $D(\mathbf{V})$ discriminates $G$. \end{corollary} \noindent \textit{Proof: \ }One direction follows immediately from the theorem. Suppose $G\in \mathbf{V}$ is finitely presented relative to $% \mathbf{V}$, is $F_{m}(\mathbf{V})$ inclusive and $G\equiv _{\forall }F_{m}(% \mathbf{V})$. \ Suppose $_{\mathbf{V}}$is a finite presentation of $G$ relative to $\mathbf{V}$. Let $% w_{k}(a_{1},...,a_{n})$, $1\leq k\leq K$ be finitely many nontrivial elements of $G$. Then the primitive sentence $\exists x_{1},...,x_{n}(\wedge _{j}(R_{j}(x_{1},...,x_{n})=1)\wedge \wedge _{k}(w_{k}(x_{1},...,x_{n})\neq 1))$ holds in $G$; hence, it holds in $F_{m}(\mathbf{V})$ and there is $% (b_{1},...,b_{n})\in F_{m}(\mathbf{V})^{n}$ such that% \begin{eqnarray*} R_{j}(b_{1},...,b_{n}) &=&1\ \ \ \ 1\leq j\leq J \\ w_{k}(b_{1},...,b_{n}) &\neq &1\ \ \ \ 1\leq k\leq K. \end{eqnarray*} It follows that the assignment $a_{i}\mapsto b_{i}$, $1\leq i\leq n$ extends to a homomorphism $\psi :G\rightarrow F_{m}(\mathbf{V})$ such that $\psi (w_{k}(a_{1},...,a_{n}))\neq 1$, $1\leq k\leq K$. $\blacksquare $ \section{\textbf{The Variety }$\mathbf{O}$ \textbf{of All Groups}} In this section we merely review known results about universally free groups (see Definition \ref{uf}). These results will be contrasted later with results for the groups $G\equiv _{\forall }F_{2}(\mathbf{B}_{p})$ where $p$ is an Adian-Sirvanjan prime. If $\mathbf{O}$ is the variety of all groups and $r\geq 1$ is a cardinal, then we write $F_{r}$ for $F_{r}(\mathbf{O})$. $% F_{\omega }$ embeds in $F_{2}$. For example, the commutator subgroup $% [F_{2},F_{2}]$ of $F_{2}$ is free of countably infinite rank. Now let $2\leq r\leq \omega $. Then $F_{\omega }\cong \lbrack F_{2},F_{2}]\leq F_{r}\leq F_{\omega }$ from which it follows that $F_{r}\equiv _{\forall }F_{s}$ for all cardinals $2\leq r1$ and the result is true for all $1\leq k1$ and the result is true for all $k\,\,$% with $1\leq k0$ since $% C\neq 1$. Thus, if the analog of the Grushko-Neumann corollary holds for $% \mathbf{B}_{p}$, then $G$ cannot be free in $\mathbf{B}_{p}$. Suppose the finite rank free groups $F_{r}(\mathbf{B}_{p})$, $2\leq r<\omega $ \ are Hopfian. As just argued, if $G$ were free in $\mathbf{B}_{p}$, then $% rank(G)=2$. Say $G$ were freely generated by $b_{1}$and $b_{2}$. Now let $% \psi :G\rightarrow G$ be the endomorphism determined by $\psi _{1}:B\rightarrow G$, $\psi _{2}:C\rightarrow G$ where $\psi _{1}$ is the homomorphism determined by $a_{i}\mapsto b_{i}$, $i=1,2$, and $\psi _{2}$ is the trivial map $\psi _{2}(x)=1$ for all $x$. Then $\psi $ is an epi-endomorphism with $1\neq C\leq Ker(\psi )$. That would contradict the Hopf property. Hence, if the free groups $F_{r}(\mathbf{B}_{p})$, $2\leq r<\omega $ are Hopfian, then $G$ cannot be free in $\mathbf{B}_{p}$. As far as we know it also is an open question as to whether or not these free groups $F_{r}(\mathbf{B}_{p})$ are Hopfian. \pagebreak \section{\protect\bigskip \textbf{Questions}} Let $G$ be a group and let $n$ be a positive integer. Let $\langle x_{1},...,x_{n};~\rangle $ be free on the $n$ distinct elements $% x_{1},...,x_{n}$. Let $w\in G\ast \langle x_{1},...,x_{n};~\rangle $. View the formal expression $w=1$ as an equation over $G$ in the variables $% x_{1},...,x_{n}$. Now every assignment $x_{i}\mapsto g_{i}\in G$, $i=1,...,n$% , extends to a unique retraction $\psi :G\ast \langle x_{1},...,x_{n};~\rangle \rightarrow G$. Call the tuple $(g_{1},...,g_{n})% \in G^{n}$ a \textit{solution to }$w=1$ provided $w\in Ker(\psi )$. For each subset $S\subseteq G\ast \langle x_{1},...,x_{n};~\rangle $, let $% V_{G}(S)\subseteq G^{n}$ be the solution set to the system $w=1$, $w\in S$ of equations. $G$ is \textit{equationally Noetherian} provided for every positive integer $n$ and every subset $S\subseteq G\ast \langle x_{1},...,x_{n};~\rangle $ there is a finite subset $S_{0}\subseteq S$ such that $V_{G}(S)=V_{G}(S_{0})$. \bigskip \textbf{Question 1:}\textit{\ If }$n$\textit{\ is an Adian-Sirvanjan integer and }$r\geq 2$\textit{\ is an integer must }$F_{r}(B_{n})$\textit{\ be equationally Noetherian?} \bigskip \textbf{Question 2}(Philip Hall)\textbf{:}\textit{\ If }$V$\textit{\ is a variety of groups of prime power exponent and }$P\in V$\textit{\ is projective relative to }$V$\textit{\ must }$P$\textit{\ be free in }$V$% \textit{?} \bigskip \textbf{Question 3:}\textit{\ Suppose we define the Rank of a group to be the minimum cardinality of a set of generators. Let }$p$\textit{\ be an Adian-Sirvanjan prime and let }$\ast _{p}$\textit{\ be the coproduct in }$% B_{p}$\textit{. If }$G_{1},G_{2}\in B_{p}$\textit{\ must }$Rank(G_{1}\ast _{p}G_{2})=Rank(G_{1})+Rank(G_{2})$\textit{?} \bigskip \textbf{Question 4: }\textit{If }$p$\textit{\ is an Adian-Sirvanjan prime and }$r\geq 2$\textit{\ is an integer must }$F_{r}(B_{p})$\textit{\ be Hopfian?} \textit{\bigskip } \textbf{Question 5: }\textit{If }$n$ \textit{is an Adian-Sirvanjan integer and }$H\in \mathbf{B}_{n}$ \textit{is finitley generated and universally equivalent to }$F_{2}(\mathbf{B}_{n})$ \textit{must }$H$ \textit{be embeddable in some }$F_{r}(\mathbf{B}_{n})$? \bigskip \textbf{Question 6: }\textit{If }$n$\textit{\ is an Adian-Sirvanjan integer and }$2\leq r