English
Related papers

Related papers: Asymptotics for minimal overlapping patterns for g…

200 papers

In this paper we prove a sandwich classification theorem for subgroups of the classical symplectic group over an arbitrary commutative ring $R$ that contain the elementary block-diagonal (or subsystem) subgroup $\operatorname{Ep}(\nu, R)$…

Group Theory · Mathematics 2017-09-22 Alexander Shchegolev

Our main result is a limit shape theorem for the two-dimensional surface defined by a uniform random n-by-n square Young tableau. The analysis leads to a calculus of variations minimization problem that resembles the minimization problems…

Probability · Mathematics 2007-05-23 Boris Pittel , Dan Romik

Using the superlattice (SL) eigenvalues $E_{\mu ,\nu }^{c,v}$ and eigenfunctions $\varphi_{\mu\nu}^{c,v}(z) $, obtained within the theory of finite periodic systems, where $\mu$ indicates the subbands and $\nu$ the intra-subband levels, we…

Materials Science · Physics 2016-09-19 Pedro Pereyra

A permutation statistic $\operatorname{st}$ is said to be shuffle-compatible if the distribution of $\operatorname{st}$ over the set of shuffles of two disjoint permutations $\pi$ and $\sigma$ depends only on $\operatorname{st}\pi$,…

Combinatorics · Mathematics 2023-09-29 Jinting Liang , Bruce E. Sagan , Yan Zhuang

Recall that an excedance of a permutation $\pi$ is any position $i$ such that $\pi_i > i$. Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using toppling, we say that a permutation is toppleable if it…

Combinatorics · Mathematics 2021-01-05 Arvind Ayyer , Daniel Hathcock , Prasad Tetali

Let $S_n$ be the symmetric group on $n$ points. Deza and Frankl [M. Deza and P. Frankl, On the maximum number of permutations with given maximal or minimal distance, J. Combin. Theory Ser. A 22 (1977) 352--360] proved that if ${\cal F}$ is…

Combinatorics · Mathematics 2011-07-19 Jun Guo , Kaishun Wang

We study the shape of the Young diagram \lambda associated via the Robinson-Schensted-Knuth algorithm to a random permutation in S_n such that the length of the longest decreasing subsequence is not bigger than a fixed number d; in other…

Combinatorics · Mathematics 2007-05-23 Piotr Sniady

We consider the cycle structure of a random permutation $\sigma$ chosen uniformly from the symmetric group, subject to the constraint that $\sigma$ does not contain cycles of length exceeding $r.$ We prove that under suitable conditions the…

Probability · Mathematics 2019-05-14 David Judkovich

The second author had previously obtained explicit generating functions for moments of characteristic polynomials of permutation matrices (n points). In this paper, we generalize many aspects of this situation. We introduce random shifts of…

Probability · Mathematics 2009-11-23 Paul-Olivier Dehaye , Dirk Zeindler

A family $\mathcal F$ has covering number $\tau$ if the size of the smallest set intersecting all sets from $\mathcal F$ is equal to $\tau$. Let $M(n,k,\tau)$ stand for the size of the largest intersecting family $\mathcal F$ of $k$-element…

Combinatorics · Mathematics 2023-05-09 Peter Frankl , Andrey Kupavskii

The distribution of descents in a fixed conjugacy class of $S_n$ is studied, and it is shown that its moments have an interesting property. A particular conjugacy class that is of interest is the class of matchings (also known as fixed…

Combinatorics · Mathematics 2017-10-12 Gene B. Kim

Let $A^{(n)}_{l;k}\subset S_n$ denote the set of permutations of $[n]$ for which the set of $l$ consecutive numbers $\{k, k+1,\cdots, k+l-1\}$ appears in a set of consecutive positions. Under the uniformly probability measure $P_n$ on…

Probability · Mathematics 2020-12-21 Ross G. Pinsky

If a group $G$ is the union of proper subgroups $H_1, \dots, H_k$, we say that the collection $\{H_1, \dots H_k \}$ is a cover of $G$, and the size of a minimal cover (supposing one exists) is the covering number of $G$, denoted…

Group Theory · Mathematics 2016-02-04 Eric Swartz

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…

Combinatorics · Mathematics 2007-05-23 T. Mansour , S. Kitaev

The density, denoted by $\kappa(n,r)$, of permutations having no cycles of length less than $r+1$ in a symmetric group $\mathrm{S}_n$ is explored. New asymptotic formulas for $\kappa(n,r)$ are obtained using the saddle-point method when…

Combinatorics · Mathematics 2016-05-10 Robertas Petuchovas

We constrain, from rare tau decays, several combinations of $\lambda$ and $\lambda'$ type couplings coming from Supersymmetry without R-parity. The processes that we consider are tau --> l M, tau --> l_i l_j l_k, and tau --> l gamma, where…

High Energy Physics - Phenomenology · Physics 2015-05-20 Roshni Bose

We propose the study of $S_n$-ensembles: $n \times n$ arrays of permutations of $[n]$ that encode the boundary data of $n\Delta_{n-1}$. We characterize precisely when an $S_4$-ensemble contains a permutation appearing exactly four times,…

Combinatorics · Mathematics 2025-05-16 SuHo Oh

We consider the descent and flag major index statistics on the colored permutation groups, which are wreath products of the form $\mathfrak{S}_{n,r}=\mathbb{Z}_r\wr \mathfrak{S}_n$. We show that the $k$-th moments of these statistics on…

Combinatorics · Mathematics 2025-07-29 Kevin Liu , Mei Yin

We consider the two permutation statistics which count the distinct pairs obtained from the last two terms of occurrences of patterns t_1...t_{m-2}m(m-1) and t_1...t_{m-2}(m-1)m in a permutation, respectively. By a simple involution in…

Combinatorics · Mathematics 2007-05-23 Astrid Reifegerste

Generalising the work of Dey, we define the notion of ultra-synchronicity of sequences of real numbers. Let $B_{n,k},C_{n,k},P_{n,k},Q_{n,k}$ be the number of even permutations with $k$ descents, odd permutations with $k$ descents, even…

Combinatorics · Mathematics 2024-04-03 Umesh Shankar