Markov chains for promotion operators

Markov chains for promotion operators

Arvind Ayyer Department of Mathematics, UC Davis, One Shields Ave., Davis, CA 95616-8633, U.S.A.
New address: Department of Mathematics, Department of Mathematics, Indian Institute of Science, Bangalore - 560012, India.
arvind@math.iisc.ernet.in
Steven Klee Seattle University, Department of Mathematics, 901 12th Avenue E, Seattle, WA 98122, U.S.A klee@math.ucdavis.edu  and  Anne Schilling Department of Mathematics, UC Davis, One Shields Ave., Davis, CA 95616-8633, U.S.A. anne@math.ucdavis.edu Dedicated to Mohan Putcha and Lex Renner on the occasion of their 60th birthdays.
Abstract.

We consider generalizations of Schützenberger’s promotion operator on the set of linear extensions of a finite poset. This gives rise to a strongly connected graph on . In earlier work [AKS12], we studied promotion-based Markov chains on these linear extensions which generalizes results on the Tsetlin library. We used the theory of -trivial monoids in an essential way to obtain explicitly the eigenvalues of the transition matrix in general when the poset is a rooted forest. We first survey these results and then present explicit bounds on the mixing time and conjecture eigenvalue formulas for more general posets. We also present a generalization of promotion to arbitrary subsets of the symmetric group.

Key words and phrases:
Posets, Linear extensions, Promotion, Markov chains, Tsetlin library, -trivial monoids
1991 Mathematics Subject Classification:
Primary 06A07, 20M32, 20M30, 60J27; Secondary: 47D03
A.A. would like to acknowledge support from MSRI, where part of this work was done. S.K. was supported by NSF VIGRE grant DMS–0636297. A.S. was supported by NSF grant DMS–1001256 and OCI–1147247.

1. Introduction

Schützenberger [Sch72] introduced the notion of evacuation and promotion on the set of linear extensions of a finite poset of size . This generalizes promotion on standard Young tableaux defined in terms of jeu-de-taquin moves. Haiman [Hai92] as well as Malvenuto and Reutenauer [MR94] simplified Schützenberger’s approach by expressing the promotion operator in terms of more fundamental operators (), which either act as the identity or as a simple transposition. A beautiful survey on this subject was written by Stanley [Sta09].

In earlier work, we considered a slight generalization of the promotion operator [AKS12] defined as for with being the original promotion operator. In Section 2 we define the extended promotion operator, give examples and state some of its properties. We survey our results on Markov chains based on the operators , which act on the set of all linear extensions of (denoted ) in Section 3.

Our results [AKS12] can be viewed as a natural generalization of the results of Hendricks [Hen72, Hen73] on the Tsetlin library [Tse63], which is a model for the way an arrangement of books in a library shelf evolves over time. It is a Markov chain on permutations, where the entry in the th position is moved to the front with probability . From our viewpoint, Hendricks’ results correspond to the case when is an anti-chain and hence is the full symmetric group. Many variants of the Tsetlin library have been studied and there is a wealth of literature on the subject. We refer the interested reader to the monographs by Letac [Let78] and by Dies [Die83], as well as the comprehensive bibliographies in [Fil96] and [BHR99].

One of the most interesting properties of the Tsetlin library Markov chain is that the eigenvalues of the transition matrix can be computed exactly. The exact form of the eigenvalues was independently investigated by several groups. Notably Donnelly [Don91], Kapoor and Reingold [KR91], and Phatarfod [Pha91] studied the approach to stationarity in great detail. There has been some interest in finding exact formulas for the eigenvalues for generalizations of the Tsetlin library. The first major achievement in this direction was to interpret these results in the context of hyperplane arrangements [Bid97, BHR99, BD98]. This was further generalized to a class of monoids called left regular bands [Bro00] and subsequently to all bands [Bro04] by Brown. This theory has been used effectively by Björner [Bjö08, Bjö09] to extend eigenvalue formulas on the Tsetlin library from a single shelf to hierarchies of libraries.

