𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cell decomposition for P-minimal fields

✍ Scribed by Marie-Hélène Mourgues

Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
92 KB
Volume
55
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

In [12], P. Scowcroft and L. van den Dries proved a cell decomposition theorem for p‐adically closed fields. We work here with the notion of P‐minimal fields defined by D. Haskell and D. Macpherson in [6]. We prove that a P‐minimal field K admits cell decomposition if and only if K has definable selection. A preprint version in French of this result appeared as a prepublication [8] (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

📜 SIMILAR VOLUMES

Minimal bases for cubic fields
Minimal bases for cubic fields
✍ Harold N. Shapiro; Gerson H. Sparer 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 669 KB
Space-decomposition minimization method
Space-decomposition minimization method for large-scale minimization problems
✍ Chin-Sung Liu; Ching-Hung Tseng 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 822 KB

This paper introduces a set of new algorithms, called the Space-Decomposition Minimization (SDM) algorithms, that decomposes the minimization problem into subproblems. If the decomposed-space subproblems are not coupled to each other, they can be solved independently with any convergent algorithm; o

Minimal pairs for P
Minimal pairs for P
✍ Uwe Schöning 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 782 KB
Efficient p-adic Cell Decompositions for
Efficient p-adic Cell Decompositions for Univariate Polynomials
✍ Michael Maller; Jennifer Whitehead 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 177 KB

Cell decompositions are constructed for polynomials f (x) # Z p [x] of degree n, such that n< p, using O(n 2 ) cells. When f is square-free this yields a polynomialtime algorithm for counting and approximating roots in Z p . These results extend to give a polynomial-time algorithm in the bit model f