Related papers: Enumerating Transformation Semigroups

In this paper, we enumerate enumeration problems and algorithms. This survey is under construction. If you know some results not in this survey or there is anything wrong, please let me know.

We report the number of semigroups with 9 elements up to isomorphism or anti-isomorphism to be 52,989,400,714,478 and up to isomorphism to be 105,978,177,936,292. We obtained these results by combining computer search with recently…

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…

We formulate an alternative approach to describing Ehresmann semigroups by means of left and right \'etale actions of a meet semilattice on a category. We also characterize the Ehresmann semigroups that arise as the set of all subsets of a…

We consider the complexity of Green's relations when the semigroup is given by transformations on a finite set. Green's relations can be defined by reachability in the (right/left/two-sided) Cayley graph. The equivalence classes then…

We augment the body of existing results on embedding finite semigroups of a certain type into 2-generator finite semigroups of the same type. The approach adopted applies to finite semigroups the idempotents of which form a band and also to…

We introduce a special class of real semiflows, which is used to define a general type of evolution semigroups, associated to not necessarily exponentially bounded evolution families. Giving spectral characterizations of the corresponding…

Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…

We show that the number of numerical semigroups with multiplicity three, four or five and fixed genus is increasing as a function in the genus. To this end we use the Kunz polytope for these multiplicities. Counting numerical semigroups…

We exhibit a simple condition under which a finite involutary semigroup whose semigroup reduct is inherently nonfinitely based is also inherently nonfinitely based as a unary semigroup. As applications, we get already known as well as new…

Let $S$ be a class of groups and let $f_S (n)$ be the number of isomorphism classes of groups in $S$ of order $n$. Let $f(n)$ count the number of groups of order $n$ up to isomorphism. The asymptotic bounds for $f(n)$ behave differently…

An algorithm for the explicit computation of a complete set of primitive central idempotents, Wedderburn decomposition and the automorphism group of the semisimple group algebra of a finite metabelian group is developed. The algorithm is…

A systematic method is presented for the construction and classification of algebras of gauge transformations for arbitrary high rank tensor gauge fields. For every tensor gauge field of a given rank, the gauge transformation will be…

Nonunique factorization in cancellative commutative semigroups is often studied using combinatorial factorization invariants, which assign to each semigroup element a quantity determined by the factorization structure. For numerical…

We study the group of transformations of 4F3 hypergeometric functions evaluated at unity with one unit shift in parameters. We reveal the general form of this family of transformations and its group property. Next, we use explicitly known…

Evolutionary processes proved very useful for solving optimization problems. In this work, we build a formalization of the notion of cooperation and competition of multiple systems working toward a common optimization goal of the population…

We extend the theory of fast Fourier transforms on finite groups to finite inverse semigroups. We use a general method for constructing the irreducible representations of a finite inverse semigroup to reduce the problem of computing its…

In the context of Higman embeddings of recursive groups into finitely presented groups we suggest an algorithm which uses Higman operations to explicitly constructs the specific recursively enumerable sets of integer sequences arising…

Let $S$ and $\Delta$ be numerical semigroups. A numerical semigroup $S$ is an $\mathbf{I}(\Delta)$-{\it semigroup} if $S\backslash \{0\}$ is an ideal of $\Delta$. We will denote by $\mathcal{J}(\Delta)=\{S \mid S \text{ is an…

The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…