Related papers: Random ubiquitous transformation semigroups
Given an initial family of sets, we may take unions, intersections and complements of the sets contained in this family in order to form a new collection of sets; our construction process is done recursively until we obtain the last family.…
We propose efficient techniques for generating independent identically distributed uniform random samples inside semialgebraic sets. The proposed algorithm leverages recent results on the approximation of indicator functions by polynomials…
Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…
The aim of this work is to reduce the complexity of the available algorithms for computing the generator sets of a semigroup ideal by using the Hermite normal form. In order to achieve it we introduce the concept of decomposable semigroup.…
Let $\mathcal{P}$ be a partition of a finite set $X$. We say that a full transformation $f:X\to X$ preserves (or stabilizes) the partition $\mathcal{P}$ if for all $P\in \mathcal{P}$ there exists $Q\in \mathcal{P}$ such that $Pf\subseteq…
This paper introduces and studies a notion of \emph{algorithmic randomness} for subgroups of rationals. Given a randomly generated additive subgroup $(G,+)$ of rationals, two main questions are addressed: first, what are the model-theoretic…
We prove that if $G$ is a finitely generated group and $Z$ is a uniformly recurrent subgroup of $G$ then there exists a minimal system $(X,G)$ with $Z$ as its stability system. This answers a query of Glasner and Weiss \cite{GW} in the case…
We prove that if S is a commutative semigroup with well founded universal semilattice or a solvable inverse semigroup with well founded semilattice of idempotents, then every strongly productive ultrafilter on S is idempotent. Moreover we…
A regular semigroup is weakly generated by a set X if it has no proper regular subsemigroups containing X. In this paper, we study the regular semigroups weakly generated by idempotents. We show there exists a regular semigroup FI(X) weakly…
Let $G$ be a group. A group is said to be $k$-generated if it can be generated by its $k$ elements. A generating set of $G$ is called a minimal generating set if no proper subset of it generates $G.$ A minimal generating set of a group can…
Let $K$ be a field, and let $R = K[X]$ be the polynomial ring in an infinite collection $X$ of indeterminates over $K$. Let ${\mathfrak S}_{X}$ be the symmetric group of $X$. The group ${\mathfrak S}_{X}$ acts naturally on $R$, and this in…
The most developed aspect of the theory of finite semigroups is their classification in pseudovarieties. The main motivation for investigating such entities comes from their connection with the classification of regular languages via…
A subset $\{g_1, \ldots , g_d\}$ of a finite group $G$ is said to invariably generate $G$ if the set $\{g_1^{x_1}, \ldots, g_d^{x_d}\}$ generates $G$ for every choice of $x_i \in G$. The Chebotarev invariant $C(G)$ of $G$ is the expected…
In this paper we introduce the notion of m-irreducibility that extends the standard concept of irreducibility of a numerical semigroup when the multiplicity is fixed. We analyze the structure of the set of m-irreducible numerical…
For a commutative finite $\mathbb{Z}$-algebra, i.e., for a commutative ring $R$ whose additive group is finitely generated, it is known that the group of units of $R$ is finitely generated, as well. Our main results are algorithms to…
In this paper we deal with the following problem: how does the structure of a finite semigroup $S$ depend on the probability that two elements selected at random from $S$, with replacement, define the same inner right translation of $S$. We…
Dixon's famous theorem states that the group generated by two random permutations of a finite set is generically either the whole symmetric group or the alternating group. In the context of random generation of finite groups this means that…
We study qualitative properties of the set of recurrent points of finitely generated free semigroups of measurable maps. In the case of a single generator the classical Poincare recurrence theorem shows that these properties are closely…
Let $V$ be a vector space and $U$ a fixed subspace of $V$. We denote the semigroup of all linear transformations on $V$ under composition of functions by $L(V)$. In this paper, we study the semigroup of all linear transformations on $V$…
Generating trees are a useful technique in the enumeration of various combinatorial objects, particularly restricted permutations. Quite often the generating tree for the set of permutations avoiding a set of patterns requires infinitely…