Jump to content

Lattice word

Edit links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Addbot (talk | contribs) at 06:54, 20 March 2013 (Bot: Migrating 1 interwiki links, now provided by Wikidata on d:q3325035). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

  • Fulton, William (1997), Young tableaux, London Mathematical Society Student Texts, vol. 35, Cambridge University Press, ISBN 978-0-521-56144-0; 978-0-521-56724-4, MR1464693 {{citation}}: Check |isbn= value: invalid character (help)
Retrieved from "https://en.wikipedia.org/w/index.php?title=Lattice_word&oldid=545620558"