An isolation theorem for decomposable forms of purely real algebraic fields of degree n⩾3

Let M be a complete module of a purely algebraic field of degree n3, let be the lattice of this module and let F(X) be its form. By we denote any lattice for which we have = , where is a nondiagonal matrix satisfying the condition ¦-I¦ , I being the identity matrix. The complete collection of such lattices will be denoted by {}. To each lattice we associate in a natural manner the decomposable form F(X). The complete collection of forms, corresponding to the set {}, will be denoted by {F} It is shown that for any given arbitrarily small interval (N–, N+), one can select an such that for each F(X) from {F} there exists an integral vector X₀ such that N– < F(X₀) < N+.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 112, pp. 167–171, 1981.     

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.     

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=.     

An improved asymptotic analysis of the expected number of pivot steps required by the simplex algorithm

Leta ₁ ...,a _m be i.i.d. points uniformly on the unit sphere in ⁿ ,m n 3, and letX:= {x ⁿ |a _i ^T x1} be the random polyhedron generated bya ₁, ...,a _m . Furthermore, for linearly independent vectorsu, in ⁿ , letS _u , (X) be the number of shadow vertices ofX inspan(u,). The paper provides an asymptotic expansion of the expectation value¯S _n,m := _in4 ¹ E(S _u, ) for fixedn andm .¯S _n,m equals the expected number of pivot steps that the shadow vertex algorithm — a parametric variant of the simplex algorithm — requires in order to solve linear programming problems of type max u ^T ,xX, if the algorithm will be started with anX-vertex solving the problem max ^T ,x X. Our analysis is closely related to Borgwardt's probabilistic analysis of the simplex algorithm. We obtain a refined asymptotic analysis of the expected number of pivot steps required by the shadow vertex algorithm for uniformly on the sphere distributed data.     

Multivalued Stochastic Differential Equations: Convergence of a Numerical Scheme

