Combinatorics on permutation tableaux of type A and type B (Q2430974)

A \textit{permutation tableau of type A} is a Ferrers diagram with possibly empty rows, whose cells are filled with 0's or 1's so that each column contains at least one 1, and there is no 0 which has a 1 above it in the same column and also a 1 to its left in the same row; \textit{type B permutation tableaux} and \textit{alternative representations} are related combinatorial objects, also based on Ferrers diagrams. The authors give two bijective proofs of an enumerative result of [\textit{S. Corteel} and \textit{P. Nadeau}, ``Bijections for permutation tableaux'', Eur.\ J.\ Comb.\ 30, No.\ 1, 295--310 (2009; Zbl 1167.05003)] concerning permutation tableaux. A column is \textit{unrestricted} if it contains no 0 such that there is a 1 to its left in the same row. From the authors' abstract: ``We find a generating function related to unrestricted columns of permutation tableaux. As a consequence we obtain a sign-imbalance formula for permutation tableaux. We extend the first bijection of Corteel and Nadeau between permutations and permutation tableaux to type B objects. Using this type B bijection we generalize a result of [\textit{T. Lam} and \textit{L. Williams}, ``Total positivity for cominuscule Grassmannians'', New York J.\ Math.\ 14, 53--99 (2008; Zbl 1144.20029)]. We prove that the bijection of Corteel and Nadeau and our type B bijection can be expressed as `zigzag maps' on the alternative representation.''