Related papers: Some properties of the parking function poset
A permutation of length $n$ is called a flattened partition if the leading terms of maximal chains of ascents (called runs) are in increasing order. We analogously define flattened parking functions: a subset of parking functions for which…
Recently it has been shown that all non-trivial closed permutation groups containing the automorphism group of the random poset are generated by two types of permutations: the first type are permutations turning the order upside down, and…
We continue studying net bundles over partially ordered sets (posets), defined as the analogues of ordinary fibre bundles. To this end, we analyze the connection between homotopy, net homology and net cohomology of a poset, giving versions…
We describe some open problems related to homology representations of subposets of the partition lattice, beginning with questions first raised in Stanley's work on group actions on posets.
Given a poset $P$ we say a family $\mathcal{F}\subseteq P$ is centered if it is obtained by `taking sets as close to the middle layer as possible'. A poset $P$ is said to have the centeredness property if for any $M$, among all families of…
Given a functor from any category into the category of topological spaces, one obtains a linear representation of the category by post-composing the given functor with a homology functor with field coefficients. This construction is…
Let $P$ be a finite partially ordered set. In a recent series of works, Proudfoot introduced the notion of $Z$-polynomials associated with $P$-kernels, providing a unified framework for various intersection cohomology Poincar\'e polynomials…
Multipath cohomology is a cohomology theory for directed graphs, which is defined using the path poset. The aim of this paper is to investigate combinatorial properties of path posets, and to provide computational tools for multipath…
Kim, Kim, and Neggers (2019) defined probability functions on a poset, by listing some very natural conditions that a function \(\pi: P \times P \to [0,1]\) should satisfy in order to capture the intuition of "the likelihood that \(a\)…
The Solomon-Tits theorem says that the poset of proper non-trivial subspaces of a finite-dimensional vector space has realisation equivalent to a wedge of spheres. In this paper we prove a variant of this result for collections of geodesic…
An $N$-free poset is a poset whose comparability graph does not embed an induced path with four vertices. We use the well-quasi-order property of the class of countable $N$-free posets and some labelled ordered trees to show that a…
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…
Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are: (a) being atomic, i.e. not being…
Define an expansion poset to be the poset of monomials of a cluster variable attached to an arc in a polygon, where each monomial is represented by the corresponding combinatorial object from some fixed combinatorial cluster expansion…
We extend nearness frames to posets representing bases and even subbases of $T_1$ spaces. This allows us to put a classic duality due to Wallman, between compact $T_1$ spaces and abstract simplicial complexes, into a general nearness…
Stanley and Grinberg introduced a symmetric function associated with digraphs and named it the Redei-Berge symmetric function. This function arises from a suitable combinatorial Hopf algebra on digraphs, which made it possible to assign the…
We study generating functions of strict and non-strict order polynomials of series-parallel posets, called order series. These order series are closely related to Ehrhart series and h*-polynomials of the associated order polytopes. We…
We investigate the set of partial partitions of a finite set, ordered by inclusion. With this ordering the set of partial partitions can be studied as an abstract simplicial complex. We use the theory of shellable nonpure complexes to find…
We consider the poset of weighted partitions $\Pi_n^w$, introduced by Dotsenko and Khoroshkin in their study of a certain pair of dual operads. The maximal intervals of $\Pi_n^w$ provide a generalization of the lattice $\Pi_n$ of…
We prove that the posets of connected components of intersections of toric and elliptic arrangements defined by root systems are EL-shellable and we compute their homotopy type. Our method rests on Bibby's description of such posets by…