On constants in some inequalities for intermediate derivatives on a finite interval

Let L_q (1q<∞) be the space of functions f measurable on I=[−1,1] and integrable to the power q, with normL_∞ is the space of functions measurable on I with normWe denote by AC the set of all functions absolutely continuous on I. For nN, q[1,∞] we setW_n,q={f:f⁽ⁿ⁻¹⁾AC, f⁽ⁿ⁾L_q}.In this paper, we consider the problem of accuracy of constants A, B in the inequalities (1)|| f^(m)||_qA|| f||_p+B|| f^(m+k+1)||_r, mN, kW; p,q,r[1,∞], fW_m+k+1,r.     

Fusion frames and distributed processing

Let {W_i}_iI be a (redundant) sequence of subspaces of a Hilbert space each being endowed with a weight v_i, and let be the closed linear span of the W_is, a composite Hilbert space. {(W_i,v_i)}_iI is called a fusion frame provided it satisfies a certain property which controls the weighted overlaps of the subspaces. These systems contain conventional frames as a special case, however they reach far “beyond frame theory.” In case each subspace W_i is equipped with a spanning frame system {f_ij}_jJi, we refer to {(W_i,v_i,{f_ij}_jJi)}_iI as a fusion frame system. The focus of this article is on computational issues of fusion frame reconstructions, unique properties of fusion frames important for applications with particular focus on those superior to conventional frames, and on centralized reconstruction versus distributed reconstructions and their numerical differences. The weighted and distributed processing technique described in this article is not only a natural fit to distributed processing systems such as sensor networks, but also an efficient scheme for parallel processing of very large frame systems. Another important component of this article is an extensive study of the robustness of fusion frame systems.     

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.     

Mutually independent hamiltonian cycles for the pancake graphs and the star graphs

A hamiltonian cycle C of a graph G is an ordered set u₁,u₂,…,u_n(G),u₁ of vertices such that u_i≠u_j for i≠j and u_i is adjacent to u_i+1 for every i{1,2,…,n(G)−1} and u_n(G) is adjacent to u₁, where n(G) is the order of G. The vertex u₁ is the starting vertex and u_i is the ith vertex of C. Two hamiltonian cycles C₁=u₁,u₂,…,u_n(G),u₁ and C₂=v₁,v₂,…,v_n(G),v₁ of G are independent if u₁=v₁ and u_i≠v_i for every i{2,3,…,n(G)}. A set of hamiltonian cycles {C₁,C₂,…,C_k} of G is mutually independent if its elements are pairwise independent. The mutually independent hamiltonicity IHC(G) of a graph G is the maximum integer k such that for any vertex u of G there exist k mutually independent hamiltonian cycles of G starting at u.In this paper, the mutually independent hamiltonicity is considered for two families of Cayley graphs, the n-dimensional pancake graphs P_n and the n-dimensional star graphs S_n. It is proven that IHC(P₃)=1, IHC(P_n)=n−1 if n≥4, IHC(S_n)=n−2 if n{3,4} and IHC(S_n)=n−1 if n≥5.     

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.     

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.     

EXISTENCE OF GLOBAL ATTRACTORS FOR A NONLINEAR EVOLUTION EQUATION IN SOBOLEV SPACE Hk

In this paper we prove that the initial-boundary value problem for the nonlinear evolution equation ut = △u ＋ λu - u^3 possesses a global attractor in Sobolev space H^k for all k≥0, which attracts any bounded domain of H^k（Ω） in the H^k-norm. This result is established by using an iteration technique and regularity estimates for linear semigroup of operator, which extends the classical result from the case k ∈ [0, 1] to the case k∈ [0, ∞）.     

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.     

A new kind of graph coloring

A proper k-coloring C¹,C²,…,C^k of a graph G is called strong if, for every vertex uV(G), there exists an index i{1,2,…,k} such that u is adjacent to every vertex of Cⁱ. We consider classes of strongly k-colorable graphs and show that the recognition problem of is NP-complete for every k4, but it is polynomial-time solvable for k=3. We give a characterization of in terms of forbidden induced subgraphs. Finally, we solve the problem of uniqueness of a strong 3-coloring.     

Density of Gabor Frames

A Gabor system is a set of time-frequency shifts S(g, Λ) ={e^{2 π ibx}g(x − a)}_{(a, b) Λ} of a function g L²(R^d). We prove that if a finite union of Gabor systems _{k = 1}^rS(g_k, Λ_k) forms a frame for L²(R^d) then the lower and upper Beurling densities of Λ = _{k = 1}^r Λ_k satisfy D⁻(Λ) ≥ 1 and D ⁺ (Λ) < ∞. This extends recent work of Ramanathan and Steger. Additionally, we prove the conjecture that no collection _{k = 1}^r{g_k(x − a)}_{a Γk} of pure translates can form a frame for L²(R^d).     

Constant-sign solutions for systems of singular integral equations of Hammerstein type

We consider the system of Hammerstein integral equations

where T>0 is fixed, ρ_i’s are given functions and the nonlinearities f_i(t,x₁,x₂,…,x_n) can be singular at t=0 and x_j=0 where j{1,2,,n}. Criteria are offered for the existence of constant-sign solutions, i.e., θ_iu_i(t)≥0 for t[0,T] and 1≤i≤n, where θ_i{1,−1} is fixed. The tools used are a nonlinear alternative of Leray–Schauder type, Krasnosel’skii’s fixed point theorem in a cone and Schauder’s fixed point theorem. We also include examples and applications to illustrate the usefulness of the results obtained.     

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.     

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.     

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π).     

Borel extractions of converging sequences in compact sets of Borel functions

It is well known by a classical result of Bourgain–Fremlin–Talagrand that if K is a pointwise compact set of Borel functions on a Polish space then given any cluster point f of a sequence (f_n)_nω in K one can extract a subsequence (f_nk)_kω converging to f. In the present work we prove that this extraction can be achieved in a “Borel way.” This will prove in particular that the notion of analytic subspace of a separable Rosenthal compacta is absolute and does not depend on the particular choice of a dense sequence.     

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.     

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}.