共查询到20条相似文献,搜索用时 31 毫秒
1.
Kwang C. Shin 《Potential Analysis》2011,35(2):145-174
For integers m ≥ 3 and 1 ≤ ℓ ≤ m − 1, we study the eigenvalue problems − u
″(z) + [( − 1)ℓ(iz)
m
− P(iz)]u(z) = λu(z) with the boundary conditions that u(z) decays to zero as z tends to infinity along the rays
argz=-\fracp2±\frac(l+1)pm+2\arg z=-\frac{\pi}{2}\pm \frac{(\ell+1)\pi}{m+2} in the complex plane, where P is a polynomial of degree at most m − 1. We provide asymptotic expansions of the eigenvalues λ
n
. Then we show that if the eigenvalue problem is PT\mathcal{PT}-symmetric, then the eigenvalues are all real and positive with at most finitely many exceptions. Moreover, we show that when
gcd(m,l)=1\gcd(m,\ell)=1, the eigenvalue problem has infinitely many real eigenvalues if and only if one of its translations or itself is PT\mathcal{PT}-symmetric. Also, we will prove some other interesting direct and inverse spectral results. 相似文献
2.
Liangping Jiang 《Journal of Mathematical Sciences》2011,177(3):395-401
The classical criterion of asymptotic stability of the zero solution of equations x′ = f(t, x) is that there exists a function V (t, x), a(∥x∥) ≤ V (t, x) ≤ b(∥x∥) for some a, b ∈ K such that [(V)\dot] \dot{V} (t, x) ≤ −c(∥x∥) for some c ∈ K. In this paper, we prove that if V(m + 1) \mathop {V}\limits^{(m + {1})} (t, x) is bounded on some set [tk − T, tk + T] × BH(tk → +∞ as k → ∞), then the condition that [(V)\dot] \dot{V} (t, x) ≤ −c(∥x∥) can be weakened and replaced by that [(V)\dot] \dot{V} (t, x) ≤ 0 and − (−[(V)\dot] \dot{V} (tk, x)| + − [(V)\ddot] \ddot{V} (tk, x)| + ⋯ + − V(m) \mathop {V}\limits^{(m)} (tk, x)|) ≤ −c′(∥x∥) for some c′ ∈ K. Moreover, the author also presents a corresponding instability criterion. [1–10] 相似文献
3.
This paper presents rules for numerical integration over spherical caps and discusses their properties. For a spherical cap
on the unit sphere
\mathbbS2\mathbb{S}^2, we discuss tensor product rules with n
2/2 + O(n) nodes in the cap, positive weights, which are exact for all spherical polynomials of degree ≤ n, and can be easily and inexpensively implemented. Numerical tests illustrate the performance of these rules. A similar derivation
establishes the existence of equal weight rules with degree of polynomial exactness n and O(n
3) nodes for numerical integration over spherical caps on
\mathbbS2\mathbb{S}^2. For arbitrary d ≥ 2, this strategy is extended to provide rules for numerical integration over spherical caps on
\mathbbSd\mathbb{S}^d that have O(n
d
) nodes in the cap, positive weights, and are exact for all spherical polynomials of degree ≤ n. We also show that positive weight rules for numerical integration over spherical caps on
\mathbbSd\mathbb{S}^d that are exact for all spherical polynomials of degree ≤ n have at least O(n
d
) nodes and possess a certain regularity property. 相似文献
4.
Horst Alzer 《Proceedings Mathematical Sciences》2010,120(2):131-137
Let n ≥ 1 be an integer and let P
n
be the class of polynomials P of degree at most n satisfying z
n
P(1/z) = P(z) for all z ∈ C. Moreover, let r be an integer with 1 ≤ r ≤ n. Then we have for all P ∈ P
n
:
$
\alpha _n (r)\int_0^{2\pi } {|P(e^{it} )|^2 dt} \leqslant \int_0^{2\pi } {|P^r (e^{it} )|^2 dt} \leqslant \beta _n (r)\int_0^{2\pi } {|P(e^{it} )|^2 dt}
$
\alpha _n (r)\int_0^{2\pi } {|P(e^{it} )|^2 dt} \leqslant \int_0^{2\pi } {|P^r (e^{it} )|^2 dt} \leqslant \beta _n (r)\int_0^{2\pi } {|P(e^{it} )|^2 dt}
相似文献
5.
For given analytic functions ϕ(z) = z + Σ
n=2∞ λ
n
z
n
, Ψ(z) = z + Σ
n=2∞ μ with λ
n
≥ 0, μ
n
≥ 0, and λ
n
≥ μ
n
and for α, β (0≤α<1, 0<β≤1), let E(φ,ψ; α, β) be of analytic functions ƒ(z) = z + Σ
n=2∞
a
n
z
n
in U such that f(z)*ψ(z)≠0 and
6.
Let Ω and Π be two finitely connected hyperbolic domains in the complex plane
\Bbb C{\Bbb C}
and let R(z, Ω) denote the hyperbolic radius of Ω at z and R(w, Π) the hyperbolic radius of Π at w. We consider functions f that are analytic in Ω and such that all values f(z) lie in the domain Π. This set of analytic functions is denoted by A(Ω, Π). We prove among other things that the quantities
Cn(W,P) := supf ? A(W,P)supz ? W\frac|f(n)(z)| R(f(z),P)n! (R(z,W))nC_n(\Omega,\Pi)\,:=\,\sup_{f\in A(\Omega,\Pi)}\sup_{z\in \Omega}\frac{\vert f^{(n)}(z)\vert\,R(f(z),\Pi)}{n!\,(R(z,\Omega))^n}
are finite for all
n ? \Bbb N{n \in {\Bbb N}}
if and only if ∂Ω and ∂Π do not contain isolated points. 相似文献
7.
We present a fully polynomial time approximation scheme (FPTAS) for minimizing an objective (a
T
x + γ)(b
T
x + δ) under linear constraints A
x ≤ d. Examples of such problems are combinatorial minimum weight product problems such as the following: given a graph G = (V,E) and two edge weights find an s − t path P that minimizes a(P)b(P), the product of its edge weights relative to a and b.
相似文献
8.
For a family F{{\cal F}} of subsets of [n] = {1, 2, ..., n} ordered by inclusion, and a partially ordered set P, we say that F{{\cal F}} is P-free if it does not contain a subposet isomorphic to P. Let ex(n, P) be the largest size of a P-free family of subsets of [n]. Let Q
2 be the poset with distinct elements a, b, c, d, a < b,c < d; i.e., the 2-dimensional Boolean lattice. We show that 2N − o(N) ≤ ex(n, Q
2) ≤ 2.283261N + o(N), where
N = \binomn?n/2 ?N = \binom{n}{\lfloor n/2 \rfloor}. We also prove that the largest Q
2-free family of subsets of [n] having at most three different sizes has at most 2.20711N members. 相似文献
9.
V. N. Dubinin 《Mathematical Notes》2006,80(1-2):31-35
It is shown that if P(z) = z n + ? is a polynomial with connected lemniscate E(P) = {z: ¦P(z)¦ ≤ 1} and m critical points, then, for any n? m+1 points on the lemniscate E(P), there exists a continuum γ ? E(P) of logarithmic capacity cap γ ≤ 2?1/n which contains these points and all zeros and critical points of the polynomial. As corollaries, estimates for continua of minimum capacity containing given points are obtained. 相似文献
10.
Sylvain Roy 《Arkiv f?r Matematik》2008,46(1):153-182
Let Ω be an open subset of R
d
, d≥2, and let x∈Ω. A Jensen measure for x on Ω is a Borel probability measure μ, supported on a compact subset of Ω, such that ∫u
dμ≤u(x) for every superharmonic function u on Ω. Denote by J
x
(Ω) the family of Jensen measures for x on Ω. We present two characterizations of ext(J
x
(Ω)), the set of extreme elements of J
x
(Ω). The first is in terms of finely harmonic measures, and the second as limits of harmonic measures on decreasing sequences
of domains.
This allows us to relax the local boundedness condition in a previous result of B. Cole and T. Ransford, Jensen measures and
harmonic measures, J. Reine Angew. Math.
541 (2001), 29–53.
As an application, we give an improvement of a result by Khabibullin on the question of whether, given a complex sequence
{α
n
}
n=1
∞ and a continuous function , there exists an entire function f≢0 satisfying f(α
n
)=0 for all n, and |f(z)|≤M(z) for all z∈C. 相似文献
11.
We compute the greatest solutions of systems of linear equations over a lattice (P, ≤). We also present some applications of the results obtained to lattice matrix theory. Let (P, ≤) be a pseudocomplemented lattice with
and
and let A = ‖a
ij
‖
n×n
, where a
ij
∈ P for i, j = 1,..., n. Let A* = ‖a
ij
′
‖
n×n
and
for i, j = 1,..., n, where a* is the pseudocomplement of a ∈ P in (P, ≤). A matrix A has a right inverse over (P, ≤) if and only if A · A* = E over (P, ≤). If A has a right inverse over (P, ≤), then A* is the greatest right inverse of A over (P, ≤). The matrix A has a right inverse over (P, ≤) if and only if A is a column orthogonal over (P, ≤). The matrix D = A · A* is the greatest diagonal such that A is a left divisor of D over (P, ≤).
Invertible matrices over a distributive lattice (P, ≤) form the general linear group GL
n
(P, ≤) under multiplication. Let (P, ≤) be a finite distributive lattice and let k be the number of components of the covering graph Γ(join(P,≤) −
, ≤), where join(P, ≤) is the set of join irreducible elements of (P, ≤). Then GL
a
(P, ≤) ≅ = S
n
k
.
We give some further results concerning inversion of matrices over a pseudocomplemented lattice.
__________
Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 11, No. 3, pp. 139–154, 2005. 相似文献
12.
Mark L. Agranovsky 《Journal d'Analyse Mathématique》2011,113(1):305-329
Let C
t
= {z ∈ ℂ: |z − c(t)| = r(t), t ∈ (0, 1)} be a C
1-family of circles in the plane such that lim
t→0+
C
t
= {a}, lim
t→1−
C
t
= {b}, a ≠ b, and |c′(t)|2 + |r′(t)|2 ≠ 0. The discriminant set S of the family is defined as the closure of the set {c(t) + r(t)w(t), t ∈ [0, 1]}, where w = w(t) is the root of the quadratic equation ̅c′(t)w
2 + 2r′(t)w + c′(t) = 0 with |w| < 1, if such a root exists. 相似文献
13.
Let D = (V, E) be a primitive digraph. The vertex exponent of D at a vertex v∈ V, denoted by expD(v), is the least integer p such that there is a v →u walk of length p for each u ∈ V. Following Brualdi and Liu, we order the vertices of D so that exPD(V1) ≤ exPD(V2) …≤ exPD(Vn). Then exPD(Vk) is called the k- point exponent of D and is denoted by exPD (k), 1≤ k ≤ n. In this paper we define e(n, k) := max{expD (k) | D ∈ PD(n, 2)} and E(n, k) := {exPD(k)| D ∈ PD(n, 2)}, where PD(n, 2) is the set of all primitive digraphs of order n with girth 2. We completely determine e(n, k) and E(n, k) for all n, k with n ≥ 3 and 1 ≤ k ≤ n. 相似文献
14.
Raffaele Mosca 《Graphs and Combinatorics》2001,17(3):517-528
Let G be a graph with n vertices, and denote as γ(G) (as θ(G)) the cardinality of a minimum edge cover (of a minimum clique cover) of G. Let E (let C) be the edge-vertex (the clique-vertex) incidence matrix of G; write then P(E)={x∈ℜ
n
:Ex≤1,x≥0}, P(C)={x∈ℜ
n
:Cx≤1,x≥0}, α
E
(G)=max{1
T
x subject to x∈P(E)}, and α
C
(G)= max{1
T
x subject to x∈P(C)}. In this paper we prove that if α
E
(G)=α
C
(G), then γ(G)=θ(G).
Received: May 20, 1998?Final version received: April 12, 1999 相似文献
15.
Hong Lin Xiao-feng Guo 《应用数学学报(英文版)》2007,23(1):155-160
Let φ(G),κ(G),α(G),χ(G),cl(G),diam(G)denote the number of perfect matchings,connectivity,independence number,chromatic number,clique number and diameter of a graph G,respectively.In this note,by constructing some extremal graphs,the following extremal problems are solved:1.max{φ(G):|V(G)|=2n,κ(G)≤k}=k[(2n-3)!!],2.max{φ(G):|V(G)|=2n,α(G)≥k}=[multiply from i=0 to k-1(2n-k-i)[(2n-2k-1)!!],3.max{φ(G):|V(G)|=2n,χ(G)≤k}=φ(T_(k,2n))T_(k,2n)is the Turán graph,that is a complete k-partite graphon 2n vertices in which all parts are as equal in size as possible,4.max{φ(G):|V(G)|=2n,cl(G)=2}=n1,5.max{φ(G):|V(G)|=2n,diam(G)≥2}=(2n-2)(2n-3)[(2n-5)!!],max{φ(G):|V(G)|=2n,diam(G)≥3}=(n-1)~2[(2n-5)!!]. 相似文献
16.
Yehoram Gordon 《Israel Journal of Mathematics》1966,4(3):177-188
GivenF(z),f
1(z), ..,f
n(z) defined on a finite point setE, and givenB — the set of generalised polynomials Σ
k
=1/n
a
kfk(z) — the definition of a juxtapolynomial is extended in the following manner: for a fixedλ(0<λ≦1),f(z) εB is called a generalizedλ-weak juxtapolynomial toF(z) onE if and only if there exists nog(z) εB for whichg(z)=F(z) wheneverf(z)=F(z) and |g(z)−F(z) |<λ|f(z)−F(z)| wheneverf(z)≠F(z). The properties of suchf(z) are investigated with particular attention given to the real case.
This note is an extension of a part of the author’s M.Sc. Thesis under the supervision of Prof. B. Grünbaum to whom the author
wishes to express his sincerest appreciation. The author also wishes to thank Dr. J. Lindenstrauss for his valuable remarks
in the preparation of this paper. 相似文献
17.
We obtain two results concerning the Feichtinger conjecture for systems of normalized reproducing kernels in the model subspace
K
Θ=H
2⊖ΘH
2 of the Hardy space H
2, where Θ is an inner function. First, we verify the Feichtinger conjecture for the kernels [(k)\tilde]ln=kln/||kln||\tilde{k}_{\lambda_{n}}=k_{\lambda_{n}}/\|k_{\lambda _{n}}\| under the assumption that sup
n
|Θ(λ
n
)|<1. Second, we prove the Feichtinger conjecture in the case where Θ is a one-component inner function, meaning that the
set {z:|Θ(z)|<ε} is connected for some ε∈(0,1). 相似文献
18.
James R. Holub 《Israel Journal of Mathematics》1985,52(3):231-238
LetW(D) denote the set of functionsf(z)=Σ
n=0
∞
A
n
Z
n
a
nzn for which Σn=0
∞|a
n
|<+∞. Given any finite set lcub;f
i
(z)rcub;
i=1
n
inW(D) the following are equivalent: (i) The generalized shift sequence lcub;f
1(z)z
kn
,f
2(z)z
kn+1, …,f
n
(z)z
(k+1)n−1rcub;
k=0
∞
is a basis forW(D) which is equivalent to the basis lcub;z
m
rcub;
m=0
∞
. (ii) The generalized shift sequence is complete inW(D), (iii) The function
has no zero in |z|≦1, wherew=e
2πiti
/n. 相似文献
19.
Nitis Mukhopadhyay 《Methodology and Computing in Applied Probability》2010,12(4):609-622
In this communication, we first compare z
α
and t
ν,α
, the upper 100α% points of a standard normal and a Student’s t
ν
distributions respectively. We begin with a proof of a well-known result, namely, for every fixed
0 < a < \frac120<\alpha <\frac{1}{2} and the degree of freedom ν, one has t
ν,α
> z
α
. Next, Theorem 3.1 provides a new and explicit expression b
ν
( > 1) such that for every fixed
0 < a < \frac120<\alpha < \frac{1}{2} and ν, we can conclude t
ν,α
> b
ν
z
α
. This is clearly a significant improvement over the result that is customarily quoted in nearly every textbook and elsewhere.
A proof of Theorem 3.1 is surprisingly simple and pretty. We also extend Theorem 3.1 in the case of a non-central Student’s
t distribution (Section 3.3). In the context of Stein’s (Ann Math Stat 16:243–258, 1945; Econometrica 17:77–78, 1949) 100(1 − α)% fixed-width confidence intervals for the mean of a normal distribution having an unknown variance, we have examined the
oversampling rate on an average for a variety of choices of m, the pilot sample size. We ran simulations to investigate this issue. We have found that the oversampling rates are approximated
well by tn,a/22za/2-2t_{\nu ,\alpha /2}^{2}z_{\alpha /2}^{-2} for small and moderate values of m( ≤ 50) all across Table 2 where ν = m − 1. However, when m is chosen large (≥ 100), we find from Table 3 that the oversampling rates are not approximated by tn,a/22za/2-2t_{\nu ,\alpha /2}^{2}z_{\alpha /2}^{-2} very well anymore in some cases, and in those cases the oversampling rates either exceed the new lower bound of tn,a/22za/2-2,t_{\nu ,\alpha /2}^{2}z_{\alpha /2}^{-2}, namely bn2,b_{\nu }^{2}, or comes incredibly close to bn2b_{\nu }^{2} where ν = m − 1. That is, the new lower bound for a percentile of a Student’s t distribution may play an important role in order to come up with diagnostics in our understanding of simulated output under
Stein’s fixed-width confidence interval method. 相似文献
20.
Let P(G,λ) be the chromatic polynomial of a graph G with n vertices, independence number α and clique number ω. We show that for every λ≥n, ()α≤≤ ()
n
−ω. We characterize the graphs that yield the lower bound or the upper bound.?These results give new bounds on the mean colour
number μ(G) of G: n− (n−ω)()
n
−ω≤μ(G)≤n−α() α.
Received: December 12, 2000 / Accepted: October 18, 2001?Published online February 14, 2002 相似文献
|