59 search results - page 3 / 12 » On the structure of a random sum-free set of positive intege... |
COMBINATORICS
2000
13 years 6 months ago
2000
A tournament sequence is an increasing sequence of positive integers (t1, t2, . . .) such that t1 = 1 and ti+1 2ti. A Meeussen sequence is an increasing sequence of positive inte...
JCT
2011
13 years 1 months ago
2011
For a positive integer n that is not a power of 2, precisely the same family of convex polygons with n sides is optimal in three different geometric problems. These polygons have ...
RSA
2010
13 years 4 months ago
2010
We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset S of the nonnegative integers. Subject to a certain hypothesis on S, the...
STOC
2009
ACM
14 years 6 months ago
2009
ACM
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
We establish the first polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any inte...