bio  website  mit.edu/~shopkins 

location  Cambridge, MA  
age  24  
visits  member for  2 years, 10 months 
seen  10 mins ago  
stats  profile views  1,151 
20h

accepted  Does the Tutte polynomial of iterated cone graphs detect isomorphism? 
23h

comment 
Does the Tutte polynomial of iterated cone graphs detect isomorphism?
What does a spanning subgraph mean? I guess it is a subset of the edges that includes at least one edge adjacent to every vertex? 
1d

comment 
A family of posets
Right, sorry, it is significantly different: skeletal posets only allow taking disjoint unions of posets of the same rank. Meanwhile, I think they are also not a subset of the class here because you are allowed to add multiple greatest or least elements at the same time as well. 
1d

comment 
A family of posets
This family is very close to the notion of "skeletal poset" in arxiv.org/abs/1402.6178. 
1d

asked  Does the Tutte polynomial of iterated cone graphs detect isomorphism? 
May 24 
comment 
The most number of points that realize only $k$ distinct distances
@JosephO'Rourke: Have you looked into the many recent techniques and approaches developed to attack the asymptotics of this problem? For instance it is still probably worthwhile to convert this to an incidence question. 
May 24 
comment 
The most number of points that realize only $k$ distinct distances
Is this not a very wellknown problem?: en.wikipedia.org/wiki/Erd%C5%91s_distinct_distances_problem 
May 24 
comment 
Counting Problems where Labeled is Known but Unlabeled is Not
Although in general I guess you are right in that labeled objects are more amenable than unlabeled ones, I think there are some counterexamples to this general behavior: for instance, it is 'easier' to count unlabeled semiorders as opposed to labeled ones (see en.wikipedia.org/wiki/Semiorder#Other_results). 
May 22 
comment 
How did Cole factor $2^{67}1$ in 1903
Wikipedia (en.m.wikipedia.org/wiki/Frank_Nelson_Cole) suggests Cole factored this number in 1903 (or perhaps 19001903), if that makes any difference in terms of tools available at the time... 
May 15 
answered  Important open problems that have already been reduced to a finite but infeasible amount of computation 
May 15 
comment 
What can I further assume about the speeds of runners of Lonely Runner Conjecture WLOG?
You are probably interested in this recent blog post of Terry Tao as well: terrytao.wordpress.com/2015/05/13/… 
May 15 
awarded  Pundit 
May 12 
comment 
What can I further assume about the speeds of runners of Lonely Runner Conjecture WLOG?
It might be worth including in your list that we can assume the speeds are integers, which at least is not obvious to me. It is proved in Section 4 here: combinatorics.org/ojs/index.php/eljc/article/view/v8i2r3 
May 6 
comment 
Combinatorial polynomials from general diagram fillings?
More details in this (very recent!) survey: arxiv.org/abs/1505.01115. 
May 5 
revised 
Combinatorial polynomials from general diagram fillings?
removed subjective opinion 
May 5 
comment 
Combinatorial polynomials from general diagram fillings?
If you want to read more about that conjecture of Stanley's, see Malvenuto, Claudia. "Ppartitions and the plactic congruence." Graphs and Combinatorics 9.1 (1993): 6373. available at: wwwusers.di.uniroma1.it/~claudia/PPartitions1.pdf 
May 5 
answered  Combinatorial polynomials from general diagram fillings? 
May 4 
comment 
Open problems/questions in representation theory and around ?
The second item is Conjecture 8.3 of wwwmath.mit.edu/~rstan/pubs/pubfiles/73.pdf. 
May 4 
comment 
Digital topology, animal problem, 2sphere and torus
Possible duplicate of mathoverflow.net/questions/50966/… 
Apr 29 
comment 
Guess that group via product queries
Similar questions have been asked and (modulo certain numbertheoretic conjectures) answered for identifying isomorphisms with specific groups: see, e.g. math.ucla.edu/~pak/papers/recfin.pdf. 