Portal:Discrete mathematics
Discrete mathematics is the study of mathematical structures that are fundamentally discrete in the sense of not supporting or requiring the notion of continuity. Discrete objects can be enumerated by integers. Topics in discrete mathematics include number theory (which deals mainly with the properties of integers), combinatorics, logic, graphs, algorithms, and formal languages.
Discrete mathematics has become popular in recent decades because of its applications to computer science. Discrete mathematics is the mathematical language of computer science. Concepts and notations from discrete mathematics are useful in studying and describing objects and problems in all branches of computer science, such as computer algorithms, programming languages, cryptography, automated theorem proving, and software development. Conversely, computer implementations are tremendously significant in applying ideas from discrete mathematics to real-world applications, such as in operations research.
The set of objects studied in discrete mathematics can be finite or infinite. In real-world applications, the set of objects of interest are mainly finite, the study of which is often called finite mathematics. In some mathematics curricula, the term "finite mathematics" refers to courses that cover discrete mathematical concepts for business, while "discrete mathematics" courses emphasize discrete mathematical concepts for computer science majors. Template:/box-footer
Lua error in package.lua at line 80: module 'Module:Box-header/colours' not found.
 |
| A labeled graph on 6 vertices and 7 edges |
Applications of graph theory are generally concerned with labeled graphs and various specializations of these. Many problems of practical interest can be represented by graphs. The link structure of a website could be represented by a directed graph: the vertices are the web pages available at the website and a directed edge from page A to page B exists if and only if A contains a link to B. A graph structure can be extended by assigning a weight to each edge of the graph. Graphs with weights, or weighted graphs, are used to represent structures in which pairwise connections have some numerical values. For example if a graph represents a road network, the weights could represent the length of each road. A digraph with weighted edges in the context of graph theory is called a network. Networks have many uses in the practical side of graph theory, network analysis (for example, to model and analyze traffic networks).
| ...Archive | Read more... |
Template:/box-header The Mathematics WikiProject is the center for mathematics-related editing on Wikipedia. Join the discussion on the project's talk page.
Project pages
Essays
Subprojects
Related projects
Lua error in package.lua at line 80: module 'Module:Box-header/colours' not found.
| ...Archive | Image credit: xJaM | Read more... |
- ...that there are precisely six convex regular polytopes in four dimensions? These are analogs of the five Platonic solids known to the ancient Greeks.
- ...that the Catalan numbers solve a number of problems in combinatorics such as the number of ways to completely parenthesize an algebraic expression with n+1 factors?
Template:/box-header Template:/Categories Template:/box-footer-empty
 |
 |
 |
 |
 |
 |
 |
| Algebra | Analysis | Category theory |
Computer science |
Cryptography | Discrete mathematics |
Geometry |
 |
 |
 |
 |
 |
 |
 |
|
| Logic | Mathematics | Number theory |
Physics | Science | Set theory | Statistics | Topology |
- What are portals?
- List of portals
- Featured portals
- What are portals?
- List of portals
- Featured portals
