Related papers: Disjoint axis-parallel segments without a circumsc…
We show that if a knot or link has n thin levels when put in thin position then its exterior contains a collection of n disjoint, non-parallel, planar, meridional, essential surfaces. A corollary is that there are at least n/3 tetrahedra in…
We construct a compact nonpositively curved squared 2-complex whose universal cover contains a flat plane that is not the limit of periodic flat planes.
The Heesch problem 'grades' polygons that fail to tile the plane in terms of the number of layers (or corollas) of copies of it that can be formed around a central unit. We study the different topology of ' walls', which we define to be…
Any planar graph has a crossing-free straight-line drawing in the plane. A simultaneous geometric embedding of two n-vertex graphs is a straight-line drawing of both graphs on a common set of n points, such that the edges withing each…
A drawing of a graph is $k$-plane if no edge is crossed more than $k$ times. In this paper we study saturated $k$-plane drawings with few edges. This are $k$-plane drawings in which no edge can be added without violating $k$-planarity. For…
Given a directed graph, an acyclic set is a set of vertices inducing a subgraph with no directed cycle. In this note we show that there exist oriented planar graphs of order $n$ for which the size of the maximum acyclic set is at most…
We demonstrate an infinite family of pseudoline arrangements, in which an arrangement of n pseudolines has no member incident to more than 4n/9 points of intersection. This shows the "Strong Dirac" conjecture to be false for pseudolines. We…
The non-planar Feynman diagram with seven massless, scalar propagators and four on-shell legs (the crossed double box) is calculated analytically in dimensional regularization. The non-planar diagram with six propagators is also discussed.
In this paper we present the results from a program developed by the author that finds the unitals of the known 193 projective planes of order 25.. There are several planes for which we have not found any unital. One or more than one…
Let $\F$ be a finite family of axis-parallel boxes in $\R^d$ such that $\F$ contains no $k+1$ pairwise disjoint boxes. We prove that if $\F$ contains a subfamily $\M$ of $k$ pairwise disjoint boxes with the property that for every $F\in \F$…
We report a small advance on a question raised by Robertson, Schweitzer, and Wagon in [RSW02]. They constructed a genus-13 polyhedron built from bricks without corners, and asked whether every genus-0 such polyhedron must have a corner. A…
We construct a new non-desarguesian projective plane from a complex analytic structure. At the same time the construction can be explained in terms of so called Hrushovski's construction. This supports the hypothesis that in general…
We prove an extension of a ham sandwich theorem for families of lines in the plane by Dujmovi\'{c} and Langerman. Given two sets $A, B$ of $n$ lines each in the plane, we prove that it is possible to partition the plane into $r$ convex…
A convex geometry is a closure system satisfying the anti-exchange property. In this work we document all convex geometries on 4- and 5-element base sets with respect to their representation by circles on the plane. All 34 non-isomorphic…
We provide three infinite families of graphs in the Johnson and Grassmann schemes that are not uniquely determined by their spectrum. We do so by constructing graphs that are cospectral but non-isomorphic to these graphs.
Given four congruent balls $A, B, C, D$ in $R^{d}$ that have disjoint interior and admit a line that intersects them in the order $ABCD$, we show that the distance between the centers of consecutive balls is smaller than the distance…
In this article we prove two main results. Firstly, we show that any six-line arrangement, consisting of three pairs of mutually perpendicular lines, does not give rise to a "very generic or sufficiently general" discriminantal arrangement…
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.…
Confirming a conjecture of Ne\v{s}et\v{r}il, we show that up to isomorphism there is only a finite number of finite minimal asymmetric undirected graphs. In fact, there are exactly 18 such graphs. We also show that these graphs are exactly…
We show that for any large $n$, there exists a set of $n$ points in the plane with $O(n^2/\sqrt{\log n})$ distinct distances, such that any four points in the set determine at least five distinct distances. This answers (in the negative) a…