Related papers: Pinwheels and bypasses

Let P be a cyclic n-gon with n\ge3, the central angles \th_0,...,\th_{n-1} in (-\pi,\pi], and the winding number w:=(\th_0+...+\th_{n-1})/(2\pi). The vertices of P are assumed to be all distinct from one another. It is then proved that P is…

Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…

Viviani's theorem states that the sum of distances from any point inside an equilateral triangle to its sides is constant. We consider extensions of the theorem and show that any convex polygon can be divided into parallel segments such…

This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…

Wormholes allowed by the general theory of relativity that are simultaneously traversable by humanoid travelers are subject to severe constraints from quantum field theory, particularly the so-called quantum inequalities, here slightly…

A sufficient condition for $\bar{\partial}$ to have closed range is given for pseudoconvex, possibly unbounded domains in $\mathbb{C}^n$.

We show that a plane continuum X is indecomposable iff X has a sequence (U_n) of not necessarily distinct complementary domains satisfying what we call the double-pass condition: If one draws an open arc A_n in each U_n whose ends limit…

Quadratic systems with lossless quadratic terms arise in many applications, including models of atmosphere and incompressible fluid flows. Such systems have a trapping region if all trajectories eventually converge to and stay within a…

Convex geometries are closure systems satisfying the anti-exchange axiom. Every finite convex geometry can be embedded into a convex geometry of finitely many points in an n-dimensional space equipped with a convex hull operator, by the…

Pseudo-cones are a class of unbounded closed convex sets, not containing the origin. They admit a kind of polarity, called copolarity. With this, they can be considered as a counterpart to convex bodies containing the origin in the…

A product of cochains in a polyhedral complex is constructed. The multiplication algorithm depends on the choice of a parameter. The parameter is a linear functional on the ambient space. Cocycles form a subring of the ring of cochains,…

Tunneling is an important physical process. The observation that particles surmount a high mountain in spite of the fact that they don't have the necessary energy cannot be explained by classical physics. However, this so called tunneling…

We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…

In this work, we address the occurrence of infinite pinning in a random medium. We suppose that an initially flat interface starts to move through the medium due to some constant driving force. The medium is assumed to contain random…

We address the problem about under what conditions an endomorphism having a dense orbit, verifies that a sufficiently close perturbed map also exhibits a dense orbit. In this direction, we give sufficient conditions, that cover a large…

Polygons are cycles embedded into the plane; their vertices are associated with $x$- and $y$-coordinates and the edges are straight lines. Here, we consider a set of polygons with pairwise non-overlapping interior that may touch along their…

Deciding whether the union of two convex polyhedra is itself a convex polyhedron is a basic problem in polyhedral computations; having important applications in the field of constrained control and in the synthesis, analysis, verification…

Following the renewed interest in the topic [1], we revisit the problem of assigning probabilities to classes of Feynman paths passing through specified space-time regions. We show that by assigning of probabilities to interfering…

A new parametric surface representation is proposed that interpolates the vertices of a given closed mesh of arbitrary topology. Smoothly connecting quadrilateral patches are created by blending local, multi-sided quadratic interpolants. In…

Polyominoes are a subset of polygons which can be constructed from integer-length squares fused at their edges. A system of polygons P is interlocked if no subset of the polygons in P can be removed arbitrarily far away from the rest. It is…