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.
Examplesedit
For instance, 11122121 is a lattice permutation, so 12122111 is a Yamanouchi word, but 12122111 is not a lattice permutation, since the prefix 12122 contains more 2s than 1s.
lattice, word, mathematics, lattice, word, lattice, permutation, string, composed, positive, integers, which, every, prefix, contains, least, many, positive, integers, integers, reverse, lattice, word, yamanouchi, word, string, whose, reversal, lattice, word, . 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 editFor instance 11122121 is a lattice permutation so 12122111 is a Yamanouchi word but 12122111 is not a lattice permutation since the prefix 12122 contains more 2s than 1s See also editDyck wordReferences editFulton William 1997 Young tableaux London Mathematical Society Student Texts vol 35 Cambridge University Press ISBN 978 0 521 56724 4 MR 1464693 Macdonald Ian G 1995 Symmetric functions and Hall polynomials Oxford Mathematical Monographs Second ed The Clarendon Press and Oxford University Press ISBN 0 19 853489 2 MR 1354144 Retrieved from https en wikipedia org w index php title Lattice word amp oldid 1148038390, wikipedia, wiki, book, books, library,
