Search Results for ""
1791 - 1800 of 3571 for Kirchhoffs Matrix Tree TheoremSearch Results
Wirsing (1974) showed, among other results, that if F_n(x) is the Gauss-Kuzmin distribution, then lim_(n->infty)(F_n(x)-lg(1+x))/((-lambda)^n)=Psi(x), (1) where ...
Let B_t={B_t(omega)/omega in Omega}, t>=0, be one-dimensional Brownian motion. Integration with respect to B_t was defined by Itô (1951). A basic result of the theory is that ...
The H-fractal is a fractal constructed by starting with the line segments corresponding to a capital letter H, then iteratively placing smaller H's centered at the top and ...
There exist a variety of formulas for either producing the nth prime as a function of n or taking on only prime values. However, all such formulas require either extremely ...
For an undirected graph, an unordered pair of nodes that specify a line joining these two nodes are said to form an edge. For a directed graph, the edge is an ordered pair of ...
"Vertex" is a synonym for a node of a graph, i.e., one of the points on which the graph is defined and which may be connected by graph edges. The terms "point," "junction," ...
A Hamiltonian cycle, also called a Hamiltonian circuit, Hamilton cycle, or Hamilton circuit, is a graph cycle (i.e., closed loop) through a graph that visits each node ...
A polynomial is a mathematical expression involving a sum of powers in one or more variables multiplied by coefficients. A polynomial in one variable (i.e., a univariate ...
A helix, sometimes also called a coil, is a curve for which the tangent makes a constant angle with a fixed line. The shortest path between two points on a cylinder (one not ...
A zerofree number n is called right truncatable if n and all numbers obtained by successively removing the rightmost digits are prime. There are exactly 83 right truncatable ...
...
View search results from all Wolfram sites (23804 matches)

