Related papers: Attempting the impossible: enumerating extremal su…
The paper presents two algorithms for finding irreducible decomposition of monomial ideals. The first one is recursive, derived from staircase structures of monomial ideals. This algorithm has a good performance for highly non-generic…
This research paper introduces two new constraint types and four subtypes of database constraints added to our (Elementary) Mathematical Data Model, which are the duals of the existence and non-existence ones. They are formally defined,…
Extremal functions for the $n$th coefficient in the Krzy\.z conjecture are atomic singular inner functions with at most $n$ atoms. This paper gives a lower bound on the number of atoms $N$ of the form $N\geq cn$, marking progress toward…
We establish formulas for the number of all downsets (or equivalently, of all antichains) of a finite poset P. Then, using these numbers, we determine recursively and explicitly the number of all posets having a fixed set of minimal points…
An additive 2-basis with range n is restricted if its largest element is n/2. Among the restricted 2-bases of given length k, the ones that have the greatest range are extremal restricted. We describe an algorithm that finds the extremal…
In this paper, we define finitely additive, probability and modular functions over semiring-like structures. We investigate finitely additive functions with the help of complemented elements of a semiring. We also generalize some classical…
We study Fuglede's $p$-module of systems of measures in condensers in Euclidean spaces and on polarizable Carnot groups. We apply and generalize a result by Rodin, which provides an explicit method for finding the extremal function and the…
The problem of maximizing non-negative submodular functions has been studied extensively in the last few years. However, most papers consider submodular set functions. Recently, several advances have been made for the more general case of…
A multidimensional extremal problem in the idempotent algebra setting is considered which consists in minimizing a nonlinear functional defined on a finite-dimensional semimodule over an idempotent semifield. The problem integrates two…
Submodular function minimization is well studied, and existing algorithms solve it exactly or up to arbitrary accuracy. However, in many applications, such as structured sparse learning or batch Bayesian optimization, the objective function…
We study the problem of ranking with submodular valuations. An instance of this problem consists of a ground set $[m]$, and a collection of $n$ monotone submodular set functions $f^1, \ldots, f^n$, where each $f^i: 2^{[m]} \to R_+$. An…
We study an abstract setting for cutting planes for integer programming called the infinite group problem. In this abstraction, cutting planes are computed via cut generating function that act on the simplex tableau. In this function space,…
Submodular optimization generalizes many classic problems in combinatorial optimization and has recently found a wide range of applications in machine learning (e.g., feature engineering and active learning). For many large-scale…
We study the problem of maximizing a function that is approximately submodular under a cardinality constraint. Approximate submodularity implicitly appears in a wide range of applications as in many cases errors in evaluation of a…
Submodular functions are an important class of functions in combinatorial optimization which satisfy the natural properties of decreasing marginal costs. The study of these functions has led to strong structural properties with applications…
We consider the Rosenfeld-Groebner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials…
Submodular functions and variants, through their ability to characterize diversity and coverage, have emerged as a key tool for data selection and summarization. Many recent approaches to learn submodular functions suffer from limited…
We present a modular function-based approach to explaining, for primes larger than 3, the exponents that appear in the prime decomposition of the order of the monster finite simple group.
We extend the shell and kernel reductions for hyperexponential functions over the field of rational functions to a monomial extension. Both of the reductions are incorporated into one algorithm. As an application, we present an additive…
We study problems related to indecomposability of modules over certain local finite dimensional trivial extension algebras. We do this by purely combinatorial methods. We introduce the concepts of graph of cyclic modules, of combinatorial…