English
Related papers

Related papers: Core Partitions With d-Distinct Parts

200 papers

Let $d \ge 2, h \ge 1$ be integers. Using a fragmentation technique, we characterise $(h+1)$-tuples $(R_1, \dots, R_h, R)$ of non-empty families of partitions of $\{1, \dots, d\}$ such that it suffices for an order-$d$ tensor to have…

Combinatorics · Mathematics 2023-10-18 Thomas Karam

In 2003, Maroti showed that one could use the machinery of l-cores and l-quotients of partitions to establish lower bounds for p(n), the number of partitions of n. In this paper we explore these ideas in the case l=2, using them to give a…

Combinatorics · Mathematics 2007-05-23 Mark Wildon

Suppose $s$ and $t$ are coprime positive integers, and let $\sigma$ be an $s$-core partition and $\tau$ a $t$-core partition. In this paper we consider the set $\mathcal P_{\sigma,\tau}(n)$ of partitions of $n$ with $s$-core $\sigma$ and…

Combinatorics · Mathematics 2021-12-09 Matthew Fayers

We classify the connection between $t$-cores and self-conjugate $t$-cores to sums of squares. To do so, we provide explicit maps between $t$-core partitions and self-conjugate $t$-core partitions of a positive integer $n$ to representations…

Combinatorics · Mathematics 2022-04-20 Joshua Males , Zack Tripp

We observe that for a and b relatively prime, the "abacus construction" identifies the set of simultaneous (a,b)-core partitions with lattice points in a rational simplex. Furthermore, many statistics on (a,b)-cores are piecewise polynomial…

Combinatorics · Mathematics 2015-06-24 Paul Johnson

We give a construction for the d-dimensional simplices with all distances in {1,2} from the set of partitions of d+1.

Combinatorics · Mathematics 2007-05-23 Christian Haase , Sascha Kurz

Recently, Deutsch and Elizalde studied the largest and the smallest fixed points of permutations. Motivated by their work, we consider the analogous problems in set partitions. Let $A_{n,k}$ denote the number of partitions of $\{1,2,\dots,…

Combinatorics · Mathematics 2010-07-09 Yidong Sun , Xiaojuan Wu

We calculate the partition function for "composite particles". For any finite number of states d, and in the following two cases: 1)all states have the same energy, 2)the energy is linearly distributed over the states, we transform the…

Condensed Matter · Physics 2007-05-23 M. Bergère

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

This article introduces recursive relations allowing the calculation of the number of partitions with constraints on the minimum and/or on the maximum fragment size.

Nuclear Theory · Physics 2009-11-07 Pierre Desesquelles

For a positive integer $d$, a non-negative integer $n$ and a non-negative integer $h\leq n$, we study the number $C_{n}^{(d)}$ of principal ideals; and the number $C_{n,h}^{(d)}$ of principal ideals generated by an element of rank $h$, in…

Combinatorics · Mathematics 2019-12-23 Chwas Ahmed , Paul Martin , Volodymyr Mazorchuk

Let $\mathrm{pod}(n)$ denote the number of partitions of $n$ with odd parts distinct, and ${{r}_{k}}(n)$ be the number of representations of $n$ as sum of $k$ squares. We find the following two arithmetic relations: for any integer $n\ge…

Number Theory · Mathematics 2014-11-03 Liuquan Wang

We study generalised core partitions arising from affine Grassmannian elements in arbitrary Dynkin type. The corresponding notion of size is given by the atomic length in the sense of [CLG22]. In this paper, we first develop the theory for…

Combinatorics · Mathematics 2025-09-23 Olivier Brunat , Nathan Chapelier-Laget , Thomas Gerber

The study of the well-known partition function $p(n)$ counting the number of solutions to $n = a_{1} + \dots + a_{\ell}$ with integers $1 \leq a_{1} \leq \dots \leq a_{\ell}$ has a long history in combinatorics. In this paper, we study a…

Number Theory · Mathematics 2024-01-05 Gabriel F. Lipnik , Manfred G. Madritsch , Robert F. Tichy

Euler's theorem asserts that $A(n)=B(n)$ where $A(n)$ is the number of partitions of $n$ into distinct parts and $B(n)$ is the number of partitions of $n$ into odd parts. In this paper, it is proved that for $n>0$, \begin{align*}…

Combinatorics · Mathematics 2025-11-07 George E. Andrews , Rahul Kumar , Ae Ja Yee

In this paper, we derive certain congruences for the number of $3$-core cubic bipartitions using elementary $q$-series manipulations and dissection formulas.

Number Theory · Mathematics 2023-12-12 Russelle Guadalupe

For positive integers $n, L$ and $s$, consider the following two sets that both contain partitions of $n$ with the difference between the largest and smallest parts bounded by $L$: the first set contains partitions with smallest part $s$,…

Combinatorics · Mathematics 2022-05-18 Damanvir Singh Binner , Amarpreet Rattan

Given a sequence $S=(s_1,\dots,s_m) \in [0, 1]^m$, a block $B$ of $S$ is a subsequence $B=(s_i,s_{i+1},\dots,s_j)$. The size $b$ of a block $B$ is the sum of its elements. It is proved in [1] that for each positive integer $n$, there is a…

Combinatorics · Mathematics 2017-06-21 I. Bárány , E. Csóka , Gy. Károlyi , G. Tóth

Topologically stable cellular partitions of D dimensional spaces are studied. A complete statistical description of the average structural properties of such partition is given in term of a sequence of D/2-1 (or (D-1)/2) variables for D…

Disordered Systems and Neural Networks · Physics 2009-10-31 Tomaso Aste

In this paper we associate to any $LS$-sequence of partitions ${\rho_{L,S}^n}$ the corresponding $LS$-sequence of points ${\xi_{L,S}^n}$ obtained reordering the points of each partition with an explicit algorithm. The procedure begins with…

Number Theory · Mathematics 2013-04-23 Ingrid Carbone