Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

100

Voted

DCG
2006

90views more DCG 2006»

Combinatorial Complexity of Convex Sequences

15 years 2 months ago

Combinatorial Complexity of Convex Sequences

Download www.maths.bris.ac.uk

We show that the equation si1 + si2 +

Alex Iosevich, S. Konyagin, Michael Rudnev, V. Ten

Real-time Traffic

Additional Arithmetic Assumptions | Convex Sequence | DCG 2006 | Incidence Theory |

claim paper

Related Content

» The combinatorial encoding of disjoint convex sets in the plane

» Decompositions Partitions and Coverings with Convex Polygons and PseudoTriangles

» The union of moving polygonal pseudodiscs Combinatorial bounds and applications

» Quasirandom graphs with given degree sequences

» A polynomial time equivalence between DNA sequencing and the exact perfect matching proble...

» Projection Lifting and Extended Formulation in Integer and Combinatorial Optimization

» Fast SDP Relaxations of Graph Cut Clustering Transduction and Other Combinatorial Problem

» FrequencyTime Hopping Sequences with Large Linear Complexities

» Dyck paths with coloured ascents

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	DCG
Authors	Alex Iosevich, S. Konyagin, Michael Rudnev, V. Ten

Comments (0)