The notion of a descent polynomial, function in enumerative combinatorics that counts permutations with specific properties, enjoys revived recent research interest due to its connection other important notions combinatorics, viz. peak polynomials and symmetric functions. We define the dm(I,n) as generalization polynomial we prove for any positive integer m, this is n sufficiently large (simila...