WEIGHTED Lp-APPROXIMATION OF DERIVATIVES BY THE METHOD OF BETA OPERATORS

The author consides Beta operators β_nf on suitable Sobolev type subspace of L_p[0, ∞) and characterizes the global rate of approximation of derivatives f^(τ) through corresponding derivatives (β_nf)^(τ) in an appropriate weighted L_p-metric by the rate of Ditzian and Totik's τ-th order weighted modulus of Smoothness.     

n-Widths of Sobolev spaces inL p

LetW _p ^(r) ={f:f∈C ^r?1[0, 1],f ^(r?1) abs.cont., ∥f ^(r)∥ _p <∞}, and setB _p ^(r) ={f:f∈W _p ^(r) ,∥f ^(r)∥ _p ≤1}. We find the exact Kolmogorov, Gel'fand, linear, and Bernsteinn-widths ofB _p ^(r) inL ^p for allp∈(1, ∞). For the Kolmogorovn-width we show that forn≥r there exists an optimal subspace of splines of degreer?1 withn?r fixed simple knots depending onp.     

Jackson's theorem for compact connected Lie groups

We prove that for f ε E = C(G) or L^p(G), 1 p < ∞, where G is any compact connected Lie group, and for n 1, there is a trigonometric polynomial t_n on G of degree n so that f − t_nE C_rω_r(n⁻¹,f). Here ω_r(t, f) denotes the rth modulus of continuity of f. Using this and sharp estimates of the Lebesgue constants recently obtained by Giulini and Travaglini, we obtain “best possible” criteria for the norm convergence of the Fourier series of f.     

On the existence of two non-neighboring subgraphs in a graph

Does there exist a functionf(r, n) such that each graphG with _Z (G)≧f(r, n) contains either a complete subgraph of orderr or else two non-neighboringn-chromatic subgraphs? It is known thatf(r, 2) exists and we establish the existence off(r, 3). We also give some interesting results about graphs which do not contain two independent edges.     

On a nonconvolution Volterra resolvent

Under fairly weak assumptions, the solutions of the system of Volterra equations x(t) = ∝₀^ta(t, s) x(s) ds + f(t), t > 0, can be written in the form x(t) = f(t) + ∝₀^tr(t, s) f(s) ds, t > 0, where r is the resolvent of a, i.e., the solution of the equation r(t, s) = a(t, s) + ∝₀^ta(t, v) r(v, s)dv, 0 < s < t. Conditions on a are given which imply that the resolvent operator f ∝₀^tr(t, s) f(s) ds maps a weighted L¹ space continuously into another weighted L¹ space, and a weighted L^∞ space into another weighted L^∞ space. Our main theorem is used to study the asymptotic behavior of two differential delay equations.     

NP-completeness for minimizing maximum edge length in grid embeddings

Given an embedding f: G →$\text{Z}$² of a graph G in the two-dimensional lattice, let |f| be the maximum L₁ distance between points f(x) and f(y) where xy is an edge of G. Let B₂(G) be the minimum |f| over all embeddings f. It is shown that the determination of B₂(G) for arbitrary G is NP-complete. Essentially the same proof can be used in showing the NP-completeness of minimizing |f| over all embeddings f: G → $\text{Z}$ⁿ of G into the n-dimensional integer lattice for any fixed n ≥ 2.     

Linear transformations of monotone functions on the discrete cube

For a function f:{0,1}ⁿ→R and an invertible linear transformation L∈GL_n(2), we consider the function Lf:{0,1}ⁿ→R defined by Lf(x)=f(Lx). We raise two conjectures: First, we conjecture that if f is Boolean and monotone then I(Lf)≥I(f), where I(f) is the total influence of f. Second, we conjecture that if both f and L(f) are monotone, then f=L(f) (up to a permutation of the coordinates). We prove the second conjecture in the case where L is upper triangular.     

Convolution on L p -spaces of a locally compact group

We have recently shown that, for 2 < p < ∞, a locally compact group G is compact if and only if the convolution multiplication f * g exists for all f, g ∈ L ^p (G). Here, we study the existence of f * g for all f, g ∈ L ^p (G) in the case where 0 < p ≤ 2. Also, for 0 < p < ∞, we offer some necessary and sufficient conditions for L ^p (G) * L ^p (G) to be contained in certain function spaces on G.     

