154 search results - page 23 / 31 » cpc 2008 |
CPC
2008
13 years 7 months ago
2008
![B2[ g] Sets and a Conjecture of Schinzel and Schmidt](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "B2[ g] Sets and a Conjecture of Schinzel and Schmidt")
A set of integers A is called a B2[g] set if every integer m has at most g representations of the form m = a + a , with a a and a, a A. We obtain a new lower bound for F(g, n), t...
CPC
2008
13 years 7 months ago
2008
Let ai, bi, i = 0, 1, 2, . . . be drawn uniformly and independently from the unit interval, and let t be a fixed real number. Let a site (i, j) N2 be open if ai + bj t, and clos...
CPC
2008
13 years 7 months ago
2008
We study the number of subtrees on the fringe of random recursive trees and random binary search trees whose limit law is known to be either normal or Poisson or degenerate depend...
CPC
2006
13 years 7 months ago
2006
Motivated by a scheduling problem that arises in the study of optical networks we prove the following result, which is a variation of a conjecture of Haxell, Wilfong and Winkler. ...
CPC
2006
13 years 7 months ago
2006
Let ;k g be the class of k-connected cubic graphs of girth at least g. For several choices of k and g, we determine a set Ok g of graph operations, for which, if G and H are graph...