Related papers: Minor-closed classes of binary functions
We shed some new light to the problem of characterizing those functions of several arguments that have a unique identification minor. The 2-set-transitive functions are known to have this property. We describe another class of functions…
A set $S\subseteq 2^E$ of subsets of a finite set $E$ is \emph{powerful} if, for all $X\subseteq E$, the number of subsets of $X$ in $S$ is a power of 2. Each powerful set is associated with a non-negative integer valued function, which we…
Classes of functions of several variables on arbitrary non-empty domains that are closed under permutation of variables and addition of dummy variables are characterized in terms of generalized constraints, and hereby Hellerstein's Galois…
For a class of functions (called minimal Rad\'o functions) that arise naturally in minimal surface theory, we bound the number of interior critical points (counting multiplicity) in terms of the boundary data and the Euler characteristic of…
Thin sums matroids were introduced to extend the notion of representability to non-finitary matroids. We give a new criterion for testing when the thin sums construction gives a matroid. We show that thin sums matroids over thin families…
A class of spherical functions is studied which can be viewed as the matrix generalization of Bessel functions. We derive a recursive structure for these functions. We show that they are only special cases of more general radial functions…
Entropy functionals (i.e. convex integral functionals) and extensions of these functionals are minimized on convex sets. This paper is aimed at reducing as much as possible the assumptions on the constraint set. Dual equalities and…
We give a new characterization of the Baire class 1 functions (defined on an ultrametric space) by proving that they are exactly the pointwise limits of sequences of full functions (which are particularly simple Lipschitz functions).…
Bi-objective optimization problems on matroids are in general intractable and their corresponding decision problems are in general NP-hard. However, if one of the objective functions is restricted to binary cost coefficients the problem…
The growth-rate function for a minor-closed class $\mathcal{M}$ of matroids is the function $h$ where, for each non-negative integer $r$, $h(r)$ is the maximum number of elements of a simple matroid in $\mathcal{M}$ with rank at most $r$.…
A compression function is a map that slims down an observational set into a subset of reduced size, while preserving its informational content. In multiple applications, the condition that one new observation makes the compressed set change…
A clonoid is a set of finitary functions from a set $A$ to a set $B$ that is closed under taking minors. Hence clonoids are generalizations of clones. By a classical result of Post, there are only countably many clones on a 2-element set.…
A parking function is a function $\pi:[n]\to [n]$ whose $i$th-smallest output is at most $i,$ corresponding to a parking procedure for $n$ cars on a one-way street. We refine this concept by introducing preference-restricted parking…
A new class of functions with a unique identification minor is introduced: functions determined by content and singletons. Relationships between this class with other known classes of functions with a unique identification minor are…
Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…
We find the excluded minors for the minor-closed class of lattice path polymatroids as a subclass of the minor-closed class of Boolean polymatroids. Like lattice path matroids and Boolean polymatroids, there are infinitely many excluded…
Submodular Functions are a special class of set functions, which generalize several information-theoretic quantities such as entropy and mutual information [1]. Submodular functions have subgradients and subdifferentials [2] and admit…
Zaslavsky introduced the concept of lifted-graphic matroid. For binary matroids, a binary elementary lift can be defined in terms of the splitting operation. In this paper, we give a method to get a forbidden-minor characterization for the…
Generalised definitions of exponential, trigonometric sine and cosine and hyperbolic sine and cosine functions are given. In the lowest order, these functions correspond to ordinary exponential, trigonometric sine etc. Some of the…
Submodular set functions are undoubtedly among the most important building blocks of combinatorial optimization. Somewhat surprisingly, continuous counterparts of such functions have also appeared in an analytic line of research where they…