Related papers: Wiring Switches to Light Bulbs
Given $n$ buttons and $n$ bulbs so that the $i$th button toggles the $i$th bulb and perhaps some other bulbs, we compute the sharp lower bound on the number of bulbs that can be lit regardless of the action of the buttons. In the previous…
When a light bulb is turned on, light moves away from it at speed $c$, by definition. When light from this bulb illuminates a surface, however, this illumination front is not constrained to move at speed $c$. A simple proof is given that…
In the so called lightbulb process, on days $r=1,..., n$, out of $n$ lightbulbs, all initially off, exactly $r$ bulbs, selected uniformly and independent of the past, have their status changed from off to on, or vice versa. With $X$ the…
In this comment on "How many principles does it take to change a light bulb ... into a laser?" by Howard M. Wiseman, Physica Scripta 91 (3), 033001 (2016) I am analyzing this extremely nicely formulated question in the framework of the…
Lights Out is a single-player electronic handheld game from the 1990s that features a 5 by 5 grid of light-up buttons. The game begins with some lights on and others off. The goal is to turn off all lights but pressing a button changes its…
Any monotone Boolean circuit computing the $n$-dimensional Boolean convolution requires at least $n^2$ and-gates. This precisely matches the obvious upper bound.
Instead of looking at the lengths of synchronizing words as in \v{C}ern\'y's conjecture, we look at the switch count of such words, that is, we only count the switches from one letter to another. Where the synchronizing words of the…
We show that the minimal number of colors for all effective $n$-colorings of a link with non-zero determinant is at least $1+\log_2 n$.
We answer some questions concerning the so called sigma-game of Sutner. It is played on a graph where each vertex has a lamp, the light of which is toggled by pressing any vertex with an edge directed to the lamp. For example, we show that…
By calculating the O(\alpha_s) corrections to inclusive heavy-to-light sum rules we find model independent upper and lower bounds on form factors for B to pi and B to rho. We use the bounds to rule out model predictions. Some models violate…
We suggest an effective method for controlling nonlinear switching in arrays of weakly coupled optical waveguides. We demonstrate the digitized switching of a narrow input beam for up to eleven waveguides in the engineered waveguide arrays.
We bound EFT coefficients appearing in $2 \to 2$ photon scattering amplitudes in four dimensions. After reviewing unitarity and positivity conditions in this context, we use dispersion relations and crossing symmetry to compute sum rules…
Lights Out is a game played on a graph $G$ where every vertex has a light bulb that is either on or off, and pressing a vertex $v$ toggles the state of every vertex in the closed neighborhood of $v$. The goal is to find a subset of vertices…
One of the open problems posed in [3] is: what is the minimal number k such that an open, flexible k-chain can interlock with a flexible 2-chain? In this paper, we establish the assumption behind this problem, that there is indeed some k…
We study the minimum-time damping of a physical pendulum by means of a bounded control. In the similar problem for a linear oscillator each optimal trajectory possesses a finite number of control switchings from the maximal to the minimal…
In an optical configuration consisting of a flat plate of vacuum between upper and lower spaces of uniform dielectric regions of n>1, we have calculated two output light intensities for two input lights from the Maxwell's equations as…
Quantum entanglement cannot be unlimitedly shared among arbitrary number of qubits. Larger the number of entangled pairs in an N-qubit system, smaller the degree of bi-partite entanglement is. We analyze a system of N qubits in which an…
We investigate the universality of multi-spin systems in architectures of various symmetries of coupling type and topology. Explicit reachability sets under symmetry constraints are provided. Thus for a given (possibly symmetric)…
The engineering of quantum devices has reached the stage where we now have small scale quantum processors containing multiple interacting qubits within them. Simple quantum circuits have been demonstrated and scaling up to larger numbers is…
We review some results on the ionization conjecture, which says that a neutral atom can bind at most one or two extra electrons.