Related papers: Partitions and their lattices
From the matrix point of view, we use the recursion to discuss four combinatorial numbers in terms of the integer lattice paths, this is different from Andr\'a's method (Andra). We give four tables and matrices, and their relations, and…
For each positive integer $n$, let $G_n$ be the graph of integer partitions of $n$, where two partitions are adjacent if one is obtained from the other by an elementary transfer of a cell in the Ferrers diagram, followed by reordering.…
For stacked simplicial complexes, (special subclasses of such are: trees, triangulations of polygons, stacked polytopes), we give an explicit bijection between partitions of facets (for trees: edges), and partitions of vertices into…
Bipartite graphs model the relationships between two disjoint sets of entities in several applications and are naturally drawn as 2-layer graph drawings. In such drawings, the two sets of entities (vertices) are placed on two parallel lines…
We present a simple iteration for the Lebesgue identity on partitions, which leads to a refinement involving the alternating sums of partitions.
Clustering is a common technique for statistical data analysis, Clustering is the process of grouping the data into classes or clusters so that objects within a cluster have high similarity in comparison to one another, but are very…
We present a new identity involving compositions (i.e. ordered partitions of natural numbers). The Formula has its origin in complex dynamical systems and appears when counting, in the polynomial family $\{f_c:z \mapsto z^d + c \}$,…
This article investigates atomic decompositions in geometric lattices isomorphic to the partition lattice $\Pi(X)$ of a finite set $X$, a fundamental structure in lattice theory and combinatorics. We explore the role of atomicity in these…
Recently, Braunstein et al. [1] introduced normalized Laplacian matrices of graphs as density matrices in quantum mechanics and studied the relationships between quantum physical properties and graph theoretical properties of the underlying…
We explore partitions that lie in the intersection of several sets of classical interest: partitions with parts indivisible by $m$, appearing fewer than $m$ times, or differing by less than $m$. We find results on their behavior and…
We exhibit, for any positive integer parameter $s$, an involution on the set of integer partitions of $n$. These involutions show the joint symmetry of the distributions of the following two statistics. The first counts the number of parts…
We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…
A new matrix operation based on inserting columns and rows, similarly to the mediant operation between fractions, gives rise to the Farey determinants matrix or, equivalently, the matrix of the numerators of the differences of Farey…
Using a specific form of the triple product identity, polygonal number identities are stated. Further number identities are examined that can be considered identities related to modular sets of numbers. The identities can be used to give…
Refined versions, analytic and combinatorial, are given for classical integer partition theorems. The examples include the Rogers-Ramanujan identities, the Gollnitz-Gordon identities, Euler's odd=distinct theorem, and the Andrews-Gordon…
We define a generalized vector partition function and derive an identity for generating series of such functions associated with solutions of basic recurrence relation of combinatorial analysis. As a consequence, we obtain the generating…
We show that, for a certain class of partitions and an even number of variables of which half are reciprocals of the other half, Schur polynomials can be factorized into products of odd and even orthogonal characters. We also obtain related…
The lattice of noncrossing partitions is well-known for its wide variety of combinatorial appearances and properties. For example, the lattice is rank-symmetric and enumerated by the Catalan numbers. In this article, we introduce a large…
The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…
The division between two vectors belonging to the same vector space is obtained by elementary procedures of vector algebra and is defined by a matrix. This representation is obtained for two and three dimensional vector spaces. A new vector…