arXiv 2302.017742023-02-03math.COmath.QAmath.RT

Poset Structure concerning Cylindric Diagrams

Kento Nakada, Takeshi Suzuki, Yoshitaka Toyosawa

英文摘要：

The purpose of the present paper is to give a realization of a cylindric diagram as a subset of root systems of type $A_{κ-1}^{(1)}$ and several characterization of its poset structure. Furthermore, the set of order ideals of a cylindric diagram is described as a weak Bruhat interval of the Weyl group.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Cylindric $P$-Tableaux for (3+1)-Free Posets

For a $(3+1)$-free poset $P$, we define a hybrid of $P$-tableaux and cylindric tableaux called cylindric $P$-tableaux. We introduce $P$-analogs of cylindric Schur functions, defined by a determinantal formula, and prove that they are the weight generating functions of cylindric $P$-tableaux. We deduce that certain sums of the $e$-expansion coefficients of the chromatic symmetric function $X_{inc(P)}$ are positive. This improves on Gasharov's theorem on the Schur positivity of $X_{inc(P)}$ and gives further evidence for the Stanley-Stembridge conjecture.

2022-11-09math.CO

On a conjecture about enumerating $(2+2)$-free posets

Recently, Kitaev and Remmel posed a conjecture concerning the generating function for the number of unlabeled $(2+2)$-free posets with respect to number of elements and number of minimal elements. In this paper, we present a combinatorial proof of this conjecture.

2010-06-16math.CO

Chain Decomposition Theorems for Ordered Sets (and Other Musings)

A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can be partitioned into chains in a ``strong'' way, is proved. The result is motivated by a conjecture of Graham's concerning probability correlation inequalities for linear extensions of finite posets.

1997-07-16math.CO

The Dyck pattern poset

We introduce the notion of pattern in the context of lattice paths, and investigate it in the specific case of Dyck paths. Similarly to the case of permutations, the pattern-containment relation defines a poset structure on the set of all Dyck paths, which we call the Dyck pattern poset. Given a Dyck path P, we determine a formula for the number of Dyck paths covered by P, as well as for the number of Dyck paths covering P. We then address some typical pattern-avoidance issues, enumerating some classes of pattern-avoiding Dyck paths. Finally, we offer a conjecture concerning the asymptotic beh…

2013-03-15math.CO

On Hook Formulas for Cylindric Skew Diagrams

We present a conjectual hook formula concerning the number of the standard tableaux on "cylindric" skew diagrams. Our formula can be seen as an extension of Naruse's hook formula for skew diagrams. Moreover, we prove our conjecture in some special cases.

2021-06-17math.CO

Posets and spaces of $k$-noncrossing RNA Structures

RNA molecules are single-stranded analogues of DNA that can fold into various structures which influence their biological function within the cell. RNA structures can be modelled combinatorially in terms of a certain type of graph called an RNA diagram. In this paper we introduce a new poset of RNA diagrams $\mathcal{B}^r_{f,k}$, $r\ge 0$, $k \ge 1$ and $f \ge 3$, which we call the Penner-Waterman poset, and, using results from the theory of multitriangulations, we show that this is a pure poset of rank $k(2f-2k+1)+r-f-1$, whose geometric realization is the join of a simplicial sphere of dimen…

2022-04-13math.CO

更多相关论文收起更多论文

提升弱序在类型A和B中的三次实现

Lifting Cubic Realizations of Weak Orders in Types A and B

研究兼容投影映射的三次正则化结构，引入预Reeb图和增强预Reeb图以控制兼容的三次提升和兼容顺序嵌入的三次提升，应用于弱序类型A和B的删除塔。

2026-04-24math.COmath.GR

The $ν$-Tamari lattice via $ν$-trees, $ν$-bracket vectors, and subword complexes

We give new interpretations of the $ν$-Tamari lattice of Préville-Ratelle and Viennot. First, we describe it as a rotation lattice of $ν$-trees, which uncovers the relation with known combinatorial objects such as tree-like tableaux and north-east fillings. Then, using a formulation in terms of bracket vectors of $ν$-trees and componentwise order, we provide a simple description of the lattice property. We also show that the $ν$-Tamari lattice is isomorphic to the increasing-flip poset of a suitably chosen subword complex, and settle a special case of Rubey's lattice conjecture concerning the …

2019-10-07math.CO

有限全序集上的模型结构

Model structures on finite total orders

本文开创同伦组合学，研究格偏序集上的模型结构，并在有限全序集上枚举所有模型结构，揭示其由 Shapiro Catalan 三角形编码的组合规律。

2023-04-19math.ATmath.CO