Revisiting the spreading and covering numbers

zbMATH Open1283.13016arXiv1109.5847MaRDI QIDQ2848724

Adam Van Tuyl, Ben Babcock

Publication date: 26 September 2013

Abstract: We revisit the problem of computing the spreading and covering numbers. We show a connection between some of the spreading numbers and the number of non-negative integer 2x2 matrices whose entries sum to d, and we construct an algorithm to compute improved upper bounds for the covering numbers.

Full work available at URL: https://arxiv.org/abs/1109.5847

zbMATH Keywords

algorithminteger sequencescovering numberspreading number

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20)

Uses Software

• OEIS

Recommendations

• Unnamed Item 👍 👎
• Powers of the vertex cover ideals 👍 👎
• Cohen-Macaulay monomial ideals of codimension 2 👍 👎
• Cohen-Macaulay intersections 👍 👎
• Regularity and Koszul property of symbolic powers of monomial ideals 👍 👎
• COMPUTING THE SPREADING AND COVERING NUMBERS 👍 👎
• Cohen-Macaulay modifications of the vertex cover ideal of a graph 👍 👎
• On quasi-equigenerated and Freiman cover ideals of graphs 👍 👎
• Edge Ideals Using Macaulay2 👍 👎
• Cohen–Macaulayness and Limit Behavior of Depth for Powers of Cover Ideals 👍 👎

This page was built for publication: Revisiting the spreading and covering numbers