Skip to main content
Craig Feinstein's user avatar
Craig Feinstein's user avatar
Craig Feinstein's user avatar
Craig Feinstein
  • Member for 14 years, 5 months
  • Last seen more than a month ago
comment
Trick for the sum-product problem
On the other hand $n=1$ certainly works. But I am trying to get something closer to two.
comment
Trick for the sum-product problem
@BorisBukh, I am assuming that $A$ is a set of integers. I'm not sure if that is the standard assumption for this problem though.
awarded
reviewed
Edit
revised
Trick for the sum-product problem
Typos in the title and body are corrected up to the cited link:" But Erdős and Szemerédi’s “sum-product” problem".
Loading…
revised
Trick for the sum-product problem
substituted A for Z
Loading…
asked
Loading…
awarded
awarded
revised
Loading…
Loading…
Loading…
revised
Loading…
Loading…
comment
2d incompressible Euler equations under periodic boundary conditions
I mean is it possible to prove this without using the fact that vorticity is conserved? Or is key in any proof?
comment
2d incompressible Euler equations under periodic boundary conditions
Is there a simpler proof than this (one that uses more elementary methods)?
comment
Heuristic probabilistic argument for the Navier-Stokes existence and smoothness conjecture
Does the fact that the viscosity takes away energy from the system increase the probability that the system is stable?
awarded
awarded
1
3 4
5
6 7
12