Continuous Quotients for Lattice Actions on Compact Spaces

Let < SL _n ( ) be a subgroup of finite index, where n 5. Suppose acts continuously on a manifold M, where ₁(M) = ⁿ , preserving a measure that is positive on open sets. Further assume that the induced action on H ¹(M) is non-trivial. We show there exists a finite index subgroup < and a equivariant continuous map : M ⁿ that induces an isomorphism on fundamental group. We prove more general results providing continuous quotients in cases where ₁(M) surjects onto a finitely generated torsion free nilpotent group. We also give some new examples of manifolds with actions.     

Random k-Sat: A Tight Threshold For Moderately Growing k

We consider a random instance I of k-SAT with n variables and m clauses, where k=k(n) satisfies k—log₂ n. Let m ₀=2 ^k nln2 and let =(n)>0 be such that n. We prove that

Windschiefe Kongruenzflächen konstanten Dralls

In this paper we study the curves of a surface ( _T -lines) which are base curves of ruled surfaces for which the parameter of distribution O has a constant value. Moreover we assume that the ruled surfaces belong to a given congruenceT of surface tangents of . Relations are established between the _T -lines and other curves of (asymptotic lines, lines of curvature, k _T -lines). The _T -lines are used to characterize the pseudospheres and the helicoids. The _T -lines of the surfaces of revolution are determined if the congruenceT consists of the tangents of the circles of latitude.

---

---

Herrn WERNER BURAU zum 70.Geburtstag     

Approximation of infinitely differentiable periodic functions by interpolation trigonometric polynomials

We establish asymptotically unimprovable interpolation analogs of Lebesgue-type inequalities on the classes of periodic infinitely differentiable functions C C whose elements can be represented in the form of convolutions with fixed generating kernels. We obtain asymptotic equalities for upper bounds of approximations by interpolation trigonometric polynomials on the classes C _, and C H .Translated from Ukrainskyi Matematychnyi Zhurnal, Vol. 56, No. 4, pp. 495–505, April, 2004.     

On the properties of ε(≥0) optimal policies in discounted unbounded return model

