Minimal pairs for P
✍ Scribed by Uwe Schöning
- Publisher
- Elsevier Science
- Year
- 1984
- Tongue
- English
- Weight
- 782 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We classify \(n\)-dimensional pairs of dual lattices by their minimal vectors. This leads to the notion of a "perfect pair", a natural enlargement by duality of the usual notion of a perfect lattice, and we show that there are only finitely many of them in any given dimension. As an application, we
We give a new proof for the existence and uniqueness (up to translation) of plane minimal pairs of convex bodies in a given equivalence class of the H6rmander-RftdstrOm lattice, as well as a complete characterization of plane minimal pairs using surface area measures. Moreover, we introduce the so-c
A P-matrix is a square matrix with positive principal minors. We introduce a natural extension of the class of P-matrices, the class of extended P-pairs. A pair {I, M}, for a P-matrix M, is shown to be contained in an extended P-pair iff SMS has an n-step vector for some sign matrix S. Such a matrix
## 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 an