TOPICS
Search

Search Results for ""


13071 - 13080 of 13135 for Probability Generating FunctionSearch Results
A ring in the mathematical sense is a set S together with two binary operators + and * (commonly interpreted as addition and multiplication, respectively) satisfying the ...
For |q|<1, the Rogers-Ramanujan identities are given by (Hardy 1999, pp. 13 and 90), sum_(n=0)^(infty)(q^(n^2))/((q)_n) = 1/(product_(n=1)^(infty)(1-q^(5n-4))(1-q^(5n-1))) ...
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 ...
Salem constants, sometimes also called Salem numbers, are a set of numbers of which each point of a Pisot number is a limit point from both sides (Salem 1945). The Salem ...
The Shrikhande graph is a strongly regular graph on 16 nodes. It is cospectral with the rook graph L_(4,4), so neither of the two is determined by spectrum. The Shrikhande ...
A Sierpiński number of the second kind is a number k satisfying Sierpiński's composite number theorem, i.e., a Proth number k such that k·2^n+1 is composite for every n>=1. ...
The Sierpiński sieve is a fractal described by Sierpiński in 1915 and appearing in Italian art from the 13th century (Wolfram 2002, p. 43). It is also called the Sierpiński ...
The small stellated dodecahedron is the Kepler-Poinsot polyhedra whose dual polyhedron is the great dodecahedron. It is also uniform polyhedron with Maeder index 34 (Maeder ...
The term "snark" was first popularized by Gardner (1976) as a class of minimal cubic graphs with edge chromatic number 4 and certain connectivity requirements. (By Vizing's ...
A space-filling polyhedron is a polyhedron which can be used to generate a tessellation of space. Although even Aristotle himself proclaimed in his work On the Heavens that ...

...