A Runge theorem for generalized analytic functions

We show an approximation theorem of Runge type for solutions of the generalized Vekua equation $Lu=Au+B\overline{u}$, where L belongs to a class of degenerate elliptic planar vector fields and $A,B\in L^p$. To prove the theorem, we make use of an integral representation for the solutions of the generalized Vekua equation valid on relatively compact sets. As an application, we study the global solvability of the equation $Lu=Au+B\overline{u}+f$ with $f\in L^p$ and some of its consequences.     

Hall's theorem for hypergraphs

We prove a hypergraph version of Hall's theorem. The proof is topological. © 2000 John Wiley & Sons, Inc. J Graph Theory 35: 83–88, 2000     

On Eneström-Kakeya theorem and related analytic functions

We prove some extensions of the classical results concerning the Eneström-Kakeya theorem and related analytic functions. Besides several consequences, our results considerably improve the bounds by relaxing and weakening the hypothesis in some cases.     

Weak Cartan-type second main theorem for holomorphic curves

In this paper, a weak Cartan-type second theorem for holomorphic curve f ： C→P^n（C） intersecting hypersurfaces Dj, 1≤j≤q, in P^n（C） in general position with degree dj is given as follows： For every ε〉0, there exists a positive integer M such that ｜｜（q - （n ＋ 1） ε）Tf（r）≤∑j^q=1 1/dj Nf^M（r,Dj）＋o（Tf（r））, where ＂｜｜＂ means the estimate holds for all large r outside a set of finite Lebesgue measure.     

A Ramsey theorem for structures with both relations and functions

We prove a generalization of Prömel's theorem to finite structures with both relations and functions.     

Wilson's theorem for consensus functions on hierarchies

Wilson in 1972 gave a generalization of Arrow's theorem without the Pareto axiom. We prove a version of Wilson's theorem for consensus functions on hierarchies.     

Reduction theorems for principal and classical connections

We prove general reduction theorems for gauge natural operators transforming principal connections and classical linear connections on the base manifold into sections of an arbitrary gauge natural bundle. Then we apply our results to the principal prolongation of connections. Finally we describe all such gauge natural operators for some special cases of a Lie group G.     

A No-Free-Lunch theorem for non-uniform distributions of target functions

The sharpened No-Free-Lunch-theorem (NFL-theorem) states that, regardless of the performance measure, the performance of all optimization algorithms averaged uniformly over any finite set F of functions is equal if and only if F is closed under permutation (c.u.p.). In this paper, we first summarize some consequences of this theorem, which have been proven recently: The number of subsets c.u.p. can be neglected compared to the total number of possible subsets. In particular, problem classes relevant in practice are not likely to be c.u.p. The average number of evaluations needed to find a desirable (e.g., optimal) solution can be calculated independent of the optimization algorithm in certain scenarios. Second, as the main result, the NFL-theorem is extended. Necessary and sufficient conditions for NFL-results to hold are given for arbitrary distributions of target functions. This yields the most general NFL-theorem for optimization presented so far.     

The Wiener-Ikehara theorem by complex analysis

The Tauberian theorem of Wiener and Ikehara provides the most direct way to the prime number theorem. Here it is shown how Newman's contour integration method can be adapted to establish the Wiener-Ikehara theorem. A simple special case suffices for the PNT. But what about the twin-prime problem?

     

Sandwich theorem for quasiconvex functions and its applications

In convex programming, sandwich theorem is very important because it is equivalent to Fenchel duality theorem. In this paper, we investigate a sandwich theorem for quasiconvex functions. Also, we consider some applications for quasiconvex programming.     

The Lagrange inversion theorem in the smooth case

The classical Lagrange inversion theorem is a concrete, explicit form of the implicit function theorem for real analytic functions. An explicit construction shows that the formula is not true for all merely smooth functions. The authors modify the Lagrange formula by replacing the smooth function by its Maclaurin polynomials. The resulting modified Lagrange series is, in analogy to the Maclaurin polynomials, an approximation to the solution function accurate to o(x^N) as x→0.     

