Higher order Riesz transforms associated with Bessel operators

In this paper we investigate Riesz transforms R _μ ^(k) of order k≥1 related to the Bessel operator Δ_μ f(x)=-f”(x)-((2μ+1)/x)f’(x) and extend the results of Muckenhoupt and Stein for the conjugate Hankel transform (a Riesz transform of order one). We obtain that for every k≥1, R _μ ^(k) is a principal value operator of strong type (p,p), p∈(1,∞), and weak type (1,1) with respect to the measure dλ(x)=x ^2μ+1  dx in (0,∞). We also characterize the class of weights ω on (0,∞) for which R _μ ^(k) maps L ^p (ω) into itself and L ¹(ω) into L ^1,∞(ω) boundedly. This class of weights is wider than the Muckenhoupt class of weights for the doubling measure dλ. These weighted results extend the ones obtained by Andersen and Kerman.     

On sharp Kolmogorov-type inequalities taking into account the number of sign changes of derivatives

We obtain new sharp Kolmogorov-type inequalities, in particular the following sharp inequality for 2π-periodic functions x ∈ L _∞ ^r (T):

Multidimensional version of M. A. Krasnoseľskii’s generalized contraction principle

Let M be a complete K-metric space with n-dimensional metric ρ(x, y): M × M → R ⁿ , where K is the cone of nonnegative vectors in R ⁿ . A mapping F: M → M is called a Q-contraction if ρ (Fx,Fy) ⩽ Qρ (x,y), where Q: K → K is a semi-additive absolutely stable mapping. A Q-contraction always has a unique fixed point x* in M, and ρ(x*,a) ⩽ (I - Q)^-1 ρ(Fa, a) for every point a in M. The point x* can be obtained by the successive approximation method x _k = Fx _k-1, k = 1, 2,..., starting from an arbitrary point x ₀ in M, and the following error estimates hold: ρ (x*, x _k ) ⩽ Q ^k (I - Q)^-1ρ(x ₁, _x ⁰) ⩽ (I - Q)^-1 Q ^k ρ(x ₁, x ₀), k = 1, 2,.... Generally the mappings (I - Q)^-1 and Q ^k do not commute. For n = 1, the result is close to M. A. Krasnosel’skii’s generalized contraction principle.     

A recurrence property of smooth functions

LetP andQ be real polynomials of degreesd ande, respectively, andf a periodic function. It is shown that, iff iss times differentiable atQ(0), wheres≧7de ³ log 14e ³, then for every ɛ>0 the diophantine inequality ≧FF5C;P(x)f(Q(x)) -P(0)f(Q(0)) -y≧ εx≠0, has a solution. This settles in particular a question raised by Furstenberg and Weiss [6].     

Upper triangular operators and <Emphasis Type="Italic">p</Emphasis>-adic <Emphasis Type="Italic">L</Emphasis>-functions

For a newform f for Γ₀(N) of even weight k supersingular at a prime p ≥ 5, by using infinite dimensional p-adic analysis, we prove that the p-adic L-function L _p (f,α; χ) has finite order of vanishing at any character of the form [(c)\tilde] _s ( x ) = x^s\tilde \chi _s \left( x \right) = x^s. In particular, under the natural embedding of ℤ _p in the group of ℂ* _p -valued continuous characters of ℤ* _p , the order of vanishing at any point is finite.     

The intersection of subgroups of finite <Emphasis Type="Italic">p</Emphasis>-groups

For a finite p-group G and a positive integer k let I _k (G) denote the intersection of all subgroups of G of order p ^k . This paper classifies the finite p-groups G with I_k(G) @ C_p^k-1{{I}_k(G)\cong C_{p^{k-1}}} for primes p > 2. We also show that for any k, α ≥ 0 with 2(α + 1) ≤ k ≤ n−α the groups G of order p ⁿ with I_k(G) @ C_p^k-a{{I}_k(G)\cong C_{p^{k-\alpha}}} are exactly the groups of exponent p ^n-α .     

Three-Dimensional Polyhedra Can Be Described by Three Polynomial Inequalities

Bosse et al. conjectured that for every natural number d≥2 and every d-dimensional polytope P in ℝ ^d , there exist d polynomials p ₁(x),…,p _d (x) satisfying P={x∈ℝ ^d :p ₁(x)≥0,…,p _d (x)≥0}. We show that every three-dimensional polyhedron can be described by three polynomial inequalities, which confirms the conjecture for the case d=3 but also provides an analogous statement for the case of unbounded polyhedra. The proof of our result is constructive. Work supported by the German Research Foundation within the Research Unit 468 “Methods from Discrete Mathematics for the Synthesis and Control of Chemical Processes”.     

On Constrained Markov–Nikolskii type Inequalities for k-Absolutely Monotone Polynomials

