An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth

C _{2 k} -free subgraph of a random graph may have, obtaining best possible results for a range of p=p(n). Our estimates strengthen previous bounds of Füredi [12] and Haxell, Kohayakawa, and Łuczak [13]. Two main tools are used here: the first one is an upper bound for the number of graphs with large even-girth, i.e., graphs without short even cycles, with a given number of vertices and edges, and satisfying a certain additional pseudorandom condition; the second tool is the powerful result of Ajtai, Komlós, Pintz, Spencer, and Szemerédi [1] on uncrowded hypergraphs as given by Duke, Lefmann, and R?dl [7]. Received: February 17, 1995     

Sparse color-critical hypergraphs

In this paper we obtain estimates for the least number of edges ann-uniformr-color-critical hypergraph of orderm may have.     

Nonparametric estimation of the location and scale parameters based on density estimation

Summary By representing the location and scale parameters of an absolutely continuous distribution as functionals of the usually unknown probability density function, it is possible to provide estimates of these parameters in terms of estimates of the unknown functionals. Using the properties of well-known methods of density estimates, it is shown that the proposed estimates possess nice large sample properties and it is indicated that they are also robust against dependence in the sample. The estimates perform well against other estimates of location and scale parameters.     

Sharp concentration of the chromatic number on random graphsG n,p

The distribution of the chromatic number on random graphsG _{n, p} is quite sharply concentrated. For fixedp it concentrates almost surely in √n ω(n) consecutive integers where ω(n) approaches infinity arbitrarily slowly. If the average degreepn is less thann ^1/6, it concentrates almost surely in five consecutive integers. Large deviation estimates for martingales are used in the proof.     

Resolvent estimates and scattering matrix for N-particle Hamiltonians

New estimates for the resolvent of theN-particle Schrödinger operator are established. The estimates obtained allow us to give stationary representations for the corresponding scattering matrix. In particular, it is shown that the scattering matrix is a strongly continuous function of the spectral parameter (energy).     

Spectral theory of minimax estimation

The set ofS ₁-estimates of solutions of systems of linear equations with random parameters is found. It is proved that the maximal eigenvalue in the goodness criterion is not simple. For the purpose of finding estimates from theS ₁ set, the perturbation formulas for eigenvalues and formulas for distribution density of random matrices are used.     

Atoms of families of sets

An atom of a familyF= (A _v :v∈I) of sets is a set of the form where 0⊂N⊆I. The note deals with upper and lower estimates of the possible number of non-empty atoms ofF in case theA _v are parallelopipeds ind-dimensional space. Some estimates are best possible. Dedicated to Tibor Gallai on his seventieth birthday     

Matching behaviour is asymptotically normal

Ak-matching in a graphG is a set ofk edges, no two of which have a vertex in common. The number of these inG is writtenp(G, k). Using an idea due to L. H. Harper, we establish a condition under which these numbers are approximately normally distributed. We show that our condition is satisfied ifn=|V(G)| is large compared to the maximum degree Δ of a vertex inG(i.e. Δ=o(n)) orG is a large complete graph. One corollary of these results is that the number of points fixed by a randomly chosen involution in the symmetric groupS is asymptotically normally distributed.     

Fully nonlinear elliptic equations and the dini condition

Abstract

We investigate transmission problems with strongly Lipschitz interfaces for the Dirac equation by establishing spectral estimates on an associated boundary singular integral operator, the rotation operator. Using Rellich estimates we obtain angular spectral estimates on both the essential and full spectrum for general bi-oblique transmission problems. Specializing to the normal transmission problem, we investigate transmission problems for Maxwell's equations using a nilpotent exterior/interior derivativeoperator. The fundamental commutation properties for this operator with the two basic reflection operators are proved. We show how the L ₂spectral estimates are inherited for the domain of the exterior/interior derivative operator and prove some complementary eigenvalue estimates. Finally we use a general algebraic theorem to prove a regularity property needed for Maxwell's equations.     

Dichteschätzungen mit gleichverteilungsmethoden

Density estimates with methods of uniform distribution mod 1. Some nonparametric multivariate density estimators for continuous functions, based on the Fejér and Jackson kernel, are presented. Uniform strong consistency results are obtained with methods of uniform distribution mod 1.

     

Large sample properties of Jaeckel's adaptive trimmed mean

Summary A critical examination of Jaeckel's (1971,Ann. Math. Statist.,42, 1540–1552) study of his adaptive trimmed mean reveals that the theory is not applicable in many important cases, such as when the optimal trimming proportion is close to 0 or 1/2. This region includes the normal and double exponential distributions, among others, which have received considerable attention in the study of other adaptive location estimates. In this paper we obtain results which justify the use of Jaeckel's trimmed mean for a very large class of distributions. By restricting this class we obtain weak and strong rates of convergence which are much faster than those given by Jaeckel.     

Finite element approximations to surfaces of prescribed variable mean curvature

