Search Results for ""

The polar sine is a function of a vertex angle of an n-dimensional parallelotope or simplex. If the content of the parallelotope is P and the lengths of the n edges of the ...

Determination of whether predicate P(x_1,...,x_n) is true or false for any given values of x_1, ..., x_n is called its decision problem. The decision problem for predicate ...

A secant line, also simply called a secant, is a line passing through two points of a curve. As the two points are brought together (or, more precisely, as one is brought ...

A piecewise polynomial function that can have a locally very simple form, yet at the same time be globally flexible and smooth. Splines are very useful for modeling arbitrary ...

A transformation T (a.k.a., map, function) over a domain D takes the elements X in D to elements Y in T(D), where the range (a.k.a., image) of T is defined as ...

Discrete mathematics is the branch of mathematics dealing with objects that can assume only distinct, separated values. The term "discrete mathematics" is therefore used in ...

The falling factorial (x)_n, sometimes also denoted x^(n__) (Graham et al. 1994, p. 48), is defined by (x)_n=x(x-1)...(x-(n-1)) (1) for n>=0. Is also known as the binomial ...

A matching, also called an independent edge set, on a graph G is a set of edges of G such that no two sets share a vertex in common. It is not possible for a matching on a ...

An extended rooted binary tree satisfying the following conditions: 1. Every node has two children, each colored either red or black. 2. Every tree leaf node is colored ...

The Schröder number S_n is the number of lattice paths in the Cartesian plane that start at (0, 0), end at (n,n), contain no points above the line y=x, and are composed only ...