2095 search results - page 10 / 419 » Improved pebbling bounds |
EJC
2006
13 years 9 months ago
2006
In this paper we study the sequence (ci)0id for a distance-regular graph. In particular we show that if d 2j and cj = c > 1 then c2j > c holds. Using this we give improveme...
JCT
2007
13 years 9 months ago
2007
ABSTRACT. We present an extension of the Delsarte linear programming method for spherical codes. For several dimensions it yields improved upper bounds including some new bounds on...
ORL
2007
13 years 9 months ago
2007
The purpose of this note is to give a probability bound on symmetric matrices to improve an error bound in the Approximate S-Lemma used in establishing levels of conservatism resu...
DM
2006
13 years 9 months ago
2006
The simple device of maximization over subsets of events can provide substantial improvement over the Dawson
CPC
2011
13 years 4 months ago
2011
We show that the number of halving sets of a set of n points in R4 is O n4−1/18 , improving the previous bound of [9] with a simpler (albeit similar) proof.