Repository logo
Communities & Collections
All of TUK IR
  • English
  • العربية
  • বাংলা
  • Català
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
New user? Click here to register. Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Kivunge, Benard M"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Results Per Page
  • Sort Options
  • No Thumbnail Available
    Item
    The nonnegative P 0 -matrix completion problem.
    (2003) Choi, Ji Young; Dealba, Luz Maria; Hogben, Leslie; Kivunge, Benard M; Nordstrom, Sandra K; Shedenhelm, Mike
    In this paperthe nonnegative P 0 -matrix completion problem is considered. It is shown that a pattern for 4 × 4 matrices that includes all diagonal positions has nonnegative P 0 - completion if and only if its digraph is complete when it has a 4-cycle. It is also shown that any positionally symmetric pattern that includes all diagonal positions and whose graph is an n -cycle has nonnegative P 0 -completion if and only if n =4.
  • No Thumbnail Available
    Item
    Subloops of sedenions
    (2004) Kivunge, Benard M; Smith, Jonathan D. H
    This note investigates sedenion multiplication from the st andpoint of loop the- ory. New two-sided loops are obtained within the version of t he sedenions introduced by the second author. Conditions are given for the satisfactio n of standard loop-theoretical identities within these loops.

Quick Links

  • TUK Website
  • Library
  • Privacy Policy
  • Access to information Requests

Useful Links

  • Accessibility Statement
  • Takedown Policy

   Haile Selassie Avenue,
P.O. Box 52428 - 00200,
Nairobi
        Phone: +254(020) 2219929,
    3343672
       Email: library@tukenya.ac.ke

The Technical University of Kenya copyright © 2002-2025
Cookie settings | Privacy policy | End User Agreement | Send Feedback