The Lattice of Interpretability Types of Cantor Varieties

For integers 1 m < n, a Cantor variety with m basic n-ary operations _i and n basic m-ary operations _k is a variety of algebras defined by identities _k(₁( ), ... , _m( )) = _k and i(₁( ), ... ,_n( )) = y _i, where = (x ₁., ... , x _n) and = (y ₁, ... , y _m). We prove that interpretability types of Cantor varieties form a distributive lattice, , which is dual to the direct product ₁ × ₂ of a lattice, ₁, of positive integers respecting the natural linear ordering and a lattice, ₂, of positive integers with divisibility. The lattice is an upper subsemilattice of the lattice of all interpretability types of varieties of algebras.     

Infinitesimal obstructions to weakly mixing

Let ^t be the flow (parametrized with respect to arc length) of a smooth unit vector field v on a closed Riemannian manifold M ⁿ , whose orbits are geodesics. Then the (n-1)-plane field normal to v, v, is invariant under d ^t and, for each x M, we define a smooth real function _x (t) : (1 + _i (t)), where the _i(t) are the eigenvalues of AA ^T, A being the matrix (with respect to orthonormal bases) of the non-singular linear map d^2t , restricted to v at the point _x ^-t M ⁿ.Among other things, we prove the Theorem (Theorem II, below). Assume v is also volume preserving and that _x ^' (t) 0 for all x M and real t; then, if _x ^t : M M is weakly missng for some t, it is necessary that vx 0 at all x M.     

Disintegration with respect to L p-density functions and singular measures

Summary Let A be a real or complex commutative ordered algebra with identity and involution. Let denote the set of positive multiplicative linear functionals on A. Equip with the topology of simple convergence. For a fixed non-negative probability measure on the set _p of linear functionals f on A which admit an integral representation of the form with FL _p () (1p) is biuniquely identified with L _p () via the map tfF. The norm on _p under which this map becomes an isometry is characterized and a formula for approximating F is derived. The linear functionals which admit representation of the form with are also characterized and appropriately normed. The theory is applied to solve abstract versions of trigonometric and n-dimensional moment problems as well as provide an alternate point of view to the theory of L _p-spaces. New proofs of classical theorems are offered.Research for this paper was sponsored in part by the Danish Natural Science Research Council (Grant No.511-10302) and in part by the National Science Foundation (Grant No. MCS78-03397)The results contained herein include the proofs of theorems announced in [15]     

Der Satz von v. Staudt-Schleiermacher in Minkowski-Ebenen

Let be a Minkowski-(incidence-)plane and let be the group of free projectivities of , i. e. the subgroup generated by pairs of proper perspectivities with identical centers. Our theorem then asserts that is miquelian if satisfies condition (P ₅), i. e. every free projectivity with 5 fixed points is the identity. But first a lemma is shown, which holds in Möbius- and Laguerre-(incidence-)planes too: if fulfills (P ₅), then every affine derivation of is pappian.     

The Eta Invariant and the Real Connective K-Theory of the Classifying Space for Quaternion Groups

We express the real connective K-theory groups o_4k–1(B Q ) ofthe quaternion group Q of order = 2 ^j 8 in terms of therepresentation theory of Q by showing o_4k–1(B Q ) = Sp(S ^4k+3/Q )where is any fixed point free representation of Q in U(2k + 2).     

Sufficient Conditions for the Existence of Disintegrations

Let be a probability space and a partition of . A necessary and sufficient condition is given for the existence of a -additive and measurable disintegration of P on . It is also shown that P admits a -additive (but not measurable) disintegration on whenever is a standard space and the set (₁, ₂):₁ and ₂ are in the same element of } is coanalytic in ×. Finally, sufficient statistics (in the classical Fisherian sense) are investigated by using -additive disintegrations as conditional probabilities.     

Convex independent sets and 7-holes in restricted planar point sets

For a finite setA of points in the plane, letq(A) denote the ratio of the maximum distance of any pair of points ofA to the minimum distance of any pair of points ofA. Fork>0 letc (k) denote the largest integerc such that any setA ofk points in general position in the plane, satisfying for fixed , contains at leastc convex independent points. We determine the exact asymptotic behavior ofc (k), proving that there are two positive constants=(), such thatk ^1/3c (k)k ^1/3. To establish the upper bound ofc (k) we construct a set, which also solves (affirmatively) the problem of Alonet al. [1] about the existence of a setA ofk points in general position without a 7-hole (i.e., vertices of a convex 7-gon containing no other points fromA), satisfying . The construction uses Horton sets, which generalize sets without 7-holes constructed by Horton and which have some interesting properties.     

On Plane Maximal Curves

