首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 961 毫秒
1.
It is shown that an arbitrary function from D ?Rn to Rm will become C0,α-continuous in almost every x ∈ D after restriction to a certain subset with limit point x. For n ≥ m differentiability can be ob...  相似文献   

2.
Let KK denote an algebraically closed field of characteristic zero. Let V   denote a vector space over KK with finite positive dimension. By a Leonard triple on V we mean an ordered triple of linear transformations A  , A?A?, AεAε in End(V)End(V) such that for each B∈{A,A?,Aε}B{A,A?,Aε} there exists a basis for V with respect to which the matrix representing B   is diagonal and the matrices representing the other two linear transformations are irreducible tridiagonal. In this paper we define a family of Leonard triples said to have Racah type and classify them up to isomorphism. Moreover, we show that each of them satisfies the Z3Z3-symmetric Askey–Wilson relations. As an application, we construct all Leonard triples that have Racah type from the universal enveloping algebra U(sl2)U(sl2).  相似文献   

3.
It is well known that if a matrix A∈Cn×nACn×n solves the matrix equation f(A,AH)=0f(A,AH)=0, where f(x,y)f(x,y) is a linear bivariate polynomial, then A is normal; A   and AHAH can be simultaneously reduced in a finite number of operations to tridiagonal form by a unitary congruence and, moreover, the spectrum of A is located on a straight line in the complex plane. In this paper we present some generalizations of these properties for almost normal matrices which satisfy certain quadratic matrix equations arising in the study of structured eigenvalue problems for perturbed Hermitian and unitary matrices.  相似文献   

4.
In this paper, we consider matrices with entries from a semiring S. We first discuss some generalized inverses of rectangular and square matrices. We establish necessary and sufficient conditions for the existence of the Moore–Penrose inverse of a regular matrix. For an m×nm×n matrix A  , an n×mn×m matrix P and a square matrix Q of order m, we present necessary and sufficient conditions for the existence of the group inverse of QAP   with the additional property that P(QAP)#QP(QAP)#Q is a {1,2}{1,2} inverse of A  . The matrix product used here is the usual matrix multiplication. The result provides a method for generating elements in the set of {1,2}{1,2} inverses of an m×nm×n matrix A starting from an initial {1} inverse of A  . We also establish a criterion for the existence of the group inverse of a regular square matrix. We then consider a semiring structure (Mm×n(S),+,°)(Mm×n(S),+,°) made up of m×nm×n matrices with the addition defined entry-wise and the multiplication defined as in the case of the Hadamard product of complex matrices. In the semiring (Mm×n(S),+,°)(Mm×n(S),+,°), we present criteria for the existence of the Drazin inverse and the Moore–Penrose inverse of an m×nm×n matrix. When S is commutative, we show that the Hadamard product preserves the Hermitian property, and provide a Schur-type product theorem for the product A°(CC?)A°(CC?) of a positive semidefinite n×nn×n matrix A   and an n×nn×n matrix C.  相似文献   

5.
For any symmetric function f:Rn?Rnf:Rn?Rn, one can define a corresponding function on the space of n×nn×n real symmetric matrices by applying ff to the eigenvalues of the spectral decomposition. We show that this matrix valued function inherits from ff the properties of continuity, Lipschitz continuity, strict continuity, directional differentiability, Frechet differentiability, continuous differentiability.  相似文献   

6.
7.
8.
Let A and B   be commutative rings with identity, f:A→Bf:AB a ring homomorphism and J an ideal of B  . Then the subring A?fJ:={(a,f(a)+j)|a∈A and j∈J}A?fJ:={(a,f(a)+j)|aA and jJ} of A×BA×B is called the amalgamation of A with B along with J with respect to f. In this paper, we investigate a general concept of the Noetherian property, called the S  -Noetherian property which was introduced by Anderson and Dumitrescu, on the ring A?fJA?fJ for a multiplicative subset S   of A?fJA?fJ. As particular cases of the amalgamation, we also devote to study the transfers of the S  -Noetherian property to the constructions D+(X1,…,Xn)E[X1,…,Xn]D+(X1,,Xn)E[X1,,Xn] and D+(X1,…,Xn)E?X1,…,Xn?D+(X1,,Xn)E?X1,,Xn? and Nagata?s idealization.  相似文献   

