首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
For x = (x 1, x 2, …, x n ) ∈ (0, 1 ] n and r ∈ { 1, 2, … , n}, a symmetric function F n (x, r) is defined by the relation
Fn( x,r ) = Fn( x1,x2, ?, xn;r ) = ?1 \leqslant1 < i2 ?ir \leqslant n ?j = 1r \frac1 - xijxij , {F_n}\left( {x,r} \right) = {F_n}\left( {{x_1},{x_2}, \ldots, {x_n};r} \right) = \sum\limits_{1{ \leqslant_1} < {i_2} \ldots {i_r} \leqslant n} {\prod\limits_{j = 1}^r {\frac{{1 - {x_{{i_j}}}}}{{{x_{{i_j}}}}}} },  相似文献   

2.
In Part I of the paper, we have proved that, for every α > 0 and a continuous function f, which is either convex (s = 0) or changes convexity at a finite collection Y s = {y i } s i=1 of points y i ∈ (-1, 1),
sup{ na En(2)( f,Ys ):n \geqslant N* } \leqslant c( a, s )sup{ na En(f):n \geqslant 1 }, \sup \left\{ {{n^\alpha }E_n^{(2)}\left( {f,{Y_s}} \right):n \geqslant \mathcal{N}*} \right\} \leqslant c\left( {\alpha, s} \right)\sup \left\{ {{n^\alpha }{E_n}(f):n \geqslant 1} \right\},  相似文献   

3.
Let x1,..., xn be points in the d-dimensional Euclidean space Ed with || xi-xj|| £ 1\| x_{i}-x_{j}\| \le 1 for all 1 \leqq i,j \leqq n1 \leqq i,j \leqq n, where || .||\| .\| denotes the Euclidean norm. We ask for the maximum M(d,n) of \mathop?ij=1n|| xi-xj|| 2\textstyle\mathop\sum\limits _{i,\,j=1}^{n}\| x_{i}-x_{j}\| ^{2} (see [4]). This paper deals with the case d = 2. We calculate M(2, n) and show that the value M(2, n) is attained if and only if the points are distributed as evenly as possible among the vertices of a regular triangle of edge-length 1. Moreover we give an upper bound for the value \mathop?ij=1n|| xi-xj|| \textstyle\mathop\sum\limits _{i,\,j=1}^{n}\| x_{i}-x_{j}\| , where the points x1,...,xn are chosen under the same constraints as above.  相似文献   

4.
On the iterates of Euler's function   总被引:1,自引:0,他引:1  
Asymptotic representations are given for the three sums ?nx j(n)/j(j(n))\textstyle\sum\limits \limits _{n\le x} \varphi (n)/\varphi \bigl (\varphi (n)\bigr ), ?nx j(n)/j(j(n))\textstyle\sum\limits \limits _{n\le x} \varphi (n)/\varphi \bigl (\varphi (n)\bigr ), ?nx log j(n)/j(j(n)) ;  j\textstyle\sum\limits \limits _{n\le x}\ \log \, \varphi (n)/\varphi \bigl (\varphi (n)\bigr )\ ; \ \varphi is Euler's function.  相似文献   

5.
Subject to the abc-conjecture, we improve the standard Weyl estimate for cubic exponential sums in which the argument is a quadratic irrational. Specifically. we show that
?n \leqslant N e( an3 ) << e, aN\tfrac57 + e \sum\limits_{n \leqslant N} {e\left( {\alpha {n^3}} \right){ \ll_{\varepsilon, \alpha }}{N^{\tfrac{5}{7} + \varepsilon }}}  相似文献   

6.
We study the boundary-value problem of determining the parameter p of a parabolic equation
v(t) + Av(t) = f(t) + p,    0 \leqslant t \leqslant 1,    v(0) = j,     v(1) = y, v^{\prime}(t) + Av(t) = f(t) + p,\quad 0 \leqslant t \leqslant 1,\quad v(0) = \varphi, \quad v(1) = \psi,  相似文献   

