Search Results for ""

Cantellation, also known as (polyhedron) expansion (Stott 1910, not to be confused with general geometric expansion) is the process of radially displacing the edges or faces ...

Given a planar graph G, a geometric dual graph and combinatorial dual graph can be defined. Whitney showed that these are equivalent (Harary 1994), so that one may speak of ...

The objective of global optimization is to find the globally best solution of (possibly nonlinear) models, in the (possible or known) presence of multiple local optima. ...

In celestial mechanics, the fixed path a planet traces as it moves around the sun is called an orbit. When a group G acts on a set X (this process is called a group action), ...

Applying the stellation process to the icosahedron gives 20+30+60+20+60+120+12+30+60+60 cells of 11 different shapes and sizes (including the icosahedron itself). The ...

The Jacobi method is a method of solving a matrix equation on a matrix that has no zeros along its main diagonal (Bronshtein and Semendyayev 1997, p. 892). Each diagonal ...

The process of finding a reduced set of basis vectors for a given lattice having certain special properties. Lattice reduction algorithms are used in a number of modern ...

Consider the process of taking a number, multiplying its digits, then multiplying the digits of numbers derived from it, etc., until the remaining number has only one digit. ...

Percolation theory deals with fluid flow (or any other similar process) in random media. If the medium is a set of regular lattice points, then there are two main types of ...

"The" square graphs is the cycle graph C_4. It is isomorphic to the complete bipartite graph K_(2,2). Like all cycle graphs, the line graph of C_4 is isomorphic to itself. A ...