Algorithmics of Checking Whether a Mapping Is Injective, Surjective, and/or BijectiveDepartmental Technical Reports (CS)
AbstractIn many situations, we would like to check whether an algorithmically given mapping f:A --> B is injective, surjective, and/or bijective. These properties have a practical meaning: injectivity means that the events of the action f can be, in principle, reversed, while surjectivity means that every state b from the set B can appear as a result of the corresponding action. In this paper, we discuss when algorithms are possible for checking these properties.
Citation InformationE. Cabral Balreira, Olga Kosheleva and Vladik Kreinovich. "Algorithmics of Checking Whether a Mapping Is Injective, Surjective, and/or Bijective" (2012)
Available at: http://works.bepress.com/eduardo_balreira/3/