Search Results for ""

A set-theoretic term having a number of different meanings. Fraenkel (1953, p. 37) used the term as a synonym for "finite set." However, according to Russell's definition ...

The infimum is the greatest lower bound of a set S, defined as a quantity m such that no member of the set is less than m, but if epsilon is any positive quantity, however ...

A d-dimensional discrete percolation model is said to be inhomogeneous if different graph edges (in the case of bond percolation models) or vertices (in the case of site ...

Let P(z) and Q(z) be univariate polynomials in a complex variable z, and let the polynomial degrees of P and Q satisfy deg(Q)>=deg(P+2). Then int_gamma(P(z))/(Q(z))dz = ...

One of the numbers ..., -2, -1, 0, 1, 2, .... The set of integers forms a ring that is denoted Z. A given integer n may be negative (n in Z^-), nonnegative (n in Z^*), zero ...

The complexity c_n of an integer n is the least number of 1s needed to represent it using only additions, multiplications, and parentheses. For example, the numbers 1 through ...

The function intx gives the integer part of x. In many computer languages, the function is denoted int(x). It is related to the floor and ceiling functions |_x_| and [x] by ...

The number of different triangles which have integer side lengths and perimeter n is T(n) = P(n,3)-sum_(1<=j<=|_n/2_|)P(j,2) (1) = [(n^2)/(12)]-|_n/4_||_(n+2)/4_| (2) = ...

An integral embedding of a graph, not to be confused with an integral graph, is a graph drawn such that vertices are distinct points and all graph edges have integer lengths. ...

An integral graph, not to be confused with an integral embedding of a graph, is defined as a graph whose graph spectrum consists entirely of integers. The notion was first ...