Related papers: The Mobius Function of the Permutation Pattern Pos…

The structure of order ideals in the Bruhat order for the symmetric group is elucidated via permutation patterns. A method for determining non-isomorphic principal order ideals is described and applied for small lengths. The permutations…

A poset is {\it $(\3+\1)$-free} if it contains no induced subposet isomorphic to the disjoint union of a 3-element chain and a 1-element chain. These posets are of interest because of their connection with interval orders and their…

Problem 8.1 in Astaiza et. al. asks about the relationship between the cycle decomposition of a permutation $\sigma$ and that of its symmetric tensor power $\sigma ^{\odot k}$. In this paper, we investigate this question and give formulas…

The goal of this monograph is to study the indicator function for a set of permutations mapping one finite sequence of positive integers to another from a representation theoretic, combinatorial and probabilistic perspective. The degree of…

Sergey Kitaev has shown that the exponential generating function for permutations avoiding the generalized pattern $\sigma$-$k$, where $\sigma$ is a pattern without dashes and $k$ is one greater than the biggest element in $\sigma$, is…

We determine when a permutation with cycle type $\mu$ admits a non-zero invariant vector in the irreducible representation $V_\lambda$ of the symmetric group. We find that a majority of pairs $(\lambda,\mu)$ have this property, with only a…

We introduce the stack-sorting map $\text{SC}_\sigma$ that sorts, in a right-greedy manner, an input permutation through a stack that avoids some vincular pattern $\sigma$. The stack-sorting maps of Cerbai et al. in which the stack avoids a…

For each positive integer n, we determine the set of symmetric functions f for which the congruence f(p/1,p/2,...,p/(p-1)) \equiv 0 mod p^n holds for all sufficiently large primes p. Our determination is conditional on a conjecture…

This article provides new asymptotic results for the summatory Mobius function $\sum_{p \leq x} \mu(p+a) =O \left (x(\log x)^{-c} \right )$ and the summatory Liouville function $\sum_{p \leq x} \lambda(p+a) =O \left (x(\log x)^{-c} \right…

Any function F : {0,...,N-1} -> {-1,1} such that F(x) can be computed from the binary digits of x using a bounded depth circuit is orthogonal to the Mobius function mu in the sense that E_{0 <= x <= N-1} mu(x)F(x) = o(1). The proof combines…

We address the problem of the number of permutations that can be sorted by two stacks in series. We do this by first counting all such permutations of length less than 20 exactly, then using a numerical technique to obtain nineteen further…

For $\mu>0$ we study an asymptotic behavior of the sequence defined as $$T_{n}(\mu)=\frac{max_{1\leq m \leq {n^{\frac{1}{\mu}}}}\{\tau (n + m)\}}{\tau(n)},\ n=1,2,...$$ where $\tau(n)$ denotes the number of natural divisors of the given…

We study a model of spatial random permutations over a discrete set of points. Formally, a permutation $\sigma$ is sampled proportionally to the weight $\exp\{-\alpha \sum_x V(\sigma(x)-x)\},$ where $\alpha>0$ is the temperature and $V$ is…

Let $S_n$ be the symmetric group on the set $[n]:=\{1,2,\ldots,n\}$. Given a permutation $\sigma=\sigma_1\sigma_2 \cdots \sigma_n \in S_n$, we say it has a descent at index $i$ if $\sigma_i>\sigma_{i+1}$. Let $\mathcal{D}(\sigma)$ be the…

We introduce a new sorting device for permutations which makes use of a pop stack augmented with a bypass operation. This results in a sorting machine, which is more powerful than the usual Popstacksort algorithm and seems to have never…

In a recent paper, Bona and Smith define the notion of \textit{strong avoidance}, in which a permutation and its square both avoid a given pattern. In this paper, we generalize this idea to what we call \textit{chain avoidance}. We say that…

We have extended classical pattern avoidance to a new structure: multiple task-precedence posets whose Hasse diagrams have three levels, which we will call diamonds. The vertices of each diamond are assigned labels which are compatible with…

It is known that the set of permutations, under the pattern containment ordering, is not a partial well-order. Characterizing the partially well-ordered closed sets (equivalently: down sets or ideals) in this poset remains a wide-open…

We define a switch function to be a function from an interval to $\{1,-1\}$ with a finite number of sign changes. (Special cases are the Walsh functions.) By a topological argument, we prove that, given $n$ real-valued functions, $f_1,…

We show that for any permutation $\pi$ there exists an integer $k_{\pi}$ such that every permutation avoiding $\pi$ as a pattern is a product of at most $k_{\pi}$ separable permutations. In other words, every strict class $\mathcal C$ of…