Related papers: On angles between convex cones
In this manuscript, the concept of dual and approximate dual for continuous frames in Hilbert spaces will be introduced. Some of its properties will be studied. Also, the relations between two continuous Riesz bases in Hilbert spaces will…
We first review the definition of the angle between subspaces and how it is computed using matrix algebra. Then we introduce the Grassmann and Clifford algebra description of subspaces. The geometric product of two subspaces yields the full…
The intention of this survey to collect in one paper many recent results and advances related with Bergman type projection acting in various spaces of analytic functions in several complex variables in the unit ball, tubular domains over…
We show that the set of all possible constant diagonals of a bounded Hilbert space operator is always convex. This, in particular, answers an open question of J.-C. Bourin ($2003$). Moreover, we show that the joint numerical range of a…
We fully characterize orthogonal projections of infinite right circular (round) cones in real Hilbert spaces. Another interpretation is that, given two vectors in a real Hilbert space, we establish the optimal estimate on the angle between…
We prove the following result on the timelike spherical Hilbert geometry of simplices: Let $\Delta_2$ be a simplex on the 2-sphere and $\tilde{\Delta}_2$ the antipodal simplex. We show that the timelike spherical Hilbert geometry associated…
We review some basic concepts related to convex real projective structures from the differential geometry point of view. We start by recalling a Riemannian metric which originates in the study of affine spheres using the Blaschke connection…
We establish some relations between the perimeter, the area and the visual angle of a planar compact convex set. Our first result states that Crofton's formula is the unique universal formula relating the visual angle, length and area.…
On any proper convex domain in real projective space there exists a natural Riemannian metric, the Blaschke metric. On the other hand, distances between points can be measured in the Hilbert metric. Using techniques of optimal control, we…
According to the von Neumann-Halperin and Lapidus theorems, in a Hilbert space the iterates of products or, respectively, of convex combinations of orthoprojections are strongly convergent. We extend these results to the iterates of convex…
We show that the perimeter of the convex hull of finitely many disks lying in the hyperbolic or Euclidean plane, or in a hemisphere does not increase when the disks are rearranged so that the distances between their centers do not increase.…
This paper addresses the numerical computation of critical angles between two convex cones in finite-dimensional Euclidean spaces. We present a novel approach to computing these critical angles by reducing the problem to finding stationary…
Nearly 15 years ago, a set of qualitative spatial relations between oriented straight line segments (dipoles) was suggested by Schlieder. This work received substantial interest amongst the qualitative spatial reasoning community. However,…
We provide new conditions under which the alternating projection sequence converges in norm for the convex feasibility problem where a linear subspace with finite codimension $N\geq 2$ and a lattice cone in a Hilbert space are considered.…
This paper will extend a known relationship between the circumradius and dihedral angles of a tetrahedron in three-dimensional Euclidean space to three-dimensional affine space over a general field not of characteristic two, using only the…
We prove a sharp lower bound for the fundamental gap on convex domains in Gaussian spaces, the difference between the first two eigenvalues of the Ornstein-Uhlenbeck operator with Dirichlet boundary conditions. Our main result establishes…
If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…
Reay's relaxed Tverberg conjecture and Conway's thrackle conjecture are open problems about the geometry of pairwise intersections. Reay asked for the minimum number of points in Euclidean d-space that guarantees any such point set admits a…
In a projective space we fix some set of points, a horizon, and investigate the complement of that horizon. We prove, under some assumptions on the size of lines, that the ambient projective space, together with its horizon, both can be…
We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the…