For a sequence of Coxeter diagrams obtained by attaching two fixed pointed diagrams and to the ends of the path , Gross, Hironaka and McMullen (Journal of Number Theory, 2009) proved a dichotomy: either every is spherical or affine, or the cyclotomic factor of the Coxeter polynomial is eventually periodic in . For the special family they determined this factor completely (for all ): the cyclotomic zeros have orders in , depend only on , and arise exclusively from splittings of the diagram into spherical subdiagrams, that is, from joins at a vertex whose pieces are spherical. The authors left open (i) finding a general condition on the decorations that guarantees this exclusive spherical origin of the cyclotomic factors, and (ii) making the eventual periodicity effective: an explicit threshold and modulus (or a certificate that every member is spherical or affine) together with a terminating verification procedure for general decorated families. Later work applies the paper's Mann-type two-term bound in adjacent settings - graph truncations and subfactor vines, star-like trees, rational surface automorphisms, tree characteristic polynomials - but no general criterion of type (i) and no general effective form of type (ii) for Coxeter polynomials of two-sided decorations are known. Both components are open.
Background
A Coxeter system is a group generated by involutions whose pairwise products have prescribed finite orders ; it is encoded by a Coxeter diagram whose vertices are the generators, with an edge of weight joining to whenever (by convention an unlabeled edge has weight one). The system acts on preserving a symmetric bilinear form , and the product of the generators in any order is a Coxeter element; when the diagram is a tree, the conjugacy class of , and hence the characteristic polynomial (the Coxeter polynomial), is independent of the ordering. For bipartite diagrams one uses the bicolored Coxeter element, again well-defined up to conjugacy. If the diagram has no multiple edges, preserves a lattice and ; the statements below assume wherever this integrality is needed.
A diagram is called spherical if its Coxeter group is finite (equivalently, is positive definite - the Dynkin diagrams , , , etc.), affine if is positive semidefinite with a one-dimensional radical (the extended Dynkin diagrams ), and hyperbolic if has signature . Write for the -th cyclotomic polynomial, the minimal polynomial over of a primitive -th root of unity. The Coxeter polynomial factors uniquely as , where the cyclotomic factor , the product of all dividing , collects the zeros that are roots of unity. By a classical theorem of A'Campo (1976), when the diagram is connected and hyperbolic the complementary factor is a Salem polynomial: an irreducible reciprocal polynomial (reciprocal meaning for a polynomial of degree ) with a unique root outside the unit circle, so that is a Salem number. The smallest known Salem number, Lehmer's number, , arises this way from the diagram .
The Coxeter polynomial of the path is , so its zeros are all the -st roots of unity except - the archetype of a fully cyclotomic family. A pointed Coxeter diagram is a pair with a distinguished vertex ; deleting leaves a possibly disconnected diagram, whose Coxeter polynomial - the product of the polynomials of its connected components - is denoted . The join of pointed diagrams is obtained by adding a new vertex connected to each by a single edge. Two inputs from the 2009 paper of Gross, Hironaka and McMullen (GHM) govern joins. Their Theorem 1.5: if is the Coxeter diagram obtained by joining together diagrams at a single new vertex, then any zero of two or more of the Coxeter polynomials is also a zero of . And a direct matrix computation (equation (3.2) of the source) expresses the Coxeter polynomial of the join:
This is the mechanism by which subdiagrams force cyclotomic factors. The diagram () is the join of and for : for example, is the join of and , and since divides , divides .
Two further inputs from GHM are needed. First, Mann's theorem on linear relations between roots of unity (1965): in a minimal (primitive) vanishing integer linear combination of roots of unity, the order of the combination divides the product of the primes at most the number of terms. GHM recast it as a two-term bound (their Theorem 2.1): if with not both zero and a primitive -th root of unity, then either for some , or , where is the product of the primes and counts nonzero terms. Second, GHM's Theorem 4.1: if is the sequence obtained by attaching fixed pointed diagrams and to the two ends of (with for all ), then either every is spherical or affine (in that case, if connected, the family is a re-indexing of one of the standard spherical or affine series ), or the cyclotomic factor of is periodic in for all . The proof rests on the two-term identity with and fixed polynomials built from the decorations, together with a spectral monotonicity result under path extension due to Hoffman and Smith (their 1975 result is the source's Proposition 4.5). For the family itself, the identity reads , and GHM combined the bound , separability of for , and a finite check for to obtain, for all : the cyclotomic factor is the least common multiple of , and the spherical polynomials () that divide ; iff , where is the Coxeter number, that is, the order of the Coxeter element of ; and iff is odd, iff . Consequently depends only on , and in the authors' words these roots of unity come exclusively from splittings of into spherical subdiagrams. (Here is spherical for , affine for - the only whose Coxeter polynomial has multiple roots - and hyperbolic for .) What is not known is which general decoration data force the same phenomenon, and how to make the eventual periodicity of Theorem 4.1 effective: the paper states that the dichotomy result, made effective, is what would reduce computations like Theorem 1.1 to a finite computation.
Problem Statement
Let be the sequence of Coxeter diagrams obtained by attaching two fixed pointed Coxeter diagrams and to the two ends of the path , with for all (the setting of Theorem 4.1 of Gross-Hironaka-McMullen; the source describes the same class of examples as sequences of Coxeter diagrams where nodes are added to a separating edge). As in the background, and denote the Coxeter polynomials of the diagrams obtained by deleting the basepoints and . The common objective is a complete, structural and computable description of the cyclotomic part of the Coxeter polynomials , generalizing the description Gross-Hironaka-McMullen obtained for the family. Two linked deliverables are requested.
(1) Spherical-origin criterion. Following the source's usage ('the cyclotomic factors ... come exclusively from its spherical subdiagrams'; the mechanism is its Theorem 1.5 on joins), say that the family has the spherical-origin property if the following holds for every member that is neither spherical nor affine: whenever a root of unity is a zero of , there is a vertex of such that (a) deleting separates into connected components with , the vertex being adjacent to exactly one vertex of each component (so that is the join of the pointed diagrams obtained from the components by re-attaching ), and (b) is a common zero of the Coxeter polynomials of two or more of the components , each of which is spherical (finite Coxeter group, positive-definite form). The spherical and affine members are exempted because their Coxeter polynomials are entirely cyclotomic for trivial reasons that need not be mediated by joins; in the source's family, is spherical for , affine for , and hyperbolic for . Find a general condition - combinatorial, algebraic, or in terms of the decoration data or the associated polynomials and of the two-term identity - which guarantees that the spherical-origin property holds for the whole family. The condition must be correct (with proof), must be satisfied by the decorations and, combined with the spherical vertex-splittings it identifies, must reproduce the source's Theorem 1.1 for all (cyclotomic orders exactly , dependence only on ), and must be non-vacuous (it must hold for an infinite family of hyperbolic diagrams beyond ).
(2) Effective periodicity. Make the dichotomy theorem effective for these families: given any decoration with , provide an explicit, terminating procedure that outputs either (a) a certificate that every is spherical or affine (by the source's Theorem 1.7/4.1 such a family is a re-indexing of one of the standard spherical or affine series ), or (b) explicit, computably bounded integers and , in terms of the decoration data, such that the cyclotomic factor of depends only on for all , together with a terminating finite verification procedure that certifies this modulus for the given family. The two deliverables are jointly aimed at replacing the case-by-case Mann-type analyses currently needed for each new family by a general, algorithmic theory of the cyclotomic spectrum of decorated families.
References
- Benedict H. Gross, Eriko Hironaka, Curtis T. McMullen, Cyclotomic factors of Coxeter polynomials, Journal of Number Theory 129 (2009), no. 5, 1034-1043. DOI: 10.1016/j.jnt.2008.09.021, https://doi.org/10.1016/j.jnt.2008.09.021 (author-hosted full text: https://people.math.harvard.edu/~ctm/home/text/papers/en/en.pdf)
- Henry B. Mann, On linear relations between roots of unity, Mathematika 12 (1965), no. 2, 107-117. DOI: 10.1112/s0025579300005210, https://doi.org/10.1112/s0025579300005210
- Norbert A'Campo, Sur les valeurs propres de la transformation de Coxeter, Inventiones Mathematicae 33 (1976), no. 1, 61-67. DOI: 10.1007/bf01425505, https://doi.org/10.1007/bf01425505
- Eric Bedford, Kyounghee Kim, Dynamics of rational surface automorphisms: linear fractional recurrences, Journal of Geometric Analysis 19 (2009), no. 3, 553-583. DOI: 10.1007/s12220-009-9077-8, https://doi.org/10.1007/s12220-009-9077-8 (arXiv preprint math/0611297, https://arxiv.org/abs/math/0611297)
- Frank Calegari, Scott Morrison, Noah Snyder, Cyclotomic integers, fusion categories, and subfactors, Communications in Mathematical Physics 303 (2011), no. 3, 845-896. DOI: 10.1007/s00220-010-1136-2, https://doi.org/10.1007/s00220-010-1136-2 (arXiv:1004.0665, https://arxiv.org/abs/1004.0665)
- David Penneys, James E. Tener, Subfactors of index less than 5, part 4: vines, International Journal of Mathematics 23 (2012), no. 3, 1250017. DOI: 10.1142/S0129167X11007641, https://doi.org/10.1142/S0129167X11007641 (arXiv:1010.3797, https://arxiv.org/abs/1010.3797)
- Charalampos A. Evripidou, Coxeter polynomials of Salem trees, Colloquium Mathematicum 141 (2015), no. 2, 209-226. DOI: 10.4064/cm141-2-6, https://doi.org/10.4064/cm141-2-6 (arXiv:1401.3128, https://arxiv.org/abs/1401.3128)
- Chris Smyth, Seventy years of Salem numbers, Bulletin of the London Mathematical Society 47 (2015), no. 3, 379-395. DOI: 10.1112/blms/bdv027, https://doi.org/10.1112/blms/bdv027 (arXiv:1408.0195, https://arxiv.org/abs/1408.0195; the arXiv version is titled 'Survey article: Seventy years of Salem numbers', the same work)
- Horst Brunotte, Jorg M. Thuswaldner, Salem numbers from a class of star-like trees, Journal of Number Theory 153 (2015), 85-96. DOI: 10.1016/j.jnt.2015.01.005, https://doi.org/10.1016/j.jnt.2015.01.005 (arXiv:1501.05557, https://arxiv.org/abs/1501.05557)
- Jeffrey Diller, Kyounghee Kim, Entropy of real rational surface automorphisms, Experimental Mathematics 30 (2021), no. 2, 172-190. DOI: 10.1080/10586458.2018.1516581, https://doi.org/10.1080/10586458.2018.1516581 (arXiv:1710.07665, https://arxiv.org/abs/1710.07665)
- Kyounghee Kim, The dynamical degrees of rational surface automorphisms, Conformal Geometry and Dynamics 28 (2024), 62-87. DOI: 10.1090/ecgd/392, https://doi.org/10.1090/ecgd/392 (arXiv:2211.09662, https://arxiv.org/abs/2211.09662)
- Saieed Akbari, Keivan Mallahi-Karai, An infinite family of trees with irreducible characteristic polynomials, preprint (2026). arXiv:2607.23162, https://arxiv.org/abs/2607.23162
- A. J. Hoffman, J. H. Smith, On the spectral radii of topologically equivalent graphs, in: Recent Advances in Graph Theory (Proc. Second Czechoslovak Symposium, Prague, 1974), Academia, Prague, 1975, pp. 273-281. Bibliographic data as given in the reference list of Gross-Hironaka-McMullen (DOI: 10.1016/j.jnt.2008.09.021), whose Proposition 4.5 uses [HS, Lem. 2.3 and Prop. 2.4]