Related papers: Monotone and Separable Set Functions: Characteriza…
Scaling-invariant functions preserve the order of points when the points are scaled by the same positive scalar (with respect to a unique reference point). Composites of strictly monotonic functions with positively homogeneous functions are…
We propose monotone comparative statics results for maximizers of submodular functions, as opposed to maximizers of supermodular functions as in the classical theory put forth by Veinott, Topkis, Milgrom, and Shannon among others. We…
Model merging has recently emerged as a lightweight alternative to ensembling, combining multiple fine-tuned models into a single set of parameters with no additional training overhead. Yet, existing merging methods fall short of matching…
Recent work on the representation of functions on sets has considered the use of summation in a latent space to enforce permutation invariance. In particular, it has been conjectured that the dimension of this latent space may remain fixed…
A natural connection between rational functions of several real or complex variables, and subspace collections is explored. A new class of function, superfunctions, are introduced which are the counterpart to functions at the level of…
We define the supermodular rank of a function on a lattice. This is the smallest number of terms needed to decompose it into a sum of supermodular functions. The supermodular summands are defined with respect to different partial orders. We…
A finite subset $M \subset \mathbb{R}^d$ is basic, if for any function $f \colon M \to \mathbb{R}$ there exists a collection of functions $f_1, \ldots, f_d \colon \mathbb{R} \to \mathbb{R}$ such that for each element $(x_1, \ldots, x_d)\in…
In this paper, we introduce concepts of separable functions in balls and in the whole space, and develop a new method to investigate the qualitative properties of separable functions. We first study the axial symmetry and monotonicity 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…
We will study some important properties of Boolean functions based on newly introduced concepts called Special Decomposition of a Set and Special Covering of a Set. These concepts enable us to study important problems concerning Boolean…
Mixed-monotone systems are separable via a decomposition function into increasing and decreasing components, and this decomposition function allows for embedding the system dynamics in a higher-order monotone embedding system. Embedding the…
The spatial random-effects model is flexible in modeling spatial covariance functions, and is computationally efficient for spatial prediction via fixed rank kriging. However, the success of this model depends on an appropriate set of basis…
Regular variation of a multivariate measure with a Lebesgue density implies the regular variation of its density provided the density satisfies some regularity conditions. Unlike the univariate case, the converse also requires regularity…
We derive conditions for the existence of fixed points of cone mappings without assuming scalability of functions. Monotonicity and scalability are often inseparable in the literature in the context of searching for fixed points of…
Bent functions, or equivalently, Hadamard difference sets in the elementary Abelian group $(\gf(2^{2m}), +)$, have been employed to construct symmetric and quasi-symmetric designs having the symmetric difference property. The main objective…
This paper investigates a swarm of autonomous mobile robots in the Euclidean plane, under the semi-synchronous ($\cal SSYNC$) scheduler. Each robot has a target function to determine a destination point from the robots' positions. All…
A main object of our study is multiset functions -- that is, permutation-invariant functions over inputs of varying sizes. Deep Sets, proposed by \cite{zaheer2017deep}, provides a \emph{universal representation} for continuous multiset…
One matrix structure in the area of monotone Boolean functions is defined here. Some of its combinatorial, algebraic and algorithmic properties are derived. On the base of these properties, three algorithms are built. First of them…
We study point-separating function sets that are minimal with respect to the property of being separating. We first show that for a compact space $X$ having a minimal separating function set in $C_p(X)$ is equivalent to having a minimal…
We study the fixed point problem for a system of multivariate operators that are coordinate-wise monotone (i.e., nondecreasing or nonincreasing in each of the variables, independently), in the setting of quasi-ordered sets. We show that…