179 search results - page 27 / 36 » The proof of Hermann's conjecture |
JCT
2007
14 years 11 months ago
2007
Given a sequence of integers b = (b0,b1,b2,...) one gives a Dyck path P of length 2n the weight wt(P) = bh1 bh2 ···bhn , where hi is the height of the ith ascent of P. The corr...
CORR
2004
Springer
14 years 11 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
125
click to vote
ECCC
2011
14 years 6 months ago
2011
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
IJCAI
2007
15 years 1 months ago
2007
Using the achievements of my research group over the last 30+ years, I provide evidence to support the following hypothesis: By complementing each other, cooperating reasoning pro...
JCT
2011
14 years 6 months ago
2011
We extend (and somewhat simplify) the algebraic proof technique of Guth and Katz [7], to obtain several sharp bounds on the number of incidences between lines and points in three ...