Related papers: Multi-convex sets in real projective spaces and th…
We study the sets of planes in an even dimensional real vector space $V$ which are simultaneously stabilised by a pair of complex structures on $V$. We completely describe these sets of planes for pairs of orthogonal complex structures.…
Given two arbitrary closed sets in Euclidean space, a simple transversality condition guarantees that the method of alternating projections converges locally, at linear rate, to a point in the intersection. Exact projection onto nonconvex…
Given two elliptic curves, each of which is associated with a projection map that identifies opposite elements with respect to the natural group structure, we investigate how their corresponding projective images of torsion points…
We define a class of L-convex-concave subsets of $\Bbb{R}P^n$, where L is a projective subspace of dimension l in $\Bbb{R}P^n$. These are sets whose sections by any (l+1)-dimensional space L' containing L are convex and concavely depend on…
For a smooth projective curve, the cycles of subordinate or, more generally, secant divisors to a given linear series are among some of the most studied objects in classical enumerative geometry. We consider the intersection of two such…
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…
The convex feasibility problem asks to find a point in the intersection of a collection of nonempty closed convex sets. This problem is of basic importance in mathematics and the physical sciences, and projection (or splitting) methods…
In this paper we extend the notion of a Lorentz cone. We call a closed convex set isotone projection set with respect to a pointed closed convex cone if the projection onto the set is isotone (i.e., monotone) with respect to the order…
We study a few approaches to identify inclusion (up to a shift) between two convex bodies in ${\mathbb R}^n$. To this goal we use mixed volumes and fractional linear maps. We prove that inclusion may be identified by comparing volume or…
A pair of planes, both projective or both affine, of the same order and on the same pointset are orthogoval if each line of one plane intersects each line of the other plane in at most two points. In this paper we prove new constructions…
The implicit convex feasibility problem attempts to find a point in the intersection of a finite family of convex sets, some of which are not explicitly determined but may vary. We develop simultaneous and sequential projection methods…
We prove a symmetric version of B\'ezout's theorem. More precisely, we show that the symmetric orbit type of a transverse intersection of complex symmetric hypersurfaces in projective space is determined by the degrees. In the projective…
In this paper, we study bijections on strictly convex sets of $\mathbf R \mathbf P^n$ for $n \geq 2$ and closed convex projective surfaces equipped with the Hilbert metric that map complete geodesics to complete geodesics as sets.…
Let R be a commutative, noetherian, local ring. Topological Q-vector spaces modelled on full subcategories of the derived category of R are constructed in order to study intersection multiplicities.
We define a variant of intersection space theory that applies to many compact complex and real analytic spaces $X$, including all complex projective varieties; this is a significant extension to a theory which has so far only been shown to…
Any smooth projective variety contains many complete intersection subvarieties with ample cotangent bundles, of each dimension up to half its own dimension.
Given a combinatorial structure, a ``twin'' is a pair of disjoint substructures which are isomorphic (or look the same in some sense). In recent years, there have been many problems about finding large twins in various combinatorial…
The notion of ball convexity, considered in finite dimensional real Banach spaces, is a natural and useful extension of usual convexity; one replaces intersections of half-spaces by suitable intersections of balls. A subset $S$ of a normed…
Let $G = V, E$ be a simple connected undirected graph. A set $X \subseteq V$ is \emph{geodesically convex} if for any pair of vertices $x, y \in X$, all vertices on all shortest paths in $G$ from $x$ to $y$ are contained in $X$. A set $H…
The present work concerns generalized convex sets in the real multi-dimensional Euclidean space, known as weakly $1$-convex and weakly $1$-semiconvex sets. An open set is called weakly $1$-convex (weakly $1$-semiconvex) if, through every…