共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
3.
4.
We introduce (n+1)-preprojective algebras of algebras of global dimension n. We show that if an algebra is n-representation-finite then its (n+1)-preprojective algebra is self-injective. In this situation, we show that the stable module category of the (n+1)-preprojective algebra is (n+1)-Calabi–Yau, and, more precisely, it is the (n+1)-Amiot cluster category of the stable n-Auslander algebra of the original algebra. In particular this stable category contains an (n+1)-cluster tilting object. We show that even if the (n+1)-preprojective algebra is not self-injective, under certain assumptions (which are always satisfied for n∈{1,2}) the results above still hold for the stable category of Cohen–Macaulay modules. 相似文献
5.
7.
8.
9.
This paper introduces a notion of regularity of t=-∞ for the diffusion (or heat) equation and establishes a necessary and sufficient condition for the existence of a unique bounded solution to the first boundary value problem for the diffusion equation in a general domain Ω⊂RN+1 which extends up to t=-∞. 相似文献
10.
11.
12.
13.
Let η be a non-zero scalar. In this paper, we investigate a bijective map ? between two von Neumann algebras, one of which has no central abelian projections, satisfying ?(AB+ηBA∗)=?(A)?(B)+η?(B)?(A)∗ for all A,B in the domain. It is showed that ? is a linear *-isomorphism if η is not real and ? is a sum of a linear *-isomorphism and a conjugate linear *-isomorphism if η is real. 相似文献
14.
In this paper, the approximation characteristic of a diagonal matrix in probabilistic and average case settings is investigated. And the asymptotic degree of the probabilistic linear (n,δ)-width and p-average linear n-width of diagonal matrix M are determined. 相似文献
15.
The Moore–Penrose inverse of an arbitrary matrix (including singular and rectangular) has many applications in statistics, prediction theory, control system analysis, curve fitting and numerical analysis. In this paper, an algorithm based on the conjugate Gram–Schmidt process and the Moore–Penrose inverse of partitioned matrices is proposed for computing the pseudoinverse of an m×n real matrix A with m≥n and rank r≤n. Numerical experiments show that the resulting pseudoinverse matrix is reasonably accurate and its computation time is significantly less than that of pseudoinverses obtained by the other methods for large sparse matrices. 相似文献
16.
17.
18.
19.
20.
We conjecture that the balanced complete bipartite graph K⌊n/2⌋,⌈n/2⌉ contains more cycles than any other n-vertex triangle-free graph, and we make some progress toward proving this. We give equivalent conditions for cycle-maximal triangle-free graphs; show bounds on the numbers of cycles in graphs depending on numbers of vertices and edges, girth, and homomorphisms to small fixed graphs; and use the bounds to show that among regular graphs, the conjecture holds. We also consider graphs that are close to being regular, with the minimum and maximum degrees differing by at most a positive integer k. For k=1, we show that any such counterexamples have n≤91 and are not homomorphic to C5; and for any fixed k there exists a finite upper bound on the number of vertices in a counterexample. Finally, we describe an algorithm for efficiently computing the matrix permanent (a #P-complete problem in general) in a special case used by our bounds. 相似文献