This paper investigates the properties of (0) optimal policies in the model of [2]. It is shown that, if * = ( ₀ ^* , ₁ ^* ,..., _n ^* , _n ^+1/* , ...) is a-discounted optimal policy, then ( ₀ ^* , ₁ ^* , ..., _n ^* ) for alln0 is also a-discounted optimal policy. Under some condition we prove that stochastic stationary policy _n ^* corresponding to the decision rule _n ^* is also optimal for the same discounting factor. We have also shown that for each-optimal stochastic stationary policy ₀ ^* , ₀ ^* can be decomposed into several decision rules to which the corresponding stationary policies are also-optimal separately; and conversely, a proper convex combination of these decision rules is identified with the former ₀ ^* . We have further proved that for any (,)-optimal policy, say *=( ₀ ^* , ₁ ^* , ..., _n ^* , _n ^+1/* , ...), _n–1 ^* ) is ((1– ⁿ )^–1 e, ) optimal forn>0. At the end of this paper we mention that the results about convex combinations and decompositions of optimal policies of § 4 in [1] can be extended to our case.Project supported by the Science Fund of the Chinese Academy of Sciences.     

On Interpolation Sequences of One Class of Functions, Analytic in the Half-Plane

A new criterion of solvability of the interpolation problem f( _n )=b_n in the class of functions f, analytic in the right half-plane and such that there exists c ₁(0;+) such that |f(z)|c ₁exp((c₁|z|)) for all z , where is a positive increasing continuous differentiable function on [0;+), for which (t)+ as t+ and there exists c ₂(0;+) such that

On Mittag-Leffler functions and related distributions

The distribution F () = 1 – E (–), 0 < 1; 0 , where E (x) is the Mittag-Leffler function is studied here with respect to its Laplace transform. Its infinite divisibility and geometric infinite divisibility are proved, along with many other properties. Its relation with stable distribution is established. The Mittag-Leffler process is defined and some of its properties are deduced.     

Arithmetic of the Modular Function j1,8

Since the genus of the modular curve X_1 (8) = _1 (8) * is zero, we find a field generator j _1,8(z) = ₃(2z)/₃(4z) (₃(z) := _n ein ^2z ) such that the function field over X ₁(8) is (j _1,8). We apply this modular function j _1,8 to the construction of some class fields over an imaginary quadratic field K, and compute the minimal polynomial of the singular value of the Hauptmodul N(j _1,8) of (j _1,8).     

Schatten class composition operators on weighted Bergman spaces of bounded symmetric domains

Summary We obtain trace ideal criteria for 0A ² () of a Bounded symmetric diomain in _n.     

Decompositions of complete graphs into isomorphic bipartite subgraphs

Let |E(G)|= andf, a 1-1 mapping ofV(G) into {0,1,...,}. Thenf is called a -valuation ofG if the induced function given by , for alluvE(G) is 1-1. A -valuationf is called an -valuation ofG if there exists a nonnegative number such that for everyuvE(G) withf(u)<f(v),f(u)<f(v). Let denote the graph of then-dimensionalG-cube. ForG=K _{3, 3},K _{4, 4}, andP _k ,it is shown that for any positive integern, then-dimensionalG-cube has an -valuation. This gives rise to decompositions of some complete graphs into certain bipartite graphs.     

On the distribution of comparisons in sorting algorithms

We considered the following natural conjecture: For every sorting algorithm every key will be involved in(logn) comparisons for some input. We show that this is true for most of the keys and prove matching upper and lower bounds. Every sorting algorithm for some input will involven–n /2+1 keys in at leastlog₂ n comparisons,>0. Further, there exists a sorting algorithm that will for every input involve at mostn–n ^/c keys in greater thanlog₂ n comparisons, wherec is a constant and>0. The conjecture is shown to hold for natural algorithms from the literature.     

Über Tuttes Cages

An undirected graph of valencyd and girth is called a (d, )-cage if its automorphism group acts transitively on the set of alls-paths in ands(+1)/2. We discuss an elementary construction of two known families of cages which allows us to prove easily some facts about their automorphism groups. We give, for example, a new proof of the fact that the automorphism group ofSp ₄(2 ⁿ ) contains elements which are not induced by Sp ₄(2 ⁿ ).     

On the asymptotic behaviour of first passage times for transient random walk

Summary Let _x denote the time at which a random walk with finite positive mean first passes into (x, ), wherex0. This paper establishes the asymptotic behaviour of Pr { _x >n} asn for fixedx in two cases. In the first case the left hand tail of the step-distribution is regularly varying, and in the second the step-distribution satisfies a one-sided Cramér type condition. As a corollary, it follows that in the first case Pr { _x >n}/Pr{ ₀ >n} coincides with the limit of the same quantity for recurrent random walk satisfying Spitzer's condition, but in the second case the limit is more complicated.     

Onp-Helson sets in R n

p- . E R ⁿ -, f () _p(R ⁿ)., ER ⁿ 2nq ₀, E— - q ₀(q ₀-1). : q₀>2 n1 E R ⁿ 2nq ₀, p- p<₀. , f-[-, ]ⁿ, f A _p(R ⁿ) , _p([-, ]ⁿ) (1 << ).     

An Inequality for Tail Probabilities of Martingales with Bounded Differences

Let M _n =X₁+...+X_n be a martingale with bounded differences X_m=M_m-M_m-1 such that {|X_m| _m}=1 with some nonnegative _m. Write ²= ₁ ² + ... + _n ² . We prove the inequalities {M _nx}c(1-(x/)), {M _n x} 1- c(1- (-x/)) with a constant . The result yields sharp inequalities in some models related to the measure concentration phenomena.     

On depth first search strees inm-out digraphs

We consider depth first search (DFS for short) trees in a class of random digraphs: am-out model. Let _i be thei ^th vertex encountered by DFS andL(i, m, n) be the height of _i in the corresponding DFS tree. We show that ifi/n asn, then there exists a constanta(,m), to be defined later, such thatL(i, m, n)/n converges in probability toa(,m) asn. We also obtain results concerning the number of vertices and the number of leaves in a DFS tree.     

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 .     

A Bernstein result for energy minimizing hypersurfaces

We show that there are no entire, positive, stable solutions in ⁿ of the Euler equation corresponding to the singular variational integral ,>0, if+n<5.236.... Furthermore we prove a related result for smooth boundaries of least-energy |x _n+1||D _U | in ⁿ⁺¹.     

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.     

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相似文献