Transactions of the American Mathematical Society
A combinatorial approach to the diagonal 𝑁-representability problem
Mark Laurance Yoseloff
Abstract
The problem considered is that of the diagonal N -representability of a p th-order reduced density matrix, p ≥ 2 p \geq 2 , for a system of N identical fermions or bosons. A finite number M of allowable single particle states is assumed. The problem is divided into three cases, namely: Case I. M = N + p M = N + p ; Case II. M > N + p M > N + p ; Case III. M > N + p M > N + p . Using the theory of polyhedral convex cones, a complete set of necessary and sufficient conditions is first found for Case I. This solution is then employed to find such conditions for Case II. For Case III, two algorithms are developed to generate solutions for the problem, and examples of the usage of these algorithms are given.