相关论文: Quotients of M-convex sets and M-convex functions

Integrally convex functions constitute a fundamental function class in discrete convex analysis, including M-convex functions, L-convex functions, and many others. This paper aims at a rather comprehensive survey of recent results on…

Murota (1998) and Murota and Shioura (1999) introduced concepts of M-convex function and M${}^\natural$-convex function as discrete convex functions, which are generalizations of valuated matroids due to Dress and Wenzel (1992). In the…

We introduce the concept of quotient-convergence for sequences of submodular set functions, providing, among others, a new framework for the study of convergence of matroids through their rank functions. Extending the limit theory of…

Recently, several proofs of the Mason--Welsh conjecture for matroids have been found, which asserts the log-concavity of the sequence that counts independent sets of a given size. In this article we use the theory of Lorentzian polynomials,…

We primarily investigate the properties of characteristic polynomials of semimatroids. In particular, we provide a combinatorial interpretation of their coefficients, generalizing the Whitney's Broken Circuit Theorem. We also prove that the…

We develop certain combinatorial tools for the study of discriminants of general systems of polynomial equations. Applying these tools in a sequel paper, we completely classify components of such discriminants, generalizing the classical…

Rough sets are efficient for data pre-processing in data mining. As a generalization of the linear independence in vector spaces, matroids provide well-established platforms for greedy algorithms. In this paper, we apply rough sets to…

M-convex functions, which are a generalization of valuated matroids, play a central role in discrete convex analysis. Quadratic M-convex functions constitute a basic and important subclass of M-convex functions, which has a close…

To every subspace arrangement X we will associate symmetric functions P[X] and H[X]. These symmetric functions encode the Hilbert series and the minimal projective resolution of the product ideal associated to the subspace arrangement. They…

Discrete convex functions are used in many areas, including operations research, discrete-event systems, game theory, and economics. The objective of this paper is to offer a survey on fundamental operations for various kinds of discrete…

The topological zeta function of a matroid is a rational function as well as a valuative invariant of the matroid, encoding rich combinatorial information. We analyze topological zeta functions of matroids from the vantage point of several…

Finite matroids are combinatorial structures that express the concept of linear independence. In 1964, G.-C. Rota conjectured that the coefficients of the "characteristic polynomial" of a matroid $M$, polynomial whose coefficients enumerate…

We associate to every matroid M a polynomial with integer coefficients, which we call the Kazhdan-Lusztig polynomial of M, in analogy with Kazhdan-Lusztig polynomials in representation theory. We conjecture that the coefficients are always…

In discrete convex analysis, various convexity concepts are considered for discrete functions such as separable convexity, L-convexity, M-convexity, integral convexity, and multimodularity. These concepts of discrete convex functions are…

In the present work we explore relationships between multiplicative functions defined in \cite{Garonzi_2018}, \cite{Lazorec}. To do so, we use other important quotients defined and studied in \cite{ndeg}, \cite{Marius}, thus establishing…

This is a survey article on the exchange properties characterizing M-natural-concave set functions and valuated matroids (M-concave set functions). The objective of this paper is to collect related results scattered in the literature and to…

In this paper we consider quasi-concave set functions defined on antimatroids. There are many equivalent axiomatizations of antimatroids, that may be separated into two categories: antimatroids defined as set systems and antimatroids…

For two matroids $M_1$ and $M_2$ with the same ground set $V$ and two cost functions $w_1$ and $w_2$ on $2^V$, we consider the problem of finding bases $X_1$ of $M_1$ and $X_2$ of $M_2$ minimizing $w_1(X_1)+w_2(X_2)$ subject to a certain…

A recent line of research has concentrated on exploring the links between analytic and combinatorial theories of submodularity, uncovering several key connections between them. In this context, Lov\'asz initiated the study of matroids from…

We study an operation in matroid theory that allows one to transition a given matroid into another with more bases via relaxing a \emph{stressed subset}. This framework provides a new combinatorial characterization of the class of split…