A057501 -id:A057501 - cp's OEIS frontend

A069772 Self-inverse permutation of natural numbers induced by the automorphism xReflectHandshakes acting on the parenthesizations encoded by A014486.

0, 1, 2, 3, 7, 6, 5, 4, 8, 9, 10, 21, 20, 19, 14, 15, 18, 17, 16, 13, 12, 11, 22, 45, 46, 44, 42, 43, 31, 32, 30, 28, 29, 63, 62, 61, 60, 54, 55, 53, 51, 52, 26, 27, 25, 23, 24, 59, 58, 57, 56, 40, 41, 39, 37, 38, 50, 49, 48, 47, 36, 35, 34, 33, 64, 65, 67, 66, 68, 69, 170

Offset: 0

Antti Karttunen, Apr 16 2002

nonn

This automorphism reflects over the x-axis the interpretation n (the non-crossing handshakes) of Stanley's exercise 19.
Note that DeepRev (A057164) reflects over y-axis.
This transformation keeps palindromic parenthesizations/Dyck paths/rooted planar trees palindromic, but not necessarily same, meaning that this induces a permutation on the sequence A061855 (= A069766).

A. Karttunen, Gatomorphisms (Includes the complete Scheme program for computing this sequence)
R. P. Stanley, Exercises on Catalan and Related Numbers
Index entries for sequences that are permutations of the natural numbers

Composition of A057164 and A069771 in either order, i.e. A069772(n) = A057164(A069771(n)) = A069771(A057164(n)). Cf. also A061855, A069766, A057501, A069888, A069889.

A057162 Signature-permutation of a Catalan Automorphism: rotate one step clockwise the triangulations of polygons encoded by A014486.

Original entry on oeis.org

0, 1, 3, 2, 8, 6, 7, 4, 5, 22, 19, 20, 14, 15, 21, 16, 17, 9, 10, 18, 11, 12, 13, 64, 60, 61, 51, 52, 62, 53, 54, 37, 38, 55, 39, 40, 41, 63, 56, 57, 42, 43, 58, 44, 45, 23, 24, 46, 25, 26, 27, 59, 47, 48, 28, 29, 49, 30, 31, 32, 50, 33, 34, 35, 36, 196, 191, 192, 177, 178

Offset: 0

Antti Karttunen, Aug 18 2000; entry revised Jun 06 2014

nonn

This is a permutation of natural numbers induced when Euler's triangulation of convex polygons, encoded by the sequence A014486 in a straightforward way (via binary trees, cf. the illustration of the rotation of a triangulated pentagon, given in the Links section) are rotated clockwise.

In A057161 and A057162, the cycles between A014138(n-1)-th and A014138(n)-th term partition A000108(n) objects encoded by the corresponding terms of A014486 into A001683(n+2) equivalence classes of flexagons (or unlabeled plane boron trees), thus the latter sequence can be counted with the Maple procedure A057162_CycleCounts given below. Cf. also the comments in A057161.

A. Karttunen, Table of n, a(n) for n = 0..2055
A. Karttunen, Illustration of how the five triangulations of a pentagon will rotate, and the corresponding changes it induces in the binary trees
A. Karttunen, Introductory Survey of Catalan Automorphisms and Bijections (an unfinished draft), pp. 51-54.
Index entries for signature-permutations of Catalan automorphisms

Inverse: A057161.
Also, an "ENIPS"-transform of A069773, and thus occurs as row 17 of A130402.
Other related permutations: A057163, A057164, A057501, A057503, A057505.
Cf. A001683 (cycle counts), A057544 (max cycle lengths).

a(n) = CatalanRankGlobal(RotateTriangularizationR(A014486[n]))
RotateTriangularizationR := n -> ReflectBinTree(RotateTriangularization(ReflectBinTree(n)));
with(group); A057162_CycleCounts := proc(upto_n) local u,n,a,r,b; a := []; for n from 0 to upto_n do b := []; u := (binomial(2*n,n)/(n+1)); for r from 0 to u-1 do b := [op(b),1+CatalanRank(n,RotateTriangularization(CatalanUnrank(n,r)))]; od; a := [op(a),(`if`((n < 2),1,nops(convert(b,'disjcyc'))))]; od; RETURN(a); end;
# See also the code in A057161.

