𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Stable Norms on Complex Numbers and Quaternions

✍ Scribed by Richard Arens; Moshe Goldberg; W.A.J Luxemburg

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
92 KB
Volume
219
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the norms of quaternionic extensions
On the norms of quaternionic extensions of real and complex linear mappings
✍ Daniel Alpay; M. Elena Luna-Elizarrarás; Michael Shapiro 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 271 KB

## Abstract We study the connections between the norms of bounded operators on real and complex normed spaces, and with range in quaternionic spaces, and of their quaternionic extensions. We study some aspects of the relations between the quaternionization and the complexification of an inner produ

On stable crossing numbers
On stable crossing numbers
✍ Paul C. Kainen; Arthur T. White 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 253 KB

## Abstract Results giving the exact crossing number of an infinite family of graphs on some surface are very scarce. In this paper we show the following: for __G__ = __Q__~__n__~ × __K__~4.4~, cr~__y__(__G__)‐__m__~(__G__) = 4__m__, for 0 ⩽ = __m__ ⩽ 2^__n__^. A generalization is obtained, for cer

On an Obstruction to the Hasse Norm Prin
On an Obstruction to the Hasse Norm Principle and the Equality of Norm Groups of Algebraic Number Fields
✍ Leonid Stern 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 214 KB

Let LÂk and TÂk be finite extensions of algebraic number fields. In the present work we introduce the factor group of k\* & N LÂk J L N TÂk J T by (k\* & N TÂk J T ) N LÂk L\*, where J L and J T are the idele groups of L and T, respectively. The main theorem shows that the computation of this factor

On the independence number of the Erdős-
On the independence number of the Erdős-Rényi and projective norm graphs and a related hypergraph
✍ Dhruv Mubayi; Jason Williford 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB

## Abstract The Erdős‐Rényi and Projective Norm graphs are algebraically defined graphs that have proved useful in supplying constructions in extremal graph theory and Ramsey theory. Their eigenvalues have been computed and this yields an upper bound on their independence number. Here we show that