Discriminants, symmetrized graph monomials, and SOS

Discriminants, symmetrized graph monomials, and sums of squares

Abstract.

Motivated by the necessities of the invariant theory of binary forms J. J. Sylvester constructed in 1878 for each graph with possible multiple edges but without loops its symmetrized graph monomial which is a polynomial in the vertex labels of the original graph. In the 20-th century this construction was studied by several authors. We pose the question for which graphs this polynomial is a non-negative resp. a sum of squares. This problem is motivated by a recent conjecture of F. Sottile and E. Mukhin on discriminant of the derivative of a univariate polynomial, and an interesting example of P. and A. Lax of a graph with edges whose symmetrized graph monomial is non-negative but not a sum of squares. We present detailed information about symmetrized graph monomials for graphs with four and six edges, obtained by computer calculations.

1. Introduction

In what follows by a graph we will always mean a (directed or undirected) graph with (possibly) multiple edges but no loops. The classical construction of J. J. Sylvester and J. Petersen [7, 8] associates to an arbitrary directed loopless graph a symmetric polynomial as follows:

Definition 1.

Let be a directed graph, with vertices and adjacency matrix Define first its graph monomial as follows

where is the number of edges joining with

The symmetrized graph monomial of is defined as

Notice that if the original is undirected one can still define up to a sign by choosing an arbitrary orientation of its edges. Symmetrized graph monomials are closely related to -invariants and covariants and were introduced in 1870’s in attempt to find new tools in the invariant theory. Namely, to obtain an -coinvariant from a given we have to perform two standard operations. First we express the symmetric polynomial in variables in terms of the elementary symmetric functions and obtain the (inhomogeneous) polynomial . Secondly, we perform the standard homogenization of a polynomial of a given degree

The following fundamental proposition apparently goes back to A. Cayley, see Theorem 2.4 of [10].

Theorem 1.

(i) If is a -regular graph with vertices then is either an -invariant of degree in variables or it is identically zero.

(ii) Conversely, if is an -invariant of degree and order then there exist -regular graphs with vertices and integers such that

Remark 1.

Recall that a graph is called -regular if every its vertex has valency . Notice that if is an arbitrary graph then it is natural to interpret its polynomial as the -coinvariant.)

The natural question about the kernel of the map sending to (or to ) was already discussed by J. Petersen who claimed that he has found a necessary and sufficient condition when belongs to the kernel, see [10]. This claim turned out to be false. (An interesting correspondence between J. J. Sylvester, D. Hilbert and F. Klein related to this topic can be found in [11].) The kernel of this map seems to be related to several open problems such as Alon-Tarsi [2] and the Rota basis conjecture [12]. (We want to thank Professor A. Abdesselam for this valuable information, see [1].)

In the present paper we are interested in examples of graphs whose symmetrized graph monomial are non-negative resp. sum of squares. Our interest in this matter has two sources.

The first one is a recent conjecture by F. Sottile and E. Mukhin formulated on the AIM meeting ’Algebraic systems with only real solutions’ in October 2010.

Conjecture 1.

The discriminant of the derivative of a polynomial of degree is the sum of squares of polynomials in the differences of the roots of

Based on our calculations and computer experiments we propose the following extension of the latter conjecture. We call an arbitrary graph with all edges of even multiplicity a square graph. Notice that the symmetrized graph monomial of a square graph is obviously is a sum of squares.

Conjecture 2.

For any non-negative integer the discriminant of the th derivative of a polynomial of degree is a finite positive linear combination of the symmetrized graph monomials where all underlying graphs are square graphs with vertices. On other words, lies in the convex cone spanned by the symmetrized graph monomials of the square graphs with vertices and edges.

Observe that and is, therefore, even. We use the following agreement in our figures below. If a shown graph has fewer vertices than then we always assume that it is appended by the required number of isolated vertices. The following examples support the above conjectures.

Example 1.

If then is proportional to where is the complete graph on vertices with all edges of multiplicity .

Example 2.

For , the discriminant equals

In other words, where the graph is given in Fig. 1 (appended with isolated vertices).

Figure 1. The graph for the case
Example 3.

