Asymptotic behavior of the fixed-angle on-shell quark scattering amplitudes in non-Abelian gauge theories

1983 ◽  
Vol 28 (4) ◽  
pp. 860-875 ◽  
Author(s):  
Ashoke Sen
Keyword(s):  
Asymptotic Behavior ◽  
Scattering Amplitudes ◽  
Gauge Theories ◽  
Abelian Gauge ◽  
Fixed Angle ◽  
Quark Scattering

Asymptotic behavior of elementary fermion form factors in non-abelian gauge theories

1975 ◽  
Vol 57 (2) ◽  
pp. 161-164 ◽  
Author(s):  
J. Carazzone ◽  
E.C. Poggio ◽  
H.R. Quinn
Keyword(s):  
Asymptotic Behavior ◽  
Gauge Theories ◽  
Form Factors ◽  
Abelian Gauge

scholarly journals PROBING THE FROISSART BOUND FOR MODELS WITH CHARGED VECTOR FIELDS IN D=3

1994 ◽  
Vol 09 (18) ◽  
pp. 1695-1700 ◽  
Author(s):  
O.M. DEL CIMA
Keyword(s):  
Asymptotic Behavior ◽  
Scattering Amplitudes ◽  
Gauge Field ◽  
Vector Fields ◽  
Three Dimensional ◽  
Tree Level ◽  
Abelian Gauge ◽  
Gauge Invariant ◽  
Maxwell Fields ◽  
Chern Simons

One discusses the tree-level unitarity and presents asymptotic behavior of scattering amplitudes for three-dimensional gauge-invariant models where complex Chern- Simons-Maxwell fields (with and without a Proca-like mass) are coupled to an Abelian gauge field.

Calculation of asymptotic behavior of form factors in non-Abelian gauge theories

1975 ◽  
Vol 11 (8) ◽  
pp. 2286-2299 ◽  
Author(s):  
James J. Carazzone ◽  
Enrico C. Poggio ◽  
Helen R. Quinn
Keyword(s):  
Asymptotic Behavior ◽  
Gauge Theories ◽  
Form Factors ◽  
Abelian Gauge

Erratum: Calculation of asymptotic behavior of form factors in non-Abelian gauge theories

1975 ◽  
Vol 12 (10) ◽  
pp. 3368-3369 ◽  
Author(s):  
James J. Carazzone ◽  
Enrico C. Poggio ◽  
Helen R. Quinn
Keyword(s):  
Asymptotic Behavior ◽  
Gauge Theories ◽  
Form Factors ◽  
Abelian Gauge

scholarly journals Two-loop divergences of massive scattering amplitudes in non-abelian gauge theories

2009 ◽  
Vol 2009 (11) ◽  
pp. 062-062 ◽  
Author(s):  
Andrea Ferroglia ◽  
Matthias Neubert ◽  
Ben D Pecjak ◽  
Li Lin Yang
Keyword(s):  
Scattering Amplitudes ◽  
Gauge Theories ◽  
Abelian Gauge

scholarly journals Web Matrices: Structural Properties and Generating Combinatorial Identities

10.37236/5631 ◽  
2016 ◽  
Vol 23 (1) ◽  
Author(s):  
Mark Dukes ◽  
Chris D White
Keyword(s):  
Scattering Amplitudes ◽  
Power Series ◽  
Gauge Theories ◽  
Combinatorial Identities ◽  
Combinatorial Proof ◽  
Abelian Gauge ◽  
A New Technique ◽  
Formal Power ◽  
The Web ◽  
Ordered Pairs

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 onwords problem.

Sign in / Sign up

Export Citation Format

Share Document