View source for Unitree

==English==

===Noun===
{{en-noun}}

# {{lb|en|maths}} A [[unique]] [[tree]] (for a set of vertices)
#* {{quote-journal|en|year=2015|date=|author=Fedor Pakovich; Alexander K. Zvonkin|title=Minimum Degree of the Difference of Two Polynomials over <math>\mathbb Q</math>. Part II: Davenport-Zannier pairs|journal=arXiv|url=http://arxiv.org/abs/1509.07973|doi=|volume=|issue=|pages=
|passage=When such a tree is uniquely determined by the set of black and white degrees of its vertices, it is called '''unitree''', and the corresponding DZ-pair is defined over <math>\mathbb Q</math>. }}

===Anagrams===
* {{anagrams|en|a=eeinrtu|neurite|retinue|reunite|uterine}}