We show that there are $n!$ matchings on $2n$ points without, so called, left (neighbor) nestings. We also define a set of naturally labeled $(2+2)$-free posets, and show that there are $n!$ such posets on $n$ elements. Our work was inspired by Bousquet-Mélou, Claesson, Dukes and Kitaev [J. Combin. Theory Ser. A. 117 (2010) 884--909]. They gave bijections between four classes of combinatorial objects: matchings with no neighbor nestings (due to Stoimenow), unlabeled $(2+2)$-free posets, permutations avoiding a specific pattern, and so called ascent sequences. We believe that certain statistics on our matchings and posets could generalize the work of Bousquet-Mélou et al.\ and we make a conjecture to that effect. We also identify natural subsets of matchings and posets that are equinumerous to the class of unlabeled $(2+2)$-free posets.
We give bijections that show the equivalence of (neighbor) restrictions on nesting arcs with (neighbor) restrictions on crossing arcs. These bijections are thought to be of independent interest. One of the bijections maps via certain upper-triangular integer matrices that have recently been studied by Dukes and Parviainen [Electron. J. Combin. 17 (2010) \#R53]
Given a graded poset $P$, consider a chain decomposition $\mathcal{C}$ of $P$. If $|C_1|\le |C_2|$ implies that the set of the ranks of elements in $C_1$ is a subset of the ranks of elements in $C_2$ for any chains $C_1,C_2\in \mathcal{C}$, then we say $\mathcal{C}$ is a nested chain decomposition (or nesting, for short) of $P$, and $P$ is said to be nested. In 1970s, Griggs conjectured that every normalized matching rank-unimodal poset is nested. This conjecture is proved to be true only for all posets of rank 2 [W:05], some posets of rank 3 [HLS:09,ENSST:11], and the very special cases for h…
$k$-distant crossings and nestings of matchings and partitions
我们定义并考虑k-远交叉和嵌套的匹配和设置分区，这是一个变化的交叉和嵌套中，顶点之间的距离是很重要的。通过修改Kasraoui和Zeng（Electronic J. Combinatorics 2006，研究论文33）的对合，我们证明了k-远距离交叉和嵌套的联合分布是对称的。我们还研究了小k时k-距离非交叉匹配和划分的个数，以及与k-距离非交叉匹配和划分有关的正交多项式。我们扩展Chen et al.的R交叉和增强的R交叉。
Special partial matchings (SPMs) are a generalisation of Brenti's special matchings. Let a \emph{pircon} be a poset in which every non-trivial principal order ideal is finite and admits an SPM. Thus pircons generalise Marietti's zircons. We prove that every open interval in a pircon is a PL ball or a PL sphere. It is then demonstrated that Bruhat orders on certain twisted identities and quasiparabolic $W$-sets constitute pircons. Together, these results extend a result of Can, Cherniavsky, and Twelbeck, prove a conjecture of Hultman, and confirm a claim of Rains and Vazirani.
We prove that the number of perfect matchings in ${\mathcal G}(n,d)$ is asymptotically normal when $n$ is even, $d\to\infty$ as $n\to\infty$, and $d=O(n^{1/7}/\log^2 n)$. This is the first distributional result of spanning subgraphs of ${\mathcal G}(n,d)$ when $d\to\infty$. Moreover, we prove that ${\mathcal G}(n,d-1)$ and ${\mathcal G}(n,d)$ can be coupled so that ${\mathcal G}(n,d-1)$ is a subgraph of ${\mathcal G}(n,d)$ with high probability when $d\to\infty$ and $d=o(n^{1/3})$. Further, if $d=Ω(\log^7 n)$, $d=O(n^{1/7}/\log^2n)$, and $d\le d'\le n-1$ then ${\mathcal G}(n,d)$ and ${\mathcal…
A matching of the set $[2n]=\{ 1,2,\ldots ,2n\}$ is a partition of $[2n]$ into blocks with two elements, i.e. a graph on $[2n]$ such that every vertex has degree one. Given two matchings $σ$ and $τ$ , we say that $σ$ is a pattern of $τ$ when $σ$ can be obtained from $τ$ by deleting some of its edges and consistently relabelling the remaining vertices. This is a partial order relation turning the set of all matchings into a poset, which will be called the matching pattern poset. In this paper, we continue the study of classes of pattern avoiding matchings, initiated by Chen, Deng, Du, Stanley a…
We introduce a Morse theory for posets of Bestvina-Brady type combining matchings and height functions. This theory generalizes Forman's discrete Morse theory for regular CW-complexes and extends previous results on Morse theory for $h$-regular posets to all finite posets. We also develop a relative version of Morse theory which allows us to compare the topology of a poset with that of a given subposet.
A direct encoding of Stoimenow's matchings as ascent sequences
与瓦西里耶夫的结不变量有关，Stoimenow（1998）引入了某些匹配，也称为正则线性化弦图。Bousquet-Melou et al.（2008）给出了从这些匹配到未标记的（2+2）-free偏序集的双射;他们还展示了如何将偏序集编码为所谓的上升序列。在本文中，我们提出了一个直接编码的Stoimenow的匹配上升序列。在这样做的时候，我们递归地构造和解构这样的匹配的规则。
Eulerian-type polynomials over matchings and matching permutations
School of Mathematics and Statistics, Shandong University of Technology（山东理工大学数学与统计学院）；Department of Mathematics and Statistics, University of Strathclyde（斯特拉斯克莱德大学数学与统计系）；Department of Mathematics, National Kaohsiung Normal University（国立高雄师范大学数学系）；College of Mathematics and Physics, Wenzhou University（温州大学数理学院）
It is well known that every stable matching instance $I$ has a rotation poset $R(I)$ that can be computed efficiently and the downsets of $R(I)$ are in one-to-one correspondence with the stable matchings of $I$. Furthermore, for every poset $P$, an instance $I(P)$ can be constructed efficiently so that the rotation poset of $I(P)$ is isomorphic to $P$. In this case, we say that $I(P)$ realizes $P$. Many researchers exploit the rotation poset of an instance to develop fast algorithms or to establish the hardness of stable matching problems. In order to gain a parameterized understanding of the …
We define, for any special matching of a finite graded poset, an idempotent, regressive and order preserving function. We consider the monoid generated by such functions. The idempotents of this monoid are called special idempotents. They are interval retracts. Some of them realize a kind of parabolic map and are called special projections. We prove that, in Eulerian posets, the image of a special projection, and its complement, are graded induced subposets. In a finite Coxeter group, all projections on right and left parabolic quotients are special projections, and some projections on double …
Graph product is a fundamental tool with rich applications in both graph theory and theoretical computer science. It is usually studied in the form $f(G*H)$ where $G$ and $H$ are graphs, * is a graph product and $f$ is a graph property. For example, if $f$ is the independence number and * is the disjunctive product, then the product is known to be multiplicative: $f(G*H)=f(G)f(H)$. In this paper, we study graph products in the following non-standard form: $f((G\oplus H)*J)$ where $G$, $H$ and $J$ are graphs, $\oplus$ and * are two different graph products and $f$ is a graph property. We show t…