For we conjecture that the discriminant equals

where the graphs and are given in Fig. 2. (This claim is verified for )

Figure 2. The graphs and for the case
Example 4.

The discriminant is given by

where are given in Fig. 3.

Figure 3. The graphs and for the case
Example 5.

Lastly

where are given in Fig. 4. (Note that this representation as sum of graphs is by no means unique.)

The second motivation of the present study is an interesting example of a graph whose symmetrized graph monomial is non-negative but not a sum of squares. Namely, the main result of [9] shows that for the graph given in Fig. 5 has this property.

Figure 4. The graphs for the case
Figure 5. The only 4-edged graph which yields a non-negative non-sos polynomial.

Our main computer-aided results regarding the case with 4 resp. 6-edged graphs are given below. Notice that there exist graphs with edges and graphs with edges. We say that two graphs are equivalent if their symmetrized graph monomials are non-vanishing identically and proportional.

Proposition 2.

(i) graphs with edges have identically vanishing symmetrized graph monomial. (ii) The remaining graphs are divided into 4 equivalence classes presented in Fig 6. (iii) The first two classes contain square graphs and, thus, their symmetrized monomials are non-negative. (iv) The third graph is non-negative (as a positive linear combination of the Lax graph and a square graph). Since it effectively depends only on three variables, it is SOS, see [4]. (v) The last graph is the Lax graph which is thus the only non-negative graph with edges not being a SOS.

Figure 6. equivalence classes of the 13 graphs with edges, whose symmetrized graph monomials do not vanish identically.
Proposition 3.

(i) graphs with edges have identically vanishing symmetrized graph monomial. (ii) The remaining graphs are divided into 27 equivalence classes. (iii) of these classes can be expressed as non-negative linear combinations of square graphs, i.e. lie in the convex cone spanned by the square graphs. (iv) Of the remaining 15 classes, symmetrized graph monomial of of them change sign. (v) Of the remaining 8 classes (which are presented on Fig. 7) the first 5 are sums of squares, given as matrix representations in the Appendix below. (Notice however that these symmetrized graph monomials do not lie in the convex cone spanned by the square graphs.) (vi) The last 3 classes contain all non-negative graphs with edges, which are not SOS and, therefore, give new examples of graphs a’la Lax.

Figure 7. equivalence classes of all non-negative graphs with edges.

It is classically known that for any given number of vertices and edges , the linear span of the symmetrized graph monomials coming from all graphs with vertices and edges coincides with the linear space of all symmetric translation-invariant polynomials of degree in variables.

We say that a pair is stable if and for stable we suggests a natural basis in of symmetrized graph monomials which seems to be new, proved in Lemma 6, Corollary 4.

In the case of even degree, there is a second basis in of symmetrized graph monomials consisting of only square graphs, see Lemma 8 and Corollary 5.

Notice that translation invariant symmetric polynomials appeared also in the early 1970’s in the study of integrable -body problems in mathematical physics (apparently) see the famous paper of F. Calogero [3]. A few much more recent publications related to the ring of such polynomials in connection with the investigation of multi-particle interactions and the quantum Hall effect were printed since then, see e.g. [6], [5]. In particular, the ring structure and the dimensions of the homogeneous components of this ring were calculated. In particular, it was shown in § IV of [6] and [5] that the ring of translation invariant symmetric polynomials (with integer coefficients) in is isomorphic as a graded ring to the polynomial ring where stands for the -th elementary symmetric function in . From this fact one can easily show that the dimension of its -th homogeneous component equals the number of distinct partitions of where each part is strictly bigger than and the number of parts is at most . Several natural linear bases were also suggested for each such homogeneous component, see (29) in [6] and [5]. It seems that the authors of the latter papers were unaware of the mathematical developments in this field related to graphs.

Acknowledgements. We are sincerely grateful to Professors A. Abdesselam, F. Sottile, B. Sturmfels for discussions and important references and to Doctor P. Rostalski for his assistance with computer-aided proof of the fact that certain symmetrized graph monomials are SOS.

2. Some generalities about symmetrized graph monomials

Definition 2.

