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.     

Uniform packing dimension results for multiparameter stable processes

In this article, authors discuss the problem of uniform packing dimension of the image set of multiparameter stochastic processes without random uniform H(o)lder condition, and obtain the uniform packing dimension of multiparameter stable processes.If Z is a stable (N, d, α)-process and αN ≤ d, then the following holds with probability 1 Dim Z(E) = α DimE for any Borel setE ∈ B(R N),where Z(E) = {x: (E) t ∈ E, Z(t) = x}. Dim(E) denotes the packing dimension of E.     

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.     

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

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.     

About equivalent interval colorings of weighted graphs

Given a graph G=(V,E) with strictly positive integer weights ω_i on the vertices iV, a k-interval coloring of G is a function I that assigns an interval I(i){1,…,k} of ω_i consecutive integers (called colors) to each vertex iV. If two adjacent vertices x and y have common colors, i.e. I(i)∩I(j)≠0/ for an edge [i,j] in G, then the edge [i,j] is said conflicting. A k-interval coloring without conflicting edges is said legal. The interval coloring problem (ICP) is to determine the smallest integer k, called interval chromatic number of G and denoted χ_int(G), such that there exists a legal k-interval coloring of G. For a fixed integer k, the k-interval graph coloring problem (k-ICP) is to determine a k-interval coloring of G with a minimum number of conflicting edges. The ICP and k-ICP generalize classical vertex coloring problems where a single color has to be assigned to each vertex (i.e., ω_i=1 for all vertices iV).Two k-interval colorings I₁ and I₂ are said equivalent if there is a permutation π of the integers 1,…,k such that ℓI₁(i) if and only if π(ℓ)I₂(i) for all vertices iV. As for classical vertex coloring, the efficiency of algorithms that solve the ICP or the k-ICP can be increased by avoiding considering equivalent k-interval colorings, assuming that they can be identified very quickly. To this purpose, we define and prove a necessary and sufficient condition for the equivalence of two k-interval colorings. We then show how a simple tabu search algorithm for the k-ICP can possibly be improved by forbidding the visit of equivalent solutions.     

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.     

Cut points in metric spaces

In this note, we will define topological and virtual cut points of finite metric spaces and show that, though their definitions seem to look rather distinct, they actually coincide. More specifically, let X denote a finite set, and let denote a metric defined on X. The tight span T(D) of D consists of all maps for which f(x)=sup_yX(xy−f(x)) holds for all xX. Define a map fT(D) to be a topological cut point of D if T(D)−{f} is disconnected, and define it to be a virtual cut point of D if there exists a bipartition (or split) of the support of f into two non-empty sets A and B such that ab=f(a)+f(b) holds for all points aA and bB. It will be shown that, for any given metric D, topological and virtual cut points actually coincide, i.e., a map fT(D) is a topological cut point of D if and only if it is a virtual cut point of D.     

Maps on spaces of symmetric matrices preserving idempotence

Suppose F is an arbitrary field. Let |F| be the number of the elements of F. Let M_n(F) be the space of all n×n matrices over F, and let S_n(F) be the subset of M_n(F) consisting of all symmetric matrices. Let V{S_n(F),M_n(F)}, a map Φ:V→V is said to preserve idempotence if A-λB is idempotent if and only if Φ(A)-λΦ(B) is idempotent for any A,BV and λF. It is shown that: when the characteristic of F is not 2, |F|>3 and n4, Φ:S_n(F)→S_n(F) is a map preserving idempotence if and only if there exists an invertible matrix PM_n(F) such that Φ(A)=PAP^-1 for every AS_n(F) and P^tP=aI_n for some nonzero scalar a in F.     

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.     

-regularity of the Aronsson equation in

For a nonnegative, uniformly convex HC²(R²) with H(0)=0, if uC(Ω), ΩR², is a viscosity solution of the Aronsson equation (1.7), then uC¹(Ω). This generalizes the C¹-regularity theorem on infinity harmonic functions in R² by Savin [O. Savin, C¹-regularity for infinity harmonic functions in dimensions two, Arch. Ration. Mech. Anal. 176 (3) (2005) 351–361] to the Aronsson equation.     

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^β.     

Constrained versions of Sauer’s lemma

Let [n]={1,…,n}. For a function h:[n]→{0,1}, x[n] and y{0,1} define by the width ω_h(x,y) of h at x the largest nonnegative integer a such that h(z)=y on x−a≤z≤x+a. We consider finite VC-dimension classes of functions h constrained to have a width ω_h(x_i,y_i) which is larger than N for all points in a sample or a width no larger than N over the whole domain [n]. Extending Sauer’s lemma, a tight upper bound with closed-form estimates is obtained on the cardinality of several such classes.     

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.     

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.     

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

Universal Polynomial Majorants on Convex Bodies

Let K be a convex body in ^d (d2), and denote by B_n(K) the set of all polynomials p_n in ^d of total degree n such that |p_n|1 on K. In this paper we consider the following question: does there exist a p*_nB_n(K) which majorates every element of B_n(K) outside of K? In other words can we find a minimal γ1 and p*_nB_n(K) so that |p_n(x)|γ |p*_n(x)| for every p_nB_n(K) and x ^d\K? We discuss the magnitude of γ and construct the universal majorants p*_n for evenn. It is shown that γ can be 1 only on ellipsoids. Moreover, γ=O(1) on polytopes and has at most polynomial growth with respect to n, in general, for every convex body K.