Article
Licensed
Unlicensed
Requires Authentication
On identical transformations in commutative semigroups
-
D. M. Motin
Published/Copyright:
December 10, 2007
It is proved that in any commutative semigroup the complexity of transformation of equal terms of length at most n into each other is of order n log n.
Received: 2005-November-22
Published Online: 2007-12-10
Published in Print: 2007-12-11
© de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Properties of the output sequence of a simplest 2-linear shift register over Z2n
- A multivariate Poisson theorem for the number of solutions close to given vectors of a system of random linear equations
- Critical multitype branching processes in a random environment
- On the intersection number of a graph
- Generalised Pascal pyramids and their reciprocals
- On identical transformations in commutative semigroups
Articles in the same Issue
- Properties of the output sequence of a simplest 2-linear shift register over Z2n
- A multivariate Poisson theorem for the number of solutions close to given vectors of a system of random linear equations
- Critical multitype branching processes in a random environment
- On the intersection number of a graph
- Generalised Pascal pyramids and their reciprocals
- On identical transformations in commutative semigroups
