Érika Roldán
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Érika Roldán has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
- Doris Kristina Raave
Leipzig University
8 shared publications Julia Mori
University of Bern
4 shared publications- Margus Pedaste
Institute of Education, University of Tartu, 51005 Tartu, Estonia
4 shared publications - Nina Politimou
University College London
4 shared publications - Tyler Colasante
Leipzig University
4 shared publications - Elliot Paquette
Department of Mathematics and Statistics McGill University
3 shared publications
Latest Publications
- 2 September 2025
- Published by Springer Nature
- p. 367-372
Play My Math: Design and Implementation of a Course Creator Tool Within a Mathematical Musician Digital Learning Platform
- 2 September 2025
- Published by Springer Nature
- p. 367-372
Play My Math: Design and Implementation of a Course Creator Tool Within a Mathematical Musician Digital Learning Platform
- 15 July 2025
- Published by Springer Nature
- p. 264-273
Play My Math: Design and Implementation of a Fraction Generator Tool Within a Mathematical Musician Digital Learning Platform
- 15 July 2025
- Published by Springer Nature
- p. 264-273
Play My Math: Design and Implementation of a Fraction Generator Tool Within a Mathematical Musician Digital Learning Platform
- Open Access
- 7 May 2025
- Published by Springer Nature in La Matematica
- Vol. 4 (2) , 433-458
Parity Property of Hexagonal Sliding Puzzles
We study the puzzle graphs of hexagonal sliding puzzles of various shapes, and with various numbers of holes. The puzzle graph is a combinatorial model which captures the solvability and the complexity of sequential mechanical puzzles. Questions relating to the puzzle graph have been previously studied and resolved for the 15 Puzzle, which is the most famous—and unsolvable—square sliding puzzle of all time. It is known that for square puzzles such as the 15 Puzzle, solvability depends on a parity property that splits the puzzle graph into two components. In the case of hexagonal sliding puzzles, we get more interesting parity properties that depend on the shape of the boards and on the missing tiles or holes on the board. We show that for large-enough hexagonal, triangular, or parallelogram-shaped boards with hexagonal tiles, all puzzles with three or more holes are solvable. For puzzles with two or more holes, we give a solvability criterion involving both a parity property, and the placement of tiles in tight corners of the board. The puzzle graph is a discrete model for the configuration space of hard tiles (hexagons or squares) moving on different tessellation-based domains. Understanding the combinatorics of the puzzle graph could lead to understanding some aspects of the topology of these configuration spaces.
- 7 May 2025
- Published by Springer Nature in La Matematica
- Vol. 4 (2) , 433-458
Open AccessParity Property of Hexagonal Sliding Puzzles
We study the puzzle graphs of hexagonal sliding puzzles of various shapes, and with various numbers of holes. The puzzle graph is a combinatorial model which captures the solvability and the complexity of sequential mechanical puzzles. Questions relating to the puzzle graph have been previously studied and resolved for the 15 Puzzle, which is the most famous—and unsolvable—square sliding puzzle of all time. It is known that for square puzzles such as the 15 Puzzle, solvability depends on a parity property that splits the puzzle graph into two components. In the case of hexagonal sliding puzzles, we get more interesting parity properties that depend on the shape of the boards and on the missing tiles or holes on the board. We show that for large-enough hexagonal, triangular, or parallelogram-shaped boards with hexagonal tiles, all puzzles with three or more holes are solvable. For puzzles with two or more holes, we give a solvability criterion involving both a parity property, and the placement of tiles in tight corners of the board. The puzzle graph is a discrete model for the configuration space of hard tiles (hexagons or squares) moving on different tessellation-based domains. Understanding the combinatorics of the puzzle graph could lead to understanding some aspects of the topology of these configuration spaces.
- Open Access
- 19 February 2025
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 41 (2) , 1-23
Isoperimetric Formulas for Hyperbolic Animals
An animal is a planar shape formed by attaching congruent regular polygons along their edges. In 1976, Harary and Harborth gave closed isoperimetric formulas for Euclidean animals. Here, we provide analogous formulas for hyperbolic animals. We do this by proving a connection between Sturmian words and the parameters of a discrete analogue of balls in the graph determined by hyperbolic tessellations. This reveals a complexity in hyperbolic animals that is not present in Euclidean animals.
- 19 February 2025
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 41 (2) , 1-23
Open AccessIsoperimetric Formulas for Hyperbolic Animals
An animal is a planar shape formed by attaching congruent regular polygons along their edges. In 1976, Harary and Harborth gave closed isoperimetric formulas for Euclidean animals. Here, we provide analogous formulas for hyperbolic animals. We do this by proving a connection between Sturmian words and the parameters of a discrete analogue of balls in the graph determined by hyperbolic tessellations. This reveals a complexity in hyperbolic animals that is not present in Euclidean animals.
- Open Access
- 8 February 2025
- Published by Springer Nature in Research in the Mathematical Sciences
- Vol. 12 (1) , 1-26
Complexity of chess domination problems
We study different domination problems of attacking and non-attacking rooks and queens on polyominoes and polycubes of all dimensions. Our main result proves that maximum independent domination is NP-complete for non-attacking queens and for non-attacking rooks on polycubes of dimension three and higher. We also analyze these problems for polyominoes and convex polyominoes, conjecture the complexity classes, and provide a computer tool for investigation. We have also computed new values for classical queen domination problems on chessboards (square polyominoes). For our computations, we have translated the problem into an integer linear programming instance. Finally, using this computational implementation and the game engine Godot, we have developed a video game of minimum domination of queens and rooks on randomly generated polyominoes.
- 8 February 2025
- Published by Springer Nature in Research in the Mathematical Sciences
- Vol. 12 (1) , 1-26
Open AccessComplexity of chess domination problems
We study different domination problems of attacking and non-attacking rooks and queens on polyominoes and polycubes of all dimensions. Our main result proves that maximum independent domination is NP-complete for non-attacking queens and for non-attacking rooks on polycubes of dimension three and higher. We also analyze these problems for polyominoes and convex polyominoes, conjecture the complexity classes, and provide a computer tool for investigation. We have also computed new values for classical queen domination problems on chessboards (square polyominoes). For our computations, we have translated the problem into an integer linear programming instance. Finally, using this computational implementation and the game engine Godot, we have developed a video game of minimum domination of queens and rooks on randomly generated polyominoes.
- 1 January 2025
- Published by Springer Nature
- p. 311-321
Enhancing or Transforming Learning? What, How and Why: Snapshot into K-12 Teachers’ Use of Technology
- 1 January 2025
- Published by Springer Nature
- p. 311-321
Enhancing or Transforming Learning? What, How and Why: Snapshot into K-12 Teachers’ Use of Technology
- Open Access
- 27 November 2024
- Published by MDPI AG in Education Sciences
- Vol. 14 (12) , 1301
How and Why Teachers Use Technology: Distinct Integration Practices in K-12 Education
This study investigates the integration of digital technology in K-12 education by examining the practices of Estonian primary and lower secondary school teachers. Through latent profile analysis, we identified six distinct profiles of teachers’ digital technology integration practices, each characterised by unique patterns of how and why technology is integrated. These profiles—Motivating Facilitators, Depth Facilitators, Efficiency Engineers, Engaging Innovators, Depth Divers, and Motivating Traditionalists—highlight the necessity for context-specific professional development that addresses teachers’ diverse needs and motivations. The study contributes to the growing literature on technology-enhanced learning by providing valuable insights into designing effective professional development programs and promoting the strategic use of digital technologies to enhance student learning.
- 27 November 2024
- Published by MDPI AG in Education Sciences
- Vol. 14 (12) , 1301
Open AccessHow and Why Teachers Use Technology: Distinct Integration Practices in K-12 Education
This study investigates the integration of digital technology in K-12 education by examining the practices of Estonian primary and lower secondary school teachers. Through latent profile analysis, we identified six distinct profiles of teachers’ digital technology integration practices, each characterised by unique patterns of how and why technology is integrated. These profiles—Motivating Facilitators, Depth Facilitators, Efficiency Engineers, Engaging Innovators, Depth Divers, and Motivating Traditionalists—highlight the necessity for context-specific professional development that addresses teachers’ diverse needs and motivations. The study contributes to the growing literature on technology-enhanced learning by providing valuable insights into designing effective professional development programs and promoting the strategic use of digital technologies to enhance student learning.
- 3 October 2024
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 359, 400-406
There is no perfect Mondrian partition for squares of side lengths less than 1001
- 3 October 2024
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 359, 400-406
There is no perfect Mondrian partition for squares of side lengths less than 1001
- 13 September 2024
- Published by Springer Nature
- p. 241-246
Play My Math: First Development Cycle of an EdTech Tool Supporting the Teaching and Learning of Fractions Through Music in Algebraic Notation
- 13 September 2024
- Published by Springer Nature
- p. 241-246
Play My Math: First Development Cycle of an EdTech Tool Supporting the Teaching and Learning of Fractions Through Music in Algebraic Notation