Quasi-Polynomial Functions on Bounded Chains
نویسندگان
چکیده
Two emergent properties in aggregation theory are investigated, namely horizontal maxitivity and comonotonic maxitivity (as well as their dual counterparts) which are commonly defined by means of certain functional equations. We present complete descriptions of the function classes axiomatized by each of these properties, up to weak versions of monotonicity, in the cases of horizontal maxitivity and minitivity. While studying the classes axiomatized by combinations of these properties, we introduce the concept of quasipolynomial function which appears as a natural extension of the well-established notion of polynomial function. We present further axiomatizations for this class both in terms of functional equations and natural relaxations of homogeneity and median decomposability. As noteworthy particular cases, we investigate those subclasses of quasi-term functions and quasi-weighted maximum and minimum functions, and present characterizations accordingly. Keywords— Discrete Sugeno integral, quasi-polynomial function, horizontal maxitivity and minitivity, comonotonic maxitivity and minitivity, functional equation.
منابع مشابه
Axiomatizations of quasi-polynomial functions on bounded chains
Two emergent properties in aggregation theory are investigated, namely horizontal maxitivity and comonotonic maxitivity (as well as their dual counterparts) which are commonly defined by means of certain functional equations. We completely describe the function classes axiomatized by each of these properties, up to weak versions of monotonicity, in the cases of horizontal maxitivity and minitiv...
متن کاملZero-free regions of partition functions with applications to algorithms and graph limits
Based on a technique of Barvinok [3, 4, 5] and Barvinok and Soberón [6, 7] we identify a class of edge-coloring models whose partition functions do not evaluate to zero on bounded degree graphs. Subsequently we give a quasi-polynomial time approximation scheme for computing these partition functions. As another application we show that the normalised partition functions of these models are cont...
متن کاملQuasi-polynomial Functions over Bounded Distributive Lattices
In [6] the authors introduced the notion of quasi-polynomial function as being a mapping f : Xn → X defined and valued on a bounded chain X and which can be factorized as f(x1, . . . , xn) = p(φ(x1), . . . , φ(xn)), where p is a polynomial function (i.e., a combination of variables and constants using the chain operations ∧ and ∨) and φ is an order-preserving map. In the current paper we study ...
متن کاملEquational definability and a quasi-ordering on Boolean functions
Earlier work by several authors has focused on defining Boolean function classes by means of functional equations. In [10], it was shown that the classes of Boolean functions definable by functional equations coincide with initial segments of the quasi-ordered set (Ω,≤) made of the set Ω of Boolean functions, suitably quasi-ordered. Furthermore, the classes defined by finitely many equations co...
متن کاملOn Proofs About Threshold Circuits and Counting Hierarchies (Extended Abstract)
We define theories of Bounded Arithmetic characterizing classes of functions computable by constantdepth threshold circuits of polynomial and quasipolynomial size. Then we define certain second-order theories and show that they characterize the functions in the Counting Hierarchy. Finally we show that the former theories are isomorphic to the latter via the socalled RSUV -isomorphism.
متن کامل