<abstract xmlns="http://www.w3.org/1999/xhtml">

<p>In this note, we study the mean length of the longest increasing subsequence of a uniformly sampled involution that avoids the pattern 3412 and another pattern.</p>
</abstract>

In this note, we study the mean length of the longest increasing subsequence of a uniformly sampled involution that avoids the pattern 3412 and another pattern.

The longest increasing subsequence in involutions avoiding 3412 and another pattern

Houston, TX 77046, Departments of Mathematics and Engineering

Pure Mathematics and Applications

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

The longest increasing subsequence in involutions avoiding 3412 and another pattern

Data publikacji: 13 lut 2023

Zakres stron: 11 - 21

Otrzymano: 20 sty 2021

Przyjęty: 31 sty 2021

DOI: https://doi.org/10.2478/puma-2022-0032

Słowa kluczowe
pattern avoidance, restricted involution, longest increasing subsequence, Ulam’s problem, Motzkin path, generating function

© 2022 Toufik Mansour et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

The longest increasing subsequence in involutions avoiding 3412 and another pattern

Data publikacji: 13 lut 2023

Zakres stron: 11 - 21

Otrzymano: 20 sty 2021

Przyjęty: 31 sty 2021

DOI: https://doi.org/10.2478/puma-2022-0032

Słowa kluczowepattern avoidance, restricted involution, longest increasing subsequence, Ulam’s problem, Motzkin path, generating function

© 2022 Toufik Mansour et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Słowa kluczowe
pattern avoidance, restricted involution, longest increasing subsequence, Ulam’s problem, Motzkin path, generating function