English

Pruning a poset with veins

Discrete Mathematics 2013-01-07 v1 Combinatorics

Abstract

We recall some abstract connectivity concepts, and apply them to special chains in partially ordered sets, called veins, that are defined as order-convex chains that are contained in every maximal chain they meet. Veins enable us to define a new partial order on the same underlying set, called the pruning order. The associated pruned poset is simpler than the initial poset, but irreducible, coirreducible, and doubly-irreducible elements are preserved by the operation of pruning.

Cite

@article{arxiv.1301.0759,
  title  = {Pruning a poset with veins},
  author = {Paul Poncet},
  journal= {arXiv preprint arXiv:1301.0759},
  year   = {2013}
}

Comments

8 pages

R2 v1 2026-06-21T23:04:02.966Z