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 disdyakis triacontahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...

The Earls sequence gives the starting position in the decimal digits of pi (or in general, any constant), not counting digits to the left of the decimal point, at which a ...

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

pi may be computed using a number of iterative algorithms. The best known such algorithms are the Archimedes algorithm, which was derived by Pfaff in 1800, and the ...

Given a simplex of unit content in Euclidean d-space, pick n>=d+1 points uniformly and independently at random, and denote the expected content of their convex hull by ...

A tag system is set of rules that specifies a fixed number of elements (commonly denoted nu or beta) be removed from the beginning of a sequence and a set of elements to be ...

The triakis tetrahedral graph is Archimedean dual graph which is the skeleton of the triakis tetrahedron. It is implemented in the Wolfram Language as ...

A unit circle is a circle of unit radius, i.e., of radius 1. The unit circle plays a significant role in a number of different areas of mathematics. For example, the ...

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