Power-counting theorem for non-local matrix models and renormalisation

Physics – High Energy Physics – High Energy Physics - Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

35 pages, 70 figures, LaTeX with svjour macros. v2: proof simplified because a discussion originally designed for \phi^4 on no

Scientific paper

10.1007/s00220-004-1238-9

Solving the exact renormalisation group equation a la Wilson-Polchinski perturbatively, we derive a power-counting theorem for general matrix models with arbitrarily non-local propagators. The power-counting degree is determined by two scaling dimensions of the cut-off propagator and various topological data of ribbon graphs. As a necessary condition for the renormalisability of a model, the two scaling dimensions have to be large enough relative to the dimension of the underlying space. In order to have a renormalisable model one needs additional locality properties--typically arising from orthogonal polynomials--which relate the relevant and marginal interaction coefficients to a finite number of base couplings. The main application of our power-counting theorem is the renormalisation of field theories on noncommutative R^D in matrix formulation.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Power-counting theorem for non-local matrix models and renormalisation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Power-counting theorem for non-local matrix models and renormalisation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Power-counting theorem for non-local matrix models and renormalisation will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-23481

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.