Search Results for ""

The Floyd-Warshall algorithm, also variously known as Floyd's algorithm, the Roy-Floyd algorithm, the Roy-Warshall algorithm, or the WFI algorithm, is an algorithm for ...

A d-dimensional discrete percolation model is said to be inhomogeneous if different graph edges (in the case of bond percolation models) or vertices (in the case of site ...

Intuitively, a d-dimensional discrete percolation model is said to be long-range if direct flow is possible between pairs of graph vertices or graph edges which are "very ...

A 2-dimensional discrete percolation model is said to be mixed if both graph vertices and graph edges may be "blocked" from allowing fluid flow (i.e., closed in the sense of ...

Newton's method for finding roots of a complex polynomial f entails iterating the function z-[f(z)/f^'(z)], which can be viewed as applying the Euler backward method with ...

A connective in logic which yields true if any one of a sequence conditions is true, and false if all conditions are false. In formal logic, the term disjunction (or, more ...

Let G=(V,E) be a finite graph, let Omega be the set Omega={0,1}^E whose members are vectors omega=(omega(e):e in E), and let F be the sigma-algebra of all subsets of Omega. A ...

The triangular orthobicupola is Johnson solid J_(27), consisting of eight equilateral triangles and six squares. If a triangular orthobicupola is oriented with triangles on ...

In 1704, Sebastien Truchet considered all possible patterns formed by tilings of right triangles oriented at the four corners of a square (Wolfram 2002, p. 875). Truchet's ...

The term "wedge" has a number of different meanings in mathematics. It is sometimes used as another name for the caret symbol. The term also refers to the notation ( ^ ) used ...