- FindStat

Identifier

Mp00208: Permutations —lattice of intervals⟶ Lattices
Mp00193: Lattices —to poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
St000771: Graphs ⟶ ℤ

Values

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

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

$F_{1} = q$

$F_{2} = 2\ q^{2}$

$F_{3} = 6\ q^{2}$

Description

The largest multiplicity of a distance Laplacian eigenvalue in a connected graph.
The distance Laplacian of a graph is the (symmetric) matrix with row and column sums

$0$ , which has the negative distances between two vertices as its off-diagonal entries. This statistic is the largest multiplicity of an eigenvalue.
For example, the cycle on four vertices has distance Laplacian

$\left(\begin{array}{rrrr} 4 & -1 & -2 & -1 \\ -1 & 4 & -1 & -2 \\ -2 & -1 & 4 & -1 \\ -1 & -2 & -1 & 4 \end{array}\right).$
Its eigenvalues are

$0,4,4,6$ , so the statistic is

$2$ .
The path on four vertices has eigenvalues

$0, 4.7\dots, 6, 9.2\dots$ and therefore statistic

$1$ .

Map

lattice of intervals

Description

The lattice of intervals of a permutation.
An interval of a permutation

$\pi$ is a possibly empty interval of values that appear in consecutive positions of

$\pi$ . The lattice of intervals of

$\pi$ has as elements the intervals of

$\pi$ , ordered by set inclusion.

Map

to graph

Description

Returns the Hasse diagram of the poset as an undirected graph.

Map

to poset

Description

Return the poset corresponding to the lattice.