Skip to main content
edited tags
Link
Charles
  • 9.1k
  • 1
  • 38
  • 76
edited tags
Link
Thomas Bloom
  • 7k
  • 1
  • 39
  • 59
Changed title, tags, edited question to incorporate change and simplify
Source Link
Douglas Zare
  • 28k
  • 6
  • 90
  • 130

combinatorial problem: how to estimate size Arithmetic progressions of specific subgrouplength 3 in subset of Z_n of size n^d

letLet $A\subset\mathbb{Z}/n\mathbb{Z}$ such that: $|A|>n^{d}$ ($0< d <1$).

$$D=\{(x,y)\,|\, x+y\in A\}$$ Let $C=\{(x,y,2y-x)\in A\times A \times A\}$ be the set of $3$-term arithmetic progressions within $A$.

and[The original version asked about $C=(A\times A)\cap D$$x+y \in A$, settled by the example of Anthony Quas. I]

I need to prove (or refute) that there exists a lower bound $u(n)$ on $\frac{|C|}{|A|} $ such that: $$\lim_{n\rightarrow\infty}\frac{\log(u(n))}{\log(n)}>0$$ and $|C|\geq u(n)|A|$.

$$\lim_{n\rightarrow\infty}\frac{\log(u(n))}{\log(n)}>0.$$

thanks to the helpers

combinatorial problem: how to estimate size of specific subgroup of Z_n

let $A\subset\mathbb{Z}/n\mathbb{Z}$ such that: $|A|>n^{d}$ ($0< d <1$)

$$D=\{(x,y)\,|\, x+y\in A\}$$

and $C=(A\times A)\cap D$. I need to prove (or refute) that there exists a lower bound $u(n)$ such that: $$\lim_{n\rightarrow\infty}\frac{\log(u(n))}{\log(n)}>0$$ and $|C|\geq u(n)|A|$.

thanks to the helpers

Arithmetic progressions of length 3 in subset of Z_n of size n^d

Let $A\subset\mathbb{Z}/n\mathbb{Z}$ such that: $|A|>n^{d}$ ($0< d <1$).

Let $C=\{(x,y,2y-x)\in A\times A \times A\}$ be the set of $3$-term arithmetic progressions within $A$.

[The original version asked about $x+y \in A$, settled by the example of Anthony Quas.]

I need to prove (or refute) that there exists a lower bound $u(n)$ on $\frac{|C|}{|A|} $ such that

$$\lim_{n\rightarrow\infty}\frac{\log(u(n))}{\log(n)}>0.$$

thanks to the helpers

texified
Source Link
Kevin O'Bryant
  • 9.8k
  • 6
  • 57
  • 84
Loading
Source Link
elad
  • 21
  • 1
Loading