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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n6https://global.dbpedia.org/id/
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Marko_Petkovšek
dbo:wikiPageWikiLink
dbr:Petkovšek's_algorithm
Subject Item
dbr:Gosper's_algorithm
dbo:wikiPageWikiLink
dbr:Petkovšek's_algorithm
Subject Item
dbr:Recurrence_relation
dbo:wikiPageWikiLink
dbr:Petkovšek's_algorithm
Subject Item
dbr:Petkovsek's_algorithm
dbo:wikiPageWikiLink
dbr:Petkovšek's_algorithm
dbo:wikiPageRedirects
dbr:Petkovšek's_algorithm
Subject Item
dbr:Polynomial_solutions_of_P-recursive_equations
dbo:wikiPageWikiLink
dbr:Petkovšek's_algorithm
Subject Item
dbr:P-recursive_equation
dbo:wikiPageWikiLink
dbr:Petkovšek's_algorithm
Subject Item
dbr:Petkovšek's_algorithm
rdf:type
dbo:Software
rdfs:label
Petkovšek's algorithm
rdfs:comment
Petkovšek's algorithm (also Hyper) is a computer algebra algorithm that computes a basis of hypergeometric terms solution of its input linear recurrence equation with polynomial coefficients. Equivalently, it computes a first order right factor of linear difference operators with polynomial coefficients. This algorithm was developed by Marko Petkovšek in his PhD-thesis 1992. The algorithm is implemented in all the major computer algebra systems.
dcterms:subject
dbc:Combinatorics
dbo:wikiPageID
39388567
dbo:wikiPageRevisionID
1044095896
dbo:wikiPageWikiLink
dbr:Computer_algebra dbc:Combinatorics dbr:Algebraic_equation dbr:Ring_of_polynomial_functions dbr:Roger_Apéry dbr:Rational_function dbr:Generalized_permutation_matrix dbr:Doron_Zeilberger dbr:Characteristic_(algebra) dbr:Marko_Petkovšek dbr:Difference_operator dbr:Gosper's_algorithm dbr:Polynomial_solutions_of_P-recursive_equations dbr:P-recursive_equation dbr:Hypergeometric_identity dbr:Field_(mathematics)
owl:sameAs
wikidata:Q16896735 n6:epN5 freebase:m.0vpv_gc
dbo:abstract
Petkovšek's algorithm (also Hyper) is a computer algebra algorithm that computes a basis of hypergeometric terms solution of its input linear recurrence equation with polynomial coefficients. Equivalently, it computes a first order right factor of linear difference operators with polynomial coefficients. This algorithm was developed by Marko Petkovšek in his PhD-thesis 1992. The algorithm is implemented in all the major computer algebra systems.
gold:hypernym
dbr:Algorithm
prov:wasDerivedFrom
wikipedia-en:Petkovšek's_algorithm?oldid=1044095896&ns=0
dbo:wikiPageLength
8672
foaf:isPrimaryTopicOf
wikipedia-en:Petkovšek's_algorithm
Subject Item
wikipedia-en:Petkovšek's_algorithm
foaf:primaryTopic
dbr:Petkovšek's_algorithm