相关论文: Partitions and their lattices

Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…

Say that mu is a ``subpartition'' of an integer partition lambda if the multiset of parts of mu is a submultiset of the parts of lambda, and define an integer partition lambda to be ``wide'' if for every subpartition mu of lambda, mu >= mu'…

Lattice-based Cryptography is considered to have the characteristics of classical computers and quantum attack resistance. We will design various graphic lattices and matrix lattices based on knowledge of graph theory and topological…

Partitioning large matrices is an important problem in distributed linear algebra computing (used in ML among others). Briefly, our goal is to perform a sequence of matrix algebra operations in a distributed manner (whenever possible) on…

A partition of a finite abelian group gives rise to a dual partition on the character group via the Fourier transform. Properties of the dual partitions are investigated and a convenient test is given for the case that the bidual partition…

We study partitions of totally positive integers in real quadratic fields. We develop an algorithm for computing the number of partitions, prove a result about the parity of the partition function, and characterize the quadratic fields such…

Let $B$ be an infinite subset of $\mathbf{N}$. When we consider partitions of natural numbers into elements of $B$, a partition number without a restriction of the number of equal parts can be expressed by partition numbers with a…

The exactly solvable four-vertex model with the fixed boundary conditions in the presence of inhomogeneous linearly growing external field is considered. The partition function of the model is calculated and represented in the determinantal…

We prove an identity about partitions, previously conjectured in the study of shifted Jack polynomials (math.CO/9903020). The proof given is using $\lambda$-ring techniques. It would be interesting to obtain a bijective proof.

Multi-layer graphs consist of several graphs (layers) over the same vertex set. They are motivated by real-world problems where entities (vertices) are associated via multiple types of relationships (edges in different layers). We chart the…

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…

Density matrices of graphs are combinatorial laplacians normalized to have trace one (Braunstein \emph{et al.} \emph{Phys. Rev. A,} \textbf{73}:1, 012320 (2006)). If the vertices of a graph are arranged as an array, then its density matrix…

Graph partitioning, or the dividing of a graph into two or more parts based on certain conditions, arises naturally throughout discrete mathematics, and problems of this kind have been studied extensively. In the 1990s, Ando conjectured…

Just as knowing some roots of a polynomial allows one to factor it, a well-known result provides a factorization of any scalar differential operator given a set of linearly independent functions in its kernel. This note provides a…

It is well known that the number of partitions into distinct even parts equals the number of $4$-regular partitions. In this paper we prove identities relating certain restricted partitions into distinct even parts with restricted…

Barycentric coordinates provide solutions to the problem of expressing an element of a compact convex set as a convex combination of a finite number of extreme points of the set. They have been studied widely within the geometric…

An internal partition of a graph is a partitioning of the vertex set into two parts such that for every vertex, at least half of its neighbors are on its side. We prove that for every positive integer $r$, asymptotically almost every…

A new method of hierarchical clustering of graph vertexes is suggested. In the method, the graph partition is determined with an equivalence relation satisfying a recursive definition stating that vertexes are equivalent if the vertexes…

In a work of 1995, Alladi, Andrews, and Gordon provided a generalization of the two Capparelli identities involving certain classes of integer partitions. Inspired by that contribution, in particular as regards the general setting and the…

A partition of degree $n$ is a decomposition $n=i_1+i_2+\dots+i_q$, where ${i_1,i_2,\dots,i_q}$ are positive integers called the parts of the partition. Let $\lambda>0$ be an integer. The partition is said to be a $\lambda$--partition if…