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

Sonmez, Orhan; Unlu, Yusuf

Dublin Core

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Sonmez, Orhan</dc:creator>
  <dc:creator>Unlu, Yusuf</dc:creator>
  <dc:date>2014-01-01</dc:date>
  <dc:description>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)|.</dc:description>
  <dc:identifier>https://aperta.ulakbim.gov.trrecord/64253</dc:identifier>
  <dc:identifier>oai:zenodo.org:64253</dc:identifier>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>http://www.opendefinition.org/licenses/cc-by</dc:rights>
  <dc:source>COMMUNICATIONS IN ALGEBRA 42(1) 332-342</dc:source>
  <dc:title>m-POTENT ELEMENTS IN ORDER-PRESERVING TRANSFORMATION SEMIGROUPS AND ORDERED TREES</dc:title>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:type>publication-article</dc:type>
</oai_dc:dc>