We use transfer matrix methods to determine bounds for the numbers of legal Go positions for various numbers of players on some planar lattice graphs, including square lattice gra...
We give an upper bound in O(d(n+1)/2 ) for the number of critical points of a normal random polynomial. The number of minima (resp. maxima) is in O(d(n+1)/2 )Pn, where Pn is the (...
A vertex k-labeling of graph G is distinguishing if the only automorphism that preserves the labels of G is the identity map. The distinguishing number of G, D(G), is the smallest...
Vikraman Arvind, Christine T. Cheng, Nikhil R. Dev...
Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their ele...
Abstract--For broadcast channels, a power allocation scheme is proposed to maximize the number of active receivers, for each of which, a minimum rate Rmin > 0 can be achieved. U...
Hengameh Keshavarz, Liang-Liang Xie, Ravi R. Mazum...