Related papers: Necessary conditions for Schur-maximality
In recent years, there has been considerable interest in showing that certain conditions on skew shapes A and B are sufficient for the difference s_A - s_B of their skew Schur functions to be Schur-positive. We determine necessary…
The Schur-positivity order on skew shapes is defined by B \leq A if the difference s_A - s_B is Schur-positive. It is an open problem to determine those connected skew shapes that are maximal with respect to this ordering. A strong…
In 2007, McNamara proved that two skew shapes can have the same Schur support only if they have the same number of $k\times \ell$ rectangles as subdiagrams. This implies that two ribbons can have the same Schur support only if one is…
There is considerable current interest in determining when the difference of two skew Schur functions is Schur positive. We consider the posets that result from ordering skew diagrams according to Schur positivity, before focussing on the…
Two skew diagrams are defined to be equivalent if their corresponding skew Schur functions are equal. The equivalence classes for ribbons have been classified by Billera, Thomas and van Willigenburg in 2006. In this paper, we provide a…
New sufficient conditions and necessary conditions are developed for two skew diagrams to give rise to the same skew Schur function. The sufficient conditions come from a variety of new operations related to ribbons (also known as border…
We consider the problem of determining when the difference of two ribbon Schur functions is a single Schur function. We fully classify the five infinite families of pairs of ribbon Schur functions whose difference is a single Schur function…
Some new relations on skew Schur function differences are established both combinatorially using Sch\"utzenberger's jeu de taquin, and algebraically using Jacobi-Trudi determinants. These relations lead to the conclusion that certain…
We consider ribbon shapes, not necessarily connected, whose rows, with at least two boxes in each, are in monotone length order. These ribbons are uniquely defined by a pair of partitions: the row partition consisting of the row lengths in…
While equality of skew Schur functions is well understood, the problem of determining when two skew Schur $Q$ functions are equal is still largely open. It has been studied in the case of ribbon shapes in 2008 by Barekat and van…
Reiner, Shaw and van Willigenburg showed that if two skew Schur functions s_A and s_B are equal, then the skew shapes A and B must have the same "row overlap partitions." Here we show that these row overlap equalities are also implied by a…
We prove that the set of matchings with a fixed number of unmatched vertices is Schur-positive with respect to the set of short chords. Two proofs are presented. The first proof applies a new combinatorial criterion for Schur-positivity,…
We present a unified study of first and second order necessary and sufficient optimality conditions for minimax and Chebyshev optimisation problems with cone constraints. First order optimality conditions for such problems can be formulated…
A graph is Schur-positive if its chromatic symmetric function expands non-negatively in the Schur basis. We determine a full Schur-positivity classification for complete multipartite graphs by showing that a complete multipartite graph…
We compare several versions of the quantitative Schur property of Banach spaces. We establish their equivalence up to multiplicative constants and provide examples clarifying when the change of constants is necessary. We also give exact…
Schur's inequality states that the sum of three special terms is always nonnegative. This note is a short review of inequalities for the sum of the reciprocals of these terms and of extensions of the latter inequalities to an arbitrary…
Let $\lambda$, $\mu$, $\lambda'$, $\mu'$ be partitions. The conjecture of Lam, Postnikov and Pylyavskyy states that, if $\lambda+\mu = \lambda' + \mu'$, and $\min(\lambda_i-\lambda_j, \mu_i-\mu_j) \leq \lambda'_i - \lambda'_j \leq…
We define an equivalence relation on integer compositions and show that two ribbon Schur functions are identical if and only if their defining compositions are equivalent in this sense. This equivalence is completely determined by means of…
Let $\mathcal A = \{A_{ij} \}_{i, j \in \mathcal I}$, where $\mathcal I$ is an index set, be a doubly indexed family of matrices, where $A_{ij}$ is $n_i \times n_j$. For each $i \in \mathcal I$, let $\mathcal V_i$ be an $n_i$-dimensional…
A set $A$ of integers is said to be Schur if any two-colouring of $A$ results in monochromatic $x,y$ and $z$ with $x+y=z$. We study the following problem: how many random integers from $[n]$ need to be added to some $A\subseteq [n]$ to…