English
Related papers

Related papers: Stanley-Wilf limits are typically exponential

200 papers

Let S(n,k) be the Stirling number of the second kind. Wilf conjectured that the alternating sum of S(n,k) for k from 0 to n is not zero for all n>2. In this paper, we prove that Wilf conjecture is true except at most one number with the…

Combinatorics · Mathematics 2008-07-15 Junkyu An

For $L(\cdot,\pi)$ in a large class of $L$-functions, assuming the generalized Riemann hypothesis, we show an explicit bound for the function $S_1(t,\pi)=\frac{1}{\pi}\int_{1/2}^\infty\log|L(\sigma+it,\pi)|\,d\sigma$, expressed in terms of…

Number Theory · Mathematics 2021-09-30 Emanuel Carneiro , Renan Finder

Let G be a finite group. Let pi be a permutation from S{n}. We study the distribution of probabilities of equality a{1} a{2} ...a{n-1}a{n}=a{pi{1}}^{epsilon{1}} a{pi_{2}}^{epsilon{2}}...a{pi{n-1}}^{epsilon_{n-1}} a_{pi_{n}}^{epsilon{n}},…

Group Theory · Mathematics 2020-10-20 Robert Shwartz , Vadim E. Levit

Given a subset $S\subseteq\mathbb{P}$, let $\Pa(S;n)$ be the number of permutations in the symmetric group of ${1,2,...,n}$ that have peak set $S$. We prove a recent conjecture due to Billey, Burdzy and Sagan, which determines the sets that…

Combinatorics · Mathematics 2012-10-23 Anisse Kasraoui

For a permutation $\pi$ the major index of $\pi$ is the sum of all indices $i$ such that $\pi_i > \pi_{i+1}$. It is well known that the major index is equidistributed with the number of inversions over all permutations of length $n$. In…

Combinatorics · Mathematics 2015-05-28 Michal Opler

We prove an upper bound for characters of the symmetric groups. Namely, we show that there exists a constant a>0 with a property that for every Young diagram \lambda with n boxes, r(\lambda) rows and c(\lambda) columns |Tr \rho^\lambda(\pi)…

Representation Theory · Mathematics 2011-03-22 Valentin Féray , Piotr Sniady

We investigate the avoidability of unary patterns of size of four with morphic permutations. More precisely, we show that, for the positive integers $i,j,k$, the sizes of the alphabets over which a pattern $x \pi ^ {i} (x) \pi^{j}(x)…

Combinatorics · Mathematics 2019-03-25 Kamellia Reshadi

Let $n$ and $k$ be positive integers with $n>k$. Given a permutation $(\pi_1,\ldots,\pi_n)$ of integers $1,\ldots,n$, we consider $k$-consecutive sums of $\pi$, i.e., $s_i:=\sum_{j=0}^{k-1}\pi_{i+j}$ for $i=1,\ldots,n$, where we let…

Combinatorics · Mathematics 2019-05-28 Akihiro Higashitani , Kazuki Kurimoto

We prove a central limit theorem for the length of the longest subsequence of a random permutation which follows one of a class of repeating patterns. This class includes every fixed pattern of ups and downs having at least one of each,…

Combinatorics · Mathematics 2024-09-25 Aaron Abrams , Eric Babson , Henry Landau , Zeph Landau , James Pommersheim

We consider the precision $\Delta \varphi$ with which the parameter $\varphi$, appearing in the unitary map $U_\varphi = e^{ i \varphi \Lambda}$ acting on some type of probe system, can be estimated when there is a finite amount of prior…

The Mallows measure is measure on permutations which was introduced by Mallows in connection with ranking problems in statistics. Under this measure, the probability of a permutation $\pi$ is proportional to $q^{Inv(\pi)}$ where $q$ is a…

Probability · Mathematics 2019-08-15 Naya Banerjee , Ke Jin

We give two simple proofs of a conjecture of Richard Stanley concerning the equidistribution of derangements and alternating permutations with the maximal number of fixed points.

Combinatorics · Mathematics 2007-05-23 Robin Chapman , Lauren K. Williams

Let $A$ be a set of natural numbers and let $S_{n,A}$ be the set of all permutations of $[n]=\{1,2,...,n\}$ with cycle lengths belonging to $A$. Furthermore, let $\mid A(n)\mid$ denote the cardinality of the set $A(n)=A\cap [n]$. The limit…

Combinatorics · Mathematics 2022-06-28 Ljuben Mutafchiev

A square is a word of the form $xx$ for a non-empty word $x$. Brlek and Li [Comb. Theory, 2025] proved that the number of distinct squares in a word $w$ of length $n$ is at most $n - \sigma$, where $\sigma$ is the number of letters used in…

Discrete Mathematics · Computer Science 2026-03-03 Eitatsu Tomita , Tomohiro I

Super-strong Wilf equivalence classes of the symmetric group ${\mathcal S}_n$ on $n$ letters, with respect to the generalized factor order, were shown by Hadjiloucas, Michos and Savvidou (2018) to be in bijection with pyramidal sequences of…

Combinatorics · Mathematics 2023-06-22 Ioannis Michos , Christina Savvidou

We consider a random permutation drawn from the set of 132-avoiding permutations of length $n$ and show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after scaling by $n^{\lambda(\sigma)/2}$ where…

Probability · Mathematics 2016-05-25 Svante Janson

Let $\pi$ be a cycle permutation that can be expressed as one-line $\pi = \pi_1\pi_2 \cdot\cdot\cdot \pi_n$ and a cycle form $\pi = (c_1,c_2, ..., c_n)$. Archer et al. introduced the notion of pattern avoidance of one-line and all cycle…

Combinatorics · Mathematics 2024-09-27 Junyao Pan

We compute the limiting distribution, as n approaches infinity, of the number of cycles of length between gamma n and delta n in a permutation of [n] chosen uniformly at random, for constants gamma, delta such that 1/(k+1) <= gamma < delta…

Combinatorics · Mathematics 2009-09-17 Michael Lugo

We introduce the "Median Inverse Problem" for metric spaces. In particular, having a permutation $\pi$ in the symmetric group $S_n$ (endowed with the breakpoint distance), we study the set of all $k$-subsets $\{x_1,...,x_k\}\subset S_n$ for…

Combinatorics · Mathematics 2017-12-11 Poly H. da Silva , Arash Jamshidpey , David Sankoff

Let $G$ be a finite group and $\pi$ be a permutation from $S_{n}$. We investigate the distribution of the probabilities of the equality \[ a_{1}a_{2}\cdots a_{n-1}a_{n}=a_{\pi_{1}}a_{\pi_{2}}\cdots a_{\pi_{n-1}}a_{\pi_{n}} \] when $\pi$…

Group Theory · Mathematics 2014-10-03 Yonah Cherniavsky , Avraham Goldstein , Vadim E. Levit , Robert Shwartz
‹ Prev 1 4 5 6 7 8 10 Next ›