Asymptotic Density and the Asymptotics of Partition Functions

Let A be a set of positive integers with gcd (A) = 1, and let p _A (n) be the partition function of A. Let c ₀ = 2/3. If A has lower asymptotic density and upper asymptotic density , then lim inf log p _A (n)/c ₀ n and lim sup log p _A (n)/c ₀ n . In particular, if A has asymptotic density > 0, then log p _A (n) c₀n. Conversely, if > 0 and log p _A (n) c ₀ n, then the set A has asymptotic density .     

Legitimate colorings of projective planes

For a projective plane _n of ordern, let( _n ) denote the minimum numberk, so that there is a coloring of the points of _n ink colors such that no two distinct lines contain precisely the same number of points of each color. Answering a question of A. Rosa, we show that for all sufficiently largen, 5 ( _n ) 8 for every projective plane _n of ordern. Research supported in part by Allon Fellowship and by a grant from the United States Israel Binational Science Foundation     

Solving systems of polynomial inequalities over a real closed field in subexponential time

Let _m= (₁,..., _m) denote an ordered field, where _i+1>0 is infinitesimal relative to the elements of _i, 0 < –i < m (by definition, ₀= ). Given a system of inequalities f₁ > 0, ..., f_s > 0, f_s+1 0, ..., f_k 0, where f_{j m} [X₁,..., X_n] are polynomials such that, and the absolute value of any integer occurring in the coefficients of the f_js is at most 2^M. An algorithm is constructed which tests the above system of inequalities for solvability over the real closure of _m in polynomial time with respect to M, ((d)ⁿd₀)^n+m. In the case _m=, the algorithm explicitly constructs a family of real solutions of the system (provided the latter is consistent). Previously known algorithms for this problem had complexity of the order ofM(d d ₀ ^{m 2U(n)} .Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Maternaticheskogo Instituta im. V. A. Steklova Akad. Nauk SSSR, Vol. 174, pp. 3–36, 1988.     

Regressions and monotone chains II: The poset of integer intervals

A regressive function (also called a regression or contractive mapping) on a partial order P is a function mapping P to itself such that (x)x. A monotone k-chain for is a k-chain on which is order-preserving; i.e., a chain x ₁<...ksuch that (x ₁)...(x_k). Let P _nbe the poset of integer intervals {i, i+1, ..., m} contained in {1, 2, ..., n}, ordered by inclusion. Let f(k) be the least value of n such that every regression on P _nhas a monotone k+1-chain, let t(x,j) be defined by t(x, 0)=1 and t(x,j)=x ^t(x,j–1). Then f(k) exists for all k (originally proved by D. White), and t(2,k) < f(K) <t( + _k, k) , where _k 0 as k. Alternatively, the largest k such that every regression on P _nis guaranteed to have a monotone k-chain lies between lg^*(n) and lg^*(n)–2, inclusive, where lg^*(n) is the number of appliations of logarithm base 2 required to reduce n to a negative number. Analogous results hold for choice functions, which are regressions in which every element is mapped to a minimal element.     

Testing for Unit Roots in a Nearly Nonstationary Spatial Autoregressive Process

The limiting distribution of the normalized periodogram ordinate is used to test for unit roots in the first-order autoregressive model _st= _s-1,t+_s,t-1- _s-1,t-1+_st. Moreover, for the sequence _n = e ^c/n , _n = e ^d/n of local Pitman-type alternatives, the limiting distribution of the normalized periodogram ordinate is shown to be a linear combination of two independent chi-square random variables whose coefficients depend on c and d. This result is used to tabulate the asymptotic power of a test for various values of c and d. A comparison is made between the periodogram test and a spatial domain test.     

Quasiconvex uniform-convergence factors for Fourier series of functions with a given modulus of continuity

It is proved that a quasiconvex sequence _v of convergence factors transforms Fourier series of functions whose moduli of continuity do not exceed a given modulus of continuity(gd) into uniformly convergent series if and only if _n (1/n) log n 0 for n . The sufficiency of this condition is already known.Translated from Matematicheskie Zametki, Vol. 8, No. 5,pp. 619–623, November, 1970.     

Exact convergence rates in strong approximation laws for large increments of partial sums

Summary Consider partial sumsS _n of an i.i.d. sequenceX ₁ X ₂, ..., of centered random variables having a finite moment generating function in a neighborhood of zero. The asymptotic behaviour of is investigated, where 1b _n n denotes an integer sequence such thatb _n /logn asn. In particular, ifb _n =o(log ^p n) asn for somep>1, the exact convergence rate ofU _n /b _{n n} =1 +0 (1) is determined, where _n depends uponb _n and the distribution ofX ₁. In addition, a weak limit law forU _n is derived. Finally, it is shown how strong invariance takes over if b _n (loglogn)²/log³ n=.     

Monotonic subsequences in permutations of n natural numbers

Let S_n be the set of all permutations of the numbers 1, 2,..., n, and letl _n() be the number of terms in the maximal monotonic subsequence contained in S_n. If M[l _n()] is the mean value ofl _n () on S_n, then, for all except a finite number of n, the bound M[l _n()] e n is valid.Translated from Matematicheskie Zametki, Vol. 13, No. 4, pp. 511–514, April, 1973.The author wishes to thank E. M. Nikishin for having posed the problem and for his constant interest in the work.     

Cyclic Just-In-Time Sequences Are Optimal

Consider the Product Rate Variation problem. Given n products 1,...,i,...,n, and n positive integer demands d ₁,..., d_i,...,d_n. Find a sequence =₁,...,_T, T = _i=1 ⁿ d _i, of the products, where product i occurs exactly d _i times that always keeps the actual production level, equal the number of product i occurrences in the prefix ₁,..., _t, t=1,...,T, and the desired production level, equal r _i t, where r _i=d_i/T, of each product i as close to each other as possible. The problem is one of the most fundamental problems in sequencing flexible just-in-time production systems. We show that if is an optimal sequence for d ₁,...,d_i,...,d_n, then concatenation ^m of m copies of is an optimal sequence for md ₁,..., md_i,...,md_n.     

Integral representation of linear operators

In this paper we obtain necessary and sufficient conditions in order that a linear operator, acting in spaces of measurable functions, should admit an integral representation. We give here the fundamental results. Let (T_i, _i) (i=1,2) be spaces of finite measure, and let (T,) be the product of these spaces. Let E be an ideal in the space S(T₁, ₁) of measurable functions (i.e., from |e₁||e₂|, e₁ S (T₁, ₁), e₂E it follows that e₁E). THEOREM 2. Let U be a linear operator from E into S(T₂, ₂). The following statements are equivalent: 1) there exists a-measurable kernel K(t,S) such that (Ue)(S)=K(t,S) e(t)d(t) (eE); 2) if 0e_nE (n=1,2,...) and e_n0 in measure, then (Ue_n)(S) 0 ₂ a.e. THEOREM 3. Assume that the function (t,S) is such that for any eE and for s a.e., the ₂-measurable function Y(S)=(t,S)e(t)d ₁(t) is defined. Then there exists a-measurable function K(t,S) such that for any eE we have (t,S)e(t)d ₁(t)=K(t,S)e(t)d ₁(t) ₁a.e.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 47, pp. 5–14, 1974.     

