Search Results for ""

A quartic graph is a graph which is 4-regular. The unique quartic graph on five nodes is the complete graph K_5, and the unique quartic graph on six nodes is the octahedral ...

A random-connection model (RCM) is a graph-theoretic model of continuum percolation theory characterized by the existence of a stationary point process X and a non-increasing ...

How can n points be distributed on a unit sphere such that they maximize the minimum distance between any pair of points? This maximum distance is called the covering radius, ...

Sudoku (literally, "single number"), sometimes also is a pencil-and-paper logic puzzle whose goal is to complete a grid satisfying various constraints. In the "classic" ...

The minimal polynomial of an algebraic number zeta is the unique irreducible monic polynomial of smallest degree p(x) with rational coefficients such that p(zeta)=0 and whose ...

The polynomials defined by B_(i,n)(t)=(n; i)t^i(1-t)^(n-i), (1) where (n; k) is a binomial coefficient. The Bernstein polynomials of degree n form a basis for the power ...

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

Take K a number field and m a divisor of K. A congruence subgroup H is defined as a subgroup of the group of all fractional ideals relative prime to m (I_K^m) that contains ...

The Clebsch diagonal cubic is a cubic algebraic surface given by the equation x_0^3+x_1^3+x_2^3+x_3^3+x_4^3=0, (1) with the added constraint x_0+x_1+x_2+x_3+x_4=0. (2) The ...