Search Results for ""

Let (K,|·|) be a non-Archimedean field. Its valuation ring R is defined to be R={x in K:|x|<=1}. The valuation ring has maximal ideal M={x in K:|x|<1}, and the field R/M is ...

For r and x real, with 0<=arg(sqrt(k^2-tau^2))<pi and 0<=argk<pi, 1/2iint_(-infty)^inftyH_0^((1))(rsqrt(k^2-tau^2))e^(itaux)dtau=(e^(iksqrt(r^2+x^2)))/(sqrt(r^2+x^2)), where ...

Let the n×n matrix A satisfy the conditions of the Perron-Frobenius theorem and the n×n matrix C=c_(ij) satisfy |c_(ij)|<=a_(ij) for i,j=1, 2, ..., n. Then any eigenvalue ...

The dihedral group D_3 is a particular instance of one of the two distinct abstract groups of group order 6. Unlike the cyclic group C_6 (which is Abelian), D_3 is ...

The adjacency matrix, sometimes also called the connection matrix, of a simple labeled graph is a matrix with rows and columns labeled by graph vertices, with a 1 or 0 in ...

There are several definitions of "almost Hamiltonian" in use. As defined by Punnim et al. (2007), an almost Hamiltonian graph is a graph on n nodes having Hamiltonian number ...

The Brocard circle, also known as the seven-point circle, is the circle having the line segment connecting the circumcenter O and symmedian point K of a triangle DeltaABC as ...

A class of complete orientable minimal surfaces of R^3 derived from Enneper's minimal surface. They are named for the mathematicians who found the first two examples in 1982. ...

The circuit rank gamma, also denoted mu (Volkmann 1996, Babić et al. 2002) or beta (White 2001, p. 56) and known as the cycle rank (e.g., White 2001, p. 56), (first) graph ...

The n-double cone graph is the name given in the work to the graphs that geometrically correspond to a double cone obtained by connecting all vertices of two C_n cycle graphs ...