On the Rate of Convergence of Two Bernstein–Bézier Type Operators for Bounded Variation Functions

In this paper we study the rate of convergence of two Bernstein–Bézier type operatorsB^(α)_nandL^(α)_nfor bounded variation functions. By means of construction of suitable functions and the method of Bojanic and Vuillemier (J. Approx. Theory31(1981), 67–79), using some results of probability theory, we obtain asymptotically optimal estimations ofB^(α)_nandL^(α)_nfor bounded variation functions at points of continuity and points of discontinuity.     

Analysis of Carry Propagation in Addition: An Elementary Approach

Our goal in this paper is to analyze carry propagation in addition using only elementary methods (that is, those not involving residues, contour integration, or methods of complex analysis). Our results concern the length of the longest carry chain when two independent uniformly distributed n-bit numbers are added. First, we show using just first- and second-moment arguments that the expected length C_n of the longest carry chain satisfies C_n = log₂n + O(1). Second, we use a sieve (inclusion–exclusion) argument to give an exact formula for C_n. Third, we give an elementary derivation of an asymptotic formula due to Knuth, C_n = log₂n + Φ(log₂ n) + O((logn)⁴/n), where Φ(ν) is a bounded periodic function of ν, with period 1, for which we give both a simple integral expression and a Fourier series. Fourth, we give an analogous asymptotic formula for the variance V_n of the length of the longest carry chain: V_n = Ψ(log₂ n) + O((logn)⁵/n), where Ψ(ν) is another bounded periodic function of ν, with period 1. Our approach can be adapted to addition with the “end-around” carry that occurs in the sign-magnitude and 1s-complement representations. Finally, our approach can be adapted to give elementary derivations of some asymptotic formulas arising in connection with radix-exchange sorting and collision-resolution algorithms, which have previously been derived using contour integration and residues.     

On the Rate of Convergence of Two Bernstein–Bézier Type Operators for Bounded Variation Functions, II

The rates of convergence of two Bernstein–Bézier type operators B^(α)_n and L^(α)_n for functions of bounded variation have been studied for the case α1 by the author and A. Piriou (1998, J. Approx. Theory95, 369–387). In this paper the other case 0<α<1 is treated and asymptotically optimal estimations of B^(α)_n and L^(α)_n for functions of bounded variation are obtained. Besides, some interesting behaviors of the operators B^(α)_n and L^(α)_n (α>0) for monotone functions and functions of bounded variation are also given.     

Classes of orderings of measures and related correlation inequalities II. Multivariate reverse rule distributions

A function f(x) defined on = ₁ × ₂ × … × _n where each _i is totally ordered satisfying f(x y) f(x y) ≥ f(x) f(y), where the lattice operations and refer to the usual ordering on , is said to be multivariate totally positive of order 2 (MTP₂). A random vector Z = (Z₁, Z₂,…, Z_n) of n-real components is MTP₂ if its density is MTP₂. Classes of examples include independent random variables, absolute value multinormal whose covariance matrix Σ satisfies −DΣ⁻¹D with nonnegative off-diagonal elements for some diagonal matrix D, characteristic roots of random Wishart matrices, multivariate logistic, gamma and F distributions, and others. Composition and marginal operations preserve the MTP₂ properties. The MTP₂ property facilitate the characterization of bounds for confidence sets, the calculation of coverage probabilities, securing estimates of multivariate ranking, in establishing a hierarchy of correlation inequalities, and in studying monotone Markov processes. Extensions on the theory of MTP₂ kernels are presented and amplified by a wide variety of applications.     

Mappings of finite distortion: the degree of regularity

This paper investigates the self-improving integrability properties of the so-called mappings of finite distortion. Let K(x)1 be a measurable function defined on a domain ΩRⁿ, n2, and such that exp(βK(x))L_loc¹(Ω), β>0. We show that there exist two universal constants c₁(n),c₂(n) with the following property: Let f be a mapping in W_loc^1,1(Ω,Rⁿ) with |Df(x)|ⁿK(x)J(x,f) for a.e. xΩ and such that the Jacobian determinant J(x,f) is locally in L¹ log^−c₁(n)βL. Then automatically J(x,f) is locally in L¹ log^c₂(n)βL(Ω). This result constitutes the appropriate analog for the self-improving regularity of quasiregular mappings and clarifies many other interesting properties of mappings of finite distortion. Namely, we obtain novel results on the size of removable singularities for bounded mappings of finite distortion, and on the area distortion under this class of mappings.     

