Change language
English Deutsch
Change currency
€ EUR £ GBP $ USD
Licensed Unlicensed Requires Authentication Published by De Gruyter December 10, 2007

On identical transformations in commutative semigroups

  • D. M. Motin
From the journal Discrete Mathematics and Applications
https://doi.org/10.1515/dma.2007.047

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

From the journal
Discrete Mathematics and Applications
Discrete Mathematics and Applications
Volume 17 Issue 6

Journal and Issue

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
Downloaded on 25.10.2024 from https://www.degruyter.com/document/doi/10.1515/dma.2007.047/html
Scroll to top button