Developed and Presented by: OCdt Joseph Luc-Andr

Sabourin

Describe an ordered sequence of 2 types of

objects of equal number.
At any given point in the sequence, the
number of the first type is greater than or
equal to the number of the second.
1
2
2
2
=

=
0
+1

+1

Brackets
(a)
(a(a)a),(a)a(a)
(a(a(a)a)a),(a(a)a(a)a),(a)a(a(a)a),(a)a(a)a(a),
(a(a)a)a(a)

Binary Trees

Polygon Triangles

Dyck Paths

1.

2.

Start with matrix notation:

1 3 2 3 2 1
2 4 2 2
2
Switch from the bottom to the top and to
the right:

3.

For multiple switches, start from the right and move left.
Additional switches can only switch with values to the left
of what has already been switched and to the right of itself
(i.e. switch lines cant cross):

4.

5.

Order each row in ascending order from left

to right:

Each column will increase down, and each

row will increase to the right:

1.
2.
3.

Proving The Axioms

Proving Uniqueness
Proving All Catalan Sequences Are
Generated

1.
2.

3.

Simple for to start from, however any

Catalan Sequence can be used to start from.
Moves a later primary object to an earlier
position and an earlier secondary object to a
later position.
Prevents repetitions.

4.

5.

Any secondary object that is switched will

be to the right after ordering and any
primary object will be to the left after
ordering, respective to their original
positions.

Confirmation it is a Catalan Sequence.

Suppose p switches, but each set is different

by one switch.
After conducting the switches and orders, the
element not switched in one will differ from
the other.

Therefore each combination of switches

produces a different Catalan Sequence than
any other one.

zero switches: 1
1 3
=2
zero switches: 1, one switch: 1
2 4
1 3 5
=3
zero switches: 1, one switch: 3,
2 4 6
two switches: 1
1 3 5 7
=4
zero switches: 1, one switch: 6,
2 4 6 8
two switches: 6, three switches: 1
1 3 5 7 9
=5
zero switches: 1, one switch: 10,
2 4 6 8 10
two switches: 20, three switches: 10, four switches: 1
=1

Let , be the number of sequences produced, where n is the

order and w is the number of switches.

n/w

,
=

10

20

10

15

50

50

15

21

105

175

105

21

14

14

42

42

132

132

429

429

Patterns:
1. , = , +1
1
2. =
=0 ,
Relationships:
1. ,0 = 1

2.

,1 =

3.

,2 =

1
2
1 2 2
12

1
Suppose: , = +1
Check Patterns:
1

1.

, = +1

2.

1
=0 ,

1
1 > 0

1
1
1
= + 1
= , +1
( + 1)

1
1
1
1 1
1
=

=0 +1
=0 + 1
+1

2
1
2 1
2 1
2 1
2

=
=
=
+1
1

+1
+1

1
Therefore both patterns are satisfied, , = +1

the switches produce all Catalan Sequences.

1
is true, and

There are 3 recursive relationships (since

there are two variables):

1.

, = 1,

2.

, = ,1

3.

, =

1
+1

2 > 0

+1
2 >
+1
1
1,1 +1 2 > 1