In this paper we establish a non-global Cα estimation on the boundary for the gradient of the solution of a Neumann exterior problem in ℝ3. The boundary data of this problem are with small compact support and with C0 norm tending to infinity when the diameter of support data goes to zero. This problem appears, for instance, in the numerical shape optimization problems when the Newton method is used. It turns out that the gradient decreases when the distance to the boundary data supports increases (Saint Venant's principle), which, when used in applications, leads to a strong reduction of the gradient computational cost.

We consider three aspects of homomorphisms of graphs and hypergraphs which are related to the structure of colour classes: (1) density, (2) the fractal property and (3) the generation of colour classes. In particular, we prove a density theorem for hypergraphs and show that, for connected oriented graphs, all jumps are balanced (and give an example to show that connectivity is needed here). We also show that a Hajós-type theorem holds for any colour class of undirected graphs, thus providing further evidence of the well-known ‘non-effective’ character of Hajós' theorem.

The purpose of this paper is to establish a Lusin-type approximation of functions with bounded deformation by Lipschitz or C1 functions. The main ingredients inthe proof of our result are the maximal function of the measure Eu, the ‘Poincaré-type’ result by Kohn and the approximate symmetric differentiability of BD functions by Ambrosio and others.

We prove a Futorny-like theorem which describes the support of an irreducible weight module over the Witt–Kaplansky algebra of rank(2, 2).

Let TBin(N, n, q) be the game on the complete graph KN in which two players, the Breaker and the Maker, alternately claim one and q edges, respectively. The Maker's aim is to build a binary tree on n<N vertices in n−1 turns while the Breaker tries to prevent him from doing so. It is shown that, for every constant ε>0, there exists n0 such that, for every n[ges ]n0, the Breaker has a winning strategy in TBin(N, n, q) if q>(1+ε)N/logn, while, for q<(1−ε)N/logn, the game TBin(N, n, q) can be won by the Maker provided that n=o(N).

In 1918 Pólya and Vinogradov established the estimate for Dirichlet character sums that currently carries their names. It was forty years until Burgess gave an improvement of their bound [1], and it is forty years since that improvement.

The question as to which “natural” sequences contain infinitely many primes is of considerable fascination to the number-theorist. One such “natura” sequence is [nc[ where [·] denotes integer part. Piatetski-Shapiro [10] showed that there are infinitely many primes in this sequence for 1 < c < 12/11, obtaining the expected asymptotic formula for the number of such primes. The exponent 12/11 has been increased gradually by a number of authors to the present record 45/38 held by Kumchev [9]. It is expected that there are infinitely many primes of the form [nc[ for all cεε[1, ∞)/ℤ. Deshouillers [3] showed that this is almost always true, in the sense of Lebesgue measure on [1, ∞). Balog [2] improved and generalized this result to show that, for almost all c > 1,

where

We study dual isoperimetric deficits of star bodies. We introduce the dual Steiner ball of a star body, and use it to establish an inequality for the Lp distance, p = 2 and p = ∞, between the radial functions of two convex bodies. By applying this inequality, we find dual Bonnesen-type inequalities for convex bodies. Finally, we use a general form of Grüss's inequality to derive dual Favard-type inequalities for star and convex bodies. The results contribute to the dual Brunn–Minkowski theory initiated by E. Lutwak, and continue the attempt to understand the relation between this and the classical Brunn–Minkowski theory.

We consider linear and nonlinear inverse source problems of sound radiation in an unbounded domain which models an oceanic waveguide. The method for analysing their solvability is based on analytical properties of generalized acoustic potentials and the theory of extremal problems.

As usual in Waring's problem, we let G(k) be the least number s such that all sufficiently large natural numbers can be written as the sum of s or fewer k-th powers of positive integers. Hardy and Littlewood gave the first general upper bound, G(k)≤(k − 2)2k − 1 + 5. Later [4], they reduced this to order k2 by first constructing an auxiliary set of natural numbers below x which are sums of sk-th powers, of cardinality with for large k. The argument, which is brief and elementary (see [15, Chapter 6]), is now referred to by R. C. Vaughan's term “diminishing ranges”, since the k-th powers are taken from intervals of decreasing lengths. This idea of choosing the variables from restricted ranges was refined by Vinogradov, whose application to exponential sum estimates gave for large k (see [18]). The recent iterative method of Vaughan and Wooley [16, 19, 21], which halves Vinogradov's bound, may be viewed as an evolved diminishing ranges argument, producing an auxiliary set with .

It is known that a system of r additive equations of degree k with greater than 2rk variables has a non-trivial p-adic solution for all p > k2r + 2. In this paper we consider the same system with more than crk variables, c > 2, and show the existence of a non-trivial solution for all p > r2k2+(2/(c − 2)) if r ≠ 1 and p > k2+(2/(c − 1)) if r = 1.

Recent advances in the theory of exponential sums (see, for example, [6], [7], [8], [12]) have contributed to corresponding progress in our understanding of the solubility of systems of simultaneous additive equations (see, in particular, [1], [2], [3], [4]). In a previous memoir [11] we developed a version of Vaughan's iterative method (see Vaughan [8]) suitable for the analysis of simultaneous additive equations of differing degrees, discussing in detail the solubility of simultaneous cubic and quadratic equations. The mean value estimates derived in [11] are, unfortunately, weaker than might be hoped, owing to the presence of undesirable singular solutions in certain auxiliary systems of congruences. The methods of [12] provide a flexible alternative to Vaughan's iterative method, and, as was apparent even at the time of their initial development at the opening of the present decade, such ideas provide a means of avoiding altogether the aforementioned problematic singular solutions. The systematic development of such an approach having been described recently in [15], in this paper we apply such methods to investigate the solubility of pairs of additive equations, one cubic and one quadratic, thereby improving the main conclusion of [11].

Let G be an abelian group of order n and let μ be a sequence of elements of G with length 2n−k+1 taking k distinct values. Assuming that no value occurs n−k+3 times, we prove that the sums of the n-subsequences of μ must include a non-null subgroup. As a corollary we show that if G is cyclic then μ has an n-subsequence summing to 0. This last result, conjectured by Bialostocki, reduces to the Erdos–Ginzburg–Ziv theorem for k=2.

Let f(n, k, l) be the expected length of a longest common subsequence of l sequences of length n over an alphabet of size k. It is known that there are constants γ(l)k such that f(n, k, l)→γ(l)kn as n→∞, and we show that γ(l)k=Θ(k1/l−1) as k→∞. Bounds for the corresponding constants for the expected length of a shortest common supersequence are also presented.

In recent papers the present authors considered the effects of small cross-flow on the evolution of two unequal oblique waves. In these studies the relative size of the crossflow meant that a diffusion (or buffer) layer was required around the critical layer to smooth out the algebraic growth in the mean-flow distortion generated by the nonlinear critical-layer interactions. The present analysis increases the cross-flow to an order of magnitude such that the buffer and critical layers coalesce. In this instance the nonlinear critical layer contains viscous as well as nonequilibrium effects. The resulting amplitude equations are solved for perturbations initiated at a fixed station in the flow.

If K is a convex body in d and 1≤k≤d − 1, we define Pk(K) to be the Minkowski sum or Minkowski average of all the projections of K onto k-dimensional subspaces of d. The operator Pd − 1, was first introduced by Schneider, who showed that, if Pd − 1(K) = cK, then K is a ball. More recently, Spriestersbach showed that, if Pd − 1(K) = cK then K = M. In addition, she gave stability versions of this result and Schneider's. We will describe further injectivity results for the operators Pk. In particular, we will show that Pk is injective if k≤d/2 and that P2 is injective in all dimensions except d = 14, where it is not injective.