DM
2016
10 years 1 months ago
2016
We give a new method of generating strongly polynomial sequences of graphs, i.e., sequences (Hk) indexed by a tuple k = (k1, . . . , kh) of positive integers, with the property th...
59
Voted
DM
2016
10 years 1 months ago
2016
Given a coloring of Z+ , we call a monochromatic set A = {a1 < a2 < · · · < am}
131
click to vote
DCG
2016
10 years 1 months ago
2016
We present a polynomial partitioning theorem for finite sets of points in the real locus of a complex algebraic variety of codimension at most two. This result generalizes the pol...
149
click to vote
DCG
2016
10 years 1 months ago
2016
The main result in the paper is a construction of a simple (in fact, just a union of two squares) set T in the plane with the following property. For every > 0 there if a famil...