Let be a directed graph with edges and vertices Let be an integer partition of A partition-coloring of with is an assignment of colors to the edges and vertices of satisfying the following:

  • For each color we paint the vertex and edges connected to with the color

  • Each edge of is painted with exacly one color.

  • Each vertex is painted at most once.

An edge is odd-colored if it has color and is directed to a vertex with the same color. The coloring is said to be negative if there is an odd number of odd-colored edges in and positive otherwise.

Definition 3.

Given a polynomial and a multi-index we use the notation to denote the coefficient in front of in

Note that we may view as a partition of the sum of the indices.

Lemma 4.

Let be a directed graph with edges and vertices Then is given by the number of positive partition-colorings of with minus the number of negative partition-colorings.

Proof.

See [10, Lemma 2.3]. ∎

2.1. Bases for

It is known that the dimension of with is given by the number of integer partitions of where each part is at least of size 2. Such integer partition will be called a 2-partition.

To each 2-partition , we associate the following graph : For each we have a connected component of consisting of a center vertex, connected to other vertices, with the edges directed away from the center vertex. Since is an integer partition of it follows that has exacly edges. This type of graph will be called a partition graph.

Lemma 5.

Let be a polynomial. Then

Proof.

This is standard, by a straightforward combinatorical argument. ∎

Corollary 1.

If is non-negative, then is non-negative.

Corollary 2.

If is a sum of squares, then is a sum of squares.

Corollary 3.

If then

2.2. Partition graphs

We will use the notation that every symmetric polynomial associated with a graph on edges is symmetrized over variables. Corollary 3 says that if a relation holds for symmetrizations in variables, it will also hold for variables, and therefore, each relation derived in this section also holds for variables.

Lemma 6.

Let be a partition graph with edges, and let be a 2-partition.

Then is

Proof.

We will try to color the graph with

Since we may only color the center vertices of Hence, all edges in each component of must have the same color as the center vertex. It is clear that such coloring is impossible if If we see that each coloring has positive sign, since only center vertices are colored and all connected edges are directed outwards.

The only difference between two colorings must be the assignment of the colors to the center vertices. Hence, components with the same size can permute colors, which yields

number of ways to color with the partition

Corollary 4.

It follows that all partition graphs yield linearly independent polynomials, since each partition graph unique contributes with the monomial The number of partition graphs on edges equals the dimension of and must therefore span the entire vector space.

2.3. Square graphs

We will use the notation to denote a partition where are the odd parts in decreasing order, and are the even parts in decreasing order. Parts are allowed to be equal to 0, so that can be used as multi-index over variables.

Now we define a second type of graphs that we associate with 2-paritions of even integers:

Let , be a 2-partition of Since this is a partition of an even integer, must be even.

For each even we have a connected component of consisting of a center vertex, connected to other vertices, with the edges directed away from the center vertex, and with multiplicity 2.

For each pair of odd parts, we have a connected component consisting of two center vertices and such that is connected to other vertices for with edges of multiplicity 2, and the center vertices are connected with a double edge. This type of component will be called a glued component.

Thus, each edge in has multiplicity 2, and the number of edges, counting multiplicity, is This type of graph will be called a square graph. Note that is a sum of squares.

Figure 8. A base of partition graphs and a base of square graphs in the stable case with 6 edges.
Lemma 7.

Let be a square graph where Then

Proof.

Similarly to Lemma 6, it is clear that a coloring of with colors require that each center vertex is painted.

The center vertex of a component with only two vertices is not uniquely determined, so we have choices of centers.

It is clear that each glued component contributes with exacly one odd edge for every coloring, and the sign is therefore the same for each coloring. The number of glued components are precisely

Lastly, we may permute the colors corresponding to center vertices with the same degree. These observations together yields the formula

Define a total order on 2-partitions as follows:

Definition 4.

Let and be 2-partitions. We say that if for and one of the following holds:

  • and

  • is odd and is even.

This generalizes to

Lemma 8.

Let be a square graph. Then we may write

(1)

where if

Proof.

Let and let with Consider equation (1) and apply on both sides. Lemma 6 implies

