Related papers: Modem Illumination of Monotone Polygons
We theoretically study bright and dark solitons in an experimentally relevant hybrid system characterized by strong light-matter coupling. We find that the corresponding two-component model supports a variety of coexisting moving solitons…
We study the following problem: Given $k$ paths that share the same vertex set, is there a simultaneous geometric embedding of these paths such that each individual drawing is monotone in some direction? We prove that for any dimension $d…
Given a line segment $I=[0,L]$, the so-called barrier, and a set of $n$ sensors with varying ranges positioned on the line containing $I$, the barrier coverage problem is to move the sensors so that they cover $I$, while minimising the…
We consider extending the visibility polygon of a given point $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 precisely $k$…
This paper contains the first knot polynomials which can distinguish the orientations of classical knots and which make no excplicit use of the knot group. But they make extensive use of the meridian and of the longitude in a geometric way.…
A polyiamond is a polygon composed of unit equilateral triangles, and a generalized deltahedron is a convex polyhedron whose every face is a convex polyiamond. We study a variant where one face may be an exception. For a convex polygon P,…
In a convex n-gon, let d[1] > d[2] > ... denote the set of all distances between pairs of vertices, and let m[i] be the number of pairs of vertices at distance d[i] from one another. Erdos, Lovasz, and Vesztergombi conjectured that m[1] +…
Efficient switching and routing of photons of different wavelengths is a requirement for realizing a quantum internet. Multimode optomechanical systems can solve this technological challenge and enable studies of fundamental science…
The Monotone Upper Bound Problem asks for the maximal number M(d,n) of vertices on a strictly-increasing edge-path on a simple d-polytope with n facets. More specifically, it asks whether the upper bound M(d,n)<=M_{ubt}(d,n) provided by…
Plasmon modes of a two-dimensional lattice of long conducting circular wires are investigated by using an embedding technique to solve Maxwell's equations rigorously. The frequency-dependent density of states is calculated for various…
Let p(n, k) denote the number of partitions of n into parts less than or equal to k. We show several properties of this function modulo 2. First, we prove that for fixed positive integers k and m, p(n,k) is periodic modulo m. Using this, we…
We study $k$-uniform states in heterogeneous systems whose local dimensions are mixed. Based on the connections between mixed orthogonal arrays with certain minimum Hamming distance, irredundant mixed orthogonal arrays and $k$-uniform…
We study the problem of colouring visibility graphs of polygons. In particular, for visibility graphs of simple polygons, we provide a polynomial algorithm for 4-colouring, and prove that the 5-colourability question is already NP-complete…
Motivated by the problem of bounding the number of iterations of the Simplex algorithm we investigate the possible lengths of monotone paths followed by the Simplex method inside the oriented graphs of polyhedra (oriented by the objective…
The GRAPH MOTIF problem asks whether a given multiset of colors appears on a connected subgraph of a vertex-colored graph. The fastest known parameterized algorithm for this problem is based on a reduction to the $k$-Multilinear Detection…
The Hong-Ou-Mandel experiment leads indistinguishable photons simultaneously reaching a 50:50 beam splitter to emerge on the same port through two-photon interference. Motivated by this phenomenon, we consider numerical experiments of the…
For a class of orthogonal polynomials related to the $q$-Meixner polynomials corresponding to an indeterminate moment problem we give a one-parameter family of orthogonality measures. For these measures we complement the orthogonal…
We will first solve the following problem analytically: given a piece of wire of specified length, we will find where the wire should be cut and bent to form two regular polygons not necessarily having the same number of sides, so that the…
A function $f\colon\mathbb R\to\mathbb R$ is called \emph{$k$-monotone} if it is $(k-2)$-times differentiable and its $(k-2)$nd derivative is convex. A point set $P\subset\mathbb R^2$ is \emph{$k$-monotone interpolable} if it lies on a…
A classical problem, due to Gerencs\'er and Gy\'arf\'as from 1967, asks how large a monochromatic connected component can we guarantee in any $r$-edge colouring of $K_n$? We consider how big a connected component can we guarantee in any…