Related papers: Free crossed resolutions for graph products of gro…

We present quantum complexity lower and upper bounds for independent set problems in graphs. In particular, we give quantum algorithms for computing a maximal and a maximum independent set in a graph. We present applications of these…

We study the C*-algebra crossed-product of the closed unit disk by the action of one of its conformal automorphisms. After classifying the conformal automorphisms up to topological conjugacy, we investigate, for each class, the irreducible…

The aim of this paper is to define the notion of lifting of a crossed module via a group morphism and give some properties of this type of the lifting. Further we obtain a criterion for a crossed module to have a lifting of crossed module.…

We investigate Cayley graphs of graph products by showing that graph products with vertex groups that have isomorphic Cayley graphs yield isomorphic Cayley graphs.

Let G be a group and let P be a subsemigroup of G. In order to describe the crossed product of a C*-algebra A by an action of P by unital endomorphisms we find that we must extend the action to the whole group G. This extension fits into a…

We introduce a new class of graded rings extending the class of generalized Weyl algebras. These rings are orders in crossed products of the most general type, and we introduce their basic structure theory. We provide an extensive list of…

In this paper we study the classifying spaces of graph products of simplicial groups and connected Hopf algebras over a field, and show that they can be uniformly treated under the framework of polyhedral products. It turns out that these…

In this paper we analyse for a $G$-$C^{*}$-algebra $A$ to which extent one can calculate the $K$-theory of the reduced crossed product $K(A\rtimes_{r}G)$ from the $K$-theory spectrum $K(A)$ with the induced $G$-action. We also consider some…

We construct an efficient model for graphs of finitely generated subgroups of free groups. Using this we give a very short proof of Dicks's reformulation of the strengthened Hanna Neumann Conjecture as the Amalgamated Graph Conjecture. In…

Let $\Gamma$ be a finite graph together with a group $G_v$ at each vertex $v$. The graph product $G(\Gamma)$ is obtained from the free product of all $G_v$ by factoring out by the normal subgroup generated by $\{g^{-1}h^{-1}gh; g\in G_v,…

Given two associative algebras A, C and a linear space V together with some linear maps R_1, R_2, R_3, E satisfying some conditions, we define an associative algebra structure on A\otimes V\otimes C called a two-sided crossed product.…

This paper gives necessary and sufficient conditions that the free product with amalgamation of circularly-ordered groups admit a circular ordering extending the given orderings of the factors. Our result follows from establishing a…

We define a notion of free product for coarse spaces that generalizes the corresponding notion of a free product for groups. We show that free products preserve coarse properties such as coarse property C, finite coarse decomposition…

In this article, we introduce the notion of a wedge of graphs and provide detailed computations for the independence complex of a wedge of path and cycle graphs. In particular, we show that these complexes are either contractible or wedges…

Given a partial action \alpha of a group G on an associative algebra A we consider the crossed product A x_\alpha G. Using the algebras of multipliers of ideals of A we prove that A x_\alpha G is associative, provided that all ideals of A…

A self-contained exposition is given of the topological and Galois-theoretic properties of the category of combinatorial 1-complexes, or graphs, very much in the spirit of Stallings. A number of classical, as well as some new results about…

In this paper we first state the classification of the prolongations of complex free fundamental graded Lie algebras. Next we introduce the notion of free pseudo-product fundamental graded Lie algebras and study the prolongations of complex…

In this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the…

In this study, internal categories in the category of the crossed modules are characterized and it has been shown that there is a natural equivalence between the category of the crossed modules over crossed modules, i.e. crossed squares,…

We introduce a category of dual pairs of finite locally free algebras over a ring. This gives an efficient way to represent finite locally free commutative group schemes. We give a number of algorithms to compute with dual pairs of…