Related papers: Polar degrees and closest points in codimension tw…
Given a hypersurface in a complex projective space, we prove that the multidegrees of its toric polar map agree, up to sign, with the coefficients of the Chern-Schwartz-MacPherson class of a distinguished open set, namely the complement of…
We analyze the complexity of fitting a variety, coming from a class of varieties, to a configuration of points in $\Bbb C^n$. The complexity measure, called the algebraic complexity, computes the Euclidean Distance Degree (EDdegree) of a…
We introduce the F-adjoined Gauss map. We use it to express the Gaussian maximum likelihood degree as a product of two invariants. As an application of our product formula, we classify all projective curves of Gaussian maximum likelihood…
We establish upper bounds for the size of two-distance sets in Euclidean space and spherical two-distance sets. The main recipe for obtaining upper bounds is the spectral method. We construct Seidel matrices to encode the distance relations…
Finding the point in an algebraic variety that is closest to a given point is an optimization problem with many applications. We study the case when the variety is a Fermat hypersurface. Our formula for its Euclidean distance degree is a…
Motivated by finding an effective way to compute the algebraic complexity of the nearest point problem for algebraic models, we introduce an efficient method for detecting the limit points of the stratified Morse trajectories in a small…
In this paper, we revisit foundations of umbral calculus using a straightforward approach based on an explicit matrix realization of binomial convolution. We construct an umbral duality of Wronskian type for rational curves in echelon form,…
This paper considers an extremal version of the Erd\H{o}s distinct distances problem. For a point set $P \subset \mathbb R^d$, let $\Delta(P)$ denote the set of all Euclidean distances determined by $P$. Our main result is the following: if…
We have developed in the past several algorithms with intrinsic complexity bounds for the problem of point finding in real algebraic varieties. Our aim here is to give a comprehensive presentation of the geometrical tools which are…
Using Blanchfield pairings, we show that two Alexander polynomials cannot be realized by a pair of matrices with Gordian distance one if a corresponding quadratic equation does not have an integer solution. We also give an example of how…
We present alternative postulates for Euclidean geometry whose merit is that they lead to a new class of invariants and associated geometries for real finite-dimensional unital associative algebras.
A bottleneck of a smooth algebraic variety $X \subset \mathbb{C}^n$ is a pair of distinct points $(x,y) \in X$ such that the Euclidean normal spaces at $x$ and $y$ contain the line spanned by $x$ and $y$. The narrowness of bottlenecks is a…
Multiview varieties are mathematical models for the set of image feature correspondences that can be produced by a given camera arrangement. They possess an invariant known as their Euclidean distance (ED) degree, which measures the…
Polar commutative n-complex numbers of the form u=x_0+h_1x_1+h_2x_2+...+h_{n-1}x_{n-1} are introduced in n dimensions, the variables x_0,...,x_{n-1} being real numbers. The polar n-complex number can be represented, in an even number of…
The class of Schoenberg transformations, embedding Euclidean distances into higher dimensional Euclidean spaces, is presented, and derived from theorems on positive definite and conditionally negative definite matrices. Original results on…
A finite set of the Euclidean space is called an $s$-distance set provided the number of Euclidean distances in the set is $s$. Determining the largest possible $s$-distance set for the Euclidean space of a given dimension is challenging.…
In this paper we develop an algebraic theory to study the problem of finding the minimum distance point from an algebraic variety with respect to the Hermitian distance function. The theory generalizes the Euclidean Distance degree…
We study the possible values of the nodal distance $\delta_{\rm nod}$ between two non-coplanar Keplerian trajectories ${\cal A}, {\cal A}'$ with a common focus. In particular, given ${\cal A}'$ and assuming it is bounded, we compute optimal…
The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…
For a given graph whose edges are labeled with general real numbers, we consider the set of functions from the vertex set into the Euclidean plane such that the distance between the images of neighbouring vertices is equal to the…