Érika Roldán

Érika Roldán

Auto-generated profile, based on publicly available information

Érika Roldán

Leipzig University

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 November 2024 in Education Sciences
Verified
Journal Article
Open access
PDF file
DRDoris Kristina Raave
Doris Kristina Raave
KSKatrin Saks
Katrin Saks
Margus PedasteMargus Pedaste
Margus Pedaste
EREric Roldan Roa
Eric Roldan Roa
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.

7 February 2023 in Discrete & Computational Geometry
Verified
Journal Article
Open access
PDF file
FMFedor Manin
Fedor Manin
ÉRÉrika Roldán
Érika Roldán
BSBenjamin Schweinhart
Benjamin Schweinhart
The Eden cell growth model is a simple discrete stochastic process which produces a “blob” (aggregation of cells) in $$\mathbb {R}^d$$Rd : start with one cube in the regular grid, and at each time step add a neighboring cube uniformly at random. This process has been used as a model for the growth of aggregations, tumors, and bacterial colonies and the healing of wounds, among other natural processes. Here, we study the topology and local geometry of the resulting structure, establishing asymptotic bounds for Betti numbers. Our main result is that the Betti numbers at timetgrow at a rate between $$t^{(d-1)/d}$$t(d-1)/d and $$P_d(t)$$Pd(t) , where $$P_d(t)$$Pd(t) is the size of the site perimeter. Assuming a widely believed conjecture, this establishes the rate of growth of the Betti numbers in every dimension. We also present the results of computational experiments on finer aspects of the geometry and topology, such as persistent homology and the distribution of shapes of holes.

6 January 2023 in Annals of Combinatorics
Verified
Journal Article
Open access
PDF file
GMGreg Malen
Greg Malen
ÉRÉrika Roldán
Érika Roldán
RTRosemberg Toalá-Enríquez
Rosemberg Toalá-Enríquez
An animal is a planar shape formed by attaching congruent regular polygons along their edges. Usually, these polygons are a finite subset of tiles of a regular planar tessellation. These tessellations can be parameterized using the Schläfli symbol $$\{p,q\}$$ { p , q } , where p denotes the number of sides of the regular polygon forming the tessellation and q is the number of edges or tiles meeting at each vertex. If $$(p-2)(q-2)> 4$$ ( p - 2 ) ( q - 2 ) > 4 , $$=4$$ = 4 , or $$<4$$ < 4 , then the tessellation corresponds to the geometry of the hyperbolic plane, the Euclidean plane, or the sphere, respectively. In 1976, Harary and Harborth studied animals defined on regular tessellations of the Euclidean plane, finding extremal values for their vertices, edges, and tiles, when any one of these parameters is fixed. They named animals attaining these extremal values as extremal animals. Here, we study hyperbolic extremal animals. For each $$\{p,q\}$$ { p , q } corresponding to a hyperbolic tessellation, we exhibit a sequence of spiral animals and prove that they attain the minimum numbers of edges and vertices within the class of animals with n tiles. We also give the first results on enumeration of extremal hyperbolic animals by finding special sequences of extremal animals that are unique extremal animals, in the sense that any animal with the same number of tiles which is distinct up to isometries cannot be extremal.

21 January 2021 in Graphs and Combinatorics
Verified
Journal Article
Open access
PDF file
HAHannah Alpert
Hannah Alpert
ÉRÉrika Roldán
Érika Roldán
How many chess rooks or queens does it take to guard all squares of a given polyomino, the union of square tiles from a square grid? This question is a version of the art gallery problem in which the guards can “see” whichever squares the rook or queen attacks. We show that $$\lfloor {\frac{n}{2}} \rfloor $$⌊n2⌋ rooks or $$\lfloor {\frac{n}{3}} \rfloor $$⌊n3⌋ queens are sufficient and sometimes necessary to guard a polyomino withntiles. We then prove that finding the minimum number of rooks or queens needed to guard a polyomino is NP-hard. These results also apply tod-dimensional rooks and queens ond-dimensional polycubes. Finally, we use bipartite matching theorems to describe sets of non-attacking rooks on polyominoes.

29 November 2021 in Forum of Mathematics, Sigma
Verified
Journal Article
Open access
PDF file
MKMatthew Kahle
Matthew Kahle
EPElliot Paquette
Elliot Paquette
ÉRÉrika Roldán
Érika Roldán
We study a natural model of a random -dimensional face. As a corollary, homology vanishing and simple connectivity have the same threshold, even in the strong ‘hitting time’ sense. This is in contrast with the simplicial case, where the thresholds are far apart. The proof depends on an iterative algorithm for contracting cycles – we show that with high probability, the algorithm rapidly and dramatically simplifies the fundamental group, converging after only a few steps.

19 February 2025 in Graphs and Combinatorics
Verified
Journal Article
Open access
PDF file
ÉRÉrika Roldán
Érika Roldán
RTRosemberg Toalá-Enríquez
Rosemberg Toalá-Enríquez
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.