Polynomials that Vanish on Distinct n th Roots of Unity

DOI10.1017/S0963548303005923MaRDI QIDQ4812339zbMATH OpenOpenAlexFDO

Authors André E. Kézdy, Hunter Snevily

Publication date 7 September 2004

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548303005923

zbMATH Keywords

Combinatorial NullstellensatzGröbner basesHamiltonian cycles in graphsLatin transversals in Latin squaresperfect matchings in bipartite graphspermutation polynomialspolynomials vanishing on tuples of distinct roots of unity

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Orthogonal arrays, Latin squares, Room squares (05B15) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Polynomials in number theory (11C08) Polynomials over commutative rings (13B25) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Polynomials and rational functions of one complex variable (30C10)

Recommendations

• A generalization of Alon's combinatorial nullstellensatz
• The Gröbner basis of the ideal of vanishing polynomials
• Combinatorial Nullstellensatz
• Balancing sets of vectors
• Some meeting points of Gröbner bases and combinatorics

Cited in

(7)

• Infinitely many roots of unity are zeros of some Jones polynomials
• The lex game and some applications
• Roots of unity and the polynomials with coefficients in \(\mathbb{T}\)
• All roots of unity are detected by the A-polynomial
• Binary polynomial power sums vanishing at roots of unity
• Polynomials that vanish to high order on most of the hypercube
• Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz

This page was built for publication: Polynomials that Vanish on Distinct $n$ th Roots of Unity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4812339)