An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture

01/29/2019 ∙ by Elisabeth Gaar, et al. ∙ United States Naval Academy Alpen-Adria-Universität 0

Vizing's conjecture (open since 1968) relates the sizes of dominating sets in two graphs to the size of a dominating set in their Cartesian product graph. In this paper, we formulate Vizing's conjecture itself as a Positivstellensatz existence question. In particular, we encode the conjecture as an ideal/polynomial pair such that the polynomial is nonnegative if and only if the conjecture is true. We demonstrate how to use semidefinite optimization techniques to computationally obtain numeric sum-of-squares certificates, and then show how to transform these numeric certificates into symbolic certificates approving nonnegativity of our polynomial. After outlining the theoretical structure of this computer-based proof of Vizing's conjecture, we present computational and theoretical results. In particular, we present exact low-degree sparse sum-of-squares certificates for particular families of graphs.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 5

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1 Introduction

Sum-of-squares and its relationship to semidefinite programming is a cutting-edge tool at the forefront of polynomial optimization [6]. Activity in this area has exploded over the past two decades to span areas as diverse as real and convex algebraic geometry [19], control theory [17], proof complexity [14], theoretical computer science [3] and even quantum computation [4]. Systems of polynomial equations and other non-linear models are similarly widely known for their compact and elegant representations of combinatorial problems. Prior work on polynomial encodings includes colorings [1, 16], stable sets [20, 21], matchings [10], and flows [23]. In this project, we combine the modeling strength of systems of polynomial equations with the computational power of semidefinite programming and devise an optimization-based framework for a computational proof of an old, open problem in graph theory, namely Vizing’s conjecture.

Vizing’s conjecture was first proposed in 1968, and relates the sizes of minimum dominating sets in graphs and to the size of a minimum dominating set in the Cartesian product graph ; a precise formulation follows as Conjecture 2.1. Prior algebraic work on this conjecture [22] expressed the problem as the union of a certain set of varieties and thus the intersection of a certain set of ideals. However, algebraic computational results have remained largely untouched. In this project, we present an algebraic model of Vizing’s conjecture that equates the validity of the conjecture to the existence of a Positivstellensatz, or a sum-of-squares certificate of nonnegativity modulo a carefully constructed ideal.

By exploiting the relationship between the Positivstellensatz and semidefinite programming, we are able to produce sum-of-squares certificates for certain classes of graphs where Vizing’s conjecture holds. Thus, not only are we demonstrating an optimization-based approach towards a computational proof of Vizing’s conjecture, but we are presenting actual minimum degree nonnegativity certificates that are algebraic proofs of instances of this combinatorial problem. Although the underlying graphs do not further what is known about Vizing’s conjecture at this time (indeed the combinatorics of the underlying graphs is fairly trivial), the construction of these “combinatorial” Positivstellensätze is an elegant combination of computation, guesswork and computer algebra that is successfully executed for the first time here.

Our paper is structured as follows. In Section 2, we present the necessary background and definitions from graph theory and commutative algebra. In Section 3, we begin the heart of the paper: we describe the ideal/polynomial pair that models Vizing’s conjecture as a sum-of-squares problem. In Section 4 we describe our precise process for finding the sum-of-squares certificates, and in Section 5 we present our computational results and the Positivstellensätze, i.e., the theorems that arise. Finally, in Section 6, we summarize our project and present comments about future work.

2 Backgrounds and Definitions

In this section, we recall all necessary definitions from both graph theory, and polynomial ideals and commutative algebra.

2.1 Definitions from Graph Theory

Given a graph with vertex set , a set is a dominating set in if for each , there is a such that is adjacent to in . The domination number of , denoted by , is the size of a minimum111Any proper subset of a minimum dominating set in a graph  is not a dominating set in . dominating set in . The decision problem of determining whether a given graph has a dominating set of size is NP-complete [11].

Given graphs and with edge sets  and respectively, the Cartesian product graph has vertex set , and edge set

and , or

where , and , .

In 1968, V. Vizing conjectured the following beautiful relationship between domination numbers and Cartesian product graphs:

Conjecture 2.1 (Vizing [26], 1968).

Given graphs and , then the inequality

