Search Results for ""

Let G be a graph, and suppose each edge of G is independently deleted with fixed probability 0<=p<=1. Then the probability that no connected component of G is disconnected as ...

There exists an integer N such that every string in the look and say sequence "decays" in at most N days to a compound of "common" and "transuranic elements." The table below ...

Given a Poisson process, the probability of obtaining exactly n successes in N trials is given by the limit of a binomial distribution P_p(n|N)=(N!)/(n!(N-n)!)p^n(1-p)^(N-n). ...

Two lines PQ and RS are said to be antiparallel with respect to the sides of an angle A if they make the same angle in the opposite senses with the bisector of that angle. If ...

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 ...

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

A braid is an intertwining of some number of strings attached to top and bottom "bars" such that each string never "turns back up." In other words, the path of each string in ...

Coding theory, sometimes called algebraic coding theory, deals with the design of error-correcting codes for the reliable transmission of information across noisy channels. ...

Combinatorial geometry is a blending of principles from the areas of combinatorics and geometry. It deals with combinations and arrangements of geometric objects and with ...

A compact manifold is a manifold that is compact as a topological space. Examples are the circle (the only one-dimensional compact manifold) and the n-dimensional sphere and ...