Search Results for ""

A column-convex polyomino is a self-avoiding convex polyomino such that the intersection of any vertical line with the polyomino has at most two connected components. ...

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

Given a sequence {a_n}_(n=1)^infty, a formal power series f(s) = sum_(n=1)^(infty)(a_n)/(n^s) (1) = a_1+(a_2)/(2^s)+(a_3)/(3^s)+... (2) is called the Dirichlet generating ...

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 elliptic curve factorization method, abbreviated ECM and sometimes also called the Lenstra elliptic curve method, is a factorization algorithm that computes a large ...

A Gaussian integer is a complex number a+bi where a and b are integers. The Gaussian integers are members of the imaginary quadratic field Q(sqrt(-1)) and form a ring often ...

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