TOPICS
Search

Search Results for ""


381 - 390 of 518 for Rule 150Search Results
A W^*-algebra is a C-*-algebra A for which there is a Banach space A_* such that its dual is A. Then the space A_* is uniquely defined and is called the pre-dual of A. Every ...
The Weierstrass constant is defined as the value sigma(1|1,i)/2, where sigma(z|omega_1,omega_2) is the Weierstrass sigma function with half-periods omega_1 and omega_2. ...
A variant of the Pollard p-1 method which uses Lucas sequences to achieve rapid factorization if some factor p of N has a decomposition of p+1 in small prime factors.
The identity element of an additive monoid or group or of any other algebraic structure (e.g., ring, module, abstract vector space, algebra) equipped with an addition. It is ...
D_q=1/(1-q)lim_(epsilon->0)(lnI(q,epsilon))/(ln(1/epsilon),) (1) where I(q,epsilon)=sum_(i=1)^Nmu_i^q, (2) epsilon is the box size, and mu_i is the natural measure. The ...
The detour index omega(G) of a graph G is a graph invariant defined as half the sum of all off-diagonal matrix elements of the detour matrix of G. Unless otherwise stated, ...
The Harary index of a graph G on n vertices was defined by Plavšić et al. (1993) as H(G)=1/2sum_(i=1)^nsum_(j=1)^n(RD)_(ij), (1) where (RD)_(ij)={D_(ij)^(-1) if i!=j; 0 if ...
The number of ways of partitioning a set of n elements into m nonempty sets (i.e., m set blocks), also called a Stirling set number. For example, the set {1,2,3} can be ...
N_phi(m) is the number of integers n for which the totient function phi(n)=m, also called the multiplicity of m (Guy 1994). Erdős (1958) proved that if a multiplicity occurs ...
The Wiener index W, denoted w (Wiener 1947) and also known as the "path number" or Wiener number (Plavšić et al. 1993), is a graph index defined for a graph on n nodes by ...
1 ... 36|37|38|39|40|41|42 ... 52 Previous Next

...