Finite Atomized Semilattices

02/16/2021
by   Fernando Martin-Maroto, et al.
0

We show that every finite semilattice can be represented as an atomized semilattice, an algebraic structure with additional elements (atoms) that extend the semilattice's partial order. Each atom maps to one subdirectly irreducible component, and the set of atoms forms a hypergraph that fully defines the semilattice. An atomization always exists and is unique up to "redundant atoms". Atomized semilattices are representations that can be used as computational tools for building semilattice models from sentences, as well as building its subalgebras and products. Atomized semilattices can be applied to machine learning and to the study of semantic embeddings into algebras with idempotent operators.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/25/2022

Semantic Embeddings in Semilattices

To represent anything from mathematical concepts to real-world objects, ...
research
05/06/2019

Incorporating Weisfeiler-Leman into algorithms for group isomorphism

In this paper we combine many of the standard and more recent algebraic ...
research
06/10/2019

Big Ramsey degrees of 3-uniform hypergraphs

Given a countably infinite hypergraph R and a finite hypergraph A, the...
research
06/22/2019

Learning with fuzzy hypergraphs: a topical approach to query-oriented text summarization

Existing graph-based methods for extractive document summarization repre...
research
08/14/2020

Partial Orders, Residuation, and First-Order Linear Logic

We will investigate proof-theoretic and linguistic aspects of first-orde...
research
12/28/2022

Hypergraphs with Polynomial Representation: Introducing r-splits

Inspired by the split decomposition of graphs and rank-width, we introdu...

Please sign up or login with your details

Forgot password? Click here to reset