On products of k atoms

Let H be an atomic monoid. For k ? \Bbb Nk \in {\Bbb N} let V_k (H){\cal V}_k (H) denote the set of all m ? \Bbb Nm \in {\Bbb N} with the following property: There exist atoms (irreducible elements) u ₁, …, u _k , v ₁, …, v _m ∈ H with u ₁· … · u _k = v ₁ · … · v _m . We show that for a large class of noetherian domains satisfying some natural finiteness conditions, the sets V_k (H){\cal V}_k (H) are almost arithmetical progressions. Suppose that H is a Krull monoid with finite cyclic class group G such that every class contains a prime (this includes the multiplicative monoids of rings of integers of algebraic number fields). We show that, for every k ? \Bbb Nk \in {\Bbb N}, max V_2k+1 (H) = k |G|+ 1{\cal V}_{2k+1} (H) = k \vert G\vert + 1 which settles Problem 38 in [4].     

CHAOS EXPANSION OF LOCAL TIME OF FRACTIONAL BROWNIAN MOTIONS

We find the chaos expansion of local time ? _T ^(H)(x,·) of fractional Brownian motion with Hurst coefficient H∈(0,1) at a point x∈R ^d . As an application we show that when H ₀ d<1 then ? _T ^(H)(x,·)∈L ²(μ). Here μ denotes the probability law of B ^(H) and H ₀=max{H ₁,…,H _d }. In particular, we show that when d=1 then ? _T ^(H)(x,·)∈L ²(μ) for all H∈(0,1).     

Graph norms and Sidorenko’s conjecture

Let H and G be two finite graphs. Define h _H (G) to be the number of homomorphisms from H to G. The function h _H (·) extends in a natural way to a function from the set of symmetric matrices to ℝ such that for A _G , the adjacency matrix of a graph G, we have h _H (A _G ) = h _H (G). Let m be the number of edges of H. It is easy to see that when H is the cycle of length 2n, then h _H (·)^1/m is the 2n-th Schatten-von Neumann norm. We investigate a question of Lovász that asks for a characterization of graphs H for which the function h _H (·)^1/m is a norm.     

The size Ramsey number of trees with bounded degree

The size Ramsey number r?(G, H) of graphs G and H is the smallest integer r? such that there is a graph F with r? edges and if the edge set of F is red-blue colored, there exists either a red copy of G or a blue copy of H in F. This article shows that r?(T_nd, T_nd) ? c · d² · n and c · n³ ? r?(K_n, T_nd) ? c(d)·n³ log n for every tree T_nd on n vertices. and maximal degree at most d and a complete graph K_n on n vertices. A generalization will be given. Probabilistic method is used throught this paper. © 1993 John Wiley Sons, Inc.     

Degree sequences of graphs and dominance order

Suppose that the graphical partition H(A) = (a₂¹ ≥ ··· ≥ a_n¹) arises from A = (a₁ ≥ ··· ≥ a_n) by deleting the largest summand a₁ from A and reducing the a₁ largest of the remaining summands by one. Let (a_i+1′ ≥ ··· ≥ a_n′) = H′(A) denote the partition obtained by applying the operator H i times. We prove that the dominance order of partitions is preserved when we switch from A to (a₁ ≥ a₂¹ ≥ ··· ≥ a_i+1′ ≥ ···) =: E(A). This generalizes a recent result by Favaron, Mahéo, and Saclé on the residue of a graph. © 1996 John Wiley & Sons, Inc.     

On Asymptotic Behavior for Singularities of the Powers of Mean Curvature Flow

