English
Related papers

Related papers: Consistent posets

200 papers

Paraorthomodular posets are bounded partially ordered set with an antitone involution induced by quantum structures arising from the logico-algebraic approach to quantum mechanics. The aim of the present work is starting a systematic…

Logic · Mathematics 2020-11-26 Ivan Chajda , Davide Fazio , Helmut Länger , Antonio Ledda , Jan Paseka

We prove that every not necessarily bounded poset P=(P,\le,') with an antitone involution can be extended to a residuated poset E(P)=(E(P),\le,\odot,\rightarrow,1) where x'=x\rightarrow0 for all x\in P. If P is a lattice with an antitone…

Rings and Algebras · Mathematics 2020-04-30 Ivan Chajda , Miroslav Kolařík , Helmut Länger

We define several sorts of mappings on a poset like monotone, strictly monotone, upper cone preserving and variants of these. Our aim is to characterize posets in which some of these mappings coincide. We define special mappings determined…

Combinatorics · Mathematics 2021-03-01 Ivan Chajda , Helmut Länger

As algebraic semantics of the logic of quantum mechanics there are usually used orthomodular posets, i.e. bounded posets with a complementation which is an antitone involution and where the join of orthogonal elements exists and the…

Rings and Algebras · Mathematics 2019-11-14 Ivan Chajda , Miroslav Kolařík , Helmut Länger

A Kleene lattice is a distributive lattice equipped with an antitone involution and satisfying the so-called normality condition. These lattices were introduced by J. A. Kalman. We extended this concept also for posets with an antitone…

Logic · Mathematics 2022-12-16 Ivan Chajda , Helmut Länger , Jan Paseka

In this paper we provide a preliminary investigation of subclasses of bounded posets with antitone involution which are "pastings" of their maximal Kleene sub-lattices. Specifically, we introduce super-paraorthomodular lattices, namely…

Logic · Mathematics 2023-11-13 Davide Fazio , Raffaele Mascella

The purpose of this paper is to study stable representations of partially ordered sets (posets) and compare it to the well known theory for quivers. In particular, we prove that every indecomposable representation of a poset of finite type…

Representation Theory · Mathematics 2019-02-27 Vyacheslav Futorny , Kostiantyn Iusenko

Given a symmetric monoidal category $C$ with product $\sqcup$, where the neutral element for the product is an initial object, we consider the poset of $\sqcup$-complemented subobjects of a given object $X$. When this poset has finite…

Combinatorics · Mathematics 2025-07-30 Kevin Ivan Piterman , Volkmar Welker

The concept of a sectionally pseudocomplemented lattice was introduced by I. Chajda as an extension of relative pseudocomplementation for not necessarily distributive lattices. The typical example of such a lattice is the non-modular…

Rings and Algebras · Mathematics 2019-05-24 Ivan Chajda , Helmut Länger , Jan Paseka

Given a functor from any category into the category of topological spaces, one obtains a linear representation of the category by post-composing the given functor with a homology functor with field coefficients. This construction is…

Representation Theory · Mathematics 2024-12-02 Riju Bindua , Thomas Brüstle , Luis Scoccola

The aim of the present paper is to extend the concept of a congruence from lattices to posets. We use an approach different from that used by the first author and V. Sn\'a\v{s}el. By using our definition we show that congruence classes are…

Combinatorics · Mathematics 2025-03-25 Ivan Chajda , Helmut Länger

The concept of a Kleene algebra (sometimes also called Kleene lattice) was already generalized by the first author for non-distributive lattices under the name pseudo-Kleene algebra. We extend these concepts to posets and show how…

Rings and Algebras · Mathematics 2020-06-09 Ivan Chajda , Helmut Länger

Defining P* to be the complete lattice of upsets (ordered by reverse inclusion) of a poset P we give necessary and sufficient conditions on a subset S of P* for P to admit a meet-completion e from P to Q where e preserves the infimum of an…

Rings and Algebras · Mathematics 2016-03-16 Robert Egrot

We introduce persistence with an emphasis on its algebraic foundations, using the representation theory of posets. Linear representations of posets arise in several areas of mathematics, including the representation theory of quivers and…

Algebraic Topology · Mathematics 2026-04-09 Ulrich Bauer , Thomas Brüstle , Luis Scoccola

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.…

Reiner, Tenner, and Yong recently introduced the coincidental down-degree expectations (CDE) property for finite posets and showed that many nice posets are CDE. In this paper we further explore the CDE property, resolving a number of…

Combinatorics · Mathematics 2019-12-24 Sam Hopkins

Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…

Combinatorics · Mathematics 2018-02-02 Emily J. Olson , Bruce E. Sagan

This paper first gives a necessary and sufficient condition that a lattice $L$ can be represented as the collection of all up-sets of a poset. Applying the condition, it obtains a necessary and sufficient condition that a lattice can be…

Representation Theory · Mathematics 2017-01-17 Peng He , Xue-ping Wang

For a certain class of finite posets, we prove that all their irreducible orthoscalar representations are finite-dimensional and describe those, for which there exist essential (non-degenerate) irreducible orthoscalar representations.

Representation Theory · Mathematics 2013-12-11 Vasyl Ostrovskyi , Slavik Rabanovich

It is known when we call a poset P, a $\mathcal{P}$-chain permutational poset, given a subset of permutations $\mathcal{P}$ of the symmetric group $S_{n}$. In this work, we use the same idea to study subsets of words of length $n$, that are…

Combinatorics · Mathematics 2025-12-16 Amrita Acharyya
‹ Prev 1 2 3 10 Next ›