English
Related papers

Related papers: Hook length biases in ordinary and $t$-regular par…

200 papers

Let P be a polygon whose vertices have been colored (labeled) cyclically with the numbers 1,2,...,c. Motivated by conjectures of Propp, we are led to consider partitions of P into k-gons which are proper in the sense that each k-gon…

Combinatorics · Mathematics 2007-05-23 Bruce Sagan

Let \(\mathcal{P}(n)\) be the set of partitions of the positive integer \(n\). For \(\alpha=(\alpha_1,...,\alpha_t) \in \mathcal{P}(n)\) define the diagonal sequence \(\delta(\alpha)=(d_k(\alpha))_{k \geq 1}\) via \( d_k(\alpha) =…

Combinatorics · Mathematics 2024-12-11 Michael Neubauer , Harmony Vargas

For $k\geq i\geq 1$, let $B_{k,i}(n)$ denote the number of partitions of $n$ such that part 1 appears at most $i-1$ times, two consecutive integers l and $l+1$ appear at most $k-1$ times and if l and $l+1$ appear exactly $k-1$ times then…

Combinatorics · Mathematics 2012-03-21 William Y. C. Chen , Doris D. M. Sang , Diane Y. H. Shi

In this note we will give various exact formulas for functions on integer partitions including the functions $p(n)$ and $p(n,k)$ of the number of partitions of $n$ and the number of such partitions into exactly $k$ parts respectively. For…

Number Theory · Mathematics 2015-03-17 Mohamed El Bachraoui

Peterson and Proctor obtained a formula which expresses the multivariate generating function for $P$-partitions on a $d$-complete poset $P$ as a product in terms of hooks in $P$. In this paper, we give a skew generalization of…

Combinatorics · Mathematics 2021-02-08 Hiroshi Naruse , Soichi Okada

This article is an extensive study of partitions with fixed number of odd and even-indexed odd parts. We use these partitions to generalize recent results of C. Savage and A. Sills. Moreover, we derive explicit formulas for generating…

Number Theory · Mathematics 2016-04-12 Alexander Berkovich , Ali Kemal Uncu

Given uniform probability on words of length M=Np+k, from an alphabet of size p, consider the probability that a word (i) contains a subsequence of letters (p, p-1,...,1) in that order and (ii) that the maximal length of the disjoint union…

Probability · Mathematics 2016-09-07 Mark Adler , Alexei Borodin , Pierre van Moerbeke

Recently, Andrews, Chan, Kim and Osburn introduced the even strings and the odd strings in the overpartitions. We show that their conjecture $A_k (n) \geq B_k (n)$ holds for large enough positive integers n, where A_k(n) (resp. B_k(n)) is…

Number Theory · Mathematics 2017-04-13 Byungchan Kim , Eunmi Kim , Jeehyeon Seo

Regard the closed interval $[0,1]$ as a stick. Partition $[0,1]$ into $n+1$ different intervals $I_1, \ \dots \ , I_{n+1},$ where $n \geq 2,$ which represent smaller sticks. The classical Broken Stick problem asks to find the probability…

Probability · Mathematics 2021-12-14 Vivek Kaushik

Let $b_{\ell, k}(n), b_{\ell, k, r}(n)$ count the number of $(\ell, k)$, $(\ell, k, r)$-regular partitions respectively. In this paper we shall derive infinite families of congruences for $b_{\ell, k}(n)$ modulo $2$ when $ (\ell, k) =…

Number Theory · Mathematics 2023-03-27 T Kathiravan , K Srinivas , Usha K Sangale

By jagged partitions we refer to an ordered collection of non-negative integers $(n_1,n_2,..., n_m)$ with $n_m\geq p$ for some positive integer $p$, further subject to some weakly decreasing conditions that prevent them for being genuine…

Combinatorics · Mathematics 2007-05-23 J. -F. Fortin , P. Jacob , P. Mathieu

A classical theorem of Baranyai states that, given integers $2\leq k < n$ such that $k$ divides $n$, one can find a family of ${n-1\choose k-1}$ partitions of $[n]$ into $k$-element subsets such that every subset appears in exactly one…

Combinatorics · Mathematics 2024-10-14 Zoe Xi

Motivated by the concept of partial words, we introduce an analogous concept of partial permutations. A partial permutation of length n with k holes is a sequence of symbols $\pi = \pi_1\pi_2 ... \pi_n$ in which each of the symbols from the…

Combinatorics · Mathematics 2015-03-17 Anders Claesson , Vit Jelinek , Eva Jelinkova , Sergey Kitaev

In this paper the limit probabilities of first-order properties are studied. The random graph $G(n,p)$ {\it obeys Zero-One $k$-Law} if for each first-order property with quantifier depth not greater than $k$ its probability tends to 0 or…

Probability · Mathematics 2016-02-02 Aleksandr Matushkin

Let $P$ be the set of integer partitions and $D$ the subset of those with distinct parts. We extend a correspondence of Burge between partitions and binary words to give encodings of both $D$ and $D$ as words over a $k$-ary alphabet, for…

Combinatorics · Mathematics 2024-09-02 John Irving

For fixed integers $b\geq k$, the problem of perfect $(b,k)$-hashing asks for the asymptotic growth of largest subsets of $\{1,2,\ldots,b\}^n$ such that for any $k$ distinct elements in the set, there is a coordinate where they all differ.…

Information Theory · Computer Science 2021-01-27 Stefano Della Fiore , Simone Costa , Marco Dalai

The paper presented here focuses on the classification of trivial source Specht modules. We completely classify the trivial source Specht modules labelled by hook partitions. We also classify the trivial source Specht modules labelled by…

Representation Theory · Mathematics 2021-02-16 Yu Jiang

We study a generalized class of weighted $k$-regular partitions defined by \[ \sum_{n=0}^{\infty} c_{k, r_1, r_2}(n) q^n = \prod_{n=1}^{\infty} \frac{(1 - q^{nk})^{r_1}}{(1 - q^n)^{r_2}}, \] which extends the classical $k$-regular partition…

Number Theory · Mathematics 2025-12-05 Debika Banerjee , Ben Kane

We investigate integral forms of simple modules of symmetric groups over fields of characteristic $0$ labelled by hook partitions. Building on work of Plesken and Craig, for every odd prime $p$, we give a set of representatives of the…

Representation Theory · Mathematics 2018-09-11 Susanne Danz , Tommy Hofmann

Given an integer partition $\la=(\la_1, ..., \la_\ell)$ and an integer k, denote by $\la^{(k)}$ the sequence of length $\ell$ obtained by reordering the values $|\la_i-k|$ in non-increasing order. If $\la$ dominates $\mu$ and has the same…

Combinatorics · Mathematics 2008-12-18 Mireille Bousquet-Mélou