English
Related papers

Related papers: Poset algebras over well quasi-ordered posets

200 papers

Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are: (a) being atomic, i.e. not being…

Combinatorics · Mathematics 2020-12-23 Matthew McDevitt , Nik Ruskuc

The lattice of intersections of reflecting hyperplanes of a complex reflection group W may be considered as the poset of 1-eigenspaces of the elements of W. In this paper we replace 1 with an arbitrary eigenvalue and study the topology and…

Combinatorics · Mathematics 2012-08-10 Alexander R. Miller

A lattice-ordered group (an $\ell$-group) $G(\oplus, \vee, \wedge)$ can be naturally viewed as a semiring $G(\vee,\oplus)$. We give a full classification of (abelian) $\ell$-groups which are finitely generated as semirings, by first showing…

Group Theory · Mathematics 2017-08-02 Vítězslav Kala

A lifting of a semilattice S is an algebra A such that the semilattice of compact (=finitely generated) congruences of A is isomorphic to S. The aim of this work is to give a categorical theory of partial algebras endowed with a partial…

Category Theory · Mathematics 2010-12-10 Pierre Gillibert

On an arbitrary meet-semilattice S with 0 we define an orthogonality relation and investigate the lattice Cl(S) of all subsets of S closed under this orthogonality. We show that if S is atomic then Cl(S) is a complete atomic Boolean…

Combinatorics · Mathematics 2024-04-23 Ivan Chajda , Miroslav Kolařík , Helmut Länger

We define semi-pointed partition posets, which are a generalisation of partition posets and show that they are Cohen-Macaulay. We then use multichains to compute the dimension and the character for the action of the symmetric groups on…

Combinatorics · Mathematics 2015-06-04 Bérénice Delcroix-Oger

We discuss the theory of certain partially ordered sets that capture the structure of commutation classes of words in monoids. As a first application, it follows readily that counting words in commutation classes is #P-complete. We then…

Discrete Mathematics · Computer Science 2011-08-19 Matthew J. Samuel

For a rank two root system and a pair of nonnegative integers, using only elementary combinatorics we construct two posets. The constructions are uniform across the root systems A1+A1, A2, C2, and G2. Examples appear in Figures 3.2 and 3.3.…

For P a poset or lattice, let Id(P) denote the poset, respectively, lattice, of upward directed downsets in P, including the empty set, and let id(P)=Id(P)-\{\emptyset\}. This note obtains various results to the effect that Id(P) is always,…

Rings and Algebras · Mathematics 2013-05-10 George M. Bergman

Motivated by generalizing Khovanov's categorification of the Jones polynomial, we study functors $F$ from thin posets $P$ to abelian categories $\mathcal{A}$. Such functors $F$ produce cohomology theories $H^*(P,\mathcal{A},F)$. We find…

Combinatorics · Mathematics 2019-12-09 Alex Chandler

The set of weights of a finite-dimensional representation of a reductive Lie algebra has a natural poset structure ("weight poset"). Studying certain combinatorial problems related to antichains in weight posets, we realised that the best…

Combinatorics · Mathematics 2017-10-17 Dmitri I. Panyushev

The aim of this short note is to develop a (co)homology theory for topological spaces together with the specialisation preorder. A known way to construct such a (co)homology is to define a partial order on the topological space starting…

Algebraic Topology · Mathematics 2020-04-23 Manuel Norman

We present generalization of the Bloom variety theorem of ordered algebras in fuzzy setting. We introduce algebras with fuzzy orders which consist of sets of functions which are compatible with particular binary fuzzy relations called fuzzy…

Logic · Mathematics 2017-01-11 Vilem Vychodil

Let $\mathfrak{P}_r$ be a representation system of the non-isomorphic finite posets, and let ${\cal H}(P,Q)$ be the set of order homomorphisms from $P$ to $Q$. For finite posets $R$ and $S$, we write $R \sqsubseteq_G S$ iff, for every $P…

Combinatorics · Mathematics 2019-08-20 Frank a Campo

In this paper, the class of all linearly ordered topological spaces (LOTS) quasi-ordered by the embeddability relation is investigated. In ZFC it is proved that for countable LOTS this quasi-order has both a maximal (universal) element and…

Logic · Mathematics 2011-02-11 Alex Primavesi , Katherine Thompson

Stanley introduced two classes of lattice polytopes associated to posets, which are called the order polytope ${\mathcal O}_P$ and the chain polytope ${\mathcal C}_P$ of a poset $P$. It is known that, given a poset $P$, the Ehrhart…

Combinatorics · Mathematics 2022-01-26 Hidefumi Ohsugi , Akiyoshi Tsuchiya

We study a class of polyhedra associated to marked posets. Examples of these polyhedra are Gelfand-Tsetlin polytopes and cones, as well as Berenstein-Zelevinsky polytopes, all of which have appeared in the representation theory of…

Combinatorics · Mathematics 2017-11-30 Christoph Pegel

Let $G$ be a semisimple algebraic group over an algebraically closed field $k$ of positive characteristic $p$. Under some restrictions on the size of $p$, the present paper establishes new results on the $G$-module structure of…

Representation Theory · Mathematics 2013-12-18 Brian J. Parshall , Leonard L. Scott

We establish that every second countable completely regularly preordered space (E,T,\leq) is quasi-pseudo-metrizable, in the sense that there is a quasi-pseudo-metric p on E for which the pseudo-metric p\veep^-1 induces T and the graph of…

General Topology · Mathematics 2012-11-21 E. Minguzzi

We extend the notion of chain algebra, originally defined in \cite{GN} for finite distributive lattices, to that of finite pure posets. We show this algebra corresponds to the Ehrhart ring of a (0,1)-polytope, termed the chain polytope, and…

Combinatorics · Mathematics 2025-05-21 Dancheng Lu
‹ Prev 1 4 5 6 7 8 10 Next ›