English
Related papers

Related papers: On simultaneous $(s, s+t, s+2t, \dots)$-core parti…

200 papers

Let $A_{t,k}(n)$ denote the number of partition $k$-tuples of $n$ where each partition is $t$-core. In this paper, we establish formulas of $A_{t,k}(n)$ for some values of $t$ and $k$ by employing the method of modular forms, which extends…

Number Theory · Mathematics 2016-02-05 Shane Chern

Let r_j(\pi,s) denote the number of cells, colored j, in the s-residue diagram of partition \pi. The GBG-rank of \pi mod s is defined as r_0+r_1*w_s+r_2*w_s^2+...+r_(s-1)*w_s^(s-1), where w_s=exp(2*\Pi*I/s). We will prove that for (s,t)=1,…

Combinatorics · Mathematics 2008-08-14 Alexander Berkovich , Frank G. Garvan

Amdeberhan conjectured that the number of $(s,s+2)$-core partitions with distinct parts for an odd integer $s$ is $2^{s-1}$. This conjecture was first proved by Yan, Qin, Jin and Zhou, then subsequently by Zaleski and Zeilberger. Since the…

Combinatorics · Mathematics 2017-05-10 Jineon Baek , Hayan Nam , Myungjun Yu

Partitions without sequences of consecutive integers as parts have been studied recently by many authors, including Andrews, Holroyd, Liggett, and Romik, among others. Their results include a description of combinatorial properties,…

Number Theory · Mathematics 2015-01-13 Kathrin Bringmann , Karl Mahlburg , Karthik Nataraj

We give a bijection between the set of self-conjugate partitions and that of ordinary partitions. Also, we show the relation between hook lengths of self conjugate partition and corresponding partition via the bijection. As a corollary, we…

Combinatorics · Mathematics 2018-11-27 Hyunsoo Cho , JiSun Huh , Jaebum Sohn

In recent work with Raum the authors considered congruences for the ordinary partition function $p(n)$ of the form $p(\ell Q^r n+\beta)\equiv 0\pmod\ell$ where $\ell, Q\geq 5$ are prime and $r\in \{1,2\}$, and proved a number of results…

Number Theory · Mathematics 2025-10-10 Scott Ahlgren , Olivia Beckwith

Let $\overline{\mathrm{spt}}k(n)$ denote the number of overpartitions of $n$ where the smallest non-overlined part, say $s(\pi)$, appears $k$ times and every overlined part is bigger than $s(\pi)$. Let $\overline{\mathrm{spt}}k_o(n)$ denote…

Combinatorics · Mathematics 2026-02-03 Nayandeep Deka Baruah , Haijun Li , Pankaj Jyoti Mahanta

In 2007, Olsson and Stanton gave an explicit form for the largest $(a, b)$-core partition, for any relatively prime positive integers $a$ and $b$, and asked whether there exists an $(a, b)$-core that contains all other $(a, b)$-cores as…

Combinatorics · Mathematics 2014-11-27 Amol Aggarwal

We consider the even monic degree-$10$ second cuboid polynomial $Q_{p,q}(t)\in\mathbb{Z}[t]$ depending on coprime integers $p\neq q>0$. We exclude the existence of a splitting of type $5+5$ over $\mathbb{Q}$, i.e., a factorization of…

General Mathematics · Mathematics 2026-01-09 Valery Asiryan

Let $s(n)$ denote the number of ones in the binary expansion of the nonnegative integer $n$. How does $s$ behave under addition of a constant $t$? In order to study the differences \[s(n+t)-s(n),\] for all $n\ge0$, we consider the…

Number Theory · Mathematics 2025-05-06 Bartosz Sobolewski , Lukas Spiegelhofer

Let $p_{k}(n)$ be the coefficient of $q^n$ in the series expansion of $(q;q)_{\infty}^{k}$. It is known that the partition function $p(n)$, which corresponds to the case when $k=-1$, satisfies congruences such as $p(5n+4)\equiv 0\pmod{5}$.…

Number Theory · Mathematics 2018-04-11 Heng Huat Chan , Liuquan Wang

Lin introduced the partition function $\text{PDO}_t(n)$, which counts the total number of tagged parts over all the partitions of $n$ with designated summands in which all parts are odd. For $k\geq0$, Lin conjectured congruences for…

Number Theory · Mathematics 2023-07-11 Gurinder Singh , Rupam Barman

Let $P$ be a $d$-dimensional $n$-point set. A partition $T$ of $P$ is called a Tverberg partition if the convex hulls of all sets in $T$ intersect in at least one point. We say $T$ is $t$-tolerant if it remains a Tverberg partition after…

Computational Geometry · Computer Science 2015-05-28 Wolfgang Mulzer , Yannik Stein

We study Wronskians of Hermite polynomials labelled by partitions and use the combinatorial concepts of cores and quotients to derive explicit expressions for their coefficients. These coefficients can be expressed in terms of the…

Classical Analysis and ODEs · Mathematics 2020-02-25 Niels Bonneux , Clare Dunning , Marco Stevens

Let $p_n$ be the number of partitions of an integer $n$. For each of the partition statistics of counting their parts, ranks, or cranks, there is a natural family of integer polynomials. We investigate their asymptotics and the limiting…

Combinatorics · Mathematics 2007-11-12 Robert P. Boyer , William M. Y. Goh

We consider matroids with the property that every subset of the ground set of size $s$ is contained in a $2s$-element circuit and every subset of size $t$ is contained in a $2t$-element cocircuit. We say that such a matroid has the…

Combinatorics · Mathematics 2025-12-18 Nick Brettell , Kevin Grace

The purpose of this note is to introduce a new approach to the study of one of the most basic and seemingly intractable problems in partition theory, namely the conjecture that the partition function $p(n)$ is equidistributed modulo 2. Our…

Combinatorics · Mathematics 2018-08-28 Samuel D. Judge , William J. Keith , Fabrizio Zanello

In 1997, Bousquet-Melou and Eriksson initiated the study of lecture hall partitions, a fascinating family of partitions that yield a finite version of Euler's celebrated odd/distinct partition theorem. In subsequent work on s-lecture hall…

Combinatorics · Mathematics 2017-01-03 Matthias Beck , Benjamin Braun , Matthias Köppe , Carla Savage , Zafeirakis Zafeirakopoulos

In this paper, we prove that every graph with average degree at least $s+t+2$ has a vertex partition into two parts, such that one part has average degree at least $s$, and the other part has average degree at least $t$. This solves a…

Combinatorics · Mathematics 2022-02-17 Yan Wang , Hehui Wu

It is well known that if S is a subset of the integers mod p, and if the second-largest Fourier coefficient is ``small'' relative to the largest coefficient, then the sumset S+S is much larger than S. We show in the present paper that if…

Combinatorics · Mathematics 2007-11-28 Ernie Croot , Tomasz Schoen
‹ Prev 1 3 4 5 6 7 10 Next ›