Searcharxiv⌕ Search

arXiv · 0705.3076

Posets of annular non-crossing partitions of types B and D

Abstract

We study the set $\sncb (p,q)$ of annular non-crossing permutations of type B, and we introduce a corresponding set $\ncb (p,q)$ of annular non-crossing partitions of type B, where $p$ and $q$ are two positive integers. We prove that the natural bijection between $\sncb (p,q)$ and $\ncb (p,q)$ is a poset isomorphism, where the partial order on $\sncb (p,q)$ is induced from the hyperoctahedral group $B_{p+q}$, while $\ncb (p,q)$ is partially ordered by reverse refinement. In the case when $q=1$, we prove that $\ncb (p,1)$ is a lattice with respect to reverse refinement order. We point out that an analogous development can be pursued in type D, where one gets a canonical isomorphism between $\sncd (p,q)$ and $\ncd (p,q)$. For $q=1$, the poset $\ncd (p,1)$ coincides with a poset ``$NC^{(D)} (p+1)$'' constructed in a paper by Athanasiadis and Reiner in 2004, and is a lattice by the results of that paper.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexandru Nica, Ion Oancea. 2008-02-12. Posets of annular non-crossing partitions of types B and D. https://arxiv.org/abs/0705.3076

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Partitioning perfect graphs into comparability graphs

We study how many comparability subgraphs are needed to partition the edge set of a perfect graph. We show that many classes of perfect graphs can be partitioned into (at most) two comparability subgraphs and this holds for almost all perfect graphs. On the other hand, we prove that for interval graphs an arbitrarily large number of comparability subgraphs might be necessary.

math.CO↗

On the homogeneity problem of the Kazhdan-Lusztig ideals

In this paper, our purpose is to find some techniques to identify inhomogeneous Kazhdan-Lusztig ideals. A set of generators of a Kazhdan-Lusztig ideal corresponds to some minors in some southwest submatrices inside some ambient matrix. We have defined a notion called a path inside a square matrix as a tool to work with determinants of the above mentioned minors. Using paths, we derive necessary and sufficient conditions for when such minors are inhomogeneous, singular, non-singular, and when there is divisibility between two terms of two such distinct minors. As a conclusion, we first provide an algorithm through which we can identify some sufficient conditions for a Kazhdan-Lusztig ideal to be inhomogeneous (by utilizing all the above mentioned results). Secondly, we provide certain sufficient conditions for a Kazhdan-Lusztig ideal to be standard homogeneous, and then we also prove that under certain assumptions, these conditions are also necessary for a Kazhdan-Lusztig ideal to be standard homogeneous.

math.CO↗

Random Permutation Matrices Form a Basis with High Probability

Let $d=(n-1)^2+1$, the dimension of the real linear span of the $n\times n$ permutation matrices. We prove that $d$ independent uniformly random permutation matrices fail to form a basis with probability $(1+o(1))n^2(1-1/n)^d=(e^{3/2}+o(1))n^2e^{-n}$. The same asymptotic holds for a uniformly random $d$-element subset, confirming a conjecture of Kushwaha and Tripathi and identifying the leading obstruction: a matrix position avoided by every sample. More generally, for any fixed number of additional samples, we determine the first three exponential orders of the failure probability. To prove these results, we develop support estimates valid over arbitrary fields, derive Fourier bounds from permanental minors, and introduce a counting argument for concentrated assignment functionals over large prime fields. We also give a sparse lifting argument showing that real rank deficiency without an annihilating functional of small support has probability $o(e^{-Cn})$ for every fixed $C>0$.

math.CO↗