Article ID Journal Published Year Pages File Type
5394387 Computational and Theoretical Chemistry 2013 5 Pages PDF
Abstract
► We examine the exact bounds of the G-condition for N-representability. ► The lower bound of the G-condition maps onto an integer programming problem. ► The upper bound of the G-condition is easily computed. ► Exact bounds appear to be important for strongly-correlated systems.
Related Topics
Physical Sciences and Engineering Chemistry Physical and Theoretical Chemistry
Authors
, , , , ,