Non-crossing Tree Realizations of Ordered Degree Sequences

DOI10.1007/978-3-662-53826-5_13zbMath1485.03071OpenAlexW2553022497MaRDI QIDQ2964006

Lutz Straßburger, L. Méhats

Publication date: 22 February 2017

Published in: Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016) (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-00649591/file/noncrosstree-17-12-09.pdf

zbMATH Keywords

integer sequencesproof netsCatalan's trianglenon-crossing treesPascal-Catalan-tetrahedron

Mathematics Subject Classification ID

Logic of natural languages (03B65) Categorical logic, topoi (03G30) Structure of proofs (03F07)

Related Items (1)

Non-crossing Tree Realizations of Ordered Degree Sequences

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Nonsymmetric \(^{\ast}\)-autonomous categories
• Linear logic, coherence and dinaturality
• Identities of Rothe-Abel-Schläfli-Hurwitz-type
• The structure of multiplicatives
• Analytic combinatorics of non-crossing configurations
• Enumeration of noncrossing trees on a circle
• A fast algorithm to generate necklaces with fixed content
• Generating Bracelets in Constant Amortized Time
• Non-crossing Tree Realizations of Ordered Degree Sequences
• The Mathematics of Sentence Structure
• Quantales and (noncommutative) linear logic
• A system of interaction and structure
• Proofs from THE BOOK

This page was built for publication: Non-crossing Tree Realizations of Ordered Degree Sequences