Coding discretizations of continuous functions
classification
🧮 math.DS
keywords
codingcontinuousdiscretizationdiscretizationsfinitefunctionsappearscertain
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.