Pattern avoiding permutations and involutions with a unique longest increasing subsequence

MaRDI QIDQ6337297zbMATH OpenFDO

Authors Miklós Bóna, Elijah Dejonge

Publication date 23 March 2020

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16)

Abstract: We investigate permutations and involutions that avoid a pattern of length three and have a {em unique} longest increasing subsequence.

This page was built for publication: Pattern avoiding permutations and involutions with a unique longest increasing subsequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6337297)