Related papers: Crossed Product of Cyclic Groups

A group $G$ is called logically cyclic, if it contains an element $s$ such that every element of $G$ can be defined by a first order formula with parameter $s$. The aim of this paper is to investigate the structure of such groups.

Let $G$ be a finite group. Define a graph on the set $G^{\#} = G \setminus \{ 1 \}$ by declaring distinct elements $x,y\in G^{\#}$ to be adjacent if and only if $\langle x,y\rangle$ is cyclic. Denote this graph by $\Delta(G)$. The graph…

The 2-categories of strict 2-groups and crossed modules are introduced and their 2-equivalence is made explicit.

Generalizing Krieger's finite generation theorem, we give conditions for an ergodic system to be generated by a pair of partitions, each required to be measurable with respect to a given sub-algebra, and also required to have a fixed size.

Groups, in which every subgroup containing some fixed primary cyclic subgroup has a complement, are investigated.

For a free partial action of a group in a set we realize the associated partial skew group ring as an algebra of functions with finite support over an equivalence relation and we use this result to characterize the ideals in the partial…

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…

We construct the crossed product of a C(X)-algebra by an endomorphism, in such a way that it becomes induced by a Hilbert C(X)-bimodule. Furthermore we introduce the notion of C(X)-category, and discuss relationships with crossed products…

It is shown that quantum Euclidean groups $E_q(2)$, $E_\kappa(2)$ and $E_\kappa(3)$ have the structure of generalised crossed products.

A classification of the ways in which an element of a free group can be expressed as a product of commutators or as a product of squares is given. This is then applied to some particular classes of elements. Finally, a question about…

We develop a theory of crossed products by "actions" of Hecke pairs $(G, \Gamma)$, motivated by applications in non-abelian $C^*$-duality. Our approach gives back the usual crossed product construction whenever $G / \Gamma$ is a group and…

Families of codes such as group codes, constacyclic and skew cyclic codes, some of which independently suggested in the literature, turn out to be special instances of the general family of crossed product codes. Hamming-metric is a main…

The concept of a crossed tensor product of algebras is studied from a few points of views. Some related constructions are considered. Crossed enveloping algebras and their representations are discussed. Applications to the noncommutative…

The category of crossed complexes gives an algebraic model of the category of $CW$-complexes and cellular maps. We explain basic results on crossed complexes which allow the computation of free crossed resolutions of graph products of…

Given groupoids $G$ and $H$ and a $(G,H)$-equivalence $X$ we may form the transformation groupoid $G\ltimes X\rtimes H$. Given a separable groupoid dynamical system $(A,G\ltimes X\rtimes H,\omega)$ we may restrict $\omega$ to an action of…

Cyclic words are equivalence classes of cyclic permutations of ordinary words. When a group is given by a rewriting relation, a rewriting system on cyclic words is induced, which is used to construct algorithms to find minimal length…

In this paper, we elaborate ring theoretic properties of nodal orders. In particular, we prove that they are closed under taking crossed products with finite groups.

Starting from an arbitrary endomorphism \delta of a unital C*-algebra A we construct a crossed product. It is shown that the natural construction depends not only on the C*-dynamical system (A,\delta) but also on the choice of an ideal J…

We determine all the ways in which a direct product of two finite groups can be expressed as the set-theoretical union of proper subgroups in a family of minimal cardinality.

Motivated by computational efficiency in algebraic automata theory here we define the cascade product of permutation groups as an external product, as a generic extension. It is the most general hierarchical product that uses arbitrary…