共查询到11条相似文献,搜索用时 15 毫秒
1.
Amnon Neeman 《K-Theory》2000,20(2):97-174
Let A and B be Abelian categories. Let H: A B be a bounded -functor. We prove that H induces a natural map in higher K-theory. From a more precise analysis of the proof, we deduce that it is possible to define a K-theory of the bounded derived category of A, which contains Quillen's K-theory of A as a retract. 相似文献
2.
Amnon Neeman 《K-Theory》2001,22(1-2):1-144
Let
be a triangulated category, and assume it admits at least one model. In this article, we define a K-theory for
. The main theorem is that, given any bounded i-structure on
, the K-theory of the heart agrees with the K-theory of
. An immediate consequence tells us that, if two Abelian categories occur as hearts of a triangulated category for two different t-structures, then their K-theories must be isomorphic.The proof was also sketched in previous articles in this series. The virtue of this article is in the careful detail in which it is written down. 相似文献
3.
通过一个例子说明在 [3]中定理 2 .2的证明中用到的一个结论是错误的 ,并给出该定理的一种正确证明。 相似文献
4.
设p_1,p_2,p_3为不同的奇素数,c1是整数.给出了Pell方程组x~2-(c~2-1)y~2=y~2-2p_1p_2p_3z~2=1的所有非负整数解(x,y,z),从而推广了Keskin (2017)和Cipu(2018)等人的结果. 相似文献
5.
利用(G'/G)-展开法求广义的(2+1)维ZK-MEW方程的新精确解 总被引:1,自引:0,他引:1
结合齐次平衡法原理并利用(G'/G)-展开法,研究了广义的(2+1)维ZK-MEW方程的精确解,从而得到了广义的(2+1)维ZK-MEW方程的用双曲函数和三角函数表示的通解,当双曲函数通解中常数取特殊值时,便得到广义的(2+1)维ZK-MEW方程的孤立波解,获得了与现有文献不同的新精确解. 相似文献
6.
We compare the absolute values of the Selberg zeta-function at places symmetric with respect to the line Re(s) = 1/2. We consider Selberg zeta-functions associated to cocompact and modular groups. 相似文献
7.
M. R. DARAFSHEH 《数学学报(英文版)》2008,24(7):1117-1126
The author will prove that the group ^2Dp(3) can be uniquely determined by its order components, where p ≠ 2^m + 1 is a prime number, p ≥ 5. More precisely, if OC(G) denotes the set of order components of G, we will prove OC(G) = OC(^2Dp(3)) if and only if G is isomorphic to ^2Dp(3). A main consequence of our result is the validity of Thompson's conjecture for the groups under consideration. 相似文献
8.
Mariya Ishteva Lieven De Lathauwer P.-A. Absil Sabine Van Huffel 《Numerical Algorithms》2009,51(2):179-194
An increasing number of applications are based on the manipulation of higher-order tensors. In this paper, we derive a differential-geometric
Newton method for computing the best rank-(R
1, R
2, R
3) approximation of a third-order tensor. The generalization to tensors of order higher than three is straightforward. We illustrate
the fast quadratic convergence of the algorithm in a neighborhood of the solution and compare it with the known higher-order
orthogonal iteration (De Lathauwer et al., SIAM J Matrix Anal Appl 21(4):1324–1342, 2000). This kind of algorithms are useful for many problems.
This paper presents research results of the Belgian Network DYSCO (Dynamical Systems, Control, and Optimization), funded by
the Interuniversity Attraction Poles Programme, initiated by the Belgian State, Science Policy Office. The scientific responsibility
rests with its authors. Research supported by: (1) Research Council K.U.Leuven: GOA-Ambiorics, CoE EF/05/006 Optimization
in Engineering (OPTEC), (2) F.W.O.: (a) project G.0321.06, (b) Research Communities ICCoS, ANMMM and MLDM, (3) the Belgian
Federal Science Policy Office: IUAP P6/04 (DYSCO, “Dynamical systems, control and optimization”, 2007–2011), (4) EU: ERNSI.
M. Ishteva is supported by a K.U.Leuven doctoral scholarship (OE/06/25, OE/07/17, OE/08/007), L. De Lathauwer is supported
by “Impulsfinanciering Campus Kortrijk (2007–2012)(CIF1)” and STRT1/08/023. 相似文献
9.
Mohammad Masjed-Jamei 《Proceedings of the American Mathematical Society》2008,136(2):409-417
Some orthogonal functions can be mapped onto other orthogonal functions by the Fourier transform. In this paper, by using the Fourier transform of Stieltjes-Wigert polynomials, we derive a sequence of exponential functions that are biorthogonal with respect to a complex weight function like on . Then we restrict these introduced biorthogonal functions to a special case to obtain a sequence of trigonometric functions orthogonal with respect to the real weight function on .
10.
Jeong-Hyun Kang 《Discrete Mathematics》2018,341(1):96-103
The vertices of Kneser graph are the subsets of of cardinality , two vertices are adjacent if and only if they are disjoint. The square of a graph is defined on the vertex set of with two vertices adjacent if their distance in is at most 2. Z. Füredi, in 2002, proposed the problem of determining the chromatic number of the square of the Kneser graph. The first non-trivial problem arises when . It is believed that where is a constant, and yet the problem remains open. The best known upper bounds are by Kim and Park: for 1 (Kim and Park, 2014) and for (Kim and Park, 2016). In this paper, we develop a new approach to this coloring problem by employing graph homomorphisms, cartesian products of graphs, and linear congruences integrated with combinatorial arguments. These lead to , where is a constant in , depending on . 相似文献
11.
A remark on the existence of entire large and bounded solutions to a (<Emphasis Type="Italic">k</Emphasis><Subscript>1</Subscript>, <Emphasis Type="Italic">k</Emphasis><Subscript>2</Subscript>)-Hessian system with gradient term 下载免费PDF全文
Dragos Patru Covei 《数学学报(英文版)》2017,33(6):761-774
In this paper, we study the existence of positive entire large and bounded radial positive solutions for the following nonlinear system Here \({S_{{k_i}}}\left( {\lambda \left( {{D^2}{u_i}} \right)} \right)\) is the k i -Hessian operator, a 1, p 1, f 1, a 2, p 2 and f 2 are continuous functions.
相似文献
$$\left\{ {\begin{array}{*{20}c}{S_{k_1 } \left( {\lambda \left( {D^2 u_1 } \right)} \right) + a_1 \left( {\left| x \right|} \right)\left| {\nabla u_1 } \right|^{k_1 } = p_1 \left( {\left| x \right|} \right)f_1 \left( {u_2 } \right)} & {for x \in \mathbb{R}^N ,} \\{S_{k_2 } \left( {\lambda \left( {D^2 u_2 } \right)} \right) + a_2 \left( {\left| x \right|} \right)\left| {\nabla u_2 } \right|^{k_2 } = p_2 \left( {\left| x \right|} \right)f_2 \left( {u_1 } \right)} & {for x \in \mathbb{R}^N .} \\\end{array} } \right.$$