Web matrices : structural properties and generating combinatorial identities

Tools

Dukes, Mark and White, Chris D. (2016) Web matrices : structural properties and generating combinatorial identities. The Electronic Journal of Combinatorics, 23 (1). P1.45. ISSN 1077-8926

[thumbnail of Dukes-White-EJC-2016-Web-matrices-structural-properties-and-generating]
Preview
 Text. Filename: Dukes_White_EJC_2016_Web_matrices_structural_properties_and_generating.pdf
Final Published Version
Download (432kB)| Preview

Abstract

In this paper we present new results for the combinatorics of web diagrams and web worlds. These are discrete objects that arise in the physics of calculating scattering amplitudes in non-abelian gauge theories. Web-colouring and web-mixing matrices (collectively known as web matrices) are indexed by ordered pairs of web-diagrams and contain information relating the number of colourings of the first web diagram that will produce the second diagram. We introduce the black diamond product on power series and show how it determines the web-colouring matrix of disjoint web worlds. Furthermore, we show that combining known physical results with the black diamond product gives a new technique for generating combinatorial identities. Due to the complicated action of the product on power series, the resulting identities appear highly non-trivial. We present two results to explain repeated entries that appear in the web matrices. The first of these shows how diagonal web matrix entries will be the same if the comparability graphs of their associated decomposition posets are the same. The second result concerns general repeated entries in conjunction with a flipping operation on web diagrams. We present a combinatorial proof of idempotency of the web-mixing matrices, previously established using physical arguments only. We also show how the entries of the square of the web-colouring matrix can be achieved by a linear transformation that maps the standard basis for formal power series in one variable to a sequence of polynomials. We look at one parameterized web world that is related to indecomposable permutations and show how determining the web-colouring matrix entries in this case is equivalent to a combinatorics on words problem.

ORCID iDs

Dukes, Mark ORCID logoORCID: https://orcid.org/0000-0002-2779-2680 and White, Chris D.;
CORE (COnnecting REpositories)