[seqfan] Re: looking for bijections

[Max Alekseyev]

Actually, this bijection is rated quite low in Stanley's "Bijective
proof problems" list:
http://www-math.mit.edu/~rstan/bij.pdf
See problems 155 and 159 there.
Max

On Tue, Jun 8, 2010 at 4:47 AM, Joerg Arndt <arndt at jjj.de> wrote:
> I'd suggest to ask Stanley (though no
> historical references are given in his well known
> documents at http://www-math.mit.edu/~rstan/ec/ )
>
> * Emeric Deutsch <deutsch at poly.edu> [Jun 07. 2010 20:15]:
>> Dear Seqfans,
>> I'd appreciate references to known bijections between
>> full binary trees with n internal nodes and Dyck paths of
>> length 2n.
>> Thanks,
>> Emeric
>>
>>
>> _______________________________________________
>>
>> Seqfan Mailing list - http://list.seqfan.eu/
>
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>