Related papers: SgpDec: Cascade (De)Compositions of Finite Transfo…

We develop a new algebraic framework to reason about languages of Mazurkiewicz traces. This framework supports true concurrency and provides a non-trivial generalization of the wreath product operation to the trace setting. A novel local…

We present Decapodes, a diagrammatic tool for representing, composing, and solving partial differential equations. Decapodes provides an intuitive diagrammatic representation of the relationships between variables in a system of equations,…

We give an introduction to the Mathematica package Lambda, designed for calculating $\lambda$-brackets in both vertex algebras, and in SUSY vertex algebras. This is equivalent to calculating operator product expansions in two-dimensional…

Subgroups of the symmetric group $S_n$ act on powers of chains $C^n$ by permuting coordinates, and induce automorphisms of the ordered sets $C^n$. The quotients defined are candidates for symmetric chain decompositions. We establish this…

For an arbitrary commutative ring k and t in k, we construct a 2-functor S_t which sends a tensor category to a new tensor category. By applying it to the representation category of a bialgebra we obtain a family of categories which…

In [F. Caselli, Involutory reflection groups and their models, J. Algebra 24 (2010), 370--393] it is constructed a uniform Gelfand model for all non-exceptional irreducible complex reflection groups which are involutory. This model can be…

In analogy to the disjoint cycle decomposition in permutation groups, Ore and Specht define a decomposition of elements of the full monomial group and exploit this to describe conjugacy classes and centralisers of elements in the full…

First of all, we recall the well known notion of semidirect product both for classical algebraic structures (like groups and rings) and for more recent ones (digroups, left skew braces, heaps, trusses). Then we analyse the concept of…

The package numericalsgps performs computations with and for numerical semigroups. Recently also affine semigroups are admitted as objects for calculations. This manuscript is a survey of what the package does, and at the same time of the…

We describe explicitly the algebraic structure of the Terwilliger algebra of wreath products of cyclic schemes.

We develop a theory of semidirect products of partial groups and localities. Our concepts generalize the notions of direct products of partial groups and localities, and of semidirect products of groups.

We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…

We describe an algorithm for computing the complete set of primitive orthogonal idempotents in the centralizer ring of the permutation representation of a wreath product. This set of idempotents determines the decomposition of the…

The paper presents a construction of the crossed product of a C*-algebra by a semigroup of endomorphisms generated by partial isometries.

We define and study a notion of free wreath product with amalgamation for compact quantum groups. These objects were already introduced in the case of duals of discrete groups under the name "free wreath products of pairs" in a previous…

We apply the method of iterated inflations to show that the wreath product of a cellular algebra with a symmetric group is cellular, and obtain descriptions of the cell and simple modules together with a semisimplicity condition for such…

We consider group-subgroup pairs in which the group is a semidirect product and the subgroup is contained in the normal part. We give conditions for the pair to be a Hecke pair and we show that the enveloping Hecke algebra and Hecke…

This article is intended to an introductory lecture in material physics, in which the modern computational group theory and the electronic structure calculation are in collaboration. The effort of mathematicians in field of the group…

We survey results concerning automatic structures for semigroup constructions, providing references and describing the corresponding automatic structures. The constructions we consider are: free products, direct products, Rees matrix…

The structure of transformation semigroups on a finite set is analyzed by introducing a hierarchy of functions mapping subsets to subsets. The resulting hierarchy of semigroups has a corresponding hierarchy of minimal ideals, or kernels.…