Some dual characterizations of Farkas-type results for fractional programming problems

In this paper, we present some Farkas-type results for a fractional programming problem. To this end, by using the properties of dualizing parametrization functions, Lagrangian functions and the epigraph of the conjugate functions, we introduce some new notions of regularity conditions and then obtain some dual forms of Farkas-type results for this fractional programming problem. We also obtain sufficient conditions for alternative type theorems. As an application of these results, we obtain the corresponding results for a convex optimization problem.     

Some new Farkas-type results for inequality systems with DC functions

We present some Farkas-type results for inequality systems involving finitely many DC functions. To this end we use the so-called Fenchel-Lagrange duality approach applied to an optimization problem with DC objective function and DC inequality constraints. Some recently obtained Farkas-type results are rediscovered as special cases of our main result.     

Some Extension Theorems for Regular Functions of Several Quaternionic Variables

In this paper we study the extension theorems for solutions of inhomogeneous Cauchy-Fueter system. In particular cases, we obtain the extension theorems for regular functions of several quaternionic variables. At the end of the paper we give some applications of these theorems.     

Some Theorems on Meromorphic Univalent Functions

In this paper, we will show some deviation theorems and theorems of rotational angles in classes of Σ(p) and Σ(p,q) of meromorphic univalent functions.     

Monotonic analysis: convergence of sequences of monotone functions

In this article we examine various kinds of convergence of sequences of increasing positively homogeneous (IPH) functions and nonnegative decreasing functions defined on the interior of a pointed closed solid convex cone K. We show that five different types of convergency (including pointwise and epi-convergence) coincide for IPH functions. If the space under consideration is finite dimensional then the sixth type can be added: uniform convergence on bounded subsets of itn K. Using IPH functions, we study epi-convergence of sequences of lower semi-continuous (lsc) nonnegative decreasing functions.     

Farkas-type results for inequality systems with composed convex functions via conjugate duality

We present some Farkas-type results for inequality systems involving finitely many functions. Therefore we use a conjugate duality approach applied to an optimization problem with a composed convex objective function and convex inequality constraints. Some recently obtained results are rediscovered as special cases of our main result.     

Regularity conditions characterizing Fenchel–Lagrange duality and Farkas-type results in DC infinite programming

In this paper, we consider a DC infinite programming problem (P) with inequality constraints. By using the properties of the epigraph of the conjugate functions, we introduce some new notions of regularity conditions for (P). Under these new regularity conditions, we completely characterize the Fenchel–Lagrange duality and the stable Fenchel–Lagrange duality for (P). Similarly, we also completely characterize the Farkas-type results and the stable Farkas-type results for (P). As applications, we obtain the corresponding results for conic programming problems.     

P-Bloch函数的偏差定理和单叶半径

In this paper, we establish distortion theorems for both normalized p-Bloch functions with branch points and normalized locally univalent p-Bloch functions defined on the unit disk, respectively. These distortion theorems give lower bounds on |f′(z)| and ■f′(z). As applications of these distortion theorems, the lower bounds of the radius of the largest schlicht disk on these Bloch functions are given, respectively. Notice that when p = 1, our results reduce to that of Liu and Minda.     

近于凸函数新子类的偏差定理和卷积性质

引进了近于凸函数的新子类.利用从属关系得到了偏差定理和卷积性质.所得结果推广了一些作者的相关结果,并得到有趣的新结果.     

复变函数中由调和函数求解析函数的方法

本文给出了由解析函数的实部或虚部求该解析函数的几个定理,再以例题说明其应用。这些方法及应用,解决了复变函数中这一问题的理论与计算,而且所给方法能广泛进行推广。     

Indefinite integrals of special functions from hybrid equations

ABSTRACT

Elementary linear first and second order differential equations can always be constructed for twice differentiable functions by explicitly including the function's derivatives in the definition of these equations. If the function also obeys a conventional differential equation, information from this equation can be introduced into the elementary equations to give blended linear equations which are here called hybrid equations. Integration theorems are derived for these hybrid equations and several universal integrals are also derived. The paper presents integrals derived with these methods for cylinder functions, associated Legendre functions, and the Gegenbauer, Chebyshev, Hermite, Jacobi and Laguerre orthogonal polynomials. All the results presented have been checked using Mathematica.     

