Abstract: | We find the smallest characteristic factor and a limit formula for the multiple ergodic averages associated to any family of three polynomials and polynomial families of the form . We then derive several multiple recurrence results and combinatorial implications, including an answer to a question of Brown, Graham, and Landman, and a generalization of the Polynomial Szemerédi Theorem of Bergelson and Leibman for families of three polynomials with not necessarily zero constant term. We also simplify and generalize a recent result of Bergelson, Host, and Kra, showing that for all and every subset of the integers the set has bounded gaps for ``most' choices of integer polynomials . |