Quotients of M-convex sets and M-convex functions

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Brandenburg, Marie-Charlotte, Loho, Georg, Smith, Ben
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866909767208796160
author Brandenburg, Marie-Charlotte
Loho, Georg
Smith, Ben
author_facet Brandenburg, Marie-Charlotte
Loho, Georg
Smith, Ben
contents We unify the study of quotients of matroids, polymatroids, valuated matroids and strong maps of submodular functions in the framework of Murota's discrete convex analysis. As a main result, we compile a list of ten equivalent characterizations of quotients for M-convex sets, generalizing existing formulations for (poly)matroids and submodular functions. We also initiate the study of quotients of M-convex functions, constructing a hierarchy of four separate characterizations. Our investigations yield new insights into the fundamental operation of induction, as well as the structure of linking sets and linking functions, which are generalizations of linking systems and bimatroids.
format Preprint
id arxiv_https___arxiv_org_abs_2403_07751
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Quotients of M-convex sets and M-convex functions
Brandenburg, Marie-Charlotte
Loho, Georg
Smith, Ben
Combinatorics
Algebraic Geometry
Optimization and Control
05B35, 14T15, 52B20, 52B40 (Primary) 14M15, 90C25, 90C27 (Secondary)
We unify the study of quotients of matroids, polymatroids, valuated matroids and strong maps of submodular functions in the framework of Murota's discrete convex analysis. As a main result, we compile a list of ten equivalent characterizations of quotients for M-convex sets, generalizing existing formulations for (poly)matroids and submodular functions. We also initiate the study of quotients of M-convex functions, constructing a hierarchy of four separate characterizations. Our investigations yield new insights into the fundamental operation of induction, as well as the structure of linking sets and linking functions, which are generalizations of linking systems and bimatroids.
title Quotients of M-convex sets and M-convex functions
topic Combinatorics
Algebraic Geometry
Optimization and Control
05B35, 14T15, 52B20, 52B40 (Primary) 14M15, 90C25, 90C27 (Secondary)
url https://arxiv.org/abs/2403.07751