Search Results for ""

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings of ...

The constants lambda_(m,n)=inf_(r in R_(m,n))sup_(x>=0)|e^(-x)-r(x)|, where r(x)=(p(x))/(q(x)), p and q are mth and nth order polynomials, and R_(m,n) is the set of all ...

Every "large" even number may be written as 2n=p+m where p is a prime and m in P union P_2 is the set of primes P and semiprimes P_2.

A level set in two dimensions. Phase curves are sometimes also known as level curves (Tabor 1989, p. 14).

Any set of n+2 points in R^n can always be partitioned in two subsets V_1 and V_2 such that the convex hulls of V_1 and V_2 intersect.

The second Zagreb index for a graph with vertex count n and vertex degrees d_i for i=1, ..., n is defined by Z_2=sum_((i,j) in E(G))d_id_j, where E(G) is the edge set of G.

The modification of a set of data to make it smooth and nearly continuous and remove or diminish outlying points.

A spatial point process is a point process which models data that is localized at a discrete set of locations in space or, more specifically, on a plane.

A two-dimensional affine geometry constructed over a finite field. For a field F of size n, the affine plane consists of the set of points which are ordered pairs of elements ...

The discrete uniform distribution is also known as the "equally likely outcomes" distribution. Letting a set S have N elements, each of them having the same probability, then ...