Search Results for ""
5821 - 5830 of 13134 for Extremal graph theorySearch Results
The number of multisets of length k on n symbols is sometimes termed "n multichoose k," denoted ((n; k)) by analogy with the binomial coefficient (n; k). n multichoose k is ...
Consider a knot as being formed from two tangles. The following three operations are called mutations. 1. Cut the knot open along four points on each of the four strings ...
An N-cluster is a point lattice configuration in which the distance between every pair of points is an integer, no three points are collinear, and no four points are ...
A type of mathematical result which is considered by most logicians as more natural than the metamathematical incompleteness results first discovered by Gödel. Finite ...
In number theory (e.g., Ivić 2003), the symbol log_kx is commonly used to mean the nested logarithm (also called the repeated logarithm or iterated logarithm) ...
Polynomials O_n(x) that can be defined by the sum O_n(x)=1/4sum_(k=0)^(|_n/2_|)(n(n-k-1)!)/(k!)(1/2x)^(2k-n-1) (1) for n>=1, where |_x_| is the floor function. They obey the ...
A paradox in decision theory. Given two boxes, B1 which contains $1000 and B2 which contains either nothing or a million dollars, you may pick either B2 or both. However, at ...
The noncentral chi-squared distribution with noncentrality parameter lambda is given by P_r(x) = ...
A *-algebra A of operators on a Hilbert space H is said to act nondegenerately if whenever Txi=0 for all T in A, it necessarily implies that xi=0. Algebras A which act ...
The word "normal form" is used in a variety of different ways in mathematics. In general, it refers to a way of representing objects so that, although each may have many ...
...
View search results from all Wolfram sites (34319 matches)

