Results 11 to 20 of about 462 (185)
Equivalent Forms for a Poset to Be Modular Poset
The notion of modular and distributive posets which generalize the corresponding notions from the lattice theory are introduced by J. Larmerova and J. Rachnek.
Sundarayya P., Kishore T. Ravi
doaj +2 more sources
In 1995 Stanley introduced the chromatic symmetric function $X_G$ of a graph $G$, whose $e$-positivity and Schur-positivity has been of large interest. In this paper we study the relative $e$-positivity and Schur-positivity between connected graphs on $n$ vertices.
Samantha Dahlberg +2 more
openaire +2 more sources
The non-Abelian exponentiation theorem has recently been generalised to correlators of multiple Wilson line operators. The perturbative expansions of these correlators exponentiate in terms of sets of diagrams called webs, which together give rise to colour factors corresponding to connected graphs.
Dukes, Mark +4 more
openaire +7 more sources
Statisch pairs in atomistic posets [PDF]
We introduce statisch pairs in atomistic posets and study its relationships with some known concepts in posets such as biatomic and dual modular pairs, perspectivity and subspaces of atom space of an atomistic poset.
Alireza Vaezi, Vilas Kharat
doaj +1 more source
On Small Types in Univalent Foundations [PDF]
We investigate predicative aspects of constructive univalent foundations. By predicative and constructive, we respectively mean that we do not assume Voevodsky's propositional resizing axioms or excluded middle.
Tom de Jong, Martín Hötzel Escardó
doaj +1 more source
On pomonoid of partial transformations of a poset
The main objective of this article is to study the ordered partial transformations PO(X){\mathcal{PO}}\left(X) of a poset XX. The findings show that the set of all partial transformations of a poset with a pointwise order is not necessarily a pomonoid ...
Al Subaiei Bana
doaj +1 more source
The coefficients of transitivity of the posets of MM-type being the highest supercritical poset
The representations of partially ordered sets (abbreviated as posets), introduced by L. A. Nazarova and A. V. Roiter (in matrix form) in 1972, play an important role in the modern representation theory. In his first paper on this topic M. M.
В. М. Бондаренко +2 more
doaj +1 more source
How to get the weak order out of a digraph ? [PDF]
We construct a poset from a simple acyclic digraph together with a valuation on its vertices, and we compute the values of its Möbius function. We show that the weak order on Coxeter groups $A$$n-1$, $B$$n$, $Ã$$n$, and the flag weak order on the wreath ...
Francois Viard
doaj +1 more source
A study on strongly convex hyper S-subposets in hyper S-posets
In this paper, we study various strongly convex hyper S-subposets of hyper S-posets in detail. To begin with, we consider the decomposition of hyper S-posets.
Tang Jian, Xie Xiang-Yun, Davvaz Bijan
doaj +1 more source
We describe an algorithm for compressing a partially ordered set, or \emph{poset}, so that it occupies space matching the information theory lower bound (to within lower order terms), in the worst case. Using this algorithm, we design a succinct data structure for representing a poset that, given two elements, can report whether one precedes the other ...
J. Ian Munro, Patrick K. Nicholson
openaire +3 more sources

