Search Results for ""

Let X be a set and S a collection of subsets of X. A set function mu:S->[0,infty] is said to possess countable monotonicity provided that, whenever a set E in S is covered by ...

Let M(h) be the moment-generating function, then the cumulant generating function is given by K(h) = lnM(h) (1) = kappa_1h+1/(2!)h^2kappa_2+1/(3!)h^3kappa_3+..., (2) where ...

Let phi(t) be the characteristic function, defined as the Fourier transform of the probability density function P(x) using Fourier transform parameters a=b=1, phi(t) = ...

A module over a unit ring R is called divisible if, for all r in R which are not zero divisors, every element m of M can be "divided" by r, in the sense that there is an ...

A graph G with m edges is said to be elegant if the vertices of G can be labeled with distinct integers (0,1,2,...,m) in such a way that the set of values on the edges ...

Let E be an elliptic curve defined over the field of rationals Q(sqrt(-d)) having equation y^2=x^3+ax+b with a and b integers. Let P be a point on E with integer coordinates ...

The formal term used for a collection of objects. It is denoted {a_i}_(i in I) (but other kinds of brackets can be used as well), where I is a nonempty set called the index ...

A set function mu is said to possess finite subadditivity if, given any finite disjoint collection of sets {E_k}_(k=1)^n on which mu is defined, mu( union ...

A group is called a free group if no relation exists between its group generators other than the relationship between an element and its inverse required as one of the ...

In general, a frieze consists of repeated copies of a single motif. b ; a d; c Conway and Guy (1996) define a frieze pattern as an arrangement of numbers at the intersection ...