A group of integral points in a matrix parallelepiped

Let A be an n×n integral matrix with determinant D>0, and let P(A) be the n-parallelepiped determined by the columns {A_i}ⁿ_i=1 of A,

$\text{P(A)=}\text{∑}\text{i=1}\text{n}\text{x}{}_{\mathrm{i}}\text{A}{}_{\mathrm{i}}\text{0<x}{}_{\mathrm{i}}\text{<1}$

Let L be the set of integral vectors in P(A), and let G(A) be the subset of L consisting of vectors whose coefficients x_i satisfy 0?x_i<1. We show that G(A), equipped with addition modulo 1 on the coefficients x_i, is an Abelian group of order D, whose invariant factors are the invariant factors of the integral matrix A. We give a formula for |L|, and show that |L| is not a similarity invariant.     

Bounds for the uniform deviation of empirical measures

If X₁,…,X_n are independent identically distributed R^d-valued random vectors with probability measure μ and empirical probability measure μ_n, and if $\text{a}$ is a subset of the Borel sets on R^d, then we show that P{sup_{A∈$\text{a}$}|μ_n(A)?μ(A)|≥ε} ≤ cs($\text{a}$, n²)e^?2n∈2, where c is an explicitly given constant, and s($\text{a}$, n) is the maximum over all (x₁,…,x_n) ∈ R^dn of the number of different sets in {{x₁…,x_n}∩A|A ∈$\text{a}$}. The bound strengthens a result due to Vapnik and Chervonenkis.     

Some improvements in Neuberger's iteration procedure for solving partial differential equations

If m and n are positive integers then let S(m, n) denote the linear space over R whose elements are the real-valued symmetric n-linear functions on E_m with operations defined in the usual way. If $\text{U}$ is a function from some sphere S in E_m to R then let $\text{U}$⁽ⁱ⁾(x) denote the ith Frechet derivative of $\text{U}$ at x. In general $\text{U}$⁽ⁱ⁾(x)∈S(m,i). In the paper “An Iterative Method for Solving Nonlinear Partial Differential Equations” [Advances in Math. 19 (1976), 245–265] Neuberger presents an iterative procedure for solving a partial differential equation of the form

$\text{AU}{}^{\mathrm{n}}\text{(x)=F(x, U(x), U′(x),…,U}{}^{\mathrm{k}}\text{(x))}$

, where k > n, $\text{U}$ is the unknown from some sphere in E_m to R, A is a linear functional on S(m, n), and F is analytic. The defect in the theory presented there was that in order to prove that the iterates converged to a solution $\text{U}$ the condition $\text{k ?}\text{n}\text{2}$ was needed. In this paper an iteration procedure that is a slight variation on Neuberger's procedure is considered. Although the condition $\text{k ?}\text{n}\text{2}$ cannot as yet be eliminated, it is shown that in a broad class of cases depending upon the nature of the functional A the restriction $\text{k ?}\text{n}\text{2}$ may be replaced by the restriction $\text{k ?}\text{3n}\text{4}$.     

Numerical approximation of product integrals

A technique for the numerical approximation of matrix-valued Riemann product integrals is developed. For a ? x < y ? b, I_m(x, y) denotes

$\text{∫}\text{χ}\text{y}\text{∫}\text{χ}\text{v}{}_2\text{?}\text{∫}\text{χ}\text{v}{}_2\text{∏}\text{i=1}\text{m}\text{F(ν}{}_{\mathrm{i}}\text{)dν}{}_1\text{dν}{}_2\text{?dν}{}_{\mathrm{m}}$

, and A_m(x, y) denotes an approximation of I_m(x, y) of the form

$\text{(y?x)}{}^{\mathrm{m}}\text{∑}\text{k=1}\text{n}\text{a}{}_{\mathrm{k}}\text{∏}\text{i=1}\text{m}\text{F(χ}{}_{\mathrm{ik}}\text{)}$