Centralizers of generalized derivations on multilinear polynomials in prime rings

Let R be a prime ring of characteristic different from 2, with Utumi quotient ring U and extended centroid C, δ a nonzero derivation of R, G a nonzero generalized derivation of R, and f(x ₁, …, x _n ) a noncentral multilinear polynomial over C. If δ(G(f(r ₁, …, r _n ))f(r ₁, …, r _n )) = 0 for all r ₁, …, r _n ∈ R, then f(x ₁, …, x _n )² is central-valued on R. Moreover there exists a ∈ U such that G(x) = ax for all x ∈ R and δ is an inner derivation of R such that δ(a) = 0.     

Eigenvectors and cyclic vectors of bilateral weighted shifts. II: Simply invariant subspaces

Let T be an injective bilateral weighted shift onl ² thought as "multiplication by λ" on a space of formal Laurent series L²(β). (a) If L²(β) is contained in a space of quasi-analytic class of functions, then the point spectrum σ_p(T^?) of T^? contains a circle and the cyclic invariant subspaceM _f of T generated by f is simply invariant (i.e., ∩{(T^k M _f)^?: k ≥ 0}= {0}) for each f in L²(β); (b) If L²(β) contains a non-quasi-analytic class of functions (defined on a circle г) of a certain type related with the weight sequence of T, then there exists f in L²(ß) such thatM _f is a non-trivial doubly invariant subspace (i.e., (TM _f)^? =M _f); furthermore, if г ? σ_p(T^*), then σ_p (T^*) = г and f can be chosen so that σ_p([T∣M _f]^*) = г?{α}, for some α ε г. Several examples show that the gap between operators satisfying (a) and operators satisfying (b) is rather small.     

Abelian groups admitting a Fréchet-Urysohn pseudocompact topological group topology

We show that every Abelian group G with r₀(G)=|G|=|G|^ω admits a pseudocompact Hausdorff topological group topology T such that the space (G,T) is Fréchet-Urysohn. We also show that a bounded torsion Abelian group G of exponent n admits a pseudocompact Hausdorff topological group topology making G a Fréchet-Urysohn space if for every prime divisor p of n and every integer k≥0, the Ulm-Kaplansky invariant f_p,k of G satisfies (f_p,k)^ω=f_p,k provided that f_p,k is infinite and f_p,k>f_p,i for each i>k.Our approach is based on an appropriate dense embedding of a group G into a Σ-product of circle groups or finite cyclic groups.     

Labeling bipartite permutation graphs with a condition at distance two

An L(p,q)-labeling of a graph G is an assignment f from vertices of G to the set of non-negative integers {0,1,…,λ} such that |f(u)−f(v)|≥p if u and v are adjacent, and |f(u)−f(v)|≥q if u and v are at distance 2 apart. The minimum value of λ for which G has L(p,q)-labeling is denoted by λ_p,q(G). The L(p,q)-labeling problem is related to the channel assignment problem for wireless networks.In this paper, we present a polynomial time algorithm for computing L(p,q)-labeling of a bipartite permutation graph G such that the largest label is at most (2p−1)+q(bc(G)−2), where bc(G) is the biclique number of G. Since λ_p,q(G)≥p+q(bc(G)−2) for any bipartite graph G, the upper bound is at most p−1 far from optimal.     

Decomposition of the completer-graph into completer-partiter-graphs

Forn ≥ r ≥ 1, letf _r (n) denote the minimum numberq, such that it is possible to partition all edges of the completer-graph onn vertices intoq completer-partiter-graphs. Graham and Pollak showed thatf ₂(n) =n ? 1. Here we observe thatf ₃(n) =n ? 2 and show that for every fixedr ≥ 2, there are positive constantsc ₁(r) andc ₂(r) such thatc ₁(r) ≤f _r (n)?n ^?[r/2] ≤n ₂(r) for alln ≥ r. This solves a problem of Aharoni and Linial. The proof uses some simple ideas of linear algebra.     

Optimal labelling of a product of two paths

If G is a graph with p vertices and at least one edge, we set φ (G) = m n max |f(u) ? f(v)|, where the maximum is taken over all edges uv and the minimum over all one-to-one mappings f : V(G) → {1, 2, …, p}: V(G) denotes the set of vertices of G.P_n will denote a path of length n whose vertices are integers 1, 2, …, n with i adjacent to j if and only if |i ? j| = 1. P_m × P_n will denote a graph whose vertices are elements of {1, 2, …, m} × {1, 2, …, n} and in which (i, j), (r, s) are adjacent whenever either i = r and |j ? s| = 1 or j = s and |i ? r| = 1.Theorem.If max(m, n) ? 2, thenφ(P_m × P_n) = min(m, n).     

