Search Results for ""

The Higman-Sims graph is the unique strongly regular graph on 100 nodes (Higman and Sims 1968, Brouwer 1983, Brouwer and Haemers 1993). It was also constructed independently ...

The grouping of data into bins (spaced apart by the so-called class interval) plotting the number of members in each bin versus the bin number. The above histogram shows the ...

A holyhedron is polyhedron whose faces and holes are all finite-sided polygons and that contains at least one hole whose boundary shares no point with a face boundary. D. ...

Consider a game where everyone in a classroom picks a number between 0 and 100. The person closest to half the average wins. Obviously, picking a number over 50 would be ...

Given a sequence {a_i}_(i=1)^N, an n-moving average is a new sequence {s_i}_(i=1)^(N-n+1) defined from the a_i by taking the arithmetic mean of subsequences of n terms, ...

The sequence of graphs starting with the Suzuki graph and successively taking local graphs, summarized in the following table, is known as the Suzuki tower, a name due to ...

A single axiom that is satisfied only by NAND or NOR must be of the form "something equals a," since otherwise constant functions would satisfy the equation. With up to six ...

Conditions at an initial time t=t_0 from which a given set of mathematical equations or physical system evolves. A system with initial conditions specified is known as an ...

A type of cryptography in which the encoding key is revealed without compromising the encoded message. The two best-known methods are the knapsack problem and RSA encryption.

An Abelian variety which is canonically attached to an algebraic variety which is the solution to a certain universal problem. The Albanese variety is dual to the Picard ...