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 .     

Some functionals over a compact Minkovskii space

In this paper we obtain estimates which are order-exact for the projection and Macphail constants of an arbitrary n-dimensional Banach space: 1(X)n, 1/n₁(X)1/n.Translated from Matematicheskii Zametki, Vol. 10, No. 4, pp. 453–457, 1971.     

Limit theorems for multitype continuous time Markov branching processes

Summary Let X(t)=(X ₁ (t), X ₂ (t), , X _t (t)) be a k-type (2k<) continuous time, supercritical, nonsingular, positively regular Markov branching process. Let M(t)=((m _ij (t))) be the mean matrix where m _ij (t)=E(X _j (t)¦X _r (0)= _ir for r=1, 2, , k) and write M(t)=exp(At). Let be an eigenvector of A corresponding to an eigenvalue . Assuming second moments this paper studies the limit behavior as t of the stochastic process . It is shown that i) if 2 Re >₁, then · X(t)e{–t¦ converges a.s. and in mean square to a random variable. ii) if 2 Re ₁ then [ · X(t)] f(v · X(t)) converges in law to a normal distribution where f(x)=(x) ^–1 if 2 Re <₁ and f(x)=(x log x)^–1 if 2 Re =₁, ₁ the largest real eigenvalue of A and v the corresponding right eigenvector.Research supported in part under contracts N0014-67-A-0112-0015 and NIH USPHS 10452 at Stanford University.     

Gaussian Version of a Theorem of Milman and Schechtman

Using Gordon's inequalities, we give a short proof of the existence of an embedding T:l2k to ln such that ||T||||T-1|| c k/ln(1+n/k). In the same way, we give a new proof of a theorem of Milman and Schechtman (1995).     

Sur la construction d'un corps de Hilbert

We are concerned with the following: If k is a quadratic field and N a cyclic unramified extension of degree qⁿ over k, q a prime number, determine N explicitely via a primitive element , i.e., N=k(), in the spirit of Helmut Hasse [3]. We propose a method which determines these extensions, once we are able to specify the arithmetic of a certain field . To explicit our method, we construct the Hilbert fields of (226) and (646).     

Nonclassical analogs of solitons in quantum field theory

The possible existence of quantum copies of classical soliton solutions that cannot exist if the effective Planck constant of the theory tends to zero is discussed. In the framework of the standard expansion in , such nonclassical solitons have energy of orderO() and thus occupy an intermediate position between purely classical configurations and second-quantized degrees of freedom. Analytic calculations are made for the profile functions, masses, and stability of such configurations in the ⁴ kink model.Physics Faculty, Moscow State University. Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 94, No. 1, pp. 52–65, January, 1993.     

Relaxation of a Quadratic Functional Defined by a Nonnegative Unbounded Matrix

We study the lower semicontinuous envelope in L^p(), F, of a functional F of the form F(u)=A uudx where A=A(x) is not strictly elliptic and not bounded. We prove that F; may also be written as F;(u)= Buudx with B=AP A for a matrix P which is the matrix of an orthogonal projection. In the one-dimensional case, we characterize the domain of F and we explicit the matrix P.     

A note on unit and class number of real quadratic fields

Letp be an odd prime withp1 (mod 4) andQ(p) be the real quadratic field. Also let andh denote the fundamental unit and the class number of Q(p), respectively. The main purpose of this paper is to study the explicit expressions of ^h and ^2h , and to discuss the problems related to the conjecture of Ankeny-Artin-Chowla.     

Approximate Inclusion-Exclusion

The Inclusion-Exclusion formula expresses the size of a union of a family of sets in terms of the sizes of intersections of all subfamilies. This paper considers approximating the size of the union when intersection sizes are known for only some of the subfamilies, or when these quantities are given to within some error, or both.In particular, we consider the case when allk-wise intersections are given for everykK. It turns out that the answer changes in a significant way aroundK=n: ifKO(n) then any approximation may err by a factor of (n/K ²), while ifK (n) it is shown how to approximate the size of the union to within a multiplicative factor of .When the sizes of all intersections are only given approximately, good bounds are derived on how well the size of the union may be approximated. Several applications for Boolean function are mentioned in conclusion.Partially supported by NSF 865727-CCR and ARO DALL03-86-K-017. Part of this work was done in U.C. Berkeley, supported by NSF CCR-8411954.     

Cutting disjoint disks by straight lines

Fork>0 letf(k) denote the minimum integerf such that, for any family ofk pairwise disjoint congruent disks in the plane, there is a direction such that any line having direction intersects at mostf of the disks. We determine the exact asymptotic behavior off(k) by proving that there are two positive constantsd ₁,d ₂ such thatd ₁k logkf(k)d ₂k logk. This result has been motivated by problems dealing with the separation of convex sets by straight lines.The work of the first author was supported in part by the Allon Fellowship, by the Bat Sheva de Rothschild Foundation, by the Fund for Basic Research administered by the Israel Academy of Sciences, and by the Center for Absorbtion in Science. Work by the second author was supported by the Technion V. P.R. Fund, Grant No. 100-0679. The third author's work was supported by the Natural Sciences and Engineering Research Council, Canada, and the joint project Combinatorial Optimization of the Natural Science and Engineering Research Council (NSERC), Canada, and the German Research Association (Deutsche Forschungsgemeinschaft, SFB 303).     

On a Test Statistic for Linear Trend