We give an algorithm for finding finite element approximations to surfaces of prescribed variable mean curvature, which span a given boundary curve. We work in the parametric setting and prove optimal estimates in the H¹ norm. The estimates are verified computationally.     

Strichartz estimates and local smoothing estimates for asymptotically flat Schrödinger equations

In this article we study global-in-time Strichartz estimates for the Schrödinger evolution corresponding to long-range perturbations of the Euclidean Laplacian. This is a natural continuation of a recent article [D. Tataru, Parametrices and dispersive estimates for Schrödinger operators with variable coefficients, Amer. J. Math. 130 (2008) 571-634] of the third author, where it is proved that local smoothing estimates imply Strichartz estimates. By [D. Tataru, Parametrices and dispersive estimates for Schrödinger operators with variable coefficients, Amer. J. Math. 130 (2008) 571-634] the local smoothing estimates are known to hold for small perturbations of the Laplacian. Here we consider the case of large perturbations in three increasingly favorable scenarios: (i) without non-trapping assumptions we prove estimates outside a compact set modulo a lower order spatially localized error term, (ii) with non-trapping assumptions we prove global estimates modulo a lower order spatially localized error term, and (iii) for time independent operators with no resonance or eigenvalue at the bottom of the spectrum we prove global estimates for the projection onto the continuous spectrum.     

Boundary estimates for elliptic systems with L<Superscript>1</Superscript>–data

We obtain boundary estimates for the gradient of solutions to elliptic systems with Dirichlet or Neumann boundary conditions and L ¹–data, under some condition on the divergence of the data. Similar boundary estimates are obtained for div–curl and Hodge systems.     

Effective scalar products of D-finite symmetric functions

Many combinatorial generating functions can be expressed as combinations of symmetric functions, or extracted as sub-series and specializations from such combinations. Gessel has outlined a large class of symmetric functions for which the resulting generating functions are D-finite. We extend Gessel's work by providing algorithms that compute differential equations, these generating functions satisfy in the case they are given as a scalar product of symmetric functions in Gessel's class. Examples of applications to k-regular graphs and Young tableaux with repeated entries are given. Asymptotic estimates are a natural application of our method, which we illustrate on the same model of Young tableaux. We also derive a seemingly new formula for the Kronecker product of the sum of Schur functions with itself.     

On boundaries and influences

We prove an inequality relating the size of the boundary of a monotone subset of {0,1} ⁿ and the influences of the coordinates upon this set. It shows that if the boundary (resp. the influences) are small, the influences (resp. the boundary) are large.Work partially supported by an NSF grant.     

Hyperovals in Steiner systems

In this paper, we show that the basic necessary condition for the existence of a (k; 0, 2)-set in an S(2, 4, v) is also sufficient. It solves a problem posed by de Resmini [6] and we also prove some asymptotic results concerning the existence of hyperovals in Steiner systems with large block size. The results are generally applicable to designs with maximal arcs.     

赋权图的w密度和w平衡性

The notion of w-density for the graphs with positive weights on vertices and nonnegative weights on edges is introduced. A weighted graph is called w-balanced if its w-density is no less than the w-density of any subgraph of it. In this paper,a good characterization of w-balanced weighted graphs is given. Applying this characterization ,many large w-balanced weighted graphs are formed by combining smaller ones. In the case where a graph is not w-balanced,a polynomial-time algorithm to find a subgraph of maximum w-density is proposed. It is shown that the w-density theory is closely related to the study of SEW(G,w) games.     

On a class of higher order methods for simultaneous rootfinding of generalized polynomials

Summary Using the argument principle higher order methods for simultaneous computation of all zeros of generalized polynomials (like algebraic, trigonometric and exponential polynomials or exponential sums) are derived. The methods can also be derived following the continuation principle from [3]. Thereby, the unified approach of [7] is enlarged to arbitrary orderN. The local convergence as well as a-priori and a-posteriori error estimates for these methods are treated on a general level. Numerical examples are included.     

The n-centre problem of celestial mechanics for large energies

We consider the classical three-dimensional motion in a potential which is the sum of n attracting or repelling Coulombic potentials. Assuming a non-collinear configuration of the n centres, we find a universal behaviour for all energies E above a positive threshold. Whereas for n=1 there are no bounded orbits, and for n=2 there is just one closed orbit, for n≥3 the bounded orbits form a Cantor set. We analyze the symbolic dynamics and estimate Hausdorff dimension and topological entropy of this hyperbolic set. Then we set up scattering theory, including symbolic dynamics of the scattering orbits and differential cross section estimates. The theory includes the n–centre problem of celestial mechanics, and prepares for a geometric understanding of a class of restricted n-body problems. To allow for applications in semiclassical molecular scattering, we include an additional smooth (electronic) potential which is arbitrary except its Coulombic decay at infinity. Up to a (optimal) relative error of order 1/E, all estimates are independent of that potential but only depend on the relative positions and strengths of the centres. Finally we show that different, non-universal, phenomena occur for collinear configurations. Received October 16, 2000 / final version received June 18, 2001?Published online August 15, 2001