Related papers: Intersections of complex structures
We consider the complexity of the recognition problem for two families of combinatorial structures. A graph $G=(V,E)$ is said to be an intersection graph of lines in space if every $v\in V$ can be mapped to a straight line $\ell (v)$ in…
A graph $G=(V,E)$ is a support of a hypergraph $H=(V,S)$ if every hyperedge induces a connected subgraph in $G$. Supports are used for certain types of hypergraph visualizations. In this paper we consider visualizing spatial hypergraphs,…
Two elements, $x$ and $y$, are separated by a set $S$ if it contains exactly one of $x$ and $y$. We prove that any set of $n$ points in general position in the plane can be separated by $O(n\log\log n/\log n)$ convex sets, and for some…
The convexity number of a set $X \subset \mathbb{R}^2$ is the minimum number of convex subsets required to cover it. We study the following question: what is the largest possible convexity number $f(n)$ of $\mathbb{R}^2 \setminus S$, where…
In order to understand the parameter space of monic and centered complex polynomial vector fields of degree d in the complex plane, decomposed by the combinatorial classes of the vector fields, it is interesting to know the number of loci…
Let $H$ be a set of $n$ halfplanes in $\mathbb{R}^2$ in general position, and let $k<n$ be a given parameter. We show that the number of vertices of the arrangement of $H$ that lie at depth exactly $k$ (i.e., that are contained in the…
A family of plane oriented continuous paths depending on a fixed real positive number $R$ is considered. For any point $x$ on the path, the previous points lie out of any circle of radius $R$ having at $x$ interior normal in a suitable…
We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers…
Orthogonal polynomials with respect to a weight function defined on a wedge in the plane are studied. A basis of orthogonal polynomials is explicitly constructed for two large class of weight functions and the convergence of Fourier…
In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…
We develop the theory of arrangements of spheres. Consider a finite collection of codimension-$1$ subspheres in a positive-dimensional sphere. There are two posets associated with this collection: the poset of faces and the poset of…
In this article we address the length of perverse sheaves arising as direct images of rank one local systems on complements of hyperplane arrangements. In the case of a cone over an essential line arrangement with at most triple points, we…
A family S of convex sets in the plane defines a hypergraph H = (S, E) as follows. Every subfamily S' of S defines a hyperedge of H if and only if there exists a halfspace h that fully contains S' , and no other set of S is fully contained…
We prove that for any collection F of $n \ge 2$ pairwise disjoint compact convex sets in the plane there is a pair of sets A and B in F such that any line that separates A from B separates either A or B from a subcollection of F with at…
Given two points in the plane, and a set of "obstacles" given as curves through the plane with assigned weights, we consider the point-separation problem, which asks for the minimum-weight subset of the obstacles separating the two points.…
In this paper, we study arrangements of orthogonal circles, that is, arrangements of circles where every pair of circles must either be disjoint or intersect at a right angle. Using geometric arguments, we show that such arrangements have…
A closed plane meander of order n is a closed self-avoiding loop intersecting an infinite line 2n times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm, based on…
In this paper, we characterise ovoidal cones by their intersection numbers. We first show that a set of points of $\mathrm{PG}(4,q)$ which intersects planes in $1$, $q+1$ or $2q+1$ points is either an ovoidal cone or a parabolic quadric,…
The problem of finding a canonical form of complex matrices up to conjugacy with the set of canonical matrices being a union of affine planes in the matrix space is considered. A solution of the problem is given producing a new canonical…
Given a real finite hyperplane arrangement A and a point p not on any of the hyperplanes, we define an arrangement vo(A,p), called the *valid order arrangement*, whose regions correspond to the different orders in which a line through p can…