Related papers: Wiring switches to more light bulbs
As lighting efficiency improves, it is useful to understand the theoretical limits to luminous efficacy for light that we perceive as white. Independent of the efficiency with which photons are generated, there exists a spectrally-imposed…
We show that the maximum possible energy benefit of network coding for multiple unicast on wireless networks is at least 3. This improves the previously known lower bound of 2.4 from [1].
Quantum control requires full knowledge of the system many-body Hamiltonian. In many cases this information is not directly available due to restricted access to the system. Here we show how to indirectly estimate all the coupling strengths…
This thesis addresses the question of the maximal number of $d$-simplices for a simplicial complex which is embeddable into $\mathbb{R}^r$ for some $d \leq r \leq 2d$. A lower bound of $f_d(C_{r + 1}(n)) =…
We give an upper bound on the number of perfect matchings in an undirected simple graph $G$ with an even number of vertices, in terms of the degrees of all the vertices in $G$. This bound is sharp if $G$ is a union of complete bipartite…
We investigate the maximum number of limit cycles bifurcating from the period annulus of a family of cubic polynomial differential centers when it is perturbed inside the class of all cubic piecewise smooth polynomials. The family…
A \emph{clique} is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for the following graph classes: (1) graphs with $n$ vertices and $m$ edges; (2) graphs with $n$ vertices, $m$ edges,…
We study the $2k$-th moment of the family of twisted modular $L$-functions to a fixed prime power modulus at the central values. We establish sharp lower bounds for all real $k \geq 0$ and sharp upper bounds for $k$ in the range $0 \leq k…
By modifying the automaton used by P{\"o}nitz and Tittman [4], and considering loops of length up to 26, we obtain 2.662343 as an upper bound for the connective constant in the lattice Z 2 .
All the work made so far on edge-covering a graph by cliques focus on finding the minimum number of cliques that cover the graph. On this paper, we fix the number of cliques that cover a graph by the same number of vertices that the graph…
We derive the sharp return-probability asymptotic for the switch--walk--switch lamplighter walk with lamp group $\mathbb Z_2$ over the infinite $d$-regular tree: \[ p_{2n}(e,e) = \rho_d^{2n} \exp\left[ -\left(\pi^2(\log(d-1))^2+o(1)\right)…
We prove that any $11$-colorable knot is presented by an $11$-colored diagram where exactly five colors of eleven are assigned to the arcs. The number five is the minimum for all non-trivially $11$-colored diagrams of the knot. We also…
We consider the number of colors for the colorings of links by the symmetric group $S_3$ of degree $3$. For knots, such a coloring corresponds to a Fox 3-coloring, and thus the number of colors must be 1 or 3. However, for links, there are…
We present a lower bound for the multi-field bounce action with a quartic potential in the absence of gravity. We find that for a large number of fields the lower bound decreases with the number of fields as N^{-3}. This work clarifies…
It is proved that the total length of any set of countably many rectifiable curves, whose union meets all straight lines that intersect the unit square U, is at least 2.00002. This is the first improvement on the lower bound of 2…
The problem of detecting a single anomalous process among multiple independent processes is considered. Under a constraint on the number of processes that can be probed simultaneously, the decision maker should decide which processes to…
The lower bound W(K_{2n})>=3n-2 is proved for the greatest possible number of colors in an interval edge coloring of the complete graph K_{2n}.
This paper discusses the question of how many non-empty subsets of the set $[n] = \{ 1, 2, ..., n\}$ we can choose so that no chosen subset is the union of some other chosen subsets. Let $M(n)$ be the maximum number of subsets we can…
Our main result is a sharp bound for the number of vertices in a minimal forbidden subgraph for the graphs having minimum rank at most 3 over the finite field of order 2. We also list all 62 such minimal forbidden subgraphs. We conclude by…
We consider scaling laws for maximal energy efficiency of communicating a message to all the nodes in a wireless network, as the number of nodes in the network becomes large. Two cases of large wireless networks are studied -- dense random…