Relative rearrangement and Lebesgue spaces with variable exponent

We apply the techniques of monotone and relative rearrangements to the nonrearrangement invariant spaces L^p()(Ω) with variable exponent. In particular, we show that the maps uL^p()(Ω)→k(t)u_*L^p_*()(0,measΩ) and uL^p()(Ω)→u_*L^p*()(0,measΩ) are locally -Hölderian (u_* (resp. p^*) is the decreasing (resp. increasing) rearrangement of u (resp. p)). The pointwise relations for the relative rearrangement are applied to derive the Sobolev embedding with eventually discontinuous exponents.     

On multipartite posets

A poset P=(X,) is m-partite if X has a partition X=X₁X_m such that (1) each X_i forms an antichain in P, and (2) xy implies xX_i and yX_j where i<j. In this article we derive a tight asymptotic upper bound on the order dimension of m-partite posets in terms of m and their bipartite sub-posets in a constructive and elementary way.     

Convergence of a Halpern-type iteration algorithm for a class of pseudo-contractive mappings

Let E be a real reflexive Banach space with uniformly Gâteaux differentiable norm. Let K be a nonempty bounded closed and convex subset of E. Let T:K→K be a strictly pseudo-contractive map and let L>0 denote its Lipschitz constant. Assume F(T){xK:Tx=x}≠0/ and let zF(T). Fix δ(0,1) and let δ^* be such that δ^*δL(0,1). Define , where δ_n(0,1) and limδ_n=0. Let {α_n} be a real sequence in (0,1) which satisfies the following conditions: . For arbitrary x₀,uK, define a sequence {x_n}K by x_n+1=α_nu+(1−α_n)S_nx_n. Then, {x_n} converges strongly to a fixed point of T.     

Inner Functions and Cyclic Composition Operators on H(Bn)

The present paper shows that the algebra generated by {C|  Aut(B_n)} is cyclic on H²(B_n), and any nonconstant function f  H²(B_n) is a cyclic vector of . In addition, the hypercyclic and cyclic composition operators will be discussed.     

LOCAL TIME ANALYSIS OF ADDITIVE LEVY PROCESSES WITH DIFFERENT L(E)VY EXPONENTS

Let X1 XN be independent, classical Levy processes on R^d with Levy exponents ψ1,…, ψN, respectively. The corresponding additive Levy process is defined as the following N-parameter random field on R^d, X（t） △= X1（t1） ＋ ... ＋ XN（tN）, At∈N. Under mild regularity conditions on the ψi＇s, we derive estimate for the local and uniform moduli of continuity of local times of X = {X（t）; t ∈R^N}.     

Best Approximation by Normal and Conormal Sets

The aim of the present paper is to develop a theory of best approximation by elements of so-called normal sets and their complements—conormal sets—in the non-negative orthant ^I₊ of a finite-dimensional coordinate space ^I endowed with the max-norm. A normal (respectively, conormal) set arises as the set of all solutions of a system of inequalities f_α(x)0 (αA), x ^I₊ (respectively, f_α(x)0 (αA), x ^I₊), where f_α is an increasing function and A is an arbitrary set of indices. We consider these sets as analogues (in a certain sense) of convex sets, and we use the so-called min-type functions as analogues of linear functions. We show that many results on best approximation by convex and reverse convex sets and corresponding separation theory (but not all of them) have analogues in the case under consideration. At the same time there are no convex analogues for many results related to best approximation by normal sets.     

Strong characterizing sequences for subgroups of compact groups

In [A. Biró, V.T. Sós, Strong characterizing sequences in simultaneous Diophantine approximation, J. Number Theory 99 (2003) 405–414] we proved that if Γ is a subgroup of the torus R/Z generated by finitely many independent irrationals, then there is an infinite subset AZ which characterizes Γ in the sense that for γR/Z we have ∑_aAaγ<∞ if and only if γΓ. Here we consider a general compact metrizable Abelian group G instead of R/Z, and we characterize its finitely generated free subgroups Γ by subsets AG^*, where G^* is the Pontriagin dual of G. For this case we prove stronger forms of the analogue of the theorem of the above mentioned work, and we find necessary and sufficient conditions for a kind of strengthening of this statement to be true.     

Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected

Let G be a graph. For u,vV(G) with dist_G(u,v)=2, denote J_G(u,v)={wN_G(u)∩N_G(v)|N_G(w)N_G(u)N_G(v){u,v}}. A graph G is called quasi claw-free if J_G(u,v)≠ for any u,vV(G) with dist_G(u,v)=2. In 1986, Thomassen conjectured that every 4-connected line graph is hamiltonian. In this paper we show that every 4-connected line graph of a quasi claw-free graph is hamiltonian connected.     

The Approximation Functional and Interpolation with Perturbed Continuity

The continuity conditions at the endpoints of interpolation theorems, Ta_BjM_j a_Aj for j=0, 1, can be written with the help of the approximation functional: E(t, Ta; B₁, B₀)_L^∞M₀ a_A0 and E(t, Ta; B₀, B₁)_L^∞M₁ a_A1. As a special case of the results we present here we show that in the hypotheses of the interpolation theorem the L^∞ norms can be replaced by BMO( ₊) norms. This leads to a strong version of the Stein-Weiss theorem on interpolation with change of measure. Another application of our results is that the condition fL⁰, i.e., f*L^∞, where f*(γ)=μ{|f|>γ} is the distribution function of f, can be replaced in interpolation with L(p, q) spaces by the weaker f*BMO( ₊).     

