Related papers: The Raney Numbers and $(s,s+1)$-Core Partitions

We provide a context around a conjectured closed form for the Hankel transform of linear combinations of consecutive pairs of Catalan numbers. This generalizes the formula for the Hankel transforms of the shifted Catalan numbers and the…

In this work, we introduce a vertex separator in trees known as a sweep-cover that is defined by an ancestor-descendent relationship with all nodes in the tree. We prove the recurrence relation of sweep-covers with $n$ subcovers $P_{\Delta,…

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…

Simultaneous core partitions have been widely studied since Anderson's work on the enumeration of $(s,t)$-core partitions. Amdeberhan and Leven showed that the number of $(s,s+1, \ldots, s+k)$-core partitions is equal to the number of $(s,…

Simultaneous core partitions are important objects in algebraic combinatorics. Recently there has been interest in studying the distribution of sizes among all $(s,t)$-cores for coprime $s$ and $t$. Zaleski (2017) gave strong evidence that…

A partition is called an $(s_1,s_2,\dots,s_p)$-core partition if it is simultaneously an $s_i$-core for all $i=1,2,\dots,p$. Simultaneous core partitions have been actively studied in various directions. In particular, researchers concerned…

Tewodros Amdeberhan and Armin Straub initiated the study of enumerating subfamilies of the set of (s,t)-core partitions. While the enumeration of (n+1,n+2)-core partitions into distinct parts is relatively easy (in fact it equals the…

In this paper we consider combinatorial numbers $C_{m, k}$ for $m\ge 1$ and $k\ge 0$ which unifies the entries of the Catalan triangles $ B_{n, k}$ and $ A_{n, k}$ for appropriate values of parameters $m$ and $k$, i.e., $B_{n,…

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…

In this paper we prove that Amdeberhan's conjecture on the largest size of $(t, t+1, t+2)$-core partitions is true. We also show that the number of $(t, t + 1, t + 2)$-core partitions with the largest size is $1$ or $2$ based on the parity…

We define q-Catalan bases which are a generalization of the q-polynomials z^n(z,q)_n. The determination of their dual bases involves some q-power series termed dual coefficients. We show how these dual coefficients occur in the solution of…

Suppose $s$ and $t$ are coprime natural numbers. A theorem of Olsson says that the $t$-core of an $s$-core partition is again an $s$-core. We generalise this theorem, showing that the $s$-weight of the $t$-core of a partition $\lambda$ is…

A new formula for the partition function $p(n)$ is developed. We show that the number of partitions of $n$ can be expressed as the sum of a simple function of the two largest parts of all partitions. Specifically, if $a_1 + >... + a_k = n$…

Consideration of a classification of the number of partitions of a natural number according to the members of sub-partitions differing from unity leads to a non-recursive formula for the number of irreducible representations of the…

We give a commutative algebra viewpoint on Andrews recursive formula for the partitions appearing in "Gordon's identities", which are a generalization of Rogers-Ramanujan identities. Using this approach and differential ideals we conjecture…

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…

Let $\mathcal{A}=(a_n)_{n\in\mathbb{N}_+}$ be a sequence of positive integers. Let $p_\mathcal{A}(n,k)$ denote the number of multi-color partitions of $n$ into parts in $\{a_1,\ldots,a_k\}$. We examine several arithmetic properties of the…

The Fibonacci numbers are the prototypical example of a recursive sequence, but grow too quickly to enumerate sets of integer partitions. The same is true for the other classical sequences $a(n)$ defined by Fibonacci-like recursions: the…

Let R(n,k) denote the number of permutations of {1,2,...,n} with k alternating runs. We find a grammatical description of the numbers R(n,k) and then present several convolution formulas involving the generating function for the numbers…

In this paper we consider the curves $H_{k,t}^{(p)} : y^{p^k}+y=x^{p^{kt}+1}$ over $\mathbb F_p$ and and find an exact formula for the number of $\mathbb F_{p^n}$-rational points on $H_{k,t}^{(p)}$ for all integers $n\ge 1$. We also give…