𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Pairing Theorem between a Braided Bialgebra and Its Dual Bialgebra

✍ Scribed by Guo Maozheng; Jiang Lining; Ervin Xunwei Zhao

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
166 KB
Volume
245
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

✦ Synopsis

This paper constructs a dual bialgebra for the FRT-bialgebra related to a Hayashi's one parameter R-matrix by using the skew-derivation method. The natural pairing between them is non-degenerate.

πŸ“œ SIMILAR VOLUMES

Reconstruction in braided categories and
Reconstruction in braided categories and a notion of commutative bialgebra
✍ Martin Neuchl; Peter Schauenburg πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 829 KB

A braided group in the sense of Majid [6] is a Hopf algebra B in a braided monoidal category which satisfies a generalized commutativity condition; this condition is expressed with respect to a certain class of B-comodules. The more obvious condition that B be a commutative algebra in the braided ca

Pairing theorem of graph eigenvalues: It
Pairing theorem of graph eigenvalues: Its new proof and a generalization
✍ Mingzuo Shen πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 148 KB

## Abstract Each undirected graph has its own adjacency matrix, which is real and symmetric. The negative of the adjacency matrix, also real and symmetric, is a well‐defined mathematically elementary concept. By this negative adjacency matrix, the negative of a graph can be defined. Then an orthogo

Analytical relationships between metric
Analytical relationships between metric and centrality measures of a network and its dual
✍ R. Criado; J. Flores; A. GarcΓ­a del Amo; M. Romance πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 843 KB

The centrality and efficiency measures of a network G are strongly related to the respective measures on the dual G ⋆ and the bipartite B(G) associated networks. We show some relationships between the Bonacich centralities c(G), c(G ⋆ ) and c(B(G)) and between the efficiencies E(G) and E(G ⋆ ) and w