Preferential Arrangement Containment in Strict Superpatterns
Most results on pattern containment deal more directly with pattern avoidance, or the enumeration and characterization of strings which avoid a given set of patterns. Little research has been conducted regarding the word size required for a word to contain all patterns of a given set of patterns. Th...
Main Author: | Liendo, Martha Louise |
---|---|
Format: | Others |
Published: |
Digital Commons @ East Tennessee State University
2012
|
Subjects: | |
Online Access: | https://dc.etsu.edu/etd/1428 https://dc.etsu.edu/cgi/viewcontent.cgi?article=2621&context=etd |
Similar Items
-
Delannoy Numbers and Preferential Arrangements
by: Kwang-Wu Chen
Published: (2019-03-01) -
Zero Sets in Graphs.
by: Scott, Hamilton
Published: (2010) -
Omnisculptures.
by: Eroglu, Cihan
Published: (2011) -
Fibonomial Tilings and Other Up-Down Tilings
by: Bennett, Robert
Published: (2016) -
Vertex-Relaxed Graceful Labelings of Graphs and Congruences
by: Aftene, Florin
Published: (2018)