Abstract
Each digit in a finite alphabet labels an element of a set M of 2 x 2 column-allowable matrices with nonnegative entries; the right inhomogeneous product of these matrices is made up to rank n, according to a given one-sided sequence of digits; then, the n-step matrix is multiplied by a fixed vector with positive entries. Our main result provides a characterization of those M for which the direction of the n-step vector is convergent toward a limit continuous w.r.t. to the digits sequence. The applications are concerned with Bernoulli convolutions and the Gibbs properties of linearly representable measures.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.