TOPICS
Search

Search Results for ""


1511 - 1520 of 1924 for sum over paths FeynmanSearch Results
A cubic number is a figurate number of the form n^3 with n a positive integer. The first few are 1, 8, 27, 64, 125, 216, 343, ... (OEIS A000578). The protagonist Christopher ...
An alkane graph is a tree in which vertices correspond to atoms and edges to carbon-carbon or hydrogen-carbon bonds in a chemical alkane. In chemistry, an alkane is an ...
A bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board). To form the ...
From the point of view of coordinate charts, the notion of tangent space is quite simple. The tangent space consists of all directions, or velocities, a particle can take. In ...
Instead of picking two points from the interior of the cube, instead pick two points on different faces of the unit cube. In this case, the average distance between the ...
Hadjicostas's formula is a generalization of the unit square double integral gamma=int_0^1int_0^1(x-1)/((1-xy)ln(xy))dxdy (1) (Sondow 2003, 2005; Borwein et al. 2004, p. 49), ...
The Jahangir graph J_(n,m) is a kind of generalized wheel graph with consisting of mn circular vertices and a central vertex connected to every mth vertex around the circle. ...
The problem of determining how many nonattacking knights K(n) can be placed on an n×n chessboard. For n=8, the solution is 32 (illustrated above). In general, the solutions ...
Dirac (1952) proved that if the minimum vertex degree delta(G)>=n/2 for a graph G on n>=3 nodes, then G contains a Hamiltonian cycle (Bollobás 1978, Komlós et al. 1996). In ...
A state diagram is a labeled directed graph together with state information that can be used to indicate that certain paths on in a system may be traversed only in a certain ...
1 ... 149|150|151|152|153|154|155 ... 193 Previous Next

...