相关论文: Fertility Monotonicity and Average Complexity of t…

A probability measure $P_n$ on the symmetric group ${\mathfrak S}_n$ is said to be record-dependent if $P_n(\sigma)$ depends only on the set of records of a permutation $\sigma\in{\mathfrak S}_n$. A sequence $P=(P_n)_{n\in{\mathbb N}}$ of…

Permutation patterns and pattern avoidance have been intensively studied in combinatorics and computer science, going back at least to the seminal work of Knuth on stack-sorting (1968). Perhaps the most natural algorithmic question in this…

We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…

In a uniform random recursive k-dag, there is a root, 0, and each node in turn, from 1 to n, chooses k uniform random parents from among the nodes of smaller index. If S_n is the shortest path distance from node n to the root, then we…

We study new statistics on permutations that are variations on the descent and the inversion statistics. In particular, we consider the alternating descent set of a permutation sigma = sigma_1sigma_2...sigma_n defined as the set of indices…

We describe a new method for finding patterns in permutations that produce a given pattern after the permutation has been passed once through a stack. We use this method to describe West-3-stack-sortable permutations, that is, permutations…

What is the higher-dimensional analog of a permutation? If we think of a permutation as given by a permutation matrix, then the following definition suggests itself: A d-dimensional permutation of order n is an [n]^(d+1) array of zeros and…

In this paper, we introduce the dotted pattern-avoiding map $s_{\dot{\tau}}$, which avoids the dotted pattern $\dot{\tau}$ instead of descents as West's stack-sorting map $s$ does. We also extend the pattern-avoiding machine, which is…

We prove that there are permutation classes (hereditary properties of permutations) of every growth rate (Stanley-Wilf limit) at least \lambda \approx 2.48187, the unique real root of x^5-2x^4-2x^2-2x-1, thereby establishing a conjecture of…

We investigate how sorting algorithms efficiently overcome the exponential size of the permutation space. Our main contribution is a new continuous-time formulation of sorting as a gradient flow on the permutohedron, yielding an independent…

In a previous work, B\'ona and Pantone studied permutations that avoided all but one pattern of length $k$ that began with a length $k-1$ increasing subsequence. We draw the connection between that idea and distant patterns, first discussed…

Consider the matrix $A_{\mathcal{G}}$ chosen uniformly at random from the finite set of all $N$-dimensional matrices of zero main-diagonal and binary entries, having each row and column of $A_{\mathcal{G}}$ sum to $d$. That is, the…

Given k>1, let a_n be the sequence defined by the recurrence a_n=c_1a_{n-1}+c_2a_{n-2}+...+c_ka_{n-k} for n>=k, with initial values a_0=a_1=...=a_{k-2}=0 and a_{k-1}= 1. We show under a couple of assumptions concerning the constants c_i…

Let $S_{\rm div}(n)$ denote the set of permutations $\pi$ of $n$ such that for each $1\leq j \leq n$ either $j \mid \pi(j)$ or $\pi(j) \mid j$. These permutations can also be viewed as vertex-disjoint directed cycle covers of the divisor…

For each integer k >= 2, let F(k) denote the largest n for which there exists a permutation \sigma \in S_n, all of whose patterns of length k are distinct. We prove that F(k) = k + \lfloor \sqrt{2k-3} \rfloor + e_k, where e_k \in {-1,0} for…

We prove several general formulas for the distributions of various permutation statistics over any set of permutations whose quasisymmetric generating function is a symmetric function. Our formulas involve certain kinds of plethystic…

We consider the probability $p(S_n)$ that a pair of random permutations generates either the alternating group $A_n$ or the symmetric group $S_n$. Dixon (1969) proved that $p(S_n)$ approaches $1$ as $n\to\infty$ and conjectured that…

The problem of genealogy of permutations has been solved partially by Stefan (odd order) and Acosta-Hum\'anez \& Bernhardt (power of two). It is well known that Sharkovskii's theorem shows the relationship between the cardinal of the set of…

Denote by $\P_n$ the set of $n\times n$ positive definite matrices. Let $D = D_1\oplus \dots \oplus D_k$, where $D_1\in \P_{n_1}, \dots, D_k \in \P_{n_k}$ with $n_1+\cdots + n_k=n$. Partition $C\in \P_n$ according to $(n_1, \dots, n_k)$ so…

We study the counts of smooth permutations and smooth polynomials over finite fields. For both counts we prove an estimate with an error term that matches the error term found in the integer setting by de Bruijn more than 70 years ago. The…