We present without proof our explicit combinatorial formulas [AKS12] for the eigenvalues and multiplicities for the transition matrix of the promotion Markov chain when the underlying poset is a rooted forest in Section 4 (see Theorem 4.2). The proof of eigenvalues and their multiplicities follows from the -triviality of the underlying monoid using results by Steinberg [Ste06, Ste08]. Intuition on why the promotion monoid is -trivial is stated in Section 5.

The remainder of the paper contains new results and is outlined as follows. In Section 6, we prove a formula for the mixing time of the promotion Markov chain. This improves the result stated without proof in the Outlook section of [AKS12]. In Section 7, we present a partial conjecture for the eigenvalues of the transition matrix of posets which are not rooted forests. We give supporting data for our conjectures with formulas for all posets of size 4. Lastly, Section 8 defines a generalization of promotion on arbitrary subsets of and gives a formula for its stationary distribution.

Acknowledgements

We would like to thank the organizers Mahir Can, Zhenheng Li, Benjamin Steinberg, and Qiang Wang of the workshop on “Algebraic monoids, group embeddings and algebraic combinatorics” held July 3-6, 2012 at the Fields Institute at Toronto for giving us the opportunity to present this work. We would like to thank Nicolas M. Thiéry for discussions.

The Markov chains presented in this paper are implemented in a Maple package by the first author (AA) available from his home page and in Sage [S12, SCc12] by the third author (AS). Many of the pictures presented here were created with Sage.

2. Extended promotion on linear extensions

Let be an arbitrary poset of size , with partial order denoted by . We assume that the elements of are labeled by integers in . In addition, we assume that the poset is naturally labeled, that is if with in then as integers. Let be the set of its linear extensions,

(2.1)

which is naturally interpreted as a subset of the symmetric group . Note that the identity permutation always belongs to . Let be the natural (induced) subposet of consisting of elements such that  [Sta97].

We now briefly recall the idea of promotion of a linear extension of a poset . Start with a linear extension and imagine placing the label in at the location . By the definition of the linear extension, the labels will be well-ordered. The action of promotion of will give another linear extension of as follows:

  1. The process starts with a seed, the label 1. First remove it and replace it by the minimum of all the labels covering it, , say.

  2. Now look for the minimum of all labels covering in the original poset, and replace it, and continue in this way.

  3. This process ends when a label is a “local maximum.” Place the label at that point.

  4. Decrease all the labels by 1.

This new linear extension is denoted [Sta09].

Example 2.1.

Figure 1 shows a poset (left) to which we assign the identity linear extension . The linear extension obtained by applying the promotion operator is depicted on the right. Note that indeed we place in position , namely 3 is in position 5 in , so that 5 in is where 3 was originally.

Figure 1. A linear extension (left) and (right).

Figure 2 illustrates the steps used to construct the linear extension from the linear extension from Figure 1.

Step 1: Remove the minimal element . Step 2: The minimal element that covered was , so replace with . Step 2 (continued): The minimal element that covered was , so replace with .

Step 2 (continued): The minimal element that covered was , so replace with . Step 3: Since was a local maximum, replace with . Step 4: Decrease all labels by . The resulting linear extension is .


Figure 2. Constructing from .

The definition of promotion was originally motivated by the following construction. The Young diagram of a partition (with English notation) can naturally be viewed as a poset on the boxes of the diagram ordered according to the rule that a box is covered by any boxes immediately below it or to its right. The linear extensions of this poset are standard Young tableaux of shape . In this context, the definition of promotion is a natural generalization of the standard promotion operator used in the RSK algorithm. On semistandard tableaux, promotion is also used to define affine crystal structures in type  [Sh02] and it has applications to the cyclic sieving phenomenon [Rh10]. The above definition of promotion for arbitrary posets is originally due to Schützenberger [Sch72].

We now generalize the above construction to extended promotion, whose seed is any of the numbers . The algorithm is similar to the original one, and we describe it for seed . Start with the subposet and perform steps 1–3 in a completely analogous fashion. Now decrease all the labels strictly larger than by 1 in (not only ). Clearly this gives a new linear extension, which we denote . Note that is always the identity.

