Journal of Symbolic ComputationVolume 37, Issue 3, March 2004, Pages 305-310Elementary decompositions of arbitrary maps over finite setsAuthor links open overlay panelSerge BurckelShow moreShareCitehttps://doi.org/10.1016/j.jsc.2003.05.001Get rights and contentUnder an Elsevier user licenseopen archiveAbstractWe construct operations with basic notions that generate via compositions any mapping on any finite set. Moreover, the construction is effective and leads to an algorithm for the decomposition of a given mapping.Previous article in issueNext article in issueMSC08A7012Y05Recommended articlesCited by (0)Copyright © 2003 Elsevier Ltd. All rights reserved.