Related papers: The canonical join complex

Given a join semilattice $S$ with a minimum $\hat{0}$, the quarks (also called atoms in order theory) are the elements that cover $\hat{0}$, and for each $x \in S \setminus \{\hat{0}\}$ a factorization (into quarks) of $x$ is a minimal set…

The canonical dimension is an invariant attached to admissible representations of p-adic reductive groups, which has only received significant attention in the case of mod-p representations. In the case of complex representations, the…

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…

This paper is concerned with structures of general graphs with perfect matchings. We first reveal a partially ordered structure among factor-components of general graphs with perfect matchings. Our second result is a generalization of…

The canonical basis for quantized universal enveloping algebras associated to the finite--dimensional simple Lie algebras, was introduced by Lusztig. The principal technique is the explicit construction (via the braid group action) of a…

We classify surjective lattice homomorphisms $W\to W'$ between the weak orders on finite Coxeter groups. Equivalently, we classify lattice congruences $\Theta$ on $W$ such that the quotient $W/\Theta$ is isomorphic to $W'$. Surprisingly,…

We classify the finite dimensional irreducible representations of rectangular finite $W$-algebras, i.e., the finite $W$-algebras $U(\mathfrak{g}, e)$ where $\mathfrak{g}$ is a symplectic or orthogonal Lie algebra and $e \in \mathfrak{g}$ is…

The N distinct prime numbers that make up a composite number M allow $2^{N-1}$ bi partioning into two relatively prime factors. Each such pair defines a pair of conjugate representations. These pairs of conjugate representations, each of…

For a lattice L with 0 and 1, let Princ L denote the ordered set of principal congruences of L. For {0,1}-sublattices A subseteq B of L, congruence generation defines a natural map from Princ A to Princ B. In this way, we obtain a small…

We investigate the standard context, denoted by $\mathbb{K}\left(\mathcal{L}_{n}\right)$, of the lattice $\mathcal{L}_{n}$ of partitions of a positive integer $n$ under the dominance order. Motivated by the discrete dynamical model to study…

We are interested in representations and characterizations of lattice polynomial functions f:L^n -> L, where L is a given bounded distributive lattice. In companion papers [arXiv 0901.4888, arXiv 0808.2619], we investigated certain…

For a lattice L, let Princ L denote the ordered set of principal congruences of L. In a pioneering paper, G. Gratzer characterized the ordered sets Princ L of finite lattices L; here we do the same for countable lattices. He also showed…

Given a poset $P$, a join-specification $\mathcal U$ for $P$ is a set of subsets of $P$ whose joins are all defined. The set $\mathcal I_{\mathcal U}$ of downsets closed under joins of sets in $\mathcal U$ forms a complete lattice, and is,…

In this paper we primarily study monomial ideals and their minimal free resolutions by studying their associated LCM lattices. In particular, we formally define the notion of coordinatizing a finite atomic lattice P to produce a monomial…

Every lattice is isomorphic to a lattice whose elements are sets of sets, and whose operations are intersection and an operation extending the union of two sets of sets A and B by the set of all sets in which the intersection of an element…

We attach to each $\langle 0, \vee \rangle$-semilattice a graph $\boldsymbol{G}_{\boldsymbol{S}}$ whose vertices are join-irreducible elements of $\boldsymbol{S}$ and whose edges correspond to the reflexive dependency relation. We study…

Let A = (A,V) be a complex hyperplane arrangement and let L(A) denote its intersection lattice. The arrangement A is called supersolvable, provided its lattice L(A) is supersolvable. For X in L(A), it is known that the restriction A^X is…

For each finite real reflection group $W$, we identify a copy of the type-$W$ simplicial generalised associahedron inside the corresponding simplicial permutahedron. This defines a bijection between the facets of the generalised…

This paper primarily studies monomial ideals by their associated lcm-lattices. It first introduces notions of weak coordinatizations of finite atomic lattices which have weaker hypotheses than coordinatizations and shows the…

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…