Related papers: A Spectral Approach to Consecutive Pattern-Avoidin…
We investigate the asymptotic properties of permutations drawn from the Luce model, a natural probabilistic framework in which permutations are generated sequentially by sampling without replacement, with selection probabilities…
We consider the spherical integral of real symmetric or Hermitian matrices when the rank of one matrix is one. We prove the existence of the full asymptotic expansions of these spherical integrals and derive the first and the second term in…
We prove two estimates for the expectation of the exponential of a complex function of a random permutation or subset. Using this theory, we find asymptotic expressions for the expected number of copies and induced copies of a given graph…
In this paper we continue our earlier investigations into the asymptotic behaviour of infinite systems of coupled differential equations. Under the mild assumption that the so-called characteristic function of our system is completely…
We define a class L_{n, k} of permutations that generalizes alternating (up-down) permutations and give bijective proofs of certain pattern-avoidance results for this class. As a special case of our results, we give two bijections between…
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 permutation $\tau$ in the symmetric group $S_j$ is minimally overlapping if any two consecutive occurrences of $\tau$ in a permutation $\sigma$ can share at most one element. B\'ona \cite{B} showed that the proportion of minimal…
Recently in graph theory several authors have studied the spectrum of the Cayley graph of the symmetric group S_n generated by the transpositions (1, i) for 2 <= i <= n. Several conjectures were made and partial results were obtained. The…
In this paper we study non-selfadjoint operators using the methods of the spectral theory. The main challenge is to represent a complete description of an operator belonging to the Schatten-von Neumann class having used the order of the…
We consider a random permutation drawn from the set of 321-avoiding permutations of length $n$ and show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after scaling by $n^{m+\ell}$ where $m$ is the…
Over the last several decades, improvements in the fields of analytic combinatorics and computer algebra have made determining the asymptotic behaviour of sequences satisfying linear recurrence relations with polynomial coefficients largely…
This paper presents a collection of experimental results regarding permutation pattern avoidance, focusing on cases where there are "many" patterns to be avoided.
We consider the set of affine permutations that avoid a fixed permutation pattern. Crites has given a simple characterization for when this set is infinite. We find the generating series for this set using the Coxeter length statistic and…
We consider the asymptotic joint distributions among several families of well-known metrics on $S_n$, the symmetric group. These include the bi-invariant metrics such as the Cayley and Hamming distance, and the left-invariant metrics such…
In this paper we study pattern avoidance for affine permutations. In particular, we show that for a given pattern p, there are only finitely many affine permutations in $\widetilde{S}_n$ that avoid p if and only if p avoids the pattern 321.…
We provide bivariate asymptotics for the poly-Bernoulli numbers, a combinatorial array that enumerates lonesum matrices, using the methods of Analytic Combinatorics in Several Variables (ACSV). For the diagonal asymptotic (i.e., for the…
In [Kit1] Kitaev discussed simultaneous avoidance of two 3-patterns with no internal dashes, that is, where the patterns correspond to contiguous subwords in a permutation. In three essentially different cases, the numbers of such…
In this paper, we find an explicit formula for the generating function that counts the circular permutations of length n avoiding the pattern 23 4 1 whose enumeration was raised as an open problem by Rupert Li. This then completes in all…
Permutation patterns and pattern avoidance are central, well-studied concepts in combinatorics and computer science. Given two permutations $\tau$ and $\pi$, the pattern matching problem (PPM) asks whether $\tau$ contains $\pi$. This…
In this paper, we examine the asymptotic behavior of the longest increasing subsequence (LIS) in a uniformly random permutation of $n$ elements. We rely on the Robinson--Schensted--Knuth correspondence, Young tableaux, and key classical…