Related papers: About the Algebraic Solutions of Smallest Enclosin…

What is the smallest number of pieces that you can cut an n-sided regular polygon into so that the pieces can be rearranged to form a rectangle? Call it r(n). The rectangle may have any proportions you wish, as long as it is a rectangle.…

We show that the minimum number of orientations of the edges of the n-vertex complete graph having the property that every triangle is made cyclic in at least one of them is $\lceil\log_2(n-1)\rceil$. More generally, we also determine the…

A n-set of equi-isoclinic planes in R^r is a set of n planes spanning R^r each pair of which has the same non-zero angle arccos(sqrt(lambda)). We prove that for any odd integer k such that 2k=p^alpha+1, p odd prime, alpha non-negative…

We investigate minimal helix submanifolds of any dimension and codimension immersed in Euclidean space. Our main result proves that a ruled minimal helix submanifold is a cylinder. As an application we classify complex helix submanifolds of…

In this paper, we use the properties of the self-polar triangle to not only show a novel method for a basic point-line enumerative problem of conics, but also present a series of closed-form solutions to the conics from all minimal…

We define the regular Euclidean algorithm and the general form which leads to the method of least absolute remainders and also the method of negative remainders. We are going to show that if looked from the perspective of subtraction, the…

We use computational experiments to find the rectangles of minimum area into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. Most of the packings found have…

The problem of finding suitable point embedding or geometric configurations given only Euclidean distance information of point pairs arises both as a core task and as a sub-problem in a variety of machine learning applications. In this…

In this paper, a novel technique for tight outer-approximation of the intersection region of a finite number of ellipses in 2-dimensional (2D) space is proposed. First, the vertices of a tight polygon that contains the convex intersection…

Generically, a fully measured elasticity tensor has no material symmetry. For single crystals with a cubic lattice, or for the aeronautics turbine blades superalloys such as Nickelbased CMSX-4, cubic symmetry is nevertheless expected. It is…

It is a well known phenomenon that many classical minimal surfaces in Euclidean space also exist with higher dihedral symmetry. More precisely, these surfaces are solutions to free boundary problems in a wedge bounded by two vertical planes…

We study two optimization problems on simplicial complexes with homology over $\mathbb{Z}_2$, the minimum bounded chain problem: given a $d$-dimensional complex $\mathcal{K}$ embedded in $\mathbb{R}^{d+1}$ and a null-homologous…

In this paper, we study the problem of computing Euclidean geodesic centers of a polygonal domain $\mathcal{P}$ with a total of $n$ vertices. We discover many interesting observations. We give a necessary condition for a point being a…

We construct symplectic embeddings of ellipsoids of dimension $2n \ge 6$ into the product of a 4-ball or 4-dimensional cube with Euclidean space. A sequence of these embeddings can be shown to be optimal.

We provide a complete classification of possible configurations of mutually pairwise touching infinite cylinders in Euclidian 3D space. It turns out that there is a maximum number of such cylinders possible in 3D independently on the shape…

Given a planar compact convex billiard table $T$, we give an algorithm to find the shortest generalised closed billiard orbits on $T$. (Generalised billiard orbits are usual billiard orbits if $T$ has smooth boundary.) This algorithm is…

We construct two infinite families of algebraic minimal cones in $R^{n}$. The first family consists of minimal cubics given explicitly in terms of the Clifford systems. We show that the classes of congruent minimal cubics are in one to one…

We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…

Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…

The study of inner and cyclic functions in $\ell^p_A$ spaces requires a better understanding of the zeros of the so-called optimal polynomial approximants. We determine that a point of the complex plane is the zero of an optimal polynomial…