﻿<?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>2017-11-03</publicationDate>
    <volume>5</volume>
    <issue>6</issue>
    <startPage>210</startPage>
    <endPage>225</endPage>
    <doi>10.12691/tjant-5-6-3</doi>
    <publisherRecordId>TJANT2017563</publisherRecordId>
    <documentType>article</documentType>
    <title language="eng">Enumeration of 2-Wilf Classes of Four 4-letter Patterns</title>
    <authors>
      <author>
        <name>David Callan</name>
        <affiliationId>1</affiliationId>
      </author>
      <author>
        <name>Toufik Mansour</name>
        <email>tmansour@univ.haifa.ac.il</email>
        <affiliationId>2</affiliationId>
      </author>
    </authors>
    <affiliationsList>
      <affiliationName affiliationId="1">Department of Statistics, University of Wisconsin, Madison, WI</affiliationName>
      <affiliationName affiliationId="2">Department of Mathematics, University of Haifa, Haifa, Israel</affiliationName>
    </affiliationsList>
    <abstract language="eng">Let Sn be the symmetric group of all permutations of n letters. We show that there are precisely 64 Wilf classes consisting of exactly 2 symmetry classes of subsets of four 4-letter patterns.</abstract>
    <fullTextUrl format="pdf">http://pubs.sciepub.com/tjant/5/6/3/tjant-5-6-3.pdf</fullTextUrl>
    <keywords language="eng">
      <keyword>pattern avoidance</keyword>
      <keyword>Wilf-equivalence</keyword>
    </keywords>
  </record>
</records>