in combinatorial commutative algebra, a zero-divisor graph is an undirected graph representing the zero divisors of a commutative ring. It has elements...

In abstract algebra, an element a of a ring R is called a left zero divisor if there exists a nonzero x in R such that ax = 0, or equivalently if the map...

In mathematics, division by zero, division where the divisor (denominator) is zero, is a unique and problematic special case. Using fraction notation,...

1450 = σ2(34): sum of squares of divisors of 34 1451 = Sophie Germain prime 1452 = first Zagreb index of the complete graph K12 1453 = Sexy prime with 1459...

densities of graphs in graphons Tutte's conjectures: every bridgeless graph has a nowhere-zero 5-flow every Petersen-minor-free bridgeless graph has a nowhere-zero...

starting from two polynomials A (the dividend) and B (the divisor) produces, if B is not zero, a quotient Q and a remainder R such that A = BQ + R, and...

graph is a cycle graph, and for an infinite cyclic group with its generator the Cayley graph is a doubly infinite path graph. However, Cayley graphs can...

real variable can be represented by a graph. The graph of the zero polynomial f(x) = 0 is the x-axis. The graph of a degree 0 polynomial f(x) = a0, where...

Claudio Procesi. Algebraic combinatorics Polyhedral combinatorics Zero-divisor graph A foundational paper on Stanley–Reisner complexes by one of the pioneers...

general division). For example, when dividing 20 (the dividend) by 3 (the divisor), the quotient is 6 (with a remainder of 2) in the first sense and 6 2...