English
Related papers

Related papers: Schur partition theorems via perfect crystal

200 papers

For any positive integers $n$ and $r$, let $p_r(n)$ denotes the number of partitions of $n$ where each part has $r$ distinct colours. Many authors studied the partition function $p_r(n)$ for particular values of $r$. In this paper, we prove…

Number Theory · Mathematics 2020-08-17 Nipen Saikia , Chayanika Boruah

It is well known that, whenever $k$ divides $n$, the complete $k$-uniform hypergraph on $n$ vertices can be partitioned into disjoint perfect matchings. Equivalently, the set of $k$-subsets of an $n$-set can be partitioned into parallel…

Combinatorics · Mathematics 2020-07-24 Yeow Meng Chee , Tuvi Etzion , Han Mao Kiah , Alexander Vardy , Chengmin Wang

We study perfect crystals for the standard modules of the affine Lie algebra $A_1^{(1)}$ at all levels using the theory of multi-grounded partitions. We prove a family of partition identities which are reminiscent of the Andrews-Gordon…

Combinatorics · Mathematics 2025-03-12 Jehanne Dousse , Leonard Hardiman , Isaac Konan

In this paper, we study the partition theory over totally real number fields. Let $K$ be a totally real number field. A partition of a totally positive algebraic integer $\delta$ over $K$ is $\lambda=(\lambda_1,\lambda_2,\ldots,\lambda_r)$…

Number Theory · Mathematics 2023-12-01 Se Wook Jang , Byeong Moon Kim , Kwang Hoon Kim

Let $b_3(n)$ be the number of $3$-regular partitions of $n$. Recently, W. J. Keith and F. Zanello discovered infinite families of Ramanujan type congruences modulo $2$ for $b_3(2n)$ involving every prime $p$ with $p \equiv 13, 17, 19, 23…

Number Theory · Mathematics 2022-12-21 Cristina Ballantine , Mircea Merca , Cristian-Silviu Radu

Glaisher's theorem states that the number of partitions of $n$ into parts which repeat at most $m-1$ times is equal to the number of partitions of $n$ into parts which are not divisible by $m$. The $m=2$ case is Euler's famous partition…

Combinatorics · Mathematics 2026-04-14 George E. Andrews , Aritram Dhar

We prove that for arbitrary partitions $\mathbf{\lambda} \subseteq \mathbf{\kappa},$ and integers $0\leq c<r\leq n,$ the sequence of Schur polynomials $S_{(\mathbf{\kappa} + k\cdot \mathbf{1}^c)/(\mathbf{\lambda} + k\cdot…

Combinatorics · Mathematics 2015-12-14 Per Alexandersson

We give short elementary expositions of combinatorial proofs of some variants of Euler's partitition problem that were first addressed analytically by George Andrews, and later combinatorially by others. Our methods, based on ideas from a…

Combinatorics · Mathematics 2021-07-19 Aritro Pathak

For any positive integers $s$ and $t$, let $Q_{t}^{s}(n)$ denotes the number of partitions of a positive integer $n$ into distinct parts such that no part is congruent to $s$ or $t-s$ modulo $t$. We prove some Ramanujan-type congruences for…

Number Theory · Mathematics 2025-08-19 Rinchin Drema , Nipen Saikia

Andrews investigated parity conditions in the Rogers-Ramanujan-Gordon theorem. Under the conditions that even parts or odd parts appear an even number of times, Andrews discovered two Rogers-Ramanujan-Gordon type partition theorems and…

Combinatorics · Mathematics 2026-05-07 Robert X. J. Hao , Xiaorui Niu , Doris D. M. Sang , Diane Y. H. Shi

In 1956, 48 years after Hausdorff provided a comprehensive account on ordered sets and defined the notion of a scattered order, Erd\H{o}s and Rado founded the partition calculus in a seminal paper. The present paper gives an account of…

Logic · Mathematics 2018-05-23 Chris Lambie-Hanson , Thilo Weinert

In this paper we present an extension of Stanley's theorem related to partitions of positive integers. Stanley's theorem states a relation between "the sum of the numbers of distinct members in the partitions of a positive integer $n$" and…

Discrete Mathematics · Computer Science 2010-12-30 Manosij Ghosh Dastidar , Sourav Sen Gupta

Let $G$ be a finite group. If $\Gamma$ is a permutation group with $G_{right}\leq\Gamma\leq Sym(G)$ and $\mathcal{S}$ is the set of orbits of the stabilizer of the identity $e=e_{G}$ in $\Gamma$, then the $\mathbb{Z}$-submodule…

Group Theory · Mathematics 2017-09-15 Grigory Ryabov

A set $A$ of integers is said to be Schur if any two-colouring of $A$ results in monochromatic $x,y$ and $z$ with $x+y=z$. We study the following problem: how many random integers from $[n]$ need to be added to some $A\subseteq [n]$ to…

Combinatorics · Mathematics 2022-05-04 Shagnik Das , Charlotte Knierim , Patrick Morris

Let $\mathrm{pod}_{-3}(n)$ denote the number of partition triples of $n$ where the odd parts in each partition are distinct. We find many arithmetic properties of $\mathrm{pod}_{-3}(n)$ involving the following infinite family of…

Number Theory · Mathematics 2015-07-13 Liuquan Wang

Andrews and Merca [J. Combin. Theory Ser. A 203 (2024), Art. 105849] recently obtained two interesting results on the sum of the parts with the same parity in the partitions of $n$ (the modulo $2$ case), the proof of which relies on…

Combinatorics · Mathematics 2024-06-07 Ji-Cai Liu

It is proved that the number of 9-regular partitions of n is divisible by 3 when n is congruent to 3 mod 4, and by 6 when n is congruent to 13 mod 16. An infinite family of congruences mod 3 holds in other progressions modulo powers of 4…

Combinatorics · Mathematics 2013-06-07 William J. Keith

We recall Schur's work on universal central extensions and develop the analogous theory for categorical extensions of groups. We prove that the String 2-groups are universal in this sense and study in detail their restrictions to the finite…

Category Theory · Mathematics 2018-02-15 Narthana Epa , Nora Ganter

Recently, $4$-regular partitions into distinct parts are connected with a family of overpartitions. In this paper, we provide a uniform extension of two relations due to Andrews for the two types of partitions. Such an extension is made…

Combinatorics · Mathematics 2023-01-27 George E. Andrews , Shane Chern

Let $p_{r,s}(n)$ denote the number of partitions of a positive integer $n$ into parts containing no multiples of $r$ or $s$, where $r>1$ and $s>1$ are square-free, relatively prime integers. We use classical methods to derive a…

Number Theory · Mathematics 2019-01-17 James Mc Laughlin , Scott Parsell
‹ Prev 1 3 4 5 6 7 10 Next ›