A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions

Consider the problem of identifying min T(f) and max F(f) of a positive (i.e., monotone) Boolean functionf, by using membership queries only, where min T(f) (max F(f)) denotes the set of minimal true vectors (maximum false vectors) off. Moreover, as the existence of a polynomial total time algorithm (i.e., polynomial time in the length of input and output) for this problem is still open, we consider here a restricted problem: given an unknown positive functionfofnvariables, decide whetherfis 2-monotonic or not, and iffis 2-monotonic, output both min T(f) and max F(f). For this problem, we propose a simple algorithm, which is based on the concept of maximum latency, and we show that it usesO(n²m) time andO(n²m) queries, wherem = |min T(f)| + |max F(f)|. This answers affirmatively the conjecture raised in Boroset al.[Lecture Notes in Comput. Sci.557(1991), 104–115], Boroset al.[SIAM J. Comput.26(1997), 93–109], and is an improvement over the two algorithms discussed therein: one usesO(n³m) time andO(n³m) queries, and the other usesO(nm² + n²m) time andO(nm) queries.     

Some Properties of Nonstar Steps in Addition Chains and New Cases Where the Scholz Conjecture Is True

Let ℓ(n) be the smallest possible length of addition chains for a positive integer n. Then Scholz conjectured that ℓ(2ⁿ − 1) ≤ n + ℓ(n) − 1, which still remains open. It is known that the Scholz conjecture is true when ν(n) ≤ 4, where ν(n) is the number of 1's in the binary representation of n. In this paper, we give some properties of nonstar steps in addition chains and prove that the Scholz conjecture is true for infinitely many new integers including the case where ν(n) = 5.     

Hyperoctahedral Operations on Hochschild Homology

