TOPICS
Search

Search Results for ""


3931 - 3940 of 4142 for Multiply whole numbers and integersSearch Results
A singular point of an algebraic curve is a point where the curve has "nasty" behavior such as a cusp or a point of self-intersection (when the underlying field K is taken as ...
The spherical Bessel function of the first kind, denoted j_nu(z), is defined by j_nu(z)=sqrt(pi/(2z))J_(nu+1/2)(z), (1) where J_nu(z) is a Bessel function of the first kind ...
A split graph is a graph whose vertices can be partitioned into a clique and an independent vertex set. Equivalently, it is a chordal graph whose graph complement is also ...
One or both of the square bracket symbols [ and ] are used in many different contexts in mathematics. 1. Square brackets are occasionally used in especially complex ...
A Steiner quadruple system is a Steiner system S(t=3,k=4,v), where S is a v-set and B is a collection of k-sets of S such that every t-subset of S is contained in exactly one ...
The most common statement known as Steiner's theorem (Casey 1893, p. 329) states that the Pascal lines of the hexagons 123456, 143652, and 163254 formed by interchanging the ...
A subset is a portion of a set. B is a subset of A (written B subset= A) iff every member of B is a member of A. If B is a proper subset of A (i.e., a subset other than the ...
For every even dimension 2n, the symplectic group Sp(2n) is the group of 2n×2n matrices which preserve a nondegenerate antisymmetric bilinear form omega, i.e., a symplectic ...
The tetrahedral group T_d is the point group of symmetries of the tetrahedron including the inversion operation. It is one of the 12 non-Abelian groups of order 24. The ...
A traceable graph is a graph that possesses a Hamiltonian path. Hamiltonian graphs are therefore traceable, but the converse is not necessarily true. Graphs that are not ...
1 ... 391|392|393|394|395|396|397 ... 415 Previous Next

...