Semimodular lattices with isomorphic graphs

Two discrete modular lattice and have isomorphic graphs if and only if is of the form A × and is of the form A × for some lattices A and and . We prove that for discrete semimodular lattices and this latter condition holds if and only if and have isomorphic graphs and the isomorphism preserves the order on all cover-preserving sublattices of which are isomorphic to the seven-element, semimodular, nonmodular lattice (see Figure 1). This answers in the affirmative a question posed by J. Jakubik.     

Equivalence Bimodule Between Non-Commutative Tori

The non-commutative torus C ^*(ⁿ,) is realized as the C*-algebra of sections of a locally trivial C*-algebra bundle over S with fibres isomorphic to C ^*n/S, ₁) for a totally skew multiplier ₁ on ⁿ/S. D. Poguntke [9] proved that A is stably isomorphic to C(S) C(^*( Zⁿ/S, ₁) C(S) A M_kl( C) for a simple non-commutative torus A and an integer kl. It is well-known that a stable isomorphism of two separable C*-algebras is equivalent to the existence of equivalence bimodule between them. We construct an A-C(S) A-equivalence bimodule.     

An explicit solution of the linear filtering problem for certain classes of nonrational spectral densities

We present an explicit solution of the problem of optimal linear filtering: the recovery of the useful signal(s) at the instantt+, (>0,<0, or=0) from known values of the received signal(s)=(s)+(s) in the past, i.e., at the instantt–s, s0. In doing so we assume the random processes(s) and /gr(s) are stationary and jointly stationary, while the stationary process of noise (s) with zero mean is assumed to be mutually correlated and jointly stationary with the process(s) under the assumption that there exists a common spectral densityf() for these processes.Translated fromTeoriya Sluchaínykh Protsessov, Vol. 14, pp. 83–91, 1986.     

Discrete Spectrum of Differential Operators in Spectral Gaps under Nonnegative Perturbations of High Order

Let A be a self-adjoint elliptic second-order differential operator, let (, ) be an inner gap in the spectrum of A, and let B(t) = A + tW ^* W, where W is a differential operator of higher order. Conditions are obtained under which the spectrum of the operator B(t) in the gap (, ) is either discrete, or does not accumulate to the right-hand boundary of the spectral gap, or is finite. The quantity N(, A, W, ), (, ), > 0 (the number of eigenvalues of the operator B(t) passing the point (, ) as t increases from 0 to ) is considered. Estimates of N(, A, W, ) are obtained. For the perturbation W ^* W of a special form, the asymptotics of N(, A, W, ) as + is given. Bibliography: 5 titles.     

Limiting behavior of weighted central paths in linear programming

We study the limiting behavior of the weighted central paths{(x(), s())} > 0 in linear programming at both = 0 and = . We establish the existence of a partition (B ,N ) of the index set { 1, ,n } such thatx _i() ands _j () as fori B , andj N , andx _N (),s _B () converge to weighted analytic centers of certain polytopes. For allk 1, we show that thekth order derivativesx ^(k) () ands ^(k) () converge when 0 and . Consequently, the derivatives of each order are bounded in the interval (0, ). We calculate the limiting derivatives explicitly, and establish the surprising result that all higher order derivatives (k 2) converge to zero when .     

Limits of balayage measures

LetA be a subset of a balayage space (X,W) and a measure onX. It is shown that for every sequence _n of measures such that lim_nn and lim_{n n} ^A = the limit measure is of the formf+[(1-f)]^A for some (unique) Borel function 0f1_Cb(A). Furthermore, conditions are given such that any such functionf occurs.     

D λ -cycles in 3-cyclable graphs

Letk and be positive integers, andG a 2-connected graph of ordern with minimum degree and independence number. A cycleC ofG is called aD -cycle if every component ofG – V(C) has order smaller than. The graphG isk-cyclable if anyk vertices ofG lie on a common cycle. A previous result of the author is that if k 2, G isk-connected and every connected subgraphH ofG of order has at leastn +k ² + 1/k + 1 – vertices outsideH adjacent to at least one vertex ofH, thenG contains aD -cycle. Here it is conjectured that k-connected can be replaced by k-cyclable, and this is proved fork = 3. As a consequence it is shown that ifn 4 – 6, or ifG is triangle-free andn 8 – 10, thenG contains aD ₃-cycle orG , where denotes a well-known class of nonhamiltonian graphs of connectivity 2. As an analogue of a result of Nash-Williams it follows that ifn 4 – 6 and – 1, thenG is hamiltonian orG . The results are all best possible and compare favorably with recent results on hamiltonicity of graphs which are close to claw-free.     

Slope Estimates of Artin–Schreier Curves

Let X/F_p be an Artin–Schreier curve defined by the affine equation y ^p –y=f(x) where f(x)F_p[x] is monic of degree d. In this paper we develop a method for estimating the first slope of the Newton polygon of X. Denote this first slope by NP₁(X/F_p). We use our method to prove that if p>d2 then NP₁(X/F_p)(p–1)/d/(p–1). If p>2d4, we give a sufficient condition for the equality to hold.     

On Tabor's problem concerning a certain quasi-ordering of iterative roots of functions

Summary Using the Isaacs-Zimmermann's theory of iterative roots of functions, we prove a theorem concerning the problemP 250 posed by J. Tabor:Letf: E E be a given mapping. Denote byF the set of all iterative roots off. InF we define the following relation: if and only if is an iterative root of. The relation is obviously reflexive and transitive. The question is: Is it also antisymmetric? If we consider iterative roots of a monotonic function the answer is yes. But in general the question is open.Here we prove that there exists a three-element decomposition { _i ;i = 1, 2, 3} of the setE ^E with blocks _i of the same cardinality 2^cardE such that the functions from ₁ do not possess any proper iterative root, the quasi-ordering is not antisymmetric onF(f) for anyf ₂, and is an ordering onF(f) for anyf ₃. Iff is a strictly increasing continuous self-bijection ofE, then the relation is an ordering onF(f) ifff is different from the identity mapping of the setE.     

Some Asymptotic Results for the M/M/∞ Queue with Ranked Servers

We consider an M/M/ model with m primary servers and infinitely many secondary ones. An arriving customer takes a primary server, if one is available. We derive integral representations for the joint steady state distribution of the number of occupied primary and secondary servers. Letting =/ be the ratio of arrival and service rates (all servers work at rate ), we study the joint distribution asymptotically for . We consider both m=O(1) and m scaled to be of the same order as . We also give results for the marginal distribution of the number of secondary servers that are occupied.     

Isolation theorem for forms corresponding to purely real algebraic fields

Let M be the complete module of a purely real algebraic field of degree n 3, let be a lattice in this module, and let F(X) be its form. We use to denote any lattice for which we have = , where is a nondiagonal matrix for which – I . With each lattice we can associate a factorizable formF (X) in a natural manner. We denote the complete set of forms corresponding to the set {} by {F (X)}. It is proved that for any > 0 there exists an > 0 such that for eachF (X) {F } we have |F (X₀₎| for some integer vector X₀ 0.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 185, pp. 5–12, 1990.In conclusion, the author would like to express his deep gratitude to B. F. Skubenko for stating the problem and for his constant attention.     

Inadmissibility and admissibility results for unbiased loss estimators based on gauss-markov estimators

LetY be distributed according to ann-variate normal distribution with a meanX and a nonsingular covariance matrix ² V, where bothX andV are known, R ^p is a parameter, > 0 is known or unknown. Denote and . Assume thatF is linearly estimable. When is known, it is proved that the unbiased loss estimator ²tr(F(XV ^–1 X)^– F) of is admissible for rank (F)=k4 and inadmissible fork 5 with the squared error loss . When is unknown and rank (X) <n, it is established that the loss estimatorcS ², wherec is any nonnegative constant, of is inadmissible and that the unbiased loss estimator tr(F(XV ^–1 X)^– F) of is admissible fork 4, and inadmissible fork 5 with squared error loss.This project is supported by the National Natural Science Foundation of China.     

A characterization of semimartingales on nuclear spaces

Summary This work is devoted to prove the following fact: Suppose that is a nuclear space whose dual is nuclear under the strong topology. IfX is a weakly adapted mapping with values in such that for any,X'() has a modification which is a semimartingale then there exists a unique projective system of Hubert space-valued semimartingales indexed by the Hilbert-Schmidt neighbourhood base of the dual space whose projective limit isX.In the last part we study in detail a semimartingale defined as the convolution of a distribution by a random Dirac measure whose support is determined by the trajectories of a real-valued semimartingale.     

The Spectral Theory of Amenable Actions and Invariants of Discrete Groups

Let G denote a semisimple group, a discrete subgroup, B=G/P the Poisson boundary. Regarding invariants of discrete subgroups we prove, in particular, the following:(1) For any -quasi-invariant measure on B, and any probablity measure on , the norm of the operator () on L ²(B,) is equal to (), where is the unitary representation in L ²(X,), and is the regular representation of .(2) In particular this estimate holds when is Lebesgue measure on B, a Patterson–Sullivan measure, or a -stationary measure, and implies explicit lower bounds for the displacement and Margulis number of (w.r.t. a finite generating set), the dimension of the conformal density, the -entropy of the measure, and Lyapunov exponents of .(3) In particular, when G=PSL₂() and is free, the new lower bound of the displacement is somewhat smaller than the Culler–Shalen bound (which requires an additional assumption) and is greater than the standard ball-packing bound.We also prove that ()=_G() for any amenable action of G and L ¹(G), and conversely, give a spectral criterion for amenability of an action of G under certain natural dynamical conditions. In addition, we establish a uniform lower bound for the -entropy of any measure quasi-invariant under the action of a group with property T, and use this fact to construct an interesting class of actions of such groups, related to 'virtual' maximal parabolic subgroups. Most of the results hold in fact in greater generality, and apply for instance when G is any semi-simple algebraic group, or when is any word-hyperbolic group, acting on their Poisson boundary, for example.     

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 Shikata's distance between differentiable structures

Shikata proved: there is a number (n) with the following property: If two compact homeomorphic n-dimensional manifolds have a distance less than (n), then they are diffeomorphic. We improve the known lower bound (n!)^–n for (n) to 1/3n ^–2.This work was done under the program Sonderforschungsbereich Theoretische Mathematik (SFB 40) at Bonn University while Shikata was SFB-guest at Bonn.     

Asymptotics of a Boundary Crossing Probability of a Brownian Bridge with General Trend

Let us consider a signal-plus-noise model h(z)+B ₀(z), z [0,1], where > 0, h: [0,1] , and B ₀ is a Brownian bridge. We establish the asymptotics for the boundary crossing probability of the weighted signal-plus-noise model for , that is P (sup _{z [0,1]} w(z)( h(z)+B ₀(z))>c), for , (1) where w: [0,1] [0, is a weight function and c>0 is arbitrary. By the large deviation principle one gets a result with a constant which is the solution of a minimizing problem. In this paper we show an asymptotic expansion that is stronger than large deviation. As byproduct of our result we obtain the solution of the minimizing problem occurring in the large deviation expression. It is worth mentioning that the probability considered in (1) appears as power of the weighted Kolmogorov test applied to the test problem H ₀: h 0 against the alternative K: h>0 in the signal-plus-noise model.     

ε-Expansions in Dyson's Hierarchical Model

We consider Dyson's hierarchical model on a d-dimensional hierarchical lattice and define a renormalization group (RG) transformation for complex values of d as a map in the space of sequences of coupling constants determining the model Hamiltonian. We show that d=4 is a bifurcation value of this transformation for the RG transformation parameter equal to 1+2/d, and we construct a non-Gaussian RG-invariant Hamiltonian in terms of the (4–d)-expansion. We establish that the (–3/2)- and (4–d)-expansion coefficients for a non-Gaussian fixed point in the dimension d=3 have the same asymptotic representation as the size of the elementary cell tends to infinity, thus confirming that both the expansions describe the same nontrivial fixed point in the dimension three.     

On a Property of Subexponential Distributions

Let F be a distribution function (d.f.) on [0, ) with finite first moment m >0. We define the integrated tail distribution function F ₁ of F by F ₁(t)=m^-1 ₀ ^t (1- F(u))du, t0. In this paper, we obtain sufficient conditions under which implications FSF ₁S and F ₁S FS hold, where S is the class of subexponential distributions.     

Produktsätze für Verfahren zur Limitierung von Doppelfolgen

{p _mn } - ₀₀>0, (1, 1) (1.1) (1.2). {s _mn } J _p - ( bJ _p -lims _mn =), (1.3) 0<x,y<1 p _s (, )/p(x, y) x, y 1-. {r _mn } - , (1.5) 0<, <1. N _rp - , (1.6). , bJ _p -lims _mn = bJ _q -lim(N _rps) _mn =. J _p - . , .