We give a necessary and sufficient condition for a certain set of infinite products of linear ope... more We give a necessary and sufficient condition for a certain set of infinite products of linear operators to be zero. We shall investigate also the case when this set of infinite products converges to a non-zero operator.
We give an extension of the Fekete's Subadditive Lemma for a set of submultiplicative functionals... more We give an extension of the Fekete's Subadditive Lemma for a set of submultiplicative functionals on countable product of compact spaces. Our method can be considered as an unfolding of he ideas [1]Theorem 3.1 and our main result is the extension of the symbolic dynamics results of .
The König Lemma for infinite trees in Graph Theory says that in an infinite rooted tree with all ... more The König Lemma for infinite trees in Graph Theory says that in an infinite rooted tree with all vertices of finite degree, there is an infinite path starting from the root. In this weighted version we shall show that there is an infinite path with weights greater than a certain average. We shall apply our result to infinite compositions of affine mappings in Rn.
We give a necessary and sufficient condition for a certain set of infinite products of linear ope... more We give a necessary and sufficient condition for a certain set of infinite products of linear operators to be zero. We shall investigate also the case when this set of infinite products converges to a non-zero operator.
We give an extension of the Fekete's Subadditive Lemma for a set of submultiplicative functionals... more We give an extension of the Fekete's Subadditive Lemma for a set of submultiplicative functionals on countable product of compact spaces. Our method can be considered as an unfolding of he ideas [1]Theorem 3.1 and our main result is the extension of the symbolic dynamics results of .
The König Lemma for infinite trees in Graph Theory says that in an infinite rooted tree with all ... more The König Lemma for infinite trees in Graph Theory says that in an infinite rooted tree with all vertices of finite degree, there is an infinite path starting from the root. In this weighted version we shall show that there is an infinite path with weights greater than a certain average. We shall apply our result to infinite compositions of affine mappings in Rn.
Uploads
Papers by László Máté