Related papers: Square Partitions and Catalan Numbers

We present linear-time algorithms for partitioning a path or a tree with weights on the vertices by removing $k$ edges to maximize the minimum-weight component. We also use the same framework to partition a path with weight on the vertices,…

It is known that every matrix of order n over the maximal order in an algebraic number eld is a sum of k-th powers in various cases if a discriminant condition is satis ed. It has been proved by Wadikar and Katre that for every matrix of…

Given an integer partition $P = (h_1h_2\dots h_k)$ of $n$, a realization of $P$ is a latin square with disjoint subsquares of orders $h_1,h_2,\dots,h_k$. Most known results restrict either $k$ or the number of different integers in $P$.…

The elementary symmetric partition function is a map on the set of partitions. It sends a partition lambda to the partition whose parts are the summands in the evaluation of the elementary symmetric function on the parts of lambda. These…

Partition functions of certain classes of "spin glass" models in statistical physics show strong connections to combinatorial graph invariants. Also known as homomorphism functions they allow for the representation of many such invariants,…

Fix a partition $\mu=(\mu_1,\dotsc,\mu_m)$ of an integer $k$ and positive integer $d$. For each $n>k$, let $\chi^\lambda_\mu$ denote the value of the irreducible character of $S_n$ at a permutation with cycle type…

In this paper, we define four transformations on the classical Catalan triangle $\mathcal{C}=(C_{n,k})_{n\geq k\geq 0}$ with $C_{n,k}=\frac{k+1}{n+1}\binom{2n-k}{n}$. The first three ones are based on the determinant and the forth is…

In this paper we study partitions whose successive ranks belong to a given set. We enumerate such partitions while keeping track of the number of parts, the largest part, the side of the Durfee square, and the height of the Durfee…

A generalized Catalan matrix $(a_{n,k})_{n,k\ge 0}$ is generated by two seed sequences $\mathbf{s}=(s_0,s_1,\ldots)$ and $\mathbf{t}=(t_1,t_2,\ldots)$ together with a recurrence relation. By taking $s_\ell=2\ell+1$ and $t_\ell=\ell^2$ we…

When defining the amount of additive structure on a set it is often convenient to consider certain sumsets; Calculating the cardinality of these sumsets can elucidate the set's underlying structure. We begin by investigating finite sets of…

In order to use quantum devices for computations, it is necessary to understand the intricacies of the theoretical description. To this end, we provide several novel constructions useful for the comprehension of quantum mechanics from the…

In this paper, we use a branch of polyhedral geometry, Ehrhart theory, to expand our combinatorial understanding of congruences for partition functions. Ehrhart theory allows us to give a new decomposition of partitions, which in turn…

A classical theorem of Baranyai states that, given integers $2\leq k < n$ such that $k$ divides $n$, one can find a family of ${n-1\choose k-1}$ partitions of $[n]$ into $k$-element subsets such that every subset appears in exactly one…

We use a variation of the Circle Method, along with the Saddle Point Method, to obtain an asymptotic formula for the number of partitions of a number n into integers which are sums of two squares. Unlike previous work on partitions into…

The Catalan number $C_n$ enumerates parenthesizations of $x_0*\dotsb*x_n$ where $*$ is a binary operation. We introduce the modular Catalan number $C_{k,n}$ to count equivalence classes of parenthesizations of $x_0*\dotsb*x_n$ when $*$…

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)$…

The Catalan numbers $C_k$ were first studied by Euler, in the context of enumerating triangulations of polygons $P_{k+2}$. Among the many generalizations of this sequence, the Fuss-Catalan numbers $C^{(d)}_k$ count enumerations of…

Let $K$ be a number field, let $A$ be a finite-dimensional $K$-algebra, let $\mathrm{J}(A)$ denote the Jacobson radical of $A$, and let $\Lambda$ be an $\mathcal{O}_{K}$-order in $A$. Suppose that each simple component of the semisimple…

This paper establishes an interesting link between $k$th price auctions and Catalan numbers by showing that for distributions that have linear density, the bid function at any symmetric, increasing equilibrium of a $k$th price auction with…

In the matroid partitioning problem, we are given $k$ matroids $\mathcal{M}_1 = (V, \mathcal{I}_1), \dots , \mathcal{M}_k = (V, \mathcal{I}_k)$ defined over a common ground set $V$ of $n$ elements, and we need to find a partitionable set $S…