The set of questions below stems from this question.

1) does a website exist that contains (at least links to) code and data files, with the aim to centralise computational results in graph theory (or more generally metric geometry), both definite ones and unsuccessful/partial ones?

(Note that the Open Problem Garden website only lists statements and some recent references that are usually not of a computational flavor. The idea is to avoid wasting time repeating an ultimately unsuccessful approach.).

2) Are there examples of such type of website in other areas of mathematics?

up vote 9 down vote accepted

There are a few websites with lists and/or databases of graphs, maps and polytopes.

There are several censuses of symmetric objects (for example Marston Conder, Dimitri Leemans, Primož Potočnik).

I would also like to know about other websites of similar nature out there, since I'm working on one myself. It's still an early stage project, but has some use already. It aims to one day be able to provide a platform for computational attempts for all sorts of discrete objects (you can see some features for the exploratory aspect on the website).

  • Well done for getting the site up and running. I minor bug that I thought you wouldn't mind me mentioning: the closing 'x' button doesn't seem to work for the selected filters at the moment, at least not for me. I'm running Google Chrome. – James Smith Feb 22 at 15:43
  • Thanks @JamesSmith! I let the ball drop a bit on the live website - I'm adding a bunch of new things that require a more involved redesign and was focusing on that. I'll see if I can reproduce the bug and fix it. – Katja Berčič Feb 23 at 16:15
  • i know exactly what you mean :0) – James Smith Feb 25 at 16:35

Your Answer

 
discard

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Not the answer you're looking for? Browse other questions tagged or ask your own question.