THE EXTREME POINTS OF SEVERAL CLASSES OF ANALYTIC FUNCTIONS

1Intr0ducti0nLetAden0tethesetofallfunctionsanalyticinA={z:Izl<1}.LetB={W:WEAandIW(z)l51}.Aisalocallyconvexlineaztop0l0gicalspacewithrespecttothetopologyofuniformconvergenceon`c0mpact8ubsetsofA-LetTh(c1,'tc.-1)={p(z):p(z)EA,Rop(z)>0,p(z)=1 clz czzz ' c.-lz"-l 4z" ',wherecl,',cn-1areforedcomplexconstants}.LetTh,.(b,,-..,b,-,)={p(z):P(z)'EAwithReP(z)>Oandp(z)=1 blz ' b.-lz"-l 4z" '-,wherebl,-'-jbu-1areffeedrealconstantsanddkarerealnumbersf0rk=n,n 1,'--}-LetTu(l1,'i'tI.-1)={…     

A symmetry relationship for a class of partitions

Let S(n, k, v) denote the number of vectors (a₀,…, a_n?1) with nonnegative integer components that satisfy a₀ + … + a_{n ? 1} = k and Σ_i=0^n?1ia_i ≡ v (mod n). Two proofs are given for the relation S(n, k, v) = S(k, n, v). The first proof is by algebraic enumeration while the second is by combinatorial construction.     

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.     

An algorithm to compute <Emphasis Type="Italic">ω</Emphasis>-primality in a numerical monoid

Let M be a commutative, cancellative, atomic monoid and x a nonunit in M. We define ω(x)=n if n is the smallest positive integer with the property that whenever x∣a ₁???a _t , where each a _i is an atom, there is a T?{1,2,…,t} with |T|≤n such that x∣∏_k∈T a _k . The ω-function measures how far x is from being prime in M. In this paper, we give an algorithm for computing ω(x) in any numerical monoid. Simple formulas for ω(x) are given for numerical monoids of the form 〈n,n+1,…,2n?1〉, where n≥3, and 〈n,n+1,…,2n?2〉, where n≥4. The paper then focuses on the special case of 2-generator numerical monoids. We give a formula for computing ω(x) in this case and also necessary and sufficient conditions for determining when x is an atom. Finally, we analyze the asymptotic behavior of ω(x) by computing \(\lim_{x\rightarrow \infty}\frac{\omega(x)}{x}\).     

The general divisor problem

Let Δ_k(x) = Δ(a₁, …, a_k; x) be the error term in the asymptotic formula for the summatory function of the general divisor function d(a₁, …, a_k; n), which is generated by ζ(a₁s) … ζ(a_ks) (1 ≤ a₁ ≤ … ≤ a_k are fixed integers). Precise omega results for the mean square integral ∫₁^x Δ_k²(x) dx are given, with applications to some specific divisor problems.     

Partitions of large multipartites with congruence conditions. II

For 1 ≦ l ≦ j, let $\text{a}$_l = ?_h=1^q(l){a_lh + Mv: v = 0, 1, 2,…}, where j, M, q(l) and the a_lh are positive integers such that j > 1, a_l1 < … < a_lq(2) ≦ M, and let $\text{a}$_l^′ = $\text{a}$_l ∪ {0}. Let p(n : $\text{B}$) be the number of partitions of n = (n₁,…,n_j) where, for 1 ≦ l ≦ j, the lth component of each part belongs to $\text{B}$_l and let p¹(n : $\text{B}$) be the number of partitions of n into different parts where again the lth component of each part belongs to $\text{B}$_l. Asymptotic formulas are obtained for p(n : $\text{a}$), p¹(n : $\text{a}$) where all but one n_l tend to infinity much more rapidly than that n_l, and asymptotic formulas are also obtained for p(n : $\text{a}$′), p¹(n ; $\text{a}$′), where one n_l tends to infinity much more rapidly than every other n_l. These formulas contrast with those of a recent paper (Robertson and Spencer, Trans. Amer. Math. Soc., to appear) in which all the n_l tend to infinity at approximately the same rate.     

The periods of the sequences generated by some symmetric shift registers

E_k(x₂,…, x_n) is defined by E_k(a₂,…, a_n) = 1 if and only if ∑_i=2ⁿa_i = k. We determine the periods of sequences generated by the shift registers with the feedback functions x₁ + E_k(x₂,…, x_n) and x₁ + E_k(x₂,…, x_n) + E_k+1(x₂,…, x_n) over the field GF(2).     

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.     

Multiplicative infinite loop space theory

Let G be a finitely presented group given by its pre-abelian presentation <X1,…,Xm; Xe11ζ1,…,Xemmζ,ζm+1,…>, where ei≥0 for i = 1,…, m and ζj?G′ for j≥1. Let N be the subgroup of G generated by the normal subgroups [xeii, G] for i = 1,…, m. Then Dn+2(G)≡γn+2(G) (modNG′) for all n≥0, where G” is the second commutator subgroup of G,γn+2(G) is the (n+2)th term of the lower central series of G and Dn+2(G) = G∩(1+△n+2(G)) is the (n+2)th dimension subgroup of G.     

A Functional Equation Of J.A. Baker Involving Integral Means

The functional equation $$f(x)={1\over 2}\int^{x+1}_{x-1}f(t)\ dt\ \ \ {\rm for}\ \ \ x\ \in\ {\rm R}$$ has the linear functions ?(x) = a + bx (a, b ∈ ?) as trivial solutions. It is shown that there are two kinds of nontrivial solutions, (i) ?(x) = eλ_i ^x (i = 1, 2, …), where the λ_i∈ ? are the fixed points of the map z ? sinh z, and (ii) C^∞-solutions ? for which the values in the interval [?1,1] can be prescribed arbitrarily, but with the provision that ?^(j)(? 1) = ?^(j)(0) = ?^(j)(1) = 0 for all j = 0, 1, 2 …     

Random fields associated with multiple points of the Brownian motion

Let X_t be the Brownian motion in $\text{R}$^d. The random set Γ = {(t₁,…, t_n, z): X_tl = ··· = X_tn = z} in $\text{R}$^{d + n} is empty a.s. except in the following cases: (a) n = 1, d = 1, 2,…; (b) d = 2, n = 2, 3,…; (c) d = 3, n = 2. In each of these cases, a family of random measures M_λ concentrated on Γ is constructed (λ takes values in a certain class of measures on $\text{R}$^d). Measures M_λ characterize the time-space location of self-intersections for Brownian paths. If n = d = 1, then M_λ(dt, dz) = λ(dz) N_z(dt) where N₂ is the local time at z. In the case n = 2, the set Γ can be identified with the set of Brownian loops. The measure M_λ “explodes” on the diagonal {t₁ = t₂} and, to study small loops, a random distribution which regularizes M_λ is constructed.     

A bound for the number of tournaments with specified scores

Let $\text{T}$(R) denote the set of all tournaments with score vector R = (r₁, r₂,…, r_n). R. A. Brualdi and Li Qiao (“Proceedings of the Silver Jubilee Conference in Combinatorics at Waterloo,” in press) conjectured that if R is strong with r₁ ≤ r₂ ≤ … ≤ r_n, then |$\text{T}$(R)| ≥ 2^n?2 with equality if and only if R = (1, 1, 2,…, n ? 3, n ? 2, n ? 2). In this paper their conjecture is proved, and this result is used to establish a lower bound on the cardinality of $\text{T}$(R) for every R.     

Centralizers of generalized derivations on multilinear polynomials in prime rings

Let R be a prime ring of characteristic different from 2, with Utumi quotient ring U and extended centroid C, δ a nonzero derivation of R, G a nonzero generalized derivation of R, and f(x ₁, …, x _n ) a noncentral multilinear polynomial over C. If δ(G(f(r ₁, …, r _n ))f(r ₁, …, r _n )) = 0 for all r ₁, …, r _n ∈ R, then f(x ₁, …, x _n )² is central-valued on R. Moreover there exists a ∈ U such that G(x) = ax for all x ∈ R and δ is an inner derivation of R such that δ(a) = 0.     

On likelihood ratio ordering of parallel systems with exponential components

Let T(λ₁,...,λ _n ) be the lifetime of a parallel system consisting of exponential components with hazard rates λ₁,...,λ _n , respectively. For systems with only two components, Dykstra et. al. (1997) showed that if (λ₁, λ₂) majorizes (γ₁, γ₂), then, T(λ₁, λ₂) is larger than T(γ₁, γ₂) in likelihood ratio order. In this paper, we extend this theorem to general parallel systems. We introduce a new partial order, the so-called d-larger order, and show that if (λ₁,...,λ _n ) is d-larger than (γ₁,...,γ _n ), then T(λ₁,...,λ _n ) is larger than T(γ₁,...,γ _n ) in likelihood ratio order.     

Some permutation problems

Put Z_n = {1, 2,…, n} and let π denote an arbitrary permutation of Z_n. Problem I. Let π = (π(1), π(2), …, π(n)). π has an up, down, or fixed point at a according as a < π(a), a > π(a), or a = π(a). Let $\text{A}\text{(r, s, t)}$ be the number of π ∈ Z_n with r ups, s downs, and t fixed points. Problem II. Consider the triple π^?1(a), a, π(a). Let R denote an up and F a down of π and let B(n, r, s) denote the number of π ∈ Z_n with r occurrences of π^?1(a)RaRπ(a) and s occurrences of π^?1(a)FaFπ(a). Generating functions are obtained for each enumerant as well as for a refinement of the second. In each case use is made of the cycle structure of permutations.     

On a class of similarity solutions of the porous media equation,III

It is shown how existence questions for general multiparameter eigenvalue problems can be treated quite simply using degree theory. The equations to be solved are W_n(λ)x_n = 0 ≠ x_n, n = 1, 2,…, k, where λ ? $\text{R}$^k and each W_n(λ) is a self-adjoint linear operator on a Hilbert space H_n. The W_n, which may be unbounded, depend continuously on λ in a suitable sense. A coercivity condition for large ∥ λ ∥ is used, and is shown to be equivalent, in the “linear” case, to a standard determinantal definiteness condition.     

On diagonal products of doubly stochastic matrices

The following result is proved: If A and B are distinct n × n doubly stochastic matrices, then there exists a permutation σ of {1, 2,…, n} such that ∏_ia_iσ(i) > ∏_ib_iσ(i).     

On the moments of some first passage times for sums of dependent random variables

Let S_n,n = 1, 2, …, denote the partial sums of integrable random variables. No assumptions about independence are made. Conditions for the finiteness of the moments of the first passage times N(c) = min {n: S_n>ca(n)}, where c ≥ 0and a(y) is a positive continuous function on [0, ∞), such that a(y) = o(y)as y → ∞, are given. With the further assumption that a(y) = yP,0 ≤ p < 1, a law of large numbers and the asymptotic behaviour of the moments when c → ∞ are obtained. The corresponding stopped sums are also studied.     

Asymptotically optimal empirical bayes procedures for selecting good

Let ∏₁,…,∏_k denote k independent populations, where a random observation from population ∏ _i has a uniform distribution over the interval (0,θ _i ) and θ _i is a realization of a random variable having an unknown prior distribution G _i . Population ∏ _i is said to be a good population if θ _i ≥θ₀, where θ₀ is a given, positive number. This paper provides a sequence of empirical Bayes procedures for selecting the good populationsamong ∏₁,…,∏ _k . It is shown that these procedures are asymptotically optimal and that the order of associated convergence rates is O(n^-r/4) for some r, 0<r<2, where n is the number of accumulated past observations

at hand     

Interpolation by Integer-Valued Polynomials

LetRbe a Krull ring with quotient fieldKanda₁,…,a_ninR. If and only if thea_iare pairwise incongruent mod every height 1 prime ideal of infinite index inRdoes there exist for all valuesb₁,…,b_ninRan interpolating integer-valued polynomial, i.e., anf ∈ K[x] withf(a_i) = b_iandf(R) ⊆ R.IfSis an infinite subring of a discrete valuation ringR_vwith quotient fieldKanda₁,…,a_ninSare pairwise incongruent mod allM^k_v ∩ Sof infinite index inS, we also determine the minimald(depending on the distribution of thea_iamong residue classes of the idealsM^k_v ∩ S) such that for allb₁,…,b_n ∈ R_vthere exists a polynomialf ∈ K[x] of degree at mostdwithf(a_i) = b_iandf(S) ⊆ R_v.