Related papers: A combinatorial version of Sylvester's four-point …
In this paper we consider a distributed optimization scenario in which a set of agents has to solve a convex optimization problem with separable cost function, local constraint sets and a coupling inequality constraint. We propose a novel…
In this note we put forward a conjecture on the average optimal length for bipartite matching with a finite number of elements where the different lengths are independent one from the others and have an exponential distribution.
All quaternion methods for static attitude determination currently rely on either the spectral decomposition of a 4 x 4 matrix (q-Method) or finding the maximum eigenvalue of a 4th-order characteristic equation (QUEST). Using a spectral…
In this paper, we start with a variation of the star cover problem called the Two-Squirrel problem. Given a set $P$ of $2n$ points in the plane, and two sites $c_1$ and $c_2$, compute two $n$-stars $S_1$ and $S_2$ centered at $c_1$ and…
We derive the solvability conditions and a formula of a general solution to a Sylvester-type matrix equation over Hamilton quaternions. As an application, we investigate the necessary and sufficient conditions for the solvability of the…
The 2-sets convex feasibility problem aims at finding a point in the intersection of two closed convex sets $A$ and $B$ in a normed space $X$. More generally, we can consider the problem of finding (if possible) two points in $A$ and $B$,…
In this article we consider the problem of testing, for two finite sets of points in the Euclidean space, if their convex hulls are disjoint and computing an optimal supporting hyperplane if so. This is a fundamental problem of…
In the early 17th century, Pierre de Fermat proposed the following problem: given three points in the plane, find a point such that the sum of its Euclidean distances to the three given points is minimal. This problem was solved by…
We present a variation of the broken stick problem in which $n$ stick lengths are sampled uniformly at random. We prove that the probability that no three sticks can form a triangle is the reciprocal of the product of the first $n$…
In a classic paper Schr\"oder posed four combinatorial problems about the number of certain types of bracketings of words and sets. Here we address what these bracketings look like on average. For each of the four problems we prove that a…
Given a set $P$ of $n$ points in the plane, we study the computation of the probability distribution function of both the area and perimeter of the convex hull of a random subset $S$ of $P$. The random subset $S$ is formed by drawing each…
Convex hulls are a fundamental geometric tool used in a number of algorithms. As a side-effect of exhaustive tests for an algorithm for which a convex hull computation was the first step, interesting experimental results were found and are…
We develop a sketching algorithm to find the point on the convex hull of a dataset, closest to a query point outside it. Studying the convex hull of datasets can provide useful information about their geometric structure and their…
In this work we survey four classic problems: Borsuk's partition problem, Tarski's plank problem, the Kneser--Poulsen problem on the monotonicity of the union of balls under a contraction of their centers, and the Hadwiger--Levi problem on…
We consider an extended version of Horn's problem: given two orbits $\mathcal{O}_\alpha$ and $\mathcal{O}_\beta$ of a linear representation of a compact Lie group, let $A\in \mathcal{O}_\alpha$, $B\in \mathcal{O}_\beta$ be independent and…
An old theorem of Alexander Soifer's is the following: Given five points in a triangle of unit area, there must exist some three of them which form a triangle of area 1/4 or less. It is easy to check that this is not true if "five" is…
The complex Busemann-Petty problem asks whether origin symmetric convex bodies in C^n with smaller central hyperplane sections necessarily have smaller volume. The answer is affirmative if n\leq 3 and negative if n\geq 4. In this article we…
We show that the multipole vector decomposition, recently introduced by Copi et al., is a consequence of Sylvester's theorem, and corresponds to the Maxwell's representation. Analyzing it in terms of harmonic polynomials, we show that this…
In this article we propose a generalization of the 2-dimensional notions of convexity resp. being star-shaped to symplectic vector spaces. We call such curves symplectically convex resp. symplectically star-shaped. After presenting some…
We study the problem of rotating a simple polygon to contain the maximum number of elements from a given point set in the plane. We consider variations of this problem where the rotation center is a given point or lies on a line segment, a…