Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Given a system of species equations that specifies two species, is there an algorithm to test if they are isomorphic?

Testing for isomorphism can be done by testing the equality of the coefficients of each species's molecular expansion. Thus, if there is an algorithm that computed some representation of these coefficients (e.g. a sequence), the problem reduces to comparing sequences for equality, which is a potentially simpler problem.

The Devmol Maple package described in "Computing the molecular expansion of species with the Maple package Devmol" by Auger, Labelle, and Leroux computes truncated molecular expansions, but does not compute explicit representations of entire molecular expansions.

A special case of this problem is testing if a species is the zero species. My guess is that this is not in general possible, but perhaps large sets of useful special cases are possible.

share|cite|improve this question

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.