Network rewriting utility description. (English) Zbl 1533.68422
Silvestrov, Sergei (ed.) et al., Non-commutative and non-associative algebra and analysis structures. SPAS 2019. Selected papers based on the presentations at the international conference on stochastic processes and algebraic structures – from theory towards applications, Västerås, Sweden, September 30 – October 2, 2019. Cham: Springer. Springer Proc. Math. Stat. 426, 429-476 (2023).
Summary: This chapter describes the author’s computer program for doing network rewriting calculations, in its capacity as a tool used for scientific exploration – more precisely to systematically discover non-obvious consequences of the axioms for various algebraic structures. In particular this program can cope with algebraic structures, such as bi- and Hopf algebras, that mix classical operations with co-operations.
For the entire collection see [Zbl 1531.17004].
For the entire collection see [Zbl 1531.17004].
MSC:
| 68W30 | Symbolic computation and algebraic computation |
| 16T05 | Hopf algebras and their applications |
| 16T10 | Bialgebras |
| 18M30 | String diagrams and graphical calculi |
| 68Q42 | Grammars and rewriting systems |
| 68V99 | Computer science support for mathematical research and practice |
References:
| [1] | Buswell, S., Caprotti, O., Carlisle, D.P., Dewar, M. C.Gaëtano, M.: Kohlhase, M., Davenport, J.H., Ion, P.D.F., Wiesing, T.: The openmath standard. Technical report, The OpenMath Society (2019). https://www.openmath.org/standard/om20-2019-07-01/ |
| [2] | Deutsch, P.: DEFLATE Compressed Data Format Specification version 1.3. Internet Engineering Task Force RFC 1951 (1996). https://tools.ietf.org/html/rfc1951 |
| [3] | Hellström, L: Network Rewriting I: The Foundation (2012). arXiv:1204.2421 [math.RA] |
| [4] | Hellström, L.: Critical pairs in network rewriting. In: Aoto, T., Kesner, D. (eds.) IWC 2014, 3rd International Workshop on Confluence, pp. 9-13 (2014). http://www.nue.riec.tohoku.ac.jp/iwc2014/iwc2014.pdf |
| [5] | Hellström, L.: Ordering networks. In: Presented at the 14th International Workshop on Termination (WST), 17-18 July 2014. http://www.diva-portal.org/smash/record.jsf?pid=diva2:721605 |
| [6] | Hellström, L.: Network rewriting II: bi- and Hopf algebras. In: 26th International Conference on Rewriting Techniques and Applications. LIPIcs, vol. 36 . Leibniz International Proceedings of Information, pp. 194-208. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern (2015) · Zbl 1366.68118 |
| [7] | Hellström, L.: Strong hom-associativity. In: Algebraic Structures and Applications, vol. 317. Springer Proceedings in Mathematics & Statistics, pp. 317-337 (2020) · Zbl 1479.17005 |
| [8] | Hellström, L.: PROPs and matrices [literate computer software]. File props.dtx in git repository at https://github.com/lars-hellstrom/algebra |
| [9] | Hellström, L., Makhlouf, A., Silvestrov, S.D.: Universal algebra applied to hom-associative algebras, and more. In: Algebra, Geometry and Mathematical Physics, vol. 85, Springer Proceedings in Mathematics & Statistics, pp. 157-199 (2014) · Zbl 1347.17016 |
| [10] | Richard Hipp, D., Kennedy, D., Mistachkin, J.: SQLite (various versions 3.x) [Computer software]. SQLite Development Team (1999-2021). https://www.sqlite.org/ |
| [11] | Kenny, K.B., Trzewik, A., Leitgeb, A., Fellows, D.K.: Tcl Database Connectivity (TDBC). Tcl Improvement Proposal 308 (2007). https://core.tcl-lang.org/tips/doc/trunk/tip/308.md |
| [12] | Knuth, D.E.: Literate Programming. Comput. J. 27(2), 97-111 (1984) · Zbl 0533.68005 |
| [13] | Knuth, D.E., Bendix, P.B.: Simple word problems in universal algebras, In: Leech, J. (ed.) Computational Problems in Abstract Algebra. Proceedings Conference, Oxford, 1967, pp. 263-297. Pergamon, Oxford (1970). (Reprinted in: J.H. Siekmann, G. Wrightson, Automation of Reasoning Vol. 2, Springer, 342-376 (1983) ISBN 3-540-12044-0.) · Zbl 0188.04902 |
| [14] | Dahlström, E., Dengler, P., Grasso, A., Lilley. C., McCormack, C., Schepers, D., Watt, J., Ferraiolo, J., Jackson, D. (eds.): Scalable Vector Graphics (SVG) 1.1 (Second Edition). W3C Recommendation (2011) https://www.w3.org/TR/2011/REC-SVG11-20110816/ |
| [15] | Mittelbach, F.: The doc-option. TUGboat 10:2, 186-197 (1989). An updated version of this paper is part of doc.dtx in the base LaTeX distribution |
| [16] | Mittelbach, F., Duchier, D., Braams, J., Woliński, M., Wooding, M.: The DocStrip program. Part of the LaTeX core distribution. Version 2.6a (2020) read 2021-05-12 |
| [17] | Ousterhout, J.K., Jones, K.: Tcl and the Tk Toolkit, 2nd ed. Addison Wesley (2010). ISBN 9780321336330 |
| [18] | Pugh, W., Skip lists: a probabilistic alternative to balanced trees, Commun. ACM, 33, 6, 668-676 (1990) · doi:10.1145/78973.78977 |
| [19] | Ştefănescu, G.: Network algebra. Discrete Mathematics and Theoretical Computer Science (London). Springer, London, Ltd., London, (2000) · Zbl 0956.68002 |
| [20] | Tcl Developer Xchange. Tcl Commands for version 8.6 [collection of webpages]. 2012, accessed 2021-04-26. http://www.tcl-lang.org/man/tcl8.6/TclCmd/contents.htm Full development history is in fossil respository, https://core.tcl-lang.org/tcl |
| [21] | Tcl Developer Xchange. canvas manual page - Tk Built-In Commands. Web page, read 2021-05-03. http://www.tcl-lang.org/man/tcl8.6/TkCmd/canvas.htm |
| [22] | Tantau, T.: The TikZ and PGF Packages [Computer software]. https://www.ctan.org/pkg/pgf |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
