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 maximal number of regions into which space can be divided by n planes is f(n)=1/6(n^3+5n+6) (Yaglom and Yaglom 1987, pp. 102-106). For n=1, 2, ..., these give the values ...

The number of regions into which space can be divided by n mutually intersecting spheres is N=1/3n(n^2-3n+8), giving 2, 4, 8, 16, 30, 52, 84, ... (OEIS A046127) for n=1, 2, ...

Let A be an n×n matrix with complex or real elements with eigenvalues lambda_1, ..., lambda_n. Then the spectral radius rho(A) of A is rho(A)=max_(1<=i<=n)|lambda_i|, i.e., ...

X is a spherical t-design in E iff it is possible to exactly determine the average value on E of any polynomial f of degree at most t by sampling f at the points of X. In ...

The difference between the sum of the angles A, B, and C of a spherical triangle and pi radians (180 degrees), E=A+B+C-pi. The notation Delta is sometimes used for spherical ...

A sliver of the surface of a sphere of radius r cut out by two planes through the azimuthal axis with dihedral angle theta. The surface area of the lune is S=2r^2theta, which ...

Consider a star graph S_(n+1) consisting of a central hub vertex and n spokes, but instead of placing a single point at the end of each spoke, place k points along it (in ...

A square-free graph is a graph containing no graph cycles of length four. A simple graph is square-free iff c_4=1/8[Tr(A^4)-2m-2sum_(i!=j)a_(ij)^((2))]=0, where A is the ...

The average number of regions N(n) into which n lines divide a square is N^_(n)=1/(16)n(n-1)pi+n+1 (Santaló 1976; Finch 2003, p. 481). The maximum number of sequences is ...