Algebraically solvable problems: describing polynomials as equivalent to explicit solutions
From MaRDI portal
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Determinants, permanents, traces, other special matrix functions (15A15) Coloring of graphs and hypergraphs (05C15) Algebraic combinatorics (05E99) Interpolation in approximation theory (41A05) Congruences in many variables (11D79)
Recommendations
Cited in
(32)- The Alon-Tarsi number of a toroidal grid
- On the Alon-Füredi bound
- Some new characterizations of graph colorability and of blocking sets of projective spaces
- List-coloring claw-free graphs with \(\Delta-1\) colors
- An improvement to Chevalley's theorem with restricted variables
- A generalization of Schauz and Brink's restricted-variable version of Chevalley's theorem
- Asymptotics of traces of paths in the Young and Schur graphs
- Combinatorial Nullstellensatz and DP-coloring of graphs
- On zeros of a polynomial in a finite grid
- The Alon-Tarsi number of two kinds of planar graphs
- scientific article; zbMATH DE number 7790331 (Why is no real title available?)
- Warning's second theorem with relaxed outputs
- Constructing integer-magic graphs via the combinatorial Nullstellensatz
- Total weight choosability for Halin graphs
- Two Chromatic Conjectures: One for Vertices and One for Edges
- Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz
- On the Alon-Tarsi number of semi-strong product of graphs
- Zero testing and equation solving for sparse polynomials on rectangular domains
- Brooks' theorem via the Alon-Tarsi theorem
- Constant terms of near-Dyson polynomials
- Proof of the list edge coloring conjecture for complete graphs of prime degree
- Chevalley-Warning type results on abelian groups
- The Combinatorial Nullstellensätze revisited
- scientific article; zbMATH DE number 7633017 (Why is no real title available?)
- Warning's second theorem with restricted variables
- Computing the list chromatic index of graphs
- Classification of polynomial mappings between commutative groups.
- Covering almost all the layers of the hypercube with multiplicities
- A generalized combinatorial nullstellensatz for multisets
- Polynomials over structured grids
- On a theorem of Morlaye and Joly and its generalization
- Transformation invariance in the combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices
This page was built for publication: Algebraically solvable problems: describing polynomials as equivalent to explicit solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010715)