We construct Families {ρ^{l, k}_n} of orthogonal idempotents of the hyperoctahedral group algebras [B_n], which commute with the Hochschild boundary operators b_n=∑ⁿ_i=0 (−1)ⁱd_i. We show that those idempotents are projections onto some hyperoactahedral symmetric powers of the free Lie algebra Lie^{(l, k)}_n( ). The commutations above then decompose the Hochshild homology H_n(C) obtained by any functor C:Δ^op → K-module that factor through Fin′_B, the hyperoctahedral category. Moreover, we show that this decomposition is the finest possible for any such functor. In particular, the Hochschild homology of a commutative algebra equipped with an involutive automorphism splits into components indexed by (l, k) and the corresponding Harrison homology splits into two components indexed by (0, 1) and (1, 0). Generalizing the Harrison complex, we show that H^(l,k)_n(C)H_n(Sh^(l,k)_./Sh^{(l−1, k+1)}_., where Sh^(r,s)_.are some shuffle complexes associated to C. We also give the characters of the representations related to Lie^{(l, k)}_n( ) as a direct sum of induced characters.     

On the Approximation of Positive Functions by Power Series, II

We consider positive functionsh=h(x) defined forxR⁺₀. Conditions for the existence of a power seriesN(x)=∑ c_nxⁿ,c_n0, with the propertyd₁h(x)/N(x)d₂, x0,for some constantsd₁, d₂R⁺, are investigated in [J. Clunie and T. Kövari,Canad. J. Math.20(1968), 7–20; P. Erd s and T. Kövari,Acta Math. Acad. Sci. Hung.7(1956), 305–316; U. Schmid,Complex Variables18(1992), 187–192; U. Schmid, J.Approx. Theory83(1995), 342–346]. In this paper, methods are discussed which allow for a given functionhthe construction of the coefficientsc_n,n ₀, for the above defined power seriesNand to find suitable constantsd₁andd₂. We also study the power seriesH(x)=∑ xⁿ/u_n, where we setu_n=sup{xⁿ/h(x), x0}, forn ₀, and the relation betweenhandHconcerning the above stated inequalities.     

A Randomized Parallel Algorithm for Planar Graph Isomorphism

We present a parallel randomized algorithm running on aCRCW PRAM, to determine whether two planar graphs are isomorphic, and if so to find the isomorphism. We assume that we have a tree of separators for each planar graph (which can be computed by known algorithms inO(log² n) time withn^{1 + ε}processors, for any ε > 0). Ifnis the number of vertices, our algorithm takesO(log(n)) time with processors and with a probability of failure of 1/nat most. The algorithm needs 2 · log(m) − log(n) + O(log(n)) random bits. The number of random bits can be decreased toO(log(n)) by increasing the number of processors ton^{3/2 + ε}, for any ε > 0. Our parallel algorithm has significantly improved processor efficiency, compared to the previous logarithmic time parallel algorithm of Miller and Reif (Siam J. Comput.20(1991), 1128–1147), which requiresn⁴randomized processors orn⁵deterministic processors.     

Frobenius criteria of freeness and Gorensteinness

Let F ⁿ (−) be the Frobenius functor of Peskine and Szpiro. In this note, we show that the maximal Cohen–Macaulayness of F ⁿ (M) forces M to be free, provided M has a rank. We apply this result to obtain several Frobenius-related criteria for the Gorensteinness of a local ring R, one of which improves a previous characterization due to Hanes and Huneke. We also establish a special class of finite length modules over Cohen–Macaulay rings, which are rigid against Frobenius.     

Vertex Set Partitions Preserving Conservativeness

Let G be an undirected graph and ={X₁, …, X_n} be a partition of V(G). Denote by G/ the graph which has vertex set {X₁, …, X_n}, edge set E, and is obtained from G by identifying vertices in each class X_i of the partition . Given a conservative graph (G, w), we study vertex set partitions preserving conservativeness, i.e., those for which (G/ , w) is also a conservative graph. We characterize the conservative graphs (G/ , w), where is a terminal partition of V(G) (a partition preserving conservativeness which is not a refinement of any other partition of this kind). We prove that many conservative graphs admit terminal partitions with some additional properties. The results obtained are then used in new unified short proofs for a co-NP characterization of Seymour graphs by A. A. Ageev, A. V. Kostochka, and Z. Szigeti (1997, J. Graph Theory34, 357–364), a theorem of E. Korach and M. Penn (1992, Math. Programming55, 183–191), a theorem of E. Korach (1994, J. Combin. Theory Ser. B62, 1–10), and a theorem of A. V. Kostochka (1994, in “Discrete Analysis and Operations Research. Mathematics and its Applications (A. D. Korshunov, Ed.), Vol. 355, pp. 109–123, Kluwer Academic, Dordrecht).     

Nonparametric Empirical Bayes Estimation of the Matrix Parameter of the Wishart Distribution

We consider independent pairs (X₁, Σ₁), (X₂, Σ₂), …, (X_n, Σ_n), where eachΣ_iis distributed according to some unknown density functiong(Σ) and, givenΣ_i=Σ,X_ihas conditional density functionq(xΣ) of the Wishart type. In each pair the first component is observable but the second is not. After the (n+1)th observationX_n+1is obtained, the objective is to estimateΣ_n+1corresponding toX_n+1. This estimator is called the empirical Bayes (EB) estimator ofΣ. An EB estimator ofΣis constructed without any parametric assumptions ong(Σ). Its posterior mean square risk is examined, and the estimator is demonstrated to be pointwise asymptotically optimal.     

Algebraic K-theory of non-linear projective spaces

In the spirit of “The Fundamental Theorem for the algebraic K-theory of spaces: I” (J. Pure Appl. Algebra 160 (2001) 21–52) we introduce a category of sheaves of topological spaces on n-dimensional projective space and present a calculation of its K-theory, a “non-linear” analogue of Quillen's isomorphism K_i(P_Rⁿ)₀ⁿK_i(R).     

Existence of three solutions for a class of elliptic eigenvalue problems

In this paper, we consider a problem of the type −Δu = λ(f(u) + μg(u)) in Ω, u¦∂Ω = 0, where Ω Rⁿ is an open-bounded set, f, g are continuous real functions on R, and λ, μ ε R. As an application of a new approach to nonlinear eigenvalues problems, we prove that, under suitable hypotheses, if ¦μ¦ is small enough, then there is some λ > 0 such that the above problem has at least three distinct weak solutions in W₀^1,2(Ω).     

Mackey and Frobenius Structures on Odd Dimensional Surgery Obstruction Groups

C. T. C. Wall formulated surgery-obstruction groups L _n (Z[G]) in terms of quadratic modules and automorphisms. C. B. Thomas showed that the Wall-group functors L _n (Z[–],w|_–) are modules over the Hermitian-representation-ring functor G₁(Z, –) if the orientation homomorphism w is trivial. A. Bak generalized the notion of quadratic module by introducing quadratic-form parameters, and obtained various K-groups related to quadratic modules and automorphisms. One of the authors established that some Bak groups W _n (Z[G], w) are equivariant-surgery-obstruction groups and showed in the case of even dimension n that the Bak-group functor W _n (Z)[–], _–; w|_–) is a w-Mackey functor as well as a module over the Grothendieck–Witt-ring functor GW₀(Z, –), where w is possibly nontrivial. In this paper, we prove the same facts in the case of odd dimension n.     

