Sciweavers

1322 search results - page 185 / 265
» Unsound Theorem Proving
Sort
View
DCG
2007
58views more  DCG 2007»
13 years 8 months ago
Harmonic Algebraic Curves and Noncrossing Partitions
Motivated by Gauss’s first proof of the Fundamental Theorem of Algebra, we study the topology of harmonic algebraic curves. By the maximum principle, a harmonic curve has no bou...
Jeremy L. Martin, David Savitt, Ted Singer
DM
2007
74views more  DM 2007»
13 years 8 months ago
Parameters for which the Griesmer bound is not sharp
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...
Andreas Klein, Klaus Metsch
JCT
2006
110views more  JCT 2006»
13 years 8 months ago
Branch-width, parse trees, and monadic second-order logic for matroids
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...
Petr Hlinený
ENDM
2007
111views more  ENDM 2007»
13 years 8 months ago
Claw-free circular-perfect graphs
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...
Arnaud Pêcher, Xuding Zhu
MP
2008
91views more  MP 2008»
13 years 8 months ago
The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
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...
Defeng Sun, Jie Sun, Liwei Zhang