Discrete mathematics
Discrete mathematics is a branch of mathematics that focuses on structures and objects that are distinct and separate, as opposed to continuous mathematics, which deals with measurable quantities. This field gained prominence in the mid-twentieth century, largely due to the rise of computer science and digital technology, where discrete data is fundamental. Discrete mathematics encompasses various subfields, including combinatorics, graph theory, logic, algebra, number theory, and set theory, all of which explore different aspects of discrete structures.
One key distinction in discrete mathematics is between discrete and continuous data; discrete data is countable (like the set of natural numbers), whereas continuous data can take on any value within a range. This can be illustrated by comparing digital clocks, which display time in distinct units, to analog clocks, which represent time continuously. Discrete mathematics addresses three main types of problems: existence problems (whether a solution exists), counting problems (how many solutions exist), and optimization problems (which solution is the best). The field is not only foundational to theoretical mathematics but also has practical applications in areas such as logistics and computer programming, making it an essential subject for understanding modern technology and problem-solving methodologies.
On this Page
Subject Terms
Discrete mathematics
Discrete mathematics is a form of mathematics that deals with objects and structures that are discrete, or separate, rather than continuous. As such, it is often contrasted with continuous mathematics, which includes such topics as calculus and real numbers. Discrete mathematics plays a significant role in computer science and other technologies that are digital rather than analog; consequently, it began to grow in popularity in the mid-twentieth century. Other branches of discrete mathematics include combinatorics and certain forms of algebra and geometry.
Overview
Discrete data is one of two types of numerical data, the other being continuous. The difference between the two is that discrete data is countable, while continuous data is not countable but can be measured. The set of natural, or counting, numbers is discrete, going from one to two to three without covering any values in between. The set of real numbers is continuous, containing in it all integers, all fractions, and all decimals that cannot be represented as fractions—in other words, any quantity along an infinite continuum from negative to positive.
The difference can also be illustrated by comparing an analog and a digital clock. The analog clock represents continuous data, as the hour, minute, and second hands move in a constant circle, covering all possible values for the time over the course of twelve hours. The number of values that can be represented is infinite; no matter how close together two different times are on an analog clock, it is always possible for the clock to display a time between the two. A digital clock, by contrast, represents time in distinct—that is, discrete—units. The display changes from 12:00 to 12:01 without ever representing a time in between. Even if the clock displays seconds or even fractions of seconds, there will always be a time between two consecutive times that cannot be displayed.
This distinction is essential to discrete mathematics, which is not a single branch of mathematics but rather describes any form of mathematics that deals with discrete data. While discrete mathematics has existed in its most basic form for as long as humans have known how to count, and problems unique to the subject have been studied in various cultures throughout history, it was only conceived of as a distinct area of study in the mid-twentieth century. This development was driven partly by the emergence of computers, as digital technology operates via discrete data and processes, and partly by the need to plan logistical projects on an unprecedented scale, such as manned spaceflight to the moon.
Discrete mathematics is a broad topic that covers numerous subtopics, including combinatorics, graph theory, and certain aspects of logic, algebra, number theory, set theory, and computer science. Problems in discrete mathematics can be broadly divided into three categories: existence, counting, and optimization. Existence problems are concerned with whether or not a solution exists for a particular problem; counting problems deal with how many solutions there are for the problem, if in fact a solution is known to exist; and optimization problems address the question of which of several known solutions is the best.
One of the best-known topics in discrete mathematics is combinatorics, which is the study of how to select, arrange, and combine discrete data from a finite set. Combinatorics applies to other forms of discrete mathematics as well; for example, combinatorial geometry, also called discrete geometry, deals with the combinatorial properties and relationships of finite sets of discrete geometric figures.
Bibliography
Belcastro, Sarah-Marie. Discrete Mathematics with Ducks. Boca Raton: CRC, 2012. Print.
Bóna, Miklós. A Walk through Combinatorics: An Introduction to Enumeration and Graph Theory. 3rd ed. Hackensack: World Scientific, 2011. Print.
“Discrete Mathematics: Past, Present and Future.” IAS School of Mathematics. School of Mathematics, n.d. Web. 17 Oct. 2013.
Faticoni, Theodore G. Combinatorics: An Introduction. Hoboken: Wiley, 2013. Print.
Hunter, David J. Essentials of Discrete Mathematics. 2nd ed. Sudbury: Jones, 2012. Print.
Krantz, Steven G. Discrete Mathematics Demystified: A Self-Teaching Guide. New York: McGraw, 2009. Print.
Renze, John, and Eric W. Weisstein. “Discrete Mathematics.” Wolfram MathWorld. Wolfram Research, n.d. Web. 17 Oct. 2013.
Rosen, Kenneth H. Discrete Mathematics and Its Applications. 7th ed. New York: McGraw, 2012. Print.