IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-94-010-0954-6_6.html
   My bibliography  Save this book chapter

Weakly Divisible Nearrings: Genesis, Construction and their Links with Designs

In: Near-Rings and Near-Fields

Author

Listed:
  • A. Benini

    (Università di Brescia, Facoltà di Ingegneria, Dipartimento di Elettronica)

  • F. Morini

    (Università di Brescia, Facoltà di Ingegneria, Dipartimento di Elettronica)

  • S. Pellegrini

    (Università di Brescia, Facoltà di Ingegneria, Dipartimento di Elettronica)

Abstract

A nearring N is weakly divisible (wd-nearring) if, for each x, y ∈ N, there exists an element z ∈ N such that xz = y or yz = x. In the first part the structure of wd-nearrings with ascending or descending chain conditions is studied and wd-nearrings with ascending chain condition on the right annihilators are completely described. In the second part all zerosymmetric wd-nearrings on the group G of integers (mod p n ), p prime, in which pG is the set of all the nilpotent elements are characterised and constructed. At the end the possibility to construct partially balanced block designs from finite wd-nearrings is investigated. Non balanced designs and their related association schemes are derived from wd-nearrings having cyclic additive group G of order 2 n . For wd-nearrings on a cyclic additive group of order p n , p prime and p ≠ 2, an example is given.

Suggested Citation

  • A. Benini & F. Morini & S. Pellegrini, 2001. "Weakly Divisible Nearrings: Genesis, Construction and their Links with Designs," Springer Books, in: Yuen Fong & Carl Maxson & John Meldrum & Günter Pilz & Andries van der Walt & Leon van Wyk (ed.), Near-Rings and Near-Fields, pages 47-71, Springer.
    • Handle: RePEc:spr:sprchp:978-94-010-0954-6_6
    DOI: 10.1007/978-94-010-0954-6_6
    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-010-0954-6_6. 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.