—With users increasingly focused on an online world, an emerging challenge for the network infrastructure is the need to support Massively Multiplayer Online Role Playing Games (...
Given n ≥ 4 positive real numbers, we prove in this note that they are the face areas of a convex polyhedron if and only if the largest number is not more than the sum of the ot...
For applications to cryptography, it is important to represent numbers with a small number of non-zero digits (Hamming weight) or with small absolute sum of digits. The problem of ...
We consider vertex coloring of an acyclic digraph G in such a way that two vertices which have a common ancestor in G receive distinct colors. Such colorings arise in a natural wa...
We use entropy rates and Schur concavity to prove that, for every integer k 2, every nonzero rational number q, and every real number , the base-k expansions of , q + , and q all...