Two mathematical aspects of the centuries-old Japanese sashiko stitching form hitomezashi
are discussed: the encoding of designs using words from a binary alphabet, and duality …

In this paper we introduce a family of infinite words that generalize the Fibonacci word and
we study their combinatorial properties. We associate with this family of words a family of …

We introduce the k-bonacci polyominoes, a new family of polyominoes associated with the
binary words avoiding k consecutive 1's, also called generalized k-bonacci words. The …

We use a decision procedure for the “Fibonacci-automatic” words to solve problems about a
number of different sequences. In particular, we prove that there exists an aperiodic infinite …

We implement a decision procedure for answering questions about a class of infinite words
that might be called (for lack of a better name)" Fibonacci-automatic". This class includes, for …

In this paper, we introduce the p-circle inversion which generalizes the classical inversion
with respect to a circle (p= 2) and the taxicab inversion (p= 1). We study some basic …

We analyze a natural parity problem on the divisors associated to Sturmian words. We find a
clear bias towards the odd divisors and prove a sharp asymptotic estimate for the average of …

We study the combinatorial properties and the problem of generating exhaustively double
square tiles, ie polyominoes yielding two distinct periodic tilings by translated copies such …

Acta Polytechnica Page 1 doi:10.14311/AP.2015.55.0050 Acta Polytechnica 55(1):50–58,
2015 © Czech Technical University in Prague, 2015 available online at http://ojs.cvut.cz/ojs/index.php/ap …

On the k-Fibonacci words Page 1 Acta Univ. Sapientiae, Informatica, 5, 2 (2013) 212–226 On
the k-Fibonacci words José L. RAMÍREZ Instituto de Matemáticas y sus Aplicaciones …