The Euler-Catalan Identity

  title={The Euler-Catalan Identity},
  author={Don Rawlings},
  journal={Eur. J. Comb.},
where # A is used to denote the cardinality of a set A. The next result of this type was discovered by Rotem [11]. He showed that the set of (1 E Sn which do not have either 231 or 312 patterns has cardinality 2n -1. And, finally, the definitive solution to the problem is to be found in a recent paper by Simion and Schmidt [12]. Given any set A s; S3, they have determined the number of permutations in Sn which avoid A. In view of the preceding remarks, a natural question arises: Rather than… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
5 Citations
6 References
Similar Papers


Publications citing this paper.
Showing 1-5 of 5 extracted citations


Publications referenced by this paper.
Showing 1-6 of 6 references

Two element lattice permutation numbers and their q-generalizations

  • L. Carlitz, J. Riordan
  • Duke J. Math
  • 1964
Highly Influential
8 Excerpts

and D

  • I. P. Goulde
  • M. Jackson, Combinatorial Enumeration, Wiley and…
  • 1983

Generating functions and enumeration of sequences

  • I. M. Gessel
  • M.I.T. doctoral thesis,
  • 1977
3 Excerpts

Eulerian differential operators

  • G. E. Andrews
  • Studies Appl. Math. SO
  • 1971

Theorie Geomhrique des Polynomes Euieriens, Lecture Notes in Math

  • D. Foata, M. P. Schiitzenberger
  • 138, Springer-Verlag,
  • 1970

Similar Papers

Loading similar papers…