Growing Trees and Amoebas’ Replications

Abstract An amoeba is a tree together with instructions how to iteratively grow trees by adding paths of a fixed length $$\ell $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>ℓ</mml:mi> </mml:math> . This paper analyses such a growth process. An amoeba is mortal if all versions of the process are finite, and it is immortal if they are all infinite. We obtain some necessary and some sufficient conditions for mortality. In particular, for growing caterpillars in the case $$\ell =1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>ℓ</mml:mi> <mml:mo>=</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> we characterize mortal amoebas. We discuss variations of the mortality concept, conjecture that some of them are equivalent, and support this conjecture for $$\ell \in \{1,2\}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>ℓ</mml:mi> <mml:mo>∈</mml:mo> <mml:mo>{</mml:mo> <mml:mn>1</mml:mn> <mml:mo>,</mml:mo> <mml:mn>2</mml:mn> <mml:mo>}</mml:mo> </mml:mrow> </mml:math> .