Search Results for ""

Let M^n be a compact n-dimensional oriented Riemannian manifold without boundary, let O be a group representation of pi_1(M) by orthogonal matrices, and let E(O) be the ...

R. C. Read defined the anarboricity of a graph G as the maximum number of edge-disjoint nonacyclic (i.e., cyclic) subgraphs of G whose union is G (Harary and Palmer 1973, p. ...

An anchor is the bundle map rho from a vector bundle A to the tangent bundle TB satisfying 1. [rho(X),rho(Y)]=rho([X,Y]) and 2. [X,phiY]=phi[X,Y]+(rho(X)·phi)Y, where X and Y ...

An archaic name for the torus.

A statistic defined to improve the Kolmogorov-Smirnov test in the tail of a distribution.

The n-Andrásfai graph is a circulant graph on 3n-1 nodes whose indices are given by the integers 1, ..., 3n-1 that are congruent to 1 (mod 3). The Andrásfai graphs have graph ...

An Andreini tessellation is a three-dimensional equivalent of a semiregular tessellation. There are 28 such tessellations.

The determination of the number of alternating permutations having elements {1,2,...,n}.

A technique used by André (1887) to provide an elegant solution to the ballot problem (Hilton and Pederson 1991) and in study of Wiener processes (Doob 1953; Papoulis 1984, ...

The link of 2-spheres in R^4 obtained by spinning intertwined arcs. The link consists of a knotted 2-sphere and a spun trefoil knot.