Search Results for ""

The numbers H_n=H_n(0), where H_n(x) is a Hermite polynomial, may be called Hermite numbers. For n=0, 1, ..., the first few are 1, 0, -2, 0, 12, 0, -120, 0, 1680, 0, ... ...

Combinatorial matrix theory is a rich branch of mathematics that combines combinatorics, graph theory, and linear algebra. It includes the theory of matrices with prescribed ...

The term discrete percolation is used to describe models of percolation theory whose media are discrete sets like sets of regular lattice points (e.g., bond percolation and ...

An axiomatic theory (such as a geometry) is said to be complete if each valid statement in the theory is capable of being proven true or false.

The problem of maximizing a linear function over a convex polyhedron, also known as operations research or optimization theory. The general problem of convex optimization is ...

The phrase Tomita-Takesaki theory refers to a specific collection of results proven within the field of functional analysis regarding the theory of modular Hilbert algebras ...

Bertelsen's number is an erroneous name erroneously given to the erroneous value of pi(10^9)=50847478, where pi(x) is the prime counting function. This value is 56 lower than ...

A theory of constructing initial conditions that provides safe convergence of a numerical root-finding algorithm for an equation f(z)=0. Point estimation theory treats ...

The theory of analyzing a decision between a collection of alternatives made by a collection of n voters with separate opinions. Any choice for the entire group should ...

An abundant number for which all proper divisors are deficient is called a primitive abundant number (Guy 1994, p. 46). The first few odd primitive abundant numbers are 945, ...