Exploiting the cone structure of the set of unnormalized mixed quantum states, we offer an approach to detect separability independently of the dimensions of the subsystems. We show that any mixed quantum state can be decomposed as ρ = (1 − λ)C ρ + λE ρ , where C ρ is a separable matrix whose rank equals that of ρ and the rank of E ρ is strictly lower than that of ρ. With the simple choice C ρ = M 1 ⊗ M 2 we have a necessary condition of separability in terms of λ, which is also sufficient if the rank of E ρ equals 1. We give a first extension of this result to detect genuine entanglement in multipartite states and show a natural connection between the multipartite separability problem and the classification of pure states under stochastic local operations and classical communication. We argue that this approach is not exhausted with the first simple choices included herein. Entanglement is […] the characteristic trait of quantum mechanics" [1]. This statement remains valid, even stronger, more than 70 years after its formulation. Nowadays entanglement is believed to lie behind most quantum phenomena and is still considered the source of conceptual challenges [2]. In a few words, entanglement stands for the presence of quantum correlations, i.e. statistical correlations which cannot be reproduced using classical probability theory. Despite its importance, we are still far from a full comprehension of this fundamental feature of Nature, not to mention the fact that the problem of discerning whether a given composite quantum system portrays entanglement has only a partial solution. By and large, a complete understanding will follow only after apprehending the notion of quantum correlation both qualitatively and quantitatively for all sort of composite systems, either bipartite or multipartite and either with infinite or with finite dimensions.Today a big gap exists between our understanding of bipartite and multipartite entanglement, probably as big as radical the difference is between having two subsystems and having more than two. This gap is also present between finite-and infinite-dimensional systems. These latter have been analyzed mainly in the Gaussian domain (see e.g. [3]). In the following we will concentrate upon finite-dimensional systems. From a broad mathematical point of view two approaches can be followed to discern whether a given quantum state is entangled or not. On the one hand we can adopt an analytical point of view and try to find operational criteria to settle the question upon the quantum state itself. As prominent instances we can cite the Schmidt decomposition (only valid for pure states of any dimensions) [4], the PPT criterion (valid as a necessary and sufficient condition for 2 ⊗ 2 or 2 ⊗ 3 and a necessary condition for the rest of bipartite systems) [5][6][7], the range criterion (a necessary condition for all bipartite systems) [8] and the computable cross norm or realignment criterion (a necessary condition for all bipartite systems) [9,10], to name a few (see [11][12][13][14] for a...