Search Results for ""

A generalized quadrangle is a generalized polygon of order 4. An order-(s,t) generalized quadrangle contains s+1 points in each line and has t+1 lines through every point, ...

The Farey sequence F_n for any positive integer n is the set of irreducible rational numbers a/b with 0<=a<=b<=n and (a,b)=1 arranged in increasing order. The first few are ...

The Kaprekar routine is an algorithm discovered in 1949 by D. R. Kaprekar for 4-digit numbers, but which can be generalized to k-digit numbers. To apply the Kaprekar routine ...

For any ideal I in a Dedekind ring, there is an ideal I_i such that II_i=z, (1) where z is a principal ideal, (i.e., an ideal of rank 1). Moreover, for a Dedekind ring with a ...

A class of complete orientable minimal surfaces of R^3 derived from Enneper's minimal surface. They are named for the mathematicians who found the first two examples in 1982. ...

Given an undirected graph, a degree sequence is a monotonic nonincreasing sequence of the vertex degrees (valencies) of its graph vertices. The number of degree sequences for ...

The Knuth-Bendix completion algorithm attempts to transform a finite set of identities into a finitely terminating, confluent term rewriting system whose reductions preserve ...

pi may be computed using a number of iterative algorithms. The best known such algorithms are the Archimedes algorithm, which was derived by Pfaff in 1800, and the ...

E(a,b)/p denotes the elliptic group modulo p whose elements are 1 and infty together with the pairs of integers (x,y) with 0<=x,y<p satisfying y^2=x^3+ax+b (mod p) (1) with a ...

Let f(x,y) be a homogeneous function of order n so that f(tx,ty)=t^nf(x,y). (1) Then define x^'=xt and y^'=yt. Then nt^(n-1)f(x,y) = ...