Search Results for ""
711 - 720 of 1848 for Shortest path problemSearch Results
The geodesics in a complete Riemannian metric go on indefinitely, i.e., each geodesic is isometric to the real line. For example, Euclidean space is complete, but the open ...
Let f(z) = z+a_1+a_2z^(-1)+a_3z^(-2)+... (1) = zsum_(n=0)^(infty)a_nz^(-n) (2) = zg(1/z) (3) be a Laurent polynomial with a_0=1. Then the Faber polynomial P_m(f) in f(z) of ...
A group is called a free group if no relation exists between its group generators other than the relationship between an element and its inverse required as one of the ...
If the sampling of an interferogram is modulated at a definite frequency instead of being uniformly sampled, spurious spectral features called "ghosts" are produced (Brault ...
The circumference of a graph is the length of any longest cycle in a graph. Hamiltonian graphs on n>1 vertices therefore have circumference of n. For a cyclic graph, the ...
The complement of a graph G, sometimes called the edge-complement (Gross and Yellen 2006, p. 86), is the graph G^', sometimes denoted G^_ or G^c (e.g., Clark and Entringer ...
An H-space, named after Heinz Hopf, and sometimes also called a Hopf space, is a topological space together with a continuous binary operation mu:X×X->X, such that there ...
A Hajós group is a group for which all factorizations of the form (say) Z_n=A direct sum B have A or B periodic, where the period is a divisor of n. Hajós groups arose after ...
Let Y^X be the set of continuous mappings f:X->Y. Then the topological space Y^X supplied with the compact-open topology is called a mapping space, and if X=I is taken as the ...
The Lyapunov condition, sometimes known as Lyapunov's central limit theorem, states that if the (2+epsilon)th moment (with epsilon>0) exists for a statistical distribution of ...
...
View search results from all Wolfram sites (161941 matches)

