L. A. Bokut gave a Gröbner-Shirshov basis of the braid group Bn in band generators. Using this presentation and solving all the ambiguities we construct a linear system for irreducible words and compute the Hilbert series of the braid monoid M B4 .
In this paper, we prove that a subset of the non-commutative Gröbner basis for the braid group given by Bokut is a basis for the braid monoid in band generators. We give an inductive way of computing the infimum of a positive braid and hence a criteria to decide whether a positive word is prime to the fundamental braid or not. We also compute the Hilbert series of the braid monoid with three generators.
Deligne proved that the Hilbert series of all Artin monoids are rational functions. We give an algorithm to compute the Hilbert series of the braid monoids MBn+1. We also show that the Hilbert series of the positive words in MBn+1 with a given prefix are rational functions.
The concept of minimal resolving partition and resolving set plays a pivotal role in diverse areas such as robot navigation, networking, optimization, mastermind games and coin weighing. It is hard to compute exact values of partition dimension for a graphic metric space, (G, dG) and networks. In this article, we give the sharp upper bounds and lower bounds for the partition dimension of generalized Möbius ladders, Mm, n, for all n≥3 and m≥2.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.