Using a computer to obtain Chebotarev bounds in the nonhomogeneous Minkowski's conjecture
From MaRDI portal
Publication:1114752
DOI10.1007/BF01727644zbMATH Open0663.10035WikidataQ122981389 ScholiaQ122981389MaRDI QIDQ1114752FDOQ1114752
A. V. Malyshev, A. K. Andriyasyan, I. V. Il'in
Publication date: 1988
Published in: Journal of Soviet Mathematics (Search for Journal in Brave)
Cites Work
- On the product of four non-homogeneous linear forms
- On a Theorem of Tschebotareff
- Title not available (Why is that?)
- On a theorem of Tschebotareff
- Minkowski's conjecture for \(n=5\); a theorem of Skubenko
- Title not available (Why is that?)
- Eine Erweiterung des Blichfeldtschen Satzes mit einer Anwendung auf inhomogene Linearformen
- Tschebotareff's Theorem on the Product of Non-Homogeneous Linear Forms (II)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sul teorema di Tschebotarev
- Note on the product of \(n\) inhomogeneous linear forms
- The perils of partnership - an NGO perspective
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Recommendations
- Title not available (Why is that?) 👍 👎
- A Computer Proof of Moll’s Log-Concavity Conjecture 👍 👎
- Computation of the Infimum in the Littlewood Conjecture 👍 👎
- On the computational complexity of best Chebyshev approximations 👍 👎
- A note on the complexity of an algorithm for Chebyshev approximation 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Computer-assisted techniques for the verification of the Chebyshev property of abelian integrals 👍 👎
- Title not available (Why is that?) 👍 👎
- Computability of Minimizers and Separating Hyperplanes 👍 👎
This page was built for publication: Using a computer to obtain Chebotarev bounds in the nonhomogeneous Minkowski's conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114752)
