Algebraically solvable problems: describing polynomials as equivalent to explicit solutions

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/130684

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Algebraic combinatorics (05E99) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Congruences in many variables (11D79) Interpolation in approximation theory (41A05) Coloring of graphs and hypergraphs (05C15)

Related Items (32)

Polynomials over structured grids ⋮ Constructing integer-magic graphs via the Combinatorial Nullstellensatz ⋮ Warning's second theorem with relaxed outputs ⋮ Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz ⋮ List-Coloring Claw-Free Graphs with $\Delta-1$ Colors ⋮ Covering almost all the layers of the hypercube with multiplicities ⋮ Some new characterizations of graph colorability and of blocking sets of projective spaces ⋮ An improvement to Chevalley's theorem with restricted variables ⋮ Transformation invariance in the combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices ⋮ The Alon-Tarsi number of two kinds of planar graphs ⋮ The Alon-Tarsi number of a toroidal grid ⋮ On the Alon-Tarsi number of semi-strong product of graphs ⋮ Zero testing and equation solving for sparse polynomials on rectangular domains ⋮ Warning's second theorem with restricted variables ⋮ Computing the list chromatic index of graphs ⋮ Chevalley-Warning type results on abelian groups ⋮ Unnamed Item ⋮ The Combinatorial Nullstellensätze revisited ⋮ On Zeros of a Polynomial in a Finite Grid ⋮ On the Alon-Füredi bound ⋮ Constant terms of near-Dyson polynomials ⋮ Unnamed Item ⋮ Combinatorial Nullstellensatz and DP-coloring of graphs ⋮ A generalized combinatorial nullstellensatz for multisets ⋮ Classification of polynomial mappings between commutative groups. ⋮ Brooks' theorem via the Alon-Tarsi theorem ⋮ Total weight choosability for Halin graphs ⋮ Proof of the list edge coloring conjecture for complete graphs of prime degree ⋮ Asymptotics of traces of paths in the Young and Schur graphs ⋮ Unnamed Item ⋮ On a theorem of Morlaye and Joly and its generalization ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges

This page was built for publication: Algebraically solvable problems: describing polynomials as equivalent to explicit solutions