In this paper we show the strong mean square convergence of a numerical scheme for a R ^d -multivalued stochastic differential equation: dX _t +A(X _t )dtb(t,X _t )dt+(t,X _t )dW _t and obtain the rate of convergence O(( log(1/)^1/2) when the diffusion coefficient is bounded. By introducing a discrete Skorokhod problem, we establish L ^p -estimates (p2) for the solutions and prove the convergence by using a deterministic result. Numerical experiments for the rate of convergence are presented.     

On the domain of attraction of an operator between supremum and sum

Summary Between the operations which produce partial maxima and partial sums of a sequenceY ₁,Y ₂, ..., lies the inductive operation:X _n =X _n-1(X _n-1+Y _n ),n1, for 0<<1. If theY _n are independent random variables with common distributionF, we show that the limiting behavior of normed sequences formed from {X _n ,n1}, is, for 0<<1, parallel to the extreme value case =0. ForFD() we give a full proof of the convergence, whereas forFD()D(), we only succeeded in proving tightness of the involved sequence. The processX _n is interesting for some applied probability models.     

Large Deviations of Local Times of Lévy Processes

For X(t) a real-valued symmetric Lévy process, its characteristic function is E(e ^iX(t))=exp(–t()). Assume that is regularly varying at infinity with index 1<2. Let L ^x _t denote the local time of X(t) and L* _t =sup _xR L ^x _t . Estimates are obtained for P(L ⁰ _t y) and P(L* _t y) as y and t fixed.     

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     

The existence of probability measures with specified projections

Let X and Y be locally compact-compact topological spaces, F X×Y is closed, and P(F) is the set of all Borel probability measures on F. For us to find, for the pair of probability measures (_x, _y P (X)×P(Y), a probability measure P(F) such that _X = _X ^–1 , _Y = _Y ^–1 it is necessary and sufficient that, for any pair of Borel sets A X, B Y for which (A× B) F=Ø, the condition _XA+ _YB 1 holds.Translated from Matematicheskie Zametki, Vol. 14, No. 4, pp. 573–576, October, 1973.     

Random Logistic Maps II. The Critical Case

Let (X _n ) ₀ be a Markov chain with state space S=[0,1] generated by the iteration of i.i.d. random logistic maps, i.e., X _n+1=C _n+1 X _n (1–X _n ),n0, where (C _n ) ₁ are i.i.d. random variables with values in [0, 4] and independent of X ₀. In the critical case, i.e., when E(log C ₁)=0, Athreya and Dai⁽²⁾ have shown that X _n ^P 0. In this paper it is shown that if P(C ₁=1)<1 and E(log C ₁)=0 then(i) X _n does not go to zero with probability one (w.p.1) and in fact, there exists a 0<<1 and a countable set (0,1) such that for all xA(0,1), P _x (X _n for infinitely many n1)=1, where P _x stands for the probability distribution of (X _n ) ₀ with X ₀=x w.p.1. A is a closed set for (X _n ) ₀.(ii) If is the supremum of the support of the distribution of C ₁, then for all xA (a)

Compact sets in the spaceL p (O,T; B)

Summary A characterization of compact sets in L^p (0, T; B) is given, where 1P and B is a Banach space. For the existence of solutions in nonlinear boundary value problems by the compactness method, the point is to obtain compactness in a space L^p (0,T; B) from estimates with values in some spaces X, Y or B where XBY with compact imbedding XB. Using the present characterization for this kind of situations, sufficient conditions for compactness are given with optimal parameters. As an example, it is proved that if {f_n} is bounded in L^q(0,T; B) and in L _loc ¹ (0, T; X) and if {f_n/t} is bounded in L _loc ¹ (0, T; Y) then {f_n} is relatively compact in L^p(0,T; B), p相似文献   

Limit Theorems for the Maximum Terms of a Sequence of Random Variables with Marginal Geometric Distributions

Let X _n1 ^* , ... X _nn ^* be a sequence of n independent random variables which have a geometric distribution with the parameter p _n = 1/n, and M _n ^* = \max\{X _n1 ^* , ... X _nn ^* }. Let Z ₁, Z₂, Z₃, ... be a sequence of independent random variables with the uniform distribution over the set N _n = {1, 2, ... n}. For each j N _n let us denote X _nj = min{k : Z_k = j}, M _n = max{X_n1, ... X_nn}, and let S _n be the 2nd largest among X _n1, X_n2, ... X_nn. Using the methodology of verifying D(u_n) and D'(u_n) mixing conditions we prove herein that the maximum M _n has the same type I limiting distribution as the maximum M _n ^* and estimate the rate of convergence. The limiting bivariate distribution of (S_n, M_n) is also obtained. Let _n, _n N_n, , and T _n = min{M(A_n), M(B_n)}. We determine herein the limiting distribution of random variable T _n in the case _n , _n/_n > 0, as n .     

The tree number of a graph with a given girth

A family of subtrees of a graphG whose edge sets form a partition of the edge set ofG is called atree decomposition ofG. The minimum number of trees in a tree decomposition ofG is called thetree number ofG and is denoted by(G). It is known that ifG is connected then(G) |G|/2. In this paper we show that ifG is connected and has girthg 5 then(G) |G|/g + 1. Surprisingly, the case wheng = 4 seems to be more difficult. We conjecture that in this case(G) |G|/4 + 1 and show a wide class of graphs that satisfy it. Also, some special graphs like complete bipartite graphs andn-dimensional cubes, for which we determine their tree numbers, satisfy it. In the general case we prove the weaker inequality(G) (|G| – 1)/3 + 1.     

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.     

A remark on the strong law of large numbers

The strong law of large numbers for independent and identically distributed random variablesX _i ,i=1, 2, 3,... with finite expectationE|X ₁| can be stated as, for any >0, the number of integersn such that \varepsilon $$ " align="middle" border="0"> ,N is finite a. s. It is known thatEN < iffEX ₁ ² < and that ² EN var X₁ as 0, ifE X ₁ ² <. Here we consider the asymptotic behaviour ofEN (n) asn, whereN (n) is the number of integerskn such that \varepsilon $$ " align="middle" border="0"> andE N ₁ ² =.     

Bayesian estimation in the symmetric location problem

Summary Let X _i =+ _i for i=1, ..., n, where the _i's are i.i.d. F and F is symmetric about 0. F is assumed unknown or only partially known, and the problem is to estimate . Priors are put on the pair (F,). The priors on F are obtained from Doksum's neutral to the right priors, and include symmetrized Dirichlet priors. The marginal posterior distribution of given X ₁, ..., X _nis computed and its general properties studied. It is found that for certain classes of distributions of the _i's, the posterior distribution of is for all large n a point mass at the true value of . If the distribution of the _i's is not exactly symmetric, the Bayes estimates can behave very poorly.     

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.     

Central orderings in fields of real meromorphic function germs

Let X_oR ⁿ be an irreducible analytic germ and the order space of its field of meromorphicfunetion germs. A formal half-branch in X_o is a kind of C-map germ c[0,)X_o; an ordering is centered at c if it contains the functions which are positive on c. We obtain a partition ¹,...,^d, d=dim X_o, of the set ^* of central (i.e.: centered at some half-branch) orderings, according to the dimension of half-branches. Then we show that all ^e, e= 1,.,d, as well as the set \^* of noncentral orderings, are dense in . Finally, we solve the 17th Hubert Problem for analytic germs.     

On the boundedness of Weyl sums

Leta be irrational and letf:[0,1] be Riemann-integrable with integral zero. Letf _n (x) denote the Weyl sumf _n (x):= _k=0 ^n–1 f({x k>}),x/[0,1[,n. We prove criteria for the boundedness of the sequence (f _n ) _n1 and discuss the relation of this question to irregularities of the distribution of sequences.