4 papers
Variations on Hammersley's interacting particle process
Arda Atalik, H. S. Melihcan Erol, Gökhan Yıldırım +1
The longest increasing subsequence problem for permutations has been studied extensively in the last fifty years. The interpretation of the longest increasing subsequence as the lo…
The longest increasing subsequence in involutions avoiding 3412 and another pattern
Toufik Mansour, Reza Rastegar, Alexander Roitershtein +1
In this note, we study the mean length of the longest increasing subsequence of a uniformly sampled involution that avoids the pattern and another pattern.
Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences
Toufik Mansour, Gökhan Yıldırım
We study the longest increasing subsequence problem for random permutations avoiding the pattern and another pattern under the uniform probability distribution. We determ…
Enumerations of bargraphs with respect to corner statistics
Toufik Mansour, Gökhan Yıldırım
We study the enumeration of bargraphs with respect to some corner statistics. We find generating functions for the number of bargraphs that tracks the corner statistics of interest…