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

DOI10.1017/S0963548303005923zbMath1078.05008OpenAlexW2164444433MaRDI QIDQ4812339

André E. Kézdy, Hunter S. 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

Gröbner basespermutation polynomialsCombinatorial NullstellensatzHamiltonian cycles in graphsLatin transversals in Latin squaresperfect matchings in bipartite graphspolynomials vanishing on tuples of distinct roots of unity

Mathematics Subject Classification ID

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

Related Items (2)

Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz ⋮ The lex game and some applications

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