首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
If k is a perfect field of characteristic p ≠ 0 and k(x) is the rational function field over k, it is possible to construct cyclic extensions Kn over k(x) such that [K : k(x)] = pn using the concept of Witt vectors. This is accomplished in the following way; if [β1, β2,…, βn] is a Witt vector over k(x) = K0, then the Witt equation yp ? y = β generates a tower of extensions through Ki = Ki?1(yi) where y = [y1, y2,…, yn]. In this paper, it is shown that there exists an alternate method of generating this tower which lends itself better for further constructions in Kn. This alternate generation has the form Ki = Ki?1(yi); yip ? yi = Bi, where, as a divisor in Ki?1, Bi has the form (Bi) = qΠpjλj. In this form q is prime to Πpjλj and each λj is positive and prime to p. As an application of this, the alternate generation is used to construct a lower-triangular form of the Hasse-Witt matrix of such a field Kn over an algebraically closed field of constants.  相似文献   

2.
Let pk(A), k=2,…,n, denote the sum of the permanents of all k×k submatrices of the n×n matrix A. A conjecture of Ðokovi?, which is stronger than the famed van der Waerden permanent conjecture, asserts that the functions pk((1?θ)Jn+;θA), k=2,…, n, are strictly increasing in the interval 0?θ?1 for every doubly stochastic matrix A. Here Jn is the n×n matrix all whose entries are equal 1n. In the present paper it is proved that the conjecture holds true for the circulant matrices A=αIn+ βPn, α, β?0, α+;β=1, and A=(nJn?In?Pn)(n?2), where In and Pn are respectively the n×n identify matrix and the n×n permutation matrix with 1's in positions (1,2), (2,3),…, (n?1, n), (n, 1).  相似文献   

3.
In this paper, the problem of phase reconstruction from magnitude of multidimensional band-limited functions is considered. It is shown that any irreducible band-limited function f(z1…,zn), zi ? C, i=1, …, n, is uniquely determined from the magnitude of f(x1…,xn): | f(x1…,xn)|, xi ? R, i=1,…, n, except for (1) linear shifts: i(α1z1+…+αn2n+β), β, αi?R, i=1,…, n; and (2) conjugation: f1(z11,…,zn1).  相似文献   

4.
Let Mm,n(F) denote the space of all mXn matrices over the algebraically closed field F. A subspace of Mm,n(F), all of whose nonzero elements have rank k, is said to be essentially decomposable if there exist nonsingular mXn matrices U and V respectively such that for any element A, UAV has the form
UAV=A1A2A30
where A1 is iX(k–i) for some i?k. Theorem: If K is a space of rank k matrices, then either K is essentially decomposable or dim K?k+1. An example shows that the above bound on non-essentially-decomposable spaces of rank k matrices is sharp whenever n?2k–1.  相似文献   

5.
A technique for the numerical approximation of matrix-valued Riemann product integrals is developed. For a ? x < y ? b, Im(x, y) denotes
χyχv2?χv2i=1mF(νi)dν12?dνm
, and Am(x, y) denotes an approximation of Im(x, y) of the form
(y?x)mk=1naki=1mF(χik)
, where ak and yik are fixed numbers for i = 1, 2,…, m and k = 1, 2,…, N and xik = x + (y ? x)yik. The following result is established. If p is a positive integer, F is a function from the real numbers to the set of w × w matrices with real elements and F(1) exists and is continuous on [a, b], then there exists a bounded interval function H such that, if n, r, and s are positive integers, (b ? a)n = h < 1, xi = a + hi for i = 0, 1,…, n and 0 < r ? s ? n, then
χr?χs(I+F dχ)?i=rsI+j=1pIji?1i)
=hpH(χr?1s)+O(hp+1)
Further, if F(j) exists and is continuous on [a, b] for j = 1, 2,…, p + 1 and A is exact for polynomials of degree less than p + 1 ? j for j = 1, 2,…, p, then the preceding result remains valid when Aj is substituted for Ij.  相似文献   

6.
Let n1+n2+?+nm=n where the ni's are integers (possibly negative or greater than n). Let p=(k1,…,km), where k1+k2+?+km=k, be a partition of the nonnegative integer k into m nonnegative integers and let P denote the set of all such partitions. For m?2, we prove the combinatorial identity
p∈Pi=1mni+1?kiki=i?0j+m?2m?2n+1?k?2jk?2j
which implies the surprising result that the left side of the above equation depends on n but not on the ni's.  相似文献   

7.
Let Fm×n (m?n) denote the linear space of all m × n complex or real matrices according as F=C or R. Let c=(c1,…,cm)≠0 be such that c1???cm?0. The c-spectral norm of a matrix A?Fm×n is the quantity
6A6ci=Imciσi(A)
. where σ1(A)???σm(A) are the singular values of A. Let d=(d1,…,dm)≠0, where d1???dm?0. We consider the linear isometries between the normed spaces (Fn,∥·∥c) and (Fn,∥·∥d), and prove that they are dual transformations of the linear operators which map L(d) onto L(c), where
L(c)= {X?Fm×n:X has singular values c1,…,cm}
.  相似文献   

