Search arXivSearch

arXiv · 1604.07276

A graphical calculus for semi-groupal categories

Abstract

Around the year 1988, Joyal and Street established a graphical calculus for monoidal categories, which provides a firm foundation for many explorations of graphical notations in mathematics and physics. For a deeper understanding of their work, we consider a similar graphical calculus for semi-groupal categories. We introduce two frameworks to formalize this graphical calculus, a topological one based on the notion of a processive plane graph and a combinatorial one based on the notion of a planarly ordered processive graph, which serves as a combinatorial counterpart of a deformation class of processive plane graphs. We demonstrate the equivalence of Joyal and Street's graphical calculus and the theory of upward planar drawings. We introduce the category of semi-tensor schemes, and give a construction of a free monoidal category on a semi-tensor scheme. We deduce the unit convention as a kind of quotient construction, and show an idea to generalize the unit convention. Finally, we clarify the relation of the unit convention and Joyal and Street's construction of a free monoidal category on a tensor scheme.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sen Hu, Xuexing Lu, Yu Ye. 2018-11-25. A graphical calculus for semi-groupal categories. https://doi.org/10.1007/s10485-018-9549-8

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO