相关论文: Sets of universal sequences for the symmetric grou…
In this paper we introduce a new notion of a sequence of symmetry groups of an infinite word. Given a subgroup $G_n$ of the symmetric group $S_n$, it acts on the set of finite words of length $n$ by permutation. We associate to an infinite…
Recently George Bergman proved that the symmetric group of an infinite set possesses the following property which we call by the {\it universality of finite width}: given any generating set $X$ of the symmetric group of an infinite set…
A totally symmetric set is a finite subset of a group for which any permutation of the elements can be realized by conjugation in the ambient group. Such sets are rigid under homomorphisms, and so exert a great deal of control over the…
The symmetric inverse monoid $I_X$ on a set $X$ consists of all bijective functions whose domain and range are subsets of $X$ under the usual composition and inversion of partial functions. For an arbitrary infinite set $X$, we classify all…
Error: Peer-review process exposed an error in Theorem 1 that, unfourtunately, is not repairable. Idempotent semigroups are always finite. See Green and Rees [1952], Siekmann and Szab\'o [1981] for details Anti-unification is a fundamental…
For a given inverse semigroup, one can associate an \'etale groupoid which is called the universal groupoid. Our motivation is studying the relation between inverse semigroups and associated \'etale groupoids. In this paper, we focus on…
A set $I$ is said to be a universal indifferent set for $1$-genericity if for every $1$-generic $G$ and for all $X \subseteq I$, $G \Delta X$ is also $1$-generic. Miller showed that there is no infinite universal indifferent set for…
In this thesis we study the subsemigroup structure of the symmetric inverse monoid $I_X$, the inverse semigroup of bijections between subsets of the set $X$, when $X$ is an infinite set. We explore three different approaches to this task.…
We prove a general multidimensional invariance principle for a family of U-statistics based on freely independent non-commutative random variables of the type $U_n(S)$, where $U_n(x)$ is the $n$-th Chebyshev polynomial and $S$ is a standard…
Let $<X>$ be the free monoid on a generating set $X$, and suppose one adjoins to $<X>$ universal 2-sided inverses to a finite set $S$ of its elements. We note an elementary algorithm which yields a normal form for elements of the resulting…
We prove that the monoidal 2-category of cospans of finite linear orders and surjections is the universal monoidal category with an object X with a semigroup and a cosemigroup structures, where the two structures satisfy a certain…
Given a $\Gamma$-semigroup $S$, we construct a semigroup $\Sigma$ in such a way that one sided ideals and quasi-ideals of $S$ can be regarded as one sided ideals and quasi-ideals respectively of $\Sigma$. This correspondence and other…
Let $S$ be a semigroup (written multiplicatively). Endowed with the operation of setwise multiplication induced by $S$ on its parts, the non-empty subsets of $S$ form themselves a semigroup, denoted by $\mathcal P(S)$. Accordingly, we say…
In this note we prove a selection of commutativity theorems for various classes of semigroups. For instance, if in a separative or completely regular semigroup $S$ we have $x^p y^p = y^p x^p$ and $x^q y^q = y^q x^q$ for all $x,y\in S$ where…
This paper considers universal Hilbert space operators in the sense of Rota, and gives criteria for universality of semigroups in the context of uniformly continuous semigroups and contraction semigroups. Specific examples are given.…
We present some Markovian approaches to prove universality results for some functions on the symmetric group. Some of those statistics are already studied in [Kammoun, 2018, 2020] but not the general case. We prove, in particular, that the…
Solomonoff's uncomputable universal prediction scheme $\xi$ allows to predict the next symbol $x_k$ of a sequence $x_1...x_{k-1}$ for any Turing computable, but otherwise unknown, probabilistic environment $\mu$. This scheme will be…
In this study, it is proven that the universal equivalence of general linear groups (admitting the inverse-transpose automorphism) of orders greater than $2$, over local, not necessarily commutative rings with $1/2$, is equivalent to the…
$ $We study solutions of difference equations in the rings of sequences and, more generally, solutions of equations with a monoid action in the ring of sequences indexed by the monoid. This framework includes, for example, difference…
Let S=Sym(\Omega) be the group of all permutations of an infinite set \Omega. Extending an argument of Macpherson and Neumann, it is shown that if U is a generating set for S as a group, respectively as a monoid, then there exists a…