Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Many Order Types on Integer Grids of Polynomial Size (2007.15334v2)

Published 30 Jul 2020 in cs.CG and math.CO

Abstract: Two labeled point configurations ${p_1,\ldots,p_n}$ and ${q_1,\ldots,q_n}$ are of the same order type if, for every $i,j,k$, the triples $(p_i,p_j,p_k)$ and $(q_i,q_j,q_k)$ have the same orientation. In the 1980's, Goodman, Pollack and Sturmfels showed that (i) the number of order types on $n$ points is of order $4{n+o(n)}$, (ii) all order types can be realized with double-exponential integer coordinates, and that (iii) certain order types indeed require double-exponential integer coordinates. In 2018, Caraballo, D\'iaz-B\'a{~n}ez, Fabila-Monroy, Hidalgo-Toscano, Lea{~n}os, Montejano showed that at least $n{3n+o(n)}$ order types can be realized on an integer grid of polynomial size. In this article, we improve their result by showing that at least $n{4n+o(n)}$ order types can be realized on an integer grid of polynomial size, which is essentially best possible.

Citations (1)

Summary

We haven't generated a summary for this paper yet.