Related papers: Some results on embeddings of algebras, after de B…

In 1963, Greenberg proved that every finite group appears as the monodromy group of some morphism of Riemann surfaces. In this paper, we give two constructive proofs of Greenberg's result. First, we utilize free groups, which given with the…

For a finite simplicial graph $\Gamma$, let $A(\Gamma)$ denote the right-angled Artin group on $\Gamma$. Recently Kim and Koberda introduced the extension graph $\Gamma^e$ for $\Gamma$, and established the Extension Graph Theorem: for…

Let $R=\oplus_{\Gamma\in\Gamma}R_{\gamma}$ be a $\Gamma$-graded $K$-algebra over a field $K$, where $\Gamma$ is a totally ordered semigroup, and let $I$ be an ideal of $R$. Considering the $\Gamma$-grading filtration $FR$ of $R$ and the…

We investigate accessible subgroups of a profinite group $G$, i.e. subgroups $H$ appearing as vertex groups in a graph of profinite groups decomposition of $G$ with finite edge groups. We prove that any accessible subgroup $H \leq G$ arises…

In this paper we consider the existence of dense embeddings of Limit groups in locally compact groups generalizing earlier work of Breuillard, Gelander, Souto and Storm [GBSS] where surface groups were considered. Our main results are…

We show that, for many choices of finite tuples of generators $X = (x_1, \dots , x_d)$ of a tracial von Neumann algebra $(M, \tau)$ satisfying certain decomposition properties (non-primeness, possessing a Cartan subalgebra, or property…

A de Bruijn cycle is a cyclic listing of length A, of a collection of A combinatorial objects, so that each object appears exactly once as a set of consecutive elements in the cycle. In this paper, we show the power of de Bruijn's original…

We provide a fairly large family of amalgamated free product groups $\Gamma=\Gamma_1\ast_{\Sigma}\Gamma_2$ whose amalgam structure can be completely recognized from their von Neumann algebras. Specifically, assume that $\Gamma_i$ is a…

In the theory of combinatorial algebras, there is a sequence of embeddings between Kleene's second model, van Oosten's model, and Scott's graph model. We prove that none of these embeddings can be reversed. We also prove nonembedding…

A $\mu$-algebra is a model of a first order theory that is an extension of the theory of bounded lattices, that comes with pairs of terms $(f,\mu_{x}.f)$ where $\mu_{x}.f$ is axiomatized as the least prefixed point of $f$, whose axioms are…

In 2004, Klavins et al. introduced the use of graph grammars to describe -- and to program -- systems of self-assembly. We show that these graph grammars can be embedded in a graph rewriting characterization of distributed systems that was…

In this paper we classify the maximal subsemigroups of the \emph{full transformation semigroup} $\Omega^\Omega$, which consists of all mappings on the infinite set $\Omega$, containing certain subgroups of the symmetric group $\sym(\Omega)$…

Since its introduction by Symons, the semigroup of maps with restricted range has been studied in the context of transformations on a set, or of linear maps on a vector space. Sets and vector spaces being particular examples of independence…

An algebra $\A$ is said to be an independence algebra if it is a matroid algebra and every map $\al:X\to A$, defined on a basis $X$ of $\A$, can be extended to an endomorphism of $\A$. These algebras are particularly well behaved…

Let $\Omega$ be a $m$-set, where $m>1$, is an integer. The Hamming graph $H(n,m)$, has $\Omega ^{n}$ as its vertex-set, with two vertices are adjacent if and only if they differ in exactly one coordinate. In this paper, we provide a proof…

We determine all factorisations $X=AB$, where $X$ is a finite almost simple group and $A,B$ are core-free subgroups such that $A\cap B$ is cyclic or dihedral. As a main application, we classify the graphs $\Gamma$ admitting an almost simple…

The notion of the quantum automorphism group of a graph was introduced by J. Bichon in 2003 and T. Banica in 2005 respectively. This article explores primarily the quantum automorphism group of a graph $\Gamma$, denoted by…

Marek Kuczma asked in 1980 whether for every positive integer $n,$ there exists a subsemigroup $M$ of a group $G,$ such that $G$ is equal to the $n$-fold product $M\,M^{-1} M\,M^{-1} \dots\,M^{(-1)^{n-1}},$ but not to any proper initial…

In [2] Su Gao proves that the following are equivalent for a countable $M$ (cf. theorem 1.2 too): (I)There is an uncountable model of the Scott sentence of $M$. (II) There exists some $j\in \overline{Aut(M)}\setminus Aut(M)$, where…

The nodes of the de Bruijn graph B(d,3) consist of all strings of length 3, taken from an alphabet of size d, with edges between words which are distinct substrings of a word of length 4. We give an inductive characterization of the maximum…