Related papers: There are k-uniform cubefree binary morphisms for …
Cross-bifix-free sets are sets of words such that no prefix of any word is a suffix of any other word. In this paper, we introduce a general constructive method for the sets of cross-bifix-free binary words of fixed length. It enables us to…
A square is the concatenation of a nonempty word with itself. A word has period p if its letters at distance p match. The exponent of a nonempty word is the quotient of its length over its smallest period. In this article we give a proof of…
A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. An algebra is said to be affine complete if every congruence preserving function is a polynomial…
Let A be a separable unital nuclear purely infinite simple C*-algebra satisfying the Universal Coefficient Theorem, and such that the K_0-class of the identity is zero. We prove that every automorphism of order two of the K-theory of A is…
Let $\Omega$ be a compact subset of $\mathbb{C}$ and let $A$ be a unital simple, separable $C^*$-algebra with stable rank one, real rank zero and strict comparison. We show that, given a Cu-morphism $\alpha:{\rm Cu}(C(\Omega))\to {\rm…
Motivated by applications in the theory of numeration systems and recognizable sets of integers, this paper deals with morphic words when erasing morphisms are taken into account. Cobham showed that if an infinite word $w =g(f^\omega(a))$…
A binary linear code whose permutation automorphism group has a fixed point free permutation of order $3$ is called a binary cubic code. The scope of this paper is to investigate the structural properties of binary cubic codes. Let $C$ be a…
Popa and Schnell show that any holomorphic 1-form on a smooth projective variety of general type has zeros. In this article, we show that a smooth good minimal model has a holomorphic 1-form without zero if and only if it admits an analytic…
A longstanding question of Gromov asks whether every one-ended word-hyperbolic group contains a subgroup isomorphic to the fundamental group of a closed hyperbolic surface. An infinite family of word-hyperbolic groups can be obtained by…
A square-free word $w$ over a fixed alphabet $\Sigma$ is extremal if every word obtained from $w$ by inserting a single letter from $\Sigma$ (at any position) contains a square. Grytczuk et al. recently introduced the concept of extremal…
We characterize the squares occurring in infinite overlap-free binary words and construct various alpha power-free binary words containing infinitely many overlaps.
In an attempt to classify all of the overlap-free morphisms constructively using the Latin-square morphism, we came across an interesting counterexample, the Leech square-free morphism. We generalize the combinatorial properties of the…
A language L is prefix-free if, whenever words u and v are in L and u is a prefix of v, then u=v. Suffix-, factor-, and subword-free languages are defined similarly, where "subword" means "subsequence". A language is bifix-free if it is…
We say that a finite factor $f$ of a word $w$ is \emph{imaged} if there exists a non-erasing morphism $m$, distinct from the identity, such that $w$ contains $m(f)$. We show that every infinite word contains an imaged factor of length at…
Finite-dimensional square-free algebras have been completely characterized by Anderson and D'Ambrosia as certain twisted semigroup algebras over a square-free semigroup S with coefficients in a field K. D'Ambrosia extended the definition of…
A finite connected 2-complex K whose fundamental group is of cohomological dimension 2 is aspherical iff the subgroup \Sigma_K of H_2(K) consisting of spherical 2-cycles is zero. A finite connected subcomplex of an aspherical 2-complex is…
Using a new approach based on automatic sequences, logic, and a decision procedure, we reprove some old theorems about circularly squarefree words and unbordered conjugates in a new and simpler way. Furthermore, we prove three new results…
We construct an explicit example of family of non-uniformly hyperbolic diffeomorphisms, at the boundary of the set of uniformly hyperbolic systems, with one orbit of cubic heteroclinic tangency. One of the leaves involved in this…
A $4^-$-power is a non-empty word of the form $XXXX^-$, where $X^-$ is obtained from $X$ by erasing the last letter. A binary word is called {\em faux-bonacci} if it contains no $4^-$-powers, and no factor 11. We show that faux-bonacci…
We prove that over an algebraically closed field of characteristic not two the problems of classifying pairs of sesquilinear forms in which the second is Hermitian, pairs of bilinear forms in which the second is symmetric (skew-symmetric),…