Related papers: On multiple connectedness of regions visible due t…
We study relations between reflections in (positive or negative) points in the complex hyperbolic plane. It is easy to see that the reflections in the points q_1,q_2 obtained from p_1,p_2 by moving p_1,p_2 along the geodesic generated by…
Let $P$ be an $x$-monotone orthogonal polygon with $n$ vertices. We call $P$ a simple histogram if its upper boundary is a single edge; and a double histogram if it has a horizontal chord from the left boundary to the right boundary. Two…
Let $V$ be a smooth, projective, rationally connected variety, defined over a number field $k$, and let $Z\subset V$ be a closed subset of codimension at least two. In this paper, for certain choices of $V$, we prove that the set of…
Let $G=(V(G),E(G))$ be a simple graph, and let $U\subseteq V(G)$. Two distinct vertices $x,y\in U$ are $U$-mutually visible if $G$ contains a shortest $x$-$y$ path that is internally disjoint from $U$. $U$ is called a mutual-visibility set…
When the boundary of a familiar object is shown by a series of isolated dots, humans can often recognize the object with ease. This ability can be sustained with addition of distracting dots around the object. However, such capability has…
We provide two methods to characterize the connectedness of all $d$-dimensional generalized Sierpi\'nski sponges whose corresponding IFSs are allowed to have rotational and reflectional components. Our approach is to reduce it to an…
We prove that simply connected local 2-dimensional simplicial complexes embed in 3-space if and only if their dual matroids are graphic. Examples are provided that the assumptions of simply connectedness and locality are necessary. This may…
Visibility graph of a polygon corresponds to its internal diagonals and boundary edges. For each vertex on the boundary of the polygon, we have a vertex in this graph and if two vertices of the polygon see each other there is an edge…
We prove that if two subsets ${A}$ and ${B}$ of the plane are connected, ${A}$ is bounded, and the Euclidean distance $\rho({A},{B})$ between ${A}$ and ${B}$ is greater than zero, then for every positive $\varepsilon<\rho({A},{B})$, the…
We construct branched double coverings by certain direct products of manifolds for connected sums of copies of sphere bundles over the 2-sphere. As an application we answer a question of Kotschick and Loeh up to dimension five. More…
Reconfigurable intelligent surfaces (RISs) offer a viable way to improve the performance of multi-hop device-to-device (D2D) communication. However, due to the substantial propagation and penetration losses of the millimeter waves…
A divide is the image of a proper and generic immersion of a compact $1$-manifold into the $2$-disk. Due to A'Campo's theory, each divide is associated with a link in the 3-sphere. In this paper, we reveal a hidden hyperbolic structure in…
For a positive integer $n\geq 3$, the sides and diagonals of a convex $n$-gon divide the interior of the convex $n$-gon into finitely (polynomial in $n$) many regions bounded by them. In this article, we associate to every region a unique…
We prove that the separated curve complex of a closed orientable surface of genus g is (g-3)-connected. We also obtain a connectivity property for a separated curve complex of the open surface that is obtained by removing a finite set from…
Understanding the topology of decision regions is central to explaining the inner workings of deep neural networks. Prior empirical work has provided evidence that these regions are path connected. We study a stronger topological question:…
Deciding whether a family of disjoint line segments in the plane can be linked into a simple polygon (or a simple polygonal chain) by adding segments between their endpoints is NP-hard.
We introduce a new measure for planar point sets S that captures a combinatorial distance that S is from being a convex set: The reflexivity rho(S) of S is given by the smallest number of reflex vertices in a simple polygonalization of S.…
A circuit double cover of a bridgeless graph is a collection of even subgraphs such that every edge is contained in exactly two subgraphs of the given collection. Such a circuit double cover describes an embedding of the corresponding graph…
We study Multiple Andreev Reflections in long diffusive superconductor(S)-normal metal(N)-superconductor junctions with low-transparency interfaces. Assuming strong thermalization in the weak link we calculate the current-voltage dependence…
This paper studies a variant of the Art Gallery problem in which the ``walls" can be replaced by \emph{reflecting edges}, which allows the guards to see further and thereby see a larger portion of the gallery. Given a simple polygon $\cal…