Related papers: Small cones of oriented semi-metrics
Let $P$ be a polygonal curve in $\mathbb{R}^d$ of length $n$, and $S$ be a point-set of size $k$. The Curve/Point Set Matching problem consists of finding a polygonal curve $Q$ on $S$ such that the Fr\'echet distance from $P$ is less than a…
The metric projection onto the positive semidefinite (PSD) cone is strongly semismooth, a property that guarantees local quadratic convergence for many powerful algorithms in semidefinite programming. In this paper, we investigate whether…
We define oriented posets with correpsonding rank matrices, where linking two posets by an edge corresponds to matrix multiplication. In particular, linking chains via this method gives us fence posets, and taking traces gives us circular…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
The minimum orbital intersection distance is used as a measure to assess potential close approaches and collision risks between astronomical objects. Methods to calculate this quantity have been proposed in several previous publications.…
We show the existence of an exact mimicking network of $k^{O(\log k)}$ edges for minimum multicuts over a set of terminals in an undirected graph, where $k$ is the total capacity of the terminals, as well as a method for computing a…
Innamorati and Zuanni have provided a combinatorial characterization of Baer and unital cones in PG(3,q). The current paper generalizes these results to arbitrary dimension. Furthermore, these results are extended to hyperoval and maximal…
The problems of computing eccentricity, radius, and diameter are fundamental to graph theory. These parameters are intrinsically defined based on the distance metric of the graph. In this work, we propose quantum algorithms for the diameter…
The varietal hypercube $VQ_n$ is a variant of the hypercube $Q_n$ and has better properties than $Q_n$ with the same number of edges and vertices. This paper shows that every edge of $VQ_n$ is contained in cycles of every length from 4 to…
We present two characterizations of quasiconvexity for radially semicontinuous mappings defined on a convex subset of a real linear space. As an application we obtain an extension of the Sion's minimax theorem, as well as a new…
A closed quasigeodesic is a closed curve on the surface of a polyhedron with at most $180^\circ$ of surface on both sides at all points; such curves can be locally unfolded straight. In 1949, Pogorelov proved that every convex polyhedron…
We construct a family of manifolds, one for each $n\geq 2$, having a nontrivial Massey $n$-product in their cohomology. These manifolds turn out to be smooth closed 2-connected manifolds with a compact torus action called moment-angle…
We study the farthest point mapping on (the boundary of) the 4-cube with respect to the intrinsic metric, and its dynamics as a multivalued mapping. It is a piecewise rational map. It is more complicated than the one on the 3-cube, but it…
The triangular ratio metric is studied in subdomains of the complex plane and Euclidean $n$-space. Various inequalities are proven for it. The main results deal with the behavior of this metric under quasiconformal maps. We also study the…
We consider the explicit analytic behaviour of photon escape cones in generic static spherically symmetric spacetimes, emphasizing the interplay between the physical spacetime metric and the optical metric, and the interplay between…
This paper is a survey of results obtained by the authors on the geometry of connections with totally skew-symmetric torsion on the following manifolds: almost complex manifolds with Norden metric, almost contact manifolds with B-metric and…
A convex polyhedron $P$ is $k$-equiprojective if all of its orthogonal projections, i.e., shadows, except those parallel to the faces of $P$ are $k$-gon for some fixed value of $k$. Since 1968, it is an open problem to construct all…
A partial cube is a graph having an isometric embedding in a hypercube. Partial cubes are characterized by a natural equivalence relation on the edges, whose classes are called zones. The number of zones determines the minimal dimension 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 study properties of convex hulls of (co)adjoint orbits of compact groups, with applications to invariant theory and tensor product decompositions. The notion of partial convex hulls is introduced and applied to define two numerical…