Stephanie Perkins
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Stephanie Perkins has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Derek H. Smith
Faculty of Computing, Engineering and Science, University of South Wales, Pontypridd CF37 1DL, UK
15 shared publications - Paul Alun Roach
School of Computing and Mathematics, University of South Wales, Llantwit Rd, Pontypridd CF37 1DL, UK
6 shared publications - Anna Louise Skelt
School of Computing and Mathematics, University of South Wales, Llantwit Rd, Pontypridd CF37 1DL, UK
2 shared publications - Francis H. Hunt
University of South Wales
2 shared publications - Roberto Montemanni
Department of Sciences and Methods for Engineering, University of Modena and Reggio Emilia, 42122 Reggio Emilia, Italy
2 shared publications - Siˆan K. Jones
Department of Computing and Mathematical Sciences
2 shared publications
Latest Publications
- Open Access
Critical Sets and Unavoidable Sets of Strictly Concentric Magic Squares of Odd Order and Their Application to Prime Strictly Concentric Magic Squares of Order 5
There has been much interest in the mathematical investigation of critical sets and unavoidable sets in Latin Squares, Sudoku, and their applications to practical problems in areas such as agriculture and cryptology. This paper considers the associated structures of Strictly Concentric Magic Squares (SCMSs) and Prime Strictly Concentric Magic Squares (PSCMSs). A framework of formal definitions is given that leads to the definitions of critical sets and unavoidable sets. Minimal critical sets are of interest in Latin Squares, and in this article, the cardinality of minimal critical sets of SCMS is given for all n, n odd. Two families of unavoidable sets are established for SCMS, leading to a complete classification of unavoidable sets of minimum PSCMS of order 5.
Open AccessCritical Sets and Unavoidable Sets of Strictly Concentric Magic Squares of Odd Order and Their Application to Prime Strictly Concentric Magic Squares of Order 5
There has been much interest in the mathematical investigation of critical sets and unavoidable sets in Latin Squares, Sudoku, and their applications to practical problems in areas such as agriculture and cryptology. This paper considers the associated structures of Strictly Concentric Magic Squares (SCMSs) and Prime Strictly Concentric Magic Squares (PSCMSs). A framework of formal definitions is given that leads to the definitions of critical sets and unavoidable sets. Minimal critical sets are of interest in Latin Squares, and in this article, the cardinality of minimal critical sets of SCMS is given for all n, n odd. Two families of unavoidable sets are established for SCMS, leading to a complete classification of unavoidable sets of minimum PSCMS of order 5.
- Open Access
- 11 April 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (8) , 1261
Prime Strictly Concentric Magic Squares of Odd Order
Magic squares have been widely studied, with publications of mathematical interest dating back over 100 years. Most studies construct and analyse specific subsets of magic squares, with some exploring links to puzzles, number theory, and graph theory. The subset of magic squares this paper focuses on are those termed prime strictly concentric magic squares (PSCMS), and their general definitions, examples, and important properties are also presented. Previously, only the minimum centre cell values of PSCMS of odd order 5 to 19 were presented, by Makarova in 2015. In this paper, the corresponding list of primes for all minimum PSCMS of order 5 is given, and the number of minimum PSCMS of order 5 is enumerated.
- 11 April 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (8) , 1261
Open AccessPrime Strictly Concentric Magic Squares of Odd Order
Magic squares have been widely studied, with publications of mathematical interest dating back over 100 years. Most studies construct and analyse specific subsets of magic squares, with some exploring links to puzzles, number theory, and graph theory. The subset of magic squares this paper focuses on are those termed prime strictly concentric magic squares (PSCMS), and their general definitions, examples, and important properties are also presented. Previously, only the minimum centre cell values of PSCMS of odd order 5 to 19 were presented, by Makarova in 2015. In this paper, the corresponding list of primes for all minimum PSCMS of order 5 is given, and the number of minimum PSCMS of order 5 is enumerated.
- Open Access
- 1 November 2021
- Published by Walter de Gruyter GmbH in Recreational Mathematics Magazine
- Vol. 8 (15) , 1-12
Bishop Independence on the Surface of a Square Prism
Bishop Independence concerns determining the maximum number of bishops that can be placed on a board such that no bishop can attack any other bishop. This paper presents the solution to the bishop independence problem, determining the bishop independence number, for all sizes of boards on the surface of a square prism.
- 1 November 2021
- Published by Walter de Gruyter GmbH in Recreational Mathematics Magazine
- Vol. 8 (15) , 1-12
Open AccessBishop Independence on the Surface of a Square Prism
Bishop Independence concerns determining the maximum number of bishops that can be placed on a board such that no bishop can attack any other bishop. This paper presents the solution to the bishop independence problem, determining the bishop independence number, for all sizes of boards on the surface of a square prism.
- Open Access
- 31 January 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (3) , 285
A Discussion of a Cryptographical Scheme Based in -Critical Sets of a Latin SquareThis communication provides a discussion of a scheme originally proposed by Falcón in a paper entitled “Latin squares associated to principal autotopisms of long cycles. Applications in cryptography”. Falcón outlines the protocol for a cryptographical scheme that uses the -critical sets associated with a particular Latin square to generate access levels for participants of the scheme. Accompanying the scheme is an example, which applies the protocol to a particular Latin square of order six. Exploration of the example itself, revealed some interesting observations about both the structure of the Latin square itself and the autotopisms associated with the Latin square. These observations give rise to necessary conditions for the generation of the -critical sets associated with certain autotopisms of the given Latin square. The communication culminates with a table which outlines the various access levels for the given Latin square in accordance with the scheme detailed by Falcón.- 31 January 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (3) , 285
Open AccessA Discussion of a Cryptographical Scheme Based in -Critical Sets of a Latin SquareThis communication provides a discussion of a scheme originally proposed by Falcón in a paper entitled “Latin squares associated to principal autotopisms of long cycles. Applications in cryptography”. Falcón outlines the protocol for a cryptographical scheme that uses the -critical sets associated with a particular Latin square to generate access levels for participants of the scheme. Accompanying the scheme is an example, which applies the protocol to a particular Latin square of order six. Exploration of the example itself, revealed some interesting observations about both the structure of the Latin square itself and the autotopisms associated with the Latin square. These observations give rise to necessary conditions for the generation of the -critical sets associated with certain autotopisms of the given Latin square. The communication culminates with a table which outlines the various access levels for the given Latin square in accordance with the scheme detailed by Falcón. - 1 January 2019
- Published by Inderscience Publishers in International Journal of Metaheuristics
- Vol. 7 (2) , 152
Solving the maximum clique problem with a hybrid algorithm
A hybrid algorithm for the maximum clique problem is presented. A heuristic is used to generate cliques and these are improved by some simple optimisations and Tabu search. All components of the algorithm make use of an exact algorithm or a pseudoexact algorithm, which is an exact algorithm with some specialised pruning. Pre-processing is useful for some instances. The algorithm is shown to be successful using standard and new benchmarks.
- 1 January 2019
- Published by Inderscience Publishers in International Journal of Metaheuristics
- Vol. 7 (2) , 152
Solving the maximum clique problem with a hybrid algorithm
A hybrid algorithm for the maximum clique problem is presented. A heuristic is used to generate cliques and these are improved by some simple optimisations and Tabu search. All components of the algorithm make use of an exact algorithm or a pseudoexact algorithm, which is an exact algorithm with some specialised pruning. Pre-processing is useful for some instances. The algorithm is shown to be successful using standard and new benchmarks.
- 1 January 2015
- Published by Inderscience Publishers in International Journal of Information and Coding Theory
- Vol. 3 (2) , 120-136
Channel models and error correction codes for DNA information storage
It has been demonstrated in recent years that synthetic DNA can be used to reliably store large volumes of data. It should be possible to recover the data from the synthetic DNA after very long time periods under fairly mild storage conditions. Two key requirements are the need to avoid repeated symbols known as homopolymers and the need to avoid errors arising from secondary structures. In this paper, an error model is developed and error correction techniques are proposed for this technology. The use of variable length Huffman codes in the avoidance of homopolymers can lead to loss of synchronisation if any errors do occur. A scheme to recover synchronisation is proposed and shown to be effective.
- 1 January 2015
- Published by Inderscience Publishers in International Journal of Information and Coding Theory
- Vol. 3 (2) , 120-136
Channel models and error correction codes for DNA information storage
It has been demonstrated in recent years that synthetic DNA can be used to reliably store large volumes of data. It should be possible to recover the data from the synthetic DNA after very long time periods under fairly mild storage conditions. Two key requirements are the need to avoid repeated symbols known as homopolymers and the need to avoid errors arising from secondary structures. In this paper, an error model is developed and error correction techniques are proposed for this technology. The use of variable length Huffman codes in the avoidance of homopolymers can lead to loss of synchronisation if any errors do occur. A scheme to recover synchronisation is proposed and shown to be effective.
- 1 September 2013
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 74 (2) , 481-493
Decoding mixed errors and erasures in permutation codes
- 1 September 2013
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 74 (2) , 481-493
Decoding mixed errors and erasures in permutation codes
- Open Access
- 7 November 2012
- Published by Hindawi Limited in International Journal of Combinatorics
- Vol. 2012, 1-6
The Structure of Reduced Sudoku Grids and the Sudoku Symmetry Group
A Sudoku grid is a constrained Latin square. In this paper a reduced Sudoku grid is described, the properties of which differ, through necessity, from that of a reduced Latin square. The Sudoku symmetry group is presented and applied to determine a mathematical relationship between the number of reduced Sudoku grids and the total number of Sudoku grids for any size. This relationship simplifies the enumeration of Sudoku grids and an example of the use of this method is given.
- 7 November 2012
- Published by Hindawi Limited in International Journal of Combinatorics
- Vol. 2012, 1-6
Open AccessThe Structure of Reduced Sudoku Grids and the Sudoku Symmetry Group
A Sudoku grid is a constrained Latin square. In this paper a reduced Sudoku grid is described, the properties of which differ, through necessity, from that of a reduced Latin square. The Sudoku symmetry group is presented and applied to determine a mathematical relationship between the number of reduced Sudoku grids and the total number of Sudoku grids for any size. This relationship simplifies the enumeration of Sudoku grids and an example of the use of this method is given.
- 1 March 2012
- Published by Elsevier in Discrete Mathematics
- Vol. 312 (5) , 1062-1075
Linear and nonlinear constructions of DNA codes with Hamming distance , constant GC-content and a reverse-complement constraint- 1 March 2012
- Published by Elsevier in Discrete Mathematics
- Vol. 312 (5) , 1062-1075
Linear and nonlinear constructions of DNA codes with Hamming distance , constant GC-content and a reverse-complement constraint- 6 July 2011
- Published by Elsevier in Discrete Mathematics
- Vol. 311 (13) , 1207-1219
Linear and nonlinear constructions of DNA codes with Hamming distance d and constant GC-content
- 6 July 2011
- Published by Elsevier in Discrete Mathematics
- Vol. 311 (13) , 1207-1219
Linear and nonlinear constructions of DNA codes with Hamming distance d and constant GC-content