holds.

Example 2.2.

In this example, we demonstrate the Cartesian product graph of two cycle graphs:

In these graphs, 

represents a vertex in a dominating set, and Vizing’s conjecture holds with equality: . However, observe that some copies of in do not contain any vertices of the dominating set, i.e., they are dominated entirely by vertices in other “layers” of the graph. This example highlights the difficulty of Vizing’s conjecture.

2.2 Historical Notes

Vizing’s conjecture is an active area of research spanning over fifty years. Early results have focused on proving the conjecture for certain classes of graphs. For example, in 1979, Barcalkin and German [5] proved that Vizing’s conjecture holds for graphs satisfying a certain “partitioning condition” on the vertex set. The idea of a “partitioning condition” inspired work for the next several decades, as Vizing’s conjecture was shown to hold on paths, trees, cycles, chordal graphs, graphs satisfying certain coloring properties, and graphs with . These results are clearly outlined in the 1998 survey paper by Hartnell and Rall [15]. In 2000, Clark and Suen [8] showed that , and in 2004, Sun [24] showed that Vizing’s conjecture holds on graphs with . Finally, the 2009 survey paper [7] summarizes the work from 1968 to 2008, contains new results, new proofs of existing results, and comments about minimal counter-examples.

2.3 Definitions around Polynomial Ideals

Our goal is to model Vizing’s conjecture as a semidefinite programming problem. In particular, we will create an ideal/polynomial pair such that the polynomial is nonnegative over a given variety if and only if Vizing’s conjecture is true.

In this subsection, we present a brief introduction to polynomial ideals, and the relationship between nonnegativity and sum-of-squares. This material is necessary for understanding our polynomial ideal model of Vizing’s conjecture. For a more thorough introduction to this material see [9] and [6].

Throughout this section, let be an ideal in a polynomial ring  with a field . The variety of the ideal  is defined as the set

with being the algebraic closure of . The variety is called real if .

We say that the ideal  is radical if whenever for some polynomial  and integer , then . The radical of , denoted , is the set

It is easy to see that an ideal is radical if and only if .

Lemma 2.3.

([18, Section 3.7.B, pg. 246]) Given an ideal with finite variety , if contains a univariate square-free polynomial in each variable, then is radical.

In this case, square-free implies that when a polynomial is decomposed into its unique factorization, there are no repeated factors.

In particular, Lemma 2.3 implies that ideals containing in each variable (i.e., the boolean ideals) are radical.

We continue with our background by recalling the necessary notation for sum-of-squares.

Definition 2.4.

Let be a nonnegative integer. A polynomial is called -sum-of-squares modulo (or -sos mod ), if there exist polynomials , …, with degrees for all and

Algebraic identities like , , are often referred to as Positivstellensatz certificates of nonnegativity, and these identities can be found via semidefinite programming, which is at the heart of this project. It is well-known that not all nonnegative polynomials can be expressed as a sum-of-squares. However, in the particular case when the ideal is radical and the variety is finite, we can state the following.

Lemma 2.5.

Given a radical ideal with a finite real variety and a polynomial  with . Then is nonnegative on the variety, i.e, , if and only if there exists a nonnegative integer such that is -sos modulo .

Proof.

Given a polynomial that can be expressed as a sum-of-squares modulo , since all polynomials in the ideal vanish on the variety by definition and since is clearly positive, is nonnegative on . To prove the other direction, we recall a well-known argument included here for completeness. Suppose we have a polynomial for all . Suppose further that are all points in (recall that the variety is finite). We now construct interpolation polynomials (see [12]) such that

for all . Observe that the square of an interpolating polynomial is again an interpolating polynomial. Since the ideal is radical, this means that where is the ideal vanishing on . In this case, we see that the difference polynomial

since this difference polynomial vanishes on every point in the variety. Therefore, if we let , we then see that

We observe that the in this case is quite large, since it is the degree of the interpolating polynomial , which depends on the number of points in the variety. However, we will rely on the fact that the sum-of-squares representation is not unique, and there may exist Positivstellensatz certificates of much lower degree, within reach of computation. As we will see in Section 5, this does indeed turn out to be the case.

