Related papers: Free crossed resolutions for graph products of gro…
We describe an algebraic chain level construction that models the passage from an arbitrary topological space to its free loop space. The input of the construction is a categorical coalgebra, i.e. a curved coalgebra satisfying certain…
The complexity of a graph is the number of its labeled spanning trees. In this work complexity is studied in settings that admit regular graphs. An exact formula is established linking complexity of the complement of a regular graph to…
Cell complexes (CCs) are a higher-order network model deeply rooted in algebraic topology that has gained interest in signal processing and network science recently. However, while the processing of signals supported on CCs can be described…
Categorical probability has recently seen significant advances through the formalism of Markov categories, within which several classical theorems have been proven in entirely abstract categorical terms. Closely related to Markov categories…
The paper presents a construction of the crossed product of a C*-algebra by a semigroup of endomorphisms generated by partial isometries.
We obtain a complete classification of graph products of finite abelian groups whose Cayley graphs with respect to the standard presentations are planar.
Given an algebra A, presented by generators and relations, i.e. as a quotient of a tensor algebra by an ideal, we construct a free algebra resolution of A, i.e. a differential graded algebra which is quasi-isomorphic to A and which is…
One can iteratively obtain a free resolution of any monomial ideal $I$ by considering the mapping cone of the map of complexes associated to adding one generator at a time. Herzog and Takayama have shown that this procedure yields a minimal…
We define the twisted tensor product of two enriched categories, which generalizes various sorts of `products' of algebraic structures, including the bicrossed product of groups, the twisted tensor product of (co)algebras and the double…
Using non-selfadjoint techniques, we establish the Hao-Ng isomorphism for the reduced crossed product and all discrete groups. For the full crossed product an analogous result holds for all discrete groups but the C*-correspondences…
For any central simple algebra over a field F which contains a maximal subfield M with non-trivial F-automorphism group G, G is solvable if and only if the algebra contains a finite chain of subalgebras which are generalized cyclic algebras…
We consider a family of dynamical systems (A,alpha,L) in which alpha is an endomorphism of a C*-algebra A and L is a transfer operator for \alpha. We extend Exel's construction of a crossed product to cover non-unital algebras A, and show…
We obtain deformations of a crossed product of a polynomial algebra with a group, under some conditions, from universal deformation formulas. We show that the resulting deformations are nontrivial by a comparison with Hochschild cohomology.…
The affine group schemes of automorphisms of the multilinear r-fold cross products on finite-dimensional vectors spaces over fields of characteristic not two are determined. Gradings by abelian groups on these structures, that correspond to…
A free wreath product construction of a Hopf algebra (or of a Woronowicz algebra) by Wang's quantum permutation group is done. It provides new examples of quantum groups and is useful to describe the quantum automorphism group of the…
In this article, we consider a twisted partial action $\alpha$ of a group $G$ on a ring $R$ and it is associated partial crossed product $R*_{\alpha}^wG$. We study necessary and sufficient conditions for the commutativity and simplicity of…
We present a general algorithm for constructing a free resolution for unit groups of orders in semisimple rational algebras. The approach is based on computing a contractible $G$-complex employing the theory of minimal classes of quadratic…
The aim of this paper is to explain how, through the work of a number of people, some algebraic structures related to groupoids have yielded algebraic descriptions of homotopy n-types. Further, these descriptions are explicit, and in some…
We generalize some homotopy calculation techniques such as splittings and matching trees that are introduced for the computations in the case of the independence complexes of graphs to arbitrary simplicial complexes, and exemplify their…
Graph independence (also known as $\epsilon$-independence or $\lambda$-independence) is a mixture of classical independence and free independence corresponding to graph products or groups and operator algebras. Using conjugation by certain…