GlobalView
Rechnitzer, A.

Showing items 1 - 2 of 2.

Add to Quick Collection   All 2 Results

  • First
  • Previous
  • 1
  • Next
  • Last
Sort:
 Add All Items to Quick Collection
Date: 2006
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.13/933746
Description: We firstly review the constant term method (CTM), illustrating its combinatorial connections and show how it can be used to solve a certain class of lattice path problems. We show the connection betwe... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/928094
Description: We show that the Stanley–Wilf limit for the class of 4231-avoiding permutations is at least by 9.47. This bound shows that this class has the largest such limit among all classes of permutations avoid... More
Full Text: Full Text
Reviewed: Reviewed
Image Thumbnail
  • First
  • Previous
  • 1
  • Next
  • Last