Browsing by Author "Mansour, T."
Now showing 1 - 4 of 4
- Results Per Page
- Sort Options
Item Open Access A decomposition of column-convex polyominoes and two vertex statistics(Springer, 2022-04-27) Cakić, N.; Mansour, T.; Yıldırım, GökhanWe introduce a decomposition method for column-convex polyominoes and enumerate them in terms of two statistics: the number of internal vertices and the number of corners in the boundary. We first find the generating function for the column-convex polyominoes according to the horizontal and vertical half-perimeter, and the number of interior vertices. In particular, we show that the average number of interior vertices over all column-convex polyominoes of perimeter 2n is asymptotic to αon3 / 2 where αo≈ 0.57895563 …. We also find the generating function for the column-convex polyominoes according to the horizontal and vertical half-perimeter, and the number of corners in the boundary. In particular, we show that the average number of corners over all column-convex polyominoes of perimeter 2n is asymptotic to α1n where α1≈ 1.17157287 …. © 2022, The Author(s), under exclusive licence to Springer Nature Switzerland AG.Item Open Access Enumerations of bargraphs with respect to corner statistics(University of Belgrade, 2020) Mansour, T.; Yıldırım, GökhanWe study the enumeration of bargraphs with respect to some corner statistics. We find generating functions for the number of bargraphs that track the corner statistics of interest, the number of cells, and the number of columns. We also consider bargraph representation of set partitions and obtain some explicit formulas for the number of specific types of corners in such representations.Item Open Access Longest increasing subsequences in involutions avoiding patterns of length three(TÜBİTAK, 2019-07) Mansour, T.; Yıldırım, GökhanWe study the longest increasing subsequences in random involutions that avoid the patterns of length three under the uniform probability distribution. We determine the exact and asymptotic formulas for the average length of the longest increasing subsequences for such permutation classes.Item Open Access Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences(Elsevier, 2020) Mansour, T.; Yıldırım, GökhanWe study the longest increasing subsequence problem for random permutations avoiding the pattern 312 and another pattern τ under the uniform probability distribution. We determine the exact and asymptotic formulas for the average length of the longest increasing subsequences for such permutation classes specifically when the pattern τ is monotone increasing or decreasing, or any pattern of length four.