共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
G. V. Kirsanova 《Mathematical Notes》1973,14(3):749-754
In this paper we consider functionsf(t), – < t < , which are n times continuously differentiable with a given convex modulus of continuity of the n-th derivative. For a certain class of periodic functions we establish a relationship between upper bounds of the absolute values of a function and its n-th derivative.Translated from Matematicheskie Zametki, Vol. 14, No. 3, pp. 329–338, September, 1973. 相似文献
3.
Let
C( \mathbbRm ) C\left( {{\mathbb{R}^m}} \right) be the space of bounded and continuous functions
x:\mathbbRm ? \mathbbR x:{\mathbb{R}^m} \to \mathbb{R} equipped with the norm
|| x ||C = || x ||C( \mathbbRm ): = sup{ | x(t) |:t ? \mathbbRm } \left\| x \right\|C = {\left\| x \right\|_{C\left( {{\mathbb{R}^m}} \right)}}: = \sup \left\{ {\left| {x(t)} \right|:t \in {\mathbb{R}^m}} \right\} 相似文献
4.
5.
6.
Anne Greenbaum 《Linear algebra and its applications》2009,430(1):52-2352
Given an n by n matrix A, we look for a set S in the complex plane and positive scalars m and M such that for all functions p bounded and analytic on S and throughout a neighborhood of each eigenvalue of A, the inequalities
m·inf{‖f‖L∞(S):f(A)=p(A)}?‖p(A)‖?M·inf{‖f‖L∞(S):f(A)=p(A)} 相似文献
7.
8.
9.
Plamen Stefanov 《Journal of Functional Analysis》2006,231(1):111-142
We study the scattering poles of a compactly supported “black box” perturbations of the Laplacian in Rn, n odd. We prove a sharp upper bound of the counting function N(r) modulo o(rn) in terms of the counting function of the reference operator in the smallest ball around the black box. In the most interesting cases, we prove a bound of the type N(r)?Anrn+o(rn) with an explicit An. We prove that this bound is sharp in a few special spherically symmetric cases where the bound turns into an asymptotic formula. 相似文献
10.
11.
Let M=(mij) be a nonnegative irreducible n×n matrix with diagonal entries 0. The largest eigenvalue of M is called the spectral radius of the matrix M , denoted by ρ(M). In this paper, we give two sharp upper bounds of the spectral radius of matrix M. As corollaries, we give two sharp upper bounds of the distance matrix of a graph. 相似文献
12.
Let be the second largest eigenvalue of a graph. Powers (1988) [4] gave some upper bounds of for general graphs and bipartite graphs, respectively. Considering that these bounds are not always attainable for connected graphs, we present sharp upper bounds of for connected graphs and connected bipartite graphs in this paper. Moreover, the extremal graphs are completely characterized. 相似文献
13.
14.
Let be a simple connected graph with vertices and edges. The spectral radius of is the largest eigenvalue of its adjacency matrix. In this paper, we firstly consider the effect on the spectral radius of a graph by removing a vertex, and then as an application of the result, we obtain a new sharp upper bound of which improves some known bounds: If , where is an integer, then The equality holds if and only if is a complete graph or , where is the graph obtained from by deleting some edge . 相似文献
15.
16.
N. G. Ushakov 《Journal of Mathematical Sciences》1997,84(3):1179-1189
In the paper, several known inequalities for characteristic functions are sharpened and several new ones are derived.
Proceedings of the XVII Seminar on Stability Problems for Stochastic Models, Kazan, Russia, 1995, Part III. 相似文献
17.
18.
For a given finite set of linear functionals we construct functions vanishing on them and give order estimates of their derivatives. We also give their different applications. 相似文献
19.
20.
Let f be an entire function of finite order and a an entire function of order less than f's. If f−a and f′−a have the same zeros with the same multiplicities, then f′−a≡c(f−a) for some non-zero constant c. 相似文献
|