Related papers: A combinatorial version of Sylvester's four-point …
Symmetry is the essential element of lifted inference that has recently demon- strated the possibility to perform very efficient inference in highly-connected, but symmetric probabilistic models models. This raises the question, whether…
The convex rope problem is to find a counterclockwise or clockwise convex rope starting at the vertex a and ending at the vertex b of a simple polygon P, where a is a vertex of the convex hull of P and b is visible from infinity. The convex…
The matching problem plays a basic role in combinatorial optimization and in statistical mechanics. In its stochastic variants, optimization decisions have to be taken given only some probabilistic information about the instance. While the…
Most algorithms for solving optimization problems or finding saddle points of convex-concave functions are fixed-point algorithms. In this work we consider the generic problem of finding a fixed point of an average of operators, or an…
Let P be a d-dimensional n-point set. A Tverberg-partition of P is a partition of P into r sets P_1, ..., P_r such that the convex hulls conv(P_1), ..., conv(P_r) have non-empty intersection. A point in the intersection of the conv(P_i)'s…
We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen uniformly at random from S. By distance we mean the length of the shortest path between x…
The aim of this paper is to present a new, analytical, method for computing the exact number of relative equilibria in the planar, circular, restricted 4-body problem of celestial mechanics. The new approach allows for a very efficient…
A direct link between a one-loop N-point Feynman diagram and a geometrical representation based on the N-dimensional simplex is established by relating the Feynman parametric representations to the integrals over contents of…
In this paper we study a generalized symplectic fixed point problem, first considered by J. Moser in \cite{M}, from the point of view of some relatively recently discovered symplectic rigidity phenomena. This problem has interesting…
A comprehensive analysis of the morphology of the solution space for a special type of quadratic quaternion equation is presented. This equation, which arises in a surface construction problem, incorporates linear terms in a quaternion…
A solution is given to the following problem: how to compute the multiplicity, or more generally the Hilbert function, at a point on a Schubert variety in an orthogonal Grassmannian. Standard monomial theory is applied to translate the…
It has been known that the distribution of the random distances between two uniformly distributed points within a convex polygon can be obtained based on its chord length distribution (CLD). In this report, we first verify the existing…
This paper deals with sequences of random variables belonging to a fixed chaos of order $q$ generated by a Poisson random measure on a Polish space. The problem is investigated whether convergence of the third and fourth moment of such a…
In 1989 Manin and Schechtman defined the discriminantal arrangement $\mathcal{B}(n, k,\mathcal{A})$ associated to a generic arrangement $\mathcal{A}$ of $n$ hyperplanes in a $k$-dimensional space. An equivalent notion was already introduced…
We provide an algorithm that verifies the optimal colored Tverberg problem for $10$ points in the plane: Every $10$ points in the plane in color classes of size at most $3$ can be partitioned in $4$ rainbow pieces such that their convex…
In this paper, we give upper and lower bounds on the number of Steiner points required to construct a strictly convex quadrilateral mesh for a planar point set. In particular, we show that $3{\lfloor\frac{n}{2}\rfloor}$ internal Steiner…
Within the framework of the theory of quaternion column-row determinants and using determinantal representations of the Moore-Penrose inverse previously obtained by the author, we get explicit determinantal representation formulas of…
Consider a set P of N random points on the unit sphere of dimension $d-1$, and the symmetrized set S = P union (-P). The halving polyhedron of S is defined as the convex hull of the set of centroids of N distinct points in S. We prove that…
We consider the convex hull of a finite sample of i.i.d. points uniformly distributed in a convex body in $\R^d$, $d\geq 2$. We prove an exponential deviation inequality, which leads to rate optimal upper bounds on all the moments of the…
In this article, a new solution for the convex hull problem has been presented. The convex hull is a widely known problem in computational geometry. As nature is a rich source of ideas in the field of algorithms, the solution has been…