English
Related papers

Related papers: Classifications of $\Gamma$-colored $d$-complete p…

200 papers

A poset is representable if it can be embedded in a field of sets in such a way that existing finite meets and joins become intersections and unions respectively (we say finite meets and joins are preserved). More generally, for cardinals…

Logic · Mathematics 2016-08-31 Rob Egrot

This paper establishes a link between the theory of cluster algebras and the theory of representations of partially ordered sets. We introduce a class of posets by requiring avoidance of certain types of peak-subposets and show that these…

Representation Theory · Mathematics 2019-12-17 Ralf Schiffler , Robinson-Julian Serna

We show that, up to Morita equivalence, any finite-dimensional algebra with a suitable homological system, admits an exact Borel subalgebra. This generalizes a theorem by Koenig, K\"ulshammer and Ovsienko, which holds for quasi-hereditary…

Representation Theory · Mathematics 2020-12-29 Raymundo Bautista Ramos , Jesús Efrén Pérez Terrazas , Leonardo Salmerón Castro

The algebra generated by the down and up operators on a differential partially ordered set (poset) encodes essential enumerative and structural properties of the poset. Motivated by the algebras generated by the down and up operators on…

Representation Theory · Mathematics 2016-09-07 Georgia Benkart , Tom Roby

Weighted projective lines, introduced by Geigle and Lenzing in 1987, are important objects in representation theory. They have tilting bundles, whose endomorphism algebras are the canonical algebras introduced by Ringel. The aim of this…

Representation Theory · Mathematics 2020-02-20 Martin Herschend , Osamu Iyama , Hiroyuki Minamoto , Steffen Oppermann

We prove that for any $\mathbb{N}$-graded Gorenstein tiled order $A$, the stable category $\underline{\mathrm{CM}}^{\mathbb{Z}}A$ is triangle equivalent to the perfect derived category of the incidence algebra of a finite poset…

Representation Theory · Mathematics 2026-02-03 Osamu Iyama , Junyang Liu

Ehrenborg and Jung recently related the order complex for the lattice of d-divisible partitions with the simplicial complex of pointed ordered set partitions via a homotopy equivalence. The latter has top homology naturally identified as a…

Combinatorics · Mathematics 2011-11-17 Alexander Miller

This paper studies the poset of eigenspaces of elements of an imprimitive unitary reflection group, for a fixed eigenvalue, ordered by the reverse of inclusion. The study of this poset is suggested by the eigenspace theory of Springer and…

Combinatorics · Mathematics 2013-04-03 Justin Koonin

We generalize Bj\"{o}rner and Stanley's poset of compositions to $m$-colored compositions. Their work draws many analogies between their (1-colored) composition poset and Young's lattice of partitions, including links to (quasi-)symmetric…

Combinatorics · Mathematics 2007-05-23 Brian Drake , T. Kyle Petersen

For $p$ a prime number and $\mathscr{P}$ a $p$-equipped finite partially ordered set we construct two different right-peak algebras (in the sense of \cite{KS}) $\Lambda^{(r)}$ and $\Lambda^{(c)}$. We consider the category…

Representation Theory · Mathematics 2018-10-05 Raymundo Bautista , Ivon Dorado

The main result provide a common generalization for Ramsey-type theorems concerning finite colorings of edge sets of complete graphs with vertices in infinite semigroups. We capture the essence of theorems proved in different fields: for…

Combinatorics · Mathematics 2021-07-08 Piotr Szewczak

Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We give a representation of directed graphs by k-posets; this provides a new proof of the universality of the homomorphism order of k-posets. This…

Combinatorics · Mathematics 2016-11-22 Leonard Kwuida , Erkko Lehtonen

We classify $n$-representation infinite algebras $\Lambda$ of type \~A. This type is defined by requiring that $\Lambda$ has higher preprojective algebra $\Pi_{n+1}(\Lambda) \simeq k[x_1, \ldots, x_{n+1}] \ast G$, where $G \leq…

Representation Theory · Mathematics 2024-11-25 Darius Dramburg , Oleksandra Gasanova

We classify and explicitly describe homomorphisms of Verma modules for conformal Galilei algebras $\mathfrak{cga}_\ell(d,{\mathbb C})$ with $d=1$ for any integer value $\ell \in \mathbb{N}$. The homomorphisms are uniquely determined by…

Representation Theory · Mathematics 2017-10-25 Libor Křižka , Petr Somberg

The dimension of a partially ordered set $P$ (poset for short) is the least positive integer $d$ such that $P$ is isomorphic to a subposet of $\mathbb{R}^d$ with the natural product order. Dimension is arguably the most widely studied…

Combinatorics · Mathematics 2025-12-19 Heather Smith Blake , Jędrzej Hodor , Piotr Micek , Michał T. Seweryn , William T. Trotter

We classify graded pre-Nichols algebras of diagonal type with finite Gelfand-Kirillov dimension. The characterization is made through an isomorphism of posets with the family of appropriate subsets of the set of positive roots coming from…

Representation Theory · Mathematics 2024-03-28 Iván Angiono , Emiliano Campagnolo

In this paper, we explore algebraic approaches to $d$-improper and $t$-clustered colourings, where the colouring constraints are relaxed to allow some monochromatic edges. Bilu [J. Comb. Theory Ser. B, 96(4):608-613, 2006] proved a…

Combinatorics · Mathematics 2024-11-12 Krystal Guo , Ross J. Kang , Gabriëlle Zwaneveld

A poset is $(\omega,C)$-representable if it can be embedded into a field of sets in such a way that all existing joins, and all existing \emph{finite} meets are preserved. We show that the class of $(\omega,C)$-representable posets cannot…

Logic · Mathematics 2017-06-02 Rob Egrot

In our previous papers, together with J. Paseka we introduced so-called sectionally pseudocomplemented lattices and posets and illuminated their role in algebraic constructions. We believe that - similar to relatively pseudocomplemented…

Logic · Mathematics 2020-07-28 Ivan Chajda , Helmut Länger

For a (finite) partially ordered set (poset) $P$, we call a dominating set $D$ in the comparability graph of $P$, an order-sensitive dominating set in $P$ if either $x\in D$ or else $a<x<b$ in $P$ for some $a,b\in D$ for every element $x$…

Combinatorics · Mathematics 2023-07-28 Yusuf Civan , Zakir Deniz , Mehmet Akif Yetim