Search Results for ""

Tait's Hamiltonian graph conjecture asserted that every cubic polyhedral graph is Hamiltonian. It was proposed by Tait in 1880 and refuted by Tutte (1946) with a ...

The base-3 method of counting in which only the digits 0, 1, and 2 are used. Ternary numbers arise in a number of problems in mathematics, including some problems of ...

The study of angles and of the angular relationships of planar and three-dimensional figures is known as trigonometry. The trigonometric functions (also called the circular ...

A trinomial coefficient is a coefficient of the trinomial triangle. Following the notation of Andrews (1990), the trinomial coefficient (n; k)_2, with n>=0 and -n<=k<=n, is ...

The truncated tetrahedral graph is the cubic Archimedean graph on 12 nodes and 18 edges that is the skeleton of the truncated tetrahedron. It is implemented in the Wolfram ...

The Tucker circles are a generalization of the cosine circle and first Lemoine circle which can be viewed as a family of circles obtained by parallel displacing sides of the ...

A Turing machine is a theoretical computing machine invented by Alan Turing (1937) to serve as an idealized model for mathematical calculation. A Turing machine consists of a ...

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, ...

The q-analog of the Pochhammer symbol defined by (a;q)_k={product_(j=0)^(k-1)(1-aq^j) if k>0; 1 if k=0; product_(j=1)^(|k|)(1-aq^(-j))^(-1) if k<0; ...

A triangle is a 3-sided polygon sometimes (but not very commonly) called the trigon. Every triangle has three sides and three angles, some of which may be the same. The sides ...