What is the good name for permutations of [1,...,n+1] having no substring [k,k+1] http://oeis.org/A000255 ?
$\begingroup$
$\endgroup$
3
-
$\begingroup$ Stepless? Impatient? :D $\endgroup$– მამუკა ჯიბლაძეCommented Jun 14, 2016 at 19:04
-
$\begingroup$ Stepless is what i tried :) But somehow it has uncomfortable negation "having step" $\endgroup$– Nikolai MnevCommented Jun 14, 2016 at 19:24
-
1$\begingroup$ I'd use "stepful" instead. $\endgroup$– Allen KnutsonCommented Jun 14, 2016 at 20:03
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
3
These permutations are called "plus irreducible".
-
$\begingroup$ Thank you very much. Great reference! This permutations are important for me, i hoped for shorter name, but this name is conceptual. $\endgroup$ Commented Jun 14, 2016 at 19:20
-
4$\begingroup$ Let me remark that much more is now known about the topics that are covered in that preprint. A starting point is Vatter's recent survey article http://arxiv.org/abs/1409.5159 $\endgroup$ Commented Jun 14, 2016 at 22:38
-
1$\begingroup$ Oh many thanks Michael! I have arrived to this alien for me combinatorics from computations in characteristic classes and will be very happy to learn $\endgroup$ Commented Jun 15, 2016 at 0:10