English
Related papers

Related papers: The poset of proper divisibility

200 papers

We consider the poset of vector partitions of $[n]$ into $s$ components, denoted $\Pi_{n,s}$, which was first defined by Stanley in 1978. In 1986, Sagan showed that this poset is CL-shellable, and hence has the homotopy type of a wedge of…

Combinatorics · Mathematics 2015-06-16 Natalie Aisbett

In this paper, we are concerned with identifying among the family of posets associated with Kohnert polynomials, those whose order complex has a certain combinatorial property. In particular, for numerous families of Kohnert polynomials,…

Combinatorics · Mathematics 2024-04-29 Celia Kerr , Nicholas W. Mayers , Nicholas Russoniello

Let $I_n$ be the set of involutions in the symmetric group $S_n$, and for $A \subseteq \{0,1,\ldots,n\}$, let \[ F_n^A=\{\sigma \in I_n \mid \text{$\sigma$ has $a$ fixed points for some $a \in A$}\}. \] We give a complete characterisation…

Combinatorics · Mathematics 2015-02-13 Mikael Hansson

In their work on `Coxeter-like complexes', Babson and Reiner introduced a simplicial complex $\Delta_T$ associated to each tree $T$ on $n$ nodes, generalizing chessboard complexes and type A Coxeter complexes. They conjectured that…

Combinatorics · Mathematics 2008-09-16 Patricia Hersh

A partially ordered set P is representable if there is a bounded distributive lattice such that its ordered set of prime ideals is order-isomorphic to P. We show that if the order components of a poset P are representable, then so is P.…

Logic · Mathematics 2007-05-30 Michael E. Adams , Dominic van der Zypen

We consider a polynomial $P\in \mathbb{R}[x_{1},\cdots, x_{d}]$ of degree $ \delta $ that depends non-trivially on each of $x_1,...,x_d$ with $d\geq 2$. For any integer $t$ with $2\leq t\leq d$, any natural number $n \in \mathbb{N}$, and…

Combinatorics · Mathematics 2026-03-09 Yewen Sun

The notion of level posets is introduced. This class of infinite posets has the property that between every two adjacent ranks the same bipartite graph occurs. When the adjacency matrix is indecomposable, we determine the length of the…

Combinatorics · Mathematics 2014-06-10 Richard Ehrenborg , Gábor Hetyei , Margaret Readdy

In this paper, we give a new algebraic criterion for the {\em shellability} of (non-pure) simplicial complex $\Delta$ over $[n]$, shellable in the sense of Bj\"orner and Wachs \cite{BW}. We show that the spanning simplicial complex of…

Commutative Algebra · Mathematics 2017-04-20 Imran Anwar , Zunaira Kosar , Shaheen Nazir , Khurram Shabbir

A poset $\mathbf{P} = (X,\preceq)$ is {\em $m$-partite} if $X$ has a partition $X = X_1 \cup ... \cup X_m$ such that (1) each $X_i$ forms an antichain in $\mathbf{P}$, and (2) $x\prec y$ implies $x\in X_i$ and $y\in X_j$ where $i<j$. In…

Combinatorics · Mathematics 2007-06-12 Geir Agnarsson

We investigate the poset (P(X),\subset), where P(X) is the set of isomorphic suborders of a countable ultrahomogeneous partial order X. For X different from (resp. equal to) a countable antichain the order types of maximal chains in…

Logic · Mathematics 2017-09-26 Milos S. Kurilic , Borisa Kuzeljevic

For $G=G_{n, 1/2}$, the Erd\H{o}s--Renyi random graph, let $X_n$ be the random variable representing the number of distinct partitions of $V(G)$ into sets $A_1, \ldots, A_q$ so that the degree of each vertex in $G[A_i]$ is divisible by $q$…

Combinatorics · Mathematics 2022-11-23 Paul Balister , Emil Powierski , Alex Scott , Jane Tan

Bj\"orner and Wachs introduced CL-shellability as a technique for studying the topological structure of order complexes of partially ordered sets (posets). They also introduced the notion of recursive atom ordering, and they proved that a…

Combinatorics · Mathematics 2024-08-23 Patricia Hersh , Grace Stadnyk

For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…

Category Theory · Mathematics 2007-05-23 Roman R. Zapatrin

We prove a conjecture of Thomas Lam that the face posets of stratified spaces of planar resistor networks are shellable. These posets are called uncrossing partial orders. This shellability result combines with Lam's previous result that…

Combinatorics · Mathematics 2024-08-27 Patricia Hersh , Richard Kenyon

The Dushnik-Miller dimension of a partially-ordered set $P$ is the smallest $d$ such that one can embed $P$ into a product of $d$ linear orders. We prove that the dimension of the divisibility order on the interval $\{1, \dotsc, n\}$, is…

Combinatorics · Mathematics 2021-01-18 David Lewis , Victor Souza

Suppose $P_n=\{1,2,...,n\}$ is a partially ordered set with the partial order defined by divisibility, that is, for any two distinct elements $i,j\in P_n$ satisfying $i$ divides $j$, $i<_{P_n} j$. A table $A_n=\{a_i|i=1,2,...,n\}$ of…

Discrete Mathematics · Computer Science 2007-05-23 Yongxi Cheng , Xi Chen , Yiqun Lisa Yin

We are interested in ordering the elements of a subset A of the non-zero integers modulo n in such a way that all the partial sums are distinct. We conjecture that this can always be done and we prove various partial results about this…

Combinatorics · Mathematics 2015-01-28 D. S. Archdeacon , J. H. Dinitz , A. Mattern , D. R. Stinson

We prove that the second derived subdivision of any rectilinear triangulation of any convex polytope is shellable. Also, we prove that the first derived subdivision of every rectilinear triangulation of any convex 3-dimensional polytope is…

Combinatorics · Mathematics 2015-03-20 Karim Alexander Adiprasito , Bruno Benedetti

This paper establishes a link between the theory of cluster algebras and the theory of representations of partially ordered sets. We introduce a class of posets by requiring avoidance of certain types of peak-subposets and show that these…

Representation Theory · Mathematics 2019-12-17 Ralf Schiffler , Robinson-Julian Serna

We study two partial orders on $[x_1,...,x_n]$, the free abelian monoid on ${x_1,...,x_n}$. These partial orders, which we call the ``strongly stable'' and the ``stable'' partial order, are defined by the property that their filters are…

Combinatorics · Mathematics 2007-05-23 Jan Snellman