3 Vizing’s Conjecture as a Sum-of-Squares Problem

In this section, we describe Vizing’s conjecture as a sum-of-squares problem. Towards that end, we will first define ideals associated with graphs , and , and then finally describe an ideal/polynomial pair where the polynomial is nonnegative on the ideal if and only if Vizing’s conjecture is true. We begin by creating an ideal where the variety of solutions corresponds to graphs with a given number of vertices and size of a minimum dominating set.

The notation underlying all of the definitions in this section is as follows. Let and be fixed positive integers, and let be the class of graphs on vertices with a minimum dominating set (fixed) of size . We then turn the various edges “on” or “off” (by controlling a boolean variable ) such that each point in the variety corresponds to a specific graph .

Definition 3.1.

Set . The ideal is defined by the system of polynomial equations

for all , (1a)
for all , (1b)
for all where . (1c)
Theorem 3.2.

The points in the variety are in bijection to the graphs in .

Proof.

Consider any point . Since Eqns. (1a) turn the edges “on” () or “off” (), the point defines a graph  in vertices. Eqns. (1b) iterate over all the vertices inside the set , and ensure that for each vertex outside the set at least one edge from a vertex inside the set to this vertex is “on”. Therefore, is a dominating set. Finally, Eqns. (1c) iterate over all sets of size and ensure that at least one vertex outside  is not incident on any vertex inside  for any . Therefore, no of size is a dominating set. Thus, every point corresponds to a graph on vertices with a minimum dominating set of size . ∎

Similarly, for fixed positive integers and , let be the class of graphs on vertices and a minimum dominating set of size . Again, we fix the dominating set to some to reduce isomorphisms within the variety. Furthermore let the ideal be defined on the polynomial ring  with such that the solutions in the variety  are in bijection to the graphs in .

Next, we define the graph class  and the ideal . For the above classes  and , the graph class  is the set of product graphs for and . The new variables needed for the ideal are the variables corresponding to the vertices in the product graph. Let and set .

Definition 3.3.

The ideal is defined by the system of polynomial equations

(2a)
(2b)

for all and .

Observe that we have no restrictions on the edge variables in this definition. It is only used as a stepping stone to the final and most important ideal in our polynomial model.

Definition 3.4.

For graph classes  and , we set to be the ideal generated by the elements of , and .

Note that our definition of  depends on the specific parameters , , and .

Theorem 3.5.

The points in the variety are in bijection to the triple of graphs whose components are , and their corresponding product graph with a dominating set of any size.

Proof.

We have already demonstrated that , are in bijection to the graphs in , vertices with minimum dominating sets of size , respectively. It remains to investigate the restrictions placed on the variables, which denote whether or not the vertex appears in the dominating set of the product graph. Eqns. (2a) force the vertex variables to be “on” or “off”, i.e., the vertex is in the dominating set if and is outside the dominating set otherwise. Eqns. (2b) force every vertex to be dominated. It is either in the set itself (i.e., ), or it is adjacent to a vertex in the dominating set via an edge from the underlying graph in or the underlying graph in . In particular, the edge is “on” and the vertex is in the dominating set, or the is “on” and the vertex is in the dominating set. In either of these cases, the vertex is dominated. Therefore, the points in the variety are in bijection to the graphs in , vertices with minimum dominating sets of size , respectively, and their corresponding product graph with a dominating set of any size. ∎

Observe that there are no polynomials in enforcing minimality on the dominating set in the product graph. This is essential when we tie all of these ideals and definitions together, and model Vizing’s conjecture as a sum-of-squares problem. In particular, we model Vizing’s conjecture as an ideal/polynomial pair, where the polynomial must be nonnegative on the variety associated with the ideal if and only if Vizing’s conjecture is true.

Definition 3.6.

Given the graph classes and , define

Theorem 3.7.

Vizing’s conjecture is true if and only if for all values of , , and , is nonnegative on , i.e.,

Proof.

Assume that Vizing’s conjecture is true. Therefore, for all graphs and , we have . In particular, , for all values of , , and . Since contains a sum over all the variables, which represent a dominating set in of any size, we have for all .

