Search Results for ""

A very general theorem that allows the number of discrete combinatorial objects of a given type to be enumerated (counted) as a function of their "order." The most common ...

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

Consider the characteristic equation |lambdaI-A|=lambda^n+b_1lambda^(n-1)+...+b_(n-1)lambda+b_n=0 (1) determining the n eigenvalues lambda of a real n×n square matrix A, ...

There are so many theorems due to Fermat that the term "Fermat's theorem" is best avoided unless augmented by a description of which theorem of Fermat is under discussion. ...

"Stampacchia's theorem" is a name given to any number of related results in functional analysis, and while the body of the theorem often varies depending on the literature ...

R^n is homeomorphic to R^m iff n=m. This theorem was first proved by Brouwer.

The two-dimensional version of the ham sandwich theorem.

The Löwenheim-Skolem theorem is a fundamental result in model theory which states that if a countable theory has a model, then it has a countable model. Furthermore, it has a ...

In the classical quasithin case of the quasithin theorem, if a group G does not have a "strongly embedded" subgroup, then G is a group of Lie-type in characteristic 2 of Lie ...

The q-analog of the binomial theorem (1-z)^n=1-nz+(n(n-1))/(1·2)z^2-(n(n-1)(n-2))/(1·2·3)z^3+... (1) is given by (1-z/(q^n))(1-z/(q^(n-1)))...(1-z/q) ...