Search Results for ""

If k|n, then the complete k-uniform hypergraph on n vertices decomposes into 1-factors, where a 1-factor is a set of n/k pairwise disjoint k-sets. Brouwer and Schrijver ...

The polyhedron compound of the icosahedron (U_(22)) and the great dodecahedron (U_(35)), sometimes known as the small cid. Four faces meet at each edge of the small complex ...

A multistable polyhedron is a polyhedron that can change form from one stable configuration to another with only a slight transient nondestructive elastic stretch (Goldberg ...

Tetrahedron picking is the process of picking tetrahedra at random within a given shape in 3 or higher dimensions. The most natural definition of a random tetrahedron is one ...

Bayesian analysis is a statistical procedure which endeavors to estimate parameters of an underlying distribution based on the observed distribution. Begin with a "prior ...

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

Let E_n(f) be the error of the best uniform approximation to a real function f(x) on the interval [-1,1] by real polynomials of degree at most n. If alpha(x)=|x|, (1) then ...

A formula relating the number of polyhedron vertices V, faces F, and polyhedron edges E of a simply connected (i.e., genus 0) polyhedron (or polygon). It was discovered ...

The dual of the great dodecahemicosahedron U_(65) and Wenninger dual W_(102). When rendered, the small dodecahemicosacron and great dodecahemicosacron appear the same.

The dual of the great dodecahemidodecahedron U_(70) and Wenninger dual W_(107). When rendered, the great dodecahemidodecacron and great icosihemidodecacron look the same, ...