Application of graph combinatorics to rational identities of type A
To a word , we associate the rational function . The main object, introduced by C. Greene to generalize identities linked to Murnaghan-Nakayama rule, is a sum of its images by certain permutations of the variables. The sets of permutations that we consider are the linear extensions of oriented graphs. We explain how to compute this rational function, using the combinatorics of the graph . We also establish a link between an algebraic property of the rational function (the factorization of the numerator) and a combinatorial property of the graph (the existence of a disconnecting chain).
Key words and phrases:Rational functions, posets, maps
A partially ordered set (poset) is a finite set endowed with a partial order. By definition, a word containing exactly once each element of is called a linear extension if the order of its letters is compatible with (if , then must be before in ). To a linear extension , we associate a rational function:
We can now introduce the main object of the paper. If we denote by the set of linear extensions of , then we define by:
The linear extensions of posets contain very interesting subsets of the symmetric group: for example, the linear extensions of the poset considered in the article BUTLER are the permutations smaller than a permutation for the weak Bruhat order. In this case, our construction is close to that of Demazure characters DEMAZURE. S. Butler and M. Bousquet-Mélou characterize the permutations corresponding to acyclic posets, which are exactly the cases where the function we consider is the simplest.
Moreover, linear extensions are hidden in a recent formula for irreducible character values of the symmetric group: if we use the notations of FS, the quantity can be seen as a sum over the linear extensions of the bipartite graph (bipartite graphs are a particular case of oriented graphs). This explains the similarity of the combinatorics in article Fe and in this one.
The function was considered by C. Greene GREENE, who wanted to generalize a rational identity linked to Murnaghan-Nakayama rule for irreducible character values of the symmetric group. He has given in his article a closed formula for planar posets ( is the Möbius function of ):
However, there is no such formula for general posets, only the denominator of the reduced form of is known Bo. In this article, the first author has investigated the effects of elementary transformations of the Hasse diagram of a poset on the numerator of the associated rational function. He has also noticed, that in some case, the numerator is a specialization of a Schur function (Bo, paragraph 4.2) (we can also find multiSchur functions or Schubert polynomials).
In this paper, we obtain some new results on this numerator, thanks to a simple local transformation in the graph algebra, preserving linear extensions.
1.2. Main results
An inductive algorithm
The first main result of this paper is an induction relation on linear extensions (Theorem LABEL:th:boucle). When one applies on it, it gives an efficient algorithm to compute the numerator of the reduced fraction of (the denominator is already known).
A combinatorial formula
If we iterate our first main result in a clever way, we can describe combinatorially the final result. The consequence is our second main result: if we give to the graph of a poset a rooted map structure, we have a combinatorial non-inductive formula for the numerator of (Theorem LABEL:th:N_combi).
A condition for to factorize
Greene’s formula for the function associated to a planar poset is a quotient of products of polynomials of degree . In the non-planar case, the denominator is still a product of degree 1 terms, but not the numerator. So we may wonder when the numerator can be factorized.
Our third main result is a partial answer (a sufficient but not necessary condition) to this question: the numerator factorizes if there is a chain disconnecting the Hasse diagram of (see Theorem LABEL:factorization_chaine for a precise statement). An example is drawn on figure 1 (the disconnecting chain is ). Note that we use here and in the whole paper a unusual convention: we draw the posets from left (minimal elements) to right (maximal elements).
1.3. Open problems
Around the map structure
Theorem LABEL:th:N_combi is a cominatorial formula for the numerator of involving a map structure on the corresponding graph. Can we find a formula, which does not depend any additional structure on the graph?
Furthermore if we use ordered-embeddings of graphs in (see definition LABEL:def:planar), the map structure is not independant from the poset structure. Is there a way to use this link?
Necessary condition for factorization
The conclusion of the factorization Theorem LABEL:factorization_chaine is sometimes true, even when the separating path is not a chain: see for example Figure 2 (the path disconnects the Hasse diagram, but is not a chain).
This equality, and many more, can be easily proved using the same method as Theorem LABEL:factorization_chaine. Can we give a necessary (and sufficient) condition for the numerator of a poset to factorize into a product of numerators of subposets? Are all factorizations of this kind?
Characterisation of the numerator
Let us consider a bipartite poset (which has only minimal and maximal elements, respectively and ). The numerator of is a polynomial in which degree in each variable can be easily bounded (Bo, Proposition 3.1). Moreover, we know, by Corollary LABEL:corol:annulation, that on some affine subspaces of the space of variables. Unfortunately, these vanishing relations and its degree do not characterize up to a multiplicative factor. Is there a bigger family of vanishing relations, linked to the combinatorics of the Hasse diagram of the poset, which characterizes ?
This question comes from the following observation: for some particular posets, the numerator is a Schubert polynomial and Schubert polynomials are known to be easily defined by vanishing conditions LASCOUX2008.
1.4. Outline of the paper
In section 2, we present some basic definitions on graphs and posets.
In section 3, we introduce our main object and its basic properties.
In section LABEL:sect_oper, we state our first main result: an inductive relation for linear extensions. The next section (LABEL:sect_exemples) is devoted to some explicit computations using this result.
Section LABEL:sect:combi gives a combinatorial description of the result of the iteration of our inductive relation: we derive from it our second main result, a combinatorial formula for the numerator of .
The last Section (LABEL:sectchainfact) is devoted to our third main result: a sufficient condition of factorization.
2. Graphs and posets
Oriented graphs are a natural way to encode information of posets. To avoid confusions, we recall all necessary definitions in paragraph 2.1. The definition of linear extensions can be easily formulated directly in terms of graphs (paragraph 2.2).
We will also define some elementary removal operations on graphs (paragraph 2.3), which will be used in the next section. Due to transitivity relations, it is not equivalent to perform these operations on the Hasse diagram or on the complete graph of a poset, that’s why we prefer to formulate everything in terms of graphs.
2.1. Definitions and notations on graphs
In this paper, we deal with finite directed graphs. So we will use the following definition of a graph :
A finite set of vertices .
A set of edges defined by .
If , we will note by the first component of (called origin of ) and its second component (called end of ). This means that each edge has an orientation.
Let be an element of . Then we denote by the pair .
With this definition of graphs, we have four definitions of injective walks on the graph.
Let be a graph and its set of edges.
A chain is a sequence of edges of such that , , and .
A circuit is a chain of such that .
A path is a sequence of elements of such that , , and .
A cycle is a path with the additional property that . If is a cycle, then we denote by the set .
In all these definitions, we add the condition that all edges and vertices are different (except of course, the equalities in the definition).
The difference between a cycle and a circuit (respectively a path and a chain) is that, in a cycle (respectively in a path), an edge can appear in both directions (not only in the direction given by the graph structure). The edges, which appear in a cycle with the same orientation than their orientation in the graph, are exactly the elements of .
To make the figures easier to read, is always the left-most extremity of and its right-most one. Such drawing construction is not possible if the graph contains a circuit. But its case will not be very interesting for our purpose.
An example of graph is drawn on figure 3. In the left-hand side, the non-dotted edges form a chain , whereas, in the right-hand side, they form a cycle , such that contains 3 edges: and .
The cyclomatic number of a graph is , where is the number of connected components of . A graph contains a cycle if and only if its cyclomatic number is not (see GRAPH). If it is not the case, the graph is called forest. A connected forest is, by definition, a tree. Beware that, in this context, there are no rules for the orientation of the edges of a tree (often, in the literature, an oriented tree is a tree which edges are oriented from the root to the leaves, but we do not consider such objects here).
2.2. Posets, graphs, Hasse diagrams and linear extensions
In this paragraph, we recall the link between graphs and posets.
Given a graph , we can consider the binary relation on the set of vertices of :
This binary relation can be completed by transitivity. If the graph has no circuit, the resulting relation is antisymmetric and, hence, endows the set with a poset structure, which will be denoted .
The application is not injective. Among the pre-images of a given poset , there is a minimum one (for the inclusion of edge set), which is called Hasse diagram of (see figure 4 for an example).
The definition of linear extensions given in the introduction can be formulated in terms of graphs:
A linear extension of a graph is a total order on the set of vertices such that,
for each edge of , one has .
The set of linear extensions of is denoted . Let us also define the formal sum .
We will often see a total order defined by as a word .
For example, the linear extensions of the poset drawn in the figure 4 are and .
If contains a circuit, then it has no linear extensions. Else, its linear extensions are the linear extensions of . Thus considering graphs instead of posets does not give more general results.
The following lemma comes straight forward from the definition:
Let and be two graphs with the same set of vertices. Then one has:
where is defined by
2.3. Elementary operations on graphs
The main tool of this paper consists in removing some edges of a graph .
Let be a graph and a subset of its set of edges . We will denote by the graph with
the same set of vertices as ;
the set of edges defined by .
If is a graph and a subset of its set of vertices , has an induced graph structure: its edges are exactly the edges of , which have both their extremities in .
If , the graph induced by will be denoted by . The symbol is the same than in definition 2.3, but it should not be confusing.
Definition 2.5 (Contraction).
We denote by the graph (here, the set of edges can be a multiset) obtained by contracting the edge (i.e. in , there is only one vertex instead of and , the edges of different from are edges of : if their origin and/or end in is or , it is in ).
Then, if , is a graph with the same number of connected components and the same cyclomatic number as .
3. Rational functions on graphs
Given a graph with vertices , we are interested in the following rational function in the variables :
We also consider the renormalization:
In fact, we will see later that it is a polynomial. Moreover, if is the Hasse diagram of a poset, is a reduced fraction.
3.2. Pruning invariance
Thanks to the following lemma, it will be easy to compute on forests (note that these results have already been proved in Bo, but the following demonstrations are simpler and make this article self-contained).
Let be a graph with a vertex of valence and the edge of extremity (origin or end) . Then one has
One wants to prove that:
But one has a map which sends a word to the word obtained from by erasing the letter (see figure LABEL:fig_example_er). So it is enough to prove that, for each , one has :
Let us assume that is the end of and . We denote by the index in of the origin of . The set is: