HOME

TheInfoList



OR:

In the mathematical theory of
non-standard positional numeral systems Non-standard positional numeral systems here designates numeral systems that may loosely be described as positional systems, but that do not entirely comply with the following description of standard positional systems: :In a standard positional ...
, the Komornik–Loreti constant is a
mathematical constant A mathematical constant is a number whose value is fixed by an unambiguous definition, often referred to by a special symbol (e.g., an Letter (alphabet), alphabet letter), or by mathematicians' names to facilitate using it across multiple mathem ...
that represents the smallest base ''q'' for which the number 1 has a unique representation, called its ''q''-development. The constant is named after Vilmos Komornik and Paola Loreti, who defined it in 1998.


Definition

Given a real number ''q'' > 1, the series : x = \sum_^\infty a_n q^ is called the ''q''-expansion, or \beta-expansion, of the positive real number ''x'' if, for all n \ge 0, 0 \le a_n \le \lfloor q \rfloor, where \lfloor q \rfloor is the
floor function In mathematics, the floor function is the function that takes as input a real number , and gives as output the greatest integer less than or equal to , denoted or . Similarly, the ceiling function maps to the least integer greater than or eq ...
and a_n need not be an
integer An integer is the number zero (0), a positive natural number (1, 2, 3, ...), or the negation of a positive natural number (−1, −2, −3, ...). The negations or additive inverses of the positive natural numbers are referred to as negative in ...
. Any real number x such that 0 \le x \le q \lfloor q \rfloor /(q-1) has such an expansion, as can be found using the
greedy algorithm A greedy algorithm is any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage. In many problems, a greedy strategy does not produce an optimal solution, but a greedy heuristic can yield locally ...
. The special case of x = 1, a_0 = 0, and a_n = 0 or 1 is sometimes called a q-development. a_n = 1 gives the only 2-development. However, for almost all 1 < q < 2, there are an infinite number of different q-developments. Even more surprisingly though, there exist exceptional q \in (1,2) for which there exists only a single q-development. Furthermore, there is a smallest number 1 < q < 2 known as the Komornik–Loreti constant for which there exists a unique q-development.Weissman, Eric W. "q-expansion" Fro
Wolfram MathWorld
Retrieved on 2009-10-18.


Value

The Komornik–Loreti constant is the value q such that : 1 = \sum_^\infty \frac where t_k is the
Thue–Morse sequence In mathematics, the Thue–Morse or Prouhet–Thue–Morse sequence is the binary sequence (an infinite sequence of 0s and 1s) that can be obtained by starting with 0 and successively appending the Boolean complement of the sequence obtained thus ...
, i.e., t_k is the parity of the number of 1's in the
binary representation A binary number is a number expressed in the base-2 numeral system or binary numeral system, a method for representing numbers that uses only two symbols for the natural numbers: typically "0" (zero) and "1" (one). A ''binary number'' may also ...
of k. It has approximate value : q=1.787231650\ldots. \,Weissman, Eric W. "Komornik–Loreti Constant." Fro
Wolfram MathWorld
Retrieved on 2010-12-27.
The constant q is also the unique positive real solution to the equation : \prod_^\infty \left ( 1 - \frac \right ) = \left ( 1 - \frac \right )^ - 2. This constant is transcendental.


See also

*
Euler-Mascheroni constant Euler's constant (sometimes called the Euler–Mascheroni constant) is a mathematical constant, usually denoted by the lowercase Greek letter gamma (), defined as the limiting difference between the harmonic series and the natural logarith ...
*
Fibonacci word A Fibonacci word is a specific sequence of Binary numeral system, binary digits (or symbols from any two-letter Alphabet (formal languages), alphabet). The Fibonacci word is formed by repeated concatenation in the same way that the Fibonacci num ...
* Golay–Rudin–Shapiro sequence *
Prouhet–Thue–Morse constant In mathematics, the Prouhet–Thue–Morse constant, named for , Axel Thue, and Marston Morse, is the number—denoted by —whose binary expansion 0.01101001100101101001011001101001... is given by the Prouhet–Thue–Morse sequence. That is, : ...


References

{{DEFAULTSORT:Komornik-Loreti constant Mathematical constants Non-standard positional numeral systems