Results 71 to 80 of about 1,715 (93)

Applications of the Combinatorial Nullstellensatz on bipartite graphs.

, 2015
APPLICATIONS OF THE COMBINATORIAL NULLSTELLENSATZ ON BIPARTITE GRAPHS Timothy M. Brauch May 9,2009 The Combinatorial Nullstellensatz can be used to solve certain problems in combinatorics. However, one of the major complications in using the Combinatorial Nullstellensatz is ensuring that there exists a nonzero monomial.
openaire   +2 more sources

A note on Alon's combinatorial Nullstellensatz

Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae. Sectio computatorica, 2014
Mészáros, Tamás, Rónyai, Lajos
openaire   +2 more sources

Practical algebraic calculus and Nullstellensatz with the checkers Pacheck and Pastèque and Nuss-Checker. [PDF]

Form Methods Syst Des
Kaufmann D, Fleury M, Biere A, Kauers M.
europepmc   +1 more source

Wedderburn decomposition of commutative semisimple group algebras using the Combinatorial Nullstellensatz

In this paper, we present the simple components of the Wedderburn decomposition of semisimple commutative group algebras over finite abelian groups, which we investigate from a geometric point of view. We also present the Wedderburn decomposition of semisimple commutative group algebras over finite fields.
openaire   +2 more sources

Combinatorial Nullstellensatz: Various Proofs, Extensions and Applications [PDF]

, 2020
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

A generalized Combinatorial Nullstellensatz for multisets

European Journal of Combinatorics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gantsooj Batzaya, Gombodorj Bayarmagnai
openaire   +3 more sources

Combinatorial Nullstellensatz over division rings

Journal of Algebraic Combinatorics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Elad Paran
openaire   +4 more sources

Anti‐magic graphs via the Combinatorial NullStellenSatz

Journal of Graph Theory, 2005
AbstractAn 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
openaire   +4 more sources