English
Related papers

Related papers: On implications in sectionally pseudocomplemented …

200 papers

Every reduced ring $R$ has a natural partial order defined by $a\le b$ if $a^2=ab$; it generalizes the natural order on a boolean ring. The article examines when $R$ is a lower semi-lattice in this order with examples drawn from weakly Baer…

Rings and Algebras · Mathematics 2018-02-21 W. D. Burgess , R. Raphael

The proper parts of face lattices of convex polytopes are shown to satisfy a strong form of the Cohen--Macaulay property, namely that removing from their Hasse diagram all edges in any closed interval results in a Cohen--Macaulay poset of…

Combinatorics · Mathematics 2015-11-11 Christos A. Athanasiadis , Myrto Kallipoliti

We prove a Fundamental Theorem of Finite Semidistributive Lattices (FTFSDL), modelled on Birkhoff's Fundamental Theorem of Finite Distributive Lattices. Our FTFSDL is of the form "A poset L is a finite semidistributive lattice if and only…

Combinatorics · Mathematics 2026-05-13 Nathan Reading , David E Speyer , Hugh Thomas

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

We investigate the partial orderings of the form (P(X),\subset), where X is a relational structure and P(X) the set of the domains of its isomorphic substructures. A rough classification of countable binary structures corresponding to the…

Logic · Mathematics 2017-09-26 Milos S. Kurilic

For any graded poset $P$, we define a new graded poset, $\mathcal E(P)$, whose elements are the edges in the Hasse diagram of P. For any group, $G$, acting on the boolean algebra, $B_n$, we conjecture that $\mathcal E(B_n/G)$ is Peck. We…

Combinatorics · Mathematics 2017-12-12 David Hemminger , Aaron Landesman , Zijian Yao

This paper studies topological properties of the lattices of non-crossing partitions of types A and B and of the poset of injective words. Specifically, it is shown that after the removal of the bottom and top elements (if existent) these…

Combinatorics · Mathematics 2011-04-13 Myrto Kallipoliti , Martina Kubitzke

A partial monoid $P$ is a set with a partial multiplication $\times$ (and total identity $1_P$) which satisfies some associativity axiom. The partial monoid $P$ may be embedded in a free monoid $P^*$ and the product $\star$ is simulated by…

Discrete Mathematics · Computer Science 2010-09-30 Laurent Poinsot , Gérard Duchamp , Christophe Tollu

We analyse various structural and order-theoretical aspects of abstract separation systems and partial lattices, as well as the relationship between the different submodularity conditions one can impose on them.

Combinatorics · Mathematics 2025-05-20 Christian Elbracht , Jay Lilian Kneip , Maximilian Teegen

We show that every complemented modular lattice can be converted into a left residuated lattice where the binary operations of multiplication and residuum are term operations. The concept of an operator left residuated poset was introduced…

Logic · Mathematics 2018-12-27 Ivan Chajda , Helmut Länger

We elaborate on the notion of a filtration of an operad defined in terms of a lattice-valued operad serving as an indexing object. That covers ordinary integer-indexed filtrations of associative algebras and operads as a special case, yet…

Rings and Algebras · Mathematics 2024-11-01 Denis Bashkirov

We characterize well-founded algebraic lattices by means of forbidden subsemilattices of the join-semilattice made of their compact elements. More specifically, we show that an algebraic lattice $L$ is well-founded if and only if $K(L)$,…

Combinatorics · Mathematics 2008-12-15 Ilham Chakir , Maurice Pouzet

We investigate some modal operators of necessity and possibility in the context of meet-complemented (not necessarily distributive) lattices. We proceed in stages. We compare our operators with others.

Logic · Mathematics 2016-03-09 José Luis Castiglioni , Rodolfo C. Ertola-Biraben

A classical tensor product $A \,\otimes\, B$ of complete lattices $A$ and $B$, consisting of all down-sets in $A \times B$ that are join-closed in either coordinate, is isomorphic to the complete lattice $Gal(A,B)$ of Galois maps from $A$…

Category Theory · Mathematics 2016-12-20 Marcel Erné , Jorge Picado

We define analogues of Boolean operations on not necessarily complete partial orders, they often have as results sets of elements rather than single elements. It proves useful to add to such sets X if they are intended to be sup(X) or…

Logic in Computer Science · Computer Science 2018-10-10 Karl Schlechta

In this paper we extend our previous results on sets of graded attribute implications with witnessed non-redundancy. We assume finite residuated lattices as structures of truth degrees and use arbitrary idempotent truth-stressing linguistic…

Artificial Intelligence · Computer Science 2016-06-22 Vilem Vychodil

In this paper, we extend some classes of structured matrices to higher order tensors. We discuss their relationships with positive semi-definite tensors and some other structured tensors. We show that every principal sub-tensor of such a…

Spectral Theory · Mathematics 2014-06-24 Yisheng Song , Liqun Qi

We continue our work on implicative assemblies by investigating under which circumstances a subset $M \subseteq \mathscr{S}$ gives rise to a lex full subcategory $\mathbf{Asm}_M$ of the quasitopos $\mathbf{Asm}_{\mathcal{A}}$ of all…

Category Theory · Mathematics 2023-07-11 Alexandre Miquel , Krzysztof Worytkiewicz

For each composition $\vec{c}$ we show that the order complex of the poset of pointed set partitions $\Pi^{\bullet}_{\vec{c}}$ is a wedge of spheres of the same dimension with the multiplicity given by the number of permutations with…

Combinatorics · Mathematics 2013-12-10 Richard Ehrenborg , JiYoon Jung

We investigate the representation of lattices as sublattices of the lattice of all convex subsets (intervals) of a linearly ordered set $(X,\le)$. We introduce the purely lattice-theoretic notion of a \textit{loc-lattice} and prove that…

General Mathematics · Mathematics 2026-03-23 P. Douka , V. Felouzis