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