Do you want to publish a course? Click here

Higher Arity Self-Distributive Operations in Cascades and their Cohomology

308   0   0.0 ( 0 )
 Added by Mohamed Elhamdadi
 Publication date 2019
  fields
and research's language is English




Ask ChatGPT about the research

We investigate constructions of higher arity self-distributive operations, and give relations between cohomology groups corresponding to operations of different arities. For this purpose we introduce the notion of mutually distributive $n$-ary operations generalizing those for the binary case, and define a cohomology theory labeled by these operations. A geometric interpretation in terms of framed links is described, with the scope of providing algebraic background of constructing $2$-cocycles for framed link invariants. This theory is also studied in the context of symmetric monoidal categories. Examples from Lie algebras, coalgebras and Hopf algebras are given.



rate research

Read More

Heaps are para-associative ternary operations bijectively exemplified by groups via the operation $(x,y,z) mapsto x y^{-1} z$. They are also ternary self-distributive, and have a diagrammatic interpretation in terms of framed links. Motivated by these properties, we define para-associative and heap cohomology theories and also a ternary self-distributive cohomology theory with abelian heap coefficients. We show that one of the heap cohomologies is related to group cohomology via a long exact sequence. Moreover we construct maps between second cohomology groups of normalized group cohomology and heap cohomology, and show that the latter injects into the ternary self-distributive second cohomology group. We proceed to study heap objects in symmetric monoidal categories providing a characterization of pointed heaps as involutory Hopf monoids in the given category. Finally we prove that heap objects are also categorically self-distributive in an appropriate sense.
140 - Emanuele Zappala 2021
The ribbon cocycle invariant is defined by means of a partition function using ternary cohomology of self-distributive structures (TSD) and colorings of ribbon diagrams of a framed link, following the same paradigm introduced by Carter, Jelsovsky, Kamada, Langfor and Saito in Transactions of the American Mathematical Society 2003;355(10):3947-89, for the quandle cocycle invariant. In this article we show that the ribbon cocycle invariant is a quantum invariant. We do so by constructing a ribbon category from a TSD set whose twisting and braiding morphisms entail a given TSD $2$-cocycle. Then we show that the quantum invariant naturally associated to this braided category coincides with the cocycle invariant. We generalize this construction to symmetric monoidal categories and provide classes of examples obtained from Hopf monoids and Lie algebras. We further introduce examples from Hopf-Frobenius algebras, objects studied in quantum computing.
We explain how higher homotopy operations, defined topologically, may be identified under mild assumptions with (the last of) the Dwyer-Kan-Smith cohomological obstructions to rectifying homotopy-commutative diagrams.
115 - P. Hu , I. Kriz , A. A. Voronov 2003
Let an n-algebra mean an algebra over the chain complex of the little n-cubes operad. We give a proof of Kontsevichs conjecture, which states that for a suitable notion of Hochschild cohomology in the category of n-algebras, the Hochschild cohomology complex of an n-algebra is an (n+1)-algebra. This generalizes a conjecture by Deligne for n=1, now proven by several authors.
We introduce shadow structures for singular knot theory. Precisely, we define emph{two} invariants of singular knots and links. First, we introduce a notion of action of a singquandle on a set to define a shadow counting invariant of singular links which generalize the classical shadow colorings of knots by quandles. We then define a shadow polynomial invariant for shadow structures. Lastly, we enhance the shadow counting invariant by combining both the shadow counting invariant and the shadow polynomial invariant. Explicit examples of computations are given.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا