Two Enriched Poset Polytopes

IF 0.6 4区数学 Q4 MATHEMATICS, APPLIED

Annals of Combinatorics Pub Date : 2023-12-22 DOI:10.1007/s00026-023-00679-7

Soichi Okada, Akiyoshi Tsuchiya

引用次数: 0

Abstract

Stanley introduced and studied two lattice polytopes, the order polytope and chain polytope, associated with a finite poset. Recently, Ohsugi and Tsuchiya introduce an enriched version of them, called the enriched order polytope and enriched chain polytope. In this paper, we give a piecewise-linear bijection between these enriched poset polytopes, which is an enriched analogue of Stanley’s transfer map and bijectively proves that they have the same Ehrhart polynomials. Also, we construct explicitly unimodular triangulations of two enriched poset polytopes, which are the order complexes of graded posets.

Abstract Image

查看原文本刊更多论文

两个丰富的 Poset 多面体

斯坦利提出并研究了与有限正集相关的两个格状多面体--阶多面体和链多面体。最近，Ohsugi 和 Tsuchiya 引入了它们的丰富版本，称为丰富阶多胞形和丰富链多胞形。在本文中，我们给出了这些富集正多胞形之间的片线性偏射，这是斯坦利转移映射的富集类似物，并偏射地证明了它们具有相同的艾哈特多项式。此外，我们还构造了两个丰富正多胞形的显式单模三角剖分，它们都是分级正多胞形的阶复数。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Annals of Combinatorics 数学-应用数学

CiteScore

1.00

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： Annals of Combinatorics publishes outstanding contributions to combinatorics with a particular focus on algebraic and analytic combinatorics, as well as the areas of graph and matroid theory. Special regard will be given to new developments and topics of current interest to the community represented by our editorial board. The scope of Annals of Combinatorics is covered by the following three tracks: Algebraic Combinatorics: Enumerative combinatorics, symmetric functions, Schubert calculus / Combinatorial Hopf algebras, cluster algebras, Lie algebras, root systems, Coxeter groups / Discrete geometry, tropical geometry / Discrete dynamical systems / Posets and lattices Analytic and Algorithmic Combinatorics: Asymptotic analysis of counting sequences / Bijective combinatorics / Univariate and multivariable singularity analysis / Combinatorics and differential equations / Resolution of hard combinatorial problems by making essential use of computers / Advanced methods for evaluating counting sequences or combinatorial constants / Complexity and decidability aspects of combinatorial sequences / Combinatorial aspects of the analysis of algorithms Graphs and Matroids: Structural graph theory, graph minors, graph sparsity, decompositions and colorings / Planar graphs and topological graph theory, geometric representations of graphs / Directed graphs, posets / Metric graph theory / Spectral and algebraic graph theory / Random graphs, extremal graph theory / Matroids, oriented matroids, matroid minors / Algorithmic approaches