Search Results for ""
5821 - 5830 of 13135 for Lagrange Number Diophantine EquationSearch Results
The function defined by (1) (Heatley 1943; Abramowitz and Stegun 1972, p. 509), where _1F_1(a;b;z) is a confluent hypergeometric function of the first kind and Gamma(z) is ...
Given a complex measure mu, there exists a positive measure denoted |mu| which measures the total variation of mu, also sometimes called simply "total variation." In ...
A total order (or "totally ordered set," or "linearly ordered set") is a set plus a relation on the set (called a total order) that satisfies the conditions for a partial ...
A shortened term for integral transform. Geometrically, if S and T are two transformations, then the similarity transformation TST^(-1) is sometimes called the transform ...
A transposition graph G_n is a graph whose nodes correspond to permutations and edges to permutations that differ by exactly one transposition (Skiena 1990, p. 9, Clark ...
Informally, a function f:{0,1}^(l(n))×{0,1}^n->{0,1}^(m(n)) is a trapdoor one-way function if 1. It is a one-way function, and 2. For fixed public key y in {0,1}^(l(n)), ...
Let x and y be vectors. Then the triangle inequality is given by |x|-|y|<=|x+y|<=|x|+|y|. (1) Equivalently, for complex numbers z_1 and z_2, ...
A tripod is a tree having exactly three tree leaves (Pirnazar and Ullman 2002). The numbers of tripods on n=1, 2, ... vertices are 0, 0, 0, 1, 1, 2, 3, 4, 5, 7, 8, 10, 12, ...
The truncated dodecadodecahedron, also called the quasitruncated dodecahedron, is the uniform polyhedron with Maeder index 59 (Maeder 1997), Wenninger index 98 (Wenninger ...
Let G(V,E) be a graph with graph vertices V and graph edges E on n graph vertices without a (k+1)-clique. Then t(n,k)<=((k-1)n^2)/(2k), where t(n,k) is the edge count. (Note ...
...
View search results from all Wolfram sites (65718 matches)

