Search Results for ""

A differential k-form is a tensor of tensor rank k that is antisymmetric under exchange of any pair of indices. The number of algebraically independent components in n ...

A root-finding method which was among the most popular methods for finding roots of univariate polynomials in the 19th and 20th centuries. It was invented independently by ...

Kobon Fujimura asked for the largest number N(n) of nonoverlapping triangles that can be constructed using n lines (Gardner 1983, p. 170). A Kobon triangle is therefore ...

A labeled graph G=(V,E) is a finite series of graph vertices V with a set of graph edges E of 2-subsets of V. Given a graph vertex set V_n={1,2,...,n}, the number of ...

The number M_2(n) = 1/nsum_(k=1)^(n^2)k (1) = 1/2n(n^2+1) (2) to which the n numbers in any horizontal, vertical, or main diagonal line must sum in a magic square. The first ...

A generalization of the polyominoes using a collection of equal-sized equilateral triangles (instead of squares) arranged with coincident sides. Polyiamonds are sometimes ...

The Remez algorithm (Remez 1934), also called the Remez exchange algorithm, is an application of the Chebyshev alternation theorem that constructs the polynomial of best ...

In analysis, the phrase "Riesz-Fischer theorem" is used to describe a number of results concerning the convergence of Cauchy sequences in L-p spaces. The theorem is named for ...

Let the number of random walks on a d-D hypercubic lattice starting at the origin which never land on the same lattice point twice in n steps be denoted c_d(n). The first few ...

Smale's problems are a list of 18 challenging problems for the twenty-first century proposed by Field medalist Steven Smale. These problems were inspired in part by Hilbert's ...