The paper discusses the advantages of solving boundaryvalue problems by the use of eigen-function expansions of suitable fourth order differential equations instead of those of second order equations. Some such expansions are constructed, their convergence properties studied and their use in different types of boundary-value problems are discussed.

The problem considered here is that of a torsional impulsive body force within a semi-infinite elastic solid. The surface of the solid is assumed to be either stress-free or rigidly clamped. The basic solution is found to be essentially the same as that for the surface loading of a half space previously considered by Eason [1]. The displacement is determined in terms of elementary functions for one particular type of body force, although using the results in [1] the solution can be obtained for other types of force. Some numerical results for the surface displacement of the stress-free solid are presented in graphical form.

Let ‖x‖ denote the distance of x from the nearest integer. We are going to use a method of W. M. Schmidt [4] to prove three theorems.

This paper presents a new result concerning the distribution of 2-Selmer ranks in the quadratic twist family of an elliptic curve over an arbitrary number field $K$ with a single point of order two that does not have a cyclic 4-isogeny defined over its two-division field. We prove that at least half of all the quadratic twists of such an elliptic curve have arbitrarily large 2-Selmer rank, showing that the distribution of 2-Selmer ranks in the quadratic twist family of such an elliptic curve differs from the distribution of 2-Selmer ranks in the quadratic twist family of an elliptic curve having either no rational two-torsion or full rational two-torsion.

An example will be given of a compact linear set K which is of zero or non-σ-finite measure for every translation-invariant Borel measure. This answers a question asked me by C. Dellacherie.

It was shown by Davenport and Roth [7] that the values taken by

at integer points ( x1, …, x8) ∈ ℤ8 are dense on the real line, providing at least one of the ratios λi/λj, is irrational. Here and throughout, λi denote such nonzero real numbers. More precisely, Liu, Ng and Tsang [8] showed that for all the inequality

has infinitely many solutions in integers. Later Baker [1] obtained the same result in the enlarged range . In this note we improve this further, the progress being considerable.

The two examples of fluid motion in a container which are described in this paper can be easily demonstrated in any kitchen. The first motion was noticed by Professor C. A. Rogers while attempting to dissolve chlorine tablets in water to improve its drinkability. The water nearly filled a cylindrical jar and he had shaken it, with the axis of the jar horizontal, in such a way that the water had a considerable angular momentum about the axis. When the axis of the jar was suddenly moved into the vertical position, he noticed that the water was now rotating about the vertical, which prompted the question of the source of this vertical component of angular momentum. A simplified version of this motion is determined mathematically in §2, and the observations are found to be in general agreement with the theoretical prediction.

Professor C. L. Siegel has pointed out that the statement following equation (9) on page 98 of [1] is false, but can be made correct by adding to the conditions (7) of [1] the further condition:

§1. Let E = E(A) be the set of real numbers x ε (0, 1) whose regular continued fraction expansion

contains only partial denominators ai from a given set A of positive integers. For finite A the (Hausdorff-) dimensional numbers dim E have been studied by I. J. Good ‘2’ and T. W. Cusick ‘1’. C. A. Rogers ‘8’ introduced a natural probability measure on E. He showed that excluding sets with measure between 0 and 1 (in the strict sense) from E does not reduce the dimensionality more than excluding sets of measure zero, and that the minimal (“essential”) dimensions ess dim E arising in this way is smaller than dim E, at least for A = {1,…, r} when r = 2 or r is sufficiently large.

Let $A\subset \{1,\dots ,N\}$ be a set of prime numbers containing no non-trivial arithmetic progressions. Suppose that $A$ has relative density ${\it\alpha}=|A|/{\it\pi}(N)$, where ${\it\pi}(N)$ denotes the number of primes in the set $\{1,\dots ,N\}$. By modifying Helfgott and De Roton’s work [Improving Roth’s theorem in the primes. Int. Math. Res. Not. IMRN2011 (4) (2011), 767–783], we improve their bound and show that

$$\begin{eqnarray}{\it\alpha}\ll \frac{(\log \log \log N)^{6}}{\log \log N}.\end{eqnarray}$$

§1. Introduction, By a remarkable result of Erdos and Selfridge [3] in 1975. the diophantine equation

with integers k≥2 and m≥2, has only the trivial solutions. x = −j(j = i, …, m), y = 0. This put an end to the old question whether the product of consecutive positive integers could ever be a perfect power; for a brief account of its history see [7].

