Skip navigation


  • DSpace logo
  • Home
  • Collections
  • Researcher Profile
  • Explore by
    • Researcher Profile
  • VGU library
  • Help
  • User Guide
  • Sign on to:
    • My DSpace
    • Receive email
      updates
    • Edit Account details

VGU RESEARCH REPOSITORY


Please use this identifier to cite or link to this item: https://epub.vgu.edu.vn/handle/dlibvgu/962
Title: Combinatorial enumerations on restricted growth function avoiding patterns
Authors: Nguyen Le Thien Ha 
Keywords: Restricted growth functions;Vincular patterns;Binary sequences
Issue Date: 2019
Publisher: Vietnamese-German University
Abstract: 
In this thesis, we enumerate and show closed formulas for the number of restricted growth functions which avoid a set of vincular patterns and multiple patterns. In specific, we try to enumerate on every cases for the vincular pattern of length 2, 3 and 4; however, a minority of that leads to an interesting result. These patterns are: 21, 121, 121, 1212, 1221, and (1212,213), (1221,213). More precisely, with these patterns, we revisit classical sequences, such as the Bell numbers, binary sequences and other interesting sequences in Sloane. To do that, we mainly use ECO method to construct generating trees, form succession rules and find the generating functions
URI(1): http://epub.vgu.edu.vn/handle/dlibvgu/962
Rights: Attribution-NonCommercial 4.0 International
Appears in Collections:Computer Science (CS)

Files in This Item:
File Description SizeFormat Existing users please Login
Combinatorial enumerations on restricted growth function avoiding patterns.pdf1.13 MBAdobe PDF
Show full item record

Page view(s)

136
checked on Aug 23, 2025

Download(s)

41
checked on Aug 23, 2025

Google ScholarTM

Check


This item is licensed under a Creative Commons License Creative Commons

© Copyright 2020 by Vietnamese - German University Library.
Add: Ring road 4, Quarter 4, Thoi Hoa Ward, Ben Cat City, Binh Duong Province
Tel.:(0274) 222 0990. Ext.: 70206