10
$\begingroup$

What is the good name for permutations of [1,...,n+1] having no substring [k,k+1] http://oeis.org/A000255 ?

$\endgroup$
3
  • $\begingroup$ Stepless? Impatient? :D $\endgroup$ Jun 14 '16 at 19:04
  • $\begingroup$ Stepless is what i tried :) But somehow it has uncomfortable negation "having step" $\endgroup$ Jun 14 '16 at 19:24
  • 1
    $\begingroup$ I'd use "stepful" instead. $\endgroup$ Jun 14 '16 at 20:03
10
$\begingroup$

These permutations are called "plus irreducible".

See http://arxiv.org/pdf/math/0212163v1.pdf

$\endgroup$
3
  • $\begingroup$ Thank you very much. Great reference! This permutations are important for me, i hoped for shorter name, but this name is conceptual. $\endgroup$ Jun 14 '16 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$ Jun 14 '16 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$ Jun 15 '16 at 0:10

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.