The extended promotion operator can be expressed in terms of more elementary operators () as shown in [Hai92, MR94, Sta09] and has explicitly been used to count linear extensions in [EHS89]. Let be a linear extension of a finite poset in one-line notation. Then

(2.2)

Alternatively, acts non-trivially on a linear extension if interchanging entries and yields another linear extension. Then as an operator on ,

(2.3)

3. Promotion Markov chains

We now consider two discrete-time Markov chains related to the extended promotion operator. For completeness, we briefly review the part of the theory relevant to us.

Fix a finite poset of size . The operators define a directed graph on the set of linear extensions . The vertices of the graph are the elements in and there is an edge from to if . We can now consider random walks on this graph with probabilities given formally by which sum to 1. We give two ways to assign the edge weights, see Sections 3.1 and 3.2. An edge with weight is traversed with that rate. A priori, the ’s must be positive real numbers for this to make sense according to the standard techniques of Markov chains. However, the ideas work in much greater generality and one can think of this as an “analytic continuation.”

A discrete-time Markov chain is defined by the transition matrix , whose entries are indexed by elements of the state space. In our case, they are labeled by elements of . We take the convention that the entry gives the probability of going from . The special case of the diagonal entry at gives the probability of a loop at the . This ensures that column sums of are one and consequently, one is an eigenvalue with row (left-) eigenvector being the all-ones vector. A Markov chain is said to be irreducible if the associated digraph is strongly connected. In addition, it is said to be aperiodic if the greatest common divisor of the lengths of all possible loops from any state to itself is one. For irreducible aperiodic chains, the Perron-Frobenius theorem guarantees that there is a unique stationary distribution. This is given by the entries of the column (right-) eigenvector of with eigenvalue 1. Equivalently, the stationary distribution is the solution of the master equation, given by

(3.1)

Edges which are loops contribute to both sides equally and thus cancel out. For more on the theory of finite state Markov chains, see [LPW09].

We set up a running example that will be used for each case.

Example 3.1.

Define by its covering relations , so that its Hasse diagram is the first diagram in the list below:

12431234132421432134

The remaining graphs correspond to the linear extensions

3.1. Uniform promotion graph

The vertices of the uniform promotion graph are labeled by elements of and there is an edge between and if and only if for some . In this case, the edge is given the symbolic weight .

Example 3.2.

The uniform promotion graph for the poset in Example 3.1 is illustrated in Figure 3.

1234

1243

2134

2143

1423

Figure 3. Uniform promotion graph for Example 3.1. Every vertex has four outgoing edges labeled to and self-loops are not drawn.

The transition matrix, with the lexicographically ordered basis, is given by

Note that the row sums are one although the matrix is not symmetric, so that the stationary state of this Markov chain is uniform. We state this for general finite posets in Theorem 3.6.

The variable occurs only on the diagonal in the above transition matrix. This is because the action of (or in general ) maps every linear extension to itself resulting in a loop.

3.2. Promotion graph

The promotion graph is defined in the same fashion as the uniform promotion graph with the exception that the edge between and when is given the weight .

Example 3.3.

The promotion graph for the poset of Example 3.1 is illustrated in Figure 4. Although it might appear that there are many more edges here than in Figure 3, this is not the case.

1234

1243

2134

2143

1423

Figure 4. Promotion graph for Example 3.1. Every vertex has four outgoing edges labeled to and self-loops are not drawn.

The transition matrix this time is given by

Notice that row sums are no longer one. The stationary distribution, as a vector written in row notation is

Again, we will give a general such result in Theorem 3.7.

3.3. Irreducibility and stationary states

In this section we summarize some properties of the promotion Markov chains of Sections 3.1 and 3.2 and state their stationary distributions. Proofs of these statements can be found in [AKS12].

Proposition 3.4.

Consider the digraph whose vertices are labeled by elements of and whose edges are given as follows: for , there is an edge between and in if and only if for some . Then is strongly connected.

Corollary 3.5.

