Enumerative properties of restricted words and compositions release_4eruabslejfx5bjkzqbap63iei

by Andrew MacFie

Released as a article .

2019  

Abstract

In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count cyclically restricted and circular objects. This either fills gaps in the current literature by e.g. considering particular new patterns, or involves general progress, notably with locally restricted compositions over a finite group. We associate these compositions to walks on a covering graph whose structure is exploited to simplify asymptotic expressions. Specifically, we show that under certain conditions the number of locally restricted compositions of a group element is asymptotically independent of the group element. For some problems our results extend to the case of a positive number of subword pattern occurrences (instead of zero for pattern avoidance) or convergence in distribution of the normalized number of occurrences. We typically apply the more general propositions to concrete examples such as the familiar Carlitz compositions or simple subword patterns.
In text/plain format

Archived Files and Locations

application/pdf  938.4 kB
file_mik3vcoyebfvffzfaaurn5jvqu
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2019-04-17
Version   v3
Language   en ?
arXiv  1811.10461v3
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: b3e6c62e-c380-4147-8ae7-5a28171d0757
API URL: JSON