9.
A net (xα)(xα) in a vector lattice X   is said to be unbounded order convergent (or uo-convergent, for short) to x∈XxX if the net (|xα−x|∧y)(|xαx|y) converges to 0 in order for all y∈X+yX+. In this paper, we study unbounded order convergence in dual spaces of Banach lattices. Let X   be a Banach lattice. We prove that every norm bounded uo-convergent net in X?X? is w?w?-convergent iff X   has order continuous norm, and that every w?w?-convergent net in X?X? is uo-convergent iff X is atomic with order continuous norm. We also characterize among σ  -order complete Banach lattices the spaces in whose dual space every simultaneously uo- and w?w?-convergent sequence converges weakly/in norm.  相似文献   

10.
11.
12.
In Huang et al.  [17] it was proved that for any Nild  Bohr0-set AA, there are a minimal system (X,T)(X,T) and a non-empty open subset UU of XX with A⊃{n∈Z:U∩T−nU∩?∩T−dnU≠0?}A{nZ:UTnU?TdnU0?}, and for any minimal system (X,T)(X,T) and any open non-empty U⊂XUX, the set {n∈Z:U∩T−nU∩?∩T−dnU≠0?}{nZ:UTnU?TdnU0?} is an almost Nild Bohr0-set. The polynomial form of this problem is considered in this paper. It is shown that the latter is still true in the polynomial case, while the former is not in general. We also consider the special case when the system is a nilsystem.  相似文献   

13.
A method for computing the inverse of an (n×n)(n×n) integer matrix AA using pp-adic approximation is given. The method is similar to Dixon’s algorithm, but ours has a quadratic convergence rate. The complexity of this algorithm (without using FFT or fast matrix multiplication) is O(n4(logn)2)O(n4(logn)2), the same as that of Dixon’s algorithm. However, experiments show that our method is faster. This is because our methods decrease the number of matrix multiplications but increase the digits of the components of the matrix, which suits modern CPUs with fast integer multiplication instructions.  相似文献   

14.
15.
We study the problem (−Δ)su=λeu(Δ)su=λeu in a bounded domain Ω⊂RnΩRn, where λ   is a positive parameter. More precisely, we study the regularity of the extremal solution to this problem. Our main result yields the boundedness of the extremal solution in dimensions n≤7n7 for all s∈(0,1)s(0,1) whenever Ω   is, for every i=1,...,ni=1,...,n, convex in the xixi-direction and symmetric with respect to {xi=0}{xi=0}. The same holds if n=8n=8 and s?0.28206...s?0.28206..., or if n=9n=9 and s?0.63237...s?0.63237.... These results are new even in the unit ball Ω=B1Ω=B1.  相似文献   

16.
17.
18.
Roe algebras are C?C?-algebras built using large scale (or ‘coarse’) aspects of a metric space (X,d)(X,d). In the special case that X=ΓX=Γ is a finitely generated group and d   is a word metric, the simplest Roe algebra associated to (Γ,d)(Γ,d) is isomorphic to the crossed product C?C?-algebra l(Γ)?rΓl(Γ)?rΓ.  相似文献   

19.
A plane partition   is a p×qp×q matrix A=(aij)A=(aij), where 1?i?p1?i?p and 1?j?q1?j?q, with non-negative integer entries, and whose rows and columns are weakly decreasing. From a geometric point of view plane partitions are equivalent to pyramids  , subsets of the integer lattice Z3Z3 which play an important role in Discrete Tomography. As a consequence, some typical problems concerning the tomography of discrete lattice sets can be rephrased and considered via plane partitions. In this paper we focus on some of them. In particular, we get a necessary and sufficient condition for additivity, a canonical procedure for checking the existence of (weakly) bad configurations, and an algorithm which constructs minimal pyramids (with respect to the number of levels) with assigned projection of a bad configurations.  相似文献   

20.
We provide a number of simplified and improved separations between pairs of Resolution-with-bounded-conjunction refutation systems, Res(d)Res(d), as well as their tree-like versions, Res?(d)Res?(d). The contradictions we use are natural combinatorial principles: the Least number principle  , LNPnLNPn and an ordered variant thereof, the Induction principle  , IPnIPn.  相似文献   

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

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