TOPICS
Search

Search Results for ""


1821 - 1830 of 1924 for sum over paths FeynmanSearch Results
The "15 puzzle" is a sliding square puzzle commonly (but incorrectly) attributed to Sam Loyd. However, research by Slocum and Sonneveld (2006) has revealed that Sam Loyd did ...
The Fibonacci numbers are the sequence of numbers {F_n}_(n=1)^infty defined by the linear recurrence equation F_n=F_(n-1)+F_(n-2) (1) with F_1=F_2=1. As a result of the ...
The genus gamma(G) of a graph G is the minimum number of handles that must be added to the plane to embed the graph without any crossings. A graph with genus 0 is embeddable ...
A Hadamard matrix is a type of square (-1,1)-matrix invented by Sylvester (1867) under the name of anallagmatic pavement, 26 years before Hadamard (1893) considered them. In ...
The hundred-dollar, hundred-digits challenge problems are a set of ten problems in numerical analysis published in the January/February 2002 issue of SIAM News ...
The Kirchhoff index Kf, also simply called the resistance and denoted R (Lukovits et al. 1999), of a connected graph G on n nodes is defined by ...
The Möbius function is a number theoretic function defined by mu(n)={0 if n has one or more repeated prime factors; 1 if n=1; (-1)^k if n is a product of k distinct primes, ...
A normal distribution in a variate X with mean mu and variance sigma^2 is a statistic distribution with probability density function ...
A polygon can be defined (as illustrated above) as a geometric object "consisting of a number of points (called vertices) and an equal number of line segments (called sides), ...
The quaternions are members of a noncommutative division algebra first invented by William Rowan Hamilton. The idea for quaternions occurred to him while he was walking along ...
1 ... 180|181|182|183|184|185|186 ... 193 Previous Next

...