Search Results for ""

The successive square method is an algorithm to compute a^b in a finite field GF(p). The first step is to decompose b in successive powers of two, b=sum_(i)delta_i2^i, (1) ...

For a scalar function f over a surface parameterized by u and v, the surface integral is given by Phi = int_Sfda (1) = int_Sf(u,v)|T_uxT_v|dudv, (2) where T_u and T_v are ...

The symmedial triangle DeltaK_AK_BK_C (a term coined here for the first time), is the triangle whose vertices are the intersection points of the symmedians with the reference ...

The lines AK_A, BK_B, and CK_C which are isogonal to the triangle medians AM_A, BM_B, and CM_C of a triangle are called the triangle's symmedian. The symmedians are ...

Any square matrix A can be written as a sum A=A_S+A_A, (1) where A_S=1/2(A+A^(T)) (2) is a symmetric matrix known as the symmetric part of A and A_A=1/2(A-A^(T)) (3) is an ...

A second-tensor rank symmetric tensor is defined as a tensor A for which A^(mn)=A^(nm). (1) Any tensor can be written as a sum of symmetric and antisymmetric parts A^(mn) = ...

A fundamental structural result in extremal graph theory due to Szemerédi (1978). The regularity lemma essentially says that every graph can be well-approximated by the union ...

For a curve with radius vector r(t), the unit tangent vector T^^(t) is defined by T^^(t) = (r^.)/(|r^.|) (1) = (r^.)/(s^.) (2) = (dr)/(ds), (3) where t is a parameterization ...

The tau conjecture, also known as Ramanujan's hypothesis after its proposer, states that tau(n)∼O(n^(11/2+epsilon)), where tau(n) is the tau function. This was proven by ...

The vector Laplacian can be generalized to yield the tensor Laplacian A_(munu;lambda)^(;lambda) = (g^(lambdakappa)A_(munu;lambda))_(;kappa) (1) = ...