Related papers: Uniqueness of Optimal Point Sets Determining Two D…
We investigate plane curves intersecting in at most two unibranched points to study the algebraic exceptional set appearing in standard conjectures of diophantine and hyperbolic geometry. Our first result compares the local geometry of two…
We give a simple method to find ideal points of the character variety of a 3-manifold from an ideal triangulation.
We consider the problem of choosing Euclidean points to maximize the sum of their weighted pairwise distances, when each point is constrained to a ball centered at the origin. We derive a dual minimization problem and show strong duality…
The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry. Less well known is Erd\H{o}s' distinct angle problem, the problem of finding the minimum number of distinct angles between $n$ non-collinear points in the…
The Danzer--Gr\"unbaum acute angles problem asks for the largest size of a set of points in ${\mathbb R}^d$ that determines only acute angles. Recently, the problem was essentially solved thanks to the results of the second author and of…
A polytope in a finite-dimensional normed space is subequilateral if the length in the norm of each of its edges equals its diameter. Subequilateral polytopes occur in the study of two unrelated subjects: surface energy minimizing cones and…
In this article we consider the distribution of $N$ points on the unit sphere $\mathbb{S}^{d-1}$ in $\mathbb{R}^d$ interacting via logarithmic potential. A characterization theorem of the stationary configurations is derived when $N=d+2$…
We consider the problem of optimal location of a Dirichlet region in a $d$-dimensional domain $\Omega$ subjected to a given right-hand side $f$ in order to minimize some given functional of the configuration. While in the literature the…
A set $S$ of vertices in a graph is an open packing if (open) neighborhoods of any two distinct vertices in $S$ are disjoint. In this paper, we consider the graphs that have a unique maximum open packing. We characterize the trees with this…
Consider the family of all finite graphs with maximum degree $\Delta(G)<d$ and matching number $\nu(G)<m$. In this paper we give a new proof to obtain the exact upper bound for the number of edges in such graphs and also characterize all…
We study a property of $2$-strong uniqueness of a best approximation in a class of finite-dimensional complex normed spaces, for which the unit ball is an absolutely convex hull of finite number of points and in its dual class. We prove…
We revisit the following problem (along with its higher dimensional variant): Given a set $S$ of $n$ points inside an axis-parallel rectangle $U$ in the plane, find a maximum-area axis-parallel sub-rectangle that is contained in $U$ but…
Consider a finite field $\mathbb{F}_q$ and positive integers $d,m,r$ with $1\leq r\leq \binom{m+d}{d}$. Let $S_d(m)$ be the $\mathbb{F}_q$ vector space of all homogeneous polynomials of degree $d$ in $X_0,\dots,X_m$. Let $e_r(d,m)$ be the…
We prove the convergence of the fixed-point (also called thresholding) algorithm in three optimal control problems under large volume constraints. This algorithm was introduced by C\'ea, Gioan and Michel, and is of constant use in the…
A \emph{stacked triangulation} of a $d$-simplex $\mathbf{o}=\{1,\ldots,d+1\}$ ($d\geq 2$) is a triangulation obtained by repeatedly subdividing a $d$-simplex into $d+1$ new ones via a new vertex (the case $d=2$ is known as an Appolonian…
Three-point semidefinite programming bounds are one of the most powerful known tools for bounding the size of spherical codes. In this paper, we use them to prove lower bounds for the potential energy of particles interacting via a pair…
We show that, for a constant-degree algebraic curve $\gamma$ in $\mathbb{R}^D$, every set of $n$ points on $\gamma$ spans at least $\Omega(n^{4/3})$ distinct distances, unless $\gamma$ is an {\it algebraic helix} (see Definition 1.1). This…
In this paper we show that the number of distinct distances determined by a set of $n$ points on a constant-degree two-dimensional algebraic variety $V$ (i.e., a surface) in $\mathbb R^3$ is at least $\Omega\left(n^{7/9}/{\rm polylog}…
We prove that a component of the closure of the set of star points on a hypersurface X of degree d>2 in N-dimensional projective space is linear. Afterwards, we focus on the case where the component is of maximal dimension N-2 and the case…
We give an upper bound on the number of perfect matchings in simple graphs with a given number of vertices and edges. We apply this result to give an upper bound on the number of 2-factors in a directed complete bipartite balanced graph on…