The Characterization of the Derivatives for Linear Combinations of Post–Widder Operators inLp

The aim of the paper is to characterize the global rate of approximation of derivativesf^(l)through corresponding derivatives of linear combinations of Post–Widder operators in an appropriate weightedL_p-metric using a weighted Ditzian and Totik modulus of smoothness, and also to characterize derivatives of these operators in Besov spaces of Ditzian–Totik type.     

N-widths of Ω r ′ in L p

Let Ω _ϕ ^r ={f:f ^(r-1) abs. cont. on [0,1], ‖q_r(D)f‖_p≤1, f^(2K+σ) (0)=f^(2K+σ)=0, (k)=0,...,l-1}. where , and I is an identical operator. Denote Kolmogorov, linear, Geelfand and Bernstein n-widths of Ω _ϕ ^r in L^p byd _n (Ω _ϕ ^r ;L ^p ),δ _n (Ω _ϕ ^r ;L ^p ),d ⁿ (Ω _p ^r ;L ^p ) andb _n (Ω _p ^r ;L ^p ), respectively. In this paper, we find a method to get an exact estimation of these n-widths. Related optimal subspaces and an optimal linear operator are given. For another subset , similar results are also derrived.     

Labeling graphs with two distance constraints

Given a graph G and integers p,q,d₁ and d₂, with p>q, d₂>d₁?1, an L(d₁,d₂;p,q)-labeling of G is a function f:V(G)→{0,1,2,…,n} such that |f(u)−f(v)|?p if d_G(u,v)?d₁ and |f(u)−f(v)|?q if d_G(u,v)?d₂. A k-L(d₁,d₂;p,q)-labeling is an L(d₁,d₂;p,q)-labeling f such that max_v∈V(G)f(v)?k. The L(d₁,d₂;p,q)-labeling number ofG, denoted by , is the smallest number k such that G has a k-L(d₁,d₂;p,q)-labeling. In this paper, we give upper bounds and lower bounds of the L(d₁,d₂;p,q)-labeling number for general graphs and some special graphs. We also discuss the L(d₁,d₂;p,q)-labeling number of G, when G is a path, a power of a path, or Cartesian product of two paths.     

Sequences of contractions on L1-spaces

Let T_n, n = 1,2,… be a sequence of linear contractions on the space where is a finite measure space. Let M be the subspace of L¹ for which T_ng → g weakly in L¹ for g?M. If T_n1 → 1 strongly, then T_nf → f strongly for all f in the closed vector sublattice in L¹ generated by M.This result can be applied to the determination of Korovkin sets and shadows in L¹. Given a set G ? L¹, its shadow S(G) is the set of all f?L¹ with the property that T_nf → f strongly for any sequence of contractions T_n, n = 1, 2,… which converges strongly to the identity on G; and G is said to be a Korovkin set if S(G) = L¹. For instance, if 1 ?G, then, where M is the linear hull of G and $\text{B}$_M is the sub-σ-algebra of $\text{B}$ generated by {x?X: g(x) > 0} for g?M. If the measure algebra is separable, has Korovkin sets consisting of two elements.     

On weighted inequalities for martingale transform operators

For 1 < p < ∞, the almost surely finiteness of is a necessary and sufficient condition in order to have almost surely convergence of the sequences {E(f|?_n)} with f ∈ L^p(v dP). This condition is also equivalent to have weighted inequalities from L^p(v dP) into L^p(u dP) for some weight u for Doob's maximal function, square function and generalized Burkholder martingale transforms. Similarly, E(u|?₁) < ∞ turns out to be necessary and sufficient for the above weighted inequalities to hold for some v.     

L p -spaces on locally compact groups

In this paper, some relations between L ^p -spaces on locally compact groups are found. Applying these results proves that for a locally compact group G, the convolution Banach algebras L ^p (G) ∩ L ¹(G) (1 < p ≤ ∞), and A _p (G) ∩ L ¹(G) (1 < p < ∞) are amenable if and only if G is discrete and amenable.