اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدIterated bar complexes and E_n-homology with coefficients
75
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The first author proved in a previous paper that the n-fold bar construction for commutative algebras can be generalized to E_n-algebras, and that one can calculate E_n-homology with trivial coefficients via this iterated bar construction. We extend this result to E_n-homology and E_n-cohomology of a commutative algebra A with coefficients in a symmetric A-bimodule.
قيم البحث
اقرأ أيضاً
Building on work of Livernet and Richter, we prove that E_n-homology and E_n-cohomology of a commutative algebra with coefficients in a symmetric bimodule can be interpreted as functor homology and cohomology. Furthermore we show that the associated Yoneda algebra is trivial.
Persistent homology is a topological feature used in a variety of applications such as generating features for data analysis and penalizing optimization problems. We develop an approach to accelerate persistent homology computations performed on many
similar filtered topological spaces which is based on updating associated matrix factorizations. Our approach improves the update scheme of Cohen-Steiner, Edelsbrunner, and Morozov for permutations by additionally handling addition and deletion of cells in a filtered topological space and by processing changes in a single batch. We show that the complexity of our scheme scales with the number of elementary changes to the filtration which as a result is often less expensive than the full persistent homology computation. Finally, we perform computational experiments demonstrating practical speedups in several situations including feature generation and optimization guided by persistent homology.
Hepworth, Willerton, Leinster and Shulman introduced the magnitude homology groups for enriched categories, in particular, for metric spaces. The purpose of this paper is to describe the magnitude homology group of a metric space in terms of order co
mplexes of posets. In a metric space, an interval (the set of points between two chosen points) has a natural poset structure, which is called the interval poset. Under additional assumptions on sizes of $4$-cuts, we show that the magnitude chain complex can be constructed using tensor products, direct sums and degree shifts from order complexes of interval posets. We give several applications. First, we show the vanishing of higher magnitude homology groups for convex subsets of the Euclidean space. Second, magnitude homology groups carry the information about the diameter of a hole. Third, we construct a finite graph whose $3$rd magnitude homology group has torsion.
In many scientific and technological contexts we have only a poor understanding of the structure and details of appropriate mathematical models. We often, therefore, need to compare different models. With available data we can use formal statistical
model selection to compare and contrast the ability of different mathematical models to describe such data. There is, however, a lack of rigorous methods to compare different models emph{a priori}. Here we develop and illustrate two such approaches that allow us to compare model structures in a systematic way {by representing models in terms of simplicial complexes}. Using well-developed concepts from simplicial algebraic topology, we define a distance between models based on their simplicial representations. Employing persistent homology with a flat filtration provides for alternative representations of the models as persistence intervals, which represent the structure of the models, from which we can also obtain the distances between models. We then expand on this measure of model distance to study the concept of model equivalence in order to determine the conceptual similarity of models. We apply our methodology for model comparison to demonstrate an equivalence between a positional-information model and a Turing-pattern model from developmental biology, constituting a novel observation for two classes of models that were previously regarded as unrelated.
We use factorization homology and higher Hochschild (co)chains to study various problems in algebraic topology and homotopical algebra, notably brane topology, centralizers of $E_n$-algebras maps and iterated bar constructions. In particular, we obta
in an $E_{n+1}$-algebra model on the shifted integral chains of the mapping space of the n-sphere into an orientable closed manifold $M$. We construct and use $E_infty$-Poincare duality to identify higher Hochschild cochains, modeled over the $n$-sphere, with the chains on the above mapping space, and then relate Hochschild cochains to the deformation complex of the $E_infty$-algebra $C^*(M)$, thought of as an $E_n$-algebra. We invoke (and prove) the higher Deligne conjecture to furnish $E_n$-Hochschild cohomology, and all that is naturally equivalent to it, with an $E_{n+1}$-algebra structure. We prove that this construction recovers the sphere product. In fact, our approach to the Deligne conjecture is based on an explicit description of the $E_n$-centralizers of a map of $E_infty$-algebras $f:Ato B$ by relating it to the algebraic structure on Hochschild cochains modeled over spheres, which is of independent interest and explicit. More generally, we give a factorization algebra model/description of the centralizer of any $E_n$-algebra map and a solution of Deligne conjecture. We also apply similar ideas to the iterated bar construction. We obtain factorization algebra models for (iterated) bar construction of augmented $E_m$-algebras together with their $E_n$-coalgebras and $E_{m-n}$-algebra structures, and discuss some of its features. For $E_infty$-algebras we obtain a higher Hochschild chain model, which is an $E_n$-coalgebra. In particular, considering an n-connected topological space $Y$, we obtain a higher Hochschild cochain model of the natural $E_n$-algebra structure of the chains of the iterated loop space of $Y$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
