Web worlds, web-colouring matrices, and web-mixing matrices
From MaRDI portal
(Redirected from Publication:385032)
Abstract: 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 non-Abelian gauge (Yang-Mills) theories. To each web world we associate two matrices called the web-colouring matrix and web-mixing 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 order-preserving 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 web-mixing and web-colouring matrices are obtained by summing certain polynomials determined by the descents in permutations in the Jordan-Holder set of all linear extensions of the associated poset. We derive tri-variate 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 web-mixing matrices calculated in each case.
Recommendations
- Web matrices: structural properties and generating combinatorial identities
- Webs and posets
- General properties of multiparton webs: proofs from combinatorics
- Building blocks of Cwebs in multiparton scattering amplitudes
- Combinatorics of the geometry of Wilson loop diagrams. I: Equivalence classes via matroids and polytopes
Cites work
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- Ascent sequences and upper triangular matrices containing non-negative integers
- Composition matrices, \((2+2)\)-free posets and their specializations
- Enumerating \((2 + 2)\)-free posets by indistinguishable elements
- General properties of multiparton webs: proofs from combinatorics
- scientific article; zbMATH DE number 6016068 (Why is no real title available?)
- On the renormalization of multiparton webs
- Partition and composition matrices
- Webs in multiparton scattering using the replica trick
Cited in
(12)- Bootstrapping the QCD soft anomalous dimension
- Boomerang webs up to three-loop order
- Building blocks of Cwebs in multiparton scattering amplitudes
- The infrared structure of perturbative gauge theories
- Web matrices: structural properties and generating combinatorial identities
- Position-space cuts for Wilson line correlators
- Webs and posets
- The non-abelian exponentiation theorem for multiple Wilson lines
- The SAGEX review on scattering amplitudes Chapter 12: Amplitudes and collider physics
- Deciphering colour building blocks of massive multiparton amplitudes at 4-loops and beyond
- Multiparton Cwebs at five loops
- Exponentiation of soft quark effects from the replica trick
This page was built for publication: Web worlds, web-colouring matrices, and web-mixing matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385032)
