﻿<?xml version="1.0" encoding="UTF-8"?>
<records>
  <record>
    <language>eng</language>
    <publisher>Science and Education Publishing</publisher>
    <journalTitle>Turkish Journal of Analysis and Number Theory</journalTitle>
    <eissn>2333-1232</eissn>
    <publicationDate>2019-07-24</publicationDate>
    <volume>7</volume>
    <issue>4</issue>
    <startPage>98</startPage>
    <endPage>112</endPage>
    <doi>10.12691/tjant-7-4-2</doi>
    <publisherRecordId>TJANT2019742</publisherRecordId>
    <documentType>article</documentType>
    <title language="eng">Counting Water Cells in Pattern Restricted Compositions</title>
    <authors>
      <author>
        <name>Toufik Mansour</name>
        <email>tmansour@univ.haifa.ac.il</email>
        <affiliationId>1</affiliationId>
      </author>
      <author>
        <name>Mark Shattuck</name>
        <affiliationId>2</affiliationId>
      </author>
    </authors>
    <affiliationsList>
      <affiliationName affiliationId="1">Department of Mathematics, University of Haifa, 3498838 Haifa, Israel</affiliationName>
      <affiliationName affiliationId="2">Department of Mathematics, University of Tennessee, 37996 Knoxville, TN, USA</affiliationName>
    </affiliationsList>
    <abstract language="eng">In this paper, we consider statistics on compositions of a positive integer represented geometrically as bargraphs that avoid certain classes of consecutive patterns. A unit square exterior to a bargraph that lies along a horizontal line between any two squares contained within its subtended area is called a water cell since it is a place where a liquid would collect if poured along the top part of the bargraph from above. The total number of water cells in the bargraph representation of a k-ary word then gives what is referred to as the capacity of w. Here, we determine the distribution of the capacity statistic on certain pattern-restricted compositions, regarded as k-ary words. Several general classes of patterns are considered, including  and  where a is arbitrary. As a consequence of our results, we obtain all of the distinct distributions for the capacity statistic on avoidance classes of compositions corresponding to 3-letter patterns having at most two distinct letters. Finally, in the case of  some further enumerative results are given when a=2, including algebraic and bijective proofs for the total capacity of all Carlitz partitions of a given size having a fixed number of blocks.</abstract>
    <fullTextUrl format="pdf">http://pubs.sciepub.com/tjant/7/4/2/tjant-7-4-2.pdf</fullTextUrl>
    <keywords language="eng">
      <keyword>consecutive pattern</keyword>
      <keyword>combinatorial statistic</keyword>
      <keyword>pattern-avoiding composition</keyword>
      <keyword>Carlitz composition</keyword>
    </keywords>
  </record>
</records>