We consider a classical problem of estimating norms of higher order derivatives of an algebraic polynomial via the norms of the polynomial itself. The corresponding extremal problem for general polynomials in the uniform norm was solved by V. A. Markov. In 1926, Bernstein found the exact constant in the Markov inequality for monotone polynomials. It was shown in [3] that the order of the constants in constrained Markov–Nikolskii inequality for k-absolutely monotone polynomials is the same as in the classical one in case \({0 < p \leqq q \leqq \infty}\) . In this paper, we find the exact order for all values of \({0 < p, q \leqq \infty}\) . It turnes out that for the case q < p the constrained Markov–Nikolskii inequality is significantly better than the unconstrained one.     

Regressions and monotone chains: A ramsey-type extremal problem for partial orders

Aregression is a functiong from a partially ordered set to itself such thatg(x)≦x for allz. Amonotone k-chain is a chain ofk elementsx ₁<x ₂ <...<x _k such thatg(x ₁)≦g(x ₂)≦...≦g(x _k ). If a partial order has sufficiently many elements compared to the size of its largest antichain, every regression on it will have a monotone (k + 1)-chain. Fixingw, letf(w, k) be the smallest number such that every regression on every partial order with size leastf(w, k) but no antichain larger thanw has a monotone (k + 1)-chain. We show thatf(w, k)=(w+1) ^k . Dedicated to Paul Erdős on his seventieth birthday Research supported in part by the National Science Foundation under ISP-80-11451.     

On the weak non-defectivity of veronese embeddings of projective spaces

Fix integers n, x, k such that n≥3, k>0, x≥4, (n, x)≠(3, 4) and k(n+1)<( _n ^n+x ). Here we prove that the order x Veronese embedding ofP ⁿ is not weakly (k−1)-defective, i.e. for a general S⊃P ⁿ such that #(S) = k+1 the projective space | I _2S (x)| of all degree t hypersurfaces ofP ⁿ singular at each point of S has dimension ( _n ^/n+x )−1− k(n+1) (proved by Alexander and Hirschowitz) and a general F∈| I _2S (x)| has an ordinary double point at each P∈ S and Sing (F)=S. The author was partially supported by MIUR and GNSAGA of INdAM (Italy).     

A counterexample in copositive approximation

