Hooked
Reputation
2,885
Next privilege 3,000 Rep.
 Mar5 comment “The Egg:” Bizarre behavior of the roots of a family of polynomials. @Stephen Look at the dates posted. The answer by myself and Gottfried Helms against the above post are about two years apart. There is often a correlation between delayed answers and score (though not always). Feb14 comment What gambling/board game or real life thing can (surprisingly) be modelled as a linear programming problem? I'm not sure what you are looking for in an answer. I'm giving you a couple of really neat cutting edge problems concerning transportation, but it is sometimes surprising that linear programming can handle such large problems in practice. Sep12 comment Bitcoin math problem example Sep3 comment Is there anything special about a graph with the golden ratio in its spectrum? Can provide a reference for "experimental evidence indicates that most graphs have characteristic polynomial irreducible over the rationals"? Sep1 comment Is there anything special about a graph with the golden ratio in its spectrum? Right, that explains why they are relatively common. I was interested if the graphs themselves have any special symmetry. For example, none of the graphs seem particularly dense (in that they are planar or nearly so). These seems to be true for the graphs of order 7 that I examined as well. Aug7 comment How many distinct chromatic polynomials are there for simple connected graphs? @jp26 I am looking for the number of unique polynomials not the number of unique graphs. I just realized that the title and the text contradict each other. I'll make an edit to correct this. However, the other question is very interesting too and worth asking in it's own right. Aug6 comment How many distinct chromatic polynomials are there for simple connected graphs? @jp26 I agree! I was only waiting a few days before I accepted the answer to see if someone could come up with a reference with a longer set of terms. Independently I've computed this up to n=10 (without using Sage), so I'll post it as an answer if no one else does. Jun25 comment The expected outcome of a random game of chess? Two suggestions though, the actual counts used by the simulations and a two sided p-value. Since you are much, much closer to 1/2, it be interesting to see what the statistics say. "perfectly consistent" is not quite precise enough! Jun25 comment The expected outcome of a random game of chess? Nice catch, chalk this one up to the power of peer review! To be honest, this library was simply the easiest to install and get up and running, I imagine that a C library may be much faster to run long simulations. Also, mate is possible with two moves. Jun25 comment The expected outcome of a random game of chess? @nbubis I'm going to let Winther take the credit for finding the flaw in the code above. I happy enough, my initial answer, flawed as it was, was enough to spur a better investigation. I'll update my answer and point to his, IMHO he answers the question correct and should get the check. Apr13 comment Forbidden toroidal minors Wow, that is a much larger set than I expected! Do you know, off-hand, if there are simple ways to test if a graph is toroidal? If not, I can ask in a new question. Apr2 comment Fourier decomposition of the Mandelbrot set Thanks for the article! Feb26 comment Graph diameter of a single vertex? @Wayne so the question boils down to, is the trivial path considered a path in the calculation of the diameter? Feb11 comment Expected number of clusters on chessboard @MarnixKlooster For diagonals, you can have at most N=61, as you need the squares (0,1),(1,0),(1,1) to be filled (or any other corner). Feb11 comment Expected number of clusters on chessboard @MarnixKlooster According to the def. by OP, you can have a two independent clusters with even 62 squares filled. Consider the situation where all squares are filled on except for (0,1),(1,0). The single conner square and the remaining large 61-size cluster are not connected "sideways". Now if you count diagonals as a connection, the story is different. Feb6 comment Are there any infinites not from a powerset of the natural numbers? Thank you for the informative answer, I think it clears up a few mistakes in both my nomenclature and my understanding of the ordinals. I was trying to lookup the Hebrew "B" transfinite number and couldn't simply google for the letter: to help those who follow, they are called Beth numbers. Oct16 comment Trying to work out the probabilities of a dice game I used to play While the expected number of turns is a useful number, sometimes the distribution of games can be helpful, especially when your friends might give up playing the games after 50 rolls! Oct8 comment Determine if a set of points on a sphere come from a uniform distribution? @JohnMoeller For some reason I thought you were referring to something different. If the $L_2$ norm just the standard Euclidean distance, and the other $L_p$ norms are just a different power in the summation and the radical, how do these relate a uniform distribution across a sphere? Oct7 comment Determine if a set of points on a sphere come from a uniform distribution? @JohnMoeller I figured as much since multi-dimensional KS tests seem to be difficult (and often called into question, asaip.psu.edu/Articles/beware-the-kolmogorov-smirnov-test). I'll look into the Wasserstein metric, but I can't search for the $L_p$ distance if I don't know its name as a word, not a symbol. Sep29 comment Are the primes compressible? Ah I think I see now, despite the representation (e.g. the variants purposed by Ted) a compression algorithm that relies on a block scheme (like zlib) will naturally fall into a length commensurate with the block. Nice insight - thanks!