English
Related papers

Related papers: Highly Sorted Permutations and Bell Numbers

200 papers

Let $s$ be West's deterministic stack-sorting map. A well-known result (West) is that any length $n$ permutation can be sorted with $n-1$ iterations of $s.$ In 2020, Defant introduced the notion of highly-sorted permutations -- permutations…

Combinatorics · Mathematics 2024-05-06 Owen Zhang

Let $s$ denote West's stack-sorting map. A permutation is called $t-\textit{sorted}$ if it is of the form $s^t(\mu)$ for some permutation $\mu$. We prove that the maximum number of descents that a $t$-sorted permutation of length $n$ can…

Combinatorics · Mathematics 2019-07-02 Colin Defant

For the Stirling numbers of the second kind $S(n,k)$ and the ordered Bell numbers $B(n)$, we prove the identity $\sum_{k=1}^{n/2} S(n,2k)(2k-1)! = B(n-1)$. An analogous identity holds for the sum over odd $k$'s.

Combinatorics · Mathematics 2021-09-28 Jacob Sprittulla

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 of 2-stack-sortable…

Combinatorics · Mathematics 2020-01-09 Colin Defant

It is known that for an arbitrary positive integer \(n\) the sequence \(S(x^n)=(1^n, 2^n, \ldots)\) is complete, meaning that every sufficiently large integer is a sum of distinct \(n\)th powers of positive integers. We prove that every…

Number Theory · Mathematics 2017-07-11 Doyon Kim

The aim of this paper is twofold. First, we study the number of partitions of a positive integer $m$ into at most $n$ parts in a given set $A$. We prove that such a number is bounded by the $n$-th Fibonacci number $F(n)$ for any $m$ and…

Representation Theory · Mathematics 2023-11-09 Steven Benzel , Scott Conner , Nham Ngo , Khang Pham

Let $\{b_{k}(n)\}_{n=0}^{\infty}$ be the Bell numbers of order $k$. It is proved that the sequence $\{b_{k}(n)/n!\}_{n=0}^{\infty}$ is log-concave and the sequence $\{b_{k}(n)\}_{n=0}^{\infty}$ is log-convex, or equivalently, the following…

Combinatorics · Mathematics 2007-05-23 Nobuhiro Asai , Izumi Kubo , Hui-Hsiung Kuo

For non-negative integers $r$ and $m$, let $S_m^{(r)}(n)$ denote the $r$-fold summation (or hyper-sum) over the first $n$ positive integers to the $m$th powers, with the initial condition $S_m^{(0)}(n) =n^m$. In this paper, we derive a new…

Number Theory · Mathematics 2022-08-05 José L. Cereceda

Let Sym_n denote the symmetric group of all permutations pi = a_1...a_n of {1,...,n}. An index i is a peak of pi if a_{i-1} < a_i > a_{i+1} and we let P(pi) be the set of peaks of pi. Given any set S of positive integers we define P(S;n) to…

Combinatorics · Mathematics 2012-09-05 Sara Billey , Krzysztof Burdzy , Bruce Sagan

Let $B_{n}(t)$ be the $n$th Stern polynomial, i.e., the $n$th term of the sequence defined recursively as $B_{0}(t)=0, B_{1}(t)=1$ and $B_{2n}(t)=tB_{n}(t), B_{2n+1}(t)=B_{n}(t)+B_{n-1}(t)$ for $n\in\N$. It is well know that $i$th…

Number Theory · Mathematics 2019-09-25 Maciej Ulas

We introduce an algorithm to determine when a sorting operation, such as stack-sort or bubble-sort, outputs a given pattern. The algorithm provides a new proof of the description of West-2-stack-sortable permutations, that is permutations…

Combinatorics · Mathematics 2012-03-13 Anders Claesson , Henning Úlfarsson

We give three applications of a recently-proven "Decomposition Lemma," which allows one to count preimages of certain sets of permutations under West's stack-sorting map $s$. We first enumerate the permutation class…

Combinatorics · Mathematics 2023-06-22 Colin Defant

We study convergent sequences of Baumslag-Solitar groups in the space of marked groups. We prove that BS(m,n) --> F_2 for |m|,|n| --> \infty and BS(1,n) --> Z \wr Z for |n| --> \infty. For m fixed, |m|>1, we show that the sequence…

Group Theory · Mathematics 2007-05-23 Yves Stalder

Let $\mathcal D_n$ denote the average number of iterations of West's stack-sorting map $s$ that are needed to sort a permutation in $S_n$ into the identity permutation $123\cdots n$. We prove that…

Combinatorics · Mathematics 2020-09-29 Colin Defant

Using earlier results we prove a formula for the number $W_{(n,k)}$ of 2-stack sortable permutations of length $n$ with $k$ runs, or in other words, $k-1$ descents. This formula will yield the suprising fact that there are as many 2-stack…

Combinatorics · Mathematics 2009-09-25 Miklós Bóna

Let $S$ be a set of $n$ points in $\mathbb{R}^d$, where $d \geq 2$ is a constant, and let $H_1,H_2,\ldots,H_{m+1}$ be a sequence of vertical hyperplanes that are sorted by their first coordinates, such that exactly $n/m$ points of $S$ are…

Given positive integers $n$ and $m$, let $p_n(m)$ be the probability that a uniform random permutation of $[n]$ has order exactly $m$. We show that, as $n \to \infty$, the maximum of $p_n(m)$ over all $m$ is asymptotic to $1/n$, the…

Combinatorics · Mathematics 2025-10-14 Adrian Beker

Let $n$ be a positive integer, and let $A$ be a set of $k\ge 2n-1$ integers. For the restricted sumset $$ S_n(A)=\{a_1+\cdots +a_n:\ a_1,\ldots,a_n\in A,\ \text{and}\ a_i^2\neq a_j^2\ \text{for} \ 1\le i<j\le n\}, $$ by a 2002 result of Liu…

Number Theory · Mathematics 2023-05-22 Xin-Qi Luo , Zhi-Wei Sun

We study the behavior of West's stack-sorting map $s$ on permutations whose last entry is also their least. Let $S_{n}':=\{\pi0\mid \pi\in S_n\}$ where $\pi0$ denotes the concatenation of $\pi$ and $0$. For each permutation $\pi\in S_n'$,…

Combinatorics · Mathematics 2026-04-17 Jerry Zhang

We define a quantity $c_m(n,k)$ as a generalization of the notion of the composition of the positive integer $n$ into $k$ parts. We proceed to derive some known properties of this quantity. In particular, we relate two partial Bell…

Combinatorics · Mathematics 2017-02-07 Milan Janjić
‹ Prev 1 2 3 10 Next ›