✦ LIBER ✦

m-Powers of simple sets

✍ Scribed by A. N. Degtev

Publisher: Springer US
Year: 1972
Tongue: English
Weight: 469 KB
Volume: 11
Category: Article
ISSN: 0002-5232
DOI: 10.1007/bf02219737

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Powers of ordered sets

✍ Dwight Duffus 📂 Article 📅 1984 🏛 Springer Netherlands 🌐 English ⚖ 644 KB

Recently there has been significant progress in the study of powers of ordered sets. Much of this work has concerned cancellation laws for powers and uses these two steps. First, logarithmic operators are introduced to transform cancellation problems for powers into questions involving direct produc

m-Degrees of supersets of simple sets

✍ A. N. Degtev 📂 Article 📅 1978 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 231 KB

Tabular powers of maximal sets

✍ S. S. Marchenkov 📂 Article 📅 1976 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 413 KB

Powers of Chords for Convex Sets

✍ Dr. sc. K. Voss 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB

Numerical radii of simple powers

✍ Vitali Chkliar 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 112 KB

A counterexample is given for the conjecture that the numerical radius of the n + lth power of an operator is less than or equal to the numerical radius of the nth power of the same operator if the operator is a contraction.

Root Sets of Polynomials Modulo Prime Po

Root Sets of Polynomials Modulo Prime Powers

✍ Davesh Maulik 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 194 KB

A subset R of the integers modulo n is defined to be a root set if it is the set of roots of some polynomial. Using the Chinese Remainder Theorem, the question of finding and counting root sets mod n is reduced to finding root sets modulo a prime power. In this paper, we provide a recursive construc