Search Results for ""

Rule 190 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...

Rule 28 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...

Rule 50 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...

Rule 60 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...

The Sierpiński carpet is the fractal illustrated above which may be constructed analogously to the Sierpiński sieve, but using squares instead of triangles. It can be ...

A Smarandache prime is a prime Smarandache number, i.e., a prime number of the form 1234...n. Surprisingly, no Smarandache primes are known as of Nov. 2015. Upper limits on ...

A split graph is a graph whose vertices can be partitioned into a clique and an independent vertex set. Equivalently, it is a chordal graph whose graph complement is also ...

Stanley's theorem states that the total number of 1s that occur among all unordered partitions of a positive integer is equal to the sum of the numbers of distinct members of ...

There are two definitions of the supersingular primes: one group-theoretic, and the other number-theoretic. Group-theoretically, let Gamma_0(N) be the modular group Gamma0, ...

A traceable graph is a graph that possesses a Hamiltonian path. Hamiltonian graphs are therefore traceable, but the converse is not necessarily true. Graphs that are not ...