2003/01/31 by Frederic Chapoton, Frédéric Chapoton, Chapoton, Frederic
Computer Science · Engineering · Mathematics · #05C05 Secondary 06C10 #16W30 #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Primary 52C35 #graph theory and CDMA systems #math.CO #msc:05C05 #msc:06C10 #msc:16W30 #msc:52C35
paper · pdf · doi:10.48550/arxiv.math/0301372
16 pages, 3 figures, additional material on the topology of the complement and references added on supersolvable lattices and graphical arrangements
openalex publication_date 2003/01/31 · arxiv created 2003/02/17 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Each labeled rooted tree is associated with a hyperplane arrangement, which is free with exponents given by the depths of the vertices of this tree. The intersection lattices of these arrangements are described through posets of forests. These posets are used to define coalgebras, whose dual algebras are shown to have a simple presentation by generators and relations.