Abstract
The well-known combinatorial lemma of Karpovsky, Milman and Alon and a very recent one of Kerr and Li are extended. The obtained lemmas are applied to study the maximal pattern entropy introduced in the paper. It turns out that the maximal pattern entropy is equal to the supremum of sequence entropies over all sequences both in topological and measure-theoretical settings. Moreover, it is shown the maximal pattern entropy of any topological system is log k for some k ∈ N ∪ { ∞ } with k the maximal length of intrinsic sequence entropy tuples; and a zero-dimensional system has zero sequence entropy for any sequence if and only if the maximal pattern with respect to any open cover is of polynomial order.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
