bio | website | quora.com/Alon-Amit |
---|---|---|
location | Los Altos, CA | |
age | 45 | |
visits | member for | 5 years, 6 months |
seen | 13 hours ago | |
stats | profile views | 3,936 |
Dabbler in things.
Jul 3 |
awarded | Popular Question |
Jun 28 |
revised |
Semisimple-ish rings!
changed M to I in "I subseteq J(R)" |
Jun 26 |
answered | Pseudo-random number generation algorithms |
Jun 24 |
comment |
What's wrong with the surreals?
I actually remember one more disadvantage mention by Conway: equality is a defined relation, and a pretty subtle one at that. It's not too easy to figure out when two expressions for surreal numbers are actually equal. |
Jun 20 |
comment |
What can be tiled by T-tetrominoes?
The paper "Tiling rectangles with T-tetrominoes" by Korn and Pak seems to present some progress for non-rectangular simply-connected regions, mainly Theorem 11 in section 8. It doesn't seem like they have a complete answer though. citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.6847 |
Jun 3 |
awarded | Enlightened |
Jun 2 |
awarded | Nice Answer |
Jun 2 |
awarded | Nice Answer |
May 25 |
awarded | Nice Answer |
May 15 |
awarded | Nice Answer |
May 14 |
comment |
If Erdős is published as Erdös in a paper, which do I cite?
Is there a badge for "first answer to make someone laugh out loud"? |
May 8 |
revised |
Lower bounds on zeta(s+it) for fixed s
More specific title |
May 1 |
revised |
Frobenius number for three numbers
added 12 characters in body; added 4 characters in body |
Apr 29 |
revised |
Are there infinitely many equivalence classes of similar matrices?
added 1 characters in body |
Apr 21 |
comment |
Connectedness of random distance graph on integers
True. My mistake. |
Apr 21 |
revised |
Connectedness of random distance graph on integers
added 160 characters in body; deleted 156 characters in body; added 97 characters in body |
Apr 21 |
answered | Connectedness of random distance graph on integers |
Apr 21 |
comment |
Enumeration of Regular Graphs
I don't think there's any closed form formula, but you can compare your results with the data in OEIS, such as here: oeis.org/A005638 (for 3-regular graphs) or here: oeis.org/A051031. This is indexed by the number of vertices, not edges, but of course for fixed k this is the same up to a factor of k/2. |
Apr 5 |
comment |
What's the name of this 2D cellular automaton?
Sounds familiar but I can't quite place it off the top of my head. Places to look would be the chapters on cellular automata in Gale's "Tracking the automatic ant", and of course Gardner's books and perhaps Hofstadter's collections from Sci Am. |
Mar 22 |
revised |
Open source mathematical software.
minor typo |