| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4648530 | Discrete Mathematics | 2011 | 8 Pages |
Abstract
We consider several coding discretizations of continuous functions which reflect their variation at some given precision. We study certain statistical and combinatorial properties of the sequence of finite words obtained by coding a typical continuous function when the diameter of the discretization tends to zero. Our main result is that any finite word appears on a subsequence discretization with any desired limit frequency.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Cristobal Rojas, Serge Troubetzkoy,