Related papers: On intersection of simply connected sets in the pl…
It is a longstanding conjecture that every simple drawing of a complete graph on $n \geq 3$ vertices contains a crossing-free Hamiltonian cycle. We strengthen this conjecture to "there exists a crossing-free Hamiltonian path between each…
We construct a direct natural bijection between descending plane partitions without any special part and permutations. The directness is in the sense that the bijection avoids any reference to nonintersecting lattice paths. The advantage of…
For a graph whose vertex set is a finite set of points in the Euclidean $d$-space consider the closed (open) balls with diameters induced by its edges. The graph is called a (an open) Tverberg graph if these closed (open) balls intersect.…
We prove that the number of real intersection points of a real line with a real plane curve defined by a polynomial with at most t monomials is either infinite or does not exceed 6t -7. This improves a result by M. Avendano. Furthermore, we…
The order in which plane-filling curves visit points in the plane can be exploited to design efficient algorithms. Typically, the curves are useful because they preserve locality: points that are close to each other along the curve tend to…
It is shown that a separated sequence of points in the unit disc of the complex plane is in fact uniformly separated, if there exists a certain intermediate sequence whose separated subsequences are uniformly separated. This property is…
Given a set of objects $O$ in the plane, the corresponding intersection graph is defined as follows. Each object defines a vertex and an edge joins two vertices whenever the corresponding objects intersect. We study here the case of unit…
Consider two paths $\phi,\psi:[0;1]\to [0;1]^2$ in the unit square such that $\phi(0)=(0,0)$, $\phi(1)=(1,1)$, $\psi(0)=(0,1)$ and $\psi(1)=(1,0)$. By continuity of $\phi$ and $\psi$ there is a point of intersection. We prove that from…
We prove that an injection from the integer set into the real line admits a quasiconformal extension to the complex plane if and only if it is quasisymmetric.
We isolate conditions on the relative size of sets of natural numbers $A,B$ that guarantee a nonempty intersection $\Delta(A)\cap\Delta(B)\ne\emptyset$ of the corresponding sets of distances. Such conditions apply to a large class of zero…
In 2011 at an Oberwolfach workshop in Discrete Geometry, V. Dol'nikov posed the following problem. Consider three non-empty families of translates of a convex compact set $K$ in the plane. Suppose that every two translates from different…
We undertake a study on computing Hamiltonian alternating cycles and paths on bicolored point sets. This has been an intensively studied problem, not always with a solution, when the paths and cycles are also required to be plane. In this…
We classify the solutions to an overdetermined elliptic problem in the plane in the finite connectivity case. This is achieved by establishing a one-to-one correspondence between the solutions to this problem and a certain type of minimal…
The intersection matrix of a finite simplicial complex has as each of its entries the rank of the intersection of its respective simplices. We prove that such matrix defines the triangulation of a closed connected surface up to isomorphism.
We generalize the joints problem to sets of varieties and prove almost sharp bound on the number of joints. As a special case, given a set of $N$ $2$-planes in $\mathbb{R}^6$, the number of points at which three $2$-planes intersect and…
A locally compact stable plane of positive topological dimension will be called semiaffine if for every line $L$ and every point $p$ not in $L$ there is at most one line passing through $p$ and disjoint from $L$. We show that then the plane…
A coupling of random walkers on the same finite graph, who take turns sequentially, is said to be an avoidance coupling if the walkers never collide. Previous studies of these processes have focused almost exclusively on complete graphs, in…
A graph $G$ with vertex set $\{v_1,v_2,\ldots,v_n\}$ is an intersection graph of segments if there are segments $s_1,\ldots,s_n$ in the plane such that $s_i$ and $s_j$ have a common point if and only if $\{v_i,v_j\}$ is an edge of~$G$. In…
We give a new approach to intersection theory. Our "cycles" are closed manifolds mapping into compact manifolds and our "intersections" are elements of a homotopy group of a certain Thom space. The results are then applied in various…
In this paper, we further investigate the orthogonally connected sets and establish necessary and sufficient conditions for a set to be staircase connected.