Related papers: Quasi-concave functions on antimatroids

The problem of maximizing a constrained monotone set function has many practical applications and generalizes many combinatorial problems. Unfortunately, it is generally not possible to maximize a monotone set function up to an acceptable…

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…

We investigate relations among Schur multiple zeta functions and zeta-functions of root systems attached to semisimple Lie algebras. Schur multiple zeta functions are defined as sums over semi-standard Young tableaux. Then, assuming the…

We give a short discussion about a weaker form of minimality (called quasi-minimality). We call a system quasi-minimal if all dense orbits form an open set. It is hard to find examples which are not already minimal. Since elliptic behaviour…

Binary functions are a generalisation of the cocircuit spaces of binary matroids to arbitrary functions. Every rank function is assigned a binary function, and the deletion and contraction operations of binary functions generalise matroid…

The theory of uninterpreted functions is a key modeling tool for systems with unknown or abstracted components. Some domains such as systems biology impose further restrictions regarding monotonicity on these components, requiring specific…

Linking systems are crucial for studying the homotopy theory of fusion systems, but are also of interest from an algebraic point of view. We propose a definition of a linking system associated to a saturated fusion system which is more…

In this study, after given the definition of soft sets and their basic operations we define convex soft sets which is an important concept for operation research, optimization and related problems. Then, we define concave soft sets and give…

A basic property in a modular lattice is that any two flags generate a distributive sublattice. It is shown (Abels 1991, Herscovic 1998) that two flags in a semimodular lattice no longer generate such a good sublattice, whereas shortest…

Based on the notion of vectors and linear subspaces for a matroid, we develop a theory of flats and hyperplane arrangements for T-matroids, where T is a tract. This leads to several cryptomorphic descriptions of T-matroids: in terms of its…

The submodular partitioning problem asks to minimize, over all partitions $P$ of a ground set $V$, the sum of a given submodular function $f$ over the parts of $P$. The problem has seen considerable work in approximability, as it…

This paper deals with approximate solutions of a nonsmooth semi-infinite programming with multiple interval-valued objective functions. We first introduce four types of approximate quasi Pareto solutions of the considered problem by…

The subject is the overview of the use of quasi-entropy in finite dimensional spaces. Matrix monotone functions and relative modular operators are used. The origin is the relative entropy and the f-divergence, monotone metrics, covariance…

Functions with uniform sublevel sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used in multicriteria optimization, decision theory, mathematical…

Crystal graphs are powerful combinatorial tools for working with the plactic monoid and symmetric functions. Quasi-crystal graphs are an analogous concept for the hypoplactic monoid and quasi-symmetric functions. This paper makes a…

By reformulating a learning process of a set system L as a game between Teacher (presenter of data) and Learner (updater of the abstract independent set), we define the order type dim L of L to be the order type of the game tree. The theory…

Submodular functions have many applications. Matchings have many applications. The bitext word alignment problem can be modeled as the problem of maximizing a nonnegative, monotone, submodular function constrained to matchings in a complete…

We introduce characteristic functions for certain contractive liftings of row contractions. These are multi-analytic operators which classify the liftings up to unitary equivalence and provide a kind of functional model. The most important…

Quadratic-support functions [Aravkin, Burke, and Pillonetto; J. Mach. Learn. Res. 14(1), 2013] constitute a parametric family of convex functions that includes a range of useful regularization terms found in applications of convex…

We study properties of action-minimizing invariant sets for Tonelli Lagrangian and Hamiltonian systems and weak KAM solutions to the Hamilton-Jacobi equation in terms of Mather's averaging functions. Our principal discovery is that exposed…