arXiv subjects

Z. Masáková

Publications and source records attributed to Z. Masáková.

5 recordsLinked to original sources

arXiv2010

Arithmetics in number systems with negative base

We study the numeration system with negative basis, introduced by Ito and Sadahiro. We focus on arithmetic operations in the set ${\rm Fin}(-β)$ and $\Z_{-β}$ of numbers having finite resp. integer $(-β)$-expansions. We show that ${\rm Fin}(-β)$ is trivial if $β$ is smaller than the golden ratio $\frac12(1+\sqrt5)$. For $β\geq\frac12(1+\sqrt5)$ we prove that ${\rm Fin}(-β)$ is a ring, only if $β$ is a Pisot or Salem number with no negative conjugates. We prove the conjecture of Ito and Sadahiro that ${\rm Fin}(-β)$ is a ring if $β$ is a quadratic Pisot number with positive conjugate. For quadratic Pisot units we determine the number of fractional digits that may appear when adding or multiplying two $(-β)$-integers.

math.NT↗

arXiv2010

Arithmetics in numeration systems with negative quadratic base

We consider positional numeration system with negative base $-β$, as introduced by Ito and Sadahiro. In particular, we focus on arithmetical properties of such systems when $β$ is a quadratic Pisot number. We study a class of roots $β>1$ of polynomials $x^2-mx-n$, $m\geq n\geq 1$, and show that in this case the set ${\rm Fin}(-β)$ of finite $(-β)$-expansions is closed under addition, although it is not closed under subtraction. A particular example is $β=τ=\frac12(1+\sqrt5)$, the golden ratio. For such $β$, we determine the exact bound on the number of fractional digits appearing in arithmetical operations. We also show that the set of $(-τ)$-integers coincides on the positive half-line with the set of $(τ^2)$-integers.

math.NT↗

arXiv2007

Characterization of substitution invariant 3iet words

We study infinite words coding an orbit under an exchange of three intervals which have full complexity $\C(n)=2n+1$ for all $n\in\N$ (non-degenerate 3iet words). In terms of parameters of the interval exchange and the starting point of the orbit we characterize those 3iet words which are invariant under a primitive substitution. Thus, we generalize the result recently obtained for sturmian words.

math.CO↗

arXiv2007

Matrices of 3iet preserving morphisms

We study matrices of morphisms preserving the family of words coding 3-interval exchange transformations. It is well known that matrices of morphisms preserving sturmian words (i.e. words coding 2-interval exchange transformations with the maximal possible factor complexity) form the monoid $\{\boldsymbol{M}\in\mathbb{N}^{2\times 2} | \det\boldsymbol{M}=\pm1\} = \{\boldsymbol{M}\in\mathbb{N}^{2\times 2} | \boldsymbol{M}\boldsymbol{E}\boldsymbol{M}^T = \pm\boldsymbol{E}\}$, where $\boldsymbol{E} = (\begin{smallmatrix}0&1 -1&0\end{smallmatrix})$. We prove that in case of exchange of three intervals, the matrices preserving words coding these transformations and having the maximal possible subword complexity belong to the monoid $\{\boldsymbol{M}\in\mathbb{N}^{3\times 3} | \boldsymbol{M}\boldsymbol{E}\boldsymbol{M}^T = \pm\boldsymbol{E},\ \det\boldsymbol{M}=\pm 1\}$, where $\boldsymbol{E} = \Big(\begin{smallmatrix}0&1&1 -1&0&1 -1&-1&0\end{smallmatrix}\Big)$.

math.CO↗

arXiv2007

On a class of infinite words with affine factor complexity

In this article, we consider the factor complexity of a fixed point of a primitive substitution canonically defined by a beta-numeration system. We provide a necessary and sufficient condition on the Renyi expansion of 1 for having an affine factor complexity map C(n), that is, such that C(n)=an+b for any integer n.

math.CO↗