Lattice invariant valuations on rational polytopes

Let be a lattice ind-dimensional euclidean space , and the rational vector space it generates. If is a valuation invariant under, andP is a polytope with vertices in , then for non-negative integersn there is an expression , where the coefficient(P, n) depends only on the congruence class ofn modulo the smallest positive integerk such that the affine hull of eachr-face ofk P is spanned by points of. Moreover, _r satisfies the Euler-type relation where the sum extends over all non-empty facesF ofP. The proof involves a specific representation of simple such valuations, analogous to Hadwiger's representation of weakly continuous valuations on alld-polytopes. An example of particular interest is the lattice-point enumeratorG, whereG(P) = card(P); the results of this paper confirm conjectures of Ehrhart concerningG.     

The order of approximation to functions of the Zα. Class by means of positive linear operators

Let C_n (, ) be the upper bound for deviations of periodic functions which form the Zygmund class Z,0 0<<2 from a class of positive linear operators. A study is made of the conditions under which there exists a limit nC_n(, )=C(, ). An explicit expression is given for the functions C(,).Translated from Matematicheskie Zametki, Vol. 4, No. 2, pp. 201–210, August, 1968.     

On flag-transitive affine planes of orderq 3

Let be a translation plane of orderq ³,q an odd prime power, whose kern GF(q). Letl be the line at infinity of . LetG be a solvable collineation group of in the linear translation complement, which acts transitively onl , and letH be a maximal normal cyclic subgroup ofG. Then the restriction ofH onl acts semiregularly onl and {1, 2, 3, 6}, where is the restriction ofG onl (ifq –1(mod 3), then {1, 2}). Ifq {3, 5} and {1, 2}, then is determined completely, using a computer.     

Almost Fredholm operators in von Neumann algebras

LetA be a von Neumann algebra,J be the ideal of compact operators relative toA and letF ₊ be the left-Fredholm class ofA. We call almost left-Fredholm the class = {A A: if P A is a projection and AP J then P J}. Then and the inclusion is proper unlessA is semifinite and has a non-large center. satisfies all of the algebraic properties ofF ₊ but it is generally not open. IfA is semifinite then A iff there are central projectionsG with G = I such that AG F₊(AG). Let :A A/J. Then the left almost essential spectrum ofA A, , coincides with the set of eigenvalues of (A)     

Poisson kernel is the unique approximate identity,asymptotically multiplicative on H∞

Let for anyf H(R), where (x): = ^–1(x^–1). Then (x) P (x + h) for some h R and > 0; P denotes the Poisson kernel.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 170, pp. 82–89, 1989.     

The conditions for the imbedding of the classes H k,R ω \tilde H_{k,R}^\omega

We find the necessary and sufficient conditions for the imbeddings in terms of the majorants and (R=L₂,C₂;l>k).Translated from Matematicheskie Zametki, Vol. 13, No. 2, pp. 169–178, February, 1973.     

Two Splittings of a Square Matrix

In this note it is shown that any square matrix AC ^n×n can be represented as the sum A= , where is complex symmetric and rank . The corresponding persymmetric result can be used in finding the terms of a small rank perturbed Toeplitz matrix via an O(n ²) computation. This allows one to perform fast matrix–vector products in case n is large.     

On relations among moduli of continuity in Lorentz spaces

Estimates are obtained among moduli of continuity of functions in several variables that belong to various Lorentz spaces. The functions considered are periodic with period 1 in each variable. More exactly the following theorem is proved: If 0<,<(t) and (t) are so-called -functions such that _;>₁>1, and

About existence and uniqueness of the restricted total least squares estimation

Summary Total Least Squares (TLS) is an estimation method for the solutiona of the linear system when both data sets and are subject to error. The TLS-method minimizes the functional with weighting parameter . In this paper the TLS-functional is analyzed by the technique of Lagrangian multipliers. The main part of the work deals with the case when the estimatea is restricted by an inequality of the formD a–b0, D a diagonal matrix. It is shown that there exists a unique estimatea if the weighting parameter is chosen sufficiently large.     

Moyennes uniformes et moyennes suivant une marche aléatoire

Summary Let be a bounded function on such that converges towards l as n goes to infinity, uniformly with respect to m. Let {X _n} be a random walk on , not concentrated on a proper subgroup of Then, with probability 1, converges towards l as n goes to infinity. The result also holds for any countable abelian group instead of . Other modes of convergence are considered (Cesaro convergence of order >1/2). The Cesaro convergence of expressions such that (X _n) (X _n+1) is also investigated.     

Harmonicity of gradient mappings of level surfaces in a real affine space

In our previous paper [4] we have investigated level surfaces of a non-degenerate function in a real affine space A ⁿ⁺¹ by using the gradient vector field . We gave characterizations of by means of the shape operatorS, the transversal connection , and studied the difference between and the affine normal. In particular we showed that a graph defined by a non-degenerate function satisfiesS=0 and =0. In this paper we consider harmonic gradient mappings of level surfaces and apply these results to a certain problem which is similar to the affine Bernstein problem conjectured by S. S. Chern [3].     

Conditions of Local Asymptotic Normality for Gaussian Stationary Processes

Let {\bold x}[] be a stationary Gaussian process with zero mean and spectral density f, let be the -algebra induced by the random variables {\bold x}[], D(R¹), and let _t, t > 0, be the -algebra induced by the random variables x[],supp [-t,t]. Denote by (f) the Gaussian measure on generated by {\bold x}. Let _t(f) be the restriction of (f) to _t. Let f and g be nonnegative functions such that the measures _t(f) and _t(g) are absolutely continuous. Put

