共查询到20条相似文献,搜索用时 15 毫秒
1.
Dov Chelst 《Proceedings of the American Mathematical Society》2001,129(11):3275-3278
Let be an analytic function mapping the unit disc to itself. We generalize a boundary version of Schwarz's lemma proven by D. Burns and S. Krantz and provide sufficient conditions on the local behavior of near a finite set of boundary points that requires to be a finite Blaschke product. Afterwards, we supply several counterexamples to illustrate that these conditions may also be necessary.
2.
3.
ABSTRACT In this paper, we present applications of the doubling lemma to nonlinear equations, including a k-Hessian equation and an integral equation of Wolff-type. 相似文献
4.
The classical Julia's lemma is improved, branch points of Bloch functions are investigated, and new lower bounds of Bloch constants for functions with branch points are obtained. 相似文献
5.
C. Swartz 《Journal of Optimization Theory and Applications》1985,46(2):237-244
An abstract version of the classical Farkas lemma for locally convex spaces is given. The abstract Farkas lemma is shown to imply Farkas-type results which have been obtained by Shimizu-Aiyoshi-Katayama, Schecter, Eisenberg, Zalinescu, and Smiley. 相似文献
6.
In this paper, the authors prove a Schwarz-Pick lemma for bounded complexvalued harmonic functions in the unit ball of $\mathds{R}^n$. 相似文献
7.
8.
We consider a Dirichlet problem in a planar domain with a hole of diameter proportional to a real parameter ? and we denote by u? the corresponding solution. The behavior of u? for ? small and positive can be described in terms of real analytic functions of two variables evaluated at (?,1/log??). We show that under suitable assumptions on the geometry and on the boundary data one can get rid of the logarithmic behavior displayed by u? for ? small and describe u? by real analytic functions of ?. Then it is natural to ask what happens when ? is negative. The case of boundary data depending on ? is also considered. The aim is to study real analytic families of harmonic functions which are not necessarily solutions of a particular boundary value problem. 相似文献
9.
The historical development of Hensel's lemma is briefly discussed (Section 1). Using Newton polygons, a simple proof of a general Hensel's lemma for separable polynomials over Henselian fields is given (Section 3). For polynomials over algebraically closed, valued fields, best possible results on continuity of roots (Section 4) and continuity of factors (Section 6) are demonstrated. Using this and a general Krasner's lemma (Section 7), we give a short proof of a general Hensel's lemma and show that it is, in a certain sense, best possible (Section 8). All valuations here are non-Archimedean and of arbitrary rank. The article is practically self-contained. 相似文献
10.
Let [n]={1,…,n}. For a function h:[n]→{0,1}, x[n] and y{0,1} define by the width ωh(x,y) of h at x the largest nonnegative integer a such that h(z)=y on x−a≤z≤x+a. We consider finite VC-dimension classes of functions h constrained to have a width ωh(xi,yi) which is larger than N for all points in a sample or a width no larger than N over the whole domain [n]. Extending Sauer’s lemma, a tight upper bound with closed-form estimates is obtained on the cardinality of several such classes. 相似文献
11.
12.
Terence Tao 《Journal of Combinatorial Theory, Series A》2006,113(7):1257-1280
Recent work of Gowers [T. Gowers, A new proof of Szemerédi's theorem, Geom. Funct. Anal. 11 (2001) 465-588] and Nagle, Rödl, Schacht, and Skokan [B. Nagle, V. Rödl, M. Schacht, The counting lemma for regular k-uniform hypergraphs, Random Structures Algorithms, in press; V. Rödl, J. Skokan, Regularity lemma for k-uniform hypergraphs, Random Structures Algorithms, in press; V. Rödl, J. Skokan, Applications of the regularity lemma for uniform hypergraphs, preprint] has established a hypergraph removal lemma, which in turn implies some results of Szemerédi [E. Szemerédi, On sets of integers containing no k elements in arithmetic progression, Acta Arith. 27 (1975) 299-345], and Furstenberg and Katznelson [H. Furstenberg, Y. Katznelson, An ergodic Szemerédi theorem for commuting transformations, J. Anal. Math. 34 (1978) 275-291] concerning one-dimensional and multidimensional arithmetic progressions, respectively. In this paper we shall give a self-contained proof of this hypergraph removal lemma. In fact we prove a slight strengthening of the result, which we will use in a subsequent paper [T. Tao, The Gaussian primes contain arbitrarily shaped constellations, preprint] to establish (among other things) infinitely many constellations of a prescribed shape in the Gaussian primes. 相似文献
13.
《Journal of Graph Theory》2018,87(3):271-274
The Wonderful Lemma, that was first proved by Roussel and Rubio, is one of the most important tools in the proof of the Strong Perfect Graph Theorem. Here we give a short proof of this lemma. 相似文献
14.
《Random Structures and Algorithms》2018,52(2):301-353
Szemerédi 's Regularity Lemma is a powerful tool in graph theory. It asserts that all large graphs admit bounded partitions of their edge sets, most classes of which consist of uniformly distributed edges. The original proof of this result was nonconstructive, and a constructive proof was later given by Alon, Duke, Lefmann, Rödl, and Yuster. Szemerédi's Regularity Lemma was extended to hypergraphs by various authors. Frankl and Rödl gave one such extension in the case of 3‐uniform hypergraphs, which was later extended to k‐uniform hypergraphs by Rödl and Skokan. W.T. Gowers gave another such extension, using a different concept of regularity than that of Frankl, Rödl, and Skokan. Here, we give a constructive proof of a regularity lemma for hypergraphs. 相似文献
15.
Averaging lemmas deduce smoothness of velocity averages, such as
from properties of . A canonical example is that is in the Sobolev space whenever and are in . The present paper shows how techniques from Harmonic Analysis such as maximal functions, wavelet decompositions, and interpolation can be used to prove versions of the averaging lemma. For example, it is shown that implies that is in the Besov space , . Examples are constructed using wavelet decompositions to show that these averaging lemmas are sharp. A deeper analysis of the averaging lemma is made near the endpoint .
16.
We prove a variant of a Johnson‐Lindenstrauss lemma for matrices with circulant structure. This approach allows to minimize the randomness used, is easy to implement and provides good running times. The price to be paid is the higher dimension of the target space k = O(ε?2 log3 n) instead of the classical bound k = O(ε?2 log n). © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2011 相似文献
17.
Benji Fisher 《Proceedings of the American Mathematical Society》1997,125(11):3185-3189
The standard hypotheses for Hensel's Lemma in several variables are slightly stronger than necessary, in the case that the Jacobian determinant is not a unit. This paper shows how to weaken the hypotheses for Hensel's Lemma and some related theorems.
18.
We prove several improved versions of Bohr’s inequality for the harmonic mappings of the form , where is bounded by 1 and . The improvements are obtained along the lines of an earlier work of Kayumov and Ponnusamy, i.e. (Kayumov and Ponnusamy, 2018) for example a term related to the area of the image of the disk under the mapping is considered. Our results are sharp. In addition, further improvements of the main results for certain special classes of harmonic mappings are provided. 相似文献
19.
20.
《Indagationes Mathematicae》2023,34(3):637-642
We prove a sharp Schwarz lemma type inequality for the Weierstrass–Enneper parameterization of minimal disks. It states the following. If is a conformal harmonic parameterization of a minimal disk , where is the unit disk and , then . If for some the previous inequality is equality, then the surface is an affine image of a disk, and is linear up to a Möbius transformation of the unit disk. 相似文献