Entropy solutions for a doubly nonlinear elliptic problem with variable exponent

We study the boundary value problem in Ω, u=0 on ∂Ω, where Ω is a smooth bounded domain in RN (N?3) and is a p(x)-Laplace type operator with p(.):Ω→[1,+∞) a measurable function and b a continuous and nondecreasing function from R→R. We prove the existence and uniqueness of an entropy solution for L¹-data f.     

Fourier analysis on domains in compact groups

Let Ω be a measurable subset of a compact group G of positive Haar measure. Let be a non-negative function defined on the dual space and let L²(μ) be the corresponding Hilbert space which consists of elements (ξπ)_π∈suppμ satisfying , where ξπ is a linear operator on the representation space of π, and is equipped with the inner product: . We show that the Fourier transform gives an isometric isomorphism from L²(Ω) onto L²(μ) if and only if the restrictions to Ω of all matrix coordinate functions , π∈suppμ, constitute an orthonormal basis for L²(Ω). Finally compact connected Lie groups case is studied.     

Boundary trace embedding theorems for variable exponent Sobolev spaces

We study boundary trace embedding theorems for variable exponent Sobolev space W1,p(⋅)(Ω). Let Ω be an open (bounded or unbounded) domain in RN satisfying strong local Lipschitz condition. Under the hypotheses that p∈L^∞(Ω), 1?infp(x)?supp(x)<N, |∇p|∈Lγ(⋅)(Ω), where γ∈L^∞(Ω) and infγ(x)>N, we prove that there is a continuous boundary trace embedding W1,p(⋅)(Ω)→Lq(⋅)(∂Ω) provided q(⋅), a measurable function on ∂Ω, satisfies condition for x∈∂Ω.     

Independence polynomials of k-tree related graphs

An independent set of a graph G is a set of pairwise non-adjacent vertices. Let α(G) denote the cardinality of a maximum independent set and f_s(G) for 0≤s≤α(G) denote the number of independent sets of s vertices. The independence polynomial defined first by Gutman and Harary has been the focus of considerable research recently. Wingard bounded the coefficients f_s(T) for trees T with n vertices: for s≥2. We generalize this result to bounds for a very large class of graphs, maximal k-degenerate graphs, a class which includes all k-trees. Additionally, we characterize all instances where our bounds are achieved, and determine exactly the independence polynomials of several classes of k-tree related graphs. Our main theorems generalize several related results known before.     

Spectral conditions for admissibility of evolution equations in Hilbert space

We study properties of solutions of the evolution equation , where B is a closable operator on the space AP(R,H) of almost periodic functions with values in a Hilbert space H such that B commutes with translations. The operator B generates a family of closed operators on H such that (whenever eiλtx∈D(B)). For a closed subset Λ⊂R, we prove that the following properties (i) and (ii) are equivalent: (i) for every function f∈AP(R,H) such that σ(f)⊆Λ, there exists a unique mild solution u∈AP(R,H) of Eq. (∗) such that σ(u)⊆Λ; (ii) is invertible for all λ∈Λ and .     

Colouring games on outerplanar graphs and trees

Let f be a graph function which assigns to each graph H a non-negative integer f(H)≤|V(H)|. The f-game chromatic number of a graph G is defined through a two-person game. Let X be a set of colours. Two players, Alice and Bob, take turns colouring the vertices of G with colours from X. A partial colouring c of G is legal (with respect to graph function f) if for any subgraph H of G, the sum of the number of colours used in H and the number of uncoloured vertices of H is at least f(H). Both Alice and Bob must colour legally (i.e., the partial colouring produced needs to be legal). The game ends if either all the vertices are coloured or there are uncoloured vertices with no legal colour. In the former case, Alice wins the game. In the latter case, Bob wins the game. The f-game chromatic number of G, χ_g(f,G), is the least number of colours that the colour set X needs to contain so that Alice has a winning strategy. Let be the graph function defined as , for any n≥3 and otherwise. Then is called the acyclic game chromatic number of G. In this paper, we prove that any outerplanar graph G has acyclic game chromatic number at most 7. For any integer k, let ?_k be the graph function defined as ?_k(K₂)=2 and ?_k(P_k)=3 (P_k is the path on k vertices) and ?_k(H)=0 otherwise. This paper proves that if k≥8 then for any tree T, χ_g(?_k,T)≤9. On the other hand, if k≤6, then for any integer n, there is a tree T such that χ_g(?_k,T)≥n.     

On constants in the Füredi-Hajnal and the Stanley-Wilf conjecture