, where a_k and y_ik are fixed numbers for i = 1, 2,…, m and k = 1, 2,…, N and x_ik = x + (y ? x)y_ik. The following result is established. If p is a positive integer, F is a function from the real numbers to the set of w × w matrices with real elements and F⁽¹⁾ exists and is continuous on [a, b], then there exists a bounded interval function H such that, if n, r, and s are positive integers, $\text{(b ? a)}\text{n}\text{= h < 1, x}{}_{\mathrm{i}}\text{= a + hi}\text{for}\text{i = 0, 1,…, n}\text{and}\text{0 < r ? s ? n}$, then

$\text{∏}\text{χ}{}_{\mathrm{r?}}\text{χ}{}_{\mathrm{s}}\text{(I+F dχ)?}\text{∏}\text{i=r}\text{s}\text{I+}\text{∑}\text{j=1}\text{p}\text{I}{}_{\mathrm{j}}\text{(χ}{}_{\mathrm{i?1}}\text{,χ}{}_{\mathrm{i}}\text{)}$

$\text{=h}{}^{\mathrm{p}}\text{H(χ}{}_{\mathrm{r?1}}\text{,χ}{}_{\mathrm{s}}\text{)+O(h}{}^{\mathrm{p+1}}\text{)}$

Further, if F^(j) exists and is continuous on [a, b] for j = 1, 2,…, p + 1 and A is exact for polynomials of degree less than p + 1 ? j for j = 1, 2,…, p, then the preceding result remains valid when A_j is substituted for I_j.     

On a problem of Katona on minimal completely separating systems with restrictions

Let S be a set of n elements, and k a fixed positive integer $\text{<}\text{1}\text{2}\text{n}$. Katona's problem is to determine the smallest integer m for which there exists a family $\text{A}$ = {A₁, …, A_m} of subsets of S with the following property: |_i| ? k (i = 1, …, m), and for any ordered pair x_i, x_i ∈ S (i ≠ j) there is A₁ ∈ $\text{A}$ such that x_i ∈ A₁, x_j ? A₁. It is given in this note that $\text{m = ?}\text{2n}\text{k}\text{?}\text{if}\text{1}\text{2}\text{k}{}^2\text{? 2}$.     

Inequalities and identities for generalized matrix functions

Let χ be a character on the symmetric group S_n, and let A = (a_ij) be an n-by-n matrix. The function d_χ(A) = Σ_σ?Snχ(σ)Πⁿ_{t = 1}a_tσ(t) is called a generalized matrix function. If χ is an irreducible character, then d_χ is called an immanent. For example, if χ is the alternating character, then d_χ is the determinant, and if χ ≡ 1, then d_χ is called the permanent (denoted per). Suppose that A is positive semidefinite Hermitian. We prove that the inequality $\text{(1/χ(}\text{id}\text{))d}{}_{\mathrm{\chi }}\text{(A) ?}\text{per}\text{A}$ holds for a variety of characters χ including the irreducible ones corresponding to the partitions (n ? 1,1) and (n ? 2,1,1) of n. The main technique used to prove these inequalities is to express the immanents as sums of products of principal subpermanents. These expressions for the immanents come from analogous expressions for Schur polynomials by means of a correspondence of D.E. Littlewood.     

Spectral theory of finite volume domains in Rn

