| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Stern polynomials
Authors:ID Klavžar, Sandi (Author)
ID Milutinović, Uroš (Author)
ID Petr, Ciril (Author)
Files:URL http://www.imfm.si/preprinti/PDF/00994.pdf
 
Language:English
Work type:Not categorized
Organization:PEF - Faculty of Education
Abstract: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$▫.
Keywords:matematika, Sternovo (dvoatomsko) zaporedje, Sternovi polinomi, hiperbinarna reprezentacija, standardna Grayjeva koda, nesosednja predstavitev, mathematics, Stern (diatomic) sequence, Stern polynomials, hyperbinary representation, standard Gray code, non-adjacent form
Year of publishing:2005
Number of pages:str. 1-11
Numbering:Vol. 43, št. 994
PID:20.500.12556/DKUM-49373 New window
ISSN:1318-4865
UDC:511.217
COBISS.SI-ID:13805913 New window
NUK URN:URN:SI:UM:DK:22K1ZGTT
Publication date in DKUM:10.07.2015
Views:1956
Downloads:44
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:Unknown
Title:Sternovi polimomi
Abstract:Stern polynomials ▫$B_k(t)$▫, ▫$k ge 0$▫, ▫$t in RR$▫, are introduced in the following way: ▫$B_0(t) = 0$▫, ▫$B_1(t) = 1$▫, ▫$B_{2n}(t) = tB_n(t)$▫, and ▫$B_{2n+1}(t) = B_{n+1}(t) + B_n(t)$▫. It is shown that ▫$B_n(t)$▫ has a simple explicit representation in terms of the hyperbinary representations of ▫$n-1$▫ and that ▫$B'_{2n-1}(0)$▫ equals the number of 1's in the standard Gray code for ▫$n-1$▫. It is also proved that the degree of ▫$B_n(t)$▫ equals the difference between the length and the weight of the non-adjacent form of ▫$n$▫.


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica