✦ LIBER ✦

A nil implies nilpotent theorem for left ideals

✍ Scribed by J.T Stafford

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 294 KB
Volume: 133
Category: Article
ISSN: 0021-8693
DOI: 10.1016/0021-8693(90)90289-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Paley-Wiener Theorem for Selected Nilp

A Paley-Wiener Theorem for Selected Nilpotent Lie Groups

✍ J.D. Moss 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 593 KB

This paper concerns itself with the problem of generalizing to nilpotent Lie groups a weak form of the classical Paley-Wiener theorem for \(\mathbb{R}^{n}\). The generalization is accomplished for a large subclass of nilpotent Lie groups, as well as for an interesting example not in this subclass. T

A theorem for optimum finite-element ide

A theorem for optimum finite-element idealizations

✍ W.E. Carroll; R.M. Barker 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 770 KB

A structure theorem for a class of grade

A structure theorem for a class of grade three perfect ideals

✍ Anne E Brown 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 992 KB

A nilpotence theorem for modules over th

A nilpotence theorem for modules over the mod 2 steenrod algebra

✍ Michael J. Hopkins; John H. Palmieri 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 479 KB

The decomposition theorem for ideals in

The decomposition theorem for ideals in polynomial rings over a domain

✍ Christine W Ayoub 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 598 KB

A minimax theorem for infinite graphs wi

A minimax theorem for infinite graphs with ideal points

✍ Norbert Polat 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 617 KB

Polat, N., A minimax theorem for infinite graphs with ideal points, Discrete Mathematics 103 (1992) 57-65. Let d be a family of sets of ends of an infinite graph, having the property that every element of any member of 1 can be separated from the union of all other members by a finite set of vertice