Search Results for ""

The angular distance traveled around a circle is the number of radians the path subtends, theta=l/(2pir)2pi=l/r.

Let K_1^n and K_2^n be disjoint bicollared knots in R^(n+1) or S^(n+1) and let U denote the open region between them. Then the closure of U is a closed annulus S^n×[0,1]. ...

The point of concurrence of the four maltitudes of a cyclic quadrilateral. Let M_(AC) and M_(BD) be the midpoints of the diagonals of a cyclic quadrilateral ABCD, and let P ...

Every complex matrix A can be broken into a Hermitian part A_H=1/2(A+A^(H)) (i.e., A_H is a Hermitian matrix) and an antihermitian part A_(AH)=1/2(A-A^(H)) (i.e., A_(AH) is ...

A number of the form p^a·A is said to be an antisquare if it fails to be a square number for the two reasons that a is odd and A is a nonsquare (modulo p). The first few ...

A directed graph is called an arborescence if, from a given node x known as the root vertex, there is exactly one elementary path from x to every other node y.

Let (X,tau) be a topological space, and let p in X. Then the arc component of p is union {A subset= X:A is an arc and p in A}.

Barycentric coordinates (t_1,t_2,t_3) normalized so that they become the areas of the triangles PA_1A_2, PA_1A_3, and PA_2A_3, where P is the point whose coordinates have ...

The sequence whose definition is: "t is the first, fourth, eleventh, ... letter of this sentence." The first few values are 1, 4, 11, 16, 24, 29, 33, 35, 39, ... (OEIS ...

In general, an arrangement of objects is simply a grouping of them. The number of "arrangements" of n items is given either by a combination (order is ignored) or permutation ...