Related papers: Rewriting Group Products with Transversals
We introduce structured decompositions, category-theoretic structures which simultaneously generalize notions from graph theory (including treewidth, layered treewidth, co-treewidth, graph decomposition width, tree independence number,…
Universality is a key hypothesis in mechanistic interpretability -- that different models learn similar features and circuits when trained on similar tasks. In this work, we study the universality hypothesis by examining how small neural…
Constructor rewriting systems are said to be cons-free if any constructor term occurring in the rhs of a rule must be a subterm of the lhs of the rule. Roughly, such systems cannot build new data structures during their evaluation. In…
A theory is developed which uses "networks" (directed acyclic graphs with some extra structure) as a formalism for expressions in multilinear algebra. It is shown that this formalism is valid for arbitrary PROPs (short for 'PROducts and…
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…
The technique known as group averaging provides powerful machinery for the study of constrained systems. However, it is likely to be well defined only in a limited set of cases. Here, we investigate the possibility of using a `renormalized'…
Let $S \subset \mathbb{Z}^{d}$ be a finitely generated subsemigroup. Let $E$ be a product system over $S$. We show that there exists an infinite dimensional separable Hilbert space $\mathcal{H}$ and a semigroup $\alpha:=\{\alpha_x\}_{x \in…
When S is a discrete subsemigroup of a discrete group G such that G = S^{-1} S, it is possible to extend circle-valued multipliers from S to G; to dilate (projective) isometric representations of S to (projective) unitary representations of…
We prove that if S is a set of functions from a set A to itself, S is closed under composition, and S contains all transpositions of A, then the action of S on Acan be recovered from the semigroup consisting of S together with its…
Rewriting is a formalism widely used in computer science and mathematical logic. The classical formalism has been extended, in the context of functional languages, with an order over the rules and, in the context of rewrite based languages,…
Given a transitive permutation group, a fundamental object for studying its higher transitivity properties is the permutation action of its isotropy subgroup. We reverse this relationship and introduce a universal construction of infinite…
Invariable generation is a topic that has predominantly been studied for finite groups. In 2014, Kantor, Lubotzky, and Shalev produced extensive tools for investigating invariable generation for infinite groups. Since their paper, various…
The recently developed theory of partial actions of discrete groups on $C^*$-algebras is extended. A related concept of actions of inverse semigroups on $C^*$-algebras is defined, including covariant representations and crossed products.…
An element $g$ of a group is called reversible if it is conjugate in the group to its inverse. An element is an involution if it is equal to its inverse. This paper is about factoring elements as products of reversibles in the group…
We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with a family of algebraic laws, and might be useful for more general rewrite systems. These tools consist in introducing a…
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…
The residual closure of a subgroup $H$ of a group $G$ is the intersection of all virtually normal subgroups of $G$ containing $H$. We show that if $G$ is generated by finitely many cosets of $H$ and if $H$ is commensurated, then the…
We introduce a formalism of infinite, linearly ordered products in general groups. Using this, we define infinite compositions in certain groups of formal power series such as transseries. We show that such groups can sometimes be…
Data-to-text generation involves transforming structured data, often represented as predicate-argument tuples, into coherent textual descriptions. Despite recent advances, systems still struggle when confronted with unseen combinations of…
We develop an invariant deformation theory, in a form accessible to practice, for affine schemes $W$ equipped with an action of a reductive algebraic group $G$. Given the defining equations of a $G$-invariant subscheme $X \subset W$, we…