Erica Flapan
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
Erica Flapan has a total of 65 co-authors. Here are the top co-authors by number of shared publications:
Ramin Naimi
7 shared publicationsBlake Mellor
4 shared publications- Dorothy Buck
Imperial College London
4 shared publications - Ramin Naimi
Department of Mathematics, Occidental College, Los Angeles, CA, United States
4 shared publications - Ryo Nikkuni
Department of Information and Mathematical Sciences, School of Arts and Sciences, Tokyo Woman’s Christian University, Tokyo, Japan
3 shared publications - Blake Mellor
Mathematics Department Loyola Marymount University 90045-2659 Los Angeles CA
2 shared publications
Latest Publications
- Open Access
- 22 August 2024
- Published by Elsevier in Topology and its Applications
- Vol. 356
Splittings of tangles and spatial graphs
- 22 August 2024
- Published by Elsevier in Topology and its Applications
- Vol. 356
Open AccessSplittings of tangles and spatial graphs
- Open Access
- 1 June 2023
- Published by Springer Nature in Scientific Reports
- Vol. 13 (1) , 1-9
A tile model of circuit topology for self-entangled biopolymers
Building on the theory of circuit topology for intra-chain contacts in entangled proteins, we introduce tiles as a way to rigorously model local entanglements which are held in place by molecular forces. We develop operations that combine tiles so that entangled chains can be represented by algebraic expressions. Then we use our model to show that the only knot types that such entangled chains can have are $$3_1$$ , $$4_1$$ , $$5_1$$ , $$5_2$$ , $$6_1$$ , $$6_2$$ , $$6_3$$ , $$7_7$$ , $$8_{12}$$ and connected sums of these knots. This includes all proteins knots that have thus far been identified.- 1 June 2023
- Published by Springer Nature in Scientific Reports
- Vol. 13 (1) , 1-9
Open AccessA tile model of circuit topology for self-entangled biopolymers
Building on the theory of circuit topology for intra-chain contacts in entangled proteins, we introduce tiles as a way to rigorously model local entanglements which are held in place by molecular forces. We develop operations that combine tiles so that entangled chains can be represented by algebraic expressions. Then we use our model to show that the only knot types that such entangled chains can have are $$3_1$$ , $$4_1$$ , $$5_1$$ , $$5_2$$ , $$6_1$$ , $$6_2$$ , $$6_3$$ , $$7_7$$ , $$8_{12}$$ and connected sums of these knots. This includes all proteins knots that have thus far been identified. - 8 April 2022
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 29 (2) , P2.27
Weakly Linked Embeddings of Pairs of Complete Graphs in $\mathbb{R}^3$Let $G$ and $H$ be disjoint embeddings of complete graphs $K_m$ and $K_n$ in $\mathbb{R}^3$ such that some cycle in $G$ links a cycle in $H$ with non-zero linking number. We say that $G$ and $H$ are weakly linked if the absolute value of the linking number of any cycle in $G$ with a cycle in $H$ is $0$ or $1$. Our main result is an algebraic characterisation of when a pair of disjointly embedded complete graphs is weakly linked. As a step towards this result, we show that if $G$ and $H$ are weakly linked, then each contains either a vertex common to all triangles linking the other or a triangle which shares an edge with all triangles linking the other. All families of weakly linked pairs of embedded complete graphs are then characterised by which of these two cases holds in each complete graph.- 8 April 2022
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 29 (2) , P2.27
Weakly Linked Embeddings of Pairs of Complete Graphs in $\mathbb{R}^3$Let $G$ and $H$ be disjoint embeddings of complete graphs $K_m$ and $K_n$ in $\mathbb{R}^3$ such that some cycle in $G$ links a cycle in $H$ with non-zero linking number. We say that $G$ and $H$ are weakly linked if the absolute value of the linking number of any cycle in $G$ with a cycle in $H$ is $0$ or $1$. Our main result is an algebraic characterisation of when a pair of disjointly embedded complete graphs is weakly linked. As a step towards this result, we show that if $G$ and $H$ are weakly linked, then each contains either a vertex common to all triangles linking the other or a triangle which shares an edge with all triangles linking the other. All families of weakly linked pairs of embedded complete graphs are then characterised by which of these two cases holds in each complete graph.- Open Access
- 1 October 2021
- Published by World Scientific Pub Co Pte Ltd in Journal of Knot Theory and Its Ramifications
- Vol. 30 (12)
Topological symmetry groups of the Petersen graph
- 1 October 2021
- Published by World Scientific Pub Co Pte Ltd in Journal of Knot Theory and Its Ramifications
- Vol. 30 (12)
Open AccessTopological symmetry groups of the Petersen graph
- Open Access
Stick number of non-paneled knotless spatial graphs
We show that the minimum number of sticks required to construct a non-paneled knotless embedding of $K_4$ is 9 and of $K_5$ is 12 or 13. We use our results about $K_4$ to show that the probability that a random linear embedding of $K_{3,3}$ in a cube is in the form of a M\"{o}bius ladder is $0.97380\pm 0.00003$, and offer this as a possible explanation for why $K_{3,3}$ subgraphs of metalloproteins occur primarily in this form.Open AccessStick number of non-paneled knotless spatial graphs
We show that the minimum number of sticks required to construct a non-paneled knotless embedding of $K_4$ is 9 and of $K_5$ is 12 or 13. We use our results about $K_4$ to show that the probability that a random linear embedding of $K_{3,3}$ in a cube is in the form of a M\"{o}bius ladder is $0.97380\pm 0.00003$, and offer this as a possible explanation for why $K_{3,3}$ subgraphs of metalloproteins occur primarily in this form. - 1 January 2021
- Published by Institute of Mathematics, Polish Academy of Sciences in Fundamenta Mathematicae
- Vol. 255 (3) , 289-308
Symmetries of spatial graphs in 3-manifolds
We consider when automorphisms of a graph can be induced by homeomorphisms of embeddings of the graph in a $3$-manifold. In particular, we prove that every automorphism of a graph is induced by a homeomorphism of some embedding of the graph in a connected
- 1 January 2021
- Published by Institute of Mathematics, Polish Academy of Sciences in Fundamenta Mathematicae
- Vol. 255 (3) , 289-308
Symmetries of spatial graphs in 3-manifolds
We consider when automorphisms of a graph can be induced by homeomorphisms of embeddings of the graph in a $3$-manifold. In particular, we prove that every automorphism of a graph is induced by a homeomorphism of some embedding of the graph in a connected
- Open Access
Topological Symmetry Groups of the Heawood Graph
We classify all groups which can occur as the topological symmetry group of some embedding of the Heawood graph in .Open AccessTopological Symmetry Groups of the Heawood Graph
We classify all groups which can occur as the topological symmetry group of some embedding of the Heawood graph in . - Open Access
- 18 April 2019
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 116 (19) , 9360-9369
Topological descriptions of protein folding
How knotted proteins fold has remained controversial since the identification of deeply knotted proteins nearly two decades ago. Both computational and experimental approaches have been used to investigate protein knot formation. Motivated by the computer simulations of Bölinger et al. [Bölinger D, et al. (2010) PLoS Comput Biol 6:e1000731] for the folding of the -knotted α-haloacid dehalogenase (DehI) protein, we introduce a topological description of knot folding that could describe pathways for the formation of all currently known protein knot types and predicts knot types that might be identified in the future. We analyze fingerprint data from crystal structures of protein knots as evidence that particular protein knots may fold according to specific pathways from our theory. Our results confirm Taylor’s twisted hairpin theory of knot folding for the -knotted proteins and the -knotted ketol-acid reductoisomerases and present alternative folding mechanisms for the -knotted phytochromes and the - and -knotted proteins. Significance Knotting in proteins was once considered exceedingly rare. However, systematic analyses of solved protein structures over the last two decades have demonstrated the existence of many deeply knotted proteins. Conservation of knotting across some protein families strongly suggests that knotting can be important for protein structure and function, and hence, significant interest has arisen around how protein knots form. We build on results of previous computer simulations and prior theories of protein knot formation to obtain theoretical pathways for protein knotting that could apply to any knotted protein. By comparing our theoretical pathways with structural data on solved proteins, we determine which of our pathways may be feasible for each of the known protein knot types.- 18 April 2019
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 116 (19) , 9360-9369
Open AccessTopological descriptions of protein folding
How knotted proteins fold has remained controversial since the identification of deeply knotted proteins nearly two decades ago. Both computational and experimental approaches have been used to investigate protein knot formation. Motivated by the computer simulations of Bölinger et al. [Bölinger D, et al. (2010) PLoS Comput Biol 6:e1000731] for the folding of the -knotted α-haloacid dehalogenase (DehI) protein, we introduce a topological description of knot folding that could describe pathways for the formation of all currently known protein knot types and predicts knot types that might be identified in the future. We analyze fingerprint data from crystal structures of protein knots as evidence that particular protein knots may fold according to specific pathways from our theory. Our results confirm Taylor’s twisted hairpin theory of knot folding for the -knotted proteins and the -knotted ketol-acid reductoisomerases and present alternative folding mechanisms for the -knotted phytochromes and the - and -knotted proteins. Significance Knotting in proteins was once considered exceedingly rare. However, systematic analyses of solved protein structures over the last two decades have demonstrated the existence of many deeply knotted proteins. Conservation of knotting across some protein families strongly suggests that knotting can be important for protein structure and function, and hence, significant interest has arisen around how protein knots form. We build on results of previous computer simulations and prior theories of protein knot formation to obtain theoretical pathways for protein knotting that could apply to any knotted protein. By comparing our theoretical pathways with structural data on solved proteins, we determine which of our pathways may be feasible for each of the known protein knot types. - 1 January 2018
- Published by International Press of Boston in Communications in Analysis and Geometry
- Vol. 26 (6) , 1223-1250
Intrinsic chirality of graphs in 3-manifolds
International Press of Boston - publishers of scholarly mathematical and scientific journals and books
- 1 January 2018
- Published by International Press of Boston in Communications in Analysis and Geometry
- Vol. 26 (6) , 1223-1250
Intrinsic chirality of graphs in 3-manifolds
International Press of Boston - publishers of scholarly mathematical and scientific journals and books
- 1 December 2017
- Published by Tokyo Journal of Mathematics in Tokyo Journal of Mathematics
- Vol. 40 (2) , 393-420
Ravels Arising from Montesinos Tangles
Project Euclid - mathematics and statistics online
- 1 December 2017
- Published by Tokyo Journal of Mathematics in Tokyo Journal of Mathematics
- Vol. 40 (2) , 393-420
Ravels Arising from Montesinos Tangles
Project Euclid - mathematics and statistics online