4,872 reputation
11551
bio website
location United States
age
visits member for 5 years, 4 months
seen 22 hours ago

Aug
3
comment Smooth manifolds for which every metric is geodesically convex
pints $\mapsto$ points $\;$
Aug
3
comment Possible $\mathsf{NP}$ complete problem from number theory
Are you using "effectively" in the informal sense? $\:$ If yes, then Cramér's conjecture is makes version #4 of Shor's answer "effectively deterministic". $\:$ If no, what does "effectively deterministic" mean? $\;\;\;\;$
Aug
2
comment Does “cardinal arithmetic is well-defined” imply axiom of choice?
"non-empty either" $\: \mapsto \:$ "also non-empty" $\;\;\;\;$
Aug
2
comment Possible $\mathsf{NP}$ complete problem from number theory
That post of mine and the answer to it together are enough to make the reduction effective (in the mathematical sense). $\;$
Aug
2
awarded  Socratic
Aug
1
accepted Are there effective small intervals in which primes are dense?
Aug
1
asked Are there effective small intervals in which primes are dense?
Jul
31
comment “Most Similar Vector Problem” on an Integer Lattice?
Should there be an exponent on $[-M,\hspace{-0.02 in}M\hspace{.03 in}]$? $\;$
Jul
21
awarded  Popular Question
Jul
12
revised What is the following (matrix) operator called?
fixed title's grammar
Jul
11
revised Natural transformations induce homotopies - Is this true in the “fat” world?
fixed title's grammar
May
4
awarded  Yearling
Apr
28
comment What defines a “short proof”?
In fact, if "there are no short proofs of tautology" then coNP != NP. $\;$
Apr
27
awarded  Good Question
Apr
27
comment Random Diophantine polynomials: Percent solvable?
Presumably $\: \log C/C \:$ should be replaced with $\: (\log C)/C \;$. $\;\;\;\;$
Apr
19
comment is there a global obstruction for a diffeomorphism to be an isometry?
$x\mapsto x^3 \;$ is not a diffeomorphism from $\mathbf{R}$ to itself, since the inverse of that map is not differentiable at zero. $\;\;\;\;$
Apr
16
comment Rate of convergence in the Law of Large Numbers
You'll also need $\: |\mathbb{E}X_1\hspace{-0.02 in}| < \infty \:$ in order to reach the conclusions you claim from the laws of large numbers. $\;\;\;$
Apr
4
revised Why is differential Galois theory not widely used?
fixed title's grammar
Apr
1
comment How large do algebraic representations need to be for packing circles in squares?
I mean "at most $\:r-1\:$ from the origin" instead of $\:r+1\;$. $\;\;\;$ I believe the rest of my two previous comments are correct.) $\;\;\;\;\;\;\;$
Apr
1
comment How large do algebraic representations need to be for packing circles in squares?
If there is a bound on the bit-lengths of the coefficients that is better than $n^{O(n)}$, then that would yield a better bound for my problem (in particular, enough for the bounty), since it would provide an explicit constant for the main factor of the runtime. $\:$ (i.e., $n^{\hspace{.02 in}O(n)}$ becomes $\: n^{\hspace{.02 in}c\cdot n} \cdot \text{something_asymptotically_smaller_than_that} \;$.) $\;\;\;\;\;\;\;$