Let {W(s)} _s 0 be a standard Wiener process. The supremum of the squared Euclidian norm Y (t)², of the R²-valued process Y(t)=(1/t W(t), {12/t ³ int_{0 t} s dW (s)– {3/t} W(t)), t [, 1], is the asymptotic, large sample distribution, of a test statistic for a change point detection problem, of appearance of linear trend. We determine the asymptotic behavior P {sup _t [, 1] Y(t)² > u as u , of this statistic, for a fixed (0,1), and for a moving = (u) 0 at a suitable rate as u . The statistical interest of our results lie in their use as approximate test levels.     

Uniform boundedness of a family of set functions

Let be a ring of sets, X a normed space, : X ( ) a bounded family of triangular functions. The following generalized Nikodym theorem is established: the family {} is uniformly bounded on if and only if it is bounded on every sequence of pairwise disjoint sets of which the union is a part of some set in . An analogous criterion is established also for semiadditive functions. In addition, it is shown that uniform boundedness of a family of triangular functions is preserved in passing from a ring to the -ring it generates.Translated from Matematicheskie Zametki, Vol. 23, No. 6, pp. 855–861, June, 1978.     

Elastic instabilities in cone- and -plate flow: Small gap theory

Consider the axisymmetric, inertialess cone- and -plate flow of a viscoelastic fluid. A perturbation method is used to obtain more tractable equations that describe the flow when the gap angle is small. A linear stability analysis of the base viscometric flow shows that there is a loss of stability when an elasticity parameter =DeWe, increases past a critical value. This purely elastic instability is of the oscillatory type. We obtain expressions for the critical elasticity number, frequency and wave number. The critical Deborah number varies as , the wave length as . and the wave speed as , where . is the gap angle. The most unstable mode exhibits infinitely many logarithmically-spaced roll cells which propagate inward towards the apex of the cone. These results are in agreement with experimental and numerical results.     

An additive function on a ring of integers in the imaginary quadratic field Q(√d) with class-number one

LetB (a) be an additive function on a ring of integers in the quadratic number fieldQ(d) given byB (a) = _p|a *N (p) with a fixed > 0, where the asterisk means that the summation is over the non-associate prime divisorsp of an integera inQ(d), N(a) is the norm ofa. In this paper we obtain the asymptotic formula of _N(a)x *B (a) in the case where the class-number ofQ(d) is one.Project supported by the National Natural Science Foundation of China.     

Estimates of the asphericity of sections of convex bodies

We define the function (n, k) to be the infimum of all such that any bounded centrally symmetric convex body inR ⁿ possesses an -asphericalk-dimensional central section. It is proved that (3, 2)=2–1 and (n, n-1)n-1-1. Several related functions are defined and their values on the pairs (n, n-1) are estimated.Translated from Ukrainskií Geometricheskií Sbornik, Issue 28, 1985, pp. 76–79.     

Blow-up of solutions of nonlinear wave equations in three space dimensions

Let u(x,t) be a solution, uA|u|^p for xIR₃, t0 where is the d'Alembertian, and A, p are constants with A>0, 10–|x–x⁰|, if the initial data u(x,0), u_t(x,0) have their support in the ball |x–x⁰|t₀. In particular global solutions of u=A|u|^p with initial data of compact support vanish identically. On the other hand for A>0, p>1+2 global solutions of u=A|u|^p exist, if the initial data are of compact support and u is sufficiently small in a suitable norm. For p=2 the time at which u becomes infinite is of order u^–2.Dedicated to Hans Lewy and Charles B. Morrey, Jr.The research for this paper was performed at the Courant Institute and supported by the Office of Naval Research under Contract No. N00014-76-C-0301. Reproduction in whole or part is permitted for any purpose of the United States Government.     

A geometric property of extremal surfaces

Let the surface R³ be defined by the equation z = f(x, y), where f(x, y) is a function 3 times continuously differentiable in R². It is proved that if the total (Gaussian) curvature of the surface is nonzero almost everywhere on in the sense of Lebesgue measure in R²), then is extremal, i.e., for almost all (x,y) R² the inequality max (||qx||, ||qy, qf (x, y)) > q^–1/s–. holds for all integral q qo (f), where x is the distance from the real number x to the nearest integer and > 0 is arbitrarily small.Translated from Matematicheskie Zametki, Vol. 23, No. 2, pp. 177–181, February, 1978.In conclusion, the author thanks V. G. Sprindzhuk for suggesting the problem.     

On the rate of convergence of an unstable solution of a stochastic differential equation

We study the rate of convergence of the process(tT)/T to the processw(t)/ asT , where(t) is a solution of the stochastic differential equationd(t)=a((t))dt+((t))dw(t) Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 46, No. 10, pp. 1424–1427, October, 1994.     

An efficient heuristic algorithm for minimum matching

We give a new heuristic algorithm for minimum matching problems and apply it to the Euclidean problem with random vertices in 2 dimensions. The algorithm is based on simulated annealing and performs in practice faster than previous heuristic algorithms yielding suboptimal solutions of the same good quality. From configurations with up toN=20.000 vertices in the unit square we estimate that the length of a minimum matching scales asymptotically asLN with (=0.3123±0.0016.

---

Zusammenfassung Wir stellen einen neuen heuristischen Algorithmus für minimale Matching-Probleme vor und wenden diesen auf das euklidische Problem mit zufÄlliger Punkteverteilung in 2 Dimensionen an. Auf Simulated Annealing basierend lÄuft der Algorithmus schneller als frühere heuristische Algorithmen und erreicht dabei suboptimale Lösungen gleich guter QualitÄt. Aus Konfigurationen mit bis zuN=20.000 Punkten im Einheitsquadrat schÄtzen wir, da\ für die LÄnge des minimalen Matchings asymptotischLN mit=0.3123±0.0016 gilt.