Centre for Interdisciplinary Research in Computational Algebra (CIRCA) Research
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.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Recent Submissions
-
Groups in Galway and Groups St Andrews conferences
(University of Miskolc, 2018) - Conference item -
Solvable quotients of subdirect products of perfect groups are nilpotent
(2018-08-09) - Journal articleWe prove the statement in the title and exhibit examples of quotients of arbitrary nilpotency class. This answers a question by Holt. -
Triple arrays from difference sets
(2017-11) - Journal articleThis paper addresses the question whether triple arrays can be constructed from Youden squares developed from difference sets. We prove that if the difference set is abelian, then having −1 as multiplier is both a necessary ... -
Finding parallel functional pearls : automatic parallel recursion scheme detection in Haskell functions via anti-unification
(2018-02) - Journal articleThis paper describes a new technique for identifying potentially parallelisable code structures in functional programs. Higher-order functions enable simple and easily understood abstractions that can be used to implement ... -
Complexity of n-Queens completion (extended abstract)
(International Joint Conferences on Artificial Intelligence, 2018-07-13)The n-Queens problem is to place n chess queens on an n by n chessboard so that no two queens are on the same row, column or diagonal. The n-Queens Completion problem is a variant, dating to 1850, in which some queens are ...
RSS 1.0