The number N of rational points on an algebraic curve of genus g over a finite field satisfies the Hasse–Weil bound . A curve that attains this bound is called maximal. With and , it is known that maximalcurves have . Maximal curves with have been characterized up to isomorphism. A natural genus to be studied is and for this genus there are two non-isomorphic maximal curves known when . Here, a maximal curve with genus g ₂ and a non-singular plane model is characterized as a Fermat curve of degree .     

On the Harris Recurrence of Iterated Random Lipschitz Functions and Related Convergence Rate Results

A result by Elton⁽⁶⁾ states that an iterated function system

A preconditioner for constrained and weighted least squares problems with Toeplitz structure

We study methods for solving the constrained and weighted least squares problem min _x by the preconditioned conjugate gradient (PCG) method. HereW = diag (₁, , _m ) with _{1 m} 0, andA ^T = [T ₁ ^T , ,T _k ^T ] with Toeplitz blocksT _l R ^{n × n} ,l = 1, ,k. It is well-known that this problem can be solved by solving anaugmented linear 2 × 2 block linear systemM +Ax =b, A ^T = 0, whereM =W ^–1. We will use the PCG method with circulant-like preconditioner for solving the system. We show that the spectrum of the preconditioned matrix is clustered around one. When the PCG method is applied to solve the system, we can expect a fast convergence rate.Research supported by HKRGC grants no. CUHK 178/93E and CUHK 316/94E.     

Computations of K- and L-Theory of Cocompact Planar Groups

The verification of the isomorphism conjectures of Baum and Connes and Farrell and Jones for certain classes of groups is used to compute the algebraic K- and L-theory and the topological K-theory of cocompact planar groups (=cocompact N.E.C-groups) and of groups G appearing in an extension where is a finite group and the conjugation -action on ⁿ is free outside . These computations apply, for instance, to two-dimensional crystallographic groups and cocompact Fuchsian groups.     

A Delocalization Property for Assembly Maps and an Application in Algebraic K-Theory of Group Rings

Let be a group, F the free -module on the set of finite order elements in , with acting by conjugation, and the ring extension of by % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeaacaGaaiaabeqaamaabaabaaGcbaWaaiWaaeaada% WcaaqaaiaaigdaaeaatCvAUfKttLearyGqLXgBG0evaGqbciab-5ga% UbaaieaacaGFLbGaaGOmaiaabc8acqWFPbqAcaqGVaGae8NBa42aaq% qaaeaacqGHdicjcqaHZoWzcqGHiiIZcqqHtoWrcaqGGaGaae4Baiaa% bAgacaqGGaGaae4BaiaabkhacaqGKbGaaeyzaiaabkhacaqGGaGae8% NBa4gacaGLhWoaaiaawUhacaGL9baaaaa!563E!\[\left\{ {\frac{1}{n}e2{\text{\pi }}i{\text{/}}n\left| {\exists \gamma \in \Gamma {\text{ of order }}n} \right.} \right\}\]. For a ring R with , we build an injective assembly map , detected by the Dennis trace map. This is proved by establishing a delocalization property for the assembly map in Hochschild homology, namely providing a gluing of simpler assembly maps (i.e. localized at the identity of ) to build , and by delocalizing a known assembly map in K-theory to define . We also prove the delocalization property in cyclic homology and in related theories.     

An application of Shoenfield's absoluteness theorem to the theory of uniform distribution

IfC is a Polish probability space, a Borel set whose sectionsW _x ( have measure one and are decreasing , then we show that the set _x W _x has measure one. We give two proofs of this theorem—one in the language of set theory, the other in the language of probability theory, and we apply the theorem to a question on completely uniformly distributed sequences.Supported by DFG grant Ko 490/7-1.     

Spherical elastic-plastic waves

Zusammenfassung Es wird die Fortpflanzung elastisch-plastischer Spannungswellen in einem unendlichen Medium betrachtet, welches einer idealen Spannungs-Verformungs-Kurve folgt, Trescas Fliesskriterium unterworfen ist und einen sphärischen Hohlraum enthält, wobei an der Fläche des Hohlraumes ein Stoss angenommen wird. Ein rechnerisches Verfahren, basiert auf endliche Differenzen, wird entwickelt and ein Beispiel gegeben.

---

Notation radial stress - tangential stress - K yield stress - _rr non-dimensional radial stress ( /K) - non-dimensional tangential stress ( /K) - , Lame's constants - K _b Bulk constant (=(3+2)/3) - v Poisson's constant - Material density - C Elastic wave velocity (=((+2)/)^1/2) - C _p Plastic wave velocity (=(K _b /)^1/2) - distance from center of cavity - r ₀ cavity radius - v non-dimensional radial co-ordinate (= /r ₀) - time - t non-dimensional time (=C /r ₀) - radial displacement - u non-dimensional radial displacement (=/r ₀) - particle velocity - v non-dimensional particle velocity (= /C) - pressure - P(t) non-dimensional pressure (= /K)     

The Higher K-Theory of Real Curves

If X is a smooth curve defined over the real numbers , we show that K _n (X) is the sum of a divisible group and a finite elementary Abelian 2-group when n 2. We determine the torsion subgroup of K _n (X), which is a finite sum of copies of and 2, only depending on the topological invariants of X() and X(), and show that (for n 2) these torsion subgroups are periodic of order 8.     

A representation theorem for weak automorphisms of a universal algebra

Given a group G and a descending chainG ₀,G ₁,...,G _n, of normal subgroups ofG, we prove that there exists a universal algebra , such that the chain ...W_n( )...W₁( }) W₀( )W( ) is isomorphic to the chain ...G _n ...G ₁G ₀G, where W( ) is the group of weak automorphisms of , and W_n( ) is the group of weak automorphisms of that leaves alln-ary operations fixed.We also prove that there are an infinite number of non-isomorphic algebras that satisfy the above.These results are a generalization of those proved by J. Sichler, in the special case when G=G₀, and G₁=G₂=...=G_n=....Presented by J. Mycielski.This paper comprises part of the author's doctoral dissertation at the University of Notre Dame in 1983. The author wishes to express her deep gratitude to Professor Abraham Goetz for suggesting this problem, for being extremely generous with his time and experience, and for giving her his constant encouragement. The author also thanks the reviewer for his helpful comments.     

The quality of the Diophantine approximations found by the Jacobi-Perron algorithm and related algorithms

Given a vector of real numbers=(₁,... _d ) ^d , the Jacobi-Perron algorithm and related algorithms, such as Brun's algorithm and Selmer's algorithm, produce a sequence of (d+1)×(d+1) convergent matrices {C⁽ⁿ⁾():n1} whose rows provide Diophantine approximations to . Such algorithms are specified by two mapsT:[0, 1] ^d [0, 1] ^d and A:[0,1] ^d GL(d+1,), which compute convergent matrices C⁽ⁿ⁾())...A(T())A(). The quality of the Diophantine approximations these algorithms find can be measured in two ways. The best approximation exponent is the upper bound of those values of for which there is some row of the convergent matrices such that for infinitely many values ofn that row of C⁽ⁿ⁾() has . The uniform approximation exponent is the upper bound of those values of such that for all sufficiently large values ofn and all rows of C⁽ⁿ⁾⁽⁾ one has . The paper applies Oseledec's multiplicative ergodic theorem to show that for a large class of such algorithms and take constant values and on a set of Lebesgue measure one. It establishes the formula where are the two largest Lyapunov exponents attached by Oseledec's multiplicative ergodic theorem to the skew-product (T, A,d), whered is aT-invariant measure, absolutely continuous with respect to Lebesgue measure. We conjecture that holds for a large class of such algorithms. These results apply to thed-dimensional Jacobi-Perron algorithm and Selmer's algorithm. We show that; experimental evidence of Baldwin (1992) indicates (nonrigorously) that. We conjecture that holds for alld2.     

Automorphisms on a Lie group contracting modulo a compact subgroup and applications to semistable convolution semigroups

Let ( _t ) _t0 be a -semistable convolution semigroup of probability measures on a Lie groupG whose idempotent ₀ is the Haar measure on some compact subgroupK. Then all the measures ₁ are supported by theK-contraction groupC _K() of the topological automorphism ofG. We prove here the structure theoremC _K()=C()K, whereC() is the contraction group of . Then it turns out that it is sufficient to study semistable convolution semigroups on simply connected nilpotent Lie groups that have Lie algebras with a positive graduation.     

Epsilon efficiency

This paper considers the extension of -optimality for scalar problems to vector maximization problems, or efficiency problems, which havem objective functions defined on a set .It is shown that the natural extension of the scalar -optimality concepts [viz, given >0, given a solution setS, ifxS there exists an efficient solutiony with f(x)–f(y), and given an efficient solutiony, there exists anxS with f(x)–f(y)] do not hold for some methods used. Six concepts of -efficient sets are introduced and examined, to a very limited extent, in the context of five methods used for generating efficient points or near efficient points.In doing so, a distinction is drawn between methods in which the surrogate optimizations are carried out exactly, and those where terminal -optimal solutions are obtained.The author would like to thank the referees whose thoroughness was extremely helpful for the revised paper.     

On a Family of Hyperplane Arrangements Related to the Affine Weyl Groups

Let be an irreducible crystallographic rootsystem in a Euclidean space V, with ⁺ theset of positive roots. For , , let be the hyperplane . We define a set of hyperplanes . This hyperplane arrangement is significant inthe study of the affine Weyl groups. In this paper it is shown that thePoincaré polynomial of is , where n is the rank of and h is the Coxeter number of the finiteCoxeter group corresponding to .