Search Results for ""

Searching refers to locating a given element or an element satisfying certain conditions from some (usually ordered or partially ordered) table, list, tree, etc.

An orientable surface with one boundary component such that the boundary component of the surface is a given knot K. In 1934, Seifert proved that such a surface can be ...

A point process N is called self-correcting if cov(N(s,t),N(t,u))<0 for s<t<u where here, cov denotes the covariance of the two quantities. Intuitively, a process is ...

A triangle that is equal to its polar triangle with respect to a given conic is said to be self-polar with respect to that conic. Any triangle is self-polar with respect to ...

A "split" extension G of groups N and F which contains a subgroup F^_ isomorphic to F with G=F^_N^_ and F^_ intersection N^_={e} (Ito 1987, p. 710). Then the semidirect ...

A connected graph having e graph edges is said to be sequential if it is possible to label the nodes i with distinct integers f_i in {0,1,2,...,e-1} such that when graph edge ...

The general sextic equation x^6+a_5x^5+a_4x^4+a_3x^3+a_2x^2+a_1x+a_0=0 can be solved in terms of Kampé de Fériet functions, and a restricted class of sextics can be solved in ...

Sigma is the eighteenth letter of the ancient Greek alphabet. As an upper case letter (Sigma), it is used as a symbol for sums and series. As a lower case letter (sigma) it ...

The small dodecahemidodecahedron is the uniform polyhedron with Maeder index 51 (Maeder 1997), Wenninger index 91 (Wenninger 1989), Coxeter index 65 (Coxeter et al. 1954), ...

The Sombor index of a graph is defined as half the sum of the matrix elements of its Sombor matrix.