The present paper gives a converse result by showing that there exists a functionf ∈C _[−1,1], which satisfies that sgn(x)f(x) ≥ 0 forx ∈ [−1, 1], such that {fx75-1} whereE _n ⁽⁰⁾ (f, 1) is the best approximation of degreen tof by polynomials which are copositive with it, that is, polynomialsP withP(x(f(x) ≥ 0 for allx ∈ [−1, 1],E _n(f) is the ordinary best polynomial approximation off of degreen.     

Superconvergence of the direct discontinuous Galerkin method for a time‐fractional initial‐boundary value problem

A time‐fractional reaction–diffusion initial‐boundary value problem with periodic boundary condition is considered on Q ? Ω × [0, T] , where Ω is the interval [0, l] . Typical solutions of such problem have a weak singularity at the initial time t = 0. The numerical method of the paper uses a direct discontinuous Galerkin (DDG) finite element method in space on a uniform mesh, with piecewise polynomials of degree k ≥ 2 . In the temporal direction we use the L1 approximation of the Caputo derivative on a suitably graded mesh. We prove that at each time level of the mesh, our L1‐DDG solution is superconvergent of order k + 2 in L²(Ω) to a particular projection of the exact solution. Moreover, the L1‐DDG solution achieves superconvergence of order (k + 2) in a discrete L²(Q) norm computed at the Lobatto points, and order (k + 1) superconvergence in a discrete H¹(Q) seminorm at the Gauss points; numerical results show that these estimates are sharp.     

Pre Stieltjes Functions

In this paper we characterize the class C_k{{\mathcal{C}_k}} of functions f on (0,∞) for which f(x), . . . ,(x ^k f(x))^(k) are completely monotonic for given k. In the limit we obtain the well-known characterization of the class of Stieltjes functions as those functions f defined on the positive half line for which (x ^k f(x))^(k) is completely monotonic on (0,∞) for all k ≥ 0.     

Markov and Bernstein type Inequalities in Lp for Classes of Polynomials with Constraints

The Markov-type inequality is proved for all real algebraic polynomials f of degree atmost n having at most k, with 0 k n, zeros (counting multiplicities)in the open unit disk of the complex plane, and for all p >0, where c(p) = c^{p + 1}(l + p^–2) with some absolute constantc > 0. This inequality has been conjectured since 1983 whenthe L case of the above result was proved. It improves and generalizesmany earlier results. Up to the multiplicative constant c(p)>0 the above inequality is sharp. A sharp Bernstein-type analoguefor real trigonometric polynomials is also established, whichis interesting on its own, and plays a key role in the proofof the Markov-type inequality.     

Sharp Observability Inequalities for the 1-D Plate Equation with a Potential

This paper deals with the problem of sharp observability inequality for the 1-D plate equation wtt + wxxxx + q(t,x)w = 0 with two types of boundary conditions w = wxx = 0 or w = wx = 0,and q(t,x) being a suitable potential.The author shows that the sharp observability constant is of order exp(C q ∞27) for q ∞≥ 1.The main tools to derive the desired observability inequalities are the global Carleman inequalities,based on a new point wise inequality for the fourth order plate operator.     

A sufficient degree condition for a graph to contain all trees of size <Emphasis Type="Italic">k</Emphasis>

The Erdős-Sós conjecture says that a graph G on n vertices and number of edges e(G) > n(k− 1)/2 contains all trees of size k. In this paper we prove a sufficient condition for a graph to contain every tree of size k formulated in terms of the minimum edge degree ζ(G) of a graph G defined as ζ(G) = min{d(u) + d(v) − 2: uv ∈ E(G)}. More precisely, we show that a connected graph G with maximum degree Δ(G) ≥ k and minimum edge degree ζ(G) ≥ 2k − 4 contains every tree of k edges if d _G (x) + d _G (y) ≥ 2k − 4 for all pairs x, y of nonadjacent neighbors of a vertex u of d _G (u) ≥ k.     

Strong asymptotics of orthogonal polynomials with respect to exponential weights

We consider asymptotics of orthogonal polynomials with respect to weights w(x)dx = e^−Q(x) dx on the real line, where Q(x) = Σ q_k x^k, q_2m > 0, denotes a polynomial of even order with positive leading coefficient. The orthogonal polynomial problem is formulated as a Riemann‐Hilbert problem following [22, 23]. We employ the steepest‐descent‐type method introduced in [18] and further developed in [17, 19] in order to obtain uniform Plancherel‐Rotach‐type asymptotics in the entire complex plane, as well as asymptotic formulae for the zeros, the leading coefficients, and the recurrence coefficients of the orthogonal polynomials. © 1999 John Wiley & Sons, Inc.     

Generalized derivations with Engel condition on multilinear polynomials

Let R be a prime ring with extended centroid C, δ a nonzero generalized derivation of R, f(x ₁, ..., x _n ) a nonzero multilinear polynomial over C, I a nonzero right ideal of R and k ≥ a fixed integer. If [δ(f(r ₁, ..., r _n )), f(r ₁, ..., r _n )] _k = 0, for all r ₁, ..., r _n ∈ I, then either δ(x) = ax, with (a-γ)I = 0 and a suitable γ ∈ C or there exists an idempotent element e ∈ soc(RC) such that IC = eRC and one of the following holds (1) if char(R) = 0 then f(x ₁, ..., x _n ) is central valued in eRCe (2) if char(R) = p > 0 then is central valued in eRCe, for a suitable s ≥ 0, unless when char(R) = 2 and eRCe satisfies the standard identity s ₄ (3) δ(x) = ax−xb, where (a+b+α)e = 0, for α ∈ C, and f(x ₁, ..., x _n )² is central valued in eRCe.     

Constrained Minkowski Sums: A Geometric Framework for Solving Interval Problems in Computational Biology Efficiently

In this paper, we introduce the notion of a constrained Minkowski sum: for two (finite) point-sets P,Q⊆ℝ² and a set of k inequalities Ax≥b, it is defined as the point-set (P ⊕ Q) _Ax≥b ={x=p+q∣p∈P,q∈Q,Ax≥b}. We show that typical interval problems from computational biology can be solved by computing a set containing the vertices of the convex hull of an appropriately constrained Minkowski sum. We provide an algorithm for computing such a set with running time O(Nlog N), where N=|P|+|Q| if k is fixed. For the special case where P and Q consist of points with integer x ₁-coordinates whose absolute values are bounded by O(N), we even achieve a linear running time O(N). We thereby obtain a linear running time for many interval problems from the literature and improve upon the best known running times for some of them. The main advantage of the presented approach is that it provides a general framework within which a broad variety of interval problems can be modeled and solved. T. Bernholt gratefully acknowledges the Deutsche Forschungsgemeinschaft for the financial support (SFB 475, “Reduction of complexity in multivariate data structures”).     

On generalized Fibonacci and Lucas polynomials

Let h(x) be a polynomial with real coefficients. We introduce h(x)-Fibonacci polynomials that generalize both Catalan’s Fibonacci polynomials and Byrd’s Fibonacci polynomials and also the k-Fibonacci numbers, and we provide properties for these h(x)-Fibonacci polynomials. We also introduce h(x)-Lucas polynomials that generalize the Lucas polynomials and present properties of these polynomials. In the last section we introduce the matrix Q_h(x) that generalizes the Q-matrix whose powers generate the Fibonacci numbers.