activity
20082014
most citedThe strong thirteen spheres problem

46 citations · 50 across the 6 of their papers we have counts for

collaborators

6 papers

math.MG2014★ 2 cited

Extreme problems of circle packings on a sphere and irreducible contact graphs

Oleg R. Musin, Alexey S. Tarasov

Recently, we enumerate up to isometry, all locally rigid circle packings on the unit sphere with number of circles N<12. This problem is equivalent to the enumeration of irreducibl…

math.MG2014

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…

math.MG2013

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…

math.MG2010★ 46 cited

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…

math.MG2009

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…

cs.CG2008★ 2 cited

Existence of a polyhedron which does not have a non-overlapping pseudo-edge unfolding

Alexey S Tarasov

There exists a surface of a convex polyhedron P and a partition L of P into geodesic convex polygons such that there are no connected "edge" unfoldings of P without self-intersecti…