𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Scott-Suppes theorem on semiorders

✍ Scribed by Issie Rabinovitch


Publisher
Elsevier Science
Year
1977
Tongue
English
Weight
192 KB
Volume
15
Category
Article
ISSN
0022-2496

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


On the complexity of interval orders and
✍ U. Faigle; Gy. Turán 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 607 KB

The recognition complexity of interval orders is shown to be Q(n log, n), and an optimal algorithm is given for the identification of semiorders. \* Supported by the joint research project "Algorithmic Aspects of Combinatorial Optimization" of the Hungarian Academy of Sciences (Magyar Tudomanyos Aka

On the Lindelöf Theorem
✍ F. W. Gehring; A. J. Lohwater 📂 Article 📅 1958 🏛 John Wiley and Sons 🌐 English ⚖ 316 KB
On the Taketa Theorem
✍ Yakov Berkovich 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 164 KB

In this note we prove that a finite group is almost solvable if every irreducible Ž character is induced from a character of degree at most 4 more precisely, such a Ž . Ž . .

On the Cartan–Jacobson Theorem
✍ Pablo Alberca Bjerregaard; Alberto Elduque; Cándido Martı́n González; Francisco 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 108 KB

The well-known Cartan-Jacobson theorem claims that the Lie algebra of derivations of a Cayley algebra is central simple if the characteristic is not 2 or 3. In this paper we have studied these two cases, with the following results: if the characteristic is 2, the theorem is also true, but, if the ch