Search Results for ""

The free module of rank n over a nonzero unit ring R, usually denoted R^n, is the set of all sequences {a_1,a_2,...,a_n} that can be formed by picking n (not necessarily ...

A function is a relation that uniquely associates members of one set with members of another set. More formally, a function from A to B is an object f such that every a in A ...

Given a function f(x_1,...,x_n) defined on a domain U, the graph of f is defined as the set of points (which often form a curve or surface) showing the values taken by f over ...

The Gaussian integral, also called the probability integral and closely related to the erf function, is the integral of the one-dimensional Gaussian function over ...

A geodesic is a locally length-minimizing curve. Equivalently, it is a path that a particle which is not accelerating would follow. In the plane, the geodesics are straight ...

The smallest nontrivial taxicab number, i.e., the smallest number representable in two ways as a sum of two cubes. It is given by 1729=1^3+12^3=9^3+10^3. The number derives ...

The helm graph H_n is the graph obtained from an n-wheel graph by adjoining a pendant edge at each node of the cycle. Helm graphs are graceful (Gallian 2018), with the odd ...

Heule graphs are a set of unit-distance graphs with chromatic number five derived by Marijn Heule in April 2018 to July 2918 from the 1581-vertex de Grey Graph (Heule 2018). ...

The Jacobi method is a method of solving a matrix equation on a matrix that has no zeros along its main diagonal (Bronshtein and Semendyayev 1997, p. 892). Each diagonal ...

The Lovász number theta(G) of a graph G, sometimes also called the theta function of G, was introduced by Lovász (1979) with the explicit goal of estimating the Shannon ...