Central sets in ℕ were introduced by Furstenberg and are known to have substantial combinatorial structure. For example, any central set contains arbitrarily long arithmetic progressions, all finite sums of distinct terms of an infinite sequence, and solutions to all partition regular systems of homogeneous linear equations. We introduce here the notions of strongly central and very strongly central, which as the names suggest are strictly stronger than the notion of central. They are also strictly stronger than syndetic, which in the case of ℕ means that gaps are bounded. Given Due to image rights restrictions, multiple line equation(s) cannot be graphically displayed. Kronecker's Theorem says that if 1, α1, α2, ⋯, αv are linearly independent over ℚ and U is a nonempty open subset of (-½ , ½ )v, then {x ε ℕ : (w(α1x), ⋯, w(αvx)) ε U} is nonempty, and Weyl showed that this set has positive density. We show here that if 0̄ is in the closure of U, then this set is strongly central. More generally, let P1, P2, ⋯, Pv be real polynomials with zero constant term. We show that {x ε ℕ : (w(P1(x)), ⋯, w(Pv(x))) ε U} is nonempty for every open U with 0̄ ε …U if and only if it is very strongly central for every such U and we show that these conclusions hold if and only if any nontrivial rational linear combination of P1, P2, ⋯, Pv has at least one irrational coefficient. [ABSTRACT FROM AUTHOR]