Related papers: There are exponentially many ternary words that av…
This paper has been withdraw by the auhor due to a mistake in classification of the algebra
This paper has been withdrawn by the author due to a crucial error in the formulation.
In this paper has been withrawn by the author due the error in the proof of theoem 1.
This paper is withdrawn.
This paper has been withdrawn by the author, due to a counter example to step 6.2 indicated by K. Karu.
This paper has been withdrawn by the author due to a critical error in the proof of Theorem 5.4 on which the proof of the main theorem on the non-simplenss was based.
This paper has been withdrawn as it has been superseded by 0808.2697
The paper has been withdrawn because the proof of part (b) of the main theorem is incomplete.
This paper has been withdrawn.
Let $s_n$ be the number of words consisting of the ternary alphabet consisting of the digits 0, 1, and 2 such that no subword (or factor) is a square (a word concatenated with itself, e.g., $11$, $1212$, or $102102$). From computational…
This paper has been withdrawn by the author due to an error.
This paper is withdrawn. We found a mistake in Lemma 4.1
This paper has been withdrawn by the authors due to a crucial error in eqn 27.
This paper has being withdrawn by the authors due to an error in the conclusion.
An elementary gap in the proof of corollary 2.2 was found, the claim in the first version of the paper is thus retracted.
This paper has been temporarily withdrawn for corrections.
The paper was withdrawn due to a gap in the proof of Lemma 3.
This paper has been withdrawn by the author. Much simpler proof of the main result was obtained which led to major changes in the presentation.
This paper has been withdrawn. See v1 still available to understand the problem: Proposition 2.2 is false. The error in the proof is in claim (3). Then, the whole paper collapses. We do not have any correction for now. We apologize to…
There have been gaps found in the proofs. The paper is withdrawn until further notice.