Search Results for ""

A small circle is a spheric section that does not contain a diameter of the sphere (Kern and Bland 1948, p. 87; Tietze 1965, p. 25).

A fundamental structural result in extremal graph theory due to Szemerédi (1978). The regularity lemma essentially says that every graph can be well-approximated by the union ...

A topological space fulfilling the T_2-axiom: i.e., any two points have disjoint neighborhoods. In the terminology of Alexandroff and Hopf (1972), a T_2-space is called a ...

The contraction of a tensor is obtained by setting unlike indices equal and summing according to the Einstein summation convention. Contraction reduces the tensor rank by 2. ...

An example of a subspace of the Euclidean plane that is connected but not pathwise-connected with respect to the relative topology. It is formed by the ray y=0, x<=0 and the ...

A graph is said to be unswitchable if it cannot be reduced to another graph with the same degree sequence by edge-switching. Conversely, a graph that can be reduced to ...

A zero-symmetric graph is a vertex-transitive cubic graph whose edges are partitioned into three orbits by its automorphism group. The figures above show some small ...

An apodization function (also called a tapering function or window function) is a function used to smoothly bring a sampled signal down to zero at the edges of the sampled ...

The Cayley-Purser algorithm is a public-key cryptography algorithm that relies on the fact that matrix multiplication is not commutative. It was devised by Sarah Flannery ...

Clebsch-Gordan coefficients are mathematical symbol used to integrate products of three spherical harmonics. Clebsch-Gordan coefficients commonly arise in applications ...