Results 31 to 40 of about 145 (139)

Presenting Finite Posets [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2015
We introduce a monoidal category whose morphisms are finite partial orders, with chosen minimal and maximal elements as source and target respectively.
Samuel Mimram
doaj   +1 more source

Quantization of the Super‐BMS3 Algebra

open access: yesAdvances in Mathematical Physics, Volume 2022, Issue 1, 2022., 2022
In this article, we study quantization of super‐BMS3 algebra W. We quantize W by the Drinfel’d twist quantization technique and obtain a class of noncommutative and noncocommutative Hopf superalgebras.
Yu Yang, Xing Tao Wang, Francesco Toppan
wiley   +1 more source

Weak Hopf Algebra and Its Quiver Representation

open access: yesMathematical Problems in Engineering, Volume 2021, Issue 1, 2021., 2021
This study induced a weak Hopf algebra from the path coalgebra of a weak Hopf quiver. Moreover, it gave a quiver representation of the said algebra which gives rise to the various structures of the so‐called weak Hopf algebra through the quiver. Furthermore, it also showed the canonical representation for each weak Hopf quiver.
Muhammad Naseer Khan   +5 more
wiley   +1 more source

Duality for exotic bialgebras [PDF]

open access: yesJournal of Physics A: Mathematical and General, 2001
25 pages, LaTeX2e, using packages: cite, amsfonts, amsmath ...
Arnaudon, D.   +3 more
openaire   +3 more sources

The Maschke‐Type Theorem and Morita Context for BiHom‐Smash Products

open access: yesAdvances in Mathematical Physics, Volume 2021, Issue 1, 2021., 2021
Let (H, αH, βH, ωH, ψH, SH) be a BiHom‐Hopf algebra and (A, αA, βA) be an (H, αH, βH)‐module BiHom‐algebra. Then, in this paper, we study some properties on the BiHom‐smash product A#H. We construct the Maschke‐type theorem for the BiHom‐smash product A#H and form an associated Morita context AH,AHAA#H,A#HAAH,A#H.
Bingliang Shen   +2 more
wiley   +1 more source

Towards a Minimal Stabilizer ZX-calculus [PDF]

open access: yesLogical Methods in Computer Science, 2020
The stabilizer ZX-calculus is a rigorous graphical language for reasoning about quantum mechanics. The language is sound and complete: one can transform a stabilizer ZX-diagram into another one using the graphical rewrite rules if and only if these two ...
Miriam Backens   +2 more
doaj   +1 more source

Interacting Bialgebras Are Frobenius [PDF]

open access: yes, 2014
Bialgebras and Frobenius algebras are different ways in which monoids and comonoids interact as part of the same theory. Such theories feature in many fields: e.g. quantum computing, compositional semantics of concurrency, network algebra and component-based programming. In this paper we study an important sub-theory of Coecke and Duncan's ZX-calculus,
Filippo Bonchi   +2 more
openaire   +3 more sources

Quasitriangular Structure of Myhill–Nerode Bialgebras

open access: yesAxioms, 2012
In computer science the Myhill–Nerode  Theorem states that a set L of words in a finite alphabet is accepted by a finite automaton if and only if the equivalence relation ∼L, defined  as x ∼L  y if and only if xz ∈ L exactly when yz ∈ L, ∀z, has finite ...
Robert G. Underwood
doaj   +1 more source

Bialgebras overs another bialgebras and quasishuffle double bialgebras

open access: yes, 2022
Quasishuffle Hopf algebras, usually defined on a commutative monoid, can be more generally defined on any associative algebra V. If V is a commutative and cocommutative bialgebra, the associated quasishuffle bialgebra QSh(V) inherits a second coproduct $δ$ of contraction and extraction of words, cointeracting with the deconcatenation coproduct $Δ ...
openaire   +2 more sources

3-Hom–Lie Yang–Baxter Equation and 3-Hom–Lie Bialgebras

open access: yesMathematics, 2022
In this paper, we first introduce the notion of a 3-Hom–Lie bialgebra and give an equivalent description of the 3-Hom–Lie bialgebras, the matched pairs and the Manin triples of 3-Hom–Lie algebras.
Shuangjian Guo   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy