A word defined over an alphabet is -balanced (
) if for all pairs of factors , of of the same length
and for all letters
, the difference between the number of letters in and is less or equal to . In this paper we consider a ternary alphabet
= {, , } and a class of substitutions defined by () = , () = ,
() = where
1.
We prove that the fixed point of , formally written as (), is 3-balanced and that...
In this paper we will deal with the balance properties of the infinite binary words associated to -integers when is a quadratic simple Pisot number. Those words are the fixed points of the morphisms of the type , for , , , where . We will prove that such word is -balanced with . Finally, in the case that it is known [B. Adamczewski,
(2002) 197–224] that the fixed point of the substitution , is not -balanced for any . We exhibit an infinite sequence of pairs of words...
We study some arithmetical and combinatorial properties of
-integers for being the larger root of the equation
. We determine with
the accuracy of 1 the maximal number of -fractional
positions, which may arise as a result of addition of two
-integers. For the infinite word coding distances
between the consecutive -integers, we determine precisely
also the balance. The word is the only fixed point of the
morphism → and → . In the case ,
the corresponding infinite word is sturmian, and,
therefore,...
It is known that a real symmetric circulant matrix with diagonal entries , off-diagonal entries and orthogonal rows exists only of order (and trivially of order ) [Turek and Goyeneche 2019]. In this paper we consider a complex Hermitian analogy of those matrices. That is, we study the existence and construction of Hermitian circulant matrices having orthogonal rows, diagonal entries and any complex entries of absolute value off the diagonal. As a particular case, we consider matrices whose...
Download Results (CSV)