Search Results for ""

If k|n, then the complete k-uniform hypergraph on n vertices decomposes into 1-factors, where a 1-factor is a set of n/k pairwise disjoint k-sets. Brouwer and Schrijver ...

Given a set of n+1 control points P_0, P_1, ..., P_n, the corresponding Bézier curve (or Bernstein-Bézier curve) is given by C(t)=sum_(i=0)^nP_iB_(i,n)(t), where B_(i,n)(t) ...

An incidence system (v, k, lambda, r, b) in which a set X of v points is partitioned into a family A of b subsets (blocks) in such a way that any two points determine lambda ...

The Bonferroni correction is a multiple-comparison correction used when several dependent or independent statistical tests are being performed simultaneously (since while a ...

The Carlson elliptic integrals, also known as the Carlson symmetric forms, are a standard set of canonical elliptic integrals which provide a convenient alternative to ...

Let J be a finite group and the image R(J) be a representation which is a homomorphism of J into a permutation group S(X), where S(X) is the group of all permutations of a ...

Let X be a set of urelements, and let V(^*X) be an enlargement of the superstructure V(X). Let A in V(X) be a finitary algebra with finitely many fundamental operations. Then ...

First-passage percolation is a time-dependent generalization of discrete Bernoulli percolation in which each graph edge e of Z^d is assigned a nonnegative random variable ...

In mathematics, a formal language is normally defined by an alphabet and formation rules. The alphabet of a formal language is a set of symbols on which this language is ...

Let I(G) denote the set of all independent sets of vertices of a graph G, and let I(G,u) denote the independent sets of G that contain the vertex u. A fractional coloring of ...