PostScript Algorithms for Indecomposable Continua (Atoms) and Hereditarily Indecomposable Continua Construction

Ivan A. Kovalew \& Dmitry W. Serow

St. Petersburg State Polytechnic University, Russia

It is clear that an indecomposable continuum contains only irreducible points. The algorithmic hereditary problem for indecomposable continua is solving. The construction of hereditarily indecomposable continua delivers some difficulties: $n$-tree hereditary realization defines the topologic tipe of continuum.