Optimal Recovery of the Derivative of Periodic Analytic Functions from Hardy Classes

LetS_β{z : |Im z|<β}. For 2π-periodic functions which are analytic inS_βwithp-integrable boundary values, we construct an optimal method of recovery off′(ξ), ξS_β, using information about the valuesf(x₁), mldr;, f(x_n), x_j[0, 2π).     

The eigenvalue problem for the Laplacian equations

This article studies the Dirichlet eigenvalue problem for the Laplacian equations △u = -λu, x ∈Ω, u = 0, x ∈ (δ)Ω, where Ω (∩) Rn is a smooth bounded convex domain. By using the method of appropriate barrier function combined with the maximum principle, authors obtain a sharp lower bound of the difference of the first two eigenvalues for the Dirichlet eigenvalue problem. This study improves the result of S.T.Yau et al.     

Strong and uniform mean stability of cosine and sine operator functions

It is first observed that a uniformly bounded cosine operator function C() and the associated sine function S() are totally non-stable. Then, using a zero-one law for the Abel limit of a closed linear operator, we prove some results concerning strong mean stability and uniform mean stability of C(). Among them are: (1) C() is strongly (C,1)-mean stable (or (C,2)-mean stable, or Abel-mean stable) if and only if 0ρ(A)σ_c(A); (2) C() is uniformly (C,2)-mean stable if and only if S() is uniformly (C,1)-mean stable, if and only if , if and only if , if and only if C() is uniformly Abel-mean stable, if and only if S() is uniformly Abel-mean stable, if and only if 0ρ(A).     

Self-improving behaviour of inner functions as multipliers

Let X and Y be two spaces of analytic functions in the disk, with XY. For an inner function θ, it is sometimes true that whenever fX and fθY, the latter product must actually be in X. We discuss this phenomenon for various pairs of (analytic) smoothness classes X and Y.     

Regularity results for stable-like operators

For α[1,2) we consider operators of the form

and for α(0,1) we consider the same operator but where the f term is omitted. We prove, under appropriate conditions on A(x,h), that any solution u to will be in C^α+β if fC^β.     

On some d-dimensional dual hyperovals in

Let d≥3. Let H be a d+1-dimensional vector space over GF(2) and {e₀,…,e_d} be a specified basis of H. We define Supp(t){e_t1,…,e_tl}, a subset of a specified base for a non-zero vector t=e_t1++e_tl of H, and Supp(0)0/. We also define J(t)Supp(t) if |Supp(t)| is odd, and J(t)Supp(t){0} if |Supp(t)| is even.For s,tH, let {a(s,t)} be elements of H(HH) which satisfy the following conditions: (1) a(s,s)=(0,0), (2) a(s,t)=a(t,s), (3) a(s,t)≠(0,0) if s≠t, (4) a(s,t)=a(s^′,t^′) if and only if {s,t}={s^′,t^′}, (5) {a(s,t)|tH} is a vector space over GF(2), (6) {a(s,t)|s,tH} generate H(HH). Then, it is known that S{X(s)|sH}, where X(s){a(s,t)|tH{s}}, is a dual hyperoval in PG(d(d+3)/2,2)=(H(HH)){(0,0)}.In this note, we assume that, for s,tH, there exists some x_s,t in GF(2) such that a(s,t) satisfies the following equation: Then, we prove that the dual hyperoval constructed by {a(s,t)} is isomorphic to either the Huybrechts’ dual hyperoval, or the Buratti and Del Fra’s dual hyperoval.     

Maximal Inequalities and Lebesgue's Differentiation Theorem for Best Approximant by Constant over Balls

For fL_p( ⁿ), with 1p<∞, >0 and x ⁿ we denote by T(f)(x) the set of every best constant approximant to f in the ball B(x, ). In this paper we extend the operators T_p to the space L_p−1( ⁿ)+L_∞( ⁿ), where L₀ is the set of every measurable functions finite almost everywhere. Moreover we consider the maximal operators associated to the operators T_p and we prove maximal inequalities for them. As a consequence of these inequalities we obtain a generalization of Lebesgue's Differentiation Theorem.     

Optimization of a convex program with a polynomial perturbation

We consider the problem of minimizing a convex function plus a polynomial p over a convex body K. We give an algorithm that outputs a solution x whose value is within range_K(p) of the optimum value, where range_K(p)=sup_xKp(x)−inf_xKp(x). When p depends only on a constant number of variables, the algorithm runs in time polynomial in 1/, the degree of p, the time to round K and the time to solve the convex program that results by setting p=0.     

Arithmetic progressions consisting of unlike powers

In this paper we present some new results about unlike powers in arithmetic progression. We prove among other things that for given k 4 and L 3 there are only finitely many arithmetic progressions of the form with x_i , gcd(x₀, x_l) = 1 and 2 l_i L for i = 0, 1, …, k − 1. Furthermore, we show that, for L = 3, the progression (1, 1,…, 1) is the only such progression up to sign. Our proofs involve some well-known theorems of Faltings [9], Darmon and Granville [6] as well as Chabauty's method applied to superelliptic curves.