{"title":"Spin Kostka polynomials and vertex operators","authors":"N. Jing, Ning Liu","doi":"10.2140/pjm.2023.325.127","DOIUrl":"https://doi.org/10.2140/pjm.2023.325.127","url":null,"abstract":"An algebraic iterative formula for the spin Kostka-Foulkes polynomial $K^-_{ximu}(t)$ is given using vertex operator realizations of Hall-Littlewood symmetric functions and Schur's Q-functions. Based on the operational formula, more favorable properties are obtained parallel to the Kostka polynomial. In particular, we obtain some formulae for the number of (unshifted) marked tableaux. As an application, we confirmed a conjecture of Aokage on the expansion of the Schur $P$-function in terms of Schur functions. Tables of $K^-_{ximu}(t)$ for $|xi|leq6$ are listed.","PeriodicalId":54651,"journal":{"name":"Pacific Journal of Mathematics","volume":"1 1","pages":""},"PeriodicalIF":0.6,"publicationDate":"2023-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41386687","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A lift of West’s stack-sorting map to partition\u0000diagrams","authors":"John M. Campbell","doi":"10.2140/pjm.2023.324.227","DOIUrl":"https://doi.org/10.2140/pjm.2023.324.227","url":null,"abstract":"We introduce a lifting of West's stack-sorting map $s$ to partition diagrams, which are combinatorial objects indexing bases of partition algebras. Our lifting $mathscr{S}$ of $s$ is such that $mathscr{S}$ behaves in the same way as $s$ when restricted to diagram basis elements in the order-$n$ symmetric group algebra as a diagram subalgebra of the partition algebra $mathscr{P}_{n}^{xi}$. We then introduce a lifting of the notion of $1$-stack-sortability, using our lifting of $s$. By direct analogy with Knuth's famous result that a permutation is $1$-stack-sortable if and only if it avoids the pattern $231$, we prove a related pattern-avoidance property for partition diagrams, as opposed to permutations, according to what we refer to as stretch-stack-sortability.","PeriodicalId":54651,"journal":{"name":"Pacific Journal of Mathematics","volume":" ","pages":""},"PeriodicalIF":0.6,"publicationDate":"2023-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44609646","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}