相关论文: On a Quadratic Relation Between Stanley-Wilf Limit…
A binary matrix is a matrix with entries from the set $\{0,1\}$. We say that a binary matrix $A$ contains a binary matrix $S$ if $S$ can be obtained from $A$ by removal of some rows, some columns, and changing some $1$-entries to…
Given a permutation $\pi$, let $\text{Av}_n(\pi)$ be the number of permutations of length $n$ that avoid $\pi$ as a subpermutation. The celebrated resolution of the Stanley-Wilf conjecture by Marcus and Tardos confirmed that the limit…
The Stanley-Wilf limit of the pattern 1324 is known to lie between 10.271 and 13.5. We obtain lower bounds on this limit by encoding permutations as walks in directed graphs: building a permutation by successive insertion of maxima…
For a permutation $\pi$, let $S_{n}(\pi)$ be the number of permutations on $n$ letters avoiding $\pi$. Marcus and Tardos proved the celebrated Stanley-Wilf conjecture that $L(\pi)= \lim_{n \to \infty} S_n(\pi)^{1/n}$ exists and is finite.…
We prove that the Stanley-Wilf limit of any layered permutation pattern of length $\ell$ is at most $4\ell^2$, and that the Stanley-Wilf limit of the pattern 1324 is at most 16. These bounds follow from a more general result showing that a…
The concept of pattern avoidance respectively containment in permutations can be extended to permutations on multisets in a straightforward way. In this note we present a direct proof of the already known fact that the well-known…
Let $A\in\mathbb{C}^{n\times n}$ be a normal matrix with spectrum $\{\lambda_{i}\}_{i=1}^{n}$, and let $\widetilde{A}=A+E\in\mathbb{C}^{n\times n}$ be a perturbed matrix with spectrum $\{\widetilde{\lambda}_{i}\}_{i=1}^{n}$. If…
Denote by $u(n)$ the largest principal specialization of the Schubert polynomial: $ u(n) := \max_{w \in S_n} \mathfrak{S}_w(1,\ldots,1) $ Stanley conjectured in [arXiv:1704.00851] that there is a limit $\lim_{n\to \infty} \, \frac{1}{n^2}…
Fix a strong rectangulation pattern $P$ of size $L$. We show that the growth constant of the class of strong rectangulations avoiding $P$ is strictly smaller than $\Lambda =27/2$, the growth constant for all strong rectangulations. More…
For any unitary conformal field theory in two dimensions with the central charge $c$, we prove that, if there is a nontrivial primary operator whose conformal dimension $\Delta$ vanishes in some limit on the conformal manifold, the…
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…
Motivated by the recent proof of the Stanley-Wilf conjecture, we study the asymptotic behavior of the number of permutations avoiding a generalized pattern. Generalized patterns allow the requirement that some pairs of letters must be…
Inspired by the idea of Bernoulli decomposition, we give a simple proof for a generalization of Hal\'asz anti--concentration result about random sum of vectores in $\mathbb{R}^d$. From our results, we can give one upper bound for the…
We consider the problem of bounding the number of permutations $\sigma\in S_n$ that avoid a fixed permutation $\pi\in S_k$ in specific indices given by a $k$-uniform hypergraph $\Lambda$. We obtain relatively sharp bounds in the case where…
Let $P_N$ be a uniform random $N\times N$ permutation matrix and let $\chi_N(z)=\det(zI_N- P_N)$ denote its characteristic polynomial. We prove a law of large numbers for the maximum modulus of $\chi_N$ on the unit circle, specifically, \[…
We study the differential uniformity of the Wan-Lidl polynomials over finite fields. A general upper bound, independent of the order of the field, is established. Additional bounds are established in settings where one of the parameters is…
Stable matching is a classical combinatorial problem that has been the subject of intense theoretical and empirical study since its introduction in 1962 in a seminal paper by Gale and Shapley. In this paper, we provide a new upper bound on…
For a hereditary permutation class $\mathcal{C}$, we say that two permutations $\pi$ and $\sigma$ of $\mathcal{C}$ are Wilf-equivalent in $\mathcal{C}$, if $\mathcal{C}$ has the same number of permutations avoiding $\pi$ as those avoiding…
Let $A\in\mathbb{C}^{n\times n}$ and $\widetilde{A}\in\mathbb{C}^{n\times n}$ be two normal matrices with spectra $\{\lambda_{i}\}_{i=1}^{n}$ and $\{\widetilde{\lambda}_{i}\}_{i=1}^{n}$, respectively. The celebrated Hoffman--Wielandt…
The boundary of the Siegel disk of a quadratic polynomial with an irrationally indifferent fixed point and the rotation number whose continued fraction expansion is preperiodic has been observed to be self-similar with a certain scaling…