Search Results for ""

If a sequence takes only a small number of different values, then by regarding the values as the elements of a finite field, the Berlekamp-Massey algorithm is an efficient ...

Bézout's theorem for curves states that, in general, two algebraic curves of degrees m and n intersect in m·n points and cannot meet in more than m·n points unless they have ...

A polygon which has both a circumcircle (which touches each vertex) and an incircle (which is tangent to each side). All triangles are bicentric with R^2-x^2=2Rr, (1) where R ...

The biggest little polygon with n sides is the convex plane n-gon of unit polygon diameter having largest possible area. Reinhardt (1922) showed that for n odd, the regular ...

A binomial number is a number of the form a^n+/-b^n, where a,b, and n are integers. Binomial numbers can be factored algebraically as ...

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

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

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

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

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