Skip to main content
13 events
when toggle format what by license comment
May 2, 2017 at 11:40 answer added Jeff Strom timeline score: 2
May 2, 2017 at 10:44 history edited Joseph O'Rourke CC BY-SA 3.0
Image links broken; now fixed.
Apr 7, 2013 at 14:04 vote accept Joseph O'Rourke
Apr 6, 2013 at 19:49 comment added Misha Joseph: You may want to look first at the 1-dimensional case. The problem you are dealing with is, then, harder than the graph isomorphism problem. I do not know much about the latter, but it is possible that people in computational complexity looked at this generalization. After all, you can encode a graph in its incidence matrix, taken modulo relabeling of the indices, i.e. modulo permutation group acting on matrices by conjugation.
Apr 6, 2013 at 1:59 answer added Włodzimierz Holsztyński timeline score: 1
Apr 6, 2013 at 0:49 history edited Joseph O'Rourke CC BY-SA 3.0
added 53 characters in body
Apr 5, 2013 at 23:59 comment added Joseph O'Rourke @Vidit: Thank you for correcting that "typo," if I may so characterize my error! :-) Now repaired in the figure.
Apr 5, 2013 at 20:24 comment added Vidit Nanda Joseph, I am now confused about the calculation in your example. What happened to the 2-simplex $cef$ which is present in $K_2$ but not in $K_1$, but did not contribute to the distance?
Apr 5, 2013 at 13:36 history edited Joseph O'Rourke CC BY-SA 3.0
added 186 characters in body
Apr 5, 2013 at 4:20 answer added Vidit Nanda timeline score: 8
Apr 5, 2013 at 3:23 comment added Sam Hopkins What about the cardinality of the symmetric difference between the complexes viewed as abstract simplicial complexes?
Apr 5, 2013 at 2:31 comment added Jim Conant I wonder how this compares to Gromov-Hausdorff distance with respect to a standard metric on simplicial complexes.
Apr 4, 2013 at 23:50 history asked Joseph O'Rourke CC BY-SA 3.0