✦ LIBER ✦

Orders, all of whose representations are completely resolvable

✍ Scribed by V. V. Kirichenko

Publisher: SP MAIK Nauka/Interperiodica
Year: 1967
Tongue: English
Weight: 240 KB
Volume: 2
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01094247

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The structure of orders all of whose rep

The structure of orders all of whose representations are completely decomposable

✍ A. G. Zavadskii 📂 Article 📅 1973 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 443 KB

Prime Orders All of Whose Prime Suborder

Prime Orders All of Whose Prime Suborders Are Selfdual

✍ Youssef Boudabbous; Imed Zaguia; Nejib Zaguia 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 405 KB

Completely positive completion of partia

Completely positive completion of partial matrices whose entries are completely bounded maps

✍ Koji Furuta 📂 Article 📅 1994 🏛 SP Birkhäuser Verlag Basel 🌐 English ⚖ 953 KB

On completely multiplicative functions w

On completely multiplicative functions whose values are roots of unity

✍ Bui Minh Phong 📂 Article 📅 2006 🏛 Akadmiai Kiad 🌐 English ⚖ 179 KB

There are no infinite order polynomially

There are no infinite order polynomially complete lattices, after all

✍ M. Goldstern; S. Shelah 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 73 KB

Continuous k-to-1 functions between comp

Continuous k-to-1 functions between complete graphs whose orders are of a different parity

✍ John Baptist Gauci; Anthony J. W. Hilton 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB

A function between graphs is k-to-1 if each point in the codomain has precisely k pre-images in the domain. Given two graphs, G and H, and an integer k ≥ 1, and considering G and H as subsets of R 3 , there may or may not be a k-to-1 continuous function (i.e. a k-to-1 map in the usual topological se