Abstract
In 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 ∈ B can appear as a result of the corresponding action. In this paper, we discuss when algorithms are possible for checking these properties.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balreira, E.C.: Foliations and global inversion. Commentarii Mathematici Helvetici 85(1), 73–93 (2010)
Balreira, E.C.: Incompressibility and global inversion. Topological Methods in Nonlinear Analysis 35(1), 69–76 (2010)
Balreira, E.C., Radulescu, M., Radulescu, S.: A generalization of the Fujisawa-Kuh Global Inversion Theorem. Journal of Mathematical Analysis and Applications 385(2), 559–564 (2011)
Bass, H., Connell, E.H., Wright, D.: The Jacobian Conjecture: reduction of degree and formal expansion of the inverse. Bull. Amer. Math. Soc. 7(2), 287–330 (1982)
Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. Springer, Berlin (2006)
Bishop, E., Bridges, D.S.: Constructive Analysis. Springer, N.Y (1985)
Keller, O.-H.: Ganze Cremona-Transformationen. Monatshefte für Mathematik und Physik 47(1), 299–306 (1939)
Kreinovich, V., Lakeyev, A., Rohn, J., Kahl, P.: Computational complexity and feasibility of data processing and interval computations. Kluwer, Dordrecht (1998)
Mishra, B.: Computational real algebraic geometry. In: Handbook on Discreet and Computational Geometry. CRC Press, Boca Raton (1997)
Papadimitriou, C.H.: Computational Complexity. Addison Wesley, San Diego (1994)
Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. Springer, Berlin (1989)
Tarski, A.: A Decision Method for Elementary Algebra and Geometry, 2nd edn. Berkeley, Los Angeles (1951)
Weihrauch, K.: Computable Analysis. Springer, Berlin (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Balreira, E.C., Kosheleva, O., Kreinovich, V. (2014). Algorithmics of Checking whether a Mapping Is Injective, Surjective, and/or Bijective. In: Ceberio, M., Kreinovich, V. (eds) Constraint Programming and Decision Making. Studies in Computational Intelligence, vol 539. Springer, Cham. https://doi.org/10.1007/978-3-319-04280-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-04280-0_1
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-04279-4
Online ISBN: 978-3-319-04280-0
eBook Packages: EngineeringEngineering (R0)