Search Results for ""

A vertex-transitive graph, also sometimes called a node symmetric graph (Chiang and Chen 1995), is a graph such that every pair of vertices is equivalent under some element ...

The partitioning of a plane with n points into convex polygons such that each polygon contains exactly one generating point and every point in a given polygon is closer to ...

The Wigner 3j-symbols (j_1 j_2 j_3; m_1 m_2 m_3), also known as "3j symbols" (Messiah 1962, p. 1056) or Wigner coefficients (Shore and Menzel 1968, p. 275) are quantities ...

The Wigner 6j-symbols (Messiah 1962, p. 1062), commonly simply called the 6j-symbols, are a generalization of Clebsch-Gordan coefficients and Wigner 3j-symbol that arise in ...

Zarankiewicz's conjecture asserts that graph crossing number for a complete bipartite graph K_(m,n) is Z(m,n)=|_n/2_||_(n-1)/2_||_m/2_||_(m-1)/2_|, (1) where |_x_| is the ...

The nth k-statistic k_n is the unique symmetric unbiased estimator of the cumulant kappa_n of a given statistical distribution, i.e., k_n is defined so that <k_n>=kappa_n, ...

A p-adic number is an extension of the field of rationals such that congruences modulo powers of a fixed prime p are related to proximity in the so called "p-adic metric." ...

The q-analog of the Pochhammer symbol defined by (a;q)_k={product_(j=0)^(k-1)(1-aq^j) if k>0; 1 if k=0; product_(j=1)^(|k|)(1-aq^(-j))^(-1) if k<0; ...

A (-1,0,1)-matrix is a matrix whose elements consist only of the numbers -1, 0, or 1. The number of distinct (-1,0,1)-n×n matrices (counting row and column permutations, the ...

1729 is sometimes called the Hardy-Ramanujan number. It is the smallest taxicab number, i.e., the smallest number which can be expressed as the sum of two cubes in two ...