Related papers: Intersecting hexagons in 3-space

An algorithm is demonstrated that finds an ordinary intersection in an arrangement of $n$ lines in $\mathbb{R}^2$, not all parallel and not all passing through a common point, in time $O(n \log{n})$. The algorithm is then extended to find…

The present article includes the enumeration of $n$-polygons with a certain symmetry property: For an even number $n$ of vertices, we count the $n$-polygons with $\frac{n}{2}$ symmetry axes. In addition, if $n$ is a power of 2, we show the…

We prove that if a subset of the d-dimensional vector space over a finite field is large enough, then it contains many k-tuples of mutually orthogonal vectors.

Consider the hypergraph whose vertex set is a family of $n$ lines in general position in the plane, and whose hyperedges are induced by intersections with a family of pseudo-discs. We prove that the number of $t$-hyperedges is bounded by…

For any given integer $r\geqslant 3$, let $k=k(n)$ be an integer with $r\leqslant k\leqslant n$. A hypergraph is $r$-uniform if each edge is a set of $r$ vertices, and is said to be linear if two edges intersect in at most one vertex. Let…

Two tetrahedra are called orthologic if the lines through vertices of one and perpendicular to corresponding faces of the other are intersecting. This is equivalent to the orthogonality of non-corresponding edges. We prove that the…

We consider the motion of a finite though large number $N$ of hard spheres in the whole space $\mathbb{R}^n$. Particles move freely until they experience elastic collisions. We use our recent theory of Compensated Integrability in order to…

Let $H$ be an $n$-vertex 3-uniform hypergraph such that every pair of vertices is in at least $n/3+o(n)$ edges. We show that $H$ contains two vertex-disjoint tight paths whose union covers the vertex set of $H$. The quantity two here is…

We consider the problem of finding the minimal number of points required to intersect all lines in an affine space over the finite field of order 3. We also consider the problem of finding the minimal number of points required to intersect…

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.…

This paper attacks the following problem. We are given a large number $N$ of rectangles in the plane, each with horizontal and vertical sides, and also a number $r<N$. The given list of $N$ rectangles may contain duplicates. The problem is…

We analyse the intersection of positively and negatively sectional-hyperbolic sets for flows on compact manifolds. First we prove that such an intersection is hyperbolic if the intersecting sets are both transitive (this is false without…

Let $X^o=\mathbb P^3\setminus D$ where $D$ is the union of two quadrics such that their intersection contains a smooth conic, or the union of a smooth quadric surface and two planes, or the union of a smooth cubic surface $V$ and a plane…

Consider the system of $n$ identical hard balls in $\mathbb R^3$ moving freely and colliding elastically. We show that there exist initial conditions such that the number of collisions is exponential in $n$.

Let $\mathcal F\subset 2^{[n]}$ be a family in which any three sets have non-empty intersection and any two sets have at least $38$ elements in common. The nearly best possible bound $|\mathcal F|\le 2^{n-2}$ is proved. We believe that $38$…

We give a new and elementary proof that the number of elastic collisions of a finite number of balls in the Euclidean space is finite. We show that if there are $n$ balls of equal masses and radii 1, and at the time of a collision between…

Closed form expressions are given for computing the parameters and vectors that identify and define the $n-1$ dimensional conic section that results from the intersection of a hyperplane with an $n$-dimensional conic section: cone,…

Let $S$ be a set of $n$ points in the plane in general position. Two line segments connecting pairs of points of $S$ cross if they have an interior point in common. Two vertex disjoint geometric graphs with vertices in $S$ cross if there…

A problem that is simple to state in the context of spherical geometry, and that seems rather interesting, appears to have been unexamined to date in the mathematical literature. The problem can also be recast as a problem in the real…

We show that the maximum number of pairwise intersecting positive homothets of a $d$-dimensional centrally symmetric convex body, none of which contains the center of another in its interior, is at most $3^{d+1}$. Also, we improve upper…