English
Related papers

Related papers: Poset algebras over well quasi-ordered posets

200 papers

It is a classical result that the multilinear component of the free Lie algebra is isomorphic (as a representation of the symmetric group) to the top (co)homology of the proper part of the poset of partitions $\Pi_n$ tensored with the sign…

Combinatorics · Mathematics 2017-11-21 Rafael S. González D'León

The main purpose of this article is to pose three problems which are easy to be formulated in an elementary way. These problems which are specifically important also for the new class of partially ordered sets seem to be not yet solved.

Combinatorics · Mathematics 2009-01-19 A. K. Kwasniewski

A permutation representation of a Coxeter group $W$ naturally defines an absolute order. This family of partial orders (which includes the absolute order on $W$) is introduced and studied in this paper. Conditions under which the associated…

Combinatorics · Mathematics 2013-03-08 Christos A. Athanasiadis , Yuval Roichman

In this paper, we first recall the construction of a twisted pre-Lie algebra structure on the species of finite connected topological spaces. Then we construct the corresponding nonassociative permutative coproduct, and we prove that the…

Combinatorics · Mathematics 2022-06-10 Mohamed Ayadi

Generalized Higman's Theorem is the direct counterpart of Higman's Theorem that asserts the closure of the class of \emph{better} quasi-orders, instead of the class of \emph{well} quasi-orders, under the construction $P\mapsto P^{<\omega}$…

Logic · Mathematics 2025-12-09 Fedor Pakhomov , Giovanni Soldà

A monoid $M$ generated by a set $S$ of symbols can be described as the set of equivalence classes of finite words in $S$ under some relations that specify when some contiguous sequence of symbols can be replaced by another. If $a,b\in S$, a…

Combinatorics · Mathematics 2011-01-26 Matthew J. Samuel

By reformulating a learning process of a set system L as a game between Teacher (presenter of data) and Learner (updater of the abstract independent set), we define the order type dim L of L to be the order type of the game tree. The theory…

Combinatorics · Mathematics 2012-03-01 Yohji Akama

Certain $*$-semigroups are associated with the universal $C^*$-algebra generated by a partial isometry, which is itself the universal $C^*$-algebra of a $*$-semigroup. A fundamental role for a $*$-structure on a semigroup is emphasized, and…

Operator Algebras · Mathematics 2014-06-03 Berndt Brenken

The partition problem is a well-known basic NP-complete problem. We mainly consider the optimization version of it in this paper. The problem has been investigated from various perspectives for a long time and can be solved efficiently in…

Discrete Mathematics · Computer Science 2024-05-10 Susumu Kubo

We define notions of semi-saturatedness and orthogonality for a Fell bundle over a quasi-lattice ordered group. We show that a compactly aligned product system of Hilbert bimodules can be naturally extended to a semi-saturated and…

Operator Algebras · Mathematics 2020-10-19 Camila F. Sehnem

We develop a new approach to highest weight categories $\cal{C}$ with good (and cogood) posets of weights via pseudocompact algebras by introducing ascending (and descending) quasi-hereditary pseudocompact algebras. For $\cal{C}$ admitting…

Rings and Algebras · Mathematics 2011-04-19 Frantisek Marko , Alexandr N. Zubkov

The poset of copies of a relational structure ${\mathbb X}$ is the partial order ${\mathbb P} ({\mathbb X} ) := \langle \{ Y \subset X: {\mathbb Y} \cong {\mathbb X}\}, \subset \rangle$ and each similarity of such posets (e.g. isomorphism,…

Logic · Mathematics 2023-10-17 Miloš S. Kurilić , Stevo Todorčević

This paper reports key advances in the study of the representation theory of the symplectic blob algebra. For suitable specialisations of the parameters we construct four large families of homomorphisms between cell modules. We hence find a…

Representation Theory · Mathematics 2017-07-21 Richard Green , Paul Martin , Alison Parker

A poset is (3+1)-free if it does not contain the disjoint union of chains of length 3 and 1 as an induced subposet. These posets play a central role in the (3+1)-free conjecture of Stanley and Stembridge. Lewis and Zhang have enumerated…

Combinatorics · Mathematics 2015-12-31 Mathieu Guay-Paquet , Alejandro H. Morales , Eric Rowland

We investigate a certain class of posets arising from semilattice actions. Let $S$ be a semilattice with identity. Let $S$ act on a set $C$. For $c,d\in C$ put $c\leq d$ iff there is some $s\in S$ with $ds=c$. Then $(C,\leq)$ is a poset.…

Logic · Mathematics 2016-09-16 Lawrence Valby

A poset $\bfp$ is well-partially ordered (WPO) if all its linear extensions are well orders~; the supremum of ordered types of these linear extensions is the {\em length}, $\ell(\bfp)$ of $\bfp$. We prove that if the vertex set $X$ of…

Logic · Mathematics 2015-10-05 Christian Delhommé , Maurice Pouzet

We show that the category of chain-complete posets is nearly locally presentable, we give a characterization of strong epimorphisms, and we offer an alternative proof of co-wellpoweredness.

Category Theory · Mathematics 2025-06-17 Jan Jurka , Jiří Rosický

In 2001, Chow developed the theory of the $B_n$ posets $P$ and the type $B$ $P$-partition enumerators $K^B_P$. To provide a representation-theoretic interpretation of $K^B_P$, we define the poset modules $M^B_P$ of the 0-Hecke algebra…

Representation Theory · Mathematics 2026-02-02 Young-Hun Kim , Dominic Searles

We investigate the (co)homological properties of two classes of Lie algebras that are constructed from any finite poset: the solvable class $\frak{gl}^\preceq$ and the nilpotent class $\frak{gl}^\prec$. We confirm the conjecture of…

Algebraic Topology · Mathematics 2018-09-03 Leon Lampret , Aleš Vavpetič

We introduce a flexible class of well-quasi-orderings (WQOs) on words that generalizes the ordering of (not necessarily contiguous) subwords. Each such WQO induces a class of piecewise testable languages (PTLs) as Boolean combinations of…

Formal Languages and Automata Theory · Computer Science 2018-02-22 Georg Zetzsche