Choice Functions and Extensive Operators

The paper puts forth a theory of choice functions in a neat way connecting it to a theory of extensive operators and neighborhood systems. We consider classes of heritage choice functions satisfying conditions M, N, W, and C, or combinations of these conditions. In terms of extensive operators these classes can be considered as generalizations of symmetric, anti-symmetric and transitive binary relations. Among these classes we meet the well-known classes of matroids and convex geometries. Using a ‘topological’ language we discuss these classes of monotone extensive operators (or heritage choice functions) in terms of neighborhood systems. A remarkable inversion on the set of choice functions is introduced. Restricted to the class of heritage choice functions the inversion turns out to be an involution, and under this involution the axiom N is auto-inverse, whereas the axioms W and M change places. This research was supported in part by NWO–RFBR grant 047.011.2004.017, by RFBR grant 05-01-02805 CNRSL_a, and the grant NSh-929.2008.6, School Support. We want to thank B. Monjardet, the editor and a referee for discussions and useful suggestions.     

Fundamental Sets of Fractal Functions

Fractal interpolants constructed through iterated function systems prove more general than classical interpolants. In this paper, we assign a family of fractal functions to several classes of real mappings like, for instance, maps defined on sets that are not intervals, maps integrable but not continuous and may be defined on unbounded domains. In particular, based on fractal interpolation functions, we construct fractal Müntz polynomials that successfully generalize classical Müntz polynomials. The parameters of the fractal Müntz system enable the control and modification of the properties of original functions. Furthermore, we deduce fractal versions of classical Müntz theorems. In this way, the fractal methodology generalizes the fundamental sets of the classical approximation theory and we construct complete systems of fractal functions in spaces of continuous and p-integrable mappings on bounded domains. This work is supported by the project No: SB 2005-0199, Spain.     

Some Properties of Bent Functions

First, this paper discusses and sums up some properties of a pair of functions p（x）, q（x） that makes （y ＋ 1）p（x） ＋ yq（x） into a bent function. Then it discusses the properties of bent functions. Also, the upper and lower bounds of the number of bent functions on GF（2）2k are discussed.     

Sufficiency and Duality in Multiobjective Programming under Generalized Type I Functions

In this paper, new classes of generalized (F,α,ρ,d)-V-type I functions are introduced for differentiable multiobjective programming problems. Based upon these generalized convex functions, sufficient optimality conditions are established. Weak, strong and strict converse duality theorems are also derived for Wolfe and Mond-Weir type multiobjective dual programs.     

Maximal Hilbert Functions

The set of Hilbert functions of standard graded algebras is considered as a partially ordered set under numerical comparison. For the set of algebras H(d, e₀), of a given dimension d and multiplicity e₀, we describe the requirements its maximal elements must satisfy; under fairly general conditions, the extremal functions arise from Cohen-Macaulay algebras. We also examine the subset H(d, e₀, e₁), of those functions whose first two coefficients of their Hilbert polynomials are assigned. Finally, we show how these results and the use of certain extended multiplicities can be used to prove finiteness theorems for the number of corresponding functions.     

Farkas-type Results for Max-functions and Applications

We present some Farkas-type results for inequality systems involving finitely many convex constraints as well as convex max-functions. Therefore we use the dual of a minmax optimization problem. The main theorem and its consequences allows us to establish, as particular instances, some set containment characterizations and to rediscover two famous theorems of the alternative.     

Weighted Approximation of Functions on the Unit Sphere

The direct and inverse theorems are established for the best approximation in the weighted L^p space on the unit sphere of R^d+1, in which the weight functions are invariant under finite reflection groups. The theorems are stated using a modulus of smoothness of higher order, which is proved to be equivalent to a K-functional defined using the power of the spherical h-Laplacian. Furthermore, similar results are also established for weighted approximation on the unit ball and on the simplex of R^d.     

A Comparative Result for Multiplicative Functions

In this paper, we compare the asymptotic behavior of _nx f(n) and _nx g(n) for multiplicative functions f and g, respectively, where |f| g. Our results extend relevant theorems by E. Wirsing and G. Hal@aacute;sz. The methods we use are elementary.