✦ LIBER ✦

On the p-isomorphism conjecture

✍ Scribed by Osamu Watanabe

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 435 KB
Volume: 83
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(91)90284-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Isomorphism Conjecture for Weak R

On the Isomorphism Conjecture for Weak Reducibilities

✍ Manindra Agrawal 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 652 KB

According to the isomorphism conjecture all NP-complete sets are polynomial-time isomorphic to each other while according to the encrypted complete set conjecture there is a p-one way function f and an NP-complete set A such that A and f (A) are not polynomial-time isomorphic to each other. In this

One-way functions and the isomorphism co

One-way functions and the isomorphism conjecture

✍ K. Ganesan 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 911 KB

On the P�sa-Seymour conjecture

✍ Koml�s, J�nos; S�rk�zy, G�bor N.; Szemer�di, Endre 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB

Paul Seymour conjectured that any graph G of order n and minimum degree at least k k+1 n contains the k th power of a Hamilton cycle. We prove the following approximate version. For any > 0 and positive integer k, there is an n 0 such that, if G has order n ≥ n 0 and minimum degree at least ( k k+1

On the Leopoldt conjecture on the p-adic

On the Leopoldt conjecture on the p-adic regulators

✍ Hiroo Miki 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 630 KB

On the mutually non isomorphic ℓp(ℓq) sp

On the mutually non isomorphic ℓp(ℓq) spaces

✍ Pilar Cembranos; José Mendoza 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB

We extend a result of Pełczyński showing that { p ( q ) : 1 ≤ p, q ≤ ∞} is a family of mutually non isomorphic Banach spaces. Some results on complemented subspaces of p ( q ) are also given.

Isomorphism testing for p-groups

✍ E.A. O'Brien 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 478 KB

We describe the theoretical and practical details of an algorithm which can be used to decide whether two given presentations for finite \(p\)-groups present isomorphic groups. The approach adopted is to construct a canonical presentation for each group. A description of the automorphism group of th