Skip to main content
Log in

Discrete 2-convex functions

  • Full Length Paper
  • Series A
  • Published:
Mathematical Programming Submit manuscript

Abstract

We focus on a new class of integrally convex functions which we call discrete 2-convex functions. Discrete 2-convexity generalizes known classes of integrally convex functions such as the well-established M-/M\({}^\natural \)-convex and L-/L\({}^\natural \)-convex functions by Murota et al., the recently investigated globally/locally discrete midpoint convex functions by Moriguchi, Murota, Tamura, and Tardella, the directed discrete midpoint convex functions by Tamura and Tsurumi, and BS\({}^*\)-convex and UJ-convex functions by one of the authors. We provide a unifying view of all these functions within the class of integrally convex functions having discrete 2-convexity. We also introduce a new subclass of discrete 2-convex functions, called signed discrete 2-convex functions and we consider signed discrete 2-convex functions with a locally hereditary orientation property. We show that parallelogram inequalities, scalability, and proximity hold for such signed discrete 2-convex functions, which include globally/locally discrete midpoint convex functions and directed discrete midpoint convex functions. Hence, our results extend similar results recently established by Moriguchi, Murota, Tamura, and Tardella and by Tamura and Tsurumi.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Notes

  1. It is mentioned in [17] that the concept of directed discrete midpoint convexity was suggested by Fabio Tardella.

  2. The extension of a function f on \({\mathbb {Z}}^n\) based on the simplicial division \(\mathcal S\) is a piecewise affine function on \({\mathbb {R}}^n\) obtained by interpolating f affinely on each simplex in \(\mathcal S\).

  3. For example, if \(A_k\cap S^+=\emptyset \) for some \(k\in [m]\), then \(A_{k'}\cap S^+=\emptyset \) for all \(k'\) such that \(k\le k'\le m\). Also we may have \(A_k\cap S^+=A_{k'}\cap S^+\) for some distinct \(k, k'\in [m]\).

References

  1. Beckenbach, E.F.: Convex functions. Bulletin American Mathematical Society 54, 439–460 (1948)

    Article  Google Scholar 

  2. Dress, A.W., Wenzel, W.: Valuated matroids: A new look at the greedy algorithm. Appl. Math. Lett. 3, 33–35 (1990)

    Article  MathSciNet  Google Scholar 

  3. Dress, A.W., Wenzel, W.: Valuated matroids. Adv. Math. 93, 214–250 (1992)

    Article  MathSciNet  Google Scholar 

  4. Favati, P., Tardella, F.: Convexity in nonlinear integer programming. Ricerca Operativa 53, 3–44 (1990)

    Google Scholar 

  5. Fujishige, S.: Submodular Functions and Optimization, 2nd edn. Elsevier (2005)

  6. Fujishige, S.: Bisubmodular polyhedra, simplicial divisions, and discrete convexity. Discret.eOptim. 12, 115–120 (2014)

    Article  MathSciNet  Google Scholar 

  7. Fujishige, S.: Greedy systems of linear inequalities and lexicographically optimal solutions. RAIRO Operations Research 53, 1929–1935 (2019)

    Article  MathSciNet  Google Scholar 

  8. Fujishige, S., Murota, K.: Notes on L-/M-convex functions and the separation theorems. Math. Program. 88, 129–146 (2000)

    Article  MathSciNet  Google Scholar 

  9. Jensen, J.L.W.V.: Om konvekse Funktioner og Uligheder imellem Middelværdier. Math. Scand.16B, 49–68 (1905). Also: Sur les fonctions convexes et les inégalités entre les valeurs moyennes. Acta Math.30, 175–193 (1906)

  10. Lovász, L.: Submodular functions and convexity. In: A. Bachem, M. Grötschel, B. Korte, (ed.) Mathematical Programming-The State of the Art, pp. 235–257. Springer, Berlin (1983)

    Chapter  Google Scholar 

  11. Moriguchi, S., Murota, K., Tamura, A., Tardella, F.: Scaling, proximity, and optimization of integrally convex functions. Math. Program. Ser. A 175, 119–154 (2019)

    Article  MathSciNet  Google Scholar 

  12. Moriguchi, S., Murota, K., Tamura, A., Tardella, F.: Discrete midpoint convexity. Math. Oper. Res. 45, 99–128 (2020)

    Article  MathSciNet  Google Scholar 

  13. Murota, K.: Discrete Convex Analysis. SIAM, Philadelphia (2003)

    Book  Google Scholar 

  14. Murota, K.: Discrete convex analysis: A tool for economics and game theory. Journal of Mechanism and Institution Design 1, 151–273 (2016)

    Google Scholar 

  15. Murota, K., Shioura, A.: M-convex function on generalized polymatroid. Math. Oper. Res. 24, 95–105 (1999)

    Article  MathSciNet  Google Scholar 

  16. Shioura, A., Tamura, A.: Gross substitutes condition and discrete concavity for multi-unit valuations: a survey. Journal of the Operations Research Society of Japan 58, 61–103 (2015)

    MathSciNet  MATH  Google Scholar 

  17. Tamura, A., Tsurumi, K.: Directed discrete midpoint convexity. Jpn. J. Ind. Appl. Math. 38, 1–37 (2021)

    Article  MathSciNet  Google Scholar 

  18. Thomson, B.: Symmetric Properties of Real Functions. Marcel Dekker, New York (1994)

    MATH  Google Scholar 

Download references

Acknowledgements

We are grateful to the two anonymous reviewers for their useful comments which helped us to find some errors and improved the presentation of our paper. S. Fujiishige’s work was supported by the Research Institute for Mathematical Sciences, an International Joint Usage/Research Center located in Kyoto University.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Satoru Fujishige.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

S. Fujishige’s work is supported by JSPS KAKENHI Grant Number JP19K11839.

Signed decomposition

Signed decomposition

For any given \(x, y\in {\mathbb {Z}}^n\) put \(z=x-y\). Suppose that we are given a sign function \(\sigma : [n]\rightarrow \{+,-\}\). According to (19) and (20) we have

$$\begin{aligned} S=\{i\in [n]\mid z(i)>0\},\qquad T=\{i\in [n]\mid z(i)<0\}, \end{aligned}$$
(52)

and

$$\begin{aligned}&S^+=\{i\in S\mid \sigma (i)=+\},\ \ S^-=\{i\in S\mid \sigma (i)=-\}, \nonumber \\&T^+=\{i\in T\mid \sigma (i)=+\},\ \ T^-=\{i\in T\mid \sigma (i)=-\}. \end{aligned}$$
(53)

Without loss of generality suppose that \(m\equiv \max \{|z(i)|\mid i\in [n]\}\ge 1\) and \(S\cup T=[n]\).

The way of decomposing z with respect to \(\sigma \) is determined by the disjoint subsets \(S^+\), \(S^-\), \(T^-\), and \(T^+\) of [n] as follows. Note that \(A_i\) and \(B_i\) appearing in (21)–(29) can be expressed as \(A_i=A_i^+\cup A_i^-\) and \(B_i=B_i^+\cup B_i^-\) in terms of \(A_i^+, A_i^-, B_i^+, B_i^-\) defined below.

(Case \(S^+\)): For each \(i\in [m]\) define \(A^{+}_i\subseteq S^{+}\) by

$$\begin{aligned} {A^{+}_i}=\{k\in S^{+}\mid i\le z(k)\}\qquad (i\in [m]). \end{aligned}$$
(54)

Then we have a non-increasing sequence of subsets \(A^+_i\) \((i\in [m])\) of \(S^+\) as follows.

$$\begin{aligned} S^+\supseteq A^{+}_1\supseteq A^{+}_2\supseteq \cdots \supseteq A^{+}_m. \end{aligned}$$
(55)

Hence if \(A^{+}_k=\emptyset \) for some \(k\in [m]\), then \(A^{+}_\ell =\emptyset \) for all \(\ell \in [k,m]\). Note that we have

$$\begin{aligned} z^{S^+}=\sum _{i\in [m]}\chi _{A_i^{+}}, \end{aligned}$$
(56)

where \(z^{S^+}\) is the restriction of z on \(S^+\) and we regard \(\chi _{A_i^{+}}\) as the characteristic vector of a subset of \(S^+\). Recall that the expression of \(z^{S^+}\) as (56) with the non-increasing sequence (55) of subsets of \(S^+\) is essentially the well-known expression (or the decomposition) of vectors appearing in Edmonds’ greedy algorithm or the Lovász extension of set functions (or the Choquet integral) (see, e.g., [5]). Here the decomposition is expressed by the use of m characteristic vectors of sets \(A^+_i\) \((i\in [m])\) with possible repetitions. This makes it easy to obtain the expression of the components \(\chi _{A_i}-\chi _{B_i}\) \((i\in [m])\) of the signed decomposition (21) of \(z=x-y\) by pasting the components, one for each of \(z^{S^+}\), \(z^{S^-}\), \(z^{T^-}\), and \(z^{T^+}\), together as will be seen below.

(Case \(S^-\)): For each \(i\in [m]\) define \(A^{-}_i\subseteq S^{-}\) by

$$\begin{aligned} {A^{-}_i}=\{k\in S^{-}\mid m-i+1\le z(k)\}\qquad (i\in [m]). \end{aligned}$$
(57)

Then we have a non-decreasing sequence of subsets \(A^-_i\) \((i\in [m])\) of \(S^-\) as follows.

$$\begin{aligned} A^{-}_1\subseteq A^{-}_2\subseteq \cdots \subseteq A^{-}_m\subseteq S^-. \end{aligned}$$
(58)

Hence if \(A^{-}_k=\emptyset \) for some \(k\in [m]\), then \(A^{-}_\ell =\emptyset \) for all \(\ell \in [k]\). Note that we have

$$\begin{aligned} z^{S^-}=\sum _{i\in [m]}\chi _{A_i^{-}}, \end{aligned}$$
(59)

where \(z^{S^-}\) is the restriction of z on \(S^-\) and we regard \(\chi _{A_i^{-}}\) as the characteristic vector of a subset of \(S^-\). It should be noted that the ways of determining the sequences \(A^+_i\) \((i\in [m])\) in (54) and \(A^-_i\) \((i\in [m])\) in (57) are the same except for the indexing: i for \(A^+_i\) corresponds to \(m-i+1\) for \(A^-_i\).

(Case \(T^-\)): For each \(i\in [m]\) define \(B^{-}_i\subseteq T^{-}\) by

$$\begin{aligned} {B^{-}_i}=\{k\in T^{-}\mid z(k)\le -i\}\qquad (i\in [m]). \end{aligned}$$
(60)

Then we have a non-increasing sequence of subsets of \(T^-\) as follows.

$$\begin{aligned} T^-\supseteq B^{-}_1\supseteq B^{-}_2\supseteq \cdots \supseteq B^{-}_m. \end{aligned}$$
(61)

Hence if \(B^{-}_k=\emptyset \) for some \(k\in [m]\), then \(B^-_\ell =\emptyset \) for all \(\ell \in [k,m]\). Note that we have

$$\begin{aligned} z^{T^-}=-\sum _{i\in [m]}\chi _{B_i^{-}}, \end{aligned}$$
(62)

where \(z^{T^-}\) is the restriction of z on \(T^-\) and we regard \(\chi _{B_i^{-}}\) as the characteristic vector of a subset of \(T^-\). It should be noted that the negative of the expression (62) corresponds to the expression (56) for \(-z^{T^-}\) in (Case \(S^+\)) by interchanging the roles of \(S^+\) and \(T^-\).

(Case \(T^+\)): For each \(i\in [m]\) define \(B^{+}_i\subseteq T^{+}\) by

$$\begin{aligned} {B^{+}_i}=\{k\in T^{+}\mid z(k)\le -m+i-1\}\qquad (i\in [m]). \end{aligned}$$
(63)

Then we have a non-decreasing sequence of subsets \(B^+_i\) \((i\in [m])\) of \(T^+\) as follows.

$$\begin{aligned} B^{+}_1\subseteq B^{+}_2\subseteq \cdots \subseteq B^{+}_m\subseteq T^+. \end{aligned}$$
(64)

Hence if \(B^{+}_k=\emptyset \) for some \(k\in [m]\), then \(B^{+}_\ell =\emptyset \) for all \(\ell \in [k]\). Note that we have

$$\begin{aligned} z^{T^+}=-\sum _{i\in [m]}\chi _{B_i^{+}}, \end{aligned}$$
(65)

where \(z^{T^+}\) is the restriction of z on \(T^+\) and we regard \(\chi _{B_i^{+}}\) as the characteristic vector of a subset of \(T^+\). It should be noted that the negative of the expression (65) corresponds to the expression (59) for \(-z^{T^+}\) in (Case \(S^-\)) by interchanging the roles of \(S^-\) and \(T^+\).

Now the direct sum of \(z^{S^+}\), \(z^{S^-}\), \(z^{T^-}\), and \(z^{T^+}\) gives us the expression (21) of the signed decomposition of \(z=x-y\) as follows.

$$\begin{aligned} z= & {} z^{S^+}\oplus z^{S^-}\oplus z^{T^-}\oplus z^{T^+} =\sum _{i\in [m]}\chi _{A^+_i}\oplus \chi _{A^-_i}\oplus (-\chi _{B^-_i})\oplus (-\chi _{B^+_i})\nonumber \\= & {} \sum _{i\in [m]}(\chi _{A_i}-\chi _{B_i}), \end{aligned}$$
(66)

where recall (21)–(29) and note that \(A_i=A^+_i\cup A^-_i\) and \(B_i=B^+_i\cup B^-_i\) (disjoint unions) for \(i\in [m]\). It should be noted that the way of indexing i plays a crucial role in pasting \(\chi _{A^+_i}\), \(\chi _{A^-_i}\), \(-\chi _{B^-_i}\), and \(-\chi _{B^+_i}\) together for each \(i\in [m]\) to obtain the signed decomposition of z with respect to the given sign function \(\sigma \), as (66).

Example: Consider \(x, y\in {\mathbb {Z}}^5\) such that \(x-y=(1,-2,1,2,-1)\) and \(\sigma =(+,+,+,-,-)\). Then we have \(m=2\) and

$$\begin{aligned} S= & {} \{1,3,4\}, \quad T=\{2,5\},\\ S^+= & {} \{1,3\}, \quad S^-=\{4\},\quad T^+=\{2\},\quad T^-=\{5\},\\ A_1^+= & {} \{1,3\},\quad A_2^+=\emptyset ,\quad A_1^-=A_2^-=\{4\},\\ B_1^+= & {} B_2^+=\{2\},\quad B_1^-=\{5\},\quad B_2^-=\emptyset ,\\ A_1= & {} A_1^+\cup A_1^-=\{1,3,4\},\quad B_1=B_1^+\cup B_1^-=\{2,5\},\\ A_2= & {} A_2^+\cup A_2^-=\{4\},\quad B_2=B_2^+\cup B_2^-=\{2\}. \end{aligned}$$

Hence we obtain the signed decomposition of \(z=x-y\) as

$$\begin{aligned} z=\sum _{i=1}^2(\chi _{A_i}-\chi _{B_i})=(1,-1,1,1,-1)+(0,-1,0,1,0). \end{aligned}$$

\(\square \)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Fujishige, S., Tardella, F. Discrete 2-convex functions. Math. Program. 195, 831–854 (2022). https://doi.org/10.1007/s10107-021-01717-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-021-01717-z

Keywords

Mathematics Subject Classification

Navigation