Pattern Avoiding Permutations Enumerated by Inversions
Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion and Schmidt, we investigate all combinations of permutation...
সংরক্ষণ করুন:
| প্রধান লেখক: | |
|---|---|
| বিন্যাস: | Artigo |
| ভাষা: | Inglês |
| প্রকাশিত: |
Discrete Mathematics & Theoretical Computer Science
2025-05-01
|
| মালা: | Discrete Mathematics & Theoretical Computer Science |
| বিষয়গুলি: | |
| অনলাইন ব্যবহার করুন: | http://dmtcs.episciences.org/14437/pdf |
| ট্যাগগুলো: |
কোনো ট্যাগ নেই, প্রথমজন হিসাবে ট্যাগ করুন!
|