✦ LIBER ✦

Lifting map automorphisms and MacBeath's theorem

✍ Scribed by David B Surowski

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 709 KB
Volume: 50
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(90)90069-c

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fieller's theorem and linkage disequilib

Fieller's theorem and linkage disequilibrium mapping

✍ Heather J. Cordell; Robert C. Elston 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB

Linkage disequilibrium mapping exploits the fact that at genetic markers close enough to a disease locus on a particular chromosome, we expect to find an association between the disease and marker alleles. Furthermore, the magnitude of the association is expected to follow a unimodal curve when plot

Polynomial Maps and Zariski′s Main Theor

Polynomial Maps and Zariski′s Main Theorem

✍ S.S. Abhyankar 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 168 KB

Fixed Points of Coprime Automorphisms an

Fixed Points of Coprime Automorphisms and Generalizations of Glauberman's Z*-Theorem

✍ Paul Flavell; Geoffrey R. Robinson 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 65 KB

One of the most widely used applications of block theory to the U w x structure theory of finite groups is Glauberman's Z -theorem 2 , which asserts that if t is an involution of a finite group G which is not conjugate in G to any other involution of a Sylow 2-subgroup containing t, then Ž . Ž .

On the Weyl Spectrum: Spectral Mapping T

On the Weyl Spectrum: Spectral Mapping Theorem and Weyl's Theorem

✍ Jin-Chuan Hou; Xiu-Ling Zhang 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 153 KB

respectively for the spectrum and the Weyl spectrum of T ; moreover, Weyl's Ž . theorem holds for f T q F if ''dominant'' is replaced by ''M-hyponormal,'' where F is any finite rank operator commuting with T. These generalize earlier results for hyponormal operators. It is also shown that there exis

The combinatorial map color theorem

✍ Gerhard Ringel 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 522 KB

## Abstract This paper is written in the spirit of the author's book: __Map Color Theorem__ (1974). We try to develop the Map Color Theorem in a combinatorial way, circumventing the unwieldy embedding theory. Similar (but not identical) generalizations have recently and independently been developed

Dirac's map-color theorem for choosabili

Dirac's map-color theorem for choosability

✍ B�hme, T.; Mohar, B.; Stiebitz, M. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 290 KB

It is proved that the choice number of every graph G embedded on a surface of Euler genus ε ≥ 1 and ε = 3 is at most the Heawood number H(ε) = (7 + √ 24ε + 1)/2 and that the equality holds if and only if G contains the complete graph K H(ε) as a subgraph.