Results 61 to 70 of about 107 (87)
Combinatorial Nullstellensatz: Various Proofs, Extensions and Applications [PDF]
, 2020 openaire +1 more source
The Arithmetic Circuit Combinatorial Nullstellensatz is NP-hard
A multivariate polynomial on $n$ variables $x_1,\ldots,x_n$ of total degree $n$ over $\mathbf{Z}_2$ containing the multilinear monomial $\prod_{i=1}^n x_i$ is by the combinatorial nullstellensatz [Alon, Comb. Probab. Comput., 1999] known to always have a nonroot.
openaire +1 more source
Combinatorial Nullstellensatz and DP-coloring of graphs [PDF]
Discrete Mathematics, 2020 We initiate the study of applying the Combinatorial Nullstellensatz to the DP-coloring of graphs even though, as is well-known, the Alon-Tarsi theorem does not apply to DP-coloring. We define the notion of good covers of prime order which allows us to apply the Combinatorial Nullstellensatz to DP-coloring.
Jeffrey Mudrock, Hemanshu Kaul
exaly +3 more sources
Residues and the Combinatorial Nullstellensatz [PDF]
Periodica Mathematica Hungarica, 2018 We interpret the Combinatorial Nullstellensatz of Noga Alon as a multidimensional residue formula, describe some consequences of this interpretation and related open problems.
Roman Karasev, Karasev Roman
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A generalized Combinatorial Nullstellensatz for multisets
European Journal of Combinatorics, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Batzaya Gantsooj
exaly +2 more sources
Combinatorial Nullstellensatz over division rings
Journal of Algebraic Combinatorics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Elad Paran
exaly +3 more sources
Circular choosability via combinatorial Nullstellensatz
Journal of Graph Theory, 2008AbstractA p‐list assignment L of a graph G assigns to each vertex v of G a set ${{L}}({{v}})\subseteq \{{{0}}{{,}} {{1}}{{,}}\ldots{{,}}\, {{p}}-{{1}}\}$ of permissible colors. We say G is L‐(P, q)‐colorable if G has a (P, q)‐coloring h such that h(v) ϵ L(v) for each vertex v.
Xuding Zhu
exaly +3 more sources
Anti-magic graphs via the Combinatorial NullStellenSatz
Journal of Graph Theory, 2005AbstractAn antimagic labeling of a graph with m edges and n vertices is a bijection from the set of edges to the integers 1,…,m such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with that vertex. A graph is called antimagic if it has an antimagic labeling.
Dan Hefetz
exaly +3 more sources