首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
Using a Poincaré compactification, the linear homogeneous system of delay equations {x = Ax(t ? 1) (A is an n × n real matrix) induces a delay system π(A) on the sphere Sn. The points at infinity belong to an invariant submanifold Sn ? 1 of Sn. For an open and dense set of 2 × 2 matrices A with distinct eigenvalues, the system π(A) has only hyperbolic critical points (including the critical points at infinity). For an open and dense set of 2 × 2matrices A with complex eigenvalues, the nonwandering set at infinity is the union of an odd number of hyperbolic periodic orbits; if (detA)12 < 2, the restriction of π(A) to S1 is Morse-Smale. For n = 1 there exist periodic orbits of period 4 provided that ?A > π2 and Hopf bifurcation of a center occurs for ?A near (π2) + 2kπ, k ? Z.  相似文献   

2.
Let π be a cuspidal representation of GLn(AQ) with non-vanishing cohomology and denote by L(π,s) its L-function. Under a certain local non-vanishing assumption, we prove the rationality of the values of L(π?χ,0) for characters χ, which are critical for π. Note that conjecturally any motivic L-function should coincide with an automorphic L-function on GLn; hence, our result corresponds to a conjecture of Deligne for motivic L-functions. To cite this article: J. Mahnkopf, C. R. Acad. Sci. Paris, Ser. I 338 (2004).  相似文献   

3.
Let A be a nonnegative square matrix, and let D be a diagonal matrix whose iith element is (Ax)ixi, where x is a (fixed) positive vector. It is shown that the number of final classes of A equals n?rank(A?D). We also show that null(A?D) = null(A?D)2, and that this subspace is spanned by a set of nonnegative elements. Our proof uses a characterization of nonnegative matrices having a positive eigenvector corresponding to their spectral radius.  相似文献   

4.
An anti-Hadamard matrix may be loosely defined as a real (0, 1) matrix which is invertible, but only just. Let A be an invertible (0, 1) matrix with eigenvalues λi, singular values σi, and inverse B = (bij). We are interested in the four closely related problems of finding λ(n) = minA, i|λi|, σ(n) = minA, iσi, χ(n) = maxA, i, j |bij|, and μ(n) = maxAΣijb2ij. Then A is an anti-Hadamard matrix if it attains μ(n). We show that λ(n), σ(n) are between (2n)?1(n4)?n2 and cn (2.274)?n, where c is a constant, c(2.274)n?χ(n)?2(n4)n2, and c(5.172)n?μ(n)?4n2 (n4)n. We also consider these problems when A is restricted to be a Toeplitz, triangular, circulant, or (+1, ?1) matrix. Besides the obvious application—to finding the most ill-conditioned (0, 1) matrices—there are connections with weighing designs, number theory, and geometry.  相似文献   

5.
The Ostrowski-Reich theorem states that for a system Ax =b of linear equations with A nonsingular, if A is hermitian and if the diagonal of A is positive, then the SOR method converges for each relaxation parameter in (0,2) if and only if A is positive definite. This is actually a special case of the Householder-John theorem, which states that for A=M?N with A,M nonsingular, if A is hermitian and M1+N is positive definite, then M?1N is a convergent matrix if and only if A is positive definite. Our purposes here are to generalize the Householder-John theorem and to provide an insight into how and why the SOR method can converge. As a result the Ostrowski-Reich theorem is extended in two directions; one is when A is hermitian but the diagonal of A is not necessarily positive, so that A is not necessarily positive definite, and the other is when A+A1 is positive definite but A is not necessarily hermitian. In the process, several other convergence results are obtained for general splittings of A. However, no claims are made concerning the case in which the convergence results obtained here can be applied to practical situations.  相似文献   

6.
A Lyapunov transformation is a linear transformation on the set Hn of hermitian matrices H ? Cn,n of the form LA(H) = A1H + HA, where A ?Cn,n. Given a positive stable A ?Cn,n, the Stein-Pfeffer Theorem characterizes those K ? Hn for which K = LB(H), where B is similar to A and H is positive definite. We give a new proof of this result, and extend it in several directions. The proofs involve the idea of a controllability subspace, employed previously in this context by Snyders and Zakai.  相似文献   

7.
Let A and B be two n×n real symmetric matrices. A theorem of Calabi and Greub-Milnor states that if n?3 and A and B satisfy the condition
(uAu′)2 + (uBu′)2 ≠ 0
for all nonzero vectors u, then there is a linear combination of A and B that is definite. In this note, the author proves two theorems of the semi-definiteness of a nontrivial linear combination of A and B by replacing the condition (1) by another condition. One of these theorems is a generalization of the theorem of Greub-Milnor and Calabi.  相似文献   

8.
The subject of this work is the voltage and current transfer ratios of three-terminal networks having no mutual coupling and whose impedances are analytic functions taking their values in an abelian self-adjoint algebra of bounded linear operators on a Hilbert space. Each such value is also assumed to be invertible. It is shown that these ratios have the form [I + A(ζ)]?1, where, for each ζ in a sufficiently small open cone in the right-half complex plane with apex at the origin and the real axis as its bisector, the numerical range of A(ζ) is contained in a compact subset of the open right-half plane. This implies that the ratios are strictly contractive for each ζ in the cone. The angle of the cone is π(2k + 2), where k is the number of internal nodes of a certain “surrogate” network; this result is best possible. For two-terminal-pair networks the ratios are shown to be strictly contractive for each ζ in a similar cone with angle π(2k + 4).  相似文献   

9.
Two square matrices A and B over a ring R are semisimilar, written A?B, if YAX=B and XBY=A for some (possibly rectangular) matrices X, Y over R. We show that if A and B have the same dimension, and if the ring is a division ring D, then A?B if and only if A2 is similar to B2 and rank(Ak)=rank(Bk), k=1,2,…  相似文献   

10.
A subpolytope Γ of the polytope Ωn of all n×n nonnegative doubly stochastic matrices is said to be a permanental polytope if the permanent function is constant on Γ. Geometrical properties of permanental polytopes are investigated. No matrix of the form 1⊕A where A is in Ω2 is contained in any permanental polytope of Ω3 with positive dimension. There is no 3-dimensional permanental polytope of Ω3, and there is essentially a unique maximal 2-dimensional permanental polytope of Ω3 (a square of side 13). Permanental polytopes of dimension (n2?3n+4)2 are exhibited for each n?4.  相似文献   

11.
For a matrix ARn × n, it is shown that strict positive invariance of a proper cone C ? Rn (that is, etAC/{0} ? int C ?t 0) implies the existence of a certain direct sum decomposition of Rn into A-invariant subspaces. Our results lead to a characterization of the set of initial points which give rise to solution curves that reach S, under the differential equation ? = Ax. Also given is an application in stability theory.  相似文献   

12.
The authors consider irreducible representations π ? N? of a nilpotent Lie group and define a Fourier transform for Schwartz class (and other) functions φ on N by forming the kernels Kφ(x, y) of the trace class operations πφ = ∝Nφ(n)πndn, regarding the π as modeled in L2(Rk) for all π in general position. For a special class of groups they show that the models, and parameters λ labeling the representations in general position, can be chosen so the joint behavior of the kernels Kφ(x, y, λ) can be interpreted in a useful way. The variables (x, y, λ) run through a Zariski open set in Rn, n = dim N. The authors show there is a polynomial map u = A(x, y, λ) that is a birational isomorphism A: Rn → Rn with the following properties. The Fourier transforms F1φ = Kφ(x, y, λ) all factor through A to give “rationalized” Fourier transforms (u) such that ° A = F1φ. On the rationalized parameter space a function f(u) is of the form Fφ = f ? f is Schwartz class on Rn. If polynomial operators T?P(N) are transferred to operators T? on Rn such that F(Tφ) = T?(Fφ), P(N) is transformed isomorphically to P(Rn).  相似文献   

13.
Let?(x1,…,xp) be a polynomial in the variables x1,…,xp with nonnegative real coefficients which sum to one, let A1,…,Ap be stochastic matrices, and let ??(A1,…,Ap) be the stochastic matrix which is obtained from ? by substituting the Kronecker product of An11,…,Anppfor each term Xn11·?·Xnpp. In this paper, we present necessary and sufficient conditions for the Cesàro limit of the sequence of the powers of ??(A1,…,Ap) to be equal to the Kronecker product of the Cesàro limits associated with each of A1,…,Ap. These conditions show that the equality of these two matrices depends only on the number of ergodic sets under??(A1,…,Ap) and?or the cyclic structure of the ergodic sets under A1,…,Ap, respectively. As a special case of these results, we obtain necessary and sufficient conditions for the interchangeability of the Kronecker product and the Cesàro limit operator.  相似文献   

14.
If X1,…,Xn are independent identically distributed Rd-valued random vectors with probability measure μ and empirical probability measure μn, and if a is a subset of the Borel sets on Rd, then we show that P{supAan(A)?μ(A)|≥ε} ≤ cs(a, n2)e?2n2, where c is an explicitly given constant, and s(a, n) is the maximum over all (x1,…,xn) ∈ Rdn of the number of different sets in {{x1…,xn}∩A|Aa}. The bound strengthens a result due to Vapnik and Chervonenkis.  相似文献   

15.
A Dirichlet series associated with a positive definite form of degree δ in n variables is defined by
DF(s,p,α)= α∈Zn?{0}F(α)?s e(ρF(α)+〈α, α〉)
where ? ∈ Q, α ∈ Qn, 〈x, y〉 = x1y1 + ? + xnyn, e(a) = exp (2πia) for aR, and s = σ + ti is a complex number. The author proves that: (1) DF(s, ?, α) has analytic continuation into the whole s-plane, (2) DF(s, ?, α), ? ≠ 0, is a meromorphic function with at most a simple pole at s = nδ. The residue at s = nδ is given explicitly. (3) ? = 0, α ? Zn, DF(s, 0, α) is analytic for α>, n(δ ? 1).  相似文献   

16.
Put Zn = {1, 2,…, n} and let π denote an arbitrary permutation of Zn. Problem I. Let π = (π(1), π(2), …, π(n)). π has an up, down, or fixed point at a according as a < π(a), a > π(a), or a = π(a). Let A(r, s, t) be the number of πZn with r ups, s downs, and t fixed points. Problem II. Consider the triple π?1(a), a, π(a). Let R denote an up and F a down of π and let B(n, r, s) denote the number of πZn with r occurrences of π?1(a)RaRπ(a) and s occurrences of π?1(a)FaFπ(a). Generating functions are obtained for each enumerant as well as for a refinement of the second. In each case use is made of the cycle structure of permutations.  相似文献   

17.
For a positive integer m, let A = {1 ≤ a < m2 | (a, m) = 1} and let n = |A|. For an integer x, let R(x) be the least positive residue of x modulo m and if (x, m) = 1, let x′ be the inverse of x modulo m. If m is odd, then |R(ab′)|a,bA = ?21?n(∏χa = 1m ? 1(a))), where χ runs over all the odd Dirichlet characters modulo m.  相似文献   

