bio | website | |
---|---|---|
location | ||
age | ||
visits | member for | 1 year, 4 months |
seen | 5 hours ago | |
stats | profile views | 6,290 |
Dec 5 |
reviewed | Close What would be nice open problem in evolutionary game theory ? |
Dec 4 |
reviewed | Close minimizing an integral over integer-coefficient polynomials $\displaystyle \inf_{f \in \mathbb{Z}[x]} \int_a^b f(x)^2 \, dx $ |
Dec 4 |
reviewed | Close Upper and lower limits |
Dec 3 |
reviewed | No Action Needed (Eichler-Shimura Isomorphism) Proving c(f) is not a boundary |
Dec 2 |
reviewed | Leave Open Are there Zoll pancakes? |
Dec 2 |
comment |
Is more alternating always better?
@User43408: If you are indeed Ken Perko, welcome to MO! Your suggested edit doesn't seem to fit completely with this question. You could ask that as a separate question if you see fit. |
Dec 1 |
reviewed | Close How can we join two points with a small ruler? |
Nov 30 |
reviewed | Leave Closed How can we join two points with a small ruler? |
Nov 30 |
reviewed | Leave Open How can we join two points with a small ruler? |
Nov 28 |
reviewed | Leave Open Teaching stochastic calculus to students who know no measure theory (or PDE, or…) |
Nov 27 |
comment |
Do we know that 'most' finite groups are Galois groups of number fields?
@DerekHolt: I see my error. It was that $2^{k+1} < 3\times 2^k$ and the groups of order $2^{k+1}$ swamp the groups of order $3\times 2^k$. |
Nov 27 |
comment |
Do we know that 'most' finite groups are Galois groups of number fields?
Since one can take a direct product of groups of order $2^k$ with say $C_3$, it doesn't seem correct to say that most groups are $2$-groups. However, I would guess that most groups are solvable: the orders of nonsolvable groups seems to be understood, see oeis.org/A056866 . |
Nov 27 |
comment |
Isomorphism problem for two radical extensions
@FelipeVoloch: Thanks for the clarification, but surely those initially voting to close can vote to reopen if the question is edited and made correct. I'm also puzzled by how the answer came in after closure -- my guess would be that the answer was already in some draft form before the question was closed. |
Nov 27 |
comment |
Isomorphism problem for two radical extensions
If the question is good enough to attract a response from User74230, it's good enough for this site. Voting to reopen. |
Nov 27 |
reviewed | Leave Closed Robotics, Cryptography, and Genetics applications of Grothendieck's work? |
Nov 26 |
comment |
lower-bound for $Pr[X\geq EX]$
That looks very nice! Well done! |
Nov 26 |
comment |
lower-bound for $Pr[X\geq EX]$
Right, in terms of $\alpha$ only. (I think in some ranges (either $\alpha\to 0$ or $\alpha \to 1$) one in fact gets a uniform bound even independent of $\alpha$.) Note: I don't have any real applications for this, just curiosity! |
Nov 26 |
comment |
lower-bound for $Pr[X\geq EX]$
The problem is to get lower bounds independent of $n$. From Pokrovskiy's work (which is quite involved, but gives more) I think I can do this. But maybe you can see a simpler way! |
Nov 25 |
comment |
lower-bound for $Pr[X\geq EX]$
Here's Feige's paper: wisdom.weizmann.ac.il/~feige/Others/newmarkov.pdf |
Nov 25 |
awarded | Necromancer |