Maximum antichains in posets of quiver representations

HIGHLIGHTS

  • who: Florian Gellert from the Faculty of, Bielefeld University, , Bielefeld, Germany have published the paper: Maximum antichains in posets of quiver representations, in the Journal: (JOURNAL)
  • what: And as before, the authors provide a chain decomposition of the entire poset to show that it is also maximum.

SUMMARY

    Two elements a, b ∈ P are called incomparable if neither a ≤ b nor b ≤ a holds. Note that the elements of a chain can be ordered to form a sequence (a1 ≤ a2 ≤ · · · ≤ ak ) and the authors will often use this notation to describe . . .

     

    Logo ScioWire Beta black

    If you want to have access to all the content you need to log in!

    Thanks :)

    If you don't have an account, you can create one here.

     

Scroll to Top

Add A Knowledge Base Question !

+ = Verify Human or Spambot ?