I came up with a result the other day that arbitrary length Roman numeral evaluation can be modeled as a monoid:
1) Is this a known result?
2) If not, any suggestions of a niche journal that might be interested in such a submission?
3) Any known results on the space complexity of finite monoid elements? I have yet to come across a monoid representation with efficient parallel computation that took more than O(log N) space, with N being the number of elements being "added"/"multiplied". Useful monoid data structures seem to be a constant number of counters or a member of a transformation semigroup of constant size; i.e. a fixed length array of size K with elements in 0...(K-1).