Classification of braids which give rise to interchange

Mathematics – Category Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Previous title: Equivalence of associative structures over a braiding. This journal ready version adds proof details involving

Scientific paper

It is well known that the existence of a braiding in a monoidal category V allows many structures to be built upon that foundation. These include a monoidal 2-category V-Cat of enriched categories and functors over V, a monoidal bicategory V-Mod of enriched categories and modules, a category of operads in V and a 2-fold monoidal category structure on V. We will begin by focusing our exposition on the first and last in this list due to their ability to shed light on a new question. We ask, given a braiding on V, what non-equal structures of a given kind in the list exist which are based upon the braiding. For instance, what non-equal monoidal structures are available on V-Cat, or what non-equal operad structures are available which base their associative structure on the braiding in V. We demonstrate alternative underlying braids that result in an infinite family of associative structures. The external and internal associativity diagrams in the axioms of a 2-fold monoidal category will provide us with several obstructions that can prevent a braid from underlying an associative structure.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Classification of braids which give rise to interchange does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Classification of braids which give rise to interchange, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Classification of braids which give rise to interchange will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-443196

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.