Similarly, if for all , every dominating set in has size at least . In particular, the minimum dominating set in has size at least and Vizing’s conjecture is true. ∎

Corollary 3.8.

Vizing’s conjecture is true if and only if for each , , and , there exists an integer such that is -sos modulo .

Proof.

The ideal contains the univariate polynomial for each variable. Therefore, by Lemma 2.3, is radical. By similar reasoning, is finite. Therefore, by Lemma 2.5, we know that if a polynomial is nonnegative on , there exists an integer such that the polynomial is -sos modulo . ∎

In this section, we have drawn a parallel between Vizing’s conjecture and a sum-of-squares problem. We defined the ideal/polynomial pair , such that for all if and only if Vizing’s conjecture is true. In the next section, we describe exactly how to find these Positivstellensatz certificates of nonnegativity, or equivalently, these Positivstellensatz certificates that Vizing’s conjecture is true.

4 Methodology

4.1 Overview of the Methodology

In our approach to Vizing’s conjecture we “partition” the graphs , and by their sizes (number of vertices) and and by the sizes of their dominating sets and . Note that we aim for certificates for all partitions as this would prove the conjecture. However in the following we present our method which works for a fixed partition (i.e. for fixed values of , , and ), and only later relax this and generalize to parametrized partitions.

The outline is as follows:

  • Step 1: Model the graph classes as ideals

  • Step 2: Formulate Vizing’s conjecture as sum-of-squares existence question

  • Step 3: Transform to a semidefinite program

  • Step 4: Obtain a numerical certificate

  • Step 5: Guess an exact certificate

  • Step 6: Computationally verify the certificate

  • Step 7: Generalize the certificate

  • Step 8: Prove correctness

For fixed values of , , and the first step is to create the ideal as described in Section 3, in particular Definition 3.4. To summarize, we create the ideal in a suitable polynomial ring in such a way that the points in the variety are in bijection to the triple of graphs whose components are , and their corresponding product graph with a dominating set of any size. In this polynomial ring there is a variable for each possible edge of and (indicating whether this edge is present or not in a particular graph) and for each vertex of (indicating whether it is in the dominating set or not).

The second step is to using the polynomial ring variables mentioned above to reformulate Vizing’s conjecture: It is true for a fixed partition if a certain polynomial is nonnegative if evaluated at all points in the variety  of the constructed ideal. For showing that the polynomial is nonnegative, we aim for rewriting it as a finite sum of squares of polynomials (modulo the ideal ). If we find such polynomials, then these form a certificate for Vizing’s conjecture for the fixed partition. To be more precise and as already described in Section 3, Vizing’s conjecture is true for this fixed values of , , and if and only if is -sos modulo .

In the subsequent Section 4.2 we describe how to perform step three and to do another reformulation, namely as a semidefinite program. Note that in order of doing so, we need to have specified . Note also that in order to prepare the semidefinite program, we need basis polynomials of the ideals; these are obtained by computing a Gröbner basis of the ideal.

The fourth step (Section 4.3) is now to solve the semidefinite program. If the program is infeasible (i.e., there exists no feasible solution), we increase . On the other hand, if the program is feasible, then we can construct a numerical sum-of-squares certificate. As the underlying system of equations—therefore the future certificate—is quite large, we iterate the following tasks: Find a numerical solution to the semidefinite program, find or guess some structure in the solution, use these new relations to reduce the size of the semidefinite program, and begin again with solving. This reduces the solution space and therefore potentially also the size (number  of summands) of the certificate and the number of monomials of the from Definition 2.4. The procedure above goes hand-in-hand with our next step (Section 4.4), namely obtaining (one might call it guessing) an exact certificate out of the numerical certificate.

Once we have a candidate for an exact certificate, we can check its validity computationally by summing up the squares and reducing modulo the ideal; see our step six described in Section 4.5.

We want to point out, that we still consider Vizing’s conjecture for a particular partition of graphs. However, having such certificates for some partitions, one can go for generalizing them by introducing parametrized partitions of graphs. Our seventh step in Section 4.6 provides more information.

The final step is to prove that the newly obtained, generalized certificate candidate is indeed a certificate; see Section 4.6.

4.2 Transform to a Semidefinite Program

