arXiv · 1805.06301
Finite Information Numbers through the Inductive Combinatorial Hierarchy
Abstract
We report on a recent conjecture by Gisin on a restriction of physical processes in sets of finite information numbers (FIN) and further analyze the entropic constraint associated with the proposed algorithm. In the course, we provide a decomposition of binary entropies in a pair of fractal sequences as functional composites of binary digit-sum functions and we construct a unique formula and an abstract partition function for these. We also prove, based on a previously introduced tool of the inductive combinatorial hierarchies that the naturally inherited self-similarity of the resulting hierarchy of entropic sets contains equivalence classes providing unlimited symbolic series for satisfying the demand posed by the FIN conjecture.
Explore related subjects
Keep this discovery
Theophanes E. Raptis. 2018-05-14. Finite Information Numbers through the Inductive Combinatorial Hierarchy. https://arxiv.org/abs/1805.06301
Cite the original work for its findings. Save a collection to share your selection of sources.