<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05870283</id>
  <dt>a</dt>
  <an>05870283</an>
  <augroup>
    <au>Burstein, Alexander</au>
    <au>Eriksen, Niklas</au>
  </augroup>
  <ti>Combinatorial properties of permutation tableaux.</ti>
  <so>Linton, Steve (ed.) et al., Permutation patterns. Proceedings of the 5th conference, Fife, Scotland, June 11--15, 2007. Cambridge: Cambridge University Press (ISBN 978-0-521-72834-8/pbk). London Mathematical Society Lecture Note Series 376, 171-192 (2010).</so>
  <py>2010</py>
  <pu>Cambridge: Cambridge University Press</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
  </ligroup>
  <abgroup>
    <ab>Summary: We give another construction of a permutation tableau from its corresponding permutation and construct a permutation-preserving bijection between 1-hinge and 0-hinge tableaux. We also consider certain alignment and crossing statistics on permutation tableaux that are known to be equidistributed via a complicated map to permutations that translates those to occurrences of certain patterns. We give two direct maps on tableaux that proves the equidistribution of those statistics by exchanging some statistics and preserving the rest. Finally, we enumerate some sets of permutations that are restricted both by pattern avoidance and by certain parameters of their associated permutation tableaux.</ab>
    <rv></rv>
  </abgroup>
</item>