18.
The Schur product of two n×n complex matrices A=(aij), B=(bij) is defined by A°B=(aijbij. By a result of Schur [2], the algebra of n×n matrices with Schur product and the usual addition is a commutative Banach algebra under the operator norm (the norm of the operator defined on Cn by the matrix). For a fixed matrix A, the norm of the operator B?A°B on this Banach algebra is called the Schur multiplier norm of A, and is denoted by ∥Am. It is proved here that ∥A∥=∥U1AU∥m for all unitary U (where ∥·∥ denotes the operator norm) iff A is a scalar multiple of a unitary matrix; and that ∥Am=∥A∥ iff there exist two permutations P, Q, a p×p (1?p?n) unitary U, an (n?p)×(n?p)1 contraction C, and a nonnegative number λ such that
A=λPU00CQ;
and this is so iff ∥A°A?∥=∥A∥2, where ā is the matrix obtained by taking entrywise conjugates of A.  相似文献   

19.
We show that any m × n matrix A, over any field, can be written as a product, LSP, of three matrices, where L is a lower triangular matrix with l's on the main diagonal, S is an m × n matrix which reduces to an upper triangular matrix with nonzero diagonal elements when the zero rows are deleted, and P is an n × n permutation matrix. Moreover, L, S, and P can be found in O(mα?1n) time, where the complexity of matrix multiplication is O(mα). We use the LSP decomposition to construct fast algorithms for some important matrix problems. In particular, we develop O(mα?1n) algorithms for the following problems, where A is any m × n matrix: (1) Determine if the system of equations Ax = b (where b is a column vector) has a solution, and if so, find one such solution. (2) Find a generalized inverse, A1, of A (i.e., AA1A = A). (3) Find simultaneously a maximal independent set of rows and a maximal independent set of columns of A.  相似文献   

20.
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).  相似文献   

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

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