Let Ω be an arbitrary open subset of $\text{R}$ⁿ of finite positive measure, and assume the existence of a subset Λ ? $\text{R}$ⁿ such that the exponential functions e_λ = exp i(λ₁x₁ + … + λ_nx_n), λ = (λ₁,…, λ_n) ∈ Λ, form an orthonormal basis for $\text{L}{}_2\text{(Ω)}$ with normalized measure. Assume 0 ∈ Λ and define subgroups K and A of ($\text{R}$ⁿ, +) by K = Λ⁰ = {γ ∈ $\text{R}$ⁿ:γ·λ ∈ 2π$\text{Z}$}, A = {a ∈ $\text{R}$ⁿ:U_a$\text{m}$ U1_a = $\text{m}$}, where U_t is the unitary representation of $\text{R}$ⁿ on $\text{L}{}_2\text{(Ω)}$ given by U_te = e^itλe_λ, t ∈ $\text{R}$ⁿ, λ ∈ Λ, and where $\text{m}$ is the multiplication algebra of $\text{L}{}_{\mathrm{\infty }}\text{(Ω)}$ on L₂. Assume that A is discrete. Then there is a discrete subgroup D ? A of dimension n, a fundamental domain $\text{D}$ for D, and finite sets of representers R_Λ, R_Γ, $\text{R}{}_{\mathrm{\Omega }}$, each containing 0, R_Λ for $\text{A}\text{K}$ in K⁰, and $\text{R}{}_{\mathrm{\Omega }}$ for $\text{A}\text{K}$ in A such that Ω is disjoint union of translates of $\text{D}$: Ω = ∪_a∈RΩ (a + $\text{D}$), neglecting null sets, and Λ = R_Λ ⊕ D⁰. If R_Γ is a set of representers for $\text{D}\text{A}$ in D, then Γ = R_Γ ⊕ K is a translation set for Ω, i.e., Ω ⊕ Γ = $\text{R}$ⁿ, direct sum, (neglecting null sets). The case A = $\text{R}$ⁿ corresponds to Ω = $\text{D}$, Λ = D⁰ and Γ = K. This last case corresponds in turn to a function theoretic assumption of Forelli.     

Extension de quelques theoremes sur les densites de series d'elements de n a des series de sous-ensembles finis de n

For a sequence A = {A_k} of finite subsets of N we introduce: $\text{δ(A) =}\text{inf}{}_{\mathrm{m?n}}\text{A(m)}\text{2}{}^{\mathrm{n}}$, $\text{d(A) =}\text{lim inf}{}_{\mathrm{n\to \infty }}\text{A(n)}\text{2}{}^{\mathrm{n}}$, where A(m) is the number of subsets A_k ? {1, 2, …, m}.The collection of all subsets of {1, …, n} together with the operation $\text{a ∪ b, (a ∩ b), (a 1 b = a ∪ b ? a ∩ b)}$ constitutes a finite semi-group N^∪ (semi-group N^∩) (group $\text{N}{}^1$). For N^∪, N^∩ we prove analogues of the Erdös-Landau theorem: δ(A+B) ? δ(A)(1+(2λ)^?1(1?δ(A>))), where B is a base of N of the average order λ. We prove for $\text{N}{}^{\mathrm{\cup }}\text{, N}{}^{\mathrm{\cap }}\text{, N}{}^1$ analogues of Schnirelmann's theorem (that δ(A) + δ(B) > 1 implies δ(A + B) = 1) and the inequalities λ ? 2h, where h is the order of the base.We introduce the concept of divisibility of subsets: a|b if b is a continuation of a. We prove an analog of the Davenport-Erdös theorem: if d(A) > 0, then there exists an infinite sequence {A_kr}, where A_kr | A_kr+1 for r = 1, 2, …. In Section 6 we consider for $\text{N∪, N∩, N1}$ analogues of Rohrbach inequality: $\text{2n}\text{? g(n) ? 2}\text{n}$, where g(n) = min k over the subsets {a₁ < … < a_k} ? {0, 1, 2, …, n}, such that every m? {0, 1, 2, …, n} can be expressed as m = a_i + a_j.Pour une série A = {A_k} de sous-ensembles finis de N on introduit les densités: $\text{δ(A) =}\text{inf}{}_{\mathrm{m?n}}\text{A(m)}\text{2}{}^{\mathrm{m}}$, $\text{d(A) =}\text{lim inf}{}_{\mathrm{n\to \infty }}\text{A(n)}\text{2}{}^{\mathrm{n}}$ où A(m) est le nombre d'ensembles A_k ? {1, 2, …, m}. L'ensemble de toutes les parties de {1, 2, …, n} devient, pour les opérations $\text{a ∪ b, a ∩ b, a 1 b = a ∪ b ? a ∩ b}$, un semi-groupe fini N^∪, N^∩ ou un groupe N¹ respectivement. Pour N^∪, N^∩ on démontre l'analogue du théorème de Erdös-Landau: δ(A + B) ? δ(A)(1 + (2λ)^?1(1?δ(A))), où B est une base de N d'ordre moyen λ. On démontre pour $\text{N}{}^{\mathrm{\cup }}\text{, N}{}^{\mathrm{\cap }}\text{, N}{}^1$ l'analogue du théorème de Schnirelmann (si δ(A) + δ(B) > 1, alors δ(A + B) = 1) et les inégalités λ ? 2h, où h est l'ordre de base. On introduit le rapport de divisibilité des enembles: a|b, si b est une continuation de a. On démontre l'analogue du théorème de Davenport-Erdös: si d(A) > 0, alors il existe une sous-série infinie {A_kr}, où A_kr|A_kr+1, pour r = 1, 2, … . Dans le Paragraphe 6 on envisage pour N^∪, $\text{N}{}^{\mathrm{\cap }}\text{, N}{}^1$ les analogues de l'inégalité de Rohrbach: $\text{2n}\text{? g(n) ? 2}\text{n}$, où g(n) = min k pour les ensembles {a₁ < … < a_k} ? {0, 1, 2, …, n} tels que pour tout m? {0, 1, 2, …, n} on a m = a_i + a_j.     

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{)}$.     

