Related papers: Rewriting Group Products with Transversals

We construct a commutative version of the group ring and show that it allows one to translate questions about the normal generation of groups into questions about the generation of ideals in commutative rings. We demonstrate this with an…

We introduce some deformations of the biset category and prove a semisimplicity property. We also consider another group category, called the subgroup category, whose morphisms are subgroups of direct products, the composition being star…

We introduce the concept of an extension of a semilattice of groups $A$ by a group $G$ and describe all the extensions of this type which are equivalent to the crossed products $A*_\Theta G$ by twisted partial actions $\Theta$ of $G$ on…

A regular sampling theory in a multiply generated unitary invariant subspace of a separable Hilbert space $\mathcal{H}$ is proposed. This subspace is associated to a unitary representation of a countable discrete abelian group $G$ on…

Compositional generalization is one of the main properties which differentiates lexical learning in humans from state-of-art neural networks. We propose a general framework for building models that can generalize compositionally using the…

Consider a tree $\mathbb T$, all whose vertices have countable valence; its boundary is the Baire space $\mathbb{B} \simeq\mathbb{N}^{\mathbb N}$; continued fractions expansions identify the set of irrational numbers $\mathbb{R}\setminus…

An element of a group is called \emph{reversible} if it is conjugate to its inverse, and \emph{strongly reversible} if it can be expressed as a product of two involutions. We study strongly reversible elements in the Riordan group and in…

Polygraphs are a higher-dimensional generalization of the notion of directed graph. Based on those as unifying concept, this monograph on polygraphs revisits the theory of rewriting in the context of strict higher categories, adopting the…

We propose a general conjecture on decompositions of finite simple groups as products of conjugates of an arbitrary subset. We prove this conjecture for bounded subsets of arbitrary finite simple groups, and for large subsets of groups of…

Man-made 3D shapes are naturally organized in parts and hierarchies; such structures provide important constraints for shape reconstruction and generation. Modeling shape structures is difficult, because there can be multiple hierarchies…

A rewriting system is a set of equations over a given set of terms called rules that characterize a system of computation and is a powerful general method for providing decision procedures of equational theories, based upon the principle of…

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.…

In this paper, a connection between rewriting systems and embedding of monoids in groups is found. We show that if a group with a positive presentation has a complete rewriting system $\Re$ that satisfies the condition that each rule in…

Let $G$ be a finite group and $H$ be a subgroup of $G$. In this paper, we prove that if $G$ is a finite nilpotent group and $H$ a subgroup of $G$, then $H$ is normal in $G$ if and only if all normalized right transversals of $H$ in $G$ are…

An element $g$ in a group $G$ is called \emph{reciprocal} if there exists $h \in G$ such that $g^{-1}=hgh^{-1}$. The reciprocal elements are also known as `real elements' or `reversible elements' in the literature. We classify the…

In this paper, we study how graph transformations based on sesqui-pushout rewriting can be reversed and how the composition of rewrites can be constructed. We illustrate how such reversibility and composition can be used to design an audit…

In the nonabelian tensor product $G\otimes H$ of two groups $G$ and $H$ many properties pass from $G$ and $H$ to $G\otimes H$. There is a wide literature for different properties involved in this passage. We look at weak conditions for…

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…

The authors continue a series of articles studying certain unitary representations of the Richard Thompson groups $F,T,V$ called Pythagorean. They all extend to the Cuntz algebra $\mathcal{O}$ and conversely all representations of…

In this paper we study rewriting systems for groups and monoids, focusing on situations where finite convergent systems may be difficult to find or do not exist. We consider systems which have no length increasing rules and are confluent…