The Centre for Interdisciplinary Research in Computational Algebra (CIRCA) was established in 2000 to foster new and existing collaborative research between members of the Schools of Computer Science and of Mathematics and Statistics in the area of computational abstract algebra.

For more information please visit the Centre for Interdisciplinary Research in Computational Algebra (CIRCA) home page.

Recent Submissions

  • Automatically generating streamlined constraint models with ESSENCE and CONJURE 

    Wetter, James; Akgün, Özgür; Miguel, Ian (Springer International Publishing, 2015-08-13) - Conference item
    Streamlined constraint reasoning is the addition of uninferred constraints to a constraint model to reduce the search space, while retaining at least one solution. Previously, effective streamlined models have been constructed ...
  • A note on the probability of generating alternating or symmetric groups 

    Morgan, Luke; Roney-Dougal, Colva Mary (2015-09) - Journal article
    We improve on recent estimates for the probability of generating the alternating and symmetric groups An and Sn. In particular, we find the sharp lower bound if the probability is given by a quadratic in n−1. This leads ...
  • HPC-GAP : engineering a 21st-century High-Performance Computer algebra system 

    Behrends, Reimer; Hammond, Kevin; Janjic, Vladimir; Konovalov, Alexander; Linton, Stephen Alexander; Loidl, Hans-Wolfgang; Maier, Patrick; Trinder, Philip (2016-09-10) - Journal article
    Symbolic computation has underpinned a number of key advances in Mathematics and Computer Science. Applications are typically large and potentially highly parallel, making them good candidates for parallel execution at a ...
  • Lengths of words in transformation semigroups generated by digraphs 

    Cameron, P. J.; Castillo-Ramirez, A.; Gadouleau, M.; Mitchell, J. D. (2016-08-08) - Journal article
    Given a simple digraph D on n vertices (with n≥2), there is a natural construction of a semigroup of transformations ⟨D⟩. For any edge (a, b) of D, let a→b be the idempotent of rank n−1 mapping a to b and fixing all vertices ...
  • Idempotent rank in the endomorphism monoid of a non-uniform partition 

    Dolinka, Igor; East, James; Mitchell, James D. (2016-02) - Journal article
    We calculate the rank and idempotent rank of the semigroup E(X,P) generated by the idempotents of the semigroup T(X,P), which consists of all transformations of the finite set X preserving a non-uniform partition P. We ...

View more