1 Ocak 2014 Dergi makalesi Açık Erişim

Sonmez, Orhan; Unlu, Yusuf

DataCite XML

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="URL">https://aperta.ulakbim.gov.tr/record/64253</identifier>
  <creators>
    <creator>
      <creatorName>Sonmez, Orhan</creatorName>
      <givenName>Orhan</givenName>
      <familyName>Sonmez</familyName>
      <affiliation>Meliksah Univ, Dept Math, TR-38280 Kayseri, Turkey</affiliation>
    </creator>
    <creator>
      <creatorName>Unlu, Yusuf</creatorName>
      <givenName>Yusuf</givenName>
      <familyName>Unlu</familyName>
      <affiliation>Yeditepe Univ, Dept Math, Istanbul, Turkey</affiliation>
    </creator>
  </creators>
  <titles>
    <title>M-Potent Elements In Order-Preserving Transformation Semigroups And Ordered Trees</title>
  </titles>
  <publisher>Aperta</publisher>
  <publicationYear>2014</publicationYear>
  <dates>
    <date dateType="Issued">2014-01-01</date>
  </dates>
  <resourceType resourceTypeGeneral="Text">Journal article</resourceType>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://aperta.ulakbim.gov.tr/record/64253</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.1080/00927872.2012.716115</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="http://www.opendefinition.org/licenses/cc-by">Creative Commons Attribution</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">Let ?(n, r), ?(n, r), and ?(n, r) be the semigroups of s-potent elements in ?(n), the semigroup of order-preserving mappings, such that Fix()={1}, |Fix()|=1, and Fix() is arbitrary, respectively. We give combinatorial results relating the cardinalities |?(n, r)|, |?(n, r)|, and |?(n, r)|. We construct a correspondence between ?(n, r) and T-n,T- r the ordered trees with depth at most r and n nodes. Using this we produce generating functions for |?(n, r)|, |?(n, r)|.</description>
  </descriptions>
</resource>