Non-crossing Tree Realizations of Ordered Degree Sequences

Laurent Mehats 1 Lutz Straßburger 2
2 PARSIFAL - Proof search and reasoning with logic specifications
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR7161
Abstract : We investigate the enumeration of non-crossing tree realizations of integer sequences, and we consider a special case in four parameters, that can be seen as a four-dimensional tetrahedron that generalizes Pascal’s triangle and the Catalan numbers. This work is motivated by the study of ambiguities in categorial grammars.
Type de document :
Communication dans un congrès
Maxime Amblard; Philippe de Groote; Sylvain Pogodalla ; Christian Retoré LACL 2016 - 9th International Conference Logical Aspects of Computational Linguistics - Celebrating 20 Years of LACL (1996–2016), Dec 2016, Nancy, France. Springer, 10054, LNCS - Lecture Notes in Computer Science. 〈http://lacl.gforge.inria.fr/lacl-2016/〉. 〈10.1007/978-3-662-53826-5_13〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01417567
Contributeur : Lutz Straßburger <>
Soumis le : jeudi 15 décembre 2016 - 17:03:31
Dernière modification le : jeudi 10 mai 2018 - 02:06:56

Identifiants

Citation

Laurent Mehats, Lutz Straßburger. Non-crossing Tree Realizations of Ordered Degree Sequences. Maxime Amblard; Philippe de Groote; Sylvain Pogodalla ; Christian Retoré LACL 2016 - 9th International Conference Logical Aspects of Computational Linguistics - Celebrating 20 Years of LACL (1996–2016), Dec 2016, Nancy, France. Springer, 10054, LNCS - Lecture Notes in Computer Science. 〈http://lacl.gforge.inria.fr/lacl-2016/〉. 〈10.1007/978-3-662-53826-5_13〉. 〈hal-01417567〉

Partager

Métriques

Consultations de la notice

210