๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Number of admissible linear orderings of a partially ordered set as a function of its incomparability graph

โœ Scribed by A. F. Sidorenko

Publisher
SP MAIK Nauka/Interperiodica
Year
1981
Tongue
English
Weight
301 KB
Volume
29
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A partially ordered set of functionals c
A partially ordered set of functionals corresponding to graphs
โœ Alexander Sidorenko ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 776 KB

For a graph G whose vertices are vl, u2, . . . , v, and where E is the set of edges, we define a functional U,(h)= ss SC . . . frl,$EEh(Xi,Xj) > dPc(x~)dAxJ ... dp(x,), where h is a nonnegative symmetric function of two variables. We consider a binary relation + for graphs with fixed numbers of vert

On a class of partially ordered sets and
On a class of partially ordered sets and their linear invariants
โœ Johannes Siemons ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Springer ๐ŸŒ English โš– 497 KB

Let (Z~a, <) be a finite partially ordered set with rank function. Then ff is the disjoint union of the classes ~k of elements of rank k and the order relation between elements in ~k and ~ak+ 1 can be represented by a matrix S k. We study partially ordered sets which satisfy linear recurrence relati