Young–Fibonacci Lattice

In mathematics, the Young–Fibonacci graph and Young–Fibonacci lattice, named after Alfred Young and Leonardo Fibonacci, are two closely related structures involving sequences of the digits 1 and 2. Any digit sequence of this type can be assigned a ''rank'', the sum of its digits: for instance, the rank of 11212 is 1 + 1 + 2 + 1 + 2 = 7. As was already known in ancient India, the number of sequences with a given rank is a Fibonacci number. The Young–Fibonacci lattice is an infinite modular lattice having these digit sequences as its elements, compatible with this rank structure. The Young–Fibonacci graph is the graph of this lattice, and has a vertex for each digit sequence. As the graph of a modular lattice, it is a modular graph and after the Fibonacci number of their elements at any given rank.

Digit sequences with a given rank

A digit sequence with rank may be formed either by adding the digit 2 to a sequence with rank , or by adding the digit 1 to a sequence with rank . If is the function that maps to the number of different digit sequences of that rank, therefore, satisfies the recurrence relation defining the Fibonacci numbers, but with slightly different initial conditions: (there is one rank-0 string, the empty string, and one rank-1 string, consisting of the single digit 1). These initial conditions cause the sequence of values of to be shifted by one position from the Fibonacci numbers: .

In the ancient Indian study of prosody, the Fibonacci numbers were used to count the number of different sequences of short and long syllables with a given total length; if the digit 1 corresponds to a short syllable, and the digit 2 corresponds to a long syllable, the rank of a digit sequence measures the total length of the corresponding sequence of syllables. See the Fibonacci number article for details.

Graphs of digit sequences

The Young–Fibonacci graph is an infinite graph, with a vertex for each string of the digits "1" and "2" (including the empty string). The neighbors of a string ''s'' are the strings formed from ''s'' by one of the following operations:
#Insert a "1" into ''s'', prior to the leftmost "1" (or anywhere in ''s'' if it does not already contain a "1").
#Change the leftmost "1" of ''s'' into a "2".
#Remove the leftmost "1" from ''s''.
#Change a "2" that does not have a "1" to the left of it into a "1".
It is straightforward to verify that each operation can be inverted: operations 1 and 3 are inverse to each other, as are operations 2 and 4. Therefore, the resulting graph may be considered to be undirected. However, it is usually considered to be a directed acyclic graph in which each edge connects from a vertex of lower rank to a vertex of higher rank.

As both and observe, this graph has the following properties:
*It is connected: any nonempty string may have its rank reduced by some operation, so there is a sequence of operations leading from it to the empty string, reversing which gives a directed path in the graph from the empty string to every other vertex.
*It is compatible with the rank structure: every directed path has length equal to the difference in ranks of its endpoints.
*For every two distinct nodes ''u'' and ''v'', the number of common immediate predecessors of ''u'' and ''v'' equals the number of common immediate successors of ''u'' and ''v''; this number is either zero or one.
*The out-degree of every vertex equals one plus its in-degree.
calls a graph with these properties a ''Y''-graph; calls a graph with a weaker version of these properties (in which the numbers of common predecessors and common successors of any pair of nodes must be equal but may be greater than one) the graph of a differential poset.

Partial order and lattice structure

The transitive closure of the Young–Fibonacci graph is a partial order. As shows, any two vertices ''x'' and ''y'' have a unique greatest common predecessor in this order (their ''meet'') and a unique least common successor (their ''join''); thus, this order is a lattice, called the Young–Fibonacci lattice.

To find the meet of and , one may first test whether one of and is a predecessor of the other. A string is a predecessor of another string in this order exactly when the number of "2" digits remaining in , after removing the longest common suffix of and , is at least as large as the number of all digits remaining in after removing the common suffix. If is a predecessor of according to this test, then their meet is , and similarly if is a predecessor of then their meet is . In a second case, if neither nor is the predecessor of the other, but one or both of them begins with a "1" digit, the meet is unchanged if these initial digits are removed. And finally, if both and begin with the digit "2", the meet of and may be found by removing this digit from both of them, finding the meet of the resulting suffixes, and adding the "2" back to the start.

A common successor of and (though not necessarily the least common successor) may be found by taking a string of "2" digits with length equal to the longer of and . The least common successor is then the meet of the finitely many strings that are common successors of and and predecessors of this string of "2"s.

As further observes, the Young–Fibonacci lattice is modular. incorrectly claims that it is distributive; however, the sublattice formed by the strings forms a diamond sublattice, forbidden in distributive lattices.

References

*. Translated from ''Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR'' 155: 156–175, 1986.
*.

{{DEFAULTSORT:Young-Fibonacci lattice
Lattice theory
Fibonacci numbers
Combinatorics on words
Individual graphs
Infinite graphs