Sciweavers

95 search results - page 4 / 19
» Combinatorics on words
Sort
View
COMBINATORICS
2004
61views more  COMBINATORICS 2004»
13 years 8 months ago
Improved Bounds on the Length of Maximal Abelian Square-free Words
A word is abelian square-free if it does not contain two adjacent subwords which are permutations of each other. Over an alphabet k on k letters, an abelian squarefree word is max...
Evan M. Bullock
JCB
2006
126views more  JCB 2006»
13 years 8 months ago
Combinatorics of Saturated Secondary Structures of RNA
Following Zuker (1986), a saturated secondary structure for a given RNA sequence is a secondary structure such that no base pair can be added without violating the definition of s...
P. Clote
COMBINATORICS
2006
135views more  COMBINATORICS 2006»
13 years 8 months ago
Lyndon Words and Transition Matrices between Elementary, Homogeneous and Monomial Symmetric Functions
Let h, e, and m denote the homogeneous symmetric function, the elementary symmetric function and the monomial symmetric function associated with the partition respectively. We gi...
Andrius Kulikauskas, Jeffrey B. Remmel
COMBINATORICS
2000
78views more  COMBINATORICS 2000»
13 years 8 months ago
Two New Extensions of the Hales-Jewett Theorem
: We prove two extensions of the Hales-Jewett coloring theorem. The first is a polynomial version of a finitary case of Furstenberg and Katznelson's multiparameter elaboration...
Randall McCutcheon
COMBINATORICS
2000
91views more  COMBINATORICS 2000»
13 years 8 months ago
A Construction Method for Complete Sets of Mutually Orthogonal Frequency Squares
A construction is described for combining affine designs with complete sets of mutually orthogonal frequency squares to produce other complete sets. Key words: Matrices, orthogona...
Vassili C. Mavron