Web worlds, webcolouring matrices, and webmixing matrices
Dukes, Mark and Gardi, Einan and Steingrimsson, Einar and White, Chris (2013) Web worlds, webcolouring matrices, and webmixing matrices. Journal of Combinatorial Theory Series A, 120 (5). pp. 10121037. ISSN 00973165
Full text not available in this repository.Request a copy from the Strathclyde authorAbstract
We introduce a new combinatorial object called a web world that consists of a set of web diagrams. The diagrams of a web world are generalizations of graphs, and each is built on the same underlying graph. Instead of ordinary vertices the diagrams have pegs, and edges incident to a peg have different heights on the peg. The web world of a web diagram is the set of all web diagrams that result from permuting the order in which endpoints of edges appear on a peg. The motivation comes from particle physics, where web diagrams arise as particular types of Feynman diagrams describing scattering amplitudes in nonAbelian gauge (YangMills) theories. To each web world we associate two matrices called the webcolouring matrix and webmixing matrix. The entries of these matrices are indexed by ordered pairs of web diagrams (D_1,D_2), and are computed from those colourings of the edges of D_1 that yield D_2 under a transformation determined by each colouring. We show that colourings of a web diagram (whose constituent indecomposable diagrams are all unique) that lead to a reconstruction of the diagram are equivalent to orderpreserving mappings of certain partially ordered sets (posets) that may be constructed from the web diagrams. For web worlds whose web graphs have all edge labels equal to 1, the diagonal entries of webmixing and webcolouring matrices are obtained by summing certain polynomials determined by the descents in permutations in the JordanHolder set of all linear extensions of the associated poset. We derive trivariate generating generating functions for the number of web worlds according to three statistics and enumerate the number of different web diagrams in a web world. Three special web worlds are examined in great detail, and the traces of the webmixing matrices calculated in each case
ORCID iDs
Dukes, Mark ORCID: https://orcid.org/0000000227792680, Gardi, Einan, Steingrimsson, Einar ORCID: https://orcid.org/0000000346110849 and White, Chris;

Item type: Article ID code: 44660 Dates: DateEvent2013PublishedKeywords: web worlds, webcolouring matrices, webmixing matrices, Electronic computers. Computer science, Computer Science(all) Subjects: Science > Mathematics > Electronic computers. Computer science Department: Faculty of Science > Computer and Information Sciences Depositing user: Pure Administrator Date deposited: 29 Aug 2013 10:16 Last modified: 02 Apr 2021 02:49 URI: https://strathprints.strath.ac.uk/id/eprint/44660