Assuming that the edge weights are strictly positive, the two Markov chains of Sections 3.1 and 3.2 are irreducible and ergodic. Hence their stationary states are unique.

Next we state properties of the stationary state of the two discrete time Markov chains, assuming that all ’s are strictly positive.

Theorem 3.6.

The discrete time Markov chain according to the uniform promotion graph has the uniform stationary distribution, that is, each linear extension is equally likely to occur.

We now turn to the promotion graphs. In this case we find nice product formulas for the stationary weights.

Theorem 3.7.

The stationary state weight of the linear extension for the discrete time Markov chain for the promotion graph is given by

(3.2)

assuming .

Remark 3.8.

The entries of do not, in general, sum to one. Therefore this is not a true probability distribution, but this is easily remedied by a multiplicative constant depending only on the poset .

When is the -antichain, then . In this case, the probability distribution of Theorem 3.7 has been studied in the past by Hendricks [Hen72, Hen73] and is known as the Tsetlin library [Tse63], which we now describe. Suppose that a library consists of books on a single shelf. Assume that only one book is picked at a time and is returned before the next book is picked up. The book is picked with probability and placed at the end of the shelf.

We now explain why promotion on the -antichain is the Tsetlin library. A given ordering of the books can be identified with a permutation . The action of on gives by (2.3), where now all the ’s satisfy the braid relation since none of the ’s are comparable. Thus the -th element in is moved all the way to the end. The probability with which this happens is , which makes this process identical to the action of the Tsetlin library.

The stationary distribution of the Tsetlin library is a special case of Theorem 3.7. In this case, of Remark 3.8 also has a nice product formula, leading to the probability distribution,

(3.3)

Letac [Let78] considered generalizations of the Tsetlin library to rooted trees (meaning that each element in besides the root has precisely one successor). Our results hold for any finite poset .

4. Partition functions and eigenvalues for rooted forests

For a certain class of posets, we are able to give an explicit formula for the probability distribution for the promotion graph. Note that this involves computing the partition function (see Remark 3.8). We can also specify all eigenvalues and their multiplicities of the transition matrix explicitly. Proofs of these statements can be found in [AKS12].

Before we can state the main theorems of this section, we need to make a couple of definitions. A rooted tree is a connected poset, where each node has at most one successor. Note that a rooted tree has a unique largest element. A rooted forest is a union of rooted trees. A lower set (resp. upper set) in a poset is a subset of the nodes such that if and (resp. ), then also . We first give the formula for the partition function.

Theorem 4.1.

Let be a rooted forest of size and let . The partition function for the promotion graph is given by

(4.1)

Let be a finite poset with smallest element and largest element . Following [Bro00, Appendix C], one may associate to each element a derangement number defined as

(4.2)

where is the Möbius function for the interval  [Sta97, Section 3.7] and is the number of maximal chains in the interval .

A permutation is a derangement if it does not have any fixed points. A linear extension is called a poset derangement if it is a derangement when considered as a permutation. Let be the number of poset derangements of the poset .

A lattice is a poset in which any two elements have a unique supremum (also called join) and a unique infimum (also called meet). For the join is denoted by , whereas the meet is . For an upper semi-lattice we only require the existence of a unique supremum of any two elements.

Theorem 4.2.

Let be a rooted forest of size and the transition matrix of the promotion graph of Section 3.2. Then

where and is the derangement number in the lattice (by inclusion) of upper sets in . In other words, for each subset , which is an upper set in , there is an eigenvalue with multiplicity .

The proof of Theorem 4.2 follows from the fact that the monoid corresponding to the transition matrix is -trivial. When is a union of chains, which is a special case of rooted forests, we can express the eigenvalue multiplicities directly in terms of the number of poset derangements.

Theorem 4.3.

Let be a union of chains of size whose elements are labeled consecutively within chains. Then

where .

Note that the antichain is a special case of a rooted forest and in particular a union of chains. In this case the Markov chain is the Tsetlin library and all subsets of are upper (and lower) sets. Hence Theorem 4.2 specializes to the results of Donnelly [Don91], Kapoor and Reingold [KR91], and Phatarford [Pha91] for the Tsetlin library.

