Partial D-operators for the generalized IBP reduction

Understand

Empirical evidence reveals existence of partial D-operators for the generalized IBP (BT) reduction algorithms that are, counterintuitively, much simpler and much easier to find than the complete D-operators from the foundational Bernstein theorem, allowing one to construct first true two-loop examples of generalized IBP identities.