It suffices to show that there is no partition-coloring of with if since this implies

We now have three cases to consider:

Case 1: for and where and are either both odd or both even.

We must paint a center vertex and connected edges, since

There is no vacant center vertex in with degree at least all such centers have already been painted with the colors Hence a coloring is impossible in this case.

Case 2: for , is odd and is even. This condition impies that

Every component of has an even number of edges, and only vertices with degree at least three can be colored with an odd color. Therefore, glued components must be colored with exacly zero or two odd colors, and non-glued component must have an even number of edges of each present color. This implies that a coloring is only possible if but this is not true in the considered case.

Hence, there is no coloring of with the colors given by and therefore, the coefficient in front of is 0 in implying

Corollary 5.

The polynomials obtained from the square graphs with edges is a basis for if is even.

Proof.

Let be the 2-partitions of Since is a basis, there is a uniquly determined matrix such that

Lemma 8 implies that is lower-triangular. Lemma 6 and Lemma 7 implies that the entry at in is given by

which is non-zero. Hence has an inverse and the square graphs is a basis. ∎

3. Final remarks

Some obvious challenges related to this project are as follows.

1.� Prove Conjectures 1 and  2.

2.� Describe the boundary of the convex cone spanned by all square graphs with a given number of (double) edges and vertices.

3. Find more examples of graphs a’la Lax.

4. Appendix

Here we give a SOS presentation of the symmetrized graph monomial for the first classes given in Fig. 7. Each row yield the same polynomial, up to a constant. The symmetrized graph monomial from row is a constant multiple of the polynomial where is the coefficient vector and is the corresponding symmetric positive semi-definite matrix, given below. This certifies that the first 5 classes of graphs are sum of squares.

By using Matlab together with Yalmip, one may verify that the last three classes cannot be expressed as sums of squares. It is relatively straightforward to verify that the polynomials indeed are non-negative, using methods similarly to [9].

Figure 9.
Figure 10.
Figure 11.
Figure 12.
Figure 13.

References

  1. A. Abdesselam, Symmetric polynomial from graphs, (mathoverflow.net/users/7410), URL: http://mathoverflow.net/questions/56672 (version: 2011-02-25).
  2. N. Alon and M. Tarsi, Colorings and orientations of graphs, Combinatorica, 12(2) (1992) 125–134.
  3. F. Calogero, Solution of the one-dimensional N-body problems with quadratic and/or inversely quadratic pair potentials. J. Mathematical Phys. 12 (1971), 419–436.
  4. D. Hilbert, Über ternäre definite Formen. (German) Acta Math. 17 (1893), no. 1, 169–197.
  5. J. Liptrap ,On translation invariant symmetric polynomials and Haldane’s conjecture, arXiv:1004.0364 [math.CO].
  6. S. H. Simon, E. H. Rezayi, N. R. Cooper, Pseudopotentials for Multi-particle Interactions in the Quantum Hall Regime, arXiv:cond-mat/0701260v2.
  7. J. J. Sylvester, On an application of the New Atomic Theory of the graphical representation of invariants and covariants of binary quintics, with three appendices. Amer. J. Math. 1 (1878) 64–125.
  8. J. Petersen, Die Theorie der regulären Graphs. Acta Math. 15 (1891) 193–220.
  9. A. Lax, P. Lax, On sums of squares, Linear Algebra and its Applications. 20 (1978) 71–75.
  10. G. Sabidussi, Binary invariants and orientations of graphs. Discrete Mathematics 101 (1992) 251–277.
  11. G. Sabidussi, Correspondence between Sylvester, Petersen, Hilbert adn Klein on invariants and the factorisation of graphs 1889-1891. Discrete Mathematics 100 (1992) 99–155.
  12. M. Wild, On Rota’s problem about bases in a rank matroid. Adv. Math. 108 (1994), no. 2, 336–345.
137431
This is a comment super asjknd jkasnjk adsnkj
Upvote
Downvote
Edit
-  
Unpublish
""
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters
Submit
Cancel
Comments 0
Request comment
""
The feedback must be of minumum 40 characters
Add comment
Cancel
Loading ...

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test
Test description