Some array polynomials over special monoid presentations
Küçük Resim Yok
Tarih
2013
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
SPRINGER INTERNATIONAL PUBLISHING AG
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
In a recent joint paper (Cevik et al. in Hacet. J. Math. Stat., acceptted), the authors have investigated the p-Cockcroft property (or, equivalently, efficiency) for a presentation, say , of the semi-direct product of a free abelian monoid rank two by a finite cyclic monoid. Moreover, they have presented sufficient conditions on a special case for to be minimal whilst it is inefficient. In this paper, by considering these results, we first show that the presentations of the form can actually be represented by characteristic polynomials. After that, some connections between representative characteristic polynomials and generating functions in terms of array polynomials over the presentation will be pointed out. Through indicated connections, the existence of an equivalence among each generating function in itself is claimed studied in this paper. MSC: 11B68, 11S40, 12D10, 20M05, 20M50, 26C05, 26C10.
Açıklama
Anahtar Kelimeler
minimality, characteristic polynomials, array polynomials
Kaynak
FIXED POINT THEORY AND APPLICATIONS
WoS Q Değeri
Q1
Scopus Q Değeri
Q2
