Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

InsEnc

From MaRDI portal
Software:18315
Jump to:navigation, search



swMATH6181MaRDI QIDQ18315


No author found.




Described by source

  • Finding regular insertion encodings for permutation classes


Related Items (20)

Enumeration of some classes of words avoiding two generalized patterns of length three ⋮ Enumeration schemes for permutations avoiding barred patterns ⋮ Maximally clustered elements and Schubert varieties. ⋮ Growth rates of permutation classes: categorization up to the uncountability threshold ⋮ Embedded factor patterns for Deodhar elements in Kazhdan-Lusztig theory. ⋮ Unnamed Item ⋮ Repetition in reduced decompositions ⋮ Unnamed Item ⋮ Automatic discovery of structural rules of permutation classes ⋮ Finitely labeled generating trees and restricted permutations ⋮ Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents ⋮ Exhaustive generation for permutations avoiding (colored) regular sets of patterns ⋮ On the effective and automatic enumeration of polynomial permutation classes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Small permutation classes ⋮ Permutation patterns and cell decompositions ⋮ On the centrosymmetric permutations in a class ⋮ Unnamed Item


This page was built for software: InsEnc

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Software:18315&oldid=29436918"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 March 2024, at 21:07.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki