Nonlinear transformations of the canonical gauss measure on Hilbert space and absolute continuity

The papers of R. Ramer and S. Kusuoka investigate conditions under which the probability measure induced by a nonlinear transformation on abstract Wiener space(,H,B) is absolutely continuous with respect to the abstract Wiener measure. These conditions reveal the importance of the underlying Hilbert spaceH but involve the spaceB in an essential way. The present paper gives conditions solely based onH and takes as its starting point, a nonlinear transformationT=I+F onH. New sufficient conditions for absolute continuity are given which do not seem easily comparable with those of Kusuoka or Ramer but are more general than those of Buckdahn and Enchev. The Ramer-Itô integral occurring in the expression for the Radon-Nikodym derivative is studied in some detail and, in the general context of white noise theory it is shown to be an anticipative stochastic integral which, under a stronger condition on the weak Gateaux derivative of F is directly related to the Ogawa integral.Research supported by the National Science Foundation and the Air Force Office of Scientific Research Grant No. F49620 92 J 0154 and the Army Research Office Grant No. DAAL 03 92 G 0008.     

Representation of elements of a sequence by sumsets

In this note the method of [5] and a result from [3] are combined to treat the following classical problem: Given a finite setA and an infinite sequenceS (both inZ), what is the minimal number of elements ofA whose sum lies inS? We obtain an upper bound depending only on the densities ofA andS (but not on their arithmetic nature).     

Prescribed scalar curvature on then-sphere

This paper considers the prescribed scalar curvature problem onS ⁿ forn>-3. We consider the limits of solutions of the regularization obtained by decreasing the critical exponent. We characterize those subcritical solutions which blow up at the least possible energy level, determining the points at which they can concentrate, and their Morse indices. We then show that forn=3 this is the only blow up which can occur for solutions. We use this in combination with the Morse inequalities for the subcritical problem to obtain a general existence theorem for the prescribed scalar curvature problem onS ³.This article was processed by the author using the style filepljourlm from Springer-Verlag.     

Zero cycles on conic fibrations and a conjecture of Bloch

Let X be a smooth projective surface over a number field k. Let (CH₀(X)) denote the Chow group of zero-cyles modulo rational equivalence on X. Let CH₀(X) be the subgroup of CH ₀(X) consisting of classes which vanish when going over to an arbitrary completion of k. Bloch put forward a conjecture asserting that this group is isomorphic to the Tate-Shafarevich group of a certain Galois module atttached to X. In this paper, we disprove this general conjecture. We produce a conic bundle X over an elliptic curve, for which the group (CH₀(X) is not zero, but the Galois-theoretic Tate-Shafarevich group vanishes.     

On the cube problem of Las Vergnas

We prove a conjecture of Las Vergnas in dimensions d7: The matroid of the d-dimensional cube C ^d has a unique reorientation class. This extends a result of Las Vergnas, Roudneff and Salaün in dimension 4. Moreover, we determine the automorphism group G ^d of the matroid of the d-cube C ^d for arbitrary dimension d, and we discuss its relation to the Coxeter group of C ^d . We introduce matroid facets of the matroid of the d-cube in order to evaluate the order of G ^d . These matroid facets turn out to be arbitrary pairs of parallel subfacets of the cube. We show that the Euclidean automorphism group W ^d is a proper subgroup of the group G ^d of all matroid symmetries of the d-cube by describing genuine matroid symmetries for each Euclidean facet. A main theorem asserts that any one of these matroid symmetries together with the Euclidean Coxeter symmetries generate the full automorphism group G ^d . For the proof of Las Vergnas' conjecture we use essentially these symmetry results together with the fact that the reorientation class of an oriented matroid is determined by the labeled lower rank contractions of the oriented matroid. We also describe the Folkman-Lawrence representation of the vertex figure of the d-cube and a contraction of it. Finally, we apply our method of proof to show a result of Las Vergnas, Roudneff, and Salaün that the matroid of the 24-cell has a unique reorientation class, too.     

On the maximal length of two sequences of integers in arithmetic progressions with the same prime divisors

In this paper we consider an analogue of the problem of Erds and Woods for arithmetic progressions. A positive answer follows from theabc conjecture. Partial results are obtained unconditionally.     

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.     

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.     

Computational complexity of inner and outerj-radii of polytopes in finite-dimensional normed spaces

This paper studies the complexity of computing (or approximating, or bounding) the various inner and outer radii of ann-dimensional convex polytope in the space ⁿ equipped with an _p norm or a polytopal norm. The polytopeP is assumed to be presented as the convex hull of finitely many points with rational coordinates (V-presented) or as the intersection of finitely many closed halfspaces defined by linear inequalities with rational coefficients (-presented). The innerj-radius ofP is the radius of a largestj-ball contained inP; it isP's inradius whenj = n and half ofP's diameter whenj = 1. The outerj-radius measures how wellP can be approximated, in a minimax sense, by an (n — j)-flat; it isP's circumradius whenj = n and half ofP's width whenj = 1. The binary (Turing machine) model of computation is employed. The primary concern is not with finding optimal algorithms, but with establishing polynomial-time computability or NP-hardness. Special attention is paid to the case in whichP is centrally symmetric. When the dimensionn is permitted to vary, the situation is roughly as follows: (a) for general -presented polytopes in _p spaces with 1相似文献   

Cp*Me5P6C5: Ein neues Carbaphosphan mit einem Strukturelement aus dem Hittorfschen Phosphor

Cp*Me₅P₆C₅: A New Carbaphosphane with a Structure Unit of Hittorf-Phosphorus The thermolysis of 1,2,3-tris(pentamethylcyclopentadienyl)cyclotriphosphane [(Cp*P)₃, 1 ] or 2,3,4,6-Tetrakis(pentamethylcyclopentadienyl)bicyclo[3.1.0]hexaphosphane [Cp*₄P₆, 2 ] leads in addition to the known 3,4-bis(pentamethylcyclopentadienyl)tricyclo[3.1.0.0^{2, 6}]hexaphosphane [Cp*₂P₆, 3 ] to the pentacyclic carbaphosphanes 3,4,5,6,11-pentamethyl-endo-9-pentamethylcyclopentadienyl- 3,4,5,6,11-pentacarba-pentacyclo [6.1.1^1,8.1^3,6.0^2,70^10,11]-4-en-undecaphosphane and 3,4,5,6,11-pentamethyl-exo-9-pentamethylcyclopentadienyl-3,4,5,6,11-pentacarba-pentacyclo [6.1.1^1,8.1^3,6.0^2,70^10,11]-4-en-undecaphosphane [Cp*Me₅P₆C₅, 4a, 4b ]. Furthermore, other polyphosphanes are formed, like 1,2,3,4-tetrakis(pentamethylcyclopentadienyl)cyclotetraphosphane [(Cp*P)₄, 5 ] and 2,4-bis(pentamethylcyclopentadienyl)-tetraphosphabicyclo[1.1.0]butane [(Cp*P)₂P₂, 6 ]. The structure of 4a and 4b is determined by NMR-spectroscopy. The molecule contains a P₅C₃-cunean-unit, to which a C₂Me₂-brigde and a PCp*-brigde is bonded.