This HTML5 document contains 41 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dbpedia-dehttp://de.dbpedia.org/resource/
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n22https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
dbpedia-fahttp://fa.dbpedia.org/resource/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
dbpedia-arhttp://ar.dbpedia.org/resource/
owlhttp://www.w3.org/2002/07/owl#
dbpedia-ithttp://it.dbpedia.org/resource/
wikipedia-enhttp://en.wikipedia.org/wiki/
dbpedia-mkhttp://mk.dbpedia.org/resource/
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/
n4http://www.scottaaronson.com/talks/

Statements

Subject Item
dbr:Markov_brothers'_inequality
rdfs:label
Markov brothers' inequality Markow-Ungleichung (Analysis) Disuguaglianza dei fratelli Markov تباين الأخوين ماركوف
rdfs:comment
In teoria della probabilità e statistica, la disuguaglianza dei fratelli Markov è una diseguaglianza dimostrata da Andrej Markov jr. per e da suo fratello per . Essa afferma quanto segue. Se è un polinomio di grado , allora L'uguaglianza è soddisfatta dai polinomi di Chebyshev di prima specie. In mathematics, the Markov brothers' inequality is an inequality proved in the 1890s by brothers Andrey Markov and Vladimir Markov, two Russian mathematicians. This inequality bounds the maximum of the derivatives of a polynomial on an interval in terms of the maximum of the polynomial. For k = 1 it was proved by Andrey Markov, and for k = 2,3,... by his brother Vladimir Markov. Die Markow-Ungleichungen – benannt nach den russischen Mathematikern Andrei und Wladimir Markow – geben eine obere Schranke für die Ableitung von Polynomen in dem abgeschlossenen reellen Intervall [−1,+1] an. Sie werden in der Approximationstheorie gebraucht. Gelegentlich werden diese Ungleichungen auch als Markow-brothers' Ungleichungen bezeichnet. في الرياضيات ، تباين الأخوين ماركوف هو تباين مثبت من قبل عالم الرياضيات الروسي آندريه ماركوف للجزء و من قبل أخيه الأصغر فلاديمير ماركوف للجزء .
dcterms:subject
dbc:Theorems_in_analysis dbc:Inequalities
dbo:wikiPageID
9318403
dbo:wikiPageRevisionID
1101283969
dbo:wikiPageWikiLink
dbr:Vladimir_Andreevich_Markov dbr:Mathematics dbr:Andrey_Markov dbr:Derivative dbr:Remez_inequality dbr:Chebyshev_polynomials dbc:Theorems_in_analysis dbc:Inequalities dbr:Inequality_(mathematics) dbr:Computational_complexity_theory dbr:Bernstein's_inequality_(mathematical_analysis)
dbo:wikiPageExternalLink
n4:polymeth.ppt
owl:sameAs
dbpedia-mk:Неравенство_на_браќата_Маркови wikidata:Q176674 freebase:m.0284cpd dbpedia-ar:تباين_الأخوين_ماركوف dbpedia-it:Disuguaglianza_dei_fratelli_Markov dbpedia-fa:نابرابری_برادران_مارکوف dbpedia-de:Markow-Ungleichung_(Analysis) n22:iXLX
dbp:wikiPageUsesTemplate
dbt:Reflist
dbo:abstract
في الرياضيات ، تباين الأخوين ماركوف هو تباين مثبت من قبل عالم الرياضيات الروسي آندريه ماركوف للجزء و من قبل أخيه الأصغر فلاديمير ماركوف للجزء . In mathematics, the Markov brothers' inequality is an inequality proved in the 1890s by brothers Andrey Markov and Vladimir Markov, two Russian mathematicians. This inequality bounds the maximum of the derivatives of a polynomial on an interval in terms of the maximum of the polynomial. For k = 1 it was proved by Andrey Markov, and for k = 2,3,... by his brother Vladimir Markov. Die Markow-Ungleichungen – benannt nach den russischen Mathematikern Andrei und Wladimir Markow – geben eine obere Schranke für die Ableitung von Polynomen in dem abgeschlossenen reellen Intervall [−1,+1] an. Sie werden in der Approximationstheorie gebraucht. Gelegentlich werden diese Ungleichungen auch als Markow-brothers' Ungleichungen bezeichnet. In teoria della probabilità e statistica, la disuguaglianza dei fratelli Markov è una diseguaglianza dimostrata da Andrej Markov jr. per e da suo fratello per . Essa afferma quanto segue. Se è un polinomio di grado , allora L'uguaglianza è soddisfatta dai polinomi di Chebyshev di prima specie.
gold:hypernym
dbr:Inequality
prov:wasDerivedFrom
wikipedia-en:Markov_brothers'_inequality?oldid=1101283969&ns=0
dbo:wikiPageLength
2186
foaf:isPrimaryTopicOf
wikipedia-en:Markov_brothers'_inequality