Search Results for ""

The tribonacci numbers are a generalization of the Fibonacci numbers defined by T_1=1, T_2=1, T_3=2, and the recurrence equation T_n=T_(n-1)+T_(n-2)+T_(n-3) (1) for n>=4 ...

A Turán graph, sometimes called a maximally saturated graph (Zykov 1952, Chao and Novacky 1982), with positive integer parameters n and k is a type of extremal graph on n ...

The nth k-statistic k_n is the unique symmetric unbiased estimator of the cumulant kappa_n of a given statistical distribution, i.e., k_n is defined so that <k_n>=kappa_n, ...

A connected graph G is distance-regular if for any vertices x and y of G and any integers i,j=0, 1, ...d (where d is the graph diameter), the number of vertices at distance i ...

An almost integer is a number that is very close to an integer. Near-solutions to Fermat's last theorem provide a number of high-profile almost integers. In the season 7, ...

There are several closely related results that are variously known as the binomial theorem depending on the source. Even more confusingly a number of these (and other) ...

A branch cut is a curve (with ends possibly open, closed, or half-open) in the complex plane across which an analytic multivalued function is discontinuous. For convenience, ...

The curve a hanging flexible wire or chain assumes when supported at its ends and acted upon by a uniform gravitational force. The word catenary is derived from the Latin ...

Christoffel symbols of the second kind are the second type of tensor-like object derived from a Riemannian metric g which is used to study the geometry of the metric. ...

A (finite, circular) conical surface is a ruled surface created by fixing one end of a line segment at a point (known as the vertex or apex of the cone) and sweeping the ...