Timeline for Incomplete Kloosterman sum
Current License: CC BY-SA 3.0
20 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 14, 2014 at 4:12 | comment | added | Alexey Ustinov | One natural question is a number of $2\times 2$ matices with bounded trace, see iam.khv.ru/articles/Ustinov/nth34_eng.pdf | |
| Jul 13, 2014 at 1:27 | vote | accept | Farzad Aryan | ||
| Jul 13, 2014 at 1:27 | vote | accept | Farzad Aryan | ||
| Jul 13, 2014 at 1:27 | |||||
| Jul 13, 2014 at 1:27 | vote | accept | Farzad Aryan | ||
| Jul 13, 2014 at 1:27 | |||||
| Jul 13, 2014 at 1:26 | vote | accept | Farzad Aryan | ||
| Jul 13, 2014 at 1:27 | |||||
| Jul 13, 2014 at 1:26 | vote | accept | Farzad Aryan | ||
| Jul 13, 2014 at 1:26 | |||||
| S Jul 12, 2014 at 5:30 | history | suggested | Alexey Ustinov |
The tag "exponential-sums" was added
|
|
| Jul 12, 2014 at 5:17 | review | Suggested edits | |||
| S Jul 12, 2014 at 5:30 | |||||
| Jul 12, 2014 at 1:06 | answer | added | Noam D. Elkies | timeline score: 8 | |
| Jul 12, 2014 at 0:54 | answer | added | Will Sawin | timeline score: 12 | |
| Jul 11, 2014 at 20:51 | comment | added | GH from MO | Note that $x+x^{-1}=p$ occurs iff $p\equiv 1\pmod{4}$. | |
| Jul 11, 2014 at 20:40 | comment | added | Farzad Aryan | I edited the question a bit, I hope it is more clear now. I am interested in the distribution of these residues $x$ (such that $x+_{_{\bf Z}}x^{-1}>p$). So this incomplete Kloosterman sum would help understanding the distribution. | |
| Jul 11, 2014 at 20:35 | history | edited | Farzad Aryan | CC BY-SA 3.0 |
added 113 characters in body
|
| Jul 11, 2014 at 20:15 | comment | added | Seva | I understand, but this interpretation does not look very natural to me; and so, I would be interested to learn where this problem came from. | |
| Jul 11, 2014 at 20:10 | comment | added | Farzad Aryan | $x$ modulo $p$ is a number between $0$ and $p-1$, same for x^{-1}. Therefore sum(in \matcal(Z)) of these two numbers can be bigger or smaller than $p$. I need to restrict the sum to those $x$ modulo $p$ for which $x+x^{-1}>p$ and find an upper bound. | |
| Jul 11, 2014 at 17:45 | comment | added | Seva | The condition $x+x^{-1}>p$ looks rather artificial since it is natural to consider $x$ and $x^{-1}$ as elements of ${\mathbb F}_p$, and so $x+x^{-1}\in{\mathbb F}_p$, too. Could you explain the motivation behind your question? | |
| S Jul 11, 2014 at 17:43 | history | suggested | Mayank Pandey | CC BY-SA 3.0 |
Typesetting issue
|
| Jul 11, 2014 at 17:41 | review | Suggested edits | |||
| S Jul 11, 2014 at 17:43 | |||||
| Jul 11, 2014 at 16:41 | history | edited | Farzad Aryan |
edited tags
|
|
| Jul 11, 2014 at 4:13 | history | asked | Farzad Aryan | CC BY-SA 3.0 |