Path Reconstruction in the Barning–Hall Tree

Research output: Contribution to journalArticlepeer-review


We propose an algorithm for reconstructing a tree path from a root to a primitive Pythagorean triple. The algorithm has polynomial time complexity with respect to the input length relating to the “size” of the primitive Pythagorean triple.

Original languageEnglish
Pages (from-to)72-79
Number of pages8
JournalJournal of Mathematical Sciences (United States)
Issue number1
Publication statusPublished - Oct 2014

Fingerprint Dive into the research topics of 'Path Reconstruction in the Barning–Hall Tree'. Together they form a unique fingerprint.

Cite this