On the rate for uniform strong consistency of empirical distributions of independent nonidentically distributed multivariate random variables

Let X_j = (X_1j ,…, X_pj), j = 1,…, n be n independent random vectors. For x = (x₁ ,…, x_p) in R^p and for α in [0, 1], let F_j${}^1$(x) = αI(X_1j < x₁ ,…, X_pj < x_p) + (1 ? α) I(X_1j ≤ x₁ ,…, X_pj ≤ x_p), where I(A) is the indicator random variable of the event A. Let F_j(x) = E(F_j${}^1$(x)) and D_n = sup_{x, α} max_{1 ≤ N ≤ n} |Σ₀ⁿ(F_j${}^1$(x) ? F_j(x))|. It is shown that P[D_n ≥ L] < 4pL exp{?2(L²n^?1 ? 1)} for each positive integer n and for all L² ≥ n; and, as n → ∞, $\text{D}{}_{\mathrm{n}}\text{= 0((n}\text{log}\text{n)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{)}$ with probability one.     

Diophantine problems in variables restricted to the values 0 and 1

Let $\text{F}$x₁,…,x_s be a form of degree d with integer coefficients. How large must s be to ensure that the congruence $\text{F}$(x₁,…,x_s) ≡ 0 (mod m) has a nontrivial solution in integers 0 or 1? More generally, if $\text{F}$ has coefficients in a finite additive group G, how large must s be in order that the equation $\text{F}$(x₁,…,x_s) = 0 has a solution of this type? We deal with these questions as well as related problems in the group of integers modulo 1 and in the group of reals.     

A class of nonlinear elliptic problems

We obtain a strict coercivity estimate, (generalizing that of T. I. Seidman [J. Differential Equations 19 (1975), 242–257] in considering spatial variation) for second order elliptic operators A: u ? ?▽ · γ(·, ▽u) with γ “radial in the gradient” ?γ(·, ξ) = a(·, |ξ|)ξ for ξ ? $\text{R}$^m. The estimate is then applied to obtain existence of solutions of boundary value problems: $\text{?▽ ·}\text{a}\text{?}\text{(·, u, |▽u|) ▽u = f(·, u, ▽u)}$ with Dirichlet conditions.     

Permutation-operator inequalities on certain symmetry classes of tensors

If A∈T(m, N), the real-valued N-linear functions on E_m, and σ∈S_N, the symmetric group on {…,N}, then we define the permutation operator P_σ: T(m, N) → T(m, N) such that P_σ(A)(x₁,x₂,…,x_N = A(x_σ(1),x_σ(2),…, x_σ(N)). Suppose Σ^q_i=1n_i = N, where the n_i are positive integers. In this paper we present a condition on σ that is sufficient to guarantee that 〈P_σ(A₁?A₂???A_q),A₁?A₂?? ? A_q〉 ? 0 for A_i∈S(m, n_i), where S(m, n_i) denotes the subspace of T(m, n_i) consisting of all the fully symmetric members of T(m, n_i). Also we present a broad generalization of the Neuberger identity which is sometimes useful in answering questions of the type described below. Suppose G and H are subgroups of S_N. We let T_G(m, N) denote all A∈T(m, N) such that P_σ(A) = A for all σ∈G. We define the symmetrizer $\text{S}$_G: T(m, N)→T_G(m,N) such that $\text{S}{}_{\mathrm{G}}\text{(A) = 1/|G|Σ}{}_{\mathrm{\sigma \in G}}\text{P}{}_{\mathrm{\sigma }}\text{(A)}$. Suppose H is a subgroup of G and A∈T_H(m, N). Clearly $\text{6}\text{S}{}_{\mathrm{<mtext>G</mtext>}}\text{6(A) 6? 6A6.}$ We are interested in the reverse type of comparison. In particular, if D is a suitably chosen subset of T_H(m,N), then can we explicitly present a constant C>0 such that $\text{6}\text{S}{}_{\mathrm{G}}\text{(A)6?C6A6}$ for all A∈D?     

A method of feasible directions using function approximations,with applications to min max problems

This paper presents a demonstrably convergent method of feasible directions for solving the problem min{φ(ξ)| gⁱ(ξ)?0i=1,2,…,m}, which approximates, adaptively, both φ(x) and ▽φ(x). These approximations are necessitated by the fact that in certain problems, such as when $\text{φ(x) =}\text{max}\text{{f(x, y) ¦ y ? Ω}{}_{\mathrm{y}}\text{}}$, a precise evaluation of φ(x) and ▽φ(x) is extremely costly. The adaptive procedure progressively refines the precision of the approximations as an optimum is approached and as a result should be much more efficient than fixed precision algorithms.It is outlined how this new algorithm can be used for solving problems of the form $\text{min}{}_{\mathrm{y}}\text{? Ω}{}_{\mathrm{x}}\text{max}{}_{\mathrm{y}}\text{? Ω}{}_{\mathrm{y}}\text{f(x, y)}$ under the assumption that Ωm_ξ={x|gⁱ(x)?0, j=1,…,s} ∩$\text{R}$ⁿ, Ω_y={y|ζ_i(y)?0, i-1,…,t} ∩ $\text{R}$^m, with f, g^j, ζⁱ continuously differentiable, f(x, ·) concave, ζⁱ convex for $\text{i = 1,…, t,}\text{and}\text{Ω}{}_{\mathrm{x}}\text{, Ω}{}_{\mathrm{y}}$ compact.     

Equivalence of measures for some class of Gaussian random fields

We consider two Gaussian measures P₁ and P₂ on (C(G), $\text{B}$) with zero expectations and covariance functions R₁(x, y) and R₂(x, y) respectively, where R_ν(x, y) is the Green's function of the Dirichlet problem for some uniformly strongly elliptic differential operator A^(ν) of order $\text{2m, m ≥ [}\text{d}\text{2}\text{] + 1}$, on a bounded domain G in $\text{R}$^d (ν = 1, 2). It is shown that if the order of A⁽²⁾ ? A⁽¹⁾ is at most $\text{2m ? [}\text{d}\text{2}\text{] ? 1}$, then P₁ and P₂ are equivalent, while if the order is greater than $\text{2m ? [}\text{d}\text{2}\text{] ? 1}$, then P₁ and P₂ are not always equivalent.     

Fourier transforms of smooth functions on certain nilpotent Lie groups

The authors consider irreducible representations $\text{π ?}\text{N}\text{?}$ of a nilpotent Lie group and define a Fourier transform for Schwartz class (and other) functions φ on N by forming the kernels K_φ(x, y) of the trace class operations π_φ = ∝_Nφ(n)π_ndn, regarding the π as modeled in L²(R^k) for all π in general position. For a special class of groups they show that the models, and parameters λ labeling the representations in general position, can be chosen so the joint behavior of the kernels K_φ(x, y, λ) can be interpreted in a useful way. The variables (x, y, λ) run through a Zariski open set in Rⁿ, n = dim N. The authors show there is a polynomial map u = A(x, y, λ) that is a birational isomorphism A: Rⁿ → Rⁿ with the following properties. The Fourier transforms F₁φ = K_φ(x, y, λ) all factor through A to give “rationalized” Fourier transforms Fφ(u) such that Fφ ° A = F₁φ. On the rationalized parameter space a function f(u) is of the form F_φ = f ? f is Schwartz class on Rⁿ. If polynomial operators T?P(N) are transferred to operators $\text{T}\text{?}$ on Rⁿ such that $\text{F(Tφ) =}\text{T}\text{?}\text{(Fφ), P(N)}$ is transformed isomorphically to P(Rⁿ).     

On the maximum number of permutations with given maximal or minimal distance

Let us denote by R(k, ? λ)[R(k, ? λ)] the maximal number $\text{M}$ such that there exist $\text{M}$ different permutations of the set {1,…, k} such that any two of them have at least λ (at most λ, respectively) common positions. We prove the inequalities R(k, ? λ) ? kR(k ? 1, ? λ ? 1), R(k, ? λ) ? R(k, ? λ ? 1) ? k!, R(k, ? λ) ? kR(k ? 1, ? λ ? 1). We show: R(k, ? k ? 2) = 2, R(k, ? 1) = (k ? 1)!, R(p^m, ? 2) = (p^m ? 2)!, R(p^m + 1, ? 3) = (p^m ? 2)!, $\text{R(k, ? k ? 3) =}\text{k!}\text{2}$, R(k, ? 0) = k, R(p^m, ? 1) = p^m(p^m ? 1), R(p^m + 1, ? 2) = (p^m + 1)p^m(p^m ? 1). The exact value of R(k, ? λ) is determined whenever k ? k₀(k ? λ); we conjecture that R(k, ? λ) = (k ? λ)! for k ? k₀(λ). Bounds for the general case are given and are used to determine that the minimum of |R(k, ? λ) ? R(k, ? λ)| is attained for $\text{λ = (}\text{k}\text{2}\text{) + O(}\text{k}\text{log}\text{k}\text{)}$.     

On fair coin-tossing games

Let Ω be a finite set with k elements and for each integer $\text{n ≧ 1}$ let $\text{Ω}{}_{\mathrm{n}}\text{= Ω × Ω × … × Ω}$ (n-tuple) and $\text{Ω}{}_{\mathrm{n}}\text{= {(a}{}_1\text{, a}{}_2\text{,…, a}{}_{\mathrm{n}}\text{) | (a}{}_1\text{, a}{}_2\text{,…, a}{}_{\mathrm{n}}\text{) ∈ Ω}{}_{\mathrm{n}}$ and a_j ≠ a_j+1 for some 1 ≦ j ≦ n ? 1}. Let {Y_m} be a sequence of independent and identically distributed random variables such that P(Y₁ = a) = k^?1 for all a in Ω. In this paper, we obtain some very surprising and interesting results about the first occurrence of elements in $\text{Ω}{}_{\mathrm{n}}$ and in Ω?_n with respect to the stochastic process {Y_m}. The results here provide us with a better and deeper understanding of the fair coin-tossing (k-sided) process.     

On positional games

Let {A_i} be a family of sets and let S = ∩_iA_i. By a positional game we shall mean a game played by two players on {A_i}. The players alternately pick elements of S and that player wins who fist has all the elements of one of the A_i. This paper deals with almost disjoint hypergraphs only, i.e., |A_i∪A_j| ? 1 if i ≠ j. Let $\text{M}{}^1\text{(n)}$ be the smallest integer for which there is an almost disjoint n-uniform hypergraph $\text{|T| = M}{}^1\text{(n)}$, so that the first player has a winning strategy. It is shown that $\text{lim}{}_{\mathrm{n}}\text{[M}{}^1\text{(n)]}{}^{\mathrm{<mtext>1</mtext><mtext>n</mtext>}}\text{= 4}$, which was conjectured by Erdös. The same method is applied to prove a conjecture of Hales and Jewett on r-dimensional tick-tack-toe if r is large enough. Finally we prove that for an arbitrary almost disjoint n-uniform hypergraph the second player has such a strategy that the first player unable to win in his mth move if m < (2 ? ?)ⁿ.