Skip to search formSkip to main contentSkip to account menu>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2020

2020

Number the cells of a (possibly infinite) chessboard in some way with the numbers 0, 1, 2, ... Consider the cells in order… Expand

2015

2015

According to a result of Richomme, Saari and Zamboni, the abelian complexity of the Tribonacci word satisfies $\rho^{\mathrm{ab… Expand

2014

2014

Abstract In this article we study symmetric subsets of Rauzy fractals of unimodular irreducible Pisot substitutions. The symmetry… Expand

2014

2014

There is a long tradition, going back to Hadamard and Morse, of associating symbolic infinite words with dynamical systems coming… Expand

2013

2013

We propose a technique for exploring the abelian complexity of recurrent infinite words, focusing particularly on infinite words… Expand

2013

2013

This paper deals with balances and imbalances in Arnoux–Rauzy words. We provide sufficient conditions for C-balancedness, but our… Expand

2013

2013

We prove that every free group of finite rank can be realized as the fundamental group of a planar Rauzy fractal associated with… Expand

2008

2008

We propose a variation of Wythoff's game on three piles of tokens, in the sense that the losing positions can be derived from the… Expand

Review

2002

Review

2002

Sturmian words are infinite words over a two-letter alphabet that admit a great number of equivalent definitions. Most of them… Expand

1997

1997

Let (Nn,(+1)n) be the adic system associated to the substitution: 1 → 12,…,(n − 1) → 1n, n → 1. In Sirvent (1996) it was shown… Expand