Hermite subdivision schemes act on vector valued data that is not only considered as functions values in R r , but as consecutive derivatives, which leads to a mild form of level dependence of the scheme. Previously, we have proved that a property called spectral condition or sum rule implies a factorization in terms of a generalized difference operator that gives rise to a "difference scheme" whose contractivity governs the convergence of the scheme. But many convergent Hermite schemes, for example, those based on cardinal splines, do not satisfy the spectral condition. In this paper, we generalize the property in a way that preserves all the above advantages: the associated factorizations and convergence theory. Based on these results, we can include the case of cardinal splines and also enables us to construct new types of convergent Hermite subdivision schemes.The iteration of subdivision operators S A n , n ∈ N, is called a subdivision scheme and consists of the successive applications of level-dependent subdivision operators, acting on vector valued data, S A n : ℓ r (Z) → ℓ r (Z), defined asAn important algebraic tool for stationary subdivision operators is the symbol of the mask, which is the matrix valued Laurent polynomialWe will focus our interest on two kinds of such schemes, the first one being "traditional" vector subdivision schemes in the sense of [1], where A n is independent of n, i.e., A n (α) = A(α) for any α ∈ Z and any n ≥ 0. In the following, such schemes for which an elaborate theory of convergence exists, will simply be called a vector scheme. Their convergence is defined in the following way.Definition 1 Let S A : ℓ r (Z) → ℓ r (Z) be a vector subdivision operator. The operator is C pconvergent, p ≥ 0, if for any data g 0 ∈ ℓ r (Z) and corresponding sequence of refinements g n = S n A g 0 there exists a function ψ g ∈ C p (R, R r ) such that for any compact K ⊂ R there exists a sequence ε n with limit 0 that satisfies max α∈Z∩2 n K