Related papers: Simple wedge points

We prove that for every graph $G$, given fixed locations for the vertices of $G$ in $\mathbb{Z}^3$, there is a three-dimensional grid-drawing of $G$ with one bend per edge. The best previous bound was three bends per edge.

Wavelet sets that are finite unions of convex sets are constructed in $\mathbb R^n$, $n\geq 2$, for dilation by any expansive matrix that has a power equal to a scalar times the identity and also has all singular values greater than $\sqrt…

In this paper we develop the idea of Lyons and gives a simple criterion for the recurrence and the transience. We also show that a wedge has the infinite collision property if and only if it is a recurrent graph.

This article focuses on the occurrence of 3-point configurations in subsets of $\mathbb{R}^d$ of sufficient thickness. We prove that a compact set $A\subset \mathbb{R}^d$ contains a similar copy of any linear $3$-point configuration (such…

The well-known three distance theorem states that there are at most three distinct gaps between consecutive elements in the set of the first n multiples of any real number. We generalise this theorem to higher dimensions under a suitable…

The primary objective of this paper is to investigate the notions of geometric and sequential convexity within a graph-theoretic framework, with the aim of examining various structural properties and exploring the connection between these…

Let $\Omega$ be a non-singular syplectic form on some vector space $V$. Denote by $S^{n}_{k}(\Omega)$ the set of all $k$-dimensional planes $s$ in $V$ such that the restriction of $\Omega$ onto $s$ is singular. For the cases when $k=2,n-2$…

Let End(V) denote the ring of all linear transformations of an arbitrary k-vector space V over a field k. We define a subset X of End(V) to be "triangularizable" if V has a well-ordered basis such that X sends each vector in that basis to…

We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected…

Hadwiger's covering conjecture is that every $n$-dimensional convex body can be covered by at most $2^n$ of its smaller positive homothetic copies, with $2^n$ copies required only for affine images of $n$-cube. Convex hull of a ball and an…

Let $S$ be a set of $n$ points in general position in the plane. The Second Selection Lemma states that for any family of $\Theta(n^3)$ triangles spanned by $S$, there exists a point of the plane that lies in a constant fraction of them.…

The square peg problem asks whether every Jordan curve in the plane has four points which form a square. The problem has been resolved (positively) for various classes of curves, but remains open in full generality. We present two new…

Consider two horizontal lines in the plane. A pair of a point on the top line and an interval on the bottom line defines a triangle between two lines. The intersection graph of such triangles is called a simple-triangle graph. This paper…

It is shown that a simple closed curve in $\mathbb C^n$ that is a uniform limit of rectifiable simple closed curves each of which has nontrivial polynomial hull has itself nontrivial polynomial hull. In case the limit curve is rectifiable,…

Given a compact, oriented surface $S$ of finite genus and finitely many boundary components, we provide examples of finite covers $\tilde{S}$ of $S$ and non-simple closed curves $\gamma$ on $S$ which lifts to simple closed curves on…

In this paper we provide some sufficient conditions for the existence of an odd or even cycle that passing a given vertex or an edge in $2$-connected or $2$-edge connected graphs. We provide some similar conditions for the existence of an…

We consider the $M$-curves of degree nine with three nests $1 \langle \alpha_i \rangle, i = 1, 2, 3$ in $\mathbb{R}P^2$. After systematic constructions, Korchagin conjectured that at least two of the $\alpha_i$ must be odd. It was later…

An L-shape is the union of a horizontal and a vertical segment with a common endpoint. These come in four rotations: L, \Gamma, LE{} and \eeG. A $k$-bend path is a simple path in the plane, whose direction changes $k$ times from horizontal…

According to the Erd\H{o}s-Szekeres theorem, for every $n$, a sufficiently large set of points in general position in the plane contains $n$ in convex position. In this note we investigate the line version of this result, that is, we want…

Given an undirected graph $G$, let us randomly orient $G$ by tossing independent (possibly biased) coins, one for each edge of $G$. Writing $a\rightarrow b$ for the event that there exists a directed path from a vertex $a$ to a vertex $b$…