Related papers: Wiring switches to more light bulbs
Given n buttons and n bulbs so that the ith button toggles the ith bulb and at most two other bulbs, we compute the sharp lower bound on the number of bulbs that can be lit regardless of the action of the buttons.
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 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…
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…
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…
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.
The atom sets an ultimate scaling limit to Moores law in the electronics industry. And while electronics research already explores atomic scales devices, photonics research still deals with devices at the micrometer scale. Here we…
We determine a lower bound for the entanglement of pairs of electron spins injected into a mesoscopic conductor. The bound can be expressed in terms of experimentally accessible quantities, the zero-frequency current correlators (shot noise…
Consider a game played on a simple graph $G = (V, E)$ where each vertex consists of a clickable light. Clicking any vertex $v$ toggles the on/off state of $v$ and its neighbors. Starting from an initial configuration of lights, one wins the…
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…
A pebbling move on a graph consists of removing $2$ pebbles from a vertex and adding $1$ pebble to one of the neighbouring vertices. A vertex is called reachable if we can put $1$ pebble on it after a sequence of moves. The optimal pebbling…
We obtain sharp lower and upper bounds for the number of maximal (under inclusion) independent sets in trees with fixed number of vertices and diameter. All extremal trees are described up to isomorphism.
We discuss the problem of finding an upper bound for the number of equilibrium points of a potential of several fixed point charges in R^n. This question goes back to J.C.Maxwell and M.Morse. Using fewnomial theory we show that for a given…
Given a finite grid in $\mathbb{R}^2$, how many lines are needed to cover all but one point at least $k$ times? Problems of this nature have been studied for decades, with a general lower bound having been established by Ball and Serra. We…
Connected Vertex Cover is one of the classical problems of computer science, already mentioned in the monograph of Garey and Johnson. Although the optimization and decision variants of finding connected vertex covers of minimum size or…
We investigate the asymptotic disconnection time of a large discrete cylinder $(\mathbb{Z}/N\mathbb{Z})^{d}\times \mathbb{Z}$, $d\geq 2$, by simple and biased random walks. For simple random walk, we derive a sharp asymptotic lower bound…
In this paper, a hub refers to a non-terminal vertex of degree at least three. We study the minimum number of hubs needed in a network to guarantee certain flow demand constraints imposed between multiple pairs of sources and sinks. We…
For any link in the 3-sphere, there is a natural lower bound for the unlinking number in terms of the classical signature. We prove that if this lower bound is sharp for a special alternating link $L$, then the unlinking number of $L$ is…
A connected set in a graph is a subset of vertices whose induced subgraph is connected. Although counting the number of connected sets in a graph is generally a \#P-complete problem, it remains an active area of research. In 2020, Vince…
Let $G=(V, E)$ be a graph and let each vertex of $G$ has a lamp and a button. Each button can be of $\sigma^+$-type or $\sigma$-type. Assume that initially some lamps are on and others are off. The button on vertex $x$ is of $\sigma^+$-type…