Results 131 to 140 of about 4,538 (218)
Poset Ramsey number $R(P,Q_n)$. II. N-shaped poset
Given partially ordered sets (posets) $(P, \leq_P)$ and $(P', \leq_{P'})$, we say that $P'$ contains a copy of $P$ if for some injective function $f\colon P\rightarrow P'$ and for any $A, B\in P$, $A\leq _P B$ if and only if $f(A)\leq_{P'} f(B)$. For any
Winter, Christian, Axenovich, Maria
core
The immersion poset on partitions
We introduce the immersion poset $(\mathcal{P}(n), \leqslant_I)$ on partitions, defined by $\lambda \leqslant_I \mu$ if and only if $s_\mu(x_1, \ldots, x_N) - s_\lambda(x_1, \ldots, x_N)$ is monomial-positive.
Johnston, Lisa +6 more
core +2 more sources
Stanley introduced and studied two lattice polytopes, the order polytope and chain polytope, associated to a finite poset. Recently Ohsugi and Tsuchiya introduce an enriched version of them, called the enriched order polytope and enriched chain polytope.
Okada, Soichi, Tsuchiya, Akiyoshi
core +1 more source
Let Q(k, l) be a poset whose Hasse diagram is a regular spider with k+1 legs having the same length l. We show that for any n⩾1 the nth cartesian power of the spider poset Q(k, l) is a Macaulay poset for any k⩾0 and l⩾1.
Bezrukov, Sergei L., Elsässer, Robert
core +1 more source
On Quillenʼs Theorem A for posets
7 pages.
openaire +2 more sources
Operad Structure of Poset Matrices
This paper examines operad structures derived from poset matrices by formulating a set of new construction rules for poset matrices. In this direction, eleven different partial composition operations will be introduced as the basis for the construction ...
Giraudo, Samuele +3 more
core
Flipping the winner of a poset game
Partially-ordered set games, also called poset games, are a class of two-player combinatorial games. The playing field consists of a set of elements, some of which are greater than other elements.
Adam O. Kalinich +1 more
core +1 more source
Measuring the digital inclusion of women: a poset-based approach to the women in digital scoreboard. [PDF]
Damiani F, Rodríguez-Modroño P.
europepmc +1 more source
Poset matching—a distributive analog of independent matching
Given poset matroids (or distributive supermatroids) on two finite posets and an ordered binary relation which associates with every element of each poset an (order) ideal of other poset, a poset matching matches independent ideals with independent ...
SRINIVASAN, MK +3 more
core +1 more source
A planar order is a special linear extension of the edge poset (partially ordered set) of a processive plane graph. The definition of a planar order makes sense for any finite poset and is equivalent to the one of a conjugate order.
Lu, Xuexing
core

