Examples of using This theorem in English and their translations into Russian
{-}
-
Official
-
Colloquial
For n 1 this theorem is classical.
Translational symmetry andthe conservation of momentum are related through this theorem.
This theorem has many important consequences.
The partition resulting from this theorem is known as a Tverberg partition.
This theorem is known as power of a point.
I give different proofs not only because their elegance but also, mainly,because they allow generalize this theorem.
This theorem and its converse have various uses.
Lovász's proof used the Borsuk-Ulam theorem and this theorem retains a prominent role in this new field.
This theorem cannot be derived from Eulers equations.
Branko Grünbaum has called this theorem“the most important and deepest known result on 3-polytopes.”.
This theorem formed the background to Hilbert's sixteenth problem.
Over the years, this theorem has been improved until the following theorem of Émile Borel 1903.
This theorem also has important roles in constructive mathematics and proof theory.
The importance of this theorem is as follows: very little was known about the geometry behind symplectic transformations.
This theorem is proved by using the Nakai criterion and the Riemann-Roch theorem for surfaces.
Kolmogorov used this theorem to define several functions of strings, including complexity, randomness, and information.
This theorem has many equivalent versions and analogs and has been used in the study of fair division problems.
Note that this theorem is easily extended to prove the Japanese theorem for cyclic polygons.
This theorem, which does not need to prove, because every time she is justified in trying to get the right information.
One consequence of this theorem is that every planar graph can be decomposed into an independent set and two induced forests.
In this theorem, he showed that there were limits to what could be proved and disproved within a formal system.
Geometrically speaking, this theorem describes the asymptotic behavior of the cover time of the 3-dimensional simple random walk on the main diagonal 3.
This theorem can be generalized to infinite-dimensional situations related to matrices with infinitely many rows and columns.
This theorem generalizes to projective groups of higher dimensions and gives an important infinite family PSL(n, q) of finite simple groups.
In this theorem, regarded as one of the basic principles of quantum field theory, charge conjugation, parity, and time reversal are applied together.
This theorem completed a long series of studies, begun in 1885. and composed of the classical results of Karl Weierstrass, Karl Runge, J. Walsh, Mikhail Lavrentiev.
This theorem is an important tool in model theory, as it provides a useful method for constructing models of any set of sentences that is finitely consistent.
This theorem states: In a recursive organizational structure any viable system contains, and is contained in, a viable system.
This theorem can be strengthened: any undirected Hamiltonian graph with at least n2/4 edges is either pancyclic or Kn/2,n/2.
This theorem is of great importance in electrostatics, since Maxwell's equations for the electric and magnetic fields in the static case are of exactly this type.