1. Examples

2. See also

3. References

In mathematics, a lattice word (or lattice permutation) is a string composed of positive integers, in which every prefix contains at least as many positive integers i as integers i + 1.

A reverse lattice word, or Yamanouchi word, is a string whose reversal is a lattice word.

Examples

For instance, 11122121 is a lattice permutation, so 12122111 is a Yamanouchi word, but 12122111 is not a lattice permutation, since the sub-word 12122 contains more two's than one's.

See also

• Dyck word

References

• {{Citation | last1=Fulton | first1=William | author1-link=William Fulton (mathematician) | title=Young tableaux | publisher=Cambridge University Press | series=London Mathematical Society Student Texts |isbn= 978-0-521-56724-4 |mr=1464693 | year=1997 | volume=35}}
• {{Citation | last1=Macdonald | first1=Ian G. | author1-link=Ian G. Macdonald | title=Symmetric functions and Hall polynomials | edition=Second | series=Oxford Mathematical Monographs | publisher=The Clarendon Press and Oxford University Press | year=1995 | isbn=0-19-853489-2 |mr=1354144 }}

• Convention of El Pardo
• Convention of El Pardo (1728)
• Convention of El Pardo (1739)
• Convention of estates of scotland
• Convention of gramido
• Convention of Gramido
• Convention of Hanover
• Convention of Helsingör
• Convention of Istanbul
• Convention of kanagawa
• Convention of Klasterzeven
• Convention of Klaterzeven
• Convention of Kloster-haven
• Convention of Klosterseven
• Convention of Klosterzeven
• Convention of Kloster-Zeven
• Convention of klosterzeven
• Convention of kutahya
• Convention of Kütahya
• Convention of London (1786)
• Convention of London (1840)
• Convention of London (1861)
• Convention of mantua
• Convention of Montevideo
• Convention of Montreux