Related papers: Complexity of Finite Semigroups: History and Decid…
Hard instances of natural computational problems are often elusive. In this note we present an example of a natural decision problem, the word problem for a certain finitely presented group, whose hard instances are easy to find. More…
The category $\mathrm{FI}_G$ was first defined and explored by Sam-Snowden. Here, we develop more of the machinery of $\mathrm{FI}_G$-modules and find numerous examples to apply it to, extending the work of Church-Ellenberg-Farb and Wilson.…
This paper investigates certain classes of entire functions in C^n that, together with their partial derivatives, share a finite set consisting of three elements. By employing normality criteria, we study the behaviour of such functions and…
These are expanded notes of a course given in Grenoble in june 2004. After a brief description of the harmonic map proof of Margulis' superrigidity and arithmeticity theorems, it is shown how the method might generalize to fundamental…
This paper provides short proofs of two fundamental theorems of finite semigroup theory whose previous proofs were significantly longer, namely the two-sided Krohn-Rhodes decomposition theorem and Henckell's aperiodic pointlike theorem,…
In this paper, we show that the class of representable residuated semigroups has the finite representation property. That is, every finite representable residuated semigroup is isomorphic to some algebra over a finite base. This result…
In this paper, the complete algebraic structure of finite semisimple group algebra of a normally monomial group is described. The main result is illustrated by computing the explicit Wedderburn decomposition of finite semisimple group…
Suppose that the finite group $G=AB$ is a mutually permutable product of two subgroups $A$ and $B$. By using Sylow numbers of $A$ and $B$, we present some new bounds of the $p$-length $l_p(G)$ of a $p$-solvable group $G$ and the nilpotent…
Taking residual finiteness as a starting point, we consider three related finiteness properties: weak subsemigroup separability, strong subsemigroup separability and complete separability. We investigate whether each of these properties is…
We perform the computations necessary to establish a multiplicity one statement for the irreducible representations of a finite spin group which in turn yields the classification of irreducible representations of finite spin groups. (The…
We study computable topological spaces and semicomputable and computable sets in these spaces. In particular, we investigate conditions under which semicomputable sets are computable. We prove that a semicomputable compact manifold $M$ is…
Scientists have demonstrated that quantum computing has presented novel approaches to address computational challenges, each varying in complexity. Adapting problem-solving strategies is crucial to harness the full potential of quantum…
There has been much recent interest into those properties of a 3-manifold determined by the profinite completion of its fundamental group. In this paper we give readily computable criteria specifying precisely when two orientable graph…
We prove a new criterion for the solvability of the finite groups, depending on the function $\psi_k(G)$ which is defined as the sum of $k$-th powers of the element orders of $G$. We show that our result can be used to show the solvability…
The semidirect discrete logarithm problem (SDLP) in finite groups was proposed as a foundation for post-quantum cryptographic protocols, based on the belief that its non-abelian structure would resist quantum attacks. However, recent…
A semigroup is completely simple if it has no proper ideals and contains a primitive idempotent. We say that a completely simple semigroup $S$ is a homogeneous completely simple semigroup if any isomorphism between finitely generated…
Weihrauch complexity is now an established and active part of mathematical logic. It can be seen as a computability-theoretic approach to classifying the uniform computational content of mathematical problems. This theory has become an…
In this paper we extend the approach of M. Cavaleri to effective amenability to the class of computably enumerable groups, i.e. in particular we do not assume that groups are finitely generated. In the case of computable groups we also…
Let $G$ be a finite group, and assume that $G$ has an automorphism of order at least $\rho|G|$, with $\rho\in\left(0,1\right)$. Generalizing recent analogous results of the author on finite groups with a large automorphism cycle length, we…
Leech's (co)homology groups of finite cyclic monoids are computed.