bio | website | sites.google.com/site/… |
---|---|---|
location | Canada | |
age | ||
visits | member for | 3 years, 7 months |
seen | Jun 24 at 5:05 | |
stats | profile views | 4,508 |
I am a graduate student in mathematics at Princeton university.
You can contact me at naslund [at] math [dot] princeton [dot] edu
, or visit my website for more information.
Aug 9 |
awarded | Nice Answer |
Jul 9 |
awarded | Guru |
Jul 2 |
awarded | Curious |
Jun 22 |
awarded | Nice Answer |
Apr 26 |
comment |
prime zeta function when $0<s<1$
"I will not be surprised if this question seems trivial in MO but i asked it first in MathSE and i did not get an answer." In fact, it has already been asked and answered several times on math.stackexchange. See here for a comprehensive answer which shows that for $k>-1$, $$\sum_{p\leq x}p^{k}=\text{li}\left(x^{k+1}\right)+O\left(x^{k+1}e^{-c\sqrt{\log x}}\right).$$ For this reason I vote to close this question. |
Apr 18 |
revised |
Existence of a certain subset of natural numbers equidistributed modulo $m$ for every $m$
I added the analytic number theory tag, and the word "equidistributed" to the title. |
Apr 18 |
revised |
Existence of a certain subset of natural numbers equidistributed modulo $m$ for every $m$
added 4 characters in body |
Apr 17 |
revised |
Existence of a certain subset of natural numbers equidistributed modulo $m$ for every $m$
added 41 characters in body |
Apr 17 |
answered | Existence of a certain subset of natural numbers equidistributed modulo $m$ for every $m$ |
Apr 6 |
accepted | The intersection of $n$ cylinders in $3$-dimensional space |
Mar 14 |
accepted | A sumset inequality |
Mar 13 |
comment |
A sumset inequality
@Alvin, Seva: I checked all possible combinations $X\subsetneq A\subset \{1,2,3\dots, 10\}$ and the inequality always holds. I edit the question to this in. |
Mar 13 |
revised |
A sumset inequality
added 33 characters in body |
Mar 13 |
revised |
A sumset inequality
added 708 characters in body |
Mar 13 |
comment |
A sumset inequality
@Seva I wrote a program which chooses $A$ as a random subset of $\{1,2,...,n\}$ and $X$ as a random subset of $A$, and for $1$ million trials with $n=100$, the inequality always holds. I'll write a program that checks all subsets of $\{1,\dots,10\}$ and all possibilities $X$ and test it. |
Mar 13 |
awarded | Nice Question |
Mar 13 |
asked | A sumset inequality |
Feb 21 |
comment |
What is/are the best bound/s on the sum of squares of degrees in a graph?
A quick search yields the paper New sharp bounds on the first Zagreb index, where they show that for connected graphs $G=(V,E)$, $$M_1(G) \leq e(e+1)$$ $$M_1(G) \leq n(2n-e+1)$$which are each sharp for some graphs. Cauchy-Schwarz yields the lower bound $$4e^2/n\leq M_1(G).$$ We are essentially trying to bound the second moment of a function $d:V\rightarrow \mathbb{N}$ by the first moment and the size of the domain $V$, so any simple bounds will not be tight in every case. |
Jan 16 |
awarded | Nice Question |
Jan 13 |
awarded | Good Question |