Application of Topological Degree to the Study of Bifurcation in von Kármán Equations

The aim of this paper is to illustrate the use of topological degree for the study of bifurcation in von Kármán equations with two real positive parameters and for a thin elastic disk lying on the elastic base under the action of a compressing force, which may be written in the form of an operator equation F(x, , ) = 0 in some real Banach spaces X and Y. The bifurcation problem that we study is a mathematical model for a certain physical phenomenon and it is very important in the mechanics of elastic constructions. We reduce the bifurcation problem in the solution set of equation F(x, , ) = 0 at a point (0, ₀, ₀) X × IR ₊ ² to the bifurcation problem in the solution set of a certain equation in IR ⁿ at a point (0, ₀, ₀) IR ⁿ × IR ₊ ², where n = dim Ker F _x (0, ₀, ₀) and F _x (0, ₀, ₀): X Y is a Fréchet derivative of F with respect to x at (0, ₀, ₀). To solve the bifurcation problem obtained as a result of reduction, we apply homotopy and degree theory.     

A Variation of an Extremal Theorem Due to Woodall

We consider a variation of an extremal theorem due to Woodall [12, or 1, Chapter 3] as follows: Determine the smallest even integer (₃C₁,n), such that every n-term graphic sequence = (d₁, d₂,..., d_n) with term sum () = d₁ + d₂ + ... + d_n (₃C₁,n) has a realization G containing a cycle of length r for each r = 3,4,...,l. In this paper, the values of (₃C_l,n) are determined for l = 2m – 1,n 3m – 4 and for l = 2m,n 5m – 7, where m 4.AMS Mathematics subject classification (1991) 05C35Project supported by the National Natural Science Foundation of China (Grant No. 19971086) and the Doctoral Program Foundation of National Education Department of China     

Sur un problème de Rényi

Let (n) be the number of all prime divisors ofn and (n) the number of distinct prime divisors ofn. We definev _q (x)=|{nx(n)–(n)=q}|. In this paper, we give an asymptotic development ofv _q (x); this improves on previous results.

     

Orthogonality properties of linear combinations of orthogonal polynomials

Let {P _n } be a sequence of orthogonal polynomials with respect to the measured on the unit circle and letP _n =P _n + _j ^=1l _nj P _n–j fornl, where _n,j . It is shown that the sequence of linear combinations {P _n },n2l, is orthogonal with respect to a positive measured if and only ifd is a Bernstein-Szegö measure andd is the product of a unique trigonometric polynomial and the Bernstein-Szegö measured. Furthermore for a given sequence ofP _n 's an algorithm for the calculation of the _n,j 's is provided.Supported by Dirección General de Investigación Cientifica y Técnica (DGICYT) of Spain and Österreichischer Akademischer Austauschdienst of Austria with grant 4B/1995.Also supported by the Austrian Fonds zur Förderung der wissenschaftlichen Forschung, project-number P9267-PHY.     

