Non-crossing Tree Realizations of Ordered Degree Sequences - Archive ouverte HAL Access content directly
Conference Papers Year :

Non-crossing Tree Realizations of Ordered Degree Sequences

(1) , (2)
1
2

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.

Dates and versions

hal-01417567 , version 1 (15-12-2016)

Identifiers

Cite

Laurent Mehats, Lutz Strassburger. 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⟩
148 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More