Some array polynomials over special monoid presentations
dc.contributor.author | Çevik, Ahmet Sinan | |
dc.contributor.author | Das, Kinkar Chandra | |
dc.contributor.author | Şimşek, Yılmaz | |
dc.contributor.buuauthor | Cangül, İsmail Naci | |
dc.contributor.department | Uludağ Üniversitesi/Fen-Edebiyat Fakültesi/Matematik Anabilim Dalı. | tr_TR |
dc.contributor.orcid | 0000-0002-0700-5774 | tr_TR |
dc.contributor.orcid | 0000-0002-0700-5774 | tr_TR |
dc.contributor.researcherid | J-3505-2017 | tr_TR |
dc.contributor.researcherid | ABA-6206-2020 | tr_TR |
dc.contributor.scopusid | 57189022403 | tr_TR |
dc.date.accessioned | 2023-06-23T07:49:20Z | |
dc.date.available | 2023-06-23T07:49:20Z | |
dc.date.issued | 2013-02 | |
dc.description.abstract | 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. | en_US |
dc.description.sponsorship | Selçuk Üniversitesi (13701071) | tr_TR |
dc.description.sponsorship | Akdeniz Üniversitesi | tr_TR |
dc.description.sponsorship | Sungkyunkwan University BK21 Project, BK21 Math Modeling HRD Div. Sungkyunkwan University, Suwon, Republic of Korea | en_US |
dc.identifier.citation | Çevik, A. S. vd. (2013). “Some array polynomials over special monoid presentations”. Fixed Point Theory and Applications, 2013. | en_US |
dc.identifier.issn | 1687-1812 | |
dc.identifier.issn | https://fixedpointtheoryandalgorithms.springeropen.com/articles/10.1186/1687-1812-2013-44 | |
dc.identifier.scopus | 2-s2.0-84902581400 | tr_TR |
dc.identifier.uri | https://doi.org/10.1186/1687-1812-2013-44 | |
dc.identifier.uri | http://hdl.handle.net/11452/33139 | |
dc.identifier.volume | 2013 | tr_TR |
dc.identifier.wos | 000318786200001 | tr_TR |
dc.indexed.scopus | Scopus | en_US |
dc.indexed.wos | SCIE | en_US |
dc.language.iso | en | en_US |
dc.publisher | Springer | en_US |
dc.relation.bap | 2012-15 | tr_TR |
dc.relation.bap | 2012-19 | tr_TR |
dc.relation.collaboration | Yurt dışı | tr_TR |
dc.relation.collaboration | Yurt içi | en_US |
dc.relation.journal | Fixed Point Theory and Applications | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi | tr_TR |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Minimality | en_US |
dc.subject | Characteristic polynomials | en_US |
dc.subject | Array polynomials | en_US |
dc.subject | P-cockcroft property | en_US |
dc.subject | Semidirect products | en_US |
dc.subject | Extensions | en_US |
dc.subject | Bernoulli | en_US |
dc.subject | Theorem | en_US |
dc.subject | Euler | en_US |
dc.subject | Mathematics | en_US |
dc.subject.scopus | Euler Polynomials; Bernoulli Numbers; Degenerate | en_US |
dc.subject.wos | Mathematics, applied | en_US |
dc.subject.wos | Mathematics | en_US |
dc.title | Some array polynomials over special monoid presentations | en_US |
dc.type | Article | |
dc.wos.quartile | Q4 | en_US |