In mathematics and computer science, a stack-sortable permutation (also called a tree permutation) is a permutation whose elements may be sorted byâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- Adeline Pierrot, Dominique Rossin
- ArXiv
- 2013

In the 60â€™s, Knuth introduced stack-sorting and serial compositions of stacks. In particular, one significant question arise outâ€¦Â (More)

Is this relevant?

2011

2011

Pattern avoidance in the symmetric group Sn has provided a number of useful connections between seemingly unrelated problems fromâ€¦Â (More)

Is this relevant?

2008

2008

We analyzed a varved sequence of sediment from a 350-m depth in the north basin of Lake Malawi, East Africa, for the sizeâ€¦Â (More)

Is this relevant?

2008

2008

- Petter BrÃ¤ndÃ©n
- Eur. J. Comb.
- 2008

We study a group action on permutations due to Foata and Strehl and use it to prove that the descent generating polynomial ofâ€¦Â (More)

Is this relevant?

2007

2007

- Rose M Carter
- 2007

The Late Oligocene to Recent Canterbury Drifts were deposited in water depths between c. 400 and c. 1500 m by northward-flowingâ€¦Â (More)

Is this relevant?

1993

1993

- Julian West
- Theor. Comput. Sci.
- 1993

West, J., Sorting twice through a stack, Theoretical Computer Science 117 (1993) 303-313 We consider the operation of stackâ€¦Â (More)

Is this relevant?