[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Log in

A Graphical Calculus for Semi-Groupal Categories

  • Published:
Applied Categorical Structures Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Archdeacon, D.: Topological graph theory: a survey. Congr. Numerantium 115, 5–54 (1996)

    MathSciNet  MATH  Google Scholar 

  2. Baez, J.C., Stay, M.: Physics, topology, logic and computation: a Rosetta Stone. In: Coecke, B. (ed.) New Structures for Physics. Lecture Notes in Physics, vol. 813. Springer, Berlin (2010)

    Google Scholar 

  3. Baker, K.A., Fishburn, P., Roberts, F.S.: Partial orders of dimension \(2\). Networks 2, 11–28 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  4. Burroni, A.: Higher-dimensional word problems with applications to equational logic. Theor. Comput. Sci. 115(1), 43–62 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  5. de Fraysseix, H., de Mendez, P.O.: Planarity and edge poset dimension. Eur. J. Comb. 17(8), 731–740 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  6. Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theor. Comput. Sci. 61(2–3), 175–198 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  7. Drensky, V., Formanek, E.: Polynomial Identity Rings. Advanced Courses in Mathematics. CRM Barcelona. Birkhäuser Verlag, Basel (2004)

    MATH  Google Scholar 

  8. Garg, A., Tamassia, R.: Upward planarity testing. Order 12(2), 109–133 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  9. Joyal, A., Street, R.: Planar diagrams and tensor algebra. Unpublished manuscript (1988)

  10. Joyal, A., Street, R.: The geometry of tensor calculus I. Adv. Math. 88(1), 55–112 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kelly, D.: Fundamentals of planar ordered sets. Discrete Math. 63(2), 197–216 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  12. Lempel, A., Even, S., Cederbaum, I.: A algorithm for planarity testing of graphs. In: International Symposium on Theory of Graphs, pp. 215–232 (1966)

  13. Lu, X., Ye, Y.: Combinatorial characterization of upward planarity (to appear in Communications in Mathematics and Statistics) arXiv:1608.07255

  14. Power, A.J.: A \(2\)-categorical pasting theorem. J. Algebra 129, 439–445 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  15. Selinger, P.: A survey of graphical languages for monoidal categories. In: New Structures for Physics, Lecture Notes in Physics, Springer, vol. 813, pp. 289–355 (2011)

  16. Street, R.: Limits indexed by category-valued \(2\)-functors. J. Pure Appl. Algebra 8, 149–181 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  17. Street, R.: Monoidal categories in, and linking, geometry and algebra. Bull. Belg. Math. Soc. Simon Stevin 19(5), 769–820 (2012)

    MathSciNet  MATH  Google Scholar 

  18. Wingfield, C.: Graphical foundations for dialogue games. Ph.D. thesis (2013)

Download references

Acknowledgements

Xuexing Lu would like to thank Ross Street for comments and encouragement and for John Power for encouragement and a lot of concrete advice for improving this paper. He also would like to thank Maurizio Patrignani for careful check of the proofs in an earlier version of this paper. He also thanks Jinsong Wu for reminding him to change the terminologies and pointing out some mistakes in an earlier version of this paper. This work is partly supported by the National Scientific Foundation of China Nos. 11431010 and 11571329 and “the Fundamental Research Funds for the Central Universities”.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xuexing Lu.

Additional information

Ross Street.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lu, X., Ye, Y. & Hu, S. A Graphical Calculus for Semi-Groupal Categories. Appl Categor Struct 27, 163–197 (2019). https://doi.org/10.1007/s10485-018-9549-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10485-018-9549-8

Keywords

Navigation