Friday, April 21st, 2006

The Combinatorial Object Server

Filed under: — Daniel Lemire @ 16:43

It looks like it is quite old, but I found the Combinatorial Object Server for the first time this week and I thought I’d share it with my readers. I was looking for irreducible polynomials with binary coefficients (don’t ask why) and I found that this server can generate them on the fly for you! A beautiful application of the web.

Here are some things it can do:

  • Permutations and their restrictions
  • Subsets or Combinations
  • Permutations or Combinations of a Multiset
  • Set Partitions
  • Numerical Partitions and relatives
  • Binary, rooted, free and other trees
  • Necklaces, Lyndon words, DeBruijn Sequences
  • Irreducible and Primitive Polynomials over GF(2) to GF(5)

This reminds me a bit of the famous Plouffe’s inverter which, given a floating point number, will give you a matching mathematical constant.

No Comments »

No comments yet.

RSS feed for comments on this post.

Leave a comment

Warning: When entering a long comment, please ensure that you make copy of your text prior to submitting it. If the server should fail or if you hit a bug, you might lose your work. I am not responsible for your lost effort.

To spammers: I carefully review every single post and make sure that spam gets deleted. You are wasting your time if you are manually entering spam using this form. Read my terms of use to see what I consider to be abusive.

Example: I + II + IX= XII. Yes, you have to enter a roman numeral. (Answer must be in upper case.)

« Blog's main page

26 queries. 0.328 seconds. Valid XHTML

Powered by WordPress

© 2004-2008, Daniel Lemire (lemire at acm dot org). This work is licensed under a Creative Commons License.

Subscribe to this blog in a reader or by Email.