Abstract
We give in a particular case a combinatorial proof of a recent algebraicity result of Kontsevich; the proof uses generalized one-sided and two-sided Dyck words, or equivalently, excursions and bridges. We indicate a noncommutative version of these notions, which could lead to a full proof. We show also a relation with pointed planar maps. Nous donnons, dans un cas particulier, une preuve combinatoire d'un rèsultat rècent d'algèbricitè de Kontsevich; la preuve utilise des mots de Dyck gènèralisès d'un cotè et deux cotès ou de façon èquivalente, excursions et ponts. Nous indiquons une version non-commutative de ces notions, qui pourrait conduire à une preuve complète. Nous montrons aussi une relation avec des cartes planaires pointèes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Discrete Mathematics & Theoretical Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
