Search Results for ""
3001 - 3010 of 3259 for Partially Ordered SetSearch Results
A binary unit of information equal to 8 bits. Unfortunately, the storage of binary numbers in computers is not entirely standardized. Because computers store information in ...
The Cantor function F(x) is the continuous but not absolutely continuous function on [0,1] which may be defined as follows. First, express x in ternary. If the resulting ...
A discrete function A(n,k) is called closed form (or sometimes "hypergeometric") in two variables if the ratios A(n+1,k)/A(n,k) and A(n,k+1)/A(n,k) are both rational ...
Combinatorial geometry is a blending of principles from the areas of combinatorics and geometry. It deals with combinations and arrangements of geometric objects and with ...
A completely positive matrix is a real n×n square matrix A=(a_(ij)) that can be factorized as A=BB^(T), where B^(T) stands for the transpose of B and B is any (not ...
A composite number n is a positive integer n>1 which is not prime (i.e., which has factors other than 1 and itself). The first few composite numbers (sometimes called ...
Computational number theory is the branch of number theory concerned with finding and implementing efficient computer algorithms for solving various problems in number ...
Contour integration is the process of calculating the values of a contour integral around a given contour in the complex plane. As a result of a truly amazing property of ...
A covariant tensor, denoted with a lowered index (e.g., a_mu) is a tensor having specific transformation properties. In general, these transformation properties differ from ...
The detour matrix Delta, sometimes also called the maximum path matrix or maximal topological distances matrix, of a graph is a symmetric matrix whose (i,j)th entry is the ...
...
View search results from all Wolfram sites (36822 matches)

