Lattice word

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In mathematics, a lattice word (or lattice permutation) is a sequence of integers such that in every initial part of the sequence any number i occurs at least as often as the number i + 1. A reverse lattice word, or Yamanouchi word, is a sequence whose reversal is a lattice word.

References[edit]