Search Results for ""

An edge-transitive graph is a graph such that any two edges are equivalent under some element of its automorphism group. More precisely, a graph is edge-transitive if for all ...

The Eisenstein integers, sometimes also called the Eisenstein-Jacobi integers (Finch 2003, p. 601), are numbers of the form a+bomega, where a and b are normal integers, ...

Exterior algebra is the algebra of the wedge product, also called an alternating algebra or Grassmann algebra. The study of exterior algebra is also called Ausdehnungslehre ...

A prime p for which 1/p has a maximal period decimal expansion of p-1 digits. Full reptend primes are sometimes also called long primes (Conway and Guy 1996, pp. 157-163 and ...

Gram-Schmidt orthogonalization, also called the Gram-Schmidt process, is a procedure which takes a nonorthogonal set of linearly independent functions and constructs an ...

The ancient Greeks used the 24 letters of their alphabet plus three special signs called episemons--vau or digamma or stigma (6), koppa or qoppa (90), and san or sampi ...

The incidence matrix of a graph gives the (0,1)-matrix which has a row for each vertex and column for each edge, and (v,e)=1 iff vertex v is incident upon edge e (Skiena ...

The Neuberg cubic Z(X_(30)) of a triangle DeltaABC is the locus of all points P whose reflections in the sidelines BC, CA, and ABform a triangle perspective to DeltaABC. It ...

Given a point P, the pedal triangle of P is the triangle whose polygon vertices are the feet of the perpendiculars from P to the side lines. The pedal triangle of a triangle ...

The standard deviation sigma of a probability distribution is defined as the square root of the variance sigma^2, sigma = sqrt(<x^2>-<x>^2) (1) = sqrt(mu_2^'-mu^2), (2) where ...