{"title":"What is $$-Q$$ - Q for a poset Q?","authors":"Taiga Yoshida, Masahiko Yoshinaga","doi":"10.1007/s11083-022-09600-y","DOIUrl":null,"url":null,"abstract":"<p>In the context of combinatorial reciprocity, it is a natural question to ask what “<span>\\(-Q\\)</span>” is for a poset <i>Q</i>. In a previous work, the definition “<span>\\(-Q:=Q\\times \\mathbb {R}\\)</span> with lexicographic order” was proposed based on the notion of Euler characteristic of semialgebraic sets. In fact, by using this definition, Stanley’s reciprocity for order polynomials was generalized to an equality for the Euler characteristics of certain spaces of increasing maps between posets. The purpose of this paper is to refine this result, that is, to show that these spaces are homeomorphic if the topology of <i>Q</i> is metrizable.</p>","PeriodicalId":501237,"journal":{"name":"Order","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Order","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s11083-022-09600-y","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In the context of combinatorial reciprocity, it is a natural question to ask what “\(-Q\)” is for a poset Q. In a previous work, the definition “\(-Q:=Q\times \mathbb {R}\) with lexicographic order” was proposed based on the notion of Euler characteristic of semialgebraic sets. In fact, by using this definition, Stanley’s reciprocity for order polynomials was generalized to an equality for the Euler characteristics of certain spaces of increasing maps between posets. The purpose of this paper is to refine this result, that is, to show that these spaces are homeomorphic if the topology of Q is metrizable.