Search Results for ""

The rectilinear crossing number of a graph G is the minimum number of crossings in a straight line embedding of G in a plane. It is variously denoted rcr(G), cr^_(G) ...

The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...

The dodecahedral graph is the Platonic graph corresponding to the connectivity of the vertices of a dodecahedron, illustrated above in four embeddings. The left embedding ...

An Abelian group is a group for which the elements commute (i.e., AB=BA for all elements A and B). Abelian groups therefore correspond to groups with symmetric multiplication ...

Consider the probability Q_1(n,d) that no two people out of a group of n will have matching birthdays out of d equally possible birthdays. Start with an arbitrary person's ...

Let p be a prime with n digits and let A be a constant. Call p an "A-prime" if the concatenation of the first n digits of A (ignoring the decimal point if one is present) ...

The game of life is the best-known two-dimensional cellular automaton, invented by John H. Conway and popularized in Martin Gardner's Scientific American column starting in ...

A Hadamard matrix is a type of square (-1,1)-matrix invented by Sylvester (1867) under the name of anallagmatic pavement, 26 years before Hadamard (1893) considered them. In ...

The icosahedral graph is the Platonic graph whose nodes have the connectivity of the regular icosahedron, as well as the great dodecahedron, great icosahedron Jessen's ...

The Newton-Cotes formulas are an extremely useful and straightforward family of numerical integration techniques. To integrate a function f(x) over some interval [a,b], ...