Search Results for ""

There are a great many beautiful identities involving q-series, some of which follow directly by taking the q-analog of standard combinatorial identities, e.g., the ...

A cellular automaton is a collection of "colored" cells on a grid of specified shape that evolves through a number of discrete time steps according to a set of rules based on ...

The greatest common divisor, sometimes also called the highest common divisor (Hardy and Wright 1979, p. 20), of two positive integers a and b is the largest divisor common ...

The hundred-dollar, hundred-digits challenge problems are a set of ten problems in numerical analysis published in the January/February 2002 issue of SIAM News ...

The m×n rook graph (confusingly called the m×n grid by Brouwer et al. 1989, p. 440) and also sometimes known as a lattice graph (e.g., Brouwer) is the graph Cartesian product ...

Connecting the centers of touching spheres in a three-dimensional Apollonian gasket by edges given a graph known as the Apollonian network. This process is illustrated above ...

In most modern literature, a Boolean model is a probabilistic model of continuum percolation theory characterized by the existence of a stationary point process X and a ...

"The" butterfly graph is a name sometimes given to the 5-vertex graph illustrated above. This graph is also known as the "bowtie graph" (West 2000, p. 12) and is the ...

A finite group G has a finite number of conjugacy classes and a finite number of distinct irreducible representations. The group character of a group representation is ...

Checkers is a two-player game with the most common variant played on an 8×8 checkerboard with each player starts with twelve pieces of a fixed color on opposite sites of the ...