A canonical tree-of-tangles theorem for structurally submodular separation systems

نویسندگان

چکیده

Author(s): Elbracht, Christian; Kneip, Jakob | Abstract: We show that every structurally submodular separation system admits a canonical tree set which distinguishes its tangles.Mathematics Subject Classifications: 05C40, 05C83, 06A07

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Canonical decompositions of symmetric submodular systems

Let E be a finite set, R be the set of real numbers and f:2E-+R be a symmetric submodular function. The pair (E,f) is called a symmetric submodular system. We examine the structures of symmetric submodular systems and provide a decomposition theory of symmetric submodular systems. The theory is a generalization of the decomposition theory of 2-connected graphs developed by Tutte and can be appl...

متن کامل

Decorated Tangles and Canonical Bases

We study the combinatorics of fully commutative elements in Coxeter groups of type H n for any n > 2. Using the results, we construct certain canonical bases for non-simply-laced generalized Temperley{Lieb algebras and show how to relate them to morphisms in the category of decorated tangles.

متن کامل

A ug 2 00 1 DECORATED TANGLES AND CANONICAL BASES

We study the combinatorics of fully commutative elements in Coxeter groups of type H n for any n > 2. Using the results, we construct certain canonical bases for non-simply-laced generalized Temperley–Lieb algebras and show how to relate them to morphisms in the category of decorated tangles.

متن کامل

A canonical partition theorem for trees

We show that for every positive integer d, every downwards closed subtree T of d without terminal nodes and every finite weakly embedded subtree A of T there is a finite list of equivalence relations on Em(T ) with the property that for every other equivalence relation E on Em(T ) there is a strongly embedded subtree S ⊆ T of height ω, such that E Em(S) is equal to one of the equivalence relati...

متن کامل

A Tree Theorem for Inflation

It is shown that the generating function for tree graphs in the " in-in " formalism may be calculated by solving the classical equations of motion subject to certain constraints. This theorem is illustrated by application to the evolution of a single inflaton field in a Robertson–Walker background.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Combinatorial theory

سال: 2021

ISSN: ['2766-1334']

DOI: https://doi.org/10.5070/c61055362