Related papers: On $\Lambda$-positioning of an arc between two par…
We investigate straight-line drawings of topological graphs that consist of a planar graph plus one edge, also called almost-planar graphs. We present a characterization of such graphs that admit a straight-line drawing. The…
We consider a constrained minimax single facility location problem on the plane with rectilinear distance. The feasible set of location points is restricted to rectangles with sides oriented at a 45 degrees angle to the axes of Cartesian…
A weak pseudoline arrangement is a topological generalization of a line arrangement, consisting of curves topologically equivalent to lines that cross each other at most once. We consider arrangements that are outerplanar---each crossing is…
In this paper, we prove that a set of $N$ points in ${\bf R}^2$ has at least $c{N \over \log N}$ distinct distances, thus obtaining the sharp exponent in a problem of Erd\"os. We follow the set-up of Elekes and Sharir which, in the spirit…
A {\em simple drawing} $D(G)$ of a graph $G$ is one where each pair of edges share at most one point: either a common endpoint or a proper crossing. An edge $e$ in the complement of $G$ can be {\em inserted} into $D(G)$ if there exists a…
We study a class of geometric covering and packing problems for bounded regions on the plane. We are given a set of axis-parallel line segments that induces a planar subdivision with a set of bounded (rectilinear) faces. We are interested…
Explicit expressions are considered for the generating functions concerning the number of planar diagrams with given numbers of 3- and 4-point vertices. It is observed that planar renormalization theory requires diagrams with restrictions,…
Suppose $f\in L^1(\mathbb{R}^d)$, $\Lambda\subset\mathbb{R}^d$ is a finite union of translated lattices such that $f+\Lambda$ tiles with a weight. We prove that there exists a lattice $L\subset{\mathbb{R}}^d$ such that $f+L$ also tiles,…
A drawing of a graph is said to be a {\em straight-line drawing} if the vertices of $G$ are represented by distinct points in the plane and every edge is represented by a straight-line segment connecting the corresponding pair of vertices…
A regular parallelism of real projective 3-space PG(3,R) is an equivalence relation on the line space such that every class is equivalent to the set of 1-dimensional complex subspaces of a 2-dimensional complex vector space. We shall assume…
Given a subshift over an arbitrary alphabet, we construct a representation of the associated unital algebra. We describe a criteria for the faithfulness of this representation in terms of the existence of cycles with no exits. Subsequently,…
introduce {\sc Planar Disjoint Paths Completion}, a completion counterpart of the Disjoint Paths problem, and study its parameterized complexity. The problem can be stated as follows: given a, not necessarily connected, plane graph $G,$ $k$…
We show that if a right-angled Artin group $A(\Gamma)$ has a non-trivial, minimal action on a tree $T$ which is not a line, then $\Gamma$ contains a separating subgraph $\Lambda$ such that $A(\Lambda)$ stabilizes an edge in $T$.
Given a finite set $ S $ of points, we consider the following reconfiguration graph. The vertices are the plane spanning paths of $ S $ and there is an edge between two vertices if the two corresponding paths differ by two edges (one…
Our starting point is a very simple one, namely that of a set L_4 of four mutually skew lines in PG(7,2): Under the natural action of the stabilizer group G(L_4) < GL(8,2) the 255 points of PG(7,2) fall into four orbits omega_1, omega_2,…
This paper studies equable parallelograms whose vertices lie on the integer lattice. Using Rosenberger's Theorem on generalised Markov equations, we show that the g.c.d. of the side lengths of such parallelograms can only be 3, 4 or 5, and…
We consider 3-regular planar matchstick graphs, i.e. those which have a planar embedding such that all edge lengths are equal, with given girth g. For girth 3 it is known that such graphs exist if and only if the number of vertices n is an…
In this note we recall the classical notion of an algebraically rectifiable plane curve going back to J. A. Serret, E. Laguerre and G. Humbert. We provide new criteria of algebraic rectifiability, relate this notion to quadratic…
Using the Klein correspondence, regular parallelisms of PG(3,R) have been described by Betten and Riesinger in terms of a dual object, called a hyperflock determining (hfd) line set. In the special case where this set has a span of…
Planes are familiar mathematical objects which lie at the subtle boundary between continuous geometry and discrete combinatorics. A plane is geometrical, certainly, but the ways that two planes can interact break cleanly into discrete sets:…