Let M^n be a smooth, compact manifold without boundary, and F0 ： M^n→ R^n＋1 a smooth immersion which is convex. The one-parameter families F（·, t） ： M^n× [0, T） → R^n＋1 of hypersurfaces Mt^n= F（·,t）（M^n） satisfy an initial value problem dF/dt （·,t） = -H^k（· ,t）v（· ,t）, F（· ,0） = F0（· ）, where H is the mean curvature and u（·,t） is the outer unit normal at F（·, t）, such that -Hu = H is the mean curvature vector, and k 〉 0 is a constant. This problem is called H^k-fiow. Such flow will develop singularities after finite time. According to the blow-up rate of the square norm of the second fundamental forms, the authors analyze the structure of the rescaled limit by classifying the singularities as two types, i.e., Type Ⅰ and Type Ⅱ. It is proved that for Type Ⅰ singularity, the limiting hypersurface satisfies an elliptic equation; for Type Ⅱ singularity, the limiting hypersurface must be a translating soliton.     

Van der corput’s difference theorem

We obtain a sufficient condition for a subsetH of positive integers to satisfy that the equidistribution (mod 1) of the sequences (u _n+h − u _n; n=1, 2, ···) for allh ∈H implies the equidistribution of (u _n). Our condition is satisfied, for example, for the following sets: (1)H={n − m; n ∈ I, m ∈ I, n>m}, whereI is any infinite subset of integers; (2)H={| ψ (n)|; ψ(n)≠0,n ∈ Z}, where ψ is a nonconstant polynomial with integral coefficients having at least one integral zero (modq) for allq=2, 3, ···; (3)H={p+1;p is a prime} andH={p − 1;p is a prime}.     

Characterizations of new Cohen summing bilinear operators

We prove two characterizations of new Cohen summing bilinear operators. The first one is: Let X, Y and Z be Banach spaces, 1 < p < ∞, V : X × Y → Z a bounded linear operator and n ≥ 2 a natural number. Then V is new Cohen p-summing if and only if for all Banach spaces X₁,?…?, X_n and all p-summing operators U : X₁ × · · · × X_n → X, the operator V ? (U, I_Y) : X₁ × · · · × X_n × Y → Z is -summing. The second result is: Let H be a Hilbert space,, Y, Z Banach spaces and V : H × Y → Z a bounded bilinear operator and 1 < p < ∞. Then V is new Cohen p-summing if and only if for all Banach spaces E and all p-summing operators U : E → H, the operator V ? (U, I_Y) is (p, p*)-dominated.     

On Chow and Brauer groups of a product of Mumford curves

Let C₁,···,C_d be Mumford curves defined over a finite extension of and let X=C₁×···×C_d. We shall show the following: (1) The cycle map CH₀(X)/n → H^2d(X, μ_n^⊗d) is injective for any non-zero integer n. (2) The kernel of the canonical map CH₀(X)→Hom(Br(X),) (defined by the Brauer-Manin pairing) coincides with the maximal divisible subgroup in CH₀(X).     

Recurrence in unipotent groups and ergodic nonabelian group extensions

LetT be a measure-preserving and ergodic transformation of a standard probability space (X,S, μ) and letf:X → SUT _d (ℝ) be a Borel map into the group of unipotent upper triangulard ×d matrices. We modify an argument in [12] to obtain a sufficient condition for the recurrence of the random walk defined byf, in terms of the asymptotic behaviour of the distributions of the suitably scaled mapsf(n,x)=(fT ⁿ⁻¹·fT ⁿ⁻²…fT·f). We give examples of recurrent cocycles with values in the continuous Heisenberg group H₁(ℝ)=SUT₃(ℝ), and we use a recurrent cocycle to construct an ergodic skew-product extension of an irrational rotation by the discrete Heisenberg group H₁(ℤ)=SUT₃(ℤ). The author was partially supported by the FWF research project P16004-MAT.     

The bicompletion of an asymmetric normed linear space

A biBanach space is an asymmetric normed linear space (X,‖·‖) such that the normed linear space (X,‖·‖^s) is a Banach space, where ‖x‖^s= max {‖x‖,‖-x‖} for all x∈X. We prove that each asymmetric normed linear space (X,‖·‖) is isometrically isomorphic to a dense subspace of a biBanach space (Y,‖·‖_Y). Furthermore the space (Y,‖·‖_Y) is unique (up to isometric isomorphism). This revised version was published online in August 2006 with corrections to the Cover Date.     

Inverse problem for a perturbed stratified strip in two dimensions

We consider the divergence form elliptic operator A=??_x,z·(c²(x,z) ?_x,z) in the strip Ω=?× [0,H]. The velocity c(x,z) describes the multistratification of Ω: a horizontal stratification with a compact perturbation K, the velocity in K is a L^∞(K) function. We suppose that the position of the perturbation is known and we prove uniqueness for identification of the perturbation from one generalized eigenfunction pattern in the neighbourhood of K. Copyright © 2004 John Wiley & Sons, Ltd.     

On the Constructive Inverse Problem in Differential Galois Theory#

We give sufficient conditions for a differential equation to have a given semisimple group as its Galois group. For any group G with G ⁰ = G ₁ · ··· · G _r , where each G _i is a simple group of type A_?, C_?, D_?, E₆, or E₇, we construct a differential equation over C(x) having Galois group G.     

Forbidden induced subgraph characterization of cograph contractions

Let S₁, S₂,…,S_t be pairwise disjoint non‐empty stable sets in a graph H. The graph H^* is obtained from H by: (i) replacing each S_i by a new vertex q_i; (ii) joining each q_i and q_j, 1 ≤ i # j ≤ t, and; (iii) joining q_i to all vertices in H – (S₁ ∪ S₂ ∪ ··· ∪ S_t) which were adjacent to some vertex of S_i. A cograph is a P₄‐free graph. A graph G is called a cograph contraction if there exist a cograph H and pairwise disjoint non‐empty stable sets in H for which G ? H^*. Solving a problem proposed by Le [ 2 ], we give a finite forbidden induced subgraph characterization of cograph contractions. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 217–226, 2004     

The ultrametric corona problem

Let K be a complete ultrametric algebraically closed field and let A be the K-Banach algebra of bounded analytic functions in the disk D: |x| < 1. Let Mult(A, ∥ · ∥) be the set of continuous multiplicative semi-norms of A, let Mult _m (A, ∥ · ∥) be the subset of the ϕ ∈ Mult(A, ∥ · ∥) whose kernel is a maximal ideal and let Mult _a (A, ∥ · ∥) be the subset of the ϕ ∈ Mult _m (A, ∥ · ∥) whose kernel is of the form (x − a)A, a ∈ D ( if ϕ ∈ Mult _m (A, ∥ · ∥) \ Mult _a (A, ∥ · ∥), the kernel of ϕ is then of infinite codimension). We examine whether Mult _a (A, ∥ · ∥) is dense inside Mult _m (A, ∥ · ∥) with respect to the topology of simple convergence. This a first step to the conjecture of density of Mult _a (A, ∥ · ∥) in the whole set Mult(A, ∥ · ∥): this is the corresponding problem to the well-known complex corona problem. We notice that if ϕ ∈ Mult _m (A, ∥ · ∥) is defined by an ultrafilter on D, then ϕ lies in the closure of Mult _a (A, ∥ · ∥). Particularly, we show that this is case when a maximal ideal is the kernel of a unique ϕ ∈ Multm(A, ∥ · ∥). Particularly, when K is strongly valued all maximal ideals enjoy this property. And we can prove this is also true when K is spherically complete, thanks to the ultrametric holomorphic functional calculus. More generally, we show that if ψ ∈ Mult(A, ∥ · ∥) does not define the Gauss norm on polynomials (∥ · ∥), then it is defined by a circular filter, like on rational functions and analytic elements. As a consequence, if ψ ∈ Multm(A, ∥ · ∥) \ Multa(A, ∥ · ∥) or if φ does not lie in the closure of Mult _a (A, ∥ · ∥), then its restriction to polynomials is the Gauss norm. The first situation does happen. The second is unlikely. The text was submitted by the authors in English.     

Best Constants in the Miranda-Agmon Inequalities for Solutions of Elliptic Systems and the Classical Maximum Modulus Principle for Fluid and Elastic Half-spaces

The Dirichlet problem for elliptic systems of the second order with constant real and complex coefficients in the half-space  ^k ₊ = {x = (x ₁,…,x_k ): x_k > 0} is considered. It is assumed that the boundary values of a solution u = (u ₁,…,u _m) have the form ψ ₁ ξ ₁ + · · · + ψ _n ξ _n, 1 ≤ n ≤ m, where ξ ₁,· · ·,ξ _n is an orthogonal system of m-component normed vectors and ψ ₁,· · ·,ψ _n are continuous and bounded functions on ? ^k ₊. We study the mappings [C(? ^k ₊)] ⁿ ? (ψ ₁,…,ψ _n) → u(x) ?  ^m and [C(? ^k ₊)] ⁿ ? (ψ ₁,…,ψ _n) → u(x) ?  ^m generated by real and complex vector valued double layer potentials. We obtain representations for the sharp constants in inequalities between |u(x)| or |(z, u(x))| and ∥u| _xk =₀∥, where z is a fixed unit m-component vector, | · | is the length of a vector in a finite-dimensional unitary space or in Euclidean space, and (·,·) is the inner product in the same space. Explicit representations of these sharp constants for the Stokes and Lamé systems are given. We show, in particular, that if the velocity vector (the elastic displacement vector) is parallel to a constant vector at the boundary of a half-space and if the modulus of the boundary data does not exceed 1, then the velocity vector (the elastic displacement vector) is majorised by 1 at an arbitrary point of the half-space. An analogous classical maximum modulus principle is obtained for two components of the stress tensor of the planar deformed state as well as for the gradient of a biharmonic function in a half-plane.     

Asymptotic packing and the random greedy algorithm

Let H be an r-uniform hypergraph satisfying deg(x) = D(1 + o(1)) for each vertex xϵ V(H) and deg(x, y) = o(D) for each pair of vertices x, y ϵ V(H), where D → infinity. Recently, J. Spencer [5] showed, using a branching process approach, that almost surely the random greedy algorithm finds a packing of size at least n/r(1 − o(1)) for this class of hypergraphs. In this paper, we show an alternative proof of this via “nibbles.” Further, let T_α be the number of edges that the random greedy algorithm has to consider before yielding a packing of size [n/r · (1 − α)]. We show that almost surely T_α ∼ (1/α)^r−1 · n/r(r − 1) as α → 0⁺ holds. © 1996 John Wiley & Sons, Inc.     

Into isomorphisms in tensor products of Banach spaces

We establish quantitative extensions of two Grothendieck's results on into isomorphisms in projective tensor products. Among others, we prove the following. Let Y be a closed subspace of a Banach space Z and let j : Y → Z denote the identity embedding. If Y is complemented in its bidual Y??, then the injection modulus of the natural inclusion Id ? j : Y??Y → Y??Z satisfies 1/λ _loc (Y,Z) ≤ i(Id ? j) ≤ λ(Y,Y??)/λ(Y,Z), where λ(·,·) and λ_loc(·,·) are, respectively, the projection and the local projection constants.     

ON THE ITERATED ω-RULE

Let Γ_n(φ) be a formula of L_PA (PA = Peano Arithmetic) meaning “there is a proof of φ from PA-axioms, in which ω-rule is iterated no more than n times”. We examine relations over pairs of natural numbers of the kind. (n, k) ≦_H (n', k') iff PA + RFN_n' (H_k') ? RFN_n (H_k). Where H denotes one of the hierarchies ∑ or Π and RFN_n(C) is the scheme of the reflection principle for Γ_n restricted to formulas from the class C(Γ_n(φ) implies “φ is true”, for every φ ∈ C). Our main result is that. (n, k) ≦H (n', k') if n ≦ n' and k ≦ max (k', 2n' + 1).