Let K/k be a normal extension of algebraic number fields whose Galois group G is a Frobenius group. Then K/k is said to be a Frobenius extension. Most of the structure of the unit group and of the ideal class group of K is determined by that; of the subfields fixed by the Frobenius kernel N and by a complement F. Here this is investigated when G is a maximal or metacyclic Frobenius group. In particular, the results apply firstly to the normal closure of where a ∊ k and p is a rational prime, and, secondly, when G is a dihedral group of order 2n for an odd integer n. A. Scholz, taking n = p = 3, was the first to consider this problem.

The following theorem is proved in [2[.

Let K be a finitely generated field over its prime field. Then for almost all e-tuples σ = (σ1, …, σe) of elements of the abstract Galois group G(K) of K and for all elliptic curves E defined over the following results hold.

Our main object in this note is to establish (Theorem 1) a necessary and sufficient condition to be satisfied by a sequence {εn} so that a series Σ an εnmay be summable | A |whenever the series Σanis summable (C, — 1). We suppose that an and εn are complex numbers. The condition is unchanged if the an are restricted to be real, but our proof is adapted to the case where they may be complex. Theorem 1 has been quoted by Bosanquet and Chow [12] in order to fill a gap in the theory of summability factors. We also obtain some related results, which are discussed in the Appendix.

In the kernel clustering problem we are given a large n × n positive-semidefinite matrix A = (aij) with and a small k × k positive-semidefinite matrix B = (bij). The goal is to find a partition S1, …, Sk of {1, … n} which maximizes the quantity

We study the computational complexity of this generic clustering problem which originates in the theory of machine learning. We design a constant factor polynomial time approximation algorithm for this problem, answering a question posed by Song et al. In some cases we manage to compute the sharp approximation threshold for this problem assuming the unique games conjecture (UGC). In particular, when B is the 3 × 3 identity matrix the UGC hardness threshold of this problem is exactly 16π/27. We present and study a geometric conjecture of independent interest which we show would imply that the UGC threshold when B is the k × k identity matrix is (8π/9)(1 – 1/k) for every k ≥ 3.

In this article, a discrete mean value of the derivative of the Riemann zeta function is computed. This mean value will be important for several applications concerning the size of ζ′(ρ), where ζ(s) is the Riemann zeta function and ρ is a non-trivial zero of ζ(s).

In Section 1 below I describe two measures of the complexity of a binary relation. J The theorem says that these two measures never disagree very much. Both measures of complexity arose in connection with Saharon Shelah's notion [5] of a stable firstt order theory; Shelah showed in effect that one measure is finite, if, and only if, the other is finite too. This follows trivially from the theorem below. I confess my main aim was not to get the extra information which the theorem provides, but to eliminate Shelah's use of uncountable cardinals, which seemed strangely heavy machinery for proving a purely finitary result. Section 2 below explains the modeltheoretic setting.

An original linear algebraic approach to the basic notion of Freiman's isomorphism is developed and used in conjunction with a combinatorial argument to answer two questions, posed by Freiman about 35 years ago.

First, the order of growth is established of t(n), the number of classes isomorphic n-element sets of integers: t(n) = n(2 + σ(1))n. Second, it is proved linear Roth sets (sets of integers free of arithmetic progressions and having Freiman rank 1) exist and, moreover, the number of classes of such cardinality n is amazingly large; in fact, it is “the same as above”: .

§1. Introduction. Most prominent among the classical problems in additive number theory are those of Waring and Goldbach type. Although use of the Hardy–Littlewood method has brought admirable progress, the finer questions associated with such problems have yet to find satisfactory solutions. For example, while the ternary Goldbach problem was solved by Vinogradov as early as 1937 (see Vinogradov [16], [17]), the latter's methods permit one to establish merely that almost all even integers are the sum of two primes (see Chudakov [4], van der Corput [5] and Estermann [7]).

Recently, an analogue over $\mathbb{F}_{q}[T]$ of Landau’s theorem on sums of two squares was considered by Bary-Soroker, Smilansky and Wolf. They counted the number of monic polynomials in $\mathbb{F}_{q}[T]$ of degree $n$ of the form $A^{2}+TB^{2}$, which we denote by $B(n,q)$. They studied $B(n,q)$ in two limits: fixed $n$ and large $q$; and fixed $q$ and large $n$. We generalize their result to the most general limit $q^{n}\rightarrow \infty$. More precisely, we prove

$$\begin{eqnarray}B(n,q)\sim K_{q}\cdot \binom{n-\frac{1}{2}}{n}\cdot q^{n},\quad q^{n}\rightarrow \infty ,\end{eqnarray}$$

$K_{q}=1+O(1/q)$