Non-crossing Tree Realizations of Ordered Degree Sequences

DOI10.1007/978-3-662-53826-5_13zbMATH Open1485.03071OpenAlexW2553022497MaRDI QIDQ2964006FDOQ2964006

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

proof netsinteger sequencesCatalan's trianglenon-crossing treesPascal-Catalan-tetrahedron

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Title not available (Why is that?)
• Non-Nesting Actions On Real Trees
• Non-crossing Tree Realizations of Ordered Degree Sequences

Uses Software

• OEIS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2964006)