Search Results for ""

Sorting is the rearrangement of numbers (or other orderable objects) in a list into their correct lexographic order. Alphabetization is therefore a form of sorting. Because ...

The square root method is an algorithm which solves the matrix equation Au=g (1) for u, with A a p×p symmetric matrix and g a given vector. Convert A to a triangular matrix ...

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) ...

A Thue equation is a Diophantine equation of the form A_nx^n+A_(n-1)x^(n-1)y+A_(n-2)x^(n-2)y^2+...+A_0y^n=M in terms of an irreducible polynomial of degree n>=3 having ...

Given a real number q>1, the series x=sum_(n=0)^inftya_nq^(-n) is called the q-expansion, or beta-expansion (Parry 1957), of the positive real number x if, for all n>=0, ...

Synthetic division is a shortcut method for dividing two polynomials which can be used in place of the standard long division algorithm. This method reduces the dividend and ...

The BBP (named after Bailey-Borwein-Plouffe) is a formula for calculating pi discovered by Simon Plouffe in 1995, ...

The fractional edge chromatic number of a graph G is the fractional analog of the edge chromatic number, denoted chi_f^'(G) by Scheinerman and Ullman (2011). It can be ...

The generalized Gell-Mann matrices are the n^2-1 matrices generating the Lie algebra associated to the special unitary group SU(n), n>=2. As their name suggests, these ...

Let G be a planar graph whose vertices have been properly colored and suppose v in V(G) is colored C_1. Define the C_1C_2-Kempe chain containing v to be the maximal connected ...