Search Results for ""

There are several related theorems involving Hamiltonian cycles of graphs that are associated with Pósa. Let G be a simple graph with n graph vertices. 1. If, for every k in ...

The word quadrature has (at least) three incompatible meanings. Integration by quadrature either means solving an integral analytically (i.e., symbolically in terms of known ...

For a real positive t, the Riemann-Siegel Z function is defined by Z(t)=e^(itheta(t))zeta(1/2+it). (1) This function is sometimes also called the Hardy function or Hardy ...

The roots (sometimes also called "zeros") of an equation f(x)=0 are the values of x for which the equation is satisfied. Roots x which belong to certain sets are usually ...

The Schröder number S_n is the number of lattice paths in the Cartesian plane that start at (0, 0), end at (n,n), contain no points above the line y=x, and are composed only ...

A simple directed graph is a directed graph having no multiple edges or graph loops (corresponding to a binary adjacency matrix with 0s on the diagonal). The number of simple ...

The most common "sine integral" is defined as Si(z)=int_0^z(sint)/tdt (1) Si(z) is the function implemented in the Wolfram Language as the function SinIntegral[z]. Si(z) is ...

Smale's problems are a list of 18 challenging problems for the twenty-first century proposed by Field medalist Steven Smale. These problems were inspired in part by Hilbert's ...

Stratton (1935), Chu and Stratton (1941), and Rhodes (1970) define the spheroidal functions as those solutions of the differential equation (1) that remain finite at the ...

The Steiner tree of some subset of the vertices of a graph G is a minimum-weight connected subgraph of G that includes all the vertices. It is always a tree. Steiner trees ...