Christoffel-type functions for -orthogonal polynomials for Freud weights

This paper gives upper and lower bounds of the Christoffel-type functions , for the m-orthogonal polynomials for a Freud weight W=e^-Q, which are given as follows. Let a_n=a_n(Q) be the nth Mhaskar–Rahmanov–Saff number, φ_n(x)=max{n^-2/3,1-|x|/a_n}, and d>0. Assume that QC(R) is even, , and for some A,B>1

Then for xR

and for |x|a_n(1+dn^-2/3)

     

Positive solutions for Robin problem involving the -Laplacian

Consider Robin problem involving the p(x)-Laplacian on a smooth bounded domain Ω as follows

Applying the sub-supersolution method and the variational method, under appropriate assumptions on f, we prove that there exists λ_*>0 such that the problem has at least two positive solutions if λ(0,λ_*), has at least one positive solution if λ=λ_*<+∞ and has no positive solution if λ>λ_*. To prove the results, we prove a norm on W^1,p(x)(Ω) without the part of ||_L^p(x)(Ω) which is equivalent to usual one and establish a special strong comparison principle for Robin problem.     

Positive solutions for one-dimensional -Laplacian boundary value problems with sign changing nonlinearity

This paper deals with the existence of positive solutions for the one-dimensional p-Laplacian

subject to the boundary value conditions:

where _p(s)=|s|^p−2s,p>1. We show that it has at least one or two positive solutions under some assumptions by applying the fixed point theorem. The interesting points are that the nonlinear term f is involved with the first-order derivative explicitly and f may change sign.     

Nonnegative iterations with asymptotically constant coefficients

Let A_k,k=0,1,2,…, be a sequence of real nonsingular n×n matrices which converge to a nonsingular matrix A. Suppose that A has exactly one positive eigenvalue λ and there exists a unique nonnegative vector u with properties Au=λu and u=1. Under further additional conditions on the spectrum of A, it is shown that if x₀≠0 and the iterates

are nonnegative, then converges to u and converges to λ as k→∞.     

On the nonlinear wave equation with the mixed nonhomogeneous conditions: Linear approximation and asymptotic expansion of solutions

In this paper, we consider the following nonlinear wave equation

(1)

where , , μ, f, g are given functions. To problem (1), we associate a linear recursive scheme for which the existence of a local and unique weak solution is proved by applying the Faedo–Galerkin method and the weak compact method. In the case of , , μ(z)≥μ₀>0, μ₁(z)≥0, for all , and , , , a weak solution u_ε1,ε2(x,t) having an asymptotic expansion of order N+1 in two small parameters ε₁, ε₂ is established for the following equation associated to (1)_2,3:

(2)

     

Labeling the -path with a condition at distance two

For integer r≥2, the infinite r-path P_∞(r) is the graph on vertices …v₋₃,v₋₂,v₋₁,v₀,v₁,v₂,v₃… such that v_s is adjacent to v_t if and only if |s−t|≤r−1. The r-path on n vertices is the subgraph of P_∞(r) induced by vertices v₀,v₁,v₂,…,v_n−1. For non-negative reals x₁ and x₂, a λ_x1,x2-labeling of a simple graph G is an assignment of non-negative reals to the vertices of G such that adjacent vertices receive reals that differ by at least x₁, vertices at distance two receive reals that differ by at least x₂, and the absolute difference between the largest and smallest assigned reals is minimized. With λ_x1,x2(G) denoting that minimum difference, we derive λ_x1,x2(P_n(r)) for r≥3, 1≤n≤∞, and . For , we obtain upper bounds on λ_x1,x2(P_∞(r)) and use them to give λ_x1,x2(P_∞(r)) for r≥5 and . We also determine λ_x1,x2(P_∞(3)) and λ_x1,x2(P_∞(4)) for all .     

Infinitely many non-negative solutions for a Dirichlet problem involving -Laplacian

In this paper, we consider a Dirichlet problem involving the p(x)-Laplacian of the type

We prove the existence of infinitely many non-negative solutions of the problem by applying a general variational principle due to B. Ricceri and the theory of the variable exponent Sobolev spaces.     

Three solutions for a differential inclusion problem involving the -Laplacian

In this paper we consider differential inclusion problem involving the p(x)-Laplacian of the type

Applying a version of the non-smooth three-critical-points theorem we obtain the existence of three solutions of the problem in .     

The topological structure of fuzzy sets with endograph metric

