✦ LIBER ✦

The spectrum of a ring as a partially ordered set

✍ Scribed by William J Lewis

Publisher: Elsevier Science
Year: 1973
Tongue: English
Weight: 924 KB
Volume: 25
Category: Article
ISSN: 0021-8693
DOI: 10.1016/0021-8693(73)90091-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

The lattice of antichain cutsets of a pa

The lattice of antichain cutsets of a partially ordered set

✍ Gerhard Behrendt 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 125 KB

## Behrendt, G., The lattice of antichain cutsets of a partially ordered set, Discrete Mathematics 89 (1991) 201-202. Every finite lattice is isomorphic to the lattice of antichain cutsets of a finite partially ordered set whose chains have at most three elements. A subset A of a partially order

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

An Algorithm for the Determination of th

An Algorithm for the Determination of the Variance of a Partially Ordered Set

✍ K. Engel 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 273 KB

Semigroups of order preserving partial t

Semigroups of order preserving partial transformations of a totally ordered set

✍ N.R Reilly 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 1015 KB

Remarks on the cofinality of a partially

Remarks on the cofinality of a partially ordered set, and a generalization of König's lemma

✍ E.C. Milner; N. Sauer 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 694 KB

A problem concerning the cardinality of the cofinal subsets of a partially ordered set is reduced to an open problem irr graph tteory. Let A be an in&it: wdinal, V = Ui,, Vi, I Uiii VJC IVJ (i CA). J\_et G be a graph on V with the proper?y that whenever i <A, x=u ie,cA Vi and IXICIVil, then there is