Characterization,structure and analysis on abelian ℒ∞ groups

An abelian topological group is an group if and only if it is a locally -compactk-space and every compact subset in it is contained in a compactly generated locally compact subgroup. Every abelian groupG is topologically isomorphic to G ₀ where ₀ andG ₀ is an abelian group where every compact subset is contained in a compact subgroup. Intrinsic definitions of measures, convolution of measures, measure algebra,L ₁-algebra, Fourier transforms of abelian groups are given and their properties are studied.     

The quality of the Diophantine approximations found by the Jacobi-Perron algorithm and related algorithms

Given a vector of real numbers=(₁,... _d ) ^d , the Jacobi-Perron algorithm and related algorithms, such as Brun's algorithm and Selmer's algorithm, produce a sequence of (d+1)×(d+1) convergent matrices {C⁽ⁿ⁾():n1} whose rows provide Diophantine approximations to . Such algorithms are specified by two mapsT:[0, 1] ^d [0, 1] ^d and A:[0,1] ^d GL(d+1,), which compute convergent matrices C⁽ⁿ⁾())...A(T())A(). The quality of the Diophantine approximations these algorithms find can be measured in two ways. The best approximation exponent is the upper bound of those values of for which there is some row of the convergent matrices such that for infinitely many values ofn that row of C⁽ⁿ⁾() has . The uniform approximation exponent is the upper bound of those values of such that for all sufficiently large values ofn and all rows of C⁽ⁿ⁾⁽⁾ one has . The paper applies Oseledec's multiplicative ergodic theorem to show that for a large class of such algorithms and take constant values and on a set of Lebesgue measure one. It establishes the formula where are the two largest Lyapunov exponents attached by Oseledec's multiplicative ergodic theorem to the skew-product (T, A,d), whered is aT-invariant measure, absolutely continuous with respect to Lebesgue measure. We conjecture that holds for a large class of such algorithms. These results apply to thed-dimensional Jacobi-Perron algorithm and Selmer's algorithm. We show that; experimental evidence of Baldwin (1992) indicates (nonrigorously) that. We conjecture that holds for alld2.     

A decision theoretical characterization of weak ergodicity

Summary The relation between the ergodic coefficient and deficiency relative to the least informative experiment is investigated. The result is applied to nonhomogeneous Markov chains (NMC's). Our main result can be described as follows: Given an NMC, define the experiments _n ^(j) for n1 consisting in observing the (n+j)-th state of the chain, the j-th state being the unknown parameter. Then the chain is weakly ergodic if and only if for any j, _n ^(j) converges as n (with respect to deficiencies) to the least informative experiment. It is finally shown that in the homogeneous case, the rate of convergence is always exponential.     

Algebraic systems of quadratic forms of number fields and function fields

In this paper we examine for which Witt classes ,..., _n over a number field or a function fieldF there exist a finite extensionL/F and ₂,..., _n L^* such thatT _L/F ()=1 andTr _L/F (_i)=_i fori=2,...n.     

Admissibility of linear estimators of regression coefficients under quadratic loss

For the general fixed effects linear model:Y=X+, N(0,V),V0, we obtain the necessary and sufficient conditions forLY+a to be admissible for a linear estimable functionS in the class of all estimators under the loss function (d -S)D(d -S), whereD0 is known. For the general random effects linear model: =XV ₁₁ X+XV ₁₂+V ₂₁ X+V ₂₂0, we also get the necessary and sufficient conditions forLY+a to be admissible for a linear estimable functionS+Q in the class of all estimators under the loss function (d -S -Q)D(d -S -Q), whereD0 is known.     

Circles and spheres in pseudo-Riemannian geometry

Summary A totally umbilical pseudo-Riemannian submanifold with the parallel mean curvature vector field is said to be an extrinsic sphere. A regular curve in a pseudo-Riemannian manifold is called a circle if it is an extrinsic sphere. LetM be ann-dimensional pseudo-Riemannian submanifold of index (0n) in a pseudo-Riemannian manifold with the metricg and the second fundamental formB. The following theorems are proved. For ₀ = +1 or –1, ₁ = +1, –1 or 0 (2–2 ₀+ ₁2n–2–2) and a positive constantk, every circlec inM withg(c, c) = ₀ andg( _c c, _c c) = ₁ k ² is a circle in iffM is an extrinsic sphere. For ₀ = +1 or –1 (–₀n–), every geodesicc inM withg(c, c) = ₀ is a circle in iffM is constant isotropic and B(x,x,x) = 0 for anyx T(M). In this theorem, assume, moreover, that 1n–1 and the first normal space is definite or zero at every point. Then we can prove thatM is an extrinsic sphere. When = 0 orn, this fact does not hold in general.