## Search

Now showing items 1-10 of 40

#### Counting endomorphisms of crown-like orders

(Springer, 2002-12)

The authors introduce the notion of crown-like orders and introduce powerful tools for counting the endomorphisms of orders of this type.

#### Binary Words Avoiding xxRx and Strongly Unimodal Sequences

(2015-09-14)

In previous work, Currie and Rampersad showed that the growth of the number
of binary words avoiding the pattern xxxR was intermediate between polynomial and
exponential. We now show that the same result holds for the ...

#### The metric dimension and metric independence of a graph

(The Charles Babbage Research Centre, 2001)

A vertex x of a graph G resolves two vertices u and v of G if the
distance from x to u does not equal the distance from x to v. A set
S of vertices of G is a resolving set for G if every two distinct vertices
of G are ...

#### Square-free Words with Square-free Self-shuffles

(The Electronic Journal of Combinatorics, 2014-01-12)

We answer a question of Harju: For every n ≥ 3 there is a square-free ternary word of length n with a square-free self-shuffle.

#### Avoiding Patterns in the Abelian Sense

(Canadian Mathematical Society, 2001-08)

We classify all 3 letter patterns that are avoidable in the abelian sense. A short list of four letter patterns for which abelian avoidance is undecided is given. Using a generalization of Zimin words we deduce some ...

#### Abelian complexity of fixed point of morphism 0 ↦ 012, 1 ↦ 02, 2 ↦ 1

(Integers, 2014-02-20)

We study the combinatorics of vtm, a variant of the Thue-Morse word generated by the non-uniform morphism 0 ↦ 012, 1 ↦ 02, 2 ↦ 1 starting with 0. This infinite ternary sequence appears a lot in the literature and finds ...

#### The Brachistochrone Problem: Mathematics for a Broad Audience via a Large Context Problem

(Montana Council of Teachers of Mathematics & Information Age Publishing, 2008)

Large context problems (LCP) are useful in teaching the history of science. In this article we consider the brachistochrone problem in a context stretching from Euclid through the Bernoullis. We highlight a variety of ...

#### Extremal words in morphic subshifts

(Elsevier, 2014-01-22)

Given an infinite word x over an alphabet A, a letter b occurring in
x, and a total order \sigma on A, we call the smallest word with respect to \sigma
starting with b in the shift orbit closure of x an extremal word of ...

#### Attainable lengths for circular binary words avoiding k-powers

(The Belgian Mathematical Society, 2005)

We show that binary circular words of length n avoiding 7/3+ powers exist
for every sufficiently large n. This is not the case for binary circular words
avoiding k+ powers with k < 7/3

#### Growth rate of binary words avoiding xxxR

(Elsevier, 2016-01)

Abstract
Consider the set of those binary words with no non-empty factors of the form
xxx^R. Du, Mousavi, Schaeffer, and Shallit asked whether this set of words grows
polynomially or exponentially with length. In this ...