QUADRATIC ESTIMATORS OF QUADRATIC FUNCTIONS WITH PARAMETERS IN NORMAL LINEAR MODELS

ＱＵＡＤＲＡＴＩＣＥＳＴＩＭＡＴＯＲＳＯＦＱＵＡＤＲＡＴＩＣＦＵＮＣＴＩＯＮＳＷＩＴＨＰＡＲＡＭＥＴＥＲＳＩＮＮＯＲＭＡＬＬＩＮＥＡＲＭＯＤＥＬＳ￥ＷＵＱＩＧＵＡＮＧ（吴启光）（ＩｎｓｔｉｔｕｔｅｏｆＳｙｓｔｅｍｅＳｃｉｅｎｃｅ,ｔｈｅＣｈｉｎｅｓｅ...     

On Homotopes of Novikov Algebras

Given a unital associative commutative ring containing , we consider a homotope of a Novikov algebra, i.e., an algebra that is obtained from a Novikov algebra A by means of the derived operation on the -module A, where the mapping satisfies the equality . We find conditions for a homotope of a Novikov algebra to be again a Novikov algebra.     

Das System Totalpolarer und eine Kennzeichnung des Winkels von Hyperebenen in Cayley/Klein-Räumen

In this paper at first we introduce thesystem of total polar subspaces of an arbitrary k-diniensional plane with respect to the absolute (configuration) of an arbitrary n- dimensional CAYLEY/KLEIN space as a generalization of the total polar set of a regular k-plane of . Using the system of total polar sets of the intersection (n–2)-plane of two hyperplanes and we give the followingnew characterization of the angle of . and : for any straight line g with and g=Ø the angle of and is equal to the distance of the two intersection points of g with and .

---

---

Herrn Prof. Dr.Oswald Giering zum 60. Geburtstag gewidmet     

A homotopy algorithm for a symmetric generalized eigenproblem

In this paper, a homotopy algorithm for finding all eigenpairs of a real symmetric matrix pencil (A, B) is presented, whereA andB are realn×n symmetric matrices andB is a positive semidefinite matrix. In the algorithm, pencil (A, B) is first reduced to a pencil , where is a symmetric tridiagonal matrix and is a positive definite and diagonal matrix. Then, the Divide and Conquer strategy with homotopy continuation approach is used to find all eigenpairs of pencil . One can easily form the eigenpair (x,) of pencil (A, B) from the eigenpair (y, ) of pencil with a few computations. Numerical comparisons of our algorithm with the QZ algorithm in the widely used EISPACK library are presented. Numerical results show that our algorithm is strongly competitive in terms of speed, accuracy and orthogonality. The performance of the parallel version of our algorithm is also presented.Research supported in part by NSF under Grant CCR-9024840.     

Characterization of Smoothness of Multivariate Refinable Functions and Convergence of Cascade Algorithms of Nonhomogeneous Refinement Equations

This paper concerns multivariate homogeneous refinement equations of the form

Foliations with One-Sided Branching

We generalize the main results from the author's paper in Geom. Topol. 4 (2000), 457–515 and from Thurston's eprint math.GT/9712268 to taut foliations with one-sided branching. First constructed by Meigniez, these foliations occupy an intermediate position between -covered foliations and arbitrary taut foliations of 3-manifolds. We show that for a taut foliation with one-sided branching of an atoroidal 3-manifold M, one can construct a pair of genuine laminations ^± of M transverse to with solid torus complementary regions which bind every leaf of in a geodesic lamination. These laminations come from a universal circle, a refinement of the universal circles proposed by Thurston (unpublished), which maps monotonely and ₁(M)-equivariantly to each of the circles at infinity of the leaves of , and is minimal with respect to this property. This circle is intimately bound up with the extrinsic geometry of the leaves of . In particular, let denote the pulled-back foliation of the universal cover, and co-orient so that the leaf space branches in the negative direction. Then for any pair of leaves of with , the leaf is asymptotic to in a dense set of directions at infinity. This is a macroscopic version of an infinitesimal result from Thurston and gives much more drastic control over the topology and geometry of , than is achieved by him. The pair of laminations ^± can be used to produce a pseudo-Anosov flow transverse to which is regulating in the nonbranching direction. Rigidity results for ^± in the -covered case are extended to the case of one-sided branching. In particular, an -covered foliation can only be deformed to a foliation with one-sided branching along one of the two laminations canonically associated to the -coveredfoliation constructed in Geom. Topol. 4 (2000), 457–515, and these laminations become exactly the laminations ^± for the new branched foliation. Other corollaries include that the ambient manifold is -hyperbolic in the sense of Gromov, and that a self-homeomorphism of this manifold homotopic to the identity is isotopic to the identity.     

On the Normal Order of ϕk+1(n)/ϕk(n), where ϕk is the k-Fold Iterate of Euler's Function

Let be the j-fold iterated function of . Let and > 0 be fixed, Q be a prime, and let N _k(Q|x) denote the number of those nx for which Q . We give the asymptotics of N _k(Q|x) in the range .     

Most stringent and maximin tests as solutions of linear programming problems

Summary The problem to obtain the most stringent size- test ^* is formulated as a linear programming problem of type II (Section 2). If sample space and parameter space are finite, then we obtain a discrete linear programming problem (Section 4). The well-known results for this special case, and the results of Krafft and Witting for the maximin size- test, point out how to formulate the dual problem of type I in the general case and how to develop the corresponding duality theory (Sections 5 and 6). It turns out that ^* can be determined completely by the solution of the dual type I problem, which solution may be characterized by means of a least favorable pair of probability measures over _H and _K respectively (Section 7). Statistical interpretation shows further that ^* can also be characterized by means of a least favorable distribution over _K alone (Section 8).