Some remarks concerning kissing numbers,blocking numbers and covering numbers

This article shows an inequality concerning blocking numbers and Hadwiger's covering numbers and presents a strange phenomenon concerning kissing numbers and blocking numbers. As a simple corollary, we can improve the known upper bounds for Hadwiger's covering numbers ford-dimensional centrally symmetric convex bodies to 3 ^d –1.     

New upper bounds for kissing numbers from semidefinite programming

Recently A. Schrijver derived new upper bounds for binary codes using semidefinite programming. In this paper we adapt this approach to codes on the unit sphere and we compute new upper bounds for the kissing number in several dimensions. In particular our computations give the (known) values for the cases .

     

The Fermat-Torricelli point and isosceles tetrahedra

An analytical, unifying approach to geometric properties of the Fermat-Torricelli point of four affinely independent points yields several characterizations of isosceles tetrahedra and, in particular, a characterization or regular tetrahedra within the set of isosceles tetrahedra by means of the solid angle sum.Dedicated to Professor N. Stephanidis on the occasion of his sixtyfifth birthday     

The one-sided kissing number in four dimensions

Summary Let <InlineEquation ID=IE"1"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"2"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"3"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"4"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"5"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"6"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"7"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"8"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"9"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"10"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"11"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"12"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"13"><EquationSource Format="TEX"><![CDATA[$]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>H$ be a closed half-space of $n$-dimensional Euclidean space. Suppose $S$ is a unit sphere in $H$ that touches the supporting hyperplane of $H$. The one-sided kissing number $B(n)$ is the maximal number of unit nonoverlapping spheres in $H$ that can touch $S$. Clearly, $B(2)=4$. It was proved that $B(3)=9$. Recently, K. Bezdek proved that $B(4)=18$ or 19, and conjectured that $B(4)=18$. We present a proof of this conjecture.     

On the extremality of the polynomials used for obtaining the best known upper bounds for the kissing numbers

We prove that the polynomials used for obtaining the best known upper bounds for some kissing numbers (the maximum number of nonoverlapping unit spheres that can touch a unit sphere in n dimensions) are best between the polynomials of the same or lower degree. We give also some extremal polynomials we have obtained using a method proposed in [4]. The upper bounds obtained in this way are slightly better than these from [1]. However the improvements are not in the integer part for dimensionsn 18.     

Rational and Heron tetrahedra

Buchholz [R.H. Buchholz, Perfect pyramids, Bull. Austral. Math. Soc. 45 (1991) 353-368] began a systematic search for tetrahedra having integer edges and volume by restricting his attention to those with two or three different edge lengths. Of the fifteen configurations identified for such tetrahedra, Buchholz leaves six unsolved. In this paper we examine these remaining cases for integer volume, completely solving all but one of them. Buchholz also considered Heron tetrahedra, which are tetrahedra with integral edges, faces and volume. Buchholz described an infinite family of Heron tetrahedra for one of the configurations. Another of the cases yields a new infinite family of Heron tetrahedra which correspond to the rational points on a two-parameter elliptic curve.     

Continuous flattening of truncated tetrahedra

Each Platonic polyhedron P can be folded using a continuous folding process into a face of P so that the resulting shape is flat and multilayered, while two of the faces are rigid during the motion. In previous works, explicit formulas of continuous functions for such motions were given and the same result as above was shown to hold for any tetrahedron. In this paper, we show that a truncated regular tetrahedron can be folded continuously via explicit continuous folding mappings into a flat (folded) state, such that two of the hexagonal faces are rigid. Furthermore, given any general tetrahedron P and any truncated tetrahedron Q of P, we show that if Q contains the largest inscribed sphere of P and satisfies some condition, then Q can be folded continuously into a flat folded state such that two of the hexagonal faces of Q are rigid during the motion.     

Calculus of generalized hyperbolic tetrahedra

We calculate the Jacobian matrix of the dihedral angles of a generalized hyperbolic tetrahedron as functions of edge lengths and find the complete set of symmetries of this matrix.     

An isoperimetric problem for tetrahedra

It is proved that a regular tetrahedron has the maximal possible surface area among all tetrahedra having surface with unit geodesic diameter. An independent proof of O’Rourke-Schevon’s theorem about polar points on a convex polyhedron is given. A. D. Aleksandrov’s general problem on the area of a convex surface with fixed geodesic diameter is discussed. Bibliography: 4 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 329, 2005, pp. 28–55.     

Geometry of Euclidean tetrahedra and knot invariants

We construct knot invariants on the basis of ascribing Euclidean geometric values to a triangulation of the sphere S ³, where the knot lies. Edges of the triangulation along which the knot goes are distinguished by a nonzero deficit angle, in the terminology of the Regge calculus. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 11, No. 4, pp. 105–117, 2005.     

Rational tetrahedra with edges in arithmetic progression

This paper discusses tetrahedra with rational edges forming an arithmetic progression, focussing specifically on whether they can have rational volume or rational face areas. Several infinite families are found which have rational volume, a face can have rational area only if its edges are themselves in arithmetic progression, and a tetrahedron can have at most one such rational face area.     

The bondage numbers of graphs with small crossing numbers

The bondage number b(G) of a nonempty graph G is the cardinality of a smallest edge set whose removal from G results in a graph with domination number greater than the domination number γ(G) of G. Kang and Yuan proved b(G)?8 for every connected planar graph G. Fischermann, Rautenbach and Volkmann obtained some further results for connected planar graphs. In this paper, we generalize their results to connected graphs with small crossing numbers.     

The Cauchy numbers

We study many properties of Cauchy numbers in terms of generating functions and Riordan arrays and find several new identities relating these numbers with Stirling, Bernoulli and harmonic numbers. We also reconsider the Laplace summation formula showing some applications involving the Cauchy numbers.     

The r-Stirling numbers

The r-Stirling numbers of the first and second kind count restricted permutations and respectively restricted partitions, the restriction being that the first r elements must be in distinct cycles and respectively distinct subsets. The combinatorial and algebraic properties of these numbers, which in most cases generalize similar properties of the regular Stirling numbers, are explored starting from the above definition.     

Reconstruction of tetrahedra from sets of edge lengths

Mathematical Notes - The problemof reconstructing tetrahedra fromgiven sets of edge lengths is studied. This is a special case of the problem of determining, up to isometry, the position of a...     

Tiling space and slabs with acute tetrahedra

We show it is possible to tile three-dimensional space using only tetrahedra with acute dihedral angles. We present several constructions to achieve this, including one in which all dihedral angles are less than 74.21°, and another which tiles a slab in space.