For a given permutation matrix P, let fP(n) be the maximum number of 1-entries in an n×n(0,1)-matrix avoiding P and let SP(n) be the set of all n×n permutation matrices avoiding P. The Füredi-Hajnal conjecture asserts that cP:=limn→∞fP(n)/n is finite, while the Stanley-Wilf conjecture asserts that is finite.In 2004, Marcus and Tardos proved the Füredi-Hajnal conjecture, which together with the reduction introduced by Klazar in 2000 proves the Stanley-Wilf conjecture.We focus on the values of the Stanley-Wilf limit (sP) and the Füredi-Hajnal limit (cP). We improve the reduction and obtain which decreases the general upper bound on sP from sP?constconstO(klog(k)) to sP?constO(klog(k)) for any k×k permutation matrix P. In the opposite direction, we show .For a lower bound, we present for each k a k×k permutation matrix satisfying cP=Ω(k²).     

Improving the high order nonlinearity lower bound for Boolean functions with given algebraic immunity

Algebraic immunity is a recently introduced cryptographic parameter for Boolean functions used in stream ciphers. If pAI(f) and pAI(f⊕1) are the minimum degree of all annihilators of f and f⊕1 respectively, the algebraic immunity AI(f) is defined as the minimum of the two values. Several relations between the new parameter and old ones, like the degree, the r-th order nonlinearity and the weight of the Boolean function, have been proposed over the last few years.In this paper, we improve the existing lower bounds of the r-th order nonlinearity of a Boolean function f with given algebraic immunity. More precisely, we introduce the notion of complementary algebraic immunity defined as the maximum of pAI(f) and pAI(f⊕1). The value of can be computed as part of the calculation of AI(f), with no extra computational cost. We show that by taking advantage of all the available information from the computation of AI(f), that is both AI(f) and , the bound is tighter than all known lower bounds, where only the algebraic immunity AI(f) is used.     

On the minimum real roots of the adjoint polynomial of a graph

For a graph G, we denote by h(G,x) the adjoint polynomial of G. Let β(G) denote the minimum real root of h(G,x). In this paper, we characterize all the connected graphs G with .     

Lim's theorems for multivalued mappings in CAT(0) spaces

Let X be a complete CAT(0) space. We prove that, if E is a nonempty bounded closed convex subset of X and a nonexpansive mapping satisfying the weakly inward condition, i.e., there exists p∈E such that ∀x∈E, ∀α∈[0,1], then T has a fixed point. In Banach spaces, this is a result of Lim [On asymptotic centers and fixed points of nonexpansive mappings, Canad. J. Math. 32 (1980) 421-430]. The related result for unbounded R-trees is given.     

Boundedness of singular integral operators with variable kernels

Let K be a generalized Calderón-Zygmund kernel defined on Rn×(Rn?{0}). The singular integral operator with variable kernel given by

     

Distance-two labelings of digraphs

For positive integers j?k, an L(j,k)-labeling of a digraph D is a function f from V(D) into the set of nonnegative integers such that |f(x)-f(y)|?j if x is adjacent to y in D and |f(x)-f(y)|?k if x is of distance two to y in D. Elements of the image of f are called labels. The L(j,k)-labeling problem is to determine the -number of a digraph D, which is the minimum of the maximum label used in an L(j,k)-labeling of D. This paper studies -numbers of digraphs. In particular, we determine -numbers of digraphs whose longest dipath is of length at most 2, and -numbers of ditrees having dipaths of length 4. We also give bounds for -numbers of bipartite digraphs whose longest dipath is of length 3. Finally, we present a linear-time algorithm for determining -numbers of ditrees whose longest dipath is of length 3.     

Strongly quasibounded maximal monotone perturbations for the Berkovits-Mustonen topological degree theory

Let X be a real reflexive Banach space with dual X^∗. Let L:X⊃D(L)→X^∗ be densely defined, linear and maximal monotone. Let T:X⊃D(T)→X^∗2, with 0∈D(T) and 0∈T(0), be strongly quasibounded and maximal monotone, and C:X⊃D(C)→X^∗ bounded, demicontinuous and of type (S₊) w.r.t. D(L). A new topological degree theory has been developed for the sum L+T+C. This degree theory is an extension of the Berkovits-Mustonen theory (for T=0) and an improvement of the work of Addou and Mermri (for T:X→X^∗2 bounded). Unbounded maximal monotone operators with are strongly quasibounded and may be used with the new degree theory.     

Existence and porosity for a class of perturbed optimization problems in Banach spaces

