Routes enumeration in a Boolean with respect to intersection and nonintersection relations
type: Item
instance of: scholarly article
title: Routes enumeration in a Boolean with respect to intersection and nonintersection relations
zbMATH Open document ID: 0911.05003
author: E. E. Marenich
published in: Moscow University Mathematics Bulletin
publication date: 1999-03-15T00:00:00Z
review text: The author introduces the definition of a reduced algebra of binary functions, where a binary function is a function \(f:L^2\to F\) with \(L\) a finite set and \(F\) a field. Let \(\Delta\) be an equivalence relation on \(L^2\). A binary function is called a \(\Delta\)-function, if \(f(a,b) = f(c,d)\) for any \((a,b)\Delta(c,d)\). Some applications to the enumeration of routes with respect to the intersection relation and the non-intersection relation are given.
Mathematics Subject Classification ID: 05A15
zbMATH DE Number: 1261620
zbMATH Keywords: reduced algebra of binary functions
MaRDI profile type: MaRDI publication profile
Recommended article: Route systems and bipartite graphs
Recommended article: Routing sets in the integer lattice
Recommended article: Enumerating triangulation paths
Recommended article: Intersection graphs of non-crossing paths
Recommended article: Q3513959
Recommended article: On devising Boolean Routing Schemes
Recommended article: Intersection problems in the Boolean lattice
Recommended article: Relational characterisations of paths
Recommended article: Path intersection matrices and applications to networks
description: scientific article; zbMATH DE number 1261620