The case of unions of chains, which are consecutively labeled, can be interpreted as looking at a parabolic subgroup of . If there are chains of lengths for , then the parabolic subgroup is . In the realm of the Tsetlin library, there are books of the same color. The Markov chain consists of taking a book at random and placing it at the end of the stack.

5. -trivial monoids

In this section we briefly outline the proof of Theorem 4.2. More details can be found in [AKS12].

A finite monoid is a finite set with an associative multiplication and an identity element. Green [Gre51] defined several preorders on . In particular for the - and -order is defined as

(5.1)

This ordering gives rise to equivalence classes (-classes or -classes)

The monoid is said to be -trivial (resp. -trivial) if all -classes (resp. -classes) have cardinality one.

Now let be a rooted forest of size and for the operators on defined by the promotion graph of Section 3.2. That is, for , the operator maps to if . We are interested in the monoid generated by . The next lemma shows that the action of the generators for rooted forests is very similar to the action of the operators of the Tsetlin library by moving the letter to the end; the difference in this case is that letters above need to be reordered according to the poset.

Lemma 5.1.

Let and be as above, and . Then is the linear extension in obtained from by moving the letter to position and reordering all letters .

Example 5.2.

Let be the union of a chain of length 3 and a chain of length 2, where the first chain is labeled by the elements and the second chain by . Then , which is obtained by moving the letter 1 to the end of the word and then reordering the letters , so that the result is again a linear extension of .

Let be the transition matrix of the promotion graph of Section 3.2. Define to be the monoid generated by , where is the matrix evaluated at and all other . We are now ready to state the main result of this section.

Theorem 5.3.

is -trivial.

Remark 5.4.

Considering the matrix monoid is equivalent to considering the abstract monoid generated by . Since the operators act on the right on linear extensions, the monoid is -trivial instead of -trivial.

The proof of Theorem 5.3 exploits Lemma 5.1 by proving that there is an order on idempotents using right factors. For , let be the maximal common right factor of all elements in the image of , that is, all elements can be written as and there is no bigger right factor for which this is true. Let us also define the set of entries in the right factor . Note that since all elements in the image set of are linear extensions of , is an upper set of . Theorem 5.3 is then established by showing that for idempotents , the set is the same as the left stabilizer which imposes a partial order.

Example 5.5.

Let be the poset on three elements , where covers and there are no further relations. The linear extensions of are . The monoid with -order, where an edge labeled means right multiplication by , is depicted in Figure 5. From the picture it is clear that the elements in the monoid are partially ordered.

This confirms Theorem 5.3 that the monoid is -trivial.

Figure 5. Monoid in right order for the poset of Example 5.5. With the conventions in (5.1), the identity is the biggest element in -order.

The proof of Theorem 4.2 now follows from [Ste06, Theorems 6.3 and 6.4] and some further considerations regarding the lattice . For more details see [AKS12, Section 6].

6. Mixing Times

For random walks on hyperplane arrangements, Brown and Diaconis [BD98] (see also [AD10]) give explicit bounds for the rates of convergence to stationarity. These bounds still hold for Markov chains related to left-regular bands [Bro00]. Here we present analogous results for the Markov chains corresponding to the -trivial monoids of Section 4. The methods are very similar to the ones we used for Markov chains related to nonabelian sandpile models [ASST13], which also turn out to yield -trivial monoids.

The rate of convergence is the total variation distance from stationarity after steps, that is,

where is the distribution after steps and is the stationary distribution.

Theorem 6.1.

Let be a rooted forest with and . Then, as soon as , the distance to stationarity of the promotion Markov chain satisfies

The mixing time [LPW09] is the number of steps until (where different authors use different conventions for the value of ). Using Theorem 6.1 we require

which shows that the mixing time is at most . If the probability distribution is uniform, then is of order and the mixing time is of order at most .

The proof of Theorem 6.1 follows the same outline as the proof in [ASST13, Section 5.3]. We need to define a statistic for such that is minimal if and only if is the constant map and furthermore

  1. decreases along -order: for any .

  2. Existence of generator with strict decrease: There exists a generator such that .

