theorem scheme

theorem scheme
мат. теоремная схема

Большой англо-русский и русско-английский словарь. 2001.

Игры ⚽ Поможем написать курсовую

Смотреть что такое "theorem scheme" в других словарях:

  • Theorem of the cube — In mathematics, the theorem of the cube is a foundational result in the algebraic geometry of a complete variety. It was a principle discovered, in the context of linear equivalence, by the Italian school of algebraic geometry. The specific… …   Wikipedia

  • Godunov's theorem — Godunov s theorem, also known as Godunov s order barrier theorem, is a mathematical theorem important in the development of the theory of high resolution schemes for the numerical solution of partial differential equations.Professor Sergei K.… …   Wikipedia

  • Bernoulli scheme — In mathematics, the Bernoulli scheme or Bernoulli shift is a generalization of the Bernoulli process to more than two possible outcomes.[1][2] Bernoulli schemes are important in the study of dynamical systems, as most such systems (such as Axiom… …   Wikipedia

  • Zariski's main theorem — In algebraic geometry, a field in mathematics, Zariski s main theorem, or Zariski s connectedness theorem, is a theorem proved by harvs|txt=yes|last=Zariski|year1=1943|year2=1949 which implies that fibers over normal points of birational… …   Wikipedia

  • Beauville–Laszlo theorem — In mathematics, the Beauville–Laszlo theorem is a result in commutative algebra and algebraic geometry that allows one to glue two sheaves over an infinitesimal neighborhood of a point on an algebraic curve. It was proved by Harvard… …   Wikipedia

  • Grothendieck–Hirzebruch–Riemann–Roch theorem — In mathematics, specifically in algebraic geometry, the Grothendieck–Riemann–Roch theorem is a far reaching result on coherent cohomology. It is a generalisation of the Hirzebruch–Riemann–Roch theorem, about complex manifolds, which is itself a… …   Wikipedia

  • Noisy-channel coding theorem — In information theory, the noisy channel coding theorem (sometimes Shannon s theorem), establishes that for any given degree of noise contamination of a communication channel, it is possible to communicate discrete data (digital information)… …   Wikipedia

  • MUSCL scheme — MUSCL stands for Monotone Upstream centered Schemes for Conservation Laws , and the term was introduced in a seminal paper by Bram van Leer (van Leer, 1979). In this paper he constructed the first high order , total variation diminishing (TVD)… …   Wikipedia

  • Rational root theorem — In algebra, the rational root theorem (or rational root test to find the zeros) states a constraint on solutions (or roots) to the polynomial equation:a nx^n+a {n 1}x^{n 1}+cdots+a 0 = 0,!with integer coefficients.Let a 0 and a n be nonzero.Then… …   Wikipedia

  • Nyquist–Shannon sampling theorem — Fig.1: Hypothetical spectrum of a bandlimited signal as a function of frequency The Nyquist–Shannon sampling theorem, after Harry Nyquist and Claude Shannon, is a fundamental result in the field of information theory, in particular… …   Wikipedia

  • Kleene's recursion theorem — In computability theory, Kleene s recursion theorems are a pair of fundamental results about the application of computable functions to their own descriptions. The theorems were first proved by Stephen Kleene in 1938.This article uses the… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»