Semidefinite programming refers to the class of optimization problems where a linear function with a symmetric matrix variable is optimized subject to linear constraints and the constraint that the matrix variable must be positive semidefinite. A semidefinite program (SDP) can be solved in polynomial time. In practice the most prominent methods for solving an SDP efficiently are interior-point algorithms. We use the solver Mosek [2] within Matlab. For more details on solving SDPs and on interior-point algorithms see [27].

It is possible to check whether a polynomial is -sos modulo an ideal with semidefinite programming. We refer to [6, pg. 298] for detailed information and examples. We will now present how to do so for our setting only.

Let us first fix (for example, by computing) a reduced Gröbner basis  of  and fix a nonnegative integer . Denote by

the vector of all monomials in our polynomial ring 

of degree at most which can not be reduced222Algorithmically speaking, we say that a polynomial  is reduced modulo the ideal  if is the representative of  which is invariant under reduction by a reduced Gröbner basis of the ideal . modulo  by our Gröbner basis . Let be the length of the vector . Then (of Definition 3.6) is -sos modulo if and only if there is a positive semidefinite matrix such that is equal to

when reduced over . Hence the SDP we end up with optimizes the matrix variable subject to linear constraints that guarantee the above equality. The objective function can be chosen arbitrarily because any matrix satisfying the constraints is sufficient for our purpose. More will be said on this later.

If the SDP is feasible, due to the positive semidefiniteness we can decompose the solution into . Then we define the polynomial  by the -th row of and obtain

(3)

Note that the last congruence holds due to the constraints in the SDP. Equation (3) then certifies that can be written as a sum of squares of the , and hence, is -sos modulo  according to Definition 2.4.

If the SDP is infeasible, we know only that there is no certificate of degree . We increase  to , because could still be -sos modulo  or posses a certificate of even higher degree.

Example 4.1.

We consider the graph classes and with , , and . Using SageMath [25] we construct the ideal , generated by 22 polynomials in 10 variables. Again using SageMath, we find a Gröbner basis of size 22.

First, we check the existence of a 1-sos certificate. The vector for has length , i.e., we set up an SDP with a matrix variable . Imposing the necessary constraints to guarantee leads to  linear equality constraints. Interior-point algorithms detect infeasibility of this SDP in less than half a second, this implies that there is no 1-sos certificate.

Setting up the SDP for checking the existence of a 2-sos certificate results in a problem with a matrix variable of dimension  and  linear constraints. Interior-point algorithms find a solution of this SDP in  seconds, this guarantees the existence of a numerical -sos certificate for these graph classes.

4.3 Obtain a Numerical Certificate

As described in Section 4.2 above, after solving the SDP we decompose the solution

. We do so be computing the eigenvalue decomposition

and then setting . ( is the diagonal matrix having the eigenvalues on the main diagonal. Since is positive semidefinite, all eigenvalues are nonnegative and we can compute .) Matrices , and are obtained through numerical computations, hence there might be entries in that are rather close to zero but not considered as zero. We may try setting these almost-zero eigenvalues to zero, which reduces the number of polynomials of the sum-of-squares certificate.

Furthermore, a zero-column in means that the corresponding monomial is not needed in the certificate. Hence, we may try to compute a certificate where we remove all monomials corresponding to almost-zero columns. This can decrease the size of the SDP considerably and a smaller size of the matrix and fewer constraints is favorable for solving the SDP. Of course, if removing these monomials leads to infeasibility of the SDP, then removing these monomials was not correct.

As already mentioned we can choose the objective function arbitrarily. Our experiments show that different objective functions lead to (significantly) different solutions. Therefore, we carefully choose a suitable objective functions leading to “nice” solutions for each instance.

Example 4.2.

We look again at the case we considered in Example 4.1, that is and with , , and , for which we already obtained an optimal solution and a numerical -sos certificate.

After computing (numerically) the eigenvalue decomposition , we set all almost-zero eigenvalues to zero and compute , which results in a matrix, i.e., 55 eigenvalues are considered as zero. In Figure 1 a heat map of matrix is displayed. It seems unattainable to convert this obtained solution to an exact certificate (see Section 4.4), so we take a different path.

