Eberhard, SeanKahn, JeffNarayanan, BhargavSpirkl, Sophie2022-08-222022-08-222021-11https://doi.org/10.1017/S0963548321000079http://hdl.handle.net/10012/18593This article has been published in a revised form in Combinatorics, Probability and Computing https://doi.org/10.1017/S0963548321000079. This version is free to view and download for private research and study only. Not for re-distribution, re-sale or use in derivative works. © Sean Eberhard, Jeff Kahn, Bhargav Narayanan and Sophie Spirkl.A family of vectors in [k]n is said to be intersecting if any two of its elements agree on at least one coordinate. We prove, for fixed k ≥ 3, that the size of any intersecting subfamily of [k]n invariant under a transitive group of symmetries is o(kn), which is in stark contrast to the case of the Boolean hypercube (where k = 2). Our main contribution addresses limitations of existing technology: while there are now methods, first appearing in work of Ellis and the third author, for using spectral machinery to tackle problems in extremal set theory involving symmetry, this machinery relies crucially on the interplay between up-sets, biased product measures, and threshold behaviour in the Boolean hypercube, features that are notably absent in the problem considered here. To circumvent these barriers, introducing ideas that seem of independent interest, we develop a variant of the sharp threshold machinery that applies at the level of products of posets.enAttribution-NonCommercial-NoDerivatives 4.0 Internationalhttp://creativecommons.org/licenses/by-nc-nd/4.0/vectorssymmetric intersectingArticle