1410 search results - page 186 / 282 » Proving theorems by reuse |
DM
2007
13 years 10 months ago
2007
7 We prove for a large class of parameters t and r that a multiset of at most t d−k + r d−k−2 points in PG(d, q) that blocks every k-dimensional subspace at least t times mu...
JCT
2006
13 years 10 months ago
2006
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
ENDM
2007
13 years 10 months ago
2007
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs is a superclass of perfect graphs defined by means of this...
MP
2008
13 years 10 months ago
2008
We analyze the rate of local convergence of the augmented Lagrangian method for nonlinear semidefinite optimization. The presence of the positive semidefinite cone constraint requ...
NA
2008
13 years 10 months ago
2008
We extend Clenshaw-Curtis quadrature to the square in a nontensorial way, by using Sloan's hyperinterpolation theory and two families of points recently studied in the framew...