Related papers: Intersecting hexagons in 3-space

The present article includes the enumeration of $n$-polygons with two certain symmetry properties: For a number $3m$ of vertices, we count the $3m$-polygons with $m$ symmetry axes and the $3m$-polygons, that match after three elementary…

We prove crossing number inequalities for geometric graphs whose vertex sets are taken from a d-dimensional grid of volume N and give applications of these inequalities to counting the number of non-crossing geometric graphs that can be…

Given a set of points $P$ and a set of regions $\mathcal{O}$, an incidence is a pair $(p,o ) \in P \times \mathcal{O}$ such that $p \in o$. We obtain a number of new results on a classical question in combinatorial geometry: What is the…

A geometric graph is a graph drawn in the plane so that its vertices and edges are represented by points in general position and straight line segments, respectively. A vertex of a geometric graph is called pointed if it lies outside of the…

Let $\cC$ be a set of curves in the plane such that no three curves in $\cC$ intersect at a single point and every pair of curves in $\cC$ intersect at exactly one point which is either a crossing or a touching point. J\'anos Pach…

The focus of this paper is on a thin obstacle problem where the obstacle is defined on the intersection between a hyper-plane $\Gamma$ in $\mathbb{R}^n$ and a periodic perforation $\mathcal{T}_\varepsilon$ of $\mathbb{R}^n$, depending on a…

We generalize the Newtonian n-body problem to spaces of curvature k=constant, and study the motion in the 2-dimensional case. For k>0, the equations of motion encounter non-collision singularities, which occur when two bodies are antipodal.…

We study a finite analog of a problem of Erdos, Hickerson and Pach on the maximum number of occurrences of a fixed angle among n directions in three-dimensional spaces.

A family $F$ of graphs on a fixed set of $n$ vertices is called triangle-intersecting if for any $G_1,G_2 \in F$, the intersection $G_1 \cap G_2$ contains a triangle. More generally, for a fixed graph $H$, a family $F$ is $H$-intersecting…

We shall investigate flat surfaces in hyperbolic 3-space with admissible singularities, called `flat fronts'. An Osserman-type inequality for complete flat fronts is shown. When equality holds in this inequality, we show that all the ends…

A homothetic packing of squares is any set of various-size squares with the same orientation where no two squares have overlapping interiors. If all $n$ squares have the same size then we can have up to roughly $4n$ contacts by arranging…

We give a formula for the number of interior intersection points made by the diagonals of a regular $n$-gon. The answer is a polynomial on each residue class modulo 2520. We also compute the number of regions formed by the diagonals, by…

An unfolding of a polyhedron along its edges is called a vertex unfolding if adjacent faces are allowed to be connected at not only an edge but also a vertex. Demaine et al showed that every triangulated polyhedron has a vertex unfolding.…

A point P on a smooth hypersurface X of degree d in an N-dimensional projective space is called a star point if and only if the intersection of X with the embedded tangent space T_P(X) is a cone with vertex P. This notion is a…

We study homogeneity aspects of metric spaces in which all triples of distinct points admit pairwise different distances; such spaces are called isosceles-free. In particular, we characterize all homogeneous isosceles-free spaces up to…

Satisfiability solving has been used to tackle a range of long-standing open math problems in recent years. We add another success by solving a geometry problem that originated a century ago. In the 1930s, Esther Klein's exploration of…

The new concept of a system of hex equations is introduced as an overdetermined system of six five-point face-centered quad equations defined on six vertices of a hexagon. For a consistent system of hex equations, two variables on…

We answer an open question proposed by P\'{o}lik and Terlaky in 2007 that: {\it how we can decide whether two quadratic surfaces intersect without actually computing the intersections?}

We study the problem of finding maximum-area rectangles contained in a polygon in the plane. There has been a fair amount of work for this problem when the rectangles have to be axis-aligned or when the polygon is convex. We consider this…

We calculate intersection forms of all 4-dimensional almost-flat manifolds