Search Results for ""

Given an undirected graph, a degree sequence is a monotonic nonincreasing sequence of the vertex degrees (valencies) of its graph vertices. The number of degree sequences for ...

The phrase dependent percolation is used in two-dimensional discrete percolation to describe any general model in which the states of the various graph edges (in the case of ...

The Descartes snarks are a set of snarks on 210 vertices and 315 edges discovered by William Tutte in 1948 writing under the pseudonym Blanche Descartes (Descartes 1948; ...

A polynomial Z_G(q,v) in two variables for abstract graphs. A graph with one graph vertex has Z=q. Adding a graph vertex not attached by any graph edges multiplies the Z by ...

A differential k-form is a tensor of tensor rank k that is antisymmetric under exchange of any pair of indices. The number of algebraically independent components in n ...

An algorithm which allows digits of a given number to be calculated without requiring the computation of earlier digits. The BBP formula for pi is the best-known such ...

sum_(1<=k<=n)(n; k)((-1)^(k-1))/(k^m)=sum_(1<=i_1<=i_2<=...<=i_m<=n)1/(i_1i_2...i_m), (1) where (n; k) is a binomial coefficient (Dilcher 1995, Flajolet and Sedgewick 1995, ...

A surface of constant negative curvature obtained by twisting a pseudosphere and given by the parametric equations x = acosusinv (1) y = asinusinv (2) z = ...

The disdyakis triacontahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...

Any two rectilinear figures with equal area can be dissected into a finite number of pieces to form each other. This is the Wallace-Bolyai-Gerwien theorem. For minimal ...