Results 31 to 40 of about 1,715 (93)
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
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
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
Computation with Polynomial Equations and Inequalities arising in Combinatorial Optimization
, 2009 The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear algebra or ...
A Kehrein +19 more
core +2 more sources
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
On the grasshopper problem with signed jumps
, 2011 The 6th problem of the 50th International Mathematical Olympiad (IMO), held in Germany, 2009, was the following. Let $a_1,a_2,...,a_n$ be distinct positive integers and let $M$ be a set of $n-1$ positive integers not containing $s=a_1+a_2+...+a_n$.
Kós, Géza
core +1 more source
A Deductive Approach towards Reasoning about Algebraic Transition Systems
Mathematical Problems in Engineering, Volume 2015, Issue 1, 2015., 2015 Algebraic transition systems are extended from labeled transition systems by allowing transitions labeled by algebraic equations for modeling more complex systems in detail. We present a deductive approach for specifying and verifying algebraic transition systems.
Jun Fu +3 more
wiley +1 more source
Groebner Bases Based Verification Solution for SystemVerilog Concurrent Assertions
Journal of Applied Mathematics, Volume 2014, Issue 1, 2014., 2014 We introduce an approach exploiting the power of polynomial ring algebra to perform SystemVerilog assertion verification over digital circuit systems. This method is based on Groebner bases theory and sequential properties checking. We define a constrained subset of SVAs so that an efficient polynomial modeling mechanism for both circuit descriptions ...
Ning Zhou +5 more
wiley +1 more source