Combinatorics, Probability and Computing
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
The lex game and some applications
Journal of Symbolic Computation
Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz
Journal of Symbolic Computation
Hi-index | 0.00 |
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