2000 character limit reached
The Encoding of Natural Numbers as Nested Parentheses Strings with Associated Probability Distributions
Published 14 Nov 2012 in cs.DM and math.CO | (1211.3428v1)
Abstract: We provide an efficient encoding of the natural numbers {0,1,2,3,...} as strings of nested parentheses {(),(()),(()()),((())),...}, or considered inversely, an efficient enumeration of such strings. The technique is based on the recursive definition of the Catalan numbers. The probability distributions arising from this encoding are explored. Applications of this encoding to prefix-free data encoding and recursive function theory are briefly considered.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.