7.
Let S⊂ℝ d be a bounded subset with positive Lebesgue measure. The Paley-Wiener space associated to S, PW S , is defined to be the set of all square-integrable functions on ℝ d whose Fourier transforms vanish outside S. A sequence (x j :j∈ℕ) in ℝ d is said to be a Riesz-basis sequence for L 2(S) (equivalently, a complete interpolating sequence for PW S ) if the sequence (e-iáxj,·?:j ? \mathbb N)(e^{-i\langle x_{j},\cdot \rangle }:j\in \mathbb {N}) of exponential functions forms a Riesz basis for L 2(S). Let (x j :j∈ℕ) be a Riesz-basis sequence for L 2(S). Given λ>0 and fPW S , there is a unique sequence (a j ) in 2 such that the function
Il(f)(x):=?j ? \mathbb Naje-l||x-xj||22,    x ? \mathbb Rd,I_\lambda(f)(x):=\sum_{j\in \mathbb {N}}a_je^{-\lambda \|x-x_j\|_2^2},\quad x\in \mathbb {R}^d,  相似文献   

8.
A two commodity continuous review inventory system with independent Poisson processes for the demands is considered in this paper. The maximum inventory level for the i-th commodity is fixed asS i (i = 1,2). The net inventory level at timet for the i-th commodity is denoted byI i(t),i = 1,2. If the total net inventory levelI(t) =I 1(t) +I 2(t) drops to a prefixed level s[ \leqslant \tfrac(S1 - 2)2or\tfrac(S2 - 2)2]s[ \leqslant \tfrac{{(S_1 - 2)}}{2}or\tfrac{{(S_2 - 2)}}{2}] , an order will be placed for (S is) units of i-th commodity(i=1,2). The probability distribution for inventory level and mean reorders and shortage rates in the steady state are computed. Numerical illustrations of the results are also provided.  相似文献   

9.
For a simply connected and normalized domain D in the plane it was proven by Pólya and Schiffer in 1954 for the fixed membrane eigenvalues
?n1 \frac1lj 3 ?n1 \frac1l(0)j\sum \limits^{n}_{1} \frac{1}{{\lambda}_j} \geq \sum \limits^{n}_{1} \frac{1}{{\lambda}^{(0)}_j}  相似文献   

10.
Let (K, v0) be an algebrically closed valued field. Let M/L be an extension of function fields of one variable over K and {vi}1≤i≤s be distinct valuations on L which prolong v0 and have transcendental residue extensions (Lvi/Kv0). If {wj}1≤j≤t are prolongations of the {vi}1≤i≤s to M, we show the following inequality between the genera of the functions fields: $$g(M/K) - \sum\limits_{1 \leqslant j \leqslant t} {g(Mw_j /Kv_0 ) \geqslant g(L/K)} - \sum\limits_{1 \leqslant i \leqslant s} {g(Lv_i /Kv_0 ) \geqslant 0.} $$ . As an application we show that if M/K has good reduction, L/K also has good reduction. This result generalizes a result of H. Lange [L]. In the appendix we give other “known” results related to Lange's theorem.  相似文献   

11.
Let Lf(x)=-\frac1w?i,j ?i(ai,j(·)?jf)(x)+V(x)f(x){\mathcal{L}f(x)=-\frac{1}{\omega}\sum_{i,j} \partial_i(a_{i,j}(\cdot)\partial_jf)(x)+V(x)f(x)} with the non-negative potential V belonging to reverse H?lder class with respect to the measure ω(x)dx, where ω(x) satisfies the A 2 condition of Muckenhoupt and a i,j (x) is a real symmetric matrix satisfying l-1w(x)|x|2 £ ?ni,j=1ai,j(x)xixj £ lw(x)|x|2.{\lambda^{-1}\omega(x)|\xi|^2\le \sum^n_{i,j=1}a_{i,j}(x)\xi_i\xi_j\le\lambda\omega(x)|\xi|^2. } We obtain some estimates for VaL-a{V^{\alpha}\mathcal{L}^{-\alpha}} on the weighted L p spaces and we study the weighted L p boundedness of the commutator [b, Va L-a]{[b, V^{\alpha} \mathcal{L}^{-\alpha}]} when b ? BMOw{b\in BMO_\omega} and 0 < α ≤ 1.  相似文献   

