University of Minnesota Twin Cities - Mathematics
Postdoctoral Research Associate at Michigan State University
Higher Education
Shelley
Kandola
Lansing, Michigan Area
I graduated from St. Lawrence University in 2013 with an honors B.S. in Computer Science and Mathematics. I am recently finished my Ph.D. in Mathematics at the University of Minnesota, and I will be starting as a postdoc at Michigan State University in August. My research interests include topological data analysis, topological robotics, and digital topology.
imPress Associate
Created customized documents with a variety of desktop publishing software
Quantitative Resource Center Mentor
Provide mathematical and computational support for peers on-campus seeking support for coursework and research projects
Information Technology HelpDesk Assistant
Troubleshoot network hardware and software issues for campus-supported technologies
Graduate Assistant
Assistant-teaching undergraduate classes, grading homework for some graduate level classes, researching relevant topics in mathematics.
Researcher
Researcher in Trustable Computing Systems: Efficient Implementations of Cryptographic Algorithms.
Postdoctoral Research Associate
Shelley worked at Michigan State University as a Postdoctoral Research Associate
Doctor of Philosophy (PhD)
Mathematics
Written and presented an expository paper on topological complexity for my doctoral oral prelim.
High School Diploma
In 11th grade, I received 2nd place at the Massachusetts State Science Fair at MIT for comparing the exhausts of biodiesels derived from different plant oils.
I acted in 17 plays during my time at FA, earning the Theatrical Distinction award my final year.
B.S.
Computer Science, Mathematics
Studied computer science and mathematics while participating in and leading the math club and the technology-themed on-campus housing. Held part time jobs in tutoring and in information technology.
Quantitative Resource Center Mentor
Provide mathematical and computational support for peers on-campus seeking support for coursework and research projects
Information Technology HelpDesk Assistant
Troubleshoot network hardware and software issues for campus-supported technologies
Graduate Assistant
Assistant-teaching undergraduate classes, grading homework for some graduate level classes, researching relevant topics in mathematics.
arXiv.org
My senior honors thesis in mathematics at St. Lawrence University under Sam Vandervelde; I found an application of the Banach-Tarski paradox for the real number line.
arXiv.org
My senior honors thesis in mathematics at St. Lawrence University under Sam Vandervelde; I found an application of the Banach-Tarski paradox for the real number line.
arXiv.org
My senior honors thesis in mathematics at St. Lawrence University under Sam Vandervelde; I found an application of the Banach-Tarski paradox for the real number line.
arXiv.org
My senior honors thesis in mathematics at St. Lawrence University under Sam Vandervelde; I found an application of the Banach-Tarski paradox for the real number line.
arxiv.org
In this paper, we examine how topological complexity, simplicial complexity, discrete topological complexity, and combinatorial complexity compare when applied to models of $S^1$. We prove that the topological complexity of non-minimal finite models of $S^1$ can be less-than-or-equal-to 3, and that the TC of the minimal finite model of any $n$-sphere is equal to 4 for $n \geq 1$. We show the former using properties of the LS-category, and we show the latter by proving that the TC of the non-Hausdorff suspension of any finite connected $T_0$ space is equal to 4. We also prove a result about the topological complexity of non-Hausdorff joins of discrete finite spaces, allowing us to exhibit spaces weakly homotopy equivalent to a wedge of circles with arbitrarily high TC.
arxiv.org
In this paper, we examine how topological complexity, simplicial complexity, discrete topological complexity, and combinatorial complexity compare when applied to models of $S^1$. We prove that the topological complexity of non-minimal finite models of $S^1$ can be less-than-or-equal-to 3, and that the TC of the minimal finite model of any $n$-sphere is equal to 4 for $n \geq 1$. We show the former using properties of the LS-category, and we show the latter by proving that the TC of the non-Hausdorff suspension of any finite connected $T_0$ space is equal to 4. We also prove a result about the topological complexity of non-Hausdorff joins of discrete finite spaces, allowing us to exhibit spaces weakly homotopy equivalent to a wedge of circles with arbitrarily high TC.