8.
9.
The length ln of a longest common subsequence before time n sequences (B11, B12, …) (B21, B22, …) is the cardinality of the largest increasing set of pairs of integers {(j1α, j2α)}
l?j11<j12<·<j11n?nl?j21<j22<·<j21n?n
such that ?1?α?ln, (B1j=B2j). If B1 and B2 are independent random sequences with co-ordinates i.i.d. uniform on {1, 2, …, k}, it follows from Kingman's subadditive ergodic theorem that the ratio ln/n converges to a constant ck a.s. A method of deriving lower bounds for the constants ck is given, the bounds obtained improving known lower bounds, for k>2. The rate of decrease of ck with k is shown to be no faster than 1/√k, contrasting with P{B1i?B2i}=1/k. Finally, an alternative method of deriving lower bounds is given and used to improve the lower bound for c2.  相似文献   

10.
The following estimate of the pth derivative of a probability density function is examined: Σk = 0Na?khk(x), where hk is the kth Hermite function and a?k = ((?1)pn)Σi = 1nhk(p)(Xi) is calculated from a sequence X1,…, Xn of independent random variables having the common unknown density. If the density has r derivatives the integrated square error converges to zero in the mean and almost completely as rapidly as O(n?α) and O(n?α log n), respectively, where α = 2(r ? p)(2r + 1). Rates for the uniform convergence both in the mean square and almost complete are also given. For any finite interval they are O(n?β) and O(n2log n), respectively, where β = (2(r ? p) ? 1)(2r + 1).  相似文献   

