Related papers: Relative blocking in posets
We study the problem of checking whether an existential sentence (that is, a first-order sentence in prefix form built using existential quantifiers and all Boolean connectives) is true in a finite partially ordered set (in short, a poset).…
The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. It has been a challenging open problem to determine which posets have real-rooted chain polynomials. Two new classes of…
We study families of infinite block sequences of elements of the space $\FIN_k$. In particular we study Ramsey properties of such families and Ramsey properties localized to a selective or semiselective coideal. We show how the stable…
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 introduce the blockwise gluing construction. This describes residuated integral chains which can be decomposed into (possibly) partial algebras, stacked one on top of the other, and such that elements in a certain component multiply in…
We classify finite posets with a particular sorting property, generalizing a result for rectangular arrays. Each poset is covered by two sets of disjoint saturated chains such that, for any original labeling, after sorting the labels along…
We call a poset factorable if its characteristic polynomial has all positive integer roots. Inspired by inductive and divisional freeness of a central hyperplane arrangement, we introduce and study the notion of inductive posets and their…
We introduce $\delta$-cliffs, a generalization of permutations and increasing trees depending on a range map $\delta$. We define a first lattice structure on these objects and we establish general results about its subposets. Among them, we…
A chain poset, by definition, consists of chains of ordered elements in a poset. We study the chain posets associated to two posets: the Boolean algebra and the poset of isotropic flags. We prove that, in both cases, the chain posets…
We generalize the concept of combinatorial nested set complexes to posets and exhibit the topological relationship between the arising nested set complexes and the order complex of the underlying poset. In particular, a sufficient condition…
We show that every poset P=(P,\le) satisfying the Ascending Chain Condition can be isomorphically embedded into the poset of all mappings from P to the set A(P) of all antichains of P equipped with a certain partial order relation. This…
Given a symmetric monoidal category $C$ with product $\sqcup$, where the neutral element for the product is an initial object, we consider the poset of $\sqcup$-complemented subobjects of a given object $X$. When this poset has finite…
Vector fields with components which are generalized zero-forms are constructed. Inner products with generalized forms, Lie derivatives and Lie brackets are computed. The results are shown to generalize previously reported results for…
We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…
In this paper, we study the posets of classes of subgroups of finite group having same set of orders of elements. We show that this poset is a chain only in the case of p-groups and moreover, we characterize all finite groups for which this…
Bivariate generating functions for various subsets of the class of permutations containing no descending sequence of length three or more are determined. The notion of absolute indecomposability of a permutation is introduced, and used in…
In this article we discuss the operations of partitions (sequence of disjoint finite subsets) which are quotient, insertion, composition and Lie bracket. Moreover, we discuss applications of those operations for Feymman diagrams and…
We introduce so-called consistent posets which are bounded posets with an antitone involution ' where the lower cones of x,x' and of y,y' coincide provided x,y are different form 0,1 and, moreover, if x,y are different form 0 then their…
Separation systems are posets with additional structure that form an abstract setting in which tangle-like clusters in graphs, matroids and other combinatorial structures can be expressed and studied. This paper offers some basic theory…
Rival and Zaguia showed that the antichain cutsets of a finite Boolean lattice are exactly the level sets. We show that a similar characterization of antichain cutsets holds for any strongly connected poset of locally finite height. As a…