2000
DOI: 10.1016/s0304-3975(98)00182-0
|View full text |Cite
|
Sign up to set email alerts
|

Fibonacci arrays and their two-dimensional repetitions

Abstract: Notions related to repetitive substructures in two-dimensional arrays are introduced and studied in an attempt to parallel some of the analogous developments already known for strings. In particular, sequences of “Fibonacci arrays” are defined, capable of exhibiting extremal properties in terms of certain repetitive subpatterns called “tandems”. Two types of tandems are considered. For one type, it is shown that the number of occurrences in an m×n Fibonacci array attains the general upper bound of O(m^2nlogn)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
29
0

Year Published

2001
2001
2024
2024

Publication Types

Select...
5
3

Relationship

2
6

Authors

Journals

citations
Cited by 22 publications
(30 citation statements)
references
References 11 publications
1
29
0
Order By: Relevance
“…In a recent work [5], a two-dimensional repetition called a tandem is defined as a configuration consisting of two occurrences of the same (primitive) block that touch each other with one side or corner. Being primitive for a block means that it cannot be expressed itself by repetitive placement of another block.…”
Section: Introductionmentioning
confidence: 99%
“…In a recent work [5], a two-dimensional repetition called a tandem is defined as a configuration consisting of two occurrences of the same (primitive) block that touch each other with one side or corner. Being primitive for a block means that it cannot be expressed itself by repetitive placement of another block.…”
Section: Introductionmentioning
confidence: 99%
“…In one-dimension, a square is a string which consists of precisely two consecutive occurrences of a substring. Apostolico and Brimkov [3] extend the notion of a square to two dimensions, to form a 2D tandem. They define a 2D tandem as a configuration consisting of two occurrences of the same primitive block that share a side or a corner.…”
Section: Related Workmentioning
confidence: 99%
“…non-overlapping replicas of some block W [3]. Apostolico and Brimkov prove combinatorially that an n × n matrix can contain Θ(n 4 ) corner-sharing tandems and Θ(n 3 log n) side-sharing tandems [3].…”
Section: :3mentioning
confidence: 99%
See 1 more Smart Citation
“…An n × n array can contain Θ(n 3 log Φ n) tandems of type (a) and Θ(n 4 ) tandems of Type (b), where Φ is the golden ratio. 5 For more details about tandems the reader is referred to Refs. 5 and 6.…”
Section: Definitionmentioning
confidence: 99%