The Perron-Frobenius theorem for homogeneous, monotone functions

If is a nonnegative matrix whose associated directed graph is strongly connected, the Perron-Frobenius theorem asserts that has an eigenvector in the positive cone, . We associate a directed graph to any homogeneous, monotone function, , and show that if the graph is strongly connected, then has a (nonlinear) eigenvector in . Several results in the literature emerge as corollaries. Our methods show that the Perron-Frobenius theorem is ``really' about the boundedness of invariant subsets in the Hilbert projective metric. They lead to further existence results and open problems.

     

A note on the central limit theorem for bipower variation of general functions

In this paper we present a central limit theorem for general functions of the increments of Brownian semimartingales. This provides a natural extension of the results derived in [O.E. Barndorff-Nielsen, S.E. Graversen, J. Jacod, M. Podolskij, N. Shephard, A central limit theorem for realised power and bipower variations of continuous semimartingales, in: From Stochastic Analysis to Mathematical Finance, Festschrift for Albert Shiryaev, Springer, 2006], where the central limit theorem was shown for even functions. We prove an infeasible central limit theorem for general functions and state some assumptions under which a feasible version of our results can be obtained. Finally, we present some examples from the literature to which our theory can be applied.     

An extension of Picard's theorem for meromorphic functions of small hyper-order

A version of the second main theorem of Nevanlinna theory is proved, where the ramification term is replaced by a term depending on a certain composition operator of a meromorphic function of small hyper-order. As a corollary of this result it is shown that if n∈N and three distinct values of a meromorphic function f of hyper-order less than 1/n² have forward invariant pre-images with respect to a fixed branch of the algebraic function τ(z)=z+αn−1z1−1/n+?+α₁z1/n+α₀ with constant coefficients, then f○τ≡f. This is a generalization of Picard's theorem for meromorphic functions of small hyper-order, since the (empty) pre-images of the usual Picard exceptional values are special cases of forward invariant pre-images.     

Dieudonné's theorem for non-additive set functions

A Cafiero type criterion and an extension of the classical Dieudonné's theorem for a class of non-additive set functions valued into a complete Hausdorff uniform space are established.     

Ascoli's theorem for functions vanishing at infinity and selected applications

We give a new form of the Ascoli theorem for functions on tending to some given closed subset Z of a complete metric space E at infinity. For instance, when E is a normed space and Z={0}, the usual uniform decay requirement is replaced by the assumption that the 0 function is the only continuous function produced by some limiting process. This formulation, which has significant practical value in concrete applications, is described in its general form, but with emphasis on the case when Z is totally disconnected. Variants in Sobolev spaces and the properness of nonlinear ordinary differential operators are discussed.     

A nonsmooth Morse-Sard theorem for subanalytic functions

According to the Morse-Sard theorem, any sufficiently smooth function on a Euclidean space remains constant along any arc of critical points. We prove here a theorem of Morse-Sard type suitable as a tool in variational analysis: we broaden the definition of a critical point to the standard notion in nonsmooth optimization, while we restrict the functions under consideration to be semialgebraic or subanalytic. We make no assumption of subdifferential regularity. ?ojasiewicz-type inequalities for nonsmooth functions follow quickly from tools of the kind we develop, leading to convergence theory for subgradient dynamical systems.     

The Chevalley-Warning theorem and a combinatorial question on finite groups

Recently, W. D. Gao (1996) proved the following theorem: For a cyclic group of prime order, and any element in it, and an arbitrary sequence of elements from , the number of ways of writing as a sum of exactly of the 's is or modulo according as is zero or not. The dual purpose of this note is (i) to give an entirely different type of proof of this theorem; and (ii) to solve a conjecture of J. E. Olson (1976) by answering an analogous question affirmatively for solvable groups.