Related papers: Non-dissective coverings by planks

Main Theorem. Two parabols have four common points. There exists a circle tangent to the sides of the obtained parabolic quadrilateral if and only if the diagonals of this quadrilateral are orthogonal. The proof of the Main Theorem is…

Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of…

In connection with an unsolved problem of Bang (1951) we give a lower bound for the sum of the base volumes of cylinders covering a d-dimensional convex body in terms of the relevant basic measures of the given convex body. As an…

This note concerns the so-called pyjama problem, whether it is possible to cover the plane by finitely many rotations of vertical strips of half-width $\varepsilon$. We first prove that there exist no periodic coverings for…

Let H be a Hilbert space and let F be the family of all countable subsets of an orthonormal basis of H. We show that if F is infinite then F is equipollent with every linear basis of the vector space H. In doing so we also present a short…

A circle packing is a collection of disks with disjoint interiors in the plane. It naturally defines a graph by tangency. It is shown that there exists $p>0$ such that the following holds for every circle packing: If each disk is retained…

Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrary planar graph to index the decomposition. We prove that…

The aim of this paper is to present two tools, Theorems 4 and 7, that make the task of finding equivalent polyhedral norms on certain Banach spaces easier and more transparent. The hypotheses of both tools are based on countable…

The book embedding of a graph $G$ is to place the vertices of $G$ on the spine and draw the edges to the pages so that the edges in the same page do not cross with each other. A book embedding is matching if the vertices in the same page…

We review a certain problem on covering triangles in the plane. Equivalently, it can be viewed as a family of 'isobilliard' inequalities in convex shapes, and as a special case of Viterbo's conjecture in symplectic geometry. We give an…

We establish that, over certain ground fields, the set of osculating tangents of Cayley's ruled cubic surface gives rise to a (maximal partial) spread which is also a dual (maximal partial) spread. It is precisely the Betten-Walker spreads…

Building on a recent construction of G. Plebanek and the third named author, it is shown that a complemented subspace of a Banach lattice need not be linearly isomorphic to a Banach lattice. This solves a long-standing open question in…

We consider the convex subset $[A,B]$ of all elements between two levels $A$ and $B$ of a finite distributive lattice, as a union of (or covered by) intervals $[a,b]$. A 1988 result of Voigt and Wegener shows that for such convex subsets of…

Let $K\subset \mathbb{R}^n$ be a convex body, $n\geq 3$. We say that $K$ satisfies the Barker-Larman condition if there exists a ball $B$ in the interior of $K$ such that for every suppor hyperplane $\Pi$ of $B$, the section $\Pi \cap K$ is…

A planar framework -- a graph together with a map of its vertices to the plane -- is flexible if it allows a continuous deformation preserving the distances between adjacent vertices. Extending a recent previous result, we prove that a…

In 1989, Ne\v{s}et\v{r}il and Pudl\'ak posed the following challenging question: Do planar posets have bounded Boolean dimension? We show that every poset with a planar cover graph and a unique minimal element has Boolean dimension at most…

In this paper we present a new bound obtained with the probabilistic method for the solution of the Set Covering problem with unit costs. The bound is valid for problems of fixed dimension, thus extending previous similar asymptotic…

We address the separability problem for straight-line string constraints. The separability problem for languages of a class C by a class S asks: given two languages A and B in C, does there exist a language I in S separating A and B (i.e.,…

A planar Tangle is a smooth simple closed curve piecewise defined by quadrants of circles with constant curvature. We can enumerate Tangles by counting their dual graphs, which consist of a certain family of polysticks. The number of…

For any configuration of pebbles on the nodes of a graph, a pebbling move replaces two pebbles on one node by one pebble on an adjacent node. A cover pebbling is a move sequence ending with no empty nodes. The number of pebbles needed for a…