This article is available for purchase or by subscription. See below.
Abstract
|
Let
be a sequence
of
pairwise coprime
positive integers,
,
and
be a sequence
of
different
colors. Let
be an
matrix of colors in
which row
consists
of blocks of
consecutive entries of the same color with colors 0 through
repeated
cyclically. The monochromatic column problem is to determine the number of columns of
in
which every entry is the same color. The solution for a prime number of colors is
provided.
|
PDF Access Denied
We have not been able to recognize your IP address
3.238.180.174
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for
USD 30.00:
Keywords
monochromatic column problem, Chinese remainder theorem,
multiple sequence alignment problem
|
Mathematical Subject Classification 2010
Primary: 05A15, 11A07
|
Milestones
Received: 5 July 2019
Revised: 6 August 2019
Accepted: 12 August 2019
Published: 25 October 2019
Communicated by Kenneth S. Berenhaut
|
|