Related papers: Intersecting hexagons in 3-space

We consider the following question: Given $n$ lines and $n$ circles in $\mathbb{R}^3$, what is the maximum number of intersection points lying on at least one line and on at least one circle of these families. We prove that if there are no…

Given a family of sets on the plane, we say that the family is intersecting if for any two sets from the family their interiors intersect. In this paper, we study intersecting families of triangles with vertices in a given set of points. In…

This article is covered by the article arxiv.1012.0925 We study intersection of two polyhedral spheres without self-intersections in 3-space. We find necessary and sufficient conditions on sequences x = x_1,x_2,...,x_n, y = y_1,y_2,...,y_n…

We investigate the maximum number of intersections between two polygons with p and q vertices, respectively, in the plane. The cases where p or q is even or the polygons do not have to be simple are quite easy and already known, but when p…

For a positive integer $n\ge 3$, the collection of $n$-sided polygons embedded in $3$-space defines the space of geometric knots. We will consider the subspace of equilateral knots, consisting of embedded $n$-sided polygons with unit length…

An arrangement of circles in which circles intersect only in angles of $\pi/2$ is called an \emph{arrangement of orthogonal circles}. We show that in the case that no two circles are nested, the intersection graph of such an arrangement is…

We study intersection of two polyhedral spheres without self-intersections in 3-space. We find necessary and sufficient conditions on sequences x = x_1,x_2,...,x_n, y = y_1,y_2,...,y_n of positive integers, for existence of 2-dimensional…

Given a convex polygon of $n$ sides, one can draw $n$ disks (called side disks) where each disk has a different side of the polygon as diameter and the midpoint of the side as its center. The intersection graph of such disks is the…

In this note, we prove several Tur\'an-type results on geometric hypergraphs. The two main theorems are 1) Every $n$-vertex geometric 3-hypergraph in 2-space with no three strongly crossing edges has at most $O(n^2)$ edges, 2) Every…

In the $2$-dimensional $n$-body problem, $n\ge 3$, in spaces of constant curvature, $\kappa\ne 0$, we study polygonal homographic solutions. We first provide necessary and sufficient conditions for the existence of these orbits and then…

A family of $k$-element subsets of an $n$-element set is called 3-wise intersecting if any three members in the family have non-empty intersection. We determine the maximum size of such families exactly or asymptotically. One of our results…

It is proved that there are triangle-free intersection graphs of line segments in the plane with arbitrarily small ratio between the maximum size of an independent set and the total number of vertices.

We prove ``half-space" intersection properties in three settings: the hemisphere, half-geodesic balls in space forms, and certain subsets of Gaussian space. For instance, any two embedded minimal hypersurfaces in the sphere must intersect…

Given a smooth subscheme of a projective space over a finite field, we compute the probability that its intersection with a fixed number of hypersurface sections of large degree is smooth of the expected dimension. This generalizes the case…

Let $A$ be a three-dimensional nonassociative division algebra over a finite field. Let $A$ act on the space $A^2$ by left multiplication. For a nonzero vector $v$ in $A^2$ we have a three-dimensional subspace $Av$ in $A^2$. This paper…

We establish new bounds on the number of tangencies and orthogonal intersections determined by an arrangement of curves. First, given a set of $n$ algebraic plane curves, we show that there are $O(n^{3/2})$ points where two or more curves…

Given two weighted k-uniform hypergraphs G, H of order n, how much (or little) can we make them overlap by placing them on the same vertex set? If we place them at random, how concentrated is the distribution of the intersection? The aim of…

Let X be a complete intersection of two hypersurfaces F_n and F_k in the projective space P^5 of degree n and k respectively with n >= k, such that the singularities of X are nodal and F_k is smooth. We prove that if the threefold X has at…

We consider the combinatorial question of how many convex polygons can be made by using the edges taken from a fixed triangulation of n vertices. For general triangulations, there can be exponentially many: we show a construction that has…

We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n halfspaces, with the property that the highest dimension of any bounded face is much smaller than D. We show that, if d is the maximum…