Subgroup Updated 2025-07-16
Ring (mathematics) Updated 2025-07-16
A Ring can be seen as a generalization of a field where:
Addition however has to be commutative and have inverses, i.e. it is an Abelian group.
The simplest example of a ring which is not a full fledged field and with commutative multiplication are the integers. Notably, no inverses exist except for the identity itself and -1. E.g. the inverse of 2 would be 1/2 which is not in the set. More specifically, the integers are a commutative ring.
A polynomial ring is another example with the same properties as the integers.
The simplest non-commutative, non-division is is the set of all 2x2 matrices of real numbers:
Note that is not a ring because you can by addition reach the zero matrix.
Edge (graph) Updated 2025-07-16
Vertex Updated 2025-07-16
Curl (mathematics) Updated 2025-07-16
Points in the direction in which a wind spinner spins fastest.
Nabla symbol Updated 2025-07-16
Nabla is one of those: it was completely made up in modern times, and just happens to look like an inverted upper case delta to make things even more confusing!
Nabla means "harp" in Greek, which looks like the symbol.
Divergence Updated 2025-07-16
Takes a vector field as input and produces a scalar field.
Mnemonic: it gives out the amount of fluid that is going in or out of a given volume per unit of time.
Therefore, if you take a cubic volume:
  • the input has to be the 6 flows across each face, therefore 3 derivatives
  • the output is the variation of the quantity of fluid, and therefore a scalar
Gradient Updated 2025-07-16
Takes a scalar field as input and produces a vector field.
Mnemonic: the gradient shows the direction in which the function increases fastest.
Think of a color gradient going from white to black from left to right.
Therefore, it has to:
  • take a scalar field as input. Otherwise, how do you decide which vector is larger than the other?
  • output a vector field that contains the direction in which the scalar increases fastest locally at each point. This has to give out vectors, since we are talking about directions
Laplace operator Updated 2025-07-16
Can be denoted either by:
Our default symbol is going to be:
Evil Updated 2025-07-16
Things that are not nice such as:
Set function Updated 2025-07-16
This section is about functions that operates on arbitrary sets.
Numeric function Updated 2025-07-16
This section is about functions that operate on numbers such as the integers or real numbers.
Discrete Fourier transform Updated 2025-07-16
Input: a sequence of complex numbers .
Output: another sequence of complex numbers such that:
Intuitively, this means that we are braking up the complex signal into sinusoidal frequencies:
  • : is kind of magic and ends up being a constant added to the signal because
  • : sinusoidal that completes one cycle over the signal. The larger the , the larger the resolution of that sinusoidal. But it completes one cycle regardless.
  • : sinusoidal that completes two cycles over the signal
  • ...
  • : sinusoidal that completes cycles over the signal
and is the amplitude of each sine.
We use Zero-based numbering in our definitions because it just makes every formula simpler.
Motivation: similar to the Fourier transform:
In particular, the discrete Fourier transform is used in signal processing after a analog-to-digital converter. Digital signal processing historically likely grew more and more over analog processing as digital processors got faster and faster as it gives more flexibility in algorithm design.
Sample software implementations:
Figure 1.
DFT of with 25 points
. This is a simple example of a discrete Fourier transform for a real input signal. It illustrates how the DFT takes N complex numbers as input, and produces N complex numbers as output. It also illustrates how the discrete Fourier transform of a real signal is symmetric around the center point.

There are unlisted articles, also show them or only show them.