English
Related papers

Related papers: Asymptotics for $t$-Core Partitions and Stanton's …

200 papers

We derive the asymptotic formula for $p_n(N,M)$, the number of partitions of integer $n$ with part size at most $N$ and length at most $M$. We consider both $N$ and $M$ are comparable to $\sqrt{n}$. This is an extension of the classical…

Combinatorics · Mathematics 2019-03-14 Tiefeng Jiang , Ke Wang

Johnson recently proved Armstrong's conjecture which states that the average size of an $(a,b)$-core partition is $(a+b+1)(a-1)(b-1)/24$. He used various coordinate changes and one-to-one correspondences that are useful for counting…

Combinatorics · Mathematics 2017-11-07 Jineon Baek , Hayan Nam , Myungjun Yu

A partition of $n$ is called a $t$-core partition if none of its hook number is divisible by $t.$ In 2019, Hirschhorn and Sellers \cite{Hirs2019} obtained a parity result for $3$-core partition function $a_3(n)$. Recently, both authors…

Number Theory · Mathematics 2023-02-24 Nabin Kumar Meher , Ankita Jindal

Bessenrodt and Ono initially found the strict log-subadditivity of partition function $p(n)$, that is, $p(a+b)< p(a)p(b)$ for $a,b>1$ and $a+b>9$. Many other important statistics of partitions are proved to enjoy similar properties. Lovejoy…

Combinatorics · Mathematics 2022-06-28 Helen W. J. Zhang , Ying Zhong

We deduce from the strong form of the Hardy--Ramanujan asymptotics for the partition function $p(n)$ an asymptotics for $p_{-S}(n)$, the number of partitions of $n$ that do not use parts from a finite set $S$ of positive integers. We apply…

Number Theory · Mathematics 2018-12-17 Jaroslav Hančl

Let m be a positive integer, and let A be the set of all positive integers that belong to a union of r distinct congruence classes modulo m. We assume that the elements of A are relatively prime, that is, gcd(A) = 1. Let p_A(n) denote the…

Number Theory · Mathematics 2007-05-23 Melvyn B. Nathanson

Although consistency is a minimum requirement of any estimator, little is known about consistency of the mean partition approach in consensus clustering. This contribution studies the asymptotic behavior of mean partitions. We show that…

Machine Learning · Computer Science 2015-12-21 Brijnesh Jain

We give an asymptotic estimate for the number of partitions of a set of $n$ elements, whose block sizes avoid a given set $\mathcal{S}$ of natural numbers. As an application, we derive an estimate for the number of partitions of a set with…

Combinatorics · Mathematics 2018-06-07 Joshua Culver , Andreas Weingartner

Consider the following relaxation of the Hadwiger Conjecture: For each $t$ there exists $N_t$ such that every graph with no $K_t$-minor admits a vertex partition into $\ceil{\alpha t+\beta}$ parts, such that each component of the subgraph…

Combinatorics · Mathematics 2011-10-05 David R. Wood

Let A be a set of positive integers with gcd(A) = 1, and let p_A(n) be the partition function of A. Let c = \pi \sqrt(2/3). Let \alpha > 0. It is proved that log p_A(n) ~ c\sqrt(\alpha n) if and only if the set A has asymptotic density…

Number Theory · Mathematics 2007-05-23 Melvyn B. Nathanson

In this paper, we consider the asymptotic properties of hook numbers of partitions in restricted classes. More specifically, we compare the frequency with which partitions into odd parts and partitions into distinct parts have hook numbers…

Combinatorics · Mathematics 2026-02-13 William Craig , Madeline Locus Dawsey , Guo-Niu Han

We introduce the idea of (s,t)-closure and delta-sets and show that (s,t)-closed beta-sets which are contained set-wise in (s,t)-closed delta-sets are also contained partition-wise. This implies the maximal (s,t)-core partition theorem of…

Combinatorics · Mathematics 2008-09-15 Joseph Vandehey

Recently, Debruyne and Tenenbaum proved asymptotic formulas for the number of partitions with parts in $\mathcal{L}\subset\mathbb{N}$ ($\gcd(\mathcal{L})=1$) and good analytic properties of the corresponding zeta function, generalizing work…

Number Theory · Mathematics 2023-03-22 Walter Bridges , Benjamin Brindle , Kathrin Bringmann , Johann Franke

A special case of an elegant result due to Anderson proves that the number of $(s,s+1)$-core partitions is finite and is given by the Catalan number $C_s$. Amdeberhan recently conjectured that the number of $(s,s+1)$-core partitions into…

Combinatorics · Mathematics 2016-01-27 Armin Straub

Let $p(n)$ denote the partition function. In this paper our main goal is to derive an asymptotic expansion up to order $N$ (for any fixed positive integer $N$) along with estimates for error bounds for the shifted quotient of the partition…

Number Theory · Mathematics 2024-12-04 Koustav Banerjee , Peter Paule , Cristian-Silviu Radu , Carsten Schneider

Recently, much attention has been given to various inequalities among partition functions. For example, Nicolas, {and later DeSavlvo--Pak,} proved that $p(n)$ is eventually log-concave, and Ji--Zang showed that the cranks are eventually…

Number Theory · Mathematics 2022-09-27 Kathrin Bringmann , Siu Hang Man , Larry Rolen

If $s$ and $t$ are relatively prime J. Olsson proved in 2008 that the $s$-core of a $t$-core partition is again a $t$-core partition, and that the $s$-bar-core of a $t$-bar-core partition is again a $t$-bar-core partition. Here generalized…

Combinatorics · Mathematics 2013-01-09 Jean-Baptiste Gramain , Rishi Nath

The partition function, $p_A(n)$, is defined to be the number of partitions of $n$ with parts in the set A, where $n$ is a positive integer and $A$ is a set of positive integers. It is well documented that: if A is a finite set with…

Combinatorics · Mathematics 2025-09-23 David Christopher , Davamani Christober

A conforming partition of a rectilinear n-gon P (possibly with holes) is a partition of P into rectangles without using Steiner points (i.e., all corners of all rectangles must lie on the boundary of P). The stabbing number of such a…

Computational Geometry · Computer Science 2025-12-16 Therese Biedl , Stephane Durocher , Debajyoti Mondal , Rahnuma Islam Nishat , Bastien Rivier

We will prove an infinite family of asymptotic formulas for the logarithm of certain two-colored partitions. An infinite sub-family of these asymptotics was posed as a conjecture by Guadalupe.

Number Theory · Mathematics 2025-04-03 Lukas Mauth