IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4612-0163-2_4.html
   My bibliography  Save this book chapter

Permissive Transfinite Networks

In: Pristine Transfinite Graphs and Permissive Electrical Networks

Author

Listed:
  • Armen H. Zemanian

    (University at Stony Brook, Electrical Engineering Department)

Abstract

The transfinite graphs constructed in Chapter 2 and examined in Chapter 3 were quite arbitrary in the sense that the choices of which ρ-tips would comprise which (ρ + l)-nodes were not restricted in any way. With regard to transfinite electrical networks, those choices need not reflect the ways in which currents can or cannot flow. Consider, for example, the one-way infinite ladder within the network of Figure 4.1 driven at its input by a 1 V source and having at its infinite extremity two 1-nodes, $$ n_2^1 $$ and $$ n_2^1 $$ containing, respectively, the 0-tips of the one-ended paths along its upper and lower horizontal branches. Let all of the ladder’s horizontal resistances be 1 Ω. Let the vertical resistances be arbitrary. Also, another resistor, R, is connected to those 1-nodes in a pristine way (i.e., through two extraction paths of shorts — see Section 1.4). The infinite total resistance of the horizontal resistors of the ladder prevents current from flowing through the 1-nodes and thereby through R; we restate this by saying that the 0-tips of those two horizontal one-ended paths of the ladder are “nonpermissive.” Thus, this choice of nonsingleton 1-nodes is pointless so far as the transmission of electricity is concerned.

Suggested Citation

  • Armen H. Zemanian, 2001. "Permissive Transfinite Networks," Springer Books, in: Pristine Transfinite Graphs and Permissive Electrical Networks, chapter 4, pages 53-80, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4612-0163-2_4
    DOI: 10.1007/978-1-4612-0163-2_4
    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-1-4612-0163-2_4. 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.