IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-94-009-0223-7_2.html
   My bibliography  Save this book chapter

Minimal Center Covering Stars with Respect to LCM in Pascal’s Pyramid and its Generalizations

In: Applications of Fibonacci Numbers

Author

Listed:
  • Shiro Ando
  • Daihachiro Sato

Abstract

Take an entry X inside m-dimensional Pascal’s pyramid consisting of m-nomial coefficients. We call a set of successive r entries starting A on the half line XA a ray of length r with center X, where A is one of the m(m + 1) entries surrounding X, and the union of nonempty set of rays with center X a star with center X. When, in the following, we assume that a star S is translatable in parallel with its center in Pascal’s pyramid, we sometimes use the same word “star” instead of “star configuration” for brevity. For a configuration of two sets of entries U and V in the pyramid, we say that U covers V w.r.t. LCM if the equality LCM U ⋃ V = LCM U always holds independent of the location of U and V as long as they are contained in the pyramid and their relative location is unchanged. We say that a star S is a center covering star w.r.t. LCM if it covers its center in the above sense, and it is minimal if it does not contain any such center covering star with the same center which is a proper subset of S.

Suggested Citation

  • Shiro Ando & Daihachiro Sato, 1996. "Minimal Center Covering Stars with Respect to LCM in Pascal’s Pyramid and its Generalizations," Springer Books, in: Gerald E. Bergum & Andreas N. Philippou & Alwyn F. Horadam (ed.), Applications of Fibonacci Numbers, pages 23-30, Springer.
    • Handle: RePEc:spr:sprchp:978-94-009-0223-7_2
    DOI: 10.1007/978-94-009-0223-7_2
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-94-009-0223-7_2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.