TOPICS
Search

Search Results for ""


281 - 290 of 407 for localSearch Results
The Radon-Nikodym theorem asserts that any absolutely continuous complex measure lambda with respect to some positive measure mu (which could be Lebesgue measure or Haar ...
Let phi(n) be any function, say analytic or integrable. Then int_0^inftyx^(s-1)sum_(k=0)^infty(-1)^kx^kphi(k)dx=(piphi(-s))/(sin(spi)) (1) and ...
A strict order > on the set of terms of a term rewriting system is called a reduction order if 1. The set of terms is well ordered with respect to >, that is, all its ...
Let a discrete distribution have probability function p_k, and let a second discrete distribution have probability function q_k. Then the relative entropy of p with respect ...
The vector space tensor product V tensor W of two group representations of a group G is also a representation of G. An element g of G acts on a basis element v tensor w by ...
Let R be the class of expressions generated by 1. The rational numbers and the two real numbers pi and ln2, 2. The variable x, 3. The operations of addition, multiplication, ...
A circle packing is called rigid (or "stable") if every circle is fixed by its neighbors, i.e., no circle can be translated without disturbing other circles of the packing ...
The Schröder-Bernstein theorem for numbers states that if n<=m<=n, then m=n. For sets, the theorem states that if there are injections of the set A into the set B and of B ...
Let f be analytic on the unit disk, and assume that 1. |f(z)|<=1 for all z, and 2. f(a)=b for some a,b in D(0,1), the unit disk. Then |f^'(a)|<=(1-|b|^2)/(1-|a|^2). (1) ...
The scramble number sn(G) of a graph G is a graph invariant developed to aid in the study of gonality of graphs. The scramble number is NP-hard to compute (Echavarria et al. ...
1 ... 26|27|28|29|30|31|32 ... 41 Previous Next

...