12.
For a continuous function s\sigma defined on [0,1]×\mathbbT[0,1]\times\mathbb{T}, let \ops\op\sigma stand for the (n+1)×(n+1)(n+1)\times(n+1) matrix whose (j,k)(j,k)-entries are equal to \frac1 2pò02p s( \fracjn,eiq) e-i(j-k)q  dq,        j,k = 0,1,...,n . \displaystyle \frac{1} {2\pi}\int_0^{2\pi} \sigma \left( \frac{j}{n},e^{i\theta}\right) e^{-i(j-k)\theta} \,d\theta, \qquad j,k =0,1,\dots,n~. These matrices can be thought of as variable-coefficient Toeplitz matrices or as the discrete analogue of pseudodifferential operators. Under the assumption that the function s\sigma possesses a logarithm which is sufficiently smooth on [0,1]×\mathbbT[0,1]\times\mathbb{T}, we prove that the asymptotics of the determinants of \ops\op\sigma are given by det[\ops] ~ G[s](n+1)E[s]     \text as   n?¥ , \det \left[\op\sigma\right] \sim G[\sigma]^{(n+1)}E[\sigma] \quad \text{ as \ } n\to\infty~, where G[s]G[\sigma] and E[s]E[\sigma] are explicitly determined constants. This formula is a generalization of the Szegö Limit Theorem. In comparison with the classical theory of Toeplitz determinants some new features appear.  相似文献   

13.
The shortest path tour problem (SPTP) consists in finding a shortest path from a given origination node s to a given destination node d in a directed graph with nonnegative arc lengths with the constraint that the optimal path P should successively and sequentially pass through at least one node from given node subsets T 1, T 2, . . . , T N , where Ti ?Tj = ?, " i, j=1,?,Ni 1 j{T_i \cap T_j = \emptyset, \forall\ i, j=1,\ldots,N,\ i \neq j}. In this paper, it will proved that the SPTP belongs to the complexity class P and several alternative techniques will be presented to solve it.  相似文献   

