Related papers: Small cones of oriented semi-metrics
The projection onto the intersection of sets generally does not allow for a closed form even when the individual projection operators have explicit descriptions. In this work, we systematically analyze the projection onto the intersection…
We count the number of conics through two general points in complete intersections when this number is finite and give an application in terms of quasi-lines.
We propose new algebraic methods for extracting cylinders and cones from minimal point sets, including oriented points. More precisely, we are interested in computing efficiently cylinders through a set of three points, one of them being…
We examine two natural operations to create numerical semigroups. We say that a numerical semigroup $\mathcal{S}$ is $k$-normalescent if it is the projection of the set of integer points in a $k$-dimensional polyhedral cone, and we say that…
We consider the problem of approximating the solution of variational problems subject to the constraint that the admissible functions must be convex. This problem is at the interface between convex analysis, convex optimization, variational…
Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simple undirected graphs. We introduce the integer array \(\mathrm{maxf}(n,m)\) giving the maximum number of facets of a symmetric edge polytope…
We interpret the property of having an infinitesimal symmetry as a variational property in certain geometric structures. This is achieved by establishing a one-to-one correspondence between a class of cone structures with an infinitesimal…
A polyhedral surface~$\mathcal{C}$ in $\mathbb{R}^3$ with convex polygons as faces is a side-contact representation of a graph~$G$ if there is a bijection between the vertices of $G$ and the faces of~$\mathcal{C}$ such that the polygons of…
It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides, for the first time, theoretical evidence supporting this for…
We study the problem of approximating the corner polyhedron using intersection cuts derived from families of lattice-free sets in $\mathbb{R}^n$. In particular, we look at the problem of characterizing families that approximate the corner…
It has been shown that the edge structure of the characteristic imset polytope is closely connected to the question of causal discovery. The diameter of a polytope is an indicator of how connected the polytope is and moreover gives us a…
We introduce the notion of pseudo-cones of metric spaces as a generalization of both of the tangent cones and the asymptotic cones. We prove that the Assouad dimension of a metric space is bounded from below by that of any pseudo-cone of…
We consider the Minimum Convex Partition problem: Given a set P of n points in the plane, draw a plane graph G on P, with positive minimum degree, such that G partitions the convex hull of P into a minimum number of convex faces. We show…
The structure of maximal faces of the cone of completely positive matrices is still not well understood in higher dimensions, mainly due to the lack of a general characterization of extreme exposed rays of the copositive cone beyond small…
We study a cutting-plane method for semidefinite optimization problems (SDOs), and supply a proof of the method's convergence, under a boundedness assumption. By relating the method's rate of convergence to an initial outer approximation's…
We study several natural instances of the geometric hitting set problem for input consisting of sets of line segments (and rays, lines) having a small number of distinct slopes. These problems model path monitoring (e.g., on road networks)…
Motivated by problems involving triangle-decompositions of graphs, we examine the facet structure of the cone $\tau_n$ of weighted graphs on $n$ vertices generated by triangles. Our results include enumeration of facets for small $n$, a…
An $n\times n$ real matrix $Q$ is quasi-orthogonal if $Q^{\top}Q=qI_{n}$ for some positive real number $q$. If $M$ is a principal sub-matrix of a quasi-orthogonal matrix $Q$, we say that $Q$ is a quasi-orthogonal extension of $M$. In a…
The main purpose of the present paper is to define and study the notion of quasi bi-slant submanifolds of almost contact metric manifolds. We mainly concerned with quasi bi-slant submanifolds of cosymplectic manifolds as a generalization of…
In this paper we initiate the investigation of Virtual Elements with curved faces. We consider the case of a fixed curved boundary in two dimensions, as it happens in the approximation of problems posed on a curved domain or with a curved…