38 resultados para Set-Valued Functions
Resumo:
2000 Mathematics Subject Classification: 47H04, 65K10.
Resumo:
2000 Mathematics Subject Classification: 46A30, 54C60, 90C26.
Resumo:
AMS subject classification: Primary 34A60, Secondary 49J52.
Resumo:
2000 Mathematics Subject Classification: 62J12, 62F35
Resumo:
The deviations of some entire functions of exponential type from real-valued functions and their derivatives are estimated. As approximation metrics we use the Lp-norms and power variations on R. Theorems presented here correspond to the Ganelius and Popov results concerning the one-sided trigonometric approximation of periodic functions (see [4, 5 and 8]). Some related facts were announced in [2, 3, 6 and 7].
Resumo:
2000 Mathematics Subject Classification: 47H04, 65K10.
Resumo:
2000 Mathematics Subject Classification: 65G99, 65K10, 47H04.
Resumo:
2000 Mathematics Subject Classification: 41A10, 30E10, 41A65.
Resumo:
2000 Mathematics Subject Classification: 54C60, 54C65, 54D20, 54D30.
Resumo:
2000 Mathematics Subject Classification: 54C35, 54D20, 54C60.
Resumo:
Given an n-ary k-valued function f, gap(f) denotes the essential arity gap of f which is the minimal number of essential variables in f which become fictive when identifying any two distinct essential variables in f. In the present paper we study the properties of the symmetric function with non-trivial arity gap (2 ≤ gap(f)). We prove several results concerning decomposition of the symmetric functions with non-trivial arity gap with its minors or subfunctions. We show that all non-empty sets of essential variables in symmetric functions with non-trivial arity gap are separable. ACM Computing Classification System (1998): G.2.0.
Resumo:
The paper considers vector discrete optimization problem with linear fractional functions of criteria on a feasible set that has combinatorial properties of combinations. Structural properties of a feasible solution domain and of Pareto–optimal (efficient), weakly efficient, strictly efficient solution sets are examined. A relation between vector optimization problems on a combinatorial set of combinations and on a continuous feasible set is determined. One possible approach is proposed in order to solve a multicriteria combinatorial problem with linear- fractional functions of criteria on a set of combinations.
Resumo:
In this paper we examine discrete functions that depend on their variables in a particular way, namely the H-functions. The results obtained in this work make the “construction” of these functions possible. H-functions are generalized, as well as their matrix representation by Latin hypercubes.
Resumo:
The concept of the distinguished sets is applied to the investigation of the functionally countable spaces. It is proved that every Baire function on a functionally countable space has a countable image. This is a positive answer to a question of R. Levy and W. D. Rice.
Resumo:
The problem of decision functions quality in pattern recognition is considered. An overview of the approaches to the solution of this problem is given. Within the Bayesian framework, we suggest an approach based on the Bayesian interval estimates of quality on a finite set of events.