Related papers: Random ubiquitous transformation semigroups
The residual finiteness growth $\text{RF}_G: \mathbb{N} \to \mathbb{N}$ of a finitely generated group $G$ is a function that gives the smallest value of the index $[G:N]$ with $N$ a normal subgroup not containing a non-trivial element $g$,…
Let S be a semigroup and let T be a subsemigroup of S. Then T acts on S by left- and by right multiplication. This gives rise to a partition of the complement of T in S, and to each equivalence class of this partition we naturally associate…
A quasi-automatic semigroup is a finitely generated semigroup with a rational set of representatives such that the graph of right multiplication by any generator is a rational relation. A asynchronously automatic semigroup is a…
Under suitable conditions on a family $(I(t))_{t\ge 0}$ of Lipschitz mappings on a complete metric space, we show that up to a subsequence the strong limit $S(t):=\lim_{n\to\infty}(I(t 2^{-n}))^{2^n}$ exists for all dyadic time points $t$,…
Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $S\subseteq V$ such that every vertex not in $S$ is adjacent to at least one vertex in $S$. The cardinality of a smallest dominating set of $G$, denoted by $\gamma(G)$, is…
An invariant random subgroup of the countable group {\Gamma} is a random subgroup of {\Gamma} whose distribution is invariant under conjugation by all elements of {\Gamma}. We prove that for a nonamenable invariant random subgroup H, the…
We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a…
We show that the set of entries generated by any finite set of doubly stochastic matrices is nowhere dense, in contrast to the cases of stochastic matrices or unitary matrices. In other words, there is no finite universal set of doubly…
For finite-dimensional linear semigroups which leave a proper cone invariant it is shown that irreducibility with respect to the cone implies the existence of an extremal norm. In case the cone is simplicial a similar statement applies to…
We investigate the computational complexity for determining various properties of a finite transformation semigroup given by generators. We introduce a simple framework to describe transformation semigroup properties that are decidable in…
Let $S$ be a subsemigroup of a second countable locally compact group $G$, such that $S^{-1}S=G$. We consider the $C^*$-algebra $C^*_\delta(S)$ generated by the operators of translation by all elements of $S$ in $L^2(S)$. We show that this…
A numerical semigroup is said to be universally free if it is free for any possible arrangement of its minimal generating set. In this work, we establish that toric ideals associated with universally free numerical semigroups can be…
We give a simple recursion for the minimal generators $G=\{g_i\}$ of the generic value set $\Lambda_{gen}$ of a plane curve germ $C$ with a two-generator semigroup $\Gamma \langle p, m \rangle$. The main result provides for explicit…
Ara\'ujo, Kinyon and Konieczny (2011) pose several problems concerning the construction of arbitrary commuting graphs of semigroups. We observe that every star-free graph is the commuting graph of some semigroup. Consequently, we suggest…
The size $b$ of the smallest bidirectional macro scheme, which is arguably the most general copy-paste scheme to generate a given sequence, is considered to be the strictest reachable measure of repetitiveness. It is strictly lower-bounded…
We show that every finite simple group is generated invariably by a Sylow subgroup and a cyclic group. It follows that that the order complex of the coset poset of an arbitrary finite group has nontrivial reduced rational homology.
Gray and Ruskuc have shown that any group G occurs as the maximal subgroup of some free idempotent generated semigroup IG(E) on a biordered set of idempotents E, thus resolving a long standing open question. Given the group G, they make a…
A semigroup conjugacy is an equivalence relation that equals group conjugacy when the semigroup is a group. In this note, we answer five open problems related to semigroup conjugacy. (Problem One) We say a conjugacy ~ is partition-covering…
The power semigroup of a semigroup $ S $ is the semigroup of all nonempty subsets of $ S $ equipped with the naturally defined multiplication. A class $\mathcal{K} $ of semigroups is globally determined if any two members of $ \mathcal{K} $…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…