Abstract
We investigate permutations and involutions that avoid a pattern of length three and have a {\em unique} longest increasing subsequence.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.