# Category:Discrete mathematics

Here is a list of articles in the Discrete mathematics category of the Computing portal that unifies foundations of mathematics and computations using computers.

**Discrete mathematics**, also called **finite mathematics**, is the study of mathematical structures that are fundamentally discrete, in the sense of not supporting or requiring the notion of continuity. Most, if not all, of the objects studied in finite mathematics are countable sets, such as integers, finite graphs, and formal languages.

## Subcategories

This category has the following 6 subcategories, out of 6 total.

### C

### D

### G

### N

### T

## Pages in category "Discrete mathematics"

The following 10 pages are in this category, out of 10 total.

- Discrete mathematics
*(computing)*

### *

- Outline of discrete mathematics
*(computing)*

### A

- Antimatroid
*(computing)*

### C

- Cutting sequence
*(computing)*

### D

- DIMACS
*(computing)* - Direction-preserving function
*(computing)* - Discrete fixed-point theorem
*(computing)*

### I

- Inexact differential equation
*(computing)* - Inversion (discrete mathematics)
*(computing)*

### T

- Trinomial triangle
*(computing)*