As a composition of related permutations:
a(n) = A069768(A057508(n)).
a(n) = A057163(A057161(A057163(n))).
a(n) = A057164(A057503(A057164(n))). [For the proof, see pp. 53-54 in the "Introductory survey ..." draft, eq. 143.]

A057513 Number of separate orbits to which permutations given in A057511/A057512 (induced by deep rotation of general parenthesizations/plane trees) partition each A000108(n) objects encoded by A014486 between (A014138(n-1)+1)-th and (A014138(n))-th terms.

Original entry on oeis.org

1, 1, 2, 4, 9, 21, 56, 153, 451, 1357, 4212, 13308, 42898, 140276, 465324, 1561955, 5300285, 18156813, 62732842, 218405402, 765657940

Offset: 0

Antti Karttunen Sep 03 2000

It is much faster to compute this sequence empirically with the given C-program than to calculate the terms with the formula in its present form.

A. Karttunen, Gatomorphisms (with the complete Scheme source)
Index entries for sequences related to rooted trees
A. Karttunen, C-program for computing empirically the initial terms of this sequence

CountCycles given in A057502, for other procedures, follow A057511 and A057501.
Similarly generated sequences: A001683, A002995, A003239, A038775, A057507. Cf. also A000081.
Occurs for first time in A073201 as row 12. Cf. A057546 and also A000081.

A057513 := proc(n) local i; `if`((0=n),1,(1/A003418(n-1))*add(A079216bi(n,i),i=1..A003418(n-1))); end;
# Or empirically:
DeepRotatePermutationCycleCounts := proc(upto_n) local u,n,a,r,b; a := []; for n from 0 to upto_n do b := []; u := (binomial(2*n,n)/(n+1)); for r from 0 to u-1 do b := [op(b),1+CatalanRank(n,DeepRotateL(CatalanUnrank(n,r)))]; od; a := [op(a),CountCycles(b)]; od; RETURN(a); end;

a(0)=1, a(n) = (1/A003418(n-1))*Sum_{i=1..A003418(n-1)} A079216(n, i) [Needs improvement.] - Antti Karttunen, Jan 03 2003

A057503 Signature-permutation of a Catalan Automorphism: Deutsch's 1998 bijection on Dyck paths.

Original entry on oeis.org

0, 1, 3, 2, 8, 7, 5, 4, 6, 22, 21, 18, 17, 20, 13, 12, 10, 9, 11, 15, 14, 16, 19, 64, 63, 59, 58, 62, 50, 49, 46, 45, 48, 55, 54, 57, 61, 36, 35, 32, 31, 34, 27, 26, 24, 23, 25, 29, 28, 30, 33, 41, 40, 38, 37, 39, 43, 42, 44, 47, 52, 51, 53, 56, 60, 196, 195, 190, 189, 194

Offset: 0

Antti Karttunen, Sep 03 2000

nonn

Deutsch shows in his 1998 paper that this automorphism maps the number of returns of Dyck path to the height of the last peak, i.e., that A057515(n) = A080237(A057503(n)) holds for all n, thus the two parameters have the same distribution.

From the recursive forms of A057161 and A057503 it is seen that both can be viewed as a convergent limits of a process where either the left or right side argument of A085201 in formula for A057501 is "iteratively recursivized", and on the other hand, both of these can then in turn be made to converge towards A057505, when the other side of the formula is also "recursivized" in the same way. - Antti Karttunen, Jun 06 2014

Antti Karttunen, Table of n, a(n) for n = 0..2055
Emeric Deutsch, A bijection on Dyck paths and its consequences, Discrete Math., 179 (1998), 253-256.
Antti Karttunen, C program which computes this sequence..
Antti Karttunen, Introductory Survey of Catalan Automorphisms and Bijections (an unfinished draft), pp. 53-54.
Index entries for signature-permutations of Catalan automorphisms

