The blocker $A^{*}$ of an antichain $A$ in a finite poset $P$ is the set of elements minimal with the property of having with each member of $A$ a common predecessor. The following is done:
1. The posets $P$ for which $A^{**}=A$ for all antichains are characterized.
2. The blocker $A^*$ of a symmetric antichain in the partition lattice is characterized.
3. Connections with the question of finding minimal size blocking sets for certain set families are discussed.
An order-theoretic generalization of Seymour relations describing the connection between the set-theoretic blocker, deletion, and contraction maps on clutters, is presented.
Antichains of a finite bounded poset are assigned antichains playing a role analogous to that played by blockers in the Boolean lattice of all subsets of a finite set. Some properties of lattices of generalized blockers are discussed.
In this note we consider a Ramsey type result for partially ordered sets. In particular, we give an alternative short proof of a theorem for a posets with multiple linear extensions recently obtained by Solecki and Zhao.
A poset is called upper homogeneous (or "upho") if every principal order filter of the poset is isomorphic to the whole poset. We observe that the rank and characteristic generating functions of upho posets are multiplicative inverses of one another.
These lecture notes for the IAS/Park City Graduate Summer School in Geometric Combinatorics (July 2004) provide an overview of poset topology. These notes include introductory material, as well as recent developments and open problems. Some of the topics covered are: subspace arrangements, graph complexes, group actions on poset homology, shellability, recursive techniques, and fiber theorems.
In this note we introduce the poset of $m$-multichains of a given poset $\mathcal{P}$. Its elements are the multichains of $\mathcal{P}$ consisting of $m$ elements, and its partial order is the componentwise partial order of $\mathcal{P}$. We show that this construction preserves a number of poset-theoretic and poset-topological properties of $\mathcal{P}$. Moreover, we describe the structure of the poset of $m$-multichains of a finite distributive lattice, and provide a link to R.~Stanley's theory of $\mathcal{P}$-partitions.
The explicit formula for mobiusien function of fibonacci cobweb poset P is given for the first time by the use of definition of P in plane grid coordinate system.
In this short note, we relate the boxicity of graphs (and the dimension of posets) with their generalized coloring parameters. In particular, together with known estimates, our results imply that any graph with no $K_t$-minor can be represented as the intersection of $O(t^2\log t)$ interval graphs (improving the previous bound of $O(t^4)$), and as the intersection of $\tfrac{15}2 t^2$ circular-arc graphs.
In this note, we determine the maximum size of a $\{V_{k}, Λ_{l}\}$-free family in the lattice of vector subspaces of a finite vector space both in the non-induced case as well as the induced case, for a large range of parameters $k$ and $l$. These results generalize earlier work by Shahriari and Yu. We also prove a general LYM-type lemma for the linear lattice which resolves a conjecture of Shahriari and Yu.
This paper gives another proof of Propp and Roby's theorem saying that the average antichain size in any reverse operator orbit of the poset $[m]\times [n]$ is $\frac{mn}{m+n}$. It is conceivable that our method should work for other situations. As a demonstration, we show that the average size of antichains in any reverse operator orbit of $[m]\times K_{n-1}$ equals $\frac{2mn}{m+2n-1}$. Here $K_{n-1}$ is the minuscule poset $[n-1]\oplus ([1] \sqcup [1]) \oplus [n-1]$. Note that $[m]\times [n]$ and $[m]\times K_{n-1}$ can be interpreted as sub-families of certain root posets. We guess these r…
We prove that in every cover of a Young diagram with $\binom{2k}{k}$ steps with generalized rectangles there is a row or a column in the diagram that is used by at least $k+1$ rectangles. We show that this is best-possible by partitioning any Young diagram with $\binom{2k}{k}-1$ steps into actual rectangles, each row and each column used by at most $k$ rectangles. This answers two questions by Kim et al. (2018). Our results can be rephrased in terms of local covering numbers of difference graphs with complete bipartite graphs, which has applications in the recent notion of local dimension of p…
In this note, we introduce a new poset parameter called local $t$-dimension. We also discuss the fractional variants of this and other dimension-like parameters.
This note is a response to one of problems posed by A.K. Kwasniewski in one of his recent papers. Namely for the sequence of finite cobweb subposets, the looked for explicit formulas for corresponding sequence of characteristic polynomials are discovered and delivered here. The recurrence relation defining arbitrary family of charactristic polynomials of finite cobweb posets is also derived.
In section 1 we consider a 3-tuple $S=(|S|,\preccurlyeq,E)$ where $|S|$ is a finite set, $\preccurlyeq$ a partial ordering on $|S|,$ and $E$ a set of unordered pairs of distinct members of $|S|,$ and study, as a function of $n\geq 0,$ the number of maps $φ:|S|\to\{1,\dots,n\}$ which are both isotone with respect to the ordering $\preccurlyeq,$ and have the property that $φ(x)\neq φ(y)$ whenever $\{x,y\}\in E.$ We prove a number-theoretic result about this function, and use it in section 7 to recover a ring-theoretic identity of G. P. Hochschild. In section 2 we generalize a result of R. Stanle…
Let $G$ be a simple, undirected, finite graph with vertex set $V(G)$ and edge set $E(G)$. A $k$-dimensional box is a Cartesian product of closed intervals $[a_1,b_1]\times [a_2,b_2]\times...\times [a_k,b_k]$. The {\it boxicity} of $G$, $\boxi(G)$ is the minimum integer $k$ such that $G$ can be represented as the intersection graph of $k$-dimensional boxes, i.e. each vertex is mapped to a $k$-dimensional box and two vertices are adjacent in $G$ if and only if their corresponding boxes intersect. Let $\poset=(S,P)$ be a poset where $S$ is the ground set and $P$ is a reflexive, anti-symmetric and…
The paper "Grothendieck Topologies on Posets" by A.J. Lindenhovius shows that when $\mathbf{P}$ is an Artinian poset and $\mathbf{E}$ is the topos $\mathbf{Set}^\mathbf{P}$ then there are bijections between the set of subsets of $\mathbf{P}$, the set of Grothendieck topologies on $\mathbf{E}$, and the set of nuclei on the Heyting Algebra $\mathrm{Sub}(1_\mathbf{E})$. It also shows that there are nice formulas for converting between subsets, Grothendieck topologies, and nuclei, but the formula for converting a nucleus to a subset is not spelled out explicitly. These notes fix that gap.
It is well-known that an antichain in the poset $[0,1]^n$ must have measure zero. Engel, Mitsis, Pelekis and Reiher showed that in fact it must have $(n-1)$-dimensional Hausdorff measure at most $n$, and they conjectured that this bound can be attained. In this note we show that, for every $n$, such an antichain does indeed exist.
We consider the generating polynomial of the number of rooted trees on the set $\{1,2,\dots,n\}$ counted by the number of descending edges (a parent with a greater label than a child). This polynomial is an extension of the descent generating polynomial of the set of permutations of a totally ordered $n$-set, known as the Eulerian polynomial. We show how this extension shares some of the properties of the classical one. B. Drake proved that this polynomial factors completely over the integers. From his product formula it can be concluded that this polynomial has positive coefficients in the $γ…
