共查询到20条相似文献,搜索用时 187 毫秒
1.
Take a linear ordinary differential operator $\mathfrak{d}\left( z \right) = \sum\nolimits_{i = 1}^k {Q_i \left( z \right)\frac{{d^i }}
{{dz^i }}}$\mathfrak{d}\left( z \right) = \sum\nolimits_{i = 1}^k {Q_i \left( z \right)\frac{{d^i }}
{{dz^i }}} with polynomial coefficients and set r = max
i=1,…,k(deg Q
i
(z) − i). If d(z) satisfies the conditions: (i) r ≥ 0 and (ii) deg Q
k
(z) = k + r, we call it a non-degenerate higher Lamé operator. Following the classical examples of E. Heine and T. Stieltjes we initiated in [13] the study of the following multiparameter spectral problem: for each positive integer n find polynomials V (z) of degree at most r such that the equation
\mathfrakd( z )S( z ) + V( z )S( z ) = 0\mathfrak{d}\left( z \right)S\left( z \right) + V\left( z \right)S\left( z \right) = 0 相似文献
2.
V. V. Andrievskii 《Journal d'Analyse Mathématique》2005,96(1):283-295
LetG⊂C be a quasidisk,K ⊂ G be a compact set, andp
n be a non-constant complex polynomial of degree at mostn. We establish the inequality
whereα
n < 0 depends onn, K,
and the geometrical structure of ϖG. 相似文献
3.
V. Mityushev 《Aequationes Mathematicae》1999,57(1):37-44
Summary. Local solutions of the functional equation¶¶zk f( z) = ?k=1nGk( z) f( skz ) +g( z) z{^\kappa} \phi \left( z\right) =\sum_{k=1}^nG_k\left( z\right) \phi \left( s_kz \right) +g\left( z\right) ¶with k > 0 \kappa > 0 and | sk| \gt 1 \left| s_k\right| \gt 1 are considered. We prove that the equation is solvable if and only if a certain system of k \kappa conditions on Gk (k = 1, 2, ... , n) and g is fulfilled. 相似文献
4.
Tatyana S. Turova 《Random Structures and Algorithms》2013,43(4):486-539
Consider the random graph on n vertices 1,…,n. Each vertex i is assigned a type xi with x1,…,xn being independent identically distributed as a nonnegative random variable X. We assume that EX3< ∞. Given types of all vertices, an edge exists between vertices i and j independent of anything else and with probability \begin{align*}\min \{1, \frac{x_ix_j}{n}\left(1+\frac{a}{n^{1/3}} \right) \}\end{align*}. We study the critical phase, which is known to take place when EX2 = 1. We prove that normalized by n‐2/3the asymptotic joint distributions of component sizes of the graph equals the joint distribution of the excursions of a reflecting Brownian motion with diffusion coefficient \begin{align*}\sqrt{{\textbf{ E}}X{\textbf{ E}}X^3}\end{align*}and drift \begin{align*}a-\frac{{\textbf{ E}}X^3}{{\textbf{ E}}X}s\end{align*}. In particular, we conclude that the size of the largest connected component is of order n2/3. © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 43, 486–539, 2013 相似文献
5.
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. 相似文献
6.
Let G be a multigraph. The star number s(G) of G is the minimum number of stars needed to decompose the edges of G. The star arboricity sa(G) of G is the minimum number of star forests needed to decompose the edges of G. As usual λK
n
denote the λ-fold complete graph on n vertices (i.e., the multigraph on n vertices such that there are λ edges between every pair of vertices). In this paper, we prove that for n ⩾ 2
7.
Artūras Dubickas 《Archiv der Mathematik》2010,95(2):151-160
Let α be a complex number of modulus strictly greater than 1, and let ξ ≠ 0 and ν be two complex numbers. We investigate the distribution of the sequence ξ α n + ν, n = 0, 1, 2, . . . , modulo ${\mathbb{Z}[i],}
8.
Guy Wolfovitz 《Random Structures and Algorithms》2011,39(4):539-543
Consider the triangle‐free process, which is defined as follows. Start with G(0), an empty graph on n vertices. Given G(i ‐ 1), let G(i) = G(i ‐ 1) ∪{g(i)}, where g(i) is an edge that is chosen uniformly at random from the set of edges that are not in G(i ? 1) and can be added to G(i ‐ 1) without creating a triangle. The process ends once a maximal triangle‐free graph has been created. Let H be a fixed triangle‐free graph and let XH(i) count the number of copies of H in G(i). We give an asymptotically sharp estimate for ??(XH(i)), for every \begin{align*}1 \ll i \le 2^{-5} n^{3/2} \sqrt{\ln n}\end{align*}, at the limit as n →∞. Moreover, we provide conditions that guarantee that a.a.s. XH(i) = 0, and that XH(i) is concentrated around its mean.© 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2011 相似文献
9.
Let
G ì \mathbb C G \subset {\mathbb C} be a finite region bounded by a Jordan curve L: = ?G L: = \partial G , let
W: = \textext[`(G)] \Omega : = {\text{ext}}\bar{G} (with respect to
[`(\mathbb C)] {\overline {\mathbb C}} ), $ \Delta : = \left\{ {z:\left| z \right| > 1} \right\} $ \Delta : = \left\{ {z:\left| z \right| > 1} \right\} , and let w = F(z) w = \Phi (z) be a univalent conformal mapping of Ω onto Δ normalized by $ \Phi \left( \infty \right) = \infty, \;\Phi '\left( \infty \right) > 0 $ \Phi \left( \infty \right) = \infty, \;\Phi '\left( \infty \right) > 0 . By A
p
(G); p > 0; we denote a class of functions f analytic in G and satisfying the condition
|