Search Results for ""

Hadamard matrices H_n can be constructed using finite field GF(p^m) when p=4l-1 and m is odd. Pick a representation r relatively prime to p. Then by coloring white ...

A permutation group is a finite group G whose elements are permutations of a given set and whose group operation is composition of permutations in G. Permutation groups have ...

A pair of elements (p_i,p_j) is called an inversion in a permutation p if i>j and p_i<p_j (Skiena 1990, p. 27; Pemmaraju and Skiena 2003, p. 69). For example, in the ...

A space-filling function which maps a one-dimensional interval into a two-dimensional area. Plane-filling functions were thought to be impossible until Hilbert discovered the ...

Proportionally cutting circles are circles that intersect the sidelines of a reference triangle DeltaABC such that length of the chords that are cut off have lengths mua, ...

Given a general quadratic curve Ax^2+Bxy+Cy^2+Dx+Ey+F=0, (1) the quantity X is known as the discriminant, where X=B^2-4AC, (2) and is invariant under rotation. Using the ...

There are nine possible types of isolated singularities on a cubic surface, eight of them rational double points. Each type of isolated singularity has an associated normal ...

In discrete percolation theory, site percolation is a percolation model on a regular point lattice L=L^d in d-dimensional Euclidean space which considers the lattice vertices ...

A snake is an Eulerian path in the d-hypercube that has no chords (i.e., any hypercube edge joining snake vertices is a snake edge). Klee (1970) asked for the maximum length ...

A special type of binary tree obtained by starting with the fractions 0/1 and 1/0 and iteratively inserting (m+m^')/(n+n^') between each two adjacent fractions m/n and ...