Figure 1: Plotting the entries of matrix . is the coefficient of the -th monomial in the -th polynomial of the numerical sum-of-squares certificate.

Using different objective functions and aiming for a certificate where only certain monomials appear can lead to results with a clearer structure. If the -th monomial should not be included we can set the corresponding -th row and column of equal to zero and obtain another SDP, where we have fewer variables and modified constraints. We now try to use only the 19 monomials , and for all and all , .

This results in an SDP with a matrix variable of dimension  and constraints. The SDP can be solved in  seconds, and again, we obtain matrix (after setting almost-zero eigenvalues to zero), which now is of dimension . A heat map is given in Figure 2.

Figure 2: Plotting the entries of matrix as in Figure 1. The numerical sos certificate consists of 4 (number of rows) polynomials , , in 19 (number of columns) monomials.

As one can see in Figure 2, has a certain block structure, suggesting that in each the coefficients of the monomials depend only on the index and there is no dependence on the indices . Therefore, we aim for a -sos certificate of the form

(4a)
for all and
(4b)

where the coefficients , , , , and are the entries of . However, we only have the numerical values

at hand and it is not obvious how to guess suitable exact numbers from it. In contrast, looking at the values

it seems almost obvious which simple algebraic numbers the entries of could be, e.g. . We will use that in the following section.

4.4 Guess an Exact Certificate

We now have a guess for the structure of the certificate, but coefficients that are simple algebraic numbers are hard to determine from the numbers in . On the other hand, the exact numbers in seem to be rather obvious so we go back to the relation . It implies that if we fix two monomials then the inner product of the vectors of the coefficients of these monomials in all the has to be equal to the corresponding number in .

Setting up a system of equations using all possible inner products, we may obtain a solution to this system. This solution determines the coefficients in the certificate (and the certificate might be simplified even further).

Example 4.3.

We continue Example 4.1, that is we consider the graph classes and with , , and .

The exact numbers in given in Example 4.2 can be guessed easily. In fact, if this guess for is correct, every choice of such that gives a certificate. Using the relation we set up a system of equations on the parameters of (4). To be more precise, let , and . Then we can define the vectors , and , and (together with the guessed values for ) implies that

has to hold for each , where denotes the standard inner product. Under the assumption that our guess for was correct, each solution to this system of equations leads to a valid sum-of-squares certificate (4a and 4b).

We want a sparse certificate and the numerical solution suggests that holds, so we try to obtain a solution with also (even though the numerical solution does not fit into that setting). Using these values, the equations involving the vector determine the exact values for , and as , and . With that, the system of equations simplifies to

Calculating we find out that, due to the system of equations, the sum-of-squares simplifies to

Hence, if (4) is a sum-of-squares certificate then also

(5a)
(5b)

where , and is a sum-of-squares certificate.

4.5 Computationally Verify the Certificate

When a certificate is conjectured, it is straightforward to verify it computationally via SageMath. To do so, it is necessary to compute the Gröbner basis of . Observe that at this point, semidefinite programming is no longer needed.

Example 4.4.

We computationally verified (using SageMath) the certificate derived in Example 4.3 for the graph classes and with , , and .

4.6 Generalize the Certificate and Prove Correctness

In Sections 4.2 to 4.5, we presented a methodology for obtaining a sum-of-squares certificate for graph classes and with fixed parameters , , and . Assuming that the previously found pattern generalizes, one can iterate the steps outlined above to obtain certificates for larger classes of graphs.

Example 4.5.

We want to generalize the certificate for the graph classes and with , , and to the case , and for .

Solving the SDP for the cases and again yields nicely structured matrices and in fact, all the calculations done for the case (which we already wrote down parametrized by above) go through.

Hence, we are able to generalize the sum-of-squares certificate (5) in the following way.

Theorem 4.6.

For , and Vizing’s conjecture is true as the polynomials

and

where , and , are a sum-of-squares certificate with degree  of .

The proof is not included here for space considerations. Of course, once having the theorem above, it can be verified computationally for particular parameter values, e.g. for and , where the computation of a Gröbner basis is feasible.

5 Further Exact Certificates

