Related papers: Area-expanding embeddings of rectangles
Let $k \geq 2$ be a constant. Given any $k$ convex polygons in the plane with a total of $n$ vertices, we present an $O(n\log^{2k-3}n)$ time algorithm that finds a translation of each of the polygons such that the area of intersection of…
We give a short and elementary proof of the fact that every metric space of finite asymptotic dimension can be embedded into a finite product of trees.
We introduce order conserving embeddings as a more general form of order preserving embeddings between finite dimensional nest algebras. The structure of these embeddings is determined, in terms of order indecomposable decompositions, and…
In this paper certain $n$-dimensional inequalities are shown to be equivalent to the inequalities in the one-dimensional setting. By this means, embeddings between weighted local Morrey-type spaces are characterized for some ranges of…
We investigate the problem of estimating a smooth invertible transformation f when observing independent samples X_1, ..., X_n ~ P \circ f, where P is a known measure. We focus on the two dimensional case where P and f are defined on R^2.…
A certain real number, depending on two neighbouring sides of a quadrilateral and the diagonal meeting these two sides at their common point, is shown to be invariant under affinity. As an application we demonstrate a nice formula for the…
We prove that the k-medial axis of an arbitrary closed set in Rn is n-k+1-rectifiable (and hence of dimension at most n-k+1). This result gives a first stratification for medial axis of any closed set, which has been widely studied and used…
We first prove that for every metrizable space $X$, for every closed subset $F$ whose complement is zero-dimensional, the space $X$ can be embedded into a product space of the closed subset $F$ and a metrizable zero-dimensional space as a…
We consider the general second order difference equation $x_{n+1}=F(x_n,x_{n-1})$ in which $F$ is continuous and of mixed monotonicity in its arguments. In equations with negative terms, a persistent set can be a proper subset of the…
We consider the probability of knotting in equilateral random polygons in Euclidean 3-dimensional space, which model, for instance, random polymers. Results from an extensive Monte Carlo dataset of random polygons indicate a universal…
Some aspects of the geometry of superembeddings and its application to supersymmetric extended objects are discussed. In particular, the embeddings of (3|16) and (6|16) dimensional superspaces into (11|32) dimensional superspace,…
We demonstrate that any k*-expansive vector field on a closed manifold exhibits rescaling expansiveness. This enhances the principal outcome outlined in \cite{a}. The verification of this assertion hinges on the introduction and exploration…
Characterizations of all continuous, additive and $\mathrm{GL}(n)$-equivariant endomorphisms of the space of convex functions on a Euclidean space $\mathbb{R}^n$, of the subspace of convex functions that are finite in a neighborhood of the…
The planar embedding conjecture asserts that any planar metric admits an embedding into L_1 with constant distortion. This is a well-known open problem with important algorithmic implications, and has received a lot of attention over the…
In this paper we give an elementary proof of the local sum conjecture in two dimensions. In a remarkable paper [CMN, arXiv:1810.11340], this conjecture has been established in all dimensions using sophisticated, powerful techniques from a…
We consider the problem of finding embeddings of arc-like continua in the plane for which each point in a given subset is accessible. We establish that, under certain conditions on an inverse system of arcs, there exists a plane embedding…
It is shown that, classically, the W-algebras are directly related to the extrinsic geometry of the embedding of two-dimensional manifolds with chiral parametrisation (W-surfaces) into higher dimensional K\"ahler manifolds. We study the…
We introduce a notion of $k$-convexity and explore polygons in the plane that have this property. Polygons which are \mbox{$k$-convex} can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard…
A graph is $k$-gap-planar if it has a drawing in the plane such that every crossing can be charged to one of the two edges involved so that at most $k$ crossings are charged to each edge. We show this class of graphs has linear expansion.…
Given a planar digraph $G$ and a positive even integer $k$, an embedding of $G$ in the plane is k-modal, if every vertex of $G$ is incident to at most $k$ pairs of consecutive edges with opposite orientations, i.e., the incoming and the…