Talk:Erdős distinct distances problem

[Untitled]
I'm confused by the o-mikron linking to an o-mega in the first line of text: "at least $n^{1 &minus; o(1)}$ distinct distances." 76.126.215.43 (talk) 15:56, 25 February 2011 (UTC)
 * All right, the link is changed to Big Oh notation (which also includes little o notation). Kope (talk) 16:13, 25 February 2011 (UTC)

I'm confused: it seems to be implied that there's some kind of grid involved here? Are the results independent of the grid? Besides this, the small o-notation is not explained. When it's said that the number of distances between n points is n to power 1 - o(1), most people would understand this as either fractions of one or as irrational numbers. —Preceding unsigned comment added by 99.250.10.156 (talk) 17:54, 26 February 2011 (UTC)


 * This is from the lede, where a short, compact description is given. It is explained in more details later. Kope (talk) 05:19, 27 February 2011 (UTC)

Capital omega notation?
The capital omega notation, used extensively in the article, is not familiar to me despite many years of reading mathematical literature. Perhaps it can be defined in the article?50.205.142.35 (talk) 13:20, 10 February 2020 (UTC)
 * See big O notation. Probably we should link this where we use it, but currently where we first use some variant of this notation is in an inconvenient place (the first sentence). So probably we should find some way of rewording the lead to be less WP:TECHNICAL before adding the link. —David Eppstein (talk) 17:32, 10 February 2020 (UTC)