English

Nonstandard Transfinite Digraphs

Combinatorics 2009-04-28 v1

Abstract

Nonstandard digraphs and transfinite digraphs have been defined and examined in two prior technical reports. The present work examines digraphs that are both nonstandard and transfinite. This requires a combination in certain ways of the techniques used in the prior two works. We first construct herein nonstandard transfinite digraphs for all the natural-number ranks. Then, a special kind of nonstandard transfinite digraph having the "arrow rank" ω\vec{\omega} needs to be constructed. Once this is done, the first limit-ordinal rank ω\omega can be attained. This procedure can be continued on to still higher ranks.

Keywords

Cite

@article{arxiv.0904.4168,
  title  = {Nonstandard Transfinite Digraphs},
  author = {A. H. Zemanian},
  journal= {arXiv preprint arXiv:0904.4168},
  year   = {2009}
}

Comments

10 pages

R2 v1 2026-06-21T12:55:24.204Z