Inverse: A057504. Row 17 of A122285. Cf. A057501, A057161, A057505.

The number of cycles, count of the fixed points, maximum cycle sizes and LCM's of all cycle sizes in range [A014137(n-1)..A014138(n)] of this permutation are given by LEFT(LEFT(A001683)), LEFT(A019590), A057544 and A057544, the same sequences as for A057162 because this is a conjugate of it (cf. the Formula section).

a(0) = 0, and for n >= 1, a(n) = A085201(A072771(n), A057548(a(A072772(n)))). [This formula reflects the S-expression implementation given first in the Program section: A085201 is a 2-ary function corresponding to 'append', A072771 and A072772 correspond to 'car' and 'cdr' (known also as first/rest or head/tail in some languages), and A057548 corresponds to the unary form of function 'list'].
a(n) = A057164(A057162(A057164(n))). [For the proof, see pp. 53-54 in the "Introductory survey ..." draft, eq. 144.]
Other identities:
A057515(n) = A080237(a(n)) holds for all n. [See the Comments section.]

Equivalence with Emeric Deutsch's 1998 bijection realized Dec 15 2006 and entry edited accordingly by Antti Karttunen, Jan 16 2007

A069771 Self-inverse permutation of natural numbers induced by the automorphism RotateHandshakes180 acting on the parenthesizations encoded by A014486.

Original entry on oeis.org

0, 1, 2, 3, 7, 5, 6, 4, 8, 9, 14, 21, 18, 13, 10, 15, 20, 17, 12, 19, 16, 11, 22, 45, 54, 31, 26, 40, 44, 53, 30, 25, 39, 63, 59, 50, 36, 46, 55, 32, 27, 41, 42, 51, 28, 23, 37, 62, 58, 49, 35, 43, 52, 29, 24, 38, 61, 57, 48, 34, 60, 56, 47, 33, 64, 65, 79, 107, 121, 149, 170

Offset: 0

Antti Karttunen, Apr 16 2002

nonn

This automorphism rotates by 180 degrees the interpretation n (the non-crossing handshakes) of Stanley's exercise 19.

A. Karttunen, Gatomorphisms (Includes the complete Scheme program for computing this sequence)
R. P. Stanley, Exercises on Catalan and Related Numbers
Index entries for sequences that are permutations of the natural numbers

Cf. A057501, A069772, A069888, A069889.

A127291 Signature-permutation of Elizalde's and Deutsch's 2003 bijection for Dyck paths.

Original entry on oeis.org

0, 1, 3, 2, 6, 7, 8, 5, 4, 15, 18, 14, 16, 17, 20, 22, 19, 11, 12, 21, 13, 10, 9, 39, 47, 40, 48, 50, 41, 49, 38, 43, 46, 37, 42, 44, 45, 53, 60, 54, 61, 63, 55, 62, 52, 29, 32, 51, 28, 30, 31, 59, 64, 57, 34, 36, 56, 33, 25, 26, 58, 35, 27, 24, 23, 113, 136, 116, 139, 146

Offset: 0

Antti Karttunen, Jan 16 2007