14.
In the case where a 2π-periodic function f is twice continuously differentiable on the real axis ℝ and changes its monotonicity at different fixed points y i ∈ [− π, π), i = 1,…, 2s, s ∈ ℕ (i.e., on ℝ, there exists a set Y := {y i } i∈ℤ of points y i = y i+2s + 2π such that the function f does not decrease on [y i , y i−1] if i is odd and does not increase if i is even), for any natural k and n, nN(Y, k) = const, we construct a trigonometric polynomial T n of order ≤n that changes its monotonicity at the same points y i Y as f and is such that
*20c || f - Tn || £ \fracc( k,s )n2\upomega k( f",1 \mathord\vphantom 1 n n ) ( || f - Tn || £ \fracc( r + k,s )nr\upomega k( f(r),1 \mathord/ \vphantom 1 n n ),    f ? C(r),    r 3 2 ), \begin{array}{*{20}{c}} {\left\| {f - {T_n}} \right\| \leq \frac{{c\left( {k,s} \right)}}{{{n^2}}}{{{\upomega }}_k}\left( {f',{1 \mathord{\left/{\vphantom {1 n}} \right.} n}} \right)} \\ {\left( {\left\| {f - {T_n}} \right\| \leq \frac{{c\left( {r + k,s} \right)}}{{{n^r}}}{{{\upomega }}_k}\left( {{f^{(r)}},{1 \mathord{\left/{\vphantom {1 n}} \right.} n}} \right),\quad f \in {C^{(r)}},\quad r \geq 2} \right),} \\ \end{array}  相似文献   

15.
Summary. For positive integers q and n, think of P as the vertex set of a (qn + r)-gon, 0 £ rq - 1 0 \leq r \leq q - 1 . For 1 £ iqn + r 1 \leq i \leq qn + r , define V(i) to be a set of q consecutive points of P, starting at p(i), and let S be a subset of {V(i) : 1 £ iqn + r } \lbrace V(i) : 1 \leq i \leq qn + r \rbrace . A q-coloring of P = P(q) such that each member of S contains all q colors is called appropriate for S, and when 1 £ jq 1 \leq j \leq q , the definition may be extended to suitable subsets P(j) of P. If for every 1 £ jq 1 \leq j \leq q and every corresponding P(j), P(j) has a j-coloring appropriate for S, then we say P = P(q) has all colorings appropriate for S. With this terminology, the following Helly-type result is established: Set P = P(q) has all colorings appropriate for S if and only if for every (2n + 1)-member subset T of S, P has all colorings appropriate for T. The number 2n + 1 is best possible for every r 3 1 r \geq 1 . Intermediate results for q-colorings are obtained as well.  相似文献   

16.
Given an IET T : [0, 1) → [0, 1) and decreasing sequence of positive real numbers with divergent sum a = {ai}i=1{{\bf a} = \{a_i\}^\infty_{i=1}} we consider
ST (a) = {(x, y) ? [0, 1) ×[0, 1) : y ? B(Ti x, ai)  for infinitely many i }S_T ({\bf a}) = \{(x, y) \in [0, 1) \times [0, 1) : y \in B(T^i x, a_i) \, {\rm for\,infinitely\,many}\,i \}  相似文献   

17.
We investigate infinite systems of algebraic equations of the form
xjm - ?i,k = 1 tjmikxik = fjm,    j = 1,2 ?,     m = 1,2, ?. {x_{jm}} - \sum\limits_{i,k = 1} {{t_{jmik}}{x_{ik}} = {f_{jm}},\quad j = 1,2 \ldots, \quad m = 1,2, \ldots .}  相似文献   

18.
Let S={s i } i∈??? be a numerical semigroup. For s i S, let ν(s i ) denote the number of pairs (s i ?s j ,s j )∈S 2. When S is the Weierstrass semigroup of a family $\{\mathcal{C}_{i}\}_{i\in\mathbb{N}}Let S={s i } i∈ℕ⊆ℕ be a numerical semigroup. For s i S, let ν(s i ) denote the number of pairs (s i s j ,s j )∈S 2. When S is the Weierstrass semigroup of a family {Ci}i ? \mathbbN\{\mathcal{C}_{i}\}_{i\in\mathbb{N}} of one-point algebraic-geometric codes, a good bound for the minimum distance of the code Ci\mathcal{C}_{i} is the Feng and Rao order bound d ORD (C i ). It is well-known that there exists an integer m such that d ORD (C i )=ν(s i+1) for each im. By way of some suitable parameters related to the semigroup S, we find upper bounds for m and we evaluate m exactly in many cases. Further we conjecture a lower bound for m and we prove it in several classes of semigroups.  相似文献   

19.
In this paper, we consider the multi-point boundary value problems for one-dimensional p-Laplacian at resonance: $(\phi _p (x'(t)))' = f(t,x(t),x'(t))$ subject to the boundary value conditions: $(\phi _p (x'(0)) = \sum\limits_{i = 1}^{n - 2} {\alpha _i \phi _p (x'(\xi _i ))} $ , $(\phi _p (x'(1)) = \sum\limits_{j = 1}^{m - 2} {\beta _j \phi _p (x'(\eta _i ))} $ where ? p (s)=|s|p-2 s, p>1,αi(1≤in-2)∈R{jit}(1≤jm-2)∈R, 0<ξ12<...<ξn-2<1, 0<η12<...<ηm-2<1, By applying the extension of Mawhin’s continuation theorem, we prove the existence of at least one solution. Our result is new.  相似文献   

20.
Let I≥1 be an integer, ω 0=0<ω 1<⋯<ω I π, and for j=0,…,I, a j ∈ℂ, a-j=[`(aj)]a_{-j}={\overline{{a_{j}}}}, ω j =−ω j , and aj 1 0a_{j}\not=0 if j 1 0j\not=0. We consider the following problem: Given finitely many noisy samples of an exponential sum of the form
[(x)\tilde](k) = ?j=-II ajexp(-iwjk) +e(k),     k=-2N,?,2N,\tilde{x}(k)= \sum_{j=-I}^I a_j\exp(-i\omega _jk) +\epsilon (k), \quad k=-2N,\ldots,2N,  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号