Lattice-Valued Bottleneck Duality

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Ghrist, Robert, Gould, Julian, Lopez, Miguel
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866912053078261760
author Ghrist, Robert
Gould, Julian
Lopez, Miguel
author_facet Ghrist, Robert
Gould, Julian
Lopez, Miguel
contents This note reformulates certain classical combinatorial duality theorems in the context of order lattices. For source-target networks, we generalize bottleneck path-cut and flow-cut duality results to edges with capacities in a distributive lattice. For posets, we generalize a bottleneck version of Dilworth's theorem, again weighted in a distributive lattice. These results are applicable to a wide array of non-numerical network flow problems, as shown. All results, proofs, and applications were created in collaboration with AI language models. An appendix documents their role and impact.
format Preprint
id arxiv_https___arxiv_org_abs_2410_00315
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Lattice-Valued Bottleneck Duality
Ghrist, Robert
Gould, Julian
Lopez, Miguel
Optimization and Control
Combinatorics
06D05, 90C35, 06A07
This note reformulates certain classical combinatorial duality theorems in the context of order lattices. For source-target networks, we generalize bottleneck path-cut and flow-cut duality results to edges with capacities in a distributive lattice. For posets, we generalize a bottleneck version of Dilworth's theorem, again weighted in a distributive lattice. These results are applicable to a wide array of non-numerical network flow problems, as shown. All results, proofs, and applications were created in collaboration with AI language models. An appendix documents their role and impact.
title Lattice-Valued Bottleneck Duality
topic Optimization and Control
Combinatorics
06D05, 90C35, 06A07
url https://arxiv.org/abs/2410.00315