Unlike in [ASST13], we take with lexicographic ordering on , that is if either , or and . Set , where . It is clear that if and only if is a constant map, which is the minimal value can achieve. The maximal value of is achieved by the identity . The two conditions follow from [AKS12, Section 6]: either the right factor increases by right multiplication by a generator ; if not, then must be an upper set again and .

Therefore, the probability that after steps of the right random walk on is bounded above by the probability of having at most successes in Bernoulli trials with success probability . A successful step is one that decreases the statistic . Using Chernoff’s inequality for the cumulative distribution function of a binomial random variable as in [ASST13] we obtain Theorem 6.1.

7. Other Posets

So far [AKS12], we have characterized posets, where the Markov chains for the promotion graph yield certain simple formulas for their eigenvalues and multiplicities. The eigenvalues have explicit expressions for rooted forests and there is an explicit combinatorial interpretation for the multiplicities as derangement numbers of permutations for unions of chains by Theorem 4.3.

However, we have not classified all possible posets, whose promotion graphs have nice properties. For example, the non-zero eigenvalues of the transition matrix of the promotion graph of the poset in Example 3.1 are given by

even though the corresponding monoid is not -trivial (in fact, it is not even aperiodic). The egg-box picture of the monoid is given in Figure 6. Notice that one of the eigenvalues is negative.

Figure 6. Egg-box picture for the monoid associated to the promotion Markov chain for the poset in Example 3.1.
Poset Eigenvalues (other than 1)

Table 1. All inequivalent posets of size 4 whose promotion transition matrices have simple expressions for their eigenvalues.

On the other hand, not all posets have this property. In particular, the poset with covering relations and has six linear extensions, but the characteristic polynomial of its transition matrix does not factorize at all. It would be interesting to classify all posets with the property that all the eigenvalues of the transition matrices of the promotion Markov chain are linear in the probability distribution . In such cases, one would also like an explicit formula for the multiplicity of these eigenvalues.

We list all posets of size 4, which are not down forests and which nonetheless have simple linear expressions for their eigenvalues in Table 1 along with the eigenvalues. For all such posets, there is at least one eigenvalue which contains a negative term. The posets, which are not down forests and the eigenvalues of whose promotion transition matrices have nonlinear expressions, are given in Table 2. Comparing the two tables, it is not obvious how to characterize those posets where the eigenvalues are simple. It would be interesting to classify posets where all eigenvalues are linear in the parameters and understand the eigenvalues and their multiplicities completely. For comparison, the egg-box picture of the second poset in Table 2 is presented in Figure 7.

Table 2. All inequivalent posets of size 4 whose promotion transition matrices do not have simple expressions for their eigenvalues.
Figure 7. Egg-box picture for the monoid associated to the promotion Markov chain for the second poset in Table 2.

Using data from all posets which are not down forests of sizes up to 7, we have the following necessary (but not sufficient) conjecture.

Conjecture 7.1.

Let be a poset of size which is not a down forest and be its promotion transition matrix. If has eigenvalues which are linear in the parameters , then the following hold

  1. the coefficients of the parameters in the eigenvalues are only one of ,

  2. each element of has at most two successors,

  3. the only parameters whose coefficients in the eigenvalues are -1 are those which either have two successors or one of whose successors have two successors.

8. Subsets of

We define a generalization of the action of promotion on an arbitrary nonempty subset of inspired by the ideas in [Hai92, MR94, Sta09]. Let be such a subset and suppose in one-line notation. Then we define the operator for as

(8.1)

In other words, acts non-trivially on a permutation in if interchanging entries and yields another permutation in , and otherwise acts as the identity. Then the generalized promotion operator, also denoted , is an operator on defined by

(8.2)

As in Sections 3.1 and 3.2, we can define a promotion graph whose vertices are the elements of the set and where there is an edge between permutations and if and only if . In the uniform promotion case, such an edge has weight and in the promotion case, the edge has weight . In both cases, we have analogous Markov chains. We describe the stationary distribution of these chains below.

