A radical diophantine equation

All solutions in positive integers x, yz of the diophantine equation $\text{x}{}^{\mathrm{<mtext>1</mtext><mtext>m</mtext>}}\text{+ y}{}^{\mathrm{<mtext>1</mtext><mtext>n</mtext>}}\text{= z}{}^{\mathrm{<mtext>1</mtext><mtext>r</mtext>}}$ are determined, where m, n, r are given positive integers. The proof makes use of a simple criterion for the irreducibility of the polynomial xⁿ ? a over the rationals, where a is a positive rational.     

The covering problem for the fields Q(−1)12 and Q(−3)12

Let k be a positive square free integer, $\text{N(?k)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ the ring of algebraic integers in $\text{Q(?k)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ and S the unit sphere in C_n, complex n-space. If A₁,…, A_n are n linearly independent points of C_n then L = {u₁Au + … + u_nA_n} with $\text{u}{}_{\mathrm{r}}\text{∈ N(?k)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ is called a k-lattice. The determinant of L is denoted by d(L). If L is a covering lattice for S, then $\text{θ(S, L) =}\text{V(S)}\text{d(L)}$ is the covering density. L is called locally (absolutely) extreme if θ(S, L) is a local (absolute) minimum. In this paper we determine unique classes of extreme lattices for k = 1 and k = 3.     

The weight distribution of irreducible cyclic codes with block lengths n1((q1−1)N)

We study the weight distribution of irreducible cyclic (n, k) codeswith block lengths n = n₁((q¹ ? 1)/N), where N|q ? 1, gcd(n₁,N) = 1, and gcd(l,N) = 1. We present the weight enumerator polynomial, A(z), when k = n₁l, k = (n₁ ? 1)l, and k = 2l. We also show how to find A(z) in general by studying the generator matrix of an (n₁, m) linear code, $\text{V}{}^1{}_{\mathrm{d}}$ over GF(q^d) where d = gcd (ord_n1(q), l). Specifically we study A(z) when $\text{V}{}^1{}_{\mathrm{d}}$ is a maximum distance separable code, a maximal shiftregister code, and a semiprimitive code. We tabulate some numbers A_μ which completely determine the weight distributionof any irreducible cyclic (n₁(2¹ ? 1), k) code over GF(2) for all n₁ ? 17.     

Phase reconstruction from magnitude of band-limited multidimensional signals

In this paper, the problem of phase reconstruction from magnitude of multidimensional band-limited functions is considered. It is shown that any irreducible band-limited function f(z₁…,z_n), z_i ? $\text{C}$, i=1, …, n, is uniquely determined from the magnitude of f(x₁…,x_n): | f(x₁…,x_n)|, x_i ? $\text{R}$, i=1,…, n, except for (1) linear shifts: ^{i(α1z1+…+α_n2n+β}), β, α_i?$\text{R}$, i=1,…, n; and (2) conjugation: $\text{f}{}^1\text{(z}{}_1{}^1\text{,…,z}{}_{\mathrm{n}}{}^1\text{)}$.     

Pairs of additive equations II. Large odd degree

Let k be an odd positive integer. Davenport and Lewis have shown that the equations

$\text{a}{}_1\text{x}{}_1{}^{\mathrm{k}}\text{+…+a}{}_{\mathrm{n}}\text{x}{}_{\mathrm{n}}{}^{\mathrm{k}}\text{=0}$

with integer coefficients, have a nontrivial solution in integers x₁,…, x_N provided that

$\text{N?[36klog6k]}$

Here it is shown that for any ? > 0 and k > k₀(?) the equations have a nontrivial solution provided that

$\text{N?}\text{8}\text{log 2}\text{+?}\text{k log k.}$

     

Nonstandard points on algebraic curves

Let Γ be an algebraic curve which is given by an equation f(x, y) = 0, f(x, y) ∈ k[x, y] where k is an algebraic number field and f(x, y) is irreducible. Suppose that there exists an ${}^1\text{Γ}$ a nonstandard point $\text{(ξ, η) ∈}{}^1\text{k ×}{}^1\text{k}$. Then k(ξ, η) is (isomorphic to) the algebraic function field of Γ and, at the same time, is a subfield of ${}^1\text{k}$. Correlating the divisors of the function field k(ξ, η) and of the number field ${}^1\text{k}$, we develop an analogue of the Artin-Whaples theory of the product formula. This leads to one of Siegel's basic inequalities for rational points on algebraic curves.     

On the closability of some positive definite symmetric differential forms on c0∞(ω)

Let $\text{S}$ be a Dirichlet form in $\text{L}{}^2\text{(Ω; m)}$, where Ω is an open subset of $\text{R}$ⁿ, n ? 2, and m a Radon measure on Ω; for each integer k with 1 ? k < n, let $\text{S}$_k be a Dirichlet form on some k-dimensional submanifold $\text{Ω}{}_{\mathrm{k}}$ of Ω. The paper is devoted to the study of the closability of the forms E with domain $\text{C}{}_0{}^{\mathrm{\infty }}\text{(Ω)}$ and defined by: $\text{(?,g)=}$$\text{E}$$\text{(?, g)+}\text{∑}\text{i}\text{p}\text{=1}$$\text{E}$k_i where 1 ? k_p < ? < n, and where , g^k_i denote restrictions of ?, g in $\text{C}{}_0{}^{\mathrm{\infty }}\text{(Ω)}$ to . Conditions are given for E to be closable if, for each i = 1,…, p, one has k_i = n ? i. Other conditions are given for E to be nonclosable if, for some i, k_i < n ? i.     

Attractivity of the origin for the equation ẍ + f(t,x, ẋ) ¦ ẋ ¦αẋ + g(x) = 0

Sufficient conditions for asymptotic stability and global attractivity of the origin are obtained in the case of “unbounded damping”: $\text{f(t, x,}\text{x}\text{?}\text{) > a > 0}$. Restrictions on the unboundedness in t of $\text{f(t, x,}\text{x}\text{?}\text{)}$ are specified for either attractivity or nonattractivity of the origin. Roughly speaking, if there exists a nondecreasing function h(t) such that $\text{f(t, x,}\text{x}\text{?}\text{) < h(t)}$ and $\text{∝}{}^{\mathrm{\infty }}\text{dt}\text{h(t)}\text{=∞}$, the origin is an attractor; if $\text{f(t, x,}\text{x}\text{?}\text{) > h(t)}$ and $\text{∝}{}^{\mathrm{\infty }}\text{dt}\text{h(t)}\text{< ∞}$, it is not. These results are compared with several ones previously obtained by other authors. An attractivity criterion is given for the linear equation and a sufficient attractivity condition is obtained for dampings not bounded away from zero: $\text{0 < f(t, x,}\text{x}\text{?}\text{) < a}$.     

Arithmetic in generalized Artin-Schreier extensions of k(x)

If k is a perfect field of characteristic p ≠ 0 and k(x) is the rational function field over k, it is possible to construct cyclic extensions K_n over k(x) such that [K : k(x)] = pⁿ using the concept of Witt vectors. This is accomplished in the following way; if [β₁, β₂,…, β_n] is a Witt vector over k(x) = K₀, then the Witt equation $\text{y}{}^{\mathrm{p}}\text{?}\text{y}\text{= β}$ generates a tower of extensions through $\text{K}{}_{\mathrm{i}}\text{= K}{}_{\mathrm{i?1}}\text{(}\text{y}{}_{\mathrm{i}}\text{)}$ where $\text{y}\text{= [}\text{y}{}_1\text{,}\text{y}{}_2\text{,…,}\text{y}{}_{\mathrm{n}}\text{]}$. In this paper, it is shown that there exists an alternate method of generating this tower which lends itself better for further constructions in K_n. This alternate generation has the form K_i = K_i?1(y_i); y_i^p ? y_i = B_i, where, as a divisor in K_i?1, B_i has the form . In this form q is prime to Πp_j^λ_j and each λ_j is positive and prime to p. As an application of this, the alternate generation is used to construct a lower-triangular form of the Hasse-Witt matrix of such a field K_n over an algebraically closed field of constants.     

Petites valeurs de la fonction d'Euler

Let φ be the Euler's function. A question of Rosser and Schoenfeld is answered, showing that there exists infinitely many n such that $\text{n}\text{φ(n)}\text{> e}{}^{\mathrm{y}}\text{log log}\text{n}$, where γ is the Euler's constant. More precisely, if N_k is the product of the first k primes, it is proved that, under the Riemann's hypothesis, $\text{N}{}_{\mathrm{k}}\text{φ(N}{}_{\mathrm{k}}\text{)}\text{> e}{}^{\mathrm{y}}\text{log log}\text{N}{}_{\mathrm{k}}$ holds for any k ≥ 2, and, if the Riemann's hypothesis is false this inequality holds for infinitely many k, and is false for infinitely many k.     

On the probability that k positive integers are relatively prime II

Given a set S of positive integers let $\text{Z}{}_{\mathrm{k}}{}^{\mathrm{S}}\text{(t)}$ denote the number of k-tuples 〈m₁, …, m_k〉 for which $\text{m}{}_{\mathrm{i}}\text{∈ S ? [1, t]}$ and (m₁, …, m_k) = 1. Also let $\text{P}{}_{\mathrm{k}}{}^{\mathrm{S}}\text{(n)}$ denote the probability that k integers, chosen at random from $\text{S ? [1, n]}$, are relatively prime. It is shown that if P = {p₁, …, p_r} is a finite set of primes and S = {m : (m, p₁ … p_r) = 1}, then $\text{Z}{}_{\mathrm{k}}{}^{\mathrm{S}}\text{(t) = (td(S))}{}^{\mathrm{k}}\text{Π}{}_{\mathrm{\nu ?P}}\text{(1 ?}\text{1}\text{p}{}^{\mathrm{k}}\text{) + O(t}{}^{\mathrm{k?1}}\text{)}$ if k ≥ 3 and $\text{Z}{}_2{}^{\mathrm{S}}\text{(t) = (td(S))}{}^2\text{Π}{}_{\mathrm{p?P}}\text{(1 ?}\text{1}\text{p}{}^2\text{) + O(t}\text{log}\text{t)}$ where d(S) denotes the natural density of S. From this result it follows immediately that $\text{P}{}_{\mathrm{k}}{}^{\mathrm{S}}\text{(n) → Π}{}_{\mathrm{p?P}}\text{(1 ?}\text{1}\text{p}{}^{\mathrm{k}}\text{) = (ζ(k))}{}^{\mathrm{?1}}\text{Π}{}_{\mathrm{p\in P}}\text{(1 ?}\text{1}\text{p}{}^{\mathrm{k}}\text{)}{}^{\mathrm{?1}}$ as n → ∞. This result generalizes an earlier result of the author's where $\text{P = ?}$ and S is then the whole set of positive integers. It is also shown that if S = {p₁^x₁ … p_r^x_r : x_i = 0, 1, 2,…}, then $\text{P}{}_{\mathrm{k}}{}^{\mathrm{S}}\text{(n) → 0}$ as n → ∞.     

Bernstein's asymptotic best bound for the Kth derivative of a polynomial

A complete proof, which yields an error term showing a dependence on n and x, is given for Bernstein's result that the best bound on the kth derivative on polynomials of degree less than or equal to n, at a point x in ( ?1, 1), is asymptotic to $\text{(}\text{n}\text{√1 ? x}{}^2\text{)}{}^{\mathrm{k}}$ as n tends to infinity.     

On the order of the error function of the (k,r)-integers

Let k and r be fixed integers such that 1 < r < k. Any positive integer n of the form n = a^kb, where b is r-free, is called a (k, r)-integer. In this paper we prove that if Q_k,r(x) denotes the number of (k, r)-integers ≤ x, then $\text{Q}{}_{\mathrm{k,r}}\text{(x) =}\text{xζ(k)}\text{ζ(r)}\text{+ Δ}{}_{\mathrm{k,r}}\text{(x)}$, where $\text{Δ}{}_{\mathrm{k,r}}\text{(x) = O(x}{}^{\mathrm{<mtext>1</mtext><mtext>r</mtext>}}\text{exp}\text{[?B}\text{log}{}^{\mathrm{<mtext>3</mtext><mtext>5</mtext>}}\text{x (}\text{log log}\text{x)}{}^{\mathrm{<mtext>?</mtext><mtext>1</mtext><mtext>5</mtext>}}\text{])}$, B being a positive constant depending on r and the O-estimate is uniform in k. On the assumption of the Riemann hypothesis, we improve the above order estimate of Δ_k,r(x) and prove that

$\text{1}\text{x}\text{∫}\text{1}\text{α}\text{δ}{}_{\mathrm{k,r}}\text{(t)dt=0(x}\text{1}\text{k}\text{ω(x))}\text{or}\text{0(x}{}^{\mathrm{3/(4r+1)}}\text{ω(x))}$

, according as $\text{k ≤}\text{(4r + 1)}\text{3}$ or $\text{k >}\text{(4r + 1)}\text{3}$, where ω(x) = exp [B log x(log log x)^?1].     

Starting in maximum-polynomial-degree Nordsieck-Gear methods

The intent of this paper is to show that the Nordsieck-Gear methods with maximum polynomial degree k+1, first described in [1], admit of matched starting methods which are exact for all polynomials of degree ?k+1. In general, it is shown that these starting methods yield starting errors of the required order, O(h^k+2), for all initial-value problems

$\text{y}{}^{\mathrm{(P)}}\text{(x)=f(x,y,y}{}^{\mathrm{(1)}}\text{,y}{}^{\mathrm{(2)}}\text{,…,y}{}^{\mathrm{(p?1)}}\text{),}$

$\text{y(0)=y}{}_0\text{, y}{}^{\mathrm{i}}\text{(0)=y}{}_0{}^{\mathrm{(i)}}\text{, i=1,2,…,p?1,}$

where f is k+1 times continuously differentiable in a neighborhood of the graph of the exact solution (x,?(x)), x?[0,X]. Two theorems are proved. The first is the constructive existence of an algorithm which requires (k-p+1)(k-p+2)/2 evaluations of the function f to obtain approximations of the method's required higher-order scaled derivatives at the origin:

$\text{h}{}^{\mathrm{p+1}}\text{y}\text{?}{}^{\mathrm{(p+1)}}\text{(0)}\text{(p+1)!}\text{,…,}\text{h}{}^{\mathrm{k}}\text{y}\text{?}{}^{\mathrm{(k)}}\text{(0)}\text{k!}\text{,}$

each of which is accurate to O(h^k+2). The second, less general theorem, shows that when f is a polynomial in x, y, and its higher order derivatives y⁽¹⁾,y⁽²⁾,…,y(^p?1), an algorithm can be constructed for obtaining the higher-order scaled derivatives exactly. These results lay to rest once and for all any heuristic arguments against varying corrector minus predictor coefficients for preserving maximal order (polynomial degree) because starting values are inexact. Furthermore, and perhaps most importantly, the maximum-polynomial-degree Nordsieck-Gear methods are shown to have a unique property of zero starting error for an important class of ordinary differential equations.     

On a function due to S. Chowla

Let θ(k, pⁿ) be the least s such that the congruence $\text{x}{}_1{}^{\mathrm{k}}\text{+ ? + x}{}_{\mathrm{s}}{}^{\mathrm{k}}\text{≡ 0}$ (mod pⁿ) has a nontrivial solution. It is shown that if k is sufficiently large and divisible by p but not by p ? 1, then $\text{θ(k, p}{}^{\mathrm{n}}\text{) ≤ k}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$. We also obtain the average order of θ(k), the least s such that the above congruence has a nontrivial solution for every prime p and every positive integer n.     

The existence,uniqueness, and instability of spherically symmetric solutions of a system of reaction—Diffusion equations

The system $\text{?x}\text{?t}\text{= Δx + F(x,y),}\text{?y}\text{?t}\text{= G(x,y)}$ is investigated, where x and y are scalar functions of time (t ? 0), and n space variables $\text{(ξ}{}_1\text{,…, ξ}{}_{\mathrm{n}}\text{), Δx ≡ ∑}{}_{\mathrm{i\; =\; 1}}{}^{\mathrm{n}}\text{?}{}^2\text{x}\text{?ξ}{}_{\mathrm{i}}{}^2$, and F and G are nonlinear functions. Under certain hypotheses on F and G it is proved that there exists a unique spherically symmetric solution $\text{(x(r),y(r)),}\text{where}\text{r = (ξ}{}_1{}^2\text{+ … + ξ}{}_{\mathrm{n}}{}^2\text{)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$, which is bounded for r ? 0 and satisfies x(0) >x₀, y(0) > y₀, x′(0) = 0, y′(0) = 0, and x′ < 0, y′ > 0, ?r > 0. Thus, (x(r), y(r)) represents a time independent equilibrium solution of the system. Further, the linearization of the system restricted to spherically symmetric solutions, around (x(r), y(r)), has a unique positive eigenvalue. This is in contrast to the case n = 1 (i.e., one space dimension) in which zero is an eigenvalue. The uniqueness of the positive eigenvalue is used in the proof that the spherically symmetric solution described is unique.     

A vector exchange property of submodular systems

Generalizing the multiple basis exchange property for matroids, the following theorem is proved: If x and y are vectors of a submodular system in $\text{R}{}^{\mathrm{E}}$ and $\text{x}{}_1\text{,x}{}_2\text{?}\text{R}{}^{\mathrm{E}}$ such that x = x₁ + x₂, then there are $\text{y}{}_1\text{,y}{}_2\text{?}\text{R}{}^{\mathrm{E}}$ such that y = y₁ + y₂ and both x₁ + y₁ and x₂ + y₂ belong to the submodular system.An integral analogue holds for the integral submodular systems and a non-negative analogue for polymatroids.     

A canonical decomposition of the probability measure of sets of isotropic random points in Rn

The probability measure of X = (x₀,…, x_r), where x₀,…, x_r are independent isotropic random points in $\text{R}$ⁿ (1 ≤ r ≤ n ? 1) with absolutely continuous distributions is, for a certain class of distributions of X, expressed as a product measure involving as factors the joint probability measure of (ω, ?), the probability measure of p, and the probability measure of $\text{Y}{}^1\text{= (y}{}_0{}^1\text{,…, y}{}_{\mathrm{r}}{}^1\text{)}$. Here ω is the r-subspace parallel to the r-flat η determined by X, ? is a unit vector in ω^⊥ with ‘initial’ point at the origin [ω^⊥ is the (n ? r)-subspace orthocomplementary to ω], p is the norm of the vector z from the origin to the orthogonal projection of the origin on η, and $\text{y}{}_{\mathrm{i}}{}^1\text{=}\text{(x}{}_{\mathrm{i}}\text{? z)}\text{α(p}{}^2\text{)}$, where α is a scale factor determined by p. The probability measure for ω is the unique probability measure on the Grassmann manifold of r-subspaces in $\text{R}$ⁿ invariant under the group of rotations in $\text{R}$ⁿ, while the conditional probability measure of ? given ω is uniform on the boundary of the unit (n ? r)-ball in ω^⊥ with centre at the origin. The decomposition allows the evaluation of the moments, for a suitable class of distributions of X, of the r-volume of the simplicial convex hull of {x₀,…, x_r} for 1 ≤ r ≤ n.     

The probability that k positive integers are relatively r-prime

If r, k are positive integers, then $\text{T}{}_{\mathrm{k}}{}^{\mathrm{r}}\text{(n)}$ denotes the number of k-tuples of positive integers (x₁, x₂, …, x_k) with 1 ≤ x_i ≤ n and (x₁, x₂, …, x_k)_r = 1. An explicit formula for $\text{T}{}_{\mathrm{k}}{}^{\mathrm{r}}\text{(n)}$ is derived and it is shown that $\text{lim}{}_{\mathrm{n\to \infty }}\text{T}{}_{\mathrm{k}}{}^{\mathrm{r}}\text{(n)}\text{n}{}^{\mathrm{k}}\text{=}\text{1}\text{ζ(rk)}$.If S = {p₁, p₂, …, p_a} is a finite set of primes, then 〈S〉 = {p₁^a₁p₂^a₂…p_s^a_s; p_i ∈ S and a_i ≥ 0 for all i} and $\text{T}{}_{\mathrm{k}}{}^{\mathrm{r}}\text{(S, n)}$ denotes the number of k-tuples (x₁, x₃, …, x_k) with 1 ≤ x_i ≤ n and (x₁, x₂, …, x_k)_r ∈ 〈S〉. Asymptotic formulas for $\text{T}{}_{\mathrm{k}}{}^{\mathrm{r}}\text{(S, n)}$ are derived and it is shown that $\text{lim}{}_{\mathrm{n\to \infty }}\text{T}{}_{\mathrm{k}}{}^{\mathrm{r}}\text{(S, n)}\text{n}{}^{\mathrm{k}}\text{=}\text{(p}{}_1\text{… p}{}_{\mathrm{a}}\text{)}{}^{\mathrm{rk}}\text{ζ(rk)(p}{}_1{}^{\mathrm{rk}}\text{? 1) … (p}{}_{\mathrm{s}}{}^{\mathrm{rk}}\text{? 1)}$.     

K2 and K3 of the circle

Let k be $\text{Z}\text{[}\text{1}\text{2}\text{]}$, $\text{Q}$ or $\text{R}$, and set $\text{A =}\text{k[x,y]}\text{(x}{}^2\text{+ y}{}^2\text{? 1)}$. We compute K₂(A) and K₃(A). Our method is to construct a map $\text{? : K}{}_1\text{(k[i])→K}{}_{\mathrm{1\; +\; 1}}\text{(A)}$ and compare this to a localization sequence.We give three applications. We show that ? accounts for the primitive elements in K₂(A), and compare our results to computations of Bloch [1] for group schemes. Secondly, we consider the problem of basepoint independence, and indicate the interplay of geometry upon the K-theory of affine schemes obtained by glueing points of Spec(A). Third, we can iterate the construction to compute the K-theory of the torus ring A ?_kA.