ﻻ يوجد ملخص باللغة العربية
Chen proposed a conjecture on the log-concavity of the generating function for the symmetric group with respect to the length of longest increasing subsequences of permutations. Motivated by Chens log-concavity conjecture, B{o}na, Lackner and Sagan further studied similar problems by restricting the whole symmetric group to certain of its subsets. They obtained the log-concavity of the corresponding generating functions for these subsets by using the hook-length formula. In this paper, we generalize and prove their results by establishing the Schur positivity of certain symmetric functions. This also enables us to propose a new approach to Chens original conjecture.
A classical result by Schoenberg (1942) identifies all real-valued functions that preserve positive semidefiniteness (psd) when applied entrywise to matrices of arbitrary dimension. Schoenbergs work has continued to attract significant interest, incl
Cylindric skew Schur functions, a generalization of skew Schur functions, are closely related to the famous problem finding a combinatorial formula for the 3-point Gromov-Witten invariants of Grassmannian. In this paper, we prove cylindric Schur posi
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.
Let $X=(X_i)_{ige 1}$ and $Y=(Y_i)_{ige 1}$ be two sequences of independent and identically distributed (iid) random variables taking their values, uniformly, in a common totally ordered finite alphabet. Let LCI$_n$ be the length of the longest commo
LLT polynomials are $q$-analogues of product of Schur functions that are known to be Schur-positive by Grojnowski and Haiman. However, there is no known combinatorial formula for the coefficients in the Schur expansion. Finding such a formula also pr