Average length of the longest increasing subsequences in random involutions avoiding 231 and a layered pattern
Main Authors: | Toufik Mansour, Chunwei Song |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics Letters
2020-09-01
|
Series: | Discrete Mathematics Letters |
Subjects: | |
Online Access: | https://www.dmlett.com/archive/v4/DML20_v4_p56_59.pdf |
Similar Items
-
The Distribution of the Length of the Longest Increasing Subsequence in Random Permutations of Arbitrary Multi-sets
by: Al-Meanazel, Ayat
Published: (2015) -
Small Longest Tandem Scattered Subsequences
by: Luıs M. S. Russo, et al.
Published: (2021-08-01) -
Variations on Hammersley’s interacting particle process
by: Arda Atalik, et al.
Published: (2021-06-01) -
Using the longest run subsequence problem within homology-based scaffolding
by: Sven Schrinner, et al.
Published: (2021-06-01) -
Using the longest run subsequence problem within homology-based scaffolding
by: Goel, M., et al.
Published: (2021)