Related papers: Modem Illumination of Monotone Polygons
The monotone path polytope of a polytope $P$ encapsulates the combinatorial behavior of the shadow vertex rule (a pivot rule used in linear programming) on $P$. Computing monotone path polytopes is the entry door to the larger subject of…
A point p is 1-well illuminated by a set F of n point lights if p lies in the interior of the convex hull of F. This concept corresponds to triangle-guarding or well-covering. In this paper we consider the illumination range of the light…
We prove a conjecture of Aanjaneya, Bishnu, and Pal that the minimum number of diffuse reflections sufficient to illuminate the interior of any simple polygon with $n$ walls from any interior point light source is $\lfloor n/2 \rfloor - 1$.…
We show that every linear optical component can be completely described as a device that converts one set of orthogonal input modes, one by one, to a matching set of orthogonal output modes. This result holds for any linear optical…
We consider extending visibility polygon $(VP)$ of a given point $q$ $(VP(q))$, inside a simple polygon $\P$ by converting some edges of $\P$ to mirrors. We will show that several variations of the problem of finding mirror-edges to add at…
At a first glance, the problem of illuminating the boundary of a convex body by external light sources and the problem of covering a convex body by its smaller positive homothetic copies appear to be quite different. They are in fact two…
It is shown that any smooth closed orientable manifold of dimension $2k + 1$, $k \geq 2$, admits a smooth polynomially convex embedding into $\mathbb C^{3k}$. This improves by $1$ the previously known lower bound of $3k+1$ on the possible…
Quantum illumination leverages entanglement to surpass classical target detection, even in high-noise environments. Remarkably, its quantum advantage persists despite entanglement degradation caused by environmental decoherence. A central…
The well-known \textsc{Watchman Route} problem seeks a shortest route in a polygonal domain from which every point of the domain can be seen. In this paper, we study the cooperative variant of the problem, namely the \textsc{$k$-Watchmen…
We prove that for any point set P in the plane, a triangle T, and a positive integer k, there exists a coloring of P with k colors such that any homothetic copy of T containing at least ck^8 points of P, for some constant c, contains at…
Motivated by secure wireless networking, we consider the problem of placing fixed localizers that enable mobile communication devices to prove they belong to a secure region that is defined by the interior of a polygon. Each localizer views…
A technique of designing antenna excitation realizing orthogonal states is presented. It is shown that a symmetric antenna geometry is required in order to achieve orthogonality with respect to all physical quantities. A maximal number of…
We prove the existence of an infinite number of internal (shape) modes of sine-Gordon solitons in the presence of some inhomogeneous long-range forces, provided some conditions are satisfied.
Motivated by the $k$-center problem in location analysis, we consider the \emph{polygon burning} (PB) problem: Given a polygonal domain $P$ with $h$ holes and $n$ vertices, find a set $S$ of $k$ vertices of $P$ that minimizes the maximum…
A sliding k-transmitter in an orthogonal polygon P is a mobile guard that travels back and forth along an orthogonal line segment s inside P. It can see a point p in P if the perpendicular from p onto s intersects the boundary of P at most…
Quasinormal modes (QNMs) are essential for understanding the stability and resonances of open systems, with increasing prominence in black hole physics. We present here the first study of QNMs of optical potentials. We show that solitons…
A strongly reflective modular form with respect to an orthogonal group of signature (2,n) determines a Lorentzian Kac--Moody algebra. We find a new geometric application of such modular forms: we prove that if the weight is larger than n…
We introduce an approach based on moving frames for polygon recognition and symmetry detection. We present detailed algorithms for recognition of polygons modulo the special Euclidean, Euclidean, equi-affine, skewed-affine and similarity…
The question of efficient multimode description of optical pulses is studied. We show that a relatively very small number of nonmonochromatic modes can be sufficient for a complete quantum description of pulses with Gaussian quadrature…
A \emph{frequency square} is a matrix in which each row and column is a permutation of the same multiset of symbols. We consider only {\em binary} frequency squares of order $n$ with $n/2$ zeroes and $n/2$ ones in each row and column. Two…