Skip to Main content Skip to Navigation
Conference papers

Non-crossing Tree Realizations of Ordered Degree Sequences

Laurent Mehats 1 Lutz Straßburger 2
1 Collège de Guinette [Etampes]
2 PARSIFAL - Proof search and reasoning with logic specifications
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
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.
Keywords : Pascal-Catalan-tetrahedron Catalan’s triangle Integer sequences Non-crossing trees Proof nets
Document type :
Conference papers
Complete list of metadata
https://hal.inria.fr/hal-01417567
Contributor : Lutz Straßburger Connect in order to contact the contributor
Submitted on : Thursday, December 15, 2016 - 5:03:31 PM
Last modification on : Thursday, January 20, 2022 - 5:27:44 PM

Links full text

openaccess

Identifiers

Collections

CNRS | X | LIX | INRIA | X-LIX | X-DEP-INFO | GS-COMPUTER-SCIENCE

Citation

Laurent Mehats, Lutz Straßburger. Non-crossing Tree Realizations of Ordered Degree Sequences. LACL 2016 - 9th International Conference Logical Aspects of Computational Linguistics - Celebrating 20 Years of LACL (1996–2016), Dec 2016, Nancy, France. ⟨10.1007/978-3-662-53826-5_13⟩. ⟨hal-01417567⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Les métriques sont temporairement indisponibles

 

Contact                    Legal Notice                    Personal Data