- FindStat

edit this statistic or download as text // json

Identifier

St000632: Posets ⟶ ℤ

Values

([],1) => 0

([],2) => 1

([(0,1)],2) => 0

([],3) => 2

([(1,2)],3) => 1

([(0,1),(0,2)],3) => 1

([(0,2),(2,1)],3) => 0

([(0,2),(1,2)],3) => 1

([],4) => 3

([(2,3)],4) => 2

([(1,2),(1,3)],4) => 2

([(0,1),(0,2),(0,3)],4) => 2

([(0,2),(0,3),(3,1)],4) => 1

([(0,1),(0,2),(1,3),(2,3)],4) => 1

([(1,2),(2,3)],4) => 1

([(0,3),(3,1),(3,2)],4) => 1

([(1,3),(2,3)],4) => 2

([(0,3),(1,3),(3,2)],4) => 1

([(0,3),(1,3),(2,3)],4) => 2

([(0,3),(1,2)],4) => 1

([(0,3),(1,2),(1,3)],4) => 1

([(0,2),(0,3),(1,2),(1,3)],4) => 2

([(0,3),(2,1),(3,2)],4) => 0

([(0,3),(1,2),(2,3)],4) => 1

([],5) => 4

([(3,4)],5) => 3

([(2,3),(2,4)],5) => 3

([(1,2),(1,3),(1,4)],5) => 3

([(0,1),(0,2),(0,3),(0,4)],5) => 3

([(0,2),(0,3),(0,4),(4,1)],5) => 2

([(0,1),(0,2),(0,3),(2,4),(3,4)],5) => 2

([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5) => 2

([(1,3),(1,4),(4,2)],5) => 2

([(0,3),(0,4),(4,1),(4,2)],5) => 2

([(1,2),(1,3),(2,4),(3,4)],5) => 2

([(0,2),(0,3),(2,4),(3,4),(4,1)],5) => 1

([(0,3),(0,4),(3,2),(4,1)],5) => 1

([(0,2),(0,3),(2,4),(3,1),(3,4)],5) => 1

([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5) => 2

([(2,3),(3,4)],5) => 2

([(1,4),(4,2),(4,3)],5) => 2

([(0,4),(4,1),(4,2),(4,3)],5) => 2

([(2,4),(3,4)],5) => 3

([(1,4),(2,4),(4,3)],5) => 2

([(0,4),(1,4),(4,2),(4,3)],5) => 2

([(1,4),(2,4),(3,4)],5) => 3

([(0,4),(1,4),(2,4),(4,3)],5) => 2

([(0,4),(1,4),(2,4),(3,4)],5) => 3

([(0,4),(1,4),(2,3)],5) => 2

([(0,4),(1,3),(2,3),(2,4)],5) => 2

([(0,4),(1,3),(1,4),(2,3),(2,4)],5) => 2

([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5) => 3

([(0,4),(1,4),(2,3),(4,2)],5) => 1

([(0,4),(1,3),(2,3),(3,4)],5) => 2

([(0,4),(1,4),(2,3),(2,4)],5) => 2

([(0,4),(1,4),(2,3),(3,4)],5) => 2

([(1,4),(2,3)],5) => 2

([(1,4),(2,3),(2,4)],5) => 2

([(0,4),(1,2),(1,4),(2,3)],5) => 1

([(0,3),(1,2),(1,3),(2,4),(3,4)],5) => 1

([(1,3),(1,4),(2,3),(2,4)],5) => 3

([(0,3),(0,4),(1,3),(1,4),(4,2)],5) => 2

([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5) => 2

([(0,4),(1,2),(1,4),(4,3)],5) => 1

([(0,4),(1,2),(1,3)],5) => 2

([(0,4),(1,2),(1,3),(1,4)],5) => 2

([(0,2),(0,4),(3,1),(4,3)],5) => 1

([(0,4),(1,2),(1,3),(3,4)],5) => 2

([(0,2),(0,3),(1,4),(2,4),(3,1)],5) => 1

([(0,4),(1,2),(1,3),(2,4),(3,4)],5) => 2

([(0,3),(0,4),(1,2),(1,4)],5) => 2

([(0,3),(0,4),(1,2),(1,3),(1,4)],5) => 2

([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4)],5) => 3

([(0,3),(0,4),(1,2),(1,3),(2,4)],5) => 2

([(0,3),(1,2),(1,4),(3,4)],5) => 1

([(0,3),(0,4),(1,2),(2,3),(2,4)],5) => 2

([(1,4),(3,2),(4,3)],5) => 1

([(0,3),(3,4),(4,1),(4,2)],5) => 1

([(1,4),(2,3),(3,4)],5) => 2

([(0,4),(1,2),(2,4),(4,3)],5) => 1

([(0,3),(1,4),(4,2)],5) => 1

([(0,4),(3,2),(4,1),(4,3)],5) => 1

([(0,4),(1,2),(2,3),(2,4)],5) => 1

([(0,4),(2,3),(3,1),(4,2)],5) => 0

([(0,3),(1,2),(2,4),(3,4)],5) => 1

([(0,4),(1,2),(2,3),(3,4)],5) => 1

([(0,3),(1,4),(2,4),(3,1),(3,2)],5) => 1

([],6) => 5

([(4,5)],6) => 4

([(3,4),(3,5)],6) => 4

([(2,3),(2,4),(2,5)],6) => 4

([(1,2),(1,3),(1,4),(1,5)],6) => 4

([(0,1),(0,2),(0,3),(0,4),(0,5)],6) => 4

([(0,2),(0,3),(0,4),(0,5),(5,1)],6) => 3

([(0,1),(0,2),(0,3),(0,4),(3,5),(4,5)],6) => 3

([(0,1),(0,2),(0,3),(0,4),(2,5),(3,5),(4,5)],6) => 3

([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6) => 3

([(1,3),(1,4),(1,5),(5,2)],6) => 3

([(0,3),(0,4),(0,5),(5,1),(5,2)],6) => 3

([(1,2),(1,3),(1,4),(3,5),(4,5)],6) => 3

([(1,2),(1,3),(1,4),(2,5),(3,5),(4,5)],6) => 3

>>> Load all 1364 entries. <<<

search for individual values

searching the database for the individual values of this statistic

/ search for generating function

searching the database for statistics with the same generating function

click to show known generating functions

Description

The jump number of the poset.
A jump in a linear extension $e_1, \dots, e_n$ of a poset $P$ is a pair $(e_i, e_{i+1})$ so that $e_{i+1}$ does not cover $e_i$ in $P$. The jump number of a poset is the minimal number of jumps in linear extensions of a poset.

References

[1] Bianco, L., Dell'Olmo, P., Giordani, S. An optimal algorithm to find the jump number of partially ordered sets MathSciNet:1461418

Code

def statistic(P):
    return P.jump_number()

Created

Oct 18, 2016 at 14:42 by Martin Rubey

Updated

Jun 22, 2019 at 13:48 by Martin Rubey