Search Results for ""
3551 - 3560 of 13134 for Extremal graph theorySearch Results
The von Staudt-Clausen theorem, sometimes also known as the Staudt-Clausen theorem (Carlitz 1968), states that B_(2n)=A_n-sum_(p_k; (p_k-1)|2n)1/(p_k), (1) where B_(2n) is a ...
A term in social choice theory meaning invariance of a result under permutation of voters.
The group of classes of finite dimensional central simple algebras over k with respect to a certain equivalence.
A type of maximal Abelian subgroup.
Two open manifolds M and M^' are cobordant if there exists a manifold with boundary W^(n+1) such that an acceptable restrictive relationship holds.
A diffeomorphism is a map between manifolds which is differentiable and has a differentiable inverse.
Distinguish between smooth manifolds in four dimensions.
An algorithm for computing an Egyptian fraction.
A problem in the theory of algebraic invariants that was solved by Hilbert using an existence proof.
A metric characterizing the difference between two knots K and K^' in S^3.
...
View search results from all Wolfram sites (34319 matches)

