Cdh descent, cdarc descent, and Milnor excision
نویسندگان
چکیده
منابع مشابه
TORIC VARIETIES, MONOID SCHEMES AND cdh DESCENT
We give conditions for the Mayer-Vietoris property to hold for the algebraic K-theory of blow-up squares of toric varieties and schemes, using the theory of monoid schemes. These conditions are used to relate algebraic K-theory to topological cyclic homology in characteristic p. To achieve our goals, we develop many notions for monoid schemes based on classical algebraic geometry, such as separ...
متن کاملPro cdh-descent for cyclic homology and K-theory
In this paper we prove that cyclic homology, topological cyclic homology, and algebraic K-theory satisfy a pro Mayer–Vietoris property with respect to abstract blow-up squares of varieties, in both zero and finite characteristic. This may be interpreted as the well-definedness of K-theory with compact support.
متن کاملOn descent for coalgebras and type transformations
We find a criterion for a morphism of coalgebras over a Barr-exact category to be effective descent and determine (effective) descent morphisms for coalgebras over toposes in some cases. Also, we study some exactness properties of endofunctors of arbitrary categories in connection with natural transformations between them as well as those of functors that these transformations induce between co...
متن کاملHandwritten Character Recognition using Modified Gradient Descent Technique of Neural Networks and Representation of Conjugate Descent for Training Patterns
The purpose of this study is to analyze the performance of Back propagation algorithm with changing training patterns and the second momentum term in feed forward neural networks. This analysis is conducted on 250 different words of three small letters from the English alphabet. These words are presented to two vertical segmentation programs which are designed in MATLAB and based on portions (1...
متن کاملPenalized Bregman Divergence Estimation via Coordinate Descent
Variable selection via penalized estimation is appealing for dimension reduction. For penalized linear regression, Efron, et al. (2004) introduced the LARS algorithm. Recently, the coordinate descent (CD) algorithm was developed by Friedman, et al. (2007) for penalized linear regression and penalized logistic regression and was shown to gain computational superiority. This paper explores...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematische Annalen
سال: 2020
ISSN: 0025-5831,1432-1807
DOI: 10.1007/s00208-020-02083-5