Skip to main content
×
Home
    • Aa
    • Aa

Polynomials that Vanish on Distinct $n$th Roots of Unity

  • ANDRÉ E. KÉZDY (a1) and HUNTER S. SNEVILY (a2)
Abstract

Let ${\bf C}$ denote the field of complex numbers and $\Omega_n$ the set of $n$th roots of unity. For $t = 0,\ldots,n-1$, define the ideal $\Im(n,t+1) \subset {\bf C}[x_0,\ldots,x_{t}]$ consisting of those polynomials in $t+1$ variables that vanish on distinct $n$th roots of unity; that is, $f \in \Im(n,t+1)$ if and only if $f(\omega_0,\ldots,\omega_{t}) = 0$ for all $(\omega_0,\ldots,\omega_{t}) \in \Omega_n^{t+1}$ satisfying $\omega_i \neq \omega_j$, for $0 \le i < j \le t$.

In this paper we apply Gröbner basis methods to give a Combinatorial Nullstellensatz characterization of the ideal $\Im(n,t+1)$. In particular, if $f \in {\bf C}[x_0,\ldots,x_{t}]$, then we give a necessary and sufficient condition on the coefficients of $f$ for membership in $\Im(n,t+1)$.

Copyright
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 11 *
Loading metrics...

Abstract views

Total abstract views: 32 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 22nd October 2017. This data will be updated every 24 hours.