Search Results for ""

A pentahedron is polyhedron having five faces. Because there are two pentahedral graphs, there are two convex pentahedra, corresponding to the topologies of the square ...

For a set of n numbers or values of a discrete distribution x_i, ..., x_n, the root-mean-square (abbreviated "RMS" and sometimes called the quadratic mean), is the square ...

The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...

The square root inequality states that 2sqrt(n+1)-2sqrt(n)<1/(sqrt(n))<2sqrt(n)-2sqrt(n-1) for n>=1.

The upper irredundance number IR(G) of a graph G is the maximum size of an irredundant set of vertices in G. It is therefore equal to the size of a maximum irredundant set as ...

A sparse polynomial square is a square of a polynomial [P(x)]^2 that has fewer terms than the original polynomial P(x). Examples include Rényi's polynomial (1) (Rényi 1947, ...

In determinant expansion by minors, the minimal number of transpositions of adjacent columns in a square matrix needed to turn the matrix representing a permutation of ...

A Brier number is a number that is both a Riesel number and a Sierpiński number of the second kind, i.e., a number n such that for all k>=1, the numbers n·2^k+1 and n·2^k-1 ...

One of the eight convex deltahedra built up from 16 equilateral triangles. It consists of two oppositely faced square pyramids rotated 45 degrees to each other and separated ...

An elongated square pyramid is a solid formed by attaching a square pyramid atop a square prism. Such a solid might also be termed an obelisk (although that term is also used ...