Found 2 document(s)
Page 1 of 1
-
Lascoux and Schützenberger introduced a notion of key associated to any Young tableau. More recently Lascoux defined the key of an alternating sign matrix by recursively removing all -1's in such matrices. But alternatin...
-
We prove a lemma that is useful to get upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into une...