Related papers: Solutions Constructions of a Generalized Sylvester…

We present a game inspired by research on the possible number of billiard ball collisions in the whole Euclidean space. One player tries to place $n$ static "balls" with zero radius (i.e., points) in a way that will minimize the total…

It is known that a point in three-dimensional Euclidean space whose coordinates are equal to the cosines of the angles $\angle BDC, \angle ADC, \angle ADB$, where the point $D$ lies in the plane of a given triangle $ABC$, lies on the…

A classical open problem in combinatorial geometry is to obtain tight asymptotic bounds on the maximum number of k-level vertices in an arrangement of n hyperplanes in d dimensions (vertices with exactly k of the hyperplanes passing below…

A reformulation of the three circles theorem of Johnson with distance coordinates to the vertices of a triangle is explicitly represented in a polynomial system and solved by symbolic computation. A similar polynomial system in distance…

Given two sets of points in the plane, $P$ of $n$ terminals and $S$ of $m$ Steiner points, a Steiner tree of $P$ is a tree spanning all points of $P$ and some (or none or all) points of $S$. A Steiner tree with length of longest edge…

This dissertation is devoted to the resolution of the Plateau problem in the case of polygonal boundary curves in three-dimensional Euclidean space. It relies on the method developed by Ren\'e Garnier and published in 1928 in a paper which…

We show that for any $n\geq 2$, two elements selected uniformly at random from a \emph{symmetrized} Euclidean ball of radius $X$ in $\textrm{SL}_n(\mathbb Z)$ will generate a thin free group with probability tending to $1$ as $X\rightarrow…

We solve the classical Dirichlet problem for a general complex Hessian equation on a small ball in $\bC^n$. Then, we show that there is a continuous solution, in pluripotential theory sense, to the Dirichlet problem on compact Hermitian…

Let $p_1,p_2,p_3$ be three distinct points in the plane, and, for $i=1,2,3$, let $\mathcal C_i$ be a family of $n$ unit circles that pass through $p_i$. We address a conjecture made by Sz\'ekely, and show that the number of points incident…

The minimal network problem is a classical topic in geometric measure theory and the calculus of variations, which aims to find networks of minimal length connecting given points. Most classical results are established in the Euclidean…

Let $X_1,\ldots, X_{d+2}$ be random points in $\mathbb R^d$. The classical Sylvester problem asks to determine the probability that the convex hull of these points, denoted by $P:= [X_1,\ldots, X_{d+2}]$, is a simplex. In the present paper,…

The Pythagorean Theorem has been proved in hundreds of ways, yet it inspires fresh insights through geometry and trigonometry. In this paper, we offer a new proof based on three circles that circumscribe the sides of a right triangle.…

We study the problem of existence of regions separating a given amount of volume with the least possible perimeter inside a Euclidean cone. Our main result shows that nonexistence for a given volume implies that the isoperimetric profile of…

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…

Triangles of groups have been introduced by Gersten and Stallings. They are, roughly speaking, a generalisation of the amalgamated free product of two groups and occur in the framework of Corson diagrams. First, we prove an intersection…

In 1993 Foisy et al. proved that the optimal Euclidean planar double bubble---the least-perimeter way to enclose and separate two given areas---is three circular arcs meeting at 120 degrees. We consider the plane with density $r^p$, joining…

We revisit the fundamental problem of assigning intersection multiplicities to subsets of solutions of (square) systems of polynomials. Severi [Ann. Mat. Pura Appl. 26 (4), 1947] suggested an intuitive dynamic solution to this problem which…

In an earlier work, we proposed a generalization for the Apollonian packing in arbitrary dimensions and showed that the resulting object in four, five, and six dimensions have properties consistent with the Apollonian circle and sphere…

In 1907, Henry Ernest Dudeney posed a puzzle: ``cut any equilateral triangle \dots\ into as few pieces as possible that will fit together and form a perfect square'' (without overlap, via translation and rotation). Four weeks later, Dudeney…

Counting lattice points inside a ball of large radius in Euclidean space is a classical problem in analytic number theory, dating back to Gauss. We propose a variation on this problem: studying the asymptotics of the measure of an integer…