Search Results for ""

In discrete percolation theory, bond percolation is a percolation model on a regular point lattice L=L^d in d-dimensional Euclidean space which considers the lattice graph ...

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

In continuum percolation theory, the Boolean-Poisson model is a Boolean model driven by a stationary point process X which is a Poisson process. The Boolean-Poisson model is ...

A two-dimensional binary (k=2) totalistic cellular automaton with a von Neumann neighborhood of range r=1. It has a birth rule that at least 2 of its 4 neighbors are alive, ...

A bounded lattice is an algebraic structure L=(L, ^ , v ,0,1), such that (L, ^ , v ) is a lattice, and the constants 0,1 in L satisfy the following: 1. for all x in L, x ^ ...

Define a Bouniakowsky polynomial as an irreducible polynomial f(x) with integer coefficients, degree >1, and GCD(f(1),f(2),...)=1. The Bouniakowsky conjecture states that ...

The bracket polynomial is one-variable knot polynomial related to the Jones polynomial. The bracket polynomial, however, is not a topological invariant, since it is changed ...

Take x itself to be a bracketing, then recursively define a bracketing as a sequence B=(B_1,...,B_k) where k>=2 and each B_i is a bracketing. A bracketing can be represented ...

Consider n strings, each oriented vertically from a lower to an upper "bar." If this is the least number of strings needed to make a closed braid representation of a link, n ...

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