Deutsch and Elizalde show in their paper that this automorphism converts certain properties concerning "tunnels" of Dyck path to another set of properties concerning the number of hills, even and odd rises, as well as the number of returns (A057515), thus proving the equidistribution of the said parameters.
This automorphism is implemented with function "tau" (Scheme code given below) that takes as its arguments an S-expression and a Catalan automorphism that permutes only the top level of the list (i.e., the top-level branches of a general tree, or the whole arches of a Dyck path) and thus when the permuting automorphism is applied to a list (parenthesization) of length 2n it induces some permutation of [1..2n].
This automorphism is induced in that manner by the automorphism *A127287 and likewise, *A127289 is induced by *A127285, *A057164 by *A057508, *A057501 by *A057509 and *A057502 by *A057510.
Note that so far these examples seem to satisfy the homomorphism condition, e.g., as *A127287 = *A127285 o *A057508 so is *A127291 = *A127289 o *A057164. and likewise, as *A057510 = *A057508 o *A057509 o *A057508, so is *A057502 = *A057164 o *A057501 o *A057164.
However, it remains open what are the exact criteria of the "picking automorphism" and the corresponding permutation that this method would induce a bijection. For example, if we give *A127288 (the inverse of *A127287) to function "tau" it will not induce *A127292 and actually not a bijection at all.
Instead, we have to compute the inverse of this automorphism with another, more specific algorithm that implements Deutsch's and Elizalde's description and is given in A127300.

A. Karttunen, Table of n, a(n) for n = 0..2055
Emeric Deutsch and Sergi Elizalde, A simple and unusual bijection for Dyck paths and its consequences, Annals of Combinatorics, 7 (2003), no. 3, 281-297.
Index entries for signature-permutations of Catalan automorphisms

Inverse: A127292. a(n) = A127289(A057164(n)) = A057164(A127299(A057164(n))). A127291(A057548(n)) = A072795(A127291(n)), A127291(A072795(n)) = A127307(A127291(A057502(n))) for all n >= 1. The number of cycles, maximum cycle sizes and LCM's of all cycle sizes in range [A014137(n-1)..A014138(n-1)] of this permutation are given by A127293, A127294 and A127295. Number of fixed points begins as 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, ...

A057543 Maximum cycle length (orbit size) in the rotation permutation of 2n non-crossing handshakes.

Original entry on oeis.org

1, 1, 2, 3, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108, 110, 112, 114, 116, 118, 120, 122, 124

Offset: 0

Antti Karttunen, Sep 07 2000

nonn

That is, in permutations A057501 and A057502, the longest cycle among all cycles between the (A014138(n-2)+1)th and (A014138(n-1))th terms.

Cf. A057542, A057544, A057545.

a(0)=1, a(1)=1, a(2)=2, a(3)=3, and a(n)=2*n for n>=4.

More terms from Sean A. Irvine, Jun 13 2022

A069888 Self-inverse permutation of natural numbers induced by the automorphism DeepReverse_et_RotateHandshakes! acting on the parenthesizations encoded by A014486.

Original entry on oeis.org

0, 1, 3, 2, 7, 5, 8, 4, 6, 17, 12, 20, 10, 15, 18, 13, 21, 9, 14, 22, 11, 16, 19, 45, 31, 54, 26, 40, 48, 34, 57, 24, 38, 61, 29, 43, 52, 46, 32, 55, 27, 41, 49, 35, 58, 23, 37, 62, 28, 42, 51, 50, 36, 59, 25, 39, 63, 30, 44, 53, 64, 33, 47, 56, 60, 129, 87, 157, 73, 115, 138

Offset: 0

Antti Karttunen, Apr 16 2002, suggested by Wouter Meeussen Dec 15 2001

nonn

