Characterizations of derivations of Banach space nest algebras: All-derivable points

Let N be a nest on a complex Banach space X with N∈N complemented in X whenever N_-=N, and let AlgN be the associated nest algebra. We say that an operator Z∈AlgN is an all-derivable point of AlgN if every linear map δ from AlgN into itself derivable at Z (i.e. δ(A)B+Aδ(B)=δ(Z) for any A,B∈A with AB=Z) is a derivation. In this paper, it is shown that if Z∈AlgN is an injective operator or an operator with dense range, or an idempotent operator with ran(Z)∈N, then Z is an all-derivable point of AlgN. Particularly, if N is a nest on a complex Hilbert space, then every idempotent operator with range in N, every injective operator as well as every operator with dense range in AlgN is an all-derivable point of the nest algebra AlgN.     

On the enumeration of chains in regular chain-groups

Let N be a regular chain-group on E (see W. T. Tutte, Canad. J. Math.8 (1956), 13–28); for instance, N may be the group of integer flows or tensions of a directed graph with edge-set E). It is known that the number of proper Z_λ-chains of N (λ ∈ Z, λ ≥ 2) is given by a polynomial in λ, P(N, λ) (when N is the chain-group of integer tensions of the connected graph G, λP(N, λ) is the usual chromatic polynomial of G). We prove the formula: P(N, λ) = Σ_{[E′]∈O(N)⁺/～}Q(R_[E′](N), λ), where O(N)⁺ is the set of orientations of N with a proper positive chain, ～ is a simple equivalence relation on O(N)⁺ (sequence of reversals of positive primitive chains), and Q(R_[E′](N), λ) is the number of chains with values in [1, λ ? 1] in any reorientation of N associated to an element of [E′]. Moreover, each term Q(R_[E′](N), λ) is a polynomial in λ. As applications we obtain: P(N, 0) = (?1)^r(N)∥O(N)⁺/～∥; P(N, ?1) = (?1)^r(N)∥O(N)⁺∥ (a result first proved by Brylawski and Lucas); P(N, λ + 1) ≥ P(N, λ) for λ ≥ 2, λ ∈ Z. Our result can also be considered as a refinement of the following known fact: A regular chain-group N has a proper Z_λ-chain iff it has a proper chain in [?λ + 1, λ ? 1].     

N-Capacity, N-harmonic radius and N-harmonic transplantation

For the N-Laplacian ΔN on a regular domain the N-Green's function exists. This allows us to define the N-Robin's function and the N-harmonic radius. We show their basic properties and extend the method of the harmonic transplantation to that of the N-harmonic transplantation. The method is used to estimate the first eigenvalue of the N-Laplacian ΔN. We also give another proof of the isoperimetric inequality for the N-capacity and give the isoperimetric inequality for the N-harmonic radius.     

The number of large prime divisors of consecutive integers

Let ?(N) > 0 be a function of positive integers N and such that ?(N) → 0 and N^?(N) → ∞ as N → + ∞. Let Nν_N(n:…) be the number of positive integers n ≤ N for which the property stated in the dotted space holds. Finally, let g(n; N, ?, z) be the number of those prime divisors p of n which satisfy N^Z?(N) ? p ? N^?(N), 0 < z < 1 In the present note we show that for each k = 0, ±1, ±2,…, as N → ∞, limv_N(n : g(n; N, ?, z) ? g(n + 1; N, ?z) = k) exists and we determine its actual value. The case k = 0 induced the present investigation. Our solution for this value shows that the natural density of those integers n for which n and n + 1 have the same number of prime divisors in the range (1) exists and it is positive.     

Homeomorphism with zero Jacobian: Sharp integrability of the derivative

Let N?2. We construct a homeomorphism f∈W1,1(N[0,1],RN) such that Jf=0 almost everywhere and sup0<ε?N−1εN[0,1]_∫|Df|^N−ε<∞. In particular, f∈W1,p(N[0,1],N[0,1]) for all p∈[1,N).     

Lebesgue-Type Inequalities for Quasi-greedy Bases

We show that, for quasi-greedy bases in real or complex Banach spaces, an optimal bound for the ratio between greedy N-term approximation ∥x?G _N x∥ and the best N-term approximation σ _N (x) is controlled by max{μ(N),k _N }, where μ(N) and k _N are well-known constants that quantify the democracy and conditionality of the basis. In particular, for democratic bases this bound is O(logN). We show with various examples that these bounds are actually attained.     

General study of the distribution of N-tuples of letters or words based on the distributions of the single letters or words

This paper establishes the general relation between the distribution of N-tuples of letters (e.g., N-truncations, N-grams) or words (e.g., N-word phrases) and the distributions of the single letters or words. Here the very general case is treated: the case where there is dependence on the place i in the N-tuple (i = 1,…, N) in the sense that, for each i = 1,…, N, a different distribution of the letters or words is supposed.Concrete calculations are performed in the important case of Zipfian distributions (i.e., power laws) for the single letters or words. In this case, we prove that the distribution of the N-tuples (N-fixed) is the sum of power laws.     