In the previous section we saw by an example how to use our machinery combined with clever guessing in order to obtain sum-of-squares certificates for proving that Vizing’s conjecture holds for fixed values of , , and , and how this can be used to obtain certificated for a less restricted set of parameters. We will use this section now in order to present further certificates that we found using the method above and for which we were able to prove correctness. Again we omit proofs due to space limitations.

5.1 Certificates for and

The easiest case is the one with and . We found the following sum-of-squares certificate and therefore know, that Vizing’s conjecture holds in this case.

Theorem 5.1.

For and , Vizing’s conjecture is true as the polynomials

are a -sos certificate of .

Note that the certificate of Theorem 5.1 has the lowest degree possible and furthermore only uses very particular monomials of degree at most 1.

5.2 Certificates for and

The next slightly more difficult case is the one for and . Also in this case we were able to find a certificate.

Theorem 5.2.

For and , Vizing’s conjecture is true as the polynomials

with

are a -sos certificate of .

We want to point out, that this theorem is true whenever , , are solutions to the system of equations

and that in Theorem 5.2 one particular easy solution is stated.

Note that for all computationally considered instances, the SDP for was infeasible, so for all of those instances there is no -sos certificate and one really needs monomials of degree 2 in the in order to obtain a certificate. Nevertheless, degree 2 is still very low. Furthermore also in this sum-of-squares certificate only very particular monomials are used; it can be considered sparse therefore. This is confirmed by the following example.

Example 5.3.

If we consider the case , and , there are monomials of degree at most 2 but the certificate of Theorem 5.2 uses only of them.

5.3 Certificates for and

When taking a closer look at the certificates in Theorem 5.1 and Theorem 5.2, there seems to be a structure in the certificates we found so far. In particular the certificate for the case and seems to be a -sos certificate. Hence the following conjecture intuitively seems to be the generalization.

Conjecture 5.4.

Let and for . Then

where are the solutions to a certain system of polynomial equations, are a -sos certificate of .

6 Conclusions and Future Work

In this project, we modeled Vizing’s conjecture as an ideal/polynomial pair such that the polynomial was nonnegative on the variety of a particularly constructed ideal if and only if Vizing’s conjecture was true. We were able to produce low-degree, sparse Positivstellensätze certificates of nonnegativity for certain classes of graphs using an innovative collection of techniques ranging from semidefinite programming to clever guesswork to computer algebra. For example, Vizing’s conjecture with parameters and has a 1-sum-of-squares Positivstellensatz and with parameters and has a 2-sum-of-squares Positivstellensatz. We have conjectured a broader combinatorial pattern based on these certificates, but proving validity is left to future work. However, at this time, we have indeed proved Vizing’s conjecture for several classes of graphs using sum-of-squares certificates. Although we have not advanced what is currently known about Vizing’s conjecture, we have introduced a completely new technique (still to be thoroughly explored) to the literature of possible approaches.

For future work, we intend to continue pushing the computational aspect of this project. Additionally, it is very easy to change the model from a Positivstellensatz certificate to a Hilbert’s Nullstellensatz certificate, and thus change from numerical semidefinite programming to exact arithmetic linear algebra. This approach must also be thoroughly investigated. Finally, it would be very interesting to conjecture a global relationship between the values of , , and , and the degree of the Positivstellensatz certificate, and perhaps even recast the conjecture in terms of the theta body hierarchy described in [13].

Acknowledgments

The authors gratefully acknowledge the support of Fulbright Austria (via a Visiting Professorship at AAU Klagenfurt). This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 764759 and the Austrian Science Fund (FWF): I 3199-N31.

