2015/09/30 by Sergi Elizalde, Yuval Roichman
Biochemistry, Genetics and Molecular Biology · Mathematics · #Advanced Combinatorial Mathematics #Algebraic number #Bijection, injection and surjection #Construct (python library) #Function (biology) #Genome Rearrangement Algorithms #Grid #Limits and Structures in Graph Theory #Product (mathematics) #Set (abstract data type) #math.CO #msc:05A05 #msc:05A15 #msc:05A19 #msc:05E05 #msc:05E10 #msc:05E18
paper · pdf · doi:10.1007/s10801-016-0710-x
Final version to appear in J. Algebraic Combin
openalex created_date 2016/06/24 · openalex publication_date 2016/09/09 · arxiv created 2016/10/31 · arxiv updated 2016/11/01 · openalex updated_date 2026/08/05
Characterizing sets of permutations whose associated quasisymmetric function is symmetric and Schur-positive is a long-standing problem in algebraic combinatorics. In this paper we present a general method to construct Schur-positive sets and multisets, based on geometric grid classes and the product operation. Our approach produces many new instances of Schur-positive sets, and provides a broad framework that explains the existence of known such sets that until now were sporadic cases.