Non-crossing tree realizations of ordered degree sequences

Laurent Méhats; Lutz Straßburger

doi:10.1007/978-3-662-53826-5_13

Non-crossing tree realizations of ordered degree sequences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	Logical Aspects of Computational Linguistics
Subtitle of host publication	Celebrating 20 Years of LACL (1996–2016) - 9th International Conference, LACL 2016, Proceedings
Editors	Christian Retoré, Maxime Amblard, Philippe de Groote, Sylvain Pogodalla
Publisher	Springer Verlag
Pages	211-227
Number of pages	17
ISBN (Print)	9783662538258
DOIs	https://doi.org/10.1007/978-3-662-53826-5_13
Publication status	Published - 1 Jan 2016
Externally published	Yes
Event	9th International Conference on Logical Aspects of Computational Linguistics, LACL 2016 - Nancy, France Duration: 5 Dec 2016 → 7 Dec 2016

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	10054 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	9th International Conference on Logical Aspects of Computational Linguistics, LACL 2016
Country/Territory	France
City	Nancy
Period	5/12/16 → 7/12/16

Keywords

Catalan’s triangle
Integer sequences
Non-crossing trees
Pascal-Catalan-tetrahedron
Proof nets

Access to Document

10.1007/978-3-662-53826-5_13

Cite this

Méhats, L., & Straßburger, L. (2016). Non-crossing tree realizations of ordered degree sequences. In C. Retoré, M. Amblard, P. de Groote, & S. Pogodalla (Eds.), Logical Aspects of Computational Linguistics: Celebrating 20 Years of LACL (1996–2016) - 9th International Conference, LACL 2016, Proceedings (pp. 211-227). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10054 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-662-53826-5_13

Méhats, Laurent ; Straßburger, Lutz. / Non-crossing tree realizations of ordered degree sequences. Logical Aspects of Computational Linguistics: Celebrating 20 Years of LACL (1996–2016) - 9th International Conference, LACL 2016, Proceedings. editor / Christian Retoré ; Maxime Amblard ; Philippe de Groote ; Sylvain Pogodalla. Springer Verlag, 2016. pp. 211-227 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{8c0e1de4db134b58859e1439b21fd718,

title = "Non-crossing tree realizations of ordered degree sequences",

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{\textquoteright}s triangle and the Catalan numbers. This work is motivated by the study of ambiguities in categorial grammars.",

keywords = "Catalan{\textquoteright}s triangle, Integer sequences, Non-crossing trees, Pascal-Catalan-tetrahedron, Proof nets",

author = "Laurent M{\'e}hats and Lutz Stra{\ss}burger",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag GmbH Germany 2016.; 9th International Conference on Logical Aspects of Computational Linguistics, LACL 2016 ; Conference date: 05-12-2016 Through 07-12-2016",

year = "2016",

month = jan,

day = "1",

doi = "10.1007/978-3-662-53826-5\_13",

language = "English",

isbn = "9783662538258",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "211--227",

editor = "Christian Retor{\'e} and Maxime Amblard and \{de Groote\}, Philippe and Sylvain Pogodalla",

booktitle = "Logical Aspects of Computational Linguistics",

}

Méhats, L & Straßburger, L 2016, Non-crossing tree realizations of ordered degree sequences. in C Retoré, M Amblard, P de Groote & S Pogodalla (eds), Logical Aspects of Computational Linguistics: Celebrating 20 Years of LACL (1996–2016) - 9th International Conference, LACL 2016, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10054 LNCS, Springer Verlag, pp. 211-227, 9th International Conference on Logical Aspects of Computational Linguistics, LACL 2016, Nancy, France, 5/12/16. https://doi.org/10.1007/978-3-662-53826-5_13

Non-crossing tree realizations of ordered degree sequences. / Méhats, Laurent; Straßburger, Lutz.
Logical Aspects of Computational Linguistics: Celebrating 20 Years of LACL (1996–2016) - 9th International Conference, LACL 2016, Proceedings. ed. / Christian Retoré; Maxime Amblard; Philippe de Groote; Sylvain Pogodalla. Springer Verlag, 2016. p. 211-227 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10054 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Non-crossing tree realizations of ordered degree sequences

AU - Méhats, Laurent

AU - Straßburger, Lutz

N1 - Publisher Copyright: © Springer-Verlag GmbH Germany 2016.

PY - 2016/1/1

Y1 - 2016/1/1

N2 - 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.

AB - 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.

KW - Catalan’s triangle

KW - Integer sequences

KW - Non-crossing trees

KW - Pascal-Catalan-tetrahedron

KW - Proof nets

U2 - 10.1007/978-3-662-53826-5_13

DO - 10.1007/978-3-662-53826-5_13

M3 - Conference contribution

AN - SCOPUS:85005943316

SN - 9783662538258

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 211

EP - 227

BT - Logical Aspects of Computational Linguistics

A2 - Retoré, Christian

A2 - Amblard, Maxime

A2 - de Groote, Philippe

A2 - Pogodalla, Sylvain

PB - Springer Verlag

T2 - 9th International Conference on Logical Aspects of Computational Linguistics, LACL 2016

Y2 - 5 December 2016 through 7 December 2016

ER -

Méhats L, Straßburger L. Non-crossing tree realizations of ordered degree sequences. In Retoré C, Amblard M, de Groote P, Pogodalla S, editors, Logical Aspects of Computational Linguistics: Celebrating 20 Years of LACL (1996–2016) - 9th International Conference, LACL 2016, Proceedings. Springer Verlag. 2016. p. 211-227. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-662-53826-5_13

Non-crossing tree realizations of ordered degree sequences

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this