1.4k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Max Planck Institute for Gravitational PhysicsDE29 papers
- University of Wisconsin–MilwaukeeUS23 papers
- California Institute of TechnologyUS22 papers
- West Virginia UniversityUS21 papers
- Max Planck Institute for Radio AstronomyDE18 papers
- The University of Texas at AustinUS17 papers
- University of British ColumbiaCA17 papers
- Cornell UniversityUS15 papers
- National Radio Astronomy ObservatoryUS15 papers
- University of FloridaUS15 papers
- McGill UniversityCA14 papers
- Pennsylvania State UniversityUS14 papers
9 papers · 1 filter
The Tammes problem for N=14
Oleg R. Musin, Alexey S. Tarasov
The Tammes problem is to find the arrangement of N points on a unit sphere which maximizes the minimum distance between any two points. This problem is presently solved for several…
Plank theorems via successive inradii
Karoly Bezdek
In the 1930's, Tarski introduced his plank problem at a time when the field discrete geometry was about to born. It is quite remarkable that Tarski's question and its variants cont…
Enumeration of irreducible contact graphs on the sphere
Oleg Musin, Alexey Tarasov
In this article, using the computer, are enumerated all locally-rigid packings by congruent circles (spherical caps) on the unit sphere with This is equ…
Another ham sandwich in the plane
Alexey Balitskiy, Alexey Garber, Roman Karasev
We show that every two nice measures in the plane can be partitioned into equal halves by translation of an angle from arbitrary k-fan when k is odd and in some cases when k is eve…
The Voronoi conjecture for parallelohedra with simply connected -surface
Alexey Garber, Andrey Gavrilyuk, Alexander Magazinov
We show that the Voronoi conjecture is true for parallelohedra with simply connected -surface. Namely, we show that if the boundary of parallelohedron remains simply connect…
The strong thirteen spheres problem
Oleg Musin, Alexey Tarasov
The thirteen spheres problem is asking if 13 equal size nonoverlapping spheres in three dimensions can touch another sphere of the same size. This problem was the subject of the fa…
Lower bounds for the simplexity of the n-cube
Alexey Glazyrin
In this paper we prove a new asymptotic lower bound for the minimal number of simplices in simplicial dissections of -dimensional cubes. In particular we show that the number of…
The Extremal Spheres Theorem
Arseniy Akopyan, Alexey Glazyrin, Oleg R. Musin +1
Consider a polygon P and all neighboring circles (circles going through three consecutive vertices of P). We say that a neighboring circle is extremal if it is empty (no vertices o…
The kissing number in four dimensions
Oleg R. Musin
The kissing number problem asks for the maximal number k(n) of equal size nonoverlapping spheres in n-dimensional space that can touch another sphere of the same size. This problem…