Centres of Convex Sets inLMetrics

It is shown that for each convex bodyARⁿthere exists a naturally defined family _AC(Sⁿ⁻¹) such that for everyg _A, and every convex functionf: R→Rthe mappingy∫_Sⁿ⁻¹ f(g(x)−y, x) dσ(x) has a minimizer which belongs toA. As an application, approximation of convex bodies by balls with respect toL^pmetrics is discussed.     

On Sperner families in which no k sets have an empty intersection, II

Let n_c,d(r, k) denote the maximal cardinality of Sperner families (i.e., XY for all X, Y ε ) on an r-element set satisfying c X d for all X ε and in which no k sets have an empty intersection. n_c,d(r, k) was determined by Frankl (J. Combin. Theory Ser. A 20 (1976), 1–11) if c r/k, and, if c = 0 and d = r, by Frankl and the author (J. Combin. Theory Ser. A 28 (1980), 54–63; Acta Cybernet. 4 (1978), 213–220 for all r and k with exception of 60 values of r if k = 3. In this paper we solve the problem of determination of n_c,d(r, 3) in nearly all unknown cases. In particular, we obtain n_0,r(r, 3) for 33 of the exceptional cases.     

Asymptotic distributions of regression and autoregression coefficients with martingale difference disturbances

In this paper a form of the Lindeberg condition appropriate for martingale differences is used to obtain asymptotic normality of statistics for regression and autoregression. The regression model is y_t = Bz_t + v_t. The unobserved error sequence {v_t} is a sequence of martingale differences with conditional covariance matrices {Σ_t} and satisfying sup_{t=1,…, n} {v′_tv_tI(v′_tv_t>a) |z_t, v_t−1, z_t−1, …} 0 as a → ∞. The sample covariance of the independent variables z₁, …, z_n, is assumed to have a probability limit M, constant and nonsingular; max_t=1,…,nz′_tz_t/n 0. If (1/n)Σ_t=1ⁿΣ_t Σ, constant, then √nvec( _n−B) N(0,M⁻¹Σ) and _n Σ. The autoregression model is x_t = Bx_{t − 1} + v_t with the maximum absolute value of the characteristic roots of B less than one, the above conditions on {v_t}, and (1/n)Σ_t=max(r,s)+1(Σ_tv_t−1−rv′_t−1−s) δ_rs(ΣΣ), where δ_rs is the Kronecker delta. Then √nvec( _n−B) N(0,Γ⁻¹Σ), where Γ = Σ_{s = 0}^∞B^sΣ(B′)^s.     

I.i.d. representations for the bivariate product limit estimators and the bootstrap versions

Let F(s, t) = P(X > s, Y > t) be the bivariate survival function which is subject to random censoring. Let be the bivariate product limit estimator (PL-estimator) by Campbell and Földes (1982, Proceedings International Colloquium on Non-parametric Statistical Inference, Budapest 1980, North-Holland, Amsterdam). In this paper, it was shown that

Full-size image

, where {ζ_i(s, t)} is i.i.d. mean zero process and R_n(s, t) is of the order O((n⁻¹log n)^3/4) a.s. uniformly on compact sets. Weak convergence of the process {n⁻¹ Σ_{i = 1}ⁿ ζ_i(s, t)} to a two-dimensional-time Gaussian process is shown. The covariance structure of the limiting Gaussian process is also given. Corresponding results are also derived for the bootstrap estimators. The result can be extended to the multivariate cases and are extensions of the univariate case of Lo and Singh (1986, Probab. Theory Relat. Fields, 71, 455–465). The estimator is also modified so that the modified estimator is closer to the true survival function than in supnorm.