Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
-- We consider the classes Tn of substitutions of degree n whose cycle lengths belong to a set A C N, where the set is completely determined by a given regularly varying function g(t) and a finite union of intervals from [0, 1]. We find the asymptotics of the number of elements of Tn as --> oo. The limit theorems on the total number of cycles and the number of cycles of a fixed length in random substitutions uniformly distributed on Tn are proved. This paper continues the investigations started in [1]. 1. INTRODUCTION Let a function g(t) for t > 1 and a finite union of intervals from [0, 1] be given. A number m 6 is included in the set A if and only if {g(m)} e , where {a} is the fractional part of a number a. Let Tn denote the totality of substitutions of degree whose cycle lengths belong to A, let |Tn| denote the number of such substitutions, and let be the Lebesgue measure of . We assume that for some non-integer and a function l(t) slowly varying on infinity 5(0 = /(0, and for = 1, . . . , [] +
Discrete Mathematics and Applications – de Gruyter
Published: Jan 1, 1993
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.