2014/12/08 by Yury Kochetkov, Kochetkov, Yury
Mathematics · #Advanced Combinatorial Mathematics #Algebraic Geometry and Number Theory #Combinatorics (math.CO) #Commutative Algebra and Its Applications #FOS: Mathematics #math.CO
paper · pdf · doi:10.48550/arxiv.1412.2472
10 pages
arxiv created 2014/12/08 · openalex publication_date 2014/12/08 · arxiv updated 2014/12/09 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
A type is the set of all pairwise nonisotopic binary trees with the same passport. A type is called decomposable, if it is a union of several Galois orbits. In this work we present the list of all passports of plane binary trees with ten edges and the list of all Galois orbits.