Related papers: The Lattice of integer partitions and its infinite…
This paper first gives a necessary and sufficient condition that a lattice $L$ can be represented as the collection of all up-sets of a poset. Applying the condition, it obtains a necessary and sufficient condition that a lattice can be…
Given an integer partition $\la=(\la_1, ..., \la_\ell)$ and an integer k, denote by $\la^{(k)}$ the sequence of length $\ell$ obtained by reordering the values $|\la_i-k|$ in non-increasing order. If $\la$ dominates $\mu$ and has the same…
We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…
The lattice of the set partitions of $[n]$ ordered by refinement is studied. Given a map $\phi: [n] \rightarrow [n]$, by taking preimages of elements we construct a partition of $[n]$. Suppose $t$ partitions $p_1,p_2,\dots,p_t$ are chosen…
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…
In this paper, we introduce a natural geometric extension of the partition function. More precisely, we investigate the problem of counting partitions of a rectangle into rectangular blocks with integer sides. Here, two partitions of a…
We provide a naturally isomorphic description of the persistence map from merge trees to barcodes in terms of a monotone map from the partition lattice to the subset lattice. Our description is local, which offers the potential to speed up…
We introduce and study the lattice of generalized partitions, called weighted partitions. This lattice possesses similar properties of the lattice of partitions. By use of the pictorial representation of a weighted partition, the total…
We characterize the downsets of integer partitions (ordered by containment of Ferrers diagrams) and compositions (ordered by the generalized subword order) which have finite dimension in the sense of Dushnik and Miller. In the case of…
We prove that every finite distributive lattice is isomorphic to a final segment of the d.c.e. Turing degrees (i.e., the degrees of differences of computably enumerable sets). As a corollary, we are able to infer the undecidability of the…
We partition a series of natural numbers into infinite number sequences. We consider two partitioning options: (a) a forest of unary trees with recurrence formula of Mersenne numbers, and (b) a set of arithmetic progressions with difference…
Certain mathematical structures make a habit of reoccuring in the most diverse list of settings. Some obvious examples exhibiting this intrusive type of behavior include the Fibonacci numbers, the Catalan numbers, the quaternions, and the…
For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…
We study the enumeration problem of higher dimensional partitions, a natural generalisation of classical integer partitions. We show that their counting problem is equivalent to the enumeration of simpler classes of higher dimensional…
We show that the partition function of many classical models with continuous degrees of freedom, e.g. abelian lattice gauge theories and statistical mechanical models, can be written as the partition function of an (enlarged)…
Improving upon previous work on the subject, we use Wright's Circle Method to derive an asymptotic formula for the number of parts in all partitions of an integer that are in any given arithmetic progression.
SPM (Sand Pile Model) is a simple discrete dynamical system used in physics to represent granular objects. It is deeply related to integer partitions, and many other combinatorics problems, such as tilings or rewriting systems. The…
We give a combinatorial model for the bounded derived category of graded modules over the dual numbers in terms of arcs on the integer line with a point at infinity. Using this model we describe the lattice of thick subcategories of the…
The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…
In this report, we summarize the set partition enumeration problems and thoroughly explain the algorithms used to solve them. These algorithms iterate through the partitions in lexicographic order and are easy to understand and implement in…