Let X be a Banach space and Z a nonempty closed subset of X. Let be an upper semicontinuous function bounded from above. This paper is concerned with the perturbed optimization problem supz∈Z{J(z)+‖x−z‖}, which is denoted by (x,J)-sup. We shall prove in the present paper that if Z is a closed boundedly relatively weakly compact nonempty subset, then the set of all x∈X for which the problem (x,J)-sup has a solution is a dense Gδ-subset of X. In the case when X is uniformly convex and J is bounded, we will show that the set of all points x in X for which there does not exist z₀∈Z such that J(z₀)+‖x−z₀‖=supz∈Z{J(z)+‖x−z‖} is a σ-porous subset of X and the set of all points x∈X?Z⁰ such that there exists a maximizing sequence of the problem (x,J)-sup which has no convergent subsequence is a σ-porous subset of X?Z⁰, where Z⁰ denotes the set of all z∈Z such that z is in the solution set of (z,J)-sup.     

On some iterated weighted spaces

It is proved that the Hörmander and spaces (Ω₁⊂Rn, Ω₂⊂Rm open sets, 1?p<∞, ki Beurling-Björck weights, k=k₁⊗k₂) are isomorphic whereas the iterated spaces and are not if 1<p≠q<∞. A similar result for weighted Lp-spaces of entire analytic functions is also obtained. Finally a result on iterated Besov spaces is given: and are not isomorphic when 1<q≠2<∞.     

Bounds on isoperimetric values of trees

Let G=(V,E) be a finite, simple and undirected graph. For S⊆V, let δ(S,G)={(u,v)∈E:u∈S and v∈V−S} be the edge boundary of S. Given an integer i, 1≤i≤|V|, let the edge isoperimetric value of G at i be defined as b_e(i,G)=min_S⊆V;|S|=i|δ(S,G)|. The edge isoperimetric peak of G is defined as b_e(G)=max_1≤j≤|V|b_e(j,G). Let b_v(G) denote the vertex isoperimetric peak defined in a corresponding way. The problem of determining a lower bound for the vertex isoperimetric peak in complete t-ary trees was recently considered in [Y. Otachi, K. Yamazaki, A lower bound for the vertex boundary-width of complete k-ary trees, Discrete Mathematics, in press (doi:10.1016/j.disc.2007.05.014)]. In this paper we provide bounds which improve those in the above cited paper. Our results can be generalized to arbitrary (rooted) trees.The depth d of a tree is the number of nodes on the longest path starting from the root and ending at a leaf. In this paper we show that for a complete binary tree of depth d (denoted as ), and where c₁, c₂ are constants. For a complete t-ary tree of depth d (denoted as ) and d≥clogt where c is a constant, we show that and where c₁, c₂ are constants. At the heart of our proof we have the following theorem which works for an arbitrary rooted tree and not just for a complete t-ary tree. Let T=(V,E,r) be a finite, connected and rooted tree — the root being the vertex r. Define a weight function w:V→N where the weight w(u) of a vertex u is the number of its successors (including itself) and let the weight index η(T) be defined as the number of distinct weights in the tree, i.e η(T)=|{w(u):u∈V}|. For a positive integer k, let ?(k)=|{i∈N:1≤i≤|V|,b_e(i,G)≤k}|. We show that .     

Analytic discs in the boundary and compactness of Hankel operators with essentially bounded symbols

We derive conditions for compactness of Hankel operators () with bounded, holomorphic symbols f for a large class of convex and bounded domains Ω with Ω⊆Dk.     

Weighted-Hardy functions with Hadamard gaps on the unit ball

We prove that an analytic function f on the unit ball B with Hadamard gaps, that is, (the homogeneous polynomial expansion of f) satisfying n_k+1/n_k?λ>1 for all k∈N, belongs to the space if and only if . Moreover, we show that the following asymptotic relation holds . Also we prove that lim_r→1(1-r²)^α‖Rf_r‖_p=0 if and only if . These results confirm two conjectures from the following recent paper [S. Stevi?, On Bloch-type functions with Hadamard gaps, Abstr. Appl. Anal. 2007 (2007) 8 pages (Article ID 39176)].     

On the weak-approximate fixed point property

Let X be a Banach space and C a bounded, closed, convex subset of X. C is said to have the weak-approximate fixed point property if for any norm-continuous mapping , there exists a sequence {xn} in C such that (xn−fn(xn)) converges to 0 weakly. It is known that every infinite-dimensional Banach space with the Schur property does not have the weak-approximate fixed point property. In this article, we show that every Asplund space has the weak-approximate fixed point property. Applications to the asymptotic fixed point theory are given.     

Weighted norm inequalities of Bochner-Riesz means

Let w be a Muckenhoupt weight and be the weighted Hardy spaces. We use the atomic decomposition of and their molecular characters to show that the Bochner-Riesz means are bounded on for 0<p?1 and δ>max{n/p−(n+1)/2,[n/p]rw⁻¹(rw−1)−(n+1)/2}, where rw is the critical index of w for the reverse Hölder condition. We also prove the boundedness of the maximal Bochner-Riesz means for 0<p?1 and δ>n/p−(n+1)/2.