Related papers: Intersections of complex structures
We study arrangements of $m$ hyperplanes in the $n$-dimensional real projective space, with a special focus on $m=n+3$ and $n=3$ or $n=4$.
In this paper, we establish two necessary conditions for a joint triangulation of two sets of $n$ points in the plane and conjecture that they are sufficient. We show that these necessary conditions can be tested in $O(n^3)$ time. For the…
A curve in the plane is $x$-monotone if every vertical line intersects it at most once. A family of curves are called pseudo-segments if every pair of them have at most one point in common. We construct $2^{\Omega(n^{4/3})}$ families, each…
How many squares are spanned by $n$ points in the plane? Here we study the corresponding maximum possible number $S_{\square}(n)$ of squares and determine the exact values for all $n\le 17$. For $18\le n\le 100$ we give lower bounds for…
A bar-joint framework $(G,p)$ is the combination of a finite simple graph $G=(V,E)$ and a placement $p:V\rightarrow \mathbb{R}^d$. The framework is rigid if the only edge-length preserving continuous motions of the vertices arise from…
We study graphs coming from quadratic spaces over finite fields via orthogonality which generalize a recent result given by Bishnoi, Ihringer, and Pepe (2019). More precisely, we study the graph $\Gamma^{\square}(n,k,q)$ as follows: the…
New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…
In this paper, we provide an $O(n \mathrm{polylog} n)$ bound on the expected complexity of the randomly weighted Voronoi diagram of a set of $n$ sites in the plane, where the sites can be either points, interior-disjoint convex sets, or…
A set $L$ of straight lines and a set $P$ of points in the Euclidean plane define an arrangement $\mathcal{A}$ = ($L$, $P$) of construction lines and registration marks, if and only if: (1) any point in $P$ is a point of intersection of at…
Let P be a polygon with rational vertices in the plane. We show that for any finite odd-sized collection of translates of P, the area of the set of points lying in an odd number of these translates is bounded away from 0 by a constant…
Let $C$ be an algebraic curve of genus $g$. A coherent system on $C$ consists of a pair $(E,V)$, where $E$ is an algebraic vector bundle over $C$ of rank $n$ and degree $d$ and $V$ is a subspace of dimension $k$ of the space of sections of…
A covering path for a finite set $P$ of points in the plane is a polygonal path such that every point of $P$ lies on a segment of the path. The vertices of the path need not be at points of $P$. A covering path is plane if its segments do…
In this paper we contribute towards the classification of partially symmetric tensors in $\mathbb{F}_q^3\otimes S^2\mathbb{F}_q^3$, $q$ even, by classifying planes which intersect the Veronese surface $\mathcal{V}(\mathbb{F}_q)$ in at least…
In this article we prove in the main theorem that, there is a bijection between the isomorphism classes of a certain type of real hyperplane arrangements on the one hand, and the antipodal pairs of convex cones of an associated…
A closed-form solution for the boundary of the flat state of an orthogonal cross section of contiguous surface geometry formed by the intersection of two cylinders of equal radii oriented in dual directions of rotation about their…
For the planar four-vortex problem, we show that there are finitely many stationary configurations consisting of equilibria, rigidly translating configurations, relative equilibria (uniformly rotating configurations) and collapse…
We show that every convex code realizable by compact sets in the plane admits a realization consisting of polygons, and analogously every open convex code in the plane can be realized by interiors of polygons. We give factorial-type bounds…
Every polygon with n vertices in the complex projective plane is naturally associated with its adjoint curve of degree n-3. Hence the adjoint of a heptagon is a plane quartic. We prove that a general plane quartic is the adjoint of exactly…
We investigate matter collineations of plane symmetric spacetimes when the energy-momentum tensor is degenerate. There exists three interesting cases where the group of matter collineations is finite-dimensional. The matter collineations in…
We study the complexity of identifying the integer feasibility of reverse convex sets. We present various settings where the complexity can be either NP-Hard or efficiently solvable when the dimension is fixed. Of particular interest is the…