For a non-degenerate convex subset Y of the n-dimensional Euclidean space Rⁿ, let be the family of all fuzzy sets ofRⁿ, which are upper-semicontinuous, fuzzy convex and normal with compact supports contained in Y. We show that the space with the topology of endograph metric is homeomorphic to the Hilbert cube Q=[-1,1]^ω iff Y is compact; and the space is homeomorphic to {(x_n)Q:sup|x_n|<1} iff Y is non-compact and locally compact.     

Solvability of the -Laplacian with nonlocal boundary conditions

Rather mild sufficient conditions are provided for the existence of positive solutions of a boundary value problem of the form

which unify several cases discussed in the literature. In order to formulate these conditions one needs to know only properties of the homeomorphism and have information about the level of growth of the response operator F. No metric information concerning the linear operators L₀,L₁ in the boundary conditions is used, except that they are positive and continuous and such that L_j(1)<1 j{0,1}.     

Using fractional primal–dual to schedule split intervals with demands

We consider the problem of scheduling jobs that are given as groups of non-intersecting intervals on the real line. Each job j is associated with a t-interval (which consists of up to t segments, for some t≥1), a demand, d_j[0,1], and a weight, w(j). A feasible schedule is a collection of jobs such that, for every , the total demand of the jobs in the schedule whose t-interval contains s does not exceed 1. Our goal is to find a feasible schedule that maximizes the total weight of scheduled jobs.We present a 6t-approximation algorithm for this problem that uses a novel extension of the primal–dual schema called fractional primal–dual. The first step in a fractional primal–dual r-approximation algorithm is to compute an optimal solution, x^*, of an LP relaxation of the problem. Next, the algorithm produces an integral primal solution x, and a new LP, denoted by P′, that has the same objective function as the original problem, but contains inequalities that may not be valid with respect to the original problem. Moreover, x^* is a feasible solution of P′. The algorithm also computes a solution y to the dual of P′. The solution x is r-approximate, since its weight is bounded by the value of y divided by r.We present a fractional local ratio interpretation of our 6t-approximation algorithm. We also discuss the connection between fractional primal–dual and the fractional local ratio technique. Specifically, we show that the former is the primal–dual manifestation of the latter.     

Highly connected coloured subgraphs via the regularity lemma

For integers , n≥k and r≥s, let m(n,r,s,k) be the largest (in order) k-connected component with at most s colours one can find in any r-colouring of the edges of the complete graph K_n on n vertices. Bollobás asked for the determination of m(n,r,s,k).Here, bounds are obtained in the cases s=1,2 and k=o(n), which extend results of Liu, Morris and Prince. Our techniques use Szemerédi’s Regularity Lemma for many colours.We shall also study a similar question for bipartite graphs.     

Hessenberg pairs of linear transformations

Let denote a field and V denote a nonzero finite-dimensional vector space over . We consider an ordered pair of linear transformations A:V→V and A^*:V→V that satisfy (i)–(iii) below.

1. [(i)]Each of A,A^* is diagonalizable on V.

2. [(ii)]There exists an ordering of the eigenspaces of A such that

where V_-1=0, V_d+1=0.

3. [(iii)]There exists an ordering of the eigenspaces of A^* such that

where , .

We call such a pair a Hessenberg pair on V. In this paper we obtain some characterizations of Hessenberg pairs. We also explain how Hessenberg pairs are related to tridiagonal pairs.

Instance-optimality in probability with an -minimization decoder

Let Φ(ω), ωΩ, be a family of n×N random matrices whose entries _i,j are independent realizations of a symmetric, real random variable η with expectation and variance . Such matrices are used in compressed sensing to encode a vector by y=Φx. The information y holds about x is extracted by using a decoder . The most prominent decoder is the ℓ₁-minimization decoder Δ which gives for a given the element which has minimal ℓ₁-norm among all with Φz=y. This paper is interested in properties of the random family Φ(ω) which guarantee that the vector will with high probability approximate x in to an accuracy comparable with the best k-term error of approximation in for the range kan/log₂(N/n). This means that for the above range of k, for each signal , the vector satisfies

with high probability on the draw of Φ. Here, Σ_k consists of all vectors with at most k nonzero coordinates. The first result of this type was proved by Wojtaszczyk [P. Wojtaszczyk, Stability and instance optimality for Gaussian measurements in compressed sensing, Found. Comput. Math., in press] who showed this property when η is a normalized Gaussian random variable. We extend this property to more general random variables, including the particular case where η is the Bernoulli random variable which takes the values with equal probability. The proofs of our results use geometric mapping properties of such random matrices some of which were recently obtained in [A. Litvak, A. Pajor, M. Rudelson, N. Tomczak-Jaegermann, Smallest singular value of random matrices and geometry of random polytopes, Adv. Math. 195 (2005) 491–523].     

