Metaticket: Enhancements for posets and lattices

[jm58660]

This is metaticket to be a place for random things to add for finite posets and lattices.

New functions

• From Poset documentation polishing: chains and antichains #18941: Add possibility to check if a list is a saturated chain of a poset. (Done: Poset is_chain_of_poset(): error checking and saturated-keyword #20494)
• Add is_eulerian(). (Done: Posets: Add is_eulerian #19697)
• Add a function to generate random lattice.

Poset catalog

• Add "standar example" (poset of 2n elements with dimension n). (Done: Add "Standard example" poset #19690)
• Add divisor lattice. (LatticePoset: add DivisorLattice(n) #20272)

Other

• Think about ceritificate-options. Should for example is_meet_semilattice() return a pair of elements without a meet?

Minor bugs

• is_supersolvable gives error on empty lattice. (LatticePoset: trivial additions #20274)

CC: @kevindilks @tscrim

Component: combinatorics

Issue created by migration from https://trac.sagemath.org/ticket/19323

[jm58660]

comment:6

Travis: I think that after #20495 I have done what I have had in mind.

Do you have something bigger planned? If not, please click this to posivite_review.

[tscrim]

comment:7

Since there seems to be no other large-scale plans for posets/lattices, then this be a positive review.