The pyramidal configurations of N+1 bodies cannot rotate

For the (N+1)-body problem, we assume that N bodies are at the vertices of a unit regular polygon and the (N+1)st body is along the vertical line normal to the plane formed by the former N bodies. If N bodies rotate at the unit circle and the (N+1)st body oscillates along the vertical line of the plane formed by the former N bodies and passing through the geometrical center, then we prove that the (N+1)st body must locate at the geometrical center of unit regular polygon.     

An optimal lower bound for the Frobenius problem

Given N?2 positive integers a₁,a₂,…,aN with GCD(a₁,…,aN)=1, let fN denote the largest natural number which is not a positive integer combination of a₁,…,aN. This paper gives an optimal lower bound for fN in terms of the absolute inhomogeneous minimum of the standard (N−1)-simplex.     

Extrinsic homogeneity of parallel submanifolds

We consider parallel submanifolds M of a Riemannian symmetric space N and study the question whether M is extrinsically homogeneous in N, i.e. whether there exists a subgroup of the isometry group of N which acts transitively on M. Provided that N is of compact or non-compact type, we establish the extrinsic homogeneity of every complete irreducible parallel submanifold of N whose dimension is at least three and which is not contained in any flat of N.     

Thinning of point processes,revisited

ＴＨＩＮＮＩＮＧＯＦＰＯＩＮＴＰＲＯＣＥＳＳＥＳ,ＲＥＶＩＳＩＴＥＤＨＥＳＨＥＮＧＷＵ（何声武）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃａｌＳｔａｔｉｓｔｉｃｓ,ＥａｓｔＣｈｉｎａＮｏｒｍａｌＵｎｉｖｅｒｓｉｔｙＳｈａｎｇｈａｉ２０００６２,Ｃ...     

A fourth order finite difference method for the Dirichlet biharmonic problem

Using the coupled approach, we formulate a fourth order finite difference scheme for the solution of the Dirichlet biharmonic problem on the unit square. On an N × N uniform partition of the square the scheme is solved at a cost O(N ² log₂ N)+m8N ² using fast Fourier transforms and m iterations of the preconditioned conjugate gradient method. Numerical tests confirm the fourth order accuracy of the scheme at the partition nodes with m proportional to log₂ N.     

Harmonic functions on [IN] and central hypergroups

In this paper we introduce the notions of [I N] and [S I N]-hypergroups and prove a Choquet-Deny type theorem for [I N] and central hypergroups. More precisely, we prove a Liouville theorem for bounded harmonic functions on a class of [I N]-hypergroups. Further, we show that positive harmonic functions on [I N]-hypergroups are integrals of exponential functions. Similar results are proved for [S I N] and central hypergroups.     

Minimal polynomials for compact sets of the complex plane

LetW _N(z)=a_Nz^N+... be a complex polynomial and letT _n be the classical Chebyshev polynomial. In this article it is shown that the polynomials (2a_N)^?n+1T_n(W_N), n ∈N, are minimal polynomials on all equipotential lines for {z∈C:|W _N(z)|≤1 Λ ImW _N(z)=0}     

Rectangular Matrix Multiplication Revisited

We give a constant α > 0.294 and, for any ε > 0, an algorithm for multiplying anN×Nmatrix by anN×N^αmatrix with complexityO(N^{2 + ε}).     

On coprime G-conjugacy class sizes in a normal subgroup

Let N be a normal subgroup of a group G. Suppose that the positive integers m 〉 n are two longest non-central G-conjugacy class sizes of N with （m, n） = 1. The purpose of this paper is to determine the structure of N and give the N-conjugacy class sizes of the elements in N under that assumption that m is square free.     

On products of matroids

We show, by means of counterexamples, that products with rank rk(M)rk(N) of a matroid M by a matroid N do not exist in general, and that there is no free-est product of M by N. We prove that a canonical product of M by N (having rank rk(M)+rk(N)?1) is a free-est product in a certain (weaker) sense.     

On the complexity of testing membership in the core of min-cost spanning tree games

LetN = {1,...,n} be a finite set of players andK _N the complete graph on the node setN∪{0}. Assume that the edges ofK _N have nonnegative weights and associate with each coalitionS∪N of players as costc(S) the weight of a minimal spanning tree on the node setS∪{0}. Using transformation from EXACT COVER BY 3-SETS, we exhibit the following problem to beNP-complete. Given the vectorxε?^itN withx(N) =c(N). decide whether there exists a coalitionS such thatx(S) >c(S).     

On the density of sequences of integers the sum of no two of which is a square II. General sequences

The aim of this paper is to study the maximal density attainable by a sequence S of positive integers having the property that the sum of any two distinct elements of S is never a square. It is shown that there is a constant N₀ such that for all N ? N₀ any set S ? [1, N] having this property must have |S| < 0.475N. The proof uses the Hardy-Littlewood circle method.