𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A direct proof of BCFW recursion for twistor-strings

✍ Scribed by David Skinner

Publisher
Springer-Verlag
Year
2011
Tongue
English
Weight
457 KB
Volume
2011
Category
Article
ISSN
1126-6708

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Combinatorial Proof of a Recursion for
A Combinatorial Proof of a Recursion for the q-Kostka Polynomials
✍ Kendra Killpatrick πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 196 KB

The Kostka numbers K \* + play an important role in symmetric function theory, representation theory, combinatorics and invariant theory. The q-Kostka polynomials K \* + (q) are the q-analogues of the Kostka numbers and generalize and extend the mathematical meaning of the Kostka numbers. Lascoux an

A direct proof for the matrix decomposit
A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices
✍ Naonori Kakimura πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 116 KB

Agler, Helton, McCullough, and Rodman proved that a graph is chordal if and only if any positive semidefinite (PSD) symmetric matrix, whose nonzero entries are specified by a given graph, can be decomposed as a sum of PSD matrices corresponding to the maximal cliques. This decomposition is recently

Recursive interpolation algorithm: a for
Recursive interpolation algorithm: a formalism for solving systems of linear equationsβ€”I. Direct methods
✍ A. Messaoudi πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 793 KB

This paper presents a simple unifying algorithm for solving systems of linear equations. Solving a system of linear equations will be interpreted as an interpolation problem. This new approach leads us to a general algorithm called the recursive interpolation algorithm RIA, which includes the direct