arXiv Analytics

Sign in

arXiv:2403.10817 [math.CO]AbstractReferencesReviewsResources

The Schur polynomials in all $n$th primitive roots of unity

Masaki Hidaka, Minoru Itoh

Published 2024-03-16Version 1

We show that the Schur polynomials in all $n$th primitive roots of unity are $1$, $0$, or $-1$, if $n$ has at most two distinct odd prime factors. This result can be regarded as a generalization of properties of the coefficients of the cyclotomic polynomial and its multiplicative inverse. This result is reduced in turn to four propositions on the unimodularity of vector systems, and the last proposition is proved by using graph theory.

Related articles: Most relevant | Search more
arXiv:1301.1408 [math.CO] (Published 2013-01-08)
The McKean-Singer Formula in Graph Theory
arXiv:1012.1844 [math.CO] (Published 2010-12-08, updated 2022-08-15)
The cyclotomic polynomial topologically
arXiv:1812.00533 [math.CO] (Published 2018-12-03)
A Graph Theory of Rook Placements