Generalizations of Twostacksortable Permutations,Used

Generalizations of Twostacksortable Permutations,Used

In Stock
SKU: DADAX383830621X
Brand: LAP Lambert Academic Publishing
Sale price$88.61 Regular price$126.59
Save $37.98
Quantity
Add to wishlist
Add to compare

Processing time: 1-3 days

US Orders Ships in: 3-5 days

International Orders Ships in: 8-12 days

Return Policy: 15-days return on defective items

Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

This is a dissertation presented to the faculty of department of mathematics, Brandeis University, in partial fulfillment of the requirements for the degree Doctor of Philosophy. In this thesis, we apply the stack sorting operator to rpermutations and construct the functional equation for the generating function of twostacksortable permutations counted by descents by using a factorization similar to Zeilberger's. We solve the functional equation and give explicit formulas for the number of twostacksortable permutations.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed