Applications of Discrete Mathematics in the Real World
Abstract
It's often said that mathematics is useful in solving a very wide variety of practical problems. {MathILy, MathILy-Er} focus on discrete mathematics, which, broadly conceived, underpins about half of pure mathematics and of operations research as well as all of computer science. As time goes on, more and more mathematics that is done, both in academia and in industry, is discrete. But what are the actual applications people talk about when they say discrete mathematics can be applied. What problems are being solved. This webpage attempts to address those questions. There are short descriptions, with links to longer explanations, of examples of discrete mathematics as applied to our everyday lives and as used in important and interesting research and corporate applications.
Downloads
References
Sk, Amanathulla & Bera, Biswajit & Pal, Madhumangal. (2018). Real world applications of discrete mathematics. 09. 152–158. 10.26637/MJM0901/0025.
http://techiesgazette.marwadiuniversity.ac.in/?p=584
http://cybercomputing.blogspot.com/2012/06/discrete-mathematics-applications-and.html
https://www.javatpoint.com/applications-of-discrete-mathematics-in-computer-science
Richard Johnsonbaugh, Discrete Mathematics, Prentice Hall, 2008.
Franklin, James (2017). "Discrete and continuous: a fundamental dichotomy in mathematics". Journal of Humanistic Mathematics. 7 (2): 355–378. doi:10.5642/jhummath.201702.18. S2CID 6945363. Retrieved 30 June 2018.
"Discrete Structures: What is Discrete Math?". cse.buffalo.edu. Retrieved 16 November 2018.
Biggs, Norman L. (2002), Discrete mathematics, Oxford Science Publications (2nd ed.), The Clarendon Press Oxford University Press, p. 89, ISBN 9780198507178, MR 1078626, Discrete Mathematics is the branch of Mathematics in which we deal with questions involving finite or countably infinite sets.
Hopkins, Brian, ed. (2009). Resources for Teaching Discrete Mathematics: Classroom Projects, History Modules, and Articles. Mathematical Association of America. ISBN 978-0-88385-184-5.
Levasseur, Ken; Doerr, Al. Applied Discrete Structures. p. 8.
Geoffrey Howson, Albert, ed. (1988). Mathematics as a Service Subject. Cambridge University Press. pp. 77–78. ISBN 978-0-521-35395-3.
Rosenstein, Joseph G. Discrete Mathematics in the Schools. American Mathematical Society. p. 323. ISBN 978-0-8218-8578-9.
"UCSMP". uchicago.edu.
Wilson, Robin (2002). Four Colors Suffice. London: Penguin Books. ISBN 978-0-691-11533-7.
Hodges, Andrew (1992). Alan Turing: The Enigma. Random House.
Hodkinson, Trevor R.; Parnell, John A. N. (2007). Reconstruction the Tree of Life: Taxonomy And Systematics of Large And Species Rich Taxa. CRC Press. p. 97. ISBN 978-0-8493-9579-6.
"Millennium Prize Problems". 2000-05-24. Retrieved 2008-01-12.
Troelstra, A.S.; Schwichtenberg, H. (2000-07-27). Basic Proof Theory. Cambridge University Press. p. 186. ISBN 978-0-521-77911-1.
Buss, Samuel R. (1998). Handbook of Proof Theory. Elsevier. p. 13. ISBN 978-0-444-89840-1.
Baader, Franz; Brewka, Gerhard; Eiter, Thomas (2001-10-16). KI 2001: Advances in Artificial Intelligence: Joint German/Austrian Conference on AI, Vienna, Austria, September 19-21, 2001. Proceedings. Springer. p. 325. ISBN 978-3-540-42612-7.
Brotherston, J.; Bornat, R.; Calcagno, C. (January 2008). "Cyclic proofs of program termination in separation logic". ACM SIGPLAN Notices. 43 (1): 101–112. doi:10.1145/1328897.1328453.
Mohar, Bojan; Thomassen, Carsten (2001). Graphs on Surfaces. Johns Hopkins University Press. ISBN 978-0-8018-6689-0. OCLC 45102952.
Biggs, Norman L. (2002). Discrete Mathematics. Oxford University Press. ISBN 978-0-19-850717-8.
Dwyer, John (2010). An Introduction to Discrete Mathematics for Business & Computing. ISBN 978-1-907934-00-1.
Epp, Susanna S. (2010-08-04). Discrete Mathematics With Applications. Thomson Brooks/Cole. ISBN 978-0-495-39132-6.
Graham, Ronald; Knuth, Donald E.; Patashnik, Oren (1994). Concrete Mathematics (2nd ed.). Addison–Wesley. ISBN 0-201-55802-5.
Grimaldi, Ralph P. (2004). Discrete and Combinatorial Mathematics: An Applied Introduction. Addison Wesley. ISBN 978-0-201-72634-3.
Knuth, Donald E. (2011). The Art of Computer Programming. Vol. 1–4a Boxed Set. Addison-Wesley. ISBN 978-0-321-75104-1.
Matoušek, Jiří; Nešetřil, Jaroslav (1998). Discrete Mathematics. Oxford University Press. ISBN 978-0-19-850208-1.
Obrenic, Bojana (2003). Practice Problems in Discrete Mathematics. Prentice Hall. ISBN 978-0-13-045803-2.
Rosen, Kenneth H.; Michaels, John G. (2000). Hand Book of Discrete and Combinatorial Mathematics. CRC Press. ISBN 978-0-8493-0149-0.
Rosen, Kenneth H. (2007). Discrete Mathematics: And Its Applications. McGraw-Hill. ISBN 978-0-07-288008-3.
Simpson, Andrew (2002). Discrete Mathematics by Example. McGraw-Hill. ISBN 978-0-07-709840-7.
Discrete mathematics Archived 2011-08-29 at the Wayback Machine at the utk.edu Mathematics Archives, providing links to syllabi, tutorials, programs, etc.
Iowa Central: Electrical Technologies Program Discrete mathematics for Electrical engineering.
Copyright (c) 2020 Central Asian Journal of Theoretical and Applied Science
This work is licensed under a Creative Commons Attribution 4.0 International License.