Theorem 8.1.

Assuming the promotion graph for is strongly connected, the unique stationary state weight of the permutation for the corresponding discrete time Markov chain is

  1. in the uniform promotion case

    (8.3)
  2. in the promotion case

    (8.4)

The proofs are essentially identical to the proofs of Theorem 3.6 and Theorem 3.7 given in [AKS12] and are skipped.

Remark 8.2.

  1. The entries of do not, in general, sum to one. Therefore this is not a true probability distribution, but this is easily remedied by a multiplicative constant depending only on the subset .

  2. Even if the set is such that the promotion graph is not strongly connected, (8.3) and (8.4) hold. However, the formula need not be unique. The proofs of Theorem 8.1 still go through because all we need to do is to verify that the master equation (3.1) holds.

There is a natural way to build subsets which cannot be the set of linear extensions for any poset , and whose promotion graphs are yet strongly connected. The idea is to consider a union of sorting networks. A sorting network from the identity permutation to any permutation is a shortest path from one to the other by a series of nearest-neighbor transpositions. In other words, these are maximal chains in right weak order starting at the identity. For example, one sorting network to the permutation is

Proposition 8.3.

Let be a union of sorting networks. Consider the digraph whose vertices are labeled by the elements of and whose edges are given as follows: for , there is an edge between and in if and only if for some . Then is strongly connected.

Proof.

The operators are each invertible, which means that each vertex of has exactly one edge pointing in and one pointing out for each . Therefore, it suffices to show that there is a directed path from to for every in .

By definition of a sorting network, can be written as . Although the action of each depends crucially on the set , they satisfy . Using the fact that and (8.2), one can recursively express each as a product of ’s analogous to the proof of Lemma 2.3 in [AKS12]. ∎

As a consequence of Proposition 8.3, the unique stationary distribution of a subset which is a union of sorting networks is given by (8.4). One is naturally led to ask whether the eigenvalues of these transition matrices are also linear in the parameters. This does not seem to be true in any general sense.

