Related papers: Minor-closed classes of binary functions
We introduce a new class of functions that can be minimized in polynomial time in the value oracle model. These are functions $f$ satisfying $f(x)+f(y)\ge f(x \sqcap y)+f(x \sqcup y)$ where the domain of each variable $x_i$ corresponds to…
The class of 2-regular matroids is a natural generalisation of regular and near-regular matroids. We prove an excluded-minor characterisation for the class of 2-regular matroids. The class of 3-regular matroids coincides with the class of…
Given a sequence of distinct positive integers $w_0 , w_1, w_2, \ldots$ and any positive integer $n$, we define the discriminator function $\mathcal{D}_{\bf w}(n)$ to be the smallest positive integer $m$ such that $w_0,\ldots, w_{n-1}$ are…
We consider minimization problems with bisubmodular objective functions. We propose valid inequalities, namely the poly-bimatroid inequalities, and provide a complete linear description of the convex hull of the epigraph of a bisubmodular…
Minimal thinness is a notion that describes the smallness of a set at a boundary point. In this paper, we provide tests for minimal thinness for a large class of subordinate killed Brownian motions in bounded C1,1 domains, C1,1 domains with…
In this paper we present a new class of complexity measures, induced by a new data structure for representing $k$-valued functions (operations), called minor decision diagram. The results are presented in terms of Multi-Valued Logic…
We develop a systematic algorithmic framework that unites global and local classification problems using index sets. We prove that the classification problem for continuous (binary) regular functions among almost everywhere linear,…
We give tight bounds on the relation between the primal and dual of various combinatorial dimensions, such as the pseudo-dimension and fat-shattering dimension, for multi-valued function classes. These dimensional notions play an important…
Not every positive functional defined on bi-variate polynomials of a prescribed degree bound is represented by the integration against a positive measure. We isolate a couple of conditions filling this gap, either by restricting the class…
The main result is that: function descriptions are not made equal, and they can be categorised in at least two categories using various computational methods for function evaluation. The result affects Kolmogorov complexity and Random…
A characterization of multiplicative (and additive) arithmetical functions is given. Using this characterization, we show that the group of multiplicative arithmetical functions is isomorphic to the group of additive arithmetical functions.
We prove that if $X$ is a paracompact space, $Y$ is a metric space and $f:X\to Y$ is a functionally fragmented map, then (i) $f$ is $\sigma$-discrete and functionally $F_\sigma$-measurable; (ii) $f$ is a Baire-one function, if $Y$ is weak…
This article summarises the theory of several bounded functional calculi for unbounded operators that have recently been discovered. The extend the Hille--Phillips calculus for (negative) generators $A$ of certain bounded $C_0$-semigroups,…
An $n$-ary associative function is called reducible if it can be written as a composition of a binary associative function. We summarize known results when the function is defined on a chain and is nondecreasing. Our main result shows that…
Mathematical programming is a branch of applied mathematics and has recently been used to derive new decoding approaches, challenging established but often heuristic algorithms based on iterative message passing. Concepts from mathematical…
We introduce a connectivity function for infinite matroids with properties similar to the connectivity function of a finite matroid, such as submodularity and invariance under duality. As an application we use it to extend Tutte's linking…
The class of Basic Feasible Functionals BFF is the second-order counterpart of the class of first-order functions computable in polynomial time. We present several implicit characterizations of BFF based on a typed programming language of…
Submodular set-functions have many applications in combinatorial optimization, as they can be minimized and approximately maximized in polynomial time. A key element in many of the algorithms and analyses is the possibility of extending the…
Dillon-like Boolean functions are known, in the literature, to be those trace polynomial functions from $\mathbb{F}_{2^{2n}}$ to $\mathbb{F}_{2}$, with all the exponents being multiples of $2^n-1$ often called Dillon-like exponents. This…
The study of convex functions - in particular, of their optimization (really minimization) is one of the most important fields of applied mathematics. Convexity seems to be one of those incredibly well-chosen hypotheses which is just…