The skew growth functions NM, deg(t) for the monoid of type Bii and others

Abstract

Let M be a positive homogeneously presented cancellative monoid < L R >mo equipped with the degree map :M 0 defined by assigning to each equivalence class of words the length of the words, and let PM, (t):= Σu ∈\ Mt(u) be its generating series, called the growth function. If M satisfies the condition that any subset J of I0 (:= the image of the set L in M) admits either the least right common multiple J or no common multiple in M, then the inversion function PM, (t)-1 is given by the polynomial ΣJ ⊂ I0(-1)#J t(J), where the summation index J runs over all subsets of I0 whose least right common multiple exists. Since a monoid M generally may not admit the least right common multiple J for a given subset J of it, if we attempt to generalize the formula, the consideration to obtain the above formula is invalid. To resolve this obstruction, we will examine the set mcm(J) of minimal common right multiples of J. Then, we need to introduce a concept of a tower of minimal common multiples of elements of M and denote the set of all the towers in M by Tmcm(M). Considering the structure of the set Tmcm(M), K. Saito has proved the inversion formula \[ PM,(t). NM,(t)=1, \] where the second factor in LHS is a suitably signed generating series \[ NM,(t):= 1 + ΣT∈ Tmcm(M)(-1)#J1+...+#Jn-n+1Σ∈ mcm(Jn) t(), \] called the skew growth function. In this article, we present several explicit calculations of examples of the skew growth functions for the monoid of type Bii and others whose towers do not stop on the first stage J1.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…