Related papers: Algebraic methods for computing smallest enclosing…
We study the packing of a large number of congruent and non--overlapping circles inside a regular polygon. We have devised efficient algorithms that allow one to generate configurations of $N$ densely packed circles inside a regular polygon…
We consider tilings of Euclidean spaces by polygons or polyhedra, in particular, tilings made by a substitution process, such as the Penrose tilings of the plane. We define an isomorphism invariant related to a subgroup of rotations and…
We introduce numerical algebraic geometry methods for computing lower bounds on the reach, local feature size, and the weak feature size of the real part of an equidimensional and smooth algebraic variety using the variety's defining…
We find a one-to-one correspondence between full extrinsic symmetric spaces in (possibly degenerate) inner product spaces and certain algebraic objects called (weak) extrinsic symmetric triples. In particular, this yields a description of…
Motivated by applications in robotics and computer vision, we study problems related to spatial reasoning of a 3D environment using sublevel sets of polynomials. These include: tightly containing a cloud of points (e.g., representing an…
In this paper, we study semilinear elliptic equations in domains where there is a natural class of solutions, which depend only on one variable, and whose simple geometry reflects the geometry of the domain. We prove that under quite…
In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least distortion for Hamming graphs, Johnson graphs, and all strongly regular…
In recent work with Kusner, we developed a method, based on the equivariant optimization of Laplace and Steklov eigenvalues, for producing minimal surfaces of prescribed topology in low-dimensional balls and spheres. We used the method to…
We consider the independence complexes of square grids with cylindrical boundary conditions. When one of the dimensions is small we use simple reductions induced by edge removals to show explicit natural homotopy equivalences between those…
In this note we present techniques to compute inhomogeneous minima of norm forms; as an application, we determine all norm-Euclidean complex bicyclic quartic number fields.
This is the third in a series of papers in which we study the n-Selmer group of an elliptic curve, with the aim of representing its elements as curves of degree n in P^{n-1}. The methods we describe are practical in the case n=3 for…
We study the algebraic complexity of Euclidean distance minimization from a generic tensor to a variety of rank-one tensors. The Euclidean Distance (ED) degree of the Segre-Veronese variety counts the number of complex critical points of…
The class of traveling wave solutions of the sine-Gordon equation is known to be in 1-1 correspondence with the class of (necessarily singular) pseudospherical surfaces in Euclidean space with screw-motion symmetry: the pseudospherical…
Products of simplices, called simplotopes, and their triangulations arise naturally in algorithmic applications in game theory and optimization. We develop techniques to derive lower bounds for the size of simplicial covers and…
The cylindrical algebraic covering method was originally proposed to decide the satisfiability of a set of non-linear real arithmetic constraints. We reformulate and extend the cylindrical algebraic covering method to allow for checking the…
We have derived an analytical formulation for estimating the volume of geometries enclosed by implicitly defined surfaces. The novelty of this work is due to two aspects. First we provide a general analytical formulation for all…
Starting from the well-known and elementary problem of inscribing the rectangle of the greatest area in an ellipse, we look at possible, gradually more and more complicated variants of this problem. Our goal is to demonstrate to an average…
We consider the problem of packing congruent circles with the maximum radius in a unit square as a mathematical optimization problem. Due to the presence of non-overlapping constraints, this problem is a notoriously difficult nonconvex…
The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings of such graphs, up to rigid motions, in Euclidean space. We capture…
We present a complete system of inequalities for the inradius, circumradius, and diameter in the $3$-dimensional Euclidean space. To do so, we prove quasiconcavity of the inradius evaluated over $n$-simplices with a common facet…