Results 21 to 30 of about 1,707 (110)
A nullstellensatz for sequences over F_p [PDF]
, 2014 Let p be a prime and let A=(a_1,...,a_l) be a sequence of nonzero elements in F_p. In this paper, we study the set of all 0-1 solutions to the equation a_1 x_1 + ... + a_l x_l = 0.
A. Geroldinger +11 more
core +3 more sources
Antimagic Labelings of Weighted and Oriented Graphs [PDF]
, 2019 A graph $G$ is $k$-$weighted-list-antimagic$ if for any vertex weighting $\omega\colon V(G)\to\mathbb{R}$ and any list assignment $L\colon E(G)\to2^{\mathbb{R}}$ with $|L(e)|\geq |E(G)|+k$ there exists an edge labeling $f$ such that $f(e)\in L(e)$ for ...
Berikkyzy, Zhanar +4 more
core +3 more sources
Coloring linear hypergraphs: the Erdős–Faber–Lovász conjecture and the Combinatorial Nullstellensatz [PDF]
Designs, Codes and Cryptography, 2021 AbstractThe long-standing Erdős–Faber–Lovász conjecture states that every n-uniform linear hypergaph with n edges has a proper vertex-coloring using n colors. In this paper we propose an algebraic framework to the problem and formulate a corresponding stronger conjecture.
Oliver Janzer, Zoltán Lóránt Nagy
openaire +4 more sources
Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility [PDF]
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation, 2008 Systems of polynomial equations over an algebraically-closed field K can be used to concisely model many combinatorial problems. In this way, a combinatorial problem is feasible (e.g., a graph is 3-colorable, hamiltonian, etc.) if and only if a related system of polynomial equations has a solution over K.
De Loera, J. A. +3 more
openaire +3 more sources
A Gröbner Basis Approach to Combinatorial Nullstellensatz
, 2023 In this paper, using some conditions that arise naturally in Alon's combinatorial Nullstellensatz as well as its various extensions and generalizations, we characterize Gröbner bases consisting of monic polynomials, which helps us to establish a Nullstellensatz from a Gröbner basis perspective.
Xu, Yang, Kan, Haibin, Han, Guangyue
openaire +2 more sources
Antimagic Labelings of Caterpillars [PDF]
, 2019 A $k$-antimagic labeling of a graph $G$ is an injection from $E(G)$ to $\{1,2,\dots,|E(G)|+k\}$ such that all vertex sums are pairwise distinct, where the vertex sum at vertex $u$ is the sum of the labels assigned to edges incident to $u$.
Lozano, Antoni +2 more
core +2 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.
openaire +2 more sources
Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems [PDF]
, 2016 B{\'e}zout 's theorem states that dense generic systems of n multivariate quadratic equations in n variables have 2 n solutions over algebraically closed fields.
Eisenbud D. +4 more
core +5 more sources
International Journal of Mathematics and Mathematical Sciences, Volume 2017, Issue 1, 2017., 2017 Let G be a graph and ϕ : V(G) ∪ E(G)→{1,2, 3, …, k} be a k‐total coloring. Let w(v) denote the sum of color on a vertex v and colors assigned to edges incident to v. If w(u) ≠ w(v) whenever uv ∈ E(G), then ϕ is called a neighbor sum distinguishing total coloring.
Patcharapan Jumnongnit +2 more
wiley +1 more source
Journal of Applied Mathematics, Volume 2015, Issue 1, 2015., 2015 The fractional derivatives in the sense of the modified Riemann‐Liouville derivative and Feng’s first integral method are employed to obtain the exact solutions of the nonlinear space‐time fractional ZKBBM equation and the nonlinear space‐time fractional generalized Fisher equation. The power of this manageable method is presented by applying it to the
Huitzilin Yépez-Martínez +3 more
wiley +1 more source