Nonlinear parabolic equations with p-growth and unbounded data

The purpose of this paper is to prove the existence of a solution for a nonlinear parabolic equation in the form u_t - div(a(t, x, u, Du)) = H(t, x, u, Du) - div(g(t, x)) in Q_T =]0,T[×Ω, Ω ⊂ R^N, with an initial condition u(0) = u₀, where u₀ is not bounded, |H(t,x, u, ξ)⩽ β|ξ|^p + f(t,x) + βe^λ₁^|u|f, |g|^p/(p-1) ∈ L^r(Q_T) for some r = r{N) ⩾ 1, and - div(a(t,x,u, Du)) is the usual Leray-Lions operator.     

Cubic Thue inequalities with negative discriminant

We give an upper bound for the solutions of the family of cubic Thue inequalities |x³+axy²+by³|?k when a is positive and larger than a certain value depending on b. For the case k=a+|b|+1 and a?360b⁴ we show that these inequalities have only trivial solutions. For the case k=a+|b|+1 and |b|=1,2, we solve these inequalities for all a?1. Our method is based on Padé approximations using Rickert's integrals. We also use a generalization of Legendre's theorem on continued fractions.     

Construction of the asymptotics of the solutions of the one-dimensional Schrödinger equation with rapidly oscillating potential

We obtain asymptotic formulas for the solutions of the one-dimensional Schrödinger equation ? y″ +q(x)y = 0 with oscillating potential q(x)=x ^β P(x ^1+α)+cx ^?2 as x→ +∞. The real parameters α and β satisfy the inequalities β ? α ≥ ?1, 2α ? β > 0 and c is an arbitrary real constant. The real function P(x) is either periodic with period T, or a trigonometric polynomial. To construct the asymptotics, we apply the ideas of the averaging method and use Levinson’s fundamental theorem.     

Integrability of optimal mappings

In this paper, we study the integrability of optimal mappings T taking a probability measure μ to another measure g · μ. We assume that T minimizes the cost function c and μ satisfies some special inequalities related to c (the infimum-convolution inequality or the logarithmic c-Sobolev inequality). The results obtained are applied to the analysis of measures of the form exp(?|x|^α).     

A new method of proof of Filippov’s theorem based on the viability theorem

Filippov??s theorem implies that, given an absolutely continuous function y: [t ₀; T] ?? ? ^d and a set-valued map F(t, x) measurable in t and l(t)-Lipschitz in x, for any initial condition x ₀, there exists a solution x(·) to the differential inclusion x??(t) ?? F(t, x(t)) starting from x ₀ at the time t ₀ and satisfying the estimation $$\left| {x(t) - y(t)} \right| \leqslant r(t) = \left| {x_0 - y(t_0 )} \right|e^{\int_{t_0 }^t {l(s)ds} } + \int_{t_0 }^t \gamma (s)e^{\int_s^t {l(\tau )d\tau } } ds,$$ where the function ??(·) is the estimation of dist(y??(t), F(t, y(t))) ?? ??(t). Setting P(t) = {x ?? ? ⁿ : |x ?y(t)| ?? r(t)}, we may formulate the conclusion in Filippov??s theorem as x(t) ?? P(t). We calculate the contingent derivative DP(t, x)(1) and verify the tangential condition F(t, x) ?? DP(t, x)(1) ?? ?. It allows to obtain Filippov??s theorem from a viability result for tubes.     

A weak-type inequality for uniformly bounded trigonometric polynomials

This paper is devoted to refining the Bernstein inequality. Let D be the differentiation operator. The action of the operator Λ = D/n on the set of trigonometric polynomials T _n is studied: the best constant is sought in the inequality between the measures of the sets {x ∈ T: |Λt(x)| > 1} and {x ∈ T: |t(x)| > 1}. We obtain an upper estimate that is order sharp on the set of uniformly bounded trigonometric polynomials T _n ^C = {t ∈ T _n : ‖t‖ ≤ C}.     

Extension of maps and ordering

LetX be a topological space,Y a closed subspace and π:x→T, ψ:Y→T be two continuous maps. We shall say that ψ can be extended by π if there exists a continuous man η=ν(π, ψ):X→T such that: η| _x?y ?π, η| _Y =ψ. Clearly a similar definition can be given in the category of real or complex algebraic varietes. In this paper we give some sufficient conditions to ensure that map ψ can be extended by π. In particular we study the topological and the real algebraic case. It seems that the last setting is the more interesting.     

A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees

Let G be a connected simple graph, let X?V (^G) and let f be a mapping from X to the set of integers. When X is an independent set, Frank and Gyárfás, and independently, Kaneko and Yoshimoto gave a necessary and sufficient condition for the existence of spanning tree T in G such that d _T (x) for all x ∈ X, where d _T (x) is the degree of x and T. In this paper, we extend this result to the case where the subgraph induced by X has no induced path of order four, and prove that there exists a spanning tree T in G such that d _T (x) ≥ f(x) for all x ∈ X if and only if for any nonempty subset S ? X, |N _G (S) ? S| ? f(S) + 2|S| ? ω _G (S) ≥, where ω _G (S) is the number of components of the subgraph induced by S.     

Nonlinear biharmonic equations with Hardy potential and critical parameter

Some embedding inequalities in Hardy-Sobolev spaces with weighted function α|x| are proved. The procedure is based on decomposition into spherical harmonics, where in addition various new inequalities are obtained. Next, we study the existence of nontrivial solutions of biharmonic equations with Hardy potential and critical parameter.     

Compactness of support of solutions to nonlinear second-order elliptic and parabolic equations in a half-cylinder

We study equations of the form $$\begin{gathered} u_{tt} + Lu + b(x,t)u_t = a(x,t)\left| u \right|^{\sigma - 1} u, \hfill \\ - u_t + Lu = a(x,t)\left| u \right|^{\sigma - 1} u \hfill \\ \end{gathered}$$ , whereL is a uniformly elliptic operator and 0<σ<1. In the half-cylinder II_0,∞={(x, t):x= (x ₁,...,x _n )∈ ω,t>0}, where ? ? ? _n is a bounded domain, we consider solutions satisfying the homogeneous Neumann condition forx∈?ω andt>0. We find conditions under which these solutions have compact support and prove statements of the following type: ifu(x, t)=o(t ^γ) ast→∞, then there exists aT such thatu(x, t)≡0 fort>T. In this case γ depends on the coefficients of the equation and on the exponent σ.     

Zolotarev's first problem — the best approximation by polynomials of degree ≤n − 2 tox n − nσx n−1 in [−1, 1]

Chebyshev determined $$\mathop {\min }\limits_{(a)} \mathop {\max }\limits_{ - 1 \le x \le 1} |x^n + a_1 x^{n - 1} + \cdots + a_n |$$ as 2^1?n , which is attained when the polynomial is 2^1?n T _n(x), whereT _n(x) = cos(n arc cosx). Zolotarev's First Problem is to determine $$\mathop {\min }\limits_{(a)} \mathop {\max }\limits_{ - 1 \le x \le 1} |x^n - n\sigma x^{n - 1} + a_2 x^{n - 2} + \cdots + a_n |$$ as a function ofn and the parameter σ and to find the extremal polynomials. He solved this in 1878. Another discussion was given by Achieser in 1928, and another by Erdös and Szegö in 1942. The case when 0≤|σ|≤ tan²(π/2n) is quite simple, but that for |σ|> tan²(π/2n) is quite different and very complicated. We give two new versions of the proof and discuss the change in character of the solution. Both make use of the Equal Ripple Theorem.     

Weighted Norm Inequalities on Graphs

Let (??,??) be an infinite graph endowed with a reversible Markov kernel p and let P be the corresponding operator. We also consider the associated discrete gradient ?. We assume that ?? is doubling, a uniform lower bound for p(x,y) when p(x,y)>0, and gaussian upper estimates for the iterates of p. Under these conditions (and in some cases assuming further some Poincaré inequality) we study the comparability of (I?P)^1/2 f and ?f in Lebesgue spaces with Muckenhoupt weights. Also, we establish weighted norm inequalities for a Littlewood?CPaley?CStein square function, its formal adjoint, and commutators of the Riesz transform with bounded mean oscillation functions.     

Two special cases of the assignment problem

The assignment problem may be stated as follows: Given finite sets of points S and T, with|S| ? |T|, and given a “metric” which assigns a distance d(x, y) to each pair (x, y) such that x ∈ T and y ∈ S find a 1?1 function Q: T→ S which minimizes Σ_x∈Td(x, Q(x)) We consider the two special cases in which the points lie (1) on a line segment and (2) on a circle, and the metric is the distance along the line segment or circle, respectively. In each case, we show that the optimal assignment Q can be computed in a number of steps (additions and comparisons) proportional to the number of points. The problem arose in connection with the efficient rearrangement of desks located in offices along a corridor which encircles one floor of a building.     

Embeddings of weighted sobolev spaces and generalized Caffarelli-Kohn-Nirenberg inequalities

We characterize all the real numbers a, b, c and 1 ?? p, q, r < ?? such that the weighted Sobolev space $$W_{\{ a,b\} }^{\{ q,q\} }({R^N}\backslash \{ 0\} ): = \{ u \in L_{loc}^1({R^N}\backslash \{ 0\} ):{\left| x \right|^{a/q}} \in {L^q}({R^{N),}}{\left| x \right|^{b/p}}\nabla u \in {({L^p}({R^N}))^N}\} $$ is continuously embedded into $${L^r}({R^N};{\left| x \right|^c}dx): = \{ u \in L_{loc}^1({R^N}\backslash \{ 0\} ):{\left| x \right|^{c/r}}u \in {L^r}({R^N})\} $$ with norm ??·?? _c,r . It turns out that, except when N ?? 2 and a = c = b ? p = ?N, such an embedding is equivalent to the multiplicative inequality $${\left\| u \right\|_{c,r}} \le C\left\| {\nabla u} \right\|_{b,p}^\theta \left\| u \right\|_{a,q}^{1 - \theta }$$ for some suitable ?? ?? [0, 1], which is often but not always unique. If a, b, c > ?N, then C ₀ ^?? (? ^N ) ? W _{a,b} ^(q,p) (? ^N {0}) ?? L ^r (? ^N ; |x| ^c dx) and such inequalities for u ?? C ₀ ^?? (? ^N ) are the well-known Caffarelli-Kohn-Nirenberg inequalities; but their generalization to W _{a,b} ^(q,p) (? ^N {0}) cannot be proved by a denseness argument. Without the assumption a, b, c > ?N, the inequalities are essentially new, even when u ?? C ₀ ^?? (? ^N {0}), although a few special cases are known, most notably the Hardy-type inequalities when p = q. In a different direction, the embedding theorem easily yields a generalization when the weights |x| ^a , |x| ^b and |x| ^c are replaced with more general weights w _a ,w _b and w _c , respectively, having multiple power-like singularities at finite distance and at infinity.     

Short note on Hilbert’s inequality

Considering five different parameters, we obtain some new Hilbert-type integral inequalities for functions f(x), g(x) in L²[0, ∞). Then, we extract from our results some special cases which have been proved before.     

Simultaneous rational approximation to the successive powers of a real number

Let n be an integer ≥ 1 and let θ be a real number which is not an algebraic number of degree ≤ [n/2]. We show that there exist ? > 0 and arbitrary large real numbers X such that the system of linear inequalities |x₀| ≤ X and |x₀θ^j − x_j| ≤ ?X^−1/[n/2] for 1 < j < n, has only the zero solution in rational integers x₀,…, x_n. This result refines a similar statement due to H. Davenport and W. M. Schmidt, where the upper integer part [n/2] is replaced everywhere by the integer part [n/2]. As a corollary, we improve slightly the exponent of approximation to 0 by algebraic integers of degree n + 1 over Q obtained by these authors.     

A generalization of Dirichlet approximation theorem for the affine actions on real line

In this paper, we obtain strong density results for the orbits of real numbers under the action of the semigroup generated by the affine transformations T₀(x)=x/a and T₁(x)=bx+1, where a,b>1. These density results are formulated as generalizations of the Dirichlet approximation theorem and improve the results of Bergelson, Misiurewicz, and Senti. We show that for any x,u>0 there are infinitely many elements γ in the semigroup generated by T₀ and T₁ such that |γ(x)−u|<C(t1/|γ|−1), where C and t are constants independent of γ, and |γ| is the length of γ as a word in the semigroup. Finally, we discuss the problem of approximating an arbitrary real number by the ratios of prime numbers and the ratios of logarithms of prime numbers.     

On the asymptotic behavior of iterates of nonexpansive mappings in Hilbert space

LetT be a nonexpansive mapping on a closed convex subsetC of a real Hilbert spaceH. In the present note we deal with the weak convergence of the sequenceT ⁿ x and the sequenceS _n x of the arithmetical means of the sequenceT ⁿ x, asn → ∞. We also give some results concerning the strong convergence ofS _n x.     

Inequalities concerning numbers of subsets of a finite set

Let S(n) denote the set of subsets of an n-element set. For an element x of S(n), let Γx and Px denote, respectively, all (|x| ?1)-element subsets of x and all (|x| + 1)-element supersets of x in S(n). Several inequalities involving Γ and P are given. As an application, an algorithm for finding an x-element antichain $\text{X}{}^1$ in S(n) satisfying $\text{| YX}{}^1\text{| ? | YX |}$ for all x-element antichains X in S(n) is developed, where YX is the set of all elements of S(n) contained in an element of X. This extends a result of Kleitman [9] who solved the problem in case x is a binomial coefficient.     

Hamilton cycles,avoiding prescribed arcs,in close-to-regular tournaments

The local irregularity of a digraph D is defined as i_l(D) = max {|d⁺ (x) − d⁻ (x)| : x ϵ V(D)}. Let T be a tournament, let Γ = {V₁, V₂, …, V_c} be a partition of V(T) such that |V₁| ≥ |V₂| ≥ … ≥ |V_c|, and let D be the multipartite tournament obtained by deleting all the arcs with both end points in the same set in Γ. We prove that, if |V(T)| ≥ max{2i_l(T) + 2|V₁| + 2|V₂| − 2, i_l(T) + 3|V₁| − 1}, then D is Hamiltonian. Furthermore, if T is regular (i.e., i_l(T) = 0), then we state slightly better lower bounds for |V(T)| such that we still can guarantee that D is Hamiltonian. Finally, we show that our results are best possible. © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 123–136, 1999