Related papers: The Todd-Coxeter Algorithm for Semigroups and Mono…
Real physical systems with reflective and rotational symmetries such as viruses, fullerenes and quasicrystals have recently been modeled successfully in terms of three-dimensional (affine) Coxeter groups. Motivated by this progress, we…
We examine, in a general setting, a notion of inverse semigroup of left quotients, which we call left I-quotients. This concept has appeared, and has been used, as far back as Clifford's seminal work describing bisimple inverse monoids in…
This paper proposes a new method based on neural networks for computing the high-dimensional committor functions that satisfy Fokker-Planck equations. Instead of working with partial differential equations, the new method works with an…
We give an algorithm to compute the $\omega$-primality of finitely generated atomic monoids. Asymptotic $\w$-primality is also studied and a formula to obtain it in finitely generated quasi-Archimedean monoids is proven. The formulation is…
We use the Stein-Chen method to obtain compound Poisson approximations for the distribution of the number of subgraphs in a generalised stochastic block model which are isomorphic to some fixed graph. This model generalises the classical…
This paper enriches the list of known properties of congruence sequences starting from the universal relation and successively performing the operators lower $k$ and lower $t$. Two series of inverse semigroups, namely…
This paper is a contribution to the theory of finite semigroups and their classification in pseudovarieties, which is motivated by its connections with computer science. The question addressed is what role can play the consideration of an…
We introduce a bivariant version of the Cuntz semigroup as equivalence classes of order zero maps generalizing the ordinary Cuntz semigroup. The theory has many properties formally analogous to KK-theory including a composition product. We…
When the Euclidean algorithm produces a symmetric sequence of quotients, we give explicit formulas for the remainders that allow the analysis of two families of quadratic forms in the remainders.
Building upon the previous Renner-Coxeter system of work by Eddy Godelle we introduce the familiar Renner monoid structure of the Adherence order. The Green's relations of the system are then considered in relation to the Adherence order…
We present a new algorithm to explore or count the numerical semigroups of a given genus which uses the unleaved version of the tree of numerical semigroups. In the unleaved tree there are no leaves rather than the ones at depth equal to…
In this paper we describe an algorithm visiting all numerical semigroups up to a given genus using a well suited representation. The interest of this algorithm is that it fits particularly well the architecture of modern computers allowing…
In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…
This paper presents a new clustering algorithm for symmetric positive semi-definite (SPSD) matrices, called K-Tensors. The method identifies structured subsets of the SPSD cone characterized by common principal component (CPC)…
This is the report of a project with the aim to make a new implementation of the Schreier-Sims algorithm in GAP, specialized for matrix groups. The standard Schreier-Sims algorithm is described in some detail, followed by descriptions of…
We introduce and study deformations of finite-dimensional modules over rational Cherednik algebras. Our main tool is a generalization of usual harmonic polynomials for Coxeter groups -- the so-called quasiharmonic polynomials. A surprising…
We exhibit a winning strategy for Synchronizer in the synchronization game on every synchronizing automaton in whose transition monoid the regular D-classes form subsemigroups
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…
The paper is focused on the forecasting method for time series groups with the use of algorithms for cluster analysis. $K$-means algorithm is suggested to be a basic one for clustering. The coordinates of the centers of clusters have been…
We introduce the notion of numerical semigroups generated by concatenation of arithmetic sequences and show that this class of numerical semigroups exhibit multiple interesting behaviours.