Search results for: FIBONACCI NUMBER

• New Proofs of Some Fibonacci Identities

  Publication

  • M. Krzywkowski

  - International Mathematical Forum - Year 2010

  Lucas proved in 1876 several identities for Fibonacci numbers. We give elementary and short proofs of them.

  Full text to download in external service

• Calculation Program Supporting Switched Capacitor DC-DC Charge Pump Design (CP Design Calculator) - PartI: Preface

  Publication

  • M. Makowski
  • P. Maszota

  - Year 2013

  Przedmiot badań i motywy podjęcia pracy. Metoda badawcza. Nota historyczna nt. konwertera Fibonacciego (Fibonacci multiplier) i pompy ładunkowej Makowskiego ("Makowski charge pump"). Przewidywane cele pracy. Podziękowania

  Full text to download in external service

• A Canonical Switched Capacitor DC-DC Converter. A look at how the historical SC synthesis problem is getting solved

  Publication

  • M. Makowski

  - Year 2014

  We reconsider a solution to the historical problem in switched capacitor (SC) DC-DC converter synthesis. Specifically, we retackle the problem of constructing an SC twophase network realizing arbitrary voltage conversion ratio within rational bounds defined. Theoretical foundations are available in our earlier research [3] where a nonconstructive proof of existence was given. We briefly review and comment on known circuit solutions...

  Full text to download in external service

• Development and tuning of irregular divide-and-conquer applications in DAMPVM/DAC

  Publication

  • P. Czarnul

  - Year 2002

  This work presents implementations and tuning experiences with parallel irregular applications developed using the object oriented framework DAM-PVM/DAC. It is implemented on top of DAMPVM and provides automatic partitioning of irregular divide-and-conquer (DAC) applications at runtime and dynamic mapping to processors taking into account their speeds and even loads by other user processes. New implementations of parallel applications...

  Full text to download in external service

• Parity vertex colouring of graphs

  Publication

  • P. Borowiecki
  • K. Budajova
  • S. Jendrol
  • S. Krajci

  - Discussiones Mathematicae Graph Theory - Year 2011

  A parity path in a vertex colouring of a graph is a path along which each colour is used an even number of times. Let Xp(G) be the least number of colours in a proper vertex colouring of G having no parity path. It is proved that for any graph G we have the following tight bounds X(G) <= Xp(G) <=|V(G)|− a(G)+1, where X(G) and a(G) are the chromatic number and the independence number of G, respectively. The bounds are improved for...

  Full text available to download