11.
Let X1, X2, X3, … be i.i.d. r.v. with E|X1| < ∞, E X1 = μ. Given a realization X = (X1,X2,…) and integers n and m, construct Yn,i, i = 1, 2, …, m as i.i.d. r.v. with conditional distribution P1(Yn,i = Xj) = 1n for 1 ? j ? n. (P1 denotes conditional distribution given X). Conditions relating the growth rate of m with n and the moments of X1 are given to ensure the almost sure convergence of (1mmi=1 Yn,i toμ. This equation is of some relevance in the theory of Bootstrap as developed by Efron (1979) and Bickel and Freedman (1981).  相似文献   

12.
Let A be the Clifford algebra constructed over a quadratic n-dimensional real vector space with orthogonal basis {e1,…, en}, and e0 be the identity of A. Furthermore, let Mk(Ω;A) be the set of A-valued functions defined in an open subset Ω of Rm+1 (1 ? m ? n) which satisfy Dkf = 0 in Ω, where D is the generalized Cauchy-Riemann operator D = ∑i = 0m ei(??xi) and k? N. The aim of this paper is to characterize the dual and bidual of Mk(Ω;A). It is proved that, if Mk(Ω;A) is provided with the topology of uniform compact convergence, then its strong dual is topologically isomorphic to an inductive limit space of Fréchet modules, which in its turn admits Mk(Ω;A) as its dual. In this way, classical results about the spaces of holomorphic functions and analytic functionals are generalized.  相似文献   

13.
Let Ω be a finite set with k elements and for each integer n ≧ 1 let Ωn = Ω × Ω × … × Ω (n-tuple) and Ωn = {(a1, a2,…, an) | (a1, a2,…, an) ∈ Ωn and ajaj+1 for some 1 ≦ jn ? 1}. Let {Ym} be a sequence of independent and identically distributed random variables such that P(Y1 = a) = k?1 for all a in Ω. In this paper, we obtain some very surprising and interesting results about the first occurrence of elements in Ωn and in Ω?n with respect to the stochastic process {Ym}. The results here provide us with a better and deeper understanding of the fair coin-tossing (k-sided) process.  相似文献   

14.
For a sequence A = {Ak} of finite subsets of N we introduce: δ(A) = infm?nA(m)2n, d(A) = lim infn→∞ A(n)2n, where A(m) is the number of subsets Ak ? {1, 2, …, m}.The collection of all subsets of {1, …, n} together with the operation a ∪ b, (a ∩ b), (a 1 b = a ∪ b ? a ∩ b) constitutes a finite semi-group N (semi-group N) (group N1). For N, N we prove analogues of the Erdös-Landau theorem: δ(A+B) ? δ(A)(1+(2λ)?1(1?δ(A>))), where B is a base of N of the average order λ. We prove for N, N, N1 analogues of Schnirelmann's theorem (that δ(A) + δ(B) > 1 implies δ(A + B) = 1) and the inequalities λ ? 2h, where h is the order of the base.We introduce the concept of divisibility of subsets: a|b if b is a continuation of a. We prove an analog of the Davenport-Erdös theorem: if d(A) > 0, then there exists an infinite sequence {Akr}, where Akr | Akr+1 for r = 1, 2, …. In Section 6 we consider for N∪, N∩, N1 analogues of Rohrbach inequality: 2n ? g(n) ? 2n, where g(n) = min k over the subsets {a1 < … < ak} ? {0, 1, 2, …, n}, such that every m? {0, 1, 2, …, n} can be expressed as m = ai + aj.Pour une série A = {Ak} de sous-ensembles finis de N on introduit les densités: δ(A) = infm?nA(m)2m, d(A) = lim infn→∞ A(n)2nA(m) est le nombre d'ensembles Ak ? {1, 2, …, m}. L'ensemble de toutes les parties de {1, 2, …, n} devient, pour les opérations a ∪ b, a ∩ b, a 1 b = a ∪ b ? a ∩ b, un semi-groupe fini N, N ou un groupe N1 respectivement. Pour N, N on démontre l'analogue du théorème de Erdös-Landau: δ(A + B) ? δ(A)(1 + (2λ)?1(1?δ(A))), où B est une base de N d'ordre moyen λ. On démontre pour N, N, N1 l'analogue du théorème de Schnirelmann (si δ(A) + δ(B) > 1, alors δ(A + B) = 1) et les inégalités λ ? 2h, où h est l'ordre de base. On introduit le rapport de divisibilité des enembles: a|b, si b est une continuation de a. On démontre l'analogue du théorème de Davenport-Erdös: si d(A) > 0, alors il existe une sous-série infinie {Akr}, où Akr|Akr+1, pour r = 1, 2, … . Dans le Paragraphe 6 on envisage pour N, N, N1 les analogues de l'inégalité de Rohrbach: 2n ? g(n) ? 2n, où g(n) = min k pour les ensembles {a1 < … < ak} ? {0, 1, 2, …, n} tels que pour tout m? {0, 1, 2, …, n} on a m = ai + aj.  相似文献   

15.
Using old results on the explicit calculation of determinants, formulae are given for the coefficients of P0(z) and P0(z)fi(z) ? Pi(z), where Pi(z) are polynomials of degree σ ? ρi (i=0,1,…,n), P0(z)fi(z) ? Pi(z) are power series in which the terms with zk, 0?k?σ, vanish (i=1,2,…,n), (ρ0,ρ1,…,ρn) is an (n+1)-tuple of nonnegative integers, σ=ρ0+ρ1+?+ρn, and {fi}ni=1 is the set of hypergeometric functions {1F1(1;ci;z)}ni=1(ci?Zz.drule;N, ci ? cj?Z) or {2F0(ai,1;z)}ni=1(ai ?Z?N, ai ? aj?Z) under the condition ρ0?ρi ? 1 (i=1,2,…,n).  相似文献   

16.
Let N(n,i) = (k,…,kn,n?ik)ci/i, i = O.…,[n/k]. We prove that the random variable Xn such that P(Xn = i) = N(n, i)Σj N(n, j) has asymptotically (n → ∞) a normal distribution and we give some combinatorial applications of this result.We also improve a result of Godsil [3] dealing with matchings in graph.  相似文献   

17.
Let Δ(α + β) = |Hλ2?r+1| where Hr is the complete symmetric function in (α1 + β1), (α2 + β2), …, (αn + βn). It is proved that Δ(α + β) ? Δ(α) + Δ(β). This inequality is generalised for certain symmetric functions defined by Littlewood. Let Ω(α + β) = |Qλ2?r+1staggered(α + β) (t, k1, k2, …, km)|. Then we prove that Ω(α + β) ? Ω(α) + Ω(β). Here λ1, λ2, λ3, …, λn is a partition such that λn > λn?1 > ··· > λ2 > λ1.  相似文献   

18.
In connection with an optimization problem, all functions ?: InR with continuous nonzero partial derivatives and satisfying
???x,i???xj
for all xi, xjI, i, j = 1,2,…, n (n > 2) are determined (I is an interval of positive real numbers).  相似文献   

19.
Let A be an n × n normal matrix over C, and Qm, n be the set of strictly increasing integer sequences of length m chosen from 1,…,n. For α, β ? Qm, n denote by A[α|β] the submatrix obtained from A by using rows numbered α and columns numbered β. For k ? {0, 1,…, m} we write |αβ| = k if there exists a rearrangement of 1,…, m, say i1,…, ik, ik+1,…, im, such that α(ij) = β(ij), i = 1,…, k, and {α(ik+1),…, α(im) } ∩ {β(ik+1),…, β(im) } = ?. A new bound for |detA[α|β ]| is obtained in terms of the eigenvalues of A when 2m = n and |αβ| = 0.Let Un be the group of n × n unitary matrices. Define the nonnegative number
where | αβ| = k. It is proved that
Let A be semidefinite hermitian. We conjecture that ρ0(A) ? ρ1(A) ? ··· ? ρm(A). These inequalities have been tested by machine calculations.  相似文献   

20.
Elliptic boundary value problems for systems of nonlinear partial differential equations of the form Fi(x, u1, u2,…, uN,?ui?xj, ?pi?2ui?xj ?xk) = ?i(x), x ? Rn, i = 1(1)N, j, k = 1(1)n, pi ? 0, ? being a small parameter, with Dirichlet boundary conditions are considered. It is supposed that a formal approximation Z is given which satisfies the boundary conditions and the differential equations upto the order χ(?) = o(1) in some norm. Then, using the theory of differential inequalities, it is shown that under certain conditions the difference between the exact solution u of the boundary value problem and the formal approximation Z, taken in the sense of a suitable norm, can be made small.  相似文献   

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

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