30 January 2018 in Cybernetics and Systems Analysis
27 March 2023 in Proceedings of the Bulgarian Academy of Sciences
We investigate lattice packings of Minkowski balls. By the results of the proof of Minkowski conjecture about the critical determinant we divide Minkowski balls into 3 classes: Minkowski balls, Davis balls and Chebyshev–Cohn balls. We investigate lattice packings of these balls on planes with varying Minkowski metric and search among these packings the optimal packings. In this paper we prove that the optimal lattice packing of the Minkowski, Davis, and Chebyshev–Cohn balls is realized with respect to the sublattices of index two of the critical lattices of corresponding balls.
1 May 2006 in Programming and Computer Software
Computer algebra methods for justifying hypotheses in arithmetic geometry are considered. The specific feature of these methods is that they are designed for parametric problems. The methods developed can be used for solving computational problems and justifying hypotheses on equidistribution, as well as for the theory of algebraic curves over finite fields.
1 January 2012 in Cybernetics and Systems Analysis
30 June 2024 in Proceedings of the Bulgarian Academy of Sciences
Lattice coverings in the real plane by Minkowski balls are studied. We exploit the duality of admissible lattices of Minkowski balls and inscribed convex symmetric hexagons of these balls. An explicit moduli space of the areas of these hexagons is constructed, giving the values of the determinants of corresponding covering lattices. Low and upper bounds for covering constants of Minkowski balls are given. The best known value of covering density of Minkowski ball is obtained. One conjecture and one problem are formulated.
28 December 2016 in arXiv
We present A.V. Malyshev`s approach to Minkowski`s conjecture (in Davis`s amendment) concerning the critical determinant of the region $|x|^p + |y|^p 1$ and Malyshev`s method. In the sequel of this article we use these approach and method to present the main result.