✦ LIBER ✦

A finite partially ordered set and its corresponding set of permutations

✍ Scribed by S. S. Kislitsyn

Publisher: SP MAIK Nauka/Interperiodica
Year: 1968
Tongue: English
Weight: 251 KB
Volume: 4
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01111312

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sequencing functions and optimizations o

Sequencing functions and optimizations on permutations of a partially ordered set

✍ V. N. Reva 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 665 KB

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

Partially ordered sets of finite growth

✍ A. G. Zavadskii; L. A. Nazarova 📂 Article 📅 1982 🏛 Springer US 🌐 English ⚖ 265 KB

Partially ordered sets of finite type

✍ M. M. Kleiner 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 471 KB

Spanning retracts of a partially ordered

Spanning retracts of a partially ordered set

✍ D. Duffus; I. Rival; M. Simonovits 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 639 KB

Two general kinds of subsets of a partially ordered set P are always retracts of P:: (1) every maximal chain of P is a retract; (2) in P, every isometric, spanning subset of length one with no crowns is a retract. It follows that in a partially ordered set P with the fixed point property, every maxi

On partitions of a partially ordered set

✍ A.J Hoffman; D.E Schwartz 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 451 KB