References

  • [1] N. Alon and M. Tarsi, Colorings and orientations of graphs, Combinatorica 12 (1992), 125–134.
  • [2] MOSEK ApS, The MOSEK optimization toolbox for MATLAB manual. version 8.1., 2017.
  • [3] B. Barak, S. Hopkins, J. Kelner, P. Kothari, and A. Potechin, A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem, FOCS 2016 IEEE 57th Annual Symposium on Foundations of Computer Science, 2016.
  • [4] B. Barak, P. K. Kothari, and D. Steurer, Quantum entanglement, sum of squares, and the log rank conjecture.

    , Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017, New York, NY: Association for Computing Machinery (ACM), 2017, pp. 975–988.

  • [5] A. Barcalkin and L. German, The external stability number of the cartesian product of graphs, Bul. Akad. Stiinte RSS Moldoven. 1 (1979), no. 94, 5–8.
  • [6] G. Blekherman, P. A. Parrilo, and R. R. Thomas (eds.), Semidefinite optimization and convex algebraic geometry., Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM), 2013.
  • [7] B. Brešar, P. Dorbec, W. Goddard, B. L. Hartnell, M. A. Henning, S. Klavžar, and D. F. Rall, Vizing’s conjecture: a survey and recent results., J. Graph Theory 69 (2012), no. 1-2, 46–76.
  • [8] W. E. Clark and S. Suen, An inequality related to Vizing’s conjecture., Electron. J. Comb. 7 (2000), no. 1, research paper n4, 3.
  • [9] D. A. Cox, J. Little, and D. O’Shea, Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (undergraduate texts in mathematics), Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2007.
  • [10] K. G. Fischer, Symmetric polynomials and Hall’s theorem, Discrete Math 69 (1988), no. 3, 225–234.
  • [11] M. Garey and D. Johnson, Computers and intractability: A guide to the theory of NP-completeness, W.H. Freeman and Company, 1979.
  • [12] M. Gasca and T. Souer, Polynomial Interpolation in Several Variables, Advances in Computational Mathematics 12 (2012), no. 4, 377–410.
  • [13] J. Gouveia, P. Parrilo, and R. Thomas, Theta Bodies for Polynomial Ideals, SIAM Journal of Optimization 20 (2010), no. 4, 2097–2118.
  • [14] D. Grigoriev and N. Vorobjov, Complexity of Null- and Positivstellensatz proofs, Annals of Pure and Applied Logic 113 (2001), no. 1–3, 153–160.
  • [15] B. Hartnell and D. Rall, Domination in cartesian products: Vizing’s conjecture, Domination in graphs (New York), Mono. Textbooks Pure and Appl. Math, Dekker, 1998, pp. 163–189.
  • [16] C. J. Hillar and T. Windfeldt, Algebraic characterization of uniquely vertex colorable graphs., J. Comb. Theory, Ser. B 98 (2008), no. 2, 400–414.
  • [17] Z. Jarvis-Wloszek, R. Feeley, W. Tan, K. Sun, and A. Packard, Control Applications of Sum of Squares Programming, Lecture Notes in Control and Information Science 312 (2005), 3–22.
  • [18] M. Kreuzer and L. Robbiano, Computational commutative algebra. I., Berlin: Springer, 2000.
  • [19] M. Laurent,

    Sums of Squares, Moment Matrices and Optimization over Polynomials

    , The IMA Volumes in Mathematics and its Applications 149 (2008), 157–270.
  • [20] J. A. De Loera, J. Lee, S. Margulies, and S. Onn,

    Expressing combinatorial optimization problems by systems of polynomial equations and the Nullstellensatz

    , Combinatorics, Probability and Computing

    18 (2009), no. 4, 551–582.
  • [21] L. Lovász, Stable sets and polynomials, Discrete Mathematics 124 (1994), 137–153.
  • [22] S. Margulies and I. V. Hicks, An algebraic exploration of dominating sets and Vizing’s conjecture., Electron. J. Comb. 19 (2012), no. 2, research paper p1, 30.
  • [23] S. Onn, Nowhere-zero flow polynomials, Journal of Combinatorial Theory, Series A 108 (2004), no. 2, 205–215.
  • [24] L. Sun, A result on Vizing’s conjecture, Discrete Mathematics 275 (2004), no. 1, 363–366.
  • [25] The Sage Developers, Sagemath, the Sage Mathematics Software System (Version 8.0), 2017, https://www.sagemath.org.
  • [26] V. Vizing, Some unsolved problems in graph theory, Uspekhi Mat. Nauk 23 (1968), 117–134.
  • [27] H. Wolkowicz, R. Saigal, and L. Vandenberghe (eds.), Handbook of semidefinite programming. Theory, algorithms, and applications., vol. 27, Springer, Cham, 2000.