This automorphism reflects non-crossing handshakes (the interpretation n of Stanley's exercise 19) over the diagonal that goes through corner at "1 o'clock".

A. Karttunen, Gatomorphisms (Includes the complete Scheme program for computing this sequence)
R. P. Stanley, Exercises on Catalan and Related Numbers
Index entries for sequences that are permutations of the natural numbers

Composition of A057164 and A057501, i.e. A069888(n) = A057501(A057164(n)). Cf. also A069889.

A069773 Permutation of natural numbers induced by the automorphism RoblDownCar_et_Swap! acting on the parenthesizations encoded by A014486.

Original entry on oeis.org

0, 1, 3, 2, 6, 8, 7, 4, 5, 14, 15, 19, 20, 22, 16, 21, 17, 9, 10, 18, 11, 12, 13, 37, 38, 39, 40, 41, 51, 52, 53, 54, 55, 60, 61, 62, 64, 42, 43, 56, 57, 63, 44, 58, 45, 23, 24, 46, 25, 26, 27, 47, 59, 48, 28, 29, 49, 30, 31, 32, 50, 33, 34, 35, 36, 107, 108, 109, 110, 111

Offset: 0

Antti Karttunen, Apr 16 2002

nonn

A. Karttunen, Gatomorphisms (Includes the complete Scheme program for computing this sequence)
Index entries for sequences that are permutations of the natural numbers

Inverse of A069774, the car/cdr-flipped conjugate of A057501, i.e. A069773(n) = A057163(A057501(A057163(n))). Cf. also A069775.

A086427 Permutation of natural numbers induced by the Catalan bijection gma086427 acting on symbolless S-expressions encoded by A014486/A063171.

Original entry on oeis.org

0, 1, 3, 2, 8, 6, 7, 5, 4, 22, 19, 20, 15, 14, 21, 16, 18, 13, 12, 17, 10, 11, 9, 64, 60, 61, 52, 51, 62, 53, 55, 41, 40, 54, 38, 39, 37, 63, 56, 57, 43, 42, 59, 47, 50, 36, 34, 49, 35, 32, 31, 58, 44, 46, 27, 26, 48, 29, 33, 30, 45, 24, 25, 28, 23, 196, 191, 192, 178, 177

Offset: 0

Antti Karttunen, Jun 23 2003

nonn

This Catalan bijection rotates by "half step" the interpretations (pp)-(rr) of Stanley, using the "descending slope" mapping illustrated in A086431.

A. Karttunen, Gatomorphisms (With the complete Scheme source)
Index entries for signature-permutations induced by Catalan automorphisms

Inverse: A086428. a(n) = A086431(A086428(A086431(n))) = A057164(A085173(A057164(n))) = A086425(A057501(A086426(n))). Occurs in A073200. Cf. also A086429 (whole step rotate).

Number of cycles: A002995. Number of fixed points: A019590. Max. cycle size: A057543. (In range [A014137(n-1)..A014138(n-1)] of this permutation, possibly shifted one term left or right).

cp's OEIS Frontend

A069772 Self-inverse permutation of natural numbers induced by the automorphism xReflectHandshakes acting on the parenthesizations encoded by A014486.

Views

Author

Keywords

Comments

Links

Crossrefs

A057162 Signature-permutation of a Catalan Automorphism: rotate one step clockwise the triangulations of polygons encoded by A014486.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Formula

A057513 Number of separate orbits to which permutations given in A057511/A057512 (induced by deep rotation of general parenthesizations/plane trees) partition each A000108(n) objects encoded by A014486 between (A014138(n-1)+1)-th and (A014138(n))-th terms.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Formula

A057503 Signature-permutation of a Catalan Automorphism: Deutsch's 1998 bijection on Dyck paths.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

Extensions

A069771 Self-inverse permutation of natural numbers induced by the automorphism RotateHandshakes180 acting on the parenthesizations encoded by A014486.

Views

Author

Keywords

Comments

Links

Crossrefs

A127291 Signature-permutation of Elizalde's and Deutsch's 2003 bijection for Dyck paths.

Views

Author

Keywords

Comments

Links

Crossrefs

A057543 Maximum cycle length (orbit size) in the rotation permutation of 2n non-crossing handshakes.

Views

Author

Keywords

Comments

Crossrefs

Formula

Extensions

A069888 Self-inverse permutation of natural numbers induced by the automorphism DeepReverse_et_RotateHandshakes! acting on the parenthesizations encoded by A014486.

Views

Author

Keywords

Comments

Links

Crossrefs

A069773 Permutation of natural numbers induced by the automorphism RoblDownCar_et_Swap! acting on the parenthesizations encoded by A014486.

Views

Author

Keywords

Links

Crossrefs

A086427 Permutation of natural numbers induced by the Catalan bijection gma086427 acting on symbolless S-expressions encoded by A014486/A063171.

Views

Author

Keywords

Comments

Links

Crossrefs