Related papers: Representing partition lattices through FCA
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…
This paper studies the combinatorics of lattice congruences of the weak order on a finite Weyl group $W$, using representation theory of the corresponding preprojective algebra $\Pi$. Natural bijections are constructed between important…
This is the first paper in a series on intrinsic Donaldson-Thomas theory, where we develop a new framework for enumerative geometry that allows the generalization of constructions and results from linear moduli stacks to general non-linear…
The set of permutations on a finite set can be given the lattice structure known as the weak Bruhat order. This lattice structure is generalized to the set of words on a fixed alphabet $\Sigma$ = {x,y,z,...}, where each letter has a fixed…
Given an integral lattice $\Lambda$ of rank $n$ and a finite sequence $m_1 \leq m_2 \leq ... \leq m_k$ of natural numbers we construct a modular form $\Theta_{m_1,m_2,...,m_k,\Lambda}$ of level $N=N(\Lambda)$. The weight of this modular…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
Zeckendorf proved that every positive integer has a unique partition as a sum of non-consecutive Fibonacci numbers. We study the difference between the number of summands in the partition of two consecutive integers. In particular, let…
The number of parts in the partitions (resp. distinct partitions) of $n$ with parts from a set were considered. Its generating functions were obtained. Consequently, we derive several recurrence identities for the following functions: the…
Given a finite set of vectors spanning a lattice and lying in a halfspace of a real vector space, to each vector $a$ in this vector space one can associate a polytope consisting of nonnegative linear combinations of the vectors in the set…
Let $\Lambda$ be a finite-dimensional algebra over a field $K$. We describe how Buan and Marsh's $\tau$-exceptional sequences can be used to give a "brick labeling" of a certain poset of wide subcategories of finitely-generated…
We write $S_{\leq n}(A)$ and $\Part_{\fin}(A)$ for the set of permutations with at most $n$ non-fixed points, where $n$ is a natural number, and the set of partitions whose members are finite, respectively, of a set $A$. Among our results,…
We classify the irreducible modules of a rational Lorentzian lattice vertex operator algebra (LLVOA) based on an even, self-dual Lorentzian lattice $\Lambda\subset\mathbb{R}^{m,n}$ of signature $(m,n)$. We show that the set of isomorphism…
A lattice $L$ is said lowly finite if the set $[\mathsf{0},a]$ is finite for every element $a$ of $L$. We mainly aim to provide a complete proof that, if $M$ is a subset of a complete lowly finite distributive lattice $L$ containing its…
Young's lattice $L(m,n)$ consists of partitions having $m$ parts of size at most $n$, ordered by inclusion of the corresponding Ferrers diagrams. K. O'Hara gave the first constructive proof of the unimodality of the Gaussian polynomials by…
A lattice L is spatial if every element of L is a join of completely join-irreducible elements of L (points), and strongly spatial if it is spatial and the minimal coverings of completely join-irreducible elements are well-behaved.…
Given a filter $\Delta$ in the poset of compositions of $n$, we form the filter $\Pi^{*}_{\Delta}$ in the partition lattice. We determine all the reduced homology groups of the order complex of $\Pi^{*}_{\Delta}$ as ${\mathfrak…
We present a systematic method for constructing lattice QCD operators for systems of an arbitrary number of particles with arbitrary momentum, spin, and internal quantum numbers. Explicit constructions are provided for one-, two-, three-,…
We study the combinatorial properties of final types, which are certain non-decreasing sequences of integers, together with the partitions naturally associated with them. As a consequence, we obtain an identity expressing the $n$-nacci…
Let \(\mathcal{P}(n)\) be the set of partitions of the positive integer \(n\). For \(\alpha=(\alpha_1,...,\alpha_t) \in \mathcal{P}(n)\) define the diagonal sequence \(\delta(\alpha)=(d_k(\alpha))_{k \geq 1}\) via \( d_k(\alpha) =…
In this paper, we study two kinds of combinatorial objects, generalized integer partitions and tilings of two dimensional zonotopes, using dynamical systems and order theory. We show that the sets of partitions ordered with a simple…