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

Characterization of the trace by monotonicity inequalities

โœ Scribed by Airat M. Bikchentaev; Oleg E. Tikhonov

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
106 KB
Volume
422
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Characterization of diagrams by 0-1 ineq
Characterization of diagrams by 0-1 inequalities
โœ I.G. Rosenberg ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 696 KB

An orientation of an undirected graph is a 2-orientation if it is the cover relation of an order. The characterization of graphs admitting a 2-orientation is an old open problem. To a graph G we associate a system of O-1 inequalities whose unknowns are indexed by edges and inequalities by cycles of

Inequalities for the number of monotonic
Inequalities for the number of monotonic functions of partial orders
โœ Jacqueline W Daykin ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 682 KB

Let P be a finite poset and let x, y e P. Let C be a finite chain. Define NS(i, j) to be the number of strict order-preserving maps to: P--~C satisfying to(x)=i and to(y)=j. Various inequalities are proved, commencing with Theorem 2: If r, s, t, u, v, w are non-negative integers then NS(r, u + v + w