Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 105 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 45 tok/s
GPT-5 High 34 tok/s Pro
GPT-4o 108 tok/s
GPT OSS 120B 473 tok/s Pro
Kimi K2 218 tok/s Pro
2000 character limit reached

$S_3$-permuted Frobenius Algebras (1103.5113v1)

Published 26 Mar 2011 in math.RA and math.CT

Abstract: In the present paper by Frobenius algebra Y we mean a finite dimensional algebra possessing an associative and invertible (nondegenerate) form a scalar product, referred to as the Frobenius structure. The nondegenerate form has an inverse. We drop the extra conditions of associativity and unitality of Y. Frobenius algebra is formulated within the monoidal abelian category of operad of graphs cat(m,n). Operad of graphs, i.e. diagrammatic language, is used both to illustrate the construction as well as a method of proof for the main Theorem. We give two detailed examples of this construction for Clifford algebras. Our construction, however, applies to all Frobenius algebras.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube