Related papers: On the Limiting Vacillating Tableaux for Integer S…

Zeckendorf proved that every positive integer has a unique partition as a sum of non-consecutive Fibonacci numbers. We study the difference between the number of summands in the partition of two consecutive integers. In particular, let…

Let $\Omega=\{1,2,...,n\}$ where $n \ge 2$. The {\em shape} of an ordered set partition $P=(P_1,..., P_k)$ of $\Omega$ is the integer partition $\lambda=(\lambda_1,...,\lambda_k)$ defined by $\lambda_i = |P_i|$. Let G be a group of…

In this paper we determine the number and typical structure of sets of integers with bounded doubling. In particular, improving recent results of Green and Morris, and of Mazur, we show that the following holds for every fixed $\lambda > 2$…

Chen et al. recently established bijections for $(d+1)$-noncrossing/ nonnesting matchings, oscillating tableaux of bounded height $d$, and oscillating lattice walks in the $d$-dimensional Weyl chamber. Stanley asked what is the total number…

In 2013, Duch{\^e}ne, Kheddouci, Nowakowski and Tahraoui [4, 9] introduced a labeled version of the graph packing problem. It led to the introduction of a new parameter for graphs, the k-labeled packing number $\lambda$ k. This parameter…

Closed formulas are known for $S(k,0;n)$, the number of standard Young tableaux of size $n$ and with at most $k$ parts, where $1\le k\le 5$. Here we study the analogue problem for $S(k,\ell;n)$, the number of standard Young tableaux of size…

Suppose $k$ balls are dropped into $n$ boxes independently with uniform probability, where $n, k$ are large with ratio approximately equal to some positive real $\lambda$. The maximum box count has a counterintuitive behavior: first of all,…

If $[\lambda(j)]$ is a multipartition of the positive integer $n$ (a sequence of partitions with total size $n$), and $\mu$ is a partition of $n$, we study the number $K_{[\lambda(j)]\mu}$ of sequences of semistandard Young tableaux of…

The scaled standard Wigner matrix (symmetric with mean zero, variance one i.i.d. entries), and its limiting eigenvalue distribution, namely the semi-circular distribution, has attracted much attention. The $2k$th moment of the limit equals…

Let $p(n)$ be the number of all integer partitions of the positive integer $n$ and let $\lambda$ be a partition, selected uniformly at random from among all such $p(n)$ partitions. It is known that each partition $\lambda$ has a unique…

Consider the $2n$-by-$2n$ matrix $M=(m_{i,j})_{i,j=1}^{2n}$ with $m_{i,j} = 1$ for $i,j$ satisfying $|2i-2n-1|+|2j-2n-1| \leq 2n$ and $m_{i,j} = 0$ for all other $i,j$, consisting of a central diamond of 1's surrounded by 0's. When $n \geq…

We study the partition graph $G_n$, whose vertices are the integer partitions of $n$ and whose edges correspond to elementary transfers of one unit between parts. We introduce the simplex stratification of $G_n$: for each vertex $\lambda$,…

For a fixed permutation $\sigma \in S_k$, let $N_{\sigma}$ denote the function which counts occurrences of $\sigma$ as a pattern in permutations from $S_n$. We study the expected value (and $d$-th moments) of $N_{\sigma}$ on conjugacy…

In this paper, we study the complex Wigner matrices $M_n=\frac{1}{\sqrt{n}}W_n$ whose eigenvalues are typically in the interval $[-2,2]$. Let $\lambda_1\leq \lambda_2...\leq\lambda_n$ be the ordered eigenvalues of $M_n$. Under the…

A group divisible design $\mbox{GDD}(m,n;\lambda_1,\lambda_2)$, is an ordered pair $(V, \cal{B})$ where $V$ is an $(m+n)$-set of symbols while $\cal{B}$ is a collection of $3$-subsets (called blocks) of $V$ satisfying the following…

A beautiful theorem of Zeckendorf states that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers $\{F_n\}_{n=1}^{\infty}$. Lekkerkerker proved that the average number of summands for integers in $[F_n,…

Consider $D$ random systems that are modeled by independent $N\times N$ complex Hermitian Wigner matrices. Suppose they are lying on a circle and the neighboring systems interact with each other through a deterministic matrix $A$. We prove…

We define an action of the symmetric group on the set of domino tableaux, and prove that the number of domino tableaux of a given weight does not depend on the permutation of components of the last. A bijective proof of the well-known…

A standard barely set-valued tableau of shape $\lambda$ is a filling of the Young diagram $\lambda$ with integers $1,2,\dots,|\lambda|+1$ such that the integers are increasing in each row and column, and every cell contains one integer…

The symmetric group $\mathsf{S}_n$ and the partition algebra $\mathsf{P}_k(n)$ centralize one another in their actions on the $k$-fold tensor power $\mathsf{M}_n^{\otimes k}$ of the $n$-dimensional permutation module $\mathsf{M}_n$ of…