A note on M-convex functions on jump systems (Q2217499): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / reviewed by
 
Property / reviewed by: Juan-Enrique Martinez-Legaz / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Juan-Enrique Martinez-Legaz / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3090411163 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1907.06209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minconvex Factors of Prescribed Size in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithm and symmetric matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Concavity and the Half-Plane Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudomatroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some combinatorial properties of discriminants in metric vector spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy-algorithm characterization of valuated \(\Delta\)-matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\Delta\)-matroid and jump system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induction of M-convex functions by linking systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operations on M‐Convex Functions on Jump Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Cunningham's conjecture on restricted subgraphs and jump systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even factors, jump systems, and discrete convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The membership problem in jump systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Matching Forests and Valuated Delta-Matroids / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:01, 24 July 2024

scientific article
Language Label Description Also known as
English
A note on M-convex functions on jump systems
scientific article

    Statements

    A note on M-convex functions on jump systems (English)
    0 references
    0 references
    29 December 2020
    0 references
    Let \(x,y\in \mathbb{Z}^{n}\). A vector \(s\in \mathbb{Z}^{n}\) is said to be an \((x,y)\)-increment if either \(s\) or \(-s\) is one of the \(n\) unit vectors and \(x\wedge y\leq x+s\leq x\vee y\). Let \(f:\mathbb{Z}^{n}\rightarrow \mathbb{R\cup \{+\infty \}}\). One says that \(f\) is jump M-convex if for any \(x,y\in \mathrm{dom}~f\) and any \((x,y)\)-increment \(s\), there exists an \((x+s,y)\)-increment \(t\) such that \(x+s+t,~y-s-t\in \mathrm{dom}~f\) and \(f(x)+f(y)\geq f(x+s+t)+f(y-s-t)\). One says that \(f\) is jump M\(^{\sharp}\)-convex if for any \(x,y\in \mathrm{dom}~f\) and any \((x,y)\)-increment \(s\), one of the following two conditions holds: (i) \(x+s,~y-s\in \mathrm{dom}~f\), and \(f(x)+f(y)\geq f(x+s)+f(y-s)\), (ii) there exists an \((x+s,y)\)-increment \(t\) such that \(x+s+t,~y-s-t\in \mathrm{dom}~f\) and \(f(x)+f(y)\geq f(x+s+t)+f(y-s-t)\). For \(x\in \mathbb{Z}^{n}\), define \(\pi (x)=0\) if the component sum of \(x\) is even and \(\pi (x)=1\) otherwise. The main result states that \(f\) is jump M\(^{\sharp }\)-convex if and only if the function \(\widetilde{f}:\mathbb{Z}^{n+1}\rightarrow \mathbb{R\cup \{+\infty \}}\) defined by \(\widetilde{f}(x_{0},x)=f(x)\) if \(x_{0}=\pi (x)\) and \(\widetilde{f}(x_{0},x)=+\infty \) otherwise is jump M-convex.
    0 references
    0 references
    0 references
    0 references
    0 references
    discrete convex analysis
    0 references
    jump system
    0 references
    M-convex function
    0 references
    0 references
    0 references