<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://dk.um.si/IzpisGradiva.php?id=49373"><dc:title>Stern polynomials</dc:title><dc:creator>Klavžar,	Sandi	(Avtor)
	</dc:creator><dc:creator>Milutinović,	Uroš	(Avtor)
	</dc:creator><dc:creator>Petr,	Ciril	(Avtor)
	</dc:creator><dc:subject>matematika</dc:subject><dc:subject>Sternovo (dvoatomsko) zaporedje</dc:subject><dc:subject>Sternovi polinomi</dc:subject><dc:subject>hiperbinarna reprezentacija</dc:subject><dc:subject>standardna Grayjeva koda</dc:subject><dc:subject>nesosednja predstavitev</dc:subject><dc:subject>mathematics</dc:subject><dc:subject>Stern (diatomic) sequence</dc:subject><dc:subject>Stern polynomials</dc:subject><dc:subject>hyperbinary representation</dc:subject><dc:subject>standard Gray code</dc:subject><dc:subject>non-adjacent form</dc:subject><dc:subject/><dc:description>Sternovi polinomi ▫$B_k(t)$▫, ▫$k ge 0$▫, ▫$t in RR$▫, so vpeljani na naslednji način: ▫$B_0(t) = 0$▫, ▫$B_1(t) = 1$▫, ▫$B_{2n}(t) = tB_n(t)$▫ in ▫$B_{2n+1}(t) = B_{n+1}(t) + B_n(t)$▫. Pokazano je, da ima ▫$B_n(t)$▫ enostavno eksplicitno reprezentacijo s hiperebinarnimi reprezentacijami ▫$n-1$▫ in da je odvod ▫$B'_{2n-1}(0)$▫ enak številu enic v standardni Grayjevi kodi za ▫$n-1$▫. Dokazano je tudi, da je stopnja polinoma ▫$B_n(t)$▫ enaka razliki med dolžino in težo nesosednje predstavitve števila ▫$n$▫.</dc:description><dc:date>2005</dc:date><dc:date>2015-07-10 12:00:22</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>49373</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
