Related papers: On product-one sequences over dihedral groups

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…

For modules over group rings we introduce the following numerical parameter. We say that a module A over a ring R has finite r-generator property if each f.g. (finitely generated) R-submodule of A can be generated exactly by r elements and…

We survey the extensions of a group by a group using crossed products instead of exact sequences of groups. The approach has various advantages, one of them being that the crossed product is an universal object. Several new applications are…

Let $G$ be a multiplicatively written finite group. We denote by $\mathsf E(G)$ the smallest integer $t$ such that every sequence of $t$ elements in $G$ contains a product-one subsequence of length $|G|$. In 1961, Erd\H{o}s, Ginzburg and…

An upper bound of composition series of groups of finite order is obtained. The bound is a nontrivial bound and so far best possible.

Given an edge-independent random graph G(n,p), we determine various facts about the cohomology of graph products of groups for the graph G(n,p). In particular, the random graph product of a sequence of finite groups is a rational duality…

Given a subset $S$ of the non-identity elements of the dihedral group of order $2m$, is it possible to order the elements of $S$ so that the partial products are distinct? This is equivalent to the sequenceability of the group when $|S| =…

Suppose $G$ is a simple group. For any nontrivial elements $g$ and $h$, $g$ can be written as a finite product of conjugates of $h$ or the inverse of $h$. G is called uniformly simple if the length of such an expression is uniformly…

Hard to summarize concisely; here are the high points. The first two statements below are ring-theoretic; in these R is a nontrivial ring, R^\omega, and \bigoplus_\omega R are the direct product, respectively direct sum, of countably many…

When G is a finite abelian group, we define G-spans of groupoids and their associated matrices with entries in the group ring QG and show that composition of spans corresponds to multiplication of matrices.

Linear second order recursive sequences with arbitrary initial conditions are studied. For sequences with the same parameters a ring and a group is attached, and isomorphisms and homomorphisms are established for related parameters. In the…

Let $\mathcal{S}$ be a sequence of finite perfect transitive permutation groups with uniformly bounded number of generators. We prove that the infinitely iterated wreath product in product action of the groups in $\mathcal{S}$ is…

In this paper we define Ordered Generating System for finite non-abelian groups, which is a generalization of the basis theorem for finite abelian groups. We prove the following: If each composition factor of a group G has Ordered…

Let $I$ be an infinite set, $\{G_i:i\in I\}$ be a family of (topological) groups and $G=\prod_{i\in I} G_i$ be its direct product. For $J\subseteq I$, $p_{J}: G\to \prod_{j\in J} G_j$ denotes the projection. We say that a subgroup $H$ of…

A unital $\ell$-group $(G,u)$ is an abelian group $G$ equipped with a translation-invariant lattice-order and a distinguished element $u$, called order-unit, whose positive integer multiples eventually dominate each element of $G$. We…

The subgroup pattern of a finite group $G$ is the table of marks of $G$ together with a list of representatives of the conjugacy classes of subgroups of $G$. In this article we describe a collection of sequences realized by the subgroup…

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.

We show that every continuous product system of correspondences over a unital C*-algebra occurs as the product system of a strictly continuous E_0-semigroup.

A commutative monoid $M$ is called a linearly orderable monoid if there exists a total order on $M$ that is compatible with the monoid operation. The finitary power monoid of a commutative monoid $M$ is the monoid consisting of all nonempty…

By using the structure and some properties of extraspecial and generalized/almost extraspecial $p$-groups, we explicitly determine the number of elements of specific orders in such groups. As a consequence, one may find the number of cyclic…