Quasi-semilattices on networks

TL;DR

This paper develops a tensor-based algebraic framework for networks, introducing network quasi-semilattices and analyzing their subalgebra structures, with applications to path algebras and graph theory.

Contribution

It introduces the concept of network quasi-semilattices using tensor chains and explores their algebraic properties and substructures.

Findings

Connected subnetworks form a quasi-semilattice under reducing.

Each delta-class forms a semilattice with order structure.

Spanning trees correspond to minimum elements in the order.

Abstract

This paper introduces the tensor representation of a network, here tensors are the primitive structures of the network. In view of tensor chains, two binary operations on tensor sets are defined: chain addition and reducing. Based on the reducing operation, the tensor chain representation of subnetworks of a network is given, and it is proved that all connected subnetworks of a network (here refers to the tensor chain generated by primitive structures) form a quasi-semilattice with respect to reducing, namely {\it network quasi-semilattices}. Here, quasi-semilattices refer to algebraic systems that are idempotent commutative and do not satisfy the association law. Then, we discuss the subalgebra structures of the network quasi-semilattice in terms of two equivalent relations $\sigma$ and $\delta$. $\delta$ is a congruence. Each $\delta$-class forms a semilattice with respect to reducing, that is, an idempotent commutative semigroup, and also each $\delta$-class has an order structure with the maximum element and minimum elements. Here, the minimum elements correspond to the spanning tree in graph theory. Finally, we discuss how three path algebras: graph inverse semigroups, Leavitt path algebra and Cuntz-Krieger graph $C^*$-algebra are constructed in terms of tensors with respect to chain-addition.