Search Results for ""

If the three straight lines joining the corresponding vertices of two triangles ABC and A^'B^'C^' all meet in a point (the perspector), then the three intersections of pairs ...

Dijkstra's algorithm is an algorithm for finding a graph geodesic, i.e., the shortest path between two graph vertices in a graph. It functions by constructing a shortest-path ...

Given a number n, Fermat's factorization methods look for integers x and y such that n=x^2-y^2. Then n=(x-y)(x+y) (1) and n is factored. A modified form of this observation ...

A generalized Moore graph is a regular graph of degree r where the counts of vertices at each distance d=0, 1, ... from any vertex are 1, r, r(r-1), r(r-1)^2, r(r-1)^3, ..., ...

The Hankel transform (of order zero) is an integral transform equivalent to a two-dimensional Fourier transform with a radially symmetric integral kernel and also called the ...

Consider an n×n (0, 1)-matrix such as [a_(11) a_(23) ; a_(22) a_(34); a_(21) a_(33) ; a_(32) a_(44); a_(31) a_(43) ; a_(42) a_(54); a_(41) a_(53) ; a_(52) a_(64)] (1) for ...

The base 16 notational system for representing real numbers. The digits used to represent numbers using hexadecimal notation are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, ...

Roughly speaking, isospectral manifolds are drums that sound the same, i.e., have the same eigenfrequency spectrum. Two drums with differing area, perimeter, or genus can ...

"Jabulani polyhedron" is a term introduced here to refer to the polyhedron illustrated above which underlies the shape of the soccer ball used in the 2010 World Cup in South ...

The Johnson triangle DeltaJ_AJ_BJ_C, a term coined here for the first time, is the triangle formed by the centers of the Johnson circles. It has trilinear vertex matrix ...