Interlacing and spacing properties of zeros of polynomials, in particular of orthogonal and -minimal polynomials,

Let be a sequence of polynomials with real coefficients such that uniformly for [α-δ,β+δ] with G(eⁱ)≠0 on [α,β], where 0α<βπ and δ>0. First it is shown that the zeros of are dense in [α,β], have spacing of precise order π/n and are interlacing with the zeros of p_n+1(cos) on [α,β] for every nn₀. Let be another sequence of real polynomials with uniformly on [α-δ,β+δ] and on [α,β]. It is demonstrated that for all sufficiently large n the zeros of p_n(cos) and strictly interlace on [α,β] if on [α,β]. If the last expression is zero then a weaker kind of interlacing holds. These interlacing properties of the zeros are new for orthogonal polynomials also. For instance, for large n a simple criteria for interlacing of zeros of Jacobi polynomials on [-1+,1-], >0, is obtained. Finally it is shown that the results hold for wide classes of weighted L_q-minimal polynomials, q[1,∞], linear combinations and products of orthogonal polynomials, etc.     

Hyperbolic topology of normed linear spaces

In a previous paper [H. Tsuiki, Y. Hattori, Lawson topology of the space of formal balls and the hyperbolic topology of a metric space, Theoret. Comput. Sci. 405 (2008) 198–205], the authors introduced the hyperbolic topology on a metric space, which is weaker than the metric topology and naturally derived from the Lawson topology on the space of formal balls. In this paper, we characterize spaces L_p(Ω,Σ,μ) on which the hyperbolic topology induced by the norm _p coincides with the norm topology. We show the following:

(1) The hyperbolic topology and the norm topology coincide for 1<p<∞.

(2) They coincide on L₁(Ω,Σ,μ) if and only if μ(Ω)=0 or Ω has a finite partition by atoms.

(3) They coincide on L_∞(Ω,Σ,μ) if and only if μ(Ω)=0 or there is an atom in Σ.

Widths of weighted Sobolev classes on the ball

We study the Kolmogorov n-widths and the linear n-widths of weighted Sobolev classes on the unit ball B^d in L_q,μ, where L_q,μ, 1≤q≤∞, denotes the weighted L_q space of functions on B^d with respect to weight . Optimal asymptotic orders of and as n→∞ are obtained for all 1≤p,q≤∞ and μ≥0.     

On reducibility of n-ary quasigroups

An n-ary operation Q:Σⁿ→Σ is called an n-ary quasigroup of order |Σ| if in the relation x₀=Q(x₁,…,x_n) knowledge of any n elements of x₀,…,x_n uniquely specifies the remaining one. Q is permutably reducible if Q(x₁,…,x_n)=P(R(x_σ(1),…,x_σ(k)),x_σ(k+1),…,x_σ(n)) where P and R are (n-k+1)-ary and k-ary quasigroups, σ is a permutation, and 1<k<n. An m-ary quasigroup S is called a retract of Q if it can be obtained from Q or one of its inverses by fixing n-m>0 arguments. We prove that if the maximum arity of a permutably irreducible retract of an n-ary quasigroup Q belongs to {3,…,n-3}, then Q is permutably reducible.     

Completions of -algebras

A μ-algebra is a model of a first-order theory that is an extension of the theory of bounded lattices, that comes with pairs of terms (f,μ_x.f) where μ_x.f is axiomatized as the least prefixed point of f, whose axioms are equations or equational implications.Standard μ-algebras are complete meaning that their lattice reduct is a complete lattice. We prove that any nontrivial quasivariety of μ-algebras contains a μ-algebra that has no embedding into a complete μ-algebra.We then focus on modal μ-algebras, i.e. algebraic models of the propositional modal μ-calculus. We prove that free modal μ-algebras satisfy a condition–reminiscent of Whitman’s condition for free lattices–which allows us to prove that (i) modal operators are adjoints on free modal μ-algebras, (ii) least prefixed points of Σ₁-operations satisfy the constructive relation μ_x.f=_n≥0fⁿ(). These properties imply the following statement: the MacNeille–Dedekind completion of a free modal μ-algebra is a complete modal μ-algebra and moreover the canonical embedding preserves all the operations in the class of the fixed point alternation hierarchy.     

Existence of periodic solutions for a fourth-order -Laplacian equation with a deviating argument

In this paper, we study the existence of periodic solutions for a fourth-order p-Laplacian differential equation with a deviating argument as follows:

[φ_p(u^″(t))]^″+f(u^″(t))+g(u(t−τ(t)))=e(t).