Entanglement conditions and polynomial identities

We develop a rather general approach to entanglement characterization based on convexity properties and polynomial identities. This approach is applied to obtain simple and efficient entanglement conditions which work equally well in both discrete as well as continuous-variable environments. Examples of violations of our conditions are presented.