Identifier
Values
([],1) => ([(0,1)],2) => ([(0,1)],2) => ([(0,1)],2) => 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
([(0,1)],2) => ([(0,2),(2,1)],3) => ([(0,2),(2,1)],3) => ([(0,2),(1,2)],3) => 1
([(1,2)],3) => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,3),(0,5),(1,2),(1,5),(2,4),(3,4),(4,5)],6) => 2
([(0,1),(0,2)],3) => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5) => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5) => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5) => 1
([(0,2),(2,1)],3) => ([(0,3),(2,1),(3,2)],4) => ([(0,3),(2,1),(3,2)],4) => ([(0,3),(1,2),(2,3)],4) => 1
([(0,2),(1,2)],3) => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5) => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5) => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5) => 1
([(0,2),(0,3),(3,1)],4) => ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7) => ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7) => ([(0,6),(1,2),(1,4),(2,5),(3,4),(3,6),(4,5),(5,6)],7) => 1
([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6) => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6) => ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6) => 1
([(0,3),(3,1),(3,2)],4) => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6) => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6) => ([(0,4),(1,2),(1,3),(2,5),(3,5),(4,5)],6) => 1
([(0,3),(1,3),(3,2)],4) => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6) => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6) => ([(0,4),(1,2),(1,3),(2,5),(3,5),(4,5)],6) => 1
([(0,2),(0,3),(1,2),(1,3)],4) => ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7) => ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7) => ([(0,4),(0,5),(1,2),(1,3),(2,6),(3,6),(4,6),(5,6)],7) => 2
([(0,3),(2,1),(3,2)],4) => ([(0,4),(2,3),(3,1),(4,2)],5) => ([(0,4),(2,3),(3,1),(4,2)],5) => ([(0,4),(1,3),(2,3),(2,4)],5) => 1
([(0,3),(1,2),(2,3)],4) => ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7) => ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7) => ([(0,6),(1,2),(1,4),(2,5),(3,4),(3,6),(4,5),(5,6)],7) => 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5) => ([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7) => ([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7) => ([(0,6),(1,4),(2,5),(2,6),(3,5),(3,6),(4,5)],7) => 1
([(0,4),(1,4),(2,3),(4,2)],5) => ([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7) => ([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7) => ([(0,5),(1,2),(1,3),(2,6),(3,6),(4,5),(4,6)],7) => 1
([(0,3),(3,4),(4,1),(4,2)],5) => ([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7) => ([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7) => ([(0,5),(1,2),(1,3),(2,6),(3,6),(4,5),(4,6)],7) => 1
([(0,4),(2,3),(3,1),(4,2)],5) => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([(0,5),(1,4),(2,3),(2,4),(3,5)],6) => 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5) => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7) => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7) => ([(0,6),(1,4),(2,5),(2,6),(3,5),(3,6),(4,5)],7) => 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7) => 1
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
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$.
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
to graph
Description
Returns the Hasse diagram of the poset as an undirected graph.
Map
order ideals
Description
The lattice of order ideals of a poset.
An order ideal $\mathcal I$ in a poset $P$ is a downward closed set, i.e., $a \in \mathcal I$ and $b \leq a$ implies $b \in \mathcal I$. This map sends a poset to the lattice of all order ideals sorted by inclusion with meet being intersection and join being union.
An order ideal $\mathcal I$ in a poset $P$ is a downward closed set, i.e., $a \in \mathcal I$ and $b \leq a$ implies $b \in \mathcal I$. This map sends a poset to the lattice of all order ideals sorted by inclusion with meet being intersection and join being union.
Map
to poset
Description
Return the poset corresponding to the lattice.
searching the database
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!