References

  • [1]
  • [AKS12] Arvind Ayyer, Steven Klee and Anne Schilling, Combinatorial Markov chains on linear extensions. J. Algebraic Combin., submitted (arXiv:1205.7074).
  • [ASST13] Arvind Ayyer, Anne Schilling, Ben Steinberg and Nicolas M. Thiéry, Directed nonabelian sandpile models on trees. preprint arXiv.1305.1697.
  • [AD10] Christos A. Athanasiadis and Persi Diaconis. Functions of random walks on hyperplane arrangements. Adv. in Appl. Math., 45(3):410–437, 2010.
  • [BD98] Kenneth S. Brown and Persi Diaconis. Random walks and hyperplane arrangements. Ann. Probab., 26(4):1813–1854, 1998.
  • [BHR99] Pat Bidigare, Phil Hanlon, and Dan Rockmore. A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements. Duke Math. J., 99(1):135–174, 1999.
  • [Bid97] Thomas Patrick Bidigare. Hyperplane arrangement face algebras and their associated Markov chains. ProQuest LLC, Ann Arbor, MI, 1997. Thesis (Ph.D.)–University of Michigan.
  • [Bjö08] Anders Björner. Random walks, arrangements, cell complexes, greedoids, and self-organizing libraries. In Building bridges, volume 19 of Bolyai Soc. Math. Stud., pages 165–203. Springer, Berlin, 2008.
  • [Bjö09] Anders Björner. Note: Random-to-front shuffles on trees. Electron. Commun. Probab., 14:36–41, 2009.
  • [Bro00] Kenneth S. Brown. Semigroups, rings, and Markov chains. J. Theoret. Probab., 13(3):871–938, 2000.
  • [Bro04] Kenneth S. Brown. Semigroup and ring theoretical methods in probability. In Representations of finite dimensional algebras and related topics in Lie theory and geometry, volume 40 of Fields Inst. Commun., pages 3–26. Amer. Math. Soc., Providence, RI, 2004.
  • [Die83] Jacques-Édouard Dies. Chaînes de Markov sur les permutations, volume 1010 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1983.
  • [Don91] Peter Donnelly. The heaps process, libraries, and size-biased permutations. J. Appl. Probab., 28(2):321–335, 1991.
  • [EHS89] Paul Edelman, Takayuki Hibi, and Richard P. Stanley. A recurrence for linear extensions. Order, 6(1):15–18, 1989.
  • [Fil96] James Allen Fill. An exact formula for the move-to-front rule for self-organizing lists. J. Theoret. Probab., 9(1):113–160, 1996.
  • [Gre51] J. A. Green. On the structure of semigroups. Ann. of Math. (2), 54:163–172, 1951.
  • [Hai92] Mark D. Haiman. Dual equivalence with applications, including a conjecture of Proctor. Discrete Math., 99(1-3):79–113, 1992.
  • [Hen72] W. J. Hendricks. The stationary distribution of an interesting Markov chain. J. Appl. Probability, 9:231–233, 1972.
  • [Hen73] W. J. Hendricks. An extension of a theorem concerning an interesting Markov chain. J. Appl. Probability, 10:886–890, 1973.
  • [KR91] Sanjiv Kapoor and Edward M. Reingold. Stochastic rearrangement rules for self-organizing data structures. Algorithmica, 6(2):278–291, 1991.
  • [Let78] Gérard Letac. Chaînes de Markov sur les permutations, volume 63 of Séminaire de Mathématiques Supérieures [Seminar on Higher Mathematics]. Presses de l’Université de Montréal, Montreal, Que., 1978.
  • [LPW09] David A. Levin, Yuval Peres, and Elizabeth L. Wilmer. Markov chains and mixing times. American Mathematical Society, Providence, RI, 2009. With a chapter by James G. Propp and David B. Wilson.
  • [MR94] Claudia Malvenuto and Christophe Reutenauer. Evacuation of labelled graphs. Discrete Math., 132(1-3):137–143, 1994.
  • [Pha91] R. M. Phatarfod. On the matrix occurring in a linear search problem. J. Appl. Probab., 28(2):336–346, 1991.
  • [Rh10] Brendon Rhoades. Cyclic sieving, promotion, and representation theory. J. Combin. Theory Ser. A, 117(1): 38–76, 2010.
  • [S12] W. A. Stein et al. Sage Mathematics Software (Version 5.0). The Sage Development Team, 2012. http://www.sagemath.org.
  • [SCc12] The Sage-Combinat community. Sage-Combinat: enhancing Sage as a toolbox for computer exploration in algebraic combinatorics, 2012. http://combinat.sagemath.org.
  • [Sch72] M. P. Schützenberger. Promotion des morphismes d’ensembles ordonnés. Discrete Math., 2:73–94, 1972.
  • [Sh02] Mark Shimozono. Affine type A crystal structure on tensor products of rectangles, Demazure characters, and nilpotent varieties. J. Algebraic Combin., 15(2):151–187, 2002.
  • [Sta97] Richard P. Stanley. Enumerative combinatorics. Vol. 1, volume 49 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1997. With a foreword by Gian-Carlo Rota, Corrected reprint of the 1986 original.
  • [Sta09] Richard P. Stanley. Promotion and evacuation. Electron. J. Combin., 16(2, Special volume in honor of Anders Bjorner):Research Paper 9, 24, 2009.
  • [Ste06] Benjamin Steinberg. Möbius functions and semigroup representation theory. J. Combin. Theory Ser. A, 113(5):866–881, 2006.
  • [Ste08] Benjamin Steinberg. Möbius functions and semigroup representation theory. II. Character formulas and multiplicities. Adv. Math., 217(4):1521–1557, 2008.
  • [Tse63] M L Tsetlin. Finite automata and models of simple forms of behaviour. Russian Mathematical Surveys, 18(4):1, 1963.
  • [2]
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
""
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
   
Add comment
Cancel
Loading ...
243883
This is a comment super asjknd jkasnjk adsnkj
Upvote
Downvote
""
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters
Submit
Cancel

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