Proofing Catalan Numbers: A Combinatoric Approach

  • Thread starter Thread starter msmith12
  • Start date Start date
  • Tags Tags
    Approach Numbers
msmith12
Messages
41
Reaction score
0
I'm working on a problem that has to do with catalan numbers, and I'm just trying to figure out how to make a proof that shows what I am dealing with does in fact have to do with catalan numbers.

I know this is very general, but I don't want someone to do my problem for me, I just want to know how to do a combinatoric proof of anything that has to do with these numbers...

any help would be greatly appreciated

~matt
 
Physics news on Phys.org
One way if you can "whatever" in your problem with the actual catalan number expression (1/n+1)C(2n,n) or if it has to do anything with the generating function of the catalan number.

Another way could be to reduce "whatever" in your problem to the known problems which have to do something with catalan number. (e.g number of binary trees of n nodes is a catalan number or the euler polygon problem or ballot problem)

-- AI
 
I worked on the problem again, and tried to find a relationship between the formula C(n)=C(0)C(n-1)+C(1)C(n-2)+...+C(n-1)C(0), and my problem.

The problem is to find the number of possible 2xn matrices consisting of the first 2n integers so that the numbers in both the first and second rows are increasing, and the number in row 1, column j is less than the number in row 2 (for any j)...

I've been trying to come up with something using a tree, since the problem can easily be divided into two distinct halves-- notably

12xxx...x
xxxxx...2n

and

13xxx...x
2xxxx...2n

from this, it is really easy to divide each side into the sum of smaller matrices that satisfy the necessary conditions.

I guess the point I am now, is how can I turn this into a combinatoric proof that there are exactly Cn possible combinations?

Thanks
 
There is a counting argument to obtain Catalan Numbers, which involves the use of Dyck numbers discovered by D Andre. It is a little too long to write it in here, but it is used to determine:

C(n) = \frac{(2n)!}{n!n!} -\frac{(2n)!}{(n-1)!(n+1)!}

See: http://www.answers.com/topic/catalan-number
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
Back
Top