Results 121 to 130 of about 4,538 (218)
A symmetric chain decomposition of L(5,n) [PDF]
Xiangdong Wen
doaj +1 more source
Interval number of special posets and random posets
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tom Madej, Douglas B. West
openaire +1 more source
A poset of shuffles is defined as follows: Let \b{x}\(=x_ 1x_ 2...x_ m\) and \b{y}\(=y_ 1y_ 2...y_ m\) be words, where it is assumed that the letters occurring in \b{x} and \b{y} are all distinct. Let \(W_{\underline x,\underline y}\) denote the set of all words \b{w} with letters from \b{x} and \b{y} such that the restriction of \b{w} to the letters ...
openaire +2 more sources
A realization of poset associahedra [PDF]
Given any connected poset \(P\), we provide a simple realization of Galashin's \(P\)-associahedron \(\mathscr A(P)\) as a convex polytope in \(\mathbb R^P.\) This realization is inspired by the description of \(\mathscr A(P)\) as a compactification of ...
Sack, Andrew
core +1 more source
Topologies, posets and finite quandles
An Alexandroff space is a topological space in which every intersection of open sets is open. There is one to one correspondence between Alexandroff T0 -spaces and partially ordered sets (posets).
M. Elhamdadi, H. Lahrani, T. Gona
doaj
One sure sign of a successful generalization of a particular theory is an extension of language and technique to a larger domain permitting one to reconstruct considerable parts of previous theory on such a new basis. Another such sign is to provide new interpretations and insights captured by such an extended theory, especially involving results ...
openaire +2 more sources
Poset extensions, convex sets, and semilattice presentations
The paper is devoted to an algebraic and geometric study of the feasible set of a poset, the set of finite probability distributions on the elements of the poset whose weights satisfy the order relationships specified by the poset.
Romanowska, A.B. +2 more
core +1 more source
We characterize free poset algebras F(P) over partially ordered sets and show that they can be represented by upper semi-lattice algebras. Hence, the uniqueness, in decomposition into normal form, using symmetric difference, of non-zero elements of F(P ...
Bekkali, Mohamed, Zhani, Driss
core +1 more source
Motivated by the theory of correspondence functors, we introduce the notion of germ in a finite poset, and the notion of germ extension of a poset. We show that any finite poset admits a largest germ extension called its germ closure.
Bouc, Serge
core

