Search Results for ""

In its original form, the Poincaré conjecture states that every simply connected closed three-manifold is homeomorphic to the three-sphere (in a topologist's sense) S^3, ...

The resistance distance between vertices i and j of a graph G is defined as the effective resistance between the two vertices (as when a battery is attached across them) when ...

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 ...

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 ...

A partial differential equation which appears in differential geometry and relativistic field theory. Its name is a wordplay on its similar form to the Klein-Gordon equation. ...

The number of ways of partitioning a set of n elements into m nonempty sets (i.e., m set blocks), also called a Stirling set number. For example, the set {1,2,3} can be ...

N_phi(m) is the number of integers n for which the totient function phi(n)=m, also called the multiplicity of m (Guy 1994). Erdős (1958) proved that if a multiplicity occurs ...

The truncated dodecadodecahedral graph is the skeleton of the truncated dodecadodecahedron, which is the only uniform polyhedron for which this is the case. It will be ...

The Weierstrass elliptic functions (or Weierstrass P-functions, voiced "p-functions") are elliptic functions which, unlike the Jacobi elliptic functions, have a second-order ...

The j-function is the modular function defined by j(tau)=1728J(tau), (1) where tau is the half-period ratio, I[tau]>0, ...