We prove a "decomposition lemma" that allows us to count preimages of certain sets of permutations under West's stack-sorting map s. As a first application, we give a new proof of Zeilberger's formula for the number W2(n) of 2-stack-sortable permutations in Sn. Our proof generalizes, allowing us to find an algebraic equation satisfied by the generating function that counts 2-stack-sortable permutations according to length, number of descents, and number of peaks. This is also the first proof of this formula that generalizes to the setting of 3-stack-sortable permutations. Indeed, the same method allows us to obtain a recurrence relation for W3(n), the number of 3-stacksortable permutations in Sn. Hence, we obtain the first polynomial-time algorithm for computing these numbers. We compute W3(n) for n ≤ 174, vastly extending the 13 terms of this sequence that were known before. We also prove the first nontrivial lower bound for lim n→∞ W3(n) 1/n , showing that it is at least 8.659702. Invoking a result of Kremer, we also prove that lim n→∞ Wt(n) 1/n ≥ ( √ t + 1) 2 for all t ≥ 1, which we use to improve a result of Smith concerning a variant of the stack-sorting procedure. Our computations allow us to disprove a conjecture of Bóna, although we do not yet know for sure which one.In fact, we can refine our methods to obtain a recurrence for W3(n, k, p), the number of 3-stacksortable permutations in Sn with k descents and p peaks. This allows us to gain a large amount of evidence supporting a real-rootedness conjecture of Bóna. Using part of the theory of valid hook configurations, we give a new proof of a γ-nonnegativity result of Brändén, which in turn implies an older result of Bóna. We then answer a question of the current author by producing a set A ⊆ S11 such that σ∈s −1 (A) x des(σ) has nonreal roots. We interpret this as partial evidence against the same real-rootedness conjecture of Bóna that we found evidence supporting. Examining the parities of the numbers W3(n), we obtain strong evidence against yet another conjecture of Bóna. We end with some conjectures of our own.

We use a method for determining the number of preimages of any permutation under the stack-sorting map in order to obtain recursive upper bounds for the numbers Wt(n) and Wt(n, k) of t-stack sortable permutations of length n and t-stack sortable permutations of length n with exactly k descents. From these bounds, we are able to significantly improve the best known upper bounds for lim n→∞ n Wt(n) when t = 3 and t = 4.

Let X Z/nZ denote the unitary Cayley graph of Z/nZ. We present results on the tightness of the known inequality γ(X Z/nZ ) ≤ γt(X Z/nZ ) ≤ g(n), where γ and γt denote the domination number and total domination number, respectively, and g is the arithmetic function known as Jacobsthal's function. In particular, we construct integers n with arbitrarily many distinct prime factors such that γ(X Z/nZ ) ≤ γt(X Z/nZ ) ≤ g(n) − 1. We give lower bounds for the domination numbers of direct products of complete graphs and present a conjecture for the exact values of the upper domination numbers of direct products of balanced, complete multipartite graphs.

No abstract

We exhibit a bijection between recently-introduced combinatorial objects known as valid hook configurations and certain weighted set partitions. When restricting our attention to set partitions that are matchings, we obtain three new combinatorial interpretations of Lassalle's sequence. One of these interpretations involves permutations that have exactly one preimage under the (West) stack-sorting map. We prove that the sequences obtained by counting these permutations according to their first entries are symmetric, and we conjecture that they are log-concave. We also obtain new recurrence relations involving Lassalle's sequence and the sequence that enumerates valid hook configurations. We end with several suggestions for future work.