The strong thirteen spheres problem

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 famous discussion between Isaac Newton and David Gregory in 1694. The problem was solved by Schutte and van der Waerden only in 1953. A natural extension of this problem is the strong thirteen spheres problem (or the Tammes problem for 13 points) which asks to find an arrangement and the maximum radius of 13 equal size nonoverlapping spheres touching the unit sphere. In the paper we give a solution of this long-standing open problem in geometry. Our computer-assisted proof is based on a enumeration of the so-called irreducible graphs.Comment: Modified lemma 2, 16 pages, 12 figures. Uploaded program packag

Maximal planar scale-free Sierpinski networks with small-world effect and power-law strength-degree correlation

Many real networks share three generic properties: they are scale-free, display a small-world effect, and show a power-law strength-degree correlation. In this paper, we propose a type of deterministically growing networks called Sierpinski networks, which are induced by the famous Sierpinski fractals and constructed in a simple iterative way. We derive analytical expressions for degree distribution, strength distribution, clustering coefficient, and strength-degree correlation, which agree well with the characterizations of various real-life networks. Moreover, we show that the introduced Sierpinski networks are maximal planar graphs.Comment: 6 pages, 5 figures, accepted by EP

Random Sierpinski network with scale-free small-world and modular structure

In this paper, we define a stochastic Sierpinski gasket, on the basis of which we construct a network called random Sierpinski network (RSN). We investigate analytically or numerically the statistical characteristics of RSN. The obtained results reveal that the properties of RSN is particularly rich, it is simultaneously scale-free, small-world, uncorrelated, modular, and maximal planar. All obtained analytical predictions are successfully contrasted with extensive numerical simulations. Our network representation method could be applied to study the complexity of some real systems in biological and information fields.Comment: 7 pages, 9 figures; final version accepted for publication in EPJ

The modular geometry of Random Regge Triangulations

We show that the introduction of triangulations with variable connectivity and fluctuating egde-lengths (Random Regge Triangulations) allows for a relatively simple and direct analyisis of the modular properties of 2 dimensional simplicial quantum gravity. In particular, we discuss in detail an explicit bijection between the space of possible random Regge triangulations (of given genus g and with N vertices) and a suitable decorated version of the (compactified) moduli space of genus g Riemann surfaces with N punctures. Such an analysis allows us to associate a Weil-Petersson metric with the set of random Regge triangulations and prove that the corresponding volume provides the dynamical triangulation partition function for pure gravity.Comment: 36 pages corrected typos, enhanced introductio

Abrupt bifurcations in chaotic scattering : view from the anti-integrable limit

Bleher, Ott and Grebogi found numerically an interesting chaotic phenomenon in 1989 for the scattering of a particle in a plane from a potential field with several peaks of equal height. They claimed that when the energy E of the particle is slightly less than the peak height Ec there is a hyperbolic suspension of a topological Markov chain from which chaotic scattering occurs, whereas for E > Ec there are no bounded orbits. They called the bifurcation at E = Ec an abrupt bifurcation to chaotic scattering. The aim of this paper is to establish a rigorous mathematical explanation for how chaotic orbits occur via the bifurcation, from the viewpoint of the anti-integrable limit, and to do so for a general range of chaotic scattering problems