Search Results for ""

Let beta=detB=x^2-ty^2, (1) where B is the Brahmagupta matrix, then det[B(x_1,y_1) B(x_2,y_2)] = det[B(x_1,y_1)]det[B(x_2,y_2)] (2) = beta_1beta_2]. (3)

The Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.

A Brunnian link is a set of n linked loops such that each proper sublink is trivial, so that the removal of any component leaves a set of trivial unlinked unknots. The ...

If bc=bd (mod a) and (b,a)=1 (i.e., a and b are relatively prime), then c=d (mod a).

The cardinal number of any set is lower than the cardinal number of the set of all its subsets. A corollary is that there is no highest aleph (aleph).

The evolute of the cardioid x = cost(1+cost) (1) y = sint(1+cost) (2) is the curve x_e = 2/3a+1/3acostheta(1-costheta) (3) y_e = 1/3asintheta(1-costheta), (4) which is a ...

The radial curve of the catenary x = t (1) y = cosht (2) with radiant point (x_0,y_0) is given by x_r = x_0-coshtsinht (3) y_r = y_0+cosht. (4)

A square matrix is called centrosymmetric if it is symmetric with respect to the center (Muir 1960, p. 19).

A convex set K is centro-symmetric, sometimes also called centrally symmetric, if it has a center p that bisects every chord of K through p.

